Binary node is specialisation of Anyary node to two children. More...

#include <tree_base.hpp>

Inheritance diagram for ext::BinaryNode< Data, Base >:

Collaboration diagram for ext::BinaryNode< Data, Base >:

Public Member Functions
	BinaryNode (const Data &l, const Data &r)
	Constructor of the class accepting the two child nodes. More...

	BinaryNode (Data &&l, Data &&r)
	Constructor of the class accepting the two child nodes. More...

Data &	getLeft ()
	Getter of the first child of the node. More...

const Data &	getLeft () const
	Getter of the first child of the node. More...

void	setLeft (const Data &l)
	Setter of the first child of the node. More...

void	setLeft (Data &&l)
	Setter of the first child of the node. More...

Data &	getRight ()
	Getter of the second child of the node. More...

const Data &	getRight () const
	Getter of the second child of the node. More...

void	setRight (const Data &r)
	Setter of the second child of the node. More...

void	setRight (Data &&r)
	Setter of the second child of the node. More...

Public Member Functions inherited from ext::AnyaryNode< Data, 2, Data >
	AnyaryNode (ext::ptr_array< Data, arity > c)
	Constructor based on array of child nodes. More...

	AnyaryNode (const AnyaryNode &other)
	Copy constructor. More...

	AnyaryNode (AnyaryNode &&other) noexcept
	Move constructor. More...

	~AnyaryNode () noexcept override=default
	Destructor of the class. More...

AnyaryNode &	operator= (const AnyaryNode &other)
	Copy operator of assignment. More...

AnyaryNode &	operator= (AnyaryNode &&other) noexcept
	move operator of assignment. More...

const ext::ptr_array< Data, arity > &	getChildren () &
	Getter of the child nodes. More...

const ext::ptr_array< Data, arity > &	getChildren () const &
	Getter of the child nodes. More...

ext::ptr_array< Data, arity > &&	getChildren () &&
	Getter of the child nodes. More...

const Data &	getChild () const
	Getter of the child node based on compile time index. More...

Data &	getChild ()
	Getter of the child node based on compile time index. More...

void	setChildren (ext::ptr_array< Data, arity > c)
	Setter of the child nodes. More...

void	setChild (const Data &d)
	Setter of the child node based on compile time index. More...

void	setChild (Data &&d)
	Setter of the child node based on compile time index. More...

ext::ptr_array< Data, arity >::iterator	begin ()
	Getter of an iterator to the begining of children array. More...

ext::ptr_array< Data, arity >::const_iterator	begin () const
	Getter of an iterator to the begining of children array. More...

ext::ptr_array< Data, arity >::iterator	end ()
	Getter of an iterator to the end of children array. More...

ext::ptr_array< Data, arity >::const_iterator	end () const
	Getter of an iterator to the end of children array. More...

Detailed Description

template<class Data, class Base = Data>
class ext::BinaryNode< Data, Base >

Binary node is specialisation of Anyary node to two children.

Template Parameters

Data	the base class of the actual tree nodes hierarchy on top of this one
Base	the actual class from the actual tree nodes hierarchy

Constructor & Destructor Documentation

◆ BinaryNode() [1/2]

template<class Data , class Base = Data>

ext::BinaryNode< Data, Base >::BinaryNode	(	const Data &	l,
		const Data &	r
	)

inline

Constructor of the class accepting the two child nodes.

Parameters

l	the first child node of the new node
r	the second child node of the new node

◆ BinaryNode() [2/2]

template<class Data , class Base = Data>

ext::BinaryNode< Data, Base >::BinaryNode	(	Data &&	l,
		Data &&	r
	)

inline

Constructor of the class accepting the two child nodes.

Parameters

l	the first child node of the new node
r	the second child node of the new node

Member Function Documentation

◆ getLeft() [1/2]

template<class Data , class Base = Data>

Data & ext::BinaryNode< Data, Base >::getLeft ( )

inline

Getter of the first child of the node.

Returns: the first child of the node

◆ getLeft() [2/2]

template<class Data , class Base = Data>

const Data & ext::BinaryNode< Data, Base >::getLeft ( ) const

inline

Getter of the first child of the node.

Returns: the first child of the node

◆ getRight() [1/2]

template<class Data , class Base = Data>

Data & ext::BinaryNode< Data, Base >::getRight ( )

inline

Getter of the second child of the node.

Returns: the second child of the node

◆ getRight() [2/2]

template<class Data , class Base = Data>

const Data & ext::BinaryNode< Data, Base >::getRight ( ) const

inline

Getter of the second child of the node.

Returns: the second child of the node

◆ setLeft() [1/2]

template<class Data , class Base = Data>

void ext::BinaryNode< Data, Base >::setLeft ( const Data & l )

inline

Setter of the first child of the node.

Parameters

l	the first child of the node

◆ setLeft() [2/2]

template<class Data , class Base = Data>

void ext::BinaryNode< Data, Base >::setLeft ( Data && l )

inline

Setter of the first child of the node.

Parameters

l	the first child of the node

◆ setRight() [1/2]

template<class Data , class Base = Data>

void ext::BinaryNode< Data, Base >::setRight ( const Data & r )

inline

Setter of the second child of the node.

Parameters

r	the second child of the node

◆ setRight() [2/2]

template<class Data , class Base = Data>

void ext::BinaryNode< Data, Base >::setRight ( Data && r )

inline

Setter of the second child of the node.

Parameters

r	the second child of the node

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

alib2std/src/extensions/container/tree_base.hpp

Public Member Functions

Detailed Description

Constructor & Destructor Documentation

◆ BinaryNode() [1/2]

◆ BinaryNode() [2/2]

Member Function Documentation

◆ getLeft() [1/2]

◆ getLeft() [2/2]

◆ getRight() [1/2]

◆ getRight() [2/2]

◆ setLeft() [1/2]

◆ setLeft() [2/2]

◆ setRight() [1/2]

◆ setRight() [2/2]