37# include <gtest/gtest.h>
44using namespace testing;
79 all([&
v5] (
char c) {
return v5.search_entry(c); }));
84 EXPECT_THROW(VType(chars, { 1, 2, 3, 4 }), length_error);
85 VType v = { chars, { 1, 2, 3, 4, 5 } };
102 constexpr size_t N = 10000;
108 {
return (i % 2) == 0 ? 0 : i; }) };
110 {
return (i % 2) == 0 ? i : 0; }) };
String manipulation utilities.
High-level sorting functions for Aleph containers.
Sparse vector with named elements.
TEST_F(SmallDomain, basic)
Generic domain class based on hash set.
const DynList< T > & keys() const
Get sorted list of all elements in the domain.
DynList< T > to_list() const
Convert domain to sorted list.
Dynamic singly linked list with functional programming support.
const Domain & get_domain() const noexcept
Get the domain over which this vector is defined.
NumType * search_entry(const T &i) const noexcept
Search for an entry and return pointer to its value.
Aleph::DynList< __T > maps(Operation &op) const
Map the elements of the container.
Main namespace for Aleph-w library functions.
bool all(Container &container, Operation &operation)
Return true if all elements satisfy a predicate.
bool eq(const C1 &c1, const C2 &c2, Eq e=Eq())
Check equality of two containers using a predicate.
DynArray< T > sort(const DynArray< T > &a, Cmp &&cmp=Cmp())
Returns a sorted copy of a DynArray.
DynList< T > maps(const C &c, Op op)
Classic map operation.
Aleph::DynList< T > keys() const