|
HDK
|
#include <iterator.h>
Public Types | |
| using | iterator_category = std::random_access_iterator_tag |
| using | value_type = PcpNodeRef |
| using | reference = PcpNodeRef |
| using | pointer = _PtrProxy |
| using | difference_type = std::ptrdiff_t |
Friends | |
| class | PcpPrimIndex |
Object used to iterate over nodes in the prim index graph in strong-to-weak order.
Definition at line 33 of file iterator.h.
| using PcpNodeIterator::difference_type = std::ptrdiff_t |
Definition at line 48 of file iterator.h.
| using PcpNodeIterator::iterator_category = std::random_access_iterator_tag |
Definition at line 44 of file iterator.h.
| using PcpNodeIterator::pointer = _PtrProxy |
Definition at line 47 of file iterator.h.
| using PcpNodeIterator::reference = PcpNodeRef |
Definition at line 46 of file iterator.h.
Definition at line 45 of file iterator.h.
|
default |
Constructs an invalid iterator.
|
inline |
Definition at line 54 of file iterator.h.
| PCP_API PcpNodeIterator& PcpNodeIterator::MoveToNextSubtree | ( | ) |
|
inline |
Definition at line 127 of file iterator.h.
|
inline |
Definition at line 67 of file iterator.h.
|
inline |
Definition at line 101 of file iterator.h.
|
inline |
Definition at line 79 of file iterator.h.
|
inline |
Definition at line 89 of file iterator.h.
|
inline |
Definition at line 113 of file iterator.h.
|
inline |
Definition at line 75 of file iterator.h.
|
inline |
Definition at line 107 of file iterator.h.
|
inline |
Definition at line 84 of file iterator.h.
|
inline |
Definition at line 95 of file iterator.h.
|
inline |
Definition at line 118 of file iterator.h.
|
inline |
Definition at line 68 of file iterator.h.
|
inline |
Definition at line 131 of file iterator.h.
|
inline |
Definition at line 136 of file iterator.h.
|
inline |
Definition at line 123 of file iterator.h.
|
inline |
Definition at line 141 of file iterator.h.
|
inline |
Definition at line 146 of file iterator.h.
|
inline |
Definition at line 69 of file iterator.h.
|
friend |
Definition at line 152 of file iterator.h.