|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Subset_Sum.H. More...
#include <cstdint>#include <random>#include <bitArray.H>#include <gtest/gtest.h>#include <Subset_Sum.H>Go to the source code of this file.
Functions | |
| TEST (SubsetSum, EmptyArray) | |
| TEST (SubsetSum, ZeroTarget) | |
| TEST (SubsetSum, BasicFound) | |
| TEST (SubsetSum, NotFound) | |
| TEST (SubsetSum, ExistsOnly) | |
| TEST (SubsetSum, CountSubsets) | |
| TEST (SubsetSum, CountZeroTarget) | |
| TEST (SubsetSum, NegativeTarget) | |
| TEST (SubsetSum, NegativeValuesRejected) | |
| TEST (SubsetSum, ZeroValueMultiplicityInCount) | |
| TEST (SubsetSumMITM, EmptyArray) | |
| TEST (SubsetSumMITM, BasicFound) | |
| TEST (SubsetSumMITM, NotFound) | |
| TEST (SubsetSumMITM, LargerSet) | |
| TEST (SubsetSumMITM, SingleElement) | |
| TEST (SubsetSum, StressVsBruteForce) | |
| TEST (SubsetSum, RandomExistsAndCountVsBruteForce) | |
| TEST (SubsetSumMITM, RandomVsBruteForce) | |
| TEST (SubsetSumMITM, TooManyElementsThrows) | |
Tests for Subset_Sum.H.
Definition in file subset_sum_test.cc.
| TEST | ( | SubsetSum | , |
| BasicFound | |||
| ) |
Definition at line 98 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum().
| TEST | ( | SubsetSum | , |
| CountSubsets | |||
| ) |
Definition at line 125 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), and Aleph::subset_sum_count().
| TEST | ( | SubsetSum | , |
| CountZeroTarget | |||
| ) |
Definition at line 132 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), and Aleph::subset_sum_count().
| TEST | ( | SubsetSum | , |
| EmptyArray | |||
| ) |
Definition at line 79 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum().
| TEST | ( | SubsetSum | , |
| ExistsOnly | |||
| ) |
Definition at line 118 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), and Aleph::subset_sum_exists().
| TEST | ( | SubsetSum | , |
| NegativeTarget | |||
| ) |
Definition at line 139 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::subset_sum(), Aleph::subset_sum_count(), and Aleph::subset_sum_exists().
| TEST | ( | SubsetSum | , |
| NegativeValuesRejected | |||
| ) |
Definition at line 147 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::subset_sum(), Aleph::subset_sum_count(), and Aleph::subset_sum_exists().
| TEST | ( | SubsetSum | , |
| NotFound | |||
| ) |
Definition at line 111 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum().
| TEST | ( | SubsetSum | , |
| RandomExistsAndCountVsBruteForce | |||
| ) |
Definition at line 243 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::count(), Aleph::exists(), r, Aleph::Array< T >::reserve(), rng, Aleph::subset_sum(), Aleph::subset_sum_count(), and Aleph::subset_sum_exists().
| TEST | ( | SubsetSum | , |
| StressVsBruteForce | |||
| ) |
Definition at line 229 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::subset_sum_exists(), and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSum | , |
| ZeroTarget | |||
| ) |
Definition at line 90 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum().
| TEST | ( | SubsetSum | , |
| ZeroValueMultiplicityInCount | |||
| ) |
Definition at line 155 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, Aleph::subset_sum(), and Aleph::subset_sum_count().
| TEST | ( | SubsetSumMITM | , |
| BasicFound | |||
| ) |
Definition at line 177 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), k, r, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| EmptyArray | |||
| ) |
Definition at line 167 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| LargerSet | |||
| ) |
Definition at line 196 of file subset_sum_test.cc.
References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), k, r, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| NotFound | |||
| ) |
Definition at line 189 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| RandomVsBruteForce | |||
| ) |
Definition at line 270 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::Array< T >::reserve(), rng, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| SingleElement | |||
| ) |
Definition at line 217 of file subset_sum_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), r, and Aleph::subset_sum_mitm().
| TEST | ( | SubsetSumMITM | , |
| TooManyElementsThrows | |||
| ) |
Definition at line 291 of file subset_sum_test.cc.
References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::subset_sum_mitm().