Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Classes | Typedefs | Functions
dynsettree.cc File Reference

Tests for Dynsettree. More...

#include <algorithm>
#include <random>
#include <set>
#include <stdexcept>
#include <vector>
#include <string>
#include <gtest/gtest.h>
#include <tpl_dynSetTree.H>
Include dependency graph for dynsettree.cc:

Go to the source code of this file.

Classes

class  DynSetTreeTypedTest< T >
 

Typedefs

using AllTreeTypes = ::testing::Types< DynSetBinTree< int >, DynSetAvlTree< int >, DynSetSplayTree< int >, DynSetRandTree< int >, DynSetTreap< int >, DynSetTreapRk< int >, DynSetRbTree< int > >
 

Functions

 TYPED_TEST_SUITE (DynSetTreeTypedTest, AllTreeTypes)
 
 TYPED_TEST (DynSetTreeTypedTest, EmptySetProperties)
 
 TYPED_TEST (DynSetTreeTypedTest, InsertAndSearch)
 
 TYPED_TEST (DynSetTreeTypedTest, InsertRejectsDuplicates)
 
 TYPED_TEST (DynSetTreeTypedTest, RemoveOperations)
 
 TYPED_TEST (DynSetTreeTypedTest, SearchOrInsert)
 
 TYPED_TEST (DynSetTreeTypedTest, ContainsOrInsert)
 
 TYPED_TEST (DynSetTreeTypedTest, FindAndDel)
 
 TYPED_TEST (DynSetTreeTypedTest, CopyConstructor)
 
 TYPED_TEST (DynSetTreeTypedTest, MoveConstructor)
 
 TYPED_TEST (DynSetTreeTypedTest, Swap)
 
 TYPED_TEST (DynSetTreeTypedTest, EmptyMethod)
 
 TYPED_TEST (DynSetTreeTypedTest, IteratorInOrder)
 
 TYPED_TEST (DynSetTreeTypedTest, ForEachInorder)
 
 TYPED_TEST (DynSetTreeTypedTest, Traverse)
 
 TYPED_TEST (DynSetTreeTypedTest, Verify)
 
 TYPED_TEST (DynSetTreeTypedTest, StressTest)
 
 TEST (DynSetTreapRk, SelectByPosition)
 
 TEST (DynSetTreapRk, Position)
 
 TEST (DynSetTreapRk, FindPosition)
 
 TEST (DynSetTreapRk, RemovePos)
 
 TEST (DynSetTreapRk, OperatorParenthesis)
 
 TEST (DynSetTreapRk, SplitKey)
 
 TEST (DynSetTreapRk, SplitKeyDup)
 
 TEST (DynSetTreapRk, SplitPos)
 
 TEST (DynSetTreapRk, SplitPosEdgeCases)
 
 TEST (DynSetTreapRk, RankOperationsOutOfRange)
 
 TEST (DynSetTreapRk, Join)
 
 TEST (DynSetTreapRk, JoinWithDuplicates)
 
 TEST (DynSetTreapRk, JoinDup)
 
template<typename T >
static void insert_dup_traversal_test ()
 
 TEST (DynSetTree, InsertDupTraversesDuplicates)
 
