@potatosalad775/eqcaps-core 0.0.0-stage → 0.1.0
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/LICENSE +21 -0
- package/README.md +22 -2
- package/dist/assign.d.ts +35 -0
- package/dist/assign.d.ts.map +1 -0
- package/dist/assign.js +290 -0
- package/dist/assign.js.map +1 -0
- package/dist/complete.d.ts +23 -0
- package/dist/complete.d.ts.map +1 -0
- package/dist/complete.js +47 -0
- package/dist/complete.js.map +1 -0
- package/dist/database.d.ts +9 -0
- package/dist/database.d.ts.map +1 -0
- package/dist/database.js +50 -0
- package/dist/database.js.map +1 -0
- package/dist/dependencies.d.ts +24 -0
- package/dist/dependencies.d.ts.map +1 -0
- package/dist/dependencies.js +89 -0
- package/dist/dependencies.js.map +1 -0
- package/dist/describe.d.ts +38 -0
- package/dist/describe.d.ts.map +1 -0
- package/dist/describe.js +171 -0
- package/dist/describe.js.map +1 -0
- package/dist/domain.d.ts +19 -0
- package/dist/domain.d.ts.map +1 -0
- package/dist/domain.js +35 -0
- package/dist/domain.js.map +1 -0
- package/dist/filler.d.ts +39 -0
- package/dist/filler.d.ts.map +1 -0
- package/dist/filler.js +202 -0
- package/dist/filler.js.map +1 -0
- package/dist/filter.d.ts +22 -0
- package/dist/filter.d.ts.map +1 -0
- package/dist/filter.js +24 -0
- package/dist/filter.js.map +1 -0
- package/dist/firmware.d.ts +14 -0
- package/dist/firmware.d.ts.map +1 -0
- package/dist/firmware.js +21 -0
- package/dist/firmware.js.map +1 -0
- package/dist/fit-slot.d.ts +14 -0
- package/dist/fit-slot.d.ts.map +1 -0
- package/dist/fit-slot.js +36 -0
- package/dist/fit-slot.js.map +1 -0
- package/dist/fit.d.ts +40 -0
- package/dist/fit.d.ts.map +1 -0
- package/dist/fit.js +237 -0
- package/dist/fit.js.map +1 -0
- package/dist/flatten.d.ts +21 -0
- package/dist/flatten.d.ts.map +1 -0
- package/dist/flatten.js +151 -0
- package/dist/flatten.js.map +1 -0
- package/dist/index.d.ts +35 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +20 -0
- package/dist/index.js.map +1 -0
- package/dist/issues.d.ts +42 -0
- package/dist/issues.d.ts.map +1 -0
- package/dist/issues.js +34 -0
- package/dist/issues.js.map +1 -0
- package/dist/maintainers.d.ts +11 -0
- package/dist/maintainers.d.ts.map +1 -0
- package/dist/maintainers.js +16 -0
- package/dist/maintainers.js.map +1 -0
- package/dist/project.d.ts +21 -0
- package/dist/project.d.ts.map +1 -0
- package/dist/project.js +84 -0
- package/dist/project.js.map +1 -0
- package/dist/published.d.ts +38 -0
- package/dist/published.d.ts.map +1 -0
- package/dist/published.js +15 -0
- package/dist/published.js.map +1 -0
- package/dist/realization.d.ts +17 -0
- package/dist/realization.d.ts.map +1 -0
- package/dist/realization.js +75 -0
- package/dist/realization.js.map +1 -0
- package/dist/resolve.d.ts +55 -0
- package/dist/resolve.d.ts.map +1 -0
- package/dist/resolve.js +104 -0
- package/dist/resolve.js.map +1 -0
- package/dist/slots.d.ts +13 -0
- package/dist/slots.d.ts.map +1 -0
- package/dist/slots.js +23 -0
- package/dist/slots.js.map +1 -0
- package/dist/types/schema.generated.d.ts +235 -0
- package/dist/types/schema.generated.d.ts.map +1 -0
- package/dist/types/schema.generated.js +3 -0
- package/dist/types/schema.generated.js.map +1 -0
- package/dist/validate-profile.d.ts +13 -0
- package/dist/validate-profile.d.ts.map +1 -0
- package/dist/validate-profile.js +267 -0
- package/dist/validate-profile.js.map +1 -0
- package/dist/validate.d.ts +37 -0
- package/dist/validate.d.ts.map +1 -0
- package/dist/validate.js +128 -0
- package/dist/validate.js.map +1 -0
- package/package.json +28 -5
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 potatosalad775
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
CHANGED
|
@@ -1,3 +1,23 @@
|
|
|
1
|
-
#
|
|
1
|
+
# @potatosalad775/eqcaps-core
|
|
2
2
|
|
|
3
|
-
|
|
3
|
+
Types, semantic validator and reference engine for
|
|
4
|
+
[eqcaps](https://github.com/potatosalad775/eqcaps) EQ constraint profiles: which filter
|
|
5
|
+
configurations an EQ engine (a hardware DSP or a software EQ) accepts. Zero dependencies, no
|
|
6
|
+
environment types, synchronous.
|
|
7
|
+
|
|
8
|
+
- **Engine** (format SPEC §13): `resolveSlot`, `project`, `toRealized`, `toWritten`, `validate`,
|
|
9
|
+
`validateList`, `assign`, `fit`, `complete`, plus `isGraphic`, `describe` and `unsupported`.
|
|
10
|
+
- **Validation**: `validateProfile` (semantic rules of one profile), `checkDatabase`
|
|
11
|
+
(cross-profile rules), `flattenProfile` (authoring `extends` → published form).
|
|
12
|
+
- **Types** generated from the JSON Schema, including the published `index.json` and
|
|
13
|
+
`bundle.json`.
|
|
14
|
+
|
|
15
|
+
Writing to a device: `fit` → `complete` → encode the written values. Reading from one: decode →
|
|
16
|
+
`toRealized`. While editing: `validateList`.
|
|
17
|
+
|
|
18
|
+
To load profiles, use [`@potatosalad775/eqcaps-client`](https://www.npmjs.com/package/@potatosalad775/eqcaps-client).
|
|
19
|
+
The format definition is
|
|
20
|
+
[docs/SPEC-DRAFT.md](https://github.com/potatosalad775/eqcaps/blob/main/docs/SPEC-DRAFT.md); it is
|
|
21
|
+
a draft until frozen as v1.
|
|
22
|
+
|
|
23
|
+
License: MIT.
|
package/dist/assign.d.ts
ADDED
|
@@ -0,0 +1,35 @@
|
|
|
1
|
+
import { type Filter } from './filter.ts';
|
|
2
|
+
import { type EngineProfile, type EngineSlot } from './resolve.ts';
|
|
3
|
+
import type { Profile } from './types/schema.generated.ts';
|
|
4
|
+
export interface AssignResult {
|
|
5
|
+
/** One entry per slot (bandCount of them; as many as assigned filters when unbounded). */
|
|
6
|
+
slots: (Filter | null)[];
|
|
7
|
+
/** Active filters that got no slot. */
|
|
8
|
+
unassigned: Filter[];
|
|
9
|
+
/** For each input filter, its slot, or null when inactive (dropped) or unassigned. */
|
|
10
|
+
slotOf: (number | null)[];
|
|
11
|
+
}
|
|
12
|
+
/**
|
|
13
|
+
* Map a list of written filters onto slots (SPEC §13.5). Inactive filters are dropped. Normative
|
|
14
|
+
* property: if an assignment exists in which every filter's type is allowed and every field is
|
|
15
|
+
* in its domain, the result is one. Which one is informative.
|
|
16
|
+
*
|
|
17
|
+
* Homogeneous engines keep list order (frequency order under ascendingFrequency). Otherwise a
|
|
18
|
+
* min-cost matching: the cost of a filter in a slot is how far projection moves it (octaves for
|
|
19
|
+
* freq and q, gain in 6 dB units) plus a large penalty for a disallowed type. When there are more
|
|
20
|
+
* filters than slots, those with the smallest |gain| are left out first. Under
|
|
21
|
+
* ascendingFrequency, a frequency-ordered matching is preferred unless only the unordered one is
|
|
22
|
+
* valid.
|
|
23
|
+
*/
|
|
24
|
+
export declare function assign(profile: Profile, filters: readonly Filter[]): AssignResult;
|
|
25
|
+
/** The filter is accepted by the slot as it is. */
|
|
26
|
+
export declare function fitsSlot(slot: EngineSlot, f: Filter): boolean;
|
|
27
|
+
export declare function assignEngine(p: EngineProfile, input: readonly Filter[]): AssignResult;
|
|
28
|
+
/** The frequency-ordered matching on its own, for fit's second attempt under ascendingFrequency. */
|
|
29
|
+
export declare function orderedAssignEngine(p: EngineProfile, input: readonly Filter[]): AssignResult;
|
|
30
|
+
/**
|
|
31
|
+
* Min-cost assignment of n rows to distinct columns (n ≤ cols), O(n²·cols). Returns the column
|
|
32
|
+
* of each row.
|
|
33
|
+
*/
|
|
34
|
+
export declare function hungarian(n: number, cols: number, cost: (r: number, j: number) => number): number[];
|
|
35
|
+
//# sourceMappingURL=assign.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"assign.d.ts","sourceRoot":"","sources":["../src/assign.ts"],"names":[],"mappings":"AAEA,OAAO,EAAuC,KAAK,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/E,OAAO,EAA+B,KAAK,aAAa,EAAE,KAAK,UAAU,EAAE,MAAM,cAAc,CAAC;AAChG,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAE3D,MAAM,WAAW,YAAY;IAC5B,0FAA0F;IAC1F,KAAK,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;IACzB,uCAAuC;IACvC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,sFAAsF;IACtF,MAAM,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;CAC1B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,YAAY,CAEjF;AA2BD,mDAAmD;AACnD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO7D;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,YAAY,CAiCrF;AAED,oGAAoG;AACpG,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,YAAY,CAO5F;AAqDD;;;GAGG;AACH,wBAAgB,SAAS,CACxB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,GACpC,MAAM,EAAE,CA8CV"}
|
package/dist/assign.js
ADDED
|
@@ -0,0 +1,290 @@
|
|
|
1
|
+
import { compareNear, near } from "./domain.js";
|
|
2
|
+
import { fitToSlot } from "./fit-slot.js";
|
|
3
|
+
import { isActive, normalizeFilter, usesGain } from "./filter.js";
|
|
4
|
+
import { domainViolation } from "./project.js";
|
|
5
|
+
import { engineProfile, resolveField } from "./resolve.js";
|
|
6
|
+
/**
|
|
7
|
+
* Map a list of written filters onto slots (SPEC §13.5). Inactive filters are dropped. Normative
|
|
8
|
+
* property: if an assignment exists in which every filter's type is allowed and every field is
|
|
9
|
+
* in its domain, the result is one. Which one is informative.
|
|
10
|
+
*
|
|
11
|
+
* Homogeneous engines keep list order (frequency order under ascendingFrequency). Otherwise a
|
|
12
|
+
* min-cost matching: the cost of a filter in a slot is how far projection moves it (octaves for
|
|
13
|
+
* freq and q, gain in 6 dB units) plus a large penalty for a disallowed type. When there are more
|
|
14
|
+
* filters than slots, those with the smallest |gain| are left out first. Under
|
|
15
|
+
* ascendingFrequency, a frequency-ordered matching is preferred unless only the unordered one is
|
|
16
|
+
* valid.
|
|
17
|
+
*/
|
|
18
|
+
export function assign(profile, filters) {
|
|
19
|
+
return assignEngine(engineProfile(profile), filters);
|
|
20
|
+
}
|
|
21
|
+
const TYPE_PENALTY = 1e6;
|
|
22
|
+
const DROP_PENALTY = 1e9;
|
|
23
|
+
// Costs of a filter that fits are ~1e-16 (grid normalization); anything above this is a real move.
|
|
24
|
+
const TOLERANCE = 1e-12;
|
|
25
|
+
/** How audible a filter is, for choosing which to leave out: |gain|, gainless filters always win. */
|
|
26
|
+
const significance = (f) => usesGain(f.type) ? (Number.isFinite(f.gain) ? Math.min(Math.abs(f.gain), 100) : 0) : 100;
|
|
27
|
+
/** Cost of leaving filter k out; on equal significance, later filters go first. */
|
|
28
|
+
const dropCost = (f, k) => DROP_PENALTY + 1e3 * significance(f) - 1e-3 * k;
|
|
29
|
+
const finite = (x) => (Number.isFinite(x) ? x : 1e3);
|
|
30
|
+
const octaves = (a, b) => finite(Math.abs(Math.log2(a / b)));
|
|
31
|
+
function cost(slot, f) {
|
|
32
|
+
const g = fitToSlot(slot, [], f);
|
|
33
|
+
return ((g.type === f.type ? 0 : TYPE_PENALTY) +
|
|
34
|
+
octaves(f.freq, g.freq) +
|
|
35
|
+
octaves(f.q, g.q) +
|
|
36
|
+
finite(Math.abs(f.gain - g.gain) / 6));
|
|
37
|
+
}
|
|
38
|
+
/** The filter is accepted by the slot as it is. */
|
|
39
|
+
export function fitsSlot(slot, f) {
|
|
40
|
+
if (!slot.types.includes(f.type))
|
|
41
|
+
return false;
|
|
42
|
+
return ['freq', 'q', 'gain'].every((field) => (field === 'gain' && !usesGain(f.type)) ||
|
|
43
|
+
domainViolation(f[field], resolveField(slot, field, f)) === null);
|
|
44
|
+
}
|
|
45
|
+
const freqKey = (f) => (Number.isFinite(f.freq) ? f.freq : Infinity);
|
|
46
|
+
export function assignEngine(p, input) {
|
|
47
|
+
const filters = input.map(normalizeFilter);
|
|
48
|
+
const active = filters.flatMap((f, k) => (isActive(f) ? [k] : []));
|
|
49
|
+
const ascending = (p.profile.rules ?? []).find((r) => r.type === 'ascendingFrequency');
|
|
50
|
+
const strict = ascending?.strict ?? true;
|
|
51
|
+
const m = p.bandCount ?? active.length;
|
|
52
|
+
let slotOf;
|
|
53
|
+
if (p.homogeneous) {
|
|
54
|
+
let kept = active;
|
|
55
|
+
if (kept.length > m) {
|
|
56
|
+
const rank = [...kept].sort((a, b) => significance(filters[b]) - significance(filters[a]) || a - b);
|
|
57
|
+
const keep = new Set(rank.slice(0, m));
|
|
58
|
+
kept = kept.filter((k) => keep.has(k));
|
|
59
|
+
}
|
|
60
|
+
if (ascending) {
|
|
61
|
+
kept = [...kept].sort((a, b) => compareNear(freqKey(filters[a]), freqKey(filters[b])) || a - b);
|
|
62
|
+
}
|
|
63
|
+
slotOf = new Map(kept.map((k, s) => [k, s]));
|
|
64
|
+
}
|
|
65
|
+
else {
|
|
66
|
+
const c = costs(p, filters, active);
|
|
67
|
+
const h = normalize(c, matching(c), false);
|
|
68
|
+
slotOf = h.slotOf;
|
|
69
|
+
if (ascending && !inOrder(p, filters, h.slotOf, strict)) {
|
|
70
|
+
const o = normalize(c, ordered(c, filters), true);
|
|
71
|
+
if (!(valid(p, filters, h, m) && !valid(p, filters, o, m)))
|
|
72
|
+
slotOf = o.slotOf;
|
|
73
|
+
}
|
|
74
|
+
}
|
|
75
|
+
return result(filters, m, slotOf);
|
|
76
|
+
}
|
|
77
|
+
/** The frequency-ordered matching on its own, for fit's second attempt under ascendingFrequency. */
|
|
78
|
+
export function orderedAssignEngine(p, input) {
|
|
79
|
+
const filters = input.map(normalizeFilter);
|
|
80
|
+
const active = filters.flatMap((f, k) => (isActive(f) ? [k] : []));
|
|
81
|
+
const m = p.bandCount ?? active.length;
|
|
82
|
+
if (p.homogeneous)
|
|
83
|
+
return assignEngine(p, filters);
|
|
84
|
+
const c = costs(p, filters, active);
|
|
85
|
+
return result(filters, m, normalize(c, ordered(c, filters), true).slotOf);
|
|
86
|
+
}
|
|
87
|
+
function result(filters, m, slotOf) {
|
|
88
|
+
const slots = new Array(m).fill(null);
|
|
89
|
+
for (const [k, s] of slotOf)
|
|
90
|
+
slots[s] = { ...filters[k] };
|
|
91
|
+
return {
|
|
92
|
+
slots,
|
|
93
|
+
unassigned: filters.filter((f, k) => isActive(f) && !slotOf.has(k)).map((f) => ({ ...f })),
|
|
94
|
+
slotOf: filters.map((_, k) => slotOf.get(k) ?? null)
|
|
95
|
+
};
|
|
96
|
+
}
|
|
97
|
+
function costs(p, filters, active) {
|
|
98
|
+
const slots = p.slots.length;
|
|
99
|
+
return {
|
|
100
|
+
active,
|
|
101
|
+
cost: active.map((k) => p.slots.map((slot) => cost(slot, filters[k]))),
|
|
102
|
+
drop: active.map((k) => dropCost(filters[k], k)),
|
|
103
|
+
slots
|
|
104
|
+
};
|
|
105
|
+
}
|
|
106
|
+
/** Min-cost matching (Hungarian), with one "left out" column per filter when they outnumber slots. */
|
|
107
|
+
function matching(c) {
|
|
108
|
+
const n = c.active.length;
|
|
109
|
+
const extra = n > c.slots ? n : 0;
|
|
110
|
+
const cols = c.slots + extra;
|
|
111
|
+
const at = (r, j) => j < c.slots ? c.cost[r]?.[j] : c.drop[r];
|
|
112
|
+
const rowToCol = hungarian(n, cols, at);
|
|
113
|
+
const slotOf = new Map();
|
|
114
|
+
rowToCol.forEach((j, r) => {
|
|
115
|
+
if (j < c.slots)
|
|
116
|
+
slotOf.set(c.active[r], j);
|
|
117
|
+
});
|
|
118
|
+
return { slotOf };
|
|
119
|
+
}
|
|
120
|
+
/**
|
|
121
|
+
* Min-cost assignment of n rows to distinct columns (n ≤ cols), O(n²·cols). Returns the column
|
|
122
|
+
* of each row.
|
|
123
|
+
*/
|
|
124
|
+
export function hungarian(n, cols, cost) {
|
|
125
|
+
const u = new Float64Array(n + 1);
|
|
126
|
+
const v = new Float64Array(cols + 1);
|
|
127
|
+
const p = new Int32Array(cols + 1);
|
|
128
|
+
const way = new Int32Array(cols + 1);
|
|
129
|
+
for (let i = 1; i <= n; i++) {
|
|
130
|
+
p[0] = i;
|
|
131
|
+
let j0 = 0;
|
|
132
|
+
const minv = new Float64Array(cols + 1).fill(Infinity);
|
|
133
|
+
const used = new Uint8Array(cols + 1);
|
|
134
|
+
do {
|
|
135
|
+
used[j0] = 1;
|
|
136
|
+
const i0 = p[j0];
|
|
137
|
+
let delta = Infinity;
|
|
138
|
+
let j1 = 0;
|
|
139
|
+
for (let j = 1; j <= cols; j++) {
|
|
140
|
+
if (used[j])
|
|
141
|
+
continue;
|
|
142
|
+
const cur = cost(i0 - 1, j - 1) - u[i0] - v[j];
|
|
143
|
+
if (cur < minv[j]) {
|
|
144
|
+
minv[j] = cur;
|
|
145
|
+
way[j] = j0;
|
|
146
|
+
}
|
|
147
|
+
if (minv[j] < delta) {
|
|
148
|
+
delta = minv[j];
|
|
149
|
+
j1 = j;
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
for (let j = 0; j <= cols; j++) {
|
|
153
|
+
if (used[j]) {
|
|
154
|
+
u[p[j]] = u[p[j]] + delta;
|
|
155
|
+
v[j] = v[j] - delta;
|
|
156
|
+
}
|
|
157
|
+
else {
|
|
158
|
+
minv[j] = minv[j] - delta;
|
|
159
|
+
}
|
|
160
|
+
}
|
|
161
|
+
j0 = j1;
|
|
162
|
+
} while (p[j0] !== 0);
|
|
163
|
+
do {
|
|
164
|
+
const j1 = way[j0];
|
|
165
|
+
p[j0] = p[j1];
|
|
166
|
+
j0 = j1;
|
|
167
|
+
} while (j0 !== 0);
|
|
168
|
+
}
|
|
169
|
+
const rowToCol = new Array(n).fill(-1);
|
|
170
|
+
for (let j = 1; j <= cols; j++)
|
|
171
|
+
if (p[j] > 0)
|
|
172
|
+
rowToCol[p[j] - 1] = j - 1;
|
|
173
|
+
return rowToCol;
|
|
174
|
+
}
|
|
175
|
+
/**
|
|
176
|
+
* Min-cost assignment that keeps filters in frequency order across slots (dynamic programming
|
|
177
|
+
* over filters × slots). Filters may be left out and slots left empty.
|
|
178
|
+
*/
|
|
179
|
+
function ordered(c, filters) {
|
|
180
|
+
const rows = c.active
|
|
181
|
+
.map((k, r) => ({ k, r }))
|
|
182
|
+
.sort((a, b) => compareNear(freqKey(filters[a.k]), freqKey(filters[b.k])) || a.k - b.k);
|
|
183
|
+
const n = rows.length;
|
|
184
|
+
const m = c.slots;
|
|
185
|
+
const w = m + 1;
|
|
186
|
+
const dp = new Float64Array((n + 1) * w);
|
|
187
|
+
for (let i = 1; i <= n; i++)
|
|
188
|
+
dp[i * w] = dp[(i - 1) * w] + c.drop[rows[i - 1].r];
|
|
189
|
+
const fill = (i, j) => {
|
|
190
|
+
const { r } = rows[i - 1];
|
|
191
|
+
return Math.min(dp[i * w + j - 1], dp[(i - 1) * w + j] + c.drop[r], dp[(i - 1) * w + j - 1] + c.cost[r]?.[j - 1]);
|
|
192
|
+
};
|
|
193
|
+
for (let i = 1; i <= n; i++)
|
|
194
|
+
for (let j = 1; j <= m; j++)
|
|
195
|
+
dp[i * w + j] = fill(i, j);
|
|
196
|
+
// Walk back preferring to leave the later slot empty, which moves filters to earlier slots.
|
|
197
|
+
const slotOf = new Map();
|
|
198
|
+
let i = n;
|
|
199
|
+
let j = m;
|
|
200
|
+
while (i > 0) {
|
|
201
|
+
const here = dp[i * w + j];
|
|
202
|
+
const { k, r } = rows[i - 1];
|
|
203
|
+
if (j > 0 && here === dp[i * w + j - 1])
|
|
204
|
+
j--;
|
|
205
|
+
else if (j > 0 &&
|
|
206
|
+
here === dp[(i - 1) * w + j - 1] + c.cost[r]?.[j - 1]) {
|
|
207
|
+
slotOf.set(k, j - 1);
|
|
208
|
+
i--;
|
|
209
|
+
j--;
|
|
210
|
+
}
|
|
211
|
+
else
|
|
212
|
+
i--;
|
|
213
|
+
}
|
|
214
|
+
return { slotOf };
|
|
215
|
+
}
|
|
216
|
+
/**
|
|
217
|
+
* Settle ties deterministically without raising the cost: move filters down into earlier empty
|
|
218
|
+
* slots, and (unless order must be kept) undo swaps of input order, while that costs nothing.
|
|
219
|
+
*/
|
|
220
|
+
function normalize(c, a, keepOrder) {
|
|
221
|
+
const row = new Map(c.active.map((k, r) => [k, r]));
|
|
222
|
+
const at = (k, s) => c.cost[row.get(k)]?.[s];
|
|
223
|
+
const occupant = new Array(c.slots);
|
|
224
|
+
for (const [k, s] of a.slotOf)
|
|
225
|
+
occupant[s] = k;
|
|
226
|
+
for (let changed = true; changed;) {
|
|
227
|
+
changed = false;
|
|
228
|
+
for (let s = 0; s < c.slots; s++) {
|
|
229
|
+
const k = occupant[s];
|
|
230
|
+
if (k === undefined)
|
|
231
|
+
continue;
|
|
232
|
+
// Under keepOrder, only the free slots right below s keep the order.
|
|
233
|
+
let from = 0;
|
|
234
|
+
if (keepOrder) {
|
|
235
|
+
from = s;
|
|
236
|
+
while (from > 0 && occupant[from - 1] === undefined)
|
|
237
|
+
from--;
|
|
238
|
+
}
|
|
239
|
+
for (let t = from; t < s; t++) {
|
|
240
|
+
if (occupant[t] === undefined && at(k, t) <= at(k, s) + TOLERANCE) {
|
|
241
|
+
occupant[t] = k;
|
|
242
|
+
occupant[s] = undefined;
|
|
243
|
+
changed = true;
|
|
244
|
+
break;
|
|
245
|
+
}
|
|
246
|
+
}
|
|
247
|
+
}
|
|
248
|
+
if (keepOrder)
|
|
249
|
+
continue;
|
|
250
|
+
for (let s1 = 0; s1 < c.slots; s1++) {
|
|
251
|
+
for (let s2 = s1 + 1; s2 < c.slots; s2++) {
|
|
252
|
+
const a1 = occupant[s1];
|
|
253
|
+
const b2 = occupant[s2];
|
|
254
|
+
if (a1 === undefined || b2 === undefined || a1 < b2)
|
|
255
|
+
continue;
|
|
256
|
+
if (at(a1, s2) + at(b2, s1) <= at(a1, s1) + at(b2, s2) + TOLERANCE) {
|
|
257
|
+
occupant[s1] = b2;
|
|
258
|
+
occupant[s2] = a1;
|
|
259
|
+
changed = true;
|
|
260
|
+
}
|
|
261
|
+
}
|
|
262
|
+
}
|
|
263
|
+
}
|
|
264
|
+
const slotOf = new Map();
|
|
265
|
+
occupant.forEach((k, s) => {
|
|
266
|
+
if (k !== undefined)
|
|
267
|
+
slotOf.set(k, s);
|
|
268
|
+
});
|
|
269
|
+
return { slotOf };
|
|
270
|
+
}
|
|
271
|
+
/** Assigned frequencies, once projected onto their slots, ascend with the slot index. */
|
|
272
|
+
function inOrder(p, filters, slotOf, strict) {
|
|
273
|
+
const freqs = [...slotOf]
|
|
274
|
+
.sort((a, b) => a[1] - b[1])
|
|
275
|
+
.map(([k, s]) => fitToSlot(p.slots[s], [], filters[k]).freq);
|
|
276
|
+
return freqs.every((f, i) => {
|
|
277
|
+
if (i === 0)
|
|
278
|
+
return true;
|
|
279
|
+
const prev = freqs[i - 1];
|
|
280
|
+
return strict ? f > prev && !near(f, prev) : f > prev || near(f, prev);
|
|
281
|
+
});
|
|
282
|
+
}
|
|
283
|
+
/** Every filter that can have a slot has one, and each fits its slot as it is. */
|
|
284
|
+
function valid(p, filters, a, m) {
|
|
285
|
+
const active = filters.filter(isActive).length;
|
|
286
|
+
if (a.slotOf.size !== Math.min(active, m))
|
|
287
|
+
return false;
|
|
288
|
+
return [...a.slotOf].every(([k, s]) => fitsSlot(p.slots[s], filters[k]));
|
|
289
|
+
}
|
|
290
|
+
//# sourceMappingURL=assign.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"assign.js","sourceRoot":"","sources":["../src/assign.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,QAAQ,EAAe,MAAM,aAAa,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,YAAY,EAAuC,MAAM,cAAc,CAAC;AAYhG;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,MAAM,CAAC,OAAgB,EAAE,OAA0B;IAClE,OAAO,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,YAAY,GAAG,GAAG,CAAC;AACzB,MAAM,YAAY,GAAG,GAAG,CAAC;AACzB,mGAAmG;AACnG,MAAM,SAAS,GAAG,KAAK,CAAC;AAExB,qGAAqG;AACrG,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,EAAE,CAClC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAE1F,mFAAmF;AACnF,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,YAAY,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;AAE3F,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7D,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7E,SAAS,IAAI,CAAC,IAAgB,EAAE,CAAS;IACxC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACjC,OAAO,CACN,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;QACtC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CACrC,CAAC;AACH,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,QAAQ,CAAC,IAAgB,EAAE,CAAS;IACnD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,OAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAW,CAAC,KAAK,CAC5C,CAAC,KAAK,EAAE,EAAE,CACT,CAAC,KAAK,KAAK,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CACjE,CAAC;AACH,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;AAE7E,MAAM,UAAU,YAAY,CAAC,CAAgB,EAAE,KAAwB;IACtE,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,SAAS,EAAE,MAAM,IAAI,IAAI,CAAC;IACzC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,CAAC;IAEvC,IAAI,MAA2B,CAAC;IAChC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,IAAI,GAAG,MAAM,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAC1B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAC1F,CAAC;YACF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CACpB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAC5F,CAAC;QACH,CAAC;QACD,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;SAAM,CAAC;QACP,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC3C,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAClB,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACzD,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;YAClD,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAE,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAC/E,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,oGAAoG;AACpG,MAAM,UAAU,mBAAmB,CAAC,CAAgB,EAAE,KAAwB;IAC7E,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,CAAC;IACvC,IAAI,CAAC,CAAC,WAAW;QAAE,OAAO,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACnD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACpC,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,MAAM,CAAC,OAAiB,EAAE,CAAS,EAAE,MAA2B;IACxE,MAAM,KAAK,GAAsB,IAAI,KAAK,CAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM;QAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAI,OAAO,CAAC,CAAC,CAAY,EAAE,CAAC;IACtE,OAAO;QACN,KAAK;QACL,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1F,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;KACpD,CAAC;AACH,CAAC;AAkBD,SAAS,KAAK,CAAC,CAAgB,EAAE,OAAiB,EAAE,MAAgB;IACnE,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO;QACN,MAAM;QACN,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;QAChF,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC;QAC1D,KAAK;KACL,CAAC;AACH,CAAC;AAED,sGAAsG;AACtG,SAAS,QAAQ,CAAC,CAAQ;IACzB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;IAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CACnC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAY,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAY,CAAC;IAClE,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CACxB,CAAS,EACT,IAAY,EACZ,IAAsC;IAEtC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACtC,GAAG,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAW,CAAC;YAC3B,IAAI,KAAK,GAAG,QAAQ,CAAC;YACrB,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,CAAC,CAAC;oBAAE,SAAS;gBACtB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAI,CAAC,CAAC,EAAE,CAAY,GAAI,CAAC,CAAC,CAAC,CAAY,CAAC;gBACvE,IAAI,GAAG,GAAI,IAAI,CAAC,CAAC,CAAY,EAAE,CAAC;oBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;oBACd,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACb,CAAC;gBACD,IAAK,IAAI,CAAC,CAAC,CAAY,GAAG,KAAK,EAAE,CAAC;oBACjC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;oBAC1B,EAAE,GAAG,CAAC,CAAC;gBACR,CAAC;YACF,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACb,CAAC,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,GAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAW,CAAY,GAAG,KAAK,CAAC;oBAC1D,CAAC,CAAC,CAAC,CAAC,GAAI,CAAC,CAAC,CAAC,CAAY,GAAG,KAAK,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACP,IAAI,CAAC,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,CAAY,GAAG,KAAK,CAAC;gBACvC,CAAC;YACF,CAAC;YACD,EAAE,GAAG,EAAE,CAAC;QACT,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE;QACtB,GAAG,CAAC;YACH,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAW,CAAC;YAC7B,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAW,CAAC;YACxB,EAAE,GAAG,EAAE,CAAC;QACT,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,IAAK,CAAC,CAAC,CAAC,CAAY,GAAG,CAAC;YAAE,QAAQ,CAAE,CAAC,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjG,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,CAAQ,EAAE,OAAiB;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,IAAI,CACJ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACR,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAC3F,CAAC;IACH,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAC1B,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAY,GAAI,CAAC,CAAC,IAAI,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAmB,CAAC,CAAC,CAAY,CAAC;IAChG,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,MAAM,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAkB,CAAC;QAC3C,OAAO,IAAI,CAAC,GAAG,CACd,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,EAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAY,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAY,EACtD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAY,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAY,CACpE,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAErF,4FAA4F;IAC5F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;QACrC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAA6B,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;aACxC,IACJ,CAAC,GAAG,CAAC;YACL,IAAI,KAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAY,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAY,EAC5E,CAAC;YACF,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACL,CAAC;;YAAM,CAAC,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAQ,EAAE,CAAa,EAAE,SAAkB;IAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,EAAE,CAAC,CAAC,CAAW,CAAC;IACjF,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAqB,CAAC,CAAC,KAAK,CAAC,CAAC;IACxD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM;QAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE/C,KAAK,IAAI,OAAO,GAAG,IAAI,EAAE,OAAO,GAAG,CAAC;QACnC,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC9B,qEAAqE;YACrE,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,IAAI,SAAS,EAAE,CAAC;gBACf,IAAI,GAAG,CAAC,CAAC;gBACT,OAAO,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,SAAS;oBAAE,IAAI,EAAE,CAAC;YAC7D,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;oBACnE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChB,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;oBACxB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,SAAS;YAAE,SAAS;QACxB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;YACrC,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE;oBAAE,SAAS;gBAC9D,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC;oBACpE,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;oBAClB,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;oBAClB,OAAO,GAAG,IAAI,CAAC;gBAChB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;AACnB,CAAC;AAED,yFAAyF;AACzF,SAAS,OAAO,CACf,CAAgB,EAChB,OAAiB,EACjB,MAA2B,EAC3B,MAAe;IAEf,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC;SACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAe,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,CAAC,CAAC;IACtF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACpC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,KAAK,CAAC,CAAgB,EAAE,OAAiB,EAAE,CAAa,EAAE,CAAS;IAC3E,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;IAC/C,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACxD,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAe,EAAE,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;AAClG,CAAC"}
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
import { type Filter } from './filter.ts';
|
|
2
|
+
import type { Profile } from './types/schema.generated.ts';
|
|
3
|
+
export interface CompleteWarning {
|
|
4
|
+
slot: number;
|
|
5
|
+
/**
|
|
6
|
+
* not-neutral: the filler is active, because the slot can't take a gain of 0 or only allows
|
|
7
|
+
* gainless types. no-room: no filler frequency satisfies ascendingFrequency.
|
|
8
|
+
*/
|
|
9
|
+
code: 'not-neutral' | 'no-room';
|
|
10
|
+
}
|
|
11
|
+
export interface CompleteResult {
|
|
12
|
+
/** Exactly bandCount written filters; the non-null filters of `slots` when unbounded. */
|
|
13
|
+
filters: Filter[];
|
|
14
|
+
warnings: CompleteWarning[];
|
|
15
|
+
}
|
|
16
|
+
/**
|
|
17
|
+
* Fill every empty slot with a neutral filter, for engines that always take bandCount filters
|
|
18
|
+
* (SPEC §13.7, the hardware write path). Filled slots pass through unchanged. Normative only
|
|
19
|
+
* through its properties: fillers are in their domains, neutral where the slot allows it, and
|
|
20
|
+
* under ascendingFrequency they keep the order whenever validate found no break.
|
|
21
|
+
*/
|
|
22
|
+
export declare function complete(profile: Profile, slots: readonly (Filter | null)[]): CompleteResult;
|
|
23
|
+
//# sourceMappingURL=complete.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"complete.d.ts","sourceRoot":"","sources":["../src/complete.ts"],"names":[],"mappings":"AAOA,OAAO,EAA6B,KAAK,MAAM,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAE3D,MAAM,WAAW,eAAe;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb;;;OAGG;IACH,IAAI,EAAE,aAAa,GAAG,SAAS,CAAC;CAChC;AAED,MAAM,WAAW,cAAc;IAC9B,yFAAyF;IACzF,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,eAAe,EAAE,CAAC;CAC5B;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,cAAc,CAqC5F"}
|
package/dist/complete.js
ADDED
|
@@ -0,0 +1,47 @@
|
|
|
1
|
+
import { ascendingFillerFreqs, defaultFillerFreq, fillerFinish, fillerStart } from "./filler.js";
|
|
2
|
+
import { isActive, normalizeFilter } from "./filter.js";
|
|
3
|
+
import { engineProfile } from "./resolve.js";
|
|
4
|
+
/**
|
|
5
|
+
* Fill every empty slot with a neutral filter, for engines that always take bandCount filters
|
|
6
|
+
* (SPEC §13.7, the hardware write path). Filled slots pass through unchanged. Normative only
|
|
7
|
+
* through its properties: fillers are in their domains, neutral where the slot allows it, and
|
|
8
|
+
* under ascendingFrequency they keep the order whenever validate found no break.
|
|
9
|
+
*/
|
|
10
|
+
export function complete(profile, slots) {
|
|
11
|
+
const p = engineProfile(profile);
|
|
12
|
+
if (p.bandCount === null) {
|
|
13
|
+
return { filters: slots.flatMap((f) => (f ? [normalizeFilter(f)] : [])), warnings: [] };
|
|
14
|
+
}
|
|
15
|
+
const n = p.bandCount;
|
|
16
|
+
const starts = new Map();
|
|
17
|
+
for (let i = 0; i < n; i++)
|
|
18
|
+
if (!slots[i])
|
|
19
|
+
starts.set(i, fillerStart(p.slots[i]));
|
|
20
|
+
const warnings = [];
|
|
21
|
+
const ascending = (profile.rules ?? []).find((r) => r.type === 'ascendingFrequency');
|
|
22
|
+
let freqs;
|
|
23
|
+
if (ascending) {
|
|
24
|
+
const chosen = ascendingFillerFreqs(p, slots, starts, ascending.strict ?? true);
|
|
25
|
+
freqs = chosen.freqs;
|
|
26
|
+
for (const slot of chosen.noRoom)
|
|
27
|
+
warnings.push({ slot, code: 'no-room' });
|
|
28
|
+
}
|
|
29
|
+
else {
|
|
30
|
+
freqs = new Map([...starts].map(([i, s]) => [i, defaultFillerFreq(s.freqDomain)]));
|
|
31
|
+
}
|
|
32
|
+
const filters = [];
|
|
33
|
+
for (let i = 0; i < n; i++) {
|
|
34
|
+
const f = slots[i];
|
|
35
|
+
if (f) {
|
|
36
|
+
filters.push(normalizeFilter(f));
|
|
37
|
+
continue;
|
|
38
|
+
}
|
|
39
|
+
const filler = fillerFinish(p.slots[i], starts.get(i), freqs.get(i));
|
|
40
|
+
if (isActive(filler))
|
|
41
|
+
warnings.push({ slot: i, code: 'not-neutral' });
|
|
42
|
+
filters.push(filler);
|
|
43
|
+
}
|
|
44
|
+
warnings.sort((a, b) => a.slot - b.slot);
|
|
45
|
+
return { filters, warnings };
|
|
46
|
+
}
|
|
47
|
+
//# sourceMappingURL=complete.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"complete.js","sourceRoot":"","sources":["../src/complete.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,oBAAoB,EACpB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EAEX,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAe,MAAM,aAAa,CAAC;AACrE,OAAO,EAAE,aAAa,EAAmB,MAAM,cAAc,CAAC;AAkB9D;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,OAAgB,EAAE,KAAiC;IAC3E,MAAM,CAAC,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACzF,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAe,CAAC,CAAC,CAAC;IAEhG,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAC;IACrF,IAAI,KAA0B,CAAC;IAC/B,IAAI,SAAS,EAAE,CAAC;QACf,MAAM,MAAM,GAAG,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;QAChF,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAC5E,CAAC;SAAM,CAAC;QACP,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,EAAE,CAAC;YACP,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,SAAS;QACV,CAAC;QACD,MAAM,MAAM,GAAG,YAAY,CAC1B,CAAC,CAAC,KAAK,CAAC,CAAC,CAAe,EACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAgB,EAC5B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAW,CACtB,CAAC;QACF,IAAI,QAAQ,CAAC,MAAM,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACtE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC"}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import { type Issue } from './issues.ts';
|
|
2
|
+
import type { Profile } from './types/schema.generated.ts';
|
|
3
|
+
/**
|
|
4
|
+
* Rules that span profiles: unique ids, `replacedBy` targets that exist (SPEC §10), and no two
|
|
5
|
+
* non-deprecated profiles with the same engine label claiming the same match entry for
|
|
6
|
+
* overlapping firmware (SPEC §3). Input: every published profile of the database.
|
|
7
|
+
*/
|
|
8
|
+
export declare function checkDatabase(profiles: readonly Profile[]): Issue[];
|
|
9
|
+
//# sourceMappingURL=database.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"database.d.ts","sourceRoot":"","sources":["../src/database.ts"],"names":[],"mappings":"AACA,OAAO,EAAS,KAAK,KAAK,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,KAAK,EAAkB,OAAO,EAAY,MAAM,6BAA6B,CAAC;AAErF;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,GAAG,KAAK,EAAE,CAkDnE"}
|
package/dist/database.js
ADDED
|
@@ -0,0 +1,50 @@
|
|
|
1
|
+
import { firmwareRangesOverlap } from "./firmware.js";
|
|
2
|
+
import { error } from "./issues.js";
|
|
3
|
+
/**
|
|
4
|
+
* Rules that span profiles: unique ids, `replacedBy` targets that exist (SPEC §10), and no two
|
|
5
|
+
* non-deprecated profiles with the same engine label claiming the same match entry for
|
|
6
|
+
* overlapping firmware (SPEC §3). Input: every published profile of the database.
|
|
7
|
+
*/
|
|
8
|
+
export function checkDatabase(profiles) {
|
|
9
|
+
const issues = [];
|
|
10
|
+
const at = (p, issue) => ({ ...issue, profileId: p.id });
|
|
11
|
+
const ids = new Set();
|
|
12
|
+
for (const p of profiles) {
|
|
13
|
+
if (ids.has(p.id))
|
|
14
|
+
issues.push(at(p, error('duplicate-id', '/id', `id "${p.id}" is used twice`)));
|
|
15
|
+
ids.add(p.id);
|
|
16
|
+
}
|
|
17
|
+
for (const p of profiles) {
|
|
18
|
+
const target = p.meta.replacedBy;
|
|
19
|
+
if (target !== undefined && !ids.has(target)) {
|
|
20
|
+
issues.push(at(p, error('replaced-by-missing', '/meta/replacedBy', `no profile has id "${target}"`)));
|
|
21
|
+
}
|
|
22
|
+
}
|
|
23
|
+
const claims = new Map();
|
|
24
|
+
for (const p of profiles) {
|
|
25
|
+
if (p.meta.status === 'deprecated' || !p.match)
|
|
26
|
+
continue;
|
|
27
|
+
const entries = [
|
|
28
|
+
...(p.match.usb ?? []).map((e, i) => [usbKey(e), `/match/usb/${i}`]),
|
|
29
|
+
...(p.match.bluetooth ?? []).map((e, i) => [
|
|
30
|
+
bluetoothKey(e),
|
|
31
|
+
`/match/bluetooth/${i}`
|
|
32
|
+
])
|
|
33
|
+
];
|
|
34
|
+
for (const [entryKey, path] of entries) {
|
|
35
|
+
const k = `${p.engine ?? ''}\u0000${entryKey}`;
|
|
36
|
+
for (const other of claims.get(k) ?? []) {
|
|
37
|
+
if (other.profile.id === p.id)
|
|
38
|
+
continue;
|
|
39
|
+
if (firmwareRangesOverlap(p.match.firmware, other.profile.match?.firmware)) {
|
|
40
|
+
issues.push(at(p, error('match-collision', path, `same match entry as ${other.profile.id} (${other.path}) for overlapping firmware; give them different engine labels or firmware ranges`)));
|
|
41
|
+
}
|
|
42
|
+
}
|
|
43
|
+
claims.set(k, [...(claims.get(k) ?? []), { profile: p, path }]);
|
|
44
|
+
}
|
|
45
|
+
}
|
|
46
|
+
return issues;
|
|
47
|
+
}
|
|
48
|
+
const usbKey = (e) => JSON.stringify(['usb', e.vendorId, e.productId ?? null, e.productName ?? null]);
|
|
49
|
+
const bluetoothKey = (e) => JSON.stringify(['bt', e.name ?? null, e.namePrefix ?? null, e.serviceUuid ?? null]);
|
|
50
|
+
//# sourceMappingURL=database.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"database.js","sourceRoot":"","sources":["../src/database.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,KAAK,EAAc,MAAM,aAAa,CAAC;AAGhD;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,QAA4B;IACzD,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,CAAC,CAAU,EAAE,KAAY,EAAS,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAChF,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CACV,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,qBAAqB,EAAE,kBAAkB,EAAE,sBAAsB,MAAM,GAAG,CAAC,CAAC,CACxF,CAAC;QACH,CAAC;IACF,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgD,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY,IAAI,CAAC,CAAC,CAAC,KAAK;YAAE,SAAS;QACzD,MAAM,OAAO,GAAuB;YACnC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAoB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;YACtF,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAoB,EAAE,CAAC;gBAC5D,YAAY,CAAC,CAAC,CAAC;gBACf,oBAAoB,CAAC,EAAE;aACvB,CAAC;SACF,CAAC;QACF,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,EAAE,SAAS,QAAQ,EAAE,CAAC;YAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;oBAAE,SAAS;gBACxC,IAAI,qBAAqB,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5E,MAAM,CAAC,IAAI,CACV,EAAE,CACD,CAAC,EACD,KAAK,CACJ,iBAAiB,EACjB,IAAI,EACJ,uBAAuB,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI,kFAAkF,CACxI,CACD,CACD,CAAC;gBACH,CAAC;YACF,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACjE,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAW,EAAE,EAAE,CAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC;AAEjF,MAAM,YAAY,GAAG,CAAC,CAAiB,EAAE,EAAE,CAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
import type { FilterType, Law, SlotFields, Variant } from './types/schema.generated.ts';
|
|
2
|
+
/** A filter field. */
|
|
3
|
+
export type Field = 'type' | 'freq' | 'q' | 'gain';
|
|
4
|
+
/** A filter field with a numeric domain. */
|
|
5
|
+
export type NumericField = 'freq' | 'q' | 'gain';
|
|
6
|
+
export declare const NUMERIC_FIELDS: readonly ["freq", "q", "gain"];
|
|
7
|
+
/** Fields a variant's `when` reads. */
|
|
8
|
+
export declare function variantReads(v: Variant): Field[];
|
|
9
|
+
/** Fields a variant defines. */
|
|
10
|
+
export declare function variantDefines(v: Variant): NumericField[];
|
|
11
|
+
/** Dependency edges a law adds for filters of its types (SPEC §8). Unknown laws add none. */
|
|
12
|
+
export declare function lawEdges(law: Law): [Field, NumericField][];
|
|
13
|
+
/** Whether a law applies to a filter of one of these types. */
|
|
14
|
+
export declare function lawApplies(law: Law, types: readonly FilterType[] | undefined): boolean;
|
|
15
|
+
/** Variant edges A → F and law edges of one merged slot. Self-references are left out. */
|
|
16
|
+
export declare function slotEdges(slot: SlotFields, laws: readonly Law[]): [Field, NumericField][];
|
|
17
|
+
export declare function findCycle(edges: readonly [Field, Field][]): Field[] | null;
|
|
18
|
+
/**
|
|
19
|
+
* The order in which an engine evaluates a slot's numeric fields (SPEC §6, §13.1): topological
|
|
20
|
+
* over the variant and law edges, ties broken freq, q, gain. `type` always comes first and is not
|
|
21
|
+
* listed. On a cyclic (invalid) profile the remaining fields follow in that same order.
|
|
22
|
+
*/
|
|
23
|
+
export declare function fieldOrder(slot: SlotFields, laws: readonly Law[]): NumericField[];
|
|
24
|
+
//# sourceMappingURL=dependencies.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"dependencies.d.ts","sourceRoot":"","sources":["../src/dependencies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAExF,sBAAsB;AACtB,MAAM,MAAM,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;AACnD,4CAA4C;AAC5C,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;AAEjD,eAAO,MAAM,cAAc,gCAAiC,CAAC;AAE7D,uCAAuC;AACvC,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,KAAK,EAAE,CAEhD;AAED,gCAAgC;AAChC,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,YAAY,EAAE,CAEzD;AAED,6FAA6F;AAC7F,wBAAgB,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAW1D;AAED,+DAA+D;AAC/D,wBAAgB,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,SAAS,GAAG,OAAO,CAEtF;AAED,0FAA0F;AAC1F,wBAAgB,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,GAAG,EAAE,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CASzF;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CA0B1E;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,GAAG,EAAE,GAAG,YAAY,EAAE,CAajF"}
|