#include <SlateInvalidationWidgetHeap.h>
◆ FElement
◆ FElementContainer
◆ SortPredicate
◆ FSlateInvalidationWidgetPostHeap()
◆ Contains_Debug()
Does it contains the widget index.
◆ ForEachIndexes()
| void FSlateInvalidationWidgetPostHeap::ForEachIndexes |
( |
Predicate |
Pred | ) |
|
|
inline |
◆ GetRaw()
◆ Heapify()
| void FSlateInvalidationWidgetPostHeap::Heapify |
( |
| ) |
|
|
inline |
◆ HeapPop()
| FElement FSlateInvalidationWidgetPostHeap::HeapPop |
( |
| ) |
|
|
inline |
Returns and removes the biggest WidgetIndex from the list.
◆ HeapPushUnique()
Insert into the list at the proper order (see binary heap) but only if it's not already contains by the list.
◆ IsHeap()
| bool FSlateInvalidationWidgetPostHeap::IsHeap |
( |
| ) |
const |
|
inline |
Returns the number of elements in the list.
◆ IsValidHeap_Debug()
| bool FSlateInvalidationWidgetPostHeap::IsValidHeap_Debug |
( |
| ) |
|
|
inline |
@retuns true if the heap is heapified.
◆ Num()
| int32 FSlateInvalidationWidgetPostHeap::Num |
( |
| ) |
const |
|
inline |
Returns the number of elements in the list.
◆ PushBackOrHeapUnique()
PushBackUnique or PushHeapUnique depending if the list is Heapified.
◆ PushBackUnique()
Insert at the end of the list but only if it's not already contains by the list.
◆ RemoveRange()
◆ Reset()
| void FSlateInvalidationWidgetPostHeap::Reset |
( |
bool |
bResetContained | ) |
|
|
inline |
Empties the list, but doesn't change memory allocations.
◆ NumberOfPreAllocatedElement
| constexpr int32 FSlateInvalidationWidgetPostHeap::NumberOfPreAllocatedElement = 100 |
|
staticconstexpr |
The documentation for this class was generated from the following file: