@lix-js/sdk 0.4.6 → 0.5.0-preview.0

package/dist/query-filter/change-set-has-label.test.js

@@ -1,43 +1,36 @@
-/* eslint-disable @typescript-eslint/no-unused-vars */
 import { test, expect } from "vitest";
 import { changeSetHasLabel } from "./change-set-has-label.js";
-import { openLixInMemory } from "../lix/open-lix-in-memory.js";
+import { openLix } from "../lix/open-lix.js";
 import { createChangeSet } from "../change-set/create-change-set.js";
-import { mockChange } from "../change/mock-change.js";
+import { createLabel } from "../label/create-label.js";
 test("should only return change sets with the given label", async () => {
-    const lix = await openLixInMemory({});
-    await lix.db
-        .insertInto("change")
-        .values([mockChange({ id: "change1" }), mockChange({ id: "change2" })])
-        .execute();
+    const lix = await openLix({});
     // Create two change sets
-    const changeSet1 = await createChangeSet({
+    const cs0 = await createChangeSet({
         lix,
-        changes: [{ id: "change1" }],
+        id: "cs0",
+        elements: [],
     });
-    const changeSet2 = await createChangeSet({
+    await createChangeSet({
         lix,
-        changes: [{ id: "change2" }],
+        id: "cs1",
+        elements: [],
     });
     // Insert a label
-    const label = await lix.db
-        .insertInto("label")
-        .values({ name: "mocked" })
-        .returningAll()
-        .executeTakeFirstOrThrow();
+    const label = await createLabel({ lix, name: "mocked" });
     // Assign the label to one of the change sets
     await lix.db
         .insertInto("change_set_label")
-        .values({ change_set_id: changeSet1.id, label_id: label.id })
+        .values({ change_set_id: cs0.id, label_id: label.id })
         .execute();
     // Query change sets with the label
     const changeSets = await lix.db
         .selectFrom("change_set")
-        .where(changeSetHasLabel("mocked"))
+        .where(changeSetHasLabel({ name: "mocked" }))
         .selectAll()
         .execute();
     // Assertions
     expect(changeSets).toHaveLength(1);
-    expect(changeSets[0]?.id).toBe(changeSet1.id);
+    expect(changeSets[0]?.id).toBe(cs0.id);
 });
 //# sourceMappingURL=change-set-has-label.test.js.map

package/dist/query-filter/change-set-has-label.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"change-set-has-label.test.js","sourceRoot":"","sources":["../../src/query-filter/change-set-has-label.test.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;IACtE,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC,EAAE,CAAC,CAAC;IAEtC,MAAM,GAAG,CAAC,EAAE;SACV,UAAU,CAAC,QAAQ,CAAC;SACpB,MAAM,CAAC,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;SACtE,OAAO,EAAE,CAAC;IAEZ,yBAAyB;IACzB,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC;QACxC,GAAG;QACH,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;KAC5B,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC;QACxC,GAAG;QACH,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;KAC5B,CAAC,CAAC;IAEH,iBAAiB;IACjB,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE;SACxB,UAAU,CAAC,OAAO,CAAC;SACnB,MAAM,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;SAC1B,YAAY,EAAE;SACd,uBAAuB,EAAE,CAAC;IAE5B,6CAA6C;IAC7C,MAAM,GAAG,CAAC,EAAE;SACV,UAAU,CAAC,kBAAkB,CAAC;SAC9B,MAAM,CAAC,EAAE,aAAa,EAAE,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;SAC5D,OAAO,EAAE,CAAC;IAEZ,mCAAmC;IACnC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,EAAE;SAC7B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;SAClC,SAAS,EAAE;SACX,OAAO,EAAE,CAAC;IAEZ,aAAa;IACb,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;AAC/C,CAAC,CAAC,CAAC"}
+{"version":3,"file":"change-set-has-label.test.js","sourceRoot":"","sources":["../../src/query-filter/change-set-has-label.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAEvD,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;IACtE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,yBAAyB;IACzB,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,eAAe,CAAC;QACrB,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,iBAAiB;IACjB,MAAM,KAAK,GAAG,MAAM,WAAW,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;IAEzD,6CAA6C;IAC7C,MAAM,GAAG,CAAC,EAAE;SACV,UAAU,CAAC,kBAAkB,CAAC;SAC9B,MAAM,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;SACrD,OAAO,EAAE,CAAC;IAEZ,mCAAmC;IACnC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,EAAE;SAC7B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,iBAAiB,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;SAC5C,SAAS,EAAE;SACX,OAAO,EAAE,CAAC;IAEZ,aAAa;IACb,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AACxC,CAAC,CAAC,CAAC"}

package/dist/query-filter/change-set-is-ancestor-of.d.ts

@@ -0,0 +1,51 @@
+import { type SqlBool, type ExpressionBuilder, type ExpressionWrapper } from "kysely";
+import type { LixDatabaseSchema } from "../database/schema.js";
+import type { ChangeSet } from "../change-set/schema.js";
+/**
+ * Filters change sets that are ancestors of the given change set.
+ *
+ * By default, this is **exclusive**, meaning it returns only change sets strictly
+ * *before* the provided change set in the graph.
+ *
+ * Traverses the `change_set_edge` graph recursively, starting from the provided change set
+ * (or its parents if exclusive), and returns all change sets reachable via parent edges.
+ *
+ * This filter is typically used to scope the graph before applying filters like `changeIsLeaf()`.
+ *
+ * ⚠️ This filter only defines the traversal scope — it does not filter changes directly.
+ *
+ * --- Options ---
+ * - `includeSelf`: If `true`, includes the starting `changeSet` in the results. Defaults to `false`.
+ * - `depth`: Limits the traversal depth. `depth: 1` selects only immediate parents (if exclusive)
+ *   or the starting node and its immediate parents (if inclusive).
+ *
+ * --- Examples ---
+ *
+ * @example Selecting strict ancestors (default)
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsAncestorOf({ id: "cs3" }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Selecting inclusive ancestors
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsAncestorOf({ id: "cs3" }, { includeSelf: true }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Combining with changeSetIsDescendantOf to select change sets between two points in time
+ * ```ts
+ * // Select all change sets between startPoint and endPoint (inclusive)
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "startPoint" }))
+ *   .where(changeSetIsAncestorOf({ id: "endPoint" }))
+ *   .selectAll()
+ * ```
+ */
+export declare function changeSetIsAncestorOf(changeSet: Pick<ChangeSet, "id">, options?: {
+    depth?: number;
+    includeSelf?: boolean;
+}): (eb: ExpressionBuilder<LixDatabaseSchema, "change_set">) => ExpressionWrapper<LixDatabaseSchema, "change_set", SqlBool>;
+//# sourceMappingURL=change-set-is-ancestor-of.d.ts.map

package/dist/query-filter/change-set-is-ancestor-of.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-ancestor-of.d.ts","sourceRoot":"","sources":["../../src/query-filter/change-set-is-ancestor-of.ts"],"names":[],"mappings":"AAAA,OAAO,EAEN,KAAK,OAAO,EACZ,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,EACtB,MAAM,QAAQ,CAAC;AAChB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEzD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,wBAAgB,qBAAqB,CACpC,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAChC,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,OAAO,CAAA;CAAE,GACjD,CACF,EAAE,EAAE,iBAAiB,CAAC,iBAAiB,EAAE,YAAY,CAAC,KAClD,iBAAiB,CAAC,iBAAiB,EAAE,YAAY,EAAE,OAAO,CAAC,CAmB/D"}

package/dist/query-filter/change-set-is-ancestor-of.js

@@ -0,0 +1,63 @@
+import { sql, } from "kysely";
+/**
+ * Filters change sets that are ancestors of the given change set.
+ *
+ * By default, this is **exclusive**, meaning it returns only change sets strictly
+ * *before* the provided change set in the graph.
+ *
+ * Traverses the `change_set_edge` graph recursively, starting from the provided change set
+ * (or its parents if exclusive), and returns all change sets reachable via parent edges.
+ *
+ * This filter is typically used to scope the graph before applying filters like `changeIsLeaf()`.
+ *
+ * ⚠️ This filter only defines the traversal scope — it does not filter changes directly.
+ *
+ * --- Options ---
+ * - `includeSelf`: If `true`, includes the starting `changeSet` in the results. Defaults to `false`.
+ * - `depth`: Limits the traversal depth. `depth: 1` selects only immediate parents (if exclusive)
+ *   or the starting node and its immediate parents (if inclusive).
+ *
+ * --- Examples ---
+ *
+ * @example Selecting strict ancestors (default)
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsAncestorOf({ id: "cs3" }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Selecting inclusive ancestors
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsAncestorOf({ id: "cs3" }, { includeSelf: true }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Combining with changeSetIsDescendantOf to select change sets between two points in time
+ * ```ts
+ * // Select all change sets between startPoint and endPoint (inclusive)
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "startPoint" }))
+ *   .where(changeSetIsAncestorOf({ id: "endPoint" }))
+ *   .selectAll()
+ * ```
+ */
+export function changeSetIsAncestorOf(changeSet, options) {
+    const depthLimit = options?.depth;
+    const includeSelf = options?.includeSelf ?? false;
+    return () => sql `
+			change_set.id IN (
+				WITH RECURSIVE ap(id, depth) AS (
+					SELECT id, 0 AS depth FROM change_set WHERE id = ${sql.lit(changeSet.id)}
+					UNION ALL
+					SELECT change_set_edge.parent_id, ap.depth + 1
+					FROM change_set_edge
+					JOIN ap ON change_set_edge.child_id = ap.id
+					${depthLimit !== undefined ? sql `WHERE ap.depth < ${sql.lit(depthLimit)}` : sql ``}
+				)
+				-- Select based on the includeSelf flag
+				SELECT id FROM ap ${includeSelf ? sql `` : sql `WHERE depth > 0`}
+			)
+		`;
+}
+//# sourceMappingURL=change-set-is-ancestor-of.js.map

package/dist/query-filter/change-set-is-ancestor-of.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-ancestor-of.js","sourceRoot":"","sources":["../../src/query-filter/change-set-is-ancestor-of.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,GAAG,GAIH,MAAM,QAAQ,CAAC;AAIhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,MAAM,UAAU,qBAAqB,CACpC,SAAgC,EAChC,OAAmD;IAInD,MAAM,UAAU,GAAG,OAAO,EAAE,KAAK,CAAC;IAClC,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,KAAK,CAAC;IAElD,OAAO,GAAG,EAAE,CACX,GAAG,CAAS;;;wDAG0C,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;;;;;OAKtE,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAA,oBAAoB,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA,EAAE;;;wBAG9D,WAAW,CAAC,CAAC,CAAC,GAAG,CAAA,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA,iBAAiB;;GAExD,CAAC;AACX,CAAC"}

package/dist/query-filter/change-set-is-ancestor-of.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=change-set-is-ancestor-of.test.d.ts.map

package/dist/query-filter/change-set-is-ancestor-of.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-ancestor-of.test.d.ts","sourceRoot":"","sources":["../../src/query-filter/change-set-is-ancestor-of.test.ts"],"names":[],"mappings":""}

package/dist/query-filter/change-set-is-ancestor-of.test.js

@@ -0,0 +1,153 @@
+import { test, expect } from "vitest";
+import { openLix } from "../lix/open-lix.js";
+import { createChangeSet } from "../change-set/create-change-set.js";
+import { changeSetIsAncestorOf } from "./change-set-is-ancestor-of.js";
+test("selects all ancestors of the current change set", async () => {
+    const lix = await openLix({});
+    // Create a linear chain of change sets: cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        id: "cs0",
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        id: "cs1",
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        id: "cs2",
+        elements: [],
+        parents: [cs1],
+    });
+    // Should select cs0, cs1 as ancestors of cs2
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsAncestorOf(cs2))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs0.id, cs1.id].sort());
+});
+test("respects the optional depth limit", async () => {
+    const lix = await openLix({});
+    // cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        id: "cs0",
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        id: "cs1",
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        id: "cs2",
+        elements: [],
+        parents: [cs1],
+    });
+    // With depth: 1, we expect cs1 only
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsAncestorOf(cs2, { depth: 1 }))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs1.id].sort());
+});
+test("includeSelf true selects the current change set as well", async () => {
+    const lix = await openLix({});
+    // cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        id: "cs0",
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        id: "cs1",
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        id: "cs2",
+        elements: [],
+        parents: [cs1],
+    });
+    // Should select cs0, cs1, cs2
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsAncestorOf(cs2, { includeSelf: true }))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs0.id, cs1.id, cs2.id].sort());
+});
+test("can be combined with where(id = X) to check specific ancestry", async () => {
+    const lix = await openLix({});
+    // Create chain: cs1 <- cs2 <- cs3
+    const cs1 = await createChangeSet({
+        lix,
+        id: "cs1",
+        elements: [],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        id: "cs2",
+        elements: [],
+        parents: [cs1],
+    });
+    const cs3 = await createChangeSet({
+        lix,
+        id: "cs3",
+        elements: [],
+        parents: [cs2],
+    });
+    // Test: Check if cs2 is an ancestor of cs3 (should return cs2)
+    const cs2IsAncestorOfCs3 = await lix.db
+        .selectFrom("change_set")
+        .where("id", "=", cs2.id)
+        .where(changeSetIsAncestorOf(cs3))
+        .select("id")
+        .execute();
+    expect(cs2IsAncestorOfCs3).toHaveLength(1);
+    expect(cs2IsAncestorOfCs3[0].id).toBe(cs2.id);
+    // Test: Check if cs1 is an ancestor of cs3 (should return cs1)
+    const cs1IsAncestorOfCs3 = await lix.db
+        .selectFrom("change_set")
+        .where("id", "=", cs1.id)
+        .where(changeSetIsAncestorOf(cs3))
+        .select("id")
+        .execute();
+    expect(cs1IsAncestorOfCs3).toHaveLength(1);
+    expect(cs1IsAncestorOfCs3[0].id).toBe(cs1.id);
+    // Test: Check if cs3 is an ancestor of cs3 (should return empty - not inclusive by default)
+    const cs3IsAncestorOfCs3 = await lix.db
+        .selectFrom("change_set")
+        .where("id", "=", cs3.id)
+        .where(changeSetIsAncestorOf(cs3))
+        .select("id")
+        .execute();
+    expect(cs3IsAncestorOfCs3).toHaveLength(0);
+    // Test: Check if cs3 is an ancestor of cs1 (should return empty - wrong direction)
+    const cs3IsAncestorOfCs1 = await lix.db
+        .selectFrom("change_set")
+        .where("id", "=", cs3.id)
+        .where(changeSetIsAncestorOf(cs1))
+        .select("id")
+        .execute();
+    expect(cs3IsAncestorOfCs1).toHaveLength(0);
+    // Test: Check with includeSelf option
+    const cs3IsAncestorOfCs3Inclusive = await lix.db
+        .selectFrom("change_set")
+        .where("id", "=", cs3.id)
+        .where(changeSetIsAncestorOf(cs3, { includeSelf: true }))
+        .select("id")
+        .execute();
+    expect(cs3IsAncestorOfCs3Inclusive).toHaveLength(1);
+    expect(cs3IsAncestorOfCs3Inclusive[0].id).toBe(cs3.id);
+});
+//# sourceMappingURL=change-set-is-ancestor-of.test.js.map

