Name 

Description 

BinaryTree 

 

data_queue 

 

data_stack 

 

family 

 

link_stack 

 

list 

void ReleaseData( PDATA pd ); 

message 

 

queue 

 

sets 

namespace message 

text 

namespace sets 

Name 

Description 

Functions 

The following table lists functions in this documentation. 

Structs, Records, Enums 

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

Types 

The following table lists types in this documentation. 

Macros 

The following table lists macros in this documentation. 

 

Name 

Description 

 

CreateDataListEx 

 

 

DeleteDataItem 

This is function sack::containers::DeleteDataItem. 

 

DeleteDataListEx 

This is function sack::containers::DeleteDataListEx. 

 

EmptyDataList 

This is function sack::containers::EmptyDataList. 

 

GetDataItem 

This is function sack::containers::GetDataItem. 

 

SetDataItemEx 

This is function sack::containers::SetDataItemEx. 

Name 

Description 

AddDataItem 

Adds an item to a DataList. 

CreateDataList 

This is macro sack::containers::CreateDataList. 

DATA_FORALL 

This is macro sack::containers::DATA_FORALL. 

DATA_NEXTALL 

#define DATA_FORALL( l, i, t, v ) if(((v)=(t)NULL),(l)&&((l)->Cnt != INVALID_INDEX)) for( ((i)=0); ((i) < (l)->Cnt) ?(((v)=(t)((l)->data + (PTRSZVAL)(((l)->Size) * (i)))),1) :(((v)=(t)NULL),0)); (i)++ ) 

DECLDATA 

This is macro sack::containers::DECLDATA. 

DeleteDataList 

Destroy a DataList. 

SetDataItem 

This is macro sack::containers::SetDataItem. 

TYPELIB_CALLTYPE 

This is macro sack::containers::TYPELIB_CALLTYPE. 

TYPELIB_PROC 

This is macro sack::containers::TYPELIB_PROC. 

 

Name 

Description 

 

DataBlock 

Data Blocks are like LinkBlocks, and store blocks of data in slab format. If the count of elements exceeds available, the structure is grown, to always contain a continuous array of structures of Size size. 

 

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. 

Name 

Description 

DATALIST 

a list of data structures... a slab array of N members of X size 

PDATALIST 

A typedef of a pointer to a DATALIST struct DataList.