-
Notifications
You must be signed in to change notification settings - Fork 21
/
pack.py
286 lines (248 loc) · 7.31 KB
/
pack.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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
from sys import getsizeof, stderr
from itertools import chain
from collections import deque
from reprlib import repr
from array import array
def deepSize(o, handlers={}, verbose=False, seen=None):
""" Returns the approximate memory footprint an object and all of its contents.
Automatically finds the contents of the following builtin containers and
their subclasses: tuple, list, deque, dict, set and `frozenset`.
To search other containers, add handlers to iterate over their contents:
handlers = {SomeContainerClass: iter,
OtherContainerClass: OtherContainerClass.get_elements}
"""
def dict_handler(d):
return chain.from_iterable(d.items())
all_handlers = {
tuple: iter,
list: iter,
deque: iter,
dict: dict_handler,
set: iter,
frozenset: iter,
}
all_handlers.update(handlers) # user handlers take precedence
if seen is None:
seen = set() # track which object id's have already been seen
default_size = getsizeof(0) # estimate sizeof object without __sizeof__
def sizeof(o):
if id(o) in seen: # do not double count the same object
return 0
seen.add(id(o))
s = getsizeof(o, default_size)
if verbose:
print(s, type(o), repr(o), file=stderr)
for typ, handler in all_handlers.items():
if isinstance(o, typ):
s += sum(map(sizeof, handler(o)))
break
return s
return sizeof(o)
def findStretches(sequence, threshold=1, amount=None):
default = (((sequence[0], sequence[-1]),), 0)
if amount == 1:
return default
prevN = 1
gaps = []
for n in sequence:
gap = n - prevN
if gap > 1:
gaps.append((prevN, n))
prevN = n
nInGap = sum(e - b - 1 for (b, e) in gaps if b >= sequence[0] and e <= sequence[-1])
nTotal = sequence[-1] - sequence[0] + 1
gapRatio = nInGap / nTotal if nTotal else 0
gaps = tuple((b, e) for (b, e) in gaps if e - b > threshold)
if len(gaps) == 0:
return default
if amount is not None and len(gaps) > amount:
gaps = sorted(
sorted(gaps, key=lambda x: (x[0] - x[1], x[0]))[0:amount],
key=lambda x: x[0],
)
stretches = []
if sequence[0] <= gaps[0][0]:
stretches.append((sequence[0], gaps[0][0]))
for (i, gap) in enumerate(gaps[0:-1]):
stretches.append((gap[1], gaps[i + 1][0]))
if sequence[-1] >= gaps[-1][1]:
stretches.append((gaps[-1][1], sequence[-1]))
return (stretches, gapRatio)
CONTAINER_TYPE = {
'dict': dict,
'tup': tuple,
}
ELEMENT_TYPE = {
'int': int,
'str': str,
'tup': tuple,
}
def pack(origData, containerSpec, elementSpec, threshold=1000, amount=5):
UTF8 = 'utf8'
containerType = CONTAINER_TYPE[containerSpec]
elementType = ELEMENT_TYPE[elementSpec]
isDict = containerType is dict
isInt = elementType is int
isStr = elementType is str
isTup = elementType is tuple
arraySpecifier = 'i'
if isStr:
arraySpecifier = 'B'
valueNumber = array('I')
valueStart = array('I')
values = array(arraySpecifier)
vNumber = 0
vStart = 0
offsets = []
origValueIndex = {}
if isDict:
valueNumber.append(0)
valueStart.append(0)
values.append(0)
vNumber = 1
vStart = 1
origKeys = sorted(origData)
(stretches, gapRatio) = findStretches(origKeys, threshold=threshold, amount=amount)
def addValInt(origVal):
values.append(origVal)
def addValStr(origVal):
nonlocal vStart
bval = bytes(origVal, encoding=UTF8)
lval = len(bval)
values.extend(bval)
valueStart.append(vStart)
vStart += lval
def addValTup(origVal):
nonlocal vStart
lval = len(origVal)
values.extend(origVal)
valueStart.append(vStart)
vStart += lval
addVal = (
addValStr if isStr else
addValInt if isInt else
addValTup if isTup else
addValInt
)
if isDict:
nKeys = 0
for (b, e) in stretches:
offset = b - len(valueNumber)
offsets.append((b, e, offset))
for n in range(b, e + 1):
origVal = origData.get(n, None)
if origVal is None:
valueNumber.append(0)
else:
nKeys += 1
thisVNumber = origValueIndex.get(origVal, None)
if thisVNumber is None:
thisVNumber = vNumber
origValueIndex[origVal] = vNumber
addVal(origVal)
vNumber += 1
valueNumber.append(thisVNumber)
else:
for origVal in origData:
thisVNumber = origValueIndex.get(origVal, None)
if thisVNumber is None:
thisVNumber = vNumber
origValueIndex[origVal] = vNumber
addVal(origVal)
vNumber += 1
valueNumber.append(thisVNumber)
alength = len(valueNumber)
length = alength
if isDict:
offsets = tuple(offsets)
length = nKeys
if isStr or isTup:
valueStart.append(vStart)
return dict(
container=containerSpec,
element=elementSpec,
valueNumber=valueNumber,
valueStart=valueStart,
values=values,
alength=alength,
length=length,
offsets=offsets,
)
class Pack(object):
def __init__(self, packedData):
for (k, v) in packedData.items():
setattr(self, k, v)
ctp = self.container
etp = self.element
setattr(self, 'get', getattr(self, f'get{ctp}{etp}', None))
def gettupint(self, n):
valueNumber = self.valueNumber
values = self.values
if n >= len(valueNumber):
return None
vNumber = valueNumber[n]
return values[vNumber]
def gettuptup(self, n):
valueNumber = self.valueNumber
valueStart = self.valueStart
values = self.values
if n >= len(valueNumber):
return None
vNumber = valueNumber[n]
vStart = valueStart[vNumber]
vStartNext = valueStart[vNumber + 1]
return tuple(values[vStart:vStartNext])
def gettupstr(self, n):
UTF8 = 'utf8'
valueNumber = self.valueNumber
valueStart = self.valueStart
values = self.values
if n >= len(valueNumber):
return None
vNumber = valueNumber[n]
vStart = valueStart[vNumber]
vStartNext = valueStart[vNumber + 1]
return str(values[vStart:vStartNext], encoding=UTF8)
def getdictint(self, n):
valueNumber = self.valueNumber
values = self.values
offsets = self.offsets
for (b, e, offset) in offsets:
if b <= n <= e:
m = n - offset
vNumber = valueNumber[m]
if vNumber == 0:
return None
return values[vNumber]
return None
def getdicttup(self, n):
valueNumber = self.valueNumber
valueStart = self.valueStart
values = self.values
offsets = self.offsets
for (b, e, offset) in offsets:
if b <= n <= e:
m = n - offset
vNumber = valueNumber[m]
if vNumber == 0:
return None
vStart = valueStart[vNumber]
vStartNext = valueStart[vNumber + 1]
return tuple(values[vStart:vStartNext])
return None
def getdictstr(self, n):
UTF8 = 'utf8'
valueNumber = self.valueNumber
valueStart = self.valueStart
values = self.values
offsets = self.offsets
for (b, e, offset) in offsets:
if b <= n <= e:
m = n - offset
vNumber = valueNumber[m]
if vNumber == 0:
return None
vStart = valueStart[vNumber]
vStartNext = valueStart[vNumber + 1]
return str(values[vStart:vStartNext], encoding=UTF8)
return None