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
|
import { FP } from '../../../../../util/floating_point.js';
import { makeCaseCache } from '../../case_cache.js';
// Cases: [f32|f16|abstract]_[non_]const
const scalar_cases = (['f32', 'f16', 'abstract'] as const)
.flatMap(trait =>
([true, false] as const).map(nonConst => ({
[`${trait}_${nonConst ? 'non_const' : 'const'}`]: () => {
if (trait === 'abstract' && nonConst) {
return [];
}
return FP[trait].generateScalarPairToIntervalCases(
FP[trait].scalarRange(),
FP[trait].scalarRange(),
nonConst ? 'unfiltered' : 'finite',
// distance has an inherited accuracy, so is only expected to be as accurate as f32
FP[trait !== 'abstract' ? trait : 'f32'].distanceInterval
);
},
}))
)
.reduce((a, b) => ({ ...a, ...b }), {});
// Cases: [f32|f16|abstract]_vecN_[non_]const
const vec_cases = (['f32', 'f16', 'abstract'] as const)
.flatMap(trait =>
([2, 3, 4] as const).flatMap(dim =>
([true, false] as const).map(nonConst => ({
[`${trait}_vec${dim}_${nonConst ? 'non_const' : 'const'}`]: () => {
if (trait === 'abstract' && nonConst) {
return [];
}
return FP[trait].generateVectorPairToIntervalCases(
FP[trait].sparseVectorRange(dim),
FP[trait].sparseVectorRange(dim),
nonConst ? 'unfiltered' : 'finite',
// distance has an inherited accuracy, so is only expected to be as accurate as f32
FP[trait !== 'abstract' ? trait : 'f32'].distanceInterval
);
},
}))
)
)
.reduce((a, b) => ({ ...a, ...b }), {});
export const d = makeCaseCache('distance', {
...scalar_cases,
...vec_cases,
});
|
