|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Go to the source code of this file.
Typedefs | |
| using | Node = Dnode< long > |
Functions | |
| Node * | create_list_with_header (size_t n) |
| Node * | create_list_without_header (size_t n) |
| Node * | access (Node *list, size_t n) |
| ostream & | operator<< (ostream &out, Node *p) |
| int | main (int argc, char *argv[]) |
Variables | |
| static long | counter = 0 |
Definition at line 33 of file test-splice.C.
| Node * create_list_with_header | ( | size_t | n | ) |
Definition at line 37 of file test-splice.C.
References Aleph::Dlink::append(), and counter.
Referenced by main().
| Node * create_list_without_header | ( | size_t | n | ) |
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 70 of file test-splice.C.
References access(), create_list_with_header(), create_list_without_header(), Aleph::divide_and_conquer_partition_dp(), Aleph::exit(), and m.
| ostream & operator<< | ( | ostream & | out, |
| Node * | p | ||
| ) |
Definition at line 62 of file test-splice.C.
References Aleph::divide_and_conquer_partition_dp().
|
static |
Definition at line 35 of file test-splice.C.
Referenced by compute_true_len(), create_list_with_header(), create_list_without_header(), demo_callback_event(), Aleph::depth_first_traversal(), event_increment(), infix_tree(), main(), FutureUtilsTest::make_void_future_with_effect(), Uid::operator==(), print_forest_deway(), Aleph::Dlink::reverse_list(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), and TEST_F().