@stigmer/eval-runtime 0.0.0-stage → 3.41.1-dev.20261011130052.g3d61c86c2a34

package/LICENSE

@@ -0,0 +1,190 @@
+Apache License
+Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding those notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+Copyright 2026 Stigmer Contributors
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/expect.d.ts

@@ -0,0 +1,116 @@
+/**
+ * A mock's `expect:` guard: what a call's input must look like, checked
+ * before the mock answers. A call that violates it stops the try.
+ *
+ * The guard is a map from dotted input paths (`issue.title`) to one rule:
+ *  - a type name: `string`, `number`, `boolean`, `array` or `object`;
+ *  - a `/regex/flags` string, in the format's small dialect (below);
+ *  - any other string, number, boolean or null: the value must equal it;
+ *  - a list of such literals: the value must equal one of them.
+ * A path the input does not carry is a violation.
+ *
+ * The regex dialect is the format's: literal characters, `.`, the escapes
+ * `\d \w \s \D \W \S` and an escaped punctuation character, classes such
+ * as `[a-z]` or `[^0-9]`, the quantifiers `*`, `+`, `?`, `{m}`, `{m,}` and
+ * `{m,n}` on one character, escape or class, an optional `^` first and `$`
+ * last, and the flags `i` and `s` only. Anything else (a group, an
+ * alternation, a backreference, a lookaround, another flag) is refused at
+ * compile with a sentence naming the pattern, which the suite reader turns
+ * into the case's load error.
+ *
+ * Matching is linear: the pattern is expanded into a sequence of units
+ * (a quantifier's minimum as required units, the rest optional, an
+ * unbounded tail as one repeating unit) and simulated as a set of
+ * positions over the value, so a value of length n costs n times the
+ * units, never a backtracking blow-up. The expansion is capped at
+ * EXPECT_MAX_UNITS, and a quantifier is sized against the cap before it is
+ * expanded, so a `{m,n}` cannot make a pattern large.
+ *
+ * Unlike Claude Code, a value is matched whole, whatever its length: the
+ * format bounds the length a pattern checks without documenting the bound,
+ * and the matcher here has no need for one. The guide states it.
+ */
+/** The type names a rule may give. */
+declare const TYPE_NAMES: readonly ["string", "number", "boolean", "array", "object"];
+type TypeName = (typeof TYPE_NAMES)[number];
+/** The most units a pattern may expand to. */
+export declare const EXPECT_MAX_UNITS = 1024;
+/** The most characters a pattern may hold. */
+export declare const EXPECT_MAX_PATTERN_LENGTH = 512;
+/** One compiled rule of a guard. */
+type Rule = {
+    readonly kind: "type";
+    readonly type: TypeName;
+} | {
+    readonly kind: "regex";
+    readonly source: string;
+    readonly pattern: CompiledPattern;
+} | {
+    readonly kind: "literal";
+    readonly value: Literal;
+} | {
+    readonly kind: "one-of";
+    readonly values: readonly Literal[];
+};
+type Literal = string | number | boolean | null;
+/** A compiled guard: each dotted path and its rule, in the order written. */
+export interface CompiledExpect {
+    readonly rules: readonly {
+        readonly path: string;
+        readonly rule: Rule;
+    }[];
+}
+/** A compiled guard, or why the block is not one. */
+export type ExpectCompile = {
+    readonly ok: true;
+    readonly expect: CompiledExpect;
+} | {
+    readonly ok: false;
+    readonly error: string;
+};
+/**
+ * Compile an `expect:` block as parsed from YAML (or its JSON form, as a
+ * run carries it). Refuses a block that is not a map, a path that is not
+ * dotted names, and any rule outside the list in the module header.
+ */
+export declare function compileExpect(block: unknown): ExpectCompile;
+/** Why `input` violates the guard, as one sentence; `undefined` when it holds. */
+export declare function checkExpect(expect: CompiledExpect, input: unknown): string | undefined;
+/** What one unit consumes: one character. */
+type Atom = {
+    readonly kind: "char";
+    readonly char: string;
+} | {
+    readonly kind: "any";
+} | {
+    readonly kind: "class";
+    readonly negated: boolean;
+    readonly items: readonly ClassItem[];
+};
+type ClassItem = {
+    readonly kind: "range";
+    readonly from: number;
+    readonly to: number;
+} | {
+    readonly kind: "escape";
+    readonly letter: string;
+};
+/** One step of the expanded pattern: required, optional, or repeating any number of times. */
+interface Unit {
+    readonly atom: Atom;
+    readonly mode: "one" | "optional" | "star";
+}
+/** A pattern compiled for {@link matchPattern}. */
+export interface CompiledPattern {
+    readonly units: readonly Unit[];
+    readonly anchoredStart: boolean;
+    readonly anchoredEnd: boolean;
+    readonly ignoreCase: boolean;
+    readonly dotAll: boolean;
+}
+/** Compile a pattern in the dialect, or say why it is outside it. */
+export declare function compilePattern(source: string, flags: string): CompiledPattern | string;
+/** Whether `pattern` is found in `value` (anywhere, unless anchored). */
+export declare function matchPattern(pattern: CompiledPattern, value: string): boolean;
+export {};
+//# sourceMappingURL=expect.d.ts.map

