reservedvector.hh

Go to the documentation of this file.

// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
// SPDX-FileCopyrightInfo: Copyright © DUNE Project contributors, see file LICENSE.md in module root
// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
#ifndef DUNE_COMMON_RESERVEDVECTOR_HH
#define DUNE_COMMON_RESERVEDVECTOR_HH
 
#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <iterator>
#include <cstddef>
#include <initializer_list>
 
#include <dune/common/hash.hh>
#include <dune/common/std/algorithm.hh>
#include <dune/common/std/compare.hh>
 
#ifdef CHECK_RESERVEDVECTOR
#define CHECKSIZE(X) assert(X)
#else
#define CHECKSIZE(X) {}
#endif
 
namespace Dune
{
  template<class T, int n>
  class ReservedVector
  {
    using storage_type = std::array<T,n>;
 
  public:
 
    typedef typename storage_type::value_type value_type;
    typedef typename storage_type::pointer pointer;
    typedef typename storage_type::const_pointer const_pointer;
    typedef typename storage_type::reference reference;
    typedef typename storage_type::const_reference const_reference;
    typedef typename storage_type::size_type size_type;
    typedef typename storage_type::difference_type difference_type;
    typedef typename storage_type::iterator iterator;
    typedef typename storage_type::const_iterator const_iterator;
    typedef std::reverse_iterator<iterator> reverse_iterator;
    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
 
    constexpr ReservedVector()
          noexcept(std::is_nothrow_default_constructible_v<value_type>)
      : storage_()
      , size_(0)
    {}
 
    explicit constexpr ReservedVector(size_type count)
          noexcept(std::is_nothrow_default_constructible_v<value_type>)
      : storage_()
      , size_(count)
    {
      assert(count <= n);
    }
 
    constexpr ReservedVector(size_type count, const value_type& value)
          noexcept(std::is_nothrow_copy_assignable_v<value_type> &&
          noexcept(ReservedVector(count)))
      : ReservedVector(count)
    {
      for (size_type i=0; i<count; ++i)
        storage_[i] = value;
    }
 
    template<class InputIt,
      std::enable_if_t<std::is_convertible_v<typename std::iterator_traits<InputIt>::value_type, value_type>, int> = 0>
    constexpr ReservedVector(InputIt first, InputIt last)
          noexcept(std::is_nothrow_copy_assignable_v<value_type> &&
          noexcept(ReservedVector()))
      : ReservedVector()
    {
      for (size_type i=0; i<n && first!=last; ++i,++size_)
        storage_[i] = *first++;
      assert(first == last);
    }
 
    constexpr ReservedVector(std::initializer_list<value_type> const& l)
          noexcept(std::is_nothrow_copy_assignable_v<value_type> &&
          noexcept(ReservedVector(l.begin(),l.end())))
      : ReservedVector(l.begin(),l.end())
    {}
 
    constexpr bool operator== (const ReservedVector& that) const noexcept
    {
      if (size() != that.size())
        return false;
      for (size_type i=0; i<size(); ++i)
        if (!(storage_[i]==that.storage_[i]))
          return false;
      return true;
    }
 
    constexpr auto operator<=> (const ReservedVector& that) const noexcept
    {
      return Std::lexicographical_compare_three_way(begin(), end(), that.begin(), that.end());
    }
 
    constexpr void clear() noexcept
    {
      size_ = 0;
    }
 
    constexpr void resize(size_type s) noexcept
    {
      CHECKSIZE(s<=n);
      size_ = s;
    }
 
    constexpr iterator insert(const_iterator pos, const T& value)
    {
      CHECKSIZE(size_<n);
      iterator it = begin() + std::distance(cbegin(), pos);
      std::move_backward(it, end(), end()+1);
      *it = value;
      ++size_;
      return it;
    }
 
    constexpr iterator insert(const_iterator pos, T&& value)
    {
      CHECKSIZE(size_<n);
      iterator it = begin() + std::distance(cbegin(), pos);
      std::move_backward(it, end(), end()+1);
      *it = std::move(value);
      ++size_;
      return it;
    }
 
    constexpr iterator insert(const_iterator pos, size_type count, const T& value)
    {
      CHECKSIZE(size_+count<=n);
      iterator it = begin() + std::distance(cbegin(), pos);
      std::move_backward(it, end(), end()+count);
      std::fill(it, it+count, value);
      size_+=count;
      return it;
    }
 
    template <std::forward_iterator InputIt>
    constexpr iterator insert(const_iterator pos, InputIt first, InputIt last)
    {
      size_type count = std::distance(first,last);
      CHECKSIZE(size_+count<=n);
      iterator it = begin() + std::distance(cbegin(), pos);
      std::move_backward(it, end(), end()+count);
      std::copy(first, last, it);
      size_+=count;
      return it;
    }
 
    constexpr iterator insert(const_iterator pos, std::initializer_list<T> ilist)
    {
      return insert(pos, ilist.begin(), ilist.end());
    }
 
    constexpr void push_back(const value_type& t)
          noexcept(std::is_nothrow_copy_assignable_v<value_type>)
    {
      CHECKSIZE(size_<n);
      storage_[size_++] = t;
    }
 
