burn-flex 0.21.0

A fast, portable CPU backend for the Burn framework
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

/// Comparison operation type.
#[derive(Clone, Copy)]
pub enum CmpOp {
    Gt,
    Ge,
    Lt,
    Le,
    Eq,
    Ne,
}

/// Scalar boolean NOT: out[i] = !a[i] (0 becomes 1, non-zero becomes 0)
#[inline]
pub fn bool_not_u8(a: &[u8], out: &mut [u8]) {
    for i in 0..a.len() {
        out[i] = (a[i] == 0) as u8;
    }
}

/// Scalar boolean NOT in-place: a[i] = !a[i]
#[inline]
pub fn bool_not_inplace_u8(a: &mut [u8]) {
    for x in a.iter_mut() {
        *x = (*x == 0) as u8;
    }
}

/// Scalar boolean AND: out[i] = a[i] & b[i]
#[inline]
pub fn bool_and_u8(a: &[u8], b: &[u8], out: &mut [u8]) {
    for i in 0..a.len() {
        out[i] = a[i] & b[i];
    }
}

/// Scalar boolean OR: out[i] = a[i] | b[i]
#[inline]
pub fn bool_or_u8(a: &[u8], b: &[u8], out: &mut [u8]) {
    for i in 0..a.len() {
        out[i] = a[i] | b[i];
    }
}

/// Scalar boolean XOR: out[i] = a[i] ^ b[i]
#[inline]
pub fn bool_xor_u8(a: &[u8], b: &[u8], out: &mut [u8]) {
    for i in 0..a.len() {
        out[i] = a[i] ^ b[i];
    }
}

/// Scalar boolean AND in-place: a[i] &= b[i]
#[inline]
pub fn bool_and_inplace_u8(a: &mut [u8], b: &[u8]) {
    for i in 0..a.len() {
        a[i] &= b[i];
    }
}

/// Scalar boolean OR in-place: a[i] |= b[i]
#[inline]
pub fn bool_or_inplace_u8(a: &mut [u8], b: &[u8]) {
    for i in 0..a.len() {
        a[i] |= b[i];
    }
}

/// Scalar boolean XOR in-place: a[i] ^= b[i]
#[inline]
pub fn bool_xor_inplace_u8(a: &mut [u8], b: &[u8]) {
    for i in 0..a.len() {
        a[i] ^= b[i];
    }
}