vector.h

Go to the documentation of this file.

 
 
/******************************************************************************
The MIT License(MIT)
 
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
 
Copyright(c) 2014 John Wellbelove
 
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
 
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
 
#ifndef ETL_VECTOR_INCLUDED
#define ETL_VECTOR_INCLUDED
 
#define ETL_IN_VECTOR_H
 
#include "platform.h"
#include "algorithm.h"
#include "type_traits.h"
#include "error_handler.h"
#include "memory.h"
#include "alignment.h"
#include "array.h"
#include "exception.h"
#include "debug_count.h"
#include "private/vector_base.h"
#include "iterator.h"
#include "functional.h"
#include "static_assert.h"
#include "placement_new.h"
#include "algorithm.h"
#include "initializer_list.h"
 
#include <stddef.h>
#include <stdint.h>
#include <stddef.h>
 
//*****************************************************************************
//*****************************************************************************
 
namespace etl
{
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  class ivector : public etl::vector_base
  {
  public:
 
    typedef T                                     value_type;
    typedef T&                                    reference;
    typedef const T&                              const_reference;
#if ETL_USING_CPP11
    typedef T&&                                   rvalue_reference;
#endif
    typedef T*                                    pointer;
    typedef const T*                              const_pointer;
    typedef T*                                    iterator;
    typedef const T*                              const_iterator;
    typedef ETL_OR_STD::reverse_iterator<iterator>       reverse_iterator;
    typedef ETL_OR_STD::reverse_iterator<const_iterator> const_reverse_iterator;
    typedef size_t                                size_type;
    typedef typename etl::iterator_traits<iterator>::difference_type difference_type;
 
  protected:
 
    typedef typename etl::parameter_type<T>::type parameter_t;
 
  public:
 
    //*********************************************************************
    //*********************************************************************
    iterator begin()
    {
      return p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_iterator begin() const
    {
      return p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    iterator end()
    {
      return p_end;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_iterator end() const
    {
      return p_end;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_iterator cbegin() const
    {
      return p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_iterator cend() const
    {
      return p_end;
    }
 
    //*********************************************************************
    //*********************************************************************
    reverse_iterator rbegin()
    {
      return reverse_iterator(end());
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reverse_iterator rbegin() const
    {
      return const_reverse_iterator(end());
    }
 
    //*********************************************************************
    //*********************************************************************
    reverse_iterator rend()
    {
      return reverse_iterator(begin());
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reverse_iterator rend() const
    {
      return const_reverse_iterator(begin());
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reverse_iterator crbegin() const
    {
      return const_reverse_iterator(cend());
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reverse_iterator crend() const
    {
      return const_reverse_iterator(cbegin());
    }
 
    //*********************************************************************
    //*********************************************************************
    void resize(size_t new_size)
    {
      resize(new_size, T());
    }
 
    //*********************************************************************
    //*********************************************************************
    void resize(size_t new_size, const_reference value)
    {
      ETL_ASSERT_OR_RETURN(new_size <= CAPACITY, ETL_ERROR(vector_full));
 
      const size_t current_size = size();
      size_t delta = (current_size < new_size) ? new_size - current_size : current_size - new_size;
 
      if (current_size < new_size)
      {
        etl::uninitialized_fill_n(p_end, delta, value);
        ETL_ADD_DEBUG_COUNT(delta)
      }
      else
      {
        etl::destroy_n(p_end - delta, delta);
        ETL_SUBTRACT_DEBUG_COUNT(delta)
      }
 
      p_end = p_buffer + new_size;
    }
 
    //*********************************************************************
    //*********************************************************************
    void uninitialized_resize(size_t new_size)
    {
      ETL_ASSERT_OR_RETURN(new_size <= CAPACITY, ETL_ERROR(vector_full));
 
#if defined(ETL_DEBUG_COUNT)
      if (size() < new_size)
      {
        ETL_ADD_DEBUG_COUNT(new_size - size())
      }
      else
      {
        ETL_SUBTRACT_DEBUG_COUNT(size() - new_size)
      }
#endif
 
      p_end = p_buffer + new_size;
    }
 
    //*********************************************************************
    //*********************************************************************
    void reserve(size_t)
    {
    }
 
    //*********************************************************************
    //*********************************************************************
    reference operator [](size_t i)
    {
      return p_buffer[i];
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reference operator [](size_t i) const
    {
      return p_buffer[i];
    }
 
    //*********************************************************************
    //*********************************************************************
    reference at(size_t i)
    {
      ETL_ASSERT(i < size(), ETL_ERROR(vector_out_of_bounds));
      return p_buffer[i];
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reference at(size_t i) const
    {
      ETL_ASSERT(i < size(), ETL_ERROR(vector_out_of_bounds));
      return p_buffer[i];
    }
 
    //*********************************************************************
    //*********************************************************************
    reference front()
    {
      return *p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reference front() const
    {
      return *p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    reference back()
    {
      return *(p_end - 1);
    }
 
    //*********************************************************************
    //*********************************************************************
    const_reference back() const
    {
      return *(p_end - 1);
    }
 
    //*********************************************************************
    //*********************************************************************
    pointer data()
    {
      return p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    const_pointer data() const
    {
      return p_buffer;
    }
 
    //*********************************************************************
    //*********************************************************************
    template <typename TIterator>
    typename etl::enable_if<!etl::is_integral<TIterator>::value, void>::type
      assign(TIterator first, TIterator last)
    {
      ETL_STATIC_ASSERT((etl::is_same<typename etl::remove_cv<T>::type, typename etl::remove_cv<typename etl::iterator_traits<TIterator>::value_type>::type>::value), "Iterator type does not match container type");
 
#if ETL_IS_DEBUG_BUILD
      difference_type d = etl::distance(first, last);
      ETL_ASSERT_OR_RETURN(static_cast<size_t>(d) <= CAPACITY, ETL_ERROR(vector_full));
#endif
 
      initialise();
 
      p_end = etl::uninitialized_copy(first, last, p_buffer);
      ETL_ADD_DEBUG_COUNT(uint32_t(etl::distance(first, last)))
    }
 
    //*********************************************************************
    //*********************************************************************
    void assign(size_t n, parameter_t value)
    {
      ETL_ASSERT_OR_RETURN(n <= CAPACITY, ETL_ERROR(vector_full));
 
      initialise();
 
      p_end = etl::uninitialized_fill_n(p_buffer, n, value);
      ETL_ADD_DEBUG_COUNT(uint32_t(n))
    }
 
    //*************************************************************************
    //*************************************************************************
    void clear()
    {
      initialise();
    }
 
    //*************************************************************************
    //*************************************************************************
    void fill(const T& value)
    {
      etl::fill(begin(), end(), value);
    }
 
    //*********************************************************************
    //*********************************************************************
    void push_back(const_reference value)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT_OR_RETURN(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      create_back(value);
    }
 
#if ETL_USING_CPP11
    //*********************************************************************
    //*********************************************************************
    void push_back(rvalue_reference value)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT_OR_RETURN(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      create_back(etl::move(value));
    }
#endif
 
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_VECTOR_FORCE_CPP03_IMPLEMENTATION)
    //*********************************************************************
    //*********************************************************************
    template <typename ... Args>
    reference emplace_back(Args && ... args)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      ::new (p_end) T(etl::forward<Args>(args)...);
      ++p_end;
      ETL_INCREMENT_DEBUG_COUNT
      return back();
    }
#else
    //*********************************************************************
    //*********************************************************************
    template <typename T1>
    reference emplace_back(const T1& value1)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      ::new (p_end) T(value1);
      ++p_end;
      ETL_INCREMENT_DEBUG_COUNT
      return back();
    }
 
    //*********************************************************************
    //*********************************************************************
    template <typename T1, typename T2>
    reference emplace_back(const T1& value1, const T2& value2)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      ::new (p_end) T(value1, value2);
      ++p_end;
      ETL_INCREMENT_DEBUG_COUNT
      return back();
    }
 
    //*********************************************************************
    //*********************************************************************
    template <typename T1, typename T2, typename T3>
    reference emplace_back(const T1& value1, const T2& value2, const T3& value3)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      ::new (p_end) T(value1, value2, value3);
      ++p_end;
      ETL_INCREMENT_DEBUG_COUNT
      return back();
    }
 
    //*********************************************************************
    //*********************************************************************
    template <typename T1, typename T2, typename T3, typename T4>
    reference emplace_back(const T1& value1, const T2& value2, const T3& value3, const T4& value4)
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
#endif
      ::new (p_end) T(value1, value2, value3, value4);
      ++p_end;
      ETL_INCREMENT_DEBUG_COUNT
      return back();
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    void pop_back()
    {
#if defined(ETL_CHECK_PUSH_POP)
      ETL_ASSERT_OR_RETURN(size() > 0, ETL_ERROR(vector_empty));
#endif
      destroy_back();
    }
 
    //*********************************************************************
    //*********************************************************************
    iterator insert(const_iterator position, const_reference value)
    {
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      if (position_ == end())
      {
        create_back(value);
      }
      else
      {
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        *position_ = value;
      }
 
      return position_;
    }
 
#if ETL_USING_CPP11
    //*********************************************************************
    //*********************************************************************
    iterator insert(const_iterator position, rvalue_reference value)
    {
      ETL_ASSERT(size() != CAPACITY, ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      if (position_ == end())
      {
        create_back(etl::move(value));
      }
      else
      {
        create_back(etl::move(back()));
        etl::move_backward(position_, p_end - 2, p_end - 1);
        *position_ = etl::move(value);
      }
 
      return position_;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT
    template <typename ... Args>
    iterator emplace(const_iterator position, Args && ... args)
    {
      ETL_ASSERT(!full(), ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      void* p;
 
      if (position_ == end())
      {
        p = p_end++;
        ETL_INCREMENT_DEBUG_COUNT
      }
      else
      {
        p = etl::addressof(*position_);
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        (*position_).~T();
      }
 
      ::new (p) T(etl::forward<Args>(args)...);
 
      return position_;
    }
#else
    template <typename T1>
    iterator emplace(const_iterator position, const T1& value1)
    {
      ETL_ASSERT(!full(), ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      void* p;
 
      if (position_ == end())
      {
        p = p_end++;
        ETL_INCREMENT_DEBUG_COUNT
      }
      else
      {
        p = etl::addressof(*position_);
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        (*position_).~T();
      }
 
      ::new (p) T(value1);
 
      return position_;
    }
 
    template <typename T1, typename T2>
    iterator emplace(const_iterator position, const T1& value1, const T2& value2)
    {
      ETL_ASSERT(!full(), ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      void* p;
 
      if (position_ == end())
      {
        p = p_end++;
        ETL_INCREMENT_DEBUG_COUNT
      }
      else
      {
        p = etl::addressof(*position_);
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        (*position_).~T();
      }
 
      ::new (p) T(value1, value2);
 
      return position_;
    }
 
    template <typename T1, typename T2, typename T3>
    iterator emplace(const_iterator position, const T1& value1, const T2& value2, const T3& value3)
    {
      ETL_ASSERT(!full(), ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      void* p;
 
      if (position_ == end())
      {
        p = p_end++;
        ETL_INCREMENT_DEBUG_COUNT
      }
      else
      {
        p = etl::addressof(*position_);
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        (*position_).~T();
      }
 
      ::new (p) T(value1, value2, value3);
 
      return position_;
    }
 
    template <typename T1, typename T2, typename T3, typename T4>
    iterator emplace(const_iterator position, const T1& value1, const T2& value2, const T3& value3, const T4& value4)
    {
      ETL_ASSERT(!full(), ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      void* p;
 
      if (position_ == end())
      {
        p = p_end++;
        ETL_INCREMENT_DEBUG_COUNT
      }
      else
      {
        p = etl::addressof(*position_);
        create_back(back());
        etl::move_backward(position_, p_end - 2, p_end - 1);
        (*position_).~T();
      }
 
      ::new (p) T(value1, value2, value3, value4);
 
      return position_;
    }
#endif
 
    //*********************************************************************
    //*********************************************************************
    void insert(const_iterator position, size_t n, parameter_t value)
    {
      ETL_ASSERT_OR_RETURN((size() + n) <= CAPACITY, ETL_ERROR(vector_full));
 
      iterator position_ = to_iterator(position);
 
      size_t insert_n = n;
      size_t insert_begin = etl::distance(begin(), position_);
      size_t insert_end = insert_begin + insert_n;
 
      // Copy old data.
      size_t copy_old_n;
      size_t construct_old_n;
      iterator p_construct_old;
 
      if (insert_end > size())
      {
        copy_old_n = 0;
        construct_old_n = size() - insert_begin;
        p_construct_old = p_buffer + insert_end;
      }
      else
      {
        copy_old_n = size() - insert_begin - insert_n;
        construct_old_n = insert_n;
        p_construct_old = p_end;
      }
 
      size_t copy_new_n = construct_old_n;
      size_t construct_new_n = insert_n - copy_new_n;
 
      // Construct old.
      etl::uninitialized_move(p_end - construct_old_n, p_end, p_construct_old);
      ETL_ADD_DEBUG_COUNT(construct_old_n)
 
      // Copy old.
      etl::move_backward(p_buffer + insert_begin, p_buffer + insert_begin + copy_old_n, p_buffer + insert_end + copy_old_n);
 
      // Construct new.
      etl::uninitialized_fill_n(p_end, construct_new_n, value);
      ETL_ADD_DEBUG_COUNT(construct_new_n)
 
        // Copy new.
        etl::fill_n(p_buffer + insert_begin, copy_new_n, value);
 
      p_end += n;
    }
 
    //*********************************************************************
    //*********************************************************************
    template <class TIterator>
    void insert(const_iterator position, TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral<TIterator>::value, int>::type = 0)
    {
      size_t count = etl::distance(first, last);
 
      ETL_ASSERT_OR_RETURN((size() + count) <= CAPACITY, ETL_ERROR(vector_full));
 
      size_t insert_n = count;
      size_t insert_begin = etl::distance(cbegin(), position);
      size_t insert_end = insert_begin + insert_n;
 
      // Move old data.
      size_t copy_old_n;
      size_t construct_old_n;
      iterator p_construct_old;
 
      if (insert_end > size())
      {
        copy_old_n = 0;
        construct_old_n = size() - insert_begin;
        p_construct_old = p_buffer + insert_end;
      }
      else
      {
        copy_old_n = size() - insert_begin - insert_n;
        construct_old_n = insert_n;
        p_construct_old = p_end;
      }
 
      size_t copy_new_n = construct_old_n;
      size_t construct_new_n = insert_n - copy_new_n;
 
      // Move construct old.
      etl::uninitialized_move(p_end - construct_old_n, p_end, p_construct_old);
      ETL_ADD_DEBUG_COUNT(construct_old_n)
 
      // Move old.
      etl::move_backward(p_buffer + insert_begin, p_buffer + insert_begin + copy_old_n, p_buffer + insert_end + copy_old_n);
 
      // Copy construct new.
      etl::uninitialized_copy(first + copy_new_n, first + copy_new_n + construct_new_n, p_end);
      ETL_ADD_DEBUG_COUNT(construct_new_n)
 
      // Copy new.
      etl::copy(first, first + copy_new_n, p_buffer + insert_begin);
 
      p_end += count;
    }
 
    //*********************************************************************
    //*********************************************************************
    iterator erase(iterator i_element)
    {
      etl::move(i_element + 1, end(), i_element);
      destroy_back();
 
      return i_element;
    }
 
    //*********************************************************************
    //*********************************************************************
    iterator erase(const_iterator i_element)
    {
      iterator i_element_ = to_iterator(i_element);
 
      etl::move(i_element_ + 1, end(), i_element_);
      destroy_back();
 
      return i_element_;
    }
 
    //*********************************************************************
    //*********************************************************************
    iterator erase(const_iterator first, const_iterator last)
    {
      iterator first_ = to_iterator(first);
      iterator last_  = to_iterator(last);
 
      if (first == begin() && last == end())
      {
        clear();
      }
      else
      {
        etl::move(last_, end(), first_);
        size_t n_delete = etl::distance(first_, last_);
 
        // Destroy the elements left over at the end.
        etl::destroy(p_end - n_delete, p_end);
        ETL_SUBTRACT_DEBUG_COUNT(n_delete)
        p_end -= n_delete;
      }
 
      return first_;
    }
 
    //*************************************************************************
    //*************************************************************************
    ivector& operator = (const ivector& rhs)
    {
      if (&rhs != this)
      {
        assign(rhs.cbegin(), rhs.cend());
      }
 
      return *this;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    ivector& operator = (ivector&& rhs)
    {
      if (&rhs != this)
      {
        clear();
        iterator itr = rhs.begin();
        while (itr != rhs.end())
        {
          push_back(etl::move(*itr));
          ++itr;
        }
 
        rhs.initialise();
      }
 
      return *this;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    size_type size() const
    {
      return size_t(p_end - p_buffer);
    }
 
    //*************************************************************************
    //*************************************************************************
    bool empty() const
    {
      return (p_end == p_buffer);
    }
 
    //*************************************************************************
    //*************************************************************************
    bool full() const
    {
      return size() == CAPACITY;
    }
 
    //*************************************************************************
    //*************************************************************************
    size_t available() const
    {
      return max_size() - size();
    }
 
#ifdef ETL_IVECTOR_REPAIR_ENABLE
    //*************************************************************************
    //*************************************************************************
    virtual void repair() = 0;
#endif
 
  protected:
 
    //*********************************************************************
    //*********************************************************************
    ivector(T* p_buffer_, size_t MAX_SIZE)
      : vector_base(MAX_SIZE)
      , p_buffer(p_buffer_)
      , p_end(p_buffer_)
    {
    }
 
    //*********************************************************************
    //*********************************************************************
    void initialise()
    {
      etl::destroy(p_buffer, p_end);
      ETL_SUBTRACT_DEBUG_COUNT(int32_t(etl::distance(p_buffer, p_end)))
 
      p_end = p_buffer;
    }
 
    //*************************************************************************
    //*************************************************************************
    void repair_buffer(T* p_buffer_)
    {
      uintptr_t length = p_end - p_buffer;
      p_buffer = p_buffer_;
      p_end    = p_buffer_ + length;
    }
 
    pointer p_buffer; 
    pointer p_end;    
 
  private:
 
    //*********************************************************************
    //*********************************************************************
    void create_back()
    {
      etl::create_value_at(p_end);
      ETL_INCREMENT_DEBUG_COUNT
 
      ++p_end;
    }
 
    //*********************************************************************
    //*********************************************************************
    void create_back(const_reference value)
    {
      etl::create_copy_at(p_end, value);
      ETL_INCREMENT_DEBUG_COUNT
 
      ++p_end;
    }
 
#if ETL_USING_CPP11
    //*********************************************************************
    //*********************************************************************
    void create_back(rvalue_reference value)
    {
      etl::create_copy_at(p_end, etl::move(value));
      ETL_INCREMENT_DEBUG_COUNT
 
      ++p_end;
    }
#endif
 
    //*********************************************************************
    //*********************************************************************
    void destroy_back()
    {
      --p_end;
 
      etl::destroy_at(p_end);
      ETL_DECREMENT_DEBUG_COUNT
    }
 
    // Disable copy construction.
    ivector(const ivector&) ETL_DELETE;
 
  private:
 
    //*************************************************************************
    //*************************************************************************
    ETL_CONSTEXPR iterator to_iterator(const_iterator itr) const
    {
      return const_cast<iterator>(itr);
    }
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator ==(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return (lhs.size() == rhs.size()) && etl::equal(lhs.begin(), lhs.end(), rhs.begin());
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator !=(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return !(lhs == rhs);
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator <(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return etl::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator >(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return (rhs < lhs);
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator <=(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return !(lhs > rhs);
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  bool operator >=(const etl::ivector<T>& lhs, const etl::ivector<T>& rhs)
  {
    return !(lhs < rhs);
  }
}
 
#include "private/ivectorpointer.h"
 
namespace etl
{
  //***************************************************************************
  //***************************************************************************
  template <typename T, const size_t MAX_SIZE_>
  class vector : public etl::ivector<T>
  {
  public:
 
    ETL_STATIC_ASSERT((MAX_SIZE_ > 0U), "Zero capacity etl::vector is not valid");
 
    static const size_t MAX_SIZE = MAX_SIZE_;
 
    //*************************************************************************
    //*************************************************************************
    vector()
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->initialise();
    }
 
    //*************************************************************************
    //*************************************************************************
    explicit vector(size_t initial_size)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->initialise();
      this->resize(initial_size);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector(size_t initial_size, typename etl::ivector<T>::parameter_t value)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->initialise();
      this->resize(initial_size, value);
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename TIterator>
    vector(TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral<TIterator>::value, int>::type = 0)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->assign(first, last);
    }
 
#if ETL_HAS_INITIALIZER_LIST
    //*************************************************************************
    //*************************************************************************
    vector(std::initializer_list<T> init)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->assign(init.begin(), init.end());
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    vector(const vector& other)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      this->assign(other.begin(), other.end());
    }
 
    //*************************************************************************
    //*************************************************************************
    vector& operator = (const vector& rhs)
    {
      if (&rhs != this)
      {
        this->assign(rhs.cbegin(), rhs.cend());
      }
 
      return *this;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    vector(vector&& other)
      : etl::ivector<T>(reinterpret_cast<T*>(&buffer), MAX_SIZE)
    {
      if (this != &other)
      {
        this->initialise();
 
        typename etl::ivector<T>::iterator itr = other.begin();
        while (itr != other.end())
        {
          this->push_back(etl::move(*itr));
          ++itr;
        }
 
        other.initialise();
      }
    }
 
    //*************************************************************************
    //*************************************************************************
    vector& operator = (vector&& rhs)
    {
      if (&rhs != this)
      {
        this->clear();
        typename etl::ivector<T>::iterator itr = rhs.begin();
        while (itr != rhs.end())
        {
          this->push_back(etl::move(*itr));
          ++itr;
        }
 
        rhs.initialise();
      }
 
      return *this;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
#ifdef ETL_IVECTOR_REPAIR_ENABLE
    virtual
#endif
    ~vector()
    {
      this->clear();
    }
 
    //*************************************************************************
    //*************************************************************************
#ifdef ETL_IVECTOR_REPAIR_ENABLE
    virtual
#endif
    void repair()
#ifdef ETL_IVECTOR_REPAIR_ENABLE
      ETL_OVERRIDE
#endif
    {
      ETL_ASSERT_OR_RETURN(etl::is_trivially_copyable<T>::value, ETL_ERROR(etl::vector_incompatible_type));
 
      etl::ivector<T>::repair_buffer(buffer);
    }
 
  private:
 
    typename etl::aligned_storage<sizeof(T) * MAX_SIZE, etl::alignment_of<T>::value>::type buffer;
  };
 
  //*************************************************************************
  //*************************************************************************
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
  template <typename... T>
  vector(T...) -> vector<typename etl::common_type_t<T...>, sizeof...(T)>;
#endif
 
  //*************************************************************************
  //*************************************************************************
#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
  template <typename... T>
  constexpr auto make_vector(T&&... t) -> etl::vector<typename etl::common_type_t<T...>, sizeof...(T)>
  {
    return { { etl::forward<T>(t)... } };
  }
#endif
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  class vector_ext : public etl::ivector<T>
  {
  public:
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->initialise();
    }
 
    //*************************************************************************
    //*************************************************************************
    explicit vector_ext(size_t initial_size, void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->initialise();
      this->resize(initial_size);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(size_t initial_size, typename etl::ivector<T>::parameter_t value, void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->initialise();
      this->resize(initial_size, value);
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename TIterator>
    vector_ext(TIterator first, TIterator last, void* buffer, size_t max_size, typename etl::enable_if<!etl::is_integral<TIterator>::value, int>::type = 0)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->assign(first, last);
    }
 
#if ETL_HAS_INITIALIZER_LIST
    //*************************************************************************
    //*************************************************************************
    vector_ext(std::initializer_list<T> init, void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->assign(init.begin(), init.end());
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(const vector_ext& other, void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      this->assign(other.begin(), other.end());
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext& operator = (const vector_ext& rhs)
    {
      if (&rhs != this)
      {
        this->assign(rhs.cbegin(), rhs.cend());
      }
 
      return *this;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    vector_ext(vector_ext&& other, void* buffer, size_t max_size)
      : etl::ivector<T>(reinterpret_cast<T*>(buffer), max_size)
    {
      if (this != &other)
      {
        this->initialise();
 
        typename etl::ivector<T>::iterator itr = other.begin();
        while (itr != other.end())
        {
          this->push_back(etl::move(*itr));
          ++itr;
        }
 
        other.initialise();
      }
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext& operator = (vector_ext&& rhs)
    {
      if (&rhs != this)
      {
        this->clear();
 
        typename etl::ivector<T>::iterator itr = rhs.begin();
        while (itr != rhs.end())
        {
          this->push_back(etl::move(*itr));
          ++itr;
        }
 
        rhs.initialise();
      }
 
      return *this;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    ~vector_ext()
    {
      this->clear();
    }
 
    //*************************************************************************
    //*************************************************************************
    void repair()
#ifdef ETL_IVECTOR_REPAIR_ENABLE
      ETL_OVERRIDE
#endif
    {
    }
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, const size_t MAX_SIZE_>
  class vector<T*, MAX_SIZE_> : public etl::ivector<T*>
  {
  public:
 
    ETL_STATIC_ASSERT((MAX_SIZE_ > 0U), "Zero capacity etl::vector is not valid");
 
    static const size_t MAX_SIZE = MAX_SIZE_;
 
    //*************************************************************************
    //*************************************************************************
    vector()
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      this->initialise();
    }
 
    //*************************************************************************
    //*************************************************************************
    explicit vector(size_t initial_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      this->initialise();
      this->resize(initial_size);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector(size_t initial_size, typename etl::ivector<T*>::parameter_t value)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      this->initialise();
      this->resize(initial_size, value);
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename TIterator>
    vector(TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral<TIterator>::value, int>::type = 0)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      this->assign(first, last);
    }
 
#if ETL_HAS_INITIALIZER_LIST
    //*************************************************************************
    //*************************************************************************
    vector(std::initializer_list<T*> init)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      this->assign(init.begin(), init.end());
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    vector(const vector& other)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      (void)etl::ivector<T*>::operator = (other);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector& operator = (const vector& rhs)
    {
      (void)etl::ivector<T*>::operator = (rhs);
 
      return *this;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    vector(vector&& other)
      : etl::ivector<T*>(reinterpret_cast<T**>(&buffer), MAX_SIZE)
    {
      (void)etl::ivector<T*>::operator = (etl::move(other));
    }
 
    //*************************************************************************
    //*************************************************************************
    vector& operator = (vector&& rhs)
    {
      (void)etl::ivector<T*>::operator = (etl::move(rhs));
 
      return *this;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    void repair()
#ifdef ETL_IVECTOR_REPAIR_ENABLE
      ETL_OVERRIDE
#endif
    {
      etl::ivector<T*>::repair_buffer(buffer);
    }
 
  private:
 
    typename etl::aligned_storage<sizeof(T*) * MAX_SIZE, etl::alignment_of<T*>::value>::type buffer;
  };
 
  //*************************************************************************
  //*************************************************************************
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
  template <typename... T>
  vector(T*...) -> vector<typename etl::common_type_t<T*...>, sizeof...(T)>;
#endif
 
#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
  template <typename... T>
  constexpr auto make_vector(T*... t) -> etl::vector<typename etl::common_type_t<T*...>, sizeof...(T)>
  {
    return { { etl::forward<T*>(t)... } };
  }
#endif
 
  //***************************************************************************
  //***************************************************************************
  template <typename T>
  class vector_ext<T*> : public etl::ivector<T*>
  {
  public:
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      this->initialise();
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(size_t initial_size, void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      this->initialise();
      this->resize(initial_size);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(size_t initial_size, typename etl::ivector<T*>::parameter_t value, void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      this->initialise();
      this->resize(initial_size, value);
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename TIterator>
    vector_ext(TIterator first, TIterator last, void* buffer, size_t max_size, typename etl::enable_if<!etl::is_integral<TIterator>::value, int>::type = 0)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      this->assign(first, last);
    }
 
#if ETL_HAS_INITIALIZER_LIST
    //*************************************************************************
    //*************************************************************************
    vector_ext(std::initializer_list<T*> init, void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      this->assign(init.begin(), init.end());
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(const vector_ext& other, void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      (void)etl::ivector<T*>::operator = (other);
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(const vector_ext& other) ETL_DELETE;
 
    //*************************************************************************
    //*************************************************************************
    vector_ext& operator = (const vector_ext& rhs)
    {
      (void)etl::ivector<T*>::operator = (rhs);
 
      return *this;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    vector_ext(vector_ext&& other, void* buffer, size_t max_size)
      : etl::ivector<T*>(reinterpret_cast<T**>(buffer), max_size)
    {
      (void)etl::ivector<T*>::operator = (etl::move(other));
    }
 
    //*************************************************************************
    //*************************************************************************
    vector_ext(vector_ext&& other) ETL_DELETE;
 
    //*************************************************************************
    //*************************************************************************
    vector_ext& operator = (vector_ext&& rhs)
    {
      (void)etl::ivector<T*>::operator = (etl::move(rhs));
 
      return *this;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    ~vector_ext()
    {
      this->clear();
    }
 
    //*************************************************************************
    //*************************************************************************
    void repair()
#ifdef ETL_IVECTOR_REPAIR_ENABLE
      ETL_OVERRIDE
#endif
    {
      etl::ivector<T*>::repair_buffer(this->p_buffer);
    }
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, typename U>
  typename etl::ivector<T>::difference_type
  erase(etl::ivector<T>& v, const U& value)
  {
    typename etl::ivector<T>::iterator itr = etl::remove(v.begin(), v.end(), value);
    typename etl::ivector<T>::difference_type d = etl::distance(itr, v.end());
    v.erase(itr, v.end());
 
    return d;
  }
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, typename TPredicate>
  typename etl::ivector<T>::difference_type
  erase_if(etl::ivector<T>& v, TPredicate predicate)
  {
    typename etl::ivector<T>::iterator itr = etl::remove_if(v.begin(), v.end(), predicate);
    typename etl::ivector<T>::difference_type d = etl::distance(itr, v.end());
    v.erase(itr, v.end());
 
    return d;
  }
}
 
#endif