template<typename T >
static void range_methods_throw_domain_error_test ()
 
 TEST (DynSetTree, RangeMethodsThrowOnNonRankTrees)
 
 TEST (DynSetTree, CustomComparatorGreater)
 
 TEST (DynSetTree, OperatorBracketConstThrows)
 
 TEST (DynSetTree, OperatorBracketNonConstInserts)
 
 TEST (DynSetTree, VerifyValidTree)
 
 TEST (DynSetTree, LargeSetOperations)
 
 TEST (DynSetTree, RandomInsertRemove)
 
 TEST (DynSetTree, StringKeys)
 
 TEST (DynSetTree, SingleElement)
 
 TEST (DynSetTree, InsertRemoveRepeated)
 
 TEST (DynSetTree, AccessMethods)
 
 TEST (DynSetTreeHardening, InsertDoesNotLeakOnThrow)
 
 TEST (DynSetTreeHardening, SearchOrInsertDoesNotLeakOnThrow)
 
 TEST (DynSetTreeHardening, ContainsOrInsertDoesNotLeakOnThrow)
 
 TYPED_TEST (DynSetTreeTypedTest, AppendMethod)
 
 TYPED_TEST (DynSetTreeTypedTest, PutMethod)
 
 TYPED_TEST (DynSetTreeTypedTest, InsertRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, AppendRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, PutRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, SearchOrInsertRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, ContainsOrInsertRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, InsertDupRvalue)
 
 TYPED_TEST (DynSetTreeTypedTest, Height)
 
 TYPED_TEST (DynSetTreeTypedTest, InternalPathLength)
 
 TYPED_TEST (DynSetTreeTypedTest, GetRootNode)
 
 TYPED_TEST (DynSetTreeTypedTest, GetFirstAndGetLast)
 
 TYPED_TEST (DynSetTreeTypedTest, GetMethod)
 
 TYPED_TEST (DynSetTreeTypedTest, GetItem)
 
 TYPED_TEST (DynSetTreeTypedTest, ExistHasContainsConsistency)
 
 TYPED_TEST (DynSetTreeTypedTest, CopyAssignment)
 
 TYPED_TEST (DynSetTreeTypedTest, SelfCopyAssignment)
 
 TYPED_TEST (DynSetTreeTypedTest, MoveAssignment)
 
 TYPED_TEST (DynSetTreeTypedTest, SelfMoveAssignment)
 
 TEST (DynSetTree, InitializerListConstruction)
 
 TEST (DynSetTree, InitializerListConstructionWithDuplicates)
 
 TEST (DynSetTree, InitializerListEmpty)
 
 TEST (DynSetTreapRk, SplitKeyWhenKeyExists)
 
 TEST (DynSetTreapRk, SplitKeyEmptySet)
 
 TEST (DynSetTreapRk, SplitKeyDupEmptySet)
 
 TEST (DynSetTreapRk, AccessMethod)
 
 TEST (DynSetTreapRk, SelectOutOfRange)
 
 TEST (DynSetTreapRk, SelectOnEmptySet)
 
 TEST (DynSetTreapRk, RemovePosOutOfRange)
 
 TEST (DynSetTreapRk, FindPositionOnEmptySet)
 
 TEST (DynSetTreapRk, PositionNotFound)
 
 TEST (DynSetTreapRk, ConstSelect)
 
 TYPED_TEST (DynSetTreeTypedTest, IteratorOnEmptySet)
 
 TYPED_TEST (DynSetTreeTypedTest, IteratorResetFirst)
 
 TYPED_TEST (DynSetTreeTypedTest, IteratorResetLast)
 
 TYPED_TEST (DynSetTreeTypedTest, TraverseEarlyExit)
 
 TYPED_TEST (DynSetTreeTypedTest, TraverseConst)
 
 TEST (DynSetTree, OperatorParenthesisOnNonRankTreeThrows)
 
 TEST (DynSetTreapRk, JoinEmptySets)
 
 TEST (DynSetTreapRk, JoinWithEmptySet)
 
 TEST (DynSetTreapRk, JoinDupEmptySets)
 
 TYPED_TEST (DynSetTreeTypedTest, VerifyEmptyTree)
 
 TYPED_TEST (DynSetTreeTypedTest, VerifySingleElement)
 
 TEST (DynSetTree, StringRvalueInsert)
 
 TEST (DynSetTree, StringRvalueSearchOrInsert)
 
 TEST (DynSetTreeAliases, DynSetBinTreeWorks)
 
 TEST (DynSetTreeAliases, DynSetAvlTreeWorks)
 
 TEST (DynSetTreeAliases, DynSetSplayTreeWorks)
 
 TEST (DynSetTreeAliases, DynSetRandTreeWorks)
 
 TEST (DynSetTreeAliases, DynSetTreapWorks)
 
 TEST (DynSetTreeAliases, DynSetTreapRkWorks)
 
 TEST (DynSetTreeAliases, DynSetRbTreeWorks)
 
 TYPED_TEST (DynSetTreeTypedTest, Stress_AscendingInsertion)
 
 TYPED_TEST (DynSetTreeTypedTest, Stress_DescendingInsertion)
 
 TYPED_TEST (DynSetTreeTypedTest, Stress_BulkInsertBulkRemove)
 
 TYPED_TEST (DynSetTreeTypedTest, Fuzz_RandomOperations)
 
 TYPED_TEST (DynSetTreeTypedTest, Stress_AlternatingInsertRemove)
 
 TEST (DynSetTreeStress, AllTypesLargeScale)
 
