@mailwoman/core 2.0.0

package/out/classification/index.js

@@ -0,0 +1,13 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./BaseClassifier.js";
+export * from "./Classification.js";
+export * from "./CompositeClassifier.js";
+export * from "./PhraseClassifier.js";
+export * from "./scheme.js";
+export * from "./SectionClassifier.js";
+export * from "./WordClassifier.js";
+//# sourceMappingURL=index.js.map

package/out/classification/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../classification/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,qBAAqB,CAAA;AACnC,cAAc,qBAAqB,CAAA;AACnC,cAAc,0BAA0B,CAAA;AACxC,cAAc,uBAAuB,CAAA;AACrC,cAAc,aAAa,CAAA;AAC3B,cAAc,wBAAwB,CAAA;AACtC,cAAc,qBAAqB,CAAA"}

package/out/classification/scheme.d.ts

@@ -0,0 +1,46 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Span } from "@mailwoman/core/tokenization";
+import type { Classification } from "./Classification.js";
+/**
+ * A configuration for a classifier scheme.
+ */
+export interface ClassifierSchemeConfig {
+    classification?: Classification;
+    /**
+     * The confidence level of the classification.
+     *
+     * @default 1
+     */
+    confidence?: number;
+    /**
+     * A list of criteria that must be met for the classification to be applied.
+     */
+    scheme: ClassifierSchemeCriteria[];
+}
+export interface ClassifierSchemeCriteria {
+    /**
+     * ID for the sub-classification.
+     */
+    classification?: Classification;
+    /**
+     * The classification labels that must be present in the token.
+     */
+    is: Classification[];
+    /**
+     * The classification labels that must not be present in the token.
+     */
+    not?: Classification[];
+    /**
+     * Confidence level for the criteria.
+     */
+    confidence?: number;
+}
+/**
+ * Determine if a phrase matches a classifier scheme.
+ */
+export declare function phraseMatchesScheme({ is, not }: ClassifierSchemeCriteria, phrase: Span): boolean;
+//# sourceMappingURL=scheme.d.ts.map

package/out/classification/scheme.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheme.d.ts","sourceRoot":"","sources":["../../classification/scheme.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,8BAA8B,CAAA;AACxD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAA;AAEzD;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,cAAc,CAAC,EAAE,cAAc,CAAA;IAE/B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB;;OAEG;IAEH,MAAM,EAAE,wBAAwB,EAAE,CAAA;CAClC;AAED,MAAM,WAAW,wBAAwB;IACxC;;OAEG;IACH,cAAc,CAAC,EAAE,cAAc,CAAA;IAE/B;;OAEG;IACH,EAAE,EAAE,cAAc,EAAE,CAAA;IAEpB;;OAEG;IACH,GAAG,CAAC,EAAE,cAAc,EAAE,CAAA;IACtB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,wBAAwB,EAAE,MAAM,EAAE,IAAI,GAAG,OAAO,CA8BhG"}

package/out/classification/scheme.js

