Uses an optimized double linked list to keep track of the most and least recently used index. More...

#include <RecentlyUsedIndex.h>

Public Member Functions
	RecentlyUsedIndex (T size)

void	Touch (T index)
	Pushes the index to end of the list, making it the most recently used.

void	Flush (T index)
	Pushes the index to the start of the list, making it the least recently used.

void	FlushAll ()
	Flush all indices, returning the cache to it's initial state.

T	TouchLeastRecentlyUsed ()

T	GetLeastRecentlyUsed () const

T	GetMostRecentlyUsed () const

void	GetIndicesInOrder (const AZStd::function< void(T)> &callback) const

Static Public Attributes
static constexpr T	InvalidIndex = AZStd::numeric_limits<T>::max()

Detailed Description

template<typename T>
class AZ::IO::RecentlyUsedIndex< T >

Uses an optimized double linked list to keep track of the most and least recently used index.

Member Function Documentation

template<typename T >

T AZ::IO::RecentlyUsedIndex< T >::TouchLeastRecentlyUsed ( )

Touches the least recently used index. This has better performance than using Touch with the least recently used index.

The documentation for this class was generated from the following files: