quantified.uncertainty/squiggle
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Adds tests (4)

Browse Source
This commit is contained in:
Roman Galochkin 2020-02-25 10:38:08 +03:00
parent f553fb742e
commit 822a803d01
2 changed files with 10 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
__tests__/Functions__Test.re
View File

@ -60,4 +60,13 @@ describe("Functions", () => {
expect(Functions.min([|(-1.), (-2.), 0., 20., (-2.2)|])) expect(Functions.min([|(-1.), (-2.), 0., 20., (-2.2)|]))
|> toEqual(-2.2) |> toEqual(-2.2)
}); });
test("max#1", () => {
expect(Functions.max([|1., 2., 3.|])) |> toEqual(3.)
});
test("max#2", () => {
expect(Functions.max([|(-1.), (-2.), 0., 20.|])) |> toEqual(20.)
});
test("max#3", () => {
expect(Functions.max([|(-1.), (-2.), 0., (-2.2)|])) |> toEqual(0.)
});
}); });

2
src/utility/lib/Functions.re
View File

@ -12,7 +12,7 @@ let interpolate =
let sum = Belt.Array.reduce(_, 0., (i, j) => i +. j); let sum = Belt.Array.reduce(_, 0., (i, j) => i +. j);
let mean = a => sum(a) /. (Array.length(a) |> float_of_int); let mean = a => sum(a) /. (Array.length(a) |> float_of_int);
let min = a => Belt.Array.reduce(a, a[0], (i, j) => i < j ? i : j); let min = a => Belt.Array.reduce(a, a[0], (i, j) => i < j ? i : j);
let max = Belt.Array.reduce(_, 0., (i, j) => i > j ? i : j); let max = a => Belt.Array.reduce(a, a[0], (i, j) => i > j ? i : j);
let up = (a, b) => Array.make(b - a, a) |> Array.mapi((i, c) => c + i); let up = (a, b) => Array.make(b - a, a) |> Array.mapi((i, c) => c + i);
let down = (a, b) => Array.make(a - b, a) |> Array.mapi((i, c) => c - i); let down = (a, b) => Array.make(a - b, a) |> Array.mapi((i, c) => c - i);
let range = (min: float, max: float, n: int): array(float) => { let range = (min: float, max: float, n: int): array(float) => {