blob: b561ac13a3116689c0b9f31c5950dbf6945d77d3 [file] [log] [blame]
Guido van Rossum3eccc481999-03-26 15:32:05 +00001# Check every path through every method of UserDict
2
Barry Warsaw04f357c2002-07-23 19:04:11 +00003from test.test_support import verify, verbose
Guido van Rossum288cd2c2001-08-07 17:50:06 +00004from UserDict import UserDict, IterableUserDict
Guido van Rossum3eccc481999-03-26 15:32:05 +00005
6d0 = {}
7d1 = {"one": 1}
8d2 = {"one": 1, "two": 2}
9
10# Test constructors
11
12u = UserDict()
13u0 = UserDict(d0)
14u1 = UserDict(d1)
Guido van Rossum288cd2c2001-08-07 17:50:06 +000015u2 = IterableUserDict(d2)
Guido van Rossum3eccc481999-03-26 15:32:05 +000016
17uu = UserDict(u)
18uu0 = UserDict(u0)
19uu1 = UserDict(u1)
20uu2 = UserDict(u2)
21
Raymond Hettinger54405452002-11-22 00:07:40 +000022verify(UserDict(one=1, two=2) == d2) # keyword arg constructor
23verify(UserDict([('one',1), ('two',2)]) == d2) # item sequence constructor
24
Guido van Rossum3eccc481999-03-26 15:32:05 +000025# Test __repr__
26
Marc-André Lemburg36619082001-01-17 19:11:13 +000027verify(str(u0) == str(d0))
28verify(repr(u1) == repr(d1))
29verify(`u2` == `d2`)
Guido van Rossum3eccc481999-03-26 15:32:05 +000030
31# Test __cmp__ and __len__
32
33all = [d0, d1, d2, u, u0, u1, u2, uu, uu0, uu1, uu2]
34for a in all:
35 for b in all:
Marc-André Lemburg36619082001-01-17 19:11:13 +000036 verify(cmp(a, b) == cmp(len(a), len(b)))
Guido van Rossum3eccc481999-03-26 15:32:05 +000037
38# Test __getitem__
39
Marc-André Lemburg36619082001-01-17 19:11:13 +000040verify(u2["one"] == 1)
Guido van Rossum3eccc481999-03-26 15:32:05 +000041try:
42 u1["two"]
43except KeyError:
44 pass
45else:
Marc-André Lemburg36619082001-01-17 19:11:13 +000046 verify(0, "u1['two'] shouldn't exist")
Guido van Rossum3eccc481999-03-26 15:32:05 +000047
48# Test __setitem__
49
50u3 = UserDict(u2)
51u3["two"] = 2
52u3["three"] = 3
53
54# Test __delitem__
55
56del u3["three"]
57try:
58 del u3["three"]
59except KeyError:
60 pass
61else:
Marc-André Lemburg36619082001-01-17 19:11:13 +000062 verify(0, "u3['three'] shouldn't exist")
Guido van Rossum3eccc481999-03-26 15:32:05 +000063
64# Test clear
65
66u3.clear()
Marc-André Lemburg36619082001-01-17 19:11:13 +000067verify(u3 == {})
Guido van Rossum3eccc481999-03-26 15:32:05 +000068
69# Test copy()
70
71u2a = u2.copy()
Marc-André Lemburg36619082001-01-17 19:11:13 +000072verify(u2a == u2)
Guido van Rossum3eccc481999-03-26 15:32:05 +000073
74class MyUserDict(UserDict):
75 def display(self): print self
76
77m2 = MyUserDict(u2)
78m2a = m2.copy()
Marc-André Lemburg36619082001-01-17 19:11:13 +000079verify(m2a == m2)
Guido van Rossum3eccc481999-03-26 15:32:05 +000080
Fred Drake52628672001-11-05 17:41:48 +000081# SF bug #476616 -- copy() of UserDict subclass shared data
82m2['foo'] = 'bar'
83verify(m2a != m2)
84
Guido van Rossum3eccc481999-03-26 15:32:05 +000085# Test keys, items, values
86
Marc-André Lemburg36619082001-01-17 19:11:13 +000087verify(u2.keys() == d2.keys())
88verify(u2.items() == d2.items())
89verify(u2.values() == d2.values())
Guido van Rossum3eccc481999-03-26 15:32:05 +000090
Tim Petersa3f98d62001-04-21 09:13:15 +000091# Test has_key and "in".
Guido van Rossum3eccc481999-03-26 15:32:05 +000092
93for i in u2.keys():
Marc-André Lemburg36619082001-01-17 19:11:13 +000094 verify(u2.has_key(i) == 1)
Tim Petersa3f98d62001-04-21 09:13:15 +000095 verify((i in u2) == 1)
Marc-André Lemburg36619082001-01-17 19:11:13 +000096 verify(u1.has_key(i) == d1.has_key(i))
Tim Petersa3f98d62001-04-21 09:13:15 +000097 verify((i in u1) == (i in d1))
Marc-André Lemburg36619082001-01-17 19:11:13 +000098 verify(u0.has_key(i) == d0.has_key(i))
Tim Petersa3f98d62001-04-21 09:13:15 +000099 verify((i in u0) == (i in d0))
Guido van Rossum3eccc481999-03-26 15:32:05 +0000100
101# Test update
102
103t = UserDict()
104t.update(u2)
Marc-André Lemburg36619082001-01-17 19:11:13 +0000105verify(t == u2)
Guido van Rossum3eccc481999-03-26 15:32:05 +0000106
107# Test get
108
109for i in u2.keys():
Marc-André Lemburg36619082001-01-17 19:11:13 +0000110 verify(u2.get(i) == u2[i])
111 verify(u1.get(i) == d1.get(i))
112 verify(u0.get(i) == d0.get(i))
Tim Petersa3f98d62001-04-21 09:13:15 +0000113
114# Test "in" iteration.
115for i in xrange(20):
116 u2[i] = str(i)
117ikeys = []
118for k in u2:
119 ikeys.append(k)
120ikeys.sort()
121keys = u2.keys()
122keys.sort()
123verify(ikeys == keys)
Raymond Hettinger903bf902002-11-15 08:39:40 +0000124
125##########################
126# Test Dict Mixin
127
128from UserDict import DictMixin
129
130class SeqDict(DictMixin):
131 """Dictionary lookalike implemented with lists.
132
133 Used to test and demonstrate DictMixin
134 """
135 def __init__(self):
136 self.keylist = []
137 self.valuelist = []
138 def __getitem__(self, key):
139 try:
140 i = self.keylist.index(key)
141 except ValueError:
142 raise KeyError
143 return self.valuelist[i]
144 def __setitem__(self, key, value):
145 self.keylist.append(key)
146 self.valuelist.append(value)
147 def __delitem__(self, key):
148 try:
149 i = self.keylist.index(key)
150 except ValueError:
151 raise KeyError
152 self.keylist.pop(i)
153 self.valuelist.pop(i)
154 def keys(self):
155 return list(self.keylist)
156
157## Setup test and verify working of the test class
158s = SeqDict() # check init
159s[10] = 'ten' # exercise setitem
160s[20] = 'twenty'
161s[30] = 'thirty'
162del s[20] # exercise delitem
163verify(s[10] == 'ten') # check getitem and setitem
164verify(s.keys() == [10, 30]) # check keys() and delitem
165
166## Now, test the DictMixin methods one by one
167verify(s.has_key(10)) # has_key
168verify(not s.has_key(20))
169
170verify(10 in s) # __contains__
171verify(20 not in s)
172
173verify([k for k in s] == [10, 30]) # __iter__
174
175verify(len(s) == 2) # __len__
176
177verify(list(s.iteritems()) == [(10,'ten'), (30, 'thirty')]) # iteritems
178
179verify(list(s.iterkeys()) == [10, 30]) # iterkeys
180
181verify(list(s.itervalues()) == ['ten', 'thirty']) # itervalues
182
183verify(s.values() == ['ten', 'thirty']) # values
184
185verify(s.items() == [(10,'ten'), (30, 'thirty')]) # items
186
187verify(s.get(10) == 'ten') # get
188verify(s.get(15,'fifteen') == 'fifteen')
189verify(s.get(15) == None)
190
191verify(s.setdefault(40, 'forty') == 'forty') # setdefault
192verify(s.setdefault(10, 'null') == 'ten')
193del s[40]
194
195verify(s.pop(10) == 'ten') # pop
196verify(10 not in s)
197s[10] = 'ten'
198
199k, v = s.popitem() # popitem
200verify(k not in s)
201s[k] = v
202
203s.clear() # clear
204verify(len(s) == 0)
205
206try: # empty popitem
207 s.popitem()
208except KeyError:
209 pass
210else:
211 verify(0, "popitem from an empty list should raise KeyError")
212
213s.update({10: 'ten', 20:'twenty'}) # update
214verify(s[10]=='ten' and s[20]=='twenty')
215
Raymond Hettinger8ddc176e2002-11-18 04:34:10 +0000216verify(s == {10: 'ten', 20:'twenty'}) # cmp
217t = SeqDict()
218t[20] = 'twenty'
219t[10] = 'ten'
220verify(s == t)