Sack Library Documentation
ContentsIndexReferenceHome
PreviousUpNext
sack::containers::LINKQUEUE Structure
C++
typedef struct LinkQueue {
  INDEX Top;
  INDEX Bottom;
  INDEX Cnt;
  _32 Lock;
  POINTER pNode[2];
} LINKQUEUE, * PLINKQUEUE;
Members 
Description 
INDEX Top; 
This is the index of the next pointer to be added to the queue. If Top==Bottom, then the queue is empty, until a pointer is added to the queue, and Top is incremented. 
INDEX Bottom; 
This is the index of the next element to leave the queue
INDEX Cnt; 
This is the current count of pointers that can be stored in the queue
_32 Lock; 
thread interlock using InterlockedExchange semaphore. For thread safety. 
POINTER pNode[2]; 
need two to have distinct empty/full conditions 

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.

Created with a commercial version of Doc-O-Matic. In order to make this message disappear you need to register this software. If you have problems registering this software please contact us at support@toolsfactory.com.
Copyright (c) 2000+. All rights reserved.
What do you think about this topic? Send feedback!