ladybird/AK/AnyOf.h

/*
 * Copyright (c) 2021, the SerenityOS developers.
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#pragma once

#include <AK/Find.h>
#include <AK/Iterator.h>

namespace AK {

template<typename Container, typename ValueType>
constexpr bool any_of(
    const SimpleIterator<Container, ValueType>& begin,
    const SimpleIterator<Container, ValueType>& end,
    const auto& predicate)
{
    return find_if(begin, end, predicate) != end;
}

}

using AK::any_of;
AK: Implement generic any_of algorithm 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`. 2021-01-14 22:36:23 +00:00			`/*`
			`* Copyright (c) 2021, the SerenityOS developers.`
			`*`
Everything: Move to SPDX license identifiers in all files. SPDX License Identifiers are a more compact / standardized way of representing file license information. See: https://spdx.dev/resources/use/#identifiers This was done with the `ambr` search and replace tool. ambr --no-parent-ignore --key-from-file --rep-from-file key.txt rep.txt * 2021-04-22 08:24:48 +00:00			`* SPDX-License-Identifier: BSD-2-Clause`
AK: Implement generic any_of algorithm 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`. 2021-01-14 22:36:23 +00:00			`*/`

			`#pragma once`

AK: Reimplement any_of in terms of find_if Problem: - Now that a generic free-function form of `find_if` is implemented the code in `any_of` is redundant. Solution: - Follow the "don't repeat yourself" mantra and make the code DRY by implementing `any_of` in terms of `find_if`. 2021-06-11 23:57:46 +00:00			`#include <AK/Find.h>`
AK: Implement generic any_of algorithm 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`. 2021-01-14 22:36:23 +00:00			`#include <AK/Iterator.h>`

			`namespace AK {`

			`template<typename Container, typename ValueType>`
			`constexpr bool any_of(`
			`const SimpleIterator<Container, ValueType>& begin,`
			`const SimpleIterator<Container, ValueType>& end,`
			`const auto& predicate)`
			`{`
AK: Reimplement any_of in terms of find_if Problem: - Now that a generic free-function form of `find_if` is implemented the code in `any_of` is redundant. Solution: - Follow the "don't repeat yourself" mantra and make the code DRY by implementing `any_of` in terms of `find_if`. 2021-06-11 23:57:46 +00:00			`return find_if(begin, end, predicate) != end;`
AK: Implement generic any_of algorithm 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`. 2021-01-14 22:36:23 +00:00			`}`

			`}`
AK: Publish AK::any_of by default 2021-02-07 10:35:08 +00:00
			`using AK::any_of;`