@mailwoman/core 2.0.0

package/out/tokenization/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../tokenization/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,cAAc,CAAA;AAC5B,cAAc,YAAY,CAAA;AAC1B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,WAAW,CAAA"}

package/out/tokenization/normalizer.d.ts

@@ -0,0 +1,41 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export interface TextNormalizerReplaceClause {
+    from: string | RegExp;
+    to: string;
+}
+export interface TextNormalizerInit {
+    lowercase?: boolean;
+    removeAccents?: boolean;
+    removeHyphen?: boolean;
+    removeSpaces?: boolean;
+    minLength?: number;
+    maxLength?: number;
+    replace?: TextNormalizerReplaceClause[];
+}
+/**
+ * Normalizes text values, i.e. removes superfluous characters such as accents, hyphens, and spaces.
+ */
+export declare class TextNormalizer implements TextNormalizerInit {
+    readonly lowercase: boolean;
+    readonly removeAccents: boolean;
+    readonly removeHyphen: boolean;
+    readonly removeSpaces: boolean;
+    readonly replace: TextNormalizerReplaceClause[];
+    readonly minLength?: number;
+    readonly maxLength?: number;
+    constructor(init?: TextNormalizerInit);
+    /**
+     * Perform text normalization on a given input.
+     */
+    normalize(input: string): string;
+    /**
+     * Validate a given input against the defined validations.
+     */
+    validate(input: string): boolean;
+    toJSON(): TextNormalizerInit;
+}
+//# sourceMappingURL=normalizer.d.ts.map

package/out/tokenization/normalizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalizer.d.ts","sourceRoot":"","sources":["../../tokenization/normalizer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAoBH,MAAM,WAAW,2BAA2B;IAC3C,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;IACrB,EAAE,EAAE,MAAM,CAAA;CACV;AAED,MAAM,WAAW,kBAAkB;IAClC,SAAS,CAAC,EAAE,OAAO,CAAA;IACnB,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,OAAO,CAAC,EAAE,2BAA2B,EAAE,CAAA;CACvC;AAED;;GAEG;AACH,qBAAa,cAAe,YAAW,kBAAkB;IACxD,SAAgB,SAAS,EAAE,OAAO,CAAA;IAClC,SAAgB,aAAa,EAAE,OAAO,CAAA;IACtC,SAAgB,YAAY,EAAE,OAAO,CAAA;IACrC,SAAgB,YAAY,EAAE,OAAO,CAAA;IACrC,SAAgB,OAAO,EAAE,2BAA2B,EAAE,CAAA;IACtD,SAAgB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClC,SAAgB,SAAS,CAAC,EAAE,MAAM,CAAA;gBAEtB,IAAI,GAAE,kBAAuB;IAUzC;;OAEG;IACI,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAgCvC;;OAEG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAYhC,MAAM,IAAI,kBAAkB;CAWnC"}

package/out/tokenization/normalizer.js

