Archives

Each node in the internal tree structure…

Comment on “BList” by Daniel Stutzbach

Each node in the internal tree structure can contain up to 128 elements. When an operation causes the size to exceed 128 elements, there's some extra cost for allocating more nodes and copying elements around.

For mul10, a similar cost is incurred any time the operation causes the size to cross a threshold of 128^k (because the tree depth grows by 1).

The 128 is a compile-time parameter and by adjusting the spike in cost moves around in a corresponding way.

Share

Comments are closed.