tpl_mo_on_trees_test.cc File Reference

Tests for Gen_Mo_On_Trees and built-in policies on all three graph types (List_Graph, List_SGraph, Array_Graph). More...

#include <gtest/gtest.h>
#include <tpl_mo_on_trees.H>
#include <tpl_graph.H>
#include <tpl_sgraph.H>
#include <tpl_agraph.H>
#include <tpl_dynSetHash.H>
#include <algorithm>
#include <cstddef>
#include <random>
#include <utility>
#include <vector>

Include dependency graph for tpl_mo_on_trees_test.cc:

Go to the source code of this file.

Classes
class	MoOnTreesStress< GT >

Typedefs
using	GraphTypes = Types< List_Graph< Graph_Node< int >, Graph_Arc< Empty_Class > >, List_SGraph< Graph_Snode< int >, Graph_Sarc< Empty_Class > >, Array_Graph< Graph_Anode< int >, Graph_Aarc< Empty_Class > > >

Functions
	TEST (MoOnTrees, EmptyGraph)
	TEST (MoOnTrees, SingleNode)
	TEST (MoOnTrees, TwoNodes)
	TEST (MoOnTrees, TwoNodesDifferentValues)
	TEST (MoOnTrees, InvalidNodeThrows)
	TEST (MoOnTreesSubtree, SmallTreeListGraph)
	TEST (MoOnTreesPath, ChainListSGraph)
	TEST (MoOnTreesPath, StarListSGraph)
	TEST (MoOnTreesSubtree, SmallTreeArrayGraph)
	TYPED_TEST_SUITE (MoOnTreesStress, GraphTypes)
	TYPED_TEST (MoOnTreesStress, SubtreeRandomSmall)
	TYPED_TEST (MoOnTreesStress, PathRandomSmall)
	TYPED_TEST (MoOnTreesStress, SubtreeRandomMedium)
	TYPED_TEST (MoOnTreesStress, PathRandomMedium)
	TEST (MoOnTreesPowerful, ChainPath)
	TEST (MoOnTrees, DeepChain)
	TEST (MoOnTrees, EmptyQueryArrays)
	TEST (MoOnTreeNode, SingleNode)
	TEST (MoOnTreeNode, SmallTreeSubtree)
	TEST (MoOnTreeNode, SmallTreePath)
	TEST (MoOnTreeNode, StressRandomSubtree)
	TEST (MoOnTreeNode, NullRootThrows)
	TEST (MoOnTreeNode, EmptyQueryArrays)

Detailed Description

Tests for Gen_Mo_On_Trees and built-in policies on all three graph types (List_Graph, List_SGraph, Array_Graph).

Definition in file tpl_mo_on_trees_test.cc.

Typedef Documentation

GraphTypes

using GraphTypes = Types< List_Graph<Graph_Node<int>, Graph_Arc<Empty_Class> >, List_SGraph<Graph_Snode<int>, Graph_Sarc<Empty_Class> >, Array_Graph<Graph_Anode<int>, Graph_Aarc<Empty_Class> > >

Definition at line 449 of file tpl_mo_on_trees_test.cc.

Function Documentation

TEST() [1/18]

TEST	(	MoOnTreeNode	,
		EmptyQueryArrays
	)

Definition at line 785 of file tpl_mo_on_trees_test.cc.

