@famtree/core 0.1.0

package/dist/constants.d.ts

@@ -0,0 +1,9 @@
+declare const NODE = 46;
+declare const R: number;
+declare const GEN_SPACING = 150;
+declare const SIB_STEP = 128;
+declare const SPOUSE_HALF = 64;
+declare const MARGIN = 70;
+declare const LABEL_WRAP = 16;
+declare const LABEL_LINE_H = 13;
+export { NODE, R, GEN_SPACING, SIB_STEP, SPOUSE_HALF, MARGIN, LABEL_WRAP, LABEL_LINE_H };

package/dist/graph.d.ts

@@ -0,0 +1,22 @@
+import type { Genogram, Person, UnionRelationship, ParentChildRelationship, EmotionalRelationship } from "@famtree/schema";
+declare class GenogramGraph {
+    readonly doc: Genogram;
+    readonly people: Map<string, Person>;
+    readonly unions: UnionRelationship[];
+    readonly parentChild: ParentChildRelationship[];
+    readonly emotions: EmotionalRelationship[];
+    private readonly unionById;
+    private readonly pcByChild;
+    private readonly gen;
+    constructor(doc: Genogram);
+    get roster(): Person[];
+    parentLinkOf(id: string): ParentChildRelationship | undefined;
+    parentsOf(id: string): string[];
+    unionHeadedBy(id: string): UnionRelationship | undefined;
+    childrenOfUnion(uid: string): string[];
+    singleChildrenOf(id: string): string[];
+    sortByBirth(ids: string[]): string[];
+    generationOf(id: string): number;
+    private computeGenerations;
+}
+export { GenogramGraph };

package/dist/index.cjs

