building binary patricia tree by inserting 10 random integers
time used: 2 msec
t = [(16, 7),(20, 1),(68, 6),(77, 4),(123, 0),(165, 2),(170, 8),(182, 3),(238, 5),(241, 9)]
t.inv() = true
t.size() = 10
internal tree structure:
"00000000 00000000 00000000"
"00000000 00000000 00000000 0"
"00000000 00000000 00000000 00010"
"00000000 00000000 00000000 00010000" 7
"00000000 00000000 00000000 00010100" 1
"00000000 00000000 00000000 01"
"00000000 00000000 00000000 0100"
"00000000 00000000 00000000 01000100" 6
"00000000 00000000 00000000 01001101" 4
"00000000 00000000 00000000 01111011" 0
"00000000 00000000 00000000 1"
"00000000 00000000 00000000 101"
"00000000 00000000 00000000 1010"
"00000000 00000000 00000000 10100101" 2
"00000000 00000000 00000000 10101010" 8
"00000000 00000000 00000000 10110110" 3
"00000000 00000000 00000000 111"
"00000000 00000000 00000000 11101110" 5
"00000000 00000000 00000000 11110001" 9
mem stats for ds.persistent.map.IntMap object:
# elements (size) : 10
# objects : 20
# fields : 36
# mem words : 77
stats for ds.persistent.map.IntMap:
# new Fork() : 23
# new Leaf() : 10
# new IntMapIterator() : 1
traversing all elements in tree 20 times
time used: 1 msec
looking up all elements in tree 20 times
time used: 1 msec
deleting a tree by removing 10 elements in ascending order
time used: 0 msec
t = <empty>
t.inv() = true
t.size() = 0
stats for ds.persistent.map.IntMap:
# new Fork() : 32
# new Leaf() : 10
# new IntMapIterator() : 42
