blob: 244a1098fb862c0eb9df94c1a88b2eddbf81cc77 (
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
104
105
106
107
108
109
|
// 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 _GccAna_CircPnt2dBisec_HeaderFile
#define _GccAna_CircPnt2dBisec_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _gp_Circ2d_HeaderFile
#include <gp_Circ2d.hxx>
#endif
#ifndef _gp_Pnt2d_HeaderFile
#include <gp_Pnt2d.hxx>
#endif
#ifndef _Handle_GccInt_Bisec_HeaderFile
#include <Handle_GccInt_Bisec.hxx>
#endif
class Standard_OutOfRange;
class StdFail_NotDone;
class gp_Circ2d;
class gp_Pnt2d;
class GccInt_Bisec;
//! Describes functions for building a bisecting curve <br>
//! between a 2D circle and a point. <br>
//! A bisecting curve between a circle and a point is such a <br>
//! curve that each of its points is at the same distance from <br>
//! the circle and the point. It can be an ellipse, hyperbola, <br>
//! circle or line, depending on the relative position of the <br>
//! point and the circle. The algorithm computes all the <br>
//! elementary curves which are solutions. <br>
//! A CircPnt2dBisec object provides a framework for: <br>
//! - defining the construction of the bisecting curves, <br>
//! - implementing the construction algorithm, and <br>
//! - consulting the result. <br>
class GccAna_CircPnt2dBisec {
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);
}
//! Constructs bisecting curves between the circle Circle1 and the point Point2. <br>
Standard_EXPORT GccAna_CircPnt2dBisec(const gp_Circ2d& Circle1,const gp_Pnt2d& Point2);
//! Returns true (this construction algorithm never fails). <br>
Standard_EXPORT Standard_Boolean IsDone() const;
//! Returns the number of curves, representing solutions computed by this algorithm. <br>
Standard_EXPORT Standard_Integer NbSolutions() const;
//! Returns the solution number Index and raises OutOfRange <br>
//! exception if Index is greater than the number of solutions. <br>
//! Exceptions <br>
//! Standard_OutOfRange if Index is less than zero or <br>
//! greater than the number of solutions computed by this algorithm. <br>
Standard_EXPORT Handle_GccInt_Bisec ThisSolution(const Standard_Integer Index) const;
protected:
private:
Standard_Boolean WellDone;
Standard_Integer NbrSol;
gp_Circ2d circle;
gp_Pnt2d point;
Standard_Integer theposition;
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
