@mailwoman/core 2.1.0 → 3.0.0

package/out/pipeline/types.d.ts

@@ -0,0 +1,215 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Types for the runtime pipeline coordinator (`runPipeline`).
+ *
+ *   Generic over its stage implementations — each stage is an injected function or class, defined
+ *   structurally. Keeps `@mailwoman/core` free of dependencies on the concrete neural / normalize /
+ *   query-shape / resolver packages while still composing them at runtime when callers wire them
+ *   up.
+ *
+ *   See `docs/articles/plan/reference/STAGES.md` for the full contract this implements.
+ */
+import type { AddressTree } from "../decoder/types.js";
+import type { ResolveOpts, Resolver } from "../resolver/types.js";
+import type { Section } from "../types/classifier.js";
+export type LocaleTag = string;
+/** Optional user-location signal for Stage 6 resolver scoring. */
+export type UserLocation = {
+    lat: number;
+    lon: number;
+} | {
+    country: string;
+} | {
+    region: string;
+    country: string;
+};
+/** Common opts threaded through every stage. */
+export interface PipelineOpts {
+    locale?: LocaleTag;
+    userLocation?: UserLocation;
+    /** Disable fast-path shortcuts; always run the full pipeline. */
+    forceFullPipeline?: boolean;
+    /**
+     * Enable the joint-reconcile path (Stage 5 beam search). Opt-in until phrase-grouper proposal
+     * quality supports multi-word streets/localities — currently produces single-token spans.
+     * Requires phrase grouper + classifier with `parseWithLogits`.
+     */
+    forceJointReconcile?: boolean;
+    /** Hard cap on lookups the resolver may issue; passed through. */
+    resolveOpts?: ResolveOpts;
+    signal?: AbortSignal;
+}
+/** Minimal structural shape `NormalizedInput` must satisfy. Compatible with @mailwoman/normalize. */
+export interface NormalizedInputLite {
+    raw: string;
+    normalized: string;
+    appliedLocale?: string;
+}
+/** Minimal structural shape `QueryShape` must satisfy. Compatible with @mailwoman/query-shape. */
+export interface QueryShapeLite {
+    knownFormats: ReadonlyArray<{
+        format: string;
+        span: {
+            start: number;
+            end: number;
+        };
+        confidence: number;
+    }>;
+    segments?: ReadonlyArray<{
+        body: string;
+        index: number;
+    }>;
+    characterClass?: string;
+    totalLength?: number;
+}
+/** Detected (or asserted) locale + alternatives. */
+export interface LocaleHint {
+    locale: LocaleTag;
+    confidence: number;
+    alternatives: ReadonlyArray<{
+        locale: LocaleTag;
+        confidence: number;
+    }>;
+    source: "caller" | "detected" | "ensemble";
+}
+/** Kind classifier output. */
+export type QueryKind = "postcode_only" | "locality_only" | "structured_address" | "intersection" | "po_box" | "landmark" | "vague";
+export interface QueryKindResult {
+    kind: QueryKind;
+    confidence: number;
+    alternatives: ReadonlyArray<{
+        kind: QueryKind;
+        confidence: number;
+    }>;
+}
+/**
+ * Stage 2.7 phrase grouper output. Coarse phrase-shape hypothesis attached to a `Section` (sub-Span
+ * of the tokenized input). The classifier (Stage 3) conditions on these proposals so it can answer
+ * the simpler "what type is this proposed span?" instead of jointly discovering boundaries and
+ * types. The reconciler (Stage 5) consumes them as boundary candidates for joint decoding.
+ *
+ * Taxonomy is purely structural — no place-name knowledge. A `LOCALITY_PHRASE` proposal is "this
+ * looks shaped like a multi-word capitalized phrase that could be a city name" — not "this IS New
+ * York." Typing the span is the classifier's job.
+ *
+ * See `docs/articles/concepts/the-knowledge-ladder.md` § Phrase grouper for the design rationale.
+ */
+export type PhraseKind = "NUMERIC" | "STREET_PHRASE" | "LOCALITY_PHRASE" | "REGION_ABBREVIATION" | "POSTCODE" | "VENUE_PHRASE" | "HYPHENATED_COMPOUND";
+/**
+ * One phrase proposal emitted by Stage 2.7. The contract:
+ *
+ * - `span`: the input slice (sub-Span of the tokenized input) the proposal applies to.
+ * - `kindHypothesis`: structural shape this slice looks like.
+ * - `confidence`: 0..1 score. Used by downstream stages to weight proposals.
+ *
+ * Per "possibilities not constraints", emit a proposal whenever a rule fires — overlapping
+ * proposals over the same tokens are expected (e.g. `Saint Petersburg` may surface as one
+ * `LOCALITY_PHRASE` AND two `LOCALITY_PHRASE`s, with confidence ordering signalling which the
+ * grouper prefers).
+ */
+export interface PhraseProposal {
+    span: Section;
+    kindHypothesis: PhraseKind;
+    confidence: number;
+}
+/**
+ * Stage 2.7 contract. Structural — any of the rule-based grouper (`@mailwoman/phrase-grouper`), a
+ * learned span proposer (future), or a fake for tests satisfies this. Async so the coordinator can
+ * stay uniform even when implementations call into models.
+ */
+export interface PhraseGrouper {
+    group(input: NormalizedInputLite, shape: QueryShapeLite, locale: LocaleHint): Promise<PhraseProposal[]>;
+}
+/**
+ * Stage 3 contract: classifier that turns a text into an `AddressTree`. Structural — any of
+ * `@mailwoman/neural`'s `NeuralAddressClassifier`, a rule-based classifier, or a fake for tests
+ * satisfies this.
+ */
+/**
+ * Structural type for the FST gazetteer matcher, compatible with @mailwoman/resolver-wof-sqlite's
+ * FstMatcher.
+ */
+export interface FstMatcherLike {
+    walk(tokens: string[]): {
+        stateId: number;
+        accepted: boolean;
+        depth: number;
+    } | null;
+    walkFrom(prev: {
+        stateId: number;
+        depth: number;
+    }, token: string): {
+        stateId: number;
+        accepted: boolean;
+        depth: number;
+    } | null;
+    accepting(stateId: number): Array<{
+        wofID: number;
+        placetype: string;
+        importance: number;
+    }>;
+}
+export interface ClassifierOpts {
+    queryShape?: QueryShapeLite;
+    fst?: FstMatcherLike;
+    fstBiasScale?: number;
+}
+export interface AddressClassifier {
+    parse(text: string, opts?: ClassifierOpts): Promise<AddressTree>;
+}
+/**
+ * Injectable stage implementations. All optional — when a stage is absent, the coordinator either
+ * skips it (resolver) or substitutes a no-op stub (normalize / queryShape / locale gate / kind
+ * classifier). The classifier is required for the full pipeline path; without it, the coordinator
+ * can only fast-path on QueryShape known-formats.
+ */
+export interface RuntimePipelineStages {
+    normalize?: (raw: string, opts?: {
+        locale?: string;
+    }) => NormalizedInputLite;
+    computeQueryShape?: (input: NormalizedInputLite | string, opts?: {
+        locale?: string;
+    }) => QueryShapeLite;
+    detectLocale?: (input: NormalizedInputLite, shape: QueryShapeLite, opts?: {
+        hint?: LocaleTag;
+    }) => Promise<LocaleHint>;
+    classifyKind?: (input: NormalizedInputLite, shape: QueryShapeLite, locale: LocaleHint) => Promise<QueryKindResult>;
+    /**
+     * Stage 2.7 phrase grouper. Emits coherent input-unit proposals consumed by Stage 3 (as
+     * conditioning) and Stage 5 (as boundary candidates). Hard dep in v0.5.0; pre-v0.5.0 callers run
+     * with no grouper and the result `phraseProposals` field is empty.
+     */
+    groupPhrases?: (input: NormalizedInputLite, shape: QueryShapeLite, locale: LocaleHint) => Promise<PhraseProposal[]>;
+    classifier?: AddressClassifier;
+    /**
+     * Pre-built FST gazetteer matcher. When provided, gazetteer matches produce additive emission
+     * biases during classification.
+     */
+    fst?: FstMatcherLike;
+    resolver?: Resolver;
+}
+export interface PipelineTiming {
+    [stage: string]: number;
+}
+/** Result of one `runPipeline` call. */
+export interface PipelineResult {
+    input: string;
+    normalized: NormalizedInputLite;
+    queryShape: QueryShapeLite;
+    locale: LocaleHint;
+    kind: QueryKindResult;
+    /**
+     * Stage 2.7 phrase proposals when a grouper was wired. Empty array when the coordinator ran with
+     * no grouper (pre-v0.5.0 callers) or when the fast-path skipped Stage 2.7. Stage 3 consumes this
+     * as conditioning; Stage 5 consumes it as boundary candidates.
+     */
+    phraseProposals: PhraseProposal[];
+    tree: AddressTree;
+    timing: PipelineTiming;
+    /** Which path the coordinator took. `"fast-path"` skipped stages 3-5. */
+    path: "fast-path" | "full";
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../pipeline/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAA;AACjE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAA;AAErD,MAAM,MAAM,SAAS,GAAG,MAAM,CAAA;AAE9B,kEAAkE;AAClE,MAAM,MAAM,YAAY,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAA;AAEnH,gDAAgD;AAChD,MAAM,WAAW,YAAY;IAC5B,MAAM,CAAC,EAAE,SAAS,CAAA;IAClB,YAAY,CAAC,EAAE,YAAY,CAAA;IAC3B,iEAAiE;IACjE,iBAAiB,CAAC,EAAE,OAAO,CAAA;IAC3B;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAA;IAC7B,kEAAkE;IAClE,WAAW,CAAC,EAAE,WAAW,CAAA;IACzB,MAAM,CAAC,EAAE,WAAW,CAAA;CACpB;AAED,qGAAqG;AACrG,MAAM,WAAW,mBAAmB;IACnC,GAAG,EAAE,MAAM,CAAA;IACX,UAAU,EAAE,MAAM,CAAA;IAClB,aAAa,CAAC,EAAE,MAAM,CAAA;CACtB;AAED,kGAAkG;AAClG,MAAM,WAAW,cAAc;IAC9B,YAAY,EAAE,aAAa,CAAC;QAC3B,MAAM,EAAE,MAAM,CAAA;QACd,IAAI,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAA;QACpC,UAAU,EAAE,MAAM,CAAA;KAClB,CAAC,CAAA;IACF,QAAQ,CAAC,EAAE,aAAa,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACzD,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,WAAW,CAAC,EAAE,MAAM,CAAA;CACpB;AAED,oDAAoD;AACpD,MAAM,WAAW,UAAU;IAC1B,MAAM,EAAE,SAAS,CAAA;IACjB,UAAU,EAAE,MAAM,CAAA;IAClB,YAAY,EAAE,aAAa,CAAC;QAAE,MAAM,EAAE,SAAS,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACtE,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,UAAU,CAAA;CAC1C;AAED,8BAA8B;AAC9B,MAAM,MAAM,SAAS,GAClB,eAAe,GACf,eAAe,GACf,oBAAoB,GACpB,cAAc,GACd,QAAQ,GACR,UAAU,GACV,OAAO,CAAA;AAEV,MAAM,WAAW,eAAe;IAC/B,IAAI,EAAE,SAAS,CAAA;IACf,UAAU,EAAE,MAAM,CAAA;IAClB,YAAY,EAAE,aAAa,CAAC;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACpE;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,UAAU,GACnB,SAAS,GACT,eAAe,GACf,iBAAiB,GACjB,qBAAqB,GACrB,UAAU,GACV,cAAc,GACd,qBAAqB,CAAA;AAExB;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,OAAO,CAAA;IACb,cAAc,EAAE,UAAU,CAAA;IAC1B,UAAU,EAAE,MAAM,CAAA;CAClB;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC7B,KAAK,CAAC,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAAA;CACvG;AAED;;;;GAIG;AACH;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,OAAO,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAA;IACpF,QAAQ,CACP,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EACxC,KAAK,EAAE,MAAM,GACX;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,OAAO,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAA;IAC/D,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAC3F;AAED,MAAM,WAAW,cAAc;IAC9B,UAAU,CAAC,EAAE,cAAc,CAAA;IAC3B,GAAG,CAAC,EAAE,cAAc,CAAA;IACpB,YAAY,CAAC,EAAE,MAAM,CAAA;CACrB;AAED,MAAM,WAAW,iBAAiB;IACjC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,WAAW,CAAC,CAAA;CAChE;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAqB;IACrC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,KAAK,mBAAmB,CAAA;IAC5E,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,mBAAmB,GAAG,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,KAAK,cAAc,CAAA;IACvG,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,SAAS,CAAA;KAAE,KAAK,OAAO,CAAC,UAAU,CAAC,CAAA;IACtH,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,UAAU,KAAK,OAAO,CAAC,eAAe,CAAC,CAAA;IAClH;;;;OAIG;IACH,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,UAAU,KAAK,OAAO,CAAC,cAAc,EAAE,CAAC,CAAA;IACnH,UAAU,CAAC,EAAE,iBAAiB,CAAA;IAC9B;;;OAGG;IACH,GAAG,CAAC,EAAE,cAAc,CAAA;IACpB,QAAQ,CAAC,EAAE,QAAQ,CAAA;CACnB;AAED,MAAM,WAAW,cAAc;IAC9B,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CACvB;AAED,wCAAwC;AACxC,MAAM,WAAW,cAAc;IAC9B,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,mBAAmB,CAAA;IAC/B,UAAU,EAAE,cAAc,CAAA;IAC1B,MAAM,EAAE,UAAU,CAAA;IAClB,IAAI,EAAE,eAAe,CAAA;IACrB;;;;OAIG;IACH,eAAe,EAAE,cAAc,EAAE,CAAA;IACjC,IAAI,EAAE,WAAW,CAAA;IACjB,MAAM,EAAE,cAAc,CAAA;IACtB,yEAAyE;IACzE,IAAI,EAAE,WAAW,GAAG,MAAM,CAAA;CAC1B"}

package/out/pipeline/types.js

@@ -0,0 +1,16 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Types for the runtime pipeline coordinator (`runPipeline`).
+ *
+ *   Generic over its stage implementations — each stage is an injected function or class, defined
+ *   structurally. Keeps `@mailwoman/core` free of dependencies on the concrete neural / normalize /
+ *   query-shape / resolver packages while still composing them at runtime when callers wire them
+ *   up.
+ *
+ *   See `docs/articles/plan/reference/STAGES.md` for the full contract this implements.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/out/pipeline/types.js.map

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

package/out/resolver/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export { createWofResolver } from "./resolve.js";
+export { DEFAULT_PLACETYPE_MAP } from "./types.js";
+export type { PlacetypeMap, ResolveOpts, ResolvedPlace, Resolver, ResolverBackend } from "./types.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../resolver/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAA;AAClD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA"}

