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.