pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
    {
	// somehow this is faster than using index, even though here we search twice????? i don't know why but there you go
	if let None =  self.0.iter()
	    .filter(|x| x.search(&key).as_ref().and_then(|(k, v)| if k==&key {None} else {Some((k,v))}).is_none())
	    .next() {
		self.new_page();
	    }
	self.fuck_entry(key).unwrap()
    }
/// Get an `Entry` for the `key` that lets you get or insert the value
Get an `Entry` for the `key` that lets you get or insert the value
Get an ` Entry ` for the ` key ` that lets you get or insert the value
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
    {
	// somehow this is faster than using index, even though here we search twice????? i don't know why but there you go
	if let None =  self.0.iter()
	    .filter(|x| x.search(&key).as_ref().and_then(|(k, v)| if k==&key {None} else {Some((k,v))}).is_none())
	    .next() {
		self.new_page();
	    }
	self.fuck_entry(key).unwrap()
    }
pub fn entry ( & mut self , key : K ) -> Entry < ' _ , K , V > { // somehow this is faster than using index, even though here we search twice????? i don't know why but there you go if let None = self . 0 . iter ( ) . filter ( | x | x . search ( & key ) . as_ref ( ) . and_then ( | ( k , v ) | if k == & key { None } else { Some ( ( k , v ) ) } ) . is_none ( ) ) . next ( ) { self . new_page ( ) ; } self . fuck_entry ( key ) . unwrap ( ) }
Get an `Entry` for the `key` that lets you get or insert the value
Get an ` Entry ` for the ` key ` that lets you get or insert the value
&mut self
key
K