/// Allocate memory for a key of known size; this will claim the memory until the handle is
/// dropped or inserted into the cache.
/// Note that if you do not insert the handle, it will not be visible to `get`, and the
/// associated memory will be pinned until the handle is inserted or dropped. Do not hold onto
/// handles for long time periods, as this will reduce cachelib's efficiency.
Allocate memory for a key of known size; this will claim the memory until the handle is
dropped or inserted into the cache.
Note that if you do not insert the handle, it will not be visible to `get`, and the
associated memory will be pinned until the handle is inserted or dropped. Do not hold onto
handles for long time periods, as this will reduce cachelib's efficiency.
Allocate memory for a key of known size ; this will claim the memory until the handle is dropped or inserted into the cache . Note that if you do not insert the handle it will not be visible to ` get ` and the associated memory will be pinned until the handle is inserted or dropped . Do not hold onto handles for long time periods as this will reduce cachelib ' s efficiency .
pub fn allocate<K>(
        &self,
        _key: K,
        _size: usize,
    ) -> Result<Option<LruCacheHandle<ReadWriteShared>>>
    where
        K: AsRef<[u8]>,
    {
        Ok(None)
    }
pub fn allocate < K > ( & self , _key : K , _size : usize , ) -> Result < Option < LruCacheHandle < ReadWriteShared > > > where K : AsRef < [ u8 ] > , { Ok ( None ) }
Allocate memory for a key of known size; this will claim the memory until the handle is
dropped or inserted into the cache.
Allocate memory for a key of known size ; this will claim the memory until the handle is dropped or inserted into the cache .
&self
_key
K
_size
usize