mirrors/ladybird
0
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2025-04-24 05:25:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

LibIPC: Make Vector concept match AK::Vector with any inline_capacity

Browse source 
Also:
* Use SpecializationOf for Optional and Variant concepts
* Remove inline because it is implied by constexpr
* Reorder declarations from less to more specialized (in common sense)
This commit is contained in:
stasoid 2025-01-31 10:55:32 +05:00 • committed by Andrew Kaster
parent 46444c89c9
commit d41e577ba1
Notes: github-actions[bot] 2025-02-13 05:32:56 +00:00
1 changed files with 29 additions and 38 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

67
Libraries/LibIPC/Concepts.h
View file

@ -27,54 +27,45 @@ namespace IPC::Concepts {
namespace Detail { namespace Detail {
// Cannot use SpecializationOf with these templates because they have non-type parameters. See https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/p1985r3.pdf
template<typename T> template<typename T>
constexpr inline bool IsHashMap = false; constexpr bool IsArray = false;
template<typename K, typename V, typename KeyTraits, typename ValueTraits, bool IsOrdered>
constexpr inline bool IsHashMap<HashMap<K, V, KeyTraits, ValueTraits, IsOrdered>> = true;
template<typename T>
constexpr inline bool IsOptional = false;
template<typename T>
constexpr inline bool IsOptional<Optional<T>> = true;
template<typename T>
constexpr inline bool IsSharedSingleProducerCircularQueue = false;
template<typename T, size_t Size>
constexpr inline bool IsSharedSingleProducerCircularQueue<Core::SharedSingleProducerCircularQueue<T, Size>> = true;
template<typename T>
constexpr inline bool IsVariant = false;
template<typename... Ts>
constexpr inline bool IsVariant<Variant<Ts...>> = true;
template<typename T>
constexpr inline bool IsVector = false;
template<typename T>
constexpr inline bool IsVector<Vector<T>> = true;
template<typename T>
constexpr inline bool IsArray = false;
template<typename T, size_t N> template<typename T, size_t N>
constexpr inline bool IsArray<Array<T, N>> = true; constexpr bool IsArray<Array<T, N>> = true;
template<typename T>
constexpr bool IsVector = false;
template<typename T, size_t inline_capacity>
constexpr bool IsVector<Vector<T, inline_capacity>> = true;
template<typename T>
constexpr bool IsHashMap = false;
template<typename K, typename V, typename KeyTraits, typename ValueTraits, bool IsOrdered>
constexpr bool IsHashMap<HashMap<K, V, KeyTraits, ValueTraits, IsOrdered>> = true;
template<typename T>
constexpr bool IsSharedSingleProducerCircularQueue = false;
template<typename T, size_t Size>
constexpr bool IsSharedSingleProducerCircularQueue<Core::SharedSingleProducerCircularQueue<T, Size>> = true;
} }
template<typename T> template<typename T>
concept HashMap = Detail::IsHashMap<T>; concept Array = Detail::IsArray<T>;
template<typename T>
concept Optional = Detail::IsOptional<T>;
template<typename T>
concept SharedSingleProducerCircularQueue = Detail::IsSharedSingleProducerCircularQueue<T>;
template<typename T>
concept Variant = Detail::IsVariant<T>;
template<typename T> template<typename T>
concept Vector = Detail::IsVector<T>; concept Vector = Detail::IsVector<T>;
template<typename T> template<typename T>
concept Array = Detail::IsArray<T>; concept HashMap = Detail::IsHashMap<T>;
template<typename T>
concept SharedSingleProducerCircularQueue = Detail::IsSharedSingleProducerCircularQueue<T>;
template<typename T>
concept Optional = SpecializationOf<T, AK::Optional>;
template<typename T>
concept Variant = SpecializationOf<T, AK::Variant>;
} }