@codegraft/core 0.1.0-beta.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026-present Joël Charles
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,13 @@
+# @codegraft/core
+
+Runtime engine for [Codegraft](../../README.md): the web-tree-sitter parser, the lazy
+`RichNode` wrapper, comment attachment, zone splitting, the `Collection`, the scope
+`Resolver`, and `createCodemodTransformer` (which runs a codemod as `magic-string` edits
+with source maps). Compiled Codegraft codemods depend only on this package.
+
+```ts
+import { Collection, createCodemodTransformer, evaluate } from '@codegraft/core'
+```
+
+Grammars (`tree-sitter-javascript|typescript|html|css`) are **optional peer
+dependencies** — install only the ones your targets use.

package/dist/assert.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Internal invariant check. The plan favours assertions over defensive branches for
+ * unreachable states: a failed `assert` means a bug in Codegraft (or a misuse of an
+ * internal API), not a recoverable runtime condition. The `asserts` predicate also
+ * narrows types for the caller.
+ */
+export declare function assert(condition: unknown, message: string): asserts condition;
+//# sourceMappingURL=assert.d.ts.map

package/dist/assert.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assert.d.ts","sourceRoot":"","sources":["../src/assert.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAE7E"}

package/dist/assert.js

@@ -0,0 +1,11 @@
+/**
+ * Internal invariant check. The plan favours assertions over defensive branches for
+ * unreachable states: a failed `assert` means a bug in Codegraft (or a misuse of an
+ * internal API), not a recoverable runtime condition. The `asserts` predicate also
+ * narrows types for the caller.
+ */
+export function assert(condition, message) {
+    if (!condition)
+        throw new Error(`[codegraft] ${message}`);
+}
+//# sourceMappingURL=assert.js.map

package/dist/assert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assert.js","sourceRoot":"","sources":["../src/assert.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,SAAkB,EAAE,OAAe;IACxD,IAAI,CAAC,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,eAAe,OAAO,EAAE,CAAC,CAAA;AAC3D,CAAC"}

package/dist/collection.d.ts