package/expect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expect.d.ts","sourceRoot":"","sources":["src/expect.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,sCAAsC;AACtC,QAAA,MAAM,UAAU,6DAA8D,CAAC;AAC/E,KAAK,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAE5C,8CAA8C;AAC9C,eAAO,MAAM,gBAAgB,OAAO,CAAC;AAErC,8CAA8C;AAC9C,eAAO,MAAM,yBAAyB,MAAM,CAAC;AAE7C,oCAAoC;AACpC,KAAK,IAAI,GACL;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAA;CAAE,GACtF;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACrD;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAA;CAAE,CAAC;AAErE,KAAK,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;AAEhD,6EAA6E;AAC7E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,KAAK,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;KAAE,EAAE,CAAC;CAC3E;AAED,qDAAqD;AACrD,MAAM,MAAM,aAAa,GACrB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAA;CAAE,GACtD;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa,CAY3D;AAED,kFAAkF;AAClF,wBAAgB,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CAQtF;AAkED,6CAA6C;AAC7C,KAAK,IAAI,GACL;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;CAAE,GACxB;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAA;CAAE,CAAC;AAEhG,KAAK,SAAS,GACV;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACtE;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzD,8FAA8F;AAC9F,UAAU,IAAI;IACZ,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,UAAU,GAAG,MAAM,CAAC;CAC5C;AAED,mDAAmD;AACnD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAC;IAChC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;IAChC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,eAAe,GAAG,MAAM,CAiCtF;AAwGD,yEAAyE;AACzE,wBAAgB,YAAY,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAmB7E"}

package/expect.js

