1. Epic GamesDeveloper
  3. Algo::GetElementDependencies

Algo::GetElementDependencies

Sorts the given range in leaf to root order: For every pair of elements (A,B) where SortedIndex(A) < SortedIndex(B), either B is not reachable from A, or A and B are mutually reachable.

API > API/Runtime > API/Runtime/Core > API/Runtime/Core/Algo

References

   
Module Core
Header /Engine/Source/Runtime/Core/Public/Algo/TopologicalSort.h
Include #include "Algo/TopologicalSort.h" 
namespace Algo  
{  
    &42;const RangeType< T > & Algo&58;&58;GetElementDependencies  
    &40;  
        const T & Element  
    &41;  
}

Remarks

Sorts the given range in leaf to root order: For every pair of elements (A,B) where SortedIndex(A) < SortedIndex(B), either B is not reachable from A, or A and B are mutually reachable.

Parameters

Name Description
UniqueRange A range with element type T Type T must support GetTypeHash and copy+move constructors; T being pointertype is recommended. In/Out Variable, is sorted in place. Will be unmodified if function returns false.
GetElementDependencies A callable with prototype that is one of RangeType GetElementDependencies(const T& Element) /** Sorts the given range in leaf to root order: For every pair of elements (A,B) where SortedIndex(A) < SortedIndex(B), either B is not reachable from A, or A and B are mutually reachable.
UniqueRange A range with element type T Type T must support GetTypeHash and copy+move constructors; T being pointertype is recommended. In/Out Variable, is sorted in place. Will be unmodified if function returns false.
GetElementDependencies A callable with prototype that is one of RangeType GetElementDependencies(const T& Element) /**

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page