libmoost
|
#include <list>
#include <limits>
#include <boost/functional/hash.hpp>
#include <boost/type_traits/is_integral.hpp>
#include <boost/function.hpp>
#include "sparse_hash_map.hpp"
Go to the source code of this file.
Classes | |
struct | moost::container::get_deleted_key< Key, bool > |
struct | moost::container::get_deleted_key< Key, true > |
class | moost::container::lru< Key, Data, HashFcn > |
an lru is a collection of keys and values, with a max size. Once the max size is reached, further inserted elements push out least recently used elements. More... | |
Namespaces | |
namespace | moost |
Creates a unique temporary directory; removed on scope exit. | |
namespace | moost::container |