typesea 0.1.0

package/dist/ir/freeze.js

@@ -0,0 +1,102 @@
+/**
+ * @file freeze.ts
+ * @brief Immutable graph finalization.
+ */
+import { NodeTag } from "../kind/index.js";
+import { freezeSchema } from "../schema/index.js";
+import { isPlainRegExp } from "./regexp.js";
+/**
+ * @brief freeze graph.
+ */
+export function freezeGraph(graph) {
+    for (let index = 0; index < graph.nodes.length; index += 1) {
+        const node = graph.nodes[index];
+        if (node !== undefined) {
+            freezeGraphNode(node);
+        }
+    }
+    Object.freeze(graph.nodes);
+    return Object.freeze(graph);
+}
+/**
+ * @brief freeze graph node.
+ */
+function freezeGraphNode(node) {
+    Object.freeze(node.deps);
+    switch (node.tag) {
+        case NodeTag.StrictKeys:
+            Object.freeze(node.keys);
+            break;
+        case NodeTag.Regex:
+            freezeRegexNode(node);
+            break;
+        case NodeTag.ArrayEvery:
+            freezeSchema(node.item);
+            break;
+        case NodeTag.TupleItems:
+            for (let index = 0; index < node.items.length; index += 1) {
+                const item = node.items[index];
+                if (item !== undefined) {
+                    freezeSchema(item);
+                }
+            }
+            Object.freeze(node.items);
+            break;
+        case NodeTag.RecordEvery:
+            freezeSchema(node.item);
+            break;
+        case NodeTag.DiscriminantDispatch:
+            Object.freeze(node.literals);
+            for (let index = 0; index < node.schemas.length; index += 1) {
+                const schema = node.schemas[index];
+                if (schema !== undefined) {
+                    freezeSchema(schema);
+                }
+            }
+            Object.freeze(node.schemas);
+            Object.freeze(node.lookup);
+            break;
+        case NodeTag.SchemaCheck:
+            freezeSchema(node.schema);
+            break;
+        case NodeTag.And:
+        case NodeTag.Or:
+            Object.freeze(node.values);
+            break;
+        default:
+            break;
+    }
+    Object.freeze(node);
+}
+/**
+ * @brief freeze regex node.
+ */
+function freezeRegexNode(node) {
+    const regex = node.regex;
+    if (!isPlainRegExp(regex)) {
+        throw new TypeError("regex node must use a plain RegExp");
+    }
+    if (Object.isFrozen(node)) {
+        if (Object.isExtensible(regex)) {
+            throw new TypeError("frozen regex node must contain a non-extensible RegExp");
+        }
+        return;
+    }
+    if (!Object.isExtensible(regex)) {
+        return;
+    }
+    Object.defineProperty(node, "regex", {
+        configurable: false,
+        enumerable: true,
+        value: cloneGraphRegExp(regex),
+        writable: false
+    });
+}
+/**
+ * @brief clone graph reg exp.
+ */
+function cloneGraphRegExp(regex) {
+    const cloned = new RegExp(regex.source, regex.flags);
+    Object.preventExtensions(cloned);
+    return cloned;
+}

package/dist/ir/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @file index.ts
+ * @brief Public IR module aggregation.
+ */
+export { GraphBuilder } from "./builder.js";
+export { freezeGraph } from "./freeze.js";
+export { isGraphValue } from "./validate.js";
+export type { ArrayEveryNode, BooleanFoldNode, ConstNode, DiscriminantDispatchLookup, DiscriminantDispatchNode, EqualsNode, GetPropNode, Graph, GraphNode, HasOwnDataNode, HasOwnNode, NodeId, NumericCompareNode, ParamNode, RecordEveryNode, RegexNode, ReturnNode, SchemaCheckNode, StartNode, StrictKeysNode, StringBoundNode, TupleItemsNode, UnaryPredicateNode } from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/ir/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/ir/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,YAAY,EACV,cAAc,EACd,eAAe,EACf,SAAS,EACT,0BAA0B,EAC1B,wBAAwB,EACxB,UAAU,EACV,WAAW,EACX,KAAK,EACL,SAAS,EACT,cAAc,EACd,UAAU,EACV,MAAM,EACN,kBAAkB,EAClB,SAAS,EACT,eAAe,EACf,SAAS,EACT,UAAU,EACV,eAAe,EACf,SAAS,EACT,cAAc,EACd,eAAe,EACf,cAAc,EACd,kBAAkB,EACnB,MAAM,YAAY,CAAC"}

