UE::Mass::Utils::AbstractSort

Navigation

API > API/Runtime > API/Runtime/MassEntity

Description

AbstractSort is a sorting function that only needs to know how many items there are, how to compare items at individual locations - where location is in [0, NumElements) - and how to swap two elements at given locations. The main use case is to sort multiple arrays while keeping them in sync. For example:

TArray Lead = { 3.1, 0.2, 2.6, 1.0 }; TArray Payload = { A, B, C, D };

AbstractSort(Lead.Num() // NumElements , &Lead // Predicate { return Lead[LHS] < Lead[RHS]; } , &Lead, &Payload // SwapFunctor { Swap(Lead[A], Lead[B]); Swap(Payload[A], Payload[B]); } );

namespace UE  
{  
    namespace Mass  
    {  
        namespace Utils  
        {  
            template<typename TPred, typename TSwap>  
            void UE::Mass::Utils::AbstractSort  
            (  
                const int32 NumElements,  
                TPred && Predicate,  
                TSwap && SwapFunctor  
            )  
        }  
    }  
}  
Copy full snippet

namespace UE {     namespace Mass     {         namespace Utils         {             template<typename TPred, typename TSwap>             void UE::Mass::Utils::AbstractSort             (                 const int32 NumElements,                 TPred && Predicate,                 TSwap && SwapFunctor             )         }     } }