fn query_entry(&self, key: &K) -> Result<(&Bucket<K, V>, *const Entry<K, V>), Error> {
        let bucket = &self.buckets[key.bucket::<N>()];
        let map_lock = bucket.lock_map();

        if let Some(entry) = map_lock.get(key) {
            bucket.use_entry(entry);
            Ok((bucket, &**entry))
        } else {
            Err(Error::NoEntry)
        }
    }
/// queries an entry and detaches it from the LRU
queries an entry and detaches it from the LRU
queries an entry and detaches it from the LRU
fn query_entry(&self, key: &K) -> Result<(&Bucket<K, V>, *const Entry<K, V>), Error> {
        let bucket = &self.buckets[key.bucket::<N>()];
        let map_lock = bucket.lock_map();
        if let Some(entry) = map_lock.get(key) {
            bucket.use_entry(entry);
            Ok((bucket, &**entry))
        } else {
            Err(Error::NoEntry)
        }
    }
fn query_entry ( & self , key : & K ) -> Result < ( & Bucket < K , V > , * const Entry < K , V > ) , Error > { let bucket = & self . buckets [ key . bucket :: < N > ( ) ] ; let map_lock = bucket . lock_map ( ) ; if let Some ( entry ) = map_lock . get ( key ) { bucket . use_entry ( entry ) ; Ok ( ( bucket , & * * entry ) ) } else { Err ( Error :: NoEntry ) } }
queries an entry and detaches it from the LRU
queries an entry and detaches it from the LRU
&self
key
&K
&self
key
&K