SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Tools/Counter.h

Go to the documentation of this file.

// Copyright (c) 2005  Stanford University (USA).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL 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.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Kinetic_data_structures/include/CGAL/Tools/Counter.h $
// $Id: Counter.h 36338 2007-02-15 21:30:59Z spion $
// 
//
// Author(s)     : Daniel Russel <drussel@alumni.princeton.edu>

#ifndef CGAL_DSR_COUNTER_H
#define CGAL_DSR_COUNTER_H

#include <iterator>
#include <CGAL/basic.h>
#include <CGAL/Tools/Label.h>

CGAL_BEGIN_NAMESPACE


template <class T=int, class W=T>
class Counter
{
    typedef Counter<T, W> This;
    public:
        Counter(T t=0):t_(t) {
        }
        This &operator++() {
            ++t_;
            return *this;
        }
        This operator++(int) {
            This ret= *this;
            ++t_;
            return ret;
        }
        W operator*() const
        {
            return W(t_);
        }
        W* operator->() const
        {
            static W ret;
            ret=W(t_);
            return &ret;
        }
        bool operator==(const This &o) const
        {
            return t_ == o.t_;
        }
        bool operator!=(const This &o) const
        {
            return t_ != o.t_;
        }
        bool operator<(const This &o) const
        {
            return t_ < o.t_;
        }
        T operator-(const This &o) const
        {
            return t_-o.t_;
        }
/*const This& operator+=(T &v) {
  t_+=v;
  return *this;
  }*/
        const This& operator+=(unsigned int v) {
            t_+=v;
            return *this;
        }
        const This& operator-=(T &v) {
            t_-=v;
            return *this;
        }
        template <class J>
        void operator()(const J&) {
            ++*this;
        }
        typedef std::random_access_iterator_tag iterator_category;
        typedef W value_type;
        typedef T difference_type;
        typedef W* pointer;
        typedef W& reference;
    protected:
        T t_;
};


/*template <>
template <class LT>
class Counter<int, Label<LT> >{
  typedef Label<LT> Label;
  typedef Counter<int, Label > This;
public:

  Counter(int t=0):t_(t){
  }
  This &operator++(){
    t_= Label(t_.index()+1);
return *this;
}
This operator++(int){
This ret= *this;
t_= Label(t_.index()+1);;
return ret;
}
Label operator*() const {
return t_;
}
const Label* operator->() const {
return &t_;
}
bool operator==(const This &o) const {
return t_ == o.t_;
}
bool operator!=(const This &o) const {
return t_ != o.t_;
}
bool operator<(const This &o) const {
return t_ < o.t_;
}
int operator-(const This &o) const {
return t_.index()-o.t_.index();
}

const This& operator+=(unsigned int v) {
t_= Label(t_.index()+v);
return *this;
}
const This& operator-=(int &v) {
t_ = Label(t_.index()-v);
return *this;
}
template <class J>
void operator()(const J&){
++*this;
}
typedef std::random_access_iterator_tag iterator_category;
typedef Label value_type;
typedef int difference_type;
typedef Label* pointer;
typedef Label& reference;
protected:
Label t_;
};*/

template <class T>
Counter<T> counter(T t)
{
    return Counter<T>(t);
}

CGAL_END_NAMESPACE

#endif