int main (int argc, char **argv)
 

Detailed Description

Tests for Dynsettree.

Definition in file dynsettree.cc.

Typedef Documentation

◆ AllTreeTypes

using AllTreeTypes = ::testing::Types< DynSetBinTree<int>, DynSetAvlTree<int>, DynSetSplayTree<int>, DynSetRandTree<int>, DynSetTreap<int>, DynSetTreapRk<int>, DynSetRbTree<int> >

Definition at line 62 of file dynsettree.cc.

Function Documentation

◆ insert_dup_traversal_test()

template<typename T >
static void insert_dup_traversal_test ( )
static

Definition at line 1082 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert_dup().

◆ main()

int main ( int  argc,
char **  argv 
)

Definition at line 2360 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ range_methods_throw_domain_error_test()

template<typename T >
static void range_methods_throw_domain_error_test ( )
static

Definition at line 1115 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TEST() [1/55]

TEST ( DynSetTreapRk  ,
AccessMethod   
)

Definition at line 1873 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::access(), Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [2/55]

TEST ( DynSetTreapRk  ,
ConstSelect   
)

Definition at line 1937 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [3/55]

TEST ( DynSetTreapRk  ,
FindPosition   
)

Definition at line 837 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::find_position(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [4/55]

TEST ( DynSetTreapRk  ,
FindPositionOnEmptySet   
)

Definition at line 1915 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::find_position().

◆ TEST() [5/55]

TEST ( DynSetTreapRk  ,
Join   
)

Definition at line 1017 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), and Aleph::DynSetTree< Key, Tree, Compare >::join().

◆ TEST() [6/55]

TEST ( DynSetTreapRk  ,
JoinDup   
)

Definition at line 1061 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [7/55]

TEST ( DynSetTreapRk  ,
JoinDupEmptySets   
)

Definition at line 2071 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::join_dup().

◆ TEST() [8/55]

TEST ( DynSetTreapRk  ,
JoinEmptySets   
)

Definition at line 2044 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), and Aleph::DynSetTree< Key, Tree, Compare >::join().

◆ TEST() [9/55]

TEST ( DynSetTreapRk  ,
JoinWithDuplicates   
)

