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
|
"""Ordered dictionaries classes used for indices"""
from types import DictType, TupleType
from string import join, split, atol
from bisect import bisect
try:
from sys import version_info
except ImportError:
version_info = ( 0, 0 ) # a really early version
if version_info < (2, 2):
class OrderedDict:
def __init__(self, **kwargs):
self.__dict = {}
self.__keys = []
self.__dirty = 1
self.__sortingFun = cmp
if kwargs:
self.update(kwargs)
self.__dirty = 1
def __len__(self): return len(self.__dict)
def __getitem__(self, key): return self.__dict[key]
def __setitem__(self, key, value):
if not self.__dict.has_key(key):
self.__keys.append(key)
self.__dict[key] = value
self.__dirty = 1
def __repr__(self):
if self.__dirty: self.__order()
return repr(self.__dict)
def __str__(self):
if self.__dirty: self.__order()
return str(self.__dict)
def __delitem__(self, key):
if self.__dict.has_key(key):
self.__keys.remove(key)
del self.__dict[key]
self.__dirty = 1
__delattr__ = __delitem__
def clear(self):
self.__dict.clear()
self.__keys = []
self.__dirty = 1
def get(self, key, default=None): return self.__dict.get(key, default)
def has_key(self, key): return self.__dict.has_key(key)
def keys(self):
if self.__dirty: self.__order()
return list(self.__keys)
def values(self):
if self.__dirty: self.__order()
return map(lambda k, d=self.__dict: d[k], self.__keys)
def items(self):
if self.__dirty: self.__order()
return map(lambda k, d=self.__dict: (k, d[k]), self.__keys)
def update(self, d):
map(lambda (k, v), self=self: self.__setitem__(k, v), d.items())
def __order(self):
if self.__sortingFun:
self.__keys.sort(self.__sortingFun)
d = {}
for k in self.__keys:
d[len(k)] = 1
l = d.keys()
l.sort(); l.reverse()
self.__keysLens = tuple(l)
self.__dirty = 0
def setSortingFun(self, fun):
self.__sortingFun = fun
self.__dirty = 1
def nextKey(self, key):
keys = self.keys()
if self.has_key(key):
nextIdx = keys.index(key) + 1
else:
nextIdx = bisect(keys, key)
if nextIdx < len(keys):
return keys[nextIdx]
else:
raise KeyError(key)
def getKeysLens(self):
if self.__dirty:
self.__order()
return self.__keysLens
else:
class OrderedDict(DictType):
def __init__(self, **kwargs):
self.__keys = []
self.__dirty = 1
self.__sortingFun = cmp
super(OrderedDict, self).__init__()
if kwargs:
self.update(kwargs)
def __setitem__(self, key, value):
if not self.has_key(key):
self.__keys.append(key)
super(OrderedDict, self).__setitem__(key, value)
self.__dirty = 1
def __repr__(self):
if self.__dirty: self.__order()
return super(OrderedDict, self).__repr__()
def __str__(self):
if self.__dirty: self.__order()
return super(OrderedDict, self).__str__()
def __delitem__(self, key):
if super(OrderedDict, self).has_key(key):
self.__keys.remove(key)
super(OrderedDict, self).__delitem__(key)
self.__dirty = 1
__delattr__ = __delitem__
def clear(self):
super(OrderedDict, self).clear()
self.__keys = []
self.__dirty = 1
def keys(self):
if self.__dirty: self.__order()
return list(self.__keys)
def values(self):
if self.__dirty: self.__order()
return map(lambda k, d=self: d[k], self.__keys)
def items(self):
if self.__dirty: self.__order()
return map(lambda k, d=self: (k, d[k]), self.__keys)
def update(self, d):
map(lambda (k, v), self=self: self.__setitem__(k, v), d.items())
def __order(self):
if self.__sortingFun:
self.__keys.sort(self.__sortingFun)
d = {}
for k in self.__keys:
d[len(k)] = 1
l = d.keys()
l.sort(); l.reverse()
self.__keysLens = tuple(l)
self.__dirty = 0
def setSortingFun(self, fun):
self.__sortingFun = fun
self.__dirty = 1
def nextKey(self, key):
keys = self.keys()
if self.has_key(key):
nextIdx = keys.index(key) + 1
else:
nextIdx = bisect(keys, key)
if nextIdx < len(keys):
return keys[nextIdx]
else:
raise KeyError(key)
def getKeysLens(self):
if self.__dirty:
self.__order()
return self.__keysLens
class OidOrderedDict(OrderedDict):
def __init__(self, **kwargs):
self.__keysCache = {}
apply(OrderedDict.__init__, [self], kwargs)
self.setSortingFun(lambda o1, o2, self=self: cmp(
self.__keysCache[o1], self.__keysCache[o2]))
def __setitem__(self, key, value):
if not self.__keysCache.has_key(key):
if type(key) == TupleType:
self.__keysCache[key] = key
else:
self.__keysCache[key] = map(
lambda x: atol(x), filter(None, split(key, '.'))
)
OrderedDict.__setitem__(self, key, value)
def __delitem__(self, key):
if self.__keysCache.has_key(key):
del self.__keysCache[key]
OrderedDict.__delitem__(self, key)
__delattr__ = __delitem__
|
