@treeviz/gedcom-parser 2.1.3 → 2.1.5

package/dist/index.js

@@ -1146,7 +1146,319 @@ var Range = /* @__PURE__ */ ((Range2) => {
   return Range2;
 })(Range || {});
 
+// src/factories/cache-factory.ts
+var defaultCacheFactory = () => {
+  let cache = null;
+  return {
+    getItem: async () => cache,
+    setItem: async (value) => {
+      cache = value;
+    }
+  };
+};
+var cacheFactory = defaultCacheFactory;
+var setCacheManagerFactory = (factory) => {
+  cacheFactory = factory;
+};
+var getCacheManagerFactory = () => {
+  return cacheFactory;
+};
+var resetCacheManagerFactory = () => {
+  cacheFactory = defaultCacheFactory;
+};
+
+// src/utils/cache.ts
+var getGedcomId = (gedcom) => {
+  if (!gedcom) {
+    return "unknown";
+  }
+  const treeId = gedcom.getTreeId?.() || "";
+  const treeName = gedcom.getTreeName?.() || "";
+  const sanitizedName = treeName.toLowerCase().replace(/[^a-z0-9]+/g, "_").replace(/^_+|_+$/g, "");
+  if (treeId && sanitizedName) {
+    return `${treeId}_${sanitizedName}`;
+  } else if (treeId) {
+    return treeId;
+  } else if (sanitizedName) {
+    return sanitizedName;
+  }
+  return `gedcom_${gedcom.refcount}`;
+};
+var caches = {
+  pathCache: {},
+  relativesOnDegreeCache: {},
+  relativesOnLevelCache: {},
+  profilePictureCache: {}
+};
+var cacheDbs;
+var getCacheDbs = () => {
+  if (!cacheDbs) {
+    const getInstance = getCacheManagerFactory();
+    cacheDbs = {
+      pathCache: getInstance(
+        "ftv",
+        "Main",
+        "path",
+        true
+      ),
+      relativesOnDegreeCache: getInstance("ftv", "Main", "path", true),
+      relativesOnLevelCache: getInstance(
+        "ftv",
+        "Main",
+        "path",
+        true
+      ),
+      profilePictureCache: getInstance(
+        "ftv",
+        "Main",
+        "images",
+        false
+      )
+    };
+  }
+  return cacheDbs;
+};
+var storeCache = {
+  // NOTE: pathCache, relativesOnLevelCache, and relativesOnDegreeCache are intentionally
+  // kept in memory only. These debounced functions exist to satisfy the type system
+  // but are never called.
+  pathCache: debounce((value) => {
+    if (value) {
+      getCacheDbs().pathCache.setItem(value);
+    }
+  }, 50),
+  relativesOnLevelCache: debounce((value) => {
+    if (value) {
+      getCacheDbs().relativesOnLevelCache.setItem(value);
+    }
+  }, 50),
+  relativesOnDegreeCache: debounce((value) => {
+    if (value) {
+      getCacheDbs().relativesOnDegreeCache.setItem(value);
+    }
+  }, 50),
+  // profilePictureCache IS persisted to IndexedDB
+  profilePictureCache: debounce((value) => {
+    if (value) {
+      getCacheDbs().profilePictureCache.setItem(value);
+    }
+  }, 100)
+};
+var cacheInitialized = false;
+var initializeCache = async () => {
+  if (cacheInitialized) {
+    return;
+  }
+  cacheInitialized = true;
+  try {
+    const profilePictureData = await getCacheDbs().profilePictureCache.getItem();
+    if (profilePictureData) {
+      caches.profilePictureCache = profilePictureData;
+    }
+  } catch (_error) {
+  }
+};
+var resetRelativesCache = () => {
+  caches.relativesOnDegreeCache = {};
+  caches.relativesOnLevelCache = {};
+};
+var relativesCache = (cacheKey) => (gedcom, key, subKey, value) => {
+  const gedcomId = getGedcomId(gedcom);
+  const fullKey = `${gedcomId}:${key}`;
+  const cache = caches[cacheKey];
+  if (!cache) {
+    caches[cacheKey] = {};
+  }
+  if (value) {
+    const typedCache2 = caches[cacheKey];
+    if (!typedCache2[fullKey]) {
+      typedCache2[fullKey] = {};
+    }
+    typedCache2[fullKey][subKey] = value;
+    return typedCache2[fullKey][subKey];
+  }
+  const typedCache = caches[cacheKey];
+  return typedCache?.[fullKey]?.[subKey];
+};
+var pathCache = (gedcom, key, value) => {
+  const gedcomId = getGedcomId(gedcom);
+  const fullKey = `${gedcomId}:${key}`;
+  if (!caches.pathCache) {
+    caches.pathCache = {};
+  }
+  if (value && caches.pathCache) {
+    caches.pathCache[fullKey] = value;
+    return caches.pathCache[fullKey];
+  }
+  return caches.pathCache?.[fullKey];
+};
+var profilePictureCache = (gedcom, key, value) => {
+  const gedcomId = getGedcomId(gedcom);
+  const fullKey = `${gedcomId}:${key}`;
+  if (!caches.profilePictureCache) {
+    caches.profilePictureCache = {};
+  }
+  if (value && caches.profilePictureCache) {
+    caches.profilePictureCache[fullKey] = value;
+    storeCache.profilePictureCache(caches.profilePictureCache);
+    return caches.profilePictureCache[fullKey];
+  }
+  const cached = caches.profilePictureCache?.[fullKey];
+  return cached;
+};
+var isNonBiologicalPath = (path) => path.some(
+  (item) => item.relation && item.relation !== "biological" /* BIOLOGICAL */
+);
+var invertHop = (kinship) => {
+  if (kinship === "parent") {
+    return "child";
+  }
+  if (kinship === "child") {
+    return "parent";
+  }
+  return kinship;
+};
+var hopRelation = (from, toIndi, kinship, inherited) => {
+  if (kinship === "parent" || kinship === "child") {
+    const parent = kinship === "parent" ? toIndi : from.indi;
+    const child = kinship === "parent" ? from.indi : toIndi;
+    const currentRelation = child.getParentType(parent);
+    if (currentRelation && currentRelation !== "biological" /* BIOLOGICAL */) {
+      return currentRelation;
+    }
+  }
+  if (inherited && inherited !== "biological" /* BIOLOGICAL */) {
+    return inherited;
+  }
+  return void 0;
+};
+var rebuildPathFromHops = (hops, skipRelation = false) => {
+  if (hops.length === 0) {
+    return [];
+  }
+  const path = [
+    {
+      indi: hops[0].indi,
+      kinship: "self",
+      level: 0,
+      levelUp: 0,
+      levelDown: 0,
+      degree: 0
+    }
+  ];
+  for (let i = 1; i < hops.length; i++) {
+    const prev = path[i - 1];
+    const { indi, kinship } = hops[i];
+    const relation = skipRelation ? void 0 : hopRelation(prev, indi, kinship, prev.relation);
+    if (kinship === "parent") {
+      path.push({
+        indi,
+        kinship,
+        relation,
+        level: prev.level + 1,
+        levelUp: prev.levelUp + 1,
+        levelDown: prev.levelDown,
+        degree: prev.degree
+      });
+      continue;
+    }
+    if (kinship === "child") {
+      path.push({
+        indi,
+        kinship,
+        relation,
+        level: prev.level - 1,
+        levelUp: prev.levelUp,
+        levelDown: prev.levelDown + 1,
+        degree: prev.levelUp ? prev.level > 0 ? prev.levelUp - prev.level + 1 : prev.levelDown - Math.abs(prev.level) : 0
+      });
+      continue;
+    }
+    path.push({
+      indi,
+      kinship,
+      relation,
+      level: prev.level,
+      levelUp: prev.levelUp,
+      levelDown: prev.levelDown,
+      degree: prev.degree
+    });
+  }
+  return path;
+};
+var storePathIfBetter = (gedcom, fromId, toId, path) => {
+  const key = `${fromId}|${toId}`;
+  const existing = pathCache(gedcom, key);
+  if (existing && (!isNonBiologicalPath(existing) || isNonBiologicalPath(path))) {
+    return;
+  }
+  pathCache(gedcom, key, path);
+};
+var cacheDiscoveredPath = (gedcom, path) => {
+  const n = path.length;
+  if (n < 2) {
+    return;
+  }
+  for (let i = 0; i < n; i++) {
+    const fromId = path[i].indi.id;
+    if (!fromId) {
+      continue;
+    }
+    for (let j = i + 1; j < n; j++) {
+      const toId = path[j].indi.id;
+      if (!toId) {
+        continue;
+      }
+      const isOriginalPair = i === 0 && j === n - 1;
+      const isDirectHop = j === i + 1;
+      const slice = path.slice(i, j + 1);
+      const sliceMixed = isNonBiologicalPath(slice);
+      if (!isOriginalPair && !isDirectHop && sliceMixed) {
+        continue;
+      }
+      const forward = i === 0 ? slice : rebuildPathFromHops(slice, !sliceMixed);
+      const reverseHops = [
+        {
+          indi: slice[slice.length - 1].indi,
+          kinship: "self"
+        }
+      ];
+      for (let k = slice.length - 2; k >= 0; k--) {
+        reverseHops.push({
+          indi: slice[k].indi,
+          kinship: invertHop(slice[k + 1].kinship)
+        });
+      }
+      const reverse = rebuildPathFromHops(reverseHops, !sliceMixed);
+      storePathIfBetter(gedcom, fromId, toId, forward);
+      storePathIfBetter(gedcom, toId, fromId, reverse);
+    }
+  }
+};
+
 // src/utils/family-edit.ts
