Redstone1024/Redcraft
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix(algorithms): fix compilation error on GCC for concept instantiation

Browse Source
This commit is contained in:
Redstone1024 2024-12-25 18:17:04 +08:00
parent a3cebf03ec
commit f817afe6df
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Redcraft.Utility/Source/Public/Algorithms/Search.h
View File

@ -1209,7 +1209,7 @@ template <CForwardRange R,
CRegularInvocable<TRangeReference<R>> Proj = CRegularInvocable<TRangeReference<R>> Proj =
decltype([]<typename T>(T&& A) -> T&& { return Forward<T>(A); }), decltype([]<typename T>(T&& A) -> T&& { return Forward<T>(A); }),
CEquivalenceRelation<TInvokeResult<Proj, TRangeReference<R>>, TInvokeResult<Proj, TRangeReference<R>>> Pred = CEquivalenceRelation<TInvokeResult<Proj, TRangeReference<R>>, TInvokeResult<Proj, TRangeReference<R>>> Pred =
TConditional<CWeaklyEqualityComparable<TInvokeResult<Proj, TRangeReference<R>>>, TConditional<CWeaklyEqualityComparable<TInvokeResult<Proj, TRangeReference<R>>, TInvokeResult<Proj, TRangeReference<R>>>,
decltype([]<typename LHS, typename RHS>(const LHS& A, const RHS& B) { return A == B; }), void>> decltype([]<typename LHS, typename RHS>(const LHS& A, const RHS& B) { return A == B; }), void>>
requires (CBorrowedRange<R>) requires (CBorrowedRange<R>)
NODISCARD constexpr TRangeIterator<R> FindAdjacent(R&& Range, Pred Predicate = { }, Proj Projection = { }) NODISCARD constexpr TRangeIterator<R> FindAdjacent(R&& Range, Pred Predicate = { }, Proj Projection = { })
@ -1251,7 +1251,7 @@ template <CForwardIterator I, CSentinelFor<I> S,
CRegularInvocable<TIteratorReference<I>> Proj = CRegularInvocable<TIteratorReference<I>> Proj =
decltype([]<typename T>(T&& A) -> T&& { return Forward<T>(A); }), decltype([]<typename T>(T&& A) -> T&& { return Forward<T>(A); }),
CEquivalenceRelation<TInvokeResult<Proj, TIteratorReference<I>>, TInvokeResult<Proj, TIteratorReference<I>>> Pred = CEquivalenceRelation<TInvokeResult<Proj, TIteratorReference<I>>, TInvokeResult<Proj, TIteratorReference<I>>> Pred =
TConditional<CWeaklyEqualityComparable<TInvokeResult<Proj, TIteratorReference<I>>>, TConditional<CWeaklyEqualityComparable<TInvokeResult<Proj, TIteratorReference<I>>, TInvokeResult<Proj, TIteratorReference<I>>>,
decltype([]<typename LHS, typename RHS>(const LHS& A, const RHS& B) { return A == B; }), void>> decltype([]<typename LHS, typename RHS>(const LHS& A, const RHS& B) { return A == B; }), void>>
NODISCARD FORCEINLINE constexpr I FindAdjacent(I First, S Last, Pred Predicate = { }, Proj Projection = { }) NODISCARD FORCEINLINE constexpr I FindAdjacent(I First, S Last, Pred Predicate = { }, Proj Projection = { })
{ {