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>

Detailed Description

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.

Member Data Documentation

int32 sorted_list_t::free

first free element in list

sorted_entry_t* sorted_list_t::list

Beginnig of the list

The documentation for this struct was generated from the following file: