@8lines/gauntlet-protocol 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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/README.md

@@ -0,0 +1,265 @@
+# Gauntlet adapter protocol
+
+`@8lines/gauntlet-protocol` is the language-neutral contract shared by the
+Gauntlet control plane and every in-application adapter. The checked-in JSON
+Schemas and OpenAPI document define the wire format. This document defines the
+portable behavior that JSON Schema and revision implementations must share
+across TypeScript, PHP, and Java.
+
+The executable sources of truth are:
+
+- `fixtures/v1/tc-schema-core-pattern-vectors.json` for portable regular
+  expressions; and
+- `fixtures/v1/jcs-revision-vectors.json` for canonical JSON and revision
+  hashing; and
+- `fixtures/v1/adapter-semantic-vectors.json` for manifest, operation,
+  data-source resolve, and preset-secret semantics. Its closed companion schema
+  is `fixtures/v1/adapter-semantic-vectors.schema.json`.
+
+An SDK implementation is conformant only when it accepts and rejects those
+vectors exactly. It must not broaden the grammar based on features available in
+its host regular-expression engine.
+
+## `tc-schema-core@1` patterns
+
+Patterns use case-sensitive ECMAScript Unicode search semantics over the
+`unicode-scalar-sequences` instance domain declared by the vector artifact. No
+multiline, dot-all, ignore-case, global, or sticky flag is enabled. An
+unanchored pattern searches within the value. `^` and `$` anchor it; `$` means
+absolute end and does not match before a final LF, CR, U+2028, or U+2029. The
+validated source is compiled unchanged with the equivalent of
+`new RegExp(pattern, "u")` after the portable checks. Validators must not
+translate or normalize it.
+
+Candidates containing lone UTF-16 surrogate code units are outside this
+instance domain. Adapter and control-plane protocol boundaries MUST reject such
+strings before JSON Schema pattern evaluation; this requirement does not alter
+the current wire schema shapes. ECMAScript `/u` permits a negated class to match
+a lone surrogate, but that host-engine behavior does not expand the portable
+domain: the candidate must already have been rejected, and portable interval
+analysis complements classes only over Unicode scalar values.
+
+A decoded pattern is limited to 512 UTF-16 code units. Its grammar is:
+
+```text
+disjunction := alternative ("|" alternative)*
+alternative := term*
+term        := assertion | atom quantifier?
+assertion   := "^" | "$"
+atom        := raw-scalar | allowed-escape | class | group
+group       := "(" ("?:")? disjunction ")"
+quantifier  := "?" | "*" | "+" | "{" m ("," n?)? "}"
+```
+
+Capturing and noncapturing groups have the same matching semantics in this
+profile. Quantifier bounds are canonical ASCII decimals without leading zeroes
+apart from `0`, are at most 1000, and satisfy `m <= n`. Quantifiers are greedy.
+
+Outside a class, the only escapes are literals from
+`\\^$.*+?()[]{}|/`. Inside a class, the only escapes are `\\`, `\]`,
+`\^`, and `\-`. Negation and raw Unicode scalar literals are supported. An
+ordinary range is allowed only when it does not span the surrogate block: a
+range whose start is at most U+D7FF and whose end is at least U+E000 is
+rejected. A raw hyphen is a literal in the positions where ECMAScript treats it
+as one, including the trailing hyphens used by the protocol ID patterns;
+escaping it is preferred in newly authored patterns. Accepted range sets are
+normalized to Unicode-scalar intervals.
+
+The profile rejects:
+
+- lone surrogates and decoded C0/C1 control characters;
+- `.`, shorthand classes, boundaries, backreferences, lookaround, named groups,
+  inline flags, and property, code-point, hex, or control escapes;
+- lazy, possessive, or repeated quantifier suffixes and malformed bounds;
+- nested, empty, or wildcard-equivalent classes, descending or
+  surrogate-spanning ranges, and class set operators `&&` and `--`; and
+- any expression that fails the deterministic analysis below.
+
+The identical scanner is applied to every `pattern` value and every
+`patternProperties` key. A rejection reports the escaped JSON Schema pointer
+and a fixed portable-profile message; it never includes a `pattern` value in
+the message body.
+
+### One-pass guarantee
+
+Each consuming literal or class occurrence receives a distinct position and a
+normalized set of Unicode-scalar intervals. While parsing, the validator
+computes nullable-derivation multiplicity, `FIRST`, and `LAST` summaries.
+Alternation adds nullable derivations and concatenation multiplies them; any
+combinator producing more than one is rejected. A quantifier with a maximum
+greater than one requires a non-nullable body and adds every
+`LAST(body) -> FIRST(body)` transition. An optional quantifier also rejects a
+nullable body because skipping it and taking its empty derivation are two
+paths. Exact `{0}` remains one unambiguous empty derivation.
+
+Transitions form a multiset: parallel identical transitions are not removed.
+At the start and after every consuming position, all possible target character
+sets must be pairwise disjoint. This rejects ambiguous expressions such as
+`(a+)+`, `(a|aa)*`, `(a*)*`, and `a?a`, while accepting the deterministic JSON
+Pointer expression `^(?:/(?:[^~/]|~[01])*)*$`. Combined with the 512-code-unit
+limit, this defines deterministic matching from one start position.
+
+Native search can still retry a deterministic expression at every input
+position: unanchored `a*b`, for example, is quadratic when the suffix is absent.
+Therefore any source containing `*`, `+`, or an open upper bound `{m,}` MUST
+begin at its first code unit with an unescaped `^`, and the root expression MUST
+have no top-level alternation. Alternation nested after that shared anchor is
+allowed. Unanchored expressions may use only bounded quantifiers; their maximum
+of 1000 bounds work per candidate start. Together these rules define the
+portable linear-time profile. A broader grammar requires a new profile
+identifier.
+
+## JCS revisions
+
+Revision inputs are JSON parsed as IEEE-754 binary64 values. To calculate a
+revision:
+
+1. Work on own JSON data properties only. Preserve a member literally named
+   `__proto__`; it has no prototype semantics.
+2. Remove only the named revision member (`revision` or `manifestRevision`) at
+   the document root. Retain nested members with the same name.
+3. Reject lone surrogates in both property names and string values. Reject
+   non-finite numbers and integer-valued unsafe binary64 numbers when their
+   ECMAScript JSON serialization is non-exponential. Exponential values such
+   as `1e21` remain accepted.
+4. Canonicalize the remaining document with RFC 8785/JCS, including UTF-16
+   property-name ordering and ECMAScript number serialization.
+5. Hash the UTF-8 canonical JSON bytes with SHA-256 and return lowercase
+   hexadecimal prefixed by `sha256:`.
+
+The numeric boundary is intentional. In particular, `-0`, `1e-7`, `1e-6`,
+`1e21`, `1e-27`, `5e-324`, `1e-320`, and
+`2.2250738585072014e-308` have frozen canonical representations, while the
+non-exponential unsafe integer `9007199254740992` is rejected. SDK authors
+must use the canonical strings and hashes in `jcs-revision-vectors.json` rather
+than recomputing expected test values with their production implementation.
+
+## Manifest semantics
+
+Envelope validation against `manifest.schema.json` runs before
+`manifestSemanticsAreValid`. The schema owns the closed shape of availability
+Problems and diagnostics, including the portable `operationId` syntax. The
+shared semantic predicate then applies these cross-document rules:
+
+- an `available` operation summary may require only profiles and capabilities
+  listed by the manifest;
+- an `unavailable` summary retains its complete declared requirements even
+  when one or more are not implemented by the adapter, and carries its safe
+  schema-valid Problem; and
+- a diagnostic may identify a schema-valid operation ID that was omitted from
+  `operations` after its binding failed validation. Diagnostic identity does
+  not imply that an executable operation summary exists.
+
+Feature references, summary and data-source uniqueness, content-derived
+revisions, and data-source schema semantics are identical for both availability
+states.
+
+## Execution-policy semantics
+
+The execution policy is enforceable behavior, not presentation metadata.
+`concurrency` omitted or set to `allow` admits independent handlers. `forbid`
+admits no new run while another run of the same operation owns an execution
+reservation and returns `urn:gauntlet:problem:operation-busy` with status
+409; an idempotent replay is still the original run and never becomes a busy
+error. `queue` admits runs in reservation order and starts one handler for that
+operation at a time. Queue waiting does not consume the operation timeout.
+
+`timeoutSeconds` starts when the handler enters `running`. Expiry requests
+cooperative cancellation and terminalizes the run as `timed_out` with
+`urn:gauntlet:problem:run-timed-out`, title `Run timed out`, and status 504.
+Explicit cancellation of a cancellable queued or running run terminalizes it
+as `cancelled` with `urn:gauntlet:problem:run-cancelled`, title
+`Run cancelled`, and status 409. Cancelling a run whose
+operation declares `cancellationSupported: false` returns
+`urn:gauntlet:problem:run-not-cancellable` with status 409 and does not
+mutate the run, including when the stored run is already terminal. For an
+operation that does support cancellation, retrying cancellation after a run
+became terminal returns that same authoritative terminal run unchanged.
+
+Handlers must observe their SDK's cancellation signal or cancellation check to
+stop application work promptly; runtimes cannot safely hard-kill arbitrary
+application code. Once cancellation or timeout wins the terminal transition,
+the context is closed and late progress, artifacts, actions, handler results,
+or failures cannot mutate that run. Exactly one terminal transition wins. A
+serialized execution reservation remains held until the underlying handler has
+actually settled, even after its run becomes terminal, so application side
+effects cannot overlap. Consequently, an uncooperative handler can block later
+`queue` runs (and keep `forbid` busy) until it returns.
+
+In-memory execution coordinators are single-process test/development defaults.
+An adapter deployed with multiple workers or replicas must use an
+application-owned coordinator shared by those replicas together with its
+shared durable `RunStore`; otherwise `forbid`, FIFO ordering, and cross-replica
+cancellation are only process-local and the adapter must not claim those
+guarantees.
+
+## Adapter semantic vectors
+
+`adapter-semantic-vectors.json` is the normative, language-neutral v1 truth
+table. Consumers verify each source fixture's raw SHA-256 before parsing it,
+then evaluate the checked-in boolean; expected results and revisions must not
+be calculated by the predicate under test. Every source path is a safe sibling
+basename. The vector instance is ASCII UTF-8 without a BOM, uses LF only, ends
+with LF, and remains below 256 KiB. The companion schema and four source
+fixtures have the same UTF-8/BOM/CR/final-LF byte contract.
+
+The `rfc6902-test-subset@1` construction profile applies ordered `add`,
+`remove`, `replace`, and `copy` patches to a fresh owned-JSON clone. JSON
+Pointer and RFC 6902 rules apply exactly: array indexes are canonical decimal,
+`-` is only an add/copy destination, copy resolves before mutation and clones
+its value, and remove/replace require an existing own member. No parent
+creation, root replacement, merge, interpolation, wildcard, URI resolution, or
+code execution exists. A patch cannot address the root revision member.
+Manifest and operation revisions are handled afterward by the explicit
+`preserve` or `set` directive, and every declared match or mismatch is checked
+independently before the semantic predicate runs.
+
+The `tc-preset-operation@1` profile clones the verified operation fixture,
+uses the suite's literal object input schema, and emits one ordered secret rule
+per `secretPointers` entry without deduplication. It removes `uiSchema`, sets
+`dataSources` to `[]`, and creates `preset-<index>` / `Preset <index>` entries
+from independently cloned inputs. An empty pointer list still produces
+`inputHandling.rules: []`. The case's checked-in revision is installed and
+verified before envelope and semantic evaluation. Parsed schema member order
+is preserved; canonical ordering is used only for the separate revision
+assertion.
+
+### Preset analysis ceilings
+
+The v1 analyzer accepts counts exactly at these maxima and fails closed only
+when the next graph node, edge, or visit exceeds one:
+
+```text
+MAX_GRAPH_NODES   = 250000
+MAX_GRAPH_EDGES   = 500000
+MAX_PRESET_VISITS = 500000
+
+inputNodeCount = roots + array elements + object-member values
+visitBudget = min(500000, max(8192,
+  graphNodes * 4 + graphEdges * 2 + inputNodeCount * 64))
+```
+
+Object keys do not count as input nodes. Graph nodes use canonical JSON Schema
+pointers; every structural occurrence is an edge. Secret pointer strings are
+deduplicated for graph compilation, while duplicate rules remain in the
+operation and its revision. Route multiplicity saturates at two. The visit
+counter is shared by every preset in an operation; object-identity and
+schema-node primitive de-duplication sets reset for each preset.
+
+Static traversal covers local `$ref`, `properties`, `dependentSchemas`,
+`allOf`, `anyOf`, `oneOf`, `not`, `if`, `then`, `else`, `prefixItems`, and
+`items`. `patternProperties`, `contains`, `additionalProperties`,
+`propertyNames`, `unevaluatedItems`, `unevaluatedProperties`, and
+`contentSchema` make a target dynamically addressed and therefore fail closed.
+
+The closed `tc-preset-workloads@1` recipes are `deep-chain`,
+`rules-presets-cartesian`, `dense-mutual-reference`, and `wide-array`. Their
+parameters, expected revisions, and canonical full-operation UTF-8 byte counts
+are portable requirements; the wide operation is generated only inside an
+isolated child process and is never checked in. Node 24 reference metadata
+retains 2,500 ms timeouts for cartesian and dense workloads, a 10,000 ms wide
+timeout, 512 MiB old-space and 48 MiB semi-space flags, secret-wide RSS below
+458,752 KiB, and a secret/control RSS delta below 40,960 KiB. Those process
+budgets are Node-specific; they do not change the portable recipes or results.
+
+[Documentation index](../../docs/README.md)

