Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
tdrbtreerk_test.cc File Reference

Tests for Tdrbtreerk. More...

#include <gtest/gtest.h>
#include <tpl_tdRbTreeRk.H>
#include <tpl_rbRk.H>
#include <random>
#include <set>
#include <vector>
#include <algorithm>
Include dependency graph for tdrbtreerk_test.cc:

Go to the source code of this file.

Classes

class  TdRbTreeRkTest
 

Functions

 TEST_F (TdRbTreeRkTest, EmptyTree)
 
 TEST_F (TdRbTreeRkTest, InsertSingleNode)
 
 TEST_F (TdRbTreeRkTest, InsertMultipleNodes)
 
 TEST_F (TdRbTreeRkTest, InsertDuplicateRejected)
 
 TEST_F (TdRbTreeRkTest, RemoveNode)
 
 TEST_F (TdRbTreeRkTest, RemoveAllNodes)
 
 TEST_F (TdRbTreeRkTest, SelectBasic)
 
 TEST_F (TdRbTreeRkTest, SelectAfterRemoval)
 
 TEST_F (TdRbTreeRkTest, SelectLargeTree)
 
 TEST_F (TdRbTreeRkTest, PositionBasic)
 
 TEST_F (TdRbTreeRkTest, PositionNotFound)
 
 TEST_F (TdRbTreeRkTest, FindPositionExisting)
 
 TEST_F (TdRbTreeRkTest, FindPositionNotExisting)
 
 TEST_F (TdRbTreeRkTest, InsertDupAllowsDuplicates)
 
 TEST_F (TdRbTreeRkTest, SplitPosMiddle)
 
 TEST_F (TdRbTreeRkTest, SplitPosBeginning)
 
 TEST_F (TdRbTreeRkTest, SplitPosEnd)
 
 TEST_F (TdRbTreeRkTest, RemovePos)
 
 TEST_F (TdRbTreeRkTest, MoveConstructor)
 
 TEST_F (TdRbTreeRkTest, MoveAssignment)
 
 TEST (TdRbTreeRkComparison, SameResultsAsBottomUp)
 
 TEST (TdRbTreeRkStress, RandomOperations)
 
 TEST (TdRbTreeRkStress, LargeTreeSelectPerformance)
 
 TEST_F (TdRbTreeRkTest, IteratorInOrder)
 
int main (int argc, char **argv)
 

Detailed Description

Tests for Tdrbtreerk.

Exhaustive tests for Top-Down Red-Black Tree with Rank support.

Definition in file tdrbtreerk_test.cc.

Function Documentation

◆ main()

int main ( int  argc,
char **  argv 
)

Definition at line 575 of file tdrbtreerk_test.cc.

References Aleph::maps().

◆ TEST() [1/3]

TEST ( TdRbTreeRkComparison  ,
SameResultsAsBottomUp   
)

◆ TEST() [2/3]

◆ TEST() [3/3]

◆ TEST_F() [1/21]

TEST_F ( TdRbTreeRkTest  ,
EmptyTree   
)

Definition at line 93 of file tdrbtreerk_test.cc.

References Aleph::maps().

◆ TEST_F() [2/21]

TEST_F ( TdRbTreeRkTest  ,
FindPositionExisting   
)

Definition at line 267 of file tdrbtreerk_test.cc.

References KEY, Aleph::maps(), and nodes.

◆ TEST_F() [3/21]

TEST_F ( TdRbTreeRkTest  ,
FindPositionNotExisting   
)

Definition at line 279 of file tdrbtreerk_test.cc.

References Aleph::maps(), and nodes.

◆ TEST_F() [4/21]

TEST_F ( TdRbTreeRkTest  ,
InsertDupAllowsDuplicates   
)

Definition at line 294 of file tdrbtreerk_test.cc.

References Aleph::maps().

◆ TEST_F() [5/21]

TEST_F ( TdRbTreeRkTest  ,
InsertDuplicateRejected   
)

Definition at line 127 of file tdrbtreerk_test.cc.

References Aleph::maps().

◆ TEST_F() [6/21]

TEST_F ( TdRbTreeRkTest  ,
InsertMultipleNodes   
)

Definition at line 112 of file tdrbtreerk_test.cc.

References Aleph::maps(), and nodes.

◆ TEST_F() [7/21]

TEST_F ( TdRbTreeRkTest  ,
InsertSingleNode   
)

Definition at line 101 of file tdrbtreerk_test.cc.

References Aleph::maps().

◆ TEST_F() [8/21]

TEST_F ( TdRbTreeRkTest  ,
IteratorInOrder   
)

Definition at line 557 of file tdrbtreerk_test.cc.

References KEY, Aleph::maps(), and nodes.

◆ TEST_F() [9/21]

TEST_F ( TdRbTreeRkTest  ,
MoveAssignment   
)

◆ TEST_F() [10/21]

TEST_F ( TdRbTreeRkTest  ,
MoveConstructor   
)

Definition at line 381 of file tdrbtreerk_test.cc.

References Aleph::maps(), nodes, and Aleph::HTList::size().

◆ TEST_F() [11/21]

TEST_F ( TdRbTreeRkTest  ,
PositionBasic   
)

Definition at line 238 of file tdrbtreerk_test.cc.

References Aleph::maps(), and nodes.

◆ TEST_F() [12/21]

TEST_F ( TdRbTreeRkTest  ,
PositionNotFound   
)

Definition at line 256 of file tdrbtreerk_test.cc.

References Aleph::maps(), and nodes.

◆ TEST_F() [13/21]

TEST_F ( TdRbTreeRkTest  ,
RemoveAllNodes   
)

Definition at line 154 of file tdrbtreerk_test.cc.

References Aleph::maps(), and nodes.

◆ TEST_F() [14/21]

TEST_F ( TdRbTreeRkTest  ,
RemoveNode   
)

Definition at line 139 of file tdrbtreerk_test.cc.

References Aleph::maps(), nodes, and Aleph::DynList< T >::remove().

◆ TEST_F() [15/21]

TEST_F ( TdRbTreeRkTest  ,
RemovePos   
)

Definition at line 361 of file tdrbtreerk_test.cc.

References KEY, Aleph::maps(), and nodes.

◆ TEST_F() [16/21]

TEST_F ( TdRbTreeRkTest  ,
SelectAfterRemoval   
)

◆ TEST_F() [17/21]

TEST_F ( TdRbTreeRkTest  ,
SelectBasic   
)

Definition at line 177 of file tdrbtreerk_test.cc.

References KEY, Aleph::maps(), nodes, and Aleph::HTList::size().

◆ TEST_F() [18/21]

TEST_F ( TdRbTreeRkTest  ,
SelectLargeTree   
)

Definition at line 216 of file tdrbtreerk_test.cc.

References KEY, and Aleph::maps().

◆ TEST_F() [19/21]

TEST_F ( TdRbTreeRkTest  ,
SplitPosBeginning   
)

Definition at line 331 of file tdrbtreerk_test.cc.

References Aleph::maps(), nodes, and Aleph::HTList::size().

◆ TEST_F() [20/21]

TEST_F ( TdRbTreeRkTest  ,
SplitPosEnd   
)

Definition at line 344 of file tdrbtreerk_test.cc.

References Aleph::maps(), nodes, and Aleph::HTList::size().

◆ TEST_F() [21/21]

TEST_F ( TdRbTreeRkTest  ,
SplitPosMiddle   
)

Definition at line 308 of file tdrbtreerk_test.cc.

References Aleph::maps(), nodes, and Aleph::HTList::size().