lru_cache.h File Reference

Bounded cache that drops the least recently used entries. Private to the library. More...

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <unordered_map>
#include <utility>
#include <vector>

Include dependency graph for lru_cache.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	asw::detail::LruCache< Key, Value, Hash, Equal >
	A hash map with a size limit. When full, the least recently used half is dropped, so entries in use every frame stay cached. More...
struct	asw::detail::LruCache< Key, Value, Hash, Equal >::Entry

Namespaces
namespace	asw
namespace	asw::detail

Functions
void	asw::detail::hash_combine (std::size_t &seed, std::size_t hash)
	Combine a hash into a seed, as boost::hash_combine does.

Detailed Description

Bounded cache that drops the least recently used entries. Private to the library.

Definition in file lru_cache.h.