tpl_dnode.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_DNODE_H
# define TPL_DNODE_H
 
# include <type_traits>
# include <ahFunction.H>
# include <dlink.H>
 # include <ah-errors.H>
 
using namespace Aleph;
 
namespace Aleph {
 
template <typename T> class Dnode : public Dlink 
{
private:
 
  T data;
 
public:
 
  Dnode<T> *& get_next() const noexcept { return (Dnode<T>*&) next; }
 
  Dnode<T> *& get_prev() const noexcept { return (Dnode<T>*&) prev; }
 
  Dnode<T>* remove_prev() noexcept { return (Dnode<T>*) Dlink::remove_prev(); }
 
  Dnode<T>* remove_next() noexcept { return (Dnode<T>*) Dlink::remove_next(); }
 
  Dnode<T> *& get_first_ne() const noexcept { return get_next(); } 
 
  Dnode<T> *& get_last_ne() const noexcept { return get_prev(); }
 
  Dnode<T> *& get_first() const
  {
    ah_underflow_error_if(this->is_empty()) << "Dnode is empty";
    return get_first_ne();
  } 
 
  Dnode<T> *& get_last() const
  {
    ah_underflow_error_if(this->is_empty()) << "Dnode is empty";
    return get_last_ne();
  }
 
  Dnode<T>* remove_last_ne() noexcept 
  { 
    return static_cast<Dnode<T>*>(Dlink::remove_prev()); 
  }
 
  Dnode<T>* remove_first_ne() noexcept
  {
    return static_cast<Dnode<T>*>(Dlink::remove_next()); 
  }
 
  Dnode<T>* remove_last()
  {
    ah_underflow_error_if(this->is_empty()) << "Dnode is empty";
    return remove_last_ne();
  }
 
  Dnode<T>* remove_first()
  {
    ah_underflow_error_if(this->is_empty()) << "Dnode is empty";
    return remove_first_ne();
  }
  
  Dnode() noexcept 
  {
    static_assert(std::is_default_constructible<T>::value, 
      "No default constructor for T");
  }
 
  Dnode(const T & item) : data(item) 
  {
    static_assert(std::is_copy_constructible<T>::value, 
      "No copy constructor for T");
  }
 
  Dnode(T && item) : data(std::move(item))
  {
    static_assert(std::is_move_constructible<T>::value,
      "No move constructor for T");
  }
 
  Dnode & swap(Dnode & p)
  {
    
    Dlink::swap(p);
    std::swap(data, p.data);
    return *this;
  }
 
  Dnode(const Dnode & node)
  : Dlink(node), data(node.data) 
  {
    static_assert(std::is_copy_constructible<T>::value, 
      "No copy constructor for T");
  }
 
  Dnode(Dnode && node) noexcept
  : Dlink(std::move(node)), data(std::move(node.data))
  {
    /* empty */ 
  }
 
  Dnode & operator = (const Dnode & p) 
  {
     static_assert(std::is_copy_assignable<T>::value,
      "No copy assign for T");
    data = p.data;
    return *this;
  }
 
  Dnode & operator = (Dnode && p) 
  {
    std::swap(data, p.data);
    return *this;
  }
 
  T & get_data() noexcept { return data; }
 
  const T & get_data() const noexcept { return data; }
 
  using key_type = T;
 
  T & get_key() noexcept { return data; }
 
  const T & get_key() const noexcept { return data; }
 
  static Dnode * data_to_node(T & data) noexcept
  {
    const size_t offset = __builtin_offsetof(Dnode<T>, data);
    char * addr = reinterpret_cast<char *>(&data);
    return reinterpret_cast<Dnode *>(addr - offset);
  }
 
  class Iterator : public Dlink::Iterator
  {
  public:
    
    using Set_Type = Dnode<T>;
    
    using Item_Type = Dnode<T>*;
 
    using Base = Dlink::Iterator;
 
    using Base::Base;
 
    Dnode<T> * get_curr_ne() const noexcept
    {
      return static_cast<Dnode<T>*>(this->Dlink::Iterator::get_curr_ne()); 
    }
 
    Dnode<T> * get_curr() const 
    {
      return static_cast<Dnode<T>*>(this->Dlink::Iterator::get_curr()); 
    }
 
    Dnode * del() 
    { return static_cast<Dnode*>(Dlink::Iterator::del()); }
 
    Dnode * del_ne() noexcept
    { return static_cast<Dnode*>(Dlink::Iterator::del_ne()); }
  };
};
 
template <typename T> Dnode<T> * Dlink::to_dnode() noexcept
{
  return static_cast<Dnode<T>*>(this);
}
 
template <typename T> const Dnode<T> * Dlink::to_dnode() const noexcept
{
  return static_cast<const Dnode<T>*>(this);
}
 
template <typename T> T & Dlink::to_data() noexcept
{
  return to_dnode<T>()->get_data();
}
 
template <typename T> const T & Dlink::to_data() const noexcept
{
  return to_dnode<T>()->get_data();
}
 
 
}
 
# endif /* TPL_DNODE_H */