Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Classes | Macros | Functions
dyndlist.cc File Reference

Tests for Dyndlist. More...

#include <gtest/gtest.h>
#include <tpl_dynDlist.H>
Include dependency graph for dyndlist.cc:

Go to the source code of this file.

Classes

struct  List_of_25_items
 
struct  List_of_10_items
 

Macros

#define Declare_list_n_items(num)
 

Functions

 TEST (DynDlist, Basic_operations)
 
 TEST (DynDlist, Simple_append_and_insert_of_list)
 
 TEST_F (List_of_10_items, copy_and_assignment)
 
 TEST_F (List_of_25_items, Basic_operations)
 
 TEST_F (List_of_25_items, Iterator_operations)
 
 TEST_F (List_of_25_items, Split_and_concat)
 
 TEST_F (List_of_25_items, swap)
 
 TEST_F (List_of_25_items, reverse)
 
 TEST_F (List_of_25_items, rotate_left)
 
 TEST_F (List_of_25_items, rotate_right)
 
 TEST_F (List_of_25_items, append_and_insert_by_moving)
 
 TEST (DynDlist, traverse_on_empty_container)
 
 TEST_F (List_of_25_items, traverse)
 
 TEST (DynDlist, RemoveAndEraseByReference)
 
 TEST (DynDlist, OperatorIndexEnforcesBounds)
 
 TEST_F (List_of_10_items, ConstReverseReturnsIndependentCopy)
 
 TEST (DynDlist, IteratorInsertAndAppendOperations)
 
 TEST (DynDlist, IteratorListOperations)
 
 TEST (DynDlist, IteratorListOperationsRequireCurrent)
 
 TEST (DynDlist, SplitRequiresEmptyDestination)
 
 TEST (DynDlist, StackAndQueueAliases)
 

Detailed Description

Tests for Dyndlist.

Definition in file dyndlist.cc.

Macro Definition Documentation

◆ Declare_list_n_items

#define Declare_list_n_items (   num)
Value:
struct List_of_##num##_items : public Test \
{ \
size_t n = 0; \
DynDlist<int> list##num; \
DynDlist<int> rlist##num; \
List_of_##num##_items() \
{ \
for (size_t i = 0; i < num; ++i, ++n) \
list##num.append(i + 1); \
\
const DynDlist<int> l = list##num; \
rlist##num = l.rev(); \
} \
};
Aleph::DynDlist
Dynamic doubly linked list with O(1) size and bidirectional access.
Definition tpl_dynDlist.H:124
Aleph::DynList::append
T & append(const T &item)
Append a new item by copy.
Definition htlist.H:1562
Aleph::DynList::rev
DynList & rev() noexcept
Definition htlist.H:1769
Aleph::maps
DynList< T > maps(const C &c, Op op)
Classic map operation.
Definition ahFunctional.H:693
l
DynList< int > l
Definition tree-node-common.H:69

Definition at line 46 of file dyndlist.cc.

Function Documentation

◆ TEST() [1/10]

TEST ( DynDlist  ,
Basic_operations   
)

Definition at line 65 of file dyndlist.cc.

References Aleph::DynDlist< T >::append(), Aleph::DynDlist< T >::get_first(), Aleph::DynDlist< T >::get_last(), Aleph::DynDlist< T >::insert(), Aleph::Dlink::is_empty(), Aleph::Dlink::is_unitarian(), Aleph::Dlink::is_unitarian_or_empty(), Aleph::maps(), Aleph::DynDlist< T >::remove_first(), Aleph::Dlink::rotate_left(), and Aleph::DynDlist< T >::size().

◆ TEST() [2/10]

TEST ( DynDlist  ,
IteratorInsertAndAppendOperations   
)

Definition at line 454 of file dyndlist.cc.

References Aleph::DynList< T >::append(), StlAlephIterator< SetName >::end(), LocateFunctions< Container, Type >::get_it(), Aleph::DynList< T >::insert(), and Aleph::maps().

◆ TEST() [3/10]

TEST ( DynDlist  ,
IteratorListOperations   
)

Definition at line 479 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), Aleph::Dlink::is_empty(), Aleph::HTList::is_empty(), and Aleph::maps().

◆ TEST() [4/10]

TEST ( DynDlist  ,
IteratorListOperationsRequireCurrent   
)

Definition at line 505 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), Aleph::HTList::is_empty(), Aleph::maps(), and Aleph::HTList::size().

◆ TEST() [5/10]

TEST ( DynDlist  ,
OperatorIndexEnforcesBounds   
)

Definition at line 413 of file dyndlist.cc.

References Aleph::DynDlist< T >::append(), and Aleph::maps().

◆ TEST() [6/10]

TEST ( DynDlist  ,
RemoveAndEraseByReference   
)

Definition at line 392 of file dyndlist.cc.

References Aleph::DynDlist< T >::append(), Aleph::DynDlist< T >::erase(), Aleph::DynDlist< T >::get_first(), LocateFunctions< Container, Type >::get_it(), Aleph::DynDlist< T >::get_last(), Aleph::maps(), Aleph::DynDlist< T >::remove(), and Aleph::DynDlist< T >::size().

