fn advance_until(&mut self, t: &T) {
        self.index += match self.elements[self.index..].binary_search(t) {
            Ok(index) => index,
            Err(index) => index,
        };
    }
/// Advance this iterator to the next item at or after the given item.
/// Implementation is O(log(n)).
Advance this iterator to the next item at or after the given item.
Advance this iterator to the next item at or after the given item .
fn advance_until(&mut self, t: &T) {
        self.index += match self.elements[self.index..].binary_search(t) {
            Ok(index) => index,
            Err(index) => index,
        };
    }
fn advance_until ( & mut self , t : & T ) { self . index += match self . elements [ self . index .. ] . binary_search ( t ) { Ok ( index ) => index , Err ( index ) => index , } ; }
Advance this iterator to the next item at or after the given item.
Advance this iterator to the next item at or after the given item .
&mut self
t
&T
&mut self
t
&T