@@ -0,0 +1,238 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  GEN_SPACING: () => GEN_SPACING,
+  GenerationalLayout: () => GenerationalLayout,
+  GenogramGraph: () => GenogramGraph,
+  LABEL_LINE_H: () => LABEL_LINE_H,
+  LABEL_WRAP: () => LABEL_WRAP,
+  MARGIN: () => MARGIN,
+  NODE: () => NODE,
+  Positions: () => Positions,
+  R: () => R,
+  SIB_STEP: () => SIB_STEP,
+  SPOUSE_HALF: () => SPOUSE_HALF
+});
+module.exports = __toCommonJS(src_exports);
+
+// src/graph.ts
+var isUnion = (r) => r.type === "union";
+var isParentChild = (r) => r.type === "parent-child";
+var isEmotional = (r) => r.type === "emotional";
+var GenogramGraph = class {
+  constructor(doc) {
+    this.doc = doc;
+    this.people = new Map(doc.people.map((p) => [p.id, p]));
+    this.unions = doc.relationships.filter(isUnion);
+    this.parentChild = doc.relationships.filter(isParentChild);
+    this.emotions = doc.relationships.filter(isEmotional);
+    this.unionById = new Map(this.unions.map((u) => [u.id, u]));
+    this.pcByChild = new Map(this.parentChild.map((pc) => [pc.childId, pc]));
+    this.computeGenerations();
+  }
+  doc;
+  people;
+  unions;
+  parentChild;
+  emotions;
+  unionById;
+  pcByChild;
+  gen = /* @__PURE__ */ new Map();
+  get roster() {
+    return this.doc.people;
+  }
+  parentLinkOf(id) {
+    return this.pcByChild.get(id);
+  }
+  parentsOf(id) {
+    const pc = this.pcByChild.get(id);
+    if (!pc) return [];
+    if (pc.unionId) return this.unionById.get(pc.unionId)?.partnerIds ?? [];
+    return pc.parentIds ?? [];
+  }
+  unionHeadedBy(id) {
+    return this.unions.find((u) => u.partnerIds.includes(id));
+  }
+  childrenOfUnion(uid) {
+    return this.parentChild.filter((pc) => pc.unionId === uid).map((pc) => pc.childId);
+  }
+  singleChildrenOf(id) {
+    return this.parentChild.filter((pc) => !pc.unionId && (pc.parentIds ?? []).includes(id)).map((pc) => pc.childId);
+  }
+  sortByBirth(ids) {
+    return [...ids].sort((a, b) => {
+      const pa = this.people.get(a), pb = this.people.get(b);
+      return (pa.birthOrder ?? 99) - (pb.birthOrder ?? 99) || (pa.birthDate ?? "").localeCompare(pb.birthDate ?? "");
+    });
+  }
+  generationOf(id) {
+    return this.gen.get(id) ?? 0;
+  }
+  // Assign each person a generation index, then align partners to the deeper
+  // generation and push descendants below their parents until stable.
+  computeGenerations() {
+    const visit = (id, seen = /* @__PURE__ */ new Set()) => {
+      if (this.gen.has(id)) return this.gen.get(id);
+      if (seen.has(id)) return 0;
+      seen.add(id);
+      const ps = this.parentsOf(id);
+      const val = ps.length ? Math.max(...ps.map((p) => visit(p, seen))) + 1 : 0;
+      this.gen.set(id, val);
+      return val;
+    };
+    for (const p of this.doc.people) visit(p.id);
+    for (let pass = 0; pass < this.doc.people.length; pass++) {
+      let changed = false;
+      for (const u of this.unions) {
+        const [a, b] = u.partnerIds;
+        const m = Math.max(this.gen.get(a), this.gen.get(b));
+        if (this.gen.get(a) !== m || this.gen.get(b) !== m) {
+          this.gen.set(a, m);
+          this.gen.set(b, m);
+          changed = true;
+        }
+      }
+      for (const pc of this.parentChild) {
+        const parents = this.parentsOf(pc.childId);
+        const pg = Math.max(0, ...parents.map((p) => this.gen.get(p)));
+        if (parents.length && this.gen.get(pc.childId) <= pg) {
+          this.gen.set(pc.childId, pg + 1);
+          changed = true;
+        }
+      }
+      if (!changed) break;
+    }
+  }
+};
+
+// src/constants.ts
+var NODE = 46;
+var R = NODE / 2;
+var GEN_SPACING = 150;
+var SIB_STEP = 128;
+var SPOUSE_HALF = 64;
+var MARGIN = 70;
+var LABEL_WRAP = 16;
+var LABEL_LINE_H = 13;
+
+// src/layout.ts
+var Positions = class {
+  constructor(graph, xOf) {
+    this.graph = graph;
+    this.xOf = xOf;
+  }
+  graph;
+  xOf;
+  cx(id) {
+    return this.xOf.get(id) + MARGIN + R;
+  }
+  cy(id) {
+    return this.graph.generationOf(id) * GEN_SPACING + MARGIN + R;
+  }
+  bounds() {
+    const ids = this.graph.roster.map((p) => p.id);
+    return {
+      width: Math.max(...ids.map((id) => this.cx(id))) + MARGIN + 60,
+      height: Math.max(...ids.map((id) => this.cy(id))) + MARGIN + 60
+    };
+  }
+};
+var GenerationalLayout = class {
+  graph;
+  xOf;
+  placedUnion;
+  cursor = 0;
+  layout(graph) {
+    this.graph = graph;
+    this.xOf = /* @__PURE__ */ new Map();
+    this.placedUnion = /* @__PURE__ */ new Set();
+    this.cursor = 0;
+    const roots = graph.roster.map((p) => p.id).filter((id) => graph.parentsOf(id).length === 0).sort((a, b) => (graph.unionHeadedBy(a) ? 0 : 1) - (graph.unionHeadedBy(b) ? 0 : 1));
+    for (const id of roots) this.placeSubtree(id);
+    for (const p of graph.roster) if (!this.xOf.has(p.id)) this.placeSubtree(p.id);
+    for (const pos of graph.doc.layout?.positions ?? []) {
+      this.xOf.set(pos.personId, pos.x);
+    }
+    return new Positions(graph, this.xOf);
+  }
+  placeSubtree(id) {
+    const existing = this.xOf.get(id);
+    if (existing !== void 0) return existing;
+    const union = this.graph.unionHeadedBy(id);
+    if (union && !this.placedUnion.has(union.id)) return this.placeUnion(union, id);
+    const kids = this.orderSiblings(this.graph.singleChildrenOf(id));
+    if (kids.length) {
+      const x2 = this.centerOver(kids);
+      this.xOf.set(id, x2);
+      return x2;
+    }
+    const x = this.cursor;
+    this.cursor += SIB_STEP;
+    this.xOf.set(id, x);
+    return x;
+  }
+  placeUnion(union, anchor) {
+    this.placedUnion.add(union.id);
+    const other = union.partnerIds.find((p) => p !== anchor);
+    const kids = this.orderSiblings(this.graph.childrenOfUnion(union.id));
+    let center;
+    if (kids.length) {
+      center = this.centerOver(kids);
+    } else {
+      center = this.cursor + SIB_STEP / 2;
+      this.cursor += SIB_STEP * 2;
+    }
+    this.xOf.set(anchor, center - SPOUSE_HALF);
+    this.xOf.set(other, center + SPOUSE_HALF);
+    this.cursor = Math.max(this.cursor, center + SPOUSE_HALF + SIB_STEP);
+    return center;
+  }
+  centerOver(ids) {
+    const xs = ids.map((k) => this.placeSubtree(k));
+    return (xs[0] + xs[xs.length - 1]) / 2;
+  }
+  // Birth order, but children who themselves head a union (bringing in a
+  // married-in spouse and that spouse's own cluster) are placed last so the
+  // horizontal expansion happens at the group's edge instead of splitting the
+  // blood-sibling row.
+  orderSiblings(ids) {
+    const sorted = this.graph.sortByBirth(ids);
+    const singles = sorted.filter((id) => !this.graph.unionHeadedBy(id));
+    const married = sorted.filter((id) => this.graph.unionHeadedBy(id));
+    return [...singles, ...married];
+  }
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  GEN_SPACING,
+  GenerationalLayout,
+  GenogramGraph,
+  LABEL_LINE_H,
+  LABEL_WRAP,
+  MARGIN,
+  NODE,
+  Positions,
+  R,
+  SIB_STEP,
+  SPOUSE_HALF
+});
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/graph.ts","../src/constants.ts","../src/layout.ts"],"sourcesContent":["export { GenogramGraph } from \"./graph\"\nexport { GenerationalLayout, Positions } from \"./layout\"\nexport type { LayoutEngine } from \"./layout\"\nexport {\n  NODE,\n  R,\n  GEN_SPACING,\n  SIB_STEP,\n  SPOUSE_HALF,\n  MARGIN,\n  LABEL_WRAP,\n  LABEL_LINE_H,\n} from \"./constants\"\n","// GenogramGraph: an indexed, query-friendly view over a raw genogram document.\n// Owns the family-structure domain logic (who are the parents, children, unions)\n// and the generation (vertical rank) computation. Rendering lives elsewhere.\n\nimport type {\n  Genogram,\n  Person,\n  Relationship,\n  UnionRelationship,\n  ParentChildRelationship,\n  EmotionalRelationship,\n} from \"@famtree/schema\"\n\nconst isUnion = (r: Relationship): r is UnionRelationship => r.type === \"union\"\nconst isParentChild = (r: Relationship): r is ParentChildRelationship => r.type === \"parent-child\"\nconst isEmotional = (r: Relationship): r is EmotionalRelationship => r.type === \"emotional\"\n\nclass GenogramGraph {\n  readonly people: Map<string, Person>\n  readonly unions: UnionRelationship[]\n  readonly parentChild: ParentChildRelationship[]\n  readonly emotions: EmotionalRelationship[]\n\n  private readonly unionById: Map<string, UnionRelationship>\n  private readonly pcByChild: Map<string, ParentChildRelationship>\n  private readonly gen = new Map<string, number>()\n\n  constructor(readonly doc: Genogram) {\n    this.people = new Map(doc.people.map((p) => [p.id, p]))\n    this.unions = doc.relationships.filter(isUnion)\n    this.parentChild = doc.relationships.filter(isParentChild)\n    this.emotions = doc.relationships.filter(isEmotional)\n    this.unionById = new Map(this.unions.map((u) => [u.id, u]))\n    this.pcByChild = new Map(this.parentChild.map((pc) => [pc.childId, pc]))\n    this.computeGenerations()\n  }\n\n  get roster(): Person[] {\n    return this.doc.people\n  }\n\n  parentLinkOf(id: string): ParentChildRelationship | undefined {\n    return this.pcByChild.get(id)\n  }\n\n  parentsOf(id: string): string[] {\n    const pc = this.pcByChild.get(id)\n    if (!pc) return []\n    if (pc.unionId) return this.unionById.get(pc.unionId)?.partnerIds ?? []\n    return pc.parentIds ?? []\n  }\n\n  unionHeadedBy(id: string): UnionRelationship | undefined {\n    return this.unions.find((u) => u.partnerIds.includes(id))\n  }\n\n  childrenOfUnion(uid: string): string[] {\n    return this.parentChild.filter((pc) => pc.unionId === uid).map((pc) => pc.childId)\n  }\n\n  singleChildrenOf(id: string): string[] {\n    return this.parentChild.filter((pc) => !pc.unionId && (pc.parentIds ?? []).includes(id)).map((pc) => pc.childId)\n  }\n\n  sortByBirth(ids: string[]): string[] {\n    return [...ids].sort((a, b) => {\n      const pa = this.people.get(a)!,\n        pb = this.people.get(b)!\n      return (pa.birthOrder ?? 99) - (pb.birthOrder ?? 99) || (pa.birthDate ?? \"\").localeCompare(pb.birthDate ?? \"\")\n    })\n  }\n\n  generationOf(id: string): number {\n    return this.gen.get(id) ?? 0\n  }\n\n  // Assign each person a generation index, then align partners to the deeper\n  // generation and push descendants below their parents until stable.\n  private computeGenerations(): void {\n    const visit = (id: string, seen = new Set<string>()): number => {\n      if (this.gen.has(id)) return this.gen.get(id)!\n      if (seen.has(id)) return 0\n      seen.add(id)\n      const ps = this.parentsOf(id)\n      const val = ps.length ? Math.max(...ps.map((p) => visit(p, seen))) + 1 : 0\n      this.gen.set(id, val)\n      return val\n    }\n    for (const p of this.doc.people) visit(p.id)\n\n    for (let pass = 0; pass < this.doc.people.length; pass++) {\n      let changed = false\n      for (const u of this.unions) {\n        const [a, b] = u.partnerIds\n        const m = Math.max(this.gen.get(a)!, this.gen.get(b)!)\n        if (this.gen.get(a) !== m || this.gen.get(b) !== m) {\n          this.gen.set(a, m)\n          this.gen.set(b, m)\n          changed = true\n        }\n      }\n      for (const pc of this.parentChild) {\n        const parents = this.parentsOf(pc.childId)\n        const pg = Math.max(0, ...parents.map((p) => this.gen.get(p)!))\n        if (parents.length && this.gen.get(pc.childId)! <= pg) {\n          this.gen.set(pc.childId, pg + 1)\n          changed = true\n        }\n      }\n      if (!changed) break\n    }\n  }\n}\n\nexport { GenogramGraph }\n","// Shared geometry constants for layout and rendering.\nconst NODE = 46 // node width / diameter\nconst R = NODE / 2 // node radius\nconst GEN_SPACING = 150 // vertical distance between generations\nconst SIB_STEP = 128 // horizontal step between sibling subtrees\nconst SPOUSE_HALF = 64 // half distance between partners in a couple\nconst MARGIN = 70 // outer margin / frame padding\nconst LABEL_WRAP = 16 // max characters per label line before wrapping\nconst LABEL_LINE_H = 13 // vertical distance between wrapped label lines\n\nexport { NODE, R, GEN_SPACING, SIB_STEP, SPOUSE_HALF, MARGIN, LABEL_WRAP, LABEL_LINE_H }\n","// Layout: turns a GenogramGraph into concrete x/y coordinates.\n// `LayoutEngine` is an abstraction so the renderer can depend on it rather than a\n// concrete algorithm (Dependency Inversion / Open-Closed for new strategies).\n\nimport type { GenogramGraph } from \"./graph\"\nimport type { UnionRelationship } from \"@famtree/schema\"\nimport { GEN_SPACING, MARGIN, R, SIB_STEP, SPOUSE_HALF } from \"./constants\"\n\n/** Resolved coordinates for a laid-out genogram. */\nclass Positions {\n  constructor(\n    private readonly graph: GenogramGraph,\n    private readonly xOf: Map<string, number>,\n  ) {}\n\n  cx(id: string): number {\n    return this.xOf.get(id)! + MARGIN + R\n  }\n\n  cy(id: string): number {\n    return this.graph.generationOf(id) * GEN_SPACING + MARGIN + R\n  }\n\n  bounds(): { width: number; height: number } {\n    const ids = this.graph.roster.map((p) => p.id)\n    return {\n      width: Math.max(...ids.map((id) => this.cx(id))) + MARGIN + 60,\n      height: Math.max(...ids.map((id) => this.cy(id))) + MARGIN + 60,\n    }\n  }\n}\n\ninterface LayoutEngine {\n  layout(graph: GenogramGraph): Positions\n}\n\n/**\n * Places couples centered above their children, oldest sibling to the left,\n * married-in spouses to the right of the blood relative. Honors explicit\n * `layout.positions` overrides from the document.\n */\nclass GenerationalLayout implements LayoutEngine {\n  private graph!: GenogramGraph\n  private xOf!: Map<string, number>\n  private placedUnion!: Set<string>\n  private cursor = 0\n\n  layout(graph: GenogramGraph): Positions {\n    this.graph = graph\n    this.xOf = new Map()\n    this.placedUnion = new Set()\n    this.cursor = 0\n\n    // Place ancestors (people with no parents) first; couples before singles.\n    const roots = graph.roster\n      .map((p) => p.id)\n      .filter((id) => graph.parentsOf(id).length === 0)\n      .sort((a, b) => (graph.unionHeadedBy(a) ? 0 : 1) - (graph.unionHeadedBy(b) ? 0 : 1))\n    for (const id of roots) this.placeSubtree(id)\n    for (const p of graph.roster) if (!this.xOf.has(p.id)) this.placeSubtree(p.id)\n\n    for (const pos of graph.doc.layout?.positions ?? []) {\n      this.xOf.set(pos.personId, pos.x)\n    }\n    return new Positions(graph, this.xOf)\n  }\n\n  private placeSubtree(id: string): number {\n    const existing = this.xOf.get(id)\n    if (existing !== undefined) return existing\n\n    const union = this.graph.unionHeadedBy(id)\n    if (union && !this.placedUnion.has(union.id)) return this.placeUnion(union, id)\n\n    const kids = this.orderSiblings(this.graph.singleChildrenOf(id))\n    if (kids.length) {\n      const x = this.centerOver(kids)\n      this.xOf.set(id, x)\n      return x\n    }\n    const x = this.cursor\n    this.cursor += SIB_STEP\n    this.xOf.set(id, x)\n    return x\n  }\n\n  private placeUnion(union: UnionRelationship, anchor: string): number {\n    this.placedUnion.add(union.id)\n    const other = union.partnerIds.find((p) => p !== anchor)!\n    const kids = this.orderSiblings(this.graph.childrenOfUnion(union.id))\n\n    let center: number\n    if (kids.length) {\n      center = this.centerOver(kids)\n    } else {\n      center = this.cursor + SIB_STEP / 2\n      this.cursor += SIB_STEP * 2\n    }\n    this.xOf.set(anchor, center - SPOUSE_HALF)\n    this.xOf.set(other, center + SPOUSE_HALF)\n    this.cursor = Math.max(this.cursor, center + SPOUSE_HALF + SIB_STEP)\n    return center\n  }\n\n  private centerOver(ids: string[]): number {\n    const xs = ids.map((k) => this.placeSubtree(k))\n    return (xs[0] + xs[xs.length - 1]) / 2\n  }\n\n  // Birth order, but children who themselves head a union (bringing in a\n  // married-in spouse and that spouse's own cluster) are placed last so the\n  // horizontal expansion happens at the group's edge instead of splitting the\n  // blood-sibling row.\n  private orderSiblings(ids: string[]): string[] {\n    const sorted = this.graph.sortByBirth(ids)\n    const singles = sorted.filter((id) => !this.graph.unionHeadedBy(id))\n    const married = sorted.filter((id) => this.graph.unionHeadedBy(id))\n    return [...singles, ...married]\n  }\n}\n\nexport { Positions, GenerationalLayout }\nexport type { LayoutEngine }\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACaA,IAAM,UAAU,CAAC,MAA4C,EAAE,SAAS;AACxE,IAAM,gBAAgB,CAAC,MAAkD,EAAE,SAAS;AACpF,IAAM,cAAc,CAAC,MAAgD,EAAE,SAAS;AAEhF,IAAM,gBAAN,MAAoB;AAAA,EAUlB,YAAqB,KAAe;AAAf;AACnB,SAAK,SAAS,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACtD,SAAK,SAAS,IAAI,cAAc,OAAO,OAAO;AAC9C,SAAK,cAAc,IAAI,cAAc,OAAO,aAAa;AACzD,SAAK,WAAW,IAAI,cAAc,OAAO,WAAW;AACpD,SAAK,YAAY,IAAI,IAAI,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1D,SAAK,YAAY,IAAI,IAAI,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC;AACvE,SAAK,mBAAmB;AAAA,EAC1B;AAAA,EARqB;AAAA,EATZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEQ;AAAA,EACA;AAAA,EACA,MAAM,oBAAI,IAAoB;AAAA,EAY/C,IAAI,SAAmB;AACrB,WAAO,KAAK,IAAI;AAAA,EAClB;AAAA,EAEA,aAAa,IAAiD;AAC5D,WAAO,KAAK,UAAU,IAAI,EAAE;AAAA,EAC9B;AAAA,EAEA,UAAU,IAAsB;AAC9B,UAAM,KAAK,KAAK,UAAU,IAAI,EAAE;AAChC,QAAI,CAAC,GAAI,QAAO,CAAC;AACjB,QAAI,GAAG,QAAS,QAAO,KAAK,UAAU,IAAI,GAAG,OAAO,GAAG,cAAc,CAAC;AACtE,WAAO,GAAG,aAAa,CAAC;AAAA,EAC1B;AAAA,EAEA,cAAc,IAA2C;AACvD,WAAO,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,WAAW,SAAS,EAAE,CAAC;AAAA,EAC1D;AAAA,EAEA,gBAAgB,KAAuB;AACrC,WAAO,KAAK,YAAY,OAAO,CAAC,OAAO,GAAG,YAAY,GAAG,EAAE,IAAI,CAAC,OAAO,GAAG,OAAO;AAAA,EACnF;AAAA,EAEA,iBAAiB,IAAsB;AACrC,WAAO,KAAK,YAAY,OAAO,CAAC,OAAO,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,OAAO;AAAA,EACjH;AAAA,EAEA,YAAY,KAAyB;AACnC,WAAO,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM;AAC7B,YAAM,KAAK,KAAK,OAAO,IAAI,CAAC,GAC1B,KAAK,KAAK,OAAO,IAAI,CAAC;AACxB,cAAQ,GAAG,cAAc,OAAO,GAAG,cAAc,QAAQ,GAAG,aAAa,IAAI,cAAc,GAAG,aAAa,EAAE;AAAA,IAC/G,CAAC;AAAA,EACH;AAAA,EAEA,aAAa,IAAoB;AAC/B,WAAO,KAAK,IAAI,IAAI,EAAE,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,qBAA2B;AACjC,UAAM,QAAQ,CAAC,IAAY,OAAO,oBAAI,IAAY,MAAc;AAC9D,UAAI,KAAK,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,IAAI,IAAI,EAAE;AAC5C,UAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,WAAK,IAAI,EAAE;AACX,YAAM,KAAK,KAAK,UAAU,EAAE;AAC5B,YAAM,MAAM,GAAG,SAAS,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI;AACzE,WAAK,IAAI,IAAI,IAAI,GAAG;AACpB,aAAO;AAAA,IACT;AACA,eAAW,KAAK,KAAK,IAAI,OAAQ,OAAM,EAAE,EAAE;AAE3C,aAAS,OAAO,GAAG,OAAO,KAAK,IAAI,OAAO,QAAQ,QAAQ;AACxD,UAAI,UAAU;AACd,iBAAW,KAAK,KAAK,QAAQ;AAC3B,cAAM,CAAC,GAAG,CAAC,IAAI,EAAE;AACjB,cAAM,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,GAAI,KAAK,IAAI,IAAI,CAAC,CAAE;AACrD,YAAI,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AAClD,eAAK,IAAI,IAAI,GAAG,CAAC;AACjB,eAAK,IAAI,IAAI,GAAG,CAAC;AACjB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,iBAAW,MAAM,KAAK,aAAa;AACjC,cAAM,UAAU,KAAK,UAAU,GAAG,OAAO;AACzC,cAAM,KAAK,KAAK,IAAI,GAAG,GAAG,QAAQ,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAE,CAAC;AAC9D,YAAI,QAAQ,UAAU,KAAK,IAAI,IAAI,GAAG,OAAO,KAAM,IAAI;AACrD,eAAK,IAAI,IAAI,GAAG,SAAS,KAAK,CAAC;AAC/B,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,CAAC,QAAS;AAAA,IAChB;AAAA,EACF;AACF;;;AC/GA,IAAM,OAAO;AACb,IAAM,IAAI,OAAO;AACjB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,cAAc;AACpB,IAAM,SAAS;AACf,IAAM,aAAa;AACnB,IAAM,eAAe;;;ACCrB,IAAM,YAAN,MAAgB;AAAA,EACd,YACmB,OACA,KACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAFgB;AAAA,EACA;AAAA,EAGnB,GAAG,IAAoB;AACrB,WAAO,KAAK,IAAI,IAAI,EAAE,IAAK,SAAS;AAAA,EACtC;AAAA,EAEA,GAAG,IAAoB;AACrB,WAAO,KAAK,MAAM,aAAa,EAAE,IAAI,cAAc,SAAS;AAAA,EAC9D;AAAA,EAEA,SAA4C;AAC1C,UAAM,MAAM,KAAK,MAAM,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAC7C,WAAO;AAAA,MACL,OAAO,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC,CAAC,IAAI,SAAS;AAAA,MAC5D,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC,CAAC,IAAI,SAAS;AAAA,IAC/D;AAAA,EACF;AACF;AAWA,IAAM,qBAAN,MAAiD;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EAEjB,OAAO,OAAiC;AACtC,SAAK,QAAQ;AACb,SAAK,MAAM,oBAAI,IAAI;AACnB,SAAK,cAAc,oBAAI,IAAI;AAC3B,SAAK,SAAS;AAGd,UAAM,QAAQ,MAAM,OACjB,IAAI,CAAC,MAAM,EAAE,EAAE,EACf,OAAO,CAAC,OAAO,MAAM,UAAU,EAAE,EAAE,WAAW,CAAC,EAC/C,KAAK,CAAC,GAAG,OAAO,MAAM,cAAc,CAAC,IAAI,IAAI,MAAM,MAAM,cAAc,CAAC,IAAI,IAAI,EAAE;AACrF,eAAW,MAAM,MAAO,MAAK,aAAa,EAAE;AAC5C,eAAW,KAAK,MAAM,OAAQ,KAAI,CAAC,KAAK,IAAI,IAAI,EAAE,EAAE,EAAG,MAAK,aAAa,EAAE,EAAE;AAE7E,eAAW,OAAO,MAAM,IAAI,QAAQ,aAAa,CAAC,GAAG;AACnD,WAAK,IAAI,IAAI,IAAI,UAAU,IAAI,CAAC;AAAA,IAClC;AACA,WAAO,IAAI,UAAU,OAAO,KAAK,GAAG;AAAA,EACtC;AAAA,EAEQ,aAAa,IAAoB;AACvC,UAAM,WAAW,KAAK,IAAI,IAAI,EAAE;AAChC,QAAI,aAAa,OAAW,QAAO;AAEnC,UAAM,QAAQ,KAAK,MAAM,cAAc,EAAE;AACzC,QAAI,SAAS,CAAC,KAAK,YAAY,IAAI,MAAM,EAAE,EAAG,QAAO,KAAK,WAAW,OAAO,EAAE;AAE9E,UAAM,OAAO,KAAK,cAAc,KAAK,MAAM,iBAAiB,EAAE,CAAC;AAC/D,QAAI,KAAK,QAAQ;AACf,YAAMA,KAAI,KAAK,WAAW,IAAI;AAC9B,WAAK,IAAI,IAAI,IAAIA,EAAC;AAClB,aAAOA;AAAA,IACT;AACA,UAAM,IAAI,KAAK;AACf,SAAK,UAAU;AACf,SAAK,IAAI,IAAI,IAAI,CAAC;AAClB,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,OAA0B,QAAwB;AACnE,SAAK,YAAY,IAAI,MAAM,EAAE;AAC7B,UAAM,QAAQ,MAAM,WAAW,KAAK,CAAC,MAAM,MAAM,MAAM;AACvD,UAAM,OAAO,KAAK,cAAc,KAAK,MAAM,gBAAgB,MAAM,EAAE,CAAC;AAEpE,QAAI;AACJ,QAAI,KAAK,QAAQ;AACf,eAAS,KAAK,WAAW,IAAI;AAAA,IAC/B,OAAO;AACL,eAAS,KAAK,SAAS,WAAW;AAClC,WAAK,UAAU,WAAW;AAAA,IAC5B;AACA,SAAK,IAAI,IAAI,QAAQ,SAAS,WAAW;AACzC,SAAK,IAAI,IAAI,OAAO,SAAS,WAAW;AACxC,SAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,SAAS,cAAc,QAAQ;AACnE,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,KAAuB;AACxC,UAAM,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC;AAC9C,YAAQ,GAAG,CAAC,IAAI,GAAG,GAAG,SAAS,CAAC,KAAK;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAc,KAAyB;AAC7C,UAAM,SAAS,KAAK,MAAM,YAAY,GAAG;AACzC,UAAM,UAAU,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,MAAM,cAAc,EAAE,CAAC;AACnE,UAAM,UAAU,OAAO,OAAO,CAAC,OAAO,KAAK,MAAM,cAAc,EAAE,CAAC;AAClE,WAAO,CAAC,GAAG,SAAS,GAAG,OAAO;AAAA,EAChC;AACF;","names":["x"]}

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export { GenogramGraph } from "./graph";
+export { GenerationalLayout, Positions } from "./layout";
+export type { LayoutEngine } from "./layout";
+export { NODE, R, GEN_SPACING, SIB_STEP, SPOUSE_HALF, MARGIN, LABEL_WRAP, LABEL_LINE_H, } from "./constants";

