forked from fgmacedo/python-statemachine
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathorderedset.py
More file actions
118 lines (81 loc) · 2.51 KB
/
Copy pathorderedset.py
File metadata and controls
118 lines (81 loc) · 2.51 KB
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
import itertools
from collections.abc import Iterable
from collections.abc import Iterator
from collections.abc import MutableSet
from typing import TypeVar
T = TypeVar("T")
class OrderedSet(MutableSet[T]):
"""A set that preserves insertion order by internally using a dict.
>>> OrderedSet([1, 2, "foo"])
OrderedSet([1, 2, 'foo'])
>>> OrderedSet([1, 2, 3, 3, 2, 1, 'a', 'b', 'a', 'c'])
OrderedSet([1, 2, 3, 'a', 'b', 'c'])
>>> s = OrderedSet([1, 2, 3])
>>> s.add(4)
>>> s
OrderedSet([1, 2, 3, 4])
>>> s = OrderedSet([1, 2, 3])
>>> "foo" in s
False
>>> 1 in s
True
>>> list(s)
[1, 2, 3]
>>> s == OrderedSet([1, 2, 3])
True
>>> s > OrderedSet([1, 2]) # set is a superset of other
True
>>> s & {2}
OrderedSet([2])
>>> s | {4}
OrderedSet([1, 2, 3, 4])
>>> s - {2}
OrderedSet([1, 3])
>>> s - {1}
OrderedSet([2, 3])
>>> {1} - s
OrderedSet([])
>>> s ^ {2}
OrderedSet([1, 3])
>>> s[1]
2
>>> s[2]
3
>>> eval(repr(OrderedSet(['a', 'b', 'c'])))
OrderedSet(['a', 'b', 'c'])
"""
__slots__ = ("_d",)
def __init__(self, iterable: "Iterable[T] | None" = None):
self._d = dict.fromkeys(iterable) if iterable else {}
def add(self, x: T) -> None:
self._d[x] = None
def clear(self) -> None:
self._d.clear()
def discard(self, x: T) -> None:
self._d.pop(x, None)
def __getitem__(self, index) -> T:
try:
return next(itertools.islice(self._d, index, index + 1))
except StopIteration as e:
raise IndexError(f"index {index} out of range") from e
def __contains__(self, x: object) -> bool:
return self._d.__contains__(x)
def __len__(self) -> int:
return self._d.__len__()
def __iter__(self) -> Iterator[T]:
return self._d.__iter__()
def __str__(self):
return f"{{{', '.join(str(i) for i in self)}}}"
def __repr__(self):
return f"OrderedSet({list(self._d.keys())})"
def union(self, *others: Iterable[T]) -> "OrderedSet[T]":
"""Return a new OrderedSet containing elements from the set and all others."""
new_set = OrderedSet(self)
for other in others:
new_set.update(other)
return new_set
def update(self, *others: Iterable[T]) -> None:
"""Update the set, adding elements from all others."""
for other in others:
for element in other:
self.add(element)