mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-30 00:31:14 +00:00
d11727ff28
Problem: - Raw loops are often written to validate that any values in a container meet a predicate, but raw loops are not as expressive as functions implementing well-named algorithms and are error-prone. Solution: - Implement a very generic form of `any_of`.
46 lines
2.1 KiB
C++
46 lines
2.1 KiB
C++
/*
|
|
* Copyright (c) 2021, the SerenityOS developers.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <AK/TestSuite.h>
|
|
|
|
#include <AK/AnyOf.h>
|
|
#include <AK/Array.h>
|
|
|
|
TEST_CASE(should_determine_if_predicate_applies_to_any_element_in_container)
|
|
{
|
|
constexpr AK::Array<int, 10> a { 1 };
|
|
|
|
static_assert(AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 0; }));
|
|
static_assert(AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 1; }));
|
|
static_assert(!AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 2; }));
|
|
|
|
EXPECT(AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 0; }));
|
|
EXPECT(AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 1; }));
|
|
EXPECT(!AK::any_of(a.begin(), a.end(), [](auto elem) { return elem == 2; }));
|
|
}
|
|
|
|
TEST_MAIN(AllOf)
|