testArrayHeap.C File Reference

#include <cstdlib>
#include <iostream>
#include <ctime>
#include <string>
#include <tpl_arrayHeap.H>

Include dependency graph for testArrayHeap.C:

Go to the source code of this file.

Macros
#define	NIL   (-1)
#define	LLINK(i, n)   (2*i)
#define	RLINK(i, n)   (2*i + 1)

Functions
void	preorder (int v[], int n, int i)
void	inorder (int v[], int n, int i)
int	main (int argc, char *argv[])

Variables
int	keys [] = { 36, 32, 4, 12, 52, 59, 2, 2, 26, 1 }
int *	keys_ptr = keys

Macro Definition Documentation

LLINK

#define LLINK	(		i,
			n
	)		(2*i)

Definition at line 43 of file testArrayHeap.C.

NIL

#define NIL   (-1)

Definition at line 42 of file testArrayHeap.C.

RLINK

#define RLINK	(		i,
			n
	)		(2*i + 1)

Definition at line 44 of file testArrayHeap.C.

Function Documentation

inorder()

void inorder	(	int	v[],
		int	n,
		int	i
	)

Definition at line 59 of file testArrayHeap.C.

References inorder, LLINK, and RLINK.

main()

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

Definition at line 72 of file testArrayHeap.C.

References Aleph::divide_and_conquer_partition_dp(), Aleph::faster_heapsort(), Aleph::ArrayHeap< T, Compare >::getMin(), Aleph::heapsort(), inorder, Aleph::ArrayHeap< T, Compare >::insert(), preorder, and Aleph::ArrayHeap< T, Compare >::size().

preorder()

void preorder	(	int	v[],
		int	n,
		int	i
	)

Definition at line 47 of file testArrayHeap.C.

References LLINK, preorder, and RLINK.

Variable Documentation

keys

int keys[] = { 36, 32, 4, 12, 52, 59, 2, 2, 26, 1 }

Definition at line 34 of file testArrayHeap.C.

Referenced by benchmark_comparison(), Aleph::build_optimal_tree(), Aleph::compute_tree(), Aleph::csv_group_by(), demo_performance(), demo_text_processor(), demo_variadic_constructor(), inorder_keys(), insert_n_random_items_in_map(), insert_n_random_items_in_map(), insert_n_random_items_in_set(), insert_n_random_items_in_set(), OhashCommon< HashTbl, Key >::items(), Aleph::load_tree_from_array(), Aleph::load_tree_keys_from_array(), main(), main(), TdRbTreeTest::make_nodes(), TdRbTreeCustomCompareTest::make_nodes(), TdRbTreeRkTest::make_nodes(), Aleph::detail::save_ordered_tree_snapshot(), Aleph::PolygonOffset::sort_by_alpha(), Aleph::BooleanPolygonOperations::sort_indices_by_alpha(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), test_DynMap(), test_DynMapLinHash(), test_DynSet(), test_DynSetLinHash(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), test_hash_table(), TYPED_TEST(), and TYPED_TEST().

keys_ptr

int* keys_ptr = keys

Definition at line 36 of file testArrayHeap.C.