blu 0.2.1

LU factorization with dynamic Markowitz search and columnwise threshold pivoting
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

// Copyright (C) 2016-2018 ERGO-Code
// Copyright (C) 2022-2023 Richard Lincoln

use crate::LUInt;

pub(crate) enum Task {
    NoTask,
    Singletons,
    SetupBump,
    FactorizeBump,
    BuildFactors,
}

impl Default for Task {
    fn default() -> Self {
        Self::Singletons
    }
}

pub(crate) fn iswap(x: &mut [LUInt], i: usize, j: usize) {
    let t = x[i];
    x[i] = x[j];
    x[j] = t;
}

pub(crate) fn fswap(x: &mut [f64], i: usize, j: usize) {
    let t = x[i];
    x[i] = x[j];
    x[j] = t;
}