|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Treap (tpl_treap.H) More...
#include <algorithm>#include <random>#include <set>#include <vector>#include <gtest/gtest.h>#include <tpl_treap.H>Go to the source code of this file.
Classes | |
| class | TreapTest |
Functions | |
| TEST_F (TreapTest, EmptyTreeIsEmpty) | |
| TEST_F (TreapTest, InsertIncreasesSize) | |
| TEST_F (TreapTest, SearchFindsInsertedKeys) | |
| TEST_F (TreapTest, RemoveDecreasesSize) | |
| TEST_F (TreapTest, RemoveNonExistentReturnsNull) | |
| TEST_F (TreapTest, SingleInsertMaintainsTreapProperties) | |
| TEST_F (TreapTest, MultipleInsertsMaintainTreapProperties) | |
| TEST_F (TreapTest, SequentialInsertsMaintainTreapProperties) | |
| TEST_F (TreapTest, ReverseInsertsMaintainTreapProperties) | |
| TEST_F (TreapTest, RemoveMaintainsTreapProperties) | |
| TEST_F (TreapTest, InorderTraversalIsSorted) | |
| TEST_F (TreapTest, MinAndMaxFromInorder) | |
| TEST_F (TreapTest, PrioritiesAreAssigned) | |
| TEST_F (TreapTest, HeapPropertyOnPriorities) | |
| TEST_F (TreapTest, SameSeedProducesSameStructure) | |
| TEST_F (TreapTest, RandomInsertsMaintainTreapProperties) | |
| TEST_F (TreapTest, RandomInsertsAndRemovesMaintainTreapProperties) | |
| TEST_F (TreapTest, LargeSequentialInserts) | |
| int | main (int argc, char **argv) |
Tests for Treap (tpl_treap.H)
Tests the Treap (randomized BST) implementation including:
Definition in file treap_test.cc.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 452 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | TreapTest | , |
| EmptyTreeIsEmpty | |||
| ) |
Definition at line 199 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | TreapTest | , |
| HeapPropertyOnPriorities | |||
| ) |
Definition at line 336 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and root().
| TEST_F | ( | TreapTest | , |
| InorderTraversalIsSorted | |||
| ) |
Definition at line 301 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), inorder_keys(), and keys.
| TEST_F | ( | TreapTest | , |
| InsertIncreasesSize | |||
| ) |
Definition at line 204 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::insert().
| TEST_F | ( | TreapTest | , |
| LargeSequentialInserts | |||
| ) |
Definition at line 434 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), and QuadTree::search().
| TEST_F | ( | TreapTest | , |
| MinAndMaxFromInorder | |||
| ) |
Definition at line 311 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), inorder_keys(), and keys.
| TEST_F | ( | TreapTest | , |
| MultipleInsertsMaintainTreapProperties | |||
| ) |
Definition at line 261 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | TreapTest | , |
| PrioritiesAreAssigned | |||
| ) |
Definition at line 325 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), and root().
| TEST_F | ( | TreapTest | , |
| RandomInsertsAndRemovesMaintainTreapProperties | |||
| ) |
Definition at line 399 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), QuadTree::remove(), and rng.
| TEST_F | ( | TreapTest | , |
| RandomInsertsMaintainTreapProperties | |||
| ) |
Definition at line 382 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), and rng.
| TEST_F | ( | TreapTest | , |
| RemoveDecreasesSize | |||
| ) |
Definition at line 228 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::remove(), and QuadTree::search().
| TEST_F | ( | TreapTest | , |
| RemoveMaintainsTreapProperties | |||
| ) |
Definition at line 285 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::remove().
| TEST_F | ( | TreapTest | , |
| RemoveNonExistentReturnsNull | |||
| ) |
Definition at line 242 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::remove().
| TEST_F | ( | TreapTest | , |
| ReverseInsertsMaintainTreapProperties | |||
| ) |
Definition at line 276 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::insert().
| TEST_F | ( | TreapTest | , |
| SameSeedProducesSameStructure | |||
| ) |
Definition at line 348 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), inorder_keys(), QuadTree::insert(), and Aleph::PRIO().
| TEST_F | ( | TreapTest | , |
| SearchFindsInsertedKeys | |||
| ) |
Definition at line 215 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::search().
| TEST_F | ( | TreapTest | , |
| SequentialInsertsMaintainTreapProperties | |||
| ) |
Definition at line 267 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::insert().
| TEST_F | ( | TreapTest | , |
| SingleInsertMaintainsTreapProperties | |||
| ) |
Definition at line 255 of file treap_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and QuadTree::insert().