tpl_dyn_slist_nc.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_DYN_SLIST_NC_H
# define TPL_DYN_SLIST_NC_H
 
# include <tpl_snode_nc.H>
# include <ah-errors.H>
 
namespace Aleph
{
  template <typename T> class Dyn_Slist_Nc : public Snode_Nc <T>
  {
  public:
    typedef Snode_Nc <T> Node;
 
  private:
    Node * head;
    size_t num_items;
 
  public:
 
    void empty()
    {
      while (not this->is_empty())
        delete Node::remove_next();
      this->reset();
      head = this;
      num_items = 0;
    }
 
    void clear() noexcept { empty(); }
 
    T & insert(const T & data)
    {
      Node * p = new Node(data);
      Node::insert(p);
 
      if (num_items++ == 0)
        head = p;
 
      return p->get_data();
    }
 
    T & append(const T & data)
    {
      assert(head not_eq nullptr);
      Node * p = new Node(data);
      head->insert(p);
 
      head = p;
      ++num_items;
      return p->get_data();
    }
 
    T & get_first()
    {
      ah_underflow_error_if(this->is_empty()) << "List is empty";
 
      return this->get_next()->get_data();
    }
 
    const T & get_first() const
    {
      ah_underflow_error_if(this->is_empty()) << "List is empty";
 
      return this->get_next()->get_data();
    }
 
    T & get_last()
    {
      ah_underflow_error_if(this->is_empty()) << "List is empty";
 
      return head->get_data();
    }
 
    const T & get_last() const
    {
      ah_underflow_error_if(this->is_empty()) << "List is empty";
 
      return head->get_data();
    }
 
    T remove_first()
    {
      ah_underflow_error_if(this->is_empty()) << "List is empty";
 
      Node * p = Node::remove_next();
      T ret_val = p->get_data();
      delete p;
      if (--num_items == 0)
        head = this;
      return ret_val;
    }
 
    T & put(const T & item) { return append(item); }
 
    T get() { return remove_first(); }
 
    T & rear() { return get_last(); }
 
    const T & rear() const { return get_last(); }
 
    T & front() { return get_first(); }
 
    const T & front() const { return get_first(); }
 
    T & push(const T & item) { return insert(item); }
 
    T pop() { return remove_first(); }
 
    T & top() { return get_first(); }
 
    const T & top() const { return get_first(); }
 
 
    const size_t & size() const { return num_items; }
 
    class Iterator : public Node::Iterator
    {
    public:
      Iterator(Dyn_Slist_Nc<T> & list) : Node::Iterator(list)
      {
        // empty
      }
 
      T & get_curr_n() const noexcept
      {
        return Node::Iterator::get_curr()->get_data();
      }
 
      T & get_curr() const
      {
        return Node::Iterator::get_curr()->get_data();
      }
 
    };
 
    Dyn_Slist_Nc() : Node(), head(this), num_items(0)
    {
      // empty
    }
 
    Dyn_Slist_Nc(const Dyn_Slist_Nc & l) : Node(l), head(this), num_items(0)
    {
      for (Iterator it(const_cast <Dyn_Slist_Nc &>(l));
           it.has_curr(); it.next_ne())
        append(it.get_curr());
    } 
 
    ~Dyn_Slist_Nc()
    {
      empty();
    }
 
    Dyn_Slist_Nc & operator = (const Dyn_Slist_Nc & list)
    {
      if (this == &list) 
        return *this;
 
      empty();
    
      assert(this->is_empty());
 
      for (Iterator it(const_cast<Dyn_Slist_Nc &>(list)); 
           it.has_curr(); it.next_ne())
        append(it.get_curr()); 
 
      return *this;
    }
 
    T & operator [] (const size_t & n)
    {
      ah_range_error_if(n >= num_items) << "Index " << n << " out of range";
 
      Iterator it(*this);
      for (size_t i = 0; i < n; ++i, it.next_ne());
 
      return it.get_curr();
    }
 
    const T & operator [] (const size_t & n) const
    {
      ah_range_error_if(n >= num_items) << "Index " << n << " out of range";
 
      Iterator it(const_cast<Dyn_Slist_Nc&>(*this));
      for (size_t i = 0; i < n; ++i, it.next_ne());
 
      return it.get_curr();
    }
  };
}
 
# endif