blob: 3175d4976973f43fc70c925589ddbc0519a7209d [file] [log] [blame] [edit]
// Copyright 2024 The PDFium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CORE_FXCRT_CONTAINERS_CONTAINS_H_
#define CORE_FXCRT_CONTAINERS_CONTAINS_H_
// This is Chromium's base/containers/unique_ptr_adapters.h, adapted to work
// with PDFium's codebase with the following modifications:
//
// - Updated include guards.
// - Replaced namespace base with namespace pdfium.
// - Replaced <type_traits> with <concepts>.
// Provides `Contains()`, a general purpose utility to check whether a container
// contains a value. This will probe whether a `contains` or `find` member
// function on `container` exists, and fall back to a generic linear search over
// `container`.
#include <algorithm>
#include <concepts>
#include <ranges>
#include <utility>
namespace pdfium {
// A general purpose utility to check whether `container` contains `value`. This
// will probe whether a `contains` or `find` member function on `container`
// exists, and fall back to a generic linear search over `container`.
template <typename Container, typename Value>
constexpr bool Contains(const Container& container, const Value& value) {
if constexpr (requires {
{ container.contains(value) } -> std::same_as<bool>;
}) {
return container.contains(value);
} else if constexpr (requires { container.find(value) != Container::npos; }) {
return container.find(value) != Container::npos;
} else if constexpr (requires { container.find(value) != container.end(); }) {
return container.find(value) != container.end();
} else {
static_assert(
!requires { typename Container::key_type; },
"Error: About to perform linear search on an associative container. "
"Either use a more generic comparator (e.g. std::less<>) or, if a "
"linear search is desired, provide an explicit projection parameter.");
return std::ranges::find(container, value) != std::ranges::end(container);
}
}
// Overload that allows callers to provide an additional projection invocable.
// This projection will be applied to every element in `container` before
// comparing it with `value`. This will always perform a linear search.
template <typename Container, typename Value, typename Proj>
constexpr bool Contains(const Container& container,
const Value& value,
Proj proj) {
return std::ranges::find(container, value, std::move(proj)) !=
std::ranges::end(container);
}
} // namespace pdfium
#endif // CORE_FXCRT_CONTAINERS_CONTAINS_H_