HDK
|
#include <GA_EdgeGroup.h>
Classes | |
class | base_iterator |
class | PrimEdge |
The edge data we store internally. More... | |
Public Types | |
typedef base_iterator< const GA_Edge, EdgeList::iterator > | iterator |
typedef base_iterator< const GA_Edge, EdgeList::const_iterator > | const_iterator |
Friends | |
class | GA_EdgeGroupTable |
Additional Inherited Members | |
![]() | |
static const char * | groupType (GA_GroupType type) |
static GA_GroupType | groupType (const char *type) |
static bool | jsonLoadDefinition (UT_JSONParser &p, UT_WorkBuffer &type, UT_WorkBuffer &name, bool &internal) |
Load the GA_Group-Definition. More... | |
![]() | |
GA_Group (const UT_StringHolder &name, bool internal, GA_GroupType type, bool detached) | |
virtual bool | setName (const UT_StringHolder &n) |
Definition at line 42 of file GA_EdgeGroup.h.
typedef base_iterator<const GA_Edge, EdgeList::const_iterator> GA_EdgeGroup::const_iterator |
Definition at line 191 of file GA_EdgeGroup.h.
typedef base_iterator<const GA_Edge, EdgeList::iterator> GA_EdgeGroup::iterator |
Definition at line 190 of file GA_EdgeGroup.h.
|
override |
bool GA_EdgeGroup::add | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) |
Add an edge to this group. Returns true
if the edge was added, and false
if the edge already existed.
bool GA_EdgeGroup::add | ( | GA_Offset | p0, |
GA_Offset | p1, | ||
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) |
Add an edge to this group. Returns true
if the edge was added, and false
if the edge already existed.
bool GA_EdgeGroup::add | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) |
Add an edge to this group. Returns true
if the edge was added, and false
if the edge already existed.
bool GA_EdgeGroup::add | ( | GA_Offset | p0, |
GA_Offset | p1, | ||
const GA_Primitive * | prim | ||
) |
Add an edge to this group. Returns true
if the edge was added, and false
if the edge already existed.
|
overridevirtual |
Add all edges from the associated detail into this edge group.
Implements GA_Group.
Returns an iterator pointing at the beginning of the list of edges of this edge group.
Definition at line 205 of file GA_EdgeGroup.h.
|
inline |
Definition at line 218 of file GA_EdgeGroup.h.
void GA_EdgeGroup::bumpDataId | ( | ) |
void GA_EdgeGroup::cloneDataId | ( | const GA_EdgeGroup & | src | ) |
Combine another group with this edge group. Currently, only edge groups are supported. Returns true
if the other group was combined with this one.
Reimplemented from GA_Group.
bool GA_EdgeGroup::contains | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) | const |
Returns true
if an edge exists in this group, matching the input data.
bool GA_EdgeGroup::contains | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) | const |
Returns true
if an edge exists in this group, matching the input data.
|
overridevirtual |
Count memory usage using a UT_MemoryCounter in order to count shared memory correctly. If inclusive is true, the size of this object is counted, else only memory owned by this object is counted. If this is pointed to by the calling object, inclusive should be true. If this is contained in the calling object, inclusive should be false. (Its memory was already counted in the size of the calling object.)
Implements GA_Group.
void GA_EdgeGroup::defragment | ( | const GA_Defragment & | defrag | ) |
Interface for defragmentation.
Returns an iterator pointing at the beginning of the list of edges of this edge group.
Definition at line 215 of file GA_EdgeGroup.h.
|
inline |
Definition at line 221 of file GA_EdgeGroup.h.
|
inlineoverridevirtual |
Returns the number of edges in this group.
Implements GA_Group.
Definition at line 304 of file GA_EdgeGroup.h.
|
inline |
Definition at line 323 of file GA_EdgeGroup.h.
const_iterator GA_EdgeGroup::find | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) | const |
Search for an edge matching the input. If the edge was found, it returns an iterator pointing at the edge in the list. Otherwise returns the end
iterator.
const_iterator GA_EdgeGroup::find | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) | const |
Search for an edge matching the input. If the edge was found, it returns an iterator pointing at the edge in the list. Otherwise returns the end
iterator.
iterator GA_EdgeGroup::find | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) |
Search for an edge matching the input. If the edge was found, it returns an iterator pointing at the edge in the list. Otherwise returns the end
iterator.
iterator GA_EdgeGroup::find | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) |
Search for an edge matching the input. If the edge was found, it returns an iterator pointing at the edge in the list. Otherwise returns the end
iterator.
|
inline |
Definition at line 371 of file GA_EdgeGroup.h.
Implements GA_Group.
Definition at line 198 of file GA_EdgeGroup.h.
|
inline |
Definition at line 397 of file GA_EdgeGroup.h.
|
inline |
Definition at line 388 of file GA_EdgeGroup.h.
|
overridevirtual |
Report memory usage.
Implements GA_Group.
|
inline |
Returns true
if this edge group is empty.
Definition at line 307 of file GA_EdgeGroup.h.
|
overridevirtual |
|
overridevirtual |
|
overridevirtual |
Load the private JSON data.
Implements GA_Group.
|
overridevirtual |
Save data to a JSON stream.
Private data for an edge group
Implements GA_Group.
void GA_EdgeGroup::makeAllEdgesValid | ( | ) |
NOTE: You don't need to call this for groups in a SOP's output detail, because it will call GA_EdgeGroupTable::makeAllEdgesValid(), which can be more efficient than calling this for each edge group, (if there are multiple). This also won't do anything if the max of the topology data ID and the primitive list data ID is equal to myLastValidTopoId, so you have to make sure that any necessary bumping has occurred. This was added for use by GU_EdgeSelection::validateEdges().
GA_EdgeGroup& GA_EdgeGroup::operator&= | ( | const GA_EdgeGroup & | inputGroup | ) |
GA_EdgeGroup& GA_EdgeGroup::operator+= | ( | const GA_EdgeGroup & | inputGroup | ) |
GA_EdgeGroup& GA_EdgeGroup::operator-= | ( | const GA_EdgeGroup & | inputGroup | ) |
GA_EdgeGroup& GA_EdgeGroup::operator= | ( | const GA_EdgeGroup & | inputGroup | ) |
GA_EdgeGroup& GA_EdgeGroup::operator^= | ( | const GA_EdgeGroup & | inputGroup | ) |
GA_EdgeGroup& GA_EdgeGroup::operator|= | ( | const GA_EdgeGroup & | inputGroup | ) |
Combinatorial operatos.
Remove the edge pointed to by the iterator, and return an iterator pointing to the next edge in the group.
bool GA_EdgeGroup::remove | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) |
Remove the entry corresponding with the given edge and the optional primitive. Returns true
if an edge was deleted based on the search data.
bool GA_EdgeGroup::remove | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) |
Remove the entry corresponding with the given edge and the optional primitive. Returns true
if an edge was deleted based on the search data.
Definition at line 401 of file GA_EdgeGroup.h.
Definition at line 392 of file GA_EdgeGroup.h.
void GA_EdgeGroup::toggle | ( | ) |
Toggle the existence of all edges of the detail for this group.
bool GA_EdgeGroup::toggle | ( | const GA_Edge & | edge, |
GA_Offset | primoff = GA_INVALID_OFFSET |
||
) |
Toggles the existence of a given edge in the group. If the edge got removed, then this function returns false
, if it got added, however, true
is returned.
bool GA_EdgeGroup::toggle | ( | const GA_Edge & | edge, |
const GA_Primitive * | prim | ||
) |
Toggles the existence of a given edge in the group. If the edge got removed, then this function returns false
, if it got added, however, true
is returned.
|
inline |
Definition at line 277 of file GA_EdgeGroup.h.
|
friend |
Definition at line 46 of file GA_EdgeGroup.h.