@@ -0,0 +1,363 @@
+/**
+ * A mock's `expect:` guard: what a call's input must look like, checked
+ * before the mock answers. A call that violates it stops the try.
+ *
+ * The guard is a map from dotted input paths (`issue.title`) to one rule:
+ *  - a type name: `string`, `number`, `boolean`, `array` or `object`;
+ *  - a `/regex/flags` string, in the format's small dialect (below);
+ *  - any other string, number, boolean or null: the value must equal it;
+ *  - a list of such literals: the value must equal one of them.
+ * A path the input does not carry is a violation.
+ *
+ * The regex dialect is the format's: literal characters, `.`, the escapes
+ * `\d \w \s \D \W \S` and an escaped punctuation character, classes such
+ * as `[a-z]` or `[^0-9]`, the quantifiers `*`, `+`, `?`, `{m}`, `{m,}` and
+ * `{m,n}` on one character, escape or class, an optional `^` first and `$`
+ * last, and the flags `i` and `s` only. Anything else (a group, an
+ * alternation, a backreference, a lookaround, another flag) is refused at
+ * compile with a sentence naming the pattern, which the suite reader turns
+ * into the case's load error.
+ *
+ * Matching is linear: the pattern is expanded into a sequence of units
+ * (a quantifier's minimum as required units, the rest optional, an
+ * unbounded tail as one repeating unit) and simulated as a set of
+ * positions over the value, so a value of length n costs n times the
+ * units, never a backtracking blow-up. The expansion is capped at
+ * EXPECT_MAX_UNITS, and a quantifier is sized against the cap before it is
+ * expanded, so a `{m,n}` cannot make a pattern large.
+ *
+ * Unlike Claude Code, a value is matched whole, whatever its length: the
+ * format bounds the length a pattern checks without documenting the bound,
+ * and the matcher here has no need for one. The guide states it.
+ */
+/** The type names a rule may give. */
+const TYPE_NAMES = ["string", "number", "boolean", "array", "object"];
+/** The most units a pattern may expand to. */
+export const EXPECT_MAX_UNITS = 1024;
+/** The most characters a pattern may hold. */
+export const EXPECT_MAX_PATTERN_LENGTH = 512;
+/**
+ * Compile an `expect:` block as parsed from YAML (or its JSON form, as a
+ * run carries it). Refuses a block that is not a map, a path that is not
+ * dotted names, and any rule outside the list in the module header.
+ */
+export function compileExpect(block) {
+    if (!isRecord(block))
+        return { ok: false, error: "expect must be a map from input paths to rules" };
+    const rules = [];
+    for (const [path, value] of Object.entries(block)) {
+        if (!/^[A-Za-z0-9_-]+(\.[A-Za-z0-9_-]+)*$/.test(path)) {
+            return { ok: false, error: `expect path '${path}' is not a dotted input path` };
+        }
+        const rule = ruleOf(value);
+        if (typeof rule === "string")
+            return { ok: false, error: `expect.${path}: ${rule}` };
+        rules.push({ path, rule });
+    }
+    return { ok: true, expect: { rules } };
+}
+/** Why `input` violates the guard, as one sentence; `undefined` when it holds. */
+export function checkExpect(expect, input) {
+    for (const { path, rule } of expect.rules) {
+        const found = valueAt(input, path);
+        if (!found.present)
+            return `input.${path} is missing`;
+        const violation = violationOf(rule, found.value);
+        if (violation !== undefined)
+            return `input.${path} ${violation}`;
+    }
+    return undefined;
+}
+function ruleOf(value) {
+    if (Array.isArray(value)) {
+        const values = [];
+        for (const item of value) {
+            if (!isLiteral(item))
+                return "a list must hold literals only";
+            values.push(item);
+        }
+        if (values.length === 0)
+            return "a list must name at least one value";
+        return { kind: "one-of", values };
+    }
+    if (typeof value === "string") {
+        if (TYPE_NAMES.includes(value))
+            return { kind: "type", type: value };
+        const regex = /^\/(.*)\/([a-z]*)$/s.exec(value);
+        if (regex !== null) {
+            const compiled = compilePattern(regex[1] ?? "", regex[2] ?? "");
+            if (typeof compiled === "string")
+                return `the pattern ${value} ${compiled}`;
+            return { kind: "regex", source: value, pattern: compiled };
+        }
+        return { kind: "literal", value };
+    }
+    if (isLiteral(value))
+        return { kind: "literal", value };
+    return "a rule must be a type name, a /regex/, a literal or a list of literals";
+}
+function violationOf(rule, value) {
+    switch (rule.kind) {
+        case "type":
+            return typeOf(value) === rule.type ? undefined : `must be ${article(rule.type)}`;
+        case "regex":
+            return matchPattern(rule.pattern, textOf(value)) ? undefined : `must match ${rule.source}`;
+        case "literal":
+            return value === rule.value ? undefined : `must be ${JSON.stringify(rule.value)}`;
+        case "one-of":
+            return rule.values.some((v) => v === value)
+                ? undefined
+                : `must be one of ${rule.values.map((v) => (typeof v === "string" ? v : JSON.stringify(v))).join(", ")}`;
+    }
+}
+function typeOf(value) {
+    if (Array.isArray(value))
+        return "array";
+    if (value === null)
+        return "null";
+    return typeof value;
+}
+function article(type) {
+    return type === "array" || type === "object" ? `an ${type}` : `a ${type}`;
+}
+function textOf(value) {
+    return typeof value === "string" ? value : JSON.stringify(value) ?? "";
+}
+function valueAt(input, path) {
+    let current = input;
+    for (const key of path.split(".")) {
+        if (!isRecord(current) || !Object.hasOwn(current, key))
+            return { present: false };
+        current = current[key];
+    }
+    return { present: true, value: current };
+}
+/** Compile a pattern in the dialect, or say why it is outside it. */
+export function compilePattern(source, flags) {
+    if ([...flags].some((f) => f !== "i" && f !== "s") || new Set(flags).size !== flags.length) {
+        return `uses a flag other than i and s`;
+    }
+    if (source.length > EXPECT_MAX_PATTERN_LENGTH) {
+        return `is longer than ${EXPECT_MAX_PATTERN_LENGTH} characters`;
+    }
+    const chars = [...source];
+    let i = 0;
+    const anchoredStart = chars[0] === "^";
+    if (anchoredStart)
+        i = 1;
+    let end = chars.length;
+    const anchoredEnd = end > i && chars[end - 1] === "$" && !escapedAt(chars, end - 1);
+    if (anchoredEnd)
+        end -= 1;
+    const units = [];
+    while (i < end) {
+        const read = atomAt(chars, i, end);
+        if (typeof read === "string")
+            return read;
+        i = read.next;
+        const quantifier = quantifierAt(chars, i, end);
+        if (typeof quantifier === "string")
+            return quantifier;
+        i = quantifier.next;
+        // Sized before it is expanded: a {m,n} of millions must be refused, not built.
+        const adds = quantifier.min + (quantifier.max === Infinity ? 1 : quantifier.max - quantifier.min);
+        if (units.length + adds > EXPECT_MAX_UNITS)
+            return `expands to more than ${EXPECT_MAX_UNITS} steps`;
+        for (let n = 0; n < quantifier.min; n++)
+            units.push({ atom: read.atom, mode: "one" });
+        if (quantifier.max === Infinity) {
+            units.push({ atom: read.atom, mode: "star" });
+        }
+        else {
+            for (let n = quantifier.min; n < quantifier.max; n++)
+                units.push({ atom: read.atom, mode: "optional" });
+        }
+    }
+    return { units, anchoredStart, anchoredEnd, ignoreCase: flags.includes("i"), dotAll: flags.includes("s") };
+}
+function escapedAt(chars, index) {
+    let slashes = 0;
+    for (let j = index - 1; j >= 0 && chars[j] === "\\"; j--)
+        slashes++;
+    return slashes % 2 === 1;
+}
+const ESCAPE_CLASSES = new Set(["d", "w", "s", "D", "W", "S"]);
+const SPECIALS = new Set(["(", ")", "|", "{", "}", "*", "+", "?", "^", "$"]);
+function atomAt(chars, i, end) {
+    const c = chars[i] ?? "";
+    if (c === "\\") {
+        const e = chars[i + 1];
+        if (e === undefined || i + 1 >= end)
+            return "ends with a lone backslash";
+        if (ESCAPE_CLASSES.has(e))
+            return { atom: { kind: "class", negated: false, items: [{ kind: "escape", letter: e }] }, next: i + 2 };
+        if (/^[^A-Za-z0-9]$/.test(e))
+            return { atom: { kind: "char", char: e }, next: i + 2 };
+        if (e === "n")
+            return { atom: { kind: "char", char: "\n" }, next: i + 2 };
+        if (e === "t")
+            return { atom: { kind: "char", char: "\t" }, next: i + 2 };
+        return `uses the escape \\${e}, which the dialect does not have`;
+    }
+    if (c === "[")
+        return classAt(chars, i, end);
+    if (c === ".")
+        return { atom: { kind: "any" }, next: i + 1 };
+    if (c === "(" || c === ")")
+        return "uses a group";
+    if (c === "|")
+        return "uses an alternation";
+    if (SPECIALS.has(c))
+        return `has a ${c} with nothing to apply to`;
+    return { atom: { kind: "char", char: c }, next: i + 1 };
+}
+function classAt(chars, start, end) {
+    let i = start + 1;
+    const negated = chars[i] === "^";
+    if (negated)
+        i++;
+    const items = [];
+    let first = true;
+    while (i < end) {
+        const c = chars[i] ?? "";
+        if (c === "]" && !first)
+            return { atom: { kind: "class", negated, items }, next: i + 1 };
+        first = false;
+        let from;
+        if (c === "\\") {
+            const e = chars[i + 1];
+            if (e === undefined || i + 1 >= end)
+                return "has a class that never closes";
+            if (ESCAPE_CLASSES.has(e)) {
+                items.push({ kind: "escape", letter: e });
+                i += 2;
+                continue;
+            }
+            from = (e === "n" ? "\n" : e === "t" ? "\t" : e).codePointAt(0) ?? 0;
+            i += 2;
+        }
+        else {
+            from = c.codePointAt(0) ?? 0;
+            i += 1;
+        }
+        if (chars[i] === "-" && i + 1 < end && chars[i + 1] !== "]") {
+            const t = chars[i + 1] ?? "";
+            const to = (t === "\\" ? (chars[i + 2] ?? "") : t).codePointAt(0) ?? 0;
+            if (to < from)
+                return "has a reversed range in a class";
+            items.push({ kind: "range", from, to });
+            i += t === "\\" ? 3 : 2;
+        }
+        else {
+            items.push({ kind: "range", from, to: from });
+        }
+    }
+    return "has a class that never closes";
+}
+function quantifierAt(chars, i, end) {
+    const c = chars[i];
+    let read = { min: 1, max: 1, next: i };
+    if (i < end && c === "*")
+        read = { min: 0, max: Infinity, next: i + 1 };
+    else if (i < end && c === "+")
+        read = { min: 1, max: Infinity, next: i + 1 };
+    else if (i < end && c === "?")
+        read = { min: 0, max: 1, next: i + 1 };
+    else if (i < end && c === "{") {
+        let j = i + 1;
+        let body = "";
+        while (j < end && chars[j] !== "}")
+            body += chars[j++];
+        const m = /^(\d+)(,(\d*))?$/.exec(body);
+        if (j >= end || m === null)
+            return "has a { that is not a {m,n} quantifier";
+        const min = Number(m[1]);
+        const max = m[2] === undefined ? min : m[3] === "" ? Infinity : Number(m[3]);
+        if (max < min)
+            return "has a {m,n} quantifier whose n is below its m";
+        read = { min, max, next: j + 1 };
+    }
+    const after = chars[read.next];
+    if (read.next < end && read.next !== i && (after === "*" || after === "+" || after === "?" || after === "{")) {
+        return "quantifies a quantifier";
+    }
+    return read;
+}
+/** Whether `pattern` is found in `value` (anywhere, unless anchored). */
+export function matchPattern(pattern, value) {
+    const text = [...value];
+    const n = pattern.units.length;
+    let states = closure(new Set([0]), pattern.units);
+    for (let pos = 0; pos <= text.length; pos++) {
+        if (states.has(n) && (!pattern.anchoredEnd || pos === text.length))
+            return true;
+        if (pos === text.length)
+            break;
+        const c = text[pos] ?? "";
+        const next = new Set();
+        for (const s of states) {
+            const unit = pattern.units[s];
+            if (unit === undefined || !atomMatches(unit.atom, c, pattern))
+                continue;
+            next.add(unit.mode === "star" ? s : s + 1);
+        }
+        if (!pattern.anchoredStart)
+            next.add(0);
+        states = closure(next, pattern.units);
+        if (states.size === 0)
+            return false;
+    }
+    return false;
+}
+/**
+ * States reachable by skipping optional and repeating units. A walk stops
+ * at a state already reached, since everything past it was reached with
+ * it, so one closure visits each state once and a step costs at most the
+ * pattern's units.
+ */
+function closure(states, units) {
+    const out = new Set();
+    for (const start of states) {
+        let s = start;
+        if (out.has(s))
+            continue;
+        out.add(s);
+        while (s < units.length && units[s]?.mode !== "one") {
+            s += 1;
+            if (out.has(s))
+                break;
+            out.add(s);
+        }
+    }
+    return out;
+}
+function atomMatches(atom, c, pattern) {
+    switch (atom.kind) {
+        case "any":
+            return pattern.dotAll || (c !== "\n" && c !== "\r");
+        case "char":
+            return pattern.ignoreCase ? c.toLowerCase() === atom.char.toLowerCase() : c === atom.char;
+        case "class": {
+            const hit = atom.items.some((item) => classItemMatches(item, c, pattern.ignoreCase));
+            return atom.negated ? !hit : hit;
+        }
+    }
+}
+function classItemMatches(item, c, ignoreCase) {
+    if (item.kind === "escape") {
+        const hit = item.letter.toLowerCase() === "d" ? /\d/.test(c) : item.letter.toLowerCase() === "w" ? /\w/.test(c) : /\s/.test(c);
+        return item.letter === item.letter.toUpperCase() ? !hit : hit;
+    }
+    const inRange = (ch) => {
+        const code = ch.codePointAt(0) ?? -1;
+        return code >= item.from && code <= item.to;
+    };
+    return inRange(c) || (ignoreCase && (inRange(c.toLowerCase()) || inRange(c.toUpperCase())));
+}
+function isLiteral(value) {
+    return value === null || typeof value === "string" || typeof value === "number" || typeof value === "boolean";
+}
+function isRecord(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+//# sourceMappingURL=expect.js.map