Predicate Comparison and Merging Utilities for Predicate Push-Down

.changeset/legal-cooks-sink.md

@@ -0,0 +1,5 @@
+---
+"@tanstack/db-ivm": patch
+---
+
+Fix bug with setWindow on ordered queries that have no limit.

.changeset/light-phones-flash.md

@@ -0,0 +1,5 @@
+---
+"@tanstack/db": patch
+---
+
+Add predicate comparison and merging utilities (isWhereSubset, intersectWherePredicates, unionWherePredicates, and related functions) to support predicate push-down in collection sync operations, enabling efficient tracking of loaded data ranges and preventing redundant server requests. Includes performance optimizations for large primitive IN predicates and full support for Date objects in equality, range, and IN clause comparisons.

.changeset/open-cups-lose.md

@@ -0,0 +1,5 @@
+---
+"@tanstack/db": patch
+---
+
+Add support for orderBy and limit in currentStateAsChanges function

packages/db-ivm/src/operators/topKWithFractionalIndex.ts

@@ -87,12 +87,25 @@ class TopKArray<V> implements TopK<V> {
   }): TopKMoveChanges<V> {
     const oldOffset = this.#topKStart
     const oldLimit = this.#topKEnd - this.#topKStart
-    const oldRange: HRange = [this.#topKStart, this.#topKEnd]
 
-    this.#topKStart = offset ?? oldOffset
-    this.#topKEnd = this.#topKStart + (limit ?? oldLimit)
+    // `this.#topKEnd` can be `Infinity` if it has no limit
+    // but `diffHalfOpen` expects a finite range
+    // so we restrict it to the size of the topK if topKEnd is infinite
+    const oldRange: HRange = [
+      this.#topKStart,
+      this.#topKEnd === Infinity ? this.#topKStart + this.size : this.#topKEnd,
+    ]
 
-    const newRange: HRange = [this.#topKStart, this.#topKEnd]
+    this.#topKStart = offset ?? oldOffset
+    this.#topKEnd = this.#topKStart + (limit ?? oldLimit) // can be `Infinity` if limit is `Infinity`
+
+    // Also handle `Infinity` in the newRange
+    const newRange: HRange = [
+      this.#topKStart,
+      this.#topKEnd === Infinity
+        ? Math.max(this.#topKStart + this.size, oldRange[1]) // since the new limit is Infinity we need to take everything (so we need to take the biggest (finite) topKEnd)
+        : this.#topKEnd,
+    ]
     const { onlyInA, onlyInB } = diffHalfOpen(oldRange, newRange)
 
     const moveIns: Array<IndexedValue<V>> = []