|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Aleph::RStarTree (R*-tree heuristics). More...
#include <gtest/gtest.h>#include <algorithm>#include <memory>#include <random>#include <utility>#include <ahSort.H>#include <tpl_r_star_tree.H>#include "r_tree_debug_snapshot_test_helpers.H"Go to the source code of this file.
Functions | |
| TEST (RStarTree, EmptyTree) | |
| TEST (RStarTree, SingletonAndErase) | |
| TEST (RStarTree, ForcedReinsertionKeepsTreeValid) | |
| TEST (RStarTree, DebugSnapshotStructuralInvariants) | |
| TEST (RStarTree, CoincidentRectangles) | |
| TEST (RStarTree, DegenerateRectangles) | |
| TEST (RStarTree, CopyAndMove) | |
| TEST (RStarTree, SupportsMoveOnlyPayload) | |
| TEST (RStarTree, AssignmentClearAndDrainRemainValid) | |
| TEST (RStarTree, RandomizedParityDefaultFanout) | |
| TEST (RStarTree, RandomizedParitySmallFanout) | |
Tests for Aleph::RStarTree (R*-tree heuristics).
Definition in file r_star_tree_test.cc.
| TEST | ( | RStarTree | , |
| AssignmentClearAndDrainRemainValid | |||
| ) |
Definition at line 288 of file r_star_tree_test.cc.
References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::clear(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::is_empty(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| CoincidentRectangles | |||
| ) |
Definition at line 218 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), box(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::erase(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| CopyAndMove | |||
| ) |
Definition at line 247 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::copy(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert().
| TEST | ( | RStarTree | , |
| DebugSnapshotStructuralInvariants | |||
| ) |
Definition at line 206 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::test_helpers::check_snapshot_node(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::debug_snapshot(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size().
| TEST | ( | RStarTree | , |
| DegenerateRectangles | |||
| ) |
Definition at line 232 of file r_star_tree_test.cc.
References StlAlephIterator< SetName >::begin(), Aleph::blossom_maximum_cardinality_matching(), StlAlephIterator< SetName >::end(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| EmptyTree | |||
| ) |
Definition at line 162 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::erase(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::height(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::is_empty(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| ForcedReinsertionKeepsTreeValid | |||
| ) |
Definition at line 184 of file r_star_tree_test.cc.
References StlAlephIterator< SetName >::begin(), Aleph::blossom_maximum_cardinality_matching(), StlAlephIterator< SetName >::end(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::height(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| RandomizedParityDefaultFanout | |||
| ) |
Definition at line 333 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching().
| TEST | ( | RStarTree | , |
| RandomizedParitySmallFanout | |||
| ) |
Definition at line 338 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching().
| TEST | ( | RStarTree | , |
| SingletonAndErase | |||
| ) |
Definition at line 172 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::erase(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::height(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::is_empty(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().
| TEST | ( | RStarTree | , |
| SupportsMoveOnlyPayload | |||
| ) |
Definition at line 274 of file r_star_tree_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_intersecting(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::size(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify().