mirror of https://github.com/CGAL/cgal
232 lines
5.5 KiB
C++
232 lines
5.5 KiB
C++
// ============================================================================
|
|
//
|
|
// Copyright (c) 1999 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of an INTERNAL release
|
|
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
// intended for general use.
|
|
//
|
|
// ----------------------------------------------------------------------------
|
|
//
|
|
// release :
|
|
// release_date :
|
|
//
|
|
// file : include/CGAL/Triangulation_circulators_3.h
|
|
// revision : $Revision$
|
|
// author(s) : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
|
//
|
|
// coordinator : INRIA Sophia Antipolis (<Mariette.Yvinec@sophia.inria.fr>)
|
|
//
|
|
// ============================================================================
|
|
|
|
#ifndef CGAL_TRIANGULATION_CIRCULATORS_3_H
|
|
#define CGAL_TRIANGULATION_CIRCULATORS_3_H
|
|
|
|
#include <CGAL/basic.h>
|
|
#include <CGAL/Triangulation_short_names_3.h>
|
|
#include <CGAL/triangulation_assertions.h>
|
|
#include <CGAL/circulator.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template <class Tr>
|
|
class Triangulation_cell_circulator_3
|
|
: public Bidirectional_circulator_base<CGAL_TYPENAME_MSVC_NULL Tr::Cell,
|
|
ptrdiff_t, size_t>
|
|
{
|
|
typedef typename Tr::Triangulation_data_structure Tds;
|
|
typedef typename Tds::Cell Ctds;
|
|
typedef typename Tds::Cell_circulator Circulator_base;
|
|
|
|
typedef typename Tr::Cell Cell;
|
|
typedef typename Tr::Vertex Vertex;
|
|
typedef typename Tr::Edge Edge;
|
|
typedef typename Tr::Vertex_handle Vertex_handle;
|
|
typedef typename Tr::Cell_handle Cell_handle;
|
|
|
|
typedef Triangulation_cell_circulator_3<Tr> Cell_circulator;
|
|
public:
|
|
|
|
Triangulation_cell_circulator_3()
|
|
: _cb()
|
|
{}
|
|
|
|
Triangulation_cell_circulator_3(Cell_handle c, int s, int t)
|
|
: _cb( (Ctds *) &(*c), s, t )
|
|
{}
|
|
|
|
Triangulation_cell_circulator_3(const Edge & e)
|
|
: _cb( (Ctds *) &(*(e.first)), e.second, e.third )
|
|
{}
|
|
|
|
Triangulation_cell_circulator_3(Cell_handle c, int s, int t,
|
|
Cell_handle start)
|
|
: _cb( (Ctds *) &(*c), s, t, (Ctds *) &(*start) )
|
|
{}
|
|
|
|
Triangulation_cell_circulator_3(const Edge & e, Cell_handle start)
|
|
: _cb( (Ctds *) &(*(e.first)), e.second, e.third, (Ctds *) &(*start) )
|
|
{}
|
|
|
|
bool
|
|
operator==(const Cell_circulator & ccir) const
|
|
{
|
|
return ( _cb == ccir._cb);
|
|
}
|
|
|
|
bool
|
|
operator!=(const Cell_circulator & ccir) const
|
|
{
|
|
return ( !(*this == ccir) );
|
|
}
|
|
|
|
Cell_circulator &
|
|
operator++()
|
|
{
|
|
++_cb;
|
|
return *this;
|
|
}
|
|
|
|
Cell_circulator &
|
|
operator--()
|
|
{
|
|
--_cb;
|
|
return *this;
|
|
}
|
|
|
|
Cell_circulator
|
|
operator++(int)
|
|
{
|
|
Cell_circulator tmp(*this);
|
|
++(*this);
|
|
return tmp;
|
|
}
|
|
|
|
Cell_circulator
|
|
operator--(int)
|
|
{
|
|
Cell_circulator tmp(*this);
|
|
--(*this);
|
|
return tmp;
|
|
}
|
|
|
|
Cell & operator*() const
|
|
{
|
|
return (Cell &)(*_cb);
|
|
}
|
|
|
|
Cell* operator->() const
|
|
{
|
|
return (Cell*)( &(*_cb) );
|
|
}
|
|
|
|
private:
|
|
Circulator_base _cb;
|
|
};
|
|
|
|
template <class Tr>
|
|
class Triangulation_facet_circulator_3
|
|
: public Bidirectional_circulator_base<typename Tr::Facet, ptrdiff_t, size_t>
|
|
{
|
|
typedef typename Tr::Triangulation_data_structure Tds;
|
|
typedef typename Tds::Cell Ctds;
|
|
typedef typename Tds::Facet_circulator Circulator_base;
|
|
|
|
typedef typename Tr::Cell Cell;
|
|
typedef typename Tr::Vertex Vertex;
|
|
typedef typename Tr::Edge Edge;
|
|
typedef typename Tr::Facet Facet;
|
|
typedef typename Tr::Vertex_handle Vertex_handle;
|
|
typedef typename Tr::Cell_handle Cell_handle;
|
|
|
|
typedef Triangulation_facet_circulator_3<Tr> Facet_circulator;
|
|
public:
|
|
|
|
Triangulation_facet_circulator_3()
|
|
: _cb()
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(Cell_handle c, int s, int t)
|
|
: _cb( (Ctds *) &(*c), s, t )
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(const Edge & e)
|
|
: _cb( (Ctds *) &(*(e.first)), e.second, e.third )
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(Cell_handle c, int s, int t,
|
|
const Facet & start)
|
|
: _cb( (Ctds *) &(*c), s, t,
|
|
std::make_pair((Ctds *) &(*start.first), start.second) )
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(const Edge & e, const Facet & start)
|
|
: _cb( (Ctds *) &(*(e.first)), e.second, e.third,
|
|
std::make_pair((Ctds *) &(*start.first), start.second) )
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(Cell_handle c, int s, int t,
|
|
Cell_handle start, int f)
|
|
: _cb( (Ctds *) &(*c), s, t, (Ctds *) &(*start), f )
|
|
{}
|
|
|
|
Triangulation_facet_circulator_3(const Edge & e, Cell_handle start, int f)
|
|
: _cb( (Ctds *) &(*(e.first)), e.second, e.third, (Ctds *) &(*start), f )
|
|
{}
|
|
|
|
bool
|
|
operator==(const Facet_circulator & ccir) const
|
|
{
|
|
return _cb == ccir._cb;
|
|
}
|
|
|
|
bool
|
|
operator!=(const Facet_circulator & ccir) const
|
|
{
|
|
return !(*this == ccir);
|
|
}
|
|
|
|
Facet_circulator &
|
|
operator++()
|
|
{
|
|
++_cb;
|
|
return *this;
|
|
}
|
|
|
|
Facet_circulator &
|
|
operator--()
|
|
{
|
|
--_cb;
|
|
return *this;
|
|
}
|
|
|
|
Facet_circulator
|
|
operator++(int)
|
|
{
|
|
Facet_circulator tmp(*this);
|
|
++(*this);
|
|
return tmp;
|
|
}
|
|
|
|
Facet_circulator
|
|
operator--(int)
|
|
{
|
|
Facet_circulator tmp(*this);
|
|
--(*this);
|
|
return tmp;
|
|
}
|
|
|
|
Facet operator*() const
|
|
{
|
|
return std::make_pair( Cell_handle( (Cell *) ((*_cb).first) ),
|
|
(*_cb).second ) ;
|
|
}
|
|
|
|
private:
|
|
Circulator_base _cb;
|
|
};
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif // CGAL_TRIANGULATION_CIRCULATORS_3_H
|