|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Dlink. More...
Go to the source code of this file.
Classes | |
| struct | List_of_5_nodes |
Functions | |
| TEST (Dlink, Well_initialized) | |
| TEST (Dlink, Operations_with_empty_list) | |
| TEST (Dlink, Basic_operations) | |
| TEST (Dlink, Very_simple_iterator_operations) | |
| TEST_F (List_of_5_nodes, Iterator) | |
| TEST_F (List_of_5_nodes, swap) | |
| TEST_F (List_of_5_nodes, append_insert_cut_splice_concat_of_lists) | |
| TEST (Dlink, As_stack) | |
| TEST_F (List_of_5_nodes, reverse) | |
Tests for Dlink.
Definition in file dlink.cc.
| TEST | ( | Dlink | , |
| As_stack | |||
| ) |
Definition at line 434 of file dlink.cc.
References Aleph::Dlink::is_empty(), Aleph::Dlink::is_unitarian(), Aleph::Dlink::is_unitarian_or_empty(), Aleph::maps(), Aleph::Dlink::pop(), Aleph::Dlink::push(), and Aleph::Dlink::top().
| TEST | ( | Dlink | , |
| Basic_operations | |||
| ) |
Definition at line 118 of file dlink.cc.
References Aleph::DynList< T >::append(), Aleph::Dlink::del(), Aleph::DynList< T >::get_first(), Aleph::DynList< T >::get_last(), Aleph::DynList< T >::insert(), Aleph::Dlink::is_empty(), Aleph::HTList::is_empty(), Aleph::HTList::is_unitarian(), Aleph::HTList::is_unitarian_or_empty(), l, Aleph::maps(), Aleph::DynList< T >::remove_first(), and Aleph::HTList::reverse_list().
| TEST | ( | Dlink | , |
| Operations_with_empty_list | |||
| ) |
Definition at line 54 of file dlink.cc.
References Aleph::HTList::is_empty(), l, Aleph::maps(), and Aleph::DynList< T >::swap().
| TEST | ( | Dlink | , |
| Very_simple_iterator_operations | |||
| ) |
Definition at line 208 of file dlink.cc.
References Aleph::Dlink::Iterator::get_curr(), Aleph::Dlink::Iterator::has_curr(), Aleph::Dlink::Iterator::is_in_first(), Aleph::Dlink::Iterator::is_last(), l, Aleph::maps(), Aleph::Dlink::Iterator::reset_first(), and Aleph::Dlink::Iterator::reset_last().
| TEST | ( | Dlink | , |
| Well_initialized | |||
| ) |
Definition at line 46 of file dlink.cc.
References Aleph::HTList::is_empty(), l, and Aleph::maps().
| TEST_F | ( | List_of_5_nodes | , |
| append_insert_cut_splice_concat_of_lists | |||
| ) |
Definition at line 348 of file dlink.cc.
References Aleph::DynList< T >::append(), Aleph::Dlink::append_list(), Aleph::HTList::cut_list(), Aleph::DynList< T >::get_first(), Aleph::Dlink::get_first(), Aleph::DynList< T >::get_last(), Aleph::Dlink::get_last(), Aleph::Dlink::insert(), Aleph::HTList::is_empty(), Aleph::HTList::is_unitarian(), l, Aleph::maps(), Aleph::DynList< T >::remove_first(), and Aleph::HTList::split_list().
| TEST_F | ( | List_of_5_nodes | , |
| Iterator | |||
| ) |
Definition at line 244 of file dlink.cc.
References Aleph::Dlink::Iterator::del(), Aleph::Dlink::Iterator::get_curr(), Aleph::Dlink::Iterator::has_curr(), Aleph::Dlink::Iterator::is_in_first(), Aleph::Dlink::Iterator::is_in_last(), Aleph::Dlink::Iterator::is_last(), Aleph::maps(), Aleph::Dlink::Iterator::next(), Aleph::Dlink::Iterator::prev(), Aleph::Dlink::Iterator::reset_first(), and Aleph::Dlink::Iterator::reset_last().
| TEST_F | ( | List_of_5_nodes | , |
| reverse | |||
| ) |
Definition at line 462 of file dlink.cc.
References Aleph::maps().
| TEST_F | ( | List_of_5_nodes | , |
| swap | |||
| ) |
Definition at line 330 of file dlink.cc.
References Aleph::DynList< T >::get_first(), Aleph::DynList< T >::get_last(), Aleph::HTList::is_empty(), Aleph::maps(), and Aleph::DynList< T >::swap().