|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Dynarrayheap. More...
#include <gtest/gtest.h>#include <tpl_dynArrayHeap.H>#include <algorithm>#include <cstdint>#include <queue>#include <random>#include <stdexcept>#include <vector>Go to the source code of this file.
Functions | |
| TEST (DynArrayHeapBasics, EmptyAndSize) | |
| TEST (DynArrayHeapBasics, TopAndGetMinThrowOnEmpty) | |
| TEST (DynArrayHeapBasics, InsertAndExtractInOrder) | |
| TEST (DynArrayHeapBasics, ReserveRejectsShrinkingBelowSize) | |
| TEST (DynArrayHeapBasics, InsertDirectBehavesLikeInsert) | |
| TEST (DynArrayHeapBasics, PutAndAppendAliasesWork) | |
| TEST (DynArrayHeapCompare, GreaterMakesMaxHeap) | |
| TEST (DynArrayHeapIterator, TraverseVisitsAllElements) | |
| TEST (DynArrayHeapIterator, TraverseStopsEarly) | |
| TEST (DynArrayHeapRandomized, MatchesStdPriorityQueueMinHeap) | |
Tests for Dynarrayheap.
Definition in file dynarrayheap.cc.
| TEST | ( | DynArrayHeapBasics | , |
| EmptyAndSize | |||
| ) |
Definition at line 70 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::is_empty(), Aleph::maps(), and Aleph::DynArrayHeap< T, Compare >::size().
| TEST | ( | DynArrayHeapBasics | , |
| InsertAndExtractInOrder | |||
| ) |
Definition at line 85 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::get(), Aleph::DynArrayHeap< T, Compare >::getMax(), Aleph::DynArrayHeap< T, Compare >::getMin(), Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::DynArrayHeap< T, Compare >::is_empty(), Aleph::maps(), Aleph::DynArrayHeap< T, Compare >::size(), and Aleph::DynArrayHeap< T, Compare >::top().
| TEST | ( | DynArrayHeapBasics | , |
| InsertDirectBehavesLikeInsert | |||
| ) |
Definition at line 111 of file dynarrayheap.cc.
References StlAlephIterator< SetName >::begin(), StlAlephIterator< SetName >::end(), Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::DynArrayHeap< T, Compare >::insert_direct(), Aleph::maps(), Aleph::DynArrayHeap< T, Compare >::reserve(), and Aleph::DynArrayHeap< T, Compare >::top().
| TEST | ( | DynArrayHeapBasics | , |
| PutAndAppendAliasesWork | |||
| ) |
Definition at line 124 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::append(), Aleph::maps(), Aleph::DynArrayHeap< T, Compare >::put(), and Aleph::DynArrayHeap< T, Compare >::top().
| TEST | ( | DynArrayHeapBasics | , |
| ReserveRejectsShrinkingBelowSize | |||
| ) |
Definition at line 103 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::maps(), and Aleph::DynArrayHeap< T, Compare >::reserve().
| TEST | ( | DynArrayHeapBasics | , |
| TopAndGetMinThrowOnEmpty | |||
| ) |
Definition at line 77 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::getMin(), Aleph::maps(), and Aleph::DynArrayHeap< T, Compare >::top().
| TEST | ( | DynArrayHeapCompare | , |
| GreaterMakesMaxHeap | |||
| ) |
Definition at line 133 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::getMin(), Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::maps(), and Aleph::DynArrayHeap< T, Compare >::top().
| TEST | ( | DynArrayHeapIterator | , |
| TraverseStopsEarly | |||
| ) |
Definition at line 167 of file dynarrayheap.cc.
References Aleph::count(), Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::maps(), and Aleph::DynArrayHeap< T, Compare >::traverse().
| TEST | ( | DynArrayHeapIterator | , |
| TraverseVisitsAllElements | |||
| ) |
Definition at line 145 of file dynarrayheap.cc.
References Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::maps(), Aleph::HTList::size(), and Aleph::DynArrayHeap< T, Compare >::traverse().
| TEST | ( | DynArrayHeapRandomized | , |
| MatchesStdPriorityQueueMinHeap | |||
| ) |
Definition at line 189 of file dynarrayheap.cc.
References Aleph::DynList< T >::empty(), Aleph::DynArrayHeap< T, Compare >::getMin(), Aleph::DynArrayHeap< T, Compare >::insert(), Aleph::DynArrayHeap< T, Compare >::is_empty(), Aleph::maps(), Aleph::DynList< T >::pop(), Aleph::DynList< T >::push(), rng, Aleph::HTList::size(), Aleph::DynArrayHeap< T, Compare >::size(), Aleph::DynArrayHeap< T, Compare >::top(), and Aleph::DynList< T >::top().