◆ TEST() [7/10]

TEST ( DynDlist  ,
Simple_append_and_insert_of_list   
)

Definition at line 114 of file dyndlist.cc.

References Aleph::DynDlist< T >::append(), Aleph::DynList< T >::get_first(), Aleph::DynDlist< T >::get_first(), Aleph::DynList< T >::get_last(), Aleph::DynDlist< T >::get_last(), Aleph::DynList< T >::insert(), Aleph::DynDlist< T >::insert(), Aleph::Dlink::is_empty(), Aleph::HTList::is_empty(), Aleph::Dlink::is_unitarian(), Aleph::Dlink::is_unitarian_or_empty(), Aleph::maps(), and Aleph::DynDlist< T >::size().

◆ TEST() [8/10]

TEST ( DynDlist  ,
SplitRequiresEmptyDestination   
)

Definition at line 524 of file dyndlist.cc.

References Aleph::DynDlist< T >::append(), Aleph::DynDlist< T >::empty(), Aleph::maps(), and Aleph::DynDlist< T >::split().

◆ TEST() [9/10]

TEST ( DynDlist  ,
StackAndQueueAliases   
)

Definition at line 538 of file dyndlist.cc.

References Aleph::DynDlist< T >::front(), Aleph::DynDlist< T >::get(), Aleph::Dlink::is_empty(), Aleph::maps(), Aleph::DynDlist< T >::pop(), Aleph::DynDlist< T >::push(), Aleph::DynDlist< T >::put(), Aleph::DynDlist< T >::rear(), and Aleph::DynDlist< T >::top().

◆ TEST() [10/10]

TEST ( DynDlist  ,
traverse_on_empty_container   
)

Definition at line 373 of file dyndlist.cc.

References Aleph::maps(), and GenericTraverse< Container >::traverse().

◆ TEST_F() [1/11]

TEST_F ( List_of_10_items  ,
ConstReverseReturnsIndependentCopy   
)

Definition at line 432 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), Aleph::maps(), Aleph::DynList< T >::rev(), and Aleph::DynList< T >::reverse().

◆ TEST_F() [2/11]

TEST_F ( List_of_10_items  ,
copy_and_assignment   
)

Definition at line 158 of file dyndlist.cc.

References Aleph::DynDlist< T >::empty(), LocateFunctions< Container, Type >::get_it(), Aleph::Dlink::is_empty(), Aleph::maps(), Aleph::HTList::size(), and Aleph::DynDlist< T >::size().

◆ TEST_F() [3/11]

TEST_F ( List_of_25_items  ,
append_and_insert_by_moving   
)

Definition at line 355 of file dyndlist.cc.

References Aleph::DynList< T >::insert(), Aleph::HTList::is_empty(), Aleph::maps(), and Aleph::DynList< T >::reverse().

◆ TEST_F() [4/11]

TEST_F ( List_of_25_items  ,
Basic_operations   
)

Definition at line 221 of file dyndlist.cc.

References Aleph::maps().

◆ TEST_F() [5/11]

TEST_F ( List_of_25_items  ,
Iterator_operations   
)

Definition at line 231 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), and Aleph::maps().

◆ TEST_F() [6/11]

TEST_F ( List_of_25_items  ,
reverse   
)

Definition at line 294 of file dyndlist.cc.

References Aleph::DynDlist< T >::insert(), l, Aleph::maps(), Aleph::DynList< T >::reverse(), Aleph::DynDlist< T >::reverse(), and Aleph::HTList::split().

◆ TEST_F() [7/11]

TEST_F ( List_of_25_items  ,
rotate_left   
)

Definition at line 323 of file dyndlist.cc.

References Aleph::maps(), and Aleph::HTList::rotate_left().

◆ TEST_F() [8/11]

TEST_F ( List_of_25_items  ,
rotate_right   
)

Definition at line 339 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), and Aleph::maps().

◆ TEST_F() [9/11]

TEST_F ( List_of_25_items  ,
Split_and_concat   
)

Definition at line 253 of file dyndlist.cc.

References Aleph::DynList< T >::append(), Aleph::DynList< T >::get_first(), Aleph::DynDlist< T >::get_first(), LocateFunctions< Container, Type >::get_it(), Aleph::DynList< T >::get_last(), Aleph::DynDlist< T >::get_last(), l, Aleph::maps(), Aleph::HTList::size(), Aleph::DynDlist< T >::size(), and Aleph::HTList::split().

◆ TEST_F() [10/11]

TEST_F ( List_of_25_items  ,
swap   
)

Definition at line 280 of file dyndlist.cc.

References LocateFunctions< Container, Type >::get_it(), Aleph::HTList::is_empty(), Aleph::maps(), and Aleph::DynList< T >::swap().

◆ TEST_F() [11/11]

TEST_F ( List_of_25_items  ,
traverse   
)

Definition at line 382 of file dyndlist.cc.

References Aleph::maps(), N, and GenericTraverse< Container >::traverse().