Definition at line 1038 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::join(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [10/55]

TEST ( DynSetTreapRk  ,
JoinWithEmptySet   
)

Definition at line 2056 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::is_empty().

◆ TEST() [11/55]

TEST ( DynSetTreapRk  ,
OperatorParenthesis   
)

Definition at line 868 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [12/55]

TEST ( DynSetTreapRk  ,
Position   
)

Definition at line 821 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::position().

◆ TEST() [13/55]

TEST ( DynSetTreapRk  ,
PositionNotFound   
)

Definition at line 1924 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::position().

◆ TEST() [14/55]

TEST ( DynSetTreapRk  ,
RankOperationsOutOfRange   
)

Definition at line 1000 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::remove_pos(), Aleph::DynSetTree< Key, Tree, Compare >::select(), and Aleph::DynSetTree< Key, Tree, Compare >::split_pos().

◆ TEST() [15/55]

TEST ( DynSetTreapRk  ,
RemovePos   
)

Definition at line 854 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::remove_pos(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [16/55]

TEST ( DynSetTreapRk  ,
RemovePosOutOfRange   
)

Definition at line 1904 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::remove_pos().

◆ TEST() [17/55]

TEST ( DynSetTreapRk  ,
SelectByPosition   
)

Definition at line 806 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::select().

◆ TEST() [18/55]

TEST ( DynSetTreapRk  ,
SelectOnEmptySet   
)

Definition at line 1897 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::select().

◆ TEST() [19/55]

TEST ( DynSetTreapRk  ,
SelectOutOfRange   
)

Definition at line 1886 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::select().

◆ TEST() [20/55]

TEST ( DynSetTreapRk  ,
SplitKey   
)

Definition at line 885 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::split_key().

◆ TEST() [21/55]

TEST ( DynSetTreapRk  ,
SplitKeyDup   
)

Definition at line 916 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::split_key_dup().

◆ TEST() [22/55]

TEST ( DynSetTreapRk  ,
SplitKeyDupEmptySet   
)

Definition at line 1859 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), and Aleph::DynSetTree< Key, Tree, Compare >::split_key_dup().

◆ TEST() [23/55]

TEST ( DynSetTreapRk  ,
SplitKeyEmptySet   
)

Definition at line 1847 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), and Aleph::DynSetTree< Key, Tree, Compare >::split_key().

◆ TEST() [24/55]

TEST ( DynSetTreapRk  ,
SplitKeyWhenKeyExists   
)

Definition at line 1828 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::split_key().

◆ TEST() [25/55]

TEST ( DynSetTreapRk  ,
SplitPos   
)

Definition at line 938 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::split_pos().

◆ TEST() [26/55]

TEST ( DynSetTreapRk  ,
SplitPosEdgeCases   
)

Definition at line 962 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::split_pos().

◆ TEST() [27/55]

TEST ( DynSetTree  ,
AccessMethods   
)

Definition at line 1374 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get(), Aleph::DynSetTree< Key, Tree, Compare >::get_first(), Aleph::DynSetTree< Key, Tree, Compare >::get_item(), Aleph::DynSetTree< Key, Tree, Compare >::get_last(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [28/55]

TEST ( DynSetTree  ,
CustomComparatorGreater   
)

Definition at line 1194 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), keys, Aleph::DynSetTree< Key, Tree, Compare >::max(), and Aleph::DynSetTree< Key, Tree, Compare >::min().

◆ TEST() [29/55]

TEST ( DynSetTree  ,
InitializerListConstruction   
)

Definition at line 1800 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [30/55]

TEST ( DynSetTree  ,
InitializerListConstructionWithDuplicates   
)

Definition at line 1809 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [31/55]

TEST ( DynSetTree  ,
InitializerListEmpty   
)

Definition at line 1817 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::is_empty().

◆ TEST() [32/55]

TEST ( DynSetTree  ,
InsertDupTraversesDuplicates   
)

Definition at line 1099 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TEST() [33/55]

TEST ( DynSetTree  ,
InsertRemoveRepeated   
)

Definition at line 1356 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [34/55]

TEST ( DynSetTree  ,
LargeSetOperations   
)

Definition at line 1253 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::max(), Aleph::DynSetTree< Key, Tree, Compare >::min(), Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [35/55]

TEST ( DynSetTree  ,
OperatorBracketConstThrows   
)

Definition at line 1216 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TEST() [36/55]

TEST ( DynSetTree  ,
OperatorBracketNonConstInserts   
)

Definition at line 1223 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [37/55]

TEST ( DynSetTree  ,
OperatorParenthesisOnNonRankTreeThrows   
)

Definition at line 2029 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [38/55]

