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
|
# OrderedDict.py
#
# This class functions almost exactly like UserDict. However, when using
# the sequence methods, it returns items in the same order in which they
# were added, instead of some random order.
#
# Copyright 2001 Adam Heath <doogie@debian.org>
#
# This file 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 2 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, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
from UserDict import UserDict
class OrderedDict(UserDict):
__order=[]
def __init__(self, dict=None):
UserDict.__init__(self)
self.__order=[]
if dict is not None and dict.__class__ is not None:
self.update(dict)
def __cmp__(self, dict):
if isinstance(dict, OrderedDict):
ret=cmp(self.__order, dict.__order)
if not ret:
ret=UserDict.__cmp__(self, dict)
return ret
else:
return UserDict.__cmp__(self, dict)
def __setitem__(self, key, value):
if not self.has_key(key):
self.__order.append(key)
UserDict.__setitem__(self, key, value)
def __delitem__(self, key):
if self.has_key(key):
del self.__order[self.__order.index(key)]
UserDict.__delitem__(self, key)
def clear(self):
self.__order=[]
UserDict.clear(self)
def copy(self):
if self.__class__ is OrderedDict:
return OrderedDict(self)
import copy
return copy.copy(self)
def keys(self):
return self.__order
def items(self):
return map(lambda x, self=self: (x, self.__getitem__(x)), self.__order)
def values(self):
return map(lambda x, self=self: self.__getitem__(x), self.__order)
def update(self, dict):
for k, v in dict.items():
self.__setitem__(k, v)
# vim:ts=4:sw=4:et:
|
