![]() |
UDocumentation UE5.7 10.02.2026 (Source)
API documentation for Unreal Engine 5.7
|
#include <MotionDelayBuffer.h>
Public Member Functions | |
| TCircularHistoryBuffer (uint32 InitialCapacity=0) | |
| ElementType & | Add (const ElementType &Element) |
| void | Resize (uint32 NewCapacity) |
| ElementType & | operator[] (uint32 Index) |
| const ElementType & | operator[] (uint32 Index) const |
| void | InsertAt (uint32 Index, const ElementType &Element) |
| uint32 | Capacity () const |
| int32 | Num () const |
| void | Empty () |
| bool | IsEmpty () const |
| bool | IsFull () const |
Modeled after TCircularBuffer/Queue, but resizable with it's own stack-style way of indexing (0 = most recent value added)
| TCircularHistoryBuffer< ElementType >::TCircularHistoryBuffer | ( | uint32 | InitialCapacity = 0 | ) |
| ElementType & TCircularHistoryBuffer< ElementType >::Add | ( | const ElementType & | Element | ) |
|
inline |
|
inline |
| void TCircularHistoryBuffer< ElementType >::InsertAt | ( | uint32 | Index, |
| const ElementType & | Element | ||
| ) |
|
inline |
|
inline |
|
inline |
|
inline |
NOTE: Will clamp to the oldest value available if the buffer isn't full and the index is larger than the number of values buffered.
| Index | Stack-esque indexing: 0 => the most recent value added, 1+n => Older entries, 1+n back from the newest. |
|
inline |
| void TCircularHistoryBuffer< ElementType >::Resize | ( | uint32 | NewCapacity | ) |