Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Functions
tree-node.cc File Reference

Tests for Tree Node. More...

#include <gtest/gtest.h>
#include <tpl_binNode.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, get_parent_tracks_multi_level_tree)
 
 TEST (Tree_Node, insert_leftmost_child_preserves_existing_subtree_parent_links)
 
 TEST (Tree_Node, insert_left_sibling_before_leftmost_child_updates_spine)
 
 TEST (Tree_Node, bin_to_forest_preserves_each_forest_root_flag)
 
 TEST (Tree_Node, insert_right_sibling_on_root_links_forest_roots)
 
 TEST (Tree_Node, unique_sibling_macro_tracks_sibling_links)
 
 TEST (Tree_Node, destroy_tree_on_non_leftmost_child_regression)
 
 TEST (Tree_Node, destroy_tree_restores_is_rightmost_on_surviving_sibling)
 
 TEST (Tree_Node, destroy_tree_restores_is_leftmost_on_surviving_sibling)
 
 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/15]

TEST ( Tree_Node  ,
are_tree_equal_uses_custom_comparator_recursively   
)

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

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

◆ TEST() [2/15]

TEST ( Tree_Node  ,
bin_to_forest_preserves_each_forest_root_flag   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::count(), Aleph::destroy_forest(), and RLINK.

◆ TEST() [3/15]

TEST ( Tree_Node  ,
clone_on_extreme_cases   
)

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

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

◆ TEST() [4/15]

TEST ( Tree_Node  ,
destroy_tree_on_non_leftmost_child_regression   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::destroy_tree(), Aleph::Tree_Node< T >::get_right_sibling(), Aleph::Tree_Node< T >::is_rightmost(), IS_UNIQUE_SIBLING, and root().

◆ TEST() [5/15]

TEST ( Tree_Node  ,
destroy_tree_restores_is_leftmost_on_surviving_sibling   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::count(), Aleph::destroy_tree(), and root().

◆ TEST() [6/15]

TEST ( Tree_Node  ,
destroy_tree_restores_is_rightmost_on_surviving_sibling   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::count(), Aleph::destroy_tree(), and root().

◆ TEST() [7/15]

TEST ( Tree_Node  ,
get_parent_tracks_multi_level_tree   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Tree_Node< T >::get_parent(), Aleph::Tree_Node< T >::insert_rightmost_child(), and root().

◆ TEST() [8/15]

TEST ( Tree_Node  ,
insert_left_sibling_before_leftmost_child_updates_spine   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Tree_Node< T >::get_parent(), Aleph::Tree_Node< T >::is_leftmost(), Aleph::Tree_Node< T >::is_rightmost(), and root().

◆ TEST() [9/15]

TEST ( Tree_Node  ,
insert_leftmost_child_preserves_existing_subtree_parent_links   
)

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

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

◆ TEST() [10/15]

TEST ( Tree_Node  ,
insert_right_sibling_on_root_links_forest_roots   
)

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

References Aleph::blossom_maximum_cardinality_matching().

◆ TEST() [11/15]

TEST ( Tree_Node  ,
Iterator_on_extreme_cases   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Tree_Node< T >::Iterator::get_curr(), Aleph::Tree_Node< T >::get_it(), Aleph::Tree_Node< T >::Iterator::has_curr(), Aleph::Tree_Node< T >::insert_leftmost_child(), and Aleph::Tree_Node< T >::Iterator::next().

◆ TEST() [12/15]

TEST ( Tree_Node  ,
on_isolated_node   
)

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

References Aleph::blossom_maximum_cardinality_matching(), 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::Tree_Node< T >::Iterator::next(), Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::traverse().

◆ TEST() [13/15]

TEST ( Tree_Node  ,
simple_tree_construction_and_destruction   
)

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

References Aleph::blossom_maximum_cardinality_matching(), 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(), k, and Aleph::Tree_Node< T >::traverse().

◆ TEST() [14/15]

TEST ( Tree_Node  ,
traverse_on_extreme_cases   
)

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

References Aleph::blossom_maximum_cardinality_matching(), k, and root().

◆ TEST() [15/15]

TEST ( Tree_Node  ,
unique_sibling_macro_tracks_sibling_links   
)

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

References Aleph::blossom_maximum_cardinality_matching(), IS_UNIQUE_SIBLING, and root().

◆ TEST_F() [1/7]

TEST_F ( Simple_Tree  ,
clone   
)

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

References Aleph::blossom_maximum_cardinality_matching(), Aleph::clone_tree(), Aleph::destroy_tree(), Aleph::Pair_Iterator< Itor1, Itor2 >::get_curr(), Aleph::Filter_Iterator< Container, It, Show_Item >::next(), and root().

◆ TEST_F() [2/7]

TEST_F ( Simple_Tree  ,
deway   
)

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

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

◆ TEST_F() [3/7]

TEST_F ( Simple_Tree  ,
Iterators   
)

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

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

◆ TEST_F() [4/7]

TEST_F ( Simple_Tree  ,
level_traversal   
)

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

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

◆ TEST_F() [5/7]

TEST_F ( Simple_Tree  ,
traverse   
)

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

References Aleph::blossom_maximum_cardinality_matching(), LocateFunctions< Container, Type >::get_it(), k, l, r, root(), and Aleph::HTList::size().

◆ TEST_F() [6/7]

TEST_F ( Three_Trees  ,
insertion_of_trees   
)

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

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

◆ TEST_F() [7/7]

TEST_F ( Three_Trees  ,
join   
)

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

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