Documentation Project 1
ContentsIndexHome
PreviousUpNext
sack::containers Namespace

This type stores data, it has a self-contained length in bytes of the data stored.

Name 
Description 
 
 
 
 
 
list 
void ReleaseData( PDATA pd ); 
 
 
sets 
namespace message 
text 
namespace sets 
Name 
Description 
The following table lists functions in this documentation. 
The following table lists structs, records, enums in this documentation. 
The following table lists types in this documentation. 
The following table lists macros in this documentation. 
 
Name 
Description 
 
 
 
This is function sack::containers::DeleteDataItem. 
 
This is function sack::containers::DeleteDataListEx. 
 
This is function sack::containers::EmptyDataList. 
 
This is function sack::containers::GetDataItem. 
 
This is function sack::containers::SetDataItemEx. 
Name 
Description 
Adds an item to a DataList. 
This is macro sack::containers::CreateDataList. 
This is macro sack::containers::DATA_FORALL. 
#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)++ ) 
This is macro sack::containers::DECLDATA. 
Destroy a DataList. 
This is macro sack::containers::SetDataItem. 
This is macro sack::containers::TYPELIB_CALLTYPE. 
This is macro sack::containers::TYPELIB_PROC. 
 
Name 
Description 
 
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. 
 
A Stack that stores information in an array of structures of known size. 
 
A queue of structure elements. 
 
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. 
 
This is a stack that contains pointers to user objects. 
 
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. 
 
A queue of structure elements. 
 
A Stack that stores information in an array of structures of known size. 
 
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. 
 
This is a stack that contains pointers to user objects. 
 
Hmm - this can be done with MemLib alone... although this library is not nessecarily part of that? and it's not nessecarily allocated. 
 
A queue of structure elements. 
 
A Stack that stores information in an array of structures of known size. 
 
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. 
 
This is a stack that contains pointers to user objects. 
Name 
Description 
a list of data structures... a slab array of N members of X size 
A typedef of a pointer to a DATALIST struct DataList. 
Copyright (c) 2010. All rights reserved.
What do you think about this topic? Send feedback!