package/dist/query-filter/change-set-is-ancestor-of.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-ancestor-of.test.js","sourceRoot":"","sources":["../../src/query-filter/change-set-is-ancestor-of.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAEvE,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;IAClE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,0DAA0D;IAC1D,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,6CAA6C;IAC7C,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAC1E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;IACpD,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,oBAAoB;IACpB,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,oCAAoC;IACpC,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;SAC/C,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAClE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;IAC1E,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,oBAAoB;IACpB,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,8BAA8B;IAC9B,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;SACxD,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAC9C,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAC/B,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;IAChF,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,kCAAkC;IAClC,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,EAAE,EAAE,KAAK;QACT,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,+DAA+D;IAC/D,MAAM,kBAAkB,GAAG,MAAM,GAAG,CAAC,EAAE;SACrC,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,kBAAkB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAE/C,+DAA+D;IAC/D,MAAM,kBAAkB,GAAG,MAAM,GAAG,CAAC,EAAE;SACrC,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,kBAAkB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAE/C,4FAA4F;IAC5F,MAAM,kBAAkB,GAAG,MAAM,GAAG,CAAC,EAAE;SACrC,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,kBAAkB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAE3C,mFAAmF;IACnF,MAAM,kBAAkB,GAAG,MAAM,GAAG,CAAC,EAAE;SACrC,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,kBAAkB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAE3C,sCAAsC;IACtC,MAAM,2BAA2B,GAAG,MAAM,GAAG,CAAC,EAAE;SAC9C,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACxB,KAAK,CAAC,qBAAqB,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;SACxD,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,2BAA2B,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,CAAC,2BAA2B,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC"}

