fn delete_index(skip_indices_array: &mut Vec<usize>, i: usize) {
        let in_original_problem = RemoveRows::<MP>::get_underlying_index(skip_indices_array, i);
        debug_assert!(skip_indices_array.contains(&in_original_problem));

        let insertion_index = match skip_indices_array.binary_search(&in_original_problem) {
            Ok(_) => panic!("Deleting an index that already was deleted."),
            Err(nr) => nr,
        };
        skip_indices_array.insert(insertion_index, in_original_problem);
    }
/// Method abstracting over the row and column deletion methods.
///
/// # Arguments
///
/// * `i`: Index in the reduced version of the problem to be deleted from the original problem.
Method abstracting over the row and column deletion methods.
Method abstracting over the row and column deletion methods .
fn delete_index(skip_indices_array: &mut Vec<usize>, i: usize) {
        let in_original_problem = RemoveRows::<MP>::get_underlying_index(skip_indices_array, i);
        debug_assert!(skip_indices_array.contains(&in_original_problem));
        let insertion_index = match skip_indices_array.binary_search(&in_original_problem) {
            Ok(_) => panic!("Deleting an index that already was deleted."),
            Err(nr) => nr,
        };
        skip_indices_array.insert(insertion_index, in_original_problem);
    }
fn delete_index ( skip_indices_array : & mut Vec < usize > , i : usize ) { let in_original_problem = RemoveRows :: < MP > :: get_underlying_index ( skip_indices_array , i ) ; debug_assert ! ( skip_indices_array contains ( in_original_problem ) ) ; let insertion_index = match skip_indices_array . binary_search ( & in_original_problem ) { Ok ( _ ) => panic ! ( " " ) , Err ( nr ) => nr , } ; skip_indices_array . insert ( insertion_index , in_original_problem ) ; }
Method abstracting over the row and column deletion methods.
Method abstracting over the row and column deletion methods .
skip_indices_array
&mut Vec<usize>
i
usize
skip_indices_array
&mut Vec<usize>
i
usize