/// Returns an iterator over the gaps (unbounded keys) of the map.
Returns an iterator over the gaps (unbounded keys) of the map.
Returns an iterator over the gaps ( unbounded keys ) of the map .
pub fn gaps(&self) -> Gaps<K, V, C> {
		Gaps {
			inner: self.btree.iter(),
			prev: None,
			done: false,
		}
	}
pub fn gaps ( & self ) -> Gaps < K , V , C > { Gaps { inner : self . btree . iter ( ) , prev : None , done : false , } }
Returns an iterator over the gaps (unbounded keys) of the map.
Returns an iterator over the gaps ( unbounded keys ) of the map .
&self