test-rvalues.C File Reference

#include <iostream>
#include <string>
#include <tpl_agraph.H>
#include <tpl_dynMapTree.H>

Include dependency graph for test-rvalues.C:

Go to the source code of this file.

Functions
template<class GT >
GT	create_graph ()
template<class GT >
bool	check (GT &g)
template<class GT >
void	test ()
template<class L >
L	create_list (int beg=0, int end=V - 1)
template<class L >
bool	check_list (const L &l)
template<class L >
void	print_list (const L &l)
template<class L >
void	test_list ()
template<class Tree >
void	test_map_tree (size_t n)
int	main (int argc, char *argv[])

Variables
size_t	V = 1000

Function Documentation

check()

template<class GT >

bool check

(

GT &

g

)

Definition at line 55 of file test-rvalues.C.

References Aleph::count(), Aleph::divide_and_conquer_partition_dp(), GTNodeCommon< NodeInfo >::get_info(), GTArcCommon< ArcInfo >::get_info(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::DynArray< T >::reserve(), and V.

Referenced by demo_basic_operations(), test(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST_F(), and TYPED_TEST().

check_list()

template<class L >

bool check_list

(

const L &

l

)

Definition at line 151 of file test-rvalues.C.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynList< T >::get_first(), and l.

Referenced by test_list().

create_graph()

template<class GT >

GT create_graph

(

)

Definition at line 37 of file test-rvalues.C.

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(), nodes, Aleph::DynArray< T >::reserve(), and V.

create_list()

template<class L >

L create_list	(	int	beg = 0,
		int	end = V - 1
	)

Definition at line 140 of file test-rvalues.C.

References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), and l.

Referenced by test_list().

main()

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 297 of file test-rvalues.C.

References Aleph::divide_and_conquer_partition_dp(), and V.

print_list()

template<class L >

void print_list

(

const L &

l

)

Definition at line 166 of file test-rvalues.C.

References Aleph::divide_and_conquer_partition_dp(), and l.

Referenced by test_list().

test()

template<class GT >

void test

(

)

Definition at line 110 of file test-rvalues.C.

References check(), and Aleph::divide_and_conquer_partition_dp().

test_list()

template<class L >

void test_list

(

)

Definition at line 174 of file test-rvalues.C.

References Aleph::DynList< T >::append(), check_list(), create_list(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynList< T >::insert(), l, print_list(), and V.

test_map_tree()

template<class Tree >

void test_map_tree

(

size_t

n

)

Definition at line 235 of file test-rvalues.C.

References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), Aleph::print(), and Aleph::Tree.

Variable Documentation

V

size_t V = 1000

Definition at line 34 of file test-rvalues.C.

Referenced by check(), create_graph(), demo_kruskal_simulation(), Aleph::knapsack_01(), Aleph::knapsack_01_value(), Aleph::knapsack_bounded(), Aleph::knapsack_unbounded(), main(), Aleph::DelaunayTriangulationRandomizedIncremental::operator()(), Aleph::Kruskal_Min_Spanning_Tree< GT, Distance, SA >::paint_min_spanning_tree(), Aleph::MCF_LP_Solver< Net >::print_formulation(), TEST_F(), and test_list().