@@ -0,0 +1,94 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import regenerate from "regenerate";
+/**
+ * A pattern matching combining diacritical marks, variation selectors, and other characters that
+ * are often used in text normalization.
+ */
+const CombiningDiacriticalPattern = regenerate()
+    .add(0x200d) // ZERO WIDTH JOINER (U+200D)
+    .addRange(0x0300, 0x036f) // Combining Diacritical Marks
+    .addRange(0x1ab0, 0x1aff) // Combining Diacritical Marks Extended
+    .addRange(0x1dc0, 0x1dff) // Combining Diacritical Marks Supplement
+    .addRange(0x20d0, 0x20ff) // Combining Diacritical Marks for Symbols
+    .addRange(0xfe00, 0xfe0f) // Variation Selectors
+    .addRange(0xfe20, 0xfe2f) // Combining Half Marks
+    .add(0x3099) // Combining Dakuten
+    .add(0x309a) // Combining Handakuten
+    .toRegExp("g");
+/**
+ * Normalizes text values, i.e. removes superfluous characters such as accents, hyphens, and spaces.
+ */
+export class TextNormalizer {
+    lowercase;
+    removeAccents;
+    removeHyphen;
+    removeSpaces;
+    replace;
+    minLength;
+    maxLength;
+    constructor(init = {}) {
+        this.lowercase = init.lowercase ?? false;
+        this.removeAccents = init.removeAccents ?? false;
+        this.removeHyphen = init.removeHyphen ?? false;
+        this.removeSpaces = init.removeSpaces ?? false;
+        this.replace = init.replace ?? [];
+        this.minLength = init.minLength;
+        this.maxLength = init.maxLength;
+    }
+    /**
+     * Perform text normalization on a given input.
+     */
+    normalize(input) {
+        input = input.trim();
+        for (const { from, to } of this.replace) {
+            input = input.replace(from, to);
+        }
+        if (this.lowercase) {
+            input = input.toLowerCase();
+        }
+        if (this.removeAccents) {
+            input = input
+                // We first normalize to NFKD to decompose any accented characters...
+                .normalize("NFKD")
+                // Then we remove the accented characters...
+                .replace(CombiningDiacriticalPattern, "")
+                // And finally we normalize to NFKC to recompose the string.
+                .normalize("NFKC");
+        }
+        if (this.removeHyphen) {
+            input = input.replace(/-/g, " ");
+        }
+        if (this.removeSpaces) {
+            input = input.replace(/ /g, "");
+        }
+        return input;
+    }
+    /**
+     * Validate a given input against the defined validations.
+     */
+    validate(input) {
+        if (this.minLength && input.length < this.minLength) {
+            return false;
+        }
+        if (this.maxLength && input.length > this.maxLength) {
+            return false;
+        }
+        return true;
+    }
+    toJSON() {
+        return {
+            lowercase: this.lowercase,
+            removeAccents: this.removeAccents,
+            removeHyphen: this.removeHyphen,
+            removeSpaces: this.removeSpaces,
+            replace: this.replace,
+            minLength: this.minLength,
+            maxLength: this.maxLength,
+        };
+    }
+}
+//# sourceMappingURL=normalizer.js.map

package/out/tokenization/normalizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalizer.js","sourceRoot":"","sources":["../../tokenization/normalizer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,UAAU,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,MAAM,2BAA2B,GAAG,UAAU,EAAE;KAC9C,GAAG,CAAC,MAAM,CAAC,CAAC,6BAA6B;KACzC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,8BAA8B;KACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,uCAAuC;KAChE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,yCAAyC;KAClE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,0CAA0C;KACnE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,sBAAsB;KAC/C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,uBAAuB;KAChD,GAAG,CAAC,MAAM,CAAC,CAAC,oBAAoB;KAChC,GAAG,CAAC,MAAM,CAAC,CAAC,uBAAuB;KACnC,QAAQ,CAAC,GAAG,CAAC,CAAA;AAiBf;;GAEG;AACH,MAAM,OAAO,cAAc;IACV,SAAS,CAAS;IAClB,aAAa,CAAS;IACtB,YAAY,CAAS;IACrB,YAAY,CAAS;IACrB,OAAO,CAA+B;IACtC,SAAS,CAAS;IAClB,SAAS,CAAS;IAElC,YAAY,OAA2B,EAAE;QACxC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,CAAA;QACxC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,KAAK,CAAA;QAChD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,KAAK,CAAA;QAC9C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,KAAK,CAAA;QAC9C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAA;QACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;QAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;IAChC,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,KAAa;QAC7B,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAA;QAEpB,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAChC,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAA;QAC5B,CAAC;QAED,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACxB,KAAK,GAAG,KAAK;gBACZ,qEAAqE;iBACpE,SAAS,CAAC,MAAM,CAAC;gBAClB,4CAA4C;iBAC3C,OAAO,CAAC,2BAA2B,EAAE,EAAE,CAAC;gBACzC,4DAA4D;iBAC3D,SAAS,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACjC,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAChC,CAAC;QAED,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,KAAa;QAC5B,IAAI,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACrD,OAAO,KAAK,CAAA;QACb,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACrD,OAAO,KAAK,CAAA;QACb,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC;IAEM,MAAM;QACZ,OAAO;YACN,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;SACzB,CAAA;IACF,CAAC;CACD"}

package/out/tokenization/permutate.d.ts

