tpl_dynSlist.H

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  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 TPL_DYNSLIST_H
# define TPL_DYNSLIST_H
 
# include <tpl_slist.H>
# include <cstddef>
# include <stdexcept>
# include <utility>
# include <ah-errors.H>
 
using namespace Aleph;
 
namespace Aleph {
 
  template <typename T>
  class DynSlist : public Slist<T>
  {
    size_t num_items;
    size_t      current_pos;
    Snode<T> * current_node;
 
    void clear() noexcept
    {
      while (not this->is_empty())
        delete this->remove_first_ne();
      num_items    = 0;
      current_pos  = 0;
      current_node = this;
    }
    typename Slist<T>::Node *
    get_previous_to_pos(const size_t pos, const bool allow_equal)
    {
      ah_out_of_range_error_if(pos > num_items || (not allow_equal and pos == num_items))
        << "position out of range";
 
      if (pos < current_pos)
        {
          current_pos  = 0;
          current_node = this;
        }
      while (current_pos < pos)
        {
          current_node = current_node->get_next();
          ++current_pos;
        }
      return current_node;
    }
 
  public:
 
    DynSlist() : num_items(0), current_pos(0), current_node(this)
    {
      // Empty
    }
 
    DynSlist(const DynSlist & other) : DynSlist()
    {
      using Node = typename Slist<T>::Node;
 
      Node * head = nullptr;
      Node * tail = nullptr;
      size_t n = 0;
 
      try
        {
          const Node * end = static_cast<const Node*>(&other);
          for (const Node * cur = other.get_first_ne(); cur != end;
               cur = cur->get_next())
            {
              auto * node = new Node(cur->get_data());
              node->get_next() = nullptr;
 
              if (tail == nullptr)
                head = tail = node;
              else
                {
                  tail->get_next() = node;
                  tail = node;
                }
              ++n;
            }
        }
      catch (...)
        {
          while (head != nullptr)
            {
              Node * next = head->get_next();
              delete head;
              head = next;
            }
          throw;
        }
 
      if (head != nullptr)
        {
          this->get_next() = head;
          tail->get_next() = this;
        }
 
      num_items    = n;
      current_pos  = 0;
      current_node = this;
    }
 
    DynSlist & operator=(const DynSlist & other)
    {
      if (this == &other)
        return *this;
 
      using Node = typename Slist<T>::Node;
 
      Node * head = nullptr;
      Node * tail = nullptr;
      size_t n = 0;
 
      try
        {
          const Node * end = static_cast<const Node*>(&other);
          for (const Node * cur = other.get_first_ne(); cur != end;
               cur = cur->get_next())
            {
              auto * node = new Node(cur->get_data());
              node->get_next() = nullptr;
 
              if (tail == nullptr)
                head = tail = node;
              else
                {
                  tail->get_next() = node;
                  tail = node;
                }
              ++n;
            }
        }
      catch (...)
        {
          while (head != nullptr)
            {
              Node * next = head->get_next();
              delete head;
              head = next;
            }
          throw;
        }
 
      clear();
 
      if (head != nullptr)
        {
          this->get_next() = head;
          tail->get_next() = this;
        }
 
      num_items    = n;
      current_pos  = 0;
      current_node = this;
      return *this;
    }
 
    DynSlist(DynSlist && other) noexcept : DynSlist()
    {
      using Node = typename Slist<T>::Node;
 
      if (other.is_empty())
        return;
 
      Node * other_sentinel = static_cast<Node*>(&other);
      Node * head = other_sentinel->get_next();
      Node * tail = head;
      while (tail->get_next() != other_sentinel)
        tail = tail->get_next();
 
      this->get_next() = head;
      tail->get_next() = this;
 
      num_items = other.num_items;
 
      other_sentinel->reset();
      other.num_items    = 0;
      other.current_pos  = 0;
      other.current_node = &other;
 
      current_pos  = 0;
      current_node = this;
    }
 
    DynSlist & operator=(DynSlist && other) noexcept
    {
      if (this == &other)
        return *this;
 
      using Node = typename Slist<T>::Node;
 
      clear();
 
      if (other.is_empty())
        return *this;
 
      Node * other_sentinel = static_cast<Node*>(&other);
      Node * head = other_sentinel->get_next();
      Node * tail = head;
      while (tail->get_next() != other_sentinel)
        tail = tail->get_next();
 
      this->get_next() = head;
      tail->get_next() = this;
 
      num_items = other.num_items;
 
      other_sentinel->reset();
      other.num_items    = 0;
      other.current_pos  = 0;
      other.current_node = &other;
 
      current_pos  = 0;
      current_node = this;
 
      return *this;
    }
 
    T & operator [] (const size_t i)
    {
      return get_previous_to_pos(i, false)->get_next()->get_data();
    }
 
    const T & operator[](const size_t i) const
    {
      ah_out_of_range_error_if(i >= num_items) << "position out of range";
 
      using Node = typename Slist<T>::Node;
      const Node * cur = this->get_first_ne();
 
      for (size_t idx = 0; idx < i; ++idx)
        cur = cur->get_next();
 
      return cur->get_data();
    }
 
    size_t size() const noexcept { return num_items; }
 
    void insert(const int pos, const T & data)
    {
      auto * prev = get_previous_to_pos(static_cast<size_t>(pos), true);
      auto * node = new typename Slist<T>::Node (data);
      prev->insert_next(node);
      ++num_items;
      current_pos  = 0;
      current_node = this;
    }
 
    void insert(const int pos, T && data)
    {
      auto * prev = get_previous_to_pos(static_cast<size_t>(pos), true);
      auto * node = new typename Slist<T>::Node (std::move(data));
      prev->insert_next(node);
      ++num_items;
      current_pos  = 0;
      current_node = this;
    }
 
    void remove(const int pos)
    {
      auto * prev = get_previous_to_pos(static_cast<size_t>(pos), false);
      auto * node_to_delete = prev->remove_next();
      delete node_to_delete;
      --num_items;
      current_pos  = 0;
      current_node = this;
    }
 
    virtual ~DynSlist() { clear(); }
 
    class Iterator : public Slist<T>::Iterator
    {
    public:
      typedef Slist<T> Set_Type;
      typedef T Item_Type;
 
      explicit Iterator(DynSlist & list) : Slist<T>::Iterator(list) { }
 
      T & get_curr() { return Slist<T>::Iterator::get_curr()->get_data(); }
 
      const T & get_curr() const
      {
        return Slist<T>::Iterator::get_curr()->get_data();
      }
    };
  };
} // end namespace Aleph
 
# endif // TPL_DYNSLIST_H