package/out/resolver/index.js

@@ -0,0 +1,8 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export { createWofResolver } from "./resolve.js";
+export { DEFAULT_PLACETYPE_MAP } from "./types.js";
+//# sourceMappingURL=index.js.map

package/out/resolver/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../resolver/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAA"}

package/out/resolver/resolve.d.ts

@@ -0,0 +1,21 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   `resolveTree` — walk an `AddressTree` top-down and decorate matched nodes with resolver- supplied
+ *   attribution + coordinates.
+ *
+ *   The walk is parent-constraint-aware: when a parent node resolves to a place id, its children's
+ *   lookups are scoped to descendants of that parent. This dramatically narrows the search space
+ *   for ambiguous names — `Springfield` under a resolved `Illinois` parent resolves to the IL one,
+ *   not the MA one.
+ */
+import { type Resolver, type ResolverBackend } from "./types.js";
+/**
+ * Build a `Resolver` backed by a `ResolverBackend`. The backend can be any concrete impl
+ * structurally compatible with `PlaceLookup` — e.g. `new WofSqlitePlaceLookup({ databasePath
+ * }).asResolverBackend()` or a fake for tests.
+ */
+export declare function createWofResolver(backend: ResolverBackend): Resolver;
+//# sourceMappingURL=resolve.d.ts.map

