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

627 lines
18 KiB
C++
Raw Blame History

// ============================================================================
//
// Copyright (c) 1997 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 : $CGAL_Revision: $
// release_date : $CGAL_Date: $
//
// file : include/CGAL/Polyhedron_iterator_3.h
// package : Polyhedron 2.9 (13 Sep 2000)
// chapter : 3D-Polyhedral Surfaces
//
// revision : $Revision$
// revision_date : $Date$
//
// author(s) : Lutz Kettner <kettner@mpi-sb.mpg.de>)
// maintainer :
// coordinator : MPI Saarbruecken
//
// Iterator and Circulator for Polyhedral Surfaces.
// ============================================================================
#ifndef CGAL_POLYHEDRON_ITERATOR_3_H
#define CGAL_POLYHEDRON_ITERATOR_3_H 1
#ifndef CGAL_CIRCULATOR_H
#include <CGAL/circulator.h>
#endif
CGAL_BEGIN_NAMESPACE
// The following two iterator adaptors are actually no longer
// used by the polyhedral surface. The new design just uses the
// iterators provided by the halfedge data structure HDS.
// These two adaptors are still here for compatibility with
// other CGAL packages that rely on them. Since the names here
// have switched to an I_ prefix for internal identifiers,
// to macros provide the old names with the leading _ used so far.
#define _Polyhedron_iterator I_Polyhedron_iterator
#define _Polyhedron_const_iterator I_Polyhedron_const_iterator
// These two outdated iterator adaptors are similar to Iterator_project
// and Iterator_const_project, but they implement the arrow
// operator -> in any case. This is possible here since the items
// in a polyhedron are always classes with members.
// (These are all reminiscences of old compilers having trouble
// with the arrow operator.)
template < class I, class Val, class Dist, class Ctg>
class I_Polyhedron_iterator {
protected:
I nt; // The internal iterator.
public:
typedef I Iterator;
typedef I_Polyhedron_iterator<I,Val,Dist,Ctg> Self;
typedef Ctg iterator_category;
typedef Val value_type;
typedef value_type& reference;
typedef value_type* pointer;
typedef Dist difference_type;
// CREATION
// --------
I_Polyhedron_iterator() {}
I_Polyhedron_iterator( I j) : nt(j) {}
// OPERATIONS Forward Category
// ---------------------------
Iterator current_iterator() const { return nt;}
pointer ptr() const { return (pointer)(&(*nt)); }
bool operator==( const Self& i) const { return ( nt == i.nt); }
bool operator!=( const Self& i) const { return !(*this == i); }
reference operator*() const { return *ptr(); }
pointer operator->() const { return ptr(); }
Self& operator++() {
++nt;
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
--nt;
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
// OPERATIONS Random Access Category
// ---------------------------------
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; }
reference operator[]( difference_type n) const {
Self tmp = *this;
tmp += n;
return tmp.operator*();
}
bool operator< ( const Self& i) const { return ( nt < i.nt); }
bool operator> ( const Self& i) const { return i < *this; }
bool operator<=( const Self& i) const { return !(i < *this); }
bool operator>=( const Self& i) const { return !(*this < i); }
};
CGAL_END_NAMESPACE
// we don't need Koenig lookup here
template < class D, class I, class Val, class Dist, class Ctg>
inline
CGAL::I_Polyhedron_iterator<I,Val,Dist,Ctg>
operator+( D n, CGAL::I_Polyhedron_iterator<I,Val,Dist,Ctg> i) {
return i += Dist(n);
}
CGAL_BEGIN_NAMESPACE
template < class I, class II, class Val, class Dist, class Ctg>
class I_Polyhedron_const_iterator {
protected:
I nt; // The internal iterator.
public:
typedef I Iterator;
typedef I_Polyhedron_const_iterator<I,II,Val,Dist,Ctg> Self;
typedef Ctg iterator_category;
typedef Val value_type;
typedef const value_type& reference;
typedef const value_type* pointer;
typedef Dist difference_type;
typedef I_Polyhedron_iterator<II,Val,Dist,Ctg> mutable_iterator;
// CREATION
// --------
I_Polyhedron_const_iterator() {}
I_Polyhedron_const_iterator( Iterator j) : nt(j) {}
I_Polyhedron_const_iterator( mutable_iterator j) : nt( I(&*j)) {}
// OPERATIONS Forward Category
// ---------------------------
Iterator current_iterator() const { return nt;}
pointer ptr() const { return (pointer)(&(*nt)); }
bool operator==( const Self& i) const { return ( nt == i.nt); }
bool operator!=( const Self& i) const { return !(*this == i); }
reference operator*() const { return *ptr(); }
pointer operator->() const { return ptr(); }
Self& operator++() {
++nt;
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
--nt;
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
// OPERATIONS Random Access Category
// ---------------------------------
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; }
reference operator[]( difference_type n) const {
Self tmp = *this;
tmp += n;
return tmp.operator*();
}
bool operator< ( const Self& i) const { return ( nt < i.nt); }
bool operator> ( const Self& i) const { return i < *this; }
bool operator<=( const Self& i) const { return !(i < *this); }
bool operator>=( const Self& i) const { return !(*this < i); }
};
CGAL_END_NAMESPACE
// we don't need Koenig lookup here
template < class D, class I, class II, class Val, class Dist, class Ctg>
inline
CGAL::I_Polyhedron_const_iterator<I,II,Val,Dist,Ctg>
operator+( D n, CGAL::I_Polyhedron_const_iterator<I,II,Val,Dist,Ctg> i) {
return i += Dist(n);
}
CGAL_BEGIN_NAMESPACE
template < class It, class Ctg>
class I_Polyhedron_facet_circ : public It {
public:
typedef It Iterator;
typedef Ctg iterator_category;
typedef I_Polyhedron_facet_circ<It,Ctg> Self;
typedef std::iterator_traits<It> Traits;
typedef typename Traits::value_type value_type;
typedef typename Traits::difference_type difference_type;
typedef std::size_t size_type;
typedef typename Traits::reference reference;
typedef typename Traits::pointer pointer;
// CREATION
// --------
I_Polyhedron_facet_circ() {}
explicit I_Polyhedron_facet_circ( It i) : It(i) {}
template <class It2, class Ctg2>
I_Polyhedron_facet_circ( const I_Polyhedron_facet_circ<It2,Ctg2> &c)
: It((const It2&)(c)) {}
// OPERATIONS Forward Category
// ---------------------------
// pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == 0);
return It::operator==( It());
}
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); }
// operator* and operator-> are inherited.
Self& operator++() {
*((Iterator*)this) = (*this)->next();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
*((Iterator*)this) = (*this)->prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
template < class It, class Ctg>
class I_Polyhedron_vertex_circ : public It {
public:
typedef It Iterator;
typedef Ctg iterator_category;
typedef I_Polyhedron_vertex_circ<It,Ctg> Self;
typedef std::iterator_traits<It> Traits;
typedef typename Traits::value_type value_type;
typedef typename Traits::difference_type difference_type;
typedef std::size_t size_type;
typedef typename Traits::reference reference;
typedef typename Traits::pointer pointer;
// CREATION
// --------
I_Polyhedron_vertex_circ() {}
explicit I_Polyhedron_vertex_circ( It i) : It(i) {}
template <class It2, class Ctg2>
I_Polyhedron_vertex_circ( const I_Polyhedron_vertex_circ<It2,Ctg2> &c)
: It((const It2&)(c)) {}
// OPERATIONS Forward Category
// ---------------------------
// pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == 0);
return It::operator==( It());
}
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); }
// operator* and operator-> are inherited.
Self& operator++() {
*((Iterator*)this) = (*this)->next()->opposite();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
*((Iterator*)this) = (*this)->opposite()->prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
// Determine the circulator category: If prev() is supported,
// its bidirectional, otherwise its forward.
template < class T> struct Polyhedron_circulator_traits {};
CGAL_TEMPLATE_NULL
struct Polyhedron_circulator_traits<Tag_true> {
typedef Bidirectional_circulator_tag iterator_category;
};
CGAL_TEMPLATE_NULL
struct Polyhedron_circulator_traits<Tag_false> {
typedef Forward_circulator_tag iterator_category;
};
// portability with other code using the old polyhedron circulators
template < class Node, class It, class Ctg>
class _Polyhedron_facet_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Polyhedron_facet_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef value_type& reference;
typedef value_type* pointer;
// CREATION
// --------
_Polyhedron_facet_circ() : It(0) {}
//_Polyhedron_facet_circ( pointer p) : It(p) {}
_Polyhedron_facet_circ( It i) : It(i) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == CGAL_CIRC_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++() {
this->nt = (*this->nt).next();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
this->nt = (*this->nt).prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
template < class Node, class It, class Ctg>
class _Polyhedron_facet_const_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Polyhedron_facet_const_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef const value_type& reference;
typedef const value_type* pointer;
// CREATION
// --------
_Polyhedron_facet_const_circ() : It(0) {}
_Polyhedron_facet_const_circ( pointer p) : It(p) {}
_Polyhedron_facet_const_circ( It i) : It(i) {}
template <class NN, class II, class CTG>
_Polyhedron_facet_const_circ( const _Polyhedron_facet_circ<NN,II,CTG>& c)
: It(c.ptr()) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == CGAL_CIRC_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++() {
this->nt = (*this->nt).next();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
this->nt = (*this->nt).prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
template < class Node, class It, class Ctg>
class _Polyhedron_vertex_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Polyhedron_vertex_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef value_type& reference;
typedef value_type* pointer;
// CREATION
// --------
_Polyhedron_vertex_circ() : It(0) {}
//_Polyhedron_vertex_circ( pointer p) : It(p) {}
_Polyhedron_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 == CGAL_CIRC_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++() {
this->nt = (*this->nt).next()->opposite();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
this->nt = (*this->nt).opposite()->prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
template < class Node, class It, class Ctg>
class _Polyhedron_vertex_const_circ : public It {
// Ptr nt; // The internal node ptr inherited from It.
public:
typedef It Base;
typedef _Polyhedron_vertex_const_circ<Node,It,Ctg> Self;
typedef Ctg iterator_category;
typedef Node value_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef const value_type& reference;
typedef const value_type* pointer;
// CREATION
// --------
_Polyhedron_vertex_const_circ() : It(0) {}
_Polyhedron_vertex_const_circ( pointer p) : It(p) {}
_Polyhedron_vertex_const_circ( It i) : It(i) {}
template <class NN, class II, class CTG>
_Polyhedron_vertex_const_circ( const _Polyhedron_vertex_circ<NN,II,CTG>& c)
: It(c.ptr()) {}
// OPERATIONS Forward Category
// ---------------------------
pointer ptr() const { return & It::operator*();}
bool operator==( CGAL_NULL_TYPE p) const {
CGAL_assertion( p == CGAL_CIRC_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++() {
this->nt = (*this->nt).next()->opposite();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++*this;
return tmp;
}
// OPERATIONS Bidirectional Category
// ---------------------------------
Self& operator--() {
this->nt = (*this->nt).opposite()->prev();
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
};
CGAL_END_NAMESPACE
#endif // CGAL_POLYHEDRON_ITERATOR_3_H //
// EOF //
Reference in New Issue View Git Blame Copy Permalink