@@ -0,0 +1,29 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Span } from "./Span.js";
+export interface PermutateOptions {
+    /**
+     * The minimum amount of tokens which can be returned in a single window.
+     */
+    from: number;
+    /**
+     * The maximum amount of tokens which can be returned in a single window.
+     */
+    to: number;
+}
+/**
+ * Produce all the possible token groups from adjacent input tokens (without reordering tokens).
+ *
+ * Example: ['soho', 'new', 'york', 'usa'] [ ['soho', 'new', 'york', 'usa'], ['soho', 'new',
+ * 'york'], ['soho', 'new'], ['soho'], ['new', 'york', 'usa'], ['new', 'york'], ['new'], ['york',
+ * 'usa'], ['york'], ['usa'], ]
+ *
+ * @param spans - The spans to permutate
+ *
+ * @returns The permutations
+ */
+export declare function permutate(spans: Iterable<Span>, { from, to }: PermutateOptions): Span[];
+//# sourceMappingURL=permutate.d.ts.map

package/out/tokenization/permutate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutate.d.ts","sourceRoot":"","sources":["../../tokenization/permutate.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAiEhC,MAAM,WAAW,gBAAgB;IAChC;;OAEG;IACH,IAAI,EAAE,MAAM,CAAA;IAEZ;;OAEG;IACH,EAAE,EAAE,MAAM,CAAA;CACV;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,gBAAgB,GAAG,IAAI,EAAE,CAQvF"}

package/out/tokenization/permutate.js

@@ -0,0 +1,73 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Span } from "./Span.js";
+const JOIN_CHAR = " ";
+/**
+ * Produce all the possible token groups from adjacent input tokens (without reordering tokens)
+ *
+ * WindowMin: the minimum amount of tokens which can be returned in a single window windowMax: the
+ * maximum amount of tokens which can be returned in a single window
+ *
+ * Note: we should honor word boundary delimiters (such as comma) when creating permutations ported:
+ * https://github.com/pelias/placeholder/blob/master/lib/permutations.js
+ */
+function permutateRec(prevSpan, currentSpan, windowCur, windowMin, windowMax, permutations) {
+    // Stops when the window is reached
+    if (windowCur > windowMax)
+        return;
+    // Create new span base on the previous and the next one
+    const span = new Span(prevSpan.body + (prevSpan.body.length > 0 ? JOIN_CHAR : "") + currentSpan.body, prevSpan.start);
+    // Add all children from the previous span to the new one, they will have the same ones + the next one
+    // Add to all children from the previous span the new span as parent + the next one
+    prevSpan.children.forEach((child) => {
+        span.children.add(child);
+        child.parents.add(span);
+    });
+    span.children.add(currentSpan);
+    currentSpan.parents.add(span);
+    const isFirst = span.body === currentSpan.body;
+    const isLast = !currentSpan.nextSibling;
+    if (isFirst) {
+        span.start = currentSpan.start;
+        span.end = currentSpan.end;
+    }
+    else {
+        if (currentSpan.start < span.start) {
+            span.start = currentSpan.start;
+        }
+        if (currentSpan.end > span.end) {
+            span.end = currentSpan.end;
+        }
+    }
+    // go through the graph recursively, check all next spans
+    if (!isLast) {
+        currentSpan.nextSiblings.forEach((next) => {
+            permutateRec(span, next, windowCur + 1, windowMin, windowMax, permutations);
+        });
+    }
+    if (windowMin <= windowCur) {
+        permutations.push(span);
+    }
+}
+/**
+ * Produce all the possible token groups from adjacent input tokens (without reordering tokens).
+ *
+ * Example: ['soho', 'new', 'york', 'usa'] [ ['soho', 'new', 'york', 'usa'], ['soho', 'new',
+ * 'york'], ['soho', 'new'], ['soho'], ['new', 'york', 'usa'], ['new', 'york'], ['new'], ['york',
+ * 'usa'], ['york'], ['usa'], ]
+ *
+ * @param spans - The spans to permutate
+ *
+ * @returns The permutations
+ */
+export function permutate(spans, { from, to }) {
+    const permutations = [];
+    for (const span of spans) {
+        permutateRec(new Span(), span, 1, from, to, permutations);
+    }
+    return permutations;
+}
+//# sourceMappingURL=permutate.js.map

