@finbheara/names 0.12.0 → 0.14.0

package/dist/chunks/{index-vqbvesky.js → index-kw69ry3j.js}

@@ -19,7 +19,7 @@ import {
   commaReading2,
   levelOf2,
   defaultPersonNameFactory2
-} from "./index-yf904dam.js";
+} from "./index-ka8nzreg.js";
 import {
   isTeamPrint2
 } from "./index-0phgwy52.js";
@@ -88,29 +88,93 @@ var given_diminutives_default = {
     "THE ONE GIVEN-NAME DIMINUTIVE TABLE. Read by `given-diminutives.ts` in this directory; a consumer in",
     "another language reads this file rather than keeping a copy. Keys and forms are NN3 upper case,",
     "letters only.",
-    "`families`: root -> the surface forms that reduce to it. ORDER MATTERS: the first root a form appears",
-    "under wins (`KIT` is CATHERINE's).",
-    "`notAtGate`: forms read as one family for a comparison level BELOW exact, but which",
-    "are names in their own right, translations, or another gender's name. An identity gate must never",
-    "equate a pair through one of these: `Megan` is not `Margaret`, `Sean` is",
-    "not `John`, `Michelle` is not `Michael`. A form belongs here when two different people plausibly carry",
-    "the two names."
+    "`variants`: one name's SPELLINGS, canonical -> the other spellings (`CONNOR` / `CONOR`). A spelling",
+    "is read as its canonical before `families` is consulted, so `families` and `notAtGate` hold canonical",
+    "spellings only. A transposition or a typo (`OLIVA`, `CAILTIN`, `NAIMH`) is not a variant.",
+    "`families`: root -> its familiar forms. A form may sit under SEVERAL roots and meets EVERY one of",
+    "them (`ELLIE` is ELEANOR's, ELIZABETH's and ELLEN's); two names meet when they share a root, a root",
+    "belonging to itself. Nothing is transitive: ELEANOR and ELIZABETH share no root.",
+    "`notAtGate`: forms read as one family for a comparison level BELOW exact, but which are names in",
+    "their own right, translations, another gender's name, or forms of more than one root (every such",
+    "form is listed). An identity gate must never equate a pair through one of these AS A FORM: `Megan`",
+    "is not `Margaret`, `Sean` is not `John`, `Michelle` is not `Michael`. A listed form that is also a",
+    "root still meets its own forms at a gate (`CAITLIN` / `CAIT`). A form belongs here when two",
+    "different people plausibly carry the two names."
   ],
