|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Slist. More...
Go to the source code of this file.
Functions | |
| TEST (Slist, InsertAndRemoveFirst) | |
| TEST (Slist, GetFirstNeAndRemoveFirstNe) | |
| TEST (Slist, IteratorOverflowOnEmptyAndAfterEnd) | |
| TEST (Slist, IteratorTraversesAllNodes) | |
Tests for Slist.
Definition in file slist.cc.
| TEST | ( | Slist | , |
| GetFirstNeAndRemoveFirstNe | |||
| ) |
Definition at line 70 of file slist.cc.
References Aleph::Slist< T >::get_first_ne(), Aleph::Slist< T >::insert_first(), Aleph::HTList::is_empty(), Aleph::Slink::is_empty(), Aleph::maps(), and Aleph::Slist< T >::remove_first_ne().
| TEST | ( | Slist | , |
| InsertAndRemoveFirst | |||
| ) |
Definition at line 45 of file slist.cc.
References Aleph::Slist< T >::get_first(), Aleph::Slist< T >::insert_first(), Aleph::HTList::is_empty(), Aleph::Slink::is_empty(), Aleph::maps(), and Aleph::Slist< T >::remove_first().
| TEST | ( | Slist | , |
| IteratorOverflowOnEmptyAndAfterEnd | |||
| ) |
Definition at line 95 of file slist.cc.
References Aleph::Slist< T >::Iterator::get_curr(), Aleph::Slist< T >::Iterator::has_curr(), Aleph::Slist< T >::insert_first(), Aleph::Slink::is_empty(), Aleph::maps(), Aleph::Slist< T >::Iterator::next(), and Aleph::Slist< T >::remove_first().
| TEST | ( | Slist | , |
| IteratorTraversesAllNodes | |||
| ) |
Definition at line 116 of file slist.cc.
References Aleph::count(), Aleph::Slist< T >::Iterator::has_curr(), Aleph::Slist< T >::insert_first(), Aleph::Slink::is_empty(), Aleph::maps(), and Aleph::Slist< T >::remove_first().