package/out/tokenization/permutate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutate.js","sourceRoot":"","sources":["../../tokenization/permutate.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,MAAM,SAAS,GAAG,GAAG,CAAA;AAErB;;;;;;;;GAQG;AACH,SAAS,YAAY,CACpB,QAAc,EACd,WAAiB,EACjB,SAAiB,EACjB,SAAiB,EACjB,SAAiB,EACjB,YAAoB;IAEpB,mCAAmC;IACnC,IAAI,SAAS,GAAG,SAAS;QAAE,OAAM;IAEjC,wDAAwD;IACxD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;IAErH,sGAAsG;IACtG,mFAAmF;IACnF,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACxB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC9B,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAE7B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,CAAA;IAC9C,MAAM,MAAM,GAAG,CAAC,WAAW,CAAC,WAAW,CAAA;IAEvC,IAAI,OAAO,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAA;QAC9B,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,GAAG,CAAA;IAC3B,CAAC;SAAM,CAAC;QACP,IAAI,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAA;QAC/B,CAAC;QAED,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,GAAG,CAAA;QAC3B,CAAC;IACF,CAAC;IAED,yDAAyD;IACzD,IAAI,CAAC,MAAM,EAAE,CAAC;QACb,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACzC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC,CAAA;QAC5E,CAAC,CAAC,CAAA;IACH,CAAC;IAED,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;QAC5B,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;AACF,CAAC;AAcD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,KAAqB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAoB;IAC9E,MAAM,YAAY,GAAW,EAAE,CAAA;IAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,YAAY,CAAC,IAAI,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,YAAY,CAAC,CAAA;IAC1D,CAAC;IAED,OAAO,YAAY,CAAA;AACpB,CAAC"}

package/out/tokenization/split.d.ts

@@ -0,0 +1,22 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Span } from "./Span.js";
+type FieldMatchPredicate = (char: string) => boolean;
+export declare function splitByField(span: Span, predicate: FieldMatchPredicate): Span[];
+/**
+ * Predicate to test if a character is a field boundary
+ */
+export declare const fieldsFuncBoundary: FieldMatchPredicate;
+/**
+ * Predicate to test if a character is a field whitespace.
+ */
+export declare const fieldsFuncWhiteSpace: FieldMatchPredicate;
+/**
+ * Predicate to test if a character is a hyphen or whitespace.
+ */
+export declare const fieldsFuncHyphenOrWhiteSpace: FieldMatchPredicate;
+export {};
+//# sourceMappingURL=split.d.ts.map

package/out/tokenization/split.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split.d.ts","sourceRoot":"","sources":["../../tokenization/split.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,KAAK,mBAAmB,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAA;AAEpD,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,GAAG,IAAI,EAAE,CA8C/E;AAKD;;GAEG;AACH,eAAO,MAAM,kBAAkB,EAAE,mBAGhC,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,EAAE,mBAElC,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,4BAA4B,EAAE,mBAE1C,CAAA"}

package/out/tokenization/split.js

@@ -0,0 +1,63 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Span } from "./Span.js";
+export function splitByField(span, predicate) {
+    // A span is used to record a slice of s of the form s[start:end].
+    // The start index is inclusive and the end index is exclusive.
+    const spans = [];
+    // Find the field start and end indices.
+    let wasField = false;
+    let fromIndex = 0;
+    // Iterate unicode code points in string
+    for (let i = 0; i < span.body.length; i++) {
+        const char = span.body.charAt(i);
+        if (predicate(char)) {
+            if (wasField) {
+                let appendedChild = Iterator.from(span.children).find((child) => {
+                    return child.start === span.start + fromIndex && child.body === span.body.substring(fromIndex, i);
+                });
+                appendedChild ||= Span.from(span.body.substring(fromIndex, i), {
+                    start: span.start + fromIndex,
+                });
+                spans.push(appendedChild);
+                wasField = false;
+            }
+        }
+        else if (!wasField) {
+            fromIndex = i;
+            wasField = true;
+        }
+    }
+    // Last field might end at EOF.
+    if (wasField) {
+        spans.push(Iterator.from(span.children).find((s) => s.start === span.start + fromIndex && s.body === span.body.substring(fromIndex, span.body.length)) || Span.from(span.body.substring(fromIndex, span.body.length), { start: span.start + fromIndex }));
+    }
+    // Add siblings to graph
+    Span.connectSiblings(...spans);
+    return spans;
+}
+const quotes = '"«»‘’‚‛“”„‟‹›⹂「」『』〝〞〟﹁﹂﹃﹄＂＇｢｣';
+const fieldBoundaryPattern = /\n|\t|,/;
+/**
+ * Predicate to test if a character is a field boundary
+ */
+export const fieldsFuncBoundary = (char) => {
+    // TODO: this should ideally only work for 'matching pairs' of quotes.
+    return fieldBoundaryPattern.test(char) || quotes.includes(char);
+};
+/**
+ * Predicate to test if a character is a field whitespace.
+ */
+export const fieldsFuncWhiteSpace = (char) => {
+    return char.trim().length === 0;
+};
+/**
+ * Predicate to test if a character is a hyphen or whitespace.
+ */
+export const fieldsFuncHyphenOrWhiteSpace = (char) => {
+    return char === "-" || char === "/" || fieldsFuncWhiteSpace(char);
+};
+//# sourceMappingURL=split.js.map

