htlist.H File Reference

Singly linked list implementations with head-tail access. More...

#include <type_traits>
#include <cassert>
#include <stdexcept>
#include <utility>
#include <ahFunction.H>
#include <ahFunctional.H>
#include <ah-args-ctor.H>
#include <ah-iterator.H>
#include <ah-errors.H>
#include <ah-dry.H>

Include dependency graph for htlist.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::Slinknc
	Link of a single linked list non-circular and without header node. More...
class	Aleph::Slinknc::Iterator
	Iterator on single links. More...
class	Aleph::Snodenc< T >
	Node belonging to a single non-circular linked list without header node. More...
class	Aleph::HTList
	Single linked list of nodes. More...
class	Aleph::HTList::Iterator
	Iterator on HTList. More...
class	Aleph::DynList< T >
	Dynamic singly linked list with functional programming support. More...
class	Aleph::DynList< T >::Iterator
	Iterator on the items of list. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Macros
#define	NEXT(p)   (p->get_next())

Functions
template<class Container >
DynList< typename Container::Item_Type >	Aleph::to_dynlist (const Container &c)
template<typename T >
DynList< T >	Aleph::get_unitarian_DynList (const T &item)
template<typename T >
DynList< T >	Aleph::unitarian_DynList (const T &item)

Detailed Description

Singly linked list implementations with head-tail access.

This file provides efficient singly linked list data structures including Slinknc (non-circular link), Snodenc (node with data), HTList (head-tail list), and DynList (dynamic list with functional operations). These are fundamental building blocks used throughout Aleph-w.

Author

Leandro Rabindranath León

Definition in file htlist.H.

Macro Definition Documentation

NEXT

#define NEXT

(

p

)

(p->get_next())

Definition at line 59 of file htlist.H.