bintree.cc File Reference

Tests for Bintree. More...

#include <algorithm>
#include <vector>
#include <gtest/gtest.h>
#include <tpl_binTree.H>

Include dependency graph for bintree.cc:

Go to the source code of this file.

Functions
	TEST (BinTree, InsertSearchVerifyAndIteratorOrder)
	TEST (BinTree, RemoveReturnsNodeAndAllowsReinsert)
	TEST (BinTree, InsertRejectsDuplicatesButInsertDupAllows)
	TEST (BinTree, SplitKeyNotPresentEmptiesSource)
	TEST (BinTree, SplitKeyPresentReturnsFalseAndKeepsTree)
	TEST (BinTree, SplitDupAlwaysSplits)
	TEST (BinTree, JoinMovesNodesAndCollectsDuplicates)
	TEST (BinTree, JoinDupAllowsDuplicates)
	TEST (BinTree, RemoveMissingReturnsNull)
	TEST (BinTree, SearchOrInsertReturnsExistingOrInserted)
	TEST (BinTree, SwapExchangesRoots)
	TEST (BinTree, JoinExclusiveConcatenatesWhenRangesAreDisjoint)

Detailed Description

Tests for Bintree.

Definition in file bintree.cc.

Function Documentation

TEST() [1/12]

TEST	(	BinTree	,
		InsertRejectsDuplicatesButInsertDupAllows
	)

Definition at line 122 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::insert(), and Aleph::maps().

TEST() [2/12]

TEST	(	BinTree	,
		InsertSearchVerifyAndIteratorOrder
	)

Definition at line 80 of file bintree.cc.

References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), KEY, Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::search(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [3/12]

TEST	(	BinTree	,
		JoinDupAllowsDuplicates
	)

Definition at line 217 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::GenBinTree< NodeType, Key, Compare >::join_dup(), Aleph::maps(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [4/12]

TEST	(	BinTree	,
		JoinExclusiveConcatenatesWhenRangesAreDisjoint
	)

Definition at line 281 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::GenBinTree< NodeType, Key, Compare >::join_exclusive(), Aleph::maps(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [5/12]

TEST	(	BinTree	,
		JoinMovesNodesAndCollectsDuplicates
	)

Definition at line 195 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::GenBinTree< NodeType, Key, Compare >::join(), Aleph::maps(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [6/12]

TEST	(	BinTree	,
		RemoveMissingReturnsNull
	)

Definition at line 235 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::remove(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [7/12]

TEST	(	BinTree	,
		RemoveReturnsNodeAndAllowsReinsert
	)

Definition at line 104 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::insert(), KEY, Aleph::LLINK(), Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::remove(), Aleph::RLINK(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [8/12]

TEST	(	BinTree	,
		SearchOrInsertReturnsExistingOrInserted
	)

Definition at line 246 of file bintree.cc.

References KEY, Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::search_or_insert(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [9/12]

TEST	(	BinTree	,
		SplitDupAlwaysSplits
	)

Definition at line 178 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), l, Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::split_dup(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [10/12]

TEST	(	BinTree	,
		SplitKeyNotPresentEmptiesSource
	)

Definition at line 142 of file bintree.cc.

References Aleph::DynList< T >::empty(), Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), l, Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::split(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [11/12]

TEST	(	BinTree	,
		SplitKeyPresentReturnsFalseAndKeepsTree
	)

Definition at line 163 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), l, Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::split(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().

TEST() [12/12]

TEST	(	BinTree	,
		SwapExchangesRoots
	)

Definition at line 264 of file bintree.cc.

References Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder_keys(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::maps(), Aleph::GenBinTree< NodeType, Key, Compare >::swap(), and Aleph::GenBinTree< NodeType, Key, Compare >::verify().