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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
|
import collections.abc
import itertools
import reprlib
import sys
__all__ = ('Map',)
# Thread-safe counter.
_mut_id = itertools.count(1).__next__
# Python version of _map.c. The topmost comment there explains
# all datastructures and algorithms.
# The code here follows C code closely on purpose to make
# debugging and testing easier.
def map_hash(o):
x = hash(o)
return (x & 0xffffffff) ^ ((x >> 32) & 0xffffffff)
def map_mask(hash, shift):
return (hash >> shift) & 0x01f
def map_bitpos(hash, shift):
return 1 << map_mask(hash, shift)
def map_bitcount(v):
v = v - ((v >> 1) & 0x55555555)
v = (v & 0x33333333) + ((v >> 2) & 0x33333333)
v = (v & 0x0F0F0F0F) + ((v >> 4) & 0x0F0F0F0F)
v = v + (v >> 8)
v = (v + (v >> 16)) & 0x3F
return v
def map_bitindex(bitmap, bit):
return map_bitcount(bitmap & (bit - 1))
W_EMPTY, W_NEWNODE, W_NOT_FOUND = range(3)
void = object()
class BitmapNode:
def __init__(self, size, bitmap, array, mutid):
self.size = size
self.bitmap = bitmap
assert isinstance(array, list) and len(array) == size
self.array = array
self.mutid = mutid
def clone(self, mutid):
return BitmapNode(self.size, self.bitmap, self.array.copy(), mutid)
def assoc(self, shift, hash, key, val, mutid):
bit = map_bitpos(hash, shift)
idx = map_bitindex(self.bitmap, bit)
if self.bitmap & bit:
key_idx = 2 * idx
val_idx = key_idx + 1
key_or_null = self.array[key_idx]
val_or_node = self.array[val_idx]
if key_or_null is None:
sub_node, added = val_or_node.assoc(
shift + 5, hash, key, val, mutid)
if val_or_node is sub_node:
return self, added
if mutid and mutid == self.mutid:
self.array[val_idx] = sub_node
return self, added
else:
ret = self.clone(mutid)
ret.array[val_idx] = sub_node
return ret, added
if key == key_or_null:
if val is val_or_node:
return self, False
if mutid and mutid == self.mutid:
self.array[val_idx] = val
return self, False
else:
ret = self.clone(mutid)
ret.array[val_idx] = val
return ret, False
existing_key_hash = map_hash(key_or_null)
if existing_key_hash == hash:
sub_node = CollisionNode(
4, hash, [key_or_null, val_or_node, key, val], mutid)
else:
sub_node = BitmapNode(0, 0, [], mutid)
sub_node, _ = sub_node.assoc(
shift + 5, existing_key_hash,
key_or_null, val_or_node,
mutid)
sub_node, _ = sub_node.assoc(
shift + 5, hash, key, val,
mutid)
if mutid and mutid == self.mutid:
self.array[key_idx] = None
self.array[val_idx] = sub_node
return self, True
else:
ret = self.clone(mutid)
ret.array[key_idx] = None
ret.array[val_idx] = sub_node
return ret, True
else:
key_idx = 2 * idx
val_idx = key_idx + 1
n = map_bitcount(self.bitmap)
new_array = self.array[:key_idx]
new_array.append(key)
new_array.append(val)
new_array.extend(self.array[key_idx:])
if mutid and mutid == self.mutid:
self.size = 2 * (n + 1)
self.bitmap |= bit
self.array = new_array
return self, True
else:
return BitmapNode(
2 * (n + 1), self.bitmap | bit, new_array, mutid), True
def find(self, shift, hash, key):
bit = map_bitpos(hash, shift)
if not (self.bitmap & bit):
raise KeyError
idx = map_bitindex(self.bitmap, bit)
key_idx = idx * 2
val_idx = key_idx + 1
key_or_null = self.array[key_idx]
val_or_node = self.array[val_idx]
if key_or_null is None:
return val_or_node.find(shift + 5, hash, key)
if key == key_or_null:
return val_or_node
raise KeyError(key)
def without(self, shift, hash, key, mutid):
bit = map_bitpos(hash, shift)
if not (self.bitmap & bit):
return W_NOT_FOUND, None
idx = map_bitindex(self.bitmap, bit)
key_idx = 2 * idx
val_idx = key_idx + 1
key_or_null = self.array[key_idx]
val_or_node = self.array[val_idx]
if key_or_null is None:
res, sub_node = val_or_node.without(shift + 5, hash, key, mutid)
if res is W_EMPTY:
raise RuntimeError('unreachable code') # pragma: no cover
elif res is W_NEWNODE:
if (type(sub_node) is BitmapNode and
sub_node.size == 2 and
sub_node.array[0] is not None):
if mutid and mutid == self.mutid:
self.array[key_idx] = sub_node.array[0]
self.array[val_idx] = sub_node.array[1]
return W_NEWNODE, self
else:
clone = self.clone(mutid)
clone.array[key_idx] = sub_node.array[0]
clone.array[val_idx] = sub_node.array[1]
return W_NEWNODE, clone
if mutid and mutid == self.mutid:
self.array[val_idx] = sub_node
return W_NEWNODE, self
else:
clone = self.clone(mutid)
clone.array[val_idx] = sub_node
return W_NEWNODE, clone
else:
assert sub_node is None
return res, None
else:
if key == key_or_null:
if self.size == 2:
return W_EMPTY, None
new_array = self.array[:key_idx]
new_array.extend(self.array[val_idx + 1:])
if mutid and mutid == self.mutid:
self.size -= 2
self.bitmap &= ~bit
self.array = new_array
return W_NEWNODE, self
else:
new_node = BitmapNode(
self.size - 2, self.bitmap & ~bit, new_array, mutid)
return W_NEWNODE, new_node
else:
return W_NOT_FOUND, None
def keys(self):
for i in range(0, self.size, 2):
key_or_null = self.array[i]
if key_or_null is None:
val_or_node = self.array[i + 1]
yield from val_or_node.keys()
else:
yield key_or_null
def values(self):
for i in range(0, self.size, 2):
key_or_null = self.array[i]
val_or_node = self.array[i + 1]
if key_or_null is None:
yield from val_or_node.values()
else:
yield val_or_node
def items(self):
for i in range(0, self.size, 2):
key_or_null = self.array[i]
val_or_node = self.array[i + 1]
if key_or_null is None:
yield from val_or_node.items()
else:
yield key_or_null, val_or_node
def dump(self, buf, level): # pragma: no cover
buf.append(
' ' * (level + 1) +
'BitmapNode(size={} count={} bitmap={} id={:0x}):'.format(
self.size, self.size / 2, bin(self.bitmap), id(self)))
for i in range(0, self.size, 2):
key_or_null = self.array[i]
val_or_node = self.array[i + 1]
pad = ' ' * (level + 2)
if key_or_null is None:
buf.append(pad + 'None:')
val_or_node.dump(buf, level + 2)
else:
buf.append(pad + '{!r}: {!r}'.format(key_or_null, val_or_node))
class CollisionNode:
def __init__(self, size, hash, array, mutid):
self.size = size
self.hash = hash
self.array = array
self.mutid = mutid
def find_index(self, key):
for i in range(0, self.size, 2):
if self.array[i] == key:
return i
return -1
def find(self, shift, hash, key):
for i in range(0, self.size, 2):
if self.array[i] == key:
return self.array[i + 1]
raise KeyError(key)
def assoc(self, shift, hash, key, val, mutid):
if hash == self.hash:
key_idx = self.find_index(key)
if key_idx == -1:
new_array = self.array.copy()
new_array.append(key)
new_array.append(val)
if mutid and mutid == self.mutid:
self.size += 2
self.array = new_array
return self, True
else:
new_node = CollisionNode(
self.size + 2, hash, new_array, mutid)
return new_node, True
val_idx = key_idx + 1
if self.array[val_idx] is val:
return self, False
if mutid and mutid == self.mutid:
self.array[val_idx] = val
return self, False
else:
new_array = self.array.copy()
new_array[val_idx] = val
return CollisionNode(self.size, hash, new_array, mutid), False
else:
new_node = BitmapNode(
2, map_bitpos(self.hash, shift), [None, self], mutid)
return new_node.assoc(shift, hash, key, val, mutid)
def without(self, shift, hash, key, mutid):
if hash != self.hash:
return W_NOT_FOUND, None
key_idx = self.find_index(key)
if key_idx == -1:
return W_NOT_FOUND, None
new_size = self.size - 2
if new_size == 0:
# Shouldn't be ever reachable
return W_EMPTY, None # pragma: no cover
if new_size == 2:
if key_idx == 0:
new_array = [self.array[2], self.array[3]]
else:
assert key_idx == 2
new_array = [self.array[0], self.array[1]]
new_node = BitmapNode(
2, map_bitpos(hash, shift), new_array, mutid)
return W_NEWNODE, new_node
new_array = self.array[:key_idx]
new_array.extend(self.array[key_idx + 2:])
if mutid and mutid == self.mutid:
self.array = new_array
self.size -= 2
return W_NEWNODE, self
else:
new_node = CollisionNode(
self.size - 2, self.hash, new_array, mutid)
return W_NEWNODE, new_node
def keys(self):
for i in range(0, self.size, 2):
yield self.array[i]
def values(self):
for i in range(1, self.size, 2):
yield self.array[i]
def items(self):
for i in range(0, self.size, 2):
yield self.array[i], self.array[i + 1]
def dump(self, buf, level): # pragma: no cover
pad = ' ' * (level + 1)
buf.append(
pad + 'CollisionNode(size={} id={:0x}):'.format(
self.size, id(self)))
pad = ' ' * (level + 2)
for i in range(0, self.size, 2):
key = self.array[i]
val = self.array[i + 1]
buf.append('{}{!r}: {!r}'.format(pad, key, val))
class MapKeys:
def __init__(self, c, m):
self.__count = c
self.__root = m
def __len__(self):
return self.__count
def __iter__(self):
return iter(self.__root.keys())
class MapValues:
def __init__(self, c, m):
self.__count = c
self.__root = m
def __len__(self):
return self.__count
def __iter__(self):
return iter(self.__root.values())
class MapItems:
def __init__(self, c, m):
self.__count = c
self.__root = m
def __len__(self):
return self.__count
def __iter__(self):
return iter(self.__root.items())
class Map:
def __init__(self, col=None, **kw):
self.__count = 0
self.__root = BitmapNode(0, 0, [], 0)
self.__hash = -1
if col or kw:
init = self.update(col, **kw)
self.__count = init.__count
self.__root = init.__root
@classmethod
def _new(cls, count, root):
m = Map.__new__(Map)
m.__count = count
m.__root = root
m.__hash = -1
return m
def __reduce__(self):
return (type(self), (dict(self.items()),))
def __len__(self):
return self.__count
def __eq__(self, other):
if not isinstance(other, Map):
return NotImplemented
if len(self) != len(other):
return False
for key, val in self.__root.items():
try:
oval = other.__root.find(0, map_hash(key), key)
except KeyError:
return False
else:
if oval != val:
return False
return True
def update(self, col=None, **kw):
it = None
if col is not None:
if hasattr(col, 'items'):
it = iter(col.items())
else:
it = iter(col)
if it is not None:
if kw:
it = iter(itertools.chain(it, kw.items()))
else:
if kw:
it = iter(kw.items())
if it is None:
return self
mutid = _mut_id()
root = self.__root
count = self.__count
i = 0
while True:
try:
tup = next(it)
except StopIteration:
break
try:
tup = tuple(tup)
except TypeError:
raise TypeError(
f'cannot convert map update '
f'sequence element #{i} to a sequence') from None
key, val, *r = tup
if r:
raise ValueError(
f'map update sequence element #{i} has length '
f'{len(r) + 2}; 2 is required')
root, added = root.assoc(0, map_hash(key), key, val, mutid)
if added:
count += 1
i += 1
return Map._new(count, root)
def mutate(self):
return MapMutation(self.__count, self.__root)
def set(self, key, val):
new_count = self.__count
new_root, added = self.__root.assoc(0, map_hash(key), key, val, 0)
if new_root is self.__root:
assert not added
return self
if added:
new_count += 1
return Map._new(new_count, new_root)
def delete(self, key):
res, node = self.__root.without(0, map_hash(key), key, 0)
if res is W_EMPTY:
return Map()
elif res is W_NOT_FOUND:
raise KeyError(key)
else:
return Map._new(self.__count - 1, node)
def get(self, key, default=None):
try:
return self.__root.find(0, map_hash(key), key)
except KeyError:
return default
def __getitem__(self, key):
return self.__root.find(0, map_hash(key), key)
def __contains__(self, key):
try:
self.__root.find(0, map_hash(key), key)
except KeyError:
return False
else:
return True
def __iter__(self):
yield from self.__root.keys()
def keys(self):
return MapKeys(self.__count, self.__root)
def values(self):
return MapValues(self.__count, self.__root)
def items(self):
return MapItems(self.__count, self.__root)
def __hash__(self):
if self.__hash != -1:
return self.__hash
MAX = sys.maxsize
MASK = 2 * MAX + 1
h = 1927868237 * (self.__count * 2 + 1)
h &= MASK
for key, value in self.__root.items():
hx = hash(key)
h ^= (hx ^ (hx << 16) ^ 89869747) * 3644798167
h &= MASK
hx = hash(value)
h ^= (hx ^ (hx << 16) ^ 89869747) * 3644798167
h &= MASK
h = h * 69069 + 907133923
h &= MASK
if h > MAX:
h -= MASK + 1 # pragma: no cover
if h == -1:
h = 590923713 # pragma: no cover
self.__hash = h
return h
@reprlib.recursive_repr("{...}")
def __repr__(self):
items = []
for key, val in self.items():
items.append("{!r}: {!r}".format(key, val))
return '<immutables.Map({{{}}}) at 0x{:0x}>'.format(
', '.join(items), id(self))
def __dump__(self): # pragma: no cover
buf = []
self.__root.dump(buf, 0)
return '\n'.join(buf)
class MapMutation:
def __init__(self, count, root):
self.__count = count
self.__root = root
self.__mutid = _mut_id()
def set(self, key, val):
self[key] = val
def __enter__(self):
return self
def __exit__(self, *exc):
self.finalize()
return False
def __delitem__(self, key):
if self.__mutid == 0:
raise ValueError(f'mutation {self!r} has been finalized')
res, new_root = self.__root.without(
0, map_hash(key), key, self.__mutid)
if res is W_EMPTY:
self.__count = 0
self.__root = BitmapNode(0, 0, [], self.__mutid)
elif res is W_NOT_FOUND:
raise KeyError(key)
else:
self.__root = new_root
self.__count -= 1
def __setitem__(self, key, val):
if self.__mutid == 0:
raise ValueError(f'mutation {self!r} has been finalized')
self.__root, added = self.__root.assoc(
0, map_hash(key), key, val, self.__mutid)
if added:
self.__count += 1
def pop(self, key, *args):
if self.__mutid == 0:
raise ValueError(f'mutation {self!r} has been finalized')
if len(args) > 1:
raise TypeError(
'pop() accepts 1 to 2 positional arguments, '
'got {}'.format(len(args) + 1))
elif len(args) == 1:
default = args[0]
else:
default = void
val = self.get(key, default)
try:
del self[key]
except KeyError:
if val is void:
raise
return val
else:
assert val is not void
return val
def get(self, key, default=None):
try:
return self.__root.find(0, map_hash(key), key)
except KeyError:
return default
def __getitem__(self, key):
return self.__root.find(0, map_hash(key), key)
def __contains__(self, key):
try:
self.__root.find(0, map_hash(key), key)
except KeyError:
return False
else:
return True
def finalize(self):
self.__mutid = 0
return Map._new(self.__count, self.__root)
@reprlib.recursive_repr("{...}")
def __repr__(self):
items = []
for key, val in self.__root.items():
items.append("{!r}: {!r}".format(key, val))
return '<immutables.MapMutation({{{}}}) at 0x{:0x}>'.format(
', '.join(items), id(self))
def __len__(self):
return self.__count
def __hash__(self):
raise TypeError(f'unhashable type: {type(self).__name__}')
def __eq__(self, other):
if not isinstance(other, MapMutation):
return NotImplemented
if len(self) != len(other):
return False
for key, val in self.__root.items():
try:
oval = other.__root.find(0, map_hash(key), key)
except KeyError:
return False
else:
if oval != val:
return False
return True
collections.abc.Mapping.register(Map)
|