blob: e86c5ba461f304dff45adcd88ade26409b19bb87 (
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
|
// 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_Pnt2dBisec_HeaderFile
#define _GccAna_Pnt2dBisec_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 _gp_Lin2d_HeaderFile
#include <gp_Lin2d.hxx>
#endif
class StdFail_NotDone;
class gp_Pnt2d;
class gp_Lin2d;
//! This class implements the algorithms used to <br>
//! create the bisecting line between two 2d points <br>
//! Describes functions for building a bisecting line between two 2D points. <br>
//! The bisecting line between two points is the bisector of <br>
//! the segment which joins the two points, if these are not coincident. <br>
//! The algorithm does not find a solution if the two points are coincident. <br>
//! A Pnt2dBisec object provides a framework for: <br>
//! - defining the construction of the bisecting line, <br>
//! - implementing the construction algorithm, and consulting the result. <br>
class GccAna_Pnt2dBisec {
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 a bisecting line between the points Point1 and Point2. <br>
Standard_EXPORT GccAna_Pnt2dBisec(const gp_Pnt2d& Point1,const gp_Pnt2d& Point2);
//! Returns true (this construction algorithm never fails). <br>
Standard_EXPORT Standard_Boolean IsDone() const;
//! Returns true if this algorithm has a solution, i.e. if the <br>
//! two points are not coincident. <br>
Standard_EXPORT Standard_Boolean HasSolution() const;
//! Returns a line, representing the solution computed by this algorithm. <br>
Standard_EXPORT gp_Lin2d ThisSolution() const;
protected:
private:
Standard_Boolean WellDone;
Standard_Boolean HasSol;
gp_Lin2d linsol;
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
