|
Documentation Project 1
|
   |
   |
sack::containers::sets Namespace
|
Documentation Project 1
|
|
|
namespace message
|
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::sets::_ForAllInSet. | |
|
|
| |
|
|
| |
|
|
Delete all allocated slabs. | |
|
|
This is function sack::containers::sets::DeleteSetMemberEx. | |
|
|
This is function sack::containers::sets::FindInArray. | |
|
|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
This is function sack::containers::sets::MemberValidInSetEx. |
|
Name |
Description |
|
A macro for use by internal code that tests a whole set of bits for used. (32 bits, can check to see if any in 32 is free) | |
|
A macro for use by internal code that marks a member of a set as available. | |
|
A macro which is used to emit code in C++ mode... | |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
A macro for use by internal code that tests a member of a set as used. | |
|
| |
|
A macro for use by internal code that marks a member of a set as used. | |
|
Hard coded 32 bit division for getting word index. (x>>5) | |
|
Hard coded 32 bit division for getting bit index. (x & 0x1f) |
|
|
Name |
Description |
 |
Generic sets are good for tracking lots of tiny structures. They track slabs of X structures at a time. They allocate a slab of X structures with an array of X bits indicating whether a node is used or not. The structure overall has how many are used, so once full, a block can be quickly checked whether there is anything free. Then when checking a block that might have room, the availablility is checked 32 bits at a time, until a free spot is found. Sets of 1024 members of x,y coordinates for example are good for this sort... more | |
|
|
Generic sets are good for tracking lots of tiny structures. They track slabs of X structures at a time. They allocate a slab of X structures with an array of X bits indicating whether a node is used or not. The structure overall has how many are used, so once full, a block can be quickly checked whether there is anything free. Then when checking a block that might have room, the availablility is checked 32 bits at a time, until a free spot is found. Sets of 1024 members of x,y coordinates for example are good for this sort... more | |
|
|
Generic sets are good for tracking lots of tiny structures. They track slabs of X structures at a time. They allocate a slab of X structures with an array of X bits indicating whether a node is used or not. The structure overall has how many are used, so once full, a block can be quickly checked whether there is anything free. Then when checking a block that might have room, the availablility is checked 32 bits at a time, until a free spot is found. Sets of 1024 members of x,y coordinates for example are good for this sort... more |
|
Name |
Description |
|
This is type sack::containers::sets::FAISCallback. | |
|
This is type sack::containers::sets::FESMCallback. |
|
Copyright (c) 2010. All rights reserved.
|
|
What do you think about this topic? Send feedback!
|