+  variants: {
+    AIDAN: ["AIDEN"],
+    AISLING: ["ASHLING", "AISHLING"],
+    ALANNA: ["ALANNAH", "ALANA"],
+    ALEXANDRA: ["ALEXANDRIA"],
+    ALLISON: ["ALISON"],
+    AOIBHINN: ["AOIBHIN"],
+    BRIANNA: ["BRIANA"],
+    BRIGID: ["BRIDGID", "BRIGHID"],
+    CAITLIN: ["CAITLYN", "KAITLIN", "KAITLYN", "KATELYN"],
+    CAITRIONA: ["CATRIONA"],
+    CATHERINE: ["KATHERINE", "KATHRYN", "CATHRYN"],
+    CECILIA: ["CECELIA"],
+    CIARA: ["KIERA", "KEIRA", "CIARRA"],
+    CIARAN: ["KIERAN", "KEIRAN"],
+    CLAIRE: ["CLARE"],
+    COLLEEN: ["COLEEN"],
+    CONNOR: ["CONOR"],
+    DEBORAH: ["DEBRA"],
+    EMER: ["EIMEAR"],
+    FIONNUALA: ["FIONNULA"],
+    GABRIELLE: ["GABRIELLA"],
+    GRAINNE: ["GRAINE"],
+    HALEY: ["HAILEY"],
+    HANNAH: ["HANNA", "HANAH"],
+    ISABEL: ["ISABELLE"],
+    JEN: ["JENN"],
+    JENNY: ["JENNIE"],
+    JONATHAN: ["JONATHON"],
+    JULIANNA: ["JULIANA"],
+    KATE: ["CATE"],
+    KATHLEEN: ["CATHLEEN"],
+    KATIE: ["CATIE"],
+    KAYLEIGH: ["KALEIGH"],
+    KERRY: ["KERRI"],
+    KIMBERLY: ["KIMBERLEY"],
+    KRISTIN: ["KRISTEN"],
+    LILY: ["LILLY"],
+    LINDSAY: ["LINDSEY"],
+    MADELINE: ["MADELEINE"],
+    MADISON: ["MADDISON"],
+    MATTHEW: ["MATHEW"],
+    MEGAN: ["MEGHAN", "MEAGAN", "MEAGHAN"],
+    MOLLY: ["MOLLIE"],
+    RACHEL: ["RACHAEL"],
+    SARAH: ["SARA"],
+    SHANNON: ["SHANNAN", "SHANNEN"],
+    SIOBHAN: ["SIOBHAIN"],
+    SOPHIA: ["SOFIA"],
+    STEPHEN: ["STEVEN"],
+    SYDNEY: ["SIDNEY"],
+    TERESA: ["THERESA"],
+    TRISTAN: ["TRISTEN"],
+    VICKY: ["VICKI"],
+    ZACH: ["ZACK"]
+  },
   families: {
-    ABIGAIL: ["ABBY", "ABBIE"],
-    AIDAN: ["AIDEN", "AODHAN", "AIDY"],
+    ABIGAIL: ["ABBY", "ABBIE", "ABBEY", "ABI"],
+    ADDISON: ["ADDIE"],
+    AIDAN: ["AODHAN", "AIDY"],
     ALEXANDER: ["ALEX", "ALEC", "SANDY", "XANDER", "ALEXANDRA", "ALEXA", "LEXI", "LEXIE"],
+    ALEXANDRA: ["ALLY"],
+    ALLISON: ["ALLY", "ALLIE"],
     AMANDA: ["MANDY"],
     ANDREW: ["ANDY"],
+    ANGELA: ["ANGIE"],
     ANNE: ["ANN", "ANNA", "ANNIE", "NANCY", "NAN", "ANYA"],
     ANTHONY: ["TONY"],
     BARBARA: ["BARB"],
-    BRIDGET: ["BRIDIE", "BRID", "BRIGID", "BRIGHID", "BREDA", "BREEDA", "BIDDY"],
-    CAITLIN: ["CAITLYN", "KAITLIN", "KAITLYN", "KATELYN", "CAIT"],
+    BENJAMIN: ["BEN", "BENNY"],
+    BRIDGET: ["BRIDIE", "BRID", "BRIGID", "BREDA", "BREEDA", "BIDDY"],
+    CAITLIN: ["CAIT"],
+    CASSANDRA: ["CASSIE"],
     CATHERINE: [
-      "KATHERINE",
-      "KATHRYN",
-      "CATHRYN",
       "KATE",
       "KATIE",
       "KATY",
@@ -120,31 +184,72 @@ var given_diminutives_default = {
       "KITTY",
       "CAITRIONA",
       "KATHLEEN",
-      "CATHLEEN"
+      "CAITLIN"
     ],
+    CHARLES: ["CHARLIE"],
     CHRISTOPHER: ["CHRIS", "KIT", "TOPHER"],
-    CIARA: ["KIERA", "KEIRA", "CIARRA"],
-    CIARAN: ["KIERAN", "KEIRAN"],
+    CIARA: [],
+    CIARAN: [],
+    CONSTANCE: ["CONNIE"],
     CYNTHIA: ["CINDY"],
     DANIEL: ["DAN", "DANNY", "DANIELLE", "DANI"],
-    DEBORAH: ["DEBRA", "DEBBIE", "DEB"],
+    DEBORAH: ["DEBBIE", "DEB"],
     DEIRDRE: ["DEE", "DIDI"],
     DOROTHY: ["DOT", "DOTTIE"],
+    DOUGLAS: ["DOUG"],
     EDWARD: ["ED", "EDDIE", "TED", "TEDDY", "NED"],
     EILEEN: ["EILISH", "EILIS", "AILEEN"],
-    ELIZABETH: ["LIZ", "LIZZIE", "BETH", "BETSY", "BETTY", "ELIZA", "LIBBY", "ELSIE", "ELISE"],
+    ELEANOR: ["ELLIE"],
+    ELIJAH: ["ELI"],
+    ELIZABETH: [
+      "LIZ",
+      "LIZZIE",
+      "BETH",
+      "BETSY",
+      "BETTY",
+      "ELIZA",
+      "LIBBY",
+      "ELSIE",
+      "ELISE",
+      "ELLIE"
+    ],
+    ELLEN: ["ELLIE"],
     EOIN: ["OWEN", "EOGHAN"],
-    FIONNUALA: ["FIONNULA", "FINOLA", "NUALA"],
+    EVA: ["EVIE"],
+    EVANGELINE: ["EVIE"],
+    EVE: ["EVIE"],
+    EVELYN: ["EVIE"],
+    FIONNUALA: ["FINOLA", "NUALA"],
+    FLORENCE: ["FLO"],
+    FRANCES: ["FRANCIE"],
+    FRANCESCA: ["FRANKIE"],
     FRANCIS: ["FRANK", "FRANKIE", "FRAN", "FRANCES"],
+    GABRIEL: ["GABE"],
+    GABRIELLE: ["GABBY", "GABY"],
+    GENEVIEVE: ["EVIE"],
+    GEOFFREY: ["GEOFF"],
     GILLIAN: ["GILL"],
-    GRAINNE: ["GRANIA", "GRACE", "GRAINE"],
+    GRACE: ["GRACIE"],
+    GRAINNE: ["GRANIA", "GRACE"],
+    GREGORY: ["GREG"],
+    GWENDOLYN: ["GWEN"],
+    ISABEL: ["IZZY", "ISSY"],
+    JACOB: ["JAKE"],
     JACQUELINE: ["JACKIE"],
     JAMES: ["JIM", "JIMMY", "JAMIE", "SEAMUS", "JAY"],
-    JENNIFER: ["JEN", "JENNY", "JENNIE", "JENN"],
+    JEFFREY: ["JEFF"],
+    JENNIFER: ["JEN", "JENNY"],
+    JESSICA: ["JESSIE", "JESS"],
+    JILLIAN: ["JILL"],
     JOHN: ["JACK", "JOHNNY", "SEAN", "SHANE", "JOHNNIE", "EOIN"],
     JOSEPH: ["JOE", "JOEY", "JOSEPHINE", "JO"],
+    JOSEPHINE: ["JOSIE"],
+    JOSHUA: ["JOSH"],
     JUDITH: ["JUDY"],
-    KIMBERLY: ["KIMBERLEY", "KIM"],
+    KIMBERLY: ["KIM"],
+    LILLIAN: ["LILY"],
+    MADELINE: ["MADDIE", "MADDY"],
+    MADISON: ["MADDIE"],
     MARGARET: [
       "MAGGIE",
       "PEGGY",
@@ -159,61 +264,91 @@ var given_diminutives_default = {
     ],
     MARY: ["MAIRE", "MOLLY", "MAY", "POLLY", "MAIREAD", "MARIE", "MARIA", "MOIRA", "MAUREEN"],
     MATTHEW: ["MATT", "MATTIE"],
-    MICHAEL: ["MIKE", "MICK", "MICKEY", "MICHEAL", "MICHELLE", "MICHAELA"],
-    NICHOLAS: ["NICK", "NICKY", "NICOLE", "NICOLA", "NIKKI"],
+    MAXIMILIAN: ["MAX"],
+    MICHAEL: ["MIKE", "MICK", "MICKEY", "MICHEAL", "MICHELLE", "MICHAELA", "MIKEY"],
+    MITCHELL: ["MITCH"],
+    NATHAN: ["NATE"],
+    NATHANIEL: ["NATE"],
     NIAMH: ["NEVE", "NEEVE"],
+    NICHOLAS: ["NICK", "NICKY", "NICOLE", "NICOLA", "NIKKI"],
     PAMELA: ["PAM"],
     PATRICK: ["PAT", "PADDY", "PADRAIG", "PATSY", "PATRICIA", "TRICIA", "TRISH", "PATTY"],
+    PENELOPE: ["PENNY"],
     PETER: ["PETE", "PEADAR"],
     PHILIPPA: ["PIPPA"],
     RAYMOND: ["RAY"],
     REBECCA: ["BECKY", "BECCA", "BEX"],
     RICHARD: ["RICK", "RICKY", "DICK", "RICH", "RICHIE"],
     ROBERT: ["ROB", "BOB", "BOBBY", "ROBBIE", "ROBERTA"],
+    SAMANTHA: ["SAM", "SAMMY", "SAMMIE"],
+    SAMUEL: ["SAM", "SAMMY", "SAMMIE"],
     SAOIRSE: ["SEERSHA"],
-    SIOBHAN: ["SHIVAUN", "CHEVONNE", "SIOBHAIN"],
-    STEPHEN: ["STEVEN", "STEVE", "STEPHANIE", "STEPH"],
+    SIOBHAN: ["SHIVAUN", "CHEVONNE"],
+    SOPHIA: ["SOPHIE"],
+    STEPHEN: ["STEVE", "STEPHANIE", "STEPH"],
     SUSAN: ["SUE", "SUSIE", "SUZANNE", "SUZY"],
-    TERESA: ["THERESA", "TESS"],
+    TABITHA: ["TABBY"],
+    TERENCE: ["TERRY"],
+    TERESA: ["TESS"],
     THOMAS: ["TOM", "TOMMY", "TOMAS", "THOM"],
-    VICTORIA: ["VICKY", "VICKI"],
+    TIMOTHY: ["TIM", "TIMMY"],
+    VICTORIA: ["VICKY"],
     VINCENT: ["VINNIE"],
-    WILLIAM: ["WILL", "BILL", "BILLY", "WILLIE", "LIAM"]
+    WILLIAM: ["WILL", "BILL", "BILLY", "WILLIE", "LIAM"],
+    ZACHARY: ["ZACH"]
   },
   notAtGate: [
+    "ABBEY",
     "ABBIE",
     "ABBY",
+    "ADDIE",
     "ALEXA",
     "ALEXANDRA",
+    "ALLIE",
+    "ALLY",
     "ANNA",
     "ANYA",
+    "CAITLIN",
     "CAITRIONA",
-    "CATHLEEN",
+    "CHARLIE",
     "DANI",
     "DANIELLE",
     "DEE",
     "EILIS",
     "EILISH",
+    "ELI",
     "ELISE",
+    "ELLIE",
     "ELSIE",
     "EOGHAN",
     "EOIN",
+    "EVIE",
     "FRANCES",
+    "FRANKIE",
     "GRACE",
+    "GRACIE",
+    "GWEN",
     "JACK",
     "JAY",
+    "JESSIE",
+    "JILL",
     "JO",
     "JOSEPHINE",
+    "JOSIE",
     "KATHLEEN",
     "KIM",
+    "KIT",
     "LEXI",
     "LEXIE",
     "LIAM",
+    "LILY",
+    "MADDIE",
     "MAIRE",
     "MAIREAD",
     "MARIA",
     "MARIE",
     "MAUREEN",
+    "MAX",
     "MAY",
     "MEGAN",
     "MICHAELA",
@@ -222,6 +357,7 @@ var given_diminutives_default = {
     "MOIRA",
     "MOLLY",
     "NANCY",
+    "NATE",
     "NICOLA",
     "NICOLE",
     "NIKKI",
@@ -232,15 +368,21 @@ var given_diminutives_default = {
     "PATSY",
     "PATTY",
     "PEADAR",
+    "PENNY",
     "POLLY",
     "ROBERTA",
+    "SAM",
+    "SAMMIE",
+    "SAMMY",
     "SANDY",
     "SEAMUS",
     "SEAN",
     "SHANE",
+    "SOPHIE",
     "STEPH",
     "STEPHANIE",
     "SUZANNE",
+    "TERRY",
     "TESS",
     "TOMAS",
     "TRICIA",
@@ -250,23 +392,68 @@ var given_diminutives_default = {
 
 // src/normalize/given-diminutives.ts
 var TABLE = given_diminutives_default;
-var ROOT = (() => {
+var CANONICAL = (() => {
+  const out = new Map;
+  for (const [canonical, spellings] of Object.entries(TABLE.variants))
+    for (const s of spellings)
+      out.set(s, canonical);
+  return out;
+})();
+var ROOTS = (() => {
   const out = new Map;
+  const add = (form, root) => {
+    let roots = out.get(form);
+    if (roots === undefined)
+      out.set(form, roots = new Set);
+    roots.add(root);
+  };
   for (const [root, forms] of Object.entries(TABLE.families)) {
-    out.set(root, root);
+    add(root, root);
     for (const f of forms)
-      if (!out.has(f))
-        out.set(f, root);
+      add(f, root);
   }
   return out;
 })();
 var NOT_AT_GATE = new Set(TABLE.notAtGate);
+var canonical = (name) => CANONICAL.get(name) ?? name;
+var gateThrough = (name, root) => name === root || !NOT_AT_GATE.has(name);
 function sameGivenFamily2(a, b) {
-  if (a === b || NOT_AT_GATE.has(a) || NOT_AT_GATE.has(b))
-    return false;
-  const ra = ROOT.get(a);
-  return ra !== undefined && ra === ROOT.get(b);
+  const via = givenFamilyTable2(a, b);
+  return via === "given-variant" || via === "given-family";
 }
+function givenFamilyTable2(a, b) {
+  if (a === b)
+    return null;
+  const ca = canonical(a);
+  const cb = canonical(b);
+  if (ca === cb)
+    return "given-variant";
+  const ra = ROOTS.get(ca);
+  const rb = ROOTS.get(cb);
+  if (ra === undefined || rb === undefined)
+    return null;
+  let shared = false;
+  for (const root of ra) {
+    if (!rb.has(root))
+      continue;
+    if (gateThrough(ca, root) && gateThrough(cb, root))
+      return "given-family";
+    shared = true;
+  }
+  return shared ? "given-family-not-gate" : null;
+}
+// src/normalize/multiset.ts
+function subMultiset(outer, inner) {
+  const left = [...inner];
+  for (const part of outer) {
+    const at = left.indexOf(part);
+    if (at < 0)
+      return false;
+    left.splice(at, 1);
+  }
+  return true;
+}
+
 // src/normalize/name-middle.ts
 function suffixCut(p) {
   return Math.max(1, p.givenFields().length - p.suffixes.length);
@@ -298,6 +485,9 @@ function nameRelation2(a, b) {
   if (a.surnameKey() !== b.surnameKey() || ga[0] !== gb[0] || ga[0] === undefined) {
     return { relation: "different", reason: "head-differs" };
   }
+  return tailRelation(a, b);
+}
+function tailRelation(a, b) {
   if (!sameList(suffixFields(a), suffixFields(b))) {
     return { relation: "different", reason: "suffixes-differ" };
   }
@@ -318,138 +508,6 @@ function nameRelation2(a, b) {
   return { relation: "candidate", reason: "initial-agrees" };
 }
 
-// src/normalize/name-compare.ts
-function nameCompare2(a, b, dop) {
-  const x = levelOf2(a, dop);
-  const y = levelOf2(b, dop);
-  if (x < y)
-    return -1;
-  return x > y ? 1 : 0;
-}
-function probablySame2(a, b, dop) {
-  if (!a.isPerson() || !b.isPerson())
-    return false;
-  if (dop === "nn5")
-    return nameRelation2(a, b).relation !== "different";
-  return levelOf2(a, dop) === levelOf2(b, dop);
-}
-function slotOf(name, dop) {
-  return name.isPerson() ? levelOf2(name, dop) : null;
-}
-var loner = 0;
-var lonerSlot = () => `\x1F\x1F${loner++}`;
-function createNameSet2(dop) {
-  const held = new Map;
-  const set = {
-    dop,
-    get size() {
-      return held.size;
-    },
-    get: (name) => {
-      const slot = slotOf(name, dop);
-      return slot === null ? undefined : held.get(slot);
-    },
-    has: (name) => {
-      const slot = slotOf(name, dop);
-      return slot === null ? false : held.has(slot);
-    },
-    add(name) {
-      const slot = slotOf(name, dop);
-      if (slot === null)
-        held.set(lonerSlot(), name);
-      else if (!held.has(slot))
-        held.set(slot, name);
-      return this;
-    },
-    delete: (name) => {
-      const slot = slotOf(name, dop);
-      return slot === null ? false : held.delete(slot);
-    },
-    clear: () => held.clear(),
-    values: () => held.values(),
-    [Symbol.iterator]: () => held.values()
-  };
-  return set;
-}
-function createNameMap2(dop, entries) {
-  const held = new Map;
-  const map = {
-    dop,
-    get size() {
-      return held.size;
-    },
-    get: (name) => {
-      const key = slotOf(name, dop);
-      return key === null ? undefined : held.get(key)?.[1];
-    },
-    has: (name) => {
-      const key = slotOf(name, dop);
-      return key === null ? false : held.has(key);
-    },
-    set(name, value) {
-      const key = slotOf(name, dop);
-      const slot = key === null ? undefined : held.get(key);
-      if (slot === undefined)
-        held.set(key ?? lonerSlot(), [name, value]);
-      else
-        slot[1] = value;
-      return this;
-    },
-    delete: (name) => {
-      const key = slotOf(name, dop);
-      return key === null ? false : held.delete(key);
-    },
-    clear: () => held.clear(),
-    *keys() {
-      for (const [name] of held.values())
-        yield name;
-    },
-    *values() {
-      for (const [, value] of held.values())
-        yield value;
-    },
-    *entries() {
-      for (const slot of held.values())
-        yield [slot[0], slot[1]];
-    },
-    [Symbol.iterator]() {
-      return this.entries();
-    }
-  };
-  for (const [name, value] of entries ?? [])
-    map.set(name, value);
-  return map;
-}
-function createNameClusters2(dop, linkage) {
-  if (dop === "nn5") {
-    throw new Error('createNameClusters at nn5 is unimplemented: a linkage is defined over a distance and NN5 answers a relation. Use nameRelation / probablySame(a, b, "nn5"); see docs/NAME-NORMALIZATION.md § NN5 — the middle-name relation.');
-  }
-  const transitive = dop;
-  const held = new Map;
-  const out = {
-    dop,
-    linkage,
-    get size() {
-      return held.size;
-    },
-    add(name) {
-      const key = slotOf(name, transitive);
-      const cluster = key === null ? undefined : held.get(key);
-      if (cluster === undefined)
-        held.set(key ?? lonerSlot(), [name]);
-      else
-        cluster.push(name);
-      return this;
-    },
-    clusterOf: (name) => {
-      const key = slotOf(name, transitive);
-      return key === null ? undefined : held.get(key);
-    },
-    clusters: () => [...held.values()],
-    [Symbol.iterator]: () => held.values()
-  };
-  return out;
-}
 // src/normalize/name-compose.ts
 var READER_RANK = ["as-parsed", "boundary", "order"];
 var VIA_ORDER = [
@@ -552,16 +610,6 @@ function meetMiddles(x, y) {
   }
   return out;
 }
-function subMultiset(outer, inner) {
-  const left = [...inner];
-  for (const part of outer) {
-    const at = left.indexOf(part);
-    if (at < 0)
-      return false;
-    left.splice(at, 1);
-  }
-  return true;
-}
 function meetSurname(x, y) {
   if (subMultiset(x, y))
     return y;
@@ -817,6 +865,306 @@ function foldUnder(prints, surname) {
     return mx - my || (slotKey(x) < slotKey(y) ? -1 : 1);
   })[0];
 }
+
+// src/normalize/name-kinship.ts
+var KINSHIP_VIAS2 = Object.freeze({
+  "surname-part": Object.freeze({ field: "surname", gateSafe: true }),
+  "given-variant": Object.freeze({ field: "given", gateSafe: true }),
+  "given-family": Object.freeze({ field: "given", gateSafe: true }),
+  "given-family-not-gate": Object.freeze({ field: "given", gateSafe: false }),
+  "given-maybe": Object.freeze({ field: "given", gateSafe: false }),
+  "middle-absent": Object.freeze({ field: "middle", gateSafe: true }),
+  "initial-agrees": Object.freeze({ field: "middle", gateSafe: true })
+});
+var VIA_ORDER2 = Object.freeze(Object.keys(KINSHIP_VIAS2));
+var different = (reason) => ({
+  relation: "different",
+  via: [],
+  reason,
+  gateSafe: false
+});
+function surnamePartOf(a, b) {
+  const pa = surnameParts2(a);
+  const pb = surnameParts2(b);
+  if (pa.length === pb.length)
+    return false;
+  const [short, long] = pa.length < pb.length ? [pa, pb] : [pb, pa];
+  return subMultiset(short, long);
+}
+function createNameKinship2(options = {}) {
+  const providers = Object.freeze([
+    ...options.given ?? [givenFamilyTable2]
+  ]);
+  const givenVia = (x, y) => {
+    const [lo, hi] = x < y ? [x, y] : [y, x];
+    for (const provider of providers) {
+      const via = provider(lo, hi);
+      if (via !== null)
+        return via;
+    }
+    return null;
+  };
+  return (a, b) => {
+    if (!a.isPerson() || !b.isPerson())
+      return different("not-a-person");
+    const found = new Set;
+    if (a.surnameKey() !== b.surnameKey()) {
+      if (!surnamePartOf(a, b))
+        return different("surname-differs");
+      found.add("surname-part");
+    }
+    const ga = a.givenFields()[0];
+    const gb = b.givenFields()[0];
+    if (ga === undefined || gb === undefined)
+      return different("given-differs");
+    if (ga !== gb) {
+      const via = givenVia(ga, gb);
+      if (via === null)
+        return different("given-differs");
+      found.add(via);
+    }
+    const tail = tailRelation(a, b);
+    if (tail.relation === "different")
+      return different(tail.reason);
+    if (tail.relation === "candidate")
+      found.add(tail.reason);
+    const via = VIA_ORDER2.filter((v) => found.has(v));
+    return {
+      relation: via.length === 0 ? "same" : "candidate",
+      via,
+      reason: tail.reason,
+      gateSafe: via.every((v) => KINSHIP_VIAS2[v].gateSafe)
+    };
+  };
+}
+var nameKinship2 = createNameKinship2();
+
+// src/normalize/name-compare.ts
+function nameCompare2(a, b, dop) {
+  const x = levelOf2(a, dop);
+  const y = levelOf2(b, dop);
+  if (x < y)
+    return -1;
+  return x > y ? 1 : 0;
+}
+function probablySame2(a, b, dop) {
+  if (!a.isPerson() || !b.isPerson())
+    return false;
+  if (dop === "nn5")
+    return nameRelation2(a, b).relation !== "different";
+  return levelOf2(a, dop) === levelOf2(b, dop);
+}
+function slotOf(name, dop) {
+  return name.isPerson() ? levelOf2(name, dop) : null;
+}
+var loner = 0;
+var lonerSlot = () => `\x1F\x1F${loner++}`;
+function createNameSet2(dop) {
+  const held = new Map;
+  const set = {
+    dop,
+    get size() {
+      return held.size;
+    },
+    get: (name) => {
+      const slot = slotOf(name, dop);
+      return slot === null ? undefined : held.get(slot);
+    },
+    has: (name) => {
+      const slot = slotOf(name, dop);
+      return slot === null ? false : held.has(slot);
+    },
+    add(name) {
+      const slot = slotOf(name, dop);
+      if (slot === null)
+        held.set(lonerSlot(), name);
+      else if (!held.has(slot))
+        held.set(slot, name);
+      return this;
+    },
+    delete: (name) => {
+      const slot = slotOf(name, dop);
+      return slot === null ? false : held.delete(slot);
+    },
+    clear: () => held.clear(),
+    values: () => held.values(),
+    [Symbol.iterator]: () => held.values()
+  };
+  return set;
+}
+function createNameMap2(dop, entries) {
+  const held = new Map;
+  const map = {
+    dop,
+    get size() {
+      return held.size;
+    },
+    get: (name) => {
+      const key = slotOf(name, dop);
+      return key === null ? undefined : held.get(key)?.[1];
+    },
+    has: (name) => {
+      const key = slotOf(name, dop);
+      return key === null ? false : held.has(key);
+    },
+    set(name, value) {
+      const key = slotOf(name, dop);
+      const slot = key === null ? undefined : held.get(key);
+      if (slot === undefined)
+        held.set(key ?? lonerSlot(), [name, value]);
+      else
+        slot[1] = value;
+      return this;
+    },
+    delete: (name) => {
+      const key = slotOf(name, dop);
+      return key === null ? false : held.delete(key);
+    },
+    clear: () => held.clear(),
+    *keys() {
+      for (const [name] of held.values())
+        yield name;
+    },
+    *values() {
+      for (const [, value] of held.values())
+        yield value;
+    },
+    *entries() {
+      for (const slot of held.values())
+        yield [slot[0], slot[1]];
+    },
+    [Symbol.iterator]() {
+      return this.entries();
+    }
+  };
+  for (const [name, value] of entries ?? [])
+    map.set(name, value);
+  return map;
+}
+function kinshipBuckets(name) {
+  return [...new Set([name.surnameKey(), ...surnameParts2(name)])];
+}
+var RELATION_RANK = {
+  same: 0,
+  candidate: 1,
+  different: 2
+};
+function createNameIndex2(dop, options = {}) {
+  const kinship = options.kinship ?? nameKinship2;
+  const map = createNameMap2(dop);
+  const filed = new Map;
+  const buckets = new Map;
+  let seq = 0;
+  const file = (slot, name) => {
+    filed.set(slot, { name, seq: seq++ });
+    for (const key of kinshipBuckets(name)) {
+      const slots = buckets.get(key);
+      if (slots === undefined)
+        buckets.set(key, new Set([slot]));
+      else
+        slots.add(slot);
+    }
+  };
+  const unfile = (slot) => {
+    const held = filed.get(slot);
+    if (held === undefined)
+      return;
+    filed.delete(slot);
+    for (const key of kinshipBuckets(held.name)) {
+      const slots = buckets.get(key);
+      slots?.delete(slot);
+      if (slots?.size === 0)
+        buckets.delete(key);
+    }
+  };
+  const index = {
+    dop,
+    get size() {
+      return map.size;
+    },
+    get: (name) => map.get(name),
+    has: (name) => map.has(name),
+    set(name, value) {
+      const slot = slotOf(name, dop);
+      if (slot !== null && !filed.has(slot))
+        file(slot, name);
+      map.set(name, value);
+      return this;
+    },
+    delete: (name) => {
+      const slot = slotOf(name, dop);
+      if (slot !== null)
+        unfile(slot);
+      return map.delete(name);
+    },
+    clear: () => {
+      filed.clear();
+      buckets.clear();
+      map.clear();
+    },
+    keys: () => map.keys(),
+    values: () => map.values(),
+    entries: () => map.entries(),
+    [Symbol.iterator]: () => map.entries(),
+    related(name) {
+      const slots = new Set;
+      for (const key of kinshipBuckets(name)) {
+        for (const slot of buckets.get(key) ?? [])
+          slots.add(slot);
+      }
+      const found = [];
+      for (const slot of slots) {
+        const held = filed.get(slot);
+        if (held === undefined)
+          continue;
+        const k = kinship(name, held.name);
+        if (k.relation === "different")
+          continue;
+        found.push({
+          name: held.name,
+          value: map.get(held.name),
+          kinship: k,
+          seq: held.seq
+        });
+      }
+      found.sort((x, y) => RELATION_RANK[x.kinship.relation] - RELATION_RANK[y.kinship.relation] || x.seq - y.seq);
+      return found.map(({ name: n, value, kinship: k }) => ({ name: n, value, kinship: k }));
+    }
+  };
+  for (const [name, value] of options.entries ?? [])
+    index.set(name, value);
+  return index;
+}
+function createNameClusters2(dop, linkage) {
+  if (dop === "nn5") {
+    throw new Error('createNameClusters at nn5 is unimplemented: a linkage is defined over a distance and NN5 answers a relation. Use nameRelation / probablySame(a, b, "nn5"); see docs/NAME-NORMALIZATION.md § NN5 — the middle-name relation.');
+  }
+  const transitive = dop;
+  const held = new Map;
+  const out = {
+    dop,
+    linkage,
+    get size() {
+      return held.size;
+    },
+    add(name) {
+      const key = slotOf(name, transitive);
+      const cluster = key === null ? undefined : held.get(key);
+      if (cluster === undefined)
+        held.set(key ?? lonerSlot(), [name]);
+      else
+        cluster.push(name);
+      return this;
+    },
+    clusterOf: (name) => {
+      const key = slotOf(name, transitive);
+      return key === null ? undefined : held.get(key);
+    },
+    clusters: () => [...held.values()],
+    [Symbol.iterator]: () => held.values()
+  };
+  return out;
+}
 // src/normalize/name-infeasible.ts
 var INFEASIBLE_CLASSES2 = ["merge?", "spelling", "rule-gap"];
 function editDistance2(a, b) {
@@ -1420,7 +1768,7 @@ function deriveNameFormat2(prints, options = {}) {
     return first;
   return scoreReadings(cells.map((c) => readNameCell2(c, { ...options, placeColumn: true })), NAME_FORMAT_MODEL, threshold, schoolRead);
 }
-export { repairMojibake2, sameGivenFamily2, comparePosition2, nameRelation2, nameCompare2, probablySame2, createNameSet2, createNameMap2, createNameClusters2, MAX_READINGS2, surnameParts2, printAttestsOrder2, nameReadings2, meetReading2, refinesReading2, sameReading2, chooseReadingPair2, composeReadings2, composeNames2, meetReadings2, nameMeet2, showReading2, blockKeysOfReadings2, nameBlockKeys2, namesFeasible2, INFEASIBLE_CLASSES2, editDistance2, nearSpelling2, compoundGiven2, middleForm2, infeasibleClass2, isListJoiner2, personList2, surnameBlock2, initialsBlock2, metaphoneBlocks2, NAME_LEVEL_COLUMNS2, NAME_COLUMNS2, nameColumns2, NAME_FORMATS2, nameFormatOrder2, ORDER_READINGS2, readNameCell2, DEFAULT_NAME_FORMAT_THRESHOLD2, deriveNameFormat2 };
+export { repairMojibake2, sameGivenFamily2, givenFamilyTable2, comparePosition2, nameRelation2, MAX_READINGS2, surnameParts2, printAttestsOrder2, nameReadings2, meetReading2, refinesReading2, sameReading2, chooseReadingPair2, composeReadings2, composeNames2, meetReadings2, nameMeet2, showReading2, blockKeysOfReadings2, nameBlockKeys2, namesFeasible2, KINSHIP_VIAS2, createNameKinship2, nameKinship2, nameCompare2, probablySame2, createNameSet2, createNameMap2, createNameIndex2, createNameClusters2, INFEASIBLE_CLASSES2, editDistance2, nearSpelling2, compoundGiven2, middleForm2, infeasibleClass2, isListJoiner2, personList2, surnameBlock2, initialsBlock2, metaphoneBlocks2, NAME_LEVEL_COLUMNS2, NAME_COLUMNS2, nameColumns2, NAME_FORMATS2, nameFormatOrder2, ORDER_READINGS2, readNameCell2, DEFAULT_NAME_FORMAT_THRESHOLD2, deriveNameFormat2 };
 
-//# debugId=A39684B9543A024164756E2164756E21
-//# sourceMappingURL=index-vqbvesky.js.map
+//# debugId=37DF635DD383940A64756E2164756E21
+//# sourceMappingURL=index-kw69ry3j.js.map