|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Memarray. More...
Go to the source code of this file.
Classes | |
| struct | Default_MemArray |
| struct | MemArray_with_30_items |
Functions | |
| bool | is_power_of_two (size_t x) |
| TEST (MemArray, Basic_initialization) | |
| TEST_F (Default_MemArray, growing_in_2_powers) | |
| TEST_F (Default_MemArray, putn) | |
| TEST (MemArrayMoveOnly, AppendAndRemoveUniquePtr) | |
| TEST_F (Default_MemArray, access_operator) | |
| TEST_F (Default_MemArray, reserve) | |
| TEST_F (MemArray_with_30_items, copy_and_assigment) | |
| TEST (MemArray, zero_capacity) | |
| TEST (MemArray, insertion_with_rvalues) | |
| TEST (MemArray, remove_with_rvalues) | |
| TEST_F (Default_MemArray, contraction) | |
| TEST_F (Default_MemArray, remove_on_empty) | |
| TEST (MemArray, as_stack) | |
| TEST (MemArray, Iterator_on_empty_container) | |
| TEST_F (Default_MemArray, Iterator) | |
| TEST (MemArray, traverse_on_empty_container) | |
| TEST_F (Default_MemArray, clear) | |
| TEST_F (Default_MemArray, traverse) | |
Tests for Memarray.
Definition in file memarray.cc.
| bool is_power_of_two | ( | size_t | x | ) |
Definition at line 48 of file memarray.cc.
Referenced by TEST().
| TEST | ( | MemArray | , |
| as_stack | |||
| ) |
Definition at line 470 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), m, and OhashCommon< HashTbl, Key >::size().
| TEST | ( | MemArray | , |
| Basic_initialization | |||
| ) |
Definition at line 69 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), and is_power_of_two().
| TEST | ( | MemArray | , |
| insertion_with_rvalues | |||
| ) |
Definition at line 386 of file memarray.cc.
References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), LocateFunctions< Container, Type >::get_it(), OhashCommon< HashTbl, Key >::insert(), OhashCommon< HashTbl, Key >::is_empty(), Aleph::HTList::is_empty(), k, l, m, N, and OhashCommon< HashTbl, Key >::size().
| TEST | ( | MemArray | , |
| Iterator_on_empty_container | |||
| ) |
Definition at line 488 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::Array_Iterator< T >::get_curr(), Aleph::Array_Iterator< T >::has_curr(), Aleph::Array_Iterator< T >::next(), Aleph::Array_Iterator< T >::prev(), Aleph::Array_Iterator< T >::reset(), and Aleph::Array_Iterator< T >::reset_last().
| TEST | ( | MemArray | , |
| remove_with_rvalues | |||
| ) |
Definition at line 414 of file memarray.cc.
References OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), LocateFunctions< Container, Type >::get_it(), OhashCommon< HashTbl, Key >::insert(), Aleph::DynList< T >::insert(), Aleph::HTList::is_empty(), k, l, m, and N.
| TEST | ( | MemArray | , |
| traverse_on_empty_container | |||
| ) |
Definition at line 521 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), m, and GenericTraverse< Container >::traverse().
| TEST | ( | MemArray | , |
| zero_capacity | |||
| ) |
Definition at line 377 of file memarray.cc.
References OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), m, and OhashCommon< HashTbl, Key >::size().
| TEST | ( | MemArrayMoveOnly | , |
| AppendAndRemoveUniquePtr | |||
| ) |
Definition at line 215 of file memarray.cc.
References OhashCommon< HashTbl, Key >::append(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), m, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| access_operator | |||
| ) |
Definition at line 238 of file memarray.cc.
References OhashCommon< HashTbl, Key >::append(), OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), k, m, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| clear | |||
| ) |
| TEST_F | ( | Default_MemArray | , |
| contraction | |||
| ) |
Definition at line 442 of file memarray.cc.
References Aleph::and, OhashCommon< HashTbl, Key >::append(), OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), m, N, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| growing_in_2_powers | |||
| ) |
Definition at line 134 of file memarray.cc.
References OhashCommon< HashTbl, Key >::append(), OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::insert(), k, m, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| Iterator | |||
| ) |
Definition at line 508 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::Array_Iterator< T >::get_curr(), Aleph::Array_Iterator< T >::has_curr(), m, Aleph::Array_Iterator< T >::prev(), and Aleph::Array_Iterator< T >::reset_last().
| TEST_F | ( | Default_MemArray | , |
| putn | |||
| ) |
Definition at line 175 of file memarray.cc.
References OhashCommon< HashTbl, Key >::capacity(), dim(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), k, m, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| remove_on_empty | |||
| ) |
Definition at line 462 of file memarray.cc.
References Aleph::divide_and_conquer_partition_dp(), and m.
| TEST_F | ( | Default_MemArray | , |
| reserve | |||
| ) |
Definition at line 289 of file memarray.cc.
References OhashCommon< HashTbl, Key >::capacity(), Aleph::divide_and_conquer_partition_dp(), OhashCommon< HashTbl, Key >::is_empty(), m, and OhashCommon< HashTbl, Key >::size().
| TEST_F | ( | Default_MemArray | , |
| traverse | |||
| ) |
Definition at line 572 of file memarray.cc.
References OhashCommon< HashTbl, Key >::append(), Aleph::divide_and_conquer_partition_dp(), m, N, OhashCommon< HashTbl, Key >::size(), and GenericTraverse< Container >::traverse().
| TEST_F | ( | MemArray_with_30_items | , |
| copy_and_assigment | |||
| ) |
Definition at line 300 of file memarray.cc.
References OhashCommon< HashTbl, Key >::capacity(), Aleph::MemArray< T >::capacity(), Aleph::divide_and_conquer_partition_dp(), Aleph::MemArray< T >::get_ptr(), OhashCommon< HashTbl, Key >::is_empty(), Aleph::MemArray< T >::is_empty(), k, m, OhashCommon< HashTbl, Key >::size(), Aleph::MemArray< T >::size(), and Aleph::ODhashTable< Key, Cmp >::swap().