The sorted list used lm reading. list is a (64K long) array. The first entry is the root of the tree and is created during initialization. More...
#include <lm.h>
Public Attributes | |
| sorted_entry_t * | list |
| int32 | free |
The sorted list used lm reading. list is a (64K long) array. The first entry is the root of the tree and is created during initialization.
| int32 sorted_list_t::free |
first free element in list
Beginnig of the list
1.6.1