1 """A more or less complete user-defined wrapper around dictionary objects."""
4 def __init__(self, dict=None, **kwargs):
10 def __repr__(self): return repr(self.data)
11 def __cmp__(self, dict):
12 if isinstance(dict, UserDict):
13 return cmp(self.data, dict.data)
15 return cmp(self.data, dict)
16 def __len__(self): return len(self.data)
17 def __getitem__(self, key):
20 if hasattr(self.__class__, "__missing__"):
21 return self.__class__.__missing__(self, key)
23 def __setitem__(self, key, item): self.data[key] = item
24 def __delitem__(self, key): del self.data[key]
25 def clear(self): self.data.clear()
27 if self.__class__ is UserDict:
28 return UserDict(self.data.copy())
38 def keys(self): return self.data.keys()
39 def items(self): return self.data.items()
40 def iteritems(self): return self.data.iteritems()
41 def iterkeys(self): return self.data.iterkeys()
42 def itervalues(self): return self.data.itervalues()
43 def values(self): return self.data.values()
44 def has_key(self, key): return self.data.has_key(key)
45 def update(self, dict=None, **kwargs):
48 elif isinstance(dict, UserDict):
49 self.data.update(dict.data)
50 elif isinstance(dict, type({})) or not hasattr(dict, 'items'):
51 self.data.update(dict)
53 for k, v in dict.items():
56 self.data.update(kwargs)
57 def get(self, key, failobj=None):
58 if not self.has_key(key):
61 def setdefault(self, key, failobj=None):
62 if not self.has_key(key):
65 def pop(self, key, *args):
66 return self.data.pop(key, *args)
68 return self.data.popitem()
69 def __contains__(self, key):
70 return key in self.data
72 def fromkeys(cls, iterable, value=None):
78 class IterableUserDict(UserDict):
80 return iter(self.data)
83 # Mixin defining all dictionary methods for classes that already have
84 # a minimum dictionary interface including getitem, setitem, delitem,
85 # and keys. Without knowledge of the subclass constructor, the mixin
86 # does not define __init__() or copy(). In addition to the four base
87 # methods, progressively more efficiency comes with defining
88 # __contains__(), __iter__(), and iteritems().
90 # second level definitions support higher levels
94 def has_key(self, key):
100 def __contains__(self, key):
101 return self.has_key(key)
103 # third level takes advantage of second level definitions
108 return self.__iter__()
110 # fourth level uses definitions from lower levels
111 def itervalues(self):
112 for _, v in self.iteritems():
115 return [v for _, v in self.iteritems()]
117 return list(self.iteritems())
119 for key in self.keys():
121 def setdefault(self, key, default=None):
127 def pop(self, key, *args):
129 raise TypeError, "pop expected at most 2 arguments, got "\
130 + repr(1 + len(args))
141 k, v = self.iteritems().next()
142 except StopIteration:
143 raise KeyError, 'container is empty'
146 def update(self, other=None, **kwargs):
147 # Make progressively weaker assumptions about "other"
150 elif hasattr(other, 'iteritems'): # iteritems saves memory and lookups
151 for k, v in other.iteritems():
153 elif hasattr(other, 'keys'):
154 for k in other.keys():
161 def get(self, key, default=None):
167 return repr(dict(self.iteritems()))
168 def __cmp__(self, other):
171 if isinstance(other, DictMixin):
172 other = dict(other.iteritems())
173 return cmp(dict(self.iteritems()), other)
175 return len(self.keys())