pub fn rotate_left(&mut self, mid: usize) {
        assert!(mid <= self.len());
        let k = self.len() - mid;
        if mid <= k {
            unsafe { self.rotate_left_inner(mid) }
        } else {
            unsafe { self.rotate_right_inner(k) }
        }
    }
Binary searches this sorted `VecDeque` for a given element.

If the value is found then [`Result::Ok`] is returned, containing the
index of the matching element. If there are multiple matches, then any
one of the matches could b
benchmarks/haystacks/code/rust-library.rs