package/dist/query-filter/change-set-is-descendant-of.d.ts

@@ -0,0 +1,44 @@
+import { type SqlBool, type ExpressionBuilder, type ExpressionWrapper } from "kysely";
+import type { LixDatabaseSchema } from "../database/schema.js";
+import type { ChangeSet } from "../change-set/schema.js";
+/**
+ * Filters change sets that are descendants of the given change set.
+ *
+ * By default, this is **exclusive**, meaning it returns only change sets strictly
+ * *after* the provided change set in the graph.
+ *
+ * Traverses the `change_set_edge` graph recursively, starting from the provided change set
+ * (or its children if exclusive), and returns all change sets reachable via child edges.
+ *
+ * This filter is useful for finding changes made *after* a specific point in time (e.g., a checkpoint).
+ *
+ * ⚠️ This filter only defines the traversal scope — it does not filter changes directly.
+ *
+ * --- Options ---
+ * - `includeSelf`: If `true`, includes the starting `changeSet` in the results. Defaults to `false`.
+ * - `depth`: Limits the traversal depth. `depth: 1` selects only immediate children (if exclusive)
+ *   or the starting node and its immediate children (if includeSelf is true).
+ *
+ * --- Examples ---
+ *
+ * @example Selecting strict descendants (default)
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "cs1" }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Combining with changeSetIsAncestorOf to select change sets between two points in time
+ * ```ts
+ * // Select all change sets between startPoint and endPoint (inclusive)
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "startPoint" }))
+ *   .where(changeSetIsAncestorOf({ id: "endPoint" }))
+ *   .selectAll()
+ * ```
+ */
+export declare function changeSetIsDescendantOf(changeSet: Pick<ChangeSet, "id">, options?: {
+    depth?: number;
+    includeSelf?: boolean;
+}): (eb: ExpressionBuilder<LixDatabaseSchema, "change_set">) => ExpressionWrapper<LixDatabaseSchema, "change_set", SqlBool>;
+//# sourceMappingURL=change-set-is-descendant-of.d.ts.map

