1 // Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // Author : OPEN CASCADE
23 // File: GLViewer_Tools.h
24 // Created: April, 2005
26 #ifndef GLVIEWER_TOOLS_H
27 #define GLVIEWER_TOOLS_H
39 class GLVIEWER_API GLViewer_Tools
43 //virtual ~GLViewer_Tools();
51 FD_X = 0, /*along x axis*/
56 \class GLViewer_LineList
57 Tools for distinct line
58 This class implmented interface for segment operations:
59 add, cut, remove and etc.
60 Memory does not changed and allocated only one time
62 class GLViewer_LineList
65 GLViewer_LineList( int );
66 virtual ~GLViewer_LineList();
68 //! Returns number of segments
69 int count() const { return mySegmentNumber; }
71 int size() const { return myRealSize; }
73 bool addSegment( double coord1, double coord2 );
74 bool removeSegment( int index );
75 bool removeSegment( double coord1, double coord2 );
77 bool readSegment( int index, double& coord1, double& coord2 );
79 //! Returns index of segment, else -1
80 int contains( double thePoint ) const;
82 //! Sets level of segments
83 void setMainCoord( double theVal ) { myMainCoord = theVal; }
84 double mainCoord() const { return myMainCoord; }
89 void show( FieldDim );
91 GLViewer_LineList& operator = ( GLViewer_LineList );
101 /*! struct GraphNode describe node in algorithm on rare grid*/
108 int prevNodeIndex; //feedback for searching for solution
111 /*! struct SearchPoint describe node for solving algorithm*/
122 \class GLViewer_LineField
123 Tools for solving algorithm of finding shortest path on rare grid with minimum of
126 class GLViewer_LineField
136 //! Status of interation
145 //! Final status of solving
153 GLViewer_LineField();
154 GLViewer_LineField( const int theMAXSize, const int xn, const int yn );
155 virtual ~GLViewer_LineField();
158 /*!best way, if line is already sorted*/
159 void addLine( FieldDim, GLViewer_LineList* );
161 void addLine( FieldDim theDim, double theMC, double theBegin, double theEnd );
163 //! Adds new line and sorted field
164 /*! Returns position*/
165 int insertLine( FieldDim theDim, GLViewer_LineList*, int thePosition );
167 int insertLine( FieldDim theDim, double theMC, double theBegin, double theEnd, int thePosition );
169 //! Returns other dimension
170 static FieldDim invertDim( FieldDim );
172 //! Returns line by index and dimension
173 GLViewer_LineList* getLine( int index, FieldDim );
175 //! Nullifys field and sets same continued segments
176 void setBorders( double X1, double X2, double Y1, double Y2 );
177 //! Cut rectangle in grid
178 void addRectangle( double top, double right, double bottom, double left );
180 //! returns arrey of intersects indexes with \param theLL
181 int* intersectIndexes( FieldDim theDim, int theIndex, const GLViewer_LineList* theLL , int& theSize );
187 int getDimSize( FieldDim );
188 //! Returns number of segment
191 //! Sets start/end search point
192 bool setPoint( FieldPoint, double x, double y );
195 /*! Removes all multiple segments*/
197 //! Some prepare actions
198 /*! Needs call setPoint before*/
201 EndStatus startAlgorithm();
203 //! Returns solution and size of solution
204 double* solution( int& size );
207 //! One iteration of algorithm
209 //! Checks for complete status
210 IterationStatus checkComplete();
212 //! Finds LineList by counts and returns indexes
213 int* findByCount( int& theParam );
214 //! Finds LineList by segment and dimension
215 int findBySegment( FieldDim, int coord1, int coord2, bool inCurArray = true );
217 //! Returns current solution array
218 GraphNode* getCurArray();
220 GraphNode* getSecArray();
222 //! Returns maximum segment number
225 //! Returns list of LileList by dimension
226 GLViewer_LineList** getLLArray( FieldDim );
229 GLViewer_LineList** myXLineArray,
235 GraphNode* myGraphArray1,
239 SearchPoint myStartPoint,
244 #endif //GLVIEWER_TOOLS_H