Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (30 loc) · 904 Bytes

File metadata and controls

33 lines (30 loc) · 904 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
# for hashable types
def dedupeHash(items):
seen = set()
for item in items:
if item not in seen:
yield item # generator = general purpose!
seen.add(item)
l = [1,2,3,3,4,3,2,2,2,1,1,1,1]
dGen = dedupeHash(l)
list(dGen) #dGen gets used up!
# for unhashable type (like dicts/maps)
def dedupeUnhash(items, key=None):
seen = set()
for item in items:
# key: specify a function that converts sequence items
# into a hashable type
val = item if key is None else key(item)
if val not in seen:
yield item
seen.add(val)
a = [ # all unhasable dicts...
{'x': 1, 'y': 2},
{'x': 1, 'y': 3},
{'x': 1, 'y': 2}, # dupe
{'x': 2, 'y': 4}
]
# dedupe on unique pairs of keys
list(dedupeUnhash(a, key = lambda d: (d['x'], d['y'])))
# dedupe on unique key x
list(dedupeUnhash(a, key = lambda d: (d['x'])))
Morty Proxy This is a proxified and sanitized view of the page, visit original site.