mirror of
https://github.com/SerenityOS/serenity
synced 2024-07-21 18:15:58 +00:00
07977ad94c
The ArrayLike type concept focuses on array-like data accesses. This means the ability to randomly index, obtain size information, as well as being able to expose the storage pointer. The last two already have the standard APIs `size` and `data`, respectively. The ArrayLike concept should always be fulfilled by Vector, FixedArray and Array as the three main array-like types. C-style arrays themselves of course can't fulfil ArrayLike (which could be considered ironic), but as we don't use them much anyways this isn't a problem.
117 lines
2.4 KiB
C++
117 lines
2.4 KiB
C++
/*
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Forward.h>
|
|
#include <AK/IterationDecision.h>
|
|
#include <AK/StdLibExtras.h>
|
|
|
|
namespace AK::Concepts {
|
|
|
|
template<typename T>
|
|
concept Integral = IsIntegral<T>;
|
|
|
|
template<typename T>
|
|
concept FloatingPoint = IsFloatingPoint<T>;
|
|
|
|
template<typename T>
|
|
concept Arithmetic = IsArithmetic<T>;
|
|
|
|
template<typename T>
|
|
concept Signed = IsSigned<T>;
|
|
|
|
template<typename T>
|
|
concept Unsigned = IsUnsigned<T>;
|
|
|
|
template<typename T>
|
|
concept Enum = IsEnum<T>;
|
|
|
|
template<typename T, typename U>
|
|
concept SameAs = IsSame<T, U>;
|
|
|
|
template<typename T>
|
|
concept AnyString = Detail::IsConstructible<StringView, T>;
|
|
|
|
template<typename T, typename U>
|
|
concept HashCompatible = IsHashCompatible<Detail::Decay<T>, Detail::Decay<U>>;
|
|
|
|
// FIXME: remove once Clang formats these properly.
|
|
// clang-format off
|
|
|
|
// Any indexable, sized, contiguous data structure.
|
|
template<typename ArrayT, typename ContainedT, typename SizeT = size_t>
|
|
concept ArrayLike = requires(ArrayT array, SizeT index)
|
|
{
|
|
{
|
|
array[index]
|
|
}
|
|
-> SameAs<RemoveReference<ContainedT>&>;
|
|
|
|
{
|
|
array.size()
|
|
}
|
|
-> SameAs<SizeT>;
|
|
|
|
{
|
|
array.span()
|
|
}
|
|
-> SameAs<Span<RemoveReference<ContainedT>>>;
|
|
|
|
{
|
|
array.data()
|
|
}
|
|
-> SameAs<RemoveReference<ContainedT>*>;
|
|
};
|
|
|
|
template<typename Func, typename... Args>
|
|
concept VoidFunction = requires(Func func, Args... args)
|
|
{
|
|
{
|
|
func(args...)
|
|
}
|
|
-> SameAs<void>;
|
|
};
|
|
|
|
template<typename Func, typename... Args>
|
|
concept IteratorFunction = requires(Func func, Args... args)
|
|
{
|
|
{
|
|
func(args...)
|
|
}
|
|
-> SameAs<IterationDecision>;
|
|
};
|
|
|
|
template<typename T, typename EndT>
|
|
concept IteratorPairWith = requires(T it, EndT end)
|
|
{
|
|
*it;
|
|
{ it != end } -> SameAs<bool>;
|
|
++it;
|
|
};
|
|
|
|
template<typename T>
|
|
concept IterableContainer = requires
|
|
{
|
|
{ declval<T>().begin() } -> IteratorPairWith<decltype(declval<T>().end())>;
|
|
};
|
|
|
|
// clang-format on
|
|
}
|
|
|
|
using AK::Concepts::Arithmetic;
|
|
using AK::Concepts::ArrayLike;
|
|
using AK::Concepts::Enum;
|
|
using AK::Concepts::FloatingPoint;
|
|
using AK::Concepts::Integral;
|
|
using AK::Concepts::IterableContainer;
|
|
using AK::Concepts::IteratorFunction;
|
|
using AK::Concepts::IteratorPairWith;
|
|
using AK::Concepts::SameAs;
|
|
using AK::Concepts::Signed;
|
|
using AK::Concepts::Unsigned;
|
|
using AK::Concepts::VoidFunction;
|