|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Comprehensive test suite for QuadTree spatial data structure. More...
#include <gtest/gtest.h>#include <quadtree.H>#include <random>#include <algorithm>#include <unordered_set>#include <sstream>Go to the source code of this file.
Functions | |
| TEST (QuadTreeBasic, ConstructorAndEmpty) | |
| TEST (QuadTreeBasic, InsertSinglePoint) | |
| TEST (QuadTreeBasic, InsertOutsideBounds) | |
| TEST (QuadTreeBasic, ContainsCheck) | |
| TEST (QuadTreeBasic, SearchExistingPoint) | |
| TEST (QuadTreeBasic, SearchNonExistingPoint) | |
| TEST (QuadTreeBasic, SearchContainerNode) | |
| TEST (QuadTreeBasic, RemoveSinglePoint) | |
| TEST (QuadTreeBasic, RemoveNonExistingPoint) | |
| TEST (QuadTreeBasic, EmptyTree) | |
| TEST (QuadTreeSubdivision, SingleLevelSplit) | |
| TEST (QuadTreeSubdivision, MultiLevelSplit) | |
| TEST (QuadTreeSubdivision, AllQuadrantsPopulated) | |
| TEST (QuadTreeMerging, RemovalTriggersJoin) | |
| TEST (QuadTreeMerging, MultipleRemovalsGradualJoin) | |
| TEST (QuadTreeCopy, CopyConstructor) | |
| TEST (QuadTreeCopy, AssignmentOperator) | |
| TEST (QuadTreeCopy, SelfAssignment) | |
| TEST (QuadTreeStress, InsertManyPoints) | |
| TEST (QuadTreeStress, InsertRemoveCycles) | |
| TEST (QuadTreeStress, DenseRegion) | |
| TEST (QuadTreeEdgeCases, BoundaryPoints) | |
| TEST (QuadTreeEdgeCases, MidpointCoordinates) | |
| TEST (QuadTreeEdgeCases, SinglePointCapacity) | |
| TEST (QuadTreeEdgeCases, VerySmallRegion) | |
| TEST (QuadTreeEdgeCases, VeryLargeRegion) | |
| TEST (QuadTreeTraversal, ForEachNode) | |
| TEST (QuadTreeTraversal, CountLeaves) | |
| TEST (QuadTreeFuzz, RandomOperations) | |
| int | main (int argc, char **argv) |
Comprehensive test suite for QuadTree spatial data structure.
Definition in file quadtree_test.cc.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 594 of file quadtree_test.cc.
References Aleph::maps().
| TEST | ( | QuadTreeBasic | , |
| ConstructorAndEmpty | |||
| ) |
Definition at line 50 of file quadtree_test.cc.
References QuadTree::get_max_num_points_per_node(), QuadTree::get_root(), and Aleph::maps().
| TEST | ( | QuadTreeBasic | , |
| ContainsCheck | |||
| ) |
Definition at line 84 of file quadtree_test.cc.
References QuadTree::contains(), QuadTree::insert(), and Aleph::maps().
| TEST | ( | QuadTreeBasic | , |
| EmptyTree | |||
| ) |
Definition at line 163 of file quadtree_test.cc.
References QuadTree::empty(), QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeBasic | , |
| InsertOutsideBounds | |||
| ) |
Definition at line 69 of file quadtree_test.cc.
References QuadTree::insert(), and Aleph::maps().
| TEST | ( | QuadTreeBasic | , |
| InsertSinglePoint | |||
| ) |
Definition at line 58 of file quadtree_test.cc.
References QuadTree::insert(), and Aleph::maps().
| TEST | ( | QuadTreeBasic | , |
| RemoveNonExistingPoint | |||
| ) |
Definition at line 151 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), QuadTree::remove(), and QuadTree::search().
| TEST | ( | QuadTreeBasic | , |
| RemoveSinglePoint | |||
| ) |
Definition at line 140 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), QuadTree::remove(), and QuadTree::search().
| TEST | ( | QuadTreeBasic | , |
| SearchContainerNode | |||
| ) |
Definition at line 127 of file quadtree_test.cc.
References QuadTree::insert(), QuadNode::is_leaf(), Aleph::maps(), QuadTree::search_container_node(), and QuadNode::search_point().
| TEST | ( | QuadTreeBasic | , |
| SearchExistingPoint | |||
| ) |
Definition at line 98 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeBasic | , |
| SearchNonExistingPoint | |||
| ) |
Definition at line 116 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeCopy | , |
| AssignmentOperator | |||
| ) |
Definition at line 320 of file quadtree_test.cc.
References Aleph::DynList< T >::insert(), and Aleph::maps().
| TEST | ( | QuadTreeCopy | , |
| CopyConstructor | |||
| ) |
Definition at line 300 of file quadtree_test.cc.
References Aleph::DynList< T >::insert(), and Aleph::maps().
| TEST | ( | QuadTreeCopy | , |
| SelfAssignment | |||
| ) |
Definition at line 340 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeEdgeCases | , |
| BoundaryPoints | |||
| ) |
Definition at line 441 of file quadtree_test.cc.
References QuadTree::insert(), and Aleph::maps().
| TEST | ( | QuadTreeEdgeCases | , |
| MidpointCoordinates | |||
| ) |
Definition at line 457 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeEdgeCases | , |
| SinglePointCapacity | |||
| ) |
Definition at line 471 of file quadtree_test.cc.
References QuadTree::get_root(), QuadTree::insert(), QuadNode::is_leaf(), and Aleph::maps().
| TEST | ( | QuadTreeEdgeCases | , |
| VeryLargeRegion | |||
| ) |
Definition at line 493 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeEdgeCases | , |
| VerySmallRegion | |||
| ) |
Definition at line 482 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeFuzz | , |
| RandomOperations | |||
| ) |
Definition at line 550 of file quadtree_test.cc.
References StlAlephIterator< SetName >::begin(), Aleph::DynList< T >::empty(), QuadTree::insert(), Aleph::maps(), QuadTree::remove(), QuadTree::search(), and Aleph::HTList::size().
| TEST | ( | QuadTreeMerging | , |
| MultipleRemovalsGradualJoin | |||
| ) |
Definition at line 269 of file quadtree_test.cc.
References COLOR, QuadTree::get_root(), QuadTree::insert(), QuadNode::is_leaf(), Aleph::maps(), and QuadTree::remove().
| TEST | ( | QuadTreeMerging | , |
| RemovalTriggersJoin | |||
| ) |
Definition at line 250 of file quadtree_test.cc.
References QuadTree::get_root(), QuadTree::insert(), QuadNode::is_leaf(), Aleph::maps(), and QuadTree::remove().
| TEST | ( | QuadTreeStress | , |
| DenseRegion | |||
| ) |
Definition at line 414 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), QuadTree::search(), and y.
| TEST | ( | QuadTreeStress | , |
| InsertManyPoints | |||
| ) |
Definition at line 355 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), and QuadTree::search().
| TEST | ( | QuadTreeStress | , |
| InsertRemoveCycles | |||
| ) |
Definition at line 380 of file quadtree_test.cc.
References QuadTree::insert(), Aleph::maps(), QuadTree::remove(), and test().
| TEST | ( | QuadTreeSubdivision | , |
| AllQuadrantsPopulated | |||
| ) |
Definition at line 225 of file quadtree_test.cc.
References QuadTree::get_root(), QuadTree::insert(), Aleph::is_leaf(), Aleph::maps(), NE_CHILD, NW_CHILD, root(), SE_CHILD, and SW_CHILD.
| TEST | ( | QuadTreeSubdivision | , |
| MultiLevelSplit | |||
| ) |
Definition at line 200 of file quadtree_test.cc.
References QuadTree::get_root(), QuadTree::insert(), QuadNode::is_leaf(), Aleph::maps(), NE_CHILD, and NW_CHILD.
| TEST | ( | QuadTreeSubdivision | , |
| SingleLevelSplit | |||
| ) |
Definition at line 182 of file quadtree_test.cc.
References COLOR, QuadTree::get_root(), QuadTree::insert(), QuadNode::is_leaf(), and Aleph::maps().
| TEST | ( | QuadTreeTraversal | , |
| CountLeaves | |||
| ) |
Definition at line 528 of file quadtree_test.cc.
References QuadTree::for_each(), QuadTree::insert(), QuadNode::is_leaf(), and Aleph::maps().
| TEST | ( | QuadTreeTraversal | , |
| ForEachNode | |||
| ) |
Definition at line 510 of file quadtree_test.cc.
References QuadTree::for_each(), QuadTree::insert(), and Aleph::maps().