@crewhaus/tool-flow 0.7.0 → 0.8.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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/NOTICE

@@ -0,0 +1,9 @@
+CrewHaus Factory
+Copyright 2026 Max Meier
+
+This product includes software developed by Max Meier
+(operating as StudioMax — https://studiomax.io) and contributors.
+
+The CrewHaus name and logo are trademarks of Max Meier. See
+https://github.com/crewhaus/factory/blob/main/TRADEMARK.md for the
+use-of-marks policy.

package/README.md

@@ -61,6 +61,10 @@ explanation rather than guessed at, because per ECMAScript an offset-less
 date-time string is *local* time while the date-only form is UTC — so the
 same spec would mean different instants on two machines.
 
+`RuleScore` adds points as exact decimals, not binary floats, so `0.7 + 0.1`
+is `0.8` and meets a band at `0.8`, and the total does not depend on the
+order the rules are declared in.
+
 An epoch outside the ±8.64e15 ms a `Date` can represent is rejected by name
 for the same reason: the field that parsed it is the only place that still
 knows which of a spec's several instants was the bad one, and left to reach a
@@ -137,6 +141,12 @@ Two details worth knowing:
   `capacity`, which is retryable in general — but that particular one
   resolves to `escalate`, and a caller reading the boolean would otherwise
   re-run the identical command and be killed identically.
+- **A `Retry-After` date is read only with its zone written.** The RFC 9110
+  HTTP-date forms (GMT by definition), an RFC 5322 date with its zone
+  (`+0200`, `UTC`, `-0000`, `PDT`), and an ISO-8601 instant with an offset
+  (`T` or a space before the time) are the same instant on every machine; a
+  date with no zone is not read at all, rather than read as the host's local
+  time. A date that does not exist (30 February, hour 24) is not read either.
 - **Message matching uses substrings, not regular expressions.** That text
   comes from a remote server, and a pattern with nested quantifiers there is
   a denial of service waiting to happen. Caller-supplied rules may use a
@@ -146,33 +156,32 @@ Exit code `1` is deliberately unclassified. It is the generic "it failed" and
 says nothing about why, so claiming a class for it would be inventing
 information.
 
-## A known limitation: regex denial of service
-
-The `matches` and `notMatches` ops compile a caller-supplied pattern and run
-it against caller-supplied text. JavaScript's regex engine backtracks, so a
-pattern with nested quantifiers against text that *nearly* matches can take
-seconds of CPU:
-
-```
-^(([a-z])+.)+[A-Z]([a-z])+$   against 60 lowercase letters   ~2.7s
-```
-
-This is a property of the shared check grammar in `@crewhaus/tool-schema`,
-not of this package — the `Assert` tool has the same exposure, and both are
-reachable with operator-written or model-written patterns matched against
-text a harness fetched from somewhere else.
-
-Two things reduce it, neither of which is a fix:
-
-- `ErrorClassify` matches `message` and `code` **separately** rather than
-  joining them. A pattern anchored with `$` against a joined string can never
-  match, and a pattern that can never match is precisely the worst case for a
-  backtracking engine — joining the fields manufactured that for free.
-- `ErrorClassify`'s builtin packs use substrings, never patterns, so the
-  default path compiles no regex at all.
-
-A real fix has to live in the shared evaluator: reject nested-quantifier
-patterns before compiling them, or match with an engine that does not
-backtrack. Until then, treat `matches` as trusted-pattern-only, and prefer
-`contains`, `startsWith` and `endsWith` — which are linear — where they will
-do.
+## Caller patterns: off the thread, and never a guessed miss
+
+The `matches` and `notMatches` ops, and an `ErrorClassify` rule's `matches`,
+run a caller-supplied pattern against caller-supplied text. JavaScript's regex
+engine backtracks, so a synchronous match can hold the whole process
+(`a*a*a*a*b` against 200 letters: 3.7 s; against 400: 108 s), and when the
+engine gives up on a match it answers "no match".
+
+So no tool here runs one on the caller's thread. Before evaluating, each tool
+asks every pattern its arms, rows, rules, owners or steps will test, answers
+them all in one `@crewhaus/tool-safety` regex worker under a five-second
+deadline, and then evaluates with the answers (the shared machinery is in
+`@crewhaus/tool-schema`). A pattern the screen refuses (a shape that
+backtracks exponentially, such as `(a+)+`) fails its check as an invalid
+regex does, and an `ErrorClassify` rule with one is an invalid rule. A pattern
+that cannot be run to an answer (the deadline, the engine giving up, which
+includes a no-match slower than 100 ms) decides nothing:
+
+- `Branch` takes no arm, and not `otherwise`, and says which arm was undecided;
+- `DecisionTable` gives no outputs when the undecided row could change them;
+- `RuleScore` gives a null score and band, and lists the undecided rules;
+- `LeadAssign` refuses, as it does for an owner missing a load;
+- `SequenceRun` holds the step in `undetermined`, and the flow is `blocked`;
+- `ErrorClassify` answers class `unknown`, action `escalate`, source
+  `undetermined`, never a later rule's or a builtin pack's answer.
+
+`ErrorClassify` still matches `message` and `code` separately (a pattern
+anchored with `$` against a joined string could never match), and its
+builtin packs still use substrings, never patterns.

package/dist/index.d.ts

@@ -12,3 +12,9 @@ export declare const sequenceRun: RegisteredTool;
 /** Every tool this package registers, in the order a catalog should list them. */
 export declare const FLOW_TOOLS: ReadonlyArray<RegisteredTool>;
 export type { Check };
+/**
+ * The strict RFC 9110 HTTP-date reader ErrorClassify uses, for any package
+ * that turns a Retry-After or an Expires header into an instant: it never
+ * reads a zone-less date as the host's local time.
+ */
+export { parseHttpDate } from "./lib/http-date";

package/dist/index.js

@@ -21,14 +21,14 @@
  * operator learns one grammar.
  */
 import { buildTool } from "@crewhaus/tool-builder";
-import { ASSERT_OPS } from "@crewhaus/tool-schema";
+import { ASSERT_OPS, RegexAnswers, askCheckPatterns, regexRunContext, } from "@crewhaus/tool-schema";
 import { z } from "zod";
 import { ASSIGN_STRATEGIES, assignOwner } from "./lib/assign";
 import { evaluateBranches } from "./lib/branch";
 import { VOTE_MODES, tallyVotes } from "./lib/consensus";
 import { checkDeadline } from "./lib/deadline";
 import { HIT_POLICIES, evaluateTable } from "./lib/decision";
-import { ERROR_CLASSES, NEXT_ACTIONS, classifyError } from "./lib/errors";
+import { ERROR_CLASSES, NEXT_ACTIONS, askErrorPatterns, classifyError, } from "./lib/errors";
 import { scoreValue } from "./lib/score";
 import { planSequence } from "./lib/sequence";
 import { detectStall } from "./lib/stall";
@@ -102,6 +102,21 @@ function parseInstant(value, field) {
     return parsed;
 }
 const instantField = z.union([z.string(), z.number()]);
+/**
+ * Answer every `matches` pattern the given check lists will test against
+ * `value`, in the regex worker, before any of them is evaluated. The
+ * evaluators then read the answers and never run a caller's pattern on this
+ * thread; a pattern with no answer leaves its arm, row, rule, owner or step
+ * undetermined rather than unmatched.
+ */
+async function answerChecks(value, lists, ctx) {
+    const regex = new RegexAnswers();
+    for (const list of lists)
+        if (list !== undefined)
+            askCheckPatterns(value, list, regex);
+    await regex.resolve(regexRunContext(ctx));
+    return regex;
+}
 // ---------------------------------------------------------------------------
 export const branch = buildTool({
     name: "Branch",
@@ -128,16 +143,17 @@ export const branch = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => {
-        const outcome = evaluateBranches(input.value, input.arms, {
-            otherwise: input.otherwise,
-        });
+    execute: async (input, ctx) => {
+        const arms = input.arms;
+        const regex = await answerChecks(input.value, arms.map((arm) => arm.when), ctx);
+        const outcome = evaluateBranches(input.value, arms, { otherwise: input.otherwise, regex });
         const body = {
             matched: outcome.matched,
             name: outcome.name,
             index: outcome.index,
             fallback: outcome.fallback,
             result: outcome.result,
+            ...(outcome.undetermined === undefined ? {} : { undetermined: outcome.undetermined }),
             ...(input.verbose ? { evaluated: outcome.evaluated } : {}),
         };
         return json(body);
@@ -164,7 +180,11 @@ export const decisionTable = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => json(evaluateTable(input.value, input)),
+    execute: async (input, ctx) => {
+        const table = input;
+        const regex = await answerChecks(input.value, table.rows.map((row) => row.when), ctx);
+        return json(evaluateTable(input.value, table, { regex }));
+    },
 });
 export const errorClassify = buildTool({
     name: "ErrorClassify",
@@ -181,7 +201,7 @@ export const errorClassify = buildTool({
         retryAfter: z
             .string()
             .optional()
-            .describe("the raw Retry-After header: seconds or an HTTP-date"),
+            .describe("the raw Retry-After header: seconds or an HTTP-date (always GMT); a date with no zone is not read"),
         attempt: z.number().int().positive().optional().describe("1-based attempt number"),
         maxAttempts: z.number().int().positive().optional(),
         now: instantField
@@ -204,9 +224,14 @@ export const errorClassify = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => {
+    execute: async (input, ctx) => {
         const nowMs = input.now === undefined ? Date.now() : parseInstant(input.now, "now");
-        return json(classifyError(input, { rules: input.rules, nowMs }));
+        const rules = input.rules;
+        // The caller rules' patterns run in the worker, against the error text.
+        const regex = new RegexAnswers();
+        askErrorPatterns(input, rules ?? [], regex);
+        await regex.resolve(regexRunContext(ctx));
+        return json(classifyError(input, { rules, nowMs, regex }));
     },
 });
 export const deadlineCheck = buildTool({
@@ -341,8 +366,10 @@ export const ruleScore = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => {
-        const result = scoreValue(input.value, input);
+    execute: async (input, ctx) => {
+        const model = input;
+        const regex = await answerChecks(input.value, model.rules.map((rule) => rule.when), ctx);
+        const result = scoreValue(input.value, model, { regex });
         if (input.includeMissed)
             return json(result);
         const { missed: _missed, ...rest } = result;
@@ -391,8 +418,10 @@ export const leadAssign = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => {
-        const { considered, ...rest } = assignOwner(input.value, input);
+    execute: async (input, ctx) => {
+        const roster = input;
+        const regex = await answerChecks(input.value, roster.owners.map((owner) => owner.when), ctx);
+        const { considered, ...rest } = assignOwner(input.value, roster, { regex });
         return json(input.verbose ? { ...rest, considered } : rest);
     },
 });
@@ -433,7 +462,7 @@ export const sequenceRun = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => {
+    execute: async (input, ctx) => {
         const nowMs = input.now === undefined ? Date.now() : parseInstant(input.now, "now");
         // Each `after` is parsed here and dropped, so the planner can only read
         // the parsed number: a step can never end up gated on an offset-less
@@ -444,7 +473,8 @@ export const sequenceRun = buildTool({
             afterMs: after === undefined ? undefined : parseInstant(after, `step "${step.id}" after`),
             when: step.when,
         }));
-        return json(planSequence(input.value, { version: input.version, steps }, { nowMs, completed: input.completed, failed: input.failed }));
+        const regex = await answerChecks(input.value, steps.map((step) => step.when), ctx);
+        return json(planSequence(input.value, { version: input.version, steps }, { nowMs, completed: input.completed, failed: input.failed }, { regex }));
     },
 });
 /** Every tool this package registers, in the order a catalog should list them. */
@@ -459,3 +489,9 @@ export const FLOW_TOOLS = Object.freeze([
     sequenceRun,
     stallDetect,
 ]);
+/**
+ * The strict RFC 9110 HTTP-date reader ErrorClassify uses, for any package
+ * that turns a Retry-After or an Expires header into an instant: it never
+ * reads a zone-less date as the host's local time.
+ */
+export { parseHttpDate } from "./lib/http-date";

package/dist/lib/assign.d.ts

@@ -21,7 +21,7 @@
  *   "Nobody is eligible" and "I could not work out who is" are different
  *   answers, and only the first one uses `fallback`.
  */
-import { type Check } from "@crewhaus/tool-schema";
+import { type Check, type RegexAnswers } from "@crewhaus/tool-schema";
 import type { MatchMode } from "./branch";
 /** How the winner is picked from the owners that are eligible. */
 export declare const ASSIGN_STRATEGIES: readonly ["first", "specific", "least_loaded", "round_robin"];
@@ -119,4 +119,6 @@ export type AssignResult = {
  *   it false and so reads as the lowest load in the roster. A cursor that is
  *   not a whole position goes the same way.
  */
-export declare function assignOwner(value: unknown, roster: Roster): AssignResult;
+export declare function assignOwner(value: unknown, roster: Roster, options?: {
+    readonly regex?: RegexAnswers;
+}): AssignResult;

package/dist/lib/assign.js

@@ -21,7 +21,7 @@
  *   "Nobody is eligible" and "I could not work out who is" are different
  *   answers, and only the first one uses `fallback`.
  */
-import { runChecks } from "@crewhaus/tool-schema";
+import { checksVerdict, runChecks } from "@crewhaus/tool-schema";
 /** How the winner is picked from the owners that are eligible. */
 export const ASSIGN_STRATEGIES = ["first", "specific", "least_loaded", "round_robin"];
 /**
@@ -53,7 +53,7 @@ const specificityOf = (owner) => (owner.match ?? "all") === "all" ? owner.when.l
  *   it false and so reads as the lowest load in the roster. A cursor that is
  *   not a whole position goes the same way.
  */
-export function assignOwner(value, roster) {
+export function assignOwner(value, roster, options = {}) {
     if (roster.owners.length === 0)
         throw new Error("the roster has no owners");
     const seen = new Set();
@@ -84,11 +84,22 @@ export function assignOwner(value, roster) {
     /** Facts the strategy needs and the roster did not supply; see below. */
     const undetermined = [];
     for (const [index, owner] of roster.owners.entries()) {
-        const report = runChecks(value, owner.when);
-        const passes = (owner.match ?? "all") === "all" ? report.ok : report.passed > 0;
+        const report = runChecks(value, owner.when, options.regex === undefined ? {} : { regex: options.regex });
+        const verdict = checksVerdict(report, owner.match ?? "all");
+        const passes = verdict === "pass";
         const out = (reason) => {
             considered.push({ id: owner.id, eligible: false, reason, matched: report.passed });
         };
+        // A territory whose pattern had no answer is neither in nor out, like an
+        // owner missing a fact the strategy needs, and the answer refuses rather
+        // than hand the lead to someone else.
+        if (verdict === "undetermined") {
+            const why = report.failures.find((f) => f.undetermined === true)?.reason ?? "";
+            const reason = `owner "${owner.id}" could not be decided: ${why}`;
+            undetermined.push(reason);
+            considered.push({ id: owner.id, eligible: null, reason, matched: report.passed });
+            continue;
+        }
         if (!passes) {
             out(report.failures[0]?.reason ?? "no condition held");
             continue;

package/dist/lib/branch.d.ts

@@ -7,7 +7,7 @@
  * here: an operator who learns `startsWith` from Assert gets the same
  * operator, with the same semantics, in a branch.
  */
-import { type Check } from "@crewhaus/tool-schema";
+import { type Check, type RegexAnswers } from "@crewhaus/tool-schema";
 /** Whether every check must hold, or any one of them. */
 export type MatchMode = "all" | "any";
 /** One arm of the branch. `when` is never empty — see {@link evaluateBranches}. */
@@ -27,6 +27,8 @@ export type ArmReport = {
     readonly failed: number;
     /** The first failing check's reason; empty when the arm matched. */
     readonly reason: string;
+    /** Set when the arm could not be decided: a pattern had no answer. */
+    readonly undetermined?: true;
 };
 export type BranchOutcome = {
     readonly matched: boolean;
@@ -39,6 +41,12 @@ export type BranchOutcome = {
     readonly fallback: boolean;
     /** Every arm evaluated, in order, up to and including the winner. */
     readonly evaluated: ReadonlyArray<ArmReport>;
+    /**
+     * Why no route was taken, when an arm could not be decided: its pattern
+     * had no answer. Later arms and `otherwise` are not tried, because the
+     * undecided arm might have been the one that matched.
+     */
+    readonly undetermined?: string;
 };
 export type BranchOptions = {
     /** Used when no arm matches. Without it, a miss returns `matched: false`. */
@@ -46,6 +54,8 @@ export type BranchOptions = {
         readonly name: string;
         readonly result?: unknown;
     };
+    /** Answers for the arms' `matches` patterns, resolved by the caller in the worker. */
+    readonly regex?: RegexAnswers;
 };
 /**
  * Evaluate `rules` against `value` in order and return the first match.

package/dist/lib/branch.js

@@ -7,7 +7,7 @@
  * here: an operator who learns `startsWith` from Assert gets the same
  * operator, with the same semantics, in a branch.
  */
-import { runChecks } from "@crewhaus/tool-schema";
+import { checksVerdict, runChecks } from "@crewhaus/tool-schema";
 /**
  * Evaluate `rules` against `value` in order and return the first match.
  *
@@ -41,16 +41,36 @@ export function evaluateBranches(value, rules, options = {}) {
     const evaluated = [];
     for (const [index, rule] of rules.entries()) {
         const mode = rule.match ?? "all";
-        const report = runChecks(value, rule.when);
-        const ok = mode === "all" ? report.ok : report.passed > 0;
+        const report = runChecks(value, rule.when, options.regex === undefined ? {} : { regex: options.regex });
+        const verdict = checksVerdict(report, mode);
+        const ok = verdict === "pass";
+        const undecided = report.failures.find((f) => f.undetermined === true);
         evaluated.push({
             name: rule.name,
             index,
             ok,
             passed: report.passed,
             failed: report.failed,
-            reason: ok ? "" : (report.failures[0]?.reason ?? ""),
+            reason: ok
+                ? ""
+                : ((verdict === "undetermined" ? undecided?.reason : undefined) ??
+                    report.failures[0]?.reason ??
+                    ""),
+            ...(verdict === "undetermined" ? { undetermined: true } : {}),
         });
+        if (verdict === "undetermined") {
+            // A router that fell through here would take a later arm, or the
+            // default, on the strength of an answer it never got.
+            return {
+                matched: false,
+                name: null,
+                index: null,
+                result: undefined,
+                fallback: false,
+                evaluated,
+                undetermined: `arm "${rule.name}" could not be decided: ${undecided?.reason ?? "a check had no answer"}`,
+            };
+        }
         if (ok) {
             return {
                 matched: true,