168 lines
5.8 KiB
C++
168 lines
5.8 KiB
C++
/*
|
|
|
|
Copyright (c) 2017, Arvid Norberg, Alden Torres
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in
|
|
the documentation and/or other materials provided with the distribution.
|
|
* Neither the name of the author nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#ifndef TORRENT_TYPED_SPAN_HPP
|
|
#define TORRENT_TYPED_SPAN_HPP
|
|
|
|
#include <type_traits>
|
|
|
|
#include "libtorrent/units.hpp"
|
|
#include "libtorrent/span.hpp"
|
|
#include "libtorrent/assert.hpp"
|
|
|
|
namespace libtorrent { namespace aux {
|
|
|
|
template <typename T, typename IndexType = int>
|
|
struct typed_span : span<T>
|
|
{
|
|
using base = span<T>;
|
|
using underlying_index = typename underlying_index_t<IndexType>::type;
|
|
|
|
// disallow conversions from other index types
|
|
template <typename OtherIndex>
|
|
typed_span(typed_span<T, OtherIndex> const&) = delete;
|
|
typed_span() noexcept = default;
|
|
typed_span(typed_span const&) noexcept = default;
|
|
typed_span& operator=(typed_span const&) noexcept = default;
|
|
|
|
template <typename U, typename
|
|
= typename std::enable_if<aux::compatible_type<U, T>::value>::type>
|
|
typed_span(typed_span<U> const& v) noexcept // NOLINT
|
|
: span<T>(v) {}
|
|
|
|
typed_span(T& p) noexcept : span<T>(p) {} // NOLINT
|
|
typed_span(T* p, std::size_t const l) noexcept : span<T>(p, l) {} // NOLINT
|
|
|
|
template <typename U, std::size_t N>
|
|
typed_span(std::array<U, N>& arr) noexcept // NOLINT
|
|
: span<T>(arr.data(), arr.size()) {}
|
|
|
|
template <typename U, std::size_t N>
|
|
typed_span(U (&arr)[N]) noexcept // NOLINT
|
|
: span<T>(&arr[0], N) {}
|
|
|
|
// anything with a .data() member function is considered a container
|
|
// but only if the value type is compatible with T
|
|
template <typename Cont
|
|
, typename U = typename std::remove_reference<decltype(*std::declval<Cont>().data())>::type
|
|
, typename = typename std::enable_if<aux::compatible_type<U, T>::value>::type>
|
|
typed_span(Cont& c) : span<T>(c.data(), c.size())// NOLINT
|
|
{}
|
|
|
|
auto operator[](IndexType idx) const ->
|
|
#if TORRENT_AUTO_RETURN_TYPES
|
|
decltype(auto)
|
|
#else
|
|
decltype(this->base::operator[](underlying_index()))
|
|
#endif
|
|
{
|
|
TORRENT_ASSERT(idx >= IndexType(0));
|
|
return this->base::operator[](std::size_t(static_cast<underlying_index>(idx)));
|
|
}
|
|
|
|
IndexType end_index() const
|
|
{
|
|
TORRENT_ASSERT(this->size() <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
return IndexType(static_cast<underlying_index>(this->size()));
|
|
}
|
|
|
|
template <typename U = underlying_index, typename Cond
|
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
|
typed_span first(underlying_index n) const
|
|
{
|
|
TORRENT_ASSERT(n >= 0);
|
|
auto const s = this->base::first(std::size_t(n));
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
typed_span first(std::size_t n) const
|
|
{
|
|
TORRENT_ASSERT(n <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
auto const s = this->base::first(n);
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
template <typename U = underlying_index, typename Cond
|
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
|
typed_span last(underlying_index n) const
|
|
{
|
|
TORRENT_ASSERT(n >= 0);
|
|
auto const s = this->base::last(std::size_t(n));
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
typed_span last(std::size_t n) const
|
|
{
|
|
TORRENT_ASSERT(n <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
auto const s = this->base::last(n);
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
template <typename U = underlying_index, typename Cond
|
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
|
typed_span subspan(underlying_index offset) const
|
|
{
|
|
TORRENT_ASSERT(offset >= 0);
|
|
auto const s = this->base::subspan(std::size_t(offset));
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
template <typename U = underlying_index, typename Cond
|
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
|
typed_span subspan(underlying_index offset, underlying_index count) const
|
|
{
|
|
TORRENT_ASSERT(offset >= 0);
|
|
TORRENT_ASSERT(count >= 0);
|
|
auto const s = this->base::subspan(std::size_t(offset), std::size_t(count));
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
typed_span subspan(std::size_t offset) const
|
|
{
|
|
TORRENT_ASSERT(offset <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
auto const s = this->base::subspan(offset);
|
|
return {s.data(), s.size()};
|
|
}
|
|
|
|
typed_span subspan(std::size_t offset, std::size_t count) const
|
|
{
|
|
TORRENT_ASSERT(offset <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
TORRENT_ASSERT(count <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
auto const s = this->base::subspan(offset, count);
|
|
return {s.data(), s.size()};
|
|
}
|
|
};
|
|
|
|
}}
|
|
|
|
#endif
|