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