@@ -0,0 +1,37 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * Determine if a phrase matches a classifier scheme.
+ */
+export function phraseMatchesScheme({ is, not }, phrase) {
+    const { children } = phrase;
+    if (!Array.isArray(is))
+        return false;
+    // Does the phrase include at least one of the target classifications?
+    if (!is.some((cl) => phrase.is(cl))) {
+        // Is this a multi-word phrase
+        if (children.size !== 1)
+            return false;
+        // this is a single-word phrase, also check the classification of its single child
+        if (!is.some((cl) => children.first?.is(cl))) {
+            return false;
+        }
+    }
+    // 'not' is an optional property
+    if (!Array.isArray(not))
+        return true;
+    // phrase does include at least one of the target classifications
+    if (not.some((cl) => phrase.is(cl)))
+        return false;
+    // this is a single-word phrase, check the classification of it's single child
+    if (children.size === 1) {
+        if (not.some((cl) => children.first.is(cl))) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=scheme.js.map

package/out/classification/scheme.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheme.js","sourceRoot":"","sources":["../../classification/scheme.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA6CH;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAE,EAAE,EAAE,GAAG,EAA4B,EAAE,MAAY;IACtF,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAA;IAE3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAA;IAEpC,sEAAsE;IACtE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrC,8BAA8B;QAC9B,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QAErC,kFAAkF;QAClF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAA;QACb,CAAC;IACF,CAAC;IAED,gCAAgC;IAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAEpC,iEAAiE;IACjE,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAEjD,8EAA8E;IAC9E,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAA;QACb,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAA;AACZ,CAAC"}

package/out/decoder/build-tree.d.ts

@@ -0,0 +1,31 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   BIO-stream → AddressTree.
+ *
+ *   Two passes:
+ *
+ *   1. Span emission — walk the token stream, group `B-X` followed by `I-X*` into one span. Lenient on
+ *        hanging `I-X` (treat as new span). Span `value` is sliced from `raw` by [start, end), NOT
+ *        concatenated from `piece` — this avoids SentencePiece's synthetic leading-space markers in
+ *        the output.
+ *   2. Parent attachment — for each span, find the nearest labeled span whose tag is the
+ *        highest-priority entry in this span's `PARENT_OF` list. Distance is the tiebreaker only.
+ *        Spans with no found parent become roots.
+ *
+ *   The "nearest" rule (vs "most-recent-prior") is intentional: it makes the decoder robust to source
+ *   ordering — e.g. "75004 Paris" attaches postcode to locality even though postcode came first.
+ *   Source order is still preserved in the `start`/`end` fields, which the XML serializer exposes
+ *   as attributes.
+ */
+import type { AddressTree, DecoderToken } from "./types.js";
+/**
+ * Build an `AddressTree` from a raw input string and the token stream produced by the model.
+ *
+ * @param raw The original input as fed to the tokenizer.
+ * @param tokens Model output: one entry per piece with predicted BIO label + confidence.
+ */
+export declare function buildAddressTree(raw: string, tokens: DecoderToken[]): AddressTree;
+//# sourceMappingURL=build-tree.d.ts.map

package/out/decoder/build-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-tree.d.ts","sourceRoot":"","sources":["../../decoder/build-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,OAAO,KAAK,EAAe,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAuExE;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,WAAW,CAYjF"}

package/out/decoder/build-tree.js

@@ -0,0 +1,100 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   BIO-stream → AddressTree.
+ *
+ *   Two passes:
+ *
+ *   1. Span emission — walk the token stream, group `B-X` followed by `I-X*` into one span. Lenient on
+ *        hanging `I-X` (treat as new span). Span `value` is sliced from `raw` by [start, end), NOT
+ *        concatenated from `piece` — this avoids SentencePiece's synthetic leading-space markers in
+ *        the output.
+ *   2. Parent attachment — for each span, find the nearest labeled span whose tag is the
+ *        highest-priority entry in this span's `PARENT_OF` list. Distance is the tiebreaker only.
+ *        Spans with no found parent become roots.
+ *
+ *   The "nearest" rule (vs "most-recent-prior") is intentional: it makes the decoder robust to source
+ *   ordering — e.g. "75004 Paris" attaches postcode to locality even though postcode came first.
+ *   Source order is still preserved in the `start`/`end` fields, which the XML serializer exposes
+ *   as attributes.
+ */
+import { PARENT_OF } from "./containment.js";
+function bioParts(label) {
+    if (label === "O")
+        return { prefix: "O", tag: null };
+    const dash = label.indexOf("-");
+    return { prefix: label.slice(0, dash), tag: label.slice(dash + 1) };
+}
+function flush(open, raw, out) {
+    if (!open)
+        return null;
+    const value = raw.slice(open.start, open.end);
+    const confidence = open.confidences.reduce((a, b) => a + b, 0) / open.confidences.length;
+    out.push({ tag: open.tag, start: open.start, end: open.end, value, confidence, children: [] });
+    return null;
+}
+function emitSpans(raw, tokens) {
+    const out = [];
+    let open = null;
+    for (const tok of tokens) {
+        const { prefix, tag } = bioParts(tok.label);
+        if (prefix === "O") {
+            open = flush(open, raw, out);
+            continue;
+        }
+        if (prefix === "B" || open === null || open.tag !== tag) {
+            open = flush(open, raw, out);
+            open = { tag: tag, start: tok.start, end: tok.end, confidences: [tok.confidence] };
+            continue;
+        }
+        // I- continuation of same tag.
+        open.end = tok.end;
+        open.confidences.push(tok.confidence);
+    }
+    flush(open, raw, out);
+    return out;
+}
+function distance(a, b) {
+    if (a.end <= b.start)
+        return b.start - a.end;
+    if (b.end <= a.start)
+        return a.start - b.end;
+    return 0;
+}
+function findParent(span, all) {
+    const candidates = PARENT_OF[span.tag] ?? [];
+    for (const parentTag of candidates) {
+        const matches = all.filter((s) => s !== span && s.tag === parentTag);
+        if (matches.length === 0)
+            continue;
+        return matches.reduce((best, cur) => (distance(cur, span) < distance(best, span) ? cur : best));
+    }
+    return null;
+}
+function sortByStart(nodes) {
+    nodes.sort((a, b) => a.start - b.start);
+    for (const n of nodes)
+        sortByStart(n.children);
+}
+/**
+ * Build an `AddressTree` from a raw input string and the token stream produced by the model.
+ *
+ * @param raw The original input as fed to the tokenizer.
+ * @param tokens Model output: one entry per piece with predicted BIO label + confidence.
+ */
+export function buildAddressTree(raw, tokens) {
+    const spans = emitSpans(raw, tokens);
+    const roots = [];
+    for (const span of spans) {
+        const parent = findParent(span, spans);
+        if (parent)
+            parent.children.push(span);
+        else
+            roots.push(span);
+    }
+    sortByStart(roots);
+    return { raw, roots };
+}
+//# sourceMappingURL=build-tree.js.map

package/out/decoder/build-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-tree.js","sourceRoot":"","sources":["../../decoder/build-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAU5C,SAAS,QAAQ,CAAC,KAAe;IAChC,IAAI,KAAK,KAAK,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAA;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC/B,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAc,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAiB,EAAE,CAAA;AACjG,CAAC;AAED,SAAS,KAAK,CAAC,IAAqB,EAAE,GAAW,EAAE,GAAkB;IACpE,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IACtB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAA;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAA;IACxF,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAA;IAC9F,OAAO,IAAI,CAAA;AACZ,CAAC;AAED,SAAS,SAAS,CAAC,GAAW,EAAE,MAAsB;IACrD,MAAM,GAAG,GAAkB,EAAE,CAAA;IAC7B,IAAI,IAAI,GAAoB,IAAI,CAAA;IAEhC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAE3C,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;YACpB,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;YAC5B,SAAQ;QACT,CAAC;QAED,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACzD,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;YAC5B,IAAI,GAAG,EAAE,GAAG,EAAE,GAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAA;YACnF,SAAQ;QACT,CAAC;QAED,+BAA+B;QAC/B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;QAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACtC,CAAC;IAED,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IACrB,OAAO,GAAG,CAAA;AACX,CAAC;AAED,SAAS,QAAQ,CAAC,CAAc,EAAE,CAAc;IAC/C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAA;IAC5C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAA;IAC5C,OAAO,CAAC,CAAA;AACT,CAAC;AAED,SAAS,UAAU,CAAC,IAAiB,EAAE,GAAkB;IACxD,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAA;IAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAA;QACpE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAClC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAChG,CAAC;IACD,OAAO,IAAI,CAAA;AACZ,CAAC;AAED,SAAS,WAAW,CAAC,KAAoB;IACxC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW,EAAE,MAAsB;IACnE,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IACpC,MAAM,KAAK,GAAkB,EAAE,CAAA;IAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACtC,IAAI,MAAM;YAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;YACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACtB,CAAC;IAED,WAAW,CAAC,KAAK,CAAC,CAAA;IAClB,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;AACtB,CAAC"}

package/out/decoder/containment.d.ts

@@ -0,0 +1,19 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Containment rule for the address tree.
+ *
+ *   Each tag lists permitted parents in priority order (most-preferred first). The tree builder
+ *   resolves each span's parent by walking this list and picking the first tag that has at least
+ *   one labeled span; if multiple spans share that tag, the one nearest to this span in char
+ *   distance wins. Spans whose tag is absent from this map (or has no labeled parent) become
+ *   roots.
+ *
+ *   Tags absent from this map are treated as root-only (no parent ever accepted).
+ */
+import type { ComponentTag } from "../types/component.js";
+/** Preferred-parent ordering for each tag. Empty / missing = always root. */
+export declare const PARENT_OF: Partial<Record<ComponentTag, ComponentTag[]>>;
+//# sourceMappingURL=containment.d.ts.map

package/out/decoder/containment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"containment.d.ts","sourceRoot":"","sources":["../../decoder/containment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAEzD,6EAA6E;AAC7E,eAAO,MAAM,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,YAAY,EAAE,CAAC,CAgCnE,CAAA"}

package/out/decoder/containment.js

@@ -0,0 +1,47 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Containment rule for the address tree.
+ *
+ *   Each tag lists permitted parents in priority order (most-preferred first). The tree builder
+ *   resolves each span's parent by walking this list and picking the first tag that has at least
+ *   one labeled span; if multiple spans share that tag, the one nearest to this span in char
+ *   distance wins. Spans whose tag is absent from this map (or has no labeled parent) become
+ *   roots.
+ *
+ *   Tags absent from this map are treated as root-only (no parent ever accepted).
+ */
+/** Preferred-parent ordering for each tag. Empty / missing = always root. */
+export const PARENT_OF = {
+    // Universal coarse — containment follows geographic granularity.
+    region: ["country"],
+    subregion: ["region", "country"],
+    locality: ["subregion", "region", "country"],
+    dependent_locality: ["locality"],
+    postcode: ["locality", "subregion", "region", "country"],
+    cedex: ["postcode", "locality"],
+    // Street-level — street nests inside locality; house_number/unit/intersections nest inside street.
+    street: ["dependent_locality", "locality", "subregion", "region"],
+    street_prefix: ["street"],
+    street_prefix_particle: ["street_prefix", "street"],
+    street_suffix: ["street"],
+    house_number: ["street"],
+    unit: ["street", "house_number"],
+    intersection_a: ["street", "locality"],
+    intersection_b: ["street", "locality"],
+    // Venue / mailing — separate top-level concepts; attach to street if labeled.
+    venue: ["street", "locality"],
+    attention: ["venue"],
+    po_box: ["locality", "subregion", "region"],
+    // JP — declared for forward-compat; mapping is provisional and will be revisited in Phase 6.
+    prefecture: ["country"],
+    municipality: ["prefecture"],
+    district: ["municipality"],
+    block: ["district"],
+    sub_block: ["block"],
+    building_number: ["sub_block", "block"],
+    building_name: ["building_number", "sub_block", "block"],
+};
+//# sourceMappingURL=containment.js.map

package/out/decoder/containment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"containment.js","sourceRoot":"","sources":["../../decoder/containment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,6EAA6E;AAC7E,MAAM,CAAC,MAAM,SAAS,GAAkD;IACvE,iEAAiE;IACjE,MAAM,EAAE,CAAC,SAAS,CAAC;IACnB,SAAS,EAAE,CAAC,QAAQ,EAAE,SAAS,CAAC;IAChC,QAAQ,EAAE,CAAC,WAAW,EAAE,QAAQ,EAAE,SAAS,CAAC;IAC5C,kBAAkB,EAAE,CAAC,UAAU,CAAC;IAChC,QAAQ,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,CAAC;IACxD,KAAK,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;IAE/B,mGAAmG;IACnG,MAAM,EAAE,CAAC,oBAAoB,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,CAAC;IACjE,aAAa,EAAE,CAAC,QAAQ,CAAC;IACzB,sBAAsB,EAAE,CAAC,eAAe,EAAE,QAAQ,CAAC;IACnD,aAAa,EAAE,CAAC,QAAQ,CAAC;IACzB,YAAY,EAAE,CAAC,QAAQ,CAAC;IACxB,IAAI,EAAE,CAAC,QAAQ,EAAE,cAAc,CAAC;IAChC,cAAc,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;IACtC,cAAc,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;IAEtC,8EAA8E;IAC9E,KAAK,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;IAC7B,SAAS,EAAE,CAAC,OAAO,CAAC;IACpB,MAAM,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,CAAC;IAE3C,6FAA6F;IAC7F,UAAU,EAAE,CAAC,SAAS,CAAC;IACvB,YAAY,EAAE,CAAC,YAAY,CAAC;IAC5B,QAAQ,EAAE,CAAC,cAAc,CAAC;IAC1B,KAAK,EAAE,CAAC,UAAU,CAAC;IACnB,SAAS,EAAE,CAAC,OAAO,CAAC;IACpB,eAAe,EAAE,CAAC,WAAW,EAAE,OAAO,CAAC;IACvC,aAAa,EAAE,CAAC,iBAAiB,EAAE,WAAW,EAAE,OAAO,CAAC;CACxD,CAAA"}

package/out/decoder/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./build-tree.js";
+export * from "./containment.js";
+export * from "./proposals-to-tree.js";
+export * from "./serialize-json.js";
+export * from "./serialize-tuples.js";
+export * from "./serialize-xml.js";
+export * from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/out/decoder/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../decoder/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,iBAAiB,CAAA;AAC/B,cAAc,kBAAkB,CAAA;AAChC,cAAc,wBAAwB,CAAA;AACtC,cAAc,qBAAqB,CAAA;AACnC,cAAc,uBAAuB,CAAA;AACrC,cAAc,oBAAoB,CAAA;AAClC,cAAc,YAAY,CAAA"}

package/out/decoder/index.js

@@ -0,0 +1,13 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./build-tree.js";
+export * from "./containment.js";
+export * from "./proposals-to-tree.js";
+export * from "./serialize-json.js";
+export * from "./serialize-tuples.js";
+export * from "./serialize-xml.js";
+export * from "./types.js";
+//# sourceMappingURL=index.js.map

package/out/decoder/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../decoder/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,iBAAiB,CAAA;AAC/B,cAAc,kBAAkB,CAAA;AAChC,cAAc,wBAAwB,CAAA;AACtC,cAAc,qBAAqB,CAAA;AACnC,cAAc,uBAAuB,CAAA;AACrC,cAAc,oBAAoB,CAAA;AAClC,cAAc,YAAY,CAAA"}

package/out/decoder/proposals-to-tree.d.ts

@@ -0,0 +1,19 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Project a flat list of `ClassificationProposal`s into a flat `AddressTree` (every proposal
+ *   becomes a root node, no containment nesting). Useful for surfacing policy-filtered output
+ *   through the existing JSON/tuple/XML decoder projections without rebuilding the original
+ *   containment hierarchy — which is intentionally lossy: once proposals are individually
+ *   accept/rejected by policy, the containment relationships from the source tree may no longer be
+ *   meaningful.
+ *
+ *   For consumers that need containment back, re-tokenize the input and run the full decoder
+ *   pipeline.
+ */
+import type { ClassificationProposal } from "../types/index.js";
+import type { AddressTree } from "./types.js";
+export declare function proposalsToTree(raw: string, proposals: readonly ClassificationProposal[]): AddressTree;
+//# sourceMappingURL=proposals-to-tree.d.ts.map

package/out/decoder/proposals-to-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposals-to-tree.d.ts","sourceRoot":"","sources":["../../decoder/proposals-to-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAgB,MAAM,mBAAmB,CAAA;AAC7E,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,YAAY,CAAA;AAE1D,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,sBAAsB,EAAE,GAAG,WAAW,CAWtG"}

package/out/decoder/proposals-to-tree.js

@@ -0,0 +1,28 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Project a flat list of `ClassificationProposal`s into a flat `AddressTree` (every proposal
+ *   becomes a root node, no containment nesting). Useful for surfacing policy-filtered output
+ *   through the existing JSON/tuple/XML decoder projections without rebuilding the original
+ *   containment hierarchy — which is intentionally lossy: once proposals are individually
+ *   accept/rejected by policy, the containment relationships from the source tree may no longer be
+ *   meaningful.
+ *
+ *   For consumers that need containment back, re-tokenize the input and run the full decoder
+ *   pipeline.
+ */
+export function proposalsToTree(raw, proposals) {
+    const roots = proposals.map((p) => ({
+        tag: p.component,
+        value: p.span.body,
+        start: p.span.start,
+        end: p.span.end,
+        confidence: p.confidence,
+        children: [],
+    }));
+    roots.sort((a, b) => a.start - b.start);
+    return { raw, roots };
+}
+//# sourceMappingURL=proposals-to-tree.js.map

package/out/decoder/proposals-to-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposals-to-tree.js","sourceRoot":"","sources":["../../decoder/proposals-to-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,SAA4C;IACxF,MAAM,KAAK,GAAkB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,GAAG,EAAE,CAAC,CAAC,SAAyB;QAChC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;QAClB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK;QACnB,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG;QACf,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC,CAAA;IACH,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IACvC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;AACtB,CAAC"}

package/out/decoder/serialize-json.d.ts

@@ -0,0 +1,15 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Libpostal-compatible JSON projection.
+ *
+ *   Flattens the tree to `{ tag: value }`. First-occurrence wins for repeated tags — matches
+ *   libpostal's behavior. Use `decodeAsTuples` if order or repetition matters.
+ */
+import type { ComponentTag } from "../types/component.js";
+import type { AddressTree } from "./types.js";
+/** Project an `AddressTree` to a flat libpostal-style component map. */
+export declare function decodeAsJson(tree: AddressTree): Partial<Record<ComponentTag, string>>;
+//# sourceMappingURL=serialize-json.d.ts.map

package/out/decoder/serialize-json.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-json.d.ts","sourceRoot":"","sources":["../../decoder/serialize-json.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACzD,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,YAAY,CAAA;AAO1D,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAIrF"}

package/out/decoder/serialize-json.js

@@ -0,0 +1,24 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Libpostal-compatible JSON projection.
+ *
+ *   Flattens the tree to `{ tag: value }`. First-occurrence wins for repeated tags — matches
+ *   libpostal's behavior. Use `decodeAsTuples` if order or repetition matters.
+ */
+function visit(node, out) {
+    if (!(node.tag in out))
+        out[node.tag] = node.value;
+    for (const child of node.children)
+        visit(child, out);
+}
+/** Project an `AddressTree` to a flat libpostal-style component map. */
+export function decodeAsJson(tree) {
+    const out = {};
+    for (const root of tree.roots)
+        visit(root, out);
+    return out;
+}
+//# sourceMappingURL=serialize-json.js.map

package/out/decoder/serialize-json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-json.js","sourceRoot":"","sources":["../../decoder/serialize-json.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,SAAS,KAAK,CAAC,IAAiB,EAAE,GAA0C;IAC3E,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IAClD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACrD,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,YAAY,CAAC,IAAiB;IAC7C,MAAM,GAAG,GAA0C,EAAE,CAAA;IACrD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC/C,OAAO,GAAG,CAAA;AACX,CAAC"}

package/out/decoder/serialize-tuples.d.ts

@@ -0,0 +1,16 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Order-preserving tuple projection.
+ *
+ *   Emits `Array<[tag, value]>` in source order (sorted by `start`). Preserves repeated tags (e.g.
+ *   two `locality` entries for "Springfield, IL — sent from Springfield, MA"). Hierarchy is lost —
+ *   use `decodeAsXml` when containment matters.
+ */
+import type { ComponentTag } from "../types/component.js";
+import type { AddressTree } from "./types.js";
+/** Project an `AddressTree` to a source-ordered list of (tag, value) pairs. */
+export declare function decodeAsTuples(tree: AddressTree): Array<[ComponentTag, string]>;
+//# sourceMappingURL=serialize-tuples.d.ts.map

package/out/decoder/serialize-tuples.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-tuples.d.ts","sourceRoot":"","sources":["../../decoder/serialize-tuples.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACzD,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,YAAY,CAAA;AAO1D,+EAA+E;AAC/E,wBAAgB,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAK/E"}

package/out/decoder/serialize-tuples.js

@@ -0,0 +1,25 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Order-preserving tuple projection.
+ *
+ *   Emits `Array<[tag, value]>` in source order (sorted by `start`). Preserves repeated tags (e.g.
+ *   two `locality` entries for "Springfield, IL — sent from Springfield, MA"). Hierarchy is lost —
+ *   use `decodeAsXml` when containment matters.
+ */
+function flatten(node, out) {
+    out.push(node);
+    for (const child of node.children)
+        flatten(child, out);
+}
+/** Project an `AddressTree` to a source-ordered list of (tag, value) pairs. */
+export function decodeAsTuples(tree) {
+    const all = [];
+    for (const root of tree.roots)
+        flatten(root, all);
+    all.sort((a, b) => a.start - b.start);
+    return all.map((n) => [n.tag, n.value]);
+}
+//# sourceMappingURL=serialize-tuples.js.map

package/out/decoder/serialize-tuples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-tuples.js","sourceRoot":"","sources":["../../decoder/serialize-tuples.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,SAAS,OAAO,CAAC,IAAiB,EAAE,GAAkB;IACrD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;QAAE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACvD,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,cAAc,CAAC,IAAiB;IAC/C,MAAM,GAAG,GAAkB,EAAE,CAAA;IAC7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IACjD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IACrC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;AACxC,CAAC"}

package/out/decoder/serialize-xml.d.ts

@@ -0,0 +1,36 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   XML projection — nested mixed-content with attributes.
+ *
+ *   Each component is one element. The element's _direct text node_ is the component's own value
+ *   (e.g. `<locality>Paris…</locality>` — "Paris" is the locality's text). Children are nested as
+ *   sub-elements representing geographic / structural containment.
+ *
+ *   Attributes:
+ *
+ *   - `conf` — aggregated confidence in [0, 1], two decimal places.
+ *   - `start` / `end` — character offsets in the raw input. Preserves source order alongside the
+ *       containment-derived element order.
+ *   - Root `<address>` carries `raw` — the full input string for round-trip.
+ *   - `src` is reserved for Phase 4 (Resolver source provenance) and not emitted here.
+ *
+ *   ⚠ DOM gotcha: `element.textContent` on a mixed-content node returns the concatenation of all
+ *   descendant text (parent value + children values). Use `Array.from(el.childNodes).filter(n =>
+ *   n.nodeType === 3).map(n => n.nodeValue).join('').trim()` or XPath `text()` to get just the
+ *   parent's own value. Documented in the package README.
+ */
+import type { AddressTree } from "./types.js";
+export interface SerializeXmlOpts {
+    /** Pretty-print with line breaks and indentation. Default true. */
+    pretty?: boolean;
+    /** Include `conf` attribute on every component. Default true. */
+    includeConf?: boolean;
+    /** Include `start` + `end` char-offset attributes. Default true. */
+    includeOffsets?: boolean;
+}
+/** Project an `AddressTree` to nested XML with optional confidence/offset attributes. */
+export declare function decodeAsXml(tree: AddressTree, opts?: SerializeXmlOpts): string;
+//# sourceMappingURL=serialize-xml.d.ts.map

package/out/decoder/serialize-xml.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-xml.d.ts","sourceRoot":"","sources":["../../decoder/serialize-xml.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,YAAY,CAAA;AAE1D,MAAM,WAAW,gBAAgB;IAChC,mEAAmE;IACnE,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,iEAAiE;IACjE,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,oEAAoE;IACpE,cAAc,CAAC,EAAE,OAAO,CAAA;CACxB;AA2BD,yFAAyF;AACzF,wBAAgB,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,GAAE,gBAAqB,GAAG,MAAM,CAWlF"}

package/out/decoder/serialize-xml.js

@@ -0,0 +1,60 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   XML projection — nested mixed-content with attributes.
+ *
+ *   Each component is one element. The element's _direct text node_ is the component's own value
+ *   (e.g. `<locality>Paris…</locality>` — "Paris" is the locality's text). Children are nested as
+ *   sub-elements representing geographic / structural containment.
+ *
+ *   Attributes:
+ *
+ *   - `conf` — aggregated confidence in [0, 1], two decimal places.
+ *   - `start` / `end` — character offsets in the raw input. Preserves source order alongside the
+ *       containment-derived element order.
+ *   - Root `<address>` carries `raw` — the full input string for round-trip.
+ *   - `src` is reserved for Phase 4 (Resolver source provenance) and not emitted here.
+ *
+ *   ⚠ DOM gotcha: `element.textContent` on a mixed-content node returns the concatenation of all
+ *   descendant text (parent value + children values). Use `Array.from(el.childNodes).filter(n =>
+ *   n.nodeType === 3).map(n => n.nodeValue).join('').trim()` or XPath `text()` to get just the
+ *   parent's own value. Documented in the package README.
+ */
+function escapeXml(s) {
+    return s.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;");
+}
+function attrs(node, opts) {
+    const parts = [];
+    if (opts.includeOffsets)
+        parts.push(`start="${node.start}"`, `end="${node.end}"`);
+    if (opts.includeConf)
+        parts.push(`conf="${node.confidence.toFixed(2)}"`);
+    return parts.length === 0 ? "" : " " + parts.join(" ");
+}
+function serializeNode(node, indent, opts) {
+    const a = attrs(node, opts);
+    const text = escapeXml(node.value);
+    const nl = opts.pretty ? "\n" : "";
+    const childIndent = opts.pretty ? indent + "\t" : "";
+    if (node.children.length === 0) {
+        return `${indent}<${node.tag}${a}>${text}</${node.tag}>`;
+    }
+    const children = node.children.map((c) => serializeNode(c, childIndent, opts)).join(nl);
+    return `${indent}<${node.tag}${a}>${text}${nl}${children}${nl}${indent}</${node.tag}>`;
+}
+/** Project an `AddressTree` to nested XML with optional confidence/offset attributes. */
+export function decodeAsXml(tree, opts = {}) {
+    const full = {
+        pretty: opts.pretty ?? true,
+        includeConf: opts.includeConf ?? true,
+        includeOffsets: opts.includeOffsets ?? true,
+    };
+    const rawAttr = escapeXml(tree.raw);
+    const nl = full.pretty ? "\n" : "";
+    const indent = full.pretty ? "\t" : "";
+    const children = tree.roots.map((r) => serializeNode(r, indent, full)).join(nl);
+    return `<address raw="${rawAttr}">${nl}${children}${nl}</address>`;
+}
+//# sourceMappingURL=serialize-xml.js.map

package/out/decoder/serialize-xml.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize-xml.js","sourceRoot":"","sources":["../../decoder/serialize-xml.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAaH,SAAS,SAAS,CAAC,CAAS;IAC3B,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AACpG,CAAC;AAED,SAAS,KAAK,CAAC,IAAiB,EAAE,IAAgC;IACjE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,IAAI,CAAC,cAAc;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,KAAK,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,GAAG,CAAC,CAAA;IACjF,IAAI,IAAI,CAAC,WAAW;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACxE,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACvD,CAAC;AAED,SAAS,aAAa,CAAC,IAAiB,EAAE,MAAc,EAAE,IAAgC;IACzF,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;IAClC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;IAEpD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG,CAAA;IACzD,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACvF,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,GAAG,QAAQ,GAAG,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG,GAAG,CAAA;AACvF,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,WAAW,CAAC,IAAiB,EAAE,OAAyB,EAAE;IACzE,MAAM,IAAI,GAA+B;QACxC,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;QAC3B,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI;QACrC,cAAc,EAAE,IAAI,CAAC,cAAc,IAAI,IAAI;KAC3C,CAAA;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;IAClC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC/E,OAAO,iBAAiB,OAAO,KAAK,EAAE,GAAG,QAAQ,GAAG,EAAE,YAAY,CAAA;AACnE,CAAC"}