|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
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>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) | |
Tests for B+ Tree (tpl_bplus_tree.H)
Definition in file bplus_tree_test.cc.
| TEST_F | ( | BPlusTreeTest | , |
| CopyAndMovePreserveContents | |||
| ) |
Definition at line 210 of file bplus_tree_test.cc.
References Aleph::copy(), Aleph::divide_and_conquer_partition_dp(), and Aleph::to_vector().
| TEST_F | ( | BPlusTreeTest | , |
| EmptyTreeReportsNoKeys | |||
| ) |
Definition at line 118 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::empty(), and Aleph::to_vector().
| TEST_F | ( | BPlusTreeTest | , |
| InitializerListSortsDeduplicatesAndSupportsRangeQueries | |||
| ) |
Definition at line 135 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::to_vector().
| TEST_F | ( | BPlusTreeTest | , |
| InvalidRangeThrows | |||
| ) |
Definition at line 233 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | BPlusTreeTest | , |
| LazyIteratorsTraverseLeafChain | |||
| ) |
Definition at line 163 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::insert().
| TEST_F | ( | BPlusTreeTest | , |
| LowerAndUpperBoundCrossLeafBoundaries | |||
| ) |
Definition at line 145 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), and Aleph::to_vector().
| TEST_F | ( | BPlusTreeTest | , |
| RandomizedOperationsMatchStdSetOracle | |||
| ) |
Definition at line 239 of file bplus_tree_test.cc.
References QuadTree::contains(), Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), QuadTree::remove(), rng, and Aleph::to_vector().
| TEST_F | ( | BPlusTreeTest | , |
| RemoveMaintainsLeafLinksAndOrder | |||
| ) |
Definition at line 187 of file bplus_tree_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), QuadTree::remove(), and Aleph::to_vector().