index_graph_intensive_test.cc File Reference

#include <gtest/gtest.h>
#include <tpl_indexGraph.H>
#include <tpl_graph.H>

Include dependency graph for index_graph_intensive_test.cc:

Go to the source code of this file.

Classes
class	IndexGraphIntensiveTest

Functions
	TEST_F (IndexGraphIntensiveTest, LargeNumberOfNodes)
	TEST_F (IndexGraphIntensiveTest, LargeNumberOfArcs)
	TEST_F (IndexGraphIntensiveTest, DenseGraph)
	TEST_F (IndexGraphIntensiveTest, ManySearchOperations)
	TEST_F (IndexGraphIntensiveTest, AlternatingInsertRemove)
	TEST_F (IndexGraphIntensiveTest, BulkInsertThenRemove)
	TEST_F (IndexGraphIntensiveTest, RandomInsertionOrder)
	TEST_F (IndexGraphIntensiveTest, ManyArcSearches)
	TEST_F (IndexGraphIntensiveTest, ArcRemovalAndReinsertion)
	TEST_F (IndexGraphIntensiveTest, StarGraph)
	TEST_F (IndexGraphIntensiveTest, ChainGraph)
	TEST_F (IndexGraphIntensiveTest, GridGraph)
	TEST_F (IndexGraphIntensiveTest, IterateAllNodes)
	TEST_F (IndexGraphIntensiveTest, IterateAllArcs)
	TEST_F (IndexGraphIntensiveTest, DuplicateNodeValues)
	TEST_F (IndexGraphIntensiveTest, ManyDuplicateAttempts)
	TEST_F (IndexGraphIntensiveTest, MultipleGraphInstances)
	TEST_F (IndexGraphIntensiveTest, LargeGraphCleanup)
	TEST_F (IndexGraphIntensiveTest, SearchAfterManyOperations)
	TEST_F (IndexGraphIntensiveTest, NegativeValueSearch)
	TEST_F (IndexGraphIntensiveTest, VeryLargeValues)
	TEST_F (IndexGraphIntensiveTest, MixedOperationPattern)

Function Documentation

TEST_F() [1/22]

TEST_F	(	IndexGraphIntensiveTest	,
		AlternatingInsertRemove
	)

Definition at line 104 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), Aleph::Index_Graph< GT, Compare, Tree >::remove_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [2/22]

TEST_F	(	IndexGraphIntensiveTest	,
		ArcRemovalAndReinsertion
	)

Definition at line 184 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), Aleph::Index_Graph< GT, Compare, Tree >::remove_arc(), and Aleph::Index_Graph< GT, Compare, Tree >::search_arc().

TEST_F() [3/22]

TEST_F	(	IndexGraphIntensiveTest	,
		BulkInsertThenRemove
	)

Definition at line 123 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), nodes, and Aleph::Index_Graph< GT, Compare, Tree >::remove_node().

TEST_F() [4/22]

TEST_F	(	IndexGraphIntensiveTest	,
		ChainGraph
	)

Definition at line 230 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_arcs(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), N, and nodes.

TEST_F() [5/22]

TEST_F	(	IndexGraphIntensiveTest	,
		DenseGraph
	)

Definition at line 61 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_arcs(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), N, and nodes.

TEST_F() [6/22]

TEST_F	(	IndexGraphIntensiveTest	,
		DuplicateNodeValues
	)

Definition at line 334 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), and Aleph::Index_Graph< GT, Compare, Tree >::insert_node().

TEST_F() [7/22]

TEST_F	(	IndexGraphIntensiveTest	,
		GridGraph
	)

Definition at line 247 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), and Aleph::Index_Graph< GT, Compare, Tree >::insert_node().

TEST_F() [8/22]

TEST_F	(	IndexGraphIntensiveTest	,
		IterateAllArcs
	)

Definition at line 303 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), Aleph::Filter_Iterator< Container, It, Show_Item >::next(), and nodes.

TEST_F() [9/22]

TEST_F	(	IndexGraphIntensiveTest	,
		IterateAllNodes
	)

Definition at line 283 of file index_graph_intensive_test.cc.

References Aleph::count(), Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), N, and Aleph::Filter_Iterator< Container, It, Show_Item >::next().

TEST_F() [10/22]

TEST_F	(	IndexGraphIntensiveTest	,
		LargeGraphCleanup
	)

Definition at line 378 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_arcs(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and nodes.

TEST_F() [11/22]

TEST_F	(	IndexGraphIntensiveTest	,
		LargeNumberOfArcs
	)

Definition at line 40 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_arcs(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and nodes.

TEST_F() [12/22]

TEST_F	(	IndexGraphIntensiveTest	,
		LargeNumberOfNodes
	)

Definition at line 21 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), N, and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [13/22]

TEST_F	(	IndexGraphIntensiveTest	,
		ManyArcSearches
	)

Definition at line 164 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_arc().

TEST_F() [14/22]

TEST_F	(	IndexGraphIntensiveTest	,
		ManyDuplicateAttempts
	)

Definition at line 345 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [15/22]

TEST_F	(	IndexGraphIntensiveTest	,
		ManySearchOperations
	)

Definition at line 83 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [16/22]

TEST_F	(	IndexGraphIntensiveTest	,
		MixedOperationPattern
	)

Definition at line 469 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), Aleph::Index_Graph< GT, Compare, Tree >::remove_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [17/22]

TEST_F	(	IndexGraphIntensiveTest	,
		MultipleGraphInstances
	)

Definition at line 363 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), and Aleph::Index_Graph< GT, Compare, Tree >::insert_node().

TEST_F() [18/22]

TEST_F	(	IndexGraphIntensiveTest	,
		NegativeValueSearch
	)

Definition at line 435 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [19/22]

TEST_F	(	IndexGraphIntensiveTest	,
		RandomInsertionOrder
	)

Definition at line 140 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [20/22]

TEST_F	(	IndexGraphIntensiveTest	,
		SearchAfterManyOperations
	)

Definition at line 399 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), Aleph::Index_Graph< GT, Compare, Tree >::remove_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().

TEST_F() [21/22]

TEST_F	(	IndexGraphIntensiveTest	,
		StarGraph
	)

Definition at line 205 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_arcs(), Aleph::Index_Graph< GT, Compare, Tree >::get_num_nodes(), Aleph::Index_Graph< GT, Compare, Tree >::insert_arc(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_arc().

TEST_F() [22/22]

TEST_F	(	IndexGraphIntensiveTest	,
		VeryLargeValues
	)

Definition at line 456 of file index_graph_intensive_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Index_Graph< GT, Compare, Tree >::insert_node(), and Aleph::Index_Graph< GT, Compare, Tree >::search_node().