package/out/resolver/resolve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve.d.ts","sourceRoot":"","sources":["../../resolver/resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAKN,KAAK,QAAQ,EACb,KAAK,eAAe,EACpB,MAAM,YAAY,CAAA;AAEnB;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,eAAe,GAAG,QAAQ,CAEpE"}

package/out/resolver/resolve.js

@@ -0,0 +1,118 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   `resolveTree` — walk an `AddressTree` top-down and decorate matched nodes with resolver- supplied
+ *   attribution + coordinates.
+ *
+ *   The walk is parent-constraint-aware: when a parent node resolves to a place id, its children's
+ *   lookups are scoped to descendants of that parent. This dramatically narrows the search space
+ *   for ambiguous names — `Springfield` under a resolved `Illinois` parent resolves to the IL one,
+ *   not the MA one.
+ */
+import { DEFAULT_PLACETYPE_MAP, } from "./types.js";
+/**
+ * Build a `Resolver` backed by a `ResolverBackend`. The backend can be any concrete impl
+ * structurally compatible with `PlaceLookup` — e.g. `new WofSqlitePlaceLookup({ databasePath
+ * }).asResolverBackend()` or a fake for tests.
+ */
+export function createWofResolver(backend) {
+    return new WofResolver(backend);
+}
+class WofResolver {
+    #backend;
+    constructor(backend) {
+        this.#backend = backend;
+    }
+    async resolveTree(tree, opts = {}) {
+        const state = {
+            lookupsRemaining: opts.maxLookups ?? 10,
+            // Full replacement when `placetypeMap` is supplied — callers that want to extend rather
+            // than replace should spread DEFAULT_PLACETYPE_MAP themselves.
+            placetypeMap: opts.placetypeMap ?? DEFAULT_PLACETYPE_MAP,
+            minWinningScore: opts.minWinningScore ?? 0,
+            candidatesPerLookup: opts.candidatesPerLookup ?? 5,
+        };
+        const newRoots = [];
+        for (const root of tree.roots) {
+            newRoots.push(await this.#walk(root, /* parentResolved */ null, state));
+        }
+        return { raw: tree.raw, roots: newRoots };
+    }
+    async #walk(node, parentResolved, state) {
+        // Always clone — never mutate input nodes.
+        const decorated = { ...node, children: [] };
+        const placetype = state.placetypeMap[node.tag];
+        let resolved = null;
+        if (placetype && state.lookupsRemaining > 0 && node.value.trim().length > 0) {
+            const picked = await this.#lookupAndPick(node, placetype, parentResolved, state);
+            if (picked) {
+                resolved = picked.top;
+                decorateNode(decorated, picked.top, picked.alternatives);
+            }
+        }
+        const carryParent = resolved ?? parentResolved;
+        for (const child of node.children) {
+            decorated.children.push(await this.#walk(child, carryParent, state));
+        }
+        return decorated;
+    }
+    async #lookupAndPick(node, placetype, parentResolved, state) {
+        state.lookupsRemaining--;
+        const query = {
+            text: node.value,
+            placetype,
+            limit: state.candidatesPerLookup,
+        };
+        // Pass the inherited parent constraint to the backend when available — both `parentId` and
+        // `country` are valid narrowing hints depending on what the parent resolved to.
+        if (parentResolved) {
+            if (typeof parentResolved.id === "number")
+                query.parentId = parentResolved.id;
+            if (parentResolved.country)
+                query.country = parentResolved.country;
+        }
+        let candidates;
+        try {
+            candidates = await this.#backend.findPlace(query);
+        }
+        catch {
+            // Defensive: a backend failure should not abort the whole tree walk. Leave the node with
+            // its classifier attribution intact.
+            return null;
+        }
+        if (candidates.length === 0)
+            return null;
+        const top = candidates[0];
+        if (top.score < state.minWinningScore)
+            return null;
+        return { top, alternatives: candidates.slice(1) };
+    }
+}
+/**
+ * Stamp a node with resolver-supplied attribution. Displaces any prior classifier `source` /
+ * `sourceId` into `metadata.classifier_source` / `metadata.classifier_source_id` so debugging tools
+ * can still see who made the original assertion. Surfaces the runner-up candidates on
+ * `alternatives` so callers can disambiguate (Springfield-class failures, [#8 in the failure
+ * catalogue]).
+ */
+function decorateNode(node, resolved, alternatives) {
+    if (node.source !== undefined || node.sourceId !== undefined) {
+        const meta = { ...(node.metadata ?? {}) };
+        if (node.source !== undefined)
+            meta["classifier_source"] = node.source;
+        if (node.sourceId !== undefined)
+            meta["classifier_source_id"] = node.sourceId;
+        node.metadata = meta;
+    }
+    node.source = "resolver";
+    node.sourceId = `${resolved.placetype}:${resolved.id}`;
+    node.lat = resolved.lat;
+    node.lon = resolved.lon;
+    node.placeId = `wof:${resolved.id}`; // v1: only WOF resolvers; the URI scheme stays this simple
+    if (alternatives.length > 0) {
+        node.alternatives = alternatives;
+    }
+}
+//# sourceMappingURL=resolve.js.map

