1 // Copyright (C) 2007-2015 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, or (at your option) any later version.
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
23 // Author : OPEN CASCADE
24 // File: GLViewer_Tools.h
25 // Created: April, 2005
27 #ifndef GLVIEWER_TOOLS_H
28 #define GLVIEWER_TOOLS_H
40 class GLVIEWER_API GLViewer_Tools
44 //virtual ~GLViewer_Tools();
52 FD_X = 0, /*along x axis*/
57 \class GLViewer_LineList
58 Tools for distinct line
59 This class implmented interface for segment operations:
60 add, cut, remove and etc.
61 Memory does not changed and allocated only one time
63 class GLViewer_LineList
66 GLViewer_LineList( int );
67 virtual ~GLViewer_LineList();
69 //! Returns number of segments
70 int count() const { return mySegmentNumber; }
72 int size() const { return myRealSize; }
74 bool addSegment( double coord1, double coord2 );
75 bool removeSegment( int index );
76 bool removeSegment( double coord1, double coord2 );
78 bool readSegment( int index, double& coord1, double& coord2 );
80 //! Returns index of segment, else -1
81 int contains( double thePoint ) const;
83 //! Sets level of segments
84 void setMainCoord( double theVal ) { myMainCoord = theVal; }
85 double mainCoord() const { return myMainCoord; }
90 void show( FieldDim );
92 GLViewer_LineList& operator = ( GLViewer_LineList );
102 /*! struct GraphNode describe node in algorithm on rare grid*/
109 int prevNodeIndex; //feedback for searching for solution
112 /*! struct SearchPoint describe node for solving algorithm*/
123 \class GLViewer_LineField
124 Tools for solving algorithm of finding shortest path on rare grid with minimum of
127 class GLViewer_LineField
137 //! Status of interation
146 //! Final status of solving
154 GLViewer_LineField();
155 GLViewer_LineField( const int theMAXSize, const int xn, const int yn );
156 virtual ~GLViewer_LineField();
159 /*!best way, if line is already sorted*/
160 void addLine( FieldDim, GLViewer_LineList* );
162 void addLine( FieldDim theDim, double theMC, double theBegin, double theEnd );
164 //! Adds new line and sorted field
165 /*! Returns position*/
166 int insertLine( FieldDim theDim, GLViewer_LineList*, int thePosition );
168 int insertLine( FieldDim theDim, double theMC, double theBegin, double theEnd, int thePosition );
170 //! Returns other dimension
171 static FieldDim invertDim( FieldDim );
173 //! Returns line by index and dimension
174 GLViewer_LineList* getLine( int index, FieldDim );
176 //! Nullifys field and sets same continued segments
177 void setBorders( double X1, double X2, double Y1, double Y2 );
178 //! Cut rectangle in grid
179 void addRectangle( double top, double right, double bottom, double left );
181 //! returns arrey of intersects indexes with \param theLL
182 int* intersectIndexes( FieldDim theDim, int theIndex, const GLViewer_LineList* theLL , int& theSize );
188 int getDimSize( FieldDim );
189 //! Returns number of segment
192 //! Sets start/end search point
193 bool setPoint( FieldPoint, double x, double y );
196 /*! Removes all multiple segments*/
198 //! Some prepare actions
199 /*! Needs call setPoint before*/
202 EndStatus startAlgorithm();
204 //! Returns solution and size of solution
205 double* solution( int& size );
208 //! One iteration of algorithm
210 //! Checks for complete status
211 IterationStatus checkComplete();
213 //! Finds LineList by counts and returns indexes
214 int* findByCount( int& theParam );
215 //! Finds LineList by segment and dimension
216 int findBySegment( FieldDim, int coord1, int coord2, bool inCurArray = true );
218 //! Returns current solution array
219 GraphNode* getCurArray();
221 GraphNode* getSecArray();
223 //! Returns maximum segment number
226 //! Returns list of LileList by dimension
227 GLViewer_LineList** getLLArray( FieldDim );
230 GLViewer_LineList** myXLineArray,
236 GraphNode* myGraphArray1,
240 SearchPoint myStartPoint,
245 #endif //GLVIEWER_TOOLS_H