tree-node.cc File Reference

Tests for Tree Node. More...

#include <gtest/gtest.h>
#include <tpl_tree_node.H>
#include <ah-zip.H>
#include <ah-string-utils.H>
#include "tree-node-common.H"

Include dependency graph for tree-node.cc:

Go to the source code of this file.

Functions
	TEST (Tree_Node, on_isolated_node)
	TEST (Tree_Node, simple_tree_construction_and_destruction)
	TEST (Tree_Node, Iterator_on_extreme_cases)
	TEST_F (Simple_Tree, Iterators)
	TEST (Tree_Node, clone_on_extreme_cases)
	TEST_F (Simple_Tree, level_traversal)
	TEST_F (Simple_Tree, clone)
	TEST (Tree_Node, traverse_on_extreme_cases)
	TEST (Tree_Node, are_tree_equal_uses_custom_comparator_recursively)
	TEST_F (Simple_Tree, traverse)
	TEST_F (Simple_Tree, deway)
	TEST_F (Three_Trees, insertion_of_trees)
	TEST_F (Three_Trees, join)

Detailed Description

Tests for Tree Node.

Definition in file tree-node.cc.

Function Documentation

TEST() [1/6]

TEST	(	Tree_Node	,
		are_tree_equal_uses_custom_comparator_recursively
	)

Definition at line 327 of file tree-node.cc.

References Aleph::are_tree_equal(), Aleph::destroy_tree(), and Aleph::maps().

TEST() [2/6]

TEST	(	Tree_Node	,
		clone_on_extreme_cases
	)

Definition at line 275 of file tree-node.cc.

References Aleph::clone_tree(), Aleph::destroy_tree(), Aleph::maps(), and root().

TEST() [3/6]

TEST	(	Tree_Node	,
		Iterator_on_extreme_cases
	)

Definition at line 217 of file tree-node.cc.

References Aleph::Tree_Node< T >::Iterator::get_curr(), LocateFunctions< Container, Type >::get_it(), Aleph::Tree_Node< T >::get_it(), Aleph::Tree_Node< T >::Iterator::has_curr(), Aleph::maps(), and Aleph::Tree_Node< T >::Iterator::next().

TEST() [4/6]

TEST	(	Tree_Node	,
		on_isolated_node
	)

Definition at line 49 of file tree-node.cc.

References Aleph::Tree_Node< T >::children(), Aleph::Tree_Node< T >::get_child(), Aleph::Tree_Node< T >::get_child_list(), Aleph::Tree_Node< T >::Iterator::get_curr(), Aleph::Tree_Node< T >::get_it(), Aleph::Tree_Node< T >::get_left_child(), Aleph::Tree_Node< T >::get_left_tree(), Aleph::Tree_Node< T >::get_parent(), Aleph::Tree_Node< T >::get_right_child(), Aleph::Tree_Node< T >::get_right_tree(), Aleph::Tree_Node< T >::get_sibling_list(), Aleph::Tree_Node< T >::Iterator::has_curr(), Aleph::Dlink::is_empty(), Aleph::Tree_Node< T >::is_leaf(), Aleph::Tree_Node< T >::is_leftmost(), Aleph::Tree_Node< T >::is_rightmost(), Aleph::Tree_Node< T >::is_root(), Aleph::maps(), Aleph::Tree_Node< T >::Iterator::next(), Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::traverse().

TEST() [5/6]

TEST	(	Tree_Node	,
		simple_tree_construction_and_destruction
	)

Definition at line 95 of file tree-node.cc.

References Aleph::Tree_Node< T >::children(), Aleph::Tree_Node< T >::children_nodes(), Aleph::Tree_Node< T >::get_child(), Aleph::Tree_Node< T >::get_left_child(), Aleph::Tree_Node< T >::get_left_sibling(), Aleph::Tree_Node< T >::get_right_child(), Aleph::Tree_Node< T >::get_right_sibling(), Aleph::Tree_Node< T >::insert_leftmost_child(), Aleph::Tree_Node< T >::insert_right_sibling(), Aleph::Tree_Node< T >::insert_rightmost_child(), Aleph::Tree_Node< T >::is_leaf(), Aleph::Tree_Node< T >::is_leftmost(), Aleph::Tree_Node< T >::is_rightmost(), Aleph::Tree_Node< T >::is_root(), Aleph::maps(), and Aleph::Tree_Node< T >::traverse().

TEST() [6/6]

TEST	(	Tree_Node	,
		traverse_on_extreme_cases
	)

Definition at line 313 of file tree-node.cc.

References Aleph::maps(), and root().

TEST_F() [1/7]

TEST_F	(	Simple_Tree	,
		clone
	)

Definition at line 300 of file tree-node.cc.

References Aleph::clone_tree(), Aleph::destroy_tree(), Aleph::Pair_Iterator< Itor1, Itor2 >::get_curr(), Aleph::maps(), and root().

TEST_F() [2/7]

TEST_F	(	Simple_Tree	,
		deway
	)

Definition at line 370 of file tree-node.cc.

References Aleph::maps(), root(), and Aleph::search_deway().

TEST_F() [3/7]

TEST_F	(	Simple_Tree	,
		Iterators
	)

Definition at line 266 of file tree-node.cc.

References LocateFunctions< Container, Type >::get_it(), l, Aleph::maps(), and root().

TEST_F() [4/7]

TEST_F	(	Simple_Tree	,
		level_traversal
	)

Definition at line 290 of file tree-node.cc.

References Aleph::maps(), and root().

TEST_F() [5/7]

TEST_F	(	Simple_Tree	,
		traverse
	)

Definition at line 356 of file tree-node.cc.

References LocateFunctions< Container, Type >::get_it(), l, Aleph::maps(), root(), Aleph::HTList::size(), and GenericTraverse< Container >::traverse().

TEST_F() [6/7]

TEST_F	(	Three_Trees	,
		insertion_of_trees
	)

Definition at line 390 of file tree-node.cc.

References Aleph::clone_tree(), Aleph::destroy_forest(), Aleph::maps(), and Aleph::zip_for_each().

TEST_F() [7/7]

TEST_F	(	Three_Trees	,
		join
	)

Definition at line 407 of file tree-node.cc.

References Aleph::DynList< T >::append(), Aleph::clone_tree(), Aleph::destroy_forest(), Aleph::eq(), l, and Aleph::maps().