|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Arrayqueue. More...
Go to the source code of this file.
Classes | |
| struct | SimpleQueue |
| struct | ComplexQueue |
Functions | |
| TEST (ArrayQueue, empty_queue) | |
| TEST (ArrayQueue, fill_and_empty_queue) | |
| TEST_F (SimpleQueue, put_and_get_stress) | |
| TEST_F (ComplexQueue, put_and_stress_capacity) | |
| TEST (ArrayQueue, Iterator_on_empty_queue) | |
| TEST (ArrayQueue, Iterator) | |
| TEST (ArrayQueue, traverse) | |
| TEST (ArrayQueue, copy_operations) | |
Variables | |
| constexpr size_t | N = 17 |
| static size_t | primes [] |
Tests for Arrayqueue.
Definition in file arrayqueue.cc.
| TEST | ( | ArrayQueue | , |
| copy_operations | |||
| ) |
Definition at line 429 of file arrayqueue.cc.
References Aleph::DynList< T >::empty(), Aleph::eq(), Aleph::HTList::is_empty(), Aleph::MemArray< T >::is_empty(), Aleph::maps(), N, Aleph::ArrayQueue< T >::put(), Aleph::HTList::size(), Aleph::MemArray< T >::size(), Aleph::ArrayQueue< T >::swap(), and GenericTraverse< Container >::traverse().
| TEST | ( | ArrayQueue | , |
| empty_queue | |||
| ) |
Definition at line 76 of file arrayqueue.cc.
References Aleph::MemArray< T >::capacity(), Aleph::ArrayQueue< T >::front(), Aleph::ArrayQueue< T >::get(), Aleph::ArrayQueue< T >::getn(), Aleph::MemArray< T >::is_empty(), Aleph::maps(), Aleph::ArrayQueue< T >::rear(), and Aleph::MemArray< T >::size().
| TEST | ( | ArrayQueue | , |
| fill_and_empty_queue | |||
| ) |
Definition at line 93 of file arrayqueue.cc.
References Aleph::MemArray< T >::capacity(), Aleph::ArrayQueue< T >::front(), Aleph::ArrayQueue< T >::get(), Aleph::MemArray< T >::is_empty(), Aleph::maps(), N, Aleph::ArrayQueue< T >::put(), Aleph::ArrayQueue< T >::rear(), and Aleph::MemArray< T >::size().
| TEST | ( | ArrayQueue | , |
| Iterator | |||
| ) |
Definition at line 338 of file arrayqueue.cc.
References Aleph::ArrayQueue< T >::get(), LocateFunctions< Container, Type >::get_it(), Aleph::MemArray< T >::is_empty(), Aleph::maps(), N, primes, Aleph::ArrayQueue< T >::put(), and Aleph::MemArray< T >::size().
| TEST | ( | ArrayQueue | , |
| Iterator_on_empty_queue | |||
| ) |
Definition at line 326 of file arrayqueue.cc.
References LocateFunctions< Container, Type >::get_it(), and Aleph::maps().
| TEST | ( | ArrayQueue | , |
| traverse | |||
| ) |
Definition at line 384 of file arrayqueue.cc.
References Aleph::ArrayQueue< T >::get(), Aleph::MemArray< T >::is_empty(), Aleph::maps(), N, primes, Aleph::ArrayQueue< T >::put(), Aleph::MemArray< T >::size(), and Aleph::ArrayQueue< T >::traverse().
| TEST_F | ( | ComplexQueue | , |
| put_and_stress_capacity | |||
| ) |
Definition at line 190 of file arrayqueue.cc.
References Aleph::DynList< T >::get(), Aleph::DynList< T >::get_first(), Aleph::DynList< T >::get_last(), l, Aleph::maps(), LocateFunctions< Container, Type >::nth(), Aleph::DynList< T >::put(), and Aleph::HTList::size().
| TEST_F | ( | SimpleQueue | , |
| put_and_get_stress | |||
| ) |
Definition at line 123 of file arrayqueue.cc.
References Aleph::maps(), and Aleph::HTList::size().
|
constexpr |
|
static |
Definition at line 336 of file arrayqueue.cc.
Referenced by demo_sieve_of_eratosthenes(), demo_transformation(), example_parallel_filter(), TEST(), and TEST().