package/dist/environment.d.ts

@@ -0,0 +1,3 @@
+import type { EnvironmentDescriptor } from "./types.js";
+export declare function assertNonProductionEnvironment(value: unknown): EnvironmentDescriptor;
+//# sourceMappingURL=environment.d.ts.map

package/dist/environment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"environment.d.ts","sourceRoot":"","sources":["../src/environment.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,qBAAqB,EAAmB,MAAM,YAAY,CAAC;AAWzE,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,OAAO,GAAG,qBAAqB,CAmBpF"}

package/dist/environment.js

@@ -0,0 +1,32 @@
+import { isProtocolId } from "./identifiers.js";
+import { assertRuntimeJsonData } from "./revision.js";
+const KINDS = new Set([
+    "development", "test", "qa", "staging", "uat", "preview", "sandbox",
+]);
+const PRODUCTION_TOKEN = /(^|[._:-])(prod|production|live)($|[._:-])/i;
+function invalidEnvironment() {
+    return new TypeError("Invalid non-production environment descriptor");
+}
+export function assertNonProductionEnvironment(value) {
+    try {
+        assertRuntimeJsonData(value);
+        if (value === null || typeof value !== "object" || Array.isArray(value))
+            throw invalidEnvironment();
+        const keys = Object.keys(value);
+        if (keys.length !== 2 || !Object.hasOwn(value, "name") || !Object.hasOwn(value, "kind")) {
+            throw invalidEnvironment();
+        }
+        const record = value;
+        if (!isProtocolId(record.name)
+            || PRODUCTION_TOKEN.test(record.name)
+            || typeof record.kind !== "string"
+            || !KINDS.has(record.kind)) {
+            throw invalidEnvironment();
+        }
+        return Object.freeze({ name: record.name, kind: record.kind });
+    }
+    catch {
+        throw invalidEnvironment();
+    }
+}
+//# sourceMappingURL=environment.js.map

