/
odict.py
190 lines (137 loc) · 4.75 KB
/
odict.py
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
# -*- coding: UTF-8 -*-
# Copyright (C) 2009 J. David Ibáñez <jdavid.ibp@gmail.com>
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
"""
This module implements an ordered dictionary, to be removed by Python 2.7
"""
class DNode(object):
"""This class makes the nodes of a doubly-linked list.
"""
__slots__ = ['prev', 'next', 'key']
def __init__(self, key):
self.key = key
class OrderedDict(dict):
def __init__(self, items=None):
# The doubly-linked list
self.first = None
self.last = None
# Map from key-to-node
self.key2node = {}
if items is not None:
for key, value in items:
self[key] = value
def _check_integrity(self):
"""This method is for testing purposes, it checks the internal
data structures are consistent.
"""
keys = self.keys()
keys.sort()
# Check the key-to-node mapping
keys2 = self.key2node.keys()
keys2.sort()
assert keys == keys2
# Check the key-to-node against the doubly-linked list
for key, node in self.key2node.iteritems():
assert type(key) is type(node.key)
assert key == node.key
# Check the doubly-linked list against the cache
keys = set(keys)
node = self.first
while node is not None:
assert node.key in keys
keys.discard(node.key)
node = node.next
assert len(keys) == 0
def _append(self, key):
node = DNode(key)
# (1) Insert into the key-to-node map
self.key2node[key] = node
# (2) Append to the doubly-linked list
node.prev = self.last
node.next = None
if self.first is None:
self.first = node
else:
self.last.next = node
self.last = node
def _remove(self, key):
# (1) Pop the node from the key-to-node map
node = self.key2node.pop(key)
# (2) Remove from the doubly-linked list
if node.prev is None:
self.first = node.next
else:
node.prev.next = node.next
if node.next is None:
self.last = node.prev
else:
node.next.prev = node.prev
######################################################################
# Override dict API
def __iter__(self):
node = self.first
while node is not None:
yield node.key
node = node.next
def __setitem__(self, key, value):
dict.__setitem__(self, key, value)
self._append(key)
def __delitem__(self, key):
self._remove(key)
dict.__delitem__(self, key)
def clear(self):
dict.clear(self)
self.key2node.clear()
self.first = self.last = None
def copy(self):
message = "use 'copy.deepcopy' to copy an ordered dict"
raise NotImplementedError, message
def fromkeys(self, seq, value=None):
raise NotImplementedError, "the 'fromkeys' method is not supported"
def items(self):
return list(self.iteritems())
def iteritems(self):
node = self.first
while node is not None:
yield node.key, self[node.key]
node = node.next
def iterkeys(self):
node = self.first
while node is not None:
yield node.key
node = node.next
def itervalues(self):
node = self.first
while node is not None:
yield self[node.key]
node = node.next
def keys(self):
return list(self.iterkeys())
def pop(self, key):
self._remove(key)
return dict.pop(self, key)
def popitem(self):
if self.first is None:
raise KeyError, 'popitem(): ordered dict is empty'
key = self.first.key
value = self[key]
del self[key]
return (key, value)
def setdefault(self, key, default=None):
raise NotImplementedError, "the 'setdefault' method is not supported"
def update(self, value=None, **kw):
raise NotImplementedError, "the 'update' method is not supported"
def values(self):
return list(self.itervalues())