@telorun/analyzer 0.1.3 → 0.2.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.
Files changed (65) hide show
  1. package/README.md +3 -3
  2. package/dist/analyzer.d.ts +6 -0
  3. package/dist/analyzer.d.ts.map +1 -1
  4. package/dist/analyzer.js +45 -25
  5. package/dist/builtins.d.ts.map +1 -1
  6. package/dist/builtins.js +56 -24
  7. package/dist/cel-environment.d.ts +12 -5
  8. package/dist/cel-environment.d.ts.map +1 -1
  9. package/dist/cel-environment.js +31 -17
  10. package/dist/definition-registry.d.ts +5 -5
  11. package/dist/definition-registry.d.ts.map +1 -1
  12. package/dist/definition-registry.js +10 -10
  13. package/dist/dependency-graph.d.ts.map +1 -1
  14. package/dist/dependency-graph.js +9 -2
  15. package/dist/index.d.ts +2 -1
  16. package/dist/index.d.ts.map +1 -1
  17. package/dist/index.js +1 -1
  18. package/dist/kernel-globals.d.ts +6 -2
  19. package/dist/kernel-globals.d.ts.map +1 -1
  20. package/dist/kernel-globals.js +14 -8
  21. package/dist/manifest-loader.d.ts +9 -1
  22. package/dist/manifest-loader.d.ts.map +1 -1
  23. package/dist/manifest-loader.js +165 -11
  24. package/dist/module-kinds.d.ts +4 -0
  25. package/dist/module-kinds.d.ts.map +1 -0
  26. package/dist/module-kinds.js +4 -0
  27. package/dist/normalize-inline-resources.d.ts.map +1 -1
  28. package/dist/normalize-inline-resources.js +6 -1
  29. package/dist/precompile.d.ts +3 -2
  30. package/dist/precompile.d.ts.map +1 -1
  31. package/dist/precompile.js +13 -11
  32. package/dist/reference-field-map.d.ts +1 -1
  33. package/dist/resolve-throws-union.d.ts +30 -0
  34. package/dist/resolve-throws-union.d.ts.map +1 -0
  35. package/dist/resolve-throws-union.js +252 -0
  36. package/dist/types.d.ts +11 -0
  37. package/dist/types.d.ts.map +1 -1
  38. package/dist/validate-cel-context.js +1 -1
  39. package/dist/validate-references.d.ts.map +1 -1
  40. package/dist/validate-references.js +19 -12
  41. package/dist/validate-throws-coverage.d.ts +8 -0
  42. package/dist/validate-throws-coverage.d.ts.map +1 -0
  43. package/dist/validate-throws-coverage.js +461 -0
  44. package/package.json +3 -3
  45. package/src/analyzer.ts +60 -26
  46. package/src/builtins.ts +56 -24
  47. package/src/cel-environment.ts +40 -17
  48. package/src/definition-registry.ts +10 -10
  49. package/src/dependency-graph.ts +9 -2
  50. package/src/index.ts +2 -1
  51. package/src/kernel-globals.ts +19 -10
  52. package/src/manifest-loader.ts +202 -17
  53. package/src/module-kinds.ts +6 -0
  54. package/src/normalize-inline-resources.ts +6 -1
  55. package/src/precompile.ts +14 -11
  56. package/src/reference-field-map.ts +1 -1
  57. package/src/resolve-throws-union.ts +345 -0
  58. package/src/types.ts +13 -0
  59. package/src/validate-cel-context.ts +1 -1
  60. package/src/validate-references.ts +19 -12
  61. package/src/validate-throws-coverage.ts +565 -0
  62. package/dist/adapters/node-adapter.d.ts +0 -15
  63. package/dist/adapters/node-adapter.d.ts.map +0 -1
  64. package/dist/adapters/node-adapter.js +0 -33
  65. package/src/adapters/node-adapter.ts +0 -38
