// Copyright (c) 1999 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $Source: /CVSROOT/CGAL/Packages/Arrangement/include/CGAL/Arr_iterators.h,v $
// $Revision: 1.6 $ $Date: 2004/09/23 19:37:53 $
// $Name: $
//
// Author(s) : Iddo Hanniel
#ifndef CGAL_ARR_ITERATORS_H
#define CGAL_ARR_ITERATORS_H
//this part is taken from Lutz's polyhedron, with minor modifications for
//the planar map name convention
#ifndef CGAL_CIRCULATOR_H
#include <CGAL/circulator.h>
#endif
CGAL_BEGIN_NAMESPACE
////////////////////////////////////////////////////////////////////////
// ARR
////////////////////////////////////////////////////////////////////////
template < class Node, class It, class Ctg>
class _Arr_face_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Arr_face_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
// _Arr_face_circ() : It(0) {}
_Arr_face_circ() : It() {}
//_Polyhedron_facet_circ( pointer p) : It(p) {}
_Arr_face_circ( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
nt = (*nt).next_halfedge();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
/* When implemented change it
Self& operator--() {
nt = (*nt).previous_halfedge();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
*/
};
template < class Node, class It, class Ctg>
class _Arr_face_const_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Arr_face_const_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
_Arr_face_const_circ() : It(0) {}
_Arr_face_const_circ( const_pointer p) : It(p) {}
_Arr_face_const_circ( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
const_pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
nt = (*nt).next_halfedge();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
/*
Self& operator--() {
nt = (*nt).previous_halfedge();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
*/
};
template < class Node, class It, class Ctg>
class _Arr_vertex_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Arr_vertex_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
// _Arr_vertex_circ() : It(0) {}
_Arr_vertex_circ() : It() {}
//_Polyhedron_vertex_circ( pointer p) : It(p) {}
_Arr_vertex_circ( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
nt = (*nt).next_halfedge()->twin();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
/*
Self& operator--() {
nt = (*nt).twin()->previous_halfedge();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
*/
};
template < class Node, class It, class Ctg>
class _Arr_vertex_const_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Arr_vertex_const_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
_Arr_vertex_const_circ() : It(0) {}
_Arr_vertex_const_circ( const_pointer p) : It(p) {}
_Arr_vertex_const_circ( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
const_pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
nt = (*nt).next_halfedge()->twin();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
/*
Self& operator--() {
nt = (*nt).twin()->previous_halfedge();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
*/
};
///////////////////////////////////////////////////////////////////////
// ARR OVERLAP CIRCULATOR
// bidirectional circulator over overlapping edges - like above
template < class Node, class It, class Ctg>
class Arr_overlap_circulator : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef Arr_overlap_circulator<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
Arr_overlap_circulator() : It() {}
//try this
Arr_overlap_circulator( pointer p) : It(p) {}
Arr_overlap_circulator( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
//for this Subcurve_node needs to make the circ a friend
nt = (*nt).past_end_child;
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
nt = (*nt).begin_child;
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
template < class Node, class It, class Ctg>
class Arr_overlap_const_circulator : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef Arr_overlap_const_circulator<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
typedef size_t size_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
#ifndef CGAL_CFG_USING_BASE_MEMBER_BUG_3
using Base::nt;
#endif
// CREATION
// --------
Arr_overlap_const_circulator() : It(0) {}
Arr_overlap_const_circulator( const_pointer p) : It(p) {}
Arr_overlap_const_circulator( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
const_pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return It::operator==( It(NULL));
}
bool operator!=( CGAL_NULL_TYPE p) const {
return !(*this == p);
}
bool operator==( const Self& i) const {
return It::operator==(i);
}
bool operator!=( const Self& i) const {
return !(*this == i);
}
Self& operator++() {
nt = (*nt).past_end_child; //needs to be friend
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
nt = It((*nt).begin_child);
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
#ifdef BOGI
//old implementation
#ifdef CGAL_CFG_NO_DEFAULT_PREVIOUS_TEMPLATE_ARGUMENTS
template < class C, class Fct /*, class Ref, class Ptr*/>
#else
template < class C,
class Fct>
// class Ref = typename C::reference,
// class Ptr = typename C::pointer>
#endif
class Arr_overlap_circulator {
protected:
C nt; // The internal circulator.
public:
typedef C Circulator;
//typedef Circulator_project<C,Fct,Ref,Ptr> Self;
typedef Arr_overlap_circulator<C,Fct/*,Ref,Ptr*/> Self;
//typedef typename C::iterator_category iterator_category;
typedef std::bidirectional_iterator_tag iterator_category;
//typedef typename Fct::result_type value_type;
typedef Fct value_type;
//typedef typename C::difference_type difference_type;
// Metrowerks expects std:: before ptrdiff_t
typedef CGAL_CLIB_STD::ptrdiff_t difference_type;
//typedef typename C::size_type size_type;
typedef size_t size_type;
//typedef Ref reference;
//just for this special case (since Fct is an iterator) :
typedef Fct reference;
//typedef Ptr pointer;
typedef C pointer; //just for this special case
// CREATION
// --------
Arr_overlap_circulator() {}
Arr_overlap_circulator( Circulator j) : nt(j) {}
// OPERATIONS Forward Category
// ---------------------------
Circulator current_circulator() const { return nt;}
//Ptr ptr() const {
pointer ptr() const {
//Fct fct;
return nt;
//return &(fct(*nt));
}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == NULL);
return ( nt == NULL);
}
bool operator!=( CGAL_NULL_TYPE p) const { return !(*this == p); }
bool operator==( const Self& i) const { return ( nt == i.nt); }
bool operator!=( const Self& i) const { return !(*this == i); }
//Ref operator*() const { return *ptr(); }
//Ptr operator->() const { return ptr(); }
reference operator*() const { return Fct(nt); }
pointer operator->() const { return nt; } //this is a bit meaningless
Self& operator++() {
//++nt;
nt=nt->past_end_child; //for this Edge_node needs to make the circ a friend
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
//--nt;
nt=nt->begin_child; //for this Edge_node needs to make the circ a friend
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
/*
// OPERATIONS Random Access Category
// ---------------------------------
Self min_circulator() const {
return Self( nt.min_circulator());
}
Self& operator+=( difference_type n) {
nt += n;
return *this;
}
Self operator+( difference_type n) const {
Self tmp = *this;
return tmp += n;
}
Self& operator-=( difference_type n) {
return operator+=( -n);
}
Self operator-( difference_type n) const {
Self tmp = *this;
return tmp += -n;
}
difference_type operator-( const Self& i) const {
return nt - i.nt;
}
Ref operator[]( difference_type n) const {
Self tmp = *this;
tmp += n;
return tmp.operator*();
}
*/
};
#endif //BOGI
CGAL_END_NAMESPACE
#endif
// EOF //
syntax highlighted by Code2HTML, v. 0.9.1