Navigation
API > API/Developer > API/Developer/TraceServices > API/Developer/TraceServices/Common > API/Developer/TraceServices/Common/TraceServices__P-
References
| Module | TraceServices |
| Header | /Engine/Source/Developer/TraceServices/Public/Common/PagedArray.h |
| Include | #include "Common/PagedArray.h" |
namespace TraceServices
{
namespace PagedArrayAlgo
{
template<typename ItemType, typename PageType, typename SortPredicateType>
decltype) TraceServices::PagedArrayAlgo::BinarySearchClosest
(
const TPagedArray < ItemType, PageType > & PagedArray,
const ItemType & Value,
SortPredicateType SortPredicate
)
}
}
Remarks
Performs binary search, resulting in position of the first element closest to Value. The position of the first element closest to Value; == 0 if Num == 0, otherwise is a value in range [0 .. Num-1].
Parameters
| Name | Description |
|---|---|
| PagedArray | The paged array to search through; must be already sorted by SortPredicate. |
| Value | The value to look for |
| SortPredicate | The predicate for sort comparison; defaults to <. |