ACE_Fixed_Set_Iterator< T, ACE_SIZE > Class Template Reference
Iterates through an unordered set. More...
#include <Containers_T.h>
Inheritance diagram for ACE_Fixed_Set_Iterator< T, ACE_SIZE >:
Collaboration diagram for ACE_Fixed_Set_Iterator< T, ACE_SIZE >:
Public Member Functions | |
| ACE_Fixed_Set_Iterator (ACE_Fixed_Set< T, ACE_SIZE > &s) | |
| int | next (T *&next_item) |
| void | dump () const |
| Dump the state of an object. | |
| int | remove (T *&item) |
| T & | operator* () |
| Public Member Functions inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE > | |
| int | next (T *&next_item) |
| int | advance () |
| int | first () |
| int | done () const |
| Returns 1 when all items have been seen, else 0. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
| Public Attributes inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE > | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Additional Inherited Members | |
| Protected Member Functions inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE > | |
| ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s) | |
| void | dump_i () const |
| Dump the state of an object. | |
| int | next_i (T *&next_item) |
| Protected Attributes inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE > | |
| ACE_Fixed_Set< T, ACE_SIZE > & | s_ |
| Set we are iterating over. | |
| ssize_t | next_ |
| How far we've advanced over the set. | |
| size_t | iterated_items_ |
| The number of non free items that the iterator had pointed at. | |
Detailed Description
template<class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Iterator< T, ACE_SIZE >
class ACE_Fixed_Set_Iterator< T, ACE_SIZE >
Iterates through an unordered set.
This implementation of an unordered set uses a fixed array. Allows deletions while iteration is occurring.
Constructor & Destructor Documentation
◆ ACE_Fixed_Set_Iterator()
template<class T, size_t ACE_SIZE>
| ACE_Fixed_Set_Iterator< T, ACE_SIZE >::ACE_Fixed_Set_Iterator | ( | ACE_Fixed_Set< T, ACE_SIZE > & | s | ) |
Member Function Documentation
◆ dump()
template<class T, size_t ACE_SIZE>
| size_t ACE_SIZE void ACE_Fixed_Set_Iterator< T, ACE_SIZE >::dump | ( | ) | const |
Dump the state of an object.
◆ next()
template<class T, size_t ACE_SIZE>
| int ACE_Fixed_Set_Iterator< T, ACE_SIZE >::next | ( | T *& | next_item | ) |
Pass back the {next_item} that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.
◆ operator*()
template<class T, size_t ACE_SIZE>
| T & ACE_Fixed_Set_Iterator< T, ACE_SIZE >::operator* | ( | ) |
STL-like iterator dereference operator: returns a reference to the node underneath the iterator.
◆ remove()
template<class T, size_t ACE_SIZE>
| int ACE_Fixed_Set_Iterator< T, ACE_SIZE >::remove | ( | T *& | item | ) |
Remove the item where the itearetor is located at. Returns 1 if it removes a item, else 0. Pass back the removed {item}.
Member Data Documentation
◆ ACE_ALLOC_HOOK_DECLARE
template<class T, size_t ACE_SIZE>
| ACE_Fixed_Set_Iterator< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
The documentation for this class was generated from the following files:
Generated by
1.15.0