@intentius/chant 0.124.96 → 0.124.98
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/dist/audit/core.d.ts +29 -0
- package/dist/audit/core.d.ts.map +1 -1
- package/dist/audit/core.js +48 -11
- package/dist/audit/identity.d.ts +27 -0
- package/dist/audit/identity.d.ts.map +1 -0
- package/dist/audit/identity.js +36 -0
- package/dist/audit/report-html.d.ts +3 -1
- package/dist/audit/report-html.d.ts.map +1 -1
- package/dist/audit/report-html.js +1 -1
- package/dist/audit/report-model.d.ts +16 -0
- package/dist/audit/report-model.d.ts.map +1 -1
- package/dist/audit/report-model.js +5 -1
- package/dist/change-set-graph.d.ts +3 -1
- package/dist/change-set-graph.d.ts.map +1 -1
- package/dist/change-set-graph.js +7 -1
- package/dist/change-set.d.ts +5 -2
- package/dist/change-set.d.ts.map +1 -1
- package/dist/change-set.js +6 -3
- package/dist/ci-agent.d.ts +17 -0
- package/dist/ci-agent.d.ts.map +1 -1
- package/dist/ci-agent.js +32 -0
- package/dist/ci-comment-allow.d.ts +88 -0
- package/dist/ci-comment-allow.d.ts.map +1 -0
- package/dist/ci-comment-allow.js +178 -0
- package/dist/ci-comment-commands.d.ts +12 -0
- package/dist/ci-comment-commands.d.ts.map +1 -1
- package/dist/ci-comment-commands.js +22 -0
- package/dist/ci-control.d.ts +6 -1
- package/dist/ci-control.d.ts.map +1 -1
- package/dist/ci-control.js +6 -1
- package/dist/ci-product.d.ts +3 -0
- package/dist/ci-product.d.ts.map +1 -1
- package/dist/ci-product.js +3 -0
- package/dist/cli/commands/audit.d.ts +3 -1
- package/dist/cli/commands/audit.d.ts.map +1 -1
- package/dist/cli/commands/audit.js +23 -6
- package/dist/cli/commands/import.d.ts +8 -1
- package/dist/cli/commands/import.d.ts.map +1 -1
- package/dist/cli/commands/import.js +31 -6
- package/dist/cli/handlers/agent.d.ts.map +1 -1
- package/dist/cli/handlers/agent.js +12 -2
- package/dist/cli/handlers/pr-comment.d.ts +6 -0
- package/dist/cli/handlers/pr-comment.d.ts.map +1 -1
- package/dist/cli/handlers/pr-comment.js +12 -0
- package/dist/cli/handlers/promote.d.ts.map +1 -1
- package/dist/cli/handlers/promote.js +53 -6
- package/dist/cli/main.d.ts.map +1 -1
- package/dist/cli/main.js +29 -6
- package/dist/cli/parse-args.d.ts.map +1 -1
- package/dist/cli/parse-args.js +23 -0
- package/dist/cli/registry.d.ts +8 -0
- package/dist/cli/registry.d.ts.map +1 -1
- package/dist/cloud-lister/mask.d.ts +30 -1
- package/dist/cloud-lister/mask.d.ts.map +1 -1
- package/dist/cloud-lister/mask.js +66 -3
- package/dist/components/driver.d.ts +8 -1
- package/dist/components/driver.d.ts.map +1 -1
- package/dist/components/driver.js +1 -0
- package/dist/components/product-pipeline.d.ts +23 -1
- package/dist/components/product-pipeline.d.ts.map +1 -1
- package/dist/components/product-pipeline.js +40 -7
- package/dist/components/product-plan.d.ts +20 -0
- package/dist/components/product-plan.d.ts.map +1 -1
- package/dist/components/product-plan.js +11 -1
- package/dist/control/applied.d.ts +8 -1
- package/dist/control/applied.d.ts.map +1 -1
- package/dist/control/applied.js +18 -2
- package/dist/control/dispatch.d.ts +52 -0
- package/dist/control/dispatch.d.ts.map +1 -1
- package/dist/control/dispatch.js +140 -4
- package/dist/control/train.d.ts +198 -0
- package/dist/control/train.d.ts.map +1 -0
- package/dist/control/train.js +294 -0
- package/dist/deep-observation.js +2 -2
- package/dist/floor-table.data.d.ts.map +1 -1
- package/dist/floor-table.data.js +7 -1
- package/dist/graph-detail.d.ts +9 -0
- package/dist/graph-detail.d.ts.map +1 -1
- package/dist/graph-detail.js +38 -13
- package/dist/graph-refs.d.ts +233 -3
- package/dist/graph-refs.d.ts.map +1 -1
- package/dist/graph-refs.js +106 -15
- package/dist/lint/post-synth.d.ts +22 -0
- package/dist/lint/post-synth.d.ts.map +1 -1
- package/dist/lint/rules/declarable-naming-convention.d.ts +12 -0
- package/dist/lint/rules/declarable-naming-convention.d.ts.map +1 -1
- package/dist/lint/rules/declarable-naming-convention.js +38 -8
- package/dist/lint/rules/imported-source.d.ts +20 -0
- package/dist/lint/rules/imported-source.d.ts.map +1 -0
- package/dist/lint/rules/imported-source.js +27 -0
- package/dist/lint/rules/no-unused-declarable.d.ts.map +1 -1
- package/dist/lint/rules/no-unused-declarable.js +3 -0
- package/dist/op/gate.d.ts +2 -0
- package/dist/op/gate.d.ts.map +1 -1
- package/dist/op/gate.js +8 -1
- package/dist/pr-forge-reads.d.ts +17 -0
- package/dist/pr-forge-reads.d.ts.map +1 -1
- package/dist/pr-forge-reads.js +55 -0
- package/dist/reconcile.d.ts +9 -0
- package/dist/reconcile.d.ts.map +1 -1
- package/dist/release-floors.d.ts +9 -1
- package/dist/release-floors.d.ts.map +1 -1
- package/dist/release-floors.js +10 -2
- package/dist/repo-path.d.ts +29 -0
- package/dist/repo-path.d.ts.map +1 -0
- package/dist/repo-path.js +81 -0
- package/dist/sensitive-key.d.ts +23 -0
- package/dist/sensitive-key.d.ts.map +1 -1
- package/dist/sensitive-key.js +37 -0
- package/dist/terraform/hcl2json.d.ts +7 -0
- package/dist/terraform/hcl2json.d.ts.map +1 -1
- package/dist/terraform/hcl2json.js +7 -0
- package/dist/wave-runtime.mjs +352 -345
- package/dist/workspace/catalog-edges.d.ts +147 -0
- package/dist/workspace/catalog-edges.d.ts.map +1 -0
- package/dist/workspace/catalog-edges.js +461 -0
- package/dist/workspace/compose-graph.d.ts +73 -3
- package/dist/workspace/compose-graph.d.ts.map +1 -1
- package/dist/workspace/declaration.d.ts +2 -0
- package/dist/workspace/declaration.d.ts.map +1 -1
- package/dist/workspace/declaration.js +1 -0
- package/dist/workspace/declaration.schema.json +6 -0
- package/dist/workspace/discover.d.ts +134 -0
- package/dist/workspace/discover.d.ts.map +1 -0
- package/dist/workspace/discover.js +372 -0
- package/dist/workspace/graph-cli.d.ts +20 -0
- package/dist/workspace/graph-cli.d.ts.map +1 -1
- package/dist/workspace/graph-cli.js +178 -20
- package/dist/workspace/graph.schema.json +195 -2
- package/dist/workspace/release-train.d.ts +214 -3
- package/dist/workspace/release-train.d.ts.map +1 -1
- package/dist/workspace/release-train.js +552 -16
- package/dist/workspace/repo-ref.d.ts +14 -0
- package/dist/workspace/repo-ref.d.ts.map +1 -1
- package/dist/workspace/repo-ref.js +26 -1
- package/dist/workspace/workspace-gates.d.ts +24 -0
- package/dist/workspace/workspace-gates.d.ts.map +1 -1
- package/dist/workspace/workspace-gates.js +29 -5
- package/dist/workspace/workspace-ledger.d.ts +31 -5
- package/dist/workspace/workspace-ledger.d.ts.map +1 -1
- package/dist/workspace/workspace-ledger.js +2 -1
- package/dist/workspace/workspace-run.d.ts +14 -0
- package/dist/workspace/workspace-run.d.ts.map +1 -1
- package/dist/workspace/workspace-run.js +2 -2
- package/dist/yaml.d.ts.map +1 -1
- package/dist/yaml.js +33 -8
- package/package.json +1 -1
- package/src/audit/core.test.ts +64 -1
- package/src/audit/core.ts +75 -10
- package/src/audit/identity.test.ts +31 -0
- package/src/audit/identity.ts +43 -0
- package/src/audit/report-html.ts +4 -2
- package/src/audit/report-model.ts +21 -1
- package/src/change-set-graph.test.ts +33 -1
- package/src/change-set-graph.ts +7 -1
- package/src/change-set.ts +6 -3
- package/src/ci-agent.test.ts +32 -0
- package/src/ci-agent.ts +42 -0
- package/src/ci-comment-allow.test.ts +380 -0
- package/src/ci-comment-allow.ts +184 -0
- package/src/ci-comment-commands.ts +25 -0
- package/src/ci-control.ts +42 -0
- package/src/ci-product.ts +3 -0
- package/src/cli/commands/audit-parser-notice.test.ts +74 -0
- package/src/cli/commands/audit.test.ts +12 -0
- package/src/cli/commands/audit.ts +25 -7
- package/src/cli/commands/import-layout.test.ts +2 -1
- package/src/cli/commands/import.ts +29 -6
- package/src/cli/handlers/agent.ts +13 -2
- package/src/cli/handlers/pr-before-merge.test.ts +18 -0
- package/src/cli/handlers/pr-comment.ts +12 -0
- package/src/cli/handlers/promote.test.ts +68 -0
- package/src/cli/handlers/promote.ts +52 -6
- package/src/cli/main.test.ts +5 -0
- package/src/cli/main.ts +29 -6
- package/src/cli/parse-args.ts +18 -0
- package/src/cli/registry.ts +8 -0
- package/src/cloud-lister/kubernetes.k3d.e2e.test.ts +104 -0
- package/src/cloud-lister/mask-references.test.ts +132 -0
- package/src/cloud-lister/mask.ts +68 -3
- package/src/components/driver.ts +9 -1
- package/src/components/product-pipeline.ts +57 -7
- package/src/components/product-plan.ts +27 -2
- package/src/control/applied.ts +33 -3
- package/src/control/dispatch.ts +156 -5
- package/src/control/train.test.ts +215 -0
- package/src/control/train.ts +413 -0
- package/src/deep-observation.ts +2 -2
- package/src/floor-table.data.ts +7 -1
- package/src/graph-detail.ts +37 -12
- package/src/graph-refs.test.ts +45 -1
- package/src/graph-refs.ts +321 -14
- package/src/lint/post-synth.ts +20 -0
- package/src/lint/rules/declarable-naming-convention.test.ts +35 -1
- package/src/lint/rules/declarable-naming-convention.ts +35 -8
- package/src/lint/rules/imported-source.test.ts +22 -0
- package/src/lint/rules/imported-source.ts +31 -0
- package/src/lint/rules/no-unused-declarable.test.ts +16 -0
- package/src/lint/rules/no-unused-declarable.ts +7 -0
- package/src/op/gate.ts +10 -2
- package/src/pr-forge-reads.ts +62 -0
- package/src/reconcile.ts +9 -0
- package/src/release-floors.ts +14 -2
- package/src/repo-path.test.ts +72 -0
- package/src/repo-path.ts +103 -0
- package/src/sensitive-key.ts +38 -0
- package/src/terraform/hcl2json.ts +8 -0
- package/src/workspace/application-set.e2e.test.ts +405 -0
- package/src/workspace/catalog-edges.ts +507 -0
- package/src/workspace/ci-green-workflow.test.ts +2 -2
- package/src/workspace/cluster-join.e2e.test.ts +150 -0
- package/src/workspace/compose-graph.ts +74 -5
- package/src/workspace/declaration.schema.json +6 -0
- package/src/workspace/declaration.ts +3 -0
- package/src/workspace/discover.e2e.test.ts +122 -0
- package/src/workspace/discover.test.ts +225 -0
- package/src/workspace/discover.ts +406 -0
- package/src/workspace/drift-reader.test.ts +3 -3
- package/src/workspace/external-secret-catalog.e2e.test.ts +98 -0
- package/src/workspace/external-secret-catalog.test.ts +142 -0
- package/src/workspace/graph-cli.ts +207 -21
- package/src/workspace/graph-contract.test.ts +92 -0
- package/src/workspace/graph.schema.json +195 -2
- package/src/workspace/helm-references.e2e.test.ts +135 -0
- package/src/workspace/identity-annotation-catalog.e2e.test.ts +91 -0
- package/src/workspace/identity-annotation-catalog.test.ts +139 -0
- package/src/workspace/release-train-repos.test.ts +304 -0
- package/src/workspace/release-train.test.ts +296 -0
- package/src/workspace/release-train.ts +631 -16
- package/src/workspace/repo-ref.ts +26 -1
- package/src/workspace/runs-on.test.ts +45 -0
- package/src/workspace/workspace-gates.ts +48 -5
- package/src/workspace/workspace-ledger.ts +28 -5
- package/src/workspace/workspace-run.test.ts +1 -1
- package/src/workspace/workspace-run.ts +2 -2
- package/src/yaml.test.ts +96 -8
- package/src/yaml.ts +36 -8
package/dist/graph-detail.js
CHANGED
|
@@ -83,6 +83,12 @@ function toStacks(ir) {
|
|
|
83
83
|
}
|
|
84
84
|
return { nodes, edges: sortEdges([...seen.values()]), groups: {} };
|
|
85
85
|
}
|
|
86
|
+
/** A node's attrs as a tier prints them: all of them at T3, the resource view at T2, overlay paint below. */
|
|
87
|
+
export function nodeAttrsAt(attrs, level) {
|
|
88
|
+
if (level === 3)
|
|
89
|
+
return attrs;
|
|
90
|
+
return level === 2 ? resourceAttrs(attrs) : paintAttrs(attrs);
|
|
91
|
+
}
|
|
86
92
|
/** T2 — every resource, each carrying the resource view of its attrs (the
|
|
87
93
|
* scalar/reference projection; the full property tree is T3's addition). */
|
|
88
94
|
function toDeclarables(ir) {
|
|
@@ -117,26 +123,25 @@ function rollupStatus(members) {
|
|
|
117
123
|
ids.sort();
|
|
118
124
|
return { _status: worst, ...(Object.keys(notGood).length > 0 ? { _memberStatus: notGood } : {}) };
|
|
119
125
|
}
|
|
120
|
-
/**
|
|
121
|
-
*
|
|
122
|
-
|
|
126
|
+
/**
|
|
127
|
+
* The composite instances of a graph, and the node each node is drawn as at
|
|
128
|
+
* T1: a member of an instance is drawn as the instance, any other node as
|
|
129
|
+
* itself.
|
|
130
|
+
*/
|
|
131
|
+
function compositeCollapse(ir) {
|
|
123
132
|
// A composite instance is its export name plus the composite that made it:
|
|
124
133
|
// an AWS FargateAlb and a GCP CloudRunServiceComposite both exported as
|
|
125
134
|
// `web` are two instances (#4178). One composite whose members span
|
|
126
135
|
// lexicons stays one instance.
|
|
127
136
|
const instanceKey = (n) => `${n.compositeInstance}\0${n.compositeParent ?? ""}`;
|
|
128
137
|
const instances = new Map();
|
|
129
|
-
const plain = [];
|
|
130
138
|
for (const n of ir.nodes) {
|
|
131
|
-
if (n.compositeInstance)
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
else {
|
|
138
|
-
plain.push({ ...n, attrs: paintAttrs(n.attrs) });
|
|
139
|
-
}
|
|
139
|
+
if (!n.compositeInstance)
|
|
140
|
+
continue;
|
|
141
|
+
const key = instanceKey(n);
|
|
142
|
+
const arr = instances.get(key) ?? [];
|
|
143
|
+
arr.push(n);
|
|
144
|
+
instances.set(key, arr);
|
|
140
145
|
}
|
|
141
146
|
// The collapsed id is the instance name, or `<instance>@<composite>` when
|
|
142
147
|
// two composites share the name.
|
|
@@ -153,6 +158,26 @@ function toComposites(ir) {
|
|
|
153
158
|
const idMap = new Map();
|
|
154
159
|
for (const n of ir.nodes)
|
|
155
160
|
idMap.set(n.id, n.compositeInstance ? collapsedId.get(instanceKey(n)) : n.id);
|
|
161
|
+
return { instances, collapsedId, idMap };
|
|
162
|
+
}
|
|
163
|
+
/**
|
|
164
|
+
* The node each node of the base IR is drawn as at a detail tier (#5097): at
|
|
165
|
+
* T0 its lexicon's stack node, at T1 the composite instance it belongs to,
|
|
166
|
+
* and itself at T2 and T3. A reader that derives edges from the base IR maps
|
|
167
|
+
* them through this to put them on the tier's nodes.
|
|
168
|
+
*/
|
|
169
|
+
export function detailIdMap(ir, level) {
|
|
170
|
+
if (level === 0)
|
|
171
|
+
return new Map(ir.nodes.map((n) => [n.id, n.lexicon]));
|
|
172
|
+
if (level === 1)
|
|
173
|
+
return compositeCollapse(ir).idMap;
|
|
174
|
+
return new Map(ir.nodes.map((n) => [n.id, n.id]));
|
|
175
|
+
}
|
|
176
|
+
/** T1 — collapse each composite instance to one node; internal edges disappear.
|
|
177
|
+
* Topology view: surviving plain nodes keep only overlay paint, not properties. */
|
|
178
|
+
function toComposites(ir) {
|
|
179
|
+
const { instances, collapsedId, idMap } = compositeCollapse(ir);
|
|
180
|
+
const plain = ir.nodes.filter((n) => !n.compositeInstance).map((n) => ({ ...n, attrs: paintAttrs(n.attrs) }));
|
|
156
181
|
const nodes = [...plain];
|
|
157
182
|
for (const [key, members] of instances) {
|
|
158
183
|
const types = new Set(members.map((m) => m.compositeParent).filter(Boolean));
|
package/dist/graph-refs.d.ts
CHANGED
|
@@ -75,6 +75,41 @@ export interface RefRule {
|
|
|
75
75
|
* reference and drawing the line twice.
|
|
76
76
|
*/
|
|
77
77
|
viaAttr?: string;
|
|
78
|
+
/**
|
|
79
|
+
* Reads the references itself, for a rule whose value does not name its
|
|
80
|
+
* target by one identifier (#5098): an ExternalSecret's key names a cloud
|
|
81
|
+
* secret only inside the project of the store it reads through, so the
|
|
82
|
+
* match spans the holder, a second node and the target. `path` and
|
|
83
|
+
* `targetKind` still name the rule (its id, its entry in a document's
|
|
84
|
+
* `catalog.rules`, the kind a dangling entry looks for), but the pass does
|
|
85
|
+
* not read `path` itself: it calls `join` with the holder and `find`, which
|
|
86
|
+
* returns the nodes a value names from the holder's scope, the way the
|
|
87
|
+
* pass's own lookup would. Each {@link JoinedRef} it returns is then
|
|
88
|
+
* resolved like a value read from `path`: no target is dangling (unless
|
|
89
|
+
* `optional`), two are ambiguous, one is an edge. Only the catalog pass
|
|
90
|
+
* over indexed nodes and declared graphs calls it. Pure.
|
|
91
|
+
*/
|
|
92
|
+
join?(holder: IRNode, find: FindNodes): JoinedRef[];
|
|
93
|
+
}
|
|
94
|
+
/**
|
|
95
|
+
* What a {@link RefRule.join} looks nodes up with. `find(value)` returns the
|
|
96
|
+
* nodes `value` names from the holder's own scope. `find(value, scope)`
|
|
97
|
+
* returns those named inside the scope called `scope` (a Kubernetes
|
|
98
|
+
* namespace), whatever scope the holder sits in, for a holder that names its
|
|
99
|
+
* target's namespace itself (#5099): a cloud IAM binding naming
|
|
100
|
+
* `<ns>/<name>`.
|
|
101
|
+
*/
|
|
102
|
+
export type FindNodes = (value: string, scope?: string) => readonly IRNode[];
|
|
103
|
+
/** One reference a {@link RefRule.join} found on a holder. */
|
|
104
|
+
export interface JoinedRef {
|
|
105
|
+
/** What the holder wrote, as a dangling or ambiguous entry reports it. */
|
|
106
|
+
value: string;
|
|
107
|
+
/** The nodes it names, from `find`; none is dangling. */
|
|
108
|
+
targets: readonly IRNode[];
|
|
109
|
+
/** The edge's `viaAttr`, when the first step of the rule's path does not say enough. */
|
|
110
|
+
via?: string;
|
|
111
|
+
/** A node the value was read through, named on a dangling entry (the store a key is read from). */
|
|
112
|
+
through?: IRNode;
|
|
78
113
|
}
|
|
79
114
|
/**
|
|
80
115
|
* A typed tag rule (#4522, ruled on INTENTIUS/behold#1023 Q5): a tag whose
|
|
@@ -92,12 +127,181 @@ export interface TagRefRule {
|
|
|
92
127
|
targetKind: string;
|
|
93
128
|
label?: string;
|
|
94
129
|
}
|
|
130
|
+
/**
|
|
131
|
+
* A kind whose names are unique only inside a scope the node names itself
|
|
132
|
+
* (#5097): a namespaced Kubernetes kind, whose scope is the value at
|
|
133
|
+
* `metadata.namespace`. Read on a declared graph, where nothing else says
|
|
134
|
+
* where a node sits. Over an index the node's location says it instead.
|
|
135
|
+
*/
|
|
136
|
+
export interface ScopeRule {
|
|
137
|
+
kind: string;
|
|
138
|
+
/**
|
|
139
|
+
* The attr path whose value names the scope. With none (#5100), the kind's
|
|
140
|
+
* names are unique inside the member that holds the node, which is what a
|
|
141
|
+
* namespaced kind with no namespace on the node gets.
|
|
142
|
+
*/
|
|
143
|
+
path?: string;
|
|
144
|
+
}
|
|
145
|
+
/**
|
|
146
|
+
* What the catalog pass on a declared graph reads for one node, when the
|
|
147
|
+
* node as printed is not what the rules are written against (#5097). A
|
|
148
|
+
* declared terraform block is `Terraform::Resource` with its arguments under
|
|
149
|
+
* `body`; its view has the provider type as `kind` and the literal arguments
|
|
150
|
+
* as `attrs`.
|
|
151
|
+
*/
|
|
152
|
+
export interface DeclaredCatalogNode {
|
|
153
|
+
kind: string;
|
|
154
|
+
attrs: Record<string, unknown>;
|
|
155
|
+
/** Arguments left out of `attrs` because their value is not literal (an interpolation, a reference). */
|
|
156
|
+
nonLiteral: number;
|
|
157
|
+
}
|
|
158
|
+
/**
|
|
159
|
+
* A node a lexicon adds to a declared workspace graph because several members
|
|
160
|
+
* name the same thing (#5100): one Helm chart that a kustomization, an Argo CD
|
|
161
|
+
* Application and a Terraform `helm_release` all name is one node, owned by
|
|
162
|
+
* none of them. The catalog pass draws an edge to it from each holder.
|
|
163
|
+
*/
|
|
164
|
+
export interface SharedCatalogNode {
|
|
165
|
+
/** The node's own id; the pass places it as `<member>/<id>`, in the member of its first holder. */
|
|
166
|
+
id: string;
|
|
167
|
+
kind: string;
|
|
168
|
+
attrs: Record<string, unknown>;
|
|
169
|
+
/** The nodes that name it, by the id the pass read them under, with the attribute each reads it through. */
|
|
170
|
+
holders: Array<{
|
|
171
|
+
from: string;
|
|
172
|
+
via: string;
|
|
173
|
+
label?: string;
|
|
174
|
+
}>;
|
|
175
|
+
}
|
|
95
176
|
/** A lexicon's reference knowledge — its identity map and reference rules. */
|
|
96
177
|
export interface ReferenceCatalog {
|
|
97
178
|
identities: IdentityRule[];
|
|
98
179
|
refs: RefRule[];
|
|
99
180
|
/** Typed tag rules, used over indexed nodes only (#4522). */
|
|
100
181
|
tagRefs?: TagRefRule[];
|
|
182
|
+
/** Kinds whose names are scoped by a value on the node, on a declared graph (#5097). */
|
|
183
|
+
scopes?: ScopeRule[];
|
|
184
|
+
/**
|
|
185
|
+
* The node the catalog reads for a declared node of this lexicon, or
|
|
186
|
+
* undefined to read the node as it is (#5097). An instance node
|
|
187
|
+
* (`instanceOf`) carries no attrs of its own, so it is handed its block
|
|
188
|
+
* node as `block` (#5117). Pure.
|
|
189
|
+
*/
|
|
190
|
+
declaredNode?(node: IRNode, block?: IRNode): DeclaredCatalogNode | undefined;
|
|
191
|
+
/**
|
|
192
|
+
* True for a node of this lexicon that registers a cluster, the one a
|
|
193
|
+
* workspace member runs on (an Argo CD cluster Secret, #5101). A member's
|
|
194
|
+
* `runsOn` draws a declared edge from each such node to the cluster
|
|
195
|
+
* resource it names. Reads the node as the document holds it. Pure.
|
|
196
|
+
*/
|
|
197
|
+
registersCluster?(node: IRNode): boolean;
|
|
198
|
+
/**
|
|
199
|
+
* Nodes of this catalog's lexicon that the declared graph has none of until
|
|
200
|
+
* every member is read (#5100), each with the nodes that name it. Called with
|
|
201
|
+
* every node the pass reads, after `declaredNode`. Pure. An edge from a holder
|
|
202
|
+
* carries the rule id `<lexicon>:<holder kind>:<via>`.
|
|
203
|
+
*/
|
|
204
|
+
sharedNodes?(nodes: readonly IRNode[]): SharedCatalogNode[];
|
|
205
|
+
/** Nodes a node of this lexicon makes, on a declared graph (#5102): the Applications an ApplicationSet generates. */
|
|
206
|
+
generates?: GenerateRule[];
|
|
207
|
+
/** Paths in the repository a node of this lexicon names, on a declared graph (#5102): an Application's source path. */
|
|
208
|
+
pathRefs?: PathRule[];
|
|
209
|
+
}
|
|
210
|
+
/**
|
|
211
|
+
* A node that stands for several the system it declares will make (#5102):
|
|
212
|
+
* an Argo CD ApplicationSet, whose generators yield parameter sets that its
|
|
213
|
+
* template turns into Applications. `from`, `path`, `targetKind` and `label`
|
|
214
|
+
* name the rule as a {@link RefRule}'s do, and the edge from the holder to
|
|
215
|
+
* each node it makes carries its id. `generate` is handed the holder and
|
|
216
|
+
* every node the pass reads (as `declaredNode` gives them), so a generator
|
|
217
|
+
* can select from nodes of any member. Only the catalog pass over a declared
|
|
218
|
+
* graph calls it. Pure.
|
|
219
|
+
*/
|
|
220
|
+
export interface GenerateRule {
|
|
221
|
+
from: string;
|
|
222
|
+
path: string;
|
|
223
|
+
targetKind: string;
|
|
224
|
+
label?: string;
|
|
225
|
+
generate(holder: IRNode, nodes: readonly IRNode[]): Generated;
|
|
226
|
+
/**
|
|
227
|
+
* The rule of the edge from a generated node to the cluster registration
|
|
228
|
+
* its generator selected it for ({@link GeneratedNode.cluster}): its id is
|
|
229
|
+
* `<lexicon>:<from>:<path>`. The selection names the registration, so the
|
|
230
|
+
* edge is drawn whatever the node's own references say, and an edge another
|
|
231
|
+
* rule draws for the same pair is left out.
|
|
232
|
+
*/
|
|
233
|
+
cluster?: {
|
|
234
|
+
path: string;
|
|
235
|
+
targetKind: string;
|
|
236
|
+
label?: string;
|
|
237
|
+
};
|
|
238
|
+
/**
|
|
239
|
+
* The nodes the files a generated node names make (#5094): a generated
|
|
240
|
+
* Application's Helm values file and the objects under its `extraObjects`,
|
|
241
|
+
* as the reader makes them for one written by hand. `readFile` returns a
|
|
242
|
+
* workspace-relative file's text, or undefined when it is not in the
|
|
243
|
+
* workspace's repository; `nodes` are every node the pass reads, so a file
|
|
244
|
+
* a node already holds is not read twice. The pass gives each the id
|
|
245
|
+
* `<holder id>/<key>`, so one file named by several of a holder's
|
|
246
|
+
* generated nodes is one node. Only the catalog pass over a declared graph
|
|
247
|
+
* calls it, and only when its caller can read the repository.
|
|
248
|
+
*/
|
|
249
|
+
files?(node: IRNode, readFile: (path: string) => string | undefined, nodes: readonly IRNode[]): FileNode[];
|
|
250
|
+
}
|
|
251
|
+
/** One node a {@link GenerateRule.files} read from a file. */
|
|
252
|
+
export interface FileNode {
|
|
253
|
+
/** Unique among the holder's file nodes: `values/<path>`, and `values/<path>/<object>` for an object in it. */
|
|
254
|
+
key: string;
|
|
255
|
+
kind: string;
|
|
256
|
+
/** The lexicon whose node it is: a values file is the helm lexicon's, the objects in it the holder's. */
|
|
257
|
+
lexicon: string;
|
|
258
|
+
attrs: Record<string, unknown>;
|
|
259
|
+
}
|
|
260
|
+
/** What a {@link GenerateRule} made of one holder. */
|
|
261
|
+
export interface Generated {
|
|
262
|
+
nodes: GeneratedNode[];
|
|
263
|
+
/** What the rule left unexpanded and why, one line each: a generator it does not read, a template function it does not know. */
|
|
264
|
+
notExpanded: string[];
|
|
265
|
+
}
|
|
266
|
+
/**
|
|
267
|
+
* One node a {@link GenerateRule} made. The pass gives it the id
|
|
268
|
+
* `<holder id>/<key>`, the holder's lexicon and member, and reads it with the
|
|
269
|
+
* other nodes, so the catalog's rules join it as they join a declared node
|
|
270
|
+
* of its kind.
|
|
271
|
+
*/
|
|
272
|
+
export interface GeneratedNode {
|
|
273
|
+
/** Unique among the holder's nodes: a generated Application's name. */
|
|
274
|
+
key: string;
|
|
275
|
+
kind: string;
|
|
276
|
+
attrs: Record<string, unknown>;
|
|
277
|
+
/** The generator that yielded it, such as `clusters` or `list`. */
|
|
278
|
+
generator: string;
|
|
279
|
+
/** The parameters it was made with, flattened to `a.b.c` keys. */
|
|
280
|
+
params: Record<string, string>;
|
|
281
|
+
/** With a generator that reads cluster registrations: the node it was made for, when there is one. */
|
|
282
|
+
cluster?: IRNode;
|
|
283
|
+
}
|
|
284
|
+
/**
|
|
285
|
+
* A path in a repository that a node names (#5102): an Argo CD Application's
|
|
286
|
+
* `spec.source.path`, a values file. `from` and `path` name the rule as a
|
|
287
|
+
* {@link RefRule}'s do. `read` returns each path the holder names; the pass
|
|
288
|
+
* looks for it in the workspace's repository and reports one that is not
|
|
289
|
+
* there as dangling. Pure.
|
|
290
|
+
*/
|
|
291
|
+
export interface PathRule {
|
|
292
|
+
from: string;
|
|
293
|
+
path: string;
|
|
294
|
+
label?: string;
|
|
295
|
+
read(holder: IRNode): RepoPathRef[];
|
|
296
|
+
}
|
|
297
|
+
/** One path a {@link PathRule} read. */
|
|
298
|
+
export interface RepoPathRef {
|
|
299
|
+
/** The path from the repository's root, as the holder resolves it. */
|
|
300
|
+
value: string;
|
|
301
|
+
/** The repository the path is in, as the holder writes it (`repoURL`). */
|
|
302
|
+
repo: string;
|
|
303
|
+
/** Whether the path names a directory or a file. */
|
|
304
|
+
type: "dir" | "file";
|
|
101
305
|
}
|
|
102
306
|
/** `child` is contained by `parent` (subnet ∈ VPC). For #779's boundary boxes. */
|
|
103
307
|
export interface ContainmentPair {
|
|
@@ -112,6 +316,8 @@ export interface DanglingRef {
|
|
|
112
316
|
path: string;
|
|
113
317
|
value: string;
|
|
114
318
|
targetKind?: string;
|
|
319
|
+
/** The id of the node the value was read through (#5098): the store whose cloud secret a key names. */
|
|
320
|
+
through?: string;
|
|
115
321
|
}
|
|
116
322
|
export interface ReconstructedEdges {
|
|
117
323
|
edges: IREdge[];
|
|
@@ -142,10 +348,25 @@ export interface ReconstructedEdges {
|
|
|
142
348
|
containmentEdges: IREdge[];
|
|
143
349
|
dangling: DanglingRef[];
|
|
144
350
|
}
|
|
351
|
+
/** One step of an attr path: a key, and whether the value under it fans out as an array. */
|
|
352
|
+
export interface PathStep {
|
|
353
|
+
key: string;
|
|
354
|
+
fanOut: boolean;
|
|
355
|
+
}
|
|
145
356
|
/**
|
|
146
|
-
*
|
|
147
|
-
*
|
|
148
|
-
*
|
|
357
|
+
* Split an attr path into its steps. A bare step runs to the next `.`, `[]`
|
|
358
|
+
* or quoted step; `[]` after a step fans it out over an array. A quoted step,
|
|
359
|
+
* `["iam.gke.io/gcp-service-account"]`, is one key whatever it holds (#5097):
|
|
360
|
+
* a JSON string in brackets, so `\"` and `\\` escape as they do in JSON. It
|
|
361
|
+
* follows the step before it with no `.`, and can fan out too (`["a.b"][]`).
|
|
362
|
+
*/
|
|
363
|
+
export declare function parsePath(path: string): PathStep[];
|
|
364
|
+
/**
|
|
365
|
+
* Read all scalar values at an attr path. Supports nested keys (`a.b`), array
|
|
366
|
+
* fan-out (`arr[]`, `arr[].id`) and quoted keys for a key that holds dots or
|
|
367
|
+
* slashes (`metadata.annotations["eks.amazonaws.com/role-arn"]`, #5097).
|
|
368
|
+
* Returns every scalar found: a path through an array yields one value per
|
|
369
|
+
* element.
|
|
149
370
|
*/
|
|
150
371
|
export declare function readPath(obj: unknown, path: string): string[];
|
|
151
372
|
/** Merge several lexicons' catalogs into one (concatenate identities + refs). */
|
|
@@ -181,7 +402,16 @@ export interface IndexedNodeScope {
|
|
|
181
402
|
account: string;
|
|
182
403
|
/** The region or location; undefined for a global type. */
|
|
183
404
|
region?: string;
|
|
405
|
+
/**
|
|
406
|
+
* The member that holds the node, on a declared graph (#5100). A holder also
|
|
407
|
+
* looks in {@link memberRegion} of its own member, whatever its own region, so
|
|
408
|
+
* a node that names no scope but its member (a values file) is reached by a
|
|
409
|
+
* holder scoped by namespace.
|
|
410
|
+
*/
|
|
411
|
+
member?: string;
|
|
184
412
|
}
|
|
413
|
+
/** The region of a node held by one member (a `ScopeRule` with no `path`). */
|
|
414
|
+
export declare const memberRegion: (member: string) => string;
|
|
185
415
|
/** A reference whose value matched several nodes: no edge is drawn (behold#1023 Q3). */
|
|
186
416
|
export interface AmbiguousRef {
|
|
187
417
|
from: string;
|
package/dist/graph-refs.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"graph-refs.d.ts","sourceRoot":"","sources":["../src/graph-refs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAEjD,kFAAkF;AAClF,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,GAAG,EAAE,MAAM,EAAE,CAAC;CACf;AAED,kFAAkF;AAClF,MAAM,WAAW,OAAO;IACtB,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,kFAAkF;IAClF,KAAK,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC;IACtC,uEAAuE;IACvE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kFAAkF;IAClF,QAAQ,EAAE,WAAW,GAAG,aAAa,CAAC;IACtC;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,iEAAiE;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;;;;;;;OAiBG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,0DAA0D;IAC1D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qFAAqF;IACrF,GAAG,EAAE,MAAM,CAAC;IACZ,uHAAuH;IACvH,IAAI,EAAE,OAAO,GAAG,YAAY,CAAC;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,8EAA8E;AAC9E,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,YAAY,EAAE,CAAC;IAC3B,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,6DAA6D;IAC7D,OAAO,CAAC,EAAE,UAAU,EAAE,CAAC;
|
|
1
|
+
{"version":3,"file":"graph-refs.d.ts","sourceRoot":"","sources":["../src/graph-refs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAEjD,kFAAkF;AAClF,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,GAAG,EAAE,MAAM,EAAE,CAAC;CACf;AAED,kFAAkF;AAClF,MAAM,WAAW,OAAO;IACtB,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,kFAAkF;IAClF,KAAK,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC;IACtC,uEAAuE;IACvE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kFAAkF;IAClF,QAAQ,EAAE,WAAW,GAAG,aAAa,CAAC;IACtC;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,iEAAiE;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;;;;;;;OAiBG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,SAAS,EAAE,CAAC;CACrD;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,SAAS,MAAM,EAAE,CAAC;AAE7E,8DAA8D;AAC9D,MAAM,WAAW,SAAS;IACxB,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAC;IACd,yDAAyD;IACzD,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,wFAAwF;IACxF,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,mGAAmG;IACnG,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,0DAA0D;IAC1D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qFAAqF;IACrF,GAAG,EAAE,MAAM,CAAC;IACZ,uHAAuH;IACvH,IAAI,EAAE,OAAO,GAAG,YAAY,CAAC;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,wGAAwG;IACxG,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,mGAAmG;IACnG,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,4GAA4G;IAC5G,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC/D;AAED,8EAA8E;AAC9E,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,YAAY,EAAE,CAAC;IAC3B,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,6DAA6D;IAC7D,OAAO,CAAC,EAAE,UAAU,EAAE,CAAC;IACvB,wFAAwF;IACxF,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC;IACrB;;;;;OAKG;IACH,YAAY,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,SAAS,CAAC;IAC7E;;;;;OAKG;IACH,gBAAgB,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IACzC;;;;;OAKG;IACH,WAAW,CAAC,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,iBAAiB,EAAE,CAAC;IAC5D,qHAAqH;IACrH,SAAS,CAAC,EAAE,YAAY,EAAE,CAAC;IAC3B,uHAAuH;IACvH,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC;CACvB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,CAAC;IAC9D;;;;;;OAMG;IACH,OAAO,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/D;;;;;;;;;;OAUG;IACH,KAAK,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,EAAE,CAAC;CAC5G;AAED,8DAA8D;AAC9D,MAAM,WAAW,QAAQ;IACvB,+GAA+G;IAC/G,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,yGAAyG;IACzG,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED,sDAAsD;AACtD,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,gIAAgI;IAChI,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,uEAAuE;IACvE,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,mEAAmE;IACnE,SAAS,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,sGAAsG;IACtG,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE,CAAC;CACrC;AAED,wCAAwC;AACxC,MAAM,WAAW,WAAW;IAC1B,sEAAsE;IACtE,KAAK,EAAE,MAAM,CAAC;IACd,0EAA0E;IAC1E,IAAI,EAAE,MAAM,CAAC;IACb,oDAAoD;IACpD,IAAI,EAAE,KAAK,GAAG,MAAM,CAAC;CACtB;AAED,kFAAkF;AAClF,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;0DAC0D;AAC1D,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uGAAuG;IACvG,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,eAAe,EAAE,CAAC;IAC/B;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,QAAQ,EAAE,WAAW,EAAE,CAAC;CACzB;AAQD,4FAA4F;AAC5F,MAAM,WAAW,QAAQ;IACvB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,OAAO,CAAC;CACjB;AAiBD;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,CAiClD;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAuB7D;AAED,iFAAiF;AACjF,wBAAgB,aAAa,CAAC,QAAQ,EAAE,gBAAgB,EAAE,GAAG,gBAAgB,CAK5E;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,gBAAgB,GAAG,kBAAkB,CAoF/F;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAQpF;AAID,kFAAkF;AAClF,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,gBAAgB,CAAC;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,+BAA+B;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,8EAA8E;AAC9E,eAAO,MAAM,YAAY,WAAY,MAAM,KAAG,MAA4B,CAAC;AAE3E,wFAAwF;AACxF,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,gFAAgF;AAChF,MAAM,WAAW,kBAAmB,SAAQ,WAAW;IACrD,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,YAAY;IAC3B,iFAAiF;IACjF,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,eAAe,EAAE,CAAC;IAC/B,QAAQ,EAAE,kBAAkB,EAAE,CAAC;IAC/B,SAAS,EAAE,YAAY,EAAE,CAAC;CAC3B;AAUD,qEAAqE;AACrE,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE7E;AAID;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,QAAQ,EAAE,SAAS,YAAY,EAAE,EACjC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,gBAAgB,GAC1C,YAAY,CA4Jd;AAID,oFAAoF;AACpF,MAAM,WAAW,iBAAiB;IAChC,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,0FAA0F;AAC1F,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,gGAAgG;IAChG,UAAU,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAAC;CAChD;AAED,0FAA0F;AAC1F,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,aAAa;IAC5B,8DAA8D;IAC9D,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,SAAS,EAAE,oBAAoB,EAAE,CAAC;CACnC;AAED,sFAAsF;AACtF,eAAO,MAAM,mBAAmB,mBAAmB,CAAC;AAEpD,qEAAqE;AACrE,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAE/F;AAED,iGAAiG;AACjG,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAKvE;AAgCD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,MAAM,EAAE,SAAS,cAAc,EAAE,EACjC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,gBAAgB,EAC3C,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,aAAa,CAwDf"}
|
package/dist/graph-refs.js
CHANGED
|
@@ -5,22 +5,88 @@ function toStr(v) {
|
|
|
5
5
|
return String(v);
|
|
6
6
|
return undefined;
|
|
7
7
|
}
|
|
8
|
+
/** Catalog paths, parsed once: a catalog is a fixed list, so this stays small. */
|
|
9
|
+
const parsedPaths = new Map();
|
|
10
|
+
/** The index of the closing quote of the quoted key opened at `i`, when `"]` closes it and it parses as JSON. */
|
|
11
|
+
function quotedEnd(path, i) {
|
|
12
|
+
let j = i + 2;
|
|
13
|
+
while (j < path.length && path[j] !== '"')
|
|
14
|
+
j += path[j] === "\\" ? 2 : 1;
|
|
15
|
+
if (path[j] !== '"' || path[j + 1] !== "]")
|
|
16
|
+
return undefined;
|
|
17
|
+
try {
|
|
18
|
+
return typeof JSON.parse(path.slice(i + 1, j + 1)) === "string" ? j : undefined;
|
|
19
|
+
}
|
|
20
|
+
catch {
|
|
21
|
+
return undefined;
|
|
22
|
+
}
|
|
23
|
+
}
|
|
8
24
|
/**
|
|
9
|
-
*
|
|
10
|
-
*
|
|
11
|
-
*
|
|
25
|
+
* Split an attr path into its steps. A bare step runs to the next `.`, `[]`
|
|
26
|
+
* or quoted step; `[]` after a step fans it out over an array. A quoted step,
|
|
27
|
+
* `["iam.gke.io/gcp-service-account"]`, is one key whatever it holds (#5097):
|
|
28
|
+
* a JSON string in brackets, so `\"` and `\\` escape as they do in JSON. It
|
|
29
|
+
* follows the step before it with no `.`, and can fan out too (`["a.b"][]`).
|
|
30
|
+
*/
|
|
31
|
+
export function parsePath(path) {
|
|
32
|
+
const steps = [];
|
|
33
|
+
let bare = "";
|
|
34
|
+
let inBare = false;
|
|
35
|
+
const endBare = () => {
|
|
36
|
+
if (inBare)
|
|
37
|
+
steps.push({ key: bare, fanOut: false });
|
|
38
|
+
bare = "";
|
|
39
|
+
inBare = false;
|
|
40
|
+
};
|
|
41
|
+
let i = 0;
|
|
42
|
+
while (i < path.length) {
|
|
43
|
+
const c = path[i];
|
|
44
|
+
if (c === ".") {
|
|
45
|
+
endBare();
|
|
46
|
+
i++;
|
|
47
|
+
}
|
|
48
|
+
else if (c === "[" && path[i + 1] === "]") {
|
|
49
|
+
endBare();
|
|
50
|
+
if (steps.length > 0)
|
|
51
|
+
steps[steps.length - 1].fanOut = true;
|
|
52
|
+
else
|
|
53
|
+
steps.push({ key: "", fanOut: true });
|
|
54
|
+
i += 2;
|
|
55
|
+
}
|
|
56
|
+
else if (c === "[" && path[i + 1] === '"' && quotedEnd(path, i) !== undefined) {
|
|
57
|
+
endBare();
|
|
58
|
+
const j = quotedEnd(path, i);
|
|
59
|
+
steps.push({ key: JSON.parse(path.slice(i + 1, j + 1)), fanOut: false });
|
|
60
|
+
i = j + 2;
|
|
61
|
+
}
|
|
62
|
+
else {
|
|
63
|
+
bare += c;
|
|
64
|
+
inBare = true;
|
|
65
|
+
i++;
|
|
66
|
+
}
|
|
67
|
+
}
|
|
68
|
+
endBare();
|
|
69
|
+
return steps;
|
|
70
|
+
}
|
|
71
|
+
/**
|
|
72
|
+
* Read all scalar values at an attr path. Supports nested keys (`a.b`), array
|
|
73
|
+
* fan-out (`arr[]`, `arr[].id`) and quoted keys for a key that holds dots or
|
|
74
|
+
* slashes (`metadata.annotations["eks.amazonaws.com/role-arn"]`, #5097).
|
|
75
|
+
* Returns every scalar found: a path through an array yields one value per
|
|
76
|
+
* element.
|
|
12
77
|
*/
|
|
13
78
|
export function readPath(obj, path) {
|
|
79
|
+
let steps = parsedPaths.get(path);
|
|
80
|
+
if (!steps)
|
|
81
|
+
parsedPaths.set(path, (steps = parsePath(path)));
|
|
14
82
|
let cur = [obj];
|
|
15
|
-
for (const
|
|
16
|
-
const isArr = part.endsWith("[]");
|
|
17
|
-
const key = isArr ? part.slice(0, -2) : part;
|
|
83
|
+
for (const { key, fanOut } of steps) {
|
|
18
84
|
const next = [];
|
|
19
85
|
for (const c of cur) {
|
|
20
86
|
if (c == null || typeof c !== "object")
|
|
21
87
|
continue;
|
|
22
88
|
const val = c[key];
|
|
23
|
-
if (
|
|
89
|
+
if (fanOut) {
|
|
24
90
|
if (Array.isArray(val))
|
|
25
91
|
next.push(...val);
|
|
26
92
|
}
|
|
@@ -80,7 +146,7 @@ export function reconstructEdges(nodes, catalog) {
|
|
|
80
146
|
const seenCont = new Set();
|
|
81
147
|
for (const node of nodes) {
|
|
82
148
|
for (const rule of catalog.refs) {
|
|
83
|
-
if (rule.from !== node.kind)
|
|
149
|
+
if (rule.from !== node.kind || rule.join)
|
|
84
150
|
continue;
|
|
85
151
|
for (const value of readPath(node.attrs, rule.path)) {
|
|
86
152
|
const candidates = index.get(value) ?? [];
|
|
@@ -159,12 +225,13 @@ export function containmentGroups(pairs) {
|
|
|
159
225
|
out[parent] = [...byParent.get(parent)].sort();
|
|
160
226
|
return out;
|
|
161
227
|
}
|
|
228
|
+
/** The region of a node held by one member (a `ScopeRule` with no `path`). */
|
|
229
|
+
export const memberRegion = (member) => `member:${member}`;
|
|
162
230
|
/** Values a masking or normalization pass wrote: never an identifier. */
|
|
163
231
|
const PLACEHOLDER_VALUES = new Set(["[REDACTED]", "<chant:unresolved>", "<masked>"]);
|
|
164
232
|
/** The attribute a rule reads through, as a declared graph's `viaAttr` names it: `SecurityGroupIds[]` is `SecurityGroupIds`. */
|
|
165
233
|
function topAttr(path) {
|
|
166
|
-
|
|
167
|
-
return first.endsWith("[]") ? first.slice(0, -2) : first;
|
|
234
|
+
return parsePath(path)[0]?.key ?? path;
|
|
168
235
|
}
|
|
169
236
|
/** `<lexicon>:<from kind>:<path>`, the id a derived edge carries. */
|
|
170
237
|
export function refRuleId(lexicon, from, path) {
|
|
@@ -192,11 +259,19 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
192
259
|
const sorted = [...nodes].sort((a, b) => byString(a.id, b.id));
|
|
193
260
|
const keyOf = (scope, value) => `${scope.account}\u0000${scope.region ?? ""}\u0000${value}`;
|
|
194
261
|
const index = new Map();
|
|
262
|
+
// The same nodes by the name of the scope they sit in (the text after the
|
|
263
|
+
// first `:` of a region), for a join that names a scope itself.
|
|
264
|
+
const named = new Map();
|
|
195
265
|
const add = (scope, value, node) => {
|
|
196
266
|
if (value === undefined || value === "" || PLACEHOLDER_VALUES.has(value))
|
|
197
267
|
return;
|
|
198
268
|
const k = keyOf(scope, value);
|
|
199
269
|
(index.get(k) ?? index.set(k, new Map()).get(k)).set(node.id, node.kind);
|
|
270
|
+
const colon = scope.region?.indexOf(":") ?? -1;
|
|
271
|
+
if (scope.region !== undefined && colon > 0) {
|
|
272
|
+
const nk = `${scope.region.slice(colon + 1)}\u0000${value}`;
|
|
273
|
+
(named.get(nk) ?? named.set(nk, new Map()).get(nk)).set(node.id, node.kind);
|
|
274
|
+
}
|
|
200
275
|
};
|
|
201
276
|
const identities = catalogs.flatMap((c) => c.catalog.identities);
|
|
202
277
|
for (const node of sorted) {
|
|
@@ -214,10 +289,13 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
214
289
|
add(scope, v, node);
|
|
215
290
|
}
|
|
216
291
|
}
|
|
292
|
+
const byId = new Map(sorted.map((n) => [n.id, n]));
|
|
217
293
|
const lookup = (holder, value) => {
|
|
218
294
|
const scope = scopeOf(holder);
|
|
219
295
|
const out = new Map();
|
|
220
296
|
const keys = scope.region !== undefined ? [keyOf(scope, value), keyOf({ account: scope.account }, value)] : [keyOf(scope, value)];
|
|
297
|
+
if (scope.member !== undefined)
|
|
298
|
+
keys.push(keyOf({ account: scope.account, region: memberRegion(scope.member) }, value));
|
|
221
299
|
for (const k of keys)
|
|
222
300
|
for (const [id, kind] of index.get(k) ?? [])
|
|
223
301
|
out.set(id, kind);
|
|
@@ -229,11 +307,17 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
229
307
|
// and template-shape rules for the same path) report a reference once.
|
|
230
308
|
const dangling = new Map();
|
|
231
309
|
const ambiguous = new Map();
|
|
232
|
-
|
|
310
|
+
// A value some rule of an id found a node for. Rules of one id and different
|
|
311
|
+
// target kinds are alternatives (a cluster Secret's name is a GKE, an EKS or
|
|
312
|
+
// an AKS cluster), so the kinds that found nothing do not report it dangling.
|
|
313
|
+
const found = new Set();
|
|
314
|
+
const resolve = (holder, value, rule, joined) => {
|
|
233
315
|
if (PLACEHOLDER_VALUES.has(value))
|
|
234
316
|
return;
|
|
235
|
-
|
|
236
|
-
|
|
317
|
+
let candidates = joined
|
|
318
|
+
? joined.targets.map((t) => t.id)
|
|
319
|
+
: [...lookup(holder, value).entries()].filter(([, kind]) => rule.targetKind === undefined || kind === rule.targetKind).map(([id]) => id);
|
|
320
|
+
const through = joined?.through ? { through: joined.through.id } : {};
|
|
237
321
|
if (candidates.includes(holder.id)) {
|
|
238
322
|
if (candidates.length === 1)
|
|
239
323
|
return; // a self-reference (an SG rule to its own group)
|
|
@@ -243,9 +327,10 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
243
327
|
if (candidates.length === 0) {
|
|
244
328
|
if (rule.optional)
|
|
245
329
|
return;
|
|
246
|
-
dangling.set(`${holder.id}|${rule.id}|${value}`, { from: holder.id, path: rule.path, value, rule: rule.id, ...(rule.targetKind ? { targetKind: rule.targetKind } : {}) });
|
|
330
|
+
dangling.set(`${holder.id}|${rule.id}|${value}|${through.through ?? ""}`, { from: holder.id, path: rule.path, value, rule: rule.id, ...(rule.targetKind ? { targetKind: rule.targetKind } : {}), ...through });
|
|
247
331
|
return;
|
|
248
332
|
}
|
|
333
|
+
found.add(`${holder.id}|${rule.id}|${value}`);
|
|
249
334
|
if (candidates.length > 1) {
|
|
250
335
|
ambiguous.set(`${holder.id}|${rule.id}|${value}`, { from: holder.id, rule: rule.id, path: rule.path, value, candidates });
|
|
251
336
|
return;
|
|
@@ -292,6 +377,12 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
292
377
|
...(rule.label ? { label: rule.label } : {}),
|
|
293
378
|
...(rule.optional ? { optional: true } : {}),
|
|
294
379
|
};
|
|
380
|
+
if (rule.join) {
|
|
381
|
+
const find = (value, scope) => [...(scope === undefined ? lookup(node, value) : named.get(`${scope}\u0000${value}`) ?? new Map()).keys()].map((id) => byId.get(id));
|
|
382
|
+
for (const j of rule.join(node, find))
|
|
383
|
+
resolve(node, j.value, { ...spec, via: j.via ?? spec.via }, j);
|
|
384
|
+
continue;
|
|
385
|
+
}
|
|
295
386
|
for (const value of new Set(readPath(node.attrs, rule.path)))
|
|
296
387
|
resolve(node, value, spec);
|
|
297
388
|
}
|
|
@@ -325,7 +416,7 @@ export function reconstructIndexedEdges(nodes, catalogs, scopeOf) {
|
|
|
325
416
|
return {
|
|
326
417
|
edges: [...edges.values()].sort((a, b) => byString(edgeKey(a), edgeKey(b))),
|
|
327
418
|
containment: [...containment.values()].sort((a, b) => byString(`${a.child}|${a.parent}`, `${b.child}|${b.parent}`)),
|
|
328
|
-
dangling: [...dangling.values()].sort((a, b) => byString(`${a.from}|${a.rule}|${a.value}`, `${b.from}|${b.rule}|${b.value}`)),
|
|
419
|
+
dangling: [...dangling.values()].filter((d) => !found.has(`${d.from}|${d.rule}|${d.value}`)).sort((a, b) => byString(`${a.from}|${a.rule}|${a.value}|${a.through ?? ""}`, `${b.from}|${b.rule}|${b.value}|${b.through ?? ""}`)),
|
|
329
420
|
ambiguous: [...ambiguous.values()].sort((a, b) => byString(`${a.from}|${a.rule}|${a.value}`, `${b.from}|${b.rule}|${b.value}`)),
|
|
330
421
|
};
|
|
331
422
|
}
|
|
@@ -69,6 +69,18 @@ export interface PostSynthContext {
|
|
|
69
69
|
* where a check that reads the disk stays silent.
|
|
70
70
|
*/
|
|
71
71
|
readonly projectDir?: string;
|
|
72
|
+
/**
|
|
73
|
+
* Set when the checks run under `chant audit` (#5109), which reads a tree
|
|
74
|
+
* rather than building a project. `root` is the directory the audit walked,
|
|
75
|
+
* and is absent when the tree is a remote fetch with nothing on disk. A
|
|
76
|
+
* check that reads the disk looks there, never in the working directory the
|
|
77
|
+
* command happened to start from, and stays silent when there is no `root`.
|
|
78
|
+
* Absent from `chant build` and `chant lint` (which set `projectDir`) and
|
|
79
|
+
* from a hand-built context.
|
|
80
|
+
*/
|
|
81
|
+
readonly audit?: {
|
|
82
|
+
root?: string;
|
|
83
|
+
};
|
|
72
84
|
/**
|
|
73
85
|
* The project config the build loaded (#3751), as source lint rules get it
|
|
74
86
|
* in `LintContext.projectConfig`. A check that renders output again, as the
|
|
@@ -175,6 +187,16 @@ export interface PostSynthDiagnostic {
|
|
|
175
187
|
/** Where it is missing from (e.g. a root module name). */
|
|
176
188
|
scope: string;
|
|
177
189
|
};
|
|
190
|
+
/**
|
|
191
|
+
* Where in the entity the finding sits, as a path that does not depend on
|
|
192
|
+
* any display name: `Deployment/containers[1]`, `resource.rules[0]`. The
|
|
193
|
+
* audit builds a finding's `identity` from the check id, the file, `entity`
|
|
194
|
+
* and this locator, never from `message`. A check that reports several
|
|
195
|
+
* findings against one entity, and whose message names a part of it (a
|
|
196
|
+
* container, a port), sets this so renaming that part, or fixing an earlier
|
|
197
|
+
* one, leaves the identity of the rest alone. Optional.
|
|
198
|
+
*/
|
|
199
|
+
locator?: string;
|
|
178
200
|
/**
|
|
179
201
|
* The build root the finding is about, set by a {@link CrossRootCheck}
|
|
180
202
|
* (chant #1939). Absent from a per-build finding.
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"post-synth.d.ts","sourceRoot":"","sources":["../../src/lint/post-synth.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AACrE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAmB,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAEhE,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAE3E;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,kEAAkE;IAClE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;IAChD,8CAA8C;IAC9C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC;;;;OAIG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;;;;;;;;;;;;;;;;OAiBG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACnE;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,oBAAoB,CAAC;IAC1C;;;;;;OAMG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;;OAKG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjD,8BAA8B;IAC9B,WAAW,EAAE;QACX,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;QAChD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAClC,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,MAAM,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QACjD,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;CACH;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,GAC9C,MAAM,SAAS,EAAE,CAQnB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,GAAG,MAAM,CAE1E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAE5F;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,WAAW,mBAAmB;IAClC,oDAAoD;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,qBAAqB;IACrB,QAAQ,EAAE,QAAQ,CAAC;IACnB,6BAA6B;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,kDAAkD;IAClD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;;;;;;;;;;;OAiBG;IACH,OAAO,CAAC,EAAE;QACR,kEAAkE;QAClE,IAAI,EAAE,MAAM,CAAC;QACb,0DAA0D;QAC1D,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;IACF;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,uCAAuC;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,KAAK,CAAC,GAAG,EAAE,gBAAgB,GAAG,mBAAmB,EAAE,CAAC;IACpD;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CASxE;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,cAAc,EAAE,EACxB,WAAW,EAAE,gBAAgB,CAAC,aAAa,CAAC,EAC5C,GAAG,CAAC,EAAE,MAAM,EACZ,IAAI,CAAC,EAAE;IAAE,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,oBAAoB,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,GACnK,mBAAmB,EAAE,CAwBvB;AAMD;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,2DAA2D;IAC3D,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAC7C,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACzC;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAc,SAAQ,gBAAgB;IACrD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;CAC5B;AAED,oEAAoE;AACpE,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,iHAAiH;IACjH,MAAM,EAAE,MAAM,CAAC;IACf,0FAA0F;IAC1F,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,yFAAyF;IACzF,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,6DAA6D;AAC7D,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,gEAAgE;IAChE,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,8BAA8B;IAC9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAAC;IAC9C,kEAAkE;IAClE,QAAQ,CAAC,IAAI,EAAE,SAAS,eAAe,EAAE,CAAC;IAC1C,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,EAAE,SAAS,YAAY,EAAE,CAAC;IAC3C,wEAAwE;IACxE,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACnE,wFAAwF;IACxF,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;CAC3C;AAED,qDAAqD;AACrD,MAAM,WAAW,gBAAgB;IAC/B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC1D,gGAAgG;IAChG,KAAK,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;CAClC;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,YAAY,CAAC;IACpB,KAAK,CAAC,GAAG,EAAE,gBAAgB,GAAG,mBAAmB,EAAE,CAAC;IACpD,4CAA4C;IAC5C,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,wDAAwD;AACxD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CASxE;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,SAAS,cAAc,EAAE,EACjC,IAAI,CAAC,EAAE,gBAAgB,GACtB,gBAAgB,CA0ClB;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,aAAa,CAAC,cAAc,GAAG,cAAc,CAAC,EACtD,KAAK,EAAE,SAAS,cAAc,EAAE,EAChC,IAAI,CAAC,EAAE,gBAAgB,GACtB,mBAAmB,EAAE,CAOvB"}
|
|
1
|
+
{"version":3,"file":"post-synth.d.ts","sourceRoot":"","sources":["../../src/lint/post-synth.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AACrE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAmB,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAEhE,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAE3E;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,kEAAkE;IAClE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;IAChD,8CAA8C;IAC9C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC;;;;OAIG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;;;;;;;;;;;;;;;;OAiBG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACnE;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,oBAAoB,CAAC;IAC1C;;;;;;OAMG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;;;;;OAQG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjD,8BAA8B;IAC9B,WAAW,EAAE;QACX,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;QAChD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAClC,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,MAAM,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QACjD,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;CACH;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,GAC9C,MAAM,SAAS,EAAE,CAQnB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,GAAG,MAAM,CAE1E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAE5F;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,WAAW,mBAAmB;IAClC,oDAAoD;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,qBAAqB;IACrB,QAAQ,EAAE,QAAQ,CAAC;IACnB,6BAA6B;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,kDAAkD;IAClD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;;;;;;;;;;;OAiBG;IACH,OAAO,CAAC,EAAE;QACR,kEAAkE;QAClE,IAAI,EAAE,MAAM,CAAC;QACb,0DAA0D;QAC1D,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;IACF;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,uCAAuC;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,KAAK,CAAC,GAAG,EAAE,gBAAgB,GAAG,mBAAmB,EAAE,CAAC;IACpD;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CASxE;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,cAAc,EAAE,EACxB,WAAW,EAAE,gBAAgB,CAAC,aAAa,CAAC,EAC5C,GAAG,CAAC,EAAE,MAAM,EACZ,IAAI,CAAC,EAAE;IAAE,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,oBAAoB,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,GACnK,mBAAmB,EAAE,CAwBvB;AAMD;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,2DAA2D;IAC3D,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAC7C,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACzC;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAc,SAAQ,gBAAgB;IACrD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;CAC5B;AAED,oEAAoE;AACpE,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,iHAAiH;IACjH,MAAM,EAAE,MAAM,CAAC;IACf,0FAA0F;IAC1F,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,yFAAyF;IACzF,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,6DAA6D;AAC7D,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,gEAAgE;IAChE,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,8BAA8B;IAC9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAAC;IAC9C,kEAAkE;IAClE,QAAQ,CAAC,IAAI,EAAE,SAAS,eAAe,EAAE,CAAC;IAC1C,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,EAAE,SAAS,YAAY,EAAE,CAAC;IAC3C,wEAAwE;IACxE,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACnE,wFAAwF;IACxF,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;CAC3C;AAED,qDAAqD;AACrD,MAAM,WAAW,gBAAgB;IAC/B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC1D,gGAAgG;IAChG,KAAK,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;CAClC;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,YAAY,CAAC;IACpB,KAAK,CAAC,GAAG,EAAE,gBAAgB,GAAG,mBAAmB,EAAE,CAAC;IACpD,4CAA4C;IAC5C,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,wDAAwD;AACxD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CASxE;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,SAAS,cAAc,EAAE,EACjC,IAAI,CAAC,EAAE,gBAAgB,GACtB,gBAAgB,CA0ClB;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,aAAa,CAAC,cAAc,GAAG,cAAc,CAAC,EACtD,KAAK,EAAE,SAAS,cAAc,EAAE,EAChC,IAAI,CAAC,EAAE,gBAAgB,GACtB,mBAAmB,EAAE,CAOvB"}
|