/usr/include/range/v3/range_concepts.hpp is in librange-v3-dev 0.3.5-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 | /// \file
// Range v3 library
//
// Copyright Eric Niebler 2013-present
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//
#ifndef RANGES_V3_RANGE_CONCEPTS_HPP
#define RANGES_V3_RANGE_CONCEPTS_HPP
#include <utility>
#include <type_traits>
#include <initializer_list>
#include <meta/meta.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/begin_end.hpp>
#include <range/v3/data.hpp>
#include <range/v3/size.hpp>
#include <range/v3/utility/iterator_concepts.hpp>
#include <range/v3/utility/iterator_traits.hpp>
#ifndef RANGES_NO_STD_FORWARD_DECLARATIONS
// Non-portable forward declarations of standard containers
RANGES_BEGIN_NAMESPACE_STD
template<class Key, class Compare /*= less<Key>*/, class Alloc /*= allocator<Key>*/>
class set;
template<class Key, class Compare /*= less<Key>*/, class Alloc /*= allocator<Key>*/>
class multiset;
template<class Key, class Hash /*= hash<Key>*/, class Pred /*= equal_to<Key>*/, class Alloc /*= allocator<Key>*/>
class unordered_set;
template<class Key, class Hash /*= hash<Key>*/, class Pred /*= equal_to<Key>*/, class Alloc /*= allocator<Key>*/>
class unordered_multiset;
RANGES_END_NAMESPACE_STD
#else
#include <set>
#include <unordered_set>
#endif
namespace ranges
{
inline namespace v3
{
/// \cond
namespace detail
{
template<typename T>
struct view_predicate_;
}
/// \endcond
/// \addtogroup group-concepts
/// @{
// Specialize this if the default is wrong.
template<typename T>
struct enable_view
{};
namespace concepts
{
///
/// Range concepts below
///
struct Range
{
// Associated types
template<typename T>
using iterator_t = decltype(begin(std::declval<T &>()));
template<typename T>
using sentinel_t = decltype(end(std::declval<T &>()));
template<typename T>
using difference_t = concepts::WeaklyIncrementable::difference_t<iterator_t<T>>;
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::model_of<Sentinel>(end(t), begin(t))
));
};
struct OutputRange
: refines<Range(_1)>
{
template<typename T, typename V>
auto requires_() -> decltype(
concepts::valid_expr(
concepts::model_of<OutputIterator, Range::iterator_t<T>, V>()
));
};
struct InputRange
: refines<Range>
{
// Associated types
template<typename T>
using category_t = concepts::InputIterator::category_t<iterator_t<T>>;
template<typename T>
using value_t = concepts::Readable::value_t<iterator_t<T>>;
template<typename T>
using reference_t = concepts::Readable::reference_t<iterator_t<T>>;
template<typename T>
using rvalue_reference_t = concepts::Readable::rvalue_reference_t<iterator_t<T>>;
template<typename T>
using common_reference_t = concepts::Readable::common_reference_t<iterator_t<T>>;
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::model_of<InputIterator>(begin(t))
));
};
struct ForwardRange
: refines<InputRange>
{
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::model_of<ForwardIterator>(begin(t))
));
};
struct BidirectionalRange
: refines<ForwardRange>
{
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::model_of<BidirectionalIterator>(begin(t))
));
};
struct RandomAccessRange
: refines<BidirectionalRange>
{
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::model_of<RandomAccessIterator>(begin(t))
));
};
struct ContiguousRange
: refines<RandomAccessRange>
{
template<typename Rng>
using data_reference_t = decltype(*data(std::declval<Rng&>()));
template<typename Rng>
using element_t = meta::_t<std::remove_reference<data_reference_t<Rng>>>;
template<typename Rng>
auto requires_() -> decltype(
concepts::valid_expr(
concepts::model_of<Same, InputRange::value_t<Rng>,
meta::_t<std::remove_cv<element_t<Rng>>>>(),
concepts::model_of<Same, data_reference_t<Rng>,
concepts::InputRange::reference_t<Rng>>()
));
};
struct BoundedRange
: refines<Range>
{
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::same_type(begin(t), end(t))
));
};
struct SizedRange
: refines<Range>
{
template<typename T>
using size_t = decltype(size(std::declval<T&>()));
template<typename T>
auto requires_(T &t) -> decltype(
concepts::valid_expr(
concepts::is_false(disable_sized_range<uncvref_t<T>>()),
concepts::model_of<Integral>(size(t))
));
};
///
/// View concepts below
///
struct View
: refines<Range, Movable, DefaultConstructible>
{
template<typename T>
auto requires_() -> decltype(
concepts::valid_expr(
concepts::is_true(detail::view_predicate_<T>())
));
};
struct OutputView
: refines<View(_1), OutputRange>
{};
struct InputView
: refines<View, InputRange>
{};
struct ForwardView
: refines<InputView, ForwardRange, Copyable>
{};
struct BidirectionalView
: refines<ForwardView, BidirectionalRange>
{};
struct RandomAccessView
: refines<BidirectionalView, RandomAccessRange>
{};
struct ContiguousView
: refines<RandomAccessView, ContiguousRange>
{};
// Additional concepts for checking additional orthogonal properties
struct BoundedView
: refines<View, BoundedRange>
{};
struct SizedView
: refines<View, SizedRange>
{};
}
template<typename T>
using Range = concepts::models<concepts::Range, T>;
template<typename T, typename V>
using OutputRange = concepts::models<concepts::OutputRange, T, V>;
template<typename T>
using InputRange = concepts::models<concepts::InputRange, T>;
template<typename T>
using ForwardRange = concepts::models<concepts::ForwardRange, T>;
template<typename T>
using BidirectionalRange = concepts::models<concepts::BidirectionalRange, T>;
template<typename T>
using RandomAccessRange = concepts::models<concepts::RandomAccessRange, T>;
template<typename Rng>
using ContiguousRange = concepts::models<concepts::ContiguousRange, Rng>;
template<typename T>
using BoundedRange = concepts::models<concepts::BoundedRange, T>;
template<typename T>
using SizedRange = concepts::models<concepts::SizedRange, T>;
template<typename T>
using View = concepts::models<concepts::View, T>;
template<typename T, typename V>
using OutputView = concepts::models<concepts::OutputView, T, V>;
template<typename T>
using InputView = concepts::models<concepts::InputView, T>;
template<typename T>
using ForwardView = concepts::models<concepts::ForwardView, T>;
template<typename T>
using BidirectionalView = concepts::models<concepts::BidirectionalView, T>;
template<typename T>
using RandomAccessView = concepts::models<concepts::RandomAccessView, T>;
template<typename T>
using ContiguousView = concepts::models<concepts::ContiguousView, T>;
// Extra concepts:
template<typename T>
using BoundedView = concepts::models<concepts::BoundedView, T>;
template<typename T>
using SizedView = concepts::models<concepts::SizedView, T>;
////////////////////////////////////////////////////////////////////////////////////////////
// range_concept
template<typename T>
using range_concept =
concepts::most_refined<
meta::list<
concepts::ContiguousRange,
concepts::RandomAccessRange,
concepts::BidirectionalRange,
concepts::ForwardRange,
concepts::InputRange>, T>;
template<typename T>
using range_concept_t =
meta::_t<range_concept<T>>;
////////////////////////////////////////////////////////////////////////////////////////////
// bounded_range_concept
template<typename T>
using bounded_range_concept =
concepts::most_refined<
meta::list<
concepts::BoundedRange,
concepts::Range>, T>;
template<typename T>
using bounded_range_concept_t =
meta::_t<bounded_range_concept<T>>;
////////////////////////////////////////////////////////////////////////////////////////////
// sized_range_concept
template<typename T>
using sized_range_concept =
concepts::most_refined<
meta::list<
concepts::SizedRange,
concepts::Range>, T>;
template<typename T>
using sized_range_concept_t =
meta::_t<sized_range_concept<T>>;
////////////////////////////////////////////////////////////////////////////////////////////
// bounded_view_concept
template<typename T>
using bounded_view_concept =
concepts::most_refined<
meta::list<
concepts::BoundedView,
concepts::View>, T>;
template<typename T>
using bounded_view_concept_t = meta::_t<bounded_view_concept<T>>;
////////////////////////////////////////////////////////////////////////////////////////////
// sized_view_concept
template<typename T>
using sized_view_concept =
concepts::most_refined<
meta::list<
concepts::SizedView,
concepts::View>, T>;
template<typename T>
using sized_view_concept_t = meta::_t<sized_view_concept<T>>;
////////////////////////////////////////////////////////////////////////////////////////////
// view_concept
template<typename T>
using view_concept =
concepts::most_refined<
meta::list<
concepts::View,
concepts::Range>, T>;
template<typename T>
using view_concept_t = meta::_t<view_concept<T>>;
/// @}
/// \cond
namespace detail
{
template<typename T>
std::is_same<reference_t<concepts::Range::iterator_t<T>>, reference_t<concepts::Range::iterator_t<T const>>>
view_like_(int);
template<typename T>
std::true_type
view_like_(long);
template<typename T>
using view_like = decltype(detail::view_like_<T>(42));
// Something is a view if it's a Range and either:
// - It doesn't look like a container, or
// - It's derived from view_base
template<typename T>
struct view_predicate_
: meta::_t<meta::if_<
meta::is_trait<enable_view<T>>,
enable_view<T>,
meta::bool_<view_like<T>() || DerivedFrom<T, view_base>()>>>
{};
template<typename T>
struct view_predicate_<std::initializer_list<T>>
: std::false_type
{};
template<class Key, class Compare, class Alloc>
struct view_predicate_<std::set<Key, Compare, Alloc>>
: std::false_type
{};
template<class Key, class Compare, class Alloc>
struct view_predicate_<std::multiset<Key, Compare, Alloc>>
: std::false_type
{};
template<class Key, class Hash, class Pred, class Alloc>
struct view_predicate_<std::unordered_set<Key, Hash, Pred, Alloc>>
: std::false_type
{};
template<class Key, class Hash, class Pred, class Alloc>
struct view_predicate_<std::unordered_multiset<Key, Hash, Pred, Alloc>>
: std::false_type
{};
}
/// \endcond
/// \addtogroup group-concepts
/// @{
// Specialize this if the default is wrong.
template<typename T>
using is_view
RANGES_DEPRECATED("If you need to override the logic of the View concept, please use ranges::enable_view."
"Otherwise, please use the View concept directly.") =
View<T>;
/// @}
}
}
#endif
|