package/dist/environment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"environment.js","sourceRoot":"","sources":["../src/environment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AAGtD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAkB;IACrC,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS;CACpE,CAAC,CAAC;AACH,MAAM,gBAAgB,GAAG,6CAA6C,CAAC;AAEvE,SAAS,kBAAkB;IACzB,OAAO,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;AACxE,CAAC;AAED,MAAM,UAAU,8BAA8B,CAAC,KAAc;IAC3D,IAAI,CAAC;QACH,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,MAAM,kBAAkB,EAAE,CAAC;QACpG,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;YACxF,MAAM,kBAAkB,EAAE,CAAC;QAC7B,CAAC;QACD,MAAM,MAAM,GAAG,KAA0C,CAAC;QAC1D,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;eACzB,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;eAClC,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ;eAC/B,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAuB,CAAC,EAAE,CAAC;YAChD,MAAM,kBAAkB,EAAE,CAAC;QAC7B,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAuB,EAAE,CAAC,CAAC;IACpF,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,kBAAkB,EAAE,CAAC;IAC7B,CAAC;AACH,CAAC"}

package/dist/identifiers.d.ts

@@ -0,0 +1,4 @@
+import type { ProtocolId } from "./types.js";
+export declare const PROTOCOL_ID_PATTERN: RegExp;
+export declare function isProtocolId(value: unknown): value is ProtocolId;
+//# sourceMappingURL=identifiers.d.ts.map

