|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Unit tests for Gen_Sparse_Table, Sparse_Table and Max_Sparse_Table. More...
#include <gtest/gtest.h>#include <tpl_sparse_table.H>#include <algorithm>#include <cstddef>#include <numeric>#include <utility>#include <vector>Go to the source code of this file.
Concepts | |
| concept | @1036::buildable |
Functions | |
| TEST (SparseTable, EmptyConstructionAndErrors) | |
| TEST (SparseTable, UniformValueConstruction) | |
| TEST (SparseTable, MinAndMaxAgainstBruteForce) | |
| TEST (SparseTable, ConstructorsFromAllContainers) | |
| TEST (SparseTable, CustomAssociativeIdempotentOperation) | |
| TEST (SparseTable, ClassTypePlusStillAccepted) | |
| TEST (SparseTable, ValuesCopyMoveAndSwap) | |
| TEST (SparseTable, BoundsChecking) | |
Variables | |
| constexpr auto | min_lambda = [](const int a, const int b) { return std::min(a, b); } |
Unit tests for Gen_Sparse_Table, Sparse_Table and Max_Sparse_Table.
Definition in file tpl_sparse_table_test.cc.
| TEST | ( | SparseTable | , |
| BoundsChecking | |||
| ) |
Definition at line 223 of file tpl_sparse_table_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::Gen_Sparse_Table< T, Op >::get(), and Aleph::Gen_Sparse_Table< T, Op >::query().
| TEST | ( | SparseTable | , |
| ClassTypePlusStillAccepted | |||
| ) |
Definition at line 188 of file tpl_sparse_table_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), l, Aleph::Gen_Sparse_Table< T, Op >::query(), r, and Aleph::HTList::size().
| TEST | ( | SparseTable | , |
| ConstructorsFromAllContainers | |||
| ) |
Definition at line 149 of file tpl_sparse_table_test.cc.
References Aleph::Array< T >::append(), Aleph::DynList< T >::append(), StlAlephIterator< SetName >::begin(), Aleph::blossom_maximum_cardinality_matching(), l, r, and Aleph::HTList::size().
| TEST | ( | SparseTable | , |
| CustomAssociativeIdempotentOperation | |||
| ) |
Definition at line 178 of file tpl_sparse_table_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), l, r, and Aleph::HTList::size().
| TEST | ( | SparseTable | , |
| EmptyConstructionAndErrors | |||
| ) |
Definition at line 106 of file tpl_sparse_table_test.cc.
References Aleph::blossom_maximum_cardinality_matching().
| TEST | ( | SparseTable | , |
| MinAndMaxAgainstBruteForce | |||
| ) |
Definition at line 131 of file tpl_sparse_table_test.cc.
References StlAlephIterator< SetName >::begin(), Aleph::blossom_maximum_cardinality_matching(), l, r, and Aleph::HTList::size().
| TEST | ( | SparseTable | , |
| UniformValueConstruction | |||
| ) |
| TEST | ( | SparseTable | , |
| ValuesCopyMoveAndSwap | |||
| ) |
Definition at line 198 of file tpl_sparse_table_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::copy(), Aleph::Gen_Sparse_Table< T, Op >::swap(), and Aleph::Gen_Sparse_Table< T, Op >::values().
|
constexpr |
Definition at line 103 of file tpl_sparse_table_test.cc.