fn remove_minor_indices(&mut self, indices: &[usize]) {
        debug_assert!(indices.len() <= self.minor_dimension_size);
        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.minor_dimension_size));

        for j in 0..self.major_dimension_size {
            remove_sparse_indices(&mut self.data[j], indices);
        }
        self.minor_dimension_size -= indices.len();
    }
/// Remove rows from the matrix.
///
/// # Arguments
///
/// * `indices`: Rows to be removed, is assumed sorted.
Remove rows from the matrix.
Remove rows from the matrix .
fn remove_minor_indices(&mut self, indices: &[usize]) {
        debug_assert!(indices.len() <= self.minor_dimension_size);
        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.minor_dimension_size));
        for j in 0..self.major_dimension_size {
            remove_sparse_indices(&mut self.data[j], indices);
        }
        self.minor_dimension_size -= indices.len();
    }
fn remove_minor_indices ( & mut self , indices : & [ usize ] ) { debug_assert ! ( indices len ( ) self minor_dimension_size ) ; 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 minor_dimension_size ) ) ; for j in 0 .. self . major_dimension_size { remove_sparse_indices ( & mut self . data [ j ] , indices ) ; } self . minor_dimension_size -= indices . len ( ) ; }
Remove rows from the matrix.
Remove rows from the matrix .
&mut self
indices
&[usize]
&mut self
indices
&[usize]