building binary patricia tree by inserting 1000000 random integers
time used: 1794 msec
t.inv() = true
t.size() = 999762
mem stats for ds.persistent.map.IntMap object:
# elements (size) : 999762
# objects : 1999524
# fields : 3999044
# mem words : 7998093
stats for ds.persistent.map.IntMap:
# new Fork() : 18820642
# new Leaf() : 1000000
# new IntMapIterator() : 0
traversing all elements in tree 20 times
time used: 1705 msec
looking up all elements in tree 20 times
time used: 3890 msec
deleting a tree by removing 1000000 elements in ascending order
time used: 806 msec
t = <empty>
t.inv() = true
t.size() = 0
stats for ds.persistent.map.IntMap:
# new Fork() : 27947934
# new Leaf() : 1000000
# new IntMapIterator() : 41
