Open CASCADE Technology  6.5.4
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
Data Structures
Interface_Graph.hxx File Reference
#include <Standard.hxx>
#include <Standard_DefineAlloc.hxx>
#include <Standard_Macro.hxx>
#include <Handle_Interface_InterfaceModel.hxx>
#include <TCollection_AsciiString.hxx>
#include <Handle_TColStd_HArray1OfInteger.hxx>
#include <Interface_BitMap.hxx>
#include <Handle_TColStd_HArray1OfListOfInteger.hxx>
#include <Standard_Boolean.hxx>
#include <Handle_Interface_Protocol.hxx>
#include <Handle_Interface_GTool.hxx>
#include <Standard_Integer.hxx>
#include <Handle_Standard_Transient.hxx>
#include <Handle_TColStd_HSequenceOfTransient.hxx>
#include <Handle_Standard_Type.hxx>
#include <Handle_TCollection_HAsciiString.hxx>

Data Structures

class  Interface_Graph
 Gives basic data structure for operating and storing
graph results (usage is normally internal)
Entities are Mapped according their Number in the Model

Each Entity from the Model can be known as "Present" or
not; if it is, it is Mapped with a Status : an Integer
which can be used according to needs of each algorithm
In addition, the Graph brings a BitMap which can be used
by any caller

Also, it is bound with two lists : a list of Shared
Entities (in fact, their Numbers in the Model) which is
filled by a ShareTool, and a list of Sharing Entities,
computed by deduction from the Shared Lists

Moreover, it is possible to redefine the list of Entities
Shared by an Entity (instead of standard answer by general
service Shareds) : this new list can be empty; it can
be changed or reset (i.e. to come back to standard answer)
More...