package/dist/identifiers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"identifiers.d.ts","sourceRoot":"","sources":["../src/identifiers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,eAAO,MAAM,mBAAmB,QAAwC,CAAC;AAEzE,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,UAAU,CAEhE"}

package/dist/identifiers.js

@@ -0,0 +1,5 @@
+export const PROTOCOL_ID_PATTERN = /^[A-Za-z0-9][A-Za-z0-9._:-]{0,127}$/;
+export function isProtocolId(value) {
+    return typeof value === "string" && PROTOCOL_ID_PATTERN.test(value);
+}
+//# sourceMappingURL=identifiers.js.map

package/dist/identifiers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"identifiers.js","sourceRoot":"","sources":["../src/identifiers.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,mBAAmB,GAAG,qCAAqC,CAAC;AAEzE,MAAM,UAAU,YAAY,CAAC,KAAc;IACzC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACtE,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+export * from "./identifiers.js";
+export * from "./environment.js";
+export * from "./placements.js";
+export * from "./revision.js";
+export * from "./schema-profile.js";
+export * from "./semantic-validation.js";
+export * from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AACzC,cAAc,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,8 @@
+export * from "./identifiers.js";
+export * from "./environment.js";
+export * from "./placements.js";
+export * from "./revision.js";
+export * from "./schema-profile.js";
+export * from "./semantic-validation.js";
+export * from "./types.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AACzC,cAAc,YAAY,CAAC"}

package/dist/placements.d.ts

@@ -0,0 +1,5 @@
+import type { JsonPointer, OperationDefinition } from "./types.js";
+export declare const PAGE_PLACEMENTS_PROFILE = "gauntlet-page-placements@1";
+export declare function placementSchemaPointer(inputPointer: JsonPointer): JsonPointer | undefined;
+export declare function operationPlacementsAreValid(operation: Pick<OperationDefinition, "inputSchema" | "inputHandling" | "placements">): boolean;
+//# sourceMappingURL=placements.d.ts.map

package/dist/placements.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"placements.d.ts","sourceRoot":"","sources":["../src/placements.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEnE,eAAO,MAAM,uBAAuB,+BAA+B,CAAC;AAkBpE,wBAAgB,sBAAsB,CAAC,YAAY,EAAE,WAAW,GAAG,WAAW,GAAG,SAAS,CAKzF;AAmDD,wBAAgB,2BAA2B,CACzC,SAAS,EAAE,IAAI,CAAC,mBAAmB,EAAE,aAAa,GAAG,eAAe,GAAG,YAAY,CAAC,GACnF,OAAO,CAqBT"}