mirror of
https://github.com/RGBCube/serenity
synced 2025-07-27 05:57:45 +00:00
AK: Implement {any,all}_of(IterableContainer&&, Predicate)
This is a generally nicer-to-use version of the existing {any,all}_of() that doesn't require the user to explicitly provide two iterators. As a bonus, it also allows arbitrary iterators (as opposed to the hard requirement of providing SimpleIterators in the iterator version).
This commit is contained in:
parent
f879e04133
commit
d40d10aae7
4 changed files with 101 additions and 0 deletions
|
@ -19,3 +19,41 @@ TEST_CASE(should_determine_if_predicate_applies_to_all_elements_in_container)
|
|||
EXPECT(all_of(a.begin(), a.end(), [](auto elem) { return elem == 0; }));
|
||||
EXPECT(!all_of(a.begin(), a.end(), [](auto elem) { return elem == 1; }));
|
||||
}
|
||||
|
||||
TEST_CASE(container_form)
|
||||
{
|
||||
constexpr Array a { 10, 20, 30 };
|
||||
static_assert(all_of(a, [](auto elem) { return elem > 0; }));
|
||||
static_assert(!all_of(a, [](auto elem) { return elem > 10; }));
|
||||
EXPECT(all_of(a, [](auto elem) { return elem > 0; }));
|
||||
EXPECT(!all_of(a, [](auto elem) { return elem > 10; }));
|
||||
|
||||
Vector b { 10, 20, 30 };
|
||||
EXPECT(all_of(b, [](auto elem) { return elem > 0; }));
|
||||
EXPECT(!all_of(b, [](auto elem) { return elem > 10; }));
|
||||
|
||||
struct ArbitraryIterable {
|
||||
struct ArbitraryIterator {
|
||||
ArbitraryIterator(int v)
|
||||
: value(v)
|
||||
{
|
||||
}
|
||||
|
||||
bool operator==(ArbitraryIterator const&) const = default;
|
||||
int operator*() const { return value; }
|
||||
ArbitraryIterator& operator++()
|
||||
{
|
||||
++value;
|
||||
return *this;
|
||||
}
|
||||
|
||||
int value;
|
||||
};
|
||||
ArbitraryIterator begin() const { return 0; }
|
||||
ArbitraryIterator end() const { return 20; }
|
||||
};
|
||||
|
||||
ArbitraryIterable c;
|
||||
EXPECT(all_of(c, [](auto elem) { return elem < 20; }));
|
||||
EXPECT(!all_of(c, [](auto elem) { return elem > 10; }));
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue