|
Open CASCADE Technology 6.5.2
|
Defines general form for classes of graph algorithms on
Interfaces, this form is that of EntityIterator
Each sub-class fills it according to its own algorithm
This also allows to combine any graph result to others,
all being given under one unique form
#include <Interface_GraphContent.hxx>

Public Member Functions | |
| void * | operator new (size_t, void *anAddress) |
| void * | operator new (size_t size) |
| void | operator delete (void *anAddress) |
| Interface_GraphContent () | |
| Creates an empty GraphContent, ready to be filled | |
| Interface_GraphContent (const Interface_Graph &agraph) | |
| Creates with all entities designated by a Graph | |
| Interface_GraphContent (const Interface_Graph &agraph, const Standard_Integer stat) | |
| Creates with entities having specific Status value in a Graph | |
| Interface_GraphContent (const Interface_Graph &agraph, const Handle< Standard_Transient > &ent) | |
| Creates an Iterator with Shared entities of an entity (equivalente to EntityIterator but with a Graph) | |
| void | GetFromGraph (const Interface_Graph &agraph) |
| Gets all Entities designated by a Graph (once created), adds them to those already recorded | |
| void | GetFromGraph (const Interface_Graph &agraph, const Standard_Integer stat) |
| Gets entities from a graph which have a specific Status value (one created), adds them to those already recorded | |
| Interface_EntityIterator | Result () |
| Returns Result under the exact form of an EntityIterator : Can be used when EntityIterator itself is required (as a returned value for instance), whitout way for a sub-class | |
| void | Begin () |
| Does the Evaluation before starting the iteration itself (in out) | |
| virtual void | Evaluate () |
| Evaluates list of Entities to be iterated. Called by Start Default is set to doing nothing : intended to be redefined by each sub-class | |
| Interface_GraphContent::Interface_GraphContent | ( | ) |
| Interface_GraphContent::Interface_GraphContent | ( | const Interface_Graph & | agraph | ) |
| Interface_GraphContent::Interface_GraphContent | ( | const Interface_Graph & | agraph, |
| const Standard_Integer | stat | ||
| ) |
| Interface_GraphContent::Interface_GraphContent | ( | const Interface_Graph & | agraph, |
| const Handle< Standard_Transient > & | ent | ||
| ) |
| void Interface_GraphContent::Begin | ( | ) |
| virtual void Interface_GraphContent::Evaluate | ( | ) | [virtual] |
Reimplemented in IFGraph_AllShared, IFGraph_AllConnected, IFGraph_Cumulate, IFGraph_Compare, IFGraph_ExternalSources, and IFGraph_Articulations.
| void Interface_GraphContent::GetFromGraph | ( | const Interface_Graph & | agraph, |
| const Standard_Integer | stat | ||
| ) |
| void Interface_GraphContent::GetFromGraph | ( | const Interface_Graph & | agraph | ) |
| void Interface_GraphContent::operator delete | ( | void * | anAddress | ) | [inline] |
Reimplemented from Interface_EntityIterator.
Reimplemented in IFGraph_AllShared, IFGraph_AllConnected, IFGraph_Cumulate, IFGraph_Compare, IFGraph_ExternalSources, and IFGraph_Articulations.
| void* Interface_GraphContent::operator new | ( | size_t | size | ) | [inline] |
Reimplemented from Interface_EntityIterator.
Reimplemented in IFGraph_AllShared, IFGraph_AllConnected, IFGraph_Cumulate, IFGraph_Compare, IFGraph_ExternalSources, and IFGraph_Articulations.
| void* Interface_GraphContent::operator new | ( | size_t | , |
| void * | anAddress | ||
| ) | [inline] |
Reimplemented from Interface_EntityIterator.
Reimplemented in IFGraph_AllShared, IFGraph_AllConnected, IFGraph_Cumulate, IFGraph_Compare, IFGraph_ExternalSources, and IFGraph_Articulations.
| Interface_EntityIterator Interface_GraphContent::Result | ( | ) |
1.7.4