Class: BitMapTree

Counter~BitMapTree

Class representing a lazy recursive bitmap tree Only the leaf bitmaps correspond to counters Interior bitmaps index their child bitmaps If an interior bit is set, that means there's no free bits in the child bitmap If an interior bit is not set, that means there's at least 1 free bit in the child bitmap

Constructor

new BitMapTree(begin, depth)

Creates a BitMapTree, this is an abstract class It is not meant to by directly instantiated
Parameters:
Name Type Description
begin number
depth number
Source:

Methods

set(index)

Sets a bit to allocated
Parameters:
Name Type Description
index number
Source:

unset(index)

Unsets a bit so that is free
Parameters:
Name Type Description
index number
Source: