127 lines
4.2 KiB
C++
127 lines
4.2 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;
|
||
|
|
||
|
// pull in constructors from base class
|
||
|
using base::base;
|
||
|
|
||
|
auto operator[](IndexType idx) -> decltype(this->base::operator[](underlying_index()))
|
||
|
{
|
||
|
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<T> first(underlying_index n)
|
||
|
{
|
||
|
TORRENT_ASSERT(n >= 0);
|
||
|
return this->base::first(std::size_t(n));
|
||
|
}
|
||
|
|
||
|
typed_span<T> first(std::size_t n)
|
||
|
{
|
||
|
TORRENT_ASSERT(n <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
||
|
return this->base::first(n);
|
||
|
}
|
||
|
|
||
|
template <typename U = underlying_index, typename Cond
|
||
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
||
|
typed_span<T> last(underlying_index n)
|
||
|
{
|
||
|
TORRENT_ASSERT(n >= 0);
|
||
|
return this->base::last(std::size_t(n));
|
||
|
}
|
||
|
|
||
|
typed_span<T> last(std::size_t n)
|
||
|
{
|
||
|
TORRENT_ASSERT(n <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
||
|
return this->base::last(n);
|
||
|
}
|
||
|
|
||
|
template <typename U = underlying_index, typename Cond
|
||
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
||
|
typed_span<T> subspan(underlying_index offset)
|
||
|
{
|
||
|
TORRENT_ASSERT(offset >= 0);
|
||
|
return this->base::subspan(std::size_t(offset));
|
||
|
}
|
||
|
|
||
|
template <typename U = underlying_index, typename Cond
|
||
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
||
|
typed_span<T> subspan(underlying_index offset, underlying_index count)
|
||
|
{
|
||
|
TORRENT_ASSERT(offset >= 0);
|
||
|
TORRENT_ASSERT(count >= 0);
|
||
|
return this->base::subspan(std::size_t(offset), std::size_t(count));
|
||
|
}
|
||
|
|
||
|
typed_span<T> subspan(std::size_t offset)
|
||
|
{
|
||
|
TORRENT_ASSERT(offset <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
||
|
return this->base::subspan(offset);
|
||
|
}
|
||
|
|
||
|
typed_span<T> subspan(std::size_t offset, std::size_t count)
|
||
|
{
|
||
|
TORRENT_ASSERT(offset <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
||
|
TORRENT_ASSERT(count <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
||
|
return this->base::subspan(offset, count);
|
||
|
}
|
||
|
};
|
||
|
|
||
|
}}
|
||
|
|
||
|
#endif
|