Dynamic list of elements of type T implemented with a singly linked list of nodes. More...

#include <tpl_dynSlist.H>

Inheritance diagram for Aleph::DynSlist< T >:

Collaboration diagram for Aleph::DynSlist< T >:

Classes
class	Iterator
	Iterator specialized for `DynSlist` returning payload references. More...

Public Member Functions
	DynSlist ()
	Constructor.

	DynSlist (const DynSlist &other)

DynSlist &	operator= (const DynSlist &other)

	DynSlist (DynSlist &&other) noexcept

DynSlist &	operator= (DynSlist &&other) noexcept

T &	operator[] (const size_t i)
	Access the element at position `i`.

const T &	operator[] (const size_t i) const
	Const overload of `operator[]`.

size_t	size () const noexcept
	Return the number of stored elements.

void	insert (const int pos, const T &data)
	Insert an element at position `pos`.

void	insert (const int pos, T &&data)
	Insert an element by moving the provided value.

void	remove (const int pos)
	Remove the node at position `pos`.

virtual	~DynSlist ()

Public Member Functions inherited from Aleph::Slist< T >
	Slist ()=default
	Default constructor.

void	insert_first (Node *node)
	Insert `node` right after this sentinel (at the beginning).

Node *	remove_first_ne () noexcept
	Remove and return the first node without checking emptiness.

Node *	remove_first ()
	Remove the first node of the list.

Node *	get_first ()
	Return a pointer to the first node; throw if the list is empty.

const Node *	get_first () const
	Return a pointer to the first node (const overload).

Node *	get_first_ne () noexcept
	Return the first node without checking emptiness.

const Node *	get_first_ne () const noexcept
	Return the first node without checking emptiness (const overload).

Public Member Functions inherited from Aleph::Snode< T >
T &	get_data ()
	Return a modifiable reference to the stored data.

const T &	get_data () const
	Return a constant reference to the stored data.

	Snode ()=default
	Default constructor.

	Snode (const T &_data)
	Constructor that copies the value.

	Snode (T &&_data)
	Constructor that moves the value.

Snode *	remove_next ()
	Remove the node right after `this` and return it.

Snode *&	get_next ()
	Return the next node after `this`.

const Snode *	get_next () const
	Return the next node after `this` (const overload).

Snode *	remove_first ()
	Remove and return the first node (for symmetry with list front).

const Snode *	get_first () const
	Return the first node (const alias of `get_next`).

Public Member Functions inherited from Aleph::Slink
	Slink ()
	Default constructor.

void	reset () noexcept
	Reset the link so it points to itself.

constexpr bool	is_empty () const noexcept
	Return true if this link is empty (points to itself).

constexpr Slink *&	get_next () noexcept
	Return the next link.

constexpr const Slink *	get_next () const noexcept
	Return the next link (const overload).

void	insert_next (Slink *p)
	Insert link `p` right after `this`.

Slink *	remove_next ()
	Remove the link right after `this`.

Private Member Functions
void	clear () noexcept

Slist< T >::Node *	get_previous_to_pos (const size_t pos, const bool allow_equal)

Private Attributes
size_t	num_items

size_t	current_pos

Snode< T > *	current_node

Additional Inherited Members
Public Types inherited from Aleph::Slist< T >
typedef Snode< T >	Node

Protected Attributes inherited from Aleph::Slink
Slink *	next