CompressedList.Page

unrolled list with support only for: 1. insert/delete front 2. insert/delete back 3. keep unstable "pointer" to arbitrary element 4. remove element by pointer

struct CompressedList(T, Allocator = Mallocator, bool GCRangesAllowed = true)

struct Page {

ubyte[BitMapLength] _freeMap;

Node[NodesPerPage] _nodes;

}

Members

Variables

_count ubyte _count;: Undocumented in source.
_firstNode byte _firstNode;: Undocumented in source.
_freeMap ubyte[BitMapLength] _freeMap;: Page is fixed-length array of list Nodes with batteries
_lastNode byte _lastNode;: Undocumented in source.
_nextPage Page* _nextPage;: Undocumented in source.
_nodes Node[NodesPerPage] _nodes;: Undocumented in source.
_prevPage Page* _prevPage;: Undocumented in source.

CompressedList.Page

Members

Variables

Meta

Source