@reventlessdev/reventless-seed 1.0.0-alpha.6 → 1.0.0-alpha.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +15 -0
- package/lib/bs/.compiler.log +2 -2
- package/lib/bs/ReventlessSeed.cmi +0 -0
- package/lib/bs/ReventlessSeed.cmt +0 -0
- package/lib/bs/ReventlessSeed.mlmap +1 -1
- package/lib/bs/compiler-info.json +1 -1
- package/lib/bs/src/Seed-ReventlessSeed.cmi +0 -0
- package/lib/bs/src/Seed-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed.ast +0 -0
- package/lib/bs/src/Seed.res +4 -5
- package/lib/bs/src/Seed_Client-ReventlessSeed.cmi +0 -0
- package/lib/bs/src/Seed_Client-ReventlessSeed.cmj +0 -0
- package/lib/bs/src/Seed_Client-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed_Client.ast +0 -0
- package/lib/bs/src/Seed_Client.res +4 -0
- package/lib/bs/src/Seed_Client.res.mjs +5 -0
- package/lib/bs/src/Seed_Connect-ReventlessSeed.cmi +0 -0
- package/lib/bs/src/Seed_Connect-ReventlessSeed.cmj +0 -0
- package/lib/bs/src/Seed_Connect-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed_Connect.ast +0 -0
- package/lib/bs/src/Seed_Connect.res +13 -49
- package/lib/bs/src/Seed_Connect.res.mjs +5 -26
- package/lib/bs/src/Seed_Prompt-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed_Runner-ReventlessSeed.cmi +0 -0
- package/lib/bs/src/Seed_Runner-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed_Upload-ReventlessSeed.cmi +0 -0
- package/lib/bs/src/Seed_Upload-ReventlessSeed.cmj +0 -0
- package/lib/bs/src/Seed_Upload-ReventlessSeed.cmt +0 -0
- package/lib/bs/src/Seed_Upload.ast +0 -0
- package/lib/bs/src/Seed_Upload.res +39 -100
- package/lib/bs/src/Seed_Upload.res.mjs +61 -93
- package/lib/bs/tests/Seed_RandomTest-ReventlessSeed.cmi +0 -0
- package/lib/bs/tests/Seed_RandomTest-ReventlessSeed.cmj +0 -0
- package/lib/bs/tests/Seed_RandomTest-ReventlessSeed.cmt +0 -0
- package/lib/bs/tests/Seed_RandomTest.ast +0 -0
- package/lib/bs/tests/Seed_RandomTest.res +160 -0
- package/lib/bs/tests/Seed_RandomTest.res.mjs +208 -0
- package/lib/ocaml/.compiler.log +2 -2
- package/lib/ocaml/ReventlessSeed.cmi +0 -0
- package/lib/ocaml/ReventlessSeed.cmt +0 -0
- package/lib/ocaml/ReventlessSeed.mlmap +1 -1
- package/lib/ocaml/Seed-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed.ast +0 -0
- package/lib/ocaml/Seed.res +4 -5
- package/lib/ocaml/Seed_Client-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed_Client-ReventlessSeed.cmj +0 -0
- package/lib/ocaml/Seed_Client-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_Client.ast +0 -0
- package/lib/ocaml/Seed_Client.res +4 -0
- package/lib/ocaml/Seed_Connect-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed_Connect-ReventlessSeed.cmj +0 -0
- package/lib/ocaml/Seed_Connect-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_Connect.ast +0 -0
- package/lib/ocaml/Seed_Connect.res +13 -49
- package/lib/ocaml/Seed_Prompt-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_RandomTest-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed_RandomTest-ReventlessSeed.cmj +0 -0
- package/lib/ocaml/Seed_RandomTest-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_RandomTest.ast +0 -0
- package/lib/ocaml/Seed_RandomTest.res +160 -0
- package/lib/ocaml/Seed_Runner-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed_Runner-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_Upload-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/Seed_Upload-ReventlessSeed.cmj +0 -0
- package/lib/ocaml/Seed_Upload-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/Seed_Upload.ast +0 -0
- package/lib/ocaml/Seed_Upload.res +39 -100
- package/package.json +2 -2
- package/src/Seed.res +4 -5
- package/src/Seed_Client.res +4 -0
- package/src/Seed_Client.res.mjs +5 -0
- package/src/Seed_Connect.res +13 -49
- package/src/Seed_Connect.res.mjs +5 -26
- package/src/Seed_Upload.res +39 -100
- package/src/Seed_Upload.res.mjs +61 -93
- package/tests/Seed_RandomTest.res +160 -0
- package/tests/Seed_RandomTest.res.mjs +208 -0
- package/lib/bs/tests/UploadEndpointResolutionTest-ReventlessSeed.cmi +0 -0
- package/lib/bs/tests/UploadEndpointResolutionTest-ReventlessSeed.cmj +0 -0
- package/lib/bs/tests/UploadEndpointResolutionTest-ReventlessSeed.cmt +0 -0
- package/lib/bs/tests/UploadEndpointResolutionTest.ast +0 -0
- package/lib/bs/tests/UploadEndpointResolutionTest.res +0 -100
- package/lib/bs/tests/UploadEndpointResolutionTest.res.mjs +0 -59
- package/lib/ocaml/UploadEndpointResolutionTest-ReventlessSeed.cmi +0 -0
- package/lib/ocaml/UploadEndpointResolutionTest-ReventlessSeed.cmj +0 -0
- package/lib/ocaml/UploadEndpointResolutionTest-ReventlessSeed.cmt +0 -0
- package/lib/ocaml/UploadEndpointResolutionTest.ast +0 -0
- package/lib/ocaml/UploadEndpointResolutionTest.res +0 -100
- package/tests/UploadEndpointResolutionTest.res +0 -100
- package/tests/UploadEndpointResolutionTest.res.mjs +0 -59
|
@@ -1,6 +1,9 @@
|
|
|
1
1
|
// Generated by ReScript, PLEASE EDIT WITH CARE
|
|
2
2
|
|
|
3
3
|
import * as Stdlib_Option from "@rescript/runtime/lib/es6/Stdlib_Option.js";
|
|
4
|
+
import * as Primitive_exceptions from "@rescript/runtime/lib/es6/Primitive_exceptions.js";
|
|
5
|
+
import * as Seed_Types$ReventlessSeed from "./Seed_Types.res.mjs";
|
|
6
|
+
import * as Seed_Client$ReventlessSeed from "./Seed_Client.res.mjs";
|
|
4
7
|
import * as Seed_Prompt$ReventlessSeed from "./Seed_Prompt.res.mjs";
|
|
5
8
|
|
|
6
9
|
function field(json, key) {
|
|
@@ -15,29 +18,8 @@ function asString(json) {
|
|
|
15
18
|
}
|
|
16
19
|
}
|
|
17
20
|
|
|
18
|
-
function
|
|
19
|
-
|
|
20
|
-
if (store !== undefined) {
|
|
21
|
-
return Stdlib_Option.orElse(uploadEndpoints[store], legacy);
|
|
22
|
-
} else {
|
|
23
|
-
return legacy;
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
|
|
27
|
-
function unresolvedReason(store, uploadEndpoints) {
|
|
28
|
-
let available = Object.keys(uploadEndpoints);
|
|
29
|
-
let match = Seed_Prompt$ReventlessSeed.envValue("SEED_SKIP_UPLOADS");
|
|
30
|
-
if (match !== undefined) {
|
|
31
|
-
return "SEED_SKIP_UPLOADS is set";
|
|
32
|
-
} else if (available.length !== 0) {
|
|
33
|
-
if (store !== undefined) {
|
|
34
|
-
return `this deployment publishes upload endpoints for ` + available.join(", ") + `, none for "` + store + `"`;
|
|
35
|
-
} else {
|
|
36
|
-
return `this deployment publishes only per-store upload endpoints (` + available.join(", ") + `) and this upload names no store`;
|
|
37
|
-
}
|
|
38
|
-
} else {
|
|
39
|
-
return "this deployment publishes no upload endpoint";
|
|
40
|
-
}
|
|
21
|
+
function uploadsSkipped() {
|
|
22
|
+
return Stdlib_Option.isSome(Seed_Prompt$ReventlessSeed.envValue("SEED_SKIP_UPLOADS"));
|
|
41
23
|
}
|
|
42
24
|
|
|
43
25
|
async function tryFetch(url, init) {
|
|
@@ -54,92 +36,78 @@ async function tryFetch(url, init) {
|
|
|
54
36
|
}
|
|
55
37
|
}
|
|
56
38
|
|
|
57
|
-
async function uploadAsset(
|
|
58
|
-
let
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
method: "POST",
|
|
77
|
-
headers: presignHeaders,
|
|
78
|
-
body: presignBody
|
|
79
|
-
});
|
|
80
|
-
if (m.TAG !== "Ok") {
|
|
39
|
+
async function uploadAsset(client, store, bytes, fileName, contentType) {
|
|
40
|
+
let query = `mutation { r: Upload_Presign(store: ` + JSON.stringify(store) + `, fileName: ` + JSON.stringify(fileName) + `, contentType: ` + JSON.stringify(contentType) + `) { uploadUrl storageRef } }`;
|
|
41
|
+
let presign;
|
|
42
|
+
try {
|
|
43
|
+
presign = {
|
|
44
|
+
TAG: "Ok",
|
|
45
|
+
_0: await Seed_Client$ReventlessSeed.gql(client, query, "Upload_Presign")
|
|
46
|
+
};
|
|
47
|
+
} catch (raw_m) {
|
|
48
|
+
let m = Primitive_exceptions.internalToException(raw_m);
|
|
49
|
+
presign = m.RE_EXN_ID === Seed_Types$ReventlessSeed.Failed ? ({
|
|
50
|
+
TAG: "Error",
|
|
51
|
+
_0: m._1
|
|
52
|
+
}) : ({
|
|
53
|
+
TAG: "Error",
|
|
54
|
+
_0: "Upload_Presign: unexpected error"
|
|
55
|
+
});
|
|
56
|
+
}
|
|
57
|
+
if (presign.TAG !== "Ok") {
|
|
81
58
|
return {
|
|
82
59
|
TAG: "Error",
|
|
83
|
-
_0: `presign: ` +
|
|
60
|
+
_0: `presign: ` + presign._0
|
|
84
61
|
};
|
|
85
62
|
}
|
|
86
|
-
let
|
|
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
|
-
if (m$1.TAG !== "Ok") {
|
|
113
|
-
return {
|
|
114
|
-
TAG: "Error",
|
|
115
|
-
_0: `upload PUT: ` + m$1._0
|
|
116
|
-
};
|
|
117
|
-
}
|
|
118
|
-
let putRes = m$1._0;
|
|
119
|
-
if (putRes.ok) {
|
|
120
|
-
return {
|
|
121
|
-
TAG: "Ok",
|
|
122
|
-
_0: match$1
|
|
123
|
-
};
|
|
124
|
-
}
|
|
125
|
-
let detail = await putRes.text();
|
|
63
|
+
let r = Stdlib_Option.getOr(field(presign._0, "r"), null);
|
|
64
|
+
let match = Stdlib_Option.flatMap(field(r, "uploadUrl"), asString);
|
|
65
|
+
let match$1 = Stdlib_Option.flatMap(field(r, "storageRef"), asString);
|
|
66
|
+
if (match === undefined) {
|
|
67
|
+
return {
|
|
68
|
+
TAG: "Error",
|
|
69
|
+
_0: "Upload_Presign response missing uploadUrl/storageRef"
|
|
70
|
+
};
|
|
71
|
+
}
|
|
72
|
+
if (match$1 === undefined) {
|
|
73
|
+
return {
|
|
74
|
+
TAG: "Error",
|
|
75
|
+
_0: "Upload_Presign response missing uploadUrl/storageRef"
|
|
76
|
+
};
|
|
77
|
+
}
|
|
78
|
+
let putUrl = new URL(match, Seed_Client$ReventlessSeed.endpoint(client)).href;
|
|
79
|
+
let m$1 = await tryFetch(putUrl, {
|
|
80
|
+
method: "PUT",
|
|
81
|
+
headers: Object.fromEntries([[
|
|
82
|
+
"content-type",
|
|
83
|
+
contentType
|
|
84
|
+
]]),
|
|
85
|
+
body: bytes
|
|
86
|
+
});
|
|
87
|
+
if (m$1.TAG !== "Ok") {
|
|
126
88
|
return {
|
|
127
89
|
TAG: "Error",
|
|
128
|
-
_0: `upload PUT
|
|
90
|
+
_0: `upload PUT: ` + m$1._0
|
|
91
|
+
};
|
|
92
|
+
}
|
|
93
|
+
let putRes = m$1._0;
|
|
94
|
+
if (putRes.ok) {
|
|
95
|
+
return {
|
|
96
|
+
TAG: "Ok",
|
|
97
|
+
_0: match$1
|
|
129
98
|
};
|
|
130
99
|
}
|
|
131
|
-
let detail
|
|
100
|
+
let detail = await putRes.text();
|
|
132
101
|
return {
|
|
133
102
|
TAG: "Error",
|
|
134
|
-
_0: `
|
|
103
|
+
_0: `upload PUT failed with HTTP ` + putRes.status.toString() + `: ` + detail
|
|
135
104
|
};
|
|
136
105
|
}
|
|
137
106
|
|
|
138
107
|
export {
|
|
139
108
|
field,
|
|
140
109
|
asString,
|
|
141
|
-
|
|
142
|
-
unresolvedReason,
|
|
110
|
+
uploadsSkipped,
|
|
143
111
|
tryFetch,
|
|
144
112
|
uploadAsset,
|
|
145
113
|
}
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
@@ -0,0 +1,160 @@
|
|
|
1
|
+
open JestGlobals
|
|
2
|
+
|
|
3
|
+
// `Seed_Random` exists so that two seed runs against a fresh store produce the
|
|
4
|
+
// same data — that is what makes a seeded store usable as a screenshot baseline
|
|
5
|
+
// or a comparison target. Its correctness is therefore not "looks random" but
|
|
6
|
+
// "repeats exactly, and stays inside the bounds it advertises".
|
|
7
|
+
//
|
|
8
|
+
// The suite is written around that: every case below fails for a generator that
|
|
9
|
+
// is subtly non-reproducible or that walks out of its range, and none of them
|
|
10
|
+
// would notice a change of algorithm that kept both properties.
|
|
11
|
+
|
|
12
|
+
describe("Seed_Random:", () => {
|
|
13
|
+
let take = (~seed, ~n) => {
|
|
14
|
+
let r = Seed_Random.make(~seed)
|
|
15
|
+
Array.make(~length=n, 0.0)->Array.map(_ => Seed_Random.float(r))
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
describe("reproducibility — the reason this module exists:", () => {
|
|
19
|
+
testSync("the same seed replays the same sequence", () =>
|
|
20
|
+
expect(take(~seed=42, ~n=25))->toEqual(take(~seed=42, ~n=25))
|
|
21
|
+
)
|
|
22
|
+
|
|
23
|
+
// Without this, a generator that returned a constant would satisfy the
|
|
24
|
+
// case above and nothing else in the suite would catch it.
|
|
25
|
+
testSync("different seeds diverge", () =>
|
|
26
|
+
expect(take(~seed=42, ~n=25) == take(~seed=43, ~n=25))->toBe(false)
|
|
27
|
+
)
|
|
28
|
+
|
|
29
|
+
testSync("a fresh generator does not continue the previous one", () => {
|
|
30
|
+
let r = Seed_Random.make(~seed=7)
|
|
31
|
+
let first = Seed_Random.float(r)
|
|
32
|
+
let _ = Seed_Random.float(r)
|
|
33
|
+
expect(Seed_Random.float(Seed_Random.make(~seed=7)))->toEqual(first)
|
|
34
|
+
})
|
|
35
|
+
})
|
|
36
|
+
|
|
37
|
+
describe("float stays a unit interval:", () => {
|
|
38
|
+
// mulberry32's last step is a signed 32-bit value folded back to unsigned.
|
|
39
|
+
// Get that fold wrong and roughly half the draws come out negative, which
|
|
40
|
+
// every consumer below (int, pick, sampleWeighted) silently mis-scales.
|
|
41
|
+
testSync("every draw is in [0, 1)", () =>
|
|
42
|
+
expect(take(~seed=99, ~n=500)->Array.every(f => f >= 0.0 && f < 1.0))->toBe(true)
|
|
43
|
+
)
|
|
44
|
+
|
|
45
|
+
testSync("and the draws are not all the same value", () => {
|
|
46
|
+
let draws = take(~seed=99, ~n=100)
|
|
47
|
+
expect(draws->Array.some(f => f != draws->Array.getUnsafe(0)))->toBe(true)
|
|
48
|
+
})
|
|
49
|
+
})
|
|
50
|
+
|
|
51
|
+
describe("int is inclusive on both ends, as documented:", () => {
|
|
52
|
+
let draws = (~min, ~max, ~n) => {
|
|
53
|
+
let r = Seed_Random.make(~seed=5)
|
|
54
|
+
Array.make(~length=n, 0)->Array.map(_ => Seed_Random.int(r, ~min, ~max))
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
testSync("never escapes the range", () =>
|
|
58
|
+
expect(draws(~min=3, ~max=7, ~n=500)->Array.every(i => i >= 3 && i <= 7))->toBe(true)
|
|
59
|
+
)
|
|
60
|
+
|
|
61
|
+
// The documented contract is "inclusive on both ends"; an off-by-one in the
|
|
62
|
+
// `max - min + 1` scaling shows up as a bound that is never drawn.
|
|
63
|
+
testSync("reaches both bounds", () => {
|
|
64
|
+
let d = draws(~min=3, ~max=7, ~n=500)
|
|
65
|
+
expect((d->Array.includes(3), d->Array.includes(7)))->toEqual((true, true))
|
|
66
|
+
})
|
|
67
|
+
|
|
68
|
+
testSync("a single-value range is that value", () =>
|
|
69
|
+
expect(draws(~min=4, ~max=4, ~n=10)->Array.every(i => i == 4))->toBe(true)
|
|
70
|
+
)
|
|
71
|
+
})
|
|
72
|
+
|
|
73
|
+
describe("pick:", () => {
|
|
74
|
+
testSync("returns None for an empty array", () =>
|
|
75
|
+
expect(Seed_Random.make(~seed=1)->Seed_Random.pick([]))->toEqual(None)
|
|
76
|
+
)
|
|
77
|
+
|
|
78
|
+
testSync("always lands on a member", () => {
|
|
79
|
+
let r = Seed_Random.make(~seed=2)
|
|
80
|
+
let xs = ["a", "b", "c", "d"]
|
|
81
|
+
let hits = Array.make(~length=200, "")->Array.map(_ =>
|
|
82
|
+
r->Seed_Random.pickOr(~fallback="MISS", xs)
|
|
83
|
+
)
|
|
84
|
+
expect(hits->Array.every(h => xs->Array.includes(h)))->toBe(true)
|
|
85
|
+
})
|
|
86
|
+
|
|
87
|
+
testSync("pickOr falls back only when there is nothing to pick", () =>
|
|
88
|
+
expect(Seed_Random.make(~seed=3)->Seed_Random.pickOr(~fallback="fallback", []))->toBe(
|
|
89
|
+
"fallback",
|
|
90
|
+
)
|
|
91
|
+
)
|
|
92
|
+
})
|
|
93
|
+
|
|
94
|
+
describe("sampleWeighted is without replacement:", () => {
|
|
95
|
+
let equal = xs => xs->Array.map(x => (x, 1.0))
|
|
96
|
+
|
|
97
|
+
// The documented shuffle use: equal weights, count = length. If sampling
|
|
98
|
+
// ever replaced instead of removing, duplicates would appear here.
|
|
99
|
+
testSync("count = length yields a permutation, not a multiset", () => {
|
|
100
|
+
let xs = ["a", "b", "c", "d", "e"]
|
|
101
|
+
let out = Seed_Random.make(~seed=11)->Seed_Random.sampleWeighted(equal(xs), ~count=5)
|
|
102
|
+
let sorted = out->Array.toSorted(String.compare)
|
|
103
|
+
expect((out->Array.length, sorted))->toEqual((5, ["a", "b", "c", "d", "e"]))
|
|
104
|
+
})
|
|
105
|
+
|
|
106
|
+
testSync("count < length returns exactly count distinct items", () => {
|
|
107
|
+
let xs = ["a", "b", "c", "d", "e"]
|
|
108
|
+
let out = Seed_Random.make(~seed=12)->Seed_Random.sampleWeighted(equal(xs), ~count=3)
|
|
109
|
+
let distinct = Set.fromArray(out)->Set.size
|
|
110
|
+
expect((out->Array.length, distinct))->toEqual((3, 3))
|
|
111
|
+
})
|
|
112
|
+
|
|
113
|
+
testSync("count > length clamps to the pool", () =>
|
|
114
|
+
expect(
|
|
115
|
+
Seed_Random.make(~seed=13)
|
|
116
|
+
->Seed_Random.sampleWeighted(equal(["a", "b"]), ~count=99)
|
|
117
|
+
->Array.length,
|
|
118
|
+
)->toBe(2)
|
|
119
|
+
)
|
|
120
|
+
|
|
121
|
+
testSync("a zero-weight entry is never chosen while others remain", () => {
|
|
122
|
+
let out =
|
|
123
|
+
Seed_Random.make(~seed=14)->Seed_Random.sampleWeighted(
|
|
124
|
+
[("never", 0.0), ("a", 1.0), ("b", 1.0)],
|
|
125
|
+
~count=2,
|
|
126
|
+
)
|
|
127
|
+
expect(out->Array.includes("never"))->toBe(false)
|
|
128
|
+
})
|
|
129
|
+
|
|
130
|
+
testSync("is reproducible for a given seed", () => {
|
|
131
|
+
let run = () =>
|
|
132
|
+
Seed_Random.make(~seed=15)->Seed_Random.sampleWeighted(
|
|
133
|
+
equal(["a", "b", "c", "d", "e", "f"]),
|
|
134
|
+
~count=4,
|
|
135
|
+
)
|
|
136
|
+
expect(run())->toEqual(run())
|
|
137
|
+
})
|
|
138
|
+
})
|
|
139
|
+
|
|
140
|
+
describe("zipfWeights skews toward the head:", () => {
|
|
141
|
+
let weights = Seed_Random.zipfWeights(["a", "b", "c", "d", "e"], ~exponent=1.1)
|
|
142
|
+
|
|
143
|
+
testSync("keeps every item, in order", () =>
|
|
144
|
+
expect(weights->Array.map(((item, _)) => item))->toEqual(["a", "b", "c", "d", "e"])
|
|
145
|
+
)
|
|
146
|
+
|
|
147
|
+
testSync("weight decreases monotonically with rank", () => {
|
|
148
|
+
let ws = weights->Array.map(((_, w)) => w)
|
|
149
|
+
let decreasing =
|
|
150
|
+
ws->Array.everyWithIndex((w, i) => i == 0 || w < ws->Array.getUnsafe(i - 1))
|
|
151
|
+
expect(decreasing)->toBe(true)
|
|
152
|
+
})
|
|
153
|
+
|
|
154
|
+
testSync("the leader is clear — first outweighs last several times over", () => {
|
|
155
|
+
let first = weights->Array.get(0)->Option.mapOr(0.0, ((_, w)) => w)
|
|
156
|
+
let last = weights->Array.get(4)->Option.mapOr(0.0, ((_, w)) => w)
|
|
157
|
+
expect(first > last *. 3.0)->toBe(true)
|
|
158
|
+
})
|
|
159
|
+
})
|
|
160
|
+
})
|
|
@@ -0,0 +1,208 @@
|
|
|
1
|
+
// Generated by ReScript, PLEASE EDIT WITH CARE
|
|
2
|
+
|
|
3
|
+
import * as Stdlib_Array from "@rescript/runtime/lib/es6/Stdlib_Array.js";
|
|
4
|
+
import * as Stdlib_Option from "@rescript/runtime/lib/es6/Stdlib_Option.js";
|
|
5
|
+
import * as Primitive_object from "@rescript/runtime/lib/es6/Primitive_object.js";
|
|
6
|
+
import * as Primitive_string from "@rescript/runtime/lib/es6/Primitive_string.js";
|
|
7
|
+
import * as Seed_Random$ReventlessSeed from "../src/Seed_Random.res.mjs";
|
|
8
|
+
|
|
9
|
+
globalThis.describe("Seed_Random:", () => {
|
|
10
|
+
let take = (seed, n) => {
|
|
11
|
+
let r = Seed_Random$ReventlessSeed.make(seed);
|
|
12
|
+
return Stdlib_Array.make(n, 0.0).map(param => Seed_Random$ReventlessSeed.float(r));
|
|
13
|
+
};
|
|
14
|
+
globalThis.describe("reproducibility — the reason this module exists:", () => {
|
|
15
|
+
globalThis.test("the same seed replays the same sequence", () => {
|
|
16
|
+
globalThis.expect(take(42, 25)).toEqual(take(42, 25));
|
|
17
|
+
});
|
|
18
|
+
globalThis.test("different seeds diverge", () => {
|
|
19
|
+
globalThis.expect(Primitive_object.equal(take(42, 25), take(43, 25))).toBe(false);
|
|
20
|
+
});
|
|
21
|
+
globalThis.test("a fresh generator does not continue the previous one", () => {
|
|
22
|
+
let r = Seed_Random$ReventlessSeed.make(7);
|
|
23
|
+
let first = Seed_Random$ReventlessSeed.float(r);
|
|
24
|
+
Seed_Random$ReventlessSeed.float(r);
|
|
25
|
+
globalThis.expect(Seed_Random$ReventlessSeed.float(Seed_Random$ReventlessSeed.make(7))).toEqual(first);
|
|
26
|
+
});
|
|
27
|
+
});
|
|
28
|
+
globalThis.describe("float stays a unit interval:", () => {
|
|
29
|
+
globalThis.test("every draw is in [0, 1)", () => {
|
|
30
|
+
globalThis.expect(take(99, 500).every(f => {
|
|
31
|
+
if (f >= 0.0) {
|
|
32
|
+
return f < 1.0;
|
|
33
|
+
} else {
|
|
34
|
+
return false;
|
|
35
|
+
}
|
|
36
|
+
})).toBe(true);
|
|
37
|
+
});
|
|
38
|
+
globalThis.test("and the draws are not all the same value", () => {
|
|
39
|
+
let draws = take(99, 100);
|
|
40
|
+
globalThis.expect(draws.some(f => f !== draws[0])).toBe(true);
|
|
41
|
+
});
|
|
42
|
+
});
|
|
43
|
+
globalThis.describe("int is inclusive on both ends, as documented:", () => {
|
|
44
|
+
let draws = (min, max, n) => {
|
|
45
|
+
let r = Seed_Random$ReventlessSeed.make(5);
|
|
46
|
+
return Stdlib_Array.make(n, 0).map(param => Seed_Random$ReventlessSeed.int(r, min, max));
|
|
47
|
+
};
|
|
48
|
+
globalThis.test("never escapes the range", () => {
|
|
49
|
+
globalThis.expect(draws(3, 7, 500).every(i => {
|
|
50
|
+
if (i >= 3) {
|
|
51
|
+
return i <= 7;
|
|
52
|
+
} else {
|
|
53
|
+
return false;
|
|
54
|
+
}
|
|
55
|
+
})).toBe(true);
|
|
56
|
+
});
|
|
57
|
+
globalThis.test("reaches both bounds", () => {
|
|
58
|
+
let d = draws(3, 7, 500);
|
|
59
|
+
globalThis.expect([
|
|
60
|
+
d.includes(3),
|
|
61
|
+
d.includes(7)
|
|
62
|
+
]).toEqual([
|
|
63
|
+
true,
|
|
64
|
+
true
|
|
65
|
+
]);
|
|
66
|
+
});
|
|
67
|
+
globalThis.test("a single-value range is that value", () => {
|
|
68
|
+
globalThis.expect(draws(4, 4, 10).every(i => i === 4)).toBe(true);
|
|
69
|
+
});
|
|
70
|
+
});
|
|
71
|
+
globalThis.describe("pick:", () => {
|
|
72
|
+
globalThis.test("returns None for an empty array", () => {
|
|
73
|
+
globalThis.expect(Seed_Random$ReventlessSeed.pick(Seed_Random$ReventlessSeed.make(1), [])).toEqual(undefined);
|
|
74
|
+
});
|
|
75
|
+
globalThis.test("always lands on a member", () => {
|
|
76
|
+
let r = Seed_Random$ReventlessSeed.make(2);
|
|
77
|
+
let xs = [
|
|
78
|
+
"a",
|
|
79
|
+
"b",
|
|
80
|
+
"c",
|
|
81
|
+
"d"
|
|
82
|
+
];
|
|
83
|
+
let hits = Stdlib_Array.make(200, "").map(param => Seed_Random$ReventlessSeed.pickOr(r, "MISS", xs));
|
|
84
|
+
globalThis.expect(hits.every(h => xs.includes(h))).toBe(true);
|
|
85
|
+
});
|
|
86
|
+
globalThis.test("pickOr falls back only when there is nothing to pick", () => {
|
|
87
|
+
globalThis.expect(Seed_Random$ReventlessSeed.pickOr(Seed_Random$ReventlessSeed.make(3), "fallback", [])).toBe("fallback");
|
|
88
|
+
});
|
|
89
|
+
});
|
|
90
|
+
globalThis.describe("sampleWeighted is without replacement:", () => {
|
|
91
|
+
let equal = xs => xs.map(x => [
|
|
92
|
+
x,
|
|
93
|
+
1.0
|
|
94
|
+
]);
|
|
95
|
+
globalThis.test("count = length yields a permutation, not a multiset", () => {
|
|
96
|
+
let xs = [
|
|
97
|
+
"a",
|
|
98
|
+
"b",
|
|
99
|
+
"c",
|
|
100
|
+
"d",
|
|
101
|
+
"e"
|
|
102
|
+
];
|
|
103
|
+
let out = Seed_Random$ReventlessSeed.sampleWeighted(Seed_Random$ReventlessSeed.make(11), equal(xs), 5);
|
|
104
|
+
let sorted = out.toSorted(Primitive_string.compare);
|
|
105
|
+
globalThis.expect([
|
|
106
|
+
out.length,
|
|
107
|
+
sorted
|
|
108
|
+
]).toEqual([
|
|
109
|
+
5,
|
|
110
|
+
[
|
|
111
|
+
"a",
|
|
112
|
+
"b",
|
|
113
|
+
"c",
|
|
114
|
+
"d",
|
|
115
|
+
"e"
|
|
116
|
+
]
|
|
117
|
+
]);
|
|
118
|
+
});
|
|
119
|
+
globalThis.test("count < length returns exactly count distinct items", () => {
|
|
120
|
+
let xs = [
|
|
121
|
+
"a",
|
|
122
|
+
"b",
|
|
123
|
+
"c",
|
|
124
|
+
"d",
|
|
125
|
+
"e"
|
|
126
|
+
];
|
|
127
|
+
let out = Seed_Random$ReventlessSeed.sampleWeighted(Seed_Random$ReventlessSeed.make(12), equal(xs), 3);
|
|
128
|
+
let distinct = new Set(out).size;
|
|
129
|
+
globalThis.expect([
|
|
130
|
+
out.length,
|
|
131
|
+
distinct
|
|
132
|
+
]).toEqual([
|
|
133
|
+
3,
|
|
134
|
+
3
|
|
135
|
+
]);
|
|
136
|
+
});
|
|
137
|
+
globalThis.test("count > length clamps to the pool", () => {
|
|
138
|
+
globalThis.expect(Seed_Random$ReventlessSeed.sampleWeighted(Seed_Random$ReventlessSeed.make(13), equal([
|
|
139
|
+
"a",
|
|
140
|
+
"b"
|
|
141
|
+
]), 99).length).toBe(2);
|
|
142
|
+
});
|
|
143
|
+
globalThis.test("a zero-weight entry is never chosen while others remain", () => {
|
|
144
|
+
let out = Seed_Random$ReventlessSeed.sampleWeighted(Seed_Random$ReventlessSeed.make(14), [
|
|
145
|
+
[
|
|
146
|
+
"never",
|
|
147
|
+
0.0
|
|
148
|
+
],
|
|
149
|
+
[
|
|
150
|
+
"a",
|
|
151
|
+
1.0
|
|
152
|
+
],
|
|
153
|
+
[
|
|
154
|
+
"b",
|
|
155
|
+
1.0
|
|
156
|
+
]
|
|
157
|
+
], 2);
|
|
158
|
+
globalThis.expect(out.includes("never")).toBe(false);
|
|
159
|
+
});
|
|
160
|
+
globalThis.test("is reproducible for a given seed", () => {
|
|
161
|
+
let run = () => Seed_Random$ReventlessSeed.sampleWeighted(Seed_Random$ReventlessSeed.make(15), equal([
|
|
162
|
+
"a",
|
|
163
|
+
"b",
|
|
164
|
+
"c",
|
|
165
|
+
"d",
|
|
166
|
+
"e",
|
|
167
|
+
"f"
|
|
168
|
+
]), 4);
|
|
169
|
+
globalThis.expect(run()).toEqual(run());
|
|
170
|
+
});
|
|
171
|
+
});
|
|
172
|
+
globalThis.describe("zipfWeights skews toward the head:", () => {
|
|
173
|
+
let weights = Seed_Random$ReventlessSeed.zipfWeights([
|
|
174
|
+
"a",
|
|
175
|
+
"b",
|
|
176
|
+
"c",
|
|
177
|
+
"d",
|
|
178
|
+
"e"
|
|
179
|
+
], 1.1);
|
|
180
|
+
globalThis.test("keeps every item, in order", () => {
|
|
181
|
+
globalThis.expect(weights.map(param => param[0])).toEqual([
|
|
182
|
+
"a",
|
|
183
|
+
"b",
|
|
184
|
+
"c",
|
|
185
|
+
"d",
|
|
186
|
+
"e"
|
|
187
|
+
]);
|
|
188
|
+
});
|
|
189
|
+
globalThis.test("weight decreases monotonically with rank", () => {
|
|
190
|
+
let ws = weights.map(param => param[1]);
|
|
191
|
+
let decreasing = ws.every((w, i) => {
|
|
192
|
+
if (i === 0) {
|
|
193
|
+
return true;
|
|
194
|
+
} else {
|
|
195
|
+
return w < ws[i - 1 | 0];
|
|
196
|
+
}
|
|
197
|
+
});
|
|
198
|
+
globalThis.expect(decreasing).toBe(true);
|
|
199
|
+
});
|
|
200
|
+
globalThis.test("the leader is clear — first outweighs last several times over", () => {
|
|
201
|
+
let first = Stdlib_Option.mapOr(weights[0], 0.0, param => param[1]);
|
|
202
|
+
let last = Stdlib_Option.mapOr(weights[4], 0.0, param => param[1]);
|
|
203
|
+
globalThis.expect(first > last * 3.0).toBe(true);
|
|
204
|
+
});
|
|
205
|
+
});
|
|
206
|
+
});
|
|
207
|
+
|
|
208
|
+
/* Not a pure module */
|
package/lib/ocaml/.compiler.log
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
#Start(
|
|
2
|
-
#Done(
|
|
1
|
+
#Start(1785705192895)
|
|
2
|
+
#Done(1785705192932)
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
package/lib/ocaml/Seed.ast
CHANGED
|
Binary file
|
package/lib/ocaml/Seed.res
CHANGED
|
@@ -14,13 +14,12 @@ module Connect = Seed_Connect
|
|
|
14
14
|
|
|
15
15
|
exception Failed = Seed_Types.Failed
|
|
16
16
|
|
|
17
|
-
// A live target a data set seeds against: an authenticated client,
|
|
18
|
-
//
|
|
19
|
-
//
|
|
17
|
+
// A live target a data set seeds against: an authenticated client, whether uploads
|
|
18
|
+
// are skipped this run, and a label. Uploads mint through the domain API's
|
|
19
|
+
// `Upload_Presign` mutation on the client (route B), so no upload endpoint is carried.
|
|
20
20
|
type connection = Seed_Connect.connection = {
|
|
21
21
|
client: Seed_Client.t,
|
|
22
|
-
|
|
23
|
-
uploadEndpoints: dict<string>,
|
|
22
|
+
uploadsSkipped: bool,
|
|
24
23
|
label: string,
|
|
25
24
|
}
|
|
26
25
|
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
@@ -43,6 +43,10 @@ let make = (~config: config): t => {config, token: None}
|
|
|
43
43
|
Seed.Upload) can authenticate side-channel requests with the same identity. */
|
|
44
44
|
let currentToken = (t: t): option<string> => t.token
|
|
45
45
|
|
|
46
|
+
/** The GraphQL endpoint this client targets — so `Seed.Upload` can resolve a
|
|
47
|
+
relative presigned `uploadUrl` against the same origin. */
|
|
48
|
+
let endpoint = (t: t): string => t.config.endpoint
|
|
49
|
+
|
|
46
50
|
/** Injects a bearer obtained out-of-band (e.g. a Cognito id token), instead of
|
|
47
51
|
minting one via `login`. Provider-agnostic: the harness only cares that the
|
|
48
52
|
token is a valid bearer for `endpoint`. */
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|