pub(crate) fn insert(&mut self, e: T) -> bool {
		if self.set.insert(e) {
			if self.set.len() == usize::from(self.limit) {
				self.set.pop_front(); // remove oldest entry
			}
			return true
		}
		false
	}
/// Insert element into the set.
///
/// Returns `true` if this is a new element to the set, `false` otherwise.
/// Maintains the limit of the set by removing the oldest entry if necessary.
/// Inserting the same element will update its LRU position.
Insert element into the set.
Returns `true` if this is a new element to the set, `false` otherwise.
Maintains the limit of the set by removing the oldest entry if necessary.
Inserting the same element will update its LRU position.
Insert element into the set . Returns ` true ` if this is a new element to the set ` false ` otherwise . Maintains the limit of the set by removing the oldest entry if necessary . Inserting the same element will update its LRU position .
pub(crate) fn insert(&mut self, e: T) -> bool {
		if self.set.insert(e) {
			if self.set.len() == usize::from(self.limit) {
				self.set.pop_front(); // remove oldest entry
			}
			return true
		}
		false
	}
pub ( crate ) fn insert ( & mut self , e : T ) -> bool { if self . set . insert ( e ) { if self . set . len ( ) == usize :: from ( self . limit ) { self . set . pop_front ( ) ; // remove oldest entry } return true } false }
Insert element into the set.
Insert element into the set .
&mut self
e
T
&mut self
e
T