@dsqlbase/core 0.2.0 → 0.3.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/CHANGELOG.md +31 -0
- package/dist/definition/base.d.ts +3 -30
- package/dist/definition/base.d.ts.map +1 -1
- package/dist/definition/base.js +3 -14
- package/dist/definition/base.js.map +1 -1
- package/dist/definition/column.d.ts +22 -14
- package/dist/definition/column.d.ts.map +1 -1
- package/dist/definition/column.js +11 -37
- package/dist/definition/column.js.map +1 -1
- package/dist/definition/constraint.d.ts +9 -9
- package/dist/definition/constraint.d.ts.map +1 -1
- package/dist/definition/constraint.js.map +1 -1
- package/dist/definition/domain.d.ts +2 -1
- package/dist/definition/domain.d.ts.map +1 -1
- package/dist/definition/domain.js +2 -1
- package/dist/definition/domain.js.map +1 -1
- package/dist/definition/index.d.ts +5 -6
- package/dist/definition/index.d.ts.map +1 -1
- package/dist/definition/index.js +3 -4
- package/dist/definition/index.js.map +1 -1
- package/dist/definition/indexes.d.ts +9 -20
- package/dist/definition/indexes.d.ts.map +1 -1
- package/dist/definition/indexes.js +3 -6
- package/dist/definition/indexes.js.map +1 -1
- package/dist/definition/namespace.d.ts +2 -2
- package/dist/definition/namespace.d.ts.map +1 -1
- package/dist/definition/namespace.js.map +1 -1
- package/dist/definition/policy.d.ts +35 -0
- package/dist/definition/policy.d.ts.map +1 -0
- package/dist/definition/policy.js +42 -0
- package/dist/definition/policy.js.map +1 -0
- package/dist/definition/relations.d.ts +28 -33
- package/dist/definition/relations.d.ts.map +1 -1
- package/dist/definition/relations.js +1 -4
- package/dist/definition/relations.js.map +1 -1
- package/dist/definition/table.d.ts +39 -32
- package/dist/definition/table.d.ts.map +1 -1
- package/dist/definition/table.js +57 -67
- package/dist/definition/table.js.map +1 -1
- package/dist/definition/union.d.ts +18 -61
- package/dist/definition/union.d.ts.map +1 -1
- package/dist/definition/union.js +8 -69
- package/dist/definition/union.js.map +1 -1
- package/dist/index.d.ts +5 -3
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +5 -3
- package/dist/index.js.map +1 -1
- package/dist/resolvers/codec.d.ts +16 -0
- package/dist/resolvers/codec.d.ts.map +1 -0
- package/dist/resolvers/codec.js +9 -0
- package/dist/resolvers/codec.js.map +1 -0
- package/dist/resolvers/hooks.d.ts +39 -0
- package/dist/resolvers/hooks.d.ts.map +1 -0
- package/dist/resolvers/hooks.js +2 -0
- package/dist/resolvers/hooks.js.map +1 -0
- package/dist/resolvers/index.d.ts +5 -0
- package/dist/resolvers/index.d.ts.map +1 -0
- package/dist/resolvers/index.js +2 -0
- package/dist/resolvers/index.js.map +1 -0
- package/dist/resolvers/policy.d.ts +31 -0
- package/dist/resolvers/policy.d.ts.map +1 -0
- package/dist/resolvers/policy.js +2 -0
- package/dist/resolvers/policy.js.map +1 -0
- package/dist/resolvers/validator.d.ts +14 -0
- package/dist/resolvers/validator.d.ts.map +1 -0
- package/dist/resolvers/validator.js +2 -0
- package/dist/resolvers/validator.js.map +1 -0
- package/dist/runtime/base.d.ts +7 -4
- package/dist/runtime/base.d.ts.map +1 -1
- package/dist/runtime/base.js.map +1 -1
- package/dist/runtime/build.d.ts +22 -0
- package/dist/runtime/build.d.ts.map +1 -0
- package/dist/runtime/build.js +184 -0
- package/dist/runtime/build.js.map +1 -0
- package/dist/runtime/column.d.ts +40 -23
- package/dist/runtime/column.d.ts.map +1 -1
- package/dist/runtime/column.js +120 -28
- package/dist/runtime/column.js.map +1 -1
- package/dist/runtime/context.d.ts +17 -26
- package/dist/runtime/context.d.ts.map +1 -1
- package/dist/runtime/context.js +4 -6
- package/dist/runtime/context.js.map +1 -1
- package/dist/runtime/errors.d.ts +31 -9
- package/dist/runtime/errors.d.ts.map +1 -1
- package/dist/runtime/errors.js +54 -11
- package/dist/runtime/errors.js.map +1 -1
- package/dist/runtime/executor.d.ts.map +1 -1
- package/dist/runtime/executor.js +10 -1
- package/dist/runtime/executor.js.map +1 -1
- package/dist/runtime/index.d.ts +10 -6
- package/dist/runtime/index.d.ts.map +1 -1
- package/dist/runtime/index.js +5 -3
- package/dist/runtime/index.js.map +1 -1
- package/dist/runtime/operation.d.ts +62 -83
- package/dist/runtime/operation.d.ts.map +1 -1
- package/dist/runtime/operation.js +194 -260
- package/dist/runtime/operation.js.map +1 -1
- package/dist/runtime/policy.d.ts +35 -0
- package/dist/runtime/policy.d.ts.map +1 -0
- package/dist/runtime/policy.js +72 -0
- package/dist/runtime/policy.js.map +1 -0
- package/dist/runtime/reference.d.ts +87 -0
- package/dist/runtime/reference.d.ts.map +1 -0
- package/dist/runtime/reference.js +68 -0
- package/dist/runtime/reference.js.map +1 -0
- package/dist/runtime/registry.d.ts +26 -95
- package/dist/runtime/registry.d.ts.map +1 -1
- package/dist/runtime/registry.js +29 -408
- package/dist/runtime/registry.js.map +1 -1
- package/dist/runtime/relation.d.ts +45 -0
- package/dist/runtime/relation.d.ts.map +1 -0
- package/dist/runtime/relation.js +2 -0
- package/dist/runtime/relation.js.map +1 -0
- package/dist/runtime/table.d.ts +31 -35
- package/dist/runtime/table.d.ts.map +1 -1
- package/dist/runtime/table.js +78 -47
- package/dist/runtime/table.js.map +1 -1
- package/dist/runtime/union.d.ts +11 -4
- package/dist/runtime/union.d.ts.map +1 -1
- package/dist/runtime/union.js +18 -7
- package/dist/runtime/union.js.map +1 -1
- package/dist/sql/index.d.ts +2 -2
- package/dist/sql/index.d.ts.map +1 -1
- package/dist/sql/index.js +1 -1
- package/dist/sql/index.js.map +1 -1
- package/dist/sql/nodes.d.ts +22 -0
- package/dist/sql/nodes.d.ts.map +1 -1
- package/dist/sql/nodes.js +21 -0
- package/dist/sql/nodes.js.map +1 -1
- package/dist/sql/tag.d.ts +3 -15
- package/dist/sql/tag.d.ts.map +1 -1
- package/dist/sql/tag.js +5 -71
- package/dist/sql/tag.js.map +1 -1
- package/dist/utils/index.d.ts +1 -1
- package/dist/utils/index.d.ts.map +1 -1
- package/dist/utils/index.js.map +1 -1
- package/dist/utils/types.d.ts +2 -14
- package/dist/utils/types.d.ts.map +1 -1
- package/dist/utils/types.js.map +1 -1
- package/dist/validation/index.d.ts +2 -0
- package/dist/validation/index.d.ts.map +1 -0
- package/dist/validation/index.js +2 -0
- package/dist/validation/index.js.map +1 -0
- package/dist/validation/references.d.ts +23 -0
- package/dist/validation/references.d.ts.map +1 -0
- package/dist/validation/references.js +240 -0
- package/dist/validation/references.js.map +1 -0
- package/dist/validation/validate.d.ts +40 -0
- package/dist/validation/validate.d.ts.map +1 -0
- package/dist/validation/validate.js +354 -0
- package/dist/validation/validate.js.map +1 -0
- package/package.json +13 -4
- package/dist/definition/embedded.d.ts +0 -131
- package/dist/definition/embedded.d.ts.map +0 -1
- package/dist/definition/embedded.js +0 -133
- package/dist/definition/embedded.js.map +0 -1
- package/dist/definition/tenant.d.ts +0 -50
- package/dist/definition/tenant.d.ts.map +0 -1
- package/dist/definition/tenant.js +0 -73
- package/dist/definition/tenant.js.map +0 -1
- package/dist/runtime/group.d.ts +0 -54
- package/dist/runtime/group.d.ts.map +0 -1
- package/dist/runtime/group.js +0 -96
- package/dist/runtime/group.js.map +0 -1
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/validation/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,eAAe,EACf,eAAe,EACf,KAAK,eAAe,GACrB,MAAM,eAAe,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/validation/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,eAAe,EACf,eAAe,GAEhB,MAAM,eAAe,CAAC","sourcesContent":["export {\n validateSchema,\n collectRelations,\n findColumnAlias,\n memberToColumns,\n type SourcedRelation,\n} from \"./validate.js\";\n"]}
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
import { AnyColumnDefinition, AnyTableDefinition, AnyUnionDefinition } from "../definition/index.js";
|
|
2
|
+
import type { SourcedRelation } from "./validate.js";
|
|
3
|
+
export type ReferenceIndex = {
|
|
4
|
+
/** Table definition → the alias the schema exports it under. */
|
|
5
|
+
readonly aliases: ReadonlyMap<AnyTableDefinition, string>;
|
|
6
|
+
/** Union definition → its schema alias. */
|
|
7
|
+
readonly unions: ReadonlyMap<AnyUnionDefinition, string>;
|
|
8
|
+
/** Column definition → the table it is declared on. */
|
|
9
|
+
readonly owners: ReadonlyMap<AnyColumnDefinition, AnyTableDefinition>;
|
|
10
|
+
};
|
|
11
|
+
/**
|
|
12
|
+
* Checks what columns point at, across every relation:
|
|
13
|
+
*
|
|
14
|
+
* - no column's references lead back to it: a ring ends at no key, for any column;
|
|
15
|
+
* - a column with hooks reads its value through what it references, so every chain from it ends
|
|
16
|
+
* at one column, or one union — a table end that is one of that union's members agrees with
|
|
17
|
+
* it — and each member of that union is reached through a single-column unique key, which is
|
|
18
|
+
* what the member's value can name.
|
|
19
|
+
*
|
|
20
|
+
* A plain column may point at two targets: a key can be a foreign key of two tables.
|
|
21
|
+
*/
|
|
22
|
+
export declare function validateReferences(relations: readonly SourcedRelation[], index: ReferenceIndex, memberColumns: (entry: SourcedRelation) => Record<string, AnyColumnDefinition[]>): void;
|
|
23
|
+
//# sourceMappingURL=references.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"references.d.ts","sourceRoot":"","sources":["../../src/validation/references.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAOnB,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAwBrD,MAAM,MAAM,cAAc,GAAG;IAC3B,gEAAgE;IAChE,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;IAC1D,2CAA2C;IAC3C,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;IACzD,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,mBAAmB,EAAE,kBAAkB,CAAC,CAAC;CACvE,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,SAAS,eAAe,EAAE,EACrC,KAAK,EAAE,cAAc,EACrB,aAAa,EAAE,CAAC,KAAK,EAAE,eAAe,KAAK,MAAM,CAAC,MAAM,EAAE,mBAAmB,EAAE,CAAC,GAC/E,IAAI,CA0DN"}
|
|
@@ -0,0 +1,240 @@
|
|
|
1
|
+
import { IndexColumnDefinition, PrimaryKeyConstraintDefinition, Relation, UniqueConstraintDefinition, UnionDefinition, } from "../definition/index.js";
|
|
2
|
+
/**
|
|
3
|
+
* Checks what columns point at, across every relation:
|
|
4
|
+
*
|
|
5
|
+
* - no column's references lead back to it: a ring ends at no key, for any column;
|
|
6
|
+
* - a column with hooks reads its value through what it references, so every chain from it ends
|
|
7
|
+
* at one column, or one union — a table end that is one of that union's members agrees with
|
|
8
|
+
* it — and each member of that union is reached through a single-column unique key, which is
|
|
9
|
+
* what the member's value can name.
|
|
10
|
+
*
|
|
11
|
+
* A plain column may point at two targets: a key can be a foreign key of two tables.
|
|
12
|
+
*/
|
|
13
|
+
export function validateReferences(relations, index, memberColumns) {
|
|
14
|
+
const references = collectReferences(relations, memberColumns);
|
|
15
|
+
const label = (column) => labelOf(column, index);
|
|
16
|
+
for (const column of references.keys()) {
|
|
17
|
+
const { ring } = resolveEnds(column, references);
|
|
18
|
+
if (ring) {
|
|
19
|
+
throw new Error(`Columns ${ring.map((c) => `"${label(c)}"`).join(" → ")} reference each other in a ` +
|
|
20
|
+
`ring, so none of them ends at a key. One side of a relation must be a key.`);
|
|
21
|
+
}
|
|
22
|
+
}
|
|
23
|
+
for (const column of references.keys()) {
|
|
24
|
+
if (!column["_hooks"]) {
|
|
25
|
+
continue;
|
|
26
|
+
}
|
|
27
|
+
const candidates = (references.get(column) ?? []).flatMap((reference) => endsOf(reference, references).map((end) => ({ via: describeVia(reference, index), end })));
|
|
28
|
+
const unions = candidates.filter((candidate) => candidate.end.kind === "union");
|
|
29
|
+
const [first] = unions.length > 0 ? unions : candidates;
|
|
30
|
+
if (!first) {
|
|
31
|
+
continue;
|
|
32
|
+
}
|
|
33
|
+
const conflict = candidates.find(({ end }) => !agrees(first.end, end));
|
|
34
|
+
if (conflict) {
|
|
35
|
+
throw new Error(`Column "${label(column)}" is paired by ${first.via} with ` +
|
|
36
|
+
`${describeEnd(first.end, index)} and by ${conflict.via} with ` +
|
|
37
|
+
`${describeEnd(conflict.end, index)}. A column with hooks — a guid(), say — reads ` +
|
|
38
|
+
`its value through what it references, so it must reference one target.`);
|
|
39
|
+
}
|
|
40
|
+
if (first.end.kind !== "union") {
|
|
41
|
+
continue;
|
|
42
|
+
}
|
|
43
|
+
for (const [member, target] of Object.entries(first.end.reference.members)) {
|
|
44
|
+
const table = first.end.reference.union.members[member];
|
|
45
|
+
if (!isSingleColumnKey(table, target)) {
|
|
46
|
+
throw new Error(`Column "${label(column)}" reads its member from a discriminator, but ` +
|
|
47
|
+
`"${label(target)}" is not a unique key of union member "${member}". Every member ` +
|
|
48
|
+
`a column with hooks — a polymorphic guid(), say — can name must be related ` +
|
|
49
|
+
`through a unique key of its own.`);
|
|
50
|
+
}
|
|
51
|
+
}
|
|
52
|
+
}
|
|
53
|
+
}
|
|
54
|
+
/** Every reference, on the foreign key, as `linkReferences` sets them. */
|
|
55
|
+
function collectReferences(relations, memberColumns) {
|
|
56
|
+
const references = new Map();
|
|
57
|
+
const add = (column, reference) => {
|
|
58
|
+
// A pair of a column with itself says nothing about where it points.
|
|
59
|
+
if (reference.kind === "table" && reference.column === column) {
|
|
60
|
+
return;
|
|
61
|
+
}
|
|
62
|
+
const held = references.get(column) ?? [];
|
|
63
|
+
if (!held.some((existing) => isSame(existing, reference))) {
|
|
64
|
+
references.set(column, [...held, reference]);
|
|
65
|
+
}
|
|
66
|
+
};
|
|
67
|
+
// A has-many / has-one declared on a union: one copy per member, gathered by field.
|
|
68
|
+
const fromUnions = new Map();
|
|
69
|
+
for (const entry of relations) {
|
|
70
|
+
const { relation } = entry;
|
|
71
|
+
const belongsTo = relation.type === Relation.BELONGS_TO;
|
|
72
|
+
const from = relation.from;
|
|
73
|
+
if (relation.target instanceof UnionDefinition) {
|
|
74
|
+
const union = relation.target;
|
|
75
|
+
const lists = memberColumns(entry);
|
|
76
|
+
for (const [position, column] of from.entries()) {
|
|
77
|
+
if (belongsTo) {
|
|
78
|
+
add(column, {
|
|
79
|
+
kind: "union",
|
|
80
|
+
union,
|
|
81
|
+
members: Object.fromEntries(Object.entries(lists).map(([member, columns]) => [member, columns[position]])),
|
|
82
|
+
discriminator: relation.discriminator,
|
|
83
|
+
via: entry,
|
|
84
|
+
});
|
|
85
|
+
continue;
|
|
86
|
+
}
|
|
87
|
+
for (const columns of Object.values(lists)) {
|
|
88
|
+
add(columns[position], { kind: "table", column, via: entry });
|
|
89
|
+
}
|
|
90
|
+
}
|
|
91
|
+
continue;
|
|
92
|
+
}
|
|
93
|
+
const to = relation.to;
|
|
94
|
+
if (!belongsTo && entry.union) {
|
|
95
|
+
const key = `${entry.union.name}\u0000${entry.field}`;
|
|
96
|
+
fromUnions.set(key, [...(fromUnions.get(key) ?? []), entry]);
|
|
97
|
+
continue;
|
|
98
|
+
}
|
|
99
|
+
for (const [position, column] of from.entries()) {
|
|
100
|
+
if (belongsTo) {
|
|
101
|
+
add(column, { kind: "table", column: to[position], via: entry });
|
|
102
|
+
}
|
|
103
|
+
else {
|
|
104
|
+
add(to[position], { kind: "table", column, via: entry });
|
|
105
|
+
}
|
|
106
|
+
}
|
|
107
|
+
}
|
|
108
|
+
for (const copies of fromUnions.values()) {
|
|
109
|
+
const [first] = copies;
|
|
110
|
+
const union = first.union;
|
|
111
|
+
for (const [position, key] of first.relation.to.entries()) {
|
|
112
|
+
add(key, {
|
|
113
|
+
kind: "union",
|
|
114
|
+
union,
|
|
115
|
+
members: Object.fromEntries(copies.map((copy) => [
|
|
116
|
+
copy.member,
|
|
117
|
+
copy.relation.from[position],
|
|
118
|
+
])),
|
|
119
|
+
via: first,
|
|
120
|
+
});
|
|
121
|
+
}
|
|
122
|
+
}
|
|
123
|
+
return references;
|
|
124
|
+
}
|
|
125
|
+
/**
|
|
126
|
+
* Two references are one when they point at the same column, or at the same union over the same
|
|
127
|
+
* member columns — a computed discriminator is shared with a stored one over the same key, as
|
|
128
|
+
* `linkReferences` does.
|
|
129
|
+
*/
|
|
130
|
+
function isSame(a, b) {
|
|
131
|
+
if (a.kind === "table" || b.kind === "table") {
|
|
132
|
+
return a.kind === "table" && b.kind === "table" && a.column === b.column;
|
|
133
|
+
}
|
|
134
|
+
return (a.union === b.union &&
|
|
135
|
+
Object.entries(a.members).every(([member, column]) => b.members[member] === column) &&
|
|
136
|
+
(a.discriminator === b.discriminator || !a.discriminator || !b.discriminator));
|
|
137
|
+
}
|
|
138
|
+
/** Where `column`'s chains end, and the first ring met on the way. */
|
|
139
|
+
function resolveEnds(column, references) {
|
|
140
|
+
const ends = [];
|
|
141
|
+
let ring;
|
|
142
|
+
const walk = (current, path) => {
|
|
143
|
+
if (path.includes(current)) {
|
|
144
|
+
ring ??= [...path.slice(path.indexOf(current)), current];
|
|
145
|
+
return;
|
|
146
|
+
}
|
|
147
|
+
const held = references.get(current) ?? [];
|
|
148
|
+
if (held.length === 0) {
|
|
149
|
+
ends.push({ kind: "table", column: current });
|
|
150
|
+
return;
|
|
151
|
+
}
|
|
152
|
+
for (const reference of held) {
|
|
153
|
+
if (reference.kind === "table") {
|
|
154
|
+
walk(reference.column, [...path, current]);
|
|
155
|
+
}
|
|
156
|
+
else {
|
|
157
|
+
ends.push({ kind: "union", reference });
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
};
|
|
161
|
+
walk(column, []);
|
|
162
|
+
return ring ? { ends, ring } : { ends };
|
|
163
|
+
}
|
|
164
|
+
/** Where one reference leads: the ends of its target's chain, or the union itself. */
|
|
165
|
+
function endsOf(reference, references) {
|
|
166
|
+
return reference.kind === "table"
|
|
167
|
+
? resolveEnds(reference.column, references).ends
|
|
168
|
+
: [{ kind: "union", reference }];
|
|
169
|
+
}
|
|
170
|
+
/** Whether `end` names what `first` names; a member's column agrees with its union. */
|
|
171
|
+
function agrees(first, end) {
|
|
172
|
+
if (first.kind === "union") {
|
|
173
|
+
return end.kind === "union"
|
|
174
|
+
? isSame(first.reference, end.reference)
|
|
175
|
+
: Object.values(first.reference.members).includes(end.column);
|
|
176
|
+
}
|
|
177
|
+
return end.kind === "table" && end.column === first.column;
|
|
178
|
+
}
|
|
179
|
+
/**
|
|
180
|
+
* Whether `column` alone names at most one row of `table`: it is the whole primary key, a
|
|
181
|
+
* `.unique()` column, a one-column unique constraint, or a one-column unique index that is not
|
|
182
|
+
* partial.
|
|
183
|
+
*/
|
|
184
|
+
function isSingleColumnKey(table, column) {
|
|
185
|
+
if (column["_unique"]) {
|
|
186
|
+
return true;
|
|
187
|
+
}
|
|
188
|
+
const flagged = Object.values(table.columns).filter((candidate) => candidate["_primaryKey"]);
|
|
189
|
+
if (flagged.length === 1 && flagged[0] === column) {
|
|
190
|
+
return true;
|
|
191
|
+
}
|
|
192
|
+
for (const constraint of table["_constraints"]) {
|
|
193
|
+
if (constraint instanceof PrimaryKeyConstraintDefinition ||
|
|
194
|
+
constraint instanceof UniqueConstraintDefinition) {
|
|
195
|
+
const refs = constraint["_columns"];
|
|
196
|
+
if (refs.length === 1 && refs[0].name === column.name) {
|
|
197
|
+
return true;
|
|
198
|
+
}
|
|
199
|
+
}
|
|
200
|
+
}
|
|
201
|
+
for (const index of table["_indexes"]) {
|
|
202
|
+
const [first, ...rest] = index["_columns"];
|
|
203
|
+
if (index["_unique"] &&
|
|
204
|
+
!index["_where"] &&
|
|
205
|
+
rest.length === 0 &&
|
|
206
|
+
first instanceof IndexColumnDefinition &&
|
|
207
|
+
first["_column"].name === column.name) {
|
|
208
|
+
return true;
|
|
209
|
+
}
|
|
210
|
+
}
|
|
211
|
+
return false;
|
|
212
|
+
}
|
|
213
|
+
/** How a column is named in an error: `"articles.authorId"`. */
|
|
214
|
+
function labelOf(column, index) {
|
|
215
|
+
const table = index.owners.get(column);
|
|
216
|
+
if (!table) {
|
|
217
|
+
return column.name;
|
|
218
|
+
}
|
|
219
|
+
const field = Object.entries(table.columns).find(([, candidate]) => candidate === column)?.[0];
|
|
220
|
+
return `${index.aliases.get(table) ?? table.name}.${field ?? column.name}`;
|
|
221
|
+
}
|
|
222
|
+
/** How a reference's relation is named: `relation "author" on table "articles"`. */
|
|
223
|
+
function describeVia(reference, index) {
|
|
224
|
+
const { field, source, union } = reference.via;
|
|
225
|
+
return union
|
|
226
|
+
? `relation "${field}" on union "${index.unions.get(union) ?? union.name}"`
|
|
227
|
+
: `relation "${field}" on table "${index.aliases.get(source) ?? source.name}"`;
|
|
228
|
+
}
|
|
229
|
+
/** How a chain end is named in an error. */
|
|
230
|
+
function describeEnd(end, index) {
|
|
231
|
+
if (end.kind === "table") {
|
|
232
|
+
return `"${labelOf(end.column, index)}"`;
|
|
233
|
+
}
|
|
234
|
+
const { union, discriminator } = end.reference;
|
|
235
|
+
const alias = index.unions.get(union) ?? union.name;
|
|
236
|
+
return discriminator
|
|
237
|
+
? `union "${alias}" (per "${labelOf(discriminator, index)}")`
|
|
238
|
+
: `union "${alias}"`;
|
|
239
|
+
}
|
|
240
|
+
//# sourceMappingURL=references.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"references.js","sourceRoot":"","sources":["../../src/validation/references.ts"],"names":[],"mappings":"AAAA,OAAO,EAKL,qBAAqB,EACrB,8BAA8B,EAC9B,QAAQ,EACR,0BAA0B,EAC1B,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAkChC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,SAAqC,EACrC,KAAqB,EACrB,aAAgF;IAEhF,MAAM,UAAU,GAAG,iBAAiB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,CAAC,MAA2B,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEtE,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEjD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CACb,WAAW,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B;gBAClF,4EAA4E,CAC/E,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtB,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE,CACtE,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAC1F,CAAC;QACF,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QAChF,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;QAExD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAEvE,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CACb,WAAW,KAAK,CAAC,MAAM,CAAC,kBAAkB,KAAK,CAAC,GAAG,QAAQ;gBACzD,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,WAAW,QAAQ,CAAC,GAAG,QAAQ;gBAC/D,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,gDAAgD;gBACnF,wEAAwE,CAC3E,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3E,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAuB,CAAC;YAE9E,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CACb,WAAW,KAAK,CAAC,MAAM,CAAC,+CAA+C;oBACrE,IAAI,KAAK,CAAC,MAAM,CAAC,0CAA0C,MAAM,kBAAkB;oBACnF,6EAA6E;oBAC7E,kCAAkC,CACrC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,SAAS,iBAAiB,CACxB,SAAqC,EACrC,aAAgF;IAEhF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoC,CAAC;IAE/D,MAAM,GAAG,GAAG,CAAC,MAA2B,EAAE,SAAoB,EAAE,EAAE;QAChE,qEAAqE;QACrE,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,IAAI,SAAS,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC9D,OAAO;QACT,CAAC;QAED,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAE1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;YAC1D,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC,CAAC;IAEF,oFAAoF;IACpF,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;IAExD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;QAC3B,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,UAAU,CAAC;QACxD,MAAM,IAAI,GAAG,QAAQ,CAAC,IAA6B,CAAC;QAEpD,IAAI,QAAQ,CAAC,MAAM,YAAY,eAAe,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YAEnC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;gBAChD,IAAI,SAAS,EAAE,CAAC;oBACd,GAAG,CAAC,MAAM,EAAE;wBACV,IAAI,EAAE,OAAO;wBACb,KAAK;wBACL,OAAO,EAAE,MAAM,CAAC,WAAW,CACzB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAC9E;wBACD,aAAa,EAAE,QAAQ,CAAC,aAAa;wBACrC,GAAG,EAAE,KAAK;qBACX,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBAED,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC3C,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;YAED,SAAS;QACX,CAAC;QAED,MAAM,EAAE,GAAG,QAAQ,CAAC,EAA2B,CAAC;QAEhD,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,KAAK,EAAE,CAAC;YACtD,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7D,SAAS;QACX,CAAC;QAED,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,IAAI,SAAS,EAAE,CAAC;gBACd,GAAG,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YACnE,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,KAA2B,CAAC;QAEhD,KAAK,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAK,KAAK,CAAC,QAAQ,CAAC,EAA4B,CAAC,OAAO,EAAE,EAAE,CAAC;YACrF,GAAG,CAAC,GAAG,EAAE;gBACP,IAAI,EAAE,OAAO;gBACb,KAAK;gBACL,OAAO,EAAE,MAAM,CAAC,WAAW,CACzB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM;oBACV,IAAI,CAAC,QAAQ,CAAC,IAA8B,CAAC,QAAQ,CAAC;iBACxD,CAAC,CACH;gBACD,GAAG,EAAE,KAAK;aACX,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,CAAY,EAAE,CAAY;IACxC,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7C,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC;IAC3E,CAAC;IAED,OAAO,CACL,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;QACnB,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC;QACnF,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAC9E,CAAC;AACJ,CAAC;AAED,sEAAsE;AACtE,SAAS,WAAW,CAClB,MAA2B,EAC3B,UAAkE;IAElE,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,IAAI,IAAuC,CAAC;IAE5C,MAAM,IAAI,GAAG,CAAC,OAA4B,EAAE,IAA2B,EAAE,EAAE;QACzE,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACzD,OAAO;QACT,CAAC;QAED,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAE3C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9C,OAAO;QACT,CAAC;QAED,KAAK,MAAM,SAAS,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC/B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAEjB,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED,sFAAsF;AACtF,SAAS,MAAM,CACb,SAAoB,EACpB,UAAkE;IAElE,OAAO,SAAS,CAAC,IAAI,KAAK,OAAO;QAC/B,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,IAAI;QAChD,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;AACrC,CAAC;AAED,uFAAuF;AACvF,SAAS,MAAM,CAAC,KAAU,EAAE,GAAQ;IAClC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC,IAAI,KAAK,OAAO;YACzB,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC;YACxC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAyB,EAAE,MAA2B;IAC/E,IAAI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAsB,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CACtE,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,CACxC,CAAC;IAEF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC;QAC/C,IACE,UAAU,YAAY,8BAA8B;YACpD,UAAU,YAAY,0BAA0B,EAChD,CAAC;YACD,MAAM,IAAI,GAAI,UAA4C,CAAC,UAAU,CAAuB,CAAC;YAE7F,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;gBACtD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QACtC,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QAE3C,IACE,KAAK,CAAC,SAAS,CAAC;YAChB,CAAC,KAAK,CAAC,QAAQ,CAAC;YAChB,IAAI,CAAC,MAAM,KAAK,CAAC;YACjB,KAAK,YAAY,qBAAqB;YACrC,KAA4D,CAAC,SAAS,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAC7F,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gEAAgE;AAChE,SAAS,OAAO,CAAC,MAA2B,EAAE,KAAqB;IACjE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,SAAS,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAE/F,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;AAC7E,CAAC;AAED,oFAAoF;AACpF,SAAS,WAAW,CAAC,SAAoB,EAAE,KAAqB;IAC9D,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC;IAE/C,OAAO,KAAK;QACV,CAAC,CAAC,aAAa,KAAK,eAAe,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG;QAC3E,CAAC,CAAC,aAAa,KAAK,eAAe,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;AACnF,CAAC;AAED,4CAA4C;AAC5C,SAAS,WAAW,CAAC,GAAQ,EAAE,KAAqB;IAClD,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACzB,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC;IAC3C,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC;IAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC;IAEpD,OAAO,aAAa;QAClB,CAAC,CAAC,UAAU,KAAK,WAAW,OAAO,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI;QAC7D,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC;AACzB,CAAC","sourcesContent":["import {\n AnyColumnDefinition,\n AnyTableDefinition,\n AnyUnionDefinition,\n AnyUniqueConstraintDefinition,\n IndexColumnDefinition,\n PrimaryKeyConstraintDefinition,\n Relation,\n UniqueConstraintDefinition,\n UnionDefinition,\n} from \"../definition/index.js\";\nimport type { SourcedRelation } from \"./validate.js\";\n\n/**\n * What a foreign-key column points at, read from definitions: the same references\n * `buildSchema` later sets on runtime columns (`linkReferences`), enough to check them.\n */\ntype Reference =\n | { readonly kind: \"table\"; readonly column: AnyColumnDefinition; readonly via: SourcedRelation }\n | {\n readonly kind: \"union\";\n readonly union: AnyUnionDefinition;\n /** Member alias → the member's column at this position. */\n readonly members: Readonly<Record<string, AnyColumnDefinition>>;\n /** The stored discriminator; `undefined` when it is computed. */\n readonly discriminator?: AnyColumnDefinition;\n readonly via: SourcedRelation;\n };\n\ntype UnionReference = Extract<Reference, { kind: \"union\" }>;\n\ntype End =\n | { readonly kind: \"table\"; readonly column: AnyColumnDefinition }\n | { readonly kind: \"union\"; readonly reference: UnionReference };\n\nexport type ReferenceIndex = {\n /** Table definition → the alias the schema exports it under. */\n readonly aliases: ReadonlyMap<AnyTableDefinition, string>;\n /** Union definition → its schema alias. */\n readonly unions: ReadonlyMap<AnyUnionDefinition, string>;\n /** Column definition → the table it is declared on. */\n readonly owners: ReadonlyMap<AnyColumnDefinition, AnyTableDefinition>;\n};\n\n/**\n * Checks what columns point at, across every relation:\n *\n * - no column's references lead back to it: a ring ends at no key, for any column;\n * - a column with hooks reads its value through what it references, so every chain from it ends\n * at one column, or one union — a table end that is one of that union's members agrees with\n * it — and each member of that union is reached through a single-column unique key, which is\n * what the member's value can name.\n *\n * A plain column may point at two targets: a key can be a foreign key of two tables.\n */\nexport function validateReferences(\n relations: readonly SourcedRelation[],\n index: ReferenceIndex,\n memberColumns: (entry: SourcedRelation) => Record<string, AnyColumnDefinition[]>\n): void {\n const references = collectReferences(relations, memberColumns);\n const label = (column: AnyColumnDefinition) => labelOf(column, index);\n\n for (const column of references.keys()) {\n const { ring } = resolveEnds(column, references);\n\n if (ring) {\n throw new Error(\n `Columns ${ring.map((c) => `\"${label(c)}\"`).join(\" → \")} reference each other in a ` +\n `ring, so none of them ends at a key. One side of a relation must be a key.`\n );\n }\n }\n\n for (const column of references.keys()) {\n if (!column[\"_hooks\"]) {\n continue;\n }\n\n const candidates = (references.get(column) ?? []).flatMap((reference) =>\n endsOf(reference, references).map((end) => ({ via: describeVia(reference, index), end }))\n );\n const unions = candidates.filter((candidate) => candidate.end.kind === \"union\");\n const [first] = unions.length > 0 ? unions : candidates;\n\n if (!first) {\n continue;\n }\n\n const conflict = candidates.find(({ end }) => !agrees(first.end, end));\n\n if (conflict) {\n throw new Error(\n `Column \"${label(column)}\" is paired by ${first.via} with ` +\n `${describeEnd(first.end, index)} and by ${conflict.via} with ` +\n `${describeEnd(conflict.end, index)}. A column with hooks — a guid(), say — reads ` +\n `its value through what it references, so it must reference one target.`\n );\n }\n\n if (first.end.kind !== \"union\") {\n continue;\n }\n\n for (const [member, target] of Object.entries(first.end.reference.members)) {\n const table = first.end.reference.union.members[member] as AnyTableDefinition;\n\n if (!isSingleColumnKey(table, target)) {\n throw new Error(\n `Column \"${label(column)}\" reads its member from a discriminator, but ` +\n `\"${label(target)}\" is not a unique key of union member \"${member}\". Every member ` +\n `a column with hooks — a polymorphic guid(), say — can name must be related ` +\n `through a unique key of its own.`\n );\n }\n }\n }\n}\n\n/** Every reference, on the foreign key, as `linkReferences` sets them. */\nfunction collectReferences(\n relations: readonly SourcedRelation[],\n memberColumns: (entry: SourcedRelation) => Record<string, AnyColumnDefinition[]>\n): Map<AnyColumnDefinition, Reference[]> {\n const references = new Map<AnyColumnDefinition, Reference[]>();\n\n const add = (column: AnyColumnDefinition, reference: Reference) => {\n // A pair of a column with itself says nothing about where it points.\n if (reference.kind === \"table\" && reference.column === column) {\n return;\n }\n\n const held = references.get(column) ?? [];\n\n if (!held.some((existing) => isSame(existing, reference))) {\n references.set(column, [...held, reference]);\n }\n };\n\n // A has-many / has-one declared on a union: one copy per member, gathered by field.\n const fromUnions = new Map<string, SourcedRelation[]>();\n\n for (const entry of relations) {\n const { relation } = entry;\n const belongsTo = relation.type === Relation.BELONGS_TO;\n const from = relation.from as AnyColumnDefinition[];\n\n if (relation.target instanceof UnionDefinition) {\n const union = relation.target;\n const lists = memberColumns(entry);\n\n for (const [position, column] of from.entries()) {\n if (belongsTo) {\n add(column, {\n kind: \"union\",\n union,\n members: Object.fromEntries(\n Object.entries(lists).map(([member, columns]) => [member, columns[position]])\n ),\n discriminator: relation.discriminator,\n via: entry,\n });\n continue;\n }\n\n for (const columns of Object.values(lists)) {\n add(columns[position], { kind: \"table\", column, via: entry });\n }\n }\n\n continue;\n }\n\n const to = relation.to as AnyColumnDefinition[];\n\n if (!belongsTo && entry.union) {\n const key = `${entry.union.name}\\u0000${entry.field}`;\n fromUnions.set(key, [...(fromUnions.get(key) ?? []), entry]);\n continue;\n }\n\n for (const [position, column] of from.entries()) {\n if (belongsTo) {\n add(column, { kind: \"table\", column: to[position], via: entry });\n } else {\n add(to[position], { kind: \"table\", column, via: entry });\n }\n }\n }\n\n for (const copies of fromUnions.values()) {\n const [first] = copies;\n const union = first.union as AnyUnionDefinition;\n\n for (const [position, key] of (first.relation.to as AnyColumnDefinition[]).entries()) {\n add(key, {\n kind: \"union\",\n union,\n members: Object.fromEntries(\n copies.map((copy) => [\n copy.member,\n (copy.relation.from as AnyColumnDefinition[])[position],\n ])\n ),\n via: first,\n });\n }\n }\n\n return references;\n}\n\n/**\n * Two references are one when they point at the same column, or at the same union over the same\n * member columns — a computed discriminator is shared with a stored one over the same key, as\n * `linkReferences` does.\n */\nfunction isSame(a: Reference, b: Reference): boolean {\n if (a.kind === \"table\" || b.kind === \"table\") {\n return a.kind === \"table\" && b.kind === \"table\" && a.column === b.column;\n }\n\n return (\n a.union === b.union &&\n Object.entries(a.members).every(([member, column]) => b.members[member] === column) &&\n (a.discriminator === b.discriminator || !a.discriminator || !b.discriminator)\n );\n}\n\n/** Where `column`'s chains end, and the first ring met on the way. */\nfunction resolveEnds(\n column: AnyColumnDefinition,\n references: ReadonlyMap<AnyColumnDefinition, readonly Reference[]>\n): { ends: End[]; ring?: AnyColumnDefinition[] } {\n const ends: End[] = [];\n let ring: AnyColumnDefinition[] | undefined;\n\n const walk = (current: AnyColumnDefinition, path: AnyColumnDefinition[]) => {\n if (path.includes(current)) {\n ring ??= [...path.slice(path.indexOf(current)), current];\n return;\n }\n\n const held = references.get(current) ?? [];\n\n if (held.length === 0) {\n ends.push({ kind: \"table\", column: current });\n return;\n }\n\n for (const reference of held) {\n if (reference.kind === \"table\") {\n walk(reference.column, [...path, current]);\n } else {\n ends.push({ kind: \"union\", reference });\n }\n }\n };\n\n walk(column, []);\n\n return ring ? { ends, ring } : { ends };\n}\n\n/** Where one reference leads: the ends of its target's chain, or the union itself. */\nfunction endsOf(\n reference: Reference,\n references: ReadonlyMap<AnyColumnDefinition, readonly Reference[]>\n): End[] {\n return reference.kind === \"table\"\n ? resolveEnds(reference.column, references).ends\n : [{ kind: \"union\", reference }];\n}\n\n/** Whether `end` names what `first` names; a member's column agrees with its union. */\nfunction agrees(first: End, end: End): boolean {\n if (first.kind === \"union\") {\n return end.kind === \"union\"\n ? isSame(first.reference, end.reference)\n : Object.values(first.reference.members).includes(end.column);\n }\n\n return end.kind === \"table\" && end.column === first.column;\n}\n\n/**\n * Whether `column` alone names at most one row of `table`: it is the whole primary key, a\n * `.unique()` column, a one-column unique constraint, or a one-column unique index that is not\n * partial.\n */\nfunction isSingleColumnKey(table: AnyTableDefinition, column: AnyColumnDefinition): boolean {\n if (column[\"_unique\"]) {\n return true;\n }\n\n const flagged = Object.values<AnyColumnDefinition>(table.columns).filter(\n (candidate) => candidate[\"_primaryKey\"]\n );\n\n if (flagged.length === 1 && flagged[0] === column) {\n return true;\n }\n\n for (const constraint of table[\"_constraints\"]) {\n if (\n constraint instanceof PrimaryKeyConstraintDefinition ||\n constraint instanceof UniqueConstraintDefinition\n ) {\n const refs = (constraint as AnyUniqueConstraintDefinition)[\"_columns\"] as { name: string }[];\n\n if (refs.length === 1 && refs[0].name === column.name) {\n return true;\n }\n }\n }\n\n for (const index of table[\"_indexes\"]) {\n const [first, ...rest] = index[\"_columns\"];\n\n if (\n index[\"_unique\"] &&\n !index[\"_where\"] &&\n rest.length === 0 &&\n first instanceof IndexColumnDefinition &&\n (first as IndexColumnDefinition<string, AnyColumnDefinition>)[\"_column\"].name === column.name\n ) {\n return true;\n }\n }\n\n return false;\n}\n\n/** How a column is named in an error: `\"articles.authorId\"`. */\nfunction labelOf(column: AnyColumnDefinition, index: ReferenceIndex): string {\n const table = index.owners.get(column);\n\n if (!table) {\n return column.name;\n }\n\n const field = Object.entries(table.columns).find(([, candidate]) => candidate === column)?.[0];\n\n return `${index.aliases.get(table) ?? table.name}.${field ?? column.name}`;\n}\n\n/** How a reference's relation is named: `relation \"author\" on table \"articles\"`. */\nfunction describeVia(reference: Reference, index: ReferenceIndex): string {\n const { field, source, union } = reference.via;\n\n return union\n ? `relation \"${field}\" on union \"${index.unions.get(union) ?? union.name}\"`\n : `relation \"${field}\" on table \"${index.aliases.get(source) ?? source.name}\"`;\n}\n\n/** How a chain end is named in an error. */\nfunction describeEnd(end: End, index: ReferenceIndex): string {\n if (end.kind === \"table\") {\n return `\"${labelOf(end.column, index)}\"`;\n }\n\n const { union, discriminator } = end.reference;\n const alias = index.unions.get(union) ?? union.name;\n\n return discriminator\n ? `union \"${alias}\" (per \"${labelOf(discriminator, index)}\")`\n : `union \"${alias}\"`;\n}\n"]}
|
|
@@ -0,0 +1,40 @@
|
|
|
1
|
+
import { AnyColumnDefinition, AnyFieldRelation, AnyTableDefinition, AnyUnionDefinition, DefinitionSchema } from "../definition/index.js";
|
|
2
|
+
/**
|
|
3
|
+
* Checks a schema definition, throwing on the first problem. Pure: it reads definitions only,
|
|
4
|
+
* builds nothing, and keeps nothing — a schema it accepts can be built without further checks.
|
|
5
|
+
*
|
|
6
|
+
* - every union is keyed by an alias no table uses, and lists each member under the alias the
|
|
7
|
+
* schema exports it as;
|
|
8
|
+
* - every relation's pairs line up, carry the same column hooks, its discriminator is where one
|
|
9
|
+
* belongs, and its field name is free on the table that gets it — including each member of a
|
|
10
|
+
* union it is declared on;
|
|
11
|
+
* - no column's references form a ring, and a column with hooks references one target, reached
|
|
12
|
+
* in every union member through a unique key.
|
|
13
|
+
*/
|
|
14
|
+
export declare function validateSchema(schema: DefinitionSchema): void;
|
|
15
|
+
/** A relation as some table receives it: declared on that table, or on a union it is in. */
|
|
16
|
+
export type SourcedRelation = {
|
|
17
|
+
readonly field: string;
|
|
18
|
+
readonly relation: AnyFieldRelation;
|
|
19
|
+
/** The table that has the relation. */
|
|
20
|
+
readonly source: AnyTableDefinition;
|
|
21
|
+
/** The union it was declared on, for a relation whose source is a union. */
|
|
22
|
+
readonly union?: AnyUnionDefinition;
|
|
23
|
+
/** That union's member alias for `source`. */
|
|
24
|
+
readonly member?: string;
|
|
25
|
+
};
|
|
26
|
+
/**
|
|
27
|
+
* Every relation in the schema as the table that has it sees it, in declaration order. A
|
|
28
|
+
* relation declared on a union appears once per member, with `from` resolved to that member's
|
|
29
|
+
* columns. Throws on a name a table receives twice.
|
|
30
|
+
*/
|
|
31
|
+
export declare function collectRelations(schema: DefinitionSchema): SourcedRelation[];
|
|
32
|
+
/**
|
|
33
|
+
* The field alias a column is declared under on `table`, or `undefined` when the column does
|
|
34
|
+
* not belong to it. Identity, not name: a column from a different table that happens to share a
|
|
35
|
+
* name is not a match, which is the copy-paste mistake this catches.
|
|
36
|
+
*/
|
|
37
|
+
export declare function findColumnAlias(table: AnyTableDefinition, column: AnyColumnDefinition): string | undefined;
|
|
38
|
+
/** `to` as one column-definition list per member, whichever form it was written in. */
|
|
39
|
+
export declare function memberToColumns(label: string, alias: string, union: AnyUnionDefinition, to: AnyFieldRelation["to"]): Record<string, AnyColumnDefinition[]>;
|
|
40
|
+
//# sourceMappingURL=validate.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../src/validation/validate.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,gBAAgB,EAChB,kBAAkB,EAElB,kBAAkB,EAElB,gBAAgB,EAMjB,MAAM,wBAAwB,CAAC;AAGhC;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,gBAAgB,GAAG,IAAI,CAe7D;AAkBD,4FAA4F;AAC5F,MAAM,MAAM,eAAe,GAAG;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;IACpC,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,kBAAkB,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B,CAAC;AAQF;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,GAAG,eAAe,EAAE,CA8D5E;AAkHD;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,kBAAkB,EACzB,MAAM,EAAE,mBAAmB,GAC1B,MAAM,GAAG,SAAS,CAEpB;AAuLD,uFAAuF;AACvF,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,kBAAkB,EACzB,EAAE,EAAE,gBAAgB,CAAC,IAAI,CAAC,GACzB,MAAM,CAAC,MAAM,EAAE,mBAAmB,EAAE,CAAC,CAgDvC"}
|