Name 

Description 

BinaryTree 

 

data_list 

 

data_queue 

 

data_stack 

 

family 

 

link_stack 

 

list 

This is a slab array of pointers, each pointer may be assigned to point to any user data. 

message 

 

queue 

 

sets 

Routines to deal with SLAB allocated blocks of structures. Each slab has multiple elements of a type in it, and the blocks are tracked as a linked list. Each block also has a bitmask of allocated elements in the set.

---------------------------------------------------------------------------
Set type
Usage:
typedef struct name_tag { } <name>;
#define MAX<name>SPERSET
DeclareSet( <name> );
Should alias GetFromset, DeleteFromSet, CountUsedInSet, GetLinearSetArray
etc so that the type name is reflected there
another good place where #define defining defines is good. 

text 

This is namespace sack::containers::text. 

Name 

Description 

Structs, Records, Enums 

The following table lists structs, records, enums in this documentation. 

Macros 

The following table lists macros in this documentation. 

Name 

Description 

DECLDATA 

This is macro sack::containers::DECLDATA. 

TYPELIB_CALLTYPE 

This is macro sack::containers::TYPELIB_CALLTYPE. 

TYPELIB_PROC 

This is macro sack::containers::TYPELIB_PROC. 

 

Name 

Description 

 

DataListStack 

A Stack that stores information in an array of structures of known size. 

 

DataQueue 

A queue of structure elements. 

 

LinkQueue 

A queue which contains pointers to user objects. If the queue is filled to capacity and new queue is allocated, and all existing pointers are transferred. 

 

LinkStack 

This is a stack that contains pointers to user objects. 

 

SimpleDataBlock 

Hmm - this can be done with MemLib alone... although this library is not nessecarily part of that? and it's not nessecarily allocated. 

 

DATA 

Hmm - this can be done with MemLib alone... although this library is not nessecarily part of that? and it's not nessecarily allocated. 

 

DATAQUEUE 

A queue of structure elements. 

 

DATASTACK 

A Stack that stores information in an array of structures of known size. 

 

LINKQUEUE 

A queue which contains pointers to user objects. If the queue is filled to capacity and new queue is allocated, and all existing pointers are transferred. 

 

LINKSTACK 

This is a stack that contains pointers to user objects. 

 

PDATA 

Hmm - this can be done with MemLib alone... although this library is not nessecarily part of that? and it's not nessecarily allocated. 

 

PDATAQUEUE 

A queue of structure elements. 

 

PDATASTACK 

A Stack that stores information in an array of structures of known size. 

 

PLINKQUEUE 

A queue which contains pointers to user objects. If the queue is filled to capacity and new queue is allocated, and all existing pointers are transferred. 

 

PLINKSTACK 

This is a stack that contains pointers to user objects.