1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/lib/UserDict.py Tue Aug 30 21:55:58 2016 +0200
1.3 @@ -0,0 +1,176 @@
1.4 +"""A more or less complete user-defined wrapper around dictionary objects."""
1.5 +
1.6 +class UserDict:
1.7 + def __init__(self, dict=None, **kwargs):
1.8 + self.data = {}
1.9 + if dict is not None:
1.10 + self.update(dict)
1.11 + if len(kwargs):
1.12 + self.update(kwargs)
1.13 + def __repr__(self): return repr(self.data)
1.14 + def __cmp__(self, dict):
1.15 + if isinstance(dict, UserDict):
1.16 + return cmp(self.data, dict.data)
1.17 + else:
1.18 + return cmp(self.data, dict)
1.19 + __hash__ = None # Avoid Py3k warning
1.20 + def __len__(self): return len(self.data)
1.21 + def __getitem__(self, key):
1.22 + if key in self.data:
1.23 + return self.data[key]
1.24 + if hasattr(self.__class__, "__missing__"):
1.25 + return self.__class__.__missing__(self, key)
1.26 + raise KeyError(key)
1.27 + def __setitem__(self, key, item): self.data[key] = item
1.28 + def __delitem__(self, key): del self.data[key]
1.29 + def clear(self): self.data.clear()
1.30 + def copy(self):
1.31 + if self.__class__ is UserDict:
1.32 + return UserDict(self.data.copy())
1.33 + import copy
1.34 + data = self.data
1.35 + try:
1.36 + self.data = {}
1.37 + c = copy.copy(self)
1.38 + finally:
1.39 + self.data = data
1.40 + c.update(self)
1.41 + return c
1.42 + def keys(self): return self.data.keys()
1.43 + def items(self): return self.data.items()
1.44 + def iteritems(self): return self.data.iteritems()
1.45 + def iterkeys(self): return self.data.iterkeys()
1.46 + def itervalues(self): return self.data.itervalues()
1.47 + def values(self): return self.data.values()
1.48 + def has_key(self, key): return key in self.data
1.49 + def update(self, dict=None, **kwargs):
1.50 + if dict is None:
1.51 + pass
1.52 + elif isinstance(dict, UserDict):
1.53 + self.data.update(dict.data)
1.54 + elif isinstance(dict, type({})) or not hasattr(dict, 'items'):
1.55 + self.data.update(dict)
1.56 + else:
1.57 + for k, v in dict.items():
1.58 + self[k] = v
1.59 + if len(kwargs):
1.60 + self.data.update(kwargs)
1.61 + def get(self, key, failobj=None):
1.62 + if key not in self:
1.63 + return failobj
1.64 + return self[key]
1.65 + def setdefault(self, key, failobj=None):
1.66 + if key not in self:
1.67 + self[key] = failobj
1.68 + return self[key]
1.69 + def pop(self, key, *args):
1.70 + return self.data.pop(key, *args)
1.71 + def popitem(self):
1.72 + return self.data.popitem()
1.73 + def __contains__(self, key):
1.74 + return key in self.data
1.75 + @classmethod
1.76 + def fromkeys(cls, iterable, value=None):
1.77 + d = cls()
1.78 + for key in iterable:
1.79 + d[key] = value
1.80 + return d
1.81 +
1.82 +class IterableUserDict(UserDict):
1.83 + def __iter__(self):
1.84 + return iter(self.data)
1.85 +
1.86 +class DictMixin:
1.87 + # Mixin defining all dictionary methods for classes that already have
1.88 + # a minimum dictionary interface including getitem, setitem, delitem,
1.89 + # and keys. Without knowledge of the subclass constructor, the mixin
1.90 + # does not define __init__() or copy(). In addition to the four base
1.91 + # methods, progressively more efficiency comes with defining
1.92 + # __contains__(), __iter__(), and iteritems().
1.93 +
1.94 + # second level definitions support higher levels
1.95 + def __iter__(self):
1.96 + for k in self.keys():
1.97 + yield k
1.98 + def has_key(self, key):
1.99 + try:
1.100 + self[key]
1.101 + except KeyError:
1.102 + return False
1.103 + return True
1.104 + def __contains__(self, key):
1.105 + return self.has_key(key)
1.106 +
1.107 + # third level takes advantage of second level definitions
1.108 + def iteritems(self):
1.109 + for k in self:
1.110 + yield (k, self[k])
1.111 + def iterkeys(self):
1.112 + return self.__iter__()
1.113 +
1.114 + # fourth level uses definitions from lower levels
1.115 + def itervalues(self):
1.116 + for _, v in self.iteritems():
1.117 + yield v
1.118 + def values(self):
1.119 + return [v for _, v in self.iteritems()]
1.120 + def items(self):
1.121 + return list(self.iteritems())
1.122 + def clear(self):
1.123 + for key in self.keys():
1.124 + del self[key]
1.125 + def setdefault(self, key, default=None):
1.126 + try:
1.127 + return self[key]
1.128 + except KeyError:
1.129 + self[key] = default
1.130 + return default
1.131 + def pop(self, key, *args):
1.132 + if len(args) > 1:
1.133 + raise TypeError, "pop expected at most 2 arguments, got "\
1.134 + + repr(1 + len(args))
1.135 + try:
1.136 + value = self[key]
1.137 + except KeyError:
1.138 + if args:
1.139 + return args[0]
1.140 + raise
1.141 + del self[key]
1.142 + return value
1.143 + def popitem(self):
1.144 + try:
1.145 + k, v = self.iteritems().next()
1.146 + except StopIteration:
1.147 + raise KeyError, 'container is empty'
1.148 + del self[k]
1.149 + return (k, v)
1.150 + def update(self, other=None, **kwargs):
1.151 + # Make progressively weaker assumptions about "other"
1.152 + if other is None:
1.153 + pass
1.154 + elif hasattr(other, 'iteritems'): # iteritems saves memory and lookups
1.155 + for k, v in other.iteritems():
1.156 + self[k] = v
1.157 + elif hasattr(other, 'keys'):
1.158 + for k in other.keys():
1.159 + self[k] = other[k]
1.160 + else:
1.161 + for k, v in other:
1.162 + self[k] = v
1.163 + if kwargs:
1.164 + self.update(kwargs)
1.165 + def get(self, key, default=None):
1.166 + try:
1.167 + return self[key]
1.168 + except KeyError:
1.169 + return default
1.170 + def __repr__(self):
1.171 + return repr(dict(self.iteritems()))
1.172 + def __cmp__(self, other):
1.173 + if other is None:
1.174 + return 1
1.175 + if isinstance(other, DictMixin):
1.176 + other = dict(other.iteritems())
1.177 + return cmp(dict(self.iteritems()), other)
1.178 + def __len__(self):
1.179 + return len(self.keys())