package/out/resolver/resolve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve.js","sourceRoot":"","sources":["../../resolver/resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EACN,qBAAqB,GAMrB,MAAM,YAAY,CAAA;AAEnB;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAwB;IACzD,OAAO,IAAI,WAAW,CAAC,OAAO,CAAC,CAAA;AAChC,CAAC;AASD,MAAM,WAAW;IACP,QAAQ,CAAiB;IAElC,YAAY,OAAwB;QACnC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;IACxB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,IAAiB,EAAE,OAAoB,EAAE;QAC1D,MAAM,KAAK,GAAoB;YAC9B,gBAAgB,EAAE,IAAI,CAAC,UAAU,IAAI,EAAE;YACvC,wFAAwF;YACxF,+DAA+D;YAC/D,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,qBAAqB;YACxD,eAAe,EAAE,IAAI,CAAC,eAAe,IAAI,CAAC;YAC1C,mBAAmB,EAAE,IAAI,CAAC,mBAAmB,IAAI,CAAC;SAClD,CAAA;QAED,MAAM,QAAQ,GAAkB,EAAE,CAAA;QAClC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,QAAQ,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;QACxE,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAA;IAC1C,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAAiB,EAAE,cAAoC,EAAE,KAAsB;QAC1F,2CAA2C;QAC3C,MAAM,SAAS,GAAgB,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;QAExD,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,GAAmB,CAAC,CAAA;QAC9D,IAAI,QAAQ,GAAyB,IAAI,CAAA;QACzC,IAAI,SAAS,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7E,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,KAAK,CAAC,CAAA;YAChF,IAAI,MAAM,EAAE,CAAC;gBACZ,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAA;gBACrB,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,YAAY,CAAC,CAAA;YACzD,CAAC;QACF,CAAC;QAED,MAAM,WAAW,GAAG,QAAQ,IAAI,cAAc,CAAA;QAC9C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAA;QACrE,CAAC;QACD,OAAO,SAAS,CAAA;IACjB,CAAC;IAED,KAAK,CAAC,cAAc,CACnB,IAAiB,EACjB,SAAiB,EACjB,cAAoC,EACpC,KAAsB;QAEtB,KAAK,CAAC,gBAAgB,EAAE,CAAA;QAExB,MAAM,KAAK,GAAgD;YAC1D,IAAI,EAAE,IAAI,CAAC,KAAK;YAChB,SAAS;YACT,KAAK,EAAE,KAAK,CAAC,mBAAmB;SAChC,CAAA;QACD,2FAA2F;QAC3F,gFAAgF;QAChF,IAAI,cAAc,EAAE,CAAC;YACpB,IAAI,OAAO,cAAc,CAAC,EAAE,KAAK,QAAQ;gBAAE,KAAK,CAAC,QAAQ,GAAG,cAAc,CAAC,EAAE,CAAA;YAC7E,IAAI,cAAc,CAAC,OAAO;gBAAE,KAAK,CAAC,OAAO,GAAG,cAAc,CAAC,OAAO,CAAA;QACnE,CAAC;QAED,IAAI,UAA2B,CAAA;QAC/B,IAAI,CAAC;YACJ,UAAU,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAClD,CAAC;QAAC,MAAM,CAAC;YACR,yFAAyF;YACzF,qCAAqC;YACrC,OAAO,IAAI,CAAA;QACZ,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QACxC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAE,CAAA;QAC1B,IAAI,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,eAAe;YAAE,OAAO,IAAI,CAAA;QAClD,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAClD,CAAC;CACD;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,IAAiB,EAAE,QAAuB,EAAE,YAA6B;IAC9F,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC9D,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAA;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,mBAAmB,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QACtE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,sBAAsB,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC7E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;IACrB,CAAC;IACD,IAAI,CAAC,MAAM,GAAG,UAAU,CAAA;IACxB,IAAI,CAAC,QAAQ,GAAG,GAAG,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAA;IACtD,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAA;IACvB,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAA;IACvB,IAAI,CAAC,OAAO,GAAG,OAAO,QAAQ,CAAC,EAAE,EAAE,CAAA,CAAC,2DAA2D;IAC/F,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IACjC,CAAC;AACF,CAAC"}