package/dist/ir/index.js

@@ -0,0 +1,7 @@
+/**
+ * @file index.ts
+ * @brief Public IR module aggregation.
+ */
+export { GraphBuilder } from "./builder.js";
+export { freezeGraph } from "./freeze.js";
+export { isGraphValue } from "./validate.js";

package/dist/ir/regexp.d.ts

@@ -0,0 +1,6 @@
+/**
+ * @file regexp.ts
+ * @brief RegExp shape guard for graph nodes.
+ */
+export declare function isPlainRegExp(value: unknown): value is RegExp;
+//# sourceMappingURL=regexp.d.ts.map

package/dist/ir/regexp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regexp.d.ts","sourceRoot":"","sources":["../../src/ir/regexp.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAO7D"}

package/dist/ir/regexp.js

@@ -0,0 +1,12 @@
+/**
+ * @file regexp.ts
+ * @brief RegExp shape guard for graph nodes.
+ */
+export function isPlainRegExp(value) {
+    return value instanceof RegExp &&
+        Object.getPrototypeOf(value) === RegExp.prototype &&
+        !Object.prototype.hasOwnProperty.call(value, "exec") &&
+        !Object.prototype.hasOwnProperty.call(value, "test") &&
+        !Object.prototype.hasOwnProperty.call(value, "source") &&
+        !Object.prototype.hasOwnProperty.call(value, "flags");
+}

package/dist/ir/types.d.ts