TEST ( DynSetTree  ,
RandomInsertRemove   
)

Definition at line 1285 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [39/55]

TEST ( DynSetTree  ,
RangeMethodsThrowOnNonRankTrees   
)

Definition at line 1128 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TEST() [40/55]

TEST ( DynSetTree  ,
SingleElement   
)

Definition at line 1341 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get_root(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), Aleph::DynSetTree< Key, Tree, Compare >::max(), Aleph::DynSetTree< Key, Tree, Compare >::min(), Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [41/55]

TEST ( DynSetTree  ,
StringKeys   
)

Definition at line 1320 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::max(), Aleph::DynSetTree< Key, Tree, Compare >::min(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [42/55]

TEST ( DynSetTree  ,
StringRvalueInsert   
)

Definition at line 2100 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TEST() [43/55]

TEST ( DynSetTree  ,
StringRvalueSearchOrInsert   
)

Definition at line 2112 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::search_or_insert().

◆ TEST() [44/55]

TEST ( DynSetTree  ,
VerifyValidTree   
)

Definition at line 1239 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [45/55]

TEST ( DynSetTreeAliases  ,
DynSetAvlTreeWorks   
)

Definition at line 2139 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [46/55]

TEST ( DynSetTreeAliases  ,
DynSetBinTreeWorks   
)

Definition at line 2130 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [47/55]

TEST ( DynSetTreeAliases  ,
DynSetRandTreeWorks   
)

Definition at line 2157 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [48/55]

TEST ( DynSetTreeAliases  ,
DynSetRbTreeWorks   
)

Definition at line 2184 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [49/55]

TEST ( DynSetTreeAliases  ,
DynSetSplayTreeWorks   
)

Definition at line 2148 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [50/55]

TEST ( DynSetTreeAliases  ,
DynSetTreapRkWorks   
)

Definition at line 2175 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [51/55]

TEST ( DynSetTreeAliases  ,
DynSetTreapWorks   
)

Definition at line 2166 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TEST() [52/55]

TEST ( DynSetTreeHardening  ,
ContainsOrInsertDoesNotLeakOnThrow   
)

Definition at line 1509 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [53/55]

TEST ( DynSetTreeHardening  ,
InsertDoesNotLeakOnThrow   
)

Definition at line 1465 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [54/55]

TEST ( DynSetTreeHardening  ,
SearchOrInsertDoesNotLeakOnThrow   
)

Definition at line 1487 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TEST() [55/55]

TEST ( DynSetTreeStress  ,
AllTypesLargeScale   
)

Definition at line 2305 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), k, and test_tree().

◆ TYPED_TEST() [1/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
AppendMethod   
)

Definition at line 1535 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::append(), Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [2/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
AppendRvalue   
)

Definition at line 1585 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::append(), and Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [3/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
ContainsOrInsert   
)

Definition at line 141 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [4/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
ContainsOrInsertRvalue   
)

Definition at line 1610 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains_or_insert(), and Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [5/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
CopyAssignment   
)

Definition at line 1723 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [6/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
CopyConstructor   
)

Definition at line 169 of file dynsettree.cc.

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

◆ TYPED_TEST() [7/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
EmptyMethod   
)

Definition at line 217 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [8/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
EmptySetProperties   
)

Definition at line 74 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [9/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
ExistHasContainsConsistency   
)

Definition at line 1707 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::exist(), Aleph::DynSetTree< Key, Tree, Compare >::has(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [10/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
FindAndDel   
)

Definition at line 153 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [11/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
ForEachInorder   
)

Definition at line 243 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), k, and keys.

◆ TYPED_TEST() [12/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Fuzz_RandomOperations   
)

