mirror of
https://github.com/matrix-construct/construct
synced 2024-11-16 23:10:54 +01:00
114 lines
3.7 KiB
C++
114 lines
3.7 KiB
C++
/*
|
|
* charybdis: 21st Century IRC++d
|
|
* util.h: Miscellaneous utilities
|
|
*
|
|
* Copyright (C) 2016 Charybdis Development Team
|
|
* Copyright (C) 2016 Jason Volk <jason@zemos.net>
|
|
*
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice is present in all copies.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
|
*
|
|
*/
|
|
|
|
#pragma once
|
|
#define HAVE_IRCD_VECTOR_VIEW_H
|
|
|
|
namespace ircd
|
|
{
|
|
template<class T> struct vector_view;
|
|
}
|
|
|
|
template<class T>
|
|
struct ircd::vector_view
|
|
{
|
|
using value_type = T;
|
|
using pointer = value_type *;
|
|
using reference = value_type &;
|
|
using difference_type = size_t;
|
|
using iterator = value_type *;
|
|
using const_iterator = const value_type *;
|
|
|
|
value_type *_data { nullptr };
|
|
value_type *_stop { nullptr };
|
|
|
|
public:
|
|
value_type *data() const { return _data; }
|
|
size_t size() const { return std::distance(_data, _stop); }
|
|
bool empty() const { return !size(); }
|
|
|
|
const_iterator begin() const { return data(); }
|
|
const_iterator end() const { return _stop; }
|
|
const_iterator cbegin() { return data(); }
|
|
const_iterator cend() { return _stop; }
|
|
iterator begin() { return data(); }
|
|
iterator end() { return _stop; }
|
|
|
|
value_type &operator[](const size_t &pos) const
|
|
{
|
|
return *(data() + pos);
|
|
}
|
|
|
|
value_type &at(const size_t &pos) const
|
|
{
|
|
if(unlikely(pos >= size()))
|
|
throw std::out_of_range("vector_view::range_check");
|
|
|
|
return operator[](pos);
|
|
}
|
|
|
|
vector_view(value_type *const &start, value_type *const &stop)
|
|
:_data{start}
|
|
,_stop{stop}
|
|
{}
|
|
|
|
vector_view(value_type *const &start, const size_t &size)
|
|
:vector_view(start, start + size)
|
|
{}
|
|
|
|
vector_view(const std::initializer_list<value_type> &list)
|
|
:vector_view(std::begin(list), std::end(list))
|
|
{}
|
|
|
|
template<class U,
|
|
class A>
|
|
vector_view(const std::vector<U, A> &v)
|
|
:vector_view(v.data(), v.size())
|
|
{}
|
|
|
|
template<class U,
|
|
class A>
|
|
vector_view(std::vector<U, A> &v)
|
|
:vector_view(v.data(), v.size())
|
|
{}
|
|
|
|
template<size_t SIZE>
|
|
vector_view(value_type (&buffer)[SIZE])
|
|
:vector_view(buffer, SIZE)
|
|
{}
|
|
|
|
template<class U,
|
|
size_t SIZE>
|
|
vector_view(const std::array<U, SIZE> &array)
|
|
:vector_view(array.data(), array.size())
|
|
{}
|
|
|
|
template<size_t SIZE>
|
|
vector_view(std::array<value_type, SIZE> &array)
|
|
:vector_view(array.data(), array.size())
|
|
{}
|
|
|
|
vector_view() = default;
|
|
};
|