forked from premiere/premiere-libtorrent
135 lines
4.3 KiB
C++
135 lines
4.3 KiB
C++
/*
|
|
|
|
Copyright (c) 2016, Arvid Norberg
|
|
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_VECTOR_HPP
|
|
#define TORRENT_VECTOR_HPP
|
|
|
|
#include <vector>
|
|
#include <type_traits>
|
|
|
|
#include "libtorrent/units.hpp"
|
|
#include "libtorrent/assert.hpp"
|
|
|
|
namespace libtorrent { namespace aux {
|
|
|
|
template <typename T>
|
|
struct underlying_index_t { using type = T; };
|
|
|
|
template <typename U, typename Tag>
|
|
struct underlying_index_t<aux::strong_typedef<U, Tag>> { using type = U; };
|
|
|
|
template <typename T, typename IndexType = int>
|
|
struct vector : std::vector<T>
|
|
{
|
|
using base = std::vector<T>;
|
|
using underlying_index = typename underlying_index_t<IndexType>::type;
|
|
|
|
// pull in constructors from base class
|
|
using base::base;
|
|
|
|
auto operator[](IndexType idx) const -> decltype(this->base::operator[](underlying_index()))
|
|
{
|
|
TORRENT_ASSERT(idx >= IndexType(0));
|
|
TORRENT_ASSERT(idx < end_index());
|
|
return this->base::operator[](std::size_t(static_cast<underlying_index>(idx)));
|
|
}
|
|
|
|
auto operator[](IndexType idx) -> decltype(this->base::operator[](underlying_index()))
|
|
{
|
|
TORRENT_ASSERT(idx >= IndexType(0));
|
|
TORRENT_ASSERT(idx < end_index());
|
|
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>
|
|
void resize(underlying_index s)
|
|
{
|
|
TORRENT_ASSERT(s >= 0);
|
|
this->base::resize(std::size_t(s));
|
|
}
|
|
|
|
template <typename U = underlying_index, typename Cond
|
|
= typename std::enable_if<std::is_signed<U>::value>::type>
|
|
void resize(underlying_index s, T const& v)
|
|
{
|
|
TORRENT_ASSERT(s >= 0);
|
|
this->base::resize(std::size_t(s), v);
|
|
}
|
|
|
|
void resize(std::size_t s)
|
|
{
|
|
TORRENT_ASSERT(s <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
this->base::resize(s);
|
|
}
|
|
|
|
void resize(std::size_t s, T const& v)
|
|
{
|
|
TORRENT_ASSERT(s <= std::size_t((std::numeric_limits<underlying_index>::max)()));
|
|
this->base::resize(s, v);
|
|
}
|
|
};
|
|
|
|
template <typename Iter>
|
|
struct iterator_range
|
|
{
|
|
Iter _begin, _end;
|
|
Iter begin() { return _begin; }
|
|
Iter end() { return _end; }
|
|
};
|
|
|
|
template <typename T, typename IndexType>
|
|
iterator_range<T*> range(vector<T, IndexType>& vec
|
|
, IndexType begin, IndexType end)
|
|
{
|
|
using type = typename underlying_index_t<IndexType>::type;
|
|
return {vec.data() + static_cast<type>(begin), vec.data() + static_cast<type>(end)};
|
|
}
|
|
|
|
template <typename T, typename IndexType>
|
|
iterator_range<T const*> range(vector<T, IndexType> const& vec
|
|
, IndexType begin, IndexType end)
|
|
{
|
|
using type = typename underlying_index_t<IndexType>::type;
|
|
return {vec.data() + static_cast<type>(begin), vec.data() + static_cast<type>(end)};
|
|
}
|
|
|
|
}}
|
|
|
|
#endif
|