|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Go to the source code of this file.
Functions | |
| TEST (LIS, EmptySequence) | |
| TEST (LIS, SingleElement) | |
| TEST (LIS, ClassicExample) | |
| TEST (LIS, AllEqual) | |
| TEST (LIS, AlreadySorted) | |
| TEST (LIS, ReverseSorted) | |
| TEST (LIS, LengthOnly) | |
| TEST (LIS, NonDecreasing) | |
| TEST (LIS, NonDecreasingAllEqual) | |
| TEST (LIS, CustomComparator) | |
| TEST (LIS, NonIncreasingWithComparator) | |
| TEST (LIS, StressVsBruteForce) | |
| TEST (LIS, NonDecreasingStressVsQuadraticDP) | |
Tests for LIS.H.
Definition in file lis_test.cc.
| TEST | ( | LIS | , |
| AllEqual | |||
| ) |
Definition at line 134 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| AlreadySorted | |||
| ) |
Definition at line 141 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| ClassicExample | |||
| ) |
Definition at line 118 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| CustomComparator | |||
| ) |
Definition at line 184 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| EmptySequence | |||
| ) |
Definition at line 100 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::lis_length(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| LengthOnly | |||
| ) |
Definition at line 155 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::lis_length().
| TEST | ( | LIS | , |
| NonDecreasing | |||
| ) |
Definition at line 161 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_nondecreasing_subsequence(), and r.
| TEST | ( | LIS | , |
| NonDecreasingAllEqual | |||
| ) |
Definition at line 175 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_nondecreasing_subsequence(), r, and Aleph::Array< T >::size().
| TEST | ( | LIS | , |
| NonDecreasingStressVsQuadraticDP | |||
| ) |
Definition at line 235 of file lis_test.cc.
References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_nondecreasing_subsequence(), and rng.
| TEST | ( | LIS | , |
| NonIncreasingWithComparator | |||
| ) |
Definition at line 198 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::longest_nondecreasing_subsequence(), r, and Aleph::Array< T >::size().
| TEST | ( | LIS | , |
| ReverseSorted | |||
| ) |
Definition at line 148 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| SingleElement | |||
| ) |
Definition at line 109 of file lis_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_increasing_subsequence(), and r.
| TEST | ( | LIS | , |
| StressVsBruteForce | |||
| ) |
Definition at line 208 of file lis_test.cc.
References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), is_subsequence(), Aleph::lis_length(), Aleph::longest_increasing_subsequence(), and rng.