Inserts a key-value pair into the cache. If the key already existed, the old value is returned. # Examples ``` use lru_cache::LruCache; let mut cac

Removes the given key from the cache and returns its corresponding value. # Examples ``` use lru_cache::LruCache; let mut cache = LruCache::new(2);

Returns a mutable reference to the value corresponding to the given key in the cache, if any. # Examples ``` use lru_cache::LruCache; let mut cache

Returns an iterator over the cache's key-value pairs in least- to most-recently-used order. Accessing the cache through the iterator does _not_ affec

Returns the number of key-value pairs in the cache.

Sets the number of key-value pairs the cache can hold. Removes least-recently-used key-value pairs if necessary. # Examples ``` use lru_cache::LruCa

Returns the maximum number of key-value pairs the cache can hold. # Examples ``` use lru_cache::LruCache; let mut cache: LruCache<i32, &str> = LruCa

Removes all key-value pairs from the cache.

Returns an iterator over the cache's key-value pairs in least- to most-recently-used order, with mutable references to the values. Accessing the cach

Checks if the map contains the given key. # Examples ``` use lru_cache::LruCache; let mut cache = LruCache::new(1); cache.insert(1, "a"); assert_e

Returns `true` if the cache contains no key-value pairs.

Creates an empty cache that can hold at most `capacity` items. # Examples ``` use lru_cache::LruCache; let mut cache: LruCache<i32, &str> = LruCache

Creates an empty cache that can hold at most `capacity` items with the given hash builder.