+var refTypeForTag = (tag) => {
+  if (tag === "FAMS" || tag === "FAMC") return "FAM";
+  return "INDI";
+};
+var normalizeSinglePointer = (owner, tag) => {
+  const node = owner.get(tag);
+  if (!node) return;
+  if (node instanceof List && node.length === 1) {
+    const only = node.index(0);
+    if (only) {
+      owner.set(tag, only);
+      return;
+    }
+    const raw = node.values()[0];
+    if (typeof raw === "string") {
+      const gedcom = owner.getGedcom?.();
+      if (gedcom) {
+        owner.set(tag, makePointer(gedcom, owner, raw, refTypeForTag(tag)));
+      }
+    }
+  }
+};
 var PEDIGREE_VALUES = [
   "birth" /* BIRTH */,
   "adopted" /* ADOPTED */,
@@ -1265,6 +1577,9 @@ var attachSpouseToFamily = (fam, indi) => {
     fam.set(tag, makePointer(gedcom, fam, indi.id, "INDI"));
   }
   indi.assign("FAMS", makePointer(gedcom, indi, fam.id, "FAM"), true);
+  normalizeSinglePointer(indi, "FAMS");
+  normalizeSinglePointer(fam, spouseTagFor(indi, fam));
+  resetRelativesCache();
   return true;
 };
 var attachChildToFamily = (fam, child, pedigree, parent) => {
@@ -1275,19 +1590,356 @@ var attachChildToFamily = (fam, child, pedigree, parent) => {
   if (!familyHasChild(fam, child.id)) {
     fam.assign("CHIL", makePointer(gedcom, fam, child.id, "INDI"), true);
   }
-  const existingFamc = pointerByValue(child.get("FAMC"), fam.id);
-  if (!existingFamc) {
-    child.assign("FAMC", makePointer(gedcom, child, fam.id, "FAM"), true);
+  const existingFamc = pointerByValue(child.get("FAMC"), fam.id);
+  if (!existingFamc) {
+    child.assign("FAMC", makePointer(gedcom, child, fam.id, "FAM"), true);
+  }
+  setChildPedigree(fam, child, pedigree, parent);
+  normalizeSinglePointer(child, "FAMC");
+  normalizeSinglePointer(fam, "CHIL");
+  resetRelativesCache();
+  return true;
+};
+var removePointerByValue = (owner, tag, targetId) => {
+  const node = owner.get(tag);
+  if (!node) {
+    return false;
+  }
+  if (node instanceof List) {
+    const keysToRemove = [];
+    node.entries().forEach(([key, item]) => {
+      if (item?.toValue?.() === targetId || item?.id === targetId || String(key) === targetId) {
+        keysToRemove.push(key);
+      }
+    });
+    keysToRemove.forEach((key) => {
+      node.removeItem(key);
+    });
+    if (node.length === 0) {
+      owner.remove(tag);
+    }
+    return keysToRemove.length > 0;
+  }
+  if (node.toValue?.() === targetId) {
+    owner.remove(tag);
+    return true;
+  }
+  const asList = node.toList?.();
+  if (asList && asList.length > 0) {
+    const keysToRemove = [];
+    asList.entries().forEach(([key, item]) => {
+      if (item?.toValue?.() === targetId || item?.id === targetId) {
+        keysToRemove.push(key);
+      }
+    });
+    if (keysToRemove.length === asList.length) {
+      owner.remove(tag);
+      return true;
+    }
+    if (keysToRemove.length > 0) {
+      const remaining = asList.values().filter((item) => item?.toValue?.() !== targetId);
+      if (remaining.length === 1 && remaining[0]) {
+        owner.set(tag, remaining[0]);
+      } else {
+        owner.set(tag, new List(remaining));
+      }
+      return true;
+    }
+  }
+  return false;
+};
+var familyMemberCount = (fam) => {
+  let count = 0;
+  if (firstPointerId(fam.get("HUSB"))) {
+    count += 1;
+  }
+  if (firstPointerId(fam.get("WIFE"))) {
+    count += 1;
+  }
+  count += pointerIds(fam.get("CHIL")).length;
+  return count;
+};
+var isDegenerateFamily = (fam) => familyMemberCount(fam) <= 1;
+var pruneEmptyFamilies = (gedcom) => {
+  const emptyIds = [];
+  gedcom.fams()?.forEach((fam, id) => {
+    if (fam && isDegenerateFamily(fam) && id) {
+      emptyIds.push(id);
+    }
+  });
+  if (emptyIds.length === 0) {
+    return [];
+  }
+  gedcom.indis()?.forEach((indi) => {
+    if (!indi) {
+      return;
+    }
+    emptyIds.forEach((famId) => {
+      removePointerByValue(indi, "FAMS", famId);
+      removePointerByValue(indi, "FAMC", famId);
+    });
+  });
+  emptyIds.forEach((famId) => {
+    gedcom.fams()?.removeItem(famId);
+  });
+  return emptyIds;
+};
+var findDegenerateFamiliesForIndi = (indi) => {
+  const found = [];
+  const seen = /* @__PURE__ */ new Set();
+  ["FAMC", "FAMS"].forEach((pointer) => {
+    indi.getFamilies(pointer)?.forEach((fam) => {
+      if (!fam?.id || seen.has(fam.id) || !isDegenerateFamily(fam)) {
+        return;
+      }
+      seen.add(fam.id);
+      found.push(fam);
+    });
+  });
+  return found;
+};
+var coupleKeyForFam = (fam) => {
+  const husb = firstPointerId(fam.get("HUSB"));
+  const wife = firstPointerId(fam.get("WIFE"));
+  if (!husb || !wife) {
+    return void 0;
+  }
+  return husb < wife ? `${husb}|${wife}` : `${wife}|${husb}`;
+};
+var findDuplicateCoupleFamiliesForIndi = (indi) => {
+  const gedcom = indi.getGedcom();
+  if (!gedcom) {
+    return [];
+  }
+  const relevantKeys = /* @__PURE__ */ new Set();
+  ["FAMC", "FAMS"].forEach((pointer) => {
+    indi.getFamilies(pointer)?.forEach((fam) => {
+      const key = fam ? coupleKeyForFam(fam) : void 0;
+      if (key) {
+        relevantKeys.add(key);
+      }
+    });
+  });
+  if (relevantKeys.size === 0) {
+    return [];
+  }
+  const byKey = /* @__PURE__ */ new Map();
+  gedcom.fams()?.forEach((fam) => {
+    if (!fam?.id) {
+      return;
+    }
+    const key = coupleKeyForFam(fam);
+    if (!key || !relevantKeys.has(key)) {
+      return;
+    }
+    const list = byKey.get(key) ?? [];
+    list.push(fam);
+    byKey.set(key, list);
+  });
+  return [...byKey.entries()].filter(([, families]) => families.length > 1).map(([key, families]) => ({ key, families }));
+};
+var mergeDuplicateCoupleFamilies = (gedcom, families) => {
+  const usable = families.filter((fam) => !!fam?.id);
+  if (usable.length === 0) {
+    return void 0;
+  }
+  if (usable.length === 1) {
+    return usable[0];
+  }
+  const sorted = [...usable].sort((a, b) => {
+    const childDiff = pointerIds(b.get("CHIL")).length - pointerIds(a.get("CHIL")).length;
+    if (childDiff !== 0) {
+      return childDiff;
+    }
+    return String(a.id).localeCompare(String(b.id));
+  });
+  const keep = sorted[0];
+  const drops = sorted.slice(1);
+  if (!keep?.id) {
+    return void 0;
+  }
+  drops.forEach((drop) => {
+    if (!drop?.id || drop.id === keep.id) {
+      return;
+    }
+    pointerIds(drop.get("CHIL")).forEach((childId) => {
+      const child = gedcom.indi(childId);
+      if (!child) {
+        return;
+      }
+      attachChildToFamily(keep, child);
+      removePointerByValue(drop, "CHIL", childId);
+      normalizeSinglePointer(drop, "CHIL");
+      removePointerByValue(child, "FAMC", drop.id);
+      normalizeSinglePointer(child, "FAMC");
+    });
+    const husbId = firstPointerId(drop.get("HUSB"));
+    const wifeId = firstPointerId(drop.get("WIFE"));
+    [husbId, wifeId].forEach((parentId) => {
+      if (!parentId) {
+        return;
+      }
+      const parent = gedcom.indi(parentId);
+      if (parent) {
+        removePointerByValue(parent, "FAMS", drop.id);
+        normalizeSinglePointer(parent, "FAMS");
+      }
+    });
+    gedcom.fams()?.removeItem(drop.id);
+  });
+  resetRelativesCache();
+  return keep;
+};
+var pruneFamiliesByIds = (gedcom, famIds) => {
+  const unique = [...new Set(famIds.filter(Boolean))];
+  if (unique.length === 0) {
+    return 0;
+  }
+  gedcom.indis()?.forEach((indi) => {
+    if (!indi) {
+      return;
+    }
+    unique.forEach((famId) => {
+      removePointerByValue(indi, "FAMS", famId);
+      removePointerByValue(indi, "FAMC", famId);
+    });
+  });
+  unique.forEach((famId) => {
+    gedcom.fams()?.removeItem(famId);
+  });
+  return unique.length;
+};
+var findSharedSpouseFamily = (parent, coParentId) => {
+  let found;
+  parent.getFamilies("FAMS")?.forEach((fam) => {
+    if (!found && fam && familyHasParent(fam, coParentId)) {
+      found = fam;
+    }
+  });
+  return found;
+};
+var unlinkRelative = (anchor, relative, kind) => {
+  if (!anchor.id || !relative.id || anchor.id === relative.id) {
+    return false;
+  }
+  let changed = false;
+  if (kind === "spouse") {
+    anchor.getFamilies("FAMS")?.forEach((fam) => {
+      if (!fam?.id || !familyHasParent(fam, relative.id)) {
+        return;
+      }
+      if (firstPointerId(fam.get("HUSB")) === relative.id) {
+        fam.remove("HUSB");
+        changed = true;
+      }
+      if (firstPointerId(fam.get("WIFE")) === relative.id) {
+        fam.remove("WIFE");
+        changed = true;
+      }
+      changed = removePointerByValue(relative, "FAMS", fam.id) || changed;
+    });
+  } else if (kind === "parent") {
+    anchor.getFamilies("FAMC")?.forEach((fam) => {
+      if (!fam?.id || !familyHasParent(fam, relative.id)) {
+        return;
+      }
+      if (firstPointerId(fam.get("HUSB")) === relative.id) {
+        fam.remove("HUSB");
+        changed = true;
+      }
+      if (firstPointerId(fam.get("WIFE")) === relative.id) {
+        fam.remove("WIFE");
+        changed = true;
+      }
+      changed = removePointerByValue(relative, "FAMS", fam.id) || changed;
+    });
+  } else if (kind === "sibling") {
+    anchor.getFamilies("FAMC")?.forEach((fam) => {
+      if (!fam?.id || !familyHasChild(fam, relative.id)) {
+        return;
+      }
+      changed = removePointerByValue(fam, "CHIL", relative.id) || changed;
+      changed = removePointerByValue(relative, "FAMC", fam.id) || changed;
+    });
+  } else {
+    anchor.getFamilies("FAMS")?.forEach((fam) => {
+      if (!fam?.id || !familyHasChild(fam, relative.id)) {
+        return;
+      }
+      changed = removePointerByValue(fam, "CHIL", relative.id) || changed;
+      changed = removePointerByValue(relative, "FAMC", fam.id) || changed;
+    });
+  }
+  if (changed) {
+    const gedcom = anchor.getGedcom() ?? relative.getGedcom();
+    if (gedcom) {
+      pruneEmptyFamilies(gedcom);
+    }
+    resetRelativesCache();
+  }
+  return changed;
+};
+var deleteIndividual = (gedcom, indiId) => {
+  const indi = gedcom.indi(indiId);
+  if (!indi?.id) {
+    return false;
   }
-  setChildPedigree(fam, child, pedigree, parent);
+  const famsIds = pointerIds(indi.get("FAMS"));
+  const famcIds = pointerIds(indi.get("FAMC"));
+  famsIds.forEach((famId) => {
+    const fam = gedcom.fam(famId);
+    if (!fam) {
+      return;
+    }
+    if (firstPointerId(fam.get("HUSB")) === indiId) {
+      fam.remove("HUSB");
+    }
+    if (firstPointerId(fam.get("WIFE")) === indiId) {
+      fam.remove("WIFE");
+    }
+  });
+  famcIds.forEach((famId) => {
+    const fam = gedcom.fam(famId);
+    if (fam) {
+      removePointerByValue(fam, "CHIL", indiId);
+    }
+  });
+  gedcom.fams()?.forEach((fam) => {
+    if (fam && familyHasChild(fam, indiId)) {
+      removePointerByValue(fam, "CHIL", indiId);
+    }
+    if (fam && familyHasParent(fam, indiId)) {
+      if (firstPointerId(fam.get("HUSB")) === indiId) {
+        fam.remove("HUSB");
+      }
+      if (firstPointerId(fam.get("WIFE")) === indiId) {
+        fam.remove("WIFE");
+      }
+    }
+  });
+  gedcom.indis()?.removeItem(indiId);
+  pruneEmptyFamilies(gedcom);
+  resetRelativesCache();
   return true;
 };
-var findReusableParentChildFamily = (parent, child) => {
+var findReusableParentChildFamily = (parent, child, options) => {
   if (!parent.id || !child.id) {
     return void 0;
   }
+  const reuseParentFamilies = options?.reuseParentFamilies !== false;
+  const gedcom = parent.getGedcom() ?? child.getGedcom();
   let reusableFamc;
+  let coupleFam;
   let already = false;
+  const noteCoupleWith = (coParentId) => {
+    if (!coParentId || coParentId === parent.id || coupleFam || !parent.id) {
+      return;
+    }
+    const shared = findSharedSpouseFamily(parent, coParentId);
+    if (shared) {
+      coupleFam = shared;
+    }
+  };
   child.getFamilies("FAMC")?.forEach((fam) => {
     if (!fam) {
       return;
@@ -1296,6 +1948,8 @@ var findReusableParentChildFamily = (parent, child) => {
       already = true;
       return;
     }
+    pointerIds(fam.get("HUSB")).forEach(noteCoupleWith);
+    pointerIds(fam.get("WIFE")).forEach(noteCoupleWith);
     if (!reusableFamc && canAttachAsSpouse(fam, parent)) {
       reusableFamc = fam;
     }
@@ -1303,9 +1957,21 @@ var findReusableParentChildFamily = (parent, child) => {
   if (already) {
     return "already";
   }
+  if (coupleFam) {
+    return coupleFam;
+  }
   if (reusableFamc) {
     return reusableFamc;
   }
+  if (options?.targetFamilyId && gedcom) {
+    const target = gedcom.fam(options.targetFamilyId);
+    if (target && (familyHasParent(target, parent.id) || canAttachAsSpouse(target, parent))) {
+      return target;
+    }
+  }
+  if (!reuseParentFamilies) {
+    return void 0;
+  }
   const parentFams = [];
   parent.getFamilies("FAMS")?.forEach((fam) => {
     if (fam) {
@@ -1317,26 +1983,40 @@ var findReusableParentChildFamily = (parent, child) => {
   }
   return void 0;
 };
-
-// src/factories/cache-factory.ts
-var defaultCacheFactory = () => {
-  let cache = null;
-  return {
-    getItem: async () => cache,
-    setItem: async (value) => {
-      cache = value;
+var consolidateChildIntoFamily = (child, keep) => {
+  if (!child.id || !keep.id) {
+    return [];
+  }
+  const keepParentIds = /* @__PURE__ */ new Set([
+    ...pointerIds(keep.get("HUSB")),
+    ...pointerIds(keep.get("WIFE"))
+  ]);
+  const removed = [];
+  child.getFamilies("FAMC")?.forEach((fam) => {
+    if (!fam?.id || fam.id === keep.id) {
+      return;
     }
-  };
-};
-var cacheFactory = defaultCacheFactory;
-var setCacheManagerFactory = (factory) => {
-  cacheFactory = factory;
-};
-var getCacheManagerFactory = () => {
-  return cacheFactory;
-};
-var resetCacheManagerFactory = () => {
-  cacheFactory = defaultCacheFactory;
+    const famParentIds = [
+      ...pointerIds(fam.get("HUSB")),
+      ...pointerIds(fam.get("WIFE"))
+    ];
+    if (famParentIds.length === 0 || !famParentIds.every((id) => keepParentIds.has(id))) {
+      return;
+    }
+    removePointerByValue(fam, "CHIL", child.id);
+    normalizeSinglePointer(fam, "CHIL");
+    removePointerByValue(child, "FAMC", fam.id);
+    normalizeSinglePointer(child, "FAMC");
+    removed.push(fam.id);
+  });
+  const gedcom = child.getGedcom() ?? keep.getGedcom();
+  if (gedcom && removed.length > 0) {
+    pruneEmptyFamilies(gedcom);
+  }
+  if (removed.length > 0) {
+    resetRelativesCache();
+  }
+  return removed;
 };
 
 // src/factories/date-locale-factory.ts
@@ -1563,378 +2243,111 @@ var chars = [
   "s",
   "\u015B",
   "\u0161",
-  "\xDF",
-  "sz",
-  "t",
-  "ty",
-  "u",
-  "\xFA",
-  "\xFC",
-  "\u0171",
-  "\xFB",
-  "\xF9",
-  "\u016B",
-  "v",
-  "w",
-  "x",
-  "y",
-  "z",
-  "zs"
-];
-var alphabets = chars.reduce((acc, curr, idx) => {
-  acc[curr] = idx;
-  return acc;
-}, {});
-var convertAlphabet = (value) => {
-  return value.toLowerCase().replace(/(dzs|cs|dz|gy|ly|ny|sz|ty|zs|.)/gi, (_, m) => {
-    const code = alphabets[m];
-    return code !== void 0 ? `${`${code}`.padStart(`${chars.length}`.length, "0")}` : m;
-  });
-};
-var sortValue = (valueA, valueB) => {
-  return convertAlphabet(valueA).localeCompare(convertAlphabet(valueB));
-};
-var getNameDesc = (nameOrder = "first-last") => (itemA, _keyA, itemB, _keyB) => {
-  const valueA = nameOrder === "first-last" ? [itemA.NAME?.GIVN || "", itemA.NAME?.SURN || ""] : [itemA.NAME?.SURN || "", itemA.NAME?.GIVN || ""];
-  const valueB = nameOrder === "first-last" ? [itemB.NAME?.GIVN || "", itemB.NAME?.SURN || ""] : [itemB.NAME?.SURN || "", itemB.NAME?.GIVN || ""];
-  return -sortValue(
-    valueA.filter(Boolean).join(" "),
-    valueB.filter(Boolean).join(" ")
-  );
-};
-var getNameAsc = (nameOrder = "first-last") => (itemA, _keyA, itemB, _keyB) => {
-  const valueA = nameOrder === "first-last" ? [itemA.NAME?.GIVN || "", itemA.NAME?.SURN || ""] : [itemA.NAME?.SURN || "", itemA.NAME?.GIVN || ""];
-  const valueB = nameOrder === "first-last" ? [itemB.NAME?.GIVN || "", itemB.NAME?.SURN || ""] : [itemB.NAME?.SURN || "", itemB.NAME?.GIVN || ""];
-  return sortValue(
-    valueA.filter(Boolean).join(" "),
-    valueB.filter(Boolean).join(" ")
-  );
-};
-var getBirthAsc = (itemA, _keyA, itemB, _keyB) => {
-  const birthA = itemA?.BIRT?.index(0);
-  const birthB = itemB?.BIRT?.index(0);
-  const valueA = birthA?.DATE?.rawValue;
-  const valueB = birthB?.DATE?.rawValue;
-  if (valueA?.getTime() === valueB?.getTime()) {
-    return 0;
-  }
-  if (!valueA || valueB && valueA > valueB) {
-    return 1;
-  }
-  return -1;
-};
-var getNameAscAndBirth = (nameOrder = "first-last") => (itemA, keyA, itemB, keyB) => {
-  const nameSort = getNameAsc(nameOrder)(itemA, keyA, itemB, keyB);
-  if (nameSort !== 0) {
-    return nameSort;
-  }
-  return getBirthAsc(itemA, keyA, itemB);
-};
-var getMarriageAsc = (person, famType = "FAMS") => (itemA, _keyA, itemB, _keyB) => {
-  if (!person && famType === "FAMS") {
-    return 0;
-  }
-  const familyA = getFamilyWith(itemA, person);
-  const familyB = getFamilyWith(itemB, person);
-  const marriageA = familyA?.MARR?.DATE?.rawValue;
-  const marriageB = familyB?.MARR?.DATE?.rawValue;
-  if (marriageA?.getTime() === marriageB?.getTime()) {
-    return 0;
-  }
-  if (!marriageA || marriageB && marriageA > marriageB) {
-    return 1;
-  }
-  return -1;
-};
-var getMarriageAscAndChildBirth = (person) => (itemA, keyA, itemB, keyB) => {
-  const marriageSort = getMarriageAsc(person)(itemA, keyA, itemB, keyB);
-  if (marriageSort !== 0) {
-    return marriageSort;
-  }
-  const familyA = getFamilyWith(itemA, person);
-  const familyB = getFamilyWith(itemB, person);
-  const childA = familyA?.getChildren().orderBy(BIRTH_ASC).index(0);
-  const childB = familyB?.getChildren().orderBy(BIRTH_ASC).index(0);
-  return getBirthAsc(childA, keyA, childB);
-};
-var getMarriageAscAndBirth = (person) => (itemA, keyA, itemB, keyB) => {
-  const marriageSort = getMarriageAsc(person, "FAMC")(
-    itemA,
-    keyA,
-    itemB,
-    keyB
-  );
-  if (marriageSort !== 0) {
-    return marriageSort;
-  }
-  return getBirthAsc(itemA, keyA, itemB);
-};
-var getGedcomId = (gedcom) => {
-  if (!gedcom) {
-    return "unknown";
-  }
-  const treeId = gedcom.getTreeId?.() || "";
-  const treeName = gedcom.getTreeName?.() || "";
-  const sanitizedName = treeName.toLowerCase().replace(/[^a-z0-9]+/g, "_").replace(/^_+|_+$/g, "");
-  if (treeId && sanitizedName) {
-    return `${treeId}_${sanitizedName}`;
-  } else if (treeId) {
-    return treeId;
-  } else if (sanitizedName) {
-    return sanitizedName;
-  }
-  return `gedcom_${gedcom.refcount}`;
-};
-var caches = {
-  pathCache: {},
-  relativesOnDegreeCache: {},
-  relativesOnLevelCache: {},
-  profilePictureCache: {}
-};
-var cacheDbs;
-var getCacheDbs = () => {
-  if (!cacheDbs) {
-    const getInstance = getCacheManagerFactory();
-    cacheDbs = {
-      pathCache: getInstance(
-        "ftv",
-        "Main",
-        "path",
-        true
-      ),
-      relativesOnDegreeCache: getInstance("ftv", "Main", "path", true),
-      relativesOnLevelCache: getInstance(
-        "ftv",
-        "Main",
-        "path",
-        true
-      ),
-      profilePictureCache: getInstance(
-        "ftv",
-        "Main",
-        "images",
-        false
-      )
-    };
-  }
-  return cacheDbs;
-};
-var storeCache = {
-  // NOTE: pathCache, relativesOnLevelCache, and relativesOnDegreeCache are intentionally
-  // kept in memory only. These debounced functions exist to satisfy the type system
-  // but are never called.
-  pathCache: debounce((value) => {
-    if (value) {
-      getCacheDbs().pathCache.setItem(value);
-    }
-  }, 50),
-  relativesOnLevelCache: debounce((value) => {
-    if (value) {
-      getCacheDbs().relativesOnLevelCache.setItem(value);
-    }
-  }, 50),
-  relativesOnDegreeCache: debounce((value) => {
-    if (value) {
-      getCacheDbs().relativesOnDegreeCache.setItem(value);
-    }
-  }, 50),
-  // profilePictureCache IS persisted to IndexedDB
-  profilePictureCache: debounce((value) => {
-    if (value) {
-      getCacheDbs().profilePictureCache.setItem(value);
-    }
-  }, 100)
-};
-var cacheInitialized = false;
-var initializeCache = async () => {
-  if (cacheInitialized) {
-    return;
-  }
-  cacheInitialized = true;
-  try {
-    const profilePictureData = await getCacheDbs().profilePictureCache.getItem();
-    if (profilePictureData) {
-      caches.profilePictureCache = profilePictureData;
-    }
-  } catch (_error) {
-  }
+  "\xDF",
+  "sz",
+  "t",
+  "ty",
+  "u",
+  "\xFA",
+  "\xFC",
+  "\u0171",
+  "\xFB",
+  "\xF9",
+  "\u016B",
+  "v",
+  "w",
+  "x",
+  "y",
+  "z",
+  "zs"
+];
+var alphabets = chars.reduce((acc, curr, idx) => {
+  acc[curr] = idx;
+  return acc;
+}, {});
+var convertAlphabet = (value) => {
+  return value.toLowerCase().replace(/(dzs|cs|dz|gy|ly|ny|sz|ty|zs|.)/gi, (_, m) => {
+    const code = alphabets[m];
+    return code !== void 0 ? `${`${code}`.padStart(`${chars.length}`.length, "0")}` : m;
+  });
 };
-var resetRelativesCache = () => {
-  caches.relativesOnDegreeCache = {};
-  caches.relativesOnLevelCache = {};
+var sortValue = (valueA, valueB) => {
+  return convertAlphabet(valueA).localeCompare(convertAlphabet(valueB));
 };
-var relativesCache = (cacheKey) => (gedcom, key, subKey, value) => {
-  const gedcomId = getGedcomId(gedcom);
-  const fullKey = `${gedcomId}:${key}`;
-  const cache = caches[cacheKey];
-  if (!cache) {
-    caches[cacheKey] = {};
-  }
-  if (value) {
-    const typedCache2 = caches[cacheKey];
-    if (!typedCache2[fullKey]) {
-      typedCache2[fullKey] = {};
-    }
-    typedCache2[fullKey][subKey] = value;
-    return typedCache2[fullKey][subKey];
-  }
-  const typedCache = caches[cacheKey];
-  return typedCache?.[fullKey]?.[subKey];
+var getNameDesc = (nameOrder = "first-last") => (itemA, _keyA, itemB, _keyB) => {
+  const valueA = nameOrder === "first-last" ? [itemA.NAME?.GIVN || "", itemA.NAME?.SURN || ""] : [itemA.NAME?.SURN || "", itemA.NAME?.GIVN || ""];
+  const valueB = nameOrder === "first-last" ? [itemB.NAME?.GIVN || "", itemB.NAME?.SURN || ""] : [itemB.NAME?.SURN || "", itemB.NAME?.GIVN || ""];
+  return -sortValue(
+    valueA.filter(Boolean).join(" "),
+    valueB.filter(Boolean).join(" ")
+  );
 };
-var pathCache = (gedcom, key, value) => {
-  const gedcomId = getGedcomId(gedcom);
-  const fullKey = `${gedcomId}:${key}`;
-  if (!caches.pathCache) {
-    caches.pathCache = {};
-  }
-  if (value && caches.pathCache) {
-    caches.pathCache[fullKey] = value;
-    return caches.pathCache[fullKey];
-  }
-  return caches.pathCache?.[fullKey];
+var getNameAsc = (nameOrder = "first-last") => (itemA, _keyA, itemB, _keyB) => {
+  const valueA = nameOrder === "first-last" ? [itemA.NAME?.GIVN || "", itemA.NAME?.SURN || ""] : [itemA.NAME?.SURN || "", itemA.NAME?.GIVN || ""];
+  const valueB = nameOrder === "first-last" ? [itemB.NAME?.GIVN || "", itemB.NAME?.SURN || ""] : [itemB.NAME?.SURN || "", itemB.NAME?.GIVN || ""];
+  return sortValue(
+    valueA.filter(Boolean).join(" "),
+    valueB.filter(Boolean).join(" ")
+  );
 };
-var profilePictureCache = (gedcom, key, value) => {
-  const gedcomId = getGedcomId(gedcom);
-  const fullKey = `${gedcomId}:${key}`;
-  if (!caches.profilePictureCache) {
-    caches.profilePictureCache = {};
+var getBirthAsc = (itemA, _keyA, itemB, _keyB) => {
+  const birthA = itemA?.BIRT?.index(0);
+  const birthB = itemB?.BIRT?.index(0);
+  const valueA = birthA?.DATE?.rawValue;
+  const valueB = birthB?.DATE?.rawValue;
+  if (valueA?.getTime() === valueB?.getTime()) {
+    return 0;
   }
-  if (value && caches.profilePictureCache) {
-    caches.profilePictureCache[fullKey] = value;
-    storeCache.profilePictureCache(caches.profilePictureCache);
-    return caches.profilePictureCache[fullKey];
+  if (!valueA || valueB && valueA > valueB) {
+    return 1;
   }
-  const cached = caches.profilePictureCache?.[fullKey];
-  return cached;
+  return -1;
 };
-var isNonBiologicalPath = (path) => path.some(
-  (item) => item.relation && item.relation !== "biological" /* BIOLOGICAL */
-);
-var invertHop = (kinship) => {
-  if (kinship === "parent") {
-    return "child";
-  }
-  if (kinship === "child") {
-    return "parent";
+var getNameAscAndBirth = (nameOrder = "first-last") => (itemA, keyA, itemB, keyB) => {
+  const nameSort = getNameAsc(nameOrder)(itemA, keyA, itemB, keyB);
+  if (nameSort !== 0) {
+    return nameSort;
   }
-  return kinship;
+  return getBirthAsc(itemA, keyA, itemB);
 };
-var hopRelation = (from, toIndi, kinship, inherited) => {
-  if (kinship === "parent" || kinship === "child") {
-    const parent = kinship === "parent" ? toIndi : from.indi;
-    const child = kinship === "parent" ? from.indi : toIndi;
-    const currentRelation = child.getParentType(parent);
-    if (currentRelation && currentRelation !== "biological" /* BIOLOGICAL */) {
-      return currentRelation;
-    }
-  }
-  if (inherited && inherited !== "biological" /* BIOLOGICAL */) {
-    return inherited;
+var getMarriageAsc = (person, famType = "FAMS") => (itemA, _keyA, itemB, _keyB) => {
+  if (!person && famType === "FAMS") {
+    return 0;
   }
-  return void 0;
-};
-var rebuildPathFromHops = (hops, skipRelation = false) => {
-  if (hops.length === 0) {
-    return [];
+  const familyA = getFamilyWith(itemA, person);
+  const familyB = getFamilyWith(itemB, person);
+  const marriageA = familyA?.MARR?.DATE?.rawValue;
+  const marriageB = familyB?.MARR?.DATE?.rawValue;
+  if (marriageA?.getTime() === marriageB?.getTime()) {
+    return 0;
   }
-  const path = [
-    {
-      indi: hops[0].indi,
-      kinship: "self",
-      level: 0,
-      levelUp: 0,
-      levelDown: 0,
-      degree: 0
-    }
-  ];
-  for (let i = 1; i < hops.length; i++) {
-    const prev = path[i - 1];
-    const { indi, kinship } = hops[i];
-    const relation = skipRelation ? void 0 : hopRelation(prev, indi, kinship, prev.relation);
-    if (kinship === "parent") {
-      path.push({
-        indi,
-        kinship,
-        relation,
-        level: prev.level + 1,
-        levelUp: prev.levelUp + 1,
-        levelDown: prev.levelDown,
-        degree: prev.degree
-      });
-      continue;
-    }
-    if (kinship === "child") {
-      path.push({
-        indi,
-        kinship,
-        relation,
-        level: prev.level - 1,
-        levelUp: prev.levelUp,
-        levelDown: prev.levelDown + 1,
-        degree: prev.levelUp ? prev.level > 0 ? prev.levelUp - prev.level + 1 : prev.levelDown - Math.abs(prev.level) : 0
-      });
-      continue;
-    }
-    path.push({
-      indi,
-      kinship,
-      relation,
-      level: prev.level,
-      levelUp: prev.levelUp,
-      levelDown: prev.levelDown,
-      degree: prev.degree
-    });
+  if (!marriageA || marriageB && marriageA > marriageB) {
+    return 1;
   }
-  return path;
+  return -1;
 };
-var storePathIfBetter = (gedcom, fromId, toId, path) => {
-  const key = `${fromId}|${toId}`;
-  const existing = pathCache(gedcom, key);
-  if (existing && (!isNonBiologicalPath(existing) || isNonBiologicalPath(path))) {
-    return;
+var getMarriageAscAndChildBirth = (person) => (itemA, keyA, itemB, keyB) => {
+  const marriageSort = getMarriageAsc(person)(itemA, keyA, itemB, keyB);
+  if (marriageSort !== 0) {
+    return marriageSort;
   }
-  pathCache(gedcom, key, path);
+  const familyA = getFamilyWith(itemA, person);
+  const familyB = getFamilyWith(itemB, person);
+  const childA = familyA?.getChildren().orderBy(BIRTH_ASC).index(0);
+  const childB = familyB?.getChildren().orderBy(BIRTH_ASC).index(0);
+  return getBirthAsc(childA, keyA, childB);
 };
-var cacheDiscoveredPath = (gedcom, path) => {
-  const n = path.length;
-  if (n < 2) {
-    return;
-  }
-  for (let i = 0; i < n; i++) {
-    const fromId = path[i].indi.id;
-    if (!fromId) {
-      continue;
-    }
-    for (let j = i + 1; j < n; j++) {
-      const toId = path[j].indi.id;
-      if (!toId) {
-        continue;
-      }
-      const isOriginalPair = i === 0 && j === n - 1;
-      const isDirectHop = j === i + 1;
-      const slice = path.slice(i, j + 1);
-      const sliceMixed = isNonBiologicalPath(slice);
-      if (!isOriginalPair && !isDirectHop && sliceMixed) {
-        continue;
-      }
-      const forward = i === 0 ? slice : rebuildPathFromHops(slice, !sliceMixed);
-      const reverseHops = [
-        {
-          indi: slice[slice.length - 1].indi,
-          kinship: "self"
-        }
-      ];
-      for (let k = slice.length - 2; k >= 0; k--) {
-        reverseHops.push({
-          indi: slice[k].indi,
-          kinship: invertHop(slice[k + 1].kinship)
-        });
-      }
-      const reverse = rebuildPathFromHops(reverseHops, !sliceMixed);
-      storePathIfBetter(gedcom, fromId, toId, forward);
-      storePathIfBetter(gedcom, toId, fromId, reverse);
-    }
+var getMarriageAscAndBirth = (person) => (itemA, keyA, itemB, keyB) => {
+  const marriageSort = getMarriageAsc(person, "FAMC")(
+    itemA,
+    keyA,
+    itemB,
+    keyB
+  );
+  if (marriageSort !== 0) {
+    return marriageSort;
   }
+  return getBirthAsc(itemA, keyA, itemB);
 };
 
 // src/utils/get-all-prop.ts
@@ -4177,13 +4590,17 @@ var Indi = class extends Common {
     }
     return fam;
   }
-  addChild(child, pedigree) {
+  addChild(child, pedigree, options) {
     if (!this.id || !child?.id || this.id === child.id || !this._gedcom) {
       return void 0;
     }
     const existing = findReusableParentChildFamily(
       this,
-      child
+      child,
+      {
+        reuseParentFamilies: options?.reuseParentFamilies,
+        targetFamilyId: options?.targetFamilyId
+      }
     );
     if (existing === "already") {
       const fam2 = child.getFamilies("FAMC")?.find(
@@ -4206,10 +4623,16 @@ var Indi = class extends Common {
     if (!fam.addChild(child, pedigree, this)) {
       return void 0;
     }
+    if (existing) {
+      consolidateChildIntoFamily(child, fam);
+    }
     return fam;
   }
-  addParent(parent, pedigree) {
-    return parent.addChild(this, pedigree);
+  addParent(parent, pedigree, options) {
+    return parent.addChild(this, pedigree, {
+      reuseParentFamilies: false,
+      targetFamilyId: options?.targetFamilyId
+    });
   }
   /**
    * Link an existing top-level OBJE record to this individual (`1 OBJE @On@`).
@@ -8646,7 +9069,7 @@ var collectExtensionTagsFrom = (node, into = /* @__PURE__ */ new Set()) => {
 // package.json
 var package_default = {
   name: "@treeviz/gedcom-parser",
-  version: "2.1.3"};
+  version: "2.1.5"};
 
 // src/utils/get-product-details.ts
 var isDevelopment = () => {
@@ -10312,4 +10735,4 @@ var createEmptyGedcom = (options) => {
   return gedcom;
 };
 
-export { ACCEPTED_DATE_FORMATS, ACCEPTED_DATE_FORMATS_REGEX, ADOPTED, APP_BRANDING, BIOLOGICAL, BIRTH, BIRTH_ASC, BIRTH_DESC, Common, CommonDate, CommonName, CommonNote, CustomTags, DATE_ASC, DATE_DESC, DEATH_ASC, DEATH_DESC, DEFAULT, DEFAULT_GEDCOM_EXPORT_VERSION, EVERY, Existed, FEMALE, FOSTER, FRIEND, Fam, Families, GEDCOM7_CALENDARS, GEDCOM7_PEDI_VALUES, GEDCOM7_RESN_VALUES, GEDCOM7_ROLE_VALUES, GEDCOM7_SEX_VALUES, GEDCOM_EXPORT_VERSIONS, GEDZIP_EXTENSION, GEDZIP_GEDCOM_ENTRY, GEDZIP_MIME, GedCom, parser_default as GedcomTree, ID_GETTER_REG, ID_REG, ID_SPLIT_REG, Indi, Individuals, KinshipTranslator, KinshipTranslatorBasic, KinshipTranslatorDe as KinshipTranslatorDE, KinshipTranslatorEn as KinshipTranslatorEN, KinshipTranslatorEs as KinshipTranslatorES, KinshipTranslatorFr as KinshipTranslatorFR, KinshipTranslatorHU, KinshipTranslatorRu as KinshipTranslatorRU, LINE_REG, List, MALE, MAX_FILE_SIZE_TO_SYNC, ORIG_HEAD_TAG, OTHER, Obje, Objects, PARTNER, PEDIGREE_VALUES, PartnerType, PlaceType, REF_LINE_REG, Range, RelationType, Repo, Repositories, SEALING, SINGLE, SPOUSE, STEP, Sour, Sources, Subm, Submitters, TREEVIZ_EXTENSION_BASE_URI, TREEVIZ_EXTENSION_URIS, UNKOWN, addFamilyFact, addIndividualFact, addNonEvent, applyGedcom7DatePhrases, applyGedcom7Enumerations, applyGedcom7RecordMetadata, attachChildToFamily, attachSpouseToFamily, buildGedzip, buildGedzipBlob, bytesToDataUrl, cacheDiscoveredPath, canAttachAsSpouse, collectExtensionTagsFrom, commonDateFormatter, create, createCommon, createCommonDate, createCommonName, createCommonNote, createEmptyGedcom, createFam, createGedCom, createGedcomUid, createIndi, createObje, createProxy, createRepo, createSour, createSubm, dateFormatter, parser_default as default, downloadGedzipMedia, ensureExtensionSchema, extractGedzip, extractGedzipGedcom, extractSeparationYears, extractSplitPoints, familyHasChild, familyHasParent, findMatchingRangeForSplitRange, findReusableParentChildFamily, firstPointerId, formatGedcom7Timestamp, fromTuple, generateSplitRanges, getAllProp, getBirthAsc, getCacheManagerFactory, getDateLocale, getExtensionSchema, getFamilyWith, getFileExtension, getI18n, getKinshipTranslatorClass, getListTag, getMarriageAsc, getMarriageAscAndBirth, getMarriageAscAndChildBirth, getName, getNameAsc, getNameAscAndBirth, getNameDesc, getPlaceParserProvider, getPlaceParts, getPlaceTranslatorProvider, getPlaces, getRawSize, getValidKey, getValidKeys, getValidTag, getVersion, hungarianOrdinalize, i18n, idGetter, implemented, inRange, inferMediaForm, initializeCache, isCommonDate, isDevelopment, isGedcom7, isGedcomString, isGedzipContainer, isId, isImageFormat, isIntersectedRange, isObjePointer, isOnlyMainProp, isRangeContained, isRemoteOrEmbeddedMediaUrl, isValidKey, makePointer, marriageDateFormatter, mergeGedcoms, mergeMediaLists, nameFormatter, nextRecordId, normalizeGedcomVersion, notImplemented, noteDateFormatter, ordinalize, parseGedcom7CalendarPrefix, parseRangeBounds, pathCache, placeTranslator, pointerIds, profilePictureCache, registerExtensionTag, relativesCache, remountGedzipMediaAsDataUrls, resetCacheManagerFactory, resetDateLocaleProvider, resetI18nProvider, resetKinshipTranslatorClass, resetPlaceParserProvider, resetPlaceTranslatorProvider, resetRelativesCache, resolveLocalMediaUrl, resolveMediaContent, resolveObjeForm, rewriteGedcomFilePaths, setCacheManagerFactory, setCauseOfDeath, setChildPedigree, setDateLocaleProvider, setDeceased, setFamilyMarriage, setI18nProvider, setKinshipTranslatorClass, setLocalMediaResolver, setMediaContentResolver, setNestedGroup, setPlaceParserProvider, setPlaceTranslatorProvider, splitOverlappingRanges, splitRange, spouseTagFor, toGedcomPedigree, translators_exports as translators, updateFactRecord, validateGedcomContent, withGedcom7Calendar };
+export { ACCEPTED_DATE_FORMATS, ACCEPTED_DATE_FORMATS_REGEX, ADOPTED, APP_BRANDING, BIOLOGICAL, BIRTH, BIRTH_ASC, BIRTH_DESC, Common, CommonDate, CommonName, CommonNote, CustomTags, DATE_ASC, DATE_DESC, DEATH_ASC, DEATH_DESC, DEFAULT, DEFAULT_GEDCOM_EXPORT_VERSION, EVERY, Existed, FEMALE, FOSTER, FRIEND, Fam, Families, GEDCOM7_CALENDARS, GEDCOM7_PEDI_VALUES, GEDCOM7_RESN_VALUES, GEDCOM7_ROLE_VALUES, GEDCOM7_SEX_VALUES, GEDCOM_EXPORT_VERSIONS, GEDZIP_EXTENSION, GEDZIP_GEDCOM_ENTRY, GEDZIP_MIME, GedCom, parser_default as GedcomTree, ID_GETTER_REG, ID_REG, ID_SPLIT_REG, Indi, Individuals, KinshipTranslator, KinshipTranslatorBasic, KinshipTranslatorDe as KinshipTranslatorDE, KinshipTranslatorEn as KinshipTranslatorEN, KinshipTranslatorEs as KinshipTranslatorES, KinshipTranslatorFr as KinshipTranslatorFR, KinshipTranslatorHU, KinshipTranslatorRu as KinshipTranslatorRU, LINE_REG, List, MALE, MAX_FILE_SIZE_TO_SYNC, ORIG_HEAD_TAG, OTHER, Obje, Objects, PARTNER, PEDIGREE_VALUES, PartnerType, PlaceType, REF_LINE_REG, Range, RelationType, Repo, Repositories, SEALING, SINGLE, SPOUSE, STEP, Sour, Sources, Subm, Submitters, TREEVIZ_EXTENSION_BASE_URI, TREEVIZ_EXTENSION_URIS, UNKOWN, addFamilyFact, addIndividualFact, addNonEvent, applyGedcom7DatePhrases, applyGedcom7Enumerations, applyGedcom7RecordMetadata, attachChildToFamily, attachSpouseToFamily, buildGedzip, buildGedzipBlob, bytesToDataUrl, cacheDiscoveredPath, canAttachAsSpouse, collectExtensionTagsFrom, commonDateFormatter, consolidateChildIntoFamily, coupleKeyForFam, create, createCommon, createCommonDate, createCommonName, createCommonNote, createEmptyGedcom, createFam, createGedCom, createGedcomUid, createIndi, createObje, createProxy, createRepo, createSour, createSubm, dateFormatter, parser_default as default, deleteIndividual, downloadGedzipMedia, ensureExtensionSchema, extractGedzip, extractGedzipGedcom, extractSeparationYears, extractSplitPoints, familyHasChild, familyHasParent, findDegenerateFamiliesForIndi, findDuplicateCoupleFamiliesForIndi, findMatchingRangeForSplitRange, findReusableParentChildFamily, firstPointerId, formatGedcom7Timestamp, fromTuple, generateSplitRanges, getAllProp, getBirthAsc, getCacheManagerFactory, getDateLocale, getExtensionSchema, getFamilyWith, getFileExtension, getI18n, getKinshipTranslatorClass, getListTag, getMarriageAsc, getMarriageAscAndBirth, getMarriageAscAndChildBirth, getName, getNameAsc, getNameAscAndBirth, getNameDesc, getPlaceParserProvider, getPlaceParts, getPlaceTranslatorProvider, getPlaces, getRawSize, getValidKey, getValidKeys, getValidTag, getVersion, hungarianOrdinalize, i18n, idGetter, implemented, inRange, inferMediaForm, initializeCache, isCommonDate, isDegenerateFamily, isDevelopment, isGedcom7, isGedcomString, isGedzipContainer, isId, isImageFormat, isIntersectedRange, isObjePointer, isOnlyMainProp, isRangeContained, isRemoteOrEmbeddedMediaUrl, isValidKey, makePointer, marriageDateFormatter, mergeDuplicateCoupleFamilies, mergeGedcoms, mergeMediaLists, nameFormatter, nextRecordId, normalizeGedcomVersion, notImplemented, noteDateFormatter, ordinalize, parseGedcom7CalendarPrefix, parseRangeBounds, pathCache, placeTranslator, pointerIds, profilePictureCache, pruneEmptyFamilies, pruneFamiliesByIds, registerExtensionTag, relativesCache, remountGedzipMediaAsDataUrls, removePointerByValue, resetCacheManagerFactory, resetDateLocaleProvider, resetI18nProvider, resetKinshipTranslatorClass, resetPlaceParserProvider, resetPlaceTranslatorProvider, resetRelativesCache, resolveLocalMediaUrl, resolveMediaContent, resolveObjeForm, rewriteGedcomFilePaths, setCacheManagerFactory, setCauseOfDeath, setChildPedigree, setDateLocaleProvider, setDeceased, setFamilyMarriage, setI18nProvider, setKinshipTranslatorClass, setLocalMediaResolver, setMediaContentResolver, setNestedGroup, setPlaceParserProvider, setPlaceTranslatorProvider, splitOverlappingRanges, splitRange, spouseTagFor, toGedcomPedigree, translators_exports as translators, unlinkRelative, updateFactRecord, validateGedcomContent, withGedcom7Calendar };