Geogram Version 1.8.5
A programming library of geometric algorithms
Loading...
Searching...
No Matches
range.h
Go to the documentation of this file.
1/*
2 * Copyright (c) 2000-2022 Inria
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * * Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above copyright notice,
11 * this list of conditions and the following disclaimer in the documentation
12 * and/or other materials provided with the distribution.
13 * * Neither the name of the ALICE Project-Team nor the names of its
14 * contributors may be used to endorse or promote products derived from this
15 * software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 * POSSIBILITY OF SUCH DAMAGE.
28 *
29 * Contact: Bruno Levy
30 *
31 * https://www.inria.fr/fr/bruno-levy
32 *
33 * Inria,
34 * Domaine de Voluceau,
35 * 78150 Le Chesnay - Rocquencourt
36 * FRANCE
37 *
38 */
39
40#ifndef GEOGRAM_BASIC_RANGE
41#define GEOGRAM_BASIC_RANGE
42
44
52namespace GEO {
53
59 public:
60 no_iterator(index_t val) : val_(val) {
61 }
62
63 void operator++() {
64 ++val_;
65 }
66
67 bool operator==(const no_iterator& rhs) {
68 return val_ == rhs.val_;
69 }
70
71 bool operator!=(const no_iterator& rhs) {
72 return val_ != rhs.val_;
73 }
74
75 bool operator<(const no_iterator& rhs) {
76 return val_ < rhs.val_;
77 }
78
79 index_t operator*() const {
80 return val_;
81 }
82
83 private:
84 index_t val_;
85 };
86
90 template <class NO_ITERATOR> class range {
91 public:
92 typedef NO_ITERATOR no_iterator_t;
93
94 range(NO_ITERATOR b, NO_ITERATOR e) : begin_(b), end_(e) {
95 }
96
97 NO_ITERATOR begin() const {
98 return begin_;
99 }
100
101 NO_ITERATOR end() const {
102 return end_;
103 }
104
105 private:
106 NO_ITERATOR begin_;
107 NO_ITERATOR end_;
108 };
109}
110
111#endif
Wraps an integer for range-based for construct.
Definition range.h:58
A generic range bounded by two "non-iterators".
Definition range.h:90
Global Vorpaline namespace.
Definition algorithm.h:64
geo_index_t index_t
The type for storing and manipulating indices.
Definition numeric.h:287
Types and functions for numbers manipulation.