/usr/include/range/v3/action/insert.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 | /// \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_ACTION_INSERT_HPP
#define RANGES_V3_ACTION_INSERT_HPP
#include <functional>
#include <initializer_list>
#include <utility>
#include <range/v3/range_fwd.hpp>
#include <range/v3/range_traits.hpp>
#include <range/v3/action/concepts.hpp>
#include <range/v3/algorithm/max.hpp>
#include <range/v3/utility/common_iterator.hpp>
#include <range/v3/utility/functional.hpp>
#include <range/v3/utility/static_const.hpp>
namespace ranges
{
inline namespace v3
{
/// \cond
namespace adl_insert_detail
{
template<typename Cont, typename T,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() &&
Constructible<range_value_type_t<Cont>, T>())>
auto insert(Cont &&cont, T &&t)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(static_cast<T &&>(t))
)
template<typename Cont, typename I, typename S,
typename C = common_iterator_t<I, S>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Sentinel<S, I>() && !Range<S>())>
auto insert(Cont &&cont, I i, S j)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(C{i}, C{j})
)
template<typename Cont, typename Rng,
typename C = range_common_iterator_t<Rng>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Range<Rng>())>
auto insert(Cont &&cont, Rng &&rng)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(C{ranges::begin(rng)}, C{ranges::end(rng)})
)
template<typename Cont, typename I, typename T,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<I>() &&
Constructible<range_value_type_t<Cont>, T>())>
auto insert(Cont &&cont, I p, T &&t)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(p, static_cast<T &&>(t))
)
template<typename Cont, typename I, typename N, typename T,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<I>() && Integral<N>() &&
Constructible<range_value_type_t<Cont>, T>())>
auto insert(Cont &&cont, I p, N n, T &&t)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(p, n, static_cast<T &&>(t))
)
/// \cond
namespace detail
{
template<typename Cont, typename P,
CONCEPT_REQUIRES_(Container<Cont>() && Iterator<P>() &&
RandomAccessReservable<Cont>())>
iterator_t<Cont> insert_reserve_helper(
Cont &cont, P const p, range_size_type_t<Cont> const delta)
{
auto const old_size = ranges::size(cont);
auto const max_size = cont.max_size();
RANGES_EXPECT(delta <= max_size - old_size);
auto const new_size = old_size + delta;
auto const old_capacity = cont.capacity();
auto const index = p - ranges::begin(cont);
if (old_capacity < new_size)
{
auto const new_capacity = (old_capacity <= max_size / 3 * 2)
? ranges::max(old_capacity + old_capacity / 2, new_size)
: max_size;
cont.reserve(new_capacity);
}
return ranges::begin(cont) + index;
}
template<typename Cont, typename P, typename I, typename S,
typename C = common_iterator_t<I, S>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<P>() &&
Sentinel<S, I>() && !Range<S>())>
auto insert_impl(Cont &&cont, P p, I i, S j, std::false_type)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(p, C{i}, C{j})
)
template<typename Cont, typename P, typename I, typename S,
typename C = common_iterator_t<I, S>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<P>() &&
SizedSentinel<S, I>() && RandomAccessReservable<Cont>() && !Range<S>())>
auto insert_impl(Cont &&cont_, P p, I i, S j, std::true_type) ->
decltype(unwrap_reference(cont_).insert(
ranges::begin(unwrap_reference(cont_)), C{i}, C{j}))
{
auto &&cont = unwrap_reference(cont_);
auto const delta = static_cast<range_size_type_t<Cont>>(j - i);
auto pos = insert_reserve_helper(cont, std::move(p), delta);
return cont.insert(pos, C{std::move(i)}, C{std::move(j)});
}
template<typename Cont, typename I, typename Rng,
typename C = range_common_iterator_t<Rng>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<I>() && Range<Rng>())>
auto insert_impl(Cont &&cont, I p, Rng &&rng, std::false_type)
RANGES_DECLTYPE_AUTO_RETURN
(
unwrap_reference(cont).insert(p, C{ranges::begin(rng)}, C{ranges::end(rng)})
)
template<typename Cont, typename I, typename Rng,
typename C = range_common_iterator_t<Rng>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<I>() &&
RandomAccessReservable<Cont>() && SizedRange<Rng>())>
auto insert_impl(Cont &&cont_, I p, Rng &&rng, std::true_type) ->
decltype(unwrap_reference(cont_).insert(
begin(unwrap_reference(cont_)), C{ranges::begin(rng)}, C{ranges::end(rng)}))
{
auto &&cont = unwrap_reference(cont_);
auto const delta = static_cast<range_size_type_t<Cont>>(ranges::size(rng));
auto pos = insert_reserve_helper(cont, std::move(p), delta);
return cont.insert(pos, C{ranges::begin(rng)}, C{ranges::end(rng)});
}
}
/// \endcond
template<typename Cont, typename P, typename I, typename S,
typename C = common_iterator_t<I, S>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<P>() &&
Sentinel<S, I>() && !Range<S>())>
auto insert(Cont &&cont, P p, I i, S j)
RANGES_DECLTYPE_AUTO_RETURN
(
detail::insert_impl(static_cast<Cont &&>(cont), std::move(p), std::move(i), std::move(j),
meta::strict_and<RandomAccessReservable<Cont>, SizedSentinel<S, I>>{})
)
template<typename Cont, typename I, typename Rng,
typename C = range_common_iterator_t<Rng>,
CONCEPT_REQUIRES_(LvalueContainerLike<Cont>() && Iterator<I>() && Range<Rng>())>
auto insert(Cont &&cont, I p, Rng &&rng)
RANGES_DECLTYPE_AUTO_RETURN
(
detail::insert_impl(static_cast<Cont &&>(cont), std::move(p), static_cast<Rng &&>(rng),
meta::strict_and<RandomAccessReservable<Cont>, SizedRange<Rng>>{})
)
struct insert_fn
{
template<typename Rng, typename T,
CONCEPT_REQUIRES_(Range<Rng>() && Constructible<range_value_type_t<Rng>, T>())>
auto operator()(Rng &&rng, T &&t) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), static_cast<T &&>(t))
)
template<typename Rng, typename Rng2,
CONCEPT_REQUIRES_(Range<Rng>() && Range<Rng2>())>
auto operator()(Rng &&rng, Rng2 &&rng2) const ->
decltype(insert(static_cast<Rng &&>(rng), static_cast<Rng2 &&>(rng2)))
{
static_assert(!is_infinite<Rng>::value,
"Attempting to insert an infinite range into a container");
return insert(static_cast<Rng &&>(rng), static_cast<Rng2 &&>(rng2));
}
template<typename Rng, typename T,
CONCEPT_REQUIRES_(Range<Rng>())>
auto operator()(Rng &&rng, std::initializer_list<T> rng2) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), rng2)
)
template<typename Rng, typename I, typename S,
CONCEPT_REQUIRES_(Range<Rng>() && Sentinel<S, I>() && !Range<S>())>
auto operator()(Rng &&rng, I i, S j) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), std::move(i), std::move(j))
)
template<typename Rng, typename I, typename T,
CONCEPT_REQUIRES_(Range<Rng>() && Iterator<I>() &&
Constructible<range_value_type_t<Rng>, T>())>
auto operator()(Rng &&rng, I p, T &&t) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), std::move(p), static_cast<T &&>(t))
)
template<typename Rng, typename I, typename Rng2,
CONCEPT_REQUIRES_(Range<Rng>() && Iterator<I>() && Range<Rng2>())>
auto operator()(Rng &&rng, I p, Rng2 &&rng2) const ->
decltype(insert(static_cast<Rng &&>(rng), std::move(p), static_cast<Rng2 &&>(rng2)))
{
static_assert(!is_infinite<Rng>::value,
"Attempting to insert an infinite range into a container");
return insert(static_cast<Rng &&>(rng), std::move(p), static_cast<Rng2 &&>(rng2));
}
template<typename Rng, typename I, typename T,
CONCEPT_REQUIRES_(Range<Rng>() && Iterator<I>())>
auto operator()(Rng &&rng, I p, std::initializer_list<T> rng2) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), std::move(p), rng2)
)
template<typename Rng, typename I, typename N, typename T,
CONCEPT_REQUIRES_(Range<Rng>() && Iterator<I>() && Integral<N>()
&& Constructible<range_value_type_t<Rng>, T>())>
auto operator()(Rng &&rng, I p, N n, T &&t) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), std::move(p), n, static_cast<T &&>(t))
)
template<typename Rng, typename P, typename I, typename S,
CONCEPT_REQUIRES_(Range<Rng>() && Iterator<P>() && Sentinel<S, I>() &&
!Range<S>())>
auto operator()(Rng &&rng, P p, I i, S j) const
RANGES_DECLTYPE_AUTO_RETURN
(
insert(static_cast<Rng &&>(rng), std::move(p), std::move(i), std::move(j))
)
};
}
/// \endcond
/// \ingroup group-actions
RANGES_INLINE_VARIABLE(adl_insert_detail::insert_fn, insert)
namespace action
{
using ranges::insert;
}
namespace concepts
{
/// \ingroup group-concepts
struct InsertableRange
: refines<Range(_1)>
{
template<typename Rng, typename... Rest>
auto requires_(Rng &&rng, Rest &&... rest) -> decltype(
concepts::valid_expr(
((void)ranges::insert(static_cast<Rng &&>(rng), static_cast<Rest &&>(rest)...), 42)
));
};
}
/// \ingroup group-concepts
template<typename Rng, typename... Rest>
using InsertableRange = concepts::models<concepts::InsertableRange, Rng, Rest...>;
}
}
#endif
|