package/dist/query-filter/change-set-is-descendant-of.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-descendant-of.d.ts","sourceRoot":"","sources":["../../src/query-filter/change-set-is-descendant-of.ts"],"names":[],"mappings":"AAAA,OAAO,EAEN,KAAK,OAAO,EACZ,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,EACtB,MAAM,QAAQ,CAAC;AAChB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEzD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,wBAAgB,uBAAuB,CACtC,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAChC,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,OAAO,CAAA;CAAE,GACjD,CACF,EAAE,EAAE,iBAAiB,CAAC,iBAAiB,EAAE,YAAY,CAAC,KAClD,iBAAiB,CAAC,iBAAiB,EAAE,YAAY,EAAE,OAAO,CAAC,CAmB/D"}

package/dist/query-filter/change-set-is-descendant-of.js

@@ -0,0 +1,56 @@
+import { sql, } from "kysely";
+/**
+ * Filters change sets that are descendants of the given change set.
+ *
+ * By default, this is **exclusive**, meaning it returns only change sets strictly
+ * *after* the provided change set in the graph.
+ *
+ * Traverses the `change_set_edge` graph recursively, starting from the provided change set
+ * (or its children if exclusive), and returns all change sets reachable via child edges.
+ *
+ * This filter is useful for finding changes made *after* a specific point in time (e.g., a checkpoint).
+ *
+ * ⚠️ This filter only defines the traversal scope — it does not filter changes directly.
+ *
+ * --- Options ---
+ * - `includeSelf`: If `true`, includes the starting `changeSet` in the results. Defaults to `false`.
+ * - `depth`: Limits the traversal depth. `depth: 1` selects only immediate children (if exclusive)
+ *   or the starting node and its immediate children (if includeSelf is true).
+ *
+ * --- Examples ---
+ *
+ * @example Selecting strict descendants (default)
+ * ```ts
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "cs1" }))
+ *   .selectAll()
+ * ```
+ *
+ * @example Combining with changeSetIsAncestorOf to select change sets between two points in time
+ * ```ts
+ * // Select all change sets between startPoint and endPoint (inclusive)
+ * db.selectFrom("change_set")
+ *   .where(changeSetIsDescendantOf({ id: "startPoint" }))
+ *   .where(changeSetIsAncestorOf({ id: "endPoint" }))
+ *   .selectAll()
+ * ```
+ */
+export function changeSetIsDescendantOf(changeSet, options) {
+    const depthLimit = options?.depth;
+    const includeSelf = options?.includeSelf ?? false;
+    return () => sql `
+			change_set.id IN (
+				WITH RECURSIVE dp(id, depth) AS (
+					SELECT id, 0 AS depth FROM change_set WHERE id = ${sql.lit(changeSet.id)}
+					UNION ALL
+					SELECT change_set_edge.child_id, dp.depth + 1
+					FROM change_set_edge
+					JOIN dp ON change_set_edge.parent_id = dp.id
+					${depthLimit !== undefined ? sql `WHERE dp.depth < ${sql.lit(depthLimit)}` : sql ``}
+				)
+				-- Select based on the includeSelf flag
+				SELECT id FROM dp ${includeSelf ? sql `` : sql `WHERE depth > 0`}
+			)
+		`;
+}
+//# sourceMappingURL=change-set-is-descendant-of.js.map