References Aleph::destroy_tree(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST() [2/18]

TEST	(	MoOnTreeNode	,
		NullRootThrows
	)

Definition at line 778 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [3/18]

TEST	(	MoOnTreeNode	,
		SingleNode
	)

Definition at line 627 of file tpl_mo_on_trees_test.cc.

References Aleph::destroy_tree(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST() [4/18]

TEST	(	MoOnTreeNode	,
		SmallTreePath
	)

Definition at line 686 of file tpl_mo_on_trees_test.cc.

References Aleph::destroy_tree(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST() [5/18]

TEST	(	MoOnTreeNode	,
		SmallTreeSubtree
	)

Definition at line 643 of file tpl_mo_on_trees_test.cc.

References Aleph::destroy_tree(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST() [6/18]

TEST	(	MoOnTreeNode	,
		StressRandomSubtree
	)

Definition at line 724 of file tpl_mo_on_trees_test.cc.

References Aleph::Array< T >::create(), Aleph::destroy_tree(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynHashTable< Key, HashTable, Cmp >::insert(), N, nodes, and rng.

TEST() [7/18]

TEST	(	MoOnTrees	,
		DeepChain
	)

Definition at line 582 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), N, and nodes.

TEST() [8/18]

TEST	(	MoOnTrees	,
		EmptyGraph
	)

Definition at line 206 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [9/18]

TEST	(	MoOnTrees	,
		EmptyQueryArrays
	)

Definition at line 608 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and r.

TEST() [10/18]

TEST	(	MoOnTrees	,
		InvalidNodeThrows
	)

Definition at line 270 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [11/18]

TEST	(	MoOnTrees	,
		SingleNode
	)

Definition at line 215 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and r.

TEST() [12/18]

TEST	(	MoOnTrees	,
		TwoNodes
	)

Definition at line 232 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [13/18]

TEST	(	MoOnTrees	,
		TwoNodesDifferentValues
	)

Definition at line 250 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [14/18]

TEST	(	MoOnTreesPath	,
		ChainListSGraph
	)

Definition at line 335 of file tpl_mo_on_trees_test.cc.

References brute_path_distinct(), Aleph::divide_and_conquer_partition_dp(), and GraphCommon< GT, Node, Arc >::nodes().

TEST() [15/18]

TEST	(	MoOnTreesPath	,
		StarListSGraph
	)

Definition at line 368 of file tpl_mo_on_trees_test.cc.

References brute_path_distinct(), Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), l1, l2, l3, and l5.

TEST() [16/18]

TEST	(	MoOnTreesPowerful	,
		ChainPath
	)

Definition at line 559 of file tpl_mo_on_trees_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [17/18]

TEST	(	MoOnTreesSubtree	,
		SmallTreeArrayGraph
	)

Definition at line 405 of file tpl_mo_on_trees_test.cc.

References brute_path_distinct(), brute_subtree_distinct(), Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and r.

TEST() [18/18]

TEST	(	MoOnTreesSubtree	,
		SmallTreeListGraph
	)

Definition at line 292 of file tpl_mo_on_trees_test.cc.

References brute_subtree_distinct(), Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and r.

TYPED_TEST() [1/4]

TYPED_TEST	(	MoOnTreesStress	,
		PathRandomMedium
	)

Definition at line 529 of file tpl_mo_on_trees_test.cc.

References brute_path_distinct(), Aleph::divide_and_conquer_partition_dp(), and rng.

TYPED_TEST() [2/4]

TYPED_TEST	(	MoOnTreesStress	,
		PathRandomSmall
	)

Definition at line 479 of file tpl_mo_on_trees_test.cc.

References brute_path_distinct(), Aleph::divide_and_conquer_partition_dp(), and rng.

TYPED_TEST() [3/4]

TYPED_TEST	(	MoOnTreesStress	,
		SubtreeRandomMedium
	)

Definition at line 506 of file tpl_mo_on_trees_test.cc.

References brute_subtree_distinct(), Aleph::Array< T >::create(), Aleph::divide_and_conquer_partition_dp(), and rng.

TYPED_TEST() [4/4]

TYPED_TEST	(	MoOnTreesStress	,
		SubtreeRandomSmall
	)

Definition at line 457 of file tpl_mo_on_trees_test.cc.

References brute_subtree_distinct(), Aleph::Array< T >::create(), Aleph::divide_and_conquer_partition_dp(), and rng.

TYPED_TEST_SUITE()

TYPED_TEST_SUITE	(	MoOnTreesStress	,
		GraphTypes
	)