1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
public class Roster : Object {
private int stamp;
private Gee.TreeMap<string, Contact> entries = new Gee.TreeMap<string, Contact>();
private Gee.TreeMap<string, RosterGroup> groups = new Gee.TreeMap<string, RosterGroup>();
public Roster() {
stamp = 0;
groups["default"] = new RosterGroup(this);
}
public Gtk.TreeModel get_default_group() {
return groups["default"];
}
public void update_contact(Contact c) {
entries[c.jid] = c;
groups["default"].update_contact(c);
}
private class RosterGroup : Object, Gtk.TreeModel {
private unowned Roster roster {get; set;}
private Gee.TreeMap<string, Contact> entries = new Gee.TreeMap<string, Contact>();
public RosterGroup(Roster roster0) {
roster = roster0;
}
public void update_contact(Contact c) {
bool added = !entries.has_key(c.jid);
entries[c.jid] = c;
Gtk.TreeIter iter = Gtk.TreeIter();
iter.stamp = roster.stamp;
iter.user_data = this;
iter.user_data2 = c;
Gtk.TreePath path = get_path(iter);
if (added)
row_inserted(path, iter);
else
row_changed(path, iter);
}
public Type get_column_type (int index) {
switch(index) {
case 0:
return typeof(Contact);
}
return Type.INVALID;
}
public Gtk.TreeModelFlags get_flags () {
return Gtk.TreeModelFlags.LIST_ONLY;
}
public bool get_iter (out Gtk.TreeIter iter, Gtk.TreePath path) {
if(path.get_depth() != 1)
return false;
int index = path.get_indices()[0];
if(index < 0 || index >= entries.size)
return false;
Gee.MapIterator<string, Contact> it = entries.map_iterator();
it.first();
for(int i = 0; i < index; ++i)
it.next();
iter.stamp = roster.stamp;
iter.user_data = this;
iter.user_data2 = it.get_value();
return true;
}
public int get_n_columns () {
return 1;
}
public Gtk.TreePath get_path (Gtk.TreeIter iter) {
if(iter.stamp != roster.stamp || iter.user_data != this)
return (Gtk.TreePath)null;
int index = 0;
foreach(Contact c in entries.values) {
if(c == iter.user_data2)
break;
++index;
}
return new Gtk.TreePath.from_indices(index, -1);
}
public void get_value (Gtk.TreeIter iter, int column, out Value value) {
if (column != 0 || iter.stamp != roster.stamp || iter.user_data != this)
return;
Contact c = iter.user_data2 as Contact;
value = Value(typeof(Contact));
value.take_object(c);
}
public bool iter_children (out Gtk.TreeIter iter, Gtk.TreeIter? parent) {
if (parent != null) {
iter.stamp = -1;
return false;
}
return get_iter(out iter, new Gtk.TreePath.from_indices(0, -1));
}
public bool iter_has_child (Gtk.TreeIter iter) {
return false;
}
public int iter_n_children (Gtk.TreeIter? iter) {
if (iter == null)
return entries.size;
else
return 0;
}
public bool iter_next (ref Gtk.TreeIter iter) {
if(iter.stamp != roster.stamp || iter.user_data != this)
return false;
bool next = false;
foreach(Contact c in entries.values) {
if(next) {
iter.user_data2 = c;
return true;
}
if(c == iter.user_data2)
next = true;
}
iter.stamp = -1;
return false;
}
public bool iter_nth_child (out Gtk.TreeIter iter, Gtk.TreeIter? parent, int n) {
if (parent != null) {
iter.stamp = -1;
return false;
}
return get_iter(out iter, new Gtk.TreePath.from_indices(n, -1));
}
public bool iter_parent (out Gtk.TreeIter iter, Gtk.TreeIter child) {
iter.stamp = -1;
return false;
}
public void ref_node (Gtk.TreeIter iter) {}
public void unref_node (Gtk.TreeIter iter) {}
}
}
|