package/out/resolver/types.d.ts

@@ -0,0 +1,118 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Resolver interface for Phase 4.3 — wires the address-component decoder to a place-id / coordinate
+ *   lookup backend.
+ *
+ *   The interface is deliberately decoupled from any specific resolver implementation. The first
+ *   shipped impl is `@mailwoman/resolver-wof-sqlite`, but the same contract supports a future
+ *   `RemoteResolver` adapter (Phase 4.4 — Pelias / BAN / Nominatim) without a public-API break.
+ *
+ *   See `docs/plan/phases/PHASE_4_3_resolver_integration.md` for the design intent.
+ */
+import type { AddressTree, ComponentTag } from "../decoder/types.js";
+/**
+ * One candidate place returned by a resolver. Mirrors the shape used by
+ * `@mailwoman/resolver-wof-sqlite`'s `PlaceCandidate` — kept structurally compatible so a callsite
+ * holding a `PlaceCandidate` can be passed where a `ResolvedPlace` is expected.
+ */
+export interface ResolvedPlace {
+    /** Resolver-specific place identifier (e.g. WOF id). */
+    id: number | string;
+    /** Canonical name of the place as the resolver knows it. */
+    name: string;
+    /** Resolver's placetype taxonomy label (e.g. WOF's `country` / `region` / `locality`). */
+    placetype: string;
+    /** ISO 3166-1 alpha-2 country code, if known. */
+    country: string;
+    /** Centroid latitude in WGS-84 decimal degrees. */
+    lat: number;
+    /** Centroid longitude in WGS-84 decimal degrees. */
+    lon: number;
+    /** Parent place id within the resolver's hierarchy, if any. */
+    parent_id?: number | string;
+    /**
+     * Resolver-defined ranking score. Higher = better fit for the query. Scale is implementation-
+     * defined; callers should treat as ordinal.
+     */
+    score: number;
+}
+/**
+ * Pull-based contract for a single resolver query. The resolver knows nothing about `AddressTree` —
+ * it just answers "what place is named X, optionally constrained by Y?"
+ *
+ * Structurally compatible with `PlaceLookup` from `@mailwoman/resolver-wof-sqlite` so the latter
+ * satisfies this interface without an adapter shim.
+ */
+export interface ResolverBackend {
+    findPlace(query: {
+        text: string;
+        placetype?: string | string[];
+        country?: string;
+        parentId?: number | string;
+        limit?: number;
+    }): Promise<ResolvedPlace[]>;
+}
+/**
+ * Options for `resolveTree`. All optional with sensible defaults.
+ */
+export interface ResolveOpts {
+    /**
+     * Hard cap on how many backend lookups one tree may issue. Default 10. Prevents a tree with
+     * dozens of candidate nodes from triggering dozens of queries.
+     */
+    maxLookups?: number;
+    /**
+     * Minimum candidate score before resolver attribution wins over the classifier's. Default 0. A
+     * higher threshold makes the resolver more conservative — it leaves more nodes with classifier
+     * provenance. Score scale is implementation-defined; tune per backend.
+     */
+    minWinningScore?: number;
+    /**
+     * Maximum candidates to request from the backend per lookup. Default 5 — we only use the top
+     * candidate after post-scoring, but the backend may benefit from over-fetching for ranking.
+     */
+    candidatesPerLookup?: number;
+    /**
+     * Override the default ComponentTag → resolver-placetype mapping. When set, this map FULLY
+     * REPLACES `DEFAULT_PLACETYPE_MAP` — start from the default by spreading it (`{
+     * ...DEFAULT_PLACETYPE_MAP, ... }`) if you want to extend rather than replace. The fully-
+     * replacing semantics let callers narrow the resolver scope (e.g. drop `locality` if the backend
+     * doesn't ship locality data for the current locale) without awkward `undefined`-as-delete
+     * tricks.
+     */
+    placetypeMap?: PlacetypeMap;
+    /**
+     * Optional locale hint. Currently unused by the v1 resolver but reserved so the contract doesn't
+     * break when locale-aware resolvers land in 4.4+.
+     */
+    locale?: string;
+}
+/**
+ * Mapping from mailwoman's address-component tags to the resolver's placetype taxonomy. Components
+ * not present in the map are NOT queried — the resolver pass leaves their classifier attribution
+ * untouched.
+ *
+ * Phase 4.3 default ships the obvious admin-level mappings; other tags (postcode, street, venue,
+ * dependent_locality, prefecture, etc.) are explicitly omitted because:
+ *
+ * - `postcode` lives in a separate WOF shard (Phase 4.3.x follow-up via the postalcode loader).
+ * - `street` / `house_number` aren't in WOF admin — would need OSM / OpenAddresses gazetteers and
+ *   license diligence (Phase 4.4 candidate).
+ * - Non-US JP-specific tags wait on a different shard entirely.
+ */
+export type PlacetypeMap = Partial<Record<ComponentTag, string>>;
+export declare const DEFAULT_PLACETYPE_MAP: PlacetypeMap;
+/**
+ * The interface implemented by `createWofResolver` and any future resolver factories.
+ *
+ * `resolveTree` returns a NEW `AddressTree` rather than mutating — keeps the input safe to inspect
+ * after the call. The new tree's `roots` are fresh `AddressNode` objects; nodes the resolver didn't
+ * touch are structurally cloned with their classifier attribution preserved.
+ */
+export interface Resolver {
+    resolveTree(tree: AddressTree, opts?: ResolveOpts): Promise<AddressTree>;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../resolver/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAA;AAEpE;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC7B,wDAAwD;IACxD,EAAE,EAAE,MAAM,GAAG,MAAM,CAAA;IACnB,4DAA4D;IAC5D,IAAI,EAAE,MAAM,CAAA;IACZ,0FAA0F;IAC1F,SAAS,EAAE,MAAM,CAAA;IACjB,iDAAiD;IACjD,OAAO,EAAE,MAAM,CAAA;IACf,mDAAmD;IACnD,GAAG,EAAE,MAAM,CAAA;IACX,oDAAoD;IACpD,GAAG,EAAE,MAAM,CAAA;IACX,+DAA+D;IAC/D,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAA;IAC3B;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAA;CACb;AAED;;;;;;GAMG;AACH,MAAM,WAAW,eAAe;IAC/B,SAAS,CAAC,KAAK,EAAE;QAChB,IAAI,EAAE,MAAM,CAAA;QACZ,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;QAC7B,OAAO,CAAC,EAAE,MAAM,CAAA;QAChB,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,CAAA;QAC1B,KAAK,CAAC,EAAE,MAAM,CAAA;KACd,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAA;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAA;IAC5B;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,YAAY,CAAA;IAC3B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;CACf;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAA;AAEhE,eAAO,MAAM,qBAAqB,EAAE,YAUnC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAQ;IACxB,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAAA;CACxE"}

package/out/resolver/types.js

@@ -0,0 +1,26 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Resolver interface for Phase 4.3 — wires the address-component decoder to a place-id / coordinate
+ *   lookup backend.
+ *
+ *   The interface is deliberately decoupled from any specific resolver implementation. The first
+ *   shipped impl is `@mailwoman/resolver-wof-sqlite`, but the same contract supports a future
+ *   `RemoteResolver` adapter (Phase 4.4 — Pelias / BAN / Nominatim) without a public-API break.
+ *
+ *   See `docs/plan/phases/PHASE_4_3_resolver_integration.md` for the design intent.
+ */
+export const DEFAULT_PLACETYPE_MAP = {
+    country: "country",
+    region: "region",
+    locality: "locality",
+    dependent_locality: "locality",
+    subregion: "county",
+    // `postcode` (mailwoman tag) maps to WOF's `postalcode` placetype. Resolves only when the
+    // backend has the postcode shard available — `WofSqlitePlaceLookup` auto-routes `postalcode`
+    // queries to a `postalcode_us` (or similarly-named) shard, falling back to main if absent.
+    postcode: "postalcode",
+};
+//# sourceMappingURL=types.js.map

package/out/resolver/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../resolver/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAmGH,MAAM,CAAC,MAAM,qBAAqB,GAAiB;IAClD,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,QAAQ;IAChB,QAAQ,EAAE,UAAU;IACpB,kBAAkB,EAAE,UAAU;IAC9B,SAAS,EAAE,QAAQ;IACnB,0FAA0F;IAC1F,6FAA6F;IAC7F,2FAA2F;IAC3F,QAAQ,EAAE,YAAY;CACtB,CAAA"}

package/out/resources/git.d.ts

@@ -15,7 +15,7 @@ export interface RepositorySource {
 export declare function prepareRepositoryDirectories({ name, owner }: RepositorySource, localRepoDirectory: PathBuilderLike): Promise<{
     ownerDirectory: PathBuilder<`${string}/${string}`>;
     repoDirectory: PathBuilder<`${string}/${string}/${string}`>;
-    exists: import("fs").Stats | null;
+    exists: import("node:fs").Stats | null;
 }>;
 /**
  * Synchronize a repository source, i.e. clone or pull the repository.

package/out/resources/index.d.ts

@@ -4,7 +4,6 @@
  * @author Teffen Ellis, et al.
  */
 export * from "./collections.js";
-export * from "./db/index.js";
 export * from "./debugging.js";
 export * from "./fs.js";
 export * from "./git.js";

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../resources/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,kBAAkB,CAAA;AAChC,cAAc,eAAe,CAAA;AAC7B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,sBAAsB,CAAA;AACpC,cAAc,sBAAsB,CAAA;AACpC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,UAAU,CAAA;AACxB,cAAc,wBAAwB,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../resources/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,sBAAsB,CAAA;AACpC,cAAc,sBAAsB,CAAA;AACpC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,UAAU,CAAA;AACxB,cAAc,wBAAwB,CAAA"}

package/out/resources/index.js

@@ -4,7 +4,6 @@
  * @author Teffen Ellis, et al.
  */
 export * from "./collections.js";
-export * from "./db/index.js";
 export * from "./debugging.js";
 export * from "./fs.js";
 export * from "./git.js";

package/out/resources/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../resources/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,kBAAkB,CAAA;AAChC,cAAc,eAAe,CAAA;AAC7B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,sBAAsB,CAAA;AACpC,cAAc,sBAAsB,CAAA;AACpC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,UAAU,CAAA;AACxB,cAAc,wBAAwB,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../resources/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,sBAAsB,CAAA;AACpC,cAAc,sBAAsB,CAAA;AACpC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,UAAU,CAAA;AACxB,cAAc,wBAAwB,CAAA"}

package/out/resources/whosonfirst/DataSourceCache.d.ts

@@ -3,7 +3,6 @@
  * @license AGPL-3.0
  * @author Teffen Ellis, et al.
  */
-import "core-js/actual/disposable-stack/index.js";
 import { PlacetypeDataSource, type PlacetypeDataSourceOptions } from "./PlacetypeDataSource.js";
 export declare class DataSourceCache extends DisposableStack {
     #private;

package/out/resources/whosonfirst/DataSourceCache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DataSourceCache.d.ts","sourceRoot":"","sources":["../../../resources/whosonfirst/DataSourceCache.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,0CAA0C,CAAA;AAMjD,OAAO,EAAE,mBAAmB,EAAE,KAAK,0BAA0B,EAAE,MAAM,0BAA0B,CAAA;AAG/F,qBAAa,eAAgB,SAAQ,eAAe;;IAGnC,CAAC,MAAM,CAAC,WAAW,CAAC,SAAoB;IAExC,CAAC,MAAM,CAAC,OAAO,CAAC;IAMzB,IAAI,CAAC,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,EAAE,0BAA0B,GAAG,mBAAmB;CAsBxG;AAED;;GAEG;AACH,wBAAsB,cAAc,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAkBvF"}
+{"version":3,"file":"DataSourceCache.d.ts","sourceRoot":"","sources":["../../../resources/whosonfirst/DataSourceCache.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,OAAO,EAAE,mBAAmB,EAAE,KAAK,0BAA0B,EAAE,MAAM,0BAA0B,CAAA;AAG/F,qBAAa,eAAgB,SAAQ,eAAe;;IAGnC,CAAC,MAAM,CAAC,WAAW,CAAC,SAAoB;IAExC,CAAC,MAAM,CAAC,OAAO,CAAC;IAMzB,IAAI,CAAC,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,EAAE,0BAA0B,GAAG,mBAAmB;CAsBxG;AAED;;GAEG;AACH,wBAAsB,cAAc,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAkBvF"}

package/out/resources/whosonfirst/DataSourceCache.js

@@ -3,7 +3,6 @@
  * @license AGPL-3.0
  * @author Teffen Ellis, et al.
  */
-import "core-js/actual/disposable-stack/index.js";
 import { mkdirSync } from "node:fs";
 import { setTimeout } from "node:timers/promises";
 import { dirname } from "path-ts";