strided-perm 0.11.0

Cache-efficient tensor permutation / transpose (HPTT-inspired).
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92

use super::*;

#[test]
fn test_compute_order_column_major() {
    let dims = [4usize, 5];
    let strides = [1isize, 4];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, Some(0));
    assert_eq!(order[0], 0);
    assert_eq!(order[1], 1);
}

#[test]
fn test_compute_order_row_major() {
    let dims = [4usize, 5];
    let strides = [5isize, 1];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, Some(0));
    assert_eq!(order[0], 1);
    assert_eq!(order[1], 0);
}

#[test]
fn test_compute_order_mixed() {
    let dims = [4usize, 5];
    let out_strides = [1isize, 4];
    let in_strides = [5isize, 1];
    let strides_list: Vec<&[isize]> = vec![&out_strides, &in_strides];
    let order = compute_order(&dims, &strides_list, Some(0));
    assert_eq!(order[0], 0);
    assert_eq!(order[1], 1);
}

#[test]
fn test_compute_order_empty() {
    let dims: [usize; 0] = [];
    let strides: [isize; 0] = [];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, Some(0));
    assert!(order.is_empty());
}

#[test]
fn test_compute_order_dest_reorder() {
    // dest_index=1: should swap so destination is first (gets 2x weight)
    let dims = [4usize, 5];
    let src_strides = [1isize, 4]; // col-major
    let dst_strides = [5isize, 1]; // row-major
    let strides_list: Vec<&[isize]> = vec![&src_strides, &dst_strides];
    let order = compute_order(&dims, &strides_list, Some(1));
    // With dst (row-major) weighted 2x, dim 1 (stride 1 in dst) should be innermost
    assert_eq!(order.len(), 2);
}

#[test]
fn test_compute_order_no_dest() {
    let dims = [4usize, 5];
    let strides = [1isize, 4];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, None);
    assert_eq!(order.len(), 2);
}

#[test]
fn test_compute_order_dest_out_of_bounds() {
    // dest_index >= strides_list.len(): should skip reordering
    let dims = [4usize, 5];
    let strides = [1isize, 4];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, Some(5));
    assert_eq!(order.len(), 2);
}

#[test]
fn test_compute_order_empty_strides_list() {
    let dims = [4usize, 5, 6];
    let strides_list: Vec<&[isize]> = vec![];
    let order = compute_order(&dims, &strides_list, None);
    assert_eq!(order, vec![0, 1, 2]);
}

#[test]
fn test_compute_order_3d() {
    // 3D col-major
    let dims = [4usize, 5, 6];
    let strides = [1isize, 4, 20];
    let strides_list: Vec<&[isize]> = vec![&strides];
    let order = compute_order(&dims, &strides_list, Some(0));
    assert_eq!(order.len(), 3);
    // Col-major: innermost should be dim 0
    assert_eq!(order[0], 0);
}