Definition at line 2235 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), k, Aleph::DynSetTree< Key, Tree, Compare >::remove(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST() [13/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
GetFirstAndGetLast   
)

Definition at line 1681 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get_first(), Aleph::DynSetTree< Key, Tree, Compare >::get_last(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [14/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
GetItem   
)

Definition at line 1699 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get_item(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [15/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
GetMethod   
)

Definition at line 1690 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [16/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
GetRootNode   
)

Definition at line 1664 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::get_root_node(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [17/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Height   
)

Definition at line 1636 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), h, Aleph::DynSetTree< Key, Tree, Compare >::height(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [18/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
InsertAndSearch   
)

Definition at line 85 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [19/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
InsertDupRvalue   
)

Definition at line 1619 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert_dup(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [20/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
InsertRejectsDuplicates   
)

Definition at line 105 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [21/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
InsertRvalue   
)

Definition at line 1575 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [22/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
InternalPathLength   
)

Definition at line 1651 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::internal_path_length().

◆ TYPED_TEST() [23/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
IteratorInOrder   
)

Definition at line 230 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and keys.

◆ TYPED_TEST() [24/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
IteratorOnEmptySet   
)

Definition at line 1954 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [25/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
IteratorResetFirst   
)

Definition at line 1961 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [26/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
IteratorResetLast   
)

Definition at line 1977 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [27/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
MoveAssignment   
)

Definition at line 1753 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::is_empty().

◆ TYPED_TEST() [28/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
MoveConstructor   
)

Definition at line 186 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [29/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
PutMethod   
)

Definition at line 1553 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::put(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [30/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
PutRvalue   
)

Definition at line 1593 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::put().

◆ TYPED_TEST() [31/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
RemoveOperations   
)

Definition at line 116 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [32/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
SearchOrInsert   
)

Definition at line 129 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [33/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
SearchOrInsertRvalue   
)

Definition at line 1601 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::search_or_insert(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [34/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
SelfCopyAssignment   
)

Definition at line 1741 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::contains(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [35/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
SelfMoveAssignment   
)

Definition at line 1772 of file dynsettree.cc.

References Aleph::DynSetTree< Key, Tree, Compare >::insert().

◆ TYPED_TEST() [36/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Stress_AlternatingInsertRemove   
)

Definition at line 2274 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), k, Aleph::DynSetTree< Key, Tree, Compare >::remove(), Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST() [37/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Stress_AscendingInsertion   
)

Definition at line 2197 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), k, Aleph::DynSetTree< Key, Tree, Compare >::max(), Aleph::DynSetTree< Key, Tree, Compare >::min(), N, Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST() [38/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Stress_BulkInsertBulkRemove   
)

Definition at line 2219 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::is_empty(), k, N, Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

◆ TYPED_TEST() [39/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Stress_DescendingInsertion   
)

Definition at line 2209 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), k, N, Aleph::DynSetTree< Key, Tree, Compare >::size(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST() [40/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
StressTest   
)

Definition at line 278 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [41/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Swap   
)

Definition at line 200 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [42/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Traverse   
)

Definition at line 255 of file dynsettree.cc.

References Aleph::completed(), Aleph::divide_and_conquer_partition_dp(), k, and Aleph::sum().

◆ TYPED_TEST() [43/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
TraverseConst   
)

Definition at line 2008 of file dynsettree.cc.

References Aleph::completed(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), k, and Aleph::sum().

◆ TYPED_TEST() [44/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
TraverseEarlyExit   
)

Definition at line 1993 of file dynsettree.cc.

References Aleph::completed(), Aleph::count(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::traverse().

◆ TYPED_TEST() [45/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
Verify   
)

Definition at line 270 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TYPED_TEST() [46/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
VerifyEmptyTree   
)

Definition at line 2085 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST() [47/47]

TYPED_TEST ( DynSetTreeTypedTest  ,
VerifySingleElement   
)

Definition at line 2090 of file dynsettree.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), and Aleph::DynSetTree< Key, Tree, Compare >::verify().

◆ TYPED_TEST_SUITE()

TYPED_TEST_SUITE ( DynSetTreeTypedTest  ,
AllTreeTypes   
)