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

Tests for Bin Node Xt. More...

#include <algorithm>
#include <random>
#include <set>
#include <stdexcept>
#include <vector>
#include <gtest/gtest.h>
#include <tpl_binNodeXt.H>
#include <tpl_binNodeUtils.H>
Include dependency graph for bin-node-xt.cc:

Go to the source code of this file.

Functions

 TEST (BinNodeXt, SplitKeyRecXtSplitsAndEmptiesRootWhenKeyAbsent)
 
 TEST (BinNodeXt, SplitKeyRecXtReturnsFalseWhenKeyPresentAndDoesNotCorrupt)
 
 TEST (BinNodeXt, SplitKeyDupRecXtSplitsAndEmptiesRoot)
 
 TEST (BinNodeXt, InsertRootXtMakesInsertedNodeRoot)
 
 TEST (BinNodeXt, InsertDupRootXtAllowsDuplicatesAndBecomesRoot)
 
 TEST (BinNodeXt, InsertByPosXtMaintainsRankButMayBreakBst)
 
 TEST (BinNodeXt, SearchOrInsertRootRecXtUsagePattern)
 
 TEST (BinNodeXt, ComparatorGreaterInsertFindRemove)
 
 TEST (BinNodeXt, OutOfRangeExceptions)
 
 TEST (BinNodeXt, SentinelCountIsZero)
 
 TEST (BinNodeXt, InsertByKeyMaintainsCountsAndBst)
 
 TEST (BinNodeXt, InsertRejectsDuplicates)
 
 TEST (BinNodeXt, InsertDupAllowsDuplicatesAndCounts)
 
 TEST (BinNodeXt, SearchOrInsertByKeyReturnsExistingOrInserted)
 
 TEST (BinNodeXt, SelectRecAndSelectNeAndSelectParent)
 
 TEST (BinNodeXt, InorderPositionReturnsRankOrMinusOne)
 
 TEST (BinNodeXt, FindPositionContract)
 
 TEST (BinNodeXt, SplitPosRecAndJoinExclusiveRoundtrip)
 
 TEST (BinNodeXt, RemoveByPosAndRemoveByKey)
 
 TEST (BinNodeXt, RotationsMaintainRankInvariant)
 
 TEST (BinNodeXt, Property_RandomInsertRemove_CountsAndOrder)
 

Detailed Description

Tests for Bin Node Xt.

Definition in file bin-node-xt.cc.

Function Documentation

◆ TEST() [1/21]

TEST ( BinNodeXt  ,
ComparatorGreaterInsertFindRemove   
)

◆ TEST() [2/21]

TEST ( BinNodeXt  ,
FindPositionContract   
)

◆ TEST() [3/21]

TEST ( BinNodeXt  ,
InorderPositionReturnsRankOrMinusOne   
)

◆ TEST() [4/21]

TEST ( BinNodeXt  ,
InsertByKeyMaintainsCountsAndBst   
)

◆ TEST() [5/21]

TEST ( BinNodeXt  ,
InsertByPosXtMaintainsRankButMayBreakBst   
)

◆ TEST() [6/21]

TEST ( BinNodeXt  ,
InsertDupAllowsDuplicatesAndCounts   
)

◆ TEST() [7/21]

TEST ( BinNodeXt  ,
InsertDupRootXtAllowsDuplicatesAndBecomesRoot   
)

◆ TEST() [8/21]

TEST ( BinNodeXt  ,
InsertRejectsDuplicates   
)

◆ TEST() [9/21]

TEST ( BinNodeXt  ,
InsertRootXtMakesInsertedNodeRoot   
)

◆ TEST() [10/21]

◆ TEST() [11/21]

TEST ( BinNodeXt  ,
Property_RandomInsertRemove_CountsAndOrder   
)

◆ TEST() [12/21]

◆ TEST() [13/21]

TEST ( BinNodeXt  ,
RotationsMaintainRankInvariant   
)

◆ TEST() [14/21]

TEST ( BinNodeXt  ,
SearchOrInsertByKeyReturnsExistingOrInserted   
)

◆ TEST() [15/21]

TEST ( BinNodeXt  ,
SearchOrInsertRootRecXtUsagePattern   
)

◆ TEST() [16/21]

TEST ( BinNodeXt  ,
SelectRecAndSelectNeAndSelectParent   
)

◆ TEST() [17/21]

TEST ( BinNodeXt  ,
SentinelCountIsZero   
)

Definition at line 299 of file bin-node-xt.cc.

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

◆ TEST() [18/21]

TEST ( BinNodeXt  ,
SplitKeyDupRecXtSplitsAndEmptiesRoot   
)

◆ TEST() [19/21]

TEST ( BinNodeXt  ,
SplitKeyRecXtReturnsFalseWhenKeyPresentAndDoesNotCorrupt   
)

◆ TEST() [20/21]

TEST ( BinNodeXt  ,
SplitKeyRecXtSplitsAndEmptiesRootWhenKeyAbsent   
)

◆ TEST() [21/21]

TEST ( BinNodeXt  ,
SplitPosRecAndJoinExclusiveRoundtrip   
)