MRU< T > Class Template Reference

A template container designed to provide a lightweight "most recently used" functionality. "Least recently used" is also implemented. More...

#include <mru.h>

Inheritance diagram for MRU< T >:

[legend]

List of all members.

Public Types
typedef rep_type::iterator	iterator
typedef std::list< T >	rep_type
typedef T	value_type
Public Member Functions
void	activate (T const &item)
	Find the item of interest and mark it as the most recently used or add it to the container as the most recently used.
void	discard (T const &item)
	Remove the specified item from the container.
bool	empty () const
iterator	end ()
iterator	leastRecent ()
iterator	mostRecent ()
Private Member Functions
iterator	find (T const &query)
Private Attributes
rep_type	data_

Detailed Description

template<class T>
class cxxtls::MRU< T >

A template container designed to provide a lightweight "most recently used" functionality. "Least recently used" is also implemented.

Key features:

use activate(T) to both add items and promote them to be the most recently used.

use discard(T) to remove items from the container

use mostRecent() to get an iterator to the most recently activated item. May return end..

use leastRecent() to get an iterator to the least recently activated item. May return end().

empty() tells you if the container is empty, as does the expression mostRecent() == end().

The general expectation is that applications will use this container to access no more than a few hundred items. A hash_list could be used for the rep_type if more than this will be needed. It provides O(1) amortized lookups which will speed up finds.

Definition at line 37 of file mru.h.