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

Tests for B+ Tree (tpl_bplus_tree.H) More...

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

Go to the source code of this file.

Classes

class  BPlusTreeTest
 

Functions

 TEST_F (BPlusTreeTest, EmptyTreeReportsNoKeys)
 
 TEST_F (BPlusTreeTest, InitializerListSortsDeduplicatesAndSupportsRangeQueries)
 
 TEST_F (BPlusTreeTest, LowerAndUpperBoundCrossLeafBoundaries)
 
 TEST_F (BPlusTreeTest, LazyIteratorsTraverseLeafChain)
 
 TEST_F (BPlusTreeTest, RemoveMaintainsLeafLinksAndOrder)
 
 TEST_F (BPlusTreeTest, CopyAndMovePreserveContents)
 
 TEST_F (BPlusTreeTest, InvalidRangeThrows)
 
 TEST_F (BPlusTreeTest, RandomizedOperationsMatchStdSetOracle)
 

Detailed Description

Tests for B+ Tree (tpl_bplus_tree.H)

Definition in file bplus_tree_test.cc.

Function Documentation

◆ TEST_F() [1/8]

TEST_F ( BPlusTreeTest  ,
CopyAndMovePreserveContents   
)

◆ TEST_F() [2/8]

TEST_F ( BPlusTreeTest  ,
EmptyTreeReportsNoKeys   
)

◆ TEST_F() [3/8]

TEST_F ( BPlusTreeTest  ,
InitializerListSortsDeduplicatesAndSupportsRangeQueries   
)

◆ TEST_F() [4/8]

TEST_F ( BPlusTreeTest  ,
InvalidRangeThrows   
)

Definition at line 233 of file bplus_tree_test.cc.

References Aleph::divide_and_conquer_partition_dp().

◆ TEST_F() [5/8]

TEST_F ( BPlusTreeTest  ,
LazyIteratorsTraverseLeafChain   
)

◆ TEST_F() [6/8]

TEST_F ( BPlusTreeTest  ,
LowerAndUpperBoundCrossLeafBoundaries   
)

◆ TEST_F() [7/8]

TEST_F ( BPlusTreeTest  ,
RandomizedOperationsMatchStdSetOracle   
)

◆ TEST_F() [8/8]

TEST_F ( BPlusTreeTest  ,
RemoveMaintainsLeafLinksAndOrder   
)