package/dist/query-filter/change-set-is-descendant-of.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-descendant-of.js","sourceRoot":"","sources":["../../src/query-filter/change-set-is-descendant-of.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,GAAG,GAIH,MAAM,QAAQ,CAAC;AAIhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAM,UAAU,uBAAuB,CACtC,SAAgC,EAChC,OAAmD;IAInD,MAAM,UAAU,GAAG,OAAO,EAAE,KAAK,CAAC;IAClC,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,KAAK,CAAC;IAElD,OAAO,GAAG,EAAE,CACX,GAAG,CAAS;;;wDAG0C,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;;;;;OAKtE,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAA,oBAAoB,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA,EAAE;;;wBAG9D,WAAW,CAAC,CAAC,CAAC,GAAG,CAAA,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA,iBAAiB;;GAExD,CAAC;AACX,CAAC"}

package/dist/query-filter/change-set-is-descendant-of.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=change-set-is-descendant-of.test.d.ts.map

package/dist/query-filter/change-set-is-descendant-of.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-descendant-of.test.d.ts","sourceRoot":"","sources":["../../src/query-filter/change-set-is-descendant-of.test.ts"],"names":[],"mappings":""}

package/dist/query-filter/change-set-is-descendant-of.test.js

@@ -0,0 +1,137 @@
+import { test, expect } from "vitest";
+import { openLix } from "../lix/open-lix.js";
+import { createChangeSet } from "../change-set/create-change-set.js";
+import { changeSetIsDescendantOf } from "./change-set-is-descendant-of.js";
+import { changeSetIsAncestorOf } from "./change-set-is-ancestor-of.js";
+test("selects all descendants excluding the current change set", async () => {
+    const lix = await openLix({});
+    // Create a linear chain of change sets: cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs1],
+    });
+    // Should select cs0, cs1, cs2 as descendants of cs0
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsDescendantOf(cs0))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs1.id, cs2.id].sort());
+});
+test("respects the optional depth limit", async () => {
+    const lix = await openLix({});
+    // cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs0],
+    });
+    await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs1],
+    });
+    // With depth: 1 starting from cs0, we expect cs0 and cs1 only
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsDescendantOf(cs0, { depth: 1 }))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs1.id].sort());
+});
+test("can be combined with ancestor filter to select sets between two points", async () => {
+    const lix = await openLix({});
+    // Create a linear chain: cs0 <- cs1 <- cs2 <- cs3
+    const cs0 = await createChangeSet({
+        lix,
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs1],
+    });
+    const cs3 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs2],
+    });
+    // Select change sets that are descendants of cs1 AND ancestors of cs3
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsDescendantOf(cs1))
+        .where(changeSetIsAncestorOf(cs3))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs2.id].sort());
+});
+test("selects descendants including the current change set when includeSelf is true", async () => {
+    const lix = await openLix({});
+    // Setup: cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs0],
+    });
+    const cs2 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs1],
+    });
+    // Should select cs0, cs1, cs2 when includeSelf: true starting from cs0
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsDescendantOf(cs0, { includeSelf: true }))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs0.id, cs1.id, cs2.id].sort());
+});
+test("respects depth limit when includeSelf is true", async () => {
+    const lix = await openLix({});
+    // Setup: cs0 <- cs1 <- cs2
+    const cs0 = await createChangeSet({
+        lix,
+        elements: [],
+    });
+    const cs1 = await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs0],
+    });
+    await createChangeSet({
+        lix,
+        elements: [],
+        parents: [cs1],
+    });
+    // With depth: 1 and includeSelf: true starting from cs0, we expect cs0 and cs1
+    const results = await lix.db
+        .selectFrom("change_set")
+        .where(changeSetIsDescendantOf(cs0, { depth: 1, includeSelf: true }))
+        .select("id")
+        .execute();
+    expect(results.map((r) => r.id).sort()).toEqual([cs0.id, cs1.id].sort());
+});
+//# sourceMappingURL=change-set-is-descendant-of.test.js.map

