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
|
import unittest
from common import gtk
class ListStoreTest(unittest.TestCase):
def testConstructor(self):
self.assertRaises(TypeError, gtk.ListStore)
def testInsert(self):
store = gtk.ListStore(int)
# Old way, with iters
store.set_value(store.insert(0), 0, 2)
self.assertEqual(len(store), 1)
self.assertEqual(store[0][0], 2)
# New way
store.insert(0, (1,))
self.assertEqual(len(store), 2)
self.assertEqual(store[0][0], 1)
self.assertEqual(store[1][0], 2)
# TreeSortable, but...
def testSetDefaultSortFunc(self):
store = gtk.ListStore(int)
self.failIf(store.has_default_sort_func())
store.set_default_sort_func(lambda x: None)
store.set_sort_column_id(0, gtk.SORT_ASCENDING)
self.failUnless(store.has_default_sort_func())
store.set_default_sort_func(None)
self.failIf(store.has_default_sort_func())
# Two tests for bug 537459. Since it is a memory corruption, we
# use a large loop count hoping to trigger a segfault.
def testNegativeIndexGet(self):
store = gtk.ListStore(int)
for i in range(200):
store.append((i,))
self.assertEqual(store[-1][0], i)
def testNegativeIndexSet(self):
store = gtk.ListStore(int)
for i in range(200):
store.append((i,))
del store[-1]
self.assert_(len(store) == 0)
if __name__ == '__main__':
unittest.main()
|
