0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-12-29 08:54:02 +01:00
construct/include/ircd/array_view.h

130 lines
4 KiB
C
Raw Normal View History

2017-11-16 02:21:26 +01:00
/*
* 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_ARRAY_VIEW_H
namespace ircd
{
template<class T> struct array_view;
}
template<class T>
struct ircd::array_view
{
using value_type = const 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:
const value_type *data() const { return _data; }
value_type *data() { 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; }
const value_type &operator[](const size_t &pos) const
{
return *(data() + pos);
}
value_type &operator[](const size_t &pos)
{
return *(data() + pos);
}
const value_type &at(const size_t &pos) const
{
if(unlikely(pos >= size()))
throw std::out_of_range("array_view::range_check");
return operator[](pos);
}
value_type &at(const size_t &pos)
{
if(unlikely(pos >= size()))
throw std::out_of_range("array_view::range_check");
return operator[](pos);
}
array_view(value_type *const &start, value_type *const &stop)
:_data{start}
,_stop{stop}
{}
array_view(value_type *const &start, const size_t &size)
:array_view(start, start + size)
{}
array_view(const std::initializer_list<value_type> &list)
:array_view(std::begin(list), std::end(list))
{}
template<class U,
class A>
array_view(const std::vector<U, A> &v)
:array_view(v.data(), v.size())
{}
template<class U,
class A>
array_view(std::vector<U, A> &v)
:array_view(v.data(), v.size())
{}
template<size_t SIZE>
array_view(value_type (&buffer)[SIZE])
:array_view(buffer, SIZE)
{}
template<class U,
size_t SIZE>
array_view(const std::array<U, SIZE> &array)
:array_view(array.data(), array.size())
{}
template<size_t SIZE>
array_view(std::array<value_type, SIZE> &array)
:array_view(array.data(), array.size())
{}
array_view() = default;
};