|
Open CASCADE Technology
6.7.1
|
#include <NCollection_Queue.hxx>

Public Types | |
| typedef NCollection_TListNode < TheItemType > | QueueNode |
| typedef NCollection_TListIterator < TheItemType > | Iterator |
Public Member Functions | |
| NCollection_Queue (const Handle< NCollection_BaseAllocator > &theAllocator=0L) | |
| Constructor. More... | |
| NCollection_Queue (const NCollection_Queue &theOther) | |
| Copy constructor. More... | |
| virtual Standard_Integer | Size (void) const |
| Size - Number of items. More... | |
| Standard_Integer | Length (void) const |
| Length - number of items. More... | |
| virtual void | Assign (const NCollection_BaseCollection< TheItemType > &theOther) |
| Replace this list by the items of theOther collection. More... | |
| NCollection_Queue & | operator= (const NCollection_Queue &theOther) |
| Replace this list by the items of theOther queue. More... | |
| void | Clear (void) |
| Clear this queue. More... | |
| const TheItemType & | Front (void) const |
| Frontal item - constant. More... | |
| TheItemType & | ChangeFront (void) |
| Frontal item - variable. More... | |
| void | Push (const TheItemType &theItem) |
| Push one item. More... | |
| void | Pop (void) |
| Pop first item. More... | |
| ~NCollection_Queue (void) | |
| Destructor - clears the List. More... | |
Public Member Functions inherited from NCollection_BaseCollection< TheItemType > | |
| NCollection_BaseCollection (const Handle< NCollection_BaseAllocator > &theAllocator=0L) | |
| Common for all collections constructor takes care of theAllocator. More... | |
| virtual | ~NCollection_BaseCollection (void) |
| Destructor - must be implemented to release the memory. More... | |
| const Handle < NCollection_BaseAllocator > & | Allocator () const |
| Returns attached allocator. More... | |
Public Member Functions inherited from NCollection_BaseList | |
| Standard_Integer | Extent (void) const |
| Standard_Boolean | IsEmpty (void) const |
Purpose: A queue is a structure where Items are added at the end and removed from the front. The first entered Item will be the first removed. This is called a FIFO (First In First Out). Inherits BaseList, adds the data item to each node.
| typedef NCollection_TListIterator<TheItemType> NCollection_Queue< TheItemType >::Iterator |
| typedef NCollection_TListNode<TheItemType> NCollection_Queue< TheItemType >::QueueNode |
|
inline |
Constructor.
|
inline |
Copy constructor.
|
inline |
Destructor - clears the List.
|
inlinevirtual |
Replace this list by the items of theOther collection.
Implements NCollection_BaseCollection< TheItemType >.
|
inline |
Frontal item - variable.
|
inline |
Clear this queue.
|
inline |
Frontal item - constant.
|
inline |
Length - number of items.
|
inline |
Replace this list by the items of theOther queue.
|
inline |
Pop first item.
|
inline |
Push one item.
|
inlinevirtual |
Size - Number of items.
Implements NCollection_BaseCollection< TheItemType >.
1.8.5