@@ -0,0 +1,164 @@
+import type { GrammarId, LazyTransformer, RichNode, ZoneSplitter } from './types.js';
+import type { NodeTypeOf, NodeTypeAllOf, FieldNameOf } from './generated/node-types.js';
+import { EditCollector } from './edit-collector.js';
+import { type Resolver } from './resolver.js';
+/** Shared per-transform state a {@link Collection} records edits into. */
+interface Session {
+    collector: EditCollector;
+    /** The binding resolver for `node`'s zone (JS/TS/TSX), or `null` if unsupported. */
+    resolver(node: RichNode): Resolver | null;
+}
+/** A field predicate in `find(type, attrs)`: equals a field's text (`string`), matches it
+ *  (`RegExp`), recurses into the field child (a nested `{ … }` of more matchers), or is an
+ *  escape-hatch predicate over the whole node (`function`). The pseudo-key `text` matches the
+ *  node's own text rather than a field. */
+type AttrMatcher<G extends GrammarId = GrammarId> = string | RegExp | ((node: RichNode) => boolean) | AttrMatchers<G>;
+/** Field-keyed matchers (the `text` pseudo-key matches the node's own text). The mapped type is a
+ *  deferred position, so the recursion through {@link AttrMatcher} resolves rather than cycling. */
+type AttrMatchers<G extends GrammarId = GrammarId> = {
+    [K in FieldNameOf<G> | 'text']?: AttrMatcher<G>;
+};
+/** A replacement text, or a function deriving it from the (single-node) Collection being edited. */
+type TextArg<G extends GrammarId = GrammarId> = string | ((node: Collection<G>) => string);
+/**
+ * A jscodeshift-style selection of CST nodes bound to one transform run. Query methods
+ * (`find`/`filter`/`closest`/`parent`/`children`/`first`/`at`) return new Collections; edit
+ * methods (`replaceWith`/`remove`/…) record magic-string edits and return `this`. Single-node
+ * accessors (`node`/`text`/`type`/`field`/`evaluate`) assert the collection holds exactly one
+ * node — the shape you get inside `forEach`, after `first()`/`at()`, or from `field()`.
+ *
+ * The grammar parameter `G` types the node-type and field-name strings (`NodeTypeOf<G>` etc.) and
+ * is carried through navigation. It defaults to every built-in grammar — annotate `root` (e.g.
+ * `(root: Collection<'tsx'>) => …`) to narrow `find`/`field` to one grammar's vocabulary.
+ */
+export declare class Collection<G extends GrammarId = GrammarId> {
+    #private;
+    constructor(nodes: RichNode[], session: Session);
+    /** Descendants (not self) of node type `type` — a concrete type or a grammar supertype
+     *  (e.g. `expression`), optionally filtered by field predicates. */
+    find(type: NodeTypeOf<G>, attrs?: AttrMatchers<G>): Collection<G>;
+    /** Comment nodes in the subtree (which `find`/`children` omit), optionally only those matching
+     *  `pattern` — the entry point for transforms that act on directive comments themselves. */
+    findComments(pattern?: RegExp): Collection<G>;
+    filter(predicate: (node: Collection<G>) => boolean): Collection<G>;
+    /** Nearest ancestor (not self) of `type` — concrete or a grammar supertype — per selected node. */
+    closest(type: NodeTypeOf<G>): Collection<G>;
+    parent(): Collection<G>;
+    children(): Collection<G>;
+    /** All named siblings of each selected node (excluding itself). */
+    siblings(): Collection<G>;
+    nextSibling(): Collection<G>;
+    prevSibling(): Collection<G>;
+    /** Every ancestor of each selected node (innermost first), optionally of node type `type`. */
+    ancestors(type?: NodeTypeOf<G>): Collection<G>;
+    /** Nearest enclosing scope (ancestor-or-self): a function, block, loop, catch, or the program. */
+    closestScope(): Collection<G>;
+    first(): Collection<G>;
+    at(index: number): Collection<G>;
+    size(): number;
+    forEach(fn: (node: Collection<G>) => void): this;
+    map<T>(fn: (node: Collection<G>) => T): T[];
+    nodes(): RichNode[];
+    /** Whether every selected node is of `type` (concrete or supertype); false for an empty selection. */
+    isOfType(type: NodeTypeOf<G>): boolean;
+    /** The distinct node types in the selection. */
+    getTypes(): string[];
+    get node(): RichNode;
+    get text(): string;
+    get type(): NodeTypeAllOf<G>;
+    /** The field child as a (0-or-1) Collection, e.g. `node.field('condition')`. */
+    field(name: FieldNameOf<G>): Collection<G>;
+    /** Evaluate this node as a build-time expression against `context` (see core `evaluate`). */
+    evaluate(context: unknown): unknown;
+    /** Every occurrence (declaration + references) of the binding this node declares, or `null`
+     *  when not confidently resolvable — the safe signal to skip a rename. */
+    references(): Collection<G> | null;
+    /** The declaration this reference resolves to, or `null` for a global / when uncertain. */
+    definition(): Collection<G> | null;
+    /** The declaration `name` resolves to from this node's position; `null` for a global / abstain. */
+    lookup(name: string): Collection<G> | null;
+    /** Every binding visible at this node (inner shadows outer), or `null` when abstaining. */
+    bindingsInScope(): Collection<G> | null;
+    /** Build a code string, interpolating values (a `Collection` contributes its text), validated
+     *  against the grammar of the first selected node — a syntax error asserts rather than emitting
+     *  malformed code. Validates as a standalone snippet, so build whole expressions or statements
+     *  and let `append`/`prepend` add separators. The result feeds any insert/replace. */
+    code(strings: TemplateStringsArray, ...values: unknown[]): string;
+    /** Replace each selected node with `text`, or with the string a callback derives from it. */
+    replaceWith(text: TextArg<G>): this;
+    /** Overwrite a field child's text (literal or derived from its current text); no-op where the
+     *  field is absent, mirroring `field()` returning an empty selection. */
+    setField(name: FieldNameOf<G>, text: string | ((current: string) => string)): this;
+    /**
+     * Remove each selected node.
+     * - `separator`: also drop the trailing `,` of a list element, leaving no array hole / dangling comma.
+     * - `wholeLines`: remove the whole lines the node spans (a full-line comment, a YAML entry), so no
+     *   blank line is left; `collapseBlankBefore` additionally absorbs a blank-line separator directly above.
+     */
+    remove(options?: {
+        separator?: boolean;
+        wholeLines?: boolean;
+        collapseBlankBefore?: boolean;
+    }): this;
+    /**
+     * Narrow-delete: keep `keep` (a 0+-node selection within this node) and drop the wrapper
+     * around it — remove `[this.start, firstKept.start)` and `[lastKept.end, this.end)`. The
+     * kept range stays editable, so edits made to nodes inside it in the same pass still compose
+     * (this is what lets nested conditionals collapse in one pass). Empty `keep` removes the whole
+     * node.
+     */
+    unwrap(keep: Collection<G>): this;
+    /** Insert `text` (literal or derived per node) immediately before each selected node. */
+    insertBefore(text: TextArg<G>): this;
+    /** Insert `text` (literal or derived per node) immediately after each selected node. */
+    insertAfter(text: TextArg<G>): this;
+    /** Surround each selected node with `before`…`after`. */
+    wrap(before: string, after: string): this;
+    /** Append `text` as the last element of each container node (array/object/argument list/block):
+     *  after the last element with the right separator, or just inside an empty container. */
+    append(text: string): this;
+    /** Prepend `text` as the first element of each container node. */
+    prepend(text: string): this;
+    /** Insert a top-level import once: a no-op if a statement importing the same module already
+     *  exists. Placed after the last existing import, else before the first node. */
+    ensureImport(statement: string): this;
+    /** Insert `text` at the very start of the first selected node (typically the file). */
+    prependToFile(text: string): this;
+    /** Move this node's text to just before `target` (delete here, re-insert there). */
+    moveBefore(target: Collection<G>): this;
+    /** Move this node's text to just after `target`. */
+    moveAfter(target: Collection<G>): this;
+    /** Add a leading comment line above each selected node (pass the full comment, e.g. `// note`). */
+    addLeadingComment(text: string): this;
+    /** Add a trailing comment after each selected node, on the same line. */
+    addTrailingComment(text: string): this;
+    /** Remove each node's comments, keeping the node. Leading comments take the gap up to the node;
+     *  trailing/inner comments are removed by their own range (residual whitespace is Prettier's job —
+     *  note that a same-line trailing comment often attaches as an `inner` comment). */
+    removeComments(): this;
+    /** Rewrite each node's first leading comment with `fn(its text)`; no-op where there is none. */
+    mapLeadingComment(fn: (text: string) => string): this;
+    /** The first leading comment matching `pattern`, as a `RegExpMatchArray` (use a capture group
+     *  to extract the expression), or `null`. Read it, then `dropDirective` to strip it. */
+    directive(pattern: RegExp): RegExpMatchArray | null;
+    /** Remove a matching leading directive comment (and the gap up to this node), keeping the node
+     *  itself. Compose with `remove()` to drop both. */
+    dropDirective(pattern: RegExp): this;
+    /** Evaluate a string expression (e.g. a directive's captured text) against `context`. Parsed as
+     *  TypeScript — available because a namespaced codemod ensures that grammar. */
+    evaluateExpression(expression: string, context: unknown): unknown;
+}
+/**
+ * Build a lazy transformer that runs an imperative `codemod(root, context)` against a target
+ * (a grammar or a {@link ZoneSplitter}): `init()` loads grammars once; the returned transformer
+ * is synchronous. The codemod receives a {@link Collection} over every zone's tree and records
+ * edits, which are emitted via magic-string.
+ *
+ * `namespace` opts into the scan-gate (a source not mentioning it is returned untouched,
+ * unparsed) and ensures the TypeScript grammar for `evaluate`'s string form.
+ */
+export declare function createCodemodTransformer<Ctx extends Record<string, unknown> = Record<string, unknown>, G extends GrammarId = GrammarId>(target: GrammarId | ZoneSplitter, codemod: (root: Collection<G>, context: Ctx) => void, options?: {
+    namespace?: string;
+}): LazyTransformer<Ctx>;
+export {};
+//# sourceMappingURL=collection.d.ts.map

