#include <tpl_euclidian_graph.H>

Inheritance diagram for Aleph::Euclidian_Node< Node_Info >:

Collaboration diagram for Aleph::Euclidian_Node< Node_Info >:

Public Types
typedef Node_Info	Item_Type

typedef Euclidian_Node	Node

typedef Node_Info	Node_Type

Public Types inherited from Aleph::Graph_Node< Node_Info >
using	Base = GTNodeCommon< Node_Info >

using	Node_Info = Node_Info

Public Types inherited from GTNodeCommon< NodeInfo >
using	Item_Type = NodeInfo

using	Node = GTNodeCommon
	Common alias for set types.

using	Node_Type = NodeInfo
	The node.

Public Member Functions
	Euclidian_Node ()

	Euclidian_Node (const Node_Info &info)

	Euclidian_Node (const Point &_position)

	Euclidian_Node (const Node_Info &info, const Point &_position)

	Euclidian_Node (Euclidian_Node *node)

Point &	get_position ()

const Point &	get_position () const

Public Member Functions inherited from Aleph::Graph_Node< Node_Info >
	Graph_Node (const Node_Info &info) noexcept
	The type of data stored in the node.

	Graph_Node (Node_Info &&info=Node_Info()) noexcept
	Move or rvalue constructor.

	Graph_Node (const Graph_Node &node) noexcept

	Graph_Node (Graph_Node *node)
	Copy constructor from a node pointer.

Graph_Node &	operator= (const Graph_Node &node)

Public Member Functions inherited from Aleph::Dlink
template<typename T >
Dnode< T > *	to_dnode () noexcept

template<typename T >
const Dnode< T > *	to_dnode () const noexcept

template<typename T >
T &	to_data () noexcept

template<typename T >
const T &	to_data () const noexcept

	Dlink () noexcept
	Initialize a node or an empty list.

	Dlink (const Dlink &l) noexcept
	Copy constructor.

void	swap (Dlink *link) noexcept
	Swap `this` with list whose header is `link`.

void	swap (Dlink &l) noexcept
	Swap `this` with list whose header is `l`.

	Dlink (Dlink &&l) noexcept
	Construct a new list with the items of l moved.

Dlink &	operator= (const Dlink &l) noexcept
	Copy assignation.

Dlink &	operator= (Dlink &&l) noexcept
	Move assignation.

void	reset () noexcept
	Reset `this`

void	init () noexcept

constexpr bool	is_empty () const noexcept
	Return `true` if `this` (as header node) is empty.

constexpr bool	is_unitarian () const noexcept
	Return `true` if `this` (as header node) has exactly one element.

constexpr bool	is_unitarian_or_empty () const noexcept
	Return `true` if `this` (as header node) has zero or one element.

void	insert (Dlink *node) noexcept
	Insert `node` after `this`.

void	push (Dlink *node) noexcept

void	append (Dlink *node) noexcept
	Insert `node` before `this`.

Dlink *&	get_next () const noexcept
	Return the link that is after `this`

Dlink *&	get_prev () const noexcept
	Return the link that is before `this`

constexpr Dlink *&	get_first_ne () const noexcept
	If `this` is a header node, it return the first node of `this`

constexpr Dlink *&	get_last_ne () const noexcept
	If `this` is a header node, it return the last node of `this`

constexpr Dlink *&	get_first () const noexcept
	If `this` is a header node, it return the first node of `this`

constexpr Dlink *&	get_last () const noexcept
	If `this` is a header node, it return the last node of `this`

void	wrap_header (Dlink *l) noexcept
	Wrap a header to a list (without header).

void	insert_list (Dlink *head) noexcept
	Insert the list `head` before `this`

void	append_list (Dlink *head) noexcept
	Insert the list `head` after `this`

void	splice (Dlink *l) noexcept
	Insert a list `l` without header node after the node `this`.

void	concat_list (Dlink *head) noexcept
	Concatenate list `head` to list `this`

void	concat_list (Dlink &head) noexcept

Dlink *	del () noexcept
	Remove `this` from the list. `this` must not be a header node.

void	erase () noexcept

Dlink *	remove_prev () noexcept
	Remove the item that is before `this`

Dlink *	remove_next () noexcept
	Remove the item that is after `this`

Dlink *	remove_last_ne () noexcept

Dlink *	remove_first_ne () noexcept

Dlink *	remove_last () noexcept

Dlink *	remove_first () noexcept

Dlink *	top () const

Dlink *	pop ()

size_t	reverse_list () noexcept
	Reverse the list.

size_t	reverse () noexcept

size_t	split_list_ne (Dlink &l, Dlink &r) noexcept
	Split `this` in the middle in two lists.

size_t	split_list (Dlink &l, Dlink &r) noexcept

Dlink	cut_list (Dlink *link) noexcept
	Cut `this` from `link`.

void	remove_all_and_delete () noexcept
	Remove and free memory for all the items of list.

void	rotate_left (size_t n)
	Rotate to left the list n positions.

void	rotate_right (size_t n)
	Analogous to rotate_left() but to right.

bool	check ()
	Return `true` if the list is consistent.

Public Member Functions inherited from GTNodeCommon< NodeInfo >
	GTNodeCommon () noexcept=default
	another alias for set type

	GTNodeCommon (const NodeInfo &info)
	Copy constructor from info value.

	GTNodeCommon (NodeInfo &&info)
	Move constructor from info value.

	GTNodeCommon (const GTNodeCommon &other)
	Copy constructor.

	GTNodeCommon (GTNodeCommon &&other) noexcept
	Move constructor.

GTNodeCommon &	operator= (const GTNodeCommon &other)
	Copy assignment operator.

GTNodeCommon &	operator= (GTNodeCommon &&other) noexcept
	Move assignment operator.

NodeInfo &	get_info () noexcept
	Return a modifiable reference to the data contained in the node.

const NodeInfo &	get_info () const noexcept
	Return a constant reference to the data contained in the node.

unsigned int	state () const noexcept
	Return the state's value.

void	set_state (unsigned int s) noexcept
	Set the state to value `s`

Private Attributes
Point	position

Additional Inherited Members
Public Attributes inherited from Aleph::Graph_Node< Node_Info >
Dlink	arc_list

Public Attributes inherited from GTNodeCommon< NodeInfo >
Graph_Attr	attrs
	Attributes of node.

NodeInfo	node_info

size_t	num_arcs = 0
	data associated to the node. Access it with get_info()

Protected Attributes inherited from Aleph::Dlink
Dlink *	prev

Dlink *	next