blob: 720ba60428b0e484b3d88214ee2ee3fae34afa0f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
// This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _Interface_GraphContent_HeaderFile
#define _Interface_GraphContent_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Interface_EntityIterator_HeaderFile
#include <Interface_EntityIterator.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _Handle_Standard_Transient_HeaderFile
#include <Handle_Standard_Transient.hxx>
#endif
class Interface_Graph;
class Standard_Transient;
class Interface_EntityIterator;
//! Defines general form for classes of graph algorithms on <br>
//! Interfaces, this form is that of EntityIterator <br>
//! Each sub-class fills it according to its own algorithm <br>
//! This also allows to combine any graph result to others, <br>
//! all being given under one unique form <br>
class Interface_GraphContent : public Interface_EntityIterator {
public:
void* operator new(size_t,void* anAddress)
{
return anAddress;
}
void* operator new(size_t size)
{
return Standard::Allocate(size);
}
void operator delete(void *anAddress)
{
if (anAddress) Standard::Free((Standard_Address&)anAddress);
}
//! Creates an empty GraphContent, ready to be filled <br>
Standard_EXPORT Interface_GraphContent();
//! Creates with all entities designated by a Graph <br>
Standard_EXPORT Interface_GraphContent(const Interface_Graph& agraph);
//! Creates with entities having specific Status value in a Graph <br>
Standard_EXPORT Interface_GraphContent(const Interface_Graph& agraph,const Standard_Integer stat);
//! Creates an Iterator with Shared entities of an entity <br>
//! (equivalente to EntityIterator but with a Graph) <br>
Standard_EXPORT Interface_GraphContent(const Interface_Graph& agraph,const Handle(Standard_Transient)& ent);
//! Gets all Entities designated by a Graph (once created), adds <br>
//! them to those already recorded <br>
Standard_EXPORT void GetFromGraph(const Interface_Graph& agraph) ;
//! Gets entities from a graph which have a specific Status value <br>
//! (one created), adds them to those already recorded <br>
Standard_EXPORT void GetFromGraph(const Interface_Graph& agraph,const Standard_Integer stat) ;
//! Returns Result under the exact form of an EntityIterator : <br>
//! Can be used when EntityIterator itself is required (as a <br>
//! returned value for instance), whitout way for a sub-class <br>
Standard_EXPORT Interface_EntityIterator Result() ;
//! Does the Evaluation before starting the iteration itself <br>
//! (in out) <br>
Standard_EXPORT void Begin() ;
//! Evaluates list of Entities to be iterated. Called by Start <br>
//! Default is set to doing nothing : intended to be redefined <br>
//! by each sub-class <br>
Standard_EXPORT virtual void Evaluate() ;
protected:
private:
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