    constexpr void push_back(value_type&& t)
          noexcept(std::is_nothrow_move_assignable_v<value_type>)
    {
      CHECKSIZE(size_<n);
      storage_[size_++] = std::move(t);
    }
 
    template<class... Args>
    reference emplace_back(Args&&... args)
          noexcept(std::is_nothrow_constructible_v<value_type,decltype(args)...>)
    {
      CHECKSIZE(size_<n);
      value_type* p = &storage_[size_++];
      // first destroy any previously (default) constructed element at that location
      p->~value_type();
      // construct the value_type in place
      // NOTE: This is not an integral constant expression.
      // With c++20 we could use std::construct_at
      ::new (const_cast<void*>(static_cast<const volatile void*>(p)))
          value_type(std::forward<Args>(args)...);
      return *p;
    }
 
    constexpr void pop_back() noexcept
    {
      if (! empty()) size_--;
    }
 
    constexpr iterator begin() noexcept
    {
      return storage_.begin();
    }
 
    constexpr const_iterator begin() const noexcept
    {
      return storage_.begin();
    }
 
    constexpr const_iterator cbegin() const noexcept
    {
      return storage_.cbegin();
    }
 
    constexpr reverse_iterator rbegin() noexcept
    {
      return reverse_iterator{begin()+size()};
    }
 
    constexpr const_reverse_iterator rbegin() const noexcept
    {
      return const_reverse_iterator{begin()+size()};
    }
 
    constexpr const_reverse_iterator crbegin() const noexcept
    {
      return const_reverse_iterator{begin()+size()};
    }
 
    constexpr iterator end() noexcept
    {
      return storage_.begin()+size();
    }
 
    constexpr const_iterator end() const noexcept
    {
      return storage_.begin()+size();
    }
 
    constexpr const_iterator cend() const noexcept
    {
      return storage_.cbegin()+size();
    }
 
    constexpr reverse_iterator rend() noexcept
    {
      return reverse_iterator{begin()};
    }
 
    constexpr const_reverse_iterator rend() const noexcept
    {
      return const_reverse_iterator{begin()};
    }
 
    constexpr const_reverse_iterator crend() const noexcept
    {
      return const_reverse_iterator{begin()};
    }
 
    constexpr reference at(size_type i)
    {
      if (!(i < size()))
        throw std::out_of_range("Index out of range");
      return storage_[i];
    }
 
    constexpr const_reference at(size_type i) const
    {
      if (!(i < size()))
        throw std::out_of_range("Index out of range");
      return storage_[i];
    }
 
    constexpr reference operator[] (size_type i) noexcept
    {
      CHECKSIZE(size_>i);
      return storage_[i];
    }
 
    constexpr const_reference operator[] (size_type i) const noexcept
    {
      CHECKSIZE(size_>i);
      return storage_[i];
    }
 
    constexpr reference front() noexcept
    {
      CHECKSIZE(size_>0);
      return storage_[0];
    }
 
    constexpr const_reference front() const noexcept
    {
      CHECKSIZE(size_>0);
      return storage_[0];
    }
 
    constexpr reference back() noexcept
    {
      CHECKSIZE(size_>0);
      return storage_[size_-1];
    }
 
    constexpr const_reference back() const noexcept
    {
      CHECKSIZE(size_>0);
      return storage_[size_-1];
    }
 
    constexpr pointer data() noexcept
    {
      return storage_.data();
    }
 
    constexpr const_pointer data() const noexcept
    {
      return storage_.data();
    }
 
    constexpr size_type size() const noexcept
    {
      return size_;
    }
 
    constexpr bool empty() const noexcept
    {
      return size_==0;
    }
 
    static constexpr size_type capacity() noexcept
    {
      return n;
    }
 
    static constexpr size_type max_size() noexcept
    {
      return n;
    }
 
    constexpr void fill(const value_type& value)
          noexcept(std::is_nothrow_copy_assignable_v<value_type>)
    {
      for (size_type i=0; i<size(); ++i)
        storage_[i] = value;
    }
 
    void swap(ReservedVector& other)
          noexcept(std::is_nothrow_swappable_v<value_type>)
    {
      using std::swap;
      swap(storage_, other.storage_);
      swap(size_, other.size_);
    }
 
    friend std::ostream& operator<< (std::ostream& s, const ReservedVector& v)
    {
      for (size_type i=0; i<v.size(); i++)
        s << v[i] << "  ";
      return s;
    }
 
    inline friend std::size_t hash_value(const ReservedVector& v) noexcept
    {
      return hash_range(v.storage_.data(),v.storage_.data()+v.size_);
    }
 
  private:
    storage_type storage_;
    size_type size_;
  };
 
}
 
DUNE_DEFINE_HASH(DUNE_HASH_TEMPLATE_ARGS(typename T, int n),DUNE_HASH_TYPE(Dune::ReservedVector<T,n>))
 
#undef CHECKSIZE
 
#endif // DUNE_COMMON_RESERVEDVECTOR_HH