package/dist/index.js

@@ -0,0 +1,201 @@
+// src/graph.ts
+var isUnion = (r) => r.type === "union";
+var isParentChild = (r) => r.type === "parent-child";
+var isEmotional = (r) => r.type === "emotional";
+var GenogramGraph = class {
+  constructor(doc) {
+    this.doc = doc;
+    this.people = new Map(doc.people.map((p) => [p.id, p]));
+    this.unions = doc.relationships.filter(isUnion);
+    this.parentChild = doc.relationships.filter(isParentChild);
+    this.emotions = doc.relationships.filter(isEmotional);
+    this.unionById = new Map(this.unions.map((u) => [u.id, u]));
+    this.pcByChild = new Map(this.parentChild.map((pc) => [pc.childId, pc]));
+    this.computeGenerations();
+  }
+  doc;
+  people;
+  unions;
+  parentChild;
+  emotions;
+  unionById;
+  pcByChild;
+  gen = /* @__PURE__ */ new Map();
+  get roster() {
+    return this.doc.people;
+  }
+  parentLinkOf(id) {
+    return this.pcByChild.get(id);
+  }
+  parentsOf(id) {
+    const pc = this.pcByChild.get(id);
+    if (!pc) return [];
+    if (pc.unionId) return this.unionById.get(pc.unionId)?.partnerIds ?? [];
+    return pc.parentIds ?? [];
+  }
+  unionHeadedBy(id) {
+    return this.unions.find((u) => u.partnerIds.includes(id));
+  }
+  childrenOfUnion(uid) {
+    return this.parentChild.filter((pc) => pc.unionId === uid).map((pc) => pc.childId);
+  }
+  singleChildrenOf(id) {
+    return this.parentChild.filter((pc) => !pc.unionId && (pc.parentIds ?? []).includes(id)).map((pc) => pc.childId);
+  }
+  sortByBirth(ids) {
+    return [...ids].sort((a, b) => {
+      const pa = this.people.get(a), pb = this.people.get(b);
+      return (pa.birthOrder ?? 99) - (pb.birthOrder ?? 99) || (pa.birthDate ?? "").localeCompare(pb.birthDate ?? "");
+    });
+  }
+  generationOf(id) {
+    return this.gen.get(id) ?? 0;
+  }
+  // Assign each person a generation index, then align partners to the deeper
+  // generation and push descendants below their parents until stable.
+  computeGenerations() {
+    const visit = (id, seen = /* @__PURE__ */ new Set()) => {
+      if (this.gen.has(id)) return this.gen.get(id);
+      if (seen.has(id)) return 0;
+      seen.add(id);
+      const ps = this.parentsOf(id);
+      const val = ps.length ? Math.max(...ps.map((p) => visit(p, seen))) + 1 : 0;
+      this.gen.set(id, val);
+      return val;
+    };
+    for (const p of this.doc.people) visit(p.id);
+    for (let pass = 0; pass < this.doc.people.length; pass++) {
+      let changed = false;
+      for (const u of this.unions) {
+        const [a, b] = u.partnerIds;
+        const m = Math.max(this.gen.get(a), this.gen.get(b));
+        if (this.gen.get(a) !== m || this.gen.get(b) !== m) {
+          this.gen.set(a, m);
+          this.gen.set(b, m);
+          changed = true;
+        }
+      }
+      for (const pc of this.parentChild) {
+        const parents = this.parentsOf(pc.childId);
+        const pg = Math.max(0, ...parents.map((p) => this.gen.get(p)));
+        if (parents.length && this.gen.get(pc.childId) <= pg) {
+          this.gen.set(pc.childId, pg + 1);
+          changed = true;
+        }
+      }
+      if (!changed) break;
+    }
+  }
+};
+
+// src/constants.ts
+var NODE = 46;
+var R = NODE / 2;
+var GEN_SPACING = 150;
+var SIB_STEP = 128;
+var SPOUSE_HALF = 64;
+var MARGIN = 70;
+var LABEL_WRAP = 16;
+var LABEL_LINE_H = 13;
+
+// src/layout.ts
+var Positions = class {
+  constructor(graph, xOf) {
+    this.graph = graph;
+    this.xOf = xOf;
+  }
+  graph;
+  xOf;
+  cx(id) {
+    return this.xOf.get(id) + MARGIN + R;
+  }
+  cy(id) {
+    return this.graph.generationOf(id) * GEN_SPACING + MARGIN + R;
+  }
+  bounds() {
+    const ids = this.graph.roster.map((p) => p.id);
+    return {
+      width: Math.max(...ids.map((id) => this.cx(id))) + MARGIN + 60,
+      height: Math.max(...ids.map((id) => this.cy(id))) + MARGIN + 60
+    };
+  }
+};
+var GenerationalLayout = class {
+  graph;
+  xOf;
+  placedUnion;
+  cursor = 0;
+  layout(graph) {
+    this.graph = graph;
+    this.xOf = /* @__PURE__ */ new Map();
+    this.placedUnion = /* @__PURE__ */ new Set();
+    this.cursor = 0;
+    const roots = graph.roster.map((p) => p.id).filter((id) => graph.parentsOf(id).length === 0).sort((a, b) => (graph.unionHeadedBy(a) ? 0 : 1) - (graph.unionHeadedBy(b) ? 0 : 1));
+    for (const id of roots) this.placeSubtree(id);
+    for (const p of graph.roster) if (!this.xOf.has(p.id)) this.placeSubtree(p.id);
+    for (const pos of graph.doc.layout?.positions ?? []) {
+      this.xOf.set(pos.personId, pos.x);
+    }
+    return new Positions(graph, this.xOf);
+  }
+  placeSubtree(id) {
+    const existing = this.xOf.get(id);
+    if (existing !== void 0) return existing;
+    const union = this.graph.unionHeadedBy(id);
+    if (union && !this.placedUnion.has(union.id)) return this.placeUnion(union, id);
+    const kids = this.orderSiblings(this.graph.singleChildrenOf(id));
+    if (kids.length) {
+      const x2 = this.centerOver(kids);
+      this.xOf.set(id, x2);
+      return x2;
+    }
+    const x = this.cursor;
+    this.cursor += SIB_STEP;
+    this.xOf.set(id, x);
+    return x;
+  }
+  placeUnion(union, anchor) {
+    this.placedUnion.add(union.id);
+    const other = union.partnerIds.find((p) => p !== anchor);
+    const kids = this.orderSiblings(this.graph.childrenOfUnion(union.id));
+    let center;
+    if (kids.length) {
+      center = this.centerOver(kids);
+    } else {
+      center = this.cursor + SIB_STEP / 2;
+      this.cursor += SIB_STEP * 2;
+    }
+    this.xOf.set(anchor, center - SPOUSE_HALF);
+    this.xOf.set(other, center + SPOUSE_HALF);
+    this.cursor = Math.max(this.cursor, center + SPOUSE_HALF + SIB_STEP);
+    return center;
+  }
+  centerOver(ids) {
+    const xs = ids.map((k) => this.placeSubtree(k));
+    return (xs[0] + xs[xs.length - 1]) / 2;
+  }
+  // Birth order, but children who themselves head a union (bringing in a
+  // married-in spouse and that spouse's own cluster) are placed last so the
+  // horizontal expansion happens at the group's edge instead of splitting the
+  // blood-sibling row.
+  orderSiblings(ids) {
+    const sorted = this.graph.sortByBirth(ids);
+    const singles = sorted.filter((id) => !this.graph.unionHeadedBy(id));
+    const married = sorted.filter((id) => this.graph.unionHeadedBy(id));
+    return [...singles, ...married];
+  }
+};
+export {
+  GEN_SPACING,
+  GenerationalLayout,
+  GenogramGraph,
+  LABEL_LINE_H,
+  LABEL_WRAP,
+  MARGIN,
+  NODE,
+  Positions,
+  R,
+  SIB_STEP,
+  SPOUSE_HALF
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph.ts","../src/constants.ts","../src/layout.ts"],"sourcesContent":["// GenogramGraph: an indexed, query-friendly view over a raw genogram document.\n// Owns the family-structure domain logic (who are the parents, children, unions)\n// and the generation (vertical rank) computation. Rendering lives elsewhere.\n\nimport type {\n  Genogram,\n  Person,\n  Relationship,\n  UnionRelationship,\n  ParentChildRelationship,\n  EmotionalRelationship,\n} from \"@famtree/schema\"\n\nconst isUnion = (r: Relationship): r is UnionRelationship => r.type === \"union\"\nconst isParentChild = (r: Relationship): r is ParentChildRelationship => r.type === \"parent-child\"\nconst isEmotional = (r: Relationship): r is EmotionalRelationship => r.type === \"emotional\"\n\nclass GenogramGraph {\n  readonly people: Map<string, Person>\n  readonly unions: UnionRelationship[]\n  readonly parentChild: ParentChildRelationship[]\n  readonly emotions: EmotionalRelationship[]\n\n  private readonly unionById: Map<string, UnionRelationship>\n  private readonly pcByChild: Map<string, ParentChildRelationship>\n  private readonly gen = new Map<string, number>()\n\n  constructor(readonly doc: Genogram) {\n    this.people = new Map(doc.people.map((p) => [p.id, p]))\n    this.unions = doc.relationships.filter(isUnion)\n    this.parentChild = doc.relationships.filter(isParentChild)\n    this.emotions = doc.relationships.filter(isEmotional)\n    this.unionById = new Map(this.unions.map((u) => [u.id, u]))\n    this.pcByChild = new Map(this.parentChild.map((pc) => [pc.childId, pc]))\n    this.computeGenerations()\n  }\n\n  get roster(): Person[] {\n    return this.doc.people\n  }\n\n  parentLinkOf(id: string): ParentChildRelationship | undefined {\n    return this.pcByChild.get(id)\n  }\n\n  parentsOf(id: string): string[] {\n    const pc = this.pcByChild.get(id)\n    if (!pc) return []\n    if (pc.unionId) return this.unionById.get(pc.unionId)?.partnerIds ?? []\n    return pc.parentIds ?? []\n  }\n\n  unionHeadedBy(id: string): UnionRelationship | undefined {\n    return this.unions.find((u) => u.partnerIds.includes(id))\n  }\n\n  childrenOfUnion(uid: string): string[] {\n    return this.parentChild.filter((pc) => pc.unionId === uid).map((pc) => pc.childId)\n  }\n\n  singleChildrenOf(id: string): string[] {\n    return this.parentChild.filter((pc) => !pc.unionId && (pc.parentIds ?? []).includes(id)).map((pc) => pc.childId)\n  }\n\n  sortByBirth(ids: string[]): string[] {\n    return [...ids].sort((a, b) => {\n      const pa = this.people.get(a)!,\n        pb = this.people.get(b)!\n      return (pa.birthOrder ?? 99) - (pb.birthOrder ?? 99) || (pa.birthDate ?? \"\").localeCompare(pb.birthDate ?? \"\")\n    })\n  }\n\n  generationOf(id: string): number {\n    return this.gen.get(id) ?? 0\n  }\n\n  // Assign each person a generation index, then align partners to the deeper\n  // generation and push descendants below their parents until stable.\n  private computeGenerations(): void {\n    const visit = (id: string, seen = new Set<string>()): number => {\n      if (this.gen.has(id)) return this.gen.get(id)!\n      if (seen.has(id)) return 0\n      seen.add(id)\n      const ps = this.parentsOf(id)\n      const val = ps.length ? Math.max(...ps.map((p) => visit(p, seen))) + 1 : 0\n      this.gen.set(id, val)\n      return val\n    }\n    for (const p of this.doc.people) visit(p.id)\n\n    for (let pass = 0; pass < this.doc.people.length; pass++) {\n      let changed = false\n      for (const u of this.unions) {\n        const [a, b] = u.partnerIds\n        const m = Math.max(this.gen.get(a)!, this.gen.get(b)!)\n        if (this.gen.get(a) !== m || this.gen.get(b) !== m) {\n          this.gen.set(a, m)\n          this.gen.set(b, m)\n          changed = true\n        }\n      }\n      for (const pc of this.parentChild) {\n        const parents = this.parentsOf(pc.childId)\n        const pg = Math.max(0, ...parents.map((p) => this.gen.get(p)!))\n        if (parents.length && this.gen.get(pc.childId)! <= pg) {\n          this.gen.set(pc.childId, pg + 1)\n          changed = true\n        }\n      }\n      if (!changed) break\n    }\n  }\n}\n\nexport { GenogramGraph }\n","// Shared geometry constants for layout and rendering.\nconst NODE = 46 // node width / diameter\nconst R = NODE / 2 // node radius\nconst GEN_SPACING = 150 // vertical distance between generations\nconst SIB_STEP = 128 // horizontal step between sibling subtrees\nconst SPOUSE_HALF = 64 // half distance between partners in a couple\nconst MARGIN = 70 // outer margin / frame padding\nconst LABEL_WRAP = 16 // max characters per label line before wrapping\nconst LABEL_LINE_H = 13 // vertical distance between wrapped label lines\n\nexport { NODE, R, GEN_SPACING, SIB_STEP, SPOUSE_HALF, MARGIN, LABEL_WRAP, LABEL_LINE_H }\n","// Layout: turns a GenogramGraph into concrete x/y coordinates.\n// `LayoutEngine` is an abstraction so the renderer can depend on it rather than a\n// concrete algorithm (Dependency Inversion / Open-Closed for new strategies).\n\nimport type { GenogramGraph } from \"./graph\"\nimport type { UnionRelationship } from \"@famtree/schema\"\nimport { GEN_SPACING, MARGIN, R, SIB_STEP, SPOUSE_HALF } from \"./constants\"\n\n/** Resolved coordinates for a laid-out genogram. */\nclass Positions {\n  constructor(\n    private readonly graph: GenogramGraph,\n    private readonly xOf: Map<string, number>,\n  ) {}\n\n  cx(id: string): number {\n    return this.xOf.get(id)! + MARGIN + R\n  }\n\n  cy(id: string): number {\n    return this.graph.generationOf(id) * GEN_SPACING + MARGIN + R\n  }\n\n  bounds(): { width: number; height: number } {\n    const ids = this.graph.roster.map((p) => p.id)\n    return {\n      width: Math.max(...ids.map((id) => this.cx(id))) + MARGIN + 60,\n      height: Math.max(...ids.map((id) => this.cy(id))) + MARGIN + 60,\n    }\n  }\n}\n\ninterface LayoutEngine {\n  layout(graph: GenogramGraph): Positions\n}\n\n/**\n * Places couples centered above their children, oldest sibling to the left,\n * married-in spouses to the right of the blood relative. Honors explicit\n * `layout.positions` overrides from the document.\n */\nclass GenerationalLayout implements LayoutEngine {\n  private graph!: GenogramGraph\n  private xOf!: Map<string, number>\n  private placedUnion!: Set<string>\n  private cursor = 0\n\n  layout(graph: GenogramGraph): Positions {\n    this.graph = graph\n    this.xOf = new Map()\n    this.placedUnion = new Set()\n    this.cursor = 0\n\n    // Place ancestors (people with no parents) first; couples before singles.\n    const roots = graph.roster\n      .map((p) => p.id)\n      .filter((id) => graph.parentsOf(id).length === 0)\n      .sort((a, b) => (graph.unionHeadedBy(a) ? 0 : 1) - (graph.unionHeadedBy(b) ? 0 : 1))\n    for (const id of roots) this.placeSubtree(id)\n    for (const p of graph.roster) if (!this.xOf.has(p.id)) this.placeSubtree(p.id)\n\n    for (const pos of graph.doc.layout?.positions ?? []) {\n      this.xOf.set(pos.personId, pos.x)\n    }\n    return new Positions(graph, this.xOf)\n  }\n\n  private placeSubtree(id: string): number {\n    const existing = this.xOf.get(id)\n    if (existing !== undefined) return existing\n\n    const union = this.graph.unionHeadedBy(id)\n    if (union && !this.placedUnion.has(union.id)) return this.placeUnion(union, id)\n\n    const kids = this.orderSiblings(this.graph.singleChildrenOf(id))\n    if (kids.length) {\n      const x = this.centerOver(kids)\n      this.xOf.set(id, x)\n      return x\n    }\n    const x = this.cursor\n    this.cursor += SIB_STEP\n    this.xOf.set(id, x)\n    return x\n  }\n\n  private placeUnion(union: UnionRelationship, anchor: string): number {\n    this.placedUnion.add(union.id)\n    const other = union.partnerIds.find((p) => p !== anchor)!\n    const kids = this.orderSiblings(this.graph.childrenOfUnion(union.id))\n\n    let center: number\n    if (kids.length) {\n      center = this.centerOver(kids)\n    } else {\n      center = this.cursor + SIB_STEP / 2\n      this.cursor += SIB_STEP * 2\n    }\n    this.xOf.set(anchor, center - SPOUSE_HALF)\n    this.xOf.set(other, center + SPOUSE_HALF)\n    this.cursor = Math.max(this.cursor, center + SPOUSE_HALF + SIB_STEP)\n    return center\n  }\n\n  private centerOver(ids: string[]): number {\n    const xs = ids.map((k) => this.placeSubtree(k))\n    return (xs[0] + xs[xs.length - 1]) / 2\n  }\n\n  // Birth order, but children who themselves head a union (bringing in a\n  // married-in spouse and that spouse's own cluster) are placed last so the\n  // horizontal expansion happens at the group's edge instead of splitting the\n  // blood-sibling row.\n  private orderSiblings(ids: string[]): string[] {\n    const sorted = this.graph.sortByBirth(ids)\n    const singles = sorted.filter((id) => !this.graph.unionHeadedBy(id))\n    const married = sorted.filter((id) => this.graph.unionHeadedBy(id))\n    return [...singles, ...married]\n  }\n}\n\nexport { Positions, GenerationalLayout }\nexport type { LayoutEngine }\n"],"mappings":";AAaA,IAAM,UAAU,CAAC,MAA4C,EAAE,SAAS;AACxE,IAAM,gBAAgB,CAAC,MAAkD,EAAE,SAAS;AACpF,IAAM,cAAc,CAAC,MAAgD,EAAE,SAAS;AAEhF,IAAM,gBAAN,MAAoB;AAAA,EAUlB,YAAqB,KAAe;AAAf;AACnB,SAAK,SAAS,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACtD,SAAK,SAAS,IAAI,cAAc,OAAO,OAAO;AAC9C,SAAK,cAAc,IAAI,cAAc,OAAO,aAAa;AACzD,SAAK,WAAW,IAAI,cAAc,OAAO,WAAW;AACpD,SAAK,YAAY,IAAI,IAAI,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1D,SAAK,YAAY,IAAI,IAAI,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC;AACvE,SAAK,mBAAmB;AAAA,EAC1B;AAAA,EARqB;AAAA,EATZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEQ;AAAA,EACA;AAAA,EACA,MAAM,oBAAI,IAAoB;AAAA,EAY/C,IAAI,SAAmB;AACrB,WAAO,KAAK,IAAI;AAAA,EAClB;AAAA,EAEA,aAAa,IAAiD;AAC5D,WAAO,KAAK,UAAU,IAAI,EAAE;AAAA,EAC9B;AAAA,EAEA,UAAU,IAAsB;AAC9B,UAAM,KAAK,KAAK,UAAU,IAAI,EAAE;AAChC,QAAI,CAAC,GAAI,QAAO,CAAC;AACjB,QAAI,GAAG,QAAS,QAAO,KAAK,UAAU,IAAI,GAAG,OAAO,GAAG,cAAc,CAAC;AACtE,WAAO,GAAG,aAAa,CAAC;AAAA,EAC1B;AAAA,EAEA,cAAc,IAA2C;AACvD,WAAO,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,WAAW,SAAS,EAAE,CAAC;AAAA,EAC1D;AAAA,EAEA,gBAAgB,KAAuB;AACrC,WAAO,KAAK,YAAY,OAAO,CAAC,OAAO,GAAG,YAAY,GAAG,EAAE,IAAI,CAAC,OAAO,GAAG,OAAO;AAAA,EACnF;AAAA,EAEA,iBAAiB,IAAsB;AACrC,WAAO,KAAK,YAAY,OAAO,CAAC,OAAO,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,OAAO;AAAA,EACjH;AAAA,EAEA,YAAY,KAAyB;AACnC,WAAO,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM;AAC7B,YAAM,KAAK,KAAK,OAAO,IAAI,CAAC,GAC1B,KAAK,KAAK,OAAO,IAAI,CAAC;AACxB,cAAQ,GAAG,cAAc,OAAO,GAAG,cAAc,QAAQ,GAAG,aAAa,IAAI,cAAc,GAAG,aAAa,EAAE;AAAA,IAC/G,CAAC;AAAA,EACH;AAAA,EAEA,aAAa,IAAoB;AAC/B,WAAO,KAAK,IAAI,IAAI,EAAE,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,qBAA2B;AACjC,UAAM,QAAQ,CAAC,IAAY,OAAO,oBAAI,IAAY,MAAc;AAC9D,UAAI,KAAK,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,IAAI,IAAI,EAAE;AAC5C,UAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,WAAK,IAAI,EAAE;AACX,YAAM,KAAK,KAAK,UAAU,EAAE;AAC5B,YAAM,MAAM,GAAG,SAAS,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI;AACzE,WAAK,IAAI,IAAI,IAAI,GAAG;AACpB,aAAO;AAAA,IACT;AACA,eAAW,KAAK,KAAK,IAAI,OAAQ,OAAM,EAAE,EAAE;AAE3C,aAAS,OAAO,GAAG,OAAO,KAAK,IAAI,OAAO,QAAQ,QAAQ;AACxD,UAAI,UAAU;AACd,iBAAW,KAAK,KAAK,QAAQ;AAC3B,cAAM,CAAC,GAAG,CAAC,IAAI,EAAE;AACjB,cAAM,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,GAAI,KAAK,IAAI,IAAI,CAAC,CAAE;AACrD,YAAI,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AAClD,eAAK,IAAI,IAAI,GAAG,CAAC;AACjB,eAAK,IAAI,IAAI,GAAG,CAAC;AACjB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,iBAAW,MAAM,KAAK,aAAa;AACjC,cAAM,UAAU,KAAK,UAAU,GAAG,OAAO;AACzC,cAAM,KAAK,KAAK,IAAI,GAAG,GAAG,QAAQ,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAE,CAAC;AAC9D,YAAI,QAAQ,UAAU,KAAK,IAAI,IAAI,GAAG,OAAO,KAAM,IAAI;AACrD,eAAK,IAAI,IAAI,GAAG,SAAS,KAAK,CAAC;AAC/B,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,CAAC,QAAS;AAAA,IAChB;AAAA,EACF;AACF;;;AC/GA,IAAM,OAAO;AACb,IAAM,IAAI,OAAO;AACjB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,cAAc;AACpB,IAAM,SAAS;AACf,IAAM,aAAa;AACnB,IAAM,eAAe;;;ACCrB,IAAM,YAAN,MAAgB;AAAA,EACd,YACmB,OACA,KACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAFgB;AAAA,EACA;AAAA,EAGnB,GAAG,IAAoB;AACrB,WAAO,KAAK,IAAI,IAAI,EAAE,IAAK,SAAS;AAAA,EACtC;AAAA,EAEA,GAAG,IAAoB;AACrB,WAAO,KAAK,MAAM,aAAa,EAAE,IAAI,cAAc,SAAS;AAAA,EAC9D;AAAA,EAEA,SAA4C;AAC1C,UAAM,MAAM,KAAK,MAAM,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAC7C,WAAO;AAAA,MACL,OAAO,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC,CAAC,IAAI,SAAS;AAAA,MAC5D,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC,CAAC,IAAI,SAAS;AAAA,IAC/D;AAAA,EACF;AACF;AAWA,IAAM,qBAAN,MAAiD;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EAEjB,OAAO,OAAiC;AACtC,SAAK,QAAQ;AACb,SAAK,MAAM,oBAAI,IAAI;AACnB,SAAK,cAAc,oBAAI,IAAI;AAC3B,SAAK,SAAS;AAGd,UAAM,QAAQ,MAAM,OACjB,IAAI,CAAC,MAAM,EAAE,EAAE,EACf,OAAO,CAAC,OAAO,MAAM,UAAU,EAAE,EAAE,WAAW,CAAC,EAC/C,KAAK,CAAC,GAAG,OAAO,MAAM,cAAc,CAAC,IAAI,IAAI,MAAM,MAAM,cAAc,CAAC,IAAI,IAAI,EAAE;AACrF,eAAW,MAAM,MAAO,MAAK,aAAa,EAAE;AAC5C,eAAW,KAAK,MAAM,OAAQ,KAAI,CAAC,KAAK,IAAI,IAAI,EAAE,EAAE,EAAG,MAAK,aAAa,EAAE,EAAE;AAE7E,eAAW,OAAO,MAAM,IAAI,QAAQ,aAAa,CAAC,GAAG;AACnD,WAAK,IAAI,IAAI,IAAI,UAAU,IAAI,CAAC;AAAA,IAClC;AACA,WAAO,IAAI,UAAU,OAAO,KAAK,GAAG;AAAA,EACtC;AAAA,EAEQ,aAAa,IAAoB;AACvC,UAAM,WAAW,KAAK,IAAI,IAAI,EAAE;AAChC,QAAI,aAAa,OAAW,QAAO;AAEnC,UAAM,QAAQ,KAAK,MAAM,cAAc,EAAE;AACzC,QAAI,SAAS,CAAC,KAAK,YAAY,IAAI,MAAM,EAAE,EAAG,QAAO,KAAK,WAAW,OAAO,EAAE;AAE9E,UAAM,OAAO,KAAK,cAAc,KAAK,MAAM,iBAAiB,EAAE,CAAC;AAC/D,QAAI,KAAK,QAAQ;AACf,YAAMA,KAAI,KAAK,WAAW,IAAI;AAC9B,WAAK,IAAI,IAAI,IAAIA,EAAC;AAClB,aAAOA;AAAA,IACT;AACA,UAAM,IAAI,KAAK;AACf,SAAK,UAAU;AACf,SAAK,IAAI,IAAI,IAAI,CAAC;AAClB,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,OAA0B,QAAwB;AACnE,SAAK,YAAY,IAAI,MAAM,EAAE;AAC7B,UAAM,QAAQ,MAAM,WAAW,KAAK,CAAC,MAAM,MAAM,MAAM;AACvD,UAAM,OAAO,KAAK,cAAc,KAAK,MAAM,gBAAgB,MAAM,EAAE,CAAC;AAEpE,QAAI;AACJ,QAAI,KAAK,QAAQ;AACf,eAAS,KAAK,WAAW,IAAI;AAAA,IAC/B,OAAO;AACL,eAAS,KAAK,SAAS,WAAW;AAClC,WAAK,UAAU,WAAW;AAAA,IAC5B;AACA,SAAK,IAAI,IAAI,QAAQ,SAAS,WAAW;AACzC,SAAK,IAAI,IAAI,OAAO,SAAS,WAAW;AACxC,SAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,SAAS,cAAc,QAAQ;AACnE,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,KAAuB;AACxC,UAAM,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC;AAC9C,YAAQ,GAAG,CAAC,IAAI,GAAG,GAAG,SAAS,CAAC,KAAK;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAc,KAAyB;AAC7C,UAAM,SAAS,KAAK,MAAM,YAAY,GAAG;AACzC,UAAM,UAAU,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,MAAM,cAAc,EAAE,CAAC;AACnE,UAAM,UAAU,OAAO,OAAO,CAAC,OAAO,KAAK,MAAM,cAAc,EAAE,CAAC;AAClE,WAAO,CAAC,GAAG,SAAS,GAAG,OAAO;AAAA,EAChC;AACF;","names":["x"]}

package/dist/layout.d.ts

@@ -0,0 +1,34 @@
+import type { GenogramGraph } from "./graph";
+/** Resolved coordinates for a laid-out genogram. */
+declare class Positions {
+    private readonly graph;
+    private readonly xOf;
+    constructor(graph: GenogramGraph, xOf: Map<string, number>);
+    cx(id: string): number;
+    cy(id: string): number;
+    bounds(): {
+        width: number;
+        height: number;
+    };
+}
+interface LayoutEngine {
+    layout(graph: GenogramGraph): Positions;
+}
+/**
+ * Places couples centered above their children, oldest sibling to the left,
+ * married-in spouses to the right of the blood relative. Honors explicit
+ * `layout.positions` overrides from the document.
+ */
+declare class GenerationalLayout implements LayoutEngine {
+    private graph;
+    private xOf;
+    private placedUnion;
+    private cursor;
+    layout(graph: GenogramGraph): Positions;
+    private placeSubtree;
+    private placeUnion;
+    private centerOver;
+    private orderSiblings;
+}
+export { Positions, GenerationalLayout };
+export type { LayoutEngine };

package/package.json

@@ -0,0 +1,34 @@
+{
+  "name": "@famtree/core",
+  "version": "0.1.0",
+  "description": "Runtime-agnostic genogram engine: domain graph and layout.",
+  "type": "module",
+  "license": "MIT",
+  "author": "Felipe Plets",
+  "homepage": "https://github.com/felipeplets/famtree#readme",
+  "bugs": "https://github.com/felipeplets/famtree/issues",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/felipeplets/famtree.git",
+    "directory": "libs/core"
+  },
+  "publishConfig": { "access": "public" },
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "files": ["dist"],
+  "dependencies": {
+    "@famtree/schema": "workspace:0.1.0"
+  },
+  "scripts": {
+    "build": "tsup && tsc -p tsconfig.build.json",
+    "typecheck": "tsc --noEmit -p tsconfig.json"
+  }
+}