/usr/include/range/v3/view_interface.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 | /// \file
// Range v3 library
//
// Copyright Eric Niebler 2014-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_VIEW_INTERFACE_HPP
#define RANGES_V3_VIEW_INTERFACE_HPP
#include <iosfwd>
#include <meta/meta.hpp>
#include <range/v3/begin_end.hpp>
#include <range/v3/empty.hpp>
#include <range/v3/range_concepts.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/range_traits.hpp>
#include <range/v3/to_container.hpp>
#include <range/v3/utility/common_iterator.hpp>
#include <range/v3/utility/concepts.hpp>
#include <range/v3/utility/iterator.hpp>
namespace ranges
{
inline namespace v3
{
/// \cond
namespace detail
{
template<typename From, typename To = From>
struct slice_bounds
{
From from;
To to;
template<typename F, typename T,
CONCEPT_REQUIRES_(ConvertibleTo<F, From>() && ConvertibleTo<T, To>())>
slice_bounds(F from, T to)
: from(from), to(to)
{}
};
template<typename Int>
struct from_end_
{
Int dist_;
template<typename Other,
CONCEPT_REQUIRES_(Integral<Other>() && ExplicitlyConvertibleTo<Other, Int>())>
operator from_end_<Other> () const
{
return {static_cast<Other>(dist_)};
}
};
}
/// \endcond
/// \addtogroup group-core
/// @{
template<typename Derived, cardinality Cardinality /* = finite*/>
struct view_interface
: basic_view<Cardinality>
{
protected:
RANGES_CXX14_CONSTEXPR Derived &derived() noexcept
{
CONCEPT_ASSERT(DerivedFrom<Derived, view_interface>());
return static_cast<Derived &>(*this);
}
/// \overload
constexpr Derived const &derived() const noexcept
{
CONCEPT_ASSERT(DerivedFrom<Derived, view_interface>());
return static_cast<Derived const &>(*this);
}
~view_interface() = default;
public:
view_interface() = default;
view_interface(view_interface &&) = default;
view_interface(view_interface const &) = default;
view_interface &operator=(view_interface &&) = default;
view_interface &operator=(view_interface const &) = default;
// A few ways of testing whether a range can be empty:
CONCEPT_REQUIRES(Cardinality >= 0)
constexpr bool empty() const noexcept
{
return Cardinality == 0;
}
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && Cardinality < 0 && ForwardRange<D const>())>
constexpr bool empty() const
noexcept(noexcept(bool(ranges::begin(std::declval<D const &>()) ==
ranges::end(std::declval<D const &>()))))
{
return ranges::begin(derived()) == ranges::end(derived());
}
template<typename D = Derived, CONCEPT_REQUIRES_(Same<D, Derived>())>
constexpr auto operator!() const
RANGES_DECLTYPE_NOEXCEPT(ranges::empty(std::declval<D const &>()))
{
return ranges::empty(derived());
}
template<typename D = Derived, CONCEPT_REQUIRES_(Same<D, Derived>()),
typename = decltype(ranges::empty(std::declval<D const &>()))>
constexpr explicit operator bool() const
noexcept(noexcept(ranges::empty(std::declval<D const &>())))
{
return !ranges::empty(derived());
}
/// Access the size of the range, if it can be determined:
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && Cardinality >= 0)>
constexpr range_size_type_t<D> size() const noexcept
{
return (range_size_type_t<D>)Cardinality;
}
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && Cardinality < 0 &&
SizedSentinel<sentinel_t<D const>, iterator_t<D const>>() &&
ForwardRange<D const>())>
constexpr range_size_type_t<D> size() const
{
return iter_size(derived().begin(), derived().end());
}
/// Access the first element in a range:
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && ForwardRange<D>())>
range_reference_t<D> front()
{
return *derived().begin();
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && ForwardRange<D const>())>
range_reference_t<D const> front() const
{
return *derived().begin();
}
/// Access the last element in a range:
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && BoundedRange<D>() && BidirectionalRange<D>())>
range_reference_t<D> back()
{
return *prev(derived().end());
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && BoundedRange<D const>() && BidirectionalRange<D const>())>
range_reference_t<D const> back() const
{
return *prev(derived().end());
}
/// Simple indexing:
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && RandomAccessRange<D>())>
auto operator[](range_difference_type_t<D> n) ->
decltype(std::declval<D &>().begin()[n])
{
return derived().begin()[n];
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && RandomAccessRange<D const>())>
auto operator[](range_difference_type_t<D> n) const ->
decltype(std::declval<D const &>().begin()[n])
{
return derived().begin()[n];
}
/// Python-ic slicing:
// rng[{4,6}]
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>> offs) & ->
decltype(std::declval<Slice>()(std::declval<D &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>> offs) const & ->
decltype(std::declval<Slice>()(std::declval<D const &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>> offs) && ->
decltype(std::declval<Slice>()(std::declval<D>(), offs.from, offs.to))
{
return Slice{}(detail::move(derived()), offs.from, offs.to);
}
// rng[{4,end-2}]
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>,
detail::from_end_<range_difference_type_t<D>>> offs) & ->
decltype(std::declval<Slice>()(std::declval<D &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>,
detail::from_end_<range_difference_type_t<D>>> offs) const & ->
decltype(std::declval<Slice>()(std::declval<D const &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>,
detail::from_end_<range_difference_type_t<D>>> offs) && ->
decltype(std::declval<Slice>()(std::declval<D>(), offs.from, offs.to))
{
return Slice{}(detail::move(derived()), offs.from, offs.to);
}
// rng[{end-4,end-2}]
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>,
detail::from_end_<range_difference_type_t<D>>> offs) & ->
decltype(std::declval<Slice>()(std::declval<D &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>,
detail::from_end_<range_difference_type_t<D>>> offs) const & ->
decltype(std::declval<Slice>()(std::declval<D const &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>,
detail::from_end_<range_difference_type_t<D>>> offs) && ->
decltype(std::declval<Slice>()(std::declval<D>(), offs.from, offs.to))
{
return Slice{}(detail::move(derived()), offs.from, offs.to);
}
// rng[{4,end}]
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>, end_fn> offs) & ->
decltype(std::declval<Slice>()(std::declval<D &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>, end_fn> offs) const & ->
decltype(std::declval<Slice>()(std::declval<D const &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<range_difference_type_t<D>, end_fn> offs) && ->
decltype(std::declval<Slice>()(std::declval<D>(), offs.from, offs.to))
{
return Slice{}(detail::move(derived()), offs.from, offs.to);
}
// rng[{end-4,end}]
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>, end_fn> offs) & ->
decltype(std::declval<Slice>()(std::declval<D &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>, end_fn> offs) const & ->
decltype(std::declval<Slice>()(std::declval<D const &>(), offs.from, offs.to))
{
return Slice{}(derived(), offs.from, offs.to);
}
/// \overload
template<typename D = Derived, typename Slice = view::slice_fn,
CONCEPT_REQUIRES_(Same<D, Derived>())>
auto operator[](detail::slice_bounds<detail::from_end_<range_difference_type_t<D>>, end_fn> offs) && ->
decltype(std::declval<Slice>()(std::declval<D>(), offs.from, offs.to))
{
return Slice{}(detail::move(derived()), offs.from, offs.to);
}
/// Returns a reference to the element at specified location pos, with bounds checking.
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && RandomAccessRange<D>() && SizedRange<D>())>
auto at(range_difference_type_t<D> n) ->
decltype(std::declval<D &>().begin()[n])
{
using size_type = range_size_type_t<Derived>;
if (n < 0 || size_type(n) >= ranges::size(derived()))
{
throw std::out_of_range("view_interface::at");
}
return derived().begin()[n];
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && RandomAccessRange<D const>() && SizedRange<D const>())>
auto at(range_difference_type_t<D> n) const ->
decltype(std::declval<D const &>().begin()[n])
{
using size_type = range_size_type_t<Derived>;
if (n < 0 || size_type(n) >= ranges::size(derived()))
{
throw std::out_of_range("view_interface::at");
}
return derived().begin()[n];
}
/// Implicit conversion to something that looks like a container.
template<typename Container, typename D = Derived,
typename = typename Container::allocator_type, // HACKHACK
CONCEPT_REQUIRES_(detail::ConvertibleToContainer<D, Container>())>
operator Container ()
{
return ranges::to_<Container>(derived());
}
/// \overload
template<typename Container, typename D = Derived,
typename = typename Container::allocator_type, // HACKHACK
CONCEPT_REQUIRES_(detail::ConvertibleToContainer<D const, Container>())>
operator Container () const
{
return ranges::to_<Container>(derived());
}
/// \brief Print a range to an ostream
private:
template<typename Stream, typename Rng,
CONCEPT_REQUIRES_(Same<Derived, meta::_t<std::remove_cv<Rng>>>())>
static Stream &print_(Stream &sout, Rng &rng)
{
sout << '[';
auto it = ranges::begin(rng);
auto const e = ranges::end(rng);
if(it != e)
{
for(;;)
{
sout << *it;
if(++it == e) break;
sout << ',';
}
}
sout << ']';
return sout;
}
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && InputRange<D const>())>
friend std::ostream &operator<<(std::ostream &sout, Derived const &rng)
{
return view_interface::print_(sout, rng);
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && !Range<D const>() && InputRange<D>())>
friend std::ostream &operator<<(std::ostream &sout, Derived &rng)
{
return view_interface::print_(sout, rng);
}
/// \overload
template<typename D = Derived,
CONCEPT_REQUIRES_(Same<D, Derived>() && !Range<D const>() && InputRange<D>())>
friend std::ostream &operator<<(std::ostream &sout, Derived &&rng)
{
return view_interface::print_(sout, rng);
}
};
/// @}
}
}
#endif
|