|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Htlist. More...
Go to the source code of this file.
Classes | |
| struct | List_of_25_nodes |
Functions | |
| TEST (HTList, Basic_operations) | |
| TEST (HTList, Simple_append_and_insert_of_list) | |
| TEST_F (List_of_25_nodes, Basic_operations) | |
| TEST (HTList, Iterator_on_empty_list) | |
| TEST_F (List_of_25_nodes, Iterator_operations) | |
| TEST_F (List_of_25_nodes, Split_and_concat) | |
| TEST_F (List_of_25_nodes, swap) | |
| TEST_F (List_of_25_nodes, cut_and_concat) | |
| TEST_F (List_of_25_nodes, reverse) | |
| TEST_F (List_of_25_nodes, rotate_left) | |
| TEST (HTList, As_stack) | |
Tests for Htlist.
Definition in file htlist.cc.
| TEST | ( | HTList | , |
| As_stack | |||
| ) |
Definition at line 305 of file htlist.cc.
References Aleph::HTList::is_empty(), Aleph::HTList::is_unitarian(), Aleph::HTList::is_unitarian_or_empty(), Aleph::maps(), Aleph::HTList::pop(), Aleph::HTList::push(), and Aleph::HTList::top().
| TEST | ( | HTList | , |
| Basic_operations | |||
| ) |
Definition at line 60 of file htlist.cc.
References Aleph::HTList::append(), Aleph::Snodenc< T >::get_data(), Aleph::HTList::get_first(), Aleph::HTList::get_head(), Aleph::HTList::get_last(), Aleph::HTList::get_tail(), Aleph::HTList::insert(), Aleph::HTList::is_empty(), Aleph::HTList::is_unitarian(), Aleph::HTList::is_unitarian_or_empty(), Aleph::maps(), Aleph::HTList::remove_first(), Aleph::HTList::rotate_left(), Aleph::HTList::size(), Aleph::Slinknc::to_data(), and Aleph::Slinknc::to_snodenc().
| TEST | ( | HTList | , |
| Iterator_on_empty_list | |||
| ) |
Definition at line 165 of file htlist.cc.
References Aleph::HTList::Iterator::get_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::HTList::Iterator::is_in_first(), Aleph::HTList::Iterator::is_in_last(), Aleph::HTList::Iterator::is_last(), l, Aleph::maps(), and Aleph::HTList::Iterator::reset_first().
| TEST | ( | HTList | , |
| Simple_append_and_insert_of_list | |||
| ) |
Definition at line 134 of file htlist.cc.
References Aleph::HTList::append(), Aleph::HTList::get_first(), Aleph::HTList::get_last(), Aleph::DynList< T >::insert(), Aleph::HTList::insert(), Aleph::HTList::is_empty(), Aleph::HTList::is_unitarian(), Aleph::maps(), Aleph::HTList::remove_all_and_delete(), Aleph::HTList::size(), and Aleph::Slinknc::to_data().
| TEST_F | ( | List_of_25_nodes | , |
| Basic_operations | |||
| ) |
Definition at line 153 of file htlist.cc.
References Aleph::Snodenc< T >::get_data(), and Aleph::maps().
| TEST_F | ( | List_of_25_nodes | , |
| cut_and_concat | |||
| ) |
Definition at line 234 of file htlist.cc.
References Aleph::HTList::cut(), Aleph::HTList::Iterator::get_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::HTList::is_empty(), Aleph::maps(), Aleph::HTList::Iterator::next(), and Aleph::Slinknc::to_data().
| TEST_F | ( | List_of_25_nodes | , |
| Iterator_operations | |||
| ) |
Definition at line 181 of file htlist.cc.
References Aleph::HTList::Iterator::has_curr(), and Aleph::maps().
| TEST_F | ( | List_of_25_nodes | , |
| reverse | |||
| ) |
Definition at line 258 of file htlist.cc.
References Aleph::HTList::Iterator::has_curr(), Aleph::HTList::is_empty(), l, Aleph::maps(), Aleph::HTList::reverse(), Aleph::DynList< T >::reverse(), and Aleph::HTList::split().
| TEST_F | ( | List_of_25_nodes | , |
| rotate_left | |||
| ) |
Definition at line 289 of file htlist.cc.
References Aleph::HTList::Iterator::get_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::maps(), Aleph::HTList::Iterator::next(), and Aleph::Slinknc::to_data().
| TEST_F | ( | List_of_25_nodes | , |
| Split_and_concat | |||
| ) |
Definition at line 191 of file htlist.cc.
References Aleph::DynList< T >::get_first(), Aleph::HTList::get_first(), Aleph::DynList< T >::get_last(), Aleph::HTList::get_last(), l, Aleph::maps(), Aleph::HTList::size(), Aleph::HTList::split(), and Aleph::Slinknc::to_data().
| TEST_F | ( | List_of_25_nodes | , |
| swap | |||
| ) |
Definition at line 218 of file htlist.cc.
References Aleph::HTList::is_empty(), Aleph::maps(), Aleph::HTList::remove_all_and_delete(), and Aleph::DynList< T >::swap().