-
Notifications
You must be signed in to change notification settings - Fork 0
/
base.py
118 lines (87 loc) · 2.86 KB
/
base.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
"""Some base classes inherited by others"""
class BaseCollection(object):
"""Base class for everything"""
def __init__(self):
super(BaseCollection, self).__init__()
def size(self):
"""This implementation works for almost every class in ODS"""
return self.n
def __len__(self):
return self.size()
def __str__(self):
return "[" + ",".join([str(x) for x in self]) + "]"
def __repr__(self):
return self.__class__.__name__ \
+ "(["+ ",".join([repr(x) for x in self]) +"])"
class BaseSet(BaseCollection):
"""Base class for Set implementations"""
def __init__(self):
super(BaseSet, self).__init__()
def add_all(self, a):
for x in a:
self.add(x)
def __in__(self, x):
return self.find(x) is not None
def __eq__(self, a):
if len(a) != len(self): return False
for x in self:
if not x in a: return False
for x in a:
if not x in self: return False
return True
def __ne__(self, a):
return not self == a
class BaseList(BaseCollection):
"""Base class for List implementations"""
def __init__(self):
super(BaseList, self).__init__()
def append(self, x):
self.add(self.size(), x)
def add_all(self, iterable):
for x in iterable:
self.append(x)
def clear(self):
"""This can be overridden with more efficient implementations"""
while self.size() > 0:
self.remove(self.size()-1)
def add_first(self, x):
return self.add(0, x)
def remove_first(self):
return self.remove(0)
def add_last(self, x):
return self.add(self.size(), x)
def remove_last(self):
return self.remove(self.size()-1)
def insert(i, x):
self.add(i, x)
def __iter__(self):
"""This implementation is good enough for array-based lists"""
for i in range(len(self)):
yield(self.get(i))
def __eq__(self, a):
if len(a) != len(self): return False
it1 = iter(a)
it2 = iter(self)
for i in range(len(a)):
if it1.next() != it2.next(): return False
return True
def __ne__(self, a):
return not self == a
def index(self, x):
i = 0
for y in self:
if y == x:
return i
i += 1
raise ValueError('%r is not in the list' % x)
def remove_value(self, x):
try:
return self.remove(self.index(x))
except ValueError:
return False
def __getitem__(self, key):
return self.get(key)
def __setitem__(self, key, value):
return self.set(key, value)
def __delitem__(self, i):
self.remove(i)