Public Member Functions
bool	findId (unsigned int id, unsigned int &orgPos)

void	loadDictionary (Dictionary *D)

Private Attributes
std::vector< std::pair< int, int > >	_binaryTree

std::vector< std::pair< unsigned int, unsigned int > >	_orderD

unsigned int	_root

Detailed Description

Balanced Binary Tree for a marker dictionary

Definition at line 219 of file highlyreliablemarkers.h.

Member Function Documentation

bool aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::findId	(	unsigned int	id,
		unsigned int &	orgPos
	)

Search a id in the dictionary. Return true if found, false otherwise.

Definition at line 486 of file highlyreliablemarkers.cpp.

void aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::loadDictionary ( Dictionary * D )

Create the tree for dictionary D

Definition at line 391 of file highlyreliablemarkers.cpp.

std::vector< std::pair< int, int > > aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::_binaryTree

private

Definition at line 236 of file highlyreliablemarkers.h.

std::vector< std::pair< unsigned int, unsigned int > > aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::_orderD

private

Definition at line 233 of file highlyreliablemarkers.h.

unsigned int aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::_root

private

Definition at line 240 of file highlyreliablemarkers.h.

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