Designar::NodeSLList< T > Class Template Reference

#include <list.H>

Inheritance diagram for Designar::NodeSLList< T >:

Public Types
using	Node = SLNode< T >

Public Member Functions
	NodeSLList ()
	NodeSLList (const NodeSLList &)=delete
	NodeSLList (NodeSLList &&l)
NodeSLList &	operator= (const NodeSLList &)=delete
NodeSLList &	operator= (NodeSLList &&l)
void	swap (NodeSLList &l)
bool	is_empty () const
bool	is_unitarian_or_empty () const
bool	is_unitarian () const
void	insert (Node *node)
void	append (Node *node)
Node *&	get_first ()
const Node *&	get_first () const
Node *&	get_last ()
const Node *&	get_last () const
Node *	remove_first ()
void	concat (NodeSLList *l)
void	concat (NodeSLList &l)
void	split (NodeSLList &, NodeSLList &)

Member Typedef Documentation

template<typename T>

using Designar::NodeSLList< T >::Node = SLNode<T>

Constructor & Destructor Documentation

template<typename T>

Designar::NodeSLList< T >::NodeSLList ( )

inline

template<typename T>

Designar::NodeSLList< T >::NodeSLList ( const NodeSLList< T > &  )

delete

template<typename T>

Designar::NodeSLList< T >::NodeSLList ( NodeSLList< T > &&  l )

inline

Member Function Documentation

template<typename T>

void Designar::NodeSLList< T >::append ( Node *  node )

inline

template<typename T>

void Designar::NodeSLList< T >::concat ( NodeSLList< T > *  l )

inline

template<typename T>

void Designar::NodeSLList< T >::concat ( NodeSLList< T > &  l )

inline

template<typename T>

Node*& Designar::NodeSLList< T >::get_first ( )

inline

template<typename T>

const Node*& Designar::NodeSLList< T >::get_first ( ) const

inline

template<typename T>

Node*& Designar::NodeSLList< T >::get_last ( )

inline

template<typename T>

const Node*& Designar::NodeSLList< T >::get_last ( ) const

inline

template<typename T>

void Designar::NodeSLList< T >::insert ( Node *  node )

inline

template<typename T>

bool Designar::NodeSLList< T >::is_empty ( ) const

inline

template<typename T>

bool Designar::NodeSLList< T >::is_unitarian ( ) const

inline

template<typename T>

bool Designar::NodeSLList< T >::is_unitarian_or_empty ( ) const

inline

template<typename T>

NodeSLList& Designar::NodeSLList< T >::operator= ( const NodeSLList< T > &  )

delete

template<typename T>

NodeSLList& Designar::NodeSLList< T >::operator= ( NodeSLList< T > &&  l )

inline

template<typename T>

Node* Designar::NodeSLList< T >::remove_first ( )

inline

template<typename T >

void Designar::NodeSLList< T >::split	(	NodeSLList< T > &	l,
		NodeSLList< T > &	r
	)

template<typename T>

void Designar::NodeSLList< T >::swap ( NodeSLList< T > &  l )

inline

---

The documentation for this class was generated from the following file:

• include/list.H