package/dist/query-filter/change-set-is-descendant-of.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-set-is-descendant-of.test.js","sourceRoot":"","sources":["../../src/query-filter/change-set-is-descendant-of.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAEvE,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;IAC3E,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,0DAA0D;IAC1D,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,oDAAoD;IACpD,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;SACnC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAC1E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;IACpD,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,oBAAoB;IACpB,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,eAAe,CAAC;QACrB,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,8DAA8D;IAC9D,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,uBAAuB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;SACjD,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAClE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;IACzF,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,kDAAkD;IAClD,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,sEAAsE;IACtE,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;SACnC,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAClE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,+EAA+E,EAAE,KAAK,IAAI,EAAE;IAChG,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,2BAA2B;IAC3B,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,uEAAuE;IACvE,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,uBAAuB,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;SAC1D,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAC9C,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAC/B,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;IAChE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAE9B,2BAA2B;IAC3B,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC;QACjC,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,MAAM,eAAe,CAAC;QACrB,GAAG;QACH,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC,GAAG,CAAC;KACd,CAAC,CAAC;IAEH,+EAA+E;IAC/E,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE;SAC1B,UAAU,CAAC,YAAY,CAAC;SACxB,KAAK,CAAC,uBAAuB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;SACpE,MAAM,CAAC,IAAI,CAAC;SACZ,OAAO,EAAE,CAAC;IAEZ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAC1E,CAAC,CAAC,CAAC"}

