Sack Library Documentation
|
|
Name |
Description |
|
This is function sack::containers::data_queue::CreateDataQueueEx. | |
|
This is function sack::containers::data_queue::CreateLargeDataQueueEx. | |
|
This is function sack::containers::data_queue::DeleteDataQueueEx. | |
|
This is function sack::containers::data_queue::DequeData. | |
|
This is function sack::containers::data_queue::EmptyDataQueue. | |
|
This is function sack::containers::data_queue::EnqueDataEx. | |
|
This is function sack::containers::data_queue::IsDataQueueEmpty. | |
|
Result buffer is filled with the last element, and the result is true, otherwise the return value is FALSE, and the data was not filled in. | |
|
get a PDATAQUEUE element at index result buffer is a pointer to the type of structure expected to be stored within this. The buffer result is a copy of the data stored in the queue. This enforces that data stored in the list is immutable. Also on the basic DequeData function, after resulting, if the pointer to the data within the queue were returned, it could become invalid immediatly after returning by having another enque happen which overwrites that position in the buffer. One could, in theory, set a flag in the queue that a deque was done, and... more | |
|
This is function sack::containers::data_queue::PrequeDataEx. | |
|
This is function sack::containers::data_queue::UnqueData. |