-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtimeout_set.py
183 lines (152 loc) · 5.47 KB
/
timeout_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
from typing import MutableMapping, MutableSet, List, Hashable, Callable
from lib.stuff import ANY
class Timeout_Set(MutableSet):
"""A set-like container that automatically removes entries when they are outdated.
Do not use the container with massive number of entries, it is not optimized"""
def __init__(self, timeout: int, timefunc):
"""
Create a timeout set
:param timeout: The timeout in ticks until entry is invalidated
:param timefunc:
"""
self.timeout = timeout
self.timefunc = timefunc
self._members = dict()
self.on_member_added = []
def add(self, m):
if m not in self._members:
for f in self.on_member_added:
f(m)
self._members[m] = self.timefunc()
def remove(self, m)-> None:
self._members.pop(m)
def discard(self, m) -> None:
try:
self._members.pop(m)
except KeyError:
pass
def __iter__(self):
now = self.timefunc()
items = list(self._members.items())
for x, t in items:
if t + self.timeout >= now:
yield x
else:
self._members.pop(x)
def __contains__(self, key):
now = self.timefunc()
ret = False
for item, t in list(self._members.items()):
if t + self.timeout < now:
self._members.pop(item)
elif item == key:
ret = True
return ret
def __repr__(self):
return str(self._members)
def __len__(self):
now = self.timefunc()
items = list(self._members.items())
for x, t in items:
if t + self.timeout < now:
self._members.pop(x)
return len(self._members)
class Timeout_Dict(MutableMapping):
def __init__(self, timeout: int, timefunc):
self.timeout = timeout
self.timefunc = timefunc
self._members = dict()
self.on_member_added: List[Callable[[Hashable, object], None]] = [] # Functions to be called when item is added
self.on_member_removed: List[
Callable[[Hashable, object], None]] = [] # Functions to be called when item is removed (or times out)
def __setitem__(self, key, value):
assert key is not ANY, "ANY is not allowed as key!!!"
if key not in self._members:
for f in self.on_member_added:
f(key, value)
self._members[key] = (self.timefunc(), value)
def touch(self, key):
t, item = self._members[key]
self._members[key] = (self.timefunc(), item)
def pop(self, key):
assert key is not ANY, "ANY is not allowed as key!!!"
try:
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
except KeyError:
pass
def item_age(self, key) -> int:
"""Returns the age of the item
i.e. the time elapsed since it was added to the container
:param key: lookup key to use
:returns time in ticks"""
assert key is not ANY, "ANY is not allowed as key!!!"
t, item = self._members[key]
return self.timefunc() - t
def __contains__(self, key):
assert key is not ANY, "ANY is not allowed as key!!!"
ret = False
for i in list(self._members.keys()):
t, item = self._members[i]
if t + self.timeout < self.timefunc():
__, v = self._members.pop(i)
for f in self.on_member_removed:
f(i, v)
elif i == key:
ret = True
return ret
def __getitem__(self, key):
assert key is not ANY, "ANY is not allowed as key!!!"
t, item = self._members[key]
if t + self.timeout >= self.timefunc():
return item
else:
self._members.pop(key)
raise KeyError
def __iter__(self):
now = self.timefunc()
items = list(self._members.items())
for key, (t, v) in items:
if t + self.timeout >= now:
yield key
else:
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
def items(self):
now = self.timefunc()
items = list(self._members.items())
for key, (t, v) in items:
if t + self.timeout >= now:
yield key, v
else:
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
def keys(self):
now = self.timefunc()
items = list(self._members.items())
for key, (t, v) in items:
if t + self.timeout >= now:
yield key
else:
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
def __delitem__(self, key):
assert key is not ANY, "ANY is not allowed as key!!!"
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
def __len__(self):
now = self.timefunc()
items = list(self._members.items())
for key, (t, v) in items:
if t + self.timeout < now:
__, v = self._members.pop(key)
for f in self.on_member_removed:
f(key, v)
return len(self._members)
def __repr__(self):
return str(self._members)