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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
|
# Copyright (C) 2009, Aleksey Lim
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
import gtk
import logging
from gobject import GObject, SIGNAL_RUN_FIRST, TYPE_PYOBJECT
class Source(GObject):
__gsignals__ = {
'objects-updated': (SIGNAL_RUN_FIRST, None, []),
'row-delayed-fetch': (SIGNAL_RUN_FIRST, None, 2*[TYPE_PYOBJECT]) }
def get_count(self):
""" Returns number of objects """
pass
def get_row(self, offset):
""" Get object
Returns:
objects in dict {field_name: value, ...}
False can't fint object
None wait for reply signal
"""
pass
def get_order(self):
""" Get current order, returns (field_name, gtk.SortType) """
pass
def set_order(self, field_name, sort_type):
""" Set current order """
pass
class LazyModel(gtk.GenericTreeModel):
def __init__(self, columns, calc_columns={}):
""" columns/calc_columns = {field_name: (column_num, column_type)} """
gtk.GenericTreeModel.__init__(self)
self._columns_by_name = {}
self._columns_by_num = {}
self._columns_types = {}
for name, i in columns.items():
self._columns_by_name[name] = i[0]
self._columns_by_num[i[0]] = name
self._columns_types[i[0]] = i[1]
for name, i in calc_columns.items():
self._columns_types[i[0]] = i[1]
self._n_columns = max(self._columns_types.keys()) + 1
self._source = None
self._closing = False
self._view = None
self.set_source(None, force=True)
self.set_view(None, force=True)
def on_calc_value(self, row, column):
# stub
pass
def get_source(self):
return self._source
def set_source(self, source, force=False):
if self._source == source and not force:
return
if self._source is not None:
self._source.disconnect_by_func(self.refresh)
self._source.disconnect_by_func(self._delayed_fetch_cb)
self._source = source
if self._source is not None:
self._source.connect('objects-updated', self.refresh)
self._source.connect('row-delayed-fetch', self._delayed_fetch_cb)
self.refresh()
source = property(get_source, set_source)
def get_view(self):
return self._view
def set_view(self, view, force=False):
if self._view == view and not force:
return
cursor = None
if self._view is not None:
cursor = self._view.get_cursor()
try:
self._closing = True
self._view.set_model(None)
finally:
self._closing = False
self._view = view
self._cache = {}
self._frame = (0, -1)
self._in_process = {}
self._postponed = []
self._last_count = self._source and self._source.get_count() or 0
if self._source is not None and view is not None:
self._update_columns()
view.set_model(self)
if cursor is not None:
view.set_cursor(*cursor)
view = property(get_view, set_view)
def get_order(self):
if not self._source:
return None
order = self._source.get_order()
if order is None:
return None
return (self._columns_by_name[order[0]], order[1])
def set_order(self, column, order):
if not self._source:
return
self._source.set_order(self._columns_by_num[column], order)
self._update_columns()
def refresh(self, sender=None):
if self._source is None or self._view is None:
return
if self._last_count == 0:
self.set_view(self._view, force=True)
self._update_columns()
count = self._source.get_count()
for i in range(self._last_count, count):
self.emit('row-inserted', (i,), self.get_iter((i,)))
for i in reversed(range(count, self._last_count)):
self.emit('row-deleted', (i,))
if self._frame[0] >= count:
self._frame = (0, -1)
elif self._frame[1] >= count:
for i in range(count, self._frame[1]):
if self._cache.has_key(i):
del self._cache[i]
self._frame = (self._frame[0], count-1)
self._cache = {}
for i in range(self._frame[0], self._frame[1]+1):
self.emit('row-changed', (i,), self.get_iter((i,)))
self._last_count = count
def recalc(self, fields):
for i, row in self._cache.items():
for field in fields:
if row.has_key(field):
del row[i]
self.emit('row-changed', (i,), self.get_iter((i,)))
def get_row(self, pos, frame=None):
if not self._source:
return False
if not isinstance(pos, tuple):
pos = self.get_path(pos)
return self._get_row(pos[0], frame or (pos, pos))
def _delayed_fetch_cb(self, source, offset, object):
if not self._in_process.has_key(offset):
logging.debug('_delayed_fetch_cb: no offset=%s' % offset)
return
logging.debug('_delayed_fetch_cb: get %s' % offset)
path = (offset,)
iter = self.get_iter(path)
row = Row(self, path, iter, object)
if self.in_frame(offset):
self._cache[offset] = row
del self._in_process[offset]
self.emit('row-changed', path, iter)
if self._in_process:
return
while self._postponed:
offset, force = self._postponed.pop()
if not force and not self.in_frame(offset):
continue
row = self.get_row((offset,))
if row:
self.emit('row-changed', row.path, row.iter)
else:
break
def _get_row(self, offset, frame):
def fetch():
row = self._source.get_row(offset)
if not row:
if row is not None:
logging.debug('_get_row: can not find row for %s' % offset)
return False
logging.debug('_get_row: wait for reply for %s' % offset)
self._in_process[offset] = True
return None
row = Row(self, (offset,), self.get_iter(offset), row)
self._cache[offset] = row
return row
out = self._cache.get(offset)
if out:
return out
if frame[0] >= frame[1]:
# just return requested single row and do not change cache
# if requested frame has <= 1 rows
if self._in_process:
self._postponed.append((offset, True))
return None
else:
return fetch()
if frame != self._frame:
# switch to new frame
intersect_min = max(frame[0], self._frame[0])
intersect_max = min(frame[1], self._frame[1])
if intersect_min > intersect_max:
self._cache = {}
else:
for i in range(self._frame[0], intersect_min):
if self._cache.has_key(i):
del self._cache[i]
for i in range(intersect_max+1, self._frame[1]+1):
if self._cache.has_key(i):
del self._cache[i]
self._frame = frame
if self._in_process:
self._postponed.append((offset, False))
return None
return fetch()
def _update_columns(self):
order = self.get_order()
if not order or not hasattr(self._view, 'get_columns'):
return
for column in self._view.get_columns():
if column.get_sort_column_id() == order[0]:
column.props.sort_indicator = True
column.props.sort_order = order[1]
else:
column.props.sort_indicator = False
def in_frame(self, offset):
return offset >= self._frame[0] and offset <= self._frame[1]
# interface implementation -------------------------------------------------
def on_get_n_columns(self):
return self._n_columns
def on_get_column_type(self, index):
return self._columns_types.get(index, bool)
def on_iter_n_children(self, iter):
if iter is None and not self._closing:
return self._source.get_count()
else:
return 0
def on_get_value(self, offset, column):
if not self._view or offset >= self._source.get_count():
return None
# return value only if iter came from visible range
# (on setting model, gtk.TreeView scans all items)
range = self._view.get_visible_range()
if range and offset >= range[0][0] and offset <= range[1][0]:
row = self._get_row(offset, (range[0][0], range[1][0]))
return row and row[column]
return None
def on_iter_nth_child(self, iter, n):
return n
def on_get_path(self, iter):
return (iter)
def on_get_iter(self, path):
if self._source.get_count() and not self._closing:
return path[0]
else:
return False
def on_iter_next(self, iter):
if iter != None:
if iter >= self._source.get_count() - 1 or self._closing:
return None
return iter + 1
return None
def on_get_flags(self):
return gtk.TREE_MODEL_ITERS_PERSIST | gtk.TREE_MODEL_LIST_ONLY
def on_iter_children(self, iter):
return None
def on_iter_has_child(self, iter):
return False
def on_iter_parent(self, iter):
return None
class Row:
def __init__(self, model, path, iter, object):
self.model = model
self.iter = iter
self.path = path
self.object = object
self.row = [None] * len(model._columns_by_name)
self._calced_row = {}
for name, value in object.items():
column = model._columns_by_name.get(str(name), -1)
if column != -1:
self.row[column] = value
def __getitem__(self, key):
if isinstance(key, int):
if key < len(self.row):
return self.row[key]
else:
if self._calced_row.has_key(key):
return self._calced_row[key]
else:
value = self.model.on_calc_value(self, key)
if value is not None:
self._calced_row[key] = value
return value
else:
return self.object[key]
def __setitem__(self, key, value):
if isinstance(key, int):
if key < len(self.row):
self.row[key] = value
else:
self._calced_row[key] = value
else:
self.object[key] = value
def __delitem__(self, key):
if isinstance(key, int):
if key < len(self.row):
del self.row[key]
else:
del self._calced_row[key]
else:
del self.object[key]
def __contains__(self, key):
if isinstance(key, int):
return key < len(self.row)
else:
return self.object.__contains__(key)
def has_key(self, key):
return self.__contains__(key)
def get(self, key, default=None):
if self.has_key(key):
return self.__getitem__(key)
else:
return default
|