package/out/tokenization/split.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"split.js","sourceRoot":"","sources":["../../tokenization/split.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAIhC,MAAM,UAAU,YAAY,CAAC,IAAU,EAAE,SAA8B;IACtE,kEAAkE;IAClE,+DAA+D;IAC/D,MAAM,KAAK,GAAW,EAAE,CAAA;IAExB,wCAAwC;IACxC,IAAI,QAAQ,GAAG,KAAK,CAAA;IACpB,IAAI,SAAS,GAAG,CAAC,CAAA;IAEjB,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAEhC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,IAAI,QAAQ,EAAE,CAAC;gBACd,IAAI,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;oBAC/D,OAAO,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;gBAClG,CAAC,CAAC,CAAA;gBAEF,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;oBAC9D,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,SAAS;iBAC7B,CAAC,CAAA;gBAEF,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;gBAEzB,QAAQ,GAAG,KAAK,CAAA;YACjB,CAAC;QACF,CAAC;aAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YACtB,SAAS,GAAG,CAAC,CAAA;YACb,QAAQ,GAAG,IAAI,CAAA;QAChB,CAAC;IACF,CAAC;IAED,+BAA+B;IAC/B,IAAI,QAAQ,EAAE,CAAC;QACd,KAAK,CAAC,IAAI,CACT,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CACxG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC,CACnG,CAAA;IACF,CAAC;IAED,wBAAwB;IACxB,IAAI,CAAC,eAAe,CAAC,GAAG,KAAK,CAAC,CAAA;IAE9B,OAAO,KAAK,CAAA;AACb,CAAC;AAED,MAAM,MAAM,GAAG,+BAA+B,CAAA;AAC9C,MAAM,oBAAoB,GAAG,SAAS,CAAA;AAEtC;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAwB,CAAC,IAAI,EAAE,EAAE;IAC/D,sEAAsE;IACtE,OAAO,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;AAChE,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAwB,CAAC,IAAI,EAAE,EAAE;IACjE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAA;AAChC,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAwB,CAAC,IAAI,EAAE,EAAE;IACzE,OAAO,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,CAAA;AAClE,CAAC,CAAA"}

package/out/types/classifier.d.ts