package/dist/collection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection.d.ts","sourceRoot":"","sources":["../src/collection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,eAAe,EACf,QAAQ,EAGR,YAAY,EACb,MAAM,YAAY,CAAA;AACnB,OAAO,KAAK,EAAa,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AAIlG,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AAEnD,OAAO,EAAkB,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAA;AAG7D,0EAA0E;AAC1E,UAAU,OAAO;IACf,SAAS,EAAE,aAAa,CAAA;IACxB,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAA;CAC1C;AAED;;;2CAG2C;AAC3C,KAAK,WAAW,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAA;AACrH;oGACoG;AACpG,KAAK,YAAY,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,IAAI;KAAG,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;CAAE,CAAA;AAExG,oGAAoG;AACpG,KAAK,OAAO,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAA;AAE1F;;;;;;;;;;GAUG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;;gBAIzC,KAAK,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,OAAO;IAO/C;wEACoE;IACpE,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAgBjE;gGAC4F;IAC5F,YAAY,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAY7C,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC;IAIlE,mGAAmG;IACnG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAI3C,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC;IAIvB,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC;IAIzB,mEAAmE;IACnE,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC;IAIzB,WAAW,IAAI,UAAU,CAAC,CAAC,CAAC;IAI5B,WAAW,IAAI,UAAU,CAAC,CAAC,CAAC;IAI5B,8FAA8F;IAC9F,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAQ9C,kGAAkG;IAClG,YAAY,IAAI,UAAU,CAAC,CAAC,CAAC;IAI7B,KAAK,IAAI,UAAU,CAAC,CAAC,CAAC;IAItB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAKhC,IAAI,IAAI,MAAM;IAId,OAAO,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI;IAKhD,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;IAI3C,KAAK,IAAI,QAAQ,EAAE;IAInB,sGAAsG;IACtG,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO;IAItC,gDAAgD;IAChD,QAAQ,IAAI,MAAM,EAAE;IAMpB,IAAI,IAAI,IAAI,QAAQ,CAEnB;IACD,IAAI,IAAI,IAAI,MAAM,CAEjB;IACD,IAAI,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,CAE3B;IACD,gFAAgF;IAChF,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAI1C,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO;IAMnC;8EAC0E;IAC1E,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAMlC,2FAA2F;IAC3F,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAMlC,mGAAmG;IACnG,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAM1C,2FAA2F;IAC3F,eAAe,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAQvC;;;0FAGsF;IACtF,IAAI,CAAC,OAAO,EAAE,oBAAoB,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM;IASjE,6FAA6F;IAC7F,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAOnC;6EACyE;IACzE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,GAAG,IAAI;IAUlF;;;;;OAKG;IACH,MAAM,CAAC,OAAO,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,OAAO,CAAC;QAAC,UAAU,CAAC,EAAE,OAAO,CAAC;QAAC,mBAAmB,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAgBpG;;;;;;OAMG;IACH,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAcjC,yFAAyF;IACzF,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAKpC,wFAAwF;IACxF,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAKnC,yDAAyD;IACzD,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAQzC;8FAC0F;IAC1F,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAS1B,kEAAkE;IAClE,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAS3B;qFACiF;IACjF,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IASrC,uFAAuF;IACvF,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAKjC,oFAAoF;IACpF,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAIvC,oDAAoD;IACpD,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAMtC,mGAAmG;IACnG,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAKrC,yEAAyE;IACzE,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAKtC;;wFAEoF;IACpF,cAAc,IAAI,IAAI;IAWtB,gGAAgG;IAChG,iBAAiB,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI;IAQrD;4FACwF;IACxF,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAQnD;wDACoD;IACpD,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAOpC;oFACgF;IAChF,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO;CAkClE;AAmHD;;;;;;;;GAQG;AACH,wBAAgB,wBAAwB,CACtC,GAAG,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7D,CAAC,SAAS,SAAS,GAAG,SAAS,EAE/B,MAAM,EAAE,SAAS,GAAG,YAAY,EAChC,OAAO,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,KAAK,IAAI,EACpD,OAAO,CAAC,EAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,GAC/B,eAAe,CAAC,GAAG,CAAC,CA8CtB"}