songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

removed unneeded methods 

corrected docu
This commit is contained in:
Eric Berberich 2007-09-04 11:05:09 +00:00
parent 8829904680
commit bfb4b02217
1 changed files with 3 additions and 69 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
Arrangement_on_surface_2/include/CGAL/Arr_torus_topology_traits_2.h
View File

@ -159,7 +159,7 @@ protected:
friend class Point_2_less_WE; friend class Point_2_less_WE;
friend class Point_2_less_NS; friend class Point_2_less_NS;
//! type of line of discontinuity //! type of curve of identification
typedef std::map< Point_2, Vertex*, Point_2_less_NS > typedef std::map< Point_2, Vertex*, Point_2_less_NS >
Identification_NS; Identification_NS;
typedef std::map< Point_2, Vertex*, Point_2_less_WE > typedef std::map< Point_2, Vertex*, Point_2_less_WE >
@ -770,7 +770,7 @@ protected:
public: public:
// TODO make protected // TODO make protected
/*! Get the vertex on line of identification associated with \c pt*/ /*! Get the vertex on curve of identification associated with \c pt*/
Vertex* vertex_NS(const Point_2& key) { Vertex* vertex_NS(const Point_2& key) {
typename Identification_NS::iterator it = typename Identification_NS::iterator it =
this->_m_identification_NS.find(key); this->_m_identification_NS.find(key);
@ -781,7 +781,7 @@ public:
return NULL; return NULL;
} }
/*! Get the vertex on line of identification associated with \c pt*/ /*! Get the vertex on curve of identification associated with \c pt*/
Vertex* vertex_WE(const Point_2& key) { Vertex* vertex_WE(const Point_2& key) {
typename Identification_WE::iterator it = typename Identification_WE::iterator it =
this->_m_identification_WE.find(key); this->_m_identification_WE.find(key);
@ -794,72 +794,6 @@ public:
protected: protected:
#if 0
/*! Get the beginning of all pairs of curve-end and its vertices
* along the line of discontinuity
*/
typename Identification_NS::iterator
curve_ends_and_vertices_on_identification_NS_begin() {
return _m_identification_NS.begin();
}
/*! Get the past-the-end value of all pairs of curve-end and its vertices
* along the line of discontinuity
*/
typename Identification_NS::iterator
curve_ends_and_vertices_on_identification_NS_end() {
return _m_identification_NS.end();
}
/*! Get the beginning of all pairs of curve-end and its vertices
* along the line of discontinuity (const version)
*/
typename Identification_NS::const_iterator
curve_ends_and_vertices_on_identification_NS_begin() const {
return _m_identification_NS.begin();
}
/*! Get the past-the-end value of all pairs of curve-end and its vertices
* along the line of discontinuity (const version)
*/
typename Identification_NS::const_iterator
curve_ends_and_vertices_on_identification_NS_end() const {
return _m_identification_NS.end();
}
/*! Get the beginning of all pairs of curve-end and its vertices
* along the line of discontinuity
*/
typename Identification_WE::iterator
curve_ends_and_vertices_on_identification_WE_begin() {
return _m_identification_WE.begin();
}
/*! Get the past-the-end value of all pairs of curve-end and its vertices
* along the line of discontinuity
*/
typename Identification_WE::iterator
curve_ends_and_vertices_on_identification_WE_end() {
return _m_identification_WE.end();
}
/*! Get the beginning of all pairs of curve-end and its vertices
* along the line of discontinuity (const version)
*/
typename Identification_WE::const_iterator
curve_ends_and_vertices_on_identification_WE_begin() const {
return _m_identification_WE.begin();
}
/*! Get the past-the-end value of all pairs of curve-end and its vertices
* along the line of discontinuity (const version)
*/
typename Identification_WE::const_iterator
curve_ends_and_vertices_on_identification_WE_end() const {
return _m_identification_WE.end();
}
#endif
/*! /*!
* Computes the number of crossing of a path with the curves * Computes the number of crossing of a path with the curves
* of identification * of identification