-
Notifications
You must be signed in to change notification settings - Fork 1
/
ordered_set.py
231 lines (191 loc) · 6.4 KB
/
ordered_set.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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
# coding: utf-8
class OrderedSet(set):
"""
A List-Set hybrid class for holding ordered
sequences of items with no duplicates.
"""
def __init__(self, items=list()):
self.items_set = set(items)
set.__init__(self.items_set)
self.all_items = items
self.frequency_counts = {i: items.count(i) for i in self.all_items}
def items(self):
"""
Returns a list of items ordered by frequency with no duplicates.
:return: List[X], list ordered by frequency
"""
return self.rank(self.all_items)
def get_items_set(self):
"""
Returns the set of this OrderedSet's items.
:return: Set(X), set of this OrderedSet's items
"""
return self.items_set
def get_all_items(self):
"""
Returns this OrderedSet's all_items, a list representing
all items added to this OrderedSet.
:return: List[X], list of all items added to this OrderedSet
"""
return self.all_items
def remove_duplicates(self, items):
"""
Removes duplicates from given items while preserving rank.
~
Returns the result.
~
e.g. remove_duplicates(['a', 'b', 'b', 'e', 's', 's']) -> ['a', 'b', 'e', 's']
:param items: List[X], list of items
:return: List[X], list with duplicate items removed
"""
if len(items) == 0:
return items
final = []
seen = set()
for item in items:
if item in seen:
continue
else:
final.append(item)
seen.add(item)
return final
def union(self, other):
"""
Returns the union OrderedSet of this OrderedSet and another, other.
:param other: OrderedSet(X), set to unify with this set
:return: OrderedSet(X), union OrderedSet of self and other
"""
self.update(other)
return self
def pop(self, item=None):
"""
Removes the given item from this OrderedSet and returns
the modified OrderedSet.
~
If no item is specified, this method removes the most
frequent item (i.e., at items index 0) instead.
~
If given item is not found, this method returns itself.
:return: OrderedSet(X), ordered set with item removed
"""
if len(self.items()) > 0:
if item is None:
self.remove(self.items()[0])
else:
self.remove(item)
return self
def remove(self, item):
"""
Removes this item from items.
~
Removes all instances of item from:
0) items
1) all_items
2) items_set
3) frequency_counts
:param idx: X, item to remove from items
"""
try:
idx = self.items().index(item)
except ValueError:
return
else:
self.all_items = [i for i in self.all_items if i != item]
self.items_set.difference_update(set(item))
self.frequency_counts.pop(item, "")
del self.items()[idx]
def update(self, other):
"""
Updates this OrderedSet with other's all_items.
:param other: OrderedSet(X), set to update with self
:return: None
"""
if type(other) == type(self):
self.add_items(other.get_all_items())
else:
self.add_items(other)
def rank(self, items=None):
"""
Ranks this OrderedSet's all_items by frequency, removing duplicates.
~
e.g. s.rank(['a', 'b', 'b', 'e', 's', 's']) -> ['b', 's', 'a', 'e']
:return: None
"""
if items is None:
items = self.all_items
items_set = self.remove_duplicates(items)
return sorted(items_set, key=lambda i: self.frequency_counts[i], reverse=True)
def rank_items(self, items=None):
"""
Orders the given items by frequency, removing duplicates.
~
Returns the result.
~
e.g. rank_items(['a', 'b', 'b', 'e', 's', 's']) -> ['b', 's', 'a', 'e']
:param items: List[X], list of items
:return: List[X], list ordered by frequency
"""
if items is None:
items = self.all_items
seen = dict()
for item in items:
seen.setdefault(item, 0)
seen[item] += 1
self.inc_frequency(item)
items_set = self.remove_duplicates(items)
return sorted(items_set, key=lambda i: seen[i], reverse=True)
def order_items(self, items=None):
"""
Orders the given items by frequency, removing duplicates.
~
Returns the result.
~
e.g. rank_items(['a', 'b', 'b', 'e', 's', 's']) -> ['b', 's', 'a', 'e']
:param items: List[X], list of items
:return: List[X], list ordered by frequency
"""
if items is None:
items = self.all_items
return self.remove_duplicates(items)
def inc_frequency(self, item):
"""
Increases the frequency of the given item in
frequency_counts by 1.
~
If this item is not in frequency_counts yet,
this method adds an entry for this item.
:param item: X, item of same type as others in items
:return: None
"""
self.frequency_counts.setdefault(item, int())
self.frequency_counts[item] += 1
def add(self, item):
"""
Adds the given item to this OrderedSet.
~
1) Adds item to list of all items, all_items.
2) Adds item to items_set.
3) Updates frequency count of item in frequency_counts.
:param item: str, item to add to all_items
:return: None
"""
if len(item) > 0:
self.all_items.append(item)
self.items_set.add(item)
self.inc_frequency(item)
def add_items(self, items):
"""
Adds given items to this OrderedSet.
~
1) Adds each item to all_items,
2) Adds each item to items_set,
2) Updates frequency count of each item in frequency_counts.
:param items: List[str], items to add to all_items
:return: None
"""
for item in items:
self.add(item)
def __iter__(self):
return iter(self.items())
def __len__(self):
return len(self.items())