@@ -0,0 +1,117 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Classifier-side contracts for the neural integration (per #6).
+ *
+ *   These interfaces are deliberately distinct from the existing `Classifier` shape in
+ *   `../classification/BaseClassifier.ts`. The legacy shape is mutation-based —
+ *   `classifyTokens(context): void` — and runs synchronously over the span graph. The shape
+ *   declared here is pull-based and async: a classifier returns a list of `ClassificationProposal`
+ *   objects keyed by the canonical `ComponentTag` union.
+ *
+ *   Both shapes co-exist during the Ship-of-Theseus rollout. Rule classifiers are wrapped via
+ *   `wrapLegacyClassifier` (see `@mailwoman/classifiers`); the neural classifier (Phase 3)
+ *   implements this interface natively. The solver consumes one normalized shape.
+ */
+import type { Span } from "../tokenization/index.js";
+import type { ComponentTag } from "./component.js";
+/**
+ * Sections in Mailwoman are sub-Spans of the tokenized input (split by boundary characters: commas,
+ * line breaks, etc.). They are surfaced as `Span` instances in `TokenContext.sections`; this alias
+ * documents the call-site intent.
+ */
+export type Section = Span;
+/**
+ * Source of a `ClassificationProposal`. Drives policy decisions and downstream telemetry.
+ *
+ * - `rule`: emitted by a legacy rule classifier through the adapter.
+ * - `neural`: emitted by an ONNX-backed sequence classifier.
+ * - `merged`: synthetic source for a merger that fused proposals from multiple classifiers (rare;
+ *   mostly for telemetry on `merged` ids).
+ */
+export type ClassificationProposalSource = "rule" | "neural" | "merged";
+/**
+ * A typed classification candidate produced by any classifier.
+ *
+ * Mirrors Mailwoman's pre-refactor per-component output shape with the addition of `source` and
+ * `source_id` so downstream code can identify the origin of each proposal without consulting
+ * external state.
+ */
+export interface ClassificationProposal {
+    /** Span this proposal applies to. */
+    span: Span;
+    /** Component type the classifier thinks this span is. */
+    component: ComponentTag;
+    /** Classifier confidence in [0, 1]. */
+    confidence: number;
+    /** Provenance — which classifier family produced this proposal. */
+    source: ClassificationProposalSource;
+    /**
+     * Identifier of the specific classifier instance. Rule wrappers use the legacy classifier's
+     * stable id (e.g. `house_number`, `postcode`, `whos_on_first`). Neural classifiers use a
+     * versioned model id like `neural-v0.3.1-en-us`.
+     */
+    source_id: string;
+    /**
+     * Solver penalty applied to this proposal. Higher penalty makes the proposal less likely to
+     * appear in the winning solution.
+     */
+    penalty: number;
+    /**
+     * Opaque metadata for debugging and telemetry. Never consulted by the solver. Common keys:
+     * `languages`, `flags`, `legacyClassification`.
+     */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Per-request context handed to a classifier.
+ */
+export interface ClassifierContext {
+    /** Locale for this classification request, if known. */
+    locale?: string;
+    /** Proposals already produced for this request (for composites). */
+    prior?: readonly ClassificationProposal[];
+    /** Cancellation signal. */
+    signal?: AbortSignal;
+}
+/**
+ * Plug-in contract every classifier implements.
+ *
+ * Construction must be cheap; per-classification work runs in {@link classify}. Pre-flight work
+ * (loading dictionaries, warming up an ONNX session) belongs in the optional `ready()` step.
+ */
+export interface ProposalClassifier {
+    /** Stable identifier. Used as `source_id` on emitted proposals. */
+    readonly id: string;
+    /**
+     * Components this classifier may emit. Enforced — proposals for tags outside this list are
+     * dropped by the adapter with a warning.
+     */
+    readonly emits: readonly ComponentTag[];
+    /**
+     * Locales this classifier serves. `"*"` means locale-agnostic.
+     *
+     * The policy layer uses this to skip classifiers that aren't relevant to the requested locale.
+     */
+    readonly locales: readonly (string | "*")[];
+    /** Optional async pre-flight. */
+    ready?(): Promise<void>;
+    /**
+     * Classify a section. Implementations MUST NOT throw — return an empty array on failure and log
+     * via the project logger.
+     */
+    classify(section: Section, context: ClassifierContext): Promise<ClassificationProposal[]>;
+}
+/**
+ * Convenience: synchronous classifier (legacy rule wrappers usually fit here). The adapter wraps
+ * these into the async `ProposalClassifier` interface so the solver path stays uniform.
+ */
+export interface SyncProposalClassifier {
+    readonly id: string;
+    readonly emits: readonly ComponentTag[];
+    readonly locales: readonly (string | "*")[];
+    classifySync(section: Section, context: ClassifierContext): ClassificationProposal[];
+}
+//# sourceMappingURL=classifier.d.ts.map

package/out/types/classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.d.ts","sourceRoot":"","sources":["../../types/classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAA;AACpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAA;AAElD;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,IAAI,CAAA;AAE1B;;;;;;;GAOG;AACH,MAAM,MAAM,4BAA4B,GAAG,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;AAEvE;;;;;;GAMG;AACH,MAAM,WAAW,sBAAsB;IACtC,qCAAqC;IACrC,IAAI,EAAE,IAAI,CAAA;IAEV,yDAAyD;IACzD,SAAS,EAAE,YAAY,CAAA;IAEvB,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAA;IAElB,mEAAmE;IACnE,MAAM,EAAE,4BAA4B,CAAA;IAEpC;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAA;IAEjB;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAA;IAEf;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,wDAAwD;IACxD,MAAM,CAAC,EAAE,MAAM,CAAA;IAEf,oEAAoE;IACpE,KAAK,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAA;IAEzC,2BAA2B;IAC3B,MAAM,CAAC,EAAE,WAAW,CAAA;CACpB;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IAClC,mEAAmE;IACnE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IAEnB;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAA;IAEvC;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,CAAA;IAE3C,iCAAiC;IACjC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;IAEvB;;;OAGG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,GAAG,OAAO,CAAC,sBAAsB,EAAE,CAAC,CAAA;CACzF;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACtC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAA;IACvC,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,CAAA;IAC3C,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,GAAG,sBAAsB,EAAE,CAAA;CACpF"}

package/out/types/classifier.js

@@ -0,0 +1,19 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Classifier-side contracts for the neural integration (per #6).
+ *
+ *   These interfaces are deliberately distinct from the existing `Classifier` shape in
+ *   `../classification/BaseClassifier.ts`. The legacy shape is mutation-based —
+ *   `classifyTokens(context): void` — and runs synchronously over the span graph. The shape
+ *   declared here is pull-based and async: a classifier returns a list of `ClassificationProposal`
+ *   objects keyed by the canonical `ComponentTag` union.
+ *
+ *   Both shapes co-exist during the Ship-of-Theseus rollout. Rule classifiers are wrapped via
+ *   `wrapLegacyClassifier` (see `@mailwoman/classifiers`); the neural classifier (Phase 3)
+ *   implements this interface natively. The solver consumes one normalized shape.
+ */
+export {};
+//# sourceMappingURL=classifier.js.map

package/out/types/classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.js","sourceRoot":"","sources":["../../types/classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}

package/out/types/component.d.ts

@@ -0,0 +1,42 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Canonical address component schema for the neural classifier pipeline.
+ *
+ *   This file is the single source of truth for `ComponentTag`. Any change here requires (per #5 of
+ *   the Mailwoman Neural plan):
+ *
+ *   1. A written rationale in the commit message.
+ *   2. A migration plan for corpus rows tagged with the prior schema.
+ *   3. A same-commit check that alignment, training, and inference code is updated to match.
+ *
+ *   The legacy `Classifications` set in `../classification/scheme.ts` is kept independent on purpose:
+ *   rule classifiers continue to emit those, the neural classifier emits these. The bridge between
+ *   the two lives in the adapter layer (see #6).
+ */
+/**
+ * The canonical address component tag union, ordered by phase and locale.
+ *
+ * - Universal (Phase 1): country, region, locality, dependent_locality, postcode, subregion
+ * - Street-level (Phase 2): house_number, street, street_prefix*, street_suffix, intersection_a/b,
+ *   unit
+ * - Venue-level (Phase 3): venue, attention, po_box
+ * - FR-specific: cedex
+ * - JP-specific (Phase 6, declared but unused before then): prefecture, municipality, district,
+ *   block, sub_block, building_number, building_name
+ */
+export declare const COMPONENT_TAGS: readonly ["country", "region", "locality", "dependent_locality", "postcode", "subregion", "house_number", "street", "street_prefix", "street_prefix_particle", "street_suffix", "intersection_a", "intersection_b", "unit", "venue", "attention", "po_box", "cedex", "prefecture", "municipality", "district", "block", "sub_block", "building_number", "building_name"];
+/** Union of every recognized address component tag. */
+export type ComponentTag = (typeof COMPONENT_TAGS)[number];
+/**
+ * BIO-encoded label set: one `O` plus a `B-` / `I-` pair per tag.
+ *
+ * Used as the per-token output alphabet for the sequence-labeling neural model. Inference decodes a
+ * stream of these back into character-aligned `ClassificationProposal`s.
+ */
+export declare const BIO_LABELS: readonly ["O", ...("B-country" | "B-house_number" | "B-locality" | "B-postcode" | "B-region" | "B-street_prefix" | "B-street_suffix" | "B-street" | "B-unit" | "B-venue" | "B-attention" | "B-municipality" | "B-district" | "B-dependent_locality" | "B-subregion" | "B-street_prefix_particle" | "B-intersection_a" | "B-intersection_b" | "B-po_box" | "B-cedex" | "B-prefecture" | "B-block" | "B-sub_block" | "B-building_number" | "B-building_name" | "I-country" | "I-house_number" | "I-locality" | "I-postcode" | "I-region" | "I-street_prefix" | "I-street_suffix" | "I-street" | "I-unit" | "I-venue" | "I-attention" | "I-municipality" | "I-district" | "I-dependent_locality" | "I-subregion" | "I-street_prefix_particle" | "I-intersection_a" | "I-intersection_b" | "I-po_box" | "I-cedex" | "I-prefecture" | "I-block" | "I-sub_block" | "I-building_number" | "I-building_name")[]];
+/** Union of every BIO label. */
+export type BioLabel = (typeof BIO_LABELS)[number];
+//# sourceMappingURL=component.d.ts.map

package/out/types/component.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"component.d.ts","sourceRoot":"","sources":["../../types/component.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,cAAc,0WA+BjB,CAAA;AAEV,uDAAuD;AACvD,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAA;AAE1D;;;;;GAKG;AACH,eAAO,MAAM,UAAU,02BAAwF,CAAA;AAE/G,gCAAgC;AAChC,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA"}

package/out/types/component.js

@@ -0,0 +1,69 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Canonical address component schema for the neural classifier pipeline.
+ *
+ *   This file is the single source of truth for `ComponentTag`. Any change here requires (per #5 of
+ *   the Mailwoman Neural plan):
+ *
+ *   1. A written rationale in the commit message.
+ *   2. A migration plan for corpus rows tagged with the prior schema.
+ *   3. A same-commit check that alignment, training, and inference code is updated to match.
+ *
+ *   The legacy `Classifications` set in `../classification/scheme.ts` is kept independent on purpose:
+ *   rule classifiers continue to emit those, the neural classifier emits these. The bridge between
+ *   the two lives in the adapter layer (see #6).
+ */
+/**
+ * The canonical address component tag union, ordered by phase and locale.
+ *
+ * - Universal (Phase 1): country, region, locality, dependent_locality, postcode, subregion
+ * - Street-level (Phase 2): house_number, street, street_prefix*, street_suffix, intersection_a/b,
+ *   unit
+ * - Venue-level (Phase 3): venue, attention, po_box
+ * - FR-specific: cedex
+ * - JP-specific (Phase 6, declared but unused before then): prefecture, municipality, district,
+ *   block, sub_block, building_number, building_name
+ */
+export const COMPONENT_TAGS = [
+    // Universal
+    "country",
+    "region",
+    "locality",
+    "dependent_locality",
+    "postcode",
+    "subregion",
+    // Street-level
+    "house_number",
+    "street",
+    "street_prefix",
+    "street_prefix_particle",
+    "street_suffix",
+    "intersection_a",
+    "intersection_b",
+    "unit",
+    // Venue-level
+    "venue",
+    "attention",
+    "po_box",
+    // FR-specific
+    "cedex",
+    // JP-specific (Phase 6 — declared but unused until then)
+    "prefecture",
+    "municipality",
+    "district",
+    "block",
+    "sub_block",
+    "building_number",
+    "building_name",
+];
+/**
+ * BIO-encoded label set: one `O` plus a `B-` / `I-` pair per tag.
+ *
+ * Used as the per-token output alphabet for the sequence-labeling neural model. Inference decodes a
+ * stream of these back into character-aligned `ClassificationProposal`s.
+ */
+export const BIO_LABELS = ["O", ...COMPONENT_TAGS.flatMap((tag) => [`B-${tag}`, `I-${tag}`])];
+//# sourceMappingURL=component.js.map

package/out/types/component.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"component.js","sourceRoot":"","sources":["../../types/component.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC7B,YAAY;IACZ,SAAS;IACT,QAAQ;IACR,UAAU;IACV,oBAAoB;IACpB,UAAU;IACV,WAAW;IACX,eAAe;IACf,cAAc;IACd,QAAQ;IACR,eAAe;IACf,wBAAwB;IACxB,eAAe;IACf,gBAAgB;IAChB,gBAAgB;IAChB,MAAM;IACN,cAAc;IACd,OAAO;IACP,WAAW;IACX,QAAQ;IACR,cAAc;IACd,OAAO;IACP,yDAAyD;IACzD,YAAY;IACZ,cAAc;IACd,UAAU;IACV,OAAO;IACP,WAAW;IACX,iBAAiB;IACjB,eAAe;CACN,CAAA;AAKV;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAU,CAAC,CAAU,CAAA"}

package/out/types/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./classifier.js";
+export * from "./component.js";
+export * from "./mapping.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../types/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,iBAAiB,CAAA;AAC/B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,cAAc,CAAA"}

package/out/types/index.js

@@ -0,0 +1,9 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./classifier.js";
+export * from "./component.js";
+export * from "./mapping.js";
+//# sourceMappingURL=index.js.map