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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
use libnum;
use std::cmp;
use std::ops::{
Add,
};
use LinalgScalar;
pub fn unrolled_sum<A>(mut xs: &[A]) -> A
where A: Clone + Add<Output=A> + libnum::Zero,
{
let mut sum = A::zero();
let (mut p0, mut p1, mut p2, mut p3,
mut p4, mut p5, mut p6, mut p7) =
(A::zero(), A::zero(), A::zero(), A::zero(),
A::zero(), A::zero(), A::zero(), A::zero());
while xs.len() >= 8 {
p0 = p0 + xs[0].clone();
p1 = p1 + xs[1].clone();
p2 = p2 + xs[2].clone();
p3 = p3 + xs[3].clone();
p4 = p4 + xs[4].clone();
p5 = p5 + xs[5].clone();
p6 = p6 + xs[6].clone();
p7 = p7 + xs[7].clone();
xs = &xs[8..];
}
sum = sum.clone() + (p0 + p4);
sum = sum.clone() + (p1 + p5);
sum = sum.clone() + (p2 + p6);
sum = sum.clone() + (p3 + p7);
for i in 0..xs.len() {
if i >= 7 { break; }
sum = sum.clone() + xs[i].clone()
}
sum
}
pub fn unrolled_dot<A>(xs: &[A], ys: &[A]) -> A
where A: LinalgScalar,
{
debug_assert_eq!(xs.len(), ys.len());
let len = cmp::min(xs.len(), ys.len());
let mut xs = &xs[..len];
let mut ys = &ys[..len];
let mut sum = A::zero();
let (mut p0, mut p1, mut p2, mut p3,
mut p4, mut p5, mut p6, mut p7) =
(A::zero(), A::zero(), A::zero(), A::zero(),
A::zero(), A::zero(), A::zero(), A::zero());
while xs.len() >= 8 {
p0 = p0 + xs[0] * ys[0];
p1 = p1 + xs[1] * ys[1];
p2 = p2 + xs[2] * ys[2];
p3 = p3 + xs[3] * ys[3];
p4 = p4 + xs[4] * ys[4];
p5 = p5 + xs[5] * ys[5];
p6 = p6 + xs[6] * ys[6];
p7 = p7 + xs[7] * ys[7];
xs = &xs[8..];
ys = &ys[8..];
}
sum = sum + (p0 + p4);
sum = sum + (p1 + p5);
sum = sum + (p2 + p6);
sum = sum + (p3 + p7);
for i in 0..xs.len() {
if i >= 7 { break; }
unsafe {
sum = sum + xs[i] * *ys.get_unchecked(i);
}
}
sum
}
pub fn unrolled_eq<A>(xs: &[A], ys: &[A]) -> bool
where A: PartialEq
{
debug_assert_eq!(xs.len(), ys.len());
let len = cmp::min(xs.len(), ys.len());
let mut xs = &xs[..len];
let mut ys = &ys[..len];
while xs.len() >= 8 {
if (xs[0] != ys[0])
| (xs[1] != ys[1])
| (xs[2] != ys[2])
| (xs[3] != ys[3])
| (xs[4] != ys[4])
| (xs[5] != ys[5])
| (xs[6] != ys[6])
| (xs[7] != ys[7]) { return false; }
xs = &xs[8..];
ys = &ys[8..];
}
for i in 0..xs.len() {
if xs[i] != ys[i] {
return false;
}
}
true
}