ListImpl.h

// -*- tab-width: 2; indent-tabs-mode: nil; coding: utf-8-with-signature -*-
//-----------------------------------------------------------------------------
// Copyright 2000-2022 CEA (www.cea.fr) IFPEN (www.ifpenergiesnouvelles.com)
// See the top-level COPYRIGHT file for details.
// SPDX-License-Identifier: Apache-2.0
//-----------------------------------------------------------------------------
/*---------------------------------------------------------------------------*/
/* ListImpl.h                                                  (C) 2000-2022 */
/*                                                                           */
/* Implémentation de la classe Tableau.                                      */
/*---------------------------------------------------------------------------*/
#ifndef ARCANE_UTILS_LISTIMPL_H
#define ARCANE_UTILS_LISTIMPL_H
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
#include "arcane/utils/CollectionImpl.h"
#include "arcane/utils/Enumerator.h"
#include "arcane/utils/UniqueArray.h"
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
namespace Arcane
{
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
extern "C" ARCANE_UTILS_EXPORT void throwOutOfRangeException();
extern "C" ARCANE_UTILS_EXPORT void throwNullReference();
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
template <class T>
class ListImplBase
: public CollectionImplT<T>
{
 public:
 
  typedef CollectionImplT<T> BaseClass;
 
 public:
 
  typedef const T& ObjectRef;
 
  typedef T value_type;
  typedef value_type* iterator;
  typedef const value_type* const_iterator;
  typedef value_type* pointer;
  typedef const value_type* const_pointer;
  typedef value_type& reference;
  typedef const value_type& const_reference;
 
  typedef IterT<ListImplBase<T>> iter;
  typedef ConstIterT<ListImplBase<T>> const_iter;
 
 public:
 
  ListImplBase() = default;
 
 public:
 
  void assign(const ListImplBase<T>& s)
  {
    _arrayCopy(s);
  }
  void assign(const ConstArrayView<T>& s)
  {
    _arrayCopy(s);
  }
  void assign(const ArrayView<T>& s)
  {
    _arrayCopy(s);
  }
 
 public:
 
  T& operator[](Integer i)
  {
    return m_array[i];
  }
 
  const T& operator[](Integer i) const
  {
    return m_array[i];
  }
 
  iterator begin() override
  {
    return m_array.data();
  }
  iterator end() override
  {
    return m_array.data() + this->count();
  }
  const_iterator begin() const override
  {
    return m_array.data();
  }
  const_iterator end() const override
  {
    return m_array.data() + this->count();
  }
 
  T* begin2() const override
  {
    return const_cast<T*>(m_array.data());
  }
 
  T* end2() const override
  {
    return begin2() + this->count();
  }
 
 public:
 
  template <class Function> Function
  each(Function f)
  {
    std::for_each(begin(), end(), f);
    return f;
  }
 
 public:
 
  void reserve(Integer new_capacity)
  {
    m_array.reserve(new_capacity);
  }
 
  Integer capacity() const
  {
    return m_array.capacity();
  }
 
  void clear() override
  {
    this->onClear();
    m_array.clear();
    this->_setCount(0);
    this->onClearComplete();
  }
 
  void add(ObjectRef elem) override
  {
    this->onInsert();
    Integer s = this->count();
    m_array.add(elem);
    this->_setCount(s + 1);
    this->onInsertComplete(_ptr() + s, s);
  }
 
  bool remove(ObjectRef element) override
  {
    Integer i = 0;
    Integer s = this->count();
    for (; i < s; ++i)
      if (m_array[i] == element) {
        _removeAt(i);
        return true;
      }
    throwOutOfRangeException();
    return false;
  }
 
  void removeAt(Integer index) override
  {
    Integer s = this->count();
    if (index >= s)
      throwOutOfRangeException();
    _removeAt(index);
  }
 
  const_iterator find(ObjectRef element) const
  {
    Integer s = this->count();
    for (Int32 i = 0; i < s; ++i)
      if (m_array[i] == element)
        return begin() + i;
    return end();
  }
 
  bool contains(ObjectRef element) const override
  {
    const_iterator i = find(element);
    return (i != end());
  }
 
  EnumeratorImplBase* enumerator() const override;
 
 protected:
 
  void _removeAt(Integer index)
  {
    Integer s = this->count();
    T* ptr = _ptr();
    T* remove_ob = ptr + index;
    this->onRemove();
    m_array.remove(index);
    this->_setCount(s - 1);
    // TODO: supprimer utilisation de 'remove_ob' car ce n'est pas le bon objet
    this->onRemoveComplete(remove_ob, index);
  }
 
 public:
 
  void resize(Integer new_size)
  {
    m_array.resize(new_size);
    this->_setCount(new_size);
  }
 
 protected:
 
  Integer _capacity() const
  {
    return m_array.capacity();
  }
 
 protected:
 
  void _arrayCopy(const ListImplBase<T>& array)
  {
    _arrayCopy(array.begin2(), array.count());
  }
  void _arrayCopy(const ConstArrayView<T>& array)
  {
    _arrayCopy(array.data(), array.size());
  }
  void _arrayCopy(const ArrayView<T>& array)
  {
    _arrayCopy(array.data(), array.size());
  }
  void _arrayCopy(const T* from_ptr, Integer from_size)
  {
    if (from_size == 0) {
      clear();
      return;
    }
    m_array.copy(ConstArrayView<T>(from_size, from_ptr));
    this->_setCount(from_size);
  }
 
 protected:
 
  inline T* _ptr()
  {
    return m_array.data();
  }
 
  inline const T* _ptr() const
  {
    return m_array.data();
  }
 
 private:
 
  UniqueArray<T> m_array;
 
 private:
};
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
template <class T>
class ListImplT
: public ListImplBase<T>
{
 public:
 
  typedef ListImplBase<T> BaseClass;
 
 public:
 
  ListImplT() {}
  explicit ListImplT(const ConstArrayView<T>& array)
  {
    this->_arrayCopy(array);
  }
  explicit ListImplT(const ArrayView<T>& array)
  {
    this->_arrayCopy(array);
  }
  ListImplT(const ListImplT<T>& array)
  : BaseClass()
  {
    this->_arrayCopy(array);
  }
  explicit ListImplT(const Collection<T>& array)
  : BaseClass()
  {
    for (typename Collection<T>::Enumerator i(array); ++i;) {
      BaseClass::add(*i);
    }
  }
  explicit ListImplT(const EnumeratorT<T>& enumerator)
  : BaseClass()
  {
    for (EnumeratorT<T> i(enumerator); ++i;) {
      BaseClass::add(*i);
    }
  }
 
  void assign(const Collection<T>& array)
  {
    this->clear();
    for (typename Collection<T>::Enumerator i(array); ++i;) {
      this->add(*i);
    }
  }
  void assign(const EnumeratorT<T>& enumerator)
  {
    this->clear();
    for (EnumeratorT<T> i(enumerator); ++i;) {
      this->add(*i);
    }
  }
 
 private:
};
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
template <class T>
class ListEnumeratorImplT
: public EnumeratorImplBase
{
 public:
 
  typedef T* Ptr;
 
 public:
 
  ListEnumeratorImplT(Ptr begin, Ptr end)
  : m_begin(begin)
  , m_current(begin - 1)
  , m_end(end)
  {}
 
 public:
 
  void reset() override { m_current = m_begin - 1; }
  bool moveNext() override
  {
    ++m_current;
    return m_current < m_end;
  }
  void* current() override { return m_current; }
  const void* current() const override { return m_current; }
 
 private:
 
  Ptr m_begin;
  Ptr m_current;
  Ptr m_end;
};
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
template <class T> EnumeratorImplBase* ListImplBase<T>::
enumerator() const
{
  return new ListEnumeratorImplT<T>(begin2(), end2());
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
} // namespace Arcane
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
#endif