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 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
|
/* 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/internal/shared_object.h"
namespace pm {
template <typename TRef>
class same_value_iterator {
protected:
// TODO: replace with a plain pointer when iterators stop outliving containers
using alias_t = alias<TRef>;
mutable alias_t value;
template <typename> friend class same_value_iterator;
public:
using iterator_category = random_access_iterator_tag;
using value_type = typename alias_t::value_type;
using reference = typename alias_t::reference;
using pointer = typename alias_t::pointer;
using difference_type = ptrdiff_t;
using iterator = same_value_iterator<typename attrib<TRef>::minus_const>;
using const_iterator = same_value_iterator<std::conditional_t<is_const<reference>::value, TRef, typename attrib<TRef>::plus_const>>;
same_value_iterator() = default;
template <typename AliasArg, typename=std::enable_if_t<std::is_constructible<alias_t, AliasArg>::value>>
explicit same_value_iterator(AliasArg&& arg)
: value(std::forward<AliasArg>(arg)) {}
template <typename OtherRef, typename=std::enable_if_t<std::is_constructible<alias_t, const alias<OtherRef>&>::value>>
explicit same_value_iterator(const same_value_iterator<OtherRef>& other)
: value(other.value) {}
template <typename OtherRef, typename=std::enable_if_t<std::is_constructible<alias_t, alias<OtherRef>&&>::value>>
explicit same_value_iterator(same_value_iterator<OtherRef>&& other)
: value(std::move(other.value)) {}
same_value_iterator(const same_value_iterator&) = default;
same_value_iterator(same_value_iterator&&) = default;
same_value_iterator& operator= (const same_value_iterator&) = default;
reference operator* () const { return *value; }
pointer operator-> () const { return value.operator->(); }
reference operator[] (Int) const { return *value; }
same_value_iterator& operator++ () { return *this; }
const same_value_iterator& operator++ (int) { return *this; }
same_value_iterator& operator-- () { return *this; }
const same_value_iterator& operator-- (int) { return *this; }
same_value_iterator& operator+= (Int) { return *this; }
same_value_iterator& operator-= (Int) { return *this; }
const same_value_iterator& operator+ (Int) const { return *this; }
const same_value_iterator& operator- (Int) const { return *this; }
friend const same_value_iterator& operator+ (Int, const same_value_iterator& me) { return me; }
difference_type operator- (const same_value_iterator& it) const { return this!=⁢ }
bool operator== (const same_value_iterator& it) const { return this==⁢ }
bool operator!= (const same_value_iterator& it) const { return !operator==(it); }
bool operator< (const same_value_iterator& it) const { return !operator==(it); }
bool operator> (const same_value_iterator& it) const { return !operator==(it); }
bool operator<= (const same_value_iterator& it) const { return true; }
bool operator>= (const same_value_iterator& it) const { return true; }
void rewind() {}
void contract(bool, Int, Int) {}
};
template <typename Iterator>
class single_position_iterator
: public Iterator {
using base_t = Iterator;
template <typename> friend class single_position_iterator;
public:
using iterator_category = bidirectional_iterator_tag;
using iterator = single_position_iterator<typename iterator_traits<Iterator>::iterator>;
using const_iterator = single_position_iterator<typename iterator_traits<Iterator>::const_iterator>;
single_position_iterator()
: single_pos(-1) {}
template <typename SourceIterator, typename=typename suitable_arg_for_iterator<SourceIterator, Iterator>::type>
single_position_iterator(SourceIterator&& it)
: base_t(prepare_iterator_arg<Iterator>(std::forward<SourceIterator>(it)))
, single_pos(it.at_end()) {}
single_position_iterator(const iterator& it)
: Iterator(static_cast<const typename iterator::base_t&>(it))
, single_pos(it.single_pos) {}
single_position_iterator& operator++ ()
{
if (POLYMAKE_DEBUG && single_pos != 0)
throw std::runtime_error("single_position_iterator - increment out of range");
++single_pos;
return *this;
}
single_position_iterator& operator-- ()
{
if (POLYMAKE_DEBUG && single_pos != 1)
throw std::runtime_error("single_position_iterator - increment out of range");
--single_pos;
return *this;
}
const single_position_iterator operator++ (int) { single_position_iterator copy(*this); operator++(); return copy; }
const single_position_iterator operator-- (int) { single_position_iterator copy(*this); operator--(); return copy; }
bool at_end() const { return single_pos != 0; }
bool operator== (const const_iterator& other) const { return single_pos == other.single_pos; }
bool operator== (const iterator& other) const { return single_pos == other.single_pos; }
bool operator!= (const const_iterator& other) const { return !operator==(other); }
bool operator!= (const iterator& other) const { return !operator==(other); }
void rewind() { single_pos &= ~1; }
protected:
// 0: valid position, 1: after valid position, <0: no valid position at all (empty sequence)
int single_pos;
private:
// delete these if the original iterator is a random-access one
void operator+=(Int) = delete;
void operator-=(Int) = delete;
void operator+ (Int) = delete;
void operator- (Int) = delete;
void operator[](Int) = delete;
};
template <typename TRef>
struct check_iterator_feature<same_value_iterator<TRef>, unlimited> : std::true_type {};
template <typename TRef>
struct check_iterator_feature<same_value_iterator<TRef>, contractable> : std::true_type {};
template <typename TRef>
struct check_iterator_feature<same_value_iterator<TRef>, rewindable> : std::true_type {};
template <typename Iterator>
struct check_iterator_feature<single_position_iterator<Iterator>, end_sensitive> : std::true_type {};
template <typename Iterator>
struct check_iterator_feature<single_position_iterator<Iterator>, indexed> : check_iterator_feature<Iterator, indexed> {};
template <typename Iterator>
struct check_iterator_feature<single_position_iterator<Iterator>, rewindable> : std::true_type {};
template <typename TRef>
class same_value_container {
protected:
using alias_t = alias<TRef>;
alias_t value;
public:
// TODO: revert to one argument when iterators stop outliving containers
template <typename... Args, typename=std::enable_if_t<std::is_constructible<alias_t, Args...>::value>>
explicit same_value_container(Args&&... args)
: value(std::forward<Args>(args)...) {}
using value_type = typename alias_t::value_type;
using reference = typename alias_t::reference;
using const_reference = typename alias_t::const_reference;
using iterator = same_value_iterator<TRef>;
using const_iterator = typename iterator::const_iterator;
using reverse_iterator = iterator;
using const_reverse_iterator = const_iterator;
reference front() { return *value; }
reference back() { return *value; }
reference operator[] (Int) { return *value; }
const_reference front() const { return *value; }
const_reference back() const { return *value; }
const_reference operator[] (Int) const { return *value; }
iterator begin() & { return iterator(value); }
iterator begin() && { return iterator(std::move(value)); }
iterator end() { return iterator(); }
iterator rbegin() & { return iterator(value); }
iterator rbegin() && { return iterator(std::move(value)); }
iterator rend() { return iterator(); }
const_iterator begin() const & { return const_iterator(value); }
const_iterator end() const { return const_iterator(); }
const_iterator rbegin() const & { return const_iterator(value); }
const_iterator rend() const { return const_iterator(); }
bool empty() const { return false; }
Int size() const { return std::numeric_limits<Int>::max(); }
static same_value_container& cast_from(alias_t& a)
{
return *reverse_cast(&a, &same_value_container::value);
}
static const same_value_container& cast_from(const alias_t& a)
{
return *reverse_cast(&a, &same_value_container::value);
}
};
template <typename TRef>
struct spec_object_traits< same_value_container<TRef> >
: spec_object_traits<is_container> {
static constexpr bool
is_temporary = true,
is_always_const = std::is_same<typename alias<TRef>::reference, typename alias<TRef>::const_reference>::value;
};
template <typename TRef>
struct check_container_feature<same_value_container<TRef>, provide_construction<rewindable,false>>
: std::true_type {};
// to be removed
template <typename T>
class constant_pointer_iterator : public ptr_wrapper<T, false> {
using base_t = ptr_wrapper<T, false>;
public:
using iterator = constant_pointer_iterator;
using const_iterator = constant_pointer_iterator;
constant_pointer_iterator() {}
constant_pointer_iterator(T& arg) : base_t(&arg) {}
constant_pointer_iterator& operator++ () { return *this; }
const constant_pointer_iterator& operator++ (int) { return *this; }
constant_pointer_iterator& operator-- () { return *this; }
const constant_pointer_iterator& operator-- (int) { return *this; }
constant_pointer_iterator& operator+= (Int) { return *this; }
constant_pointer_iterator& operator-= (Int) { return *this; }
const constant_pointer_iterator& operator+ (Int) { return *this; }
const constant_pointer_iterator& operator- (Int) { return *this; }
friend const constant_pointer_iterator& operator+ (Int, const constant_pointer_iterator& me) { return me; }
ptrdiff_t operator- (const constant_pointer_iterator& it) const { return (this->cur != nullptr) != (it.cur != nullptr); }
void rewind() {}
void contract(bool, Int, Int) {}
};
template <typename T>
struct check_iterator_feature<constant_pointer_iterator<T>, unlimited> : std::true_type {};
template <typename T>
struct check_iterator_feature<constant_pointer_iterator<T>, contractable> : std::true_type {};
template <typename T>
struct check_iterator_feature<constant_pointer_iterator<T>, rewindable> : std::true_type {};
template <typename T>
class constant_masquerade_container {
protected:
constant_masquerade_container();
~constant_masquerade_container();
public:
typedef typename deref<T>::type value_type;
typedef T& reference;
typedef const T& const_reference;
typedef constant_pointer_iterator<T> iterator;
typedef constant_pointer_iterator<const T> const_iterator;
typedef iterator reverse_iterator;
typedef const_iterator const_reverse_iterator;
iterator begin() { return front(); }
iterator end() { return iterator(); }
iterator rbegin() { return front(); }
iterator rend() { return iterator(); }
const_iterator begin() const { return front(); }
const_iterator end() const { return const_iterator(); }
const_iterator rbegin() const { return front(); }
const_iterator rend() const { return const_iterator(); }
reference front() { return reinterpret_cast<reference>(*this); }
reference back() { return front(); }
reference operator[] (Int) { return front(); }
const_reference front() const { return reinterpret_cast<const_reference>(*this); }
const_reference back() const { return front(); }
const_reference operator[] (Int) const { return front(); }
bool empty() const { return false; }
Int size() const { return std::numeric_limits<Int>::max(); }
};
template <typename T>
struct spec_object_traits< constant_masquerade_container<T> >
: spec_object_traits<is_container> {
static const bool is_always_const=attrib<T>::is_const || object_traits<T>::is_always_const;
typedef T masquerade_for;
};
template <typename T>
struct check_container_feature<constant_masquerade_container<T>, provide_construction<rewindable,false>>
: std::true_type {};
// TODO: some occurrences of this function in attach_operation() and friends
// can be replaced with lambdas once we get rid of operation objects
template <typename T>
auto same_value(T&& x)
{
return same_value_container<prevent_int_element<T>>(std::forward<T>(x));
}
template <typename Context, typename T>
auto same_value_in_context(T&& x)
{
return same_value_container<prevent_int_element<T, Context>>(std::forward<T>(x));
}
template <typename T>
same_value_container<T>& as_same_value_container(alias<T>& x)
{
return same_value_container<T>::cast_from(x);
}
template <typename T>
const same_value_container<T>& as_same_value_container(const alias<T>& x)
{
return same_value_container<T>::cast_from(x);
}
namespace object_classifier {
enum { is_constant = is_manip+1 };
namespace _impl {
template <typename TRef>
size_discriminant<is_constant>::type analyzer_f(const same_value_container<TRef>*, bait*);
template <typename T>
size_discriminant<is_constant>::type analyzer_f(const constant_masquerade_container<T>*, bait*);
}
}
template <typename T>
struct spec_object_traits< cons<T, int_constant<object_classifier::is_constant> > >
: spec_object_traits<is_container> {};
} // end namespace pm
namespace polymake {
using pm::same_value;
}
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|