@@ -0,0 +1,461 @@
1
+ import { createResolveCtx, resolveThrowsUnion, } from "./resolve-throws-union.js";
2
+ import { DiagnosticSeverity } from "./types.js";
3
+ import { extractAccessChains, validateChainAgainstSchema } from "./validate-cel-context.js";
4
+ const SOURCE = "telo-analyzer";
5
+ const TEMPLATE_REGEX = /\$\{\{\s*([^}]+?)\s*\}\}/g;
6
+ /** Walk `definition.schema` and `data` in tandem, invoking `onOutcome` each
7
+ * time an array schema annotated with `x-telo-outcome-list` is encountered.
8
+ * Keeps schema/data in lockstep so callers can resolve sibling fields. */
9
+ function collectOutcomeLists(manifest, schema, onReturns, onCatches) {
10
+ if (!schema)
11
+ return;
12
+ walkSchemaData(schema, manifest, "", {
13
+ manifest,
14
+ onReturns,
15
+ onCatches,
16
+ });
17
+ }
18
+ function walkSchemaData(schema, data, path, ctx) {
19
+ if (!schema || typeof schema !== "object")
20
+ return;
21
+ const outcomeKind = schema["x-telo-outcome-list"];
22
+ if (outcomeKind && Array.isArray(data)) {
23
+ // The sibling data is the parent object (not reachable here without tracking).
24
+ // collectOutcomeListsInObject passes the parent; this branch is a fallback
25
+ // for top-level outcome lists (never occurs in practice).
26
+ if (outcomeKind === "returns") {
27
+ ctx.onReturns({ manifest: ctx.manifest, entries: data, arrayPath: path });
28
+ }
29
+ return;
30
+ }
31
+ if (schema.properties && typeof data === "object" && data !== null && !Array.isArray(data)) {
32
+ const dataObj = data;
33
+ for (const [key, propSchema] of Object.entries(schema.properties)) {
34
+ const nextPath = path ? `${path}.${key}` : key;
35
+ const child = dataObj[key];
36
+ const outcome = propSchema["x-telo-outcome-list"];
37
+ if (outcome) {
38
+ const entries = Array.isArray(child) ? child : [];
39
+ if (outcome === "returns") {
40
+ // Only fire for present arrays — rule 6 (missing returns) is
41
+ // enforced by schema required fields, not here.
42
+ if (Array.isArray(child)) {
43
+ ctx.onReturns({ manifest: ctx.manifest, entries, arrayPath: nextPath });
44
+ }
45
+ }
46
+ else {
47
+ const catchesFor = propSchema["x-telo-catches-for"];
48
+ if (catchesFor) {
49
+ // Fire even when absent so the coverage check can flag handlers
50
+ // whose declared union is non-empty but the list is missing.
51
+ ctx.onCatches(entries, nextPath, dataObj, catchesFor);
52
+ }
53
+ }
54
+ continue;
55
+ }
56
+ if (child !== undefined)
57
+ walkSchemaData(propSchema, child, nextPath, ctx);
58
+ }
59
+ }
60
+ if (schema.items && Array.isArray(data)) {
61
+ for (const [i, item] of data.entries()) {
62
+ walkSchemaData(schema.items, item, `${path}[${i}]`, ctx);
63
+ }
64
+ }
65
+ }
66
+ /** Read a referenced handler's `{kind, name}` from a sibling field. Handles
67
+ * both `"Alias.Kind"` strings and `{ kind, name? }` objects. */
68
+ function resolveHandlerRef(sibling) {
69
+ if (!sibling)
70
+ return null;
71
+ if (typeof sibling === "string")
72
+ return { kind: sibling };
73
+ if (typeof sibling === "object") {
74
+ const obj = sibling;
75
+ if (typeof obj.kind === "string") {
76
+ return { kind: obj.kind, name: obj.name };
77
+ }
78
+ }
79
+ return null;
80
+ }
81
+ /** Parse a `when:` CEL expression and extract the set of `error.code` literals
82
+ * it covers. Recognised forms (per the plan's "coverage-proving" list):
83
+ * - `error.code == 'FOO'`
84
+ * - a disjunction of the above (`||`)
85
+ * - `error.code in ['FOO', 'BAR']`
86
+ * Parenthesised nestings of `||` over equality/in are flattened.
87
+ * Any non-matching sub-expression forfeits coverage for the whole `when:`. */
88
+ function extractCoveredCodes(whenExpr, env) {
89
+ const match = whenExpr.match(/\$\{\{\s*([^}]+?)\s*\}\}/);
90
+ if (!match)
91
+ return { proven: false, codes: new Set() };
92
+ let ast;
93
+ try {
94
+ ast = env.parse(match[1].trim()).ast;
95
+ }
96
+ catch {
97
+ return { proven: false, codes: new Set() };
98
+ }
99
+ const codes = new Set();
100
+ const proven = extractFromNode(ast, codes);
101
+ return { proven, codes };
102
+ }
103
+ function extractFromNode(node, codes) {
104
+ if (node.op === "||") {
105
+ const [l, r] = node.args;
106
+ return extractFromNode(l, codes) && extractFromNode(r, codes);
107
+ }
108
+ if (node.op === "==") {
109
+ const [l, r] = node.args;
110
+ const lit = readErrorCodeEq(l, r) ?? readErrorCodeEq(r, l);
111
+ if (lit === null)
112
+ return false;
113
+ codes.add(lit);
114
+ return true;
115
+ }
116
+ if (node.op === "in") {
117
+ const [l, r] = node.args;
118
+ if (!isErrorCodeRef(l) || r.op !== "list")
119
+ return false;
120
+ for (const item of r.args) {
121
+ if (item.op !== "value" || typeof item.args !== "string")
122
+ return false;
123
+ codes.add(item.args);
124
+ }
125
+ return true;
126
+ }
127
+ return false;
128
+ }
129
+ function readErrorCodeEq(ref, lit) {
130
+ if (!isErrorCodeRef(ref))
131
+ return null;
132
+ if (lit.op !== "value" || typeof lit.args !== "string")
133
+ return null;
134
+ return lit.args;
135
+ }
136
+ function isErrorCodeRef(node) {
137
+ if (node.op !== ".")
138
+ return false;
139
+ const [obj, field] = node.args;
140
+ if (field !== "code")
141
+ return false;
142
+ return obj.op === "id" && obj.args === "error";
143
+ }
144
+ /** Rule 7: within an outcome list, a no-`when:` entry must be the last entry. */
145
+ function checkCatchAllPlacement(entries, resource, channel, filePath, arrayPath) {
146
+ const diagnostics = [];
147
+ for (let i = 0; i < entries.length - 1; i++) {
148
+ const e = entries[i];
149
+ if (!e?.when) {
150
+ diagnostics.push({
151
+ severity: DiagnosticSeverity.Error,
152
+ code: "CATCHALL_NOT_LAST",
153
+ source: SOURCE,
154
+ message: `${channel}: catch-all entry (no \`when:\`) at index ${i} must be last — entries after it are unreachable.`,
155
+ data: { resource, filePath, path: `${arrayPath}[${i}]` },
156
+ });
157
+ }
158
+ }
159
+ return diagnostics;
160
+ }
161
+ /** Rule 1 + Rule 4: check declared-union coverage and reject undeclared codes
162
+ * in coverage-proving `when:` clauses. Phase 2 accepts inherit/passthrough
163
+ * handler unions too — when the resolved union is unbounded, a catch-all is
164
+ * required (rule 4 extension). */
165
+ function checkCatchesCoverage(entries, union, resource, filePath, arrayPath, env) {
166
+ const diagnostics = [];
167
+ const declaredCodes = new Set(union.codes.keys());
168
+ const covered = new Set();
169
+ let hasCatchAll = false;
170
+ for (let i = 0; i < entries.length; i++) {
171
+ const e = entries[i];
172
+ if (!e)
173
+ continue;
174
+ if (!e.when) {
175
+ hasCatchAll = true;
176
+ continue;
177
+ }
178
+ const { proven, codes } = extractCoveredCodes(e.when, env);
179
+ if (proven) {
180
+ for (const c of codes) {
181
+ if (!declaredCodes.has(c)) {
182
+ diagnostics.push({
183
+ severity: DiagnosticSeverity.Error,
184
+ code: "UNDECLARED_THROW_CODE",
185
+ source: SOURCE,
186
+ message: `catches[${i}] references code '${c}' which is not in the handler's declared throw union {${[...declaredCodes].sort().join(", ") || "∅"}}${union.unbounded ? " (union is unbounded — a catch-all is required)" : ""}.`,
187
+ data: { resource, filePath, path: `${arrayPath}[${i}].when` },
188
+ });
189
+ }
190
+ else {
191
+ covered.add(c);
192
+ }
193
+ }
194
+ }
195
+ }
196
+ // Unbounded union (passthrough or transitive): authors can't enumerate the
197
+ // codes, so a catch-all is mandatory.
198
+ if (union.unbounded && !hasCatchAll) {
199
+ diagnostics.push({
200
+ severity: DiagnosticSeverity.Error,
201
+ code: "UNBOUNDED_UNION_NEEDS_CATCHALL",
202
+ source: SOURCE,
203
+ message: `The handler's throw union is unbounded (inherit/passthrough resolution couldn't enumerate all codes). The catches: list must include a catch-all entry (no \`when:\`).`,
204
+ data: { resource, filePath, path: arrayPath },
205
+ });
206
+ }
207
+ if (!hasCatchAll) {
208
+ for (const code of declaredCodes) {
209
+ if (!covered.has(code)) {
210
+ diagnostics.push({
211
+ severity: DiagnosticSeverity.Error,
212
+ code: "UNCOVERED_THROW_CODE",
213
+ source: SOURCE,
214
+ message: `Code '${code}' is declared by the handler but not covered by any catches: entry (no matching \`when:\` and no catch-all).`,
215
+ data: { resource, filePath, path: arrayPath },
216
+ });
217
+ }
218
+ }
219
+ }
220
+ return diagnostics;
221
+ }
222
+ /** Rule 2: for each `error.data.<field>` chain in a catches entry's expressions,
223
+ * type-check against the data schema declared for the matched code(s). When the
224
+ * matching `when:` disjunctively covers multiple codes, use the intersection
225
+ * of their data schemas so only fields present on every code narrow through. */
226
+ function checkTypedErrorData(entries, union, resource, filePath, arrayPath, env) {
227
+ const diagnostics = [];
228
+ // If the union is unbounded we can't narrow data schemas reliably — skip
229
+ // typed-data checks for those entries. The catch-all path still provides
230
+ // runtime access to error.data as an opaque value.
231
+ if (union.unbounded || union.codes.size === 0)
232
+ return diagnostics;
233
+ const dataByCode = {};
234
+ for (const [code, meta] of union.codes) {
235
+ dataByCode[code] = meta.data;
236
+ }
237
+ const allCodes = Object.keys(dataByCode);
238
+ for (let i = 0; i < entries.length; i++) {
239
+ const e = entries[i];
240
+ if (!e)
241
+ continue;
242
+ const covered = e.when
243
+ ? extractCoveredCodes(e.when, env)
244
+ : { proven: false, codes: new Set() };
245
+ // Codes applicable to this entry:
246
+ // - coverage-proving `when:` → exactly those codes
247
+ // - catch-all (no `when:`) or non-proven expr → all declared codes
248
+ const applicable = covered.proven
249
+ ? [...covered.codes].filter((c) => c in dataByCode)
250
+ : allCodes;
251
+ if (applicable.length === 0)
252
+ continue;
253
+ const schemas = applicable.map((c) => dataByCode[c]).filter(Boolean);
254
+ if (schemas.length === 0)
255
+ continue;
256
+ const dataSchema = intersectDataSchemas(schemas);
257
+ // Walk CEL expressions inside this entry's body / headers — only
258
+ // string-valued fields can contain CEL templates.
259
+ collectCelStrings(e.body, `${arrayPath}[${i}].body`).forEach((entry) => {
260
+ diagnostics.push(...checkCelChainAgainstDataSchema(entry, dataSchema, resource, filePath, env));
261
+ });
262
+ if (e.headers) {
263
+ collectCelStrings(e.headers, `${arrayPath}[${i}].headers`).forEach((entry) => {
264
+ diagnostics.push(...checkCelChainAgainstDataSchema(entry, dataSchema, resource, filePath, env));
265
+ });
266
+ }
267
+ }
268
+ return diagnostics;
269
+ }
270
+ /** Intersection of JSON Schemas (object type, explicit properties only). Only
271
+ * retains properties present in every input; picks the most-specific of the
272
+ * sub-schemas when they agree on `type`, else widens to `{}`. */
273
+ function intersectDataSchemas(schemas) {
274
+ if (schemas.length === 1)
275
+ return schemas[0];
276
+ const commonProps = {};
277
+ const firstProps = (schemas[0].properties ?? {});
278
+ for (const propName of Object.keys(firstProps)) {
279
+ const sub = schemas.map((s) => (s.properties ?? {})[propName]);
280
+ if (sub.some((p) => p === undefined))
281
+ continue;
282
+ commonProps[propName] = intersectPropertySchemas(sub);
283
+ }
284
+ return {
285
+ type: "object",
286
+ properties: commonProps,
287
+ additionalProperties: false,
288
+ };
289
+ }
290
+ function intersectPropertySchemas(schemas) {
291
+ const types = new Set(schemas.map((s) => s?.type).filter(Boolean));
292
+ if (types.size === 1) {
293
+ const type = [...types][0];
294
+ if (type === "object")
295
+ return intersectDataSchemas(schemas);
296
+ return { type };
297
+ }
298
+ return {};
299
+ }
300
+ function collectCelStrings(value, path) {
301
+ const out = [];
302
+ if (typeof value === "string") {
303
+ for (const m of value.matchAll(TEMPLATE_REGEX)) {
304
+ out.push({ expr: m[1].trim(), path });
305
+ }
306
+ return out;
307
+ }
308
+ if (Array.isArray(value)) {
309
+ for (const [i, v] of value.entries()) {
310
+ out.push(...collectCelStrings(v, `${path}[${i}]`));
311
+ }
312
+ return out;
313
+ }
314
+ if (value !== null && typeof value === "object") {
315
+ for (const [k, v] of Object.entries(value)) {
316
+ out.push(...collectCelStrings(v, path ? `${path}.${k}` : k));
317
+ }
318
+ }
319
+ return out;
320
+ }
321
+ function checkCelChainAgainstDataSchema(entry, dataSchema, resource, filePath, env) {
322
+ let ast;
323
+ try {
324
+ ast = env.parse(entry.expr).ast;
325
+ }
326
+ catch {
327
+ return [];
328
+ }
329
+ const chains = extractAccessChains(ast);
330
+ const diagnostics = [];
331
+ for (const chain of chains) {
332
+ // Only interested in chains that start with error.data.*
333
+ if (chain[0] !== "error" || chain[1] !== "data" || chain.length <= 2)
334
+ continue;
335
+ const subChain = chain.slice(2); // strip "error", "data"
336
+ const err = validateChainAgainstSchema(subChain, dataSchema);
337
+ if (err) {
338
+ diagnostics.push({
339
+ severity: DiagnosticSeverity.Error,
340
+ code: "CEL_UNKNOWN_FIELD",
341
+ source: SOURCE,
342
+ message: `${resource.kind}/${resource.name}: CEL at '${entry.path}': error.data.${err}`,
343
+ data: { resource, filePath, path: entry.path },
344
+ });
345
+ }
346
+ }
347
+ return diagnostics;
348
+ }
349
+ /** Rule 8 extension: `inherit: true` only makes sense on a definition whose
350
+ * schema contains at least one `x-telo-step-context` array — the annotation
351
+ * that drives the resolver's generic step traversal. A definition with
352
+ * `inherit: true` and no such array has no invocables to inherit from. */
353
+ function validateThrowsDeclarations(manifests) {
354
+ const diagnostics = [];
355
+ for (const m of manifests) {
356
+ if (m.kind !== "Telo.Definition")
357
+ continue;
358
+ const throws = m.throws;
359
+ if (!throws)
360
+ continue;
361
+ const name = m.metadata?.name ?? "<unnamed>";
362
+ const filePath = m.metadata?.source;
363
+ if (throws.inherit === true) {
364
+ const schema = m.schema;
365
+ if (!schemaHasStepContext(schema)) {
366
+ diagnostics.push({
367
+ severity: DiagnosticSeverity.Error,
368
+ code: "INHERIT_WITHOUT_STEP_CONTEXT",
369
+ source: SOURCE,
370
+ message: `Telo.Definition '${name}' declares throws.inherit: true but its schema has no field annotated with x-telo-step-context. inherit is only meaningful on definitions that drive invocables via step arrays.`,
371
+ data: { resource: { kind: m.kind, name }, filePath, path: "throws.inherit" },
372
+ });
373
+ }
374
+ }
375
+ }
376
+ return diagnostics;
377
+ }
378
+ function schemaHasStepContext(schema) {
379
+ if (!schema || typeof schema !== "object")
380
+ return false;
381
+ if ("x-telo-step-context" in schema)
382
+ return true;
383
+ const props = schema.properties;
384
+ if (props && typeof props === "object") {
385
+ for (const v of Object.values(props)) {
386
+ if (schemaHasStepContext(v))
387
+ return true;
388
+ }
389
+ }
390
+ if (schema.items && schemaHasStepContext(schema.items))
391
+ return true;
392
+ for (const key of ["oneOf", "anyOf", "allOf"]) {
393
+ const arr = schema[key];
394
+ if (Array.isArray(arr)) {
395
+ for (const sub of arr)
396
+ if (schemaHasStepContext(sub))
397
+ return true;
398
+ }
399
+ }
400
+ if (schema.$defs && typeof schema.$defs === "object") {
401
+ for (const v of Object.values(schema.$defs)) {
402
+ if (schemaHasStepContext(v))
403
+ return true;
404
+ }
405
+ }
406
+ return false;
407
+ }
408
+ /** Entry point — invoked once per analyze() run. */
409
+ export function validateThrowsCoverage(manifests, defs, aliases, env) {
410
+ const diagnostics = [];
411
+ diagnostics.push(...validateThrowsDeclarations(manifests));
412
+ const resolveCtx = createResolveCtx(manifests, defs, aliases);
413
+ for (const manifest of manifests) {
414
+ if (!manifest.kind || !manifest.metadata?.name)
415
+ continue;
416
+ if (manifest.kind === "Telo.Definition" || manifest.kind === "Telo.Abstract")
417
+ continue;
418
+ const resolvedKind = aliases.resolveKind(manifest.kind);
419
+ const definition = defs.resolve(manifest.kind) ?? (resolvedKind ? defs.resolve(resolvedKind) : undefined);
420
+ if (!definition?.schema)
421
+ continue;
422
+ const resource = { kind: manifest.kind, name: manifest.metadata.name };
423
+ const filePath = manifest.metadata?.source;
424
+ collectOutcomeLists(manifest, definition.schema, (ret) => {
425
+ diagnostics.push(...checkCatchAllPlacement(ret.entries, resource, "returns", filePath, ret.arrayPath));
426
+ }, (entries, arrayPath, siblingData, catchesFor) => {
427
+ diagnostics.push(...checkCatchAllPlacement(entries, resource, "catches", filePath, arrayPath));
428
+ const handlerRef = resolveHandlerRef(siblingData[catchesFor]);
429
+ const union = handlerRefUnion(handlerRef, manifests, resolveCtx);
430
+ diagnostics.push(...checkCatchesCoverage(entries, union, resource, filePath, arrayPath, env));
431
+ diagnostics.push(...checkTypedErrorData(entries, union, resource, filePath, arrayPath, env));
432
+ });
433
+ }
434
+ return diagnostics;
435
+ }
436
+ /** Resolve a handler ref's effective throw union. Prefers the named manifest
437
+ * (so `inherit: true` handlers expose their transitive union); falls back to
438
+ * the definition's own codes when no name is given. */
439
+ function handlerRefUnion(handlerRef, manifests, ctx) {
440
+ if (!handlerRef)
441
+ return { codes: new Map(), unbounded: false };
442
+ if (handlerRef.name) {
443
+ const resolvedKind = ctx.aliases.resolveKind(handlerRef.kind);
444
+ const targetManifest = manifests.find((m) => m.metadata?.name === handlerRef.name &&
445
+ (m.kind === handlerRef.kind ||
446
+ m.kind === resolvedKind ||
447
+ ctx.aliases.resolveKind(m.kind) === handlerRef.kind));
448
+ if (targetManifest)
449
+ return resolveThrowsUnion(targetManifest, ctx);
450
+ }
451
+ const resolved = ctx.aliases.resolveKind(handlerRef.kind);
452
+ const def = ctx.defs.resolve(handlerRef.kind) ?? (resolved ? ctx.defs.resolve(resolved) : undefined);
453
+ if (!def?.throws)
454
+ return { codes: new Map(), unbounded: false };
455
+ const codes = new Map();
456
+ for (const [c, meta] of Object.entries(def.throws.codes ?? {})) {
457
+ codes.set(c, { data: meta.data });
458
+ }
459
+ const unbounded = def.throws.passthrough === true || def.throws.inherit === true;
460
+ return { codes, unbounded };
461
+ }
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@telorun/analyzer",
3
- "version": "0.1.3",
3
+ "version": "0.2.0",
4
4
  "description": "Telo Analyzer - Static manifest validator for Telo manifests.",
5
5
  "keywords": [
6
6
  "telo",
@@ -39,9 +39,9 @@
39
39
  "@marcbachmann/cel-js": "^7.5.3",
40
40
  "ajv": "^8.17.1",
41
41
  "ajv-formats": "^3.0.1",
42
- "yaml": "^2.8.3",
43
42
  "jsonpath-plus": "^10.3.0",
44
- "@telorun/sdk": "0.2.8"
43
+ "yaml": "^2.8.3",
44
+ "@telorun/sdk": "0.3.0"
45
45
  },
46
46
  "devDependencies": {
47
47
  "@types/node": "^20.0.0",