1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
// Copyright (c) 1997-2000 Max-Planck-Institute Saarbruecken (Germany).
// 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
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// 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/next/Nef_2/include/CGAL/Nef_2/Object_index.h $
// $Id: Object_index.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Michael Seel <seel@mpi-sb.mpg.de>
#ifndef CGAL_NEF_2_OBJECT_INDEX_H
#define CGAL_NEF_2_OBJECT_INDEX_H
#include <CGAL/basic.h>
#include <CGAL/Unique_hash_map.h>
#include <string>
#include <sstream>
namespace CGAL {
template <typename I>
class Object_index {
char _prefix;
CGAL::Unique_hash_map<I,int> _index;
public:
Object_index() : _prefix('\0'), _index(-1) {}
Object_index(I first, I beyond, char c=' ') : _prefix(c), _index(-1)
{ for(int i=0 ; first!=beyond; ++i,++first) _index[first]=i; }
int operator[](const I& it) const { return _index[it]; }
int& operator[](const I& it) { return _index[it]; }
void index(I first, I beyond, char c=' ')
{ _prefix=c;
for(int i=0 ; first!=beyond; ++i,++first) _index[first]=i;
}
std::string operator()(const I& it, bool verbose=true) const
{ if (verbose && _index[it]==-1) return "nil";
if (verbose && _index[it]==-2) return "end";
std::ostringstream os;
if (verbose) os << _prefix;
os << _index[it];
return os.str();
}
};
} //namespace CGAL
#endif //CGAL_NEF_2_OBJECT_INDEX_H
|
