building binary heap tree by inserting 1000000 random elements)
time used: 1504 msec
h.size() = 1000000
h.depth() = 49
h.minDepth() = 7
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 13673277
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements in ascending order
binary heap: h.isEmpty() == true
time used: 1662 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 35002869
# new Iterator() : 0
building binary heap tree by inserting 1000000 ascending elements
time used: 1896 msec
h.size() = 1000000
h.depth() = 20
h.minDepth() = 19
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 53954314
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements in ascending order
binary heap: h.isEmpty() == true
time used: 1553 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 75600798
# new Iterator() : 0
building binary heap tree by inserting 1000000 descending elements
time used: 52 msec
h.size() = 1000000
h.depth() = 1000000
h.minDepth() = 1
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 77600797
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements in ascending order
binary heap: h.isEmpty() == true
time used: 24 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 77600797
# new Iterator() : 0
building binary heap tree by inserting 1000000 times the same element
time used: 346 msec
h.size() = 1000000
h.depth() = 1000000
h.minDepth() = 1
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 79600796
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements in ascending order
binary heap: h.isEmpty() == true
time used: 14 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 79600796
# new Iterator() : 0
