@mailwoman/match 10.0.0 → 10.1.0

package/lib/fellegi-sunter.ts

@@ -5,9 +5,9 @@
  *
  *   The Fellegi-Sunter scorer — the matcher's decision layer.
  *
- *   Each field comparison lands a record pair in a discrete _agreement level_ (exact / high / low /
- *   different / missing). Each level carries two probabilities: `m` = P(this level | the pair
- *   really matches) and `u` = P(this level | it doesn't). Their ratio is a Bayes factor, and its
+ *   Each field comparison assigns a record pair to an _agreement level_: exact, high, low, different, or missing.
+ *   Each level has two probabilities. `m` is P(this level | the pair really matches).
+ *   `u` is P(this level | the pair does not match). Their ratio is a Bayes factor. Its
  *   log is the level's contribution to the total match weight in bits:
  *
  *   ```
@@ -16,13 +16,12 @@
  *
  *   — a prior (how likely any two random records match) plus an additive, per-field-attributable
  *   stack of evidence. Convert `M` to a probability and threshold it: above the upper bound is a
- *   link, below the lower bound a non-link, and the band between is _clerical review_ — the
- *   calibrated abstain zone the whole design leans on.
+ *   link. Below the lower bound, it is a non-link. The band between them is _clerical review_, the calibrated abstain zone.
  *
- *   The `m`/`u` numbers here are NOT universal constants. They are estimated from the data — by EM,
+ *   The `m`/`u` numbers here are not universal constants. They are estimated from the data — by EM,
  *   unsupervised (the next increment) — and the term-frequency adjustment that makes a rare-name
  *   agreement count more than a common one layers on top. This module is the deterministic core
- *   those build on: given the levels, it produces the weights, the probability, and the decision.
+ *   those build on. Given the levels, it produces the weights and probability. It also produces the decision.
  */
 
 import { nameSimilarity } from "#comparators"
@@ -40,7 +39,7 @@ export interface ComparisonLevel {
 	 */
 	m: number
 	/**
-	 * P(a pair lands in this level | it is NOT a match). A measure of coincidence / cardinality.
+	 * P(a pair lands in this level | it is not a match). A measure of coincidence / cardinality.
 	 */
 	u: number
 	/**
@@ -70,22 +69,30 @@ export interface Comparison<R> {
 	 */
 	assess(a: R, b: R): number
 	/**
-	 * Optional term-frequency adjustment: on the levels it names, replace the level's average `u` with the agreeing
-	 * value's actual frequency, so agreement on a rare value (`Vijayan`) outweighs agreement on a common one (`Smith`).
+	 * Optional term-frequency adjustment: on the levels it names, replace the level's
+	 * average `u` with the agreeing value's actual frequency, so agreement on a rare
+	 * value (`Vijayan`) outweighs agreement on a common one (`Smith`).
+	 *
 	 * See `withTermFrequency`.
 	 */
 	termFrequency?: TermFrequencyAdjustment<R>
 }
 
 /**
- * Per-value term-frequency adjustment for a comparison (the Splink/Winkler mechanism). `m` is unchanged; on an
- * agreement level the effective `u` becomes the value's own frequency, adding `log2(u_level / frequency)` to the weight
- * — large and positive for rare values, negative for common ones. Floored at
- * {@link TermFrequencyAdjustment.minimumFrequency} so an ultra-rare value can't produce an unbounded boost.
+ * Per-value term-frequency adjustment for a comparison (the Splink/Winkler mechanism).
+ *
+ * `m` is unchanged.
+ * On an agreement level the effective `u` becomes the value's own frequency, adding
+ * `log2(u_level / frequency)` to the weight — large and positive for rare values, negative for common ones.
+ *
+ * Floored at {@link TermFrequencyAdjustment.minimumFrequency} so an ultra-rare
+ * value can't produce an unbounded boost.
  */
 export interface TermFrequencyAdjustment<R> {
 	/**
-	 * Relative frequency of a value in the data, in (0, 1]. Typically computed on-the-fly.
+	 * Relative frequency of a value in the data, in (0, 1].
+	 *
+	 * Typically computed on-the-fly.
 	 */
 	frequency(value: string): number
 	/**
@@ -97,11 +104,15 @@ export interface TermFrequencyAdjustment<R> {
 	 */
 	value(a: R, b: R): string | null | undefined
 	/**
-	 * Scale the adjustment in [0, 1]. Default 1.
+	 * Scale the adjustment in [0, 1].
+	 *
+	 * Default 1.
 	 */
 	weight?: number
 	/**
-	 * Floor for the looked-up frequency, bounding the boost on ultra-rare values. Default 1e-4.
+	 * Floor for the looked-up frequency, bounding the boost on ultra-rare values.
+	 *
+	 * Default 1e-4.
 	 */
 	minimumFrequency?: number
 }
@@ -168,8 +179,11 @@ export function probabilityFromWeight(weight: number): number {
 }
 
 /**
- * A comparison driven by a similarity function and a tier of `minSimilarity` thresholds (the StatCan/Splink recipe).
- * Levels must be ordered highest → lowest similarity, the last acting as the `different` catch-all (`minSimilarity` 0).
+ * A comparison driven by a similarity function and a tier of `minSimilarity`
+ * thresholds (the StatCan/Splink recipe).
+ *
+ * Levels must be ordered highest → lowest similarity, the last acting as the
+ * `different` catch-all (`minSimilarity` 0).
  * A missing value on either side yields no evidence.
  */
 export function similarityComparison<R>(config: {
@@ -204,7 +218,8 @@ export function similarityComparison<R>(config: {
 }
 
 /**
- * Score a record pair: total match weight, probability, and the per-field contributions.
+ * Scores a record pair and returns its total match weight and probability.
+ * The result also includes per-field contributions.
  */
 export function scorePair<R>(model: FellegiSunterModel<R>, a: R, b: R): PairScore {
 	let weight = priorWeight(model.lambda)
@@ -245,8 +260,10 @@ export function scorePair<R>(model: FellegiSunterModel<R>, a: R, b: R): PairScor
 }
 
 /**
- * Classify a score against upper / lower match-weight thresholds (in bits): at or above `upper` is a link, at or below
- * `lower` a non-link, and the band between is clerical review (abstain).
+ * Classify a score against upper / lower match-weight thresholds (in bits): at or above `upper` is a link.
+ *
+ * A score at or below `lower` is a non-link.
+ * The band between them means clerical review (abstain).
  */
 export function decide(score: PairScore, thresholds: { upper: number; lower: number }): MatchDecision {
 	if (score.weight >= thresholds.upper) return "match"

package/lib/gbt.ts

@@ -2,30 +2,10 @@
  * @copyright Sister Software
  * @license AGPL-3.0
  * @author Teffen Ellis, et al.
- *
- *   Gradient-boosted shallow regression trees (logistic loss), pure-Node — the learned scorer #603
- *   names: an offline-trained model (this trainer, or XGBoost/LightGBM exported to the same
- *   {@link GBT} shape) plus a trivial evaluator, no new runtime dependency. It sits behind the
- *   matcher's `scorer` hook to replace the Fellegi-Sunter link weight where labels (or a held-out
- *   truth like an NPI) let a tree learn the over-merge signature the hand-weights miss.
- *
- *   This module is feature-agnostic: feature vectors are caller-defined `number[]` (the record
- *   matcher builds them in `@mailwoman/registry`'s learned-scorer module — one-hot agreement
- *   levels
- *
- *   - Interaction terms + corpus statistics). It only fits ({@link trainGBT}) and scores
- *       ({@link gbtScore}). The trained {@link GBT} is plain JSON (`{trees, lr, base}`), so a model
- *       trains offline once and ships as a data file.
  */
 
-/**
- * Distinct values at or below which every split point is tried exactly rather than by quantile.
- */
 const MAX_EXACT_SPLIT_VALUES = 5
 
-/**
- * Quantile split points evaluated for a continuous feature.
- */
 const QUANTILE_SPLIT_COUNT = 6
 
 /**
@@ -33,11 +13,12 @@ const QUANTILE_SPLIT_COUNT = 6
  */
 export type TreeNode = { leaf: number } | { f: number; thr: number; lo: TreeNode; hi: TreeNode }
 
-// Local by design: `@mailwoman/registry`'s tools/shared.ts exports this sigmoid; registry depends on match, not the reverse.
 const sigmoid = (z: number): number => 1 / (1 + Math.exp(-Math.max(-30, Math.min(30, z))))
 
 /**
- * Per-feature candidate split thresholds: midpoints for few-valued/binary features, quantiles for continuous.
+ * Returns each feature's candidate split thresholds: midpoints between values
+ * for features with at most five distinct values.
+ * It returns six quantiles otherwise.
  */
 export function buildThresholds(X: number[][]): number[][] {
 	const dim = X[0]?.length ?? 0
@@ -72,9 +53,6 @@ export function buildThresholds(X: number[][]): number[][] {
 	return out
 }
 
-/**
- * Weighted SSE of target `g` over `rows` around their weighted mean.
- */
 function nodeSSE(rows: number[], g: number[], w: number[]): number {
 	let wsum = 0
 	let wg = 0
@@ -95,9 +73,6 @@ function nodeSSE(rows: number[], g: number[], w: number[]): number {
 	return sse
 }
 
-/**
- * Greedy depth-limited weighted regression tree on target `g` (the boosting residual).
- */
 function fitRegTree(
 	rows: number[],
 	X: number[][],
@@ -168,7 +143,7 @@ function predictTree(t: TreeNode, x: number[]): number {
 }
 
 /**
- * A trained gradient-boosted-tree model: an additive ensemble over a base log-odds. Plain JSON.
+ * A trained gradient-boosted tree ensemble whose trees add to a base log-odds, stored as plain JSON.
  */
 export interface GBT {
 	trees: TreeNode[]
@@ -204,7 +179,7 @@ export function trainGBT(X: number[][], y: number[], w: number[], opts: GBTOpts)
 		}
 	}
 
-	const base = Math.log((wpos + 1) / (wtot - wpos + 1)) // weighted base log-odds
+	const base = Math.log((wpos + 1) / (wtot - wpos + 1))
 	const F = new Array<number>(N).fill(base)
 	const trees: TreeNode[] = []
 
@@ -215,7 +190,6 @@ export function trainGBT(X: number[][], y: number[], w: number[], opts: GBTOpts)
 			g[i] = y[i]! - sigmoid(F[i]!)
 		}
 
-		// negative gradient of logistic loss
 		const tree = fitRegTree(rowsAll, X, g, w, thresholds, opts.depth, opts.minLeaf)
 
 		for (let i = 0; i < N; i++) {
@@ -229,7 +203,9 @@ export function trainGBT(X: number[][], y: number[], w: number[], opts: GBTOpts)
 }
 
 /**
- * GBT score (logit) for one feature vector. Threshold-comparable like the FS weight.
+ * Returns the model's logit for one feature vector.
+ *
+ * Compare it against a threshold like a Fellegi-Sunter match weight.
  */
 export function gbtScore(m: GBT, x: number[]): number {
 	let f = m.base

package/lib/tf.ts

@@ -5,15 +5,15 @@
  *
  *   Term-frequency adjustment — making a rare-value agreement count more than a common one.
  *
- *   Two people both named "Vijayan" is far stronger evidence of a match than two both named "Smith",
+ *   Two people who share the name "Vijayan" are far stronger evidence of a match than two who share the name "Smith",
  *   because "Smith" agreements happen by chance all the time and "Vijayan" agreements don't. The
- *   Fellegi-Sunter `m` (how often a true match agrees) is roughly the same either way; what differs
+ *   Fellegi-Sunter `m` (how often a true match agrees) is roughly the same either way. what differs
  *   is `u` — the chance a _non_-match agrees — which for an exact agreement on value `v` is just
  *   how common `v` is. So we leave `m`, and replace the level's average `u` with `frequency(v)`,
  *   adding `log2(u_level / frequency(v))` to the weight: a big positive bump for rare values, a
  *   penalty for common ones.
  *
- *   Crucially for a label-free matcher: the frequencies are computed ON-THE-FLY from the input column
+ *   Crucially for a label-free matcher: the frequencies are computed on-the-FLY from the input column
  *   (the Splink approach) — no external Census table required. Build a {@link TermFrequencyTable}
  *   from the values you're matching, then attach it to a comparison with {@link withTermFrequency}.
  */
@@ -38,13 +38,15 @@ export interface TermFrequencyTable {
 	readonly distinct: number
 }
 
-// Local by design: `@mailwoman/record`'s per-field normalizers are the shared home; match takes no record dependency.
+// Local by design: `@mailwoman/record`'s per-field normalizers are the shared home.
+// Match takes no record dependency.
 const defaultNormalize = (value: string): string => value.trim().toLowerCase().replaceAll(/\s+/g, " ")
 
 /**
- * Build a {@link TermFrequencyTable} from an iterable of values (e.g. every `given` name in the dataset). Values are
- * normalized (default: trim + lowercase + collapse whitespace) before counting, and `frequency()` normalizes its
- * argument the same way, so callers pass raw field values.
+ * Build a {@link TermFrequencyTable} from an iterable of values (e.g. Every `given` name in the dataset).
+ *
+ * Values are normalized (default: trim + lowercase + collapse whitespace) before counting.
+ * `frequency()` normalizes its argument the same way, so callers pass raw field values.
  */
 export function buildTermFrequencyTable(
 	values: Iterable<string | null | undefined>,
@@ -76,10 +78,14 @@ export function buildTermFrequencyTable(
 }
 
 /**
- * Attach a term-frequency adjustment to a comparison. By default it applies to the exact level (index 0) and looks up
- * the value via `value(a, b)` — usually the agreeing field extracted from one side. Returns a new comparison; the
- * underlying `assess` and levels are untouched, so this composes with EM (which re-estimates the base `m`/`u` the
- * adjustment sits on top of).
+ * Attach a term-frequency adjustment to a comparison.
+ *
+ * By default it applies to the exact level (index 0) and looks up the value via
+ * `value(a, b)` — usually the agreeing field extracted from one side.
+ * Returns a new comparison.
+ *
+ * The underlying `assess` and levels are untouched, so this composes with EM
+ * (which re-estimates the base `m`/`u` the adjustment sits on top of).
  */
 export function withTermFrequency<R>(
 	comparison: Comparison<R>,
@@ -87,15 +93,21 @@ export function withTermFrequency<R>(
 		table: TermFrequencyTable
 		value: (a: R, b: R) => string | null | undefined
 		/**
-		 * Level indices to adjust. Default `[0]` (the exact level).
+		 * Level indices to adjust.
+		 *
+		 * Default `[0]` (the exact level).
 		 */
 		levels?: Iterable<number>
 		/**
-		 * Scale in [0, 1]. Default 1.
+		 * Scale in [0, 1].
+		 *
+		 * Default 1.
 		 */
 		weight?: number
 		/**
-		 * Frequency floor bounding the boost on ultra-rare values. Default 1e-4.
+		 * Frequency floor bounding the boost on ultra-rare values.
+		 *
+		 * Default 1e-4.
 		 */
 		minimumFrequency?: number
 	}

package/out/blocking.d.ts

@@ -3,58 +3,62 @@
  * @license AGPL-3.0
  * @author Teffen Ellis, et al.
  *
- *   Blocking — candidate generation. Comparing every pair is O(n²) (a million records is a trillion
- *   comparisons), so we only score pairs that share a cheap key. This is where the geocode-first
+ *   The blocking stage generates candidate pairs. An all-pairs comparison is O(n²): a million records require a trillion
+ *   comparisons. This stage scores pairs that share a cheap key. This is where the geocode-first
  *   bet pays off: two records resolving to the same place land in the same spatial cell regardless
  *   of how their address strings are spelled, so geography is the primary block.
  *
- *   A {@link BlockingKey} maps a record to zero or more string keys; records sharing any key become
+ *   A {@link BlockingKey} maps a record to zero or more string keys. records sharing any key become
  *   candidates. Keys compose as a _union_ (the standard multi-pass approach — high recall from
- *   cheap rules): block on the spatial cell OR the canonical key OR the postcode, and a pair that
- *   any rule catches is scored. {@link conjunction} builds the AND-style key Geo-ER uses (`name-cell
- *   AND geo-cell`) when a single rule is too loose.
+ *   cheap rules): block on the spatial cell, canonical key, or postcode. A pair caught by
+ *   any rule is scored. {@link conjunction} builds the and-style key Geo-ER uses
+ *   (`name-cell and geo-cell`) when a single rule is too loose.
  *
- *   Recall is the priority — a pair the blocker never proposes can never match, the most dangerous
- *   silent failure in record linkage. So the spatial grid is generous and neighbour-expanded by
- *   default, and any block too large to scan is _reported_, never silently dropped.
+ *   Recall is the priority. A pair the blocker never proposes can never match, the most dangerous
+ *   silent failure in record linkage. The spatial grid is generous and neighbor-expanded by
+ *   default. The code reports any block too large to scan instead of dropping it silently.
  */
+import type { GeoCoordinate } from "@mailwoman/spatial";
 /**
- * Maps a record to zero or more block keys. Two records sharing any key become a candidate pair.
+ * Maps a record to zero or more block keys.
+ *
+ * Two records sharing any key become a candidate pair.
  */
 export type BlockingKey<R> = (record: R) => string[];
 /**
- * A geographic coordinate (WGS84 decimal degrees).
- */
-export interface LatLon {
-    latitude: number;
-    longitude: number;
-}
-/**
- * A spatial-cell block key: a configurable lat/lon grid. `precisionDegrees` sets the cell size (default 0.05° ≈ 5.5 km
- * of latitude — deliberately generous, per the literature, so same-place records reliably co-block). With `neighbors`
- * (default `true`) a record also keys its 8 adjacent cells, so a pair straddling a cell boundary still meets.
+ * A spatial-cell block key: a configurable lat/lon grid.
  *
- * Note: an equal-_degree_ grid (longitude cells shrink toward the poles) and neighbour expansion inflates block sizes
- * ~9×; an equal-area H3/geohash index with a single-cell + neighbour-query is the refinement. Behaviour — proximity
- * co-blocking — is the same.
+ * `precisionDegrees` sets the cell size (default 0.05° ≈ 5.5 km of latitude —
+ * deliberately generous, per the literature, so same-place records reliably co-block).
+ * With `neighbors` (default `true`) a record also keys its 8 adjacent cells,
+ * so a pair straddling a cell boundary still meets.
+ *
+ * Note: an equal-_degree_ grid (longitude cells shrink toward the poles)
+ * and neighbor expansion inflates block sizes ~9×; an equal-area H3/geohash index
+ * with a single-cell + neighbor-query is the refinement.
+ * Behavior — proximity co-blocking — is the same.
  */
-export declare function geoCellKey<R>(extract: (record: R) => LatLon | null | undefined, opts?: {
+export declare function geoCellKey<R>(extract: (record: R) => GeoCoordinate | null | undefined, opts?: {
     precisionDegrees?: number;
     neighbors?: boolean;
 }): BlockingKey<R>;
 /**
- * An exact-value block key (the canonical address key, a postcode, an email domain…), normalized and optionally
- * truncated to a leading `prefix` of characters (a cheaper, higher-recall rule). A missing or empty value produces no
- * key.
+ * An exact-value block key (the canonical address key, a postcode, an email domain…), normalized
+ * and optionally truncated to a leading `prefix` of characters (a cheaper, higher-recall rule).
+ *
+ * A missing or empty value produces no key.
  */
 export declare function exactKey<R>(extract: (record: R) => string | null | undefined, opts?: {
     prefix?: number;
     normalize?: (value: string) => string;
 }): BlockingKey<R>;
 /**
- * A conjunctive block key — the cross-product of its sub-keys, joined (Geo-ER's "name AND distance"). A record is keyed
- * by every combination of one sub-key from each input, so two records co-block only when they agree on _all_ inputs.
- * Tighter blocks, lower recall — use when a single rule is too loose.
+ * A conjunctive block key — the cross-product of its sub-keys, joined (Geo-ER's "name and distance").
+ *
+ * A record is keyed by every combination of one sub-key from each input,
+ * so two records co-block only when they agree on _all_ inputs.
+ * Tighter blocks, lower recall.
+ * Use when a single rule is too loose.
  */
 export declare function conjunction<R>(...keys: BlockingKey<R>[]): BlockingKey<R>;
 /**
@@ -62,7 +66,7 @@ export declare function conjunction<R>(...keys: BlockingKey<R>[]): BlockingKey<R
  */
 export interface BlockResult<R> {
     /**
-     * Deduplicated candidate pairs (no self-pairs; a pair caught by multiple keys appears once).
+     * Deduplicated candidate pairs (no self-pairs. A pair caught by multiple keys appears once).
      */
     pairs: Array<[R, R]>;
     /**
@@ -74,10 +78,11 @@ export interface BlockResult<R> {
     }>;
 }
 /**
- * Generate candidate pairs from `records` via one or more blocking keys (their union). Builds an inverted index (key →
- * records) and emits the unique within-block pairs. A block larger than `maxBlockSize` is skipped and reported in
- * `droppedBlocks` rather than blowing up into a quadratic scan — an explicit, visible coverage limit, not a silent
- * drop.
+ * Generate candidate pairs from `records` via one or more blocking keys (their union).
+ *
+ * Builds an inverted index (key → records) and emits the unique within-block pairs.
+ * A block larger than `maxBlockSize` is skipped and reported in `droppedBlocks` rather than blowing
+ * up into a quadratic scan — an explicit, visible coverage limit rather than a silent drop.
  */
 export declare function block<R>(records: readonly R[], blockingKeys: BlockingKey<R> | BlockingKey<R>[], opts?: {
     maxBlockSize?: number;

package/out/blocking.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"blocking.d.ts","sourceRoot":"","sources":["../lib/blocking.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH;;GAEG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,EAAE,CAAA;AAEpD;;GAEG;AACH,MAAM,WAAW,MAAM;IACtB,QAAQ,EAAE,MAAM,CAAA;IAChB,SAAS,EAAE,MAAM,CAAA;CACjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC3B,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,GAAG,IAAI,GAAG,SAAS,EACjD,IAAI,GAAE;IAAE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC3D,WAAW,CAAC,CAAC,CAAC,CAwBhB;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,GAAG,IAAI,GAAG,SAAS,EACjD,IAAI,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAA;CAAO,GACnE,WAAW,CAAC,CAAC,CAAC,CAahB;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAaxE;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC;IAC7B;;OAEG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACpB;;OAEG;IACH,aAAa,EAAE,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACnD;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACtB,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAC/C,IAAI,GAAE;IAAE,YAAY,CAAC,EAAE,MAAM,CAAA;CAAO,GAClC,WAAW,CAAC,CAAC,CAAC,CAmDhB"}
+{"version":3,"file":"blocking.d.ts","sourceRoot":"","sources":["../lib/blocking.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AAEvD;;;;GAIG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,EAAE,CAAA;AAEpD;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC3B,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,aAAa,GAAG,IAAI,GAAG,SAAS,EACxD,IAAI,GAAE;IAAE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC3D,WAAW,CAAC,CAAC,CAAC,CAwBhB;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,GAAG,IAAI,GAAG,SAAS,EACjD,IAAI,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAA;CAAO,GACnE,WAAW,CAAC,CAAC,CAAC,CAahB;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAaxE;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC;IAC7B;;OAEG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACpB;;OAEG;IACH,aAAa,EAAE,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACnD;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACtB,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAC/C,IAAI,GAAE;IAAE,YAAY,CAAC,EAAE,MAAM,CAAA;CAAO,GAClC,WAAW,CAAC,CAAC,CAAC,CAmDhB"}

package/out/blocking.js

@@ -3,29 +3,33 @@
  * @license AGPL-3.0
  * @author Teffen Ellis, et al.
  *
- *   Blocking — candidate generation. Comparing every pair is O(n²) (a million records is a trillion
- *   comparisons), so we only score pairs that share a cheap key. This is where the geocode-first
+ *   The blocking stage generates candidate pairs. An all-pairs comparison is O(n²): a million records require a trillion
+ *   comparisons. This stage scores pairs that share a cheap key. This is where the geocode-first
  *   bet pays off: two records resolving to the same place land in the same spatial cell regardless
  *   of how their address strings are spelled, so geography is the primary block.
  *
- *   A {@link BlockingKey} maps a record to zero or more string keys; records sharing any key become
+ *   A {@link BlockingKey} maps a record to zero or more string keys. records sharing any key become
  *   candidates. Keys compose as a _union_ (the standard multi-pass approach — high recall from
- *   cheap rules): block on the spatial cell OR the canonical key OR the postcode, and a pair that
- *   any rule catches is scored. {@link conjunction} builds the AND-style key Geo-ER uses (`name-cell
- *   AND geo-cell`) when a single rule is too loose.
+ *   cheap rules): block on the spatial cell, canonical key, or postcode. A pair caught by
+ *   any rule is scored. {@link conjunction} builds the and-style key Geo-ER uses
+ *   (`name-cell and geo-cell`) when a single rule is too loose.
  *
- *   Recall is the priority — a pair the blocker never proposes can never match, the most dangerous
- *   silent failure in record linkage. So the spatial grid is generous and neighbour-expanded by
- *   default, and any block too large to scan is _reported_, never silently dropped.
+ *   Recall is the priority. A pair the blocker never proposes can never match, the most dangerous
+ *   silent failure in record linkage. The spatial grid is generous and neighbor-expanded by
+ *   default. The code reports any block too large to scan instead of dropping it silently.
  */
 /**
- * A spatial-cell block key: a configurable lat/lon grid. `precisionDegrees` sets the cell size (default 0.05° ≈ 5.5 km
- * of latitude — deliberately generous, per the literature, so same-place records reliably co-block). With `neighbors`
- * (default `true`) a record also keys its 8 adjacent cells, so a pair straddling a cell boundary still meets.
+ * A spatial-cell block key: a configurable lat/lon grid.
  *
- * Note: an equal-_degree_ grid (longitude cells shrink toward the poles) and neighbour expansion inflates block sizes
- * ~9×; an equal-area H3/geohash index with a single-cell + neighbour-query is the refinement. Behaviour — proximity
- * co-blocking — is the same.
+ * `precisionDegrees` sets the cell size (default 0.05° ≈ 5.5 km of latitude —
+ * deliberately generous, per the literature, so same-place records reliably co-block).
+ * With `neighbors` (default `true`) a record also keys its 8 adjacent cells,
+ * so a pair straddling a cell boundary still meets.
+ *
+ * Note: an equal-_degree_ grid (longitude cells shrink toward the poles)
+ * and neighbor expansion inflates block sizes ~9×; an equal-area H3/geohash index
+ * with a single-cell + neighbor-query is the refinement.
+ * Behavior — proximity co-blocking — is the same.
  */
 export function geoCellKey(extract, opts = {}) {
     const step = opts.precisionDegrees ?? 0.05;
@@ -48,9 +52,10 @@ export function geoCellKey(extract, opts = {}) {
     };
 }
 /**
- * An exact-value block key (the canonical address key, a postcode, an email domain…), normalized and optionally
- * truncated to a leading `prefix` of characters (a cheaper, higher-recall rule). A missing or empty value produces no
- * key.
+ * An exact-value block key (the canonical address key, a postcode, an email domain…), normalized
+ * and optionally truncated to a leading `prefix` of characters (a cheaper, higher-recall rule).
+ *
+ * A missing or empty value produces no key.
  */
 export function exactKey(extract, opts = {}) {
     const normalize = opts.normalize ?? ((v) => v.trim().toLowerCase().replaceAll(/\s+/g, " "));
@@ -65,9 +70,12 @@ export function exactKey(extract, opts = {}) {
     };
 }
 /**
- * A conjunctive block key — the cross-product of its sub-keys, joined (Geo-ER's "name AND distance"). A record is keyed
- * by every combination of one sub-key from each input, so two records co-block only when they agree on _all_ inputs.
- * Tighter blocks, lower recall — use when a single rule is too loose.
+ * A conjunctive block key — the cross-product of its sub-keys, joined (Geo-ER's "name and distance").
+ *
+ * A record is keyed by every combination of one sub-key from each input,
+ * so two records co-block only when they agree on _all_ inputs.
+ * Tighter blocks, lower recall.
+ * Use when a single rule is too loose.
  */
 export function conjunction(...keys) {
     return (record) => {
@@ -82,10 +90,11 @@ export function conjunction(...keys) {
     };
 }
 /**
- * Generate candidate pairs from `records` via one or more blocking keys (their union). Builds an inverted index (key →
- * records) and emits the unique within-block pairs. A block larger than `maxBlockSize` is skipped and reported in
- * `droppedBlocks` rather than blowing up into a quadratic scan — an explicit, visible coverage limit, not a silent
- * drop.
+ * Generate candidate pairs from `records` via one or more blocking keys (their union).
+ *
+ * Builds an inverted index (key → records) and emits the unique within-block pairs.
+ * A block larger than `maxBlockSize` is skipped and reported in `droppedBlocks` rather than blowing
+ * up into a quadratic scan — an explicit, visible coverage limit rather than a silent drop.
  */
 export function block(records, blockingKeys, opts = {}) {
     const keys = Array.isArray(blockingKeys) ? blockingKeys : [blockingKeys];

package/out/blocking.js.map

@@ -1 +1 @@
-{"version":3,"file":"blocking.js","sourceRoot":"","sources":["../lib/blocking.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAeH;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CACzB,OAAiD,EACjD,IAAI,GAAuD,EAAE;IAE7D,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAA;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAA;IAErC,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;QAElC,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,CAAA;QAE7G,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAA;QACtD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,GAAG,IAAI,CAAC,CAAA;QAEvD,IAAI,CAAC,MAAM;YAAE,OAAO,CAAC,GAAG,OAAO,IAAI,OAAO,EAAE,CAAC,CAAA;QAE7C,MAAM,IAAI,GAAa,EAAE,CAAA;QAEzB,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,EAAE,CAAC,CAAA;YACjD,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC,CAAA;AACF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CACvB,OAAiD,EACjD,IAAI,GAA+D,EAAE;IAErE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;IAEnG,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;QAE7B,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAA;QACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;QAEnC,IAAI,CAAC,UAAU;YAAE,OAAO,EAAE,CAAA;QAE1B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;IACrE,CAAC,CAAA;AACF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAI,GAAG,IAAsB;IACvD,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;QAEjB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;YAEzB,IAAI,CAAC,KAAK,CAAC,MAAM;gBAAE,OAAO,EAAE,CAAA;YAC5B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChG,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC,CAAA;AACF,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CACpB,OAAqB,EACrB,YAA+C,EAC/C,IAAI,GAA8B,EAAE;IAEpC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;IACxE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAA;IAClD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAA;IAEzC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAE9B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBACnC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBAE7B,IAAI,MAAM,EAAE,CAAC;oBACZ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACf,CAAC;qBAAM,CAAC;oBACP,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBACpB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC,CAAC,CAAA;IAEF,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,aAAa,GAAoC,EAAE,CAAA;IAEzD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAE/B,IAAI,MAAM,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YAClC,aAAa,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;YAEhD,SAAQ;QACT,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBAC3C,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAA;gBAEtB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,EAAE,CAAE,CAAC,CAAC,CAAA;YACzC,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,CAAA;AAChC,CAAC"}
+{"version":3,"file":"blocking.js","sourceRoot":"","sources":["../lib/blocking.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAWH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CACzB,OAAwD,EACxD,IAAI,GAAuD,EAAE;IAE7D,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAA;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAA;IAErC,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;QAElC,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,CAAA;QAE7G,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAA;QACtD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,GAAG,IAAI,CAAC,CAAA;QAEvD,IAAI,CAAC,MAAM;YAAE,OAAO,CAAC,GAAG,OAAO,IAAI,OAAO,EAAE,CAAC,CAAA;QAE7C,MAAM,IAAI,GAAa,EAAE,CAAA;QAEzB,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,EAAE,CAAC,CAAA;YACjD,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC,CAAA;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CACvB,OAAiD,EACjD,IAAI,GAA+D,EAAE;IAErE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;IAEnG,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;QAE7B,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAA;QACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;QAEnC,IAAI,CAAC,UAAU;YAAE,OAAO,EAAE,CAAA;QAE1B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;IACrE,CAAC,CAAA;AACF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAI,GAAG,IAAsB;IACvD,OAAO,CAAC,MAAM,EAAE,EAAE;QACjB,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;QAEjB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;YAEzB,IAAI,CAAC,KAAK,CAAC,MAAM;gBAAE,OAAO,EAAE,CAAA;YAC5B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChG,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC,CAAA;AACF,CAAC;AAgBD;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CACpB,OAAqB,EACrB,YAA+C,EAC/C,IAAI,GAA8B,EAAE;IAEpC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;IACxE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAA;IAClD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAA;IAEzC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAE9B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBACnC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBAE7B,IAAI,MAAM,EAAE,CAAC;oBACZ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACf,CAAC;qBAAM,CAAC;oBACP,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBACpB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC,CAAC,CAAA;IAEF,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,aAAa,GAAoC,EAAE,CAAA;IAEzD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAE/B,IAAI,MAAM,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YAClC,aAAa,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;YAEhD,SAAQ;QACT,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBAC3C,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAA;gBAEtB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,EAAE,CAAE,CAAC,CAAC,CAAA;YACzC,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,CAAA;AAChC,CAAC"}