fn remove_indices(&mut self, indices: &[usize]) {
        debug_assert!(indices.len() <= self.len());
        debug_assert!(indices.is_sorted());
        // All values are unique
        debug_assert!(indices.iter().collect::<HashSet<_>>().len() == indices.len());
        debug_assert!(indices.iter().all(|&i| i < self.len()));

        remove_indices(&mut self.data, indices);
    }
/// Reduce the size of the vector by removing values.
///
/// # Arguments
///
/// * `indices`: A set of indices to remove from the vector, assumed sorted.
Reduce the size of the vector by removing values.
Reduce the size of the vector by removing values .
fn remove_indices(&mut self, indices: &[usize]) {
        debug_assert!(indices.len() <= self.len());
        debug_assert!(indices.is_sorted());
        // All values are unique
        debug_assert!(indices.iter().collect::<HashSet<_>>().len() == indices.len());
        debug_assert!(indices.iter().all(|&i| i < self.len()));
        remove_indices(&mut self.data, indices);
    }
fn remove_indices ( & mut self , indices : & [ usize ] ) { debug_assert ! ( indices len ( ) self len ( ) ) ; debug_assert ! ( indices is_sorted ( ) ) ; // All values are unique debug_assert ! ( indices iter ( ) collect HashSet ( ) len ( ) indices len ( ) ) ; debug_assert ! ( indices iter ( ) all ( i i self len ( ) ) ) ; remove_indices ( & mut self . data , indices ) ; }
Reduce the size of the vector by removing values.
Reduce the size of the vector by removing values .
&mut self
indices
&[usize]
&mut self
indices
&[usize]