@@ -0,0 +1,215 @@
+/**
+ * @file types.ts
+ * @brief Sea-of-Nodes graph value model.
+ */
+import { NodeTag } from "../kind/index.js";
+import type { LiteralValue, Schema } from "../schema/index.js";
+/**
+ * @brief node id.
+ */
+export type NodeId = number;
+/**
+ * @brief graph node.
+ */
+export type GraphNode = StartNode | ParamNode | ConstNode | GetPropNode | UnaryPredicateNode | EqualsNode | NumericCompareNode | StringBoundNode | RegexNode | HasOwnNode | HasOwnDataNode | StrictKeysNode | ArrayEveryNode | TupleItemsNode | RecordEveryNode | DiscriminantDispatchNode | SchemaCheckNode | BooleanFoldNode | ReturnNode;
+/**
+ * @brief graph.
+ */
+export interface Graph {
+    readonly nodes: readonly GraphNode[];
+    readonly entry: NodeId;
+    readonly result: NodeId;
+}
+/**
+ * @brief start node.
+ */
+export interface StartNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Start;
+    readonly deps: readonly [];
+}
+/**
+ * @brief param node.
+ */
+export interface ParamNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Param;
+    readonly deps: readonly [];
+    readonly name: string;
+}
+/**
+ * @brief const node.
+ */
+export interface ConstNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Const;
+    readonly deps: readonly [];
+    readonly value: LiteralValue;
+}
+/**
+ * @brief get prop node.
+ */
+export interface GetPropNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.GetProp;
+    readonly deps: readonly [NodeId];
+    readonly object: NodeId;
+    readonly key: string;
+}
+/**
+ * @brief unary predicate node.
+ */
+export interface UnaryPredicateNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.IsString | typeof NodeTag.IsNumber | typeof NodeTag.IsBoolean | typeof NodeTag.IsBigInt | typeof NodeTag.IsSymbol | typeof NodeTag.IsObject | typeof NodeTag.IsArray | typeof NodeTag.IsUndefined | typeof NodeTag.IsNull | typeof NodeTag.IsInteger | typeof NodeTag.Not;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+}
+/**
+ * @brief equals node.
+ */
+export interface EqualsNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Equals;
+    readonly deps: readonly [NodeId, NodeId];
+    readonly left: NodeId;
+    readonly right: NodeId;
+}
+/**
+ * @brief numeric compare node.
+ */
+export interface NumericCompareNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Gte | typeof NodeTag.Lte;
+    readonly deps: readonly [NodeId, NodeId];
+    readonly left: NodeId;
+    readonly right: NodeId;
+}
+/**
+ * @brief string bound node.
+ */
+export interface StringBoundNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.StringMin | typeof NodeTag.StringMax;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly bound: number;
+}
+/**
+ * @brief regex node.
+ */
+export interface RegexNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Regex;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly regex: RegExp;
+    readonly name: string;
+}
+/**
+ * @brief has own node.
+ */
+export interface HasOwnNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.HasOwn;
+    readonly deps: readonly [NodeId];
+    readonly object: NodeId;
+    readonly key: string;
+}
+/**
+ * @brief has own data node.
+ */
+export interface HasOwnDataNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.HasOwnData;
+    readonly deps: readonly [NodeId];
+    readonly object: NodeId;
+    readonly key: string;
+}
+/**
+ * @brief strict keys node.
+ */
+export interface StrictKeysNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.StrictKeys;
+    readonly deps: readonly [NodeId];
+    readonly object: NodeId;
+    readonly keys: readonly string[];
+}
+/**
+ * @brief array every node.
+ */
+export interface ArrayEveryNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.ArrayEvery;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly item: Schema;
+}
+/**
+ * @brief tuple items node.
+ */
+export interface TupleItemsNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.TupleItems;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly items: readonly Schema[];
+}
+/**
+ * @brief record every node.
+ */
+export interface RecordEveryNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.RecordEvery;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly item: Schema;
+}
+/**
+ * @brief discriminant dispatch lookup.
+ */
+export type DiscriminantDispatchLookup = Readonly<Record<string, number>>;
+/**
+ * @brief discriminant dispatch node.
+ */
+export interface DiscriminantDispatchNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.DiscriminantDispatch;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly key: string;
+    readonly literals: readonly string[];
+    readonly schemas: readonly Schema[];
+    readonly lookup: DiscriminantDispatchLookup;
+}
+/**
+ * @brief schema check node.
+ */
+export interface SchemaCheckNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.SchemaCheck;
+    readonly deps: readonly [NodeId];
+    readonly value: NodeId;
+    readonly schema: Schema;
+}
+/**
+ * @brief boolean fold node.
+ */
+export interface BooleanFoldNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.And | typeof NodeTag.Or;
+    readonly deps: readonly NodeId[];
+    readonly values: readonly NodeId[];
+}
+/**
+ * @brief return node.
+ */
+export interface ReturnNode {
+    readonly id: NodeId;
+    readonly tag: typeof NodeTag.Return;
+    readonly deps: readonly [NodeId, NodeId];
+    readonly control: NodeId;
+    readonly value: NodeId;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/ir/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/ir/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC3C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE/D;;GAEG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAE5B;;GAEG;AACH,MAAM,MAAM,SAAS,GACjB,SAAS,GACT,SAAS,GACT,SAAS,GACT,WAAW,GACX,kBAAkB,GAClB,UAAU,GACV,kBAAkB,GAClB,eAAe,GACf,SAAS,GACT,UAAU,GACV,cAAc,GACd,cAAc,GACd,cAAc,GACd,cAAc,GACd,eAAe,GACf,wBAAwB,GACxB,eAAe,GACf,eAAe,GACf,UAAU,CAAC;AAEf;;GAEG;AACH,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,KAAK,CAAC;IACnC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,KAAK,CAAC;IACnC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,KAAK,CAAC;IACnC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,OAAO,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EACR,OAAO,OAAO,CAAC,QAAQ,GACvB,OAAO,OAAO,CAAC,QAAQ,GACvB,OAAO,OAAO,CAAC,SAAS,GACxB,OAAO,OAAO,CAAC,QAAQ,GACvB,OAAO,OAAO,CAAC,QAAQ,GACvB,OAAO,OAAO,CAAC,QAAQ,GACvB,OAAO,OAAO,CAAC,OAAO,GACtB,OAAO,OAAO,CAAC,WAAW,GAC1B,OAAO,OAAO,CAAC,MAAM,GACrB,OAAO,OAAO,CAAC,SAAS,GACxB,OAAO,OAAO,CAAC,GAAG,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,GAAG,GAAG,OAAO,OAAO,CAAC,GAAG,CAAC;IACtD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,SAAS,GAAG,OAAO,OAAO,CAAC,SAAS,CAAC;IAClE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,KAAK,CAAC;IACnC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,WAAW,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,MAAM,0BAA0B,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAE1E;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,oBAAoB,CAAC;IAClD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,WAAW,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,GAAG,GAAG,OAAO,OAAO,CAAC,EAAE,CAAC;IACrD,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB"}

package/dist/ir/types.js

@@ -0,0 +1,5 @@
+/**
+ * @file types.ts
+ * @brief Sea-of-Nodes graph value model.
+ */
+import { NodeTag } from "../kind/index.js";

package/dist/ir/validate.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @file validate.ts
+ * @brief Runtime validation for graph objects.
+ */
+import type { Graph } from "./types.js";
+/**
+ * @brief is graph value.
+ */
+export declare function isGraphValue(value: unknown): value is Graph;
+//# sourceMappingURL=validate.d.ts.map

package/dist/ir/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../src/ir/validate.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,KAAK,EAAE,KAAK,EAAqB,MAAM,YAAY,CAAC;AAE3D;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,KAAK,CAqB3D"}

package/dist/ir/validate.js

@@ -0,0 +1,271 @@
+/**
+ * @file validate.ts
+ * @brief Runtime validation for graph objects.
+ */
+import { NodeTag } from "../kind/index.js";
+import { isLiteralValue, isSchemaValue } from "../schema/index.js";
+import { isPlainRegExp } from "./regexp.js";
+/**
+ * @brief is graph value.
+ */
+export function isGraphValue(value) {
+    if (!isRecord(value)) {
+        return false;
+    }
+    const nodes = value["nodes"];
+    if (!isUnknownArray(nodes)) {
+        return false;
+    }
+    if (!isNodeId(value["entry"], nodes.length) ||
+        !isNodeId(value["result"], nodes.length)) {
+        return false;
+    }
+    for (let index = 0; index < nodes.length; index += 1) {
+        if (!isGraphNodeValue(nodes[index], index, nodes.length)) {
+            return false;
+        }
+    }
+    const entry = nodes[value["entry"]];
+    const result = nodes[value["result"]];
+    return isRecord(entry) && entry["tag"] === NodeTag.Start &&
+        isRecord(result) && result["tag"] === NodeTag.Return;
+}
+/**
+ * @brief is graph node value.
+ */
+function isGraphNodeValue(value, index, nodeCount) {
+    if (!isRecord(value) || value["id"] !== index) {
+        return false;
+    }
+    const deps = value["deps"];
+    if (!isNodeIdArray(deps, nodeCount)) {
+        return false;
+    }
+    switch (value["tag"]) {
+        case NodeTag.Start:
+        case NodeTag.Param:
+        case NodeTag.Const:
+            return isLeafNodeValue(value, deps);
+        case NodeTag.GetProp:
+            return typeof value["key"] === "string" &&
+                isSingleDepNode(value, deps, "object", nodeCount);
+        case NodeTag.IsString:
+        case NodeTag.IsNumber:
+        case NodeTag.IsBoolean:
+        case NodeTag.IsBigInt:
+        case NodeTag.IsSymbol:
+        case NodeTag.IsObject:
+        case NodeTag.IsArray:
+        case NodeTag.IsUndefined:
+        case NodeTag.IsNull:
+        case NodeTag.IsInteger:
+        case NodeTag.Not:
+            return isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.Equals:
+        case NodeTag.Gte:
+        case NodeTag.Lte:
+            return isTwoDepNode(value, deps, "left", "right", nodeCount);
+        case NodeTag.StringMin:
+        case NodeTag.StringMax:
+            return typeof value["bound"] === "number" &&
+                Number.isInteger(value["bound"]) &&
+                value["bound"] >= 0 &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.Regex:
+            return isPlainRegExp(value["regex"]) &&
+                typeof value["name"] === "string" &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.HasOwn:
+        case NodeTag.HasOwnData:
+            return typeof value["key"] === "string" &&
+                isSingleDepNode(value, deps, "object", nodeCount);
+        case NodeTag.StrictKeys:
+            return isStringArray(value["keys"]) &&
+                isSingleDepNode(value, deps, "object", nodeCount);
+        case NodeTag.ArrayEvery:
+            return isSchemaValue(value["item"]) &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.TupleItems:
+            return isSchemaArray(value["items"]) &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.RecordEvery:
+            return isSchemaValue(value["item"]) &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.DiscriminantDispatch:
+            return typeof value["key"] === "string" &&
+                isStringArray(value["literals"]) &&
+                isSchemaArray(value["schemas"]) &&
+                isDiscriminantLookup(value["lookup"], value["literals"]) &&
+                value["literals"].length === value["schemas"].length &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.SchemaCheck:
+            return isSchemaValue(value["schema"]) &&
+                isSingleDepNode(value, deps, "value", nodeCount);
+        case NodeTag.And:
+        case NodeTag.Or:
+            return isNodeIdArray(value["values"], nodeCount) &&
+                sameNodeIds(deps, value["values"]);
+        case NodeTag.Return:
+            return isTwoDepNode(value, deps, "control", "value", nodeCount);
+        default:
+            return false;
+    }
+}
+/**
+ * @brief is leaf node value.
+ */
+function isLeafNodeValue(value, deps) {
+    if (deps.length !== 0) {
+        return false;
+    }
+    switch (value["tag"]) {
+        case NodeTag.Start:
+            return true;
+        case NodeTag.Param:
+            return typeof value["name"] === "string";
+        case NodeTag.Const:
+            return isLiteralValue(value["value"]);
+        default:
+            return false;
+    }
+}
+/**
+ * @brief is single dep node.
+ */
+function isSingleDepNode(value, deps, field, nodeCount) {
+    return deps.length === 1 &&
+        isNodeId(value[field], nodeCount) &&
+        deps[0] === value[field];
+}
+/**
+ * @brief is two dep node.
+ */
+function isTwoDepNode(value, deps, leftField, rightField, nodeCount) {
+    return deps.length === 2 &&
+        isNodeId(value[leftField], nodeCount) &&
+        isNodeId(value[rightField], nodeCount) &&
+        deps[0] === value[leftField] &&
+        deps[1] === value[rightField];
+}
+/**
+ * @brief is node id.
+ */
+function isNodeId(value, nodeCount) {
+    return typeof value === "number" &&
+        Number.isSafeInteger(value) &&
+        value >= 0 &&
+        value < nodeCount;
+}
+/**
+ * @brief is node id array.
+ */
+function isNodeIdArray(value, nodeCount) {
+    if (!isUnknownArray(value)) {
+        return false;
+    }
+    for (let index = 0; index < value.length; index += 1) {
+        if (!isNodeId(value[index], nodeCount)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @brief same node ids.
+ */
+function sameNodeIds(left, right) {
+    if (left.length !== right.length) {
+        return false;
+    }
+    for (let index = 0; index < left.length; index += 1) {
+        if (left[index] !== right[index]) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @brief is string array.
+ */
+function isStringArray(value) {
+    if (!isUnknownArray(value)) {
+        return false;
+    }
+    for (let index = 0; index < value.length; index += 1) {
+        if (typeof value[index] !== "string") {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @brief is schema array.
+ */
+function isSchemaArray(value) {
+    if (!isUnknownArray(value)) {
+        return false;
+    }
+    for (let index = 0; index < value.length; index += 1) {
+        if (!isSchemaValue(value[index])) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @brief is discriminant lookup.
+ */
+function isDiscriminantLookup(value, literals) {
+    if (!isRecord(value)) {
+        return false;
+    }
+    const keys = Reflect.ownKeys(value);
+    if (keys.length !== literals.length) {
+        return false;
+    }
+    for (let index = 0; index < literals.length; index += 1) {
+        const literal = literals[index];
+        if (typeof literal !== "string" ||
+            value[literal] !== index) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @brief is record.
+ */
+function isRecord(value) {
+    return typeof value === "object" &&
+        value !== null &&
+        !Array.isArray(value) &&
+        hasOnlyDataProperties(value);
+}
+/**
+ * @brief is unknown array.
+ */
+function isUnknownArray(value) {
+    return Array.isArray(value) && hasOnlyDataProperties(value);
+}
+/**
+ * @brief has only data properties.
+ * @details Rejects accessor descriptors before graph internals read fields by key.
+ * @returns True when every own property is backed by a data slot.
+ */
+function hasOnlyDataProperties(value) {
+    const descriptors = Object.getOwnPropertyDescriptors(value);
+    const descriptorMap = descriptors;
+    const keys = Reflect.ownKeys(descriptors);
+    for (let index = 0; index < keys.length; index += 1) {
+        const key = keys[index];
+        if (key === undefined) {
+            continue;
+        }
+        const descriptor = descriptorMap[key];
+        if (descriptor === undefined ||
+            !Object.prototype.hasOwnProperty.call(descriptor, "value")) {
+            return false;
+        }
+    }
+    return true;
+}