package/dist/query-filter/index.d.ts

@@ -1,9 +1,8 @@
-export { changeConflictInVersion } from "./change-conflict-in-version.js";
 export { changeHasLabel } from "./change-has-label.js";
-export { changeIsLeaf } from "./change-is-leaf.js";
-export { changeIsLeafOf } from "./change-is-leaf-of.js";
-export { changeIsLeafInVersion } from "./change-is-leaf-in-version.js";
-export { changeInVersion } from "./change-in-version.js";
-export { changeIsLowestCommonAncestorOf } from "./change-is-lowest-common-ancestor-of.js";
+export { changeSetElementInAncestryOf } from "./change-set-element-in-ancestry-of.js";
 export { changeSetHasLabel } from "./change-set-has-label.js";
+export { changeSetIsAncestorOf } from "./change-set-is-ancestor-of.js";
+export { changeSetIsDescendantOf } from "./change-set-is-descendant-of.js";
+export { changeSetElementIsLeafOf } from "./change-set-element-is-leaf-of.js";
+export { changeSetElementInSymmetricDifference } from "./change-set-element-in-symmetric-difference.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/query-filter/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/query-filter/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC1E,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,8BAA8B,EAAE,MAAM,0CAA0C,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/query-filter/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,4BAA4B,EAAE,MAAM,wCAAwC,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,wBAAwB,EAAE,MAAM,oCAAoC,CAAC;AAC9E,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC"}