![]() |
|
Class that efficiently stores a set of VdfNodes. More...
#include <nodeSet.h>
Public Types | |
| typedef TfBits::View< TfBits::AllSet >::const_iterator | iterator |
| Iterator types. | |
| typedef TfBits::View< TfBits::AllSet >::const_iterator | const_iterator |
Public Member Functions | |
| VdfNodeSet ()=default | |
| Default constructor. | |
| bool | IsEmpty () const |
| Is this set empty? | |
| size_t | GetSize () const |
| Get the number of elements contained in this set. | |
| VDF_API void | Clear () |
| Clears the node set. | |
| bool | Contains (const VdfNode &node) const |
Returns true if node is in the set. | |
| bool | Contains (const VdfIndex index) const |
Returns true if the node with the given index is in the set. | |
| void | Insert (const VdfNode &node) |
Inserts node into the set. | |
| VDF_API void | Insert (const VdfNodeSet &rhs) |
Inserts another nodeSet into this set. | |
| VDF_API bool | Remove (const VdfNode &node) |
Removes node from the set. | |
| const_iterator | begin () const |
| Returns an iterator at the beginning of the iterable range. | |
| const_iterator | end () const |
| Returns an iterator at the end of the iterable range. | |
Friends | |
| void | swap (VdfNodeSet &lhs, VdfNodeSet &rhs) |
| Swaps two VdfNodeSet instances. | |
Class that efficiently stores a set of VdfNodes.
Uses node indices to identify nodes, for efficient storage.
| typedef TfBits::View<TfBits::AllSet>::const_iterator const_iterator |
| typedef TfBits::View<TfBits::AllSet>::const_iterator iterator |
|
default |
Default constructor.
|
inline |
| VDF_API void Clear | ( | ) |
Clears the node set.
Note that unlike on STL containers, this method also reclaims memory.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
| VDF_API void Insert | ( | const VdfNodeSet & | rhs | ) |
Inserts another nodeSet into this set.
| VDF_API bool Remove | ( | const VdfNode & | node | ) |
Removes node from the set.
Returns true if node was contained in the set.
|
friend |
Swaps two VdfNodeSet instances.