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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/* Copyright (c) 1997-2024
Ewgenij Gawrilow, Michael Joswig, and the polymake team
Technische Universität Berlin, Germany
https://polymake.org
This program is free software; 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 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
--------------------------------------------------------------------------------
*/
#pragma once
#include "polymake/GenericSet.h"
namespace polymake { namespace polytope {
template <typename E>
class CubeFacet_iterator {
public:
using iterator_category = std::forward_iterator_tag;
using value_type = E;
using reference = const E&;
using pointer = const E*;
using difference_type = ptrdiff_t;
using iterator = CubeFacet_iterator;
using const_iterator = iterator;
CubeFacet_iterator() { }
CubeFacet_iterator(const E& cur_arg,
const E& step_arg,
const E& end_arg)
: cur(cur_arg), lim(cur_arg+step_arg), step(step_arg), end(end_arg) { }
reference operator* () const { return cur; }
pointer operator-> () const { return &cur; }
iterator& operator++ () {
if (++cur == lim) {
cur += step;
lim += (step<<1);
}
return *this;
}
const iterator operator++ (int) { iterator copy=*this; operator++(); return copy; }
bool at_end() const { return cur==end; }
bool operator== (const iterator& it) const { return cur==it.cur; }
bool operator!= (const iterator& it) const { return !operator==(it); }
protected:
E cur, lim, step, end;
};
/// Virtual container enumerating the verices in a facet of a cube
template <typename E>
class CubeFacet
: public GenericSet< CubeFacet<E>, E, operations::cmp> {
public:
using value_type = E;
using const_reference = const E&;
using reference = const_reference;
CubeFacet() { }
CubeFacet(const E& start_arg,
const E& step_arg,
const E& size_arg)
: start(start_arg), step(step_arg), size_(size_arg) { }
using iterator = CubeFacet_iterator<E>;
using const_iterator = iterator;
iterator begin() const { return iterator(start, step, start+size_); }
iterator end() const { return iterator(start+size_, step, start+size_); }
reference front() const { return start; }
const E& size() const { return size_; }
bool empty() const { return size_ == 0; }
protected:
E start, step, size_;
};
template <typename E>
class CubeFacets_iterator : protected CubeFacet<E> {
public:
typedef std::forward_iterator_tag iterator_category;
typedef CubeFacet<E> value_type;
typedef const value_type& reference;
typedef const value_type* pointer;
typedef ptrdiff_t difference_type;
typedef CubeFacets_iterator iterator;
typedef iterator const_iterator;
CubeFacets_iterator() { }
CubeFacets_iterator(const E& start_arg,
const E& step_arg,
const E& size_arg)
: value_type(start_arg, step_arg, size_arg)
, start(start_arg) { }
reference operator* () const { return *this; }
pointer operator-> () const { return this; }
iterator& operator++ () {
if (value_type::start == start) {
value_type::start += this->step;
} else {
value_type::start=start;
this->step <<= 1;
}
return *this;
}
const iterator operator++ (int) { iterator copy=*this; operator++(); return copy; }
bool operator== (const iterator& it) const
{
return this->step==it.step && value_type::start==it.value_type::start;
}
bool operator!= (const iterator& it) const { return !operator==(it); }
bool at_end() const { return this->step==this->size_; }
protected:
E start;
};
template <typename E>
class CubeFacets {
public:
typedef CubeFacets_iterator<E> iterator;
typedef iterator const_iterator;
typedef typename iterator::value_type value_type;
typedef typename iterator::reference const_reference;
typedef const_reference reference;
/** @param dim_arg dimension of the cube
@param start_arg index of the first vertex
*/
explicit CubeFacets(Int dim_arg, const E& start_arg = zero_value<E>())
: start(start_arg), dim(dim_arg) { }
Int size() const { return 2*dim; }
bool empty() const { return dim==0; }
iterator begin() const { return iterator(start, E(1), E(1)<<dim); }
iterator end() const { return iterator(start, E(1)<<dim, E(1)<<dim); }
const value_type front() const { return value_type(start, E(1), E(1)<<dim); }
protected:
E start;
Int dim;
};
} }
namespace pm {
template <typename E>
struct check_iterator_feature<polymake::polytope::CubeFacet_iterator<E>, end_sensitive> : std::true_type { };
template <typename E>
struct check_iterator_feature<polymake::polytope::CubeFacets_iterator<E>, end_sensitive> : std::true_type { };
}
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|
