unframer 2.22.0 → 2.22.1

package/src/framer.js

@@ -10429,7 +10429,7 @@ function steps(numSteps, direction = 'end',) {
   };
 }
 
-// /:https://app.framerstatic.com/framer.WEKEHMWW.mjs
+// /:https://app.framerstatic.com/framer.VDKYGJXW.mjs
 import React4 from 'react';
 import { Suspense as Suspense3, } from 'react';
 import { memo as memo2, startTransition as startTransition2, } from 'react';
@@ -13602,7 +13602,7 @@ var MarkSuspenseEffects = {
 function renderPage(Page4, defaultPageStyle,) {
   const props = {
     style: defaultPageStyle,
-    'data-framer-root': true,
+    'data-framer-root': '',
   };
   return React4.isValidElement(Page4,) ? React4.cloneElement(Page4, props,) : React4.createElement(Page4, props,);
 }
@@ -31364,26 +31364,36 @@ var CustomCursorContext = /* @__PURE__ */ createContext({
 },);
 var replaceCursorClassName = 'framer-cursor-none';
 var cursorComponentClassName = 'framer-pointer-events-none';
+function getActiveDefinitions(map2, previousDefinitions, newDefinitions,) {
+  const allCursors = {};
+  for (const [, hashes,] of map2) {
+    for (const hash2 of hashes) {
+      const value = allCursors[hash2] ?? previousDefinitions[hash2] ?? newDefinitions[hash2];
+      if (value) allCursors[hash2] = value;
+    }
+  }
+  return allCursors;
+}
 var CustomCursorContextProvider = /* @__PURE__ */ memo2(function CustomCursorList({
   children,
 },) {
   const value = useConstant2(() => {
     const events = /* @__PURE__ */ new Set();
     let allCursors = {};
+    const byCaller = /* @__PURE__ */ new Map();
     return {
       onRegisterCursors: (callback) => {
         callback(allCursors,);
         events.add(callback,);
         return () => events.delete(callback,);
       },
-      registerCursors: (cursors) => {
-        const nextCursors = {};
-        for (const key7 in cursors) {
-          const cursor = allCursors[key7] ?? cursors[key7];
-          if (cursor) nextCursors[key7] = cursor;
-        }
-        allCursors = nextCursors;
+      registerCursors: (cursors, id3,) => {
+        byCaller.set(id3, Object.keys(cursors,),);
+        allCursors = getActiveDefinitions(byCaller, allCursors, cursors,);
         for (const callback of events) callback(allCursors,);
+        return () => {
+          byCaller.delete(id3,);
+        };
       },
     };
   },);
@@ -31625,9 +31635,10 @@ function useCustomCursors(webPageCursors,) {
     registerCursors,
   } = useContext(CustomCursorContext,);
   const cursors = useConstant2(() => webPageCursors);
+  const id3 = useId();
   useLayoutEffect(() => {
-    registerCursors(cursors,);
-  }, [registerCursors,],);
+    return registerCursors(cursors, id3,);
+  }, [registerCursors, id3,],);
 }
 var Polygon = {
   /**
@@ -34845,6 +34856,19 @@ var CompatibilityDatabaseCollection = class {
     return Number(left.pointer,) - Number(right.pointer,);
   }
 };
+function compareArray(left, right, collation11,) {
+  const leftLength = left.value.length;
+  const rightLength = right.value.length;
+  if (leftLength < rightLength) return -1;
+  if (leftLength > rightLength) return 1;
+  for (let i = 0; i < leftLength; i++) {
+    const leftItem = left.value[i];
+    const rightItem = right.value[i];
+    const result = compare(leftItem, rightItem, collation11,);
+    if (result !== 0) return result;
+  }
+  return 0;
+}
 function castArray(value, definition,) {
   switch (value == null ? void 0 : value.type) {
     case 'array': {
@@ -34859,6 +34883,11 @@ function castArray(value, definition,) {
   }
   return null;
 }
+function compareBoolean(left, right,) {
+  if (left.value < right.value) return -1;
+  if (left.value > right.value) return 1;
+  return 0;
+}
 function castBoolean(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'boolean': {
@@ -34874,10 +34903,15 @@ function castBoolean(value,) {
   }
   return null;
 }
-function toBoolean(value,) {
+function valueToBoolean(value,) {
   const cast = castBoolean(value,);
   return (cast == null ? void 0 : cast.value) ?? false;
 }
+function compareColor(left, right,) {
+  if (left.value < right.value) return -1;
+  if (left.value > right.value) return 1;
+  return 0;
+}
 function castColor(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'color': {
@@ -34886,6 +34920,13 @@ function castColor(value,) {
   }
   return null;
 }
+function compareDate(left, right,) {
+  const leftDate = new Date(left.value,);
+  const rightDate = new Date(right.value,);
+  if (leftDate < rightDate) return -1;
+  if (leftDate > rightDate) return 1;
+  return 0;
+}
 function castDate(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'date': {
@@ -34905,6 +34946,11 @@ function castDate(value,) {
   }
   return null;
 }
+function compareEnum(left, right,) {
+  if (left.value < right.value) return -1;
+  if (left.value > right.value) return 1;
+  return 0;
+}
 function castEnum(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'enum': {
@@ -34919,6 +34965,11 @@ function castEnum(value,) {
   }
   return null;
 }
+function compareFile(left, right,) {
+  if (left.value < right.value) return -1;
+  if (left.value > right.value) return 1;
+  return 0;
+}
 function castFile(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'file': {
@@ -34927,6 +34978,13 @@ function castFile(value,) {
   }
   return null;
 }
+function compareLink(left, right,) {
+  const leftEncoded = JSON.stringify(left.value,);
+  const rightEncoded = JSON.stringify(right.value,);
+  if (leftEncoded < rightEncoded) return -1;
+  if (leftEncoded > rightEncoded) return 1;
+  return 0;
+}
 function castLink(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'link': {
@@ -34951,6 +35009,11 @@ function castLink(value,) {
   }
   return null;
 }
+function compareNumber(left, right,) {
+  if (left.value < right.value) return -1;
+  if (left.value > right.value) return 1;
+  return 0;
+}
 function castNumber(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'number':
@@ -34967,10 +35030,27 @@ function castNumber(value,) {
   }
   return null;
 }
-function toNumber2(value,) {
+function valueToNumber(value,) {
   const cast = castNumber(value,);
   return (cast == null ? void 0 : cast.value) ?? null;
 }
+function compareObject(left, right, collation11,) {
+  const leftKeys = Object.keys(left.value,).sort();
+  const rightKeys = Object.keys(right.value,).sort();
+  if (leftKeys.length < rightKeys.length) return -1;
+  if (leftKeys.length > rightKeys.length) return 1;
+  for (let i = 0; i < leftKeys.length; i++) {
+    const leftKey = leftKeys[i];
+    const rightKey = rightKeys[i];
+    if (leftKey < rightKey) return -1;
+    if (leftKey > rightKey) return 1;
+    const leftValue = left.value[leftKey] ?? null;
+    const rightValue = right.value[rightKey] ?? null;
+    const result = compare(leftValue, rightValue, collation11,);
+    if (result !== 0) return result;
+  }
+  return 0;
+}
 function castObject(value, definition,) {
   switch (value == null ? void 0 : value.type) {
     case 'object': {
@@ -34988,6 +35068,13 @@ function castObject(value, definition,) {
   }
   return null;
 }
+function compareResponsiveImage(left, right,) {
+  const leftEncoded = JSON.stringify(left.value,);
+  const rightEncoded = JSON.stringify(right.value,);
+  if (leftEncoded < rightEncoded) return -1;
+  if (leftEncoded > rightEncoded) return 1;
+  return 0;
+}
 function castResponsiveImage(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'responsiveimage': {
@@ -34996,6 +35083,13 @@ function castResponsiveImage(value,) {
   }
   return null;
 }
+function compareRichText(left, right,) {
+  const leftValue = left.value;
+  const rightValue = right.value;
+  if (leftValue < rightValue) return -1;
+  if (leftValue > rightValue) return 1;
+  return 0;
+}
 function castRichText(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'richtext': {
@@ -35004,6 +35098,17 @@ function castRichText(value,) {
   }
   return null;
 }
+function compareString(left, right, collation11,) {
+  let leftValue = left.value;
+  let rightValue = right.value;
+  if (collation11.type === 0) {
+    leftValue = left.value.toLowerCase();
+    rightValue = right.value.toLowerCase();
+  }
+  if (leftValue < rightValue) return -1;
+  if (leftValue > rightValue) return 1;
+  return 0;
+}
 function castString(value,) {
   switch (value == null ? void 0 : value.type) {
     case 'string': {
@@ -35018,7 +35123,7 @@ function castString(value,) {
   }
   return null;
 }
-function toString(value,) {
+function valueToString(value,) {
   const cast = castString(value,);
   return (cast == null ? void 0 : cast.value) ?? null;
 }
@@ -35166,8 +35271,8 @@ var DatabaseValue = {
     },);
   },
   contains(source, target, collation11,) {
-    let sourceValue = toString(source,);
-    let targetValue = toString(target,);
+    let sourceValue = valueToString(source,);
+    let targetValue = valueToString(target,);
     if (isNull(sourceValue,)) return false;
     if (isNull(targetValue,)) return false;
     if (collation11.type === 0) {
@@ -35177,8 +35282,8 @@ var DatabaseValue = {
     return sourceValue.includes(targetValue,);
   },
   startsWith(source, target, collation11,) {
-    let sourceValue = toString(source,);
-    let targetValue = toString(target,);
+    let sourceValue = valueToString(source,);
+    let targetValue = valueToString(target,);
     if (isNull(sourceValue,)) return false;
     if (isNull(targetValue,)) return false;
     if (collation11.type === 0) {
@@ -35188,8 +35293,8 @@ var DatabaseValue = {
     return sourceValue.startsWith(targetValue,);
   },
   endsWith(source, target, collation11,) {
-    let sourceValue = toString(source,);
-    let targetValue = toString(target,);
+    let sourceValue = valueToString(source,);
+    let targetValue = valueToString(target,);
     if (isNull(sourceValue,)) return false;
     if (isNull(targetValue,)) return false;
     if (collation11.type === 0) {
@@ -35246,115 +35351,51 @@ function compare(left, right, collation11,) {
   switch (left.type) {
     case 'array': {
       assert(left.type === right.type,);
-      const leftLength = left.value.length;
-      const rightLength = right.value.length;
-      if (leftLength < rightLength) return -1;
-      if (leftLength > rightLength) return 1;
-      for (let i = 0; i < leftLength; i++) {
-        const leftItem = left.value[i];
-        const rightItem = right.value[i];
-        assert(!isUndefined(leftItem,), 'Left item must exist',);
-        assert(!isUndefined(rightItem,), 'Right item must exist',);
-        const result = compare(leftItem, rightItem, collation11,);
-        if (result !== 0) return result;
-      }
-      return 0;
+      return compareArray(left, right, collation11,);
     }
     case 'boolean': {
       assert(left.type === right.type,);
-      if (left.value < right.value) return -1;
-      if (left.value > right.value) return 1;
-      return 0;
+      return compareBoolean(left, right,);
     }
     case 'color': {
       assert(left.type === right.type,);
-      if (left.value < right.value) return -1;
-      if (left.value > right.value) return 1;
-      return 0;
+      return compareColor(left, right,);
     }
     case 'date': {
       assert(left.type === right.type,);
-      const leftDate = new Date(left.value,);
-      const rightDate = new Date(right.value,);
-      if (leftDate < rightDate) return -1;
-      if (leftDate > rightDate) return 1;
-      return 0;
+      return compareDate(left, right,);
     }
     case 'enum': {
       assert(left.type === right.type,);
-      if (left.value < right.value) return -1;
-      if (left.value > right.value) return 1;
-      return 0;
+      return compareEnum(left, right,);
     }
     case 'file': {
       assert(left.type === right.type,);
-      if (left.value < right.value) return -1;
-      if (left.value > right.value) return 1;
-      return 0;
+      return compareFile(left, right,);
     }
     case 'link': {
       assert(left.type === right.type,);
-      const leftEncoded = JSON.stringify(left.value,);
-      const rightEncoded = JSON.stringify(right.value,);
-      if (leftEncoded < rightEncoded) return -1;
-      if (leftEncoded > rightEncoded) return 1;
-      return 0;
+      return compareLink(left, right,);
     }
     case 'number': {
       assert(left.type === right.type,);
-      if (left.value < right.value) return -1;
-      if (left.value > right.value) return 1;
-      return 0;
+      return compareNumber(left, right,);
     }
     case 'object': {
       assert(left.type === right.type,);
-      const leftKeys = Object.keys(left.value,).sort();
-      const rightKeys = Object.keys(right.value,).sort();
-      if (leftKeys.length < rightKeys.length) return -1;
-      if (leftKeys.length > rightKeys.length) return 1;
-      for (let i = 0; i < leftKeys.length; i++) {
-        const leftKey = leftKeys[i];
-        const rightKey = rightKeys[i];
-        assert(!isUndefined(leftKey,), 'Left key must exist',);
-        assert(!isUndefined(rightKey,), 'Left key must exist',);
-        if (leftKey < rightKey) return -1;
-        if (leftKey > rightKey) return 1;
-        const leftValue = left.value[leftKey];
-        const rightValue = right.value[rightKey];
-        assert(!isUndefined(leftValue,), 'Left value must exist',);
-        assert(!isUndefined(rightValue,), 'Right value must exist',);
-        const result = compare(leftValue, rightValue, collation11,);
-        if (result !== 0) return result;
-      }
-      return 0;
+      return compareObject(left, right, collation11,);
     }
     case 'responsiveimage': {
       assert(left.type === right.type,);
-      const leftEncoded = JSON.stringify(left.value,);
-      const rightEncoded = JSON.stringify(right.value,);
-      if (leftEncoded < rightEncoded) return -1;
-      if (leftEncoded > rightEncoded) return 1;
-      return 0;
+      return compareResponsiveImage(left, right,);
     }
     case 'richtext': {
       assert(left.type === right.type,);
-      const leftValue = left.value;
-      const rightValue = right.value;
-      if (leftValue < rightValue) return -1;
-      if (leftValue > rightValue) return 1;
-      return 0;
+      return compareRichText(left, right,);
     }
     case 'string': {
       assert(left.type === right.type,);
-      let leftValue = left.value;
-      let rightValue = right.value;
-      if (collation11.type === 0) {
-        leftValue = left.value.toLowerCase();
-        rightValue = right.value.toLowerCase();
-      }
-      if (leftValue < rightValue) return -1;
-      if (leftValue > rightValue) return 1;
-      return 0;
+      return compareString(left, right, collation11,);
     }
     default: {
       assertNever(left,);
@@ -36059,7 +36100,8 @@ var RelationalProject = class extends RelationalNode {
     this.input = input;
     this.projections = projections;
     this.passthrough = passthrough;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('RelationalProject', this.inputGroup.id, ...this.projections, this.passthrough,);
@@ -36232,24 +36274,6 @@ var ScalarCase = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarCase', this.input, ...this.conditions, this.otherwise,);
   }
-  toString() {
-    let result = 'CASE';
-    if (this.input) {
-      result = `${result} ${this.input}`;
-    }
-    for (
-      const {
-        when,
-        then,
-      } of this.conditions
-    ) {
-      result = `${result} WHEN ${when} THEN ${then}`;
-    }
-    if (this.otherwise) {
-      result = `${result} ELSE ${this.otherwise}`;
-    }
-    return `${result} END`;
-  }
   optimize(optimizer,) {
     var _a, _b;
     (_a = this.input) == null ? void 0 : _a.optimize(optimizer,);
@@ -36282,6 +36306,7 @@ var ScalarCase = class extends ScalarNode {
       conditions: evaluateArray(this.conditions.map((condition) =>
         evaluateObject({
           when: condition.when.evaluate(context, tuple,),
+          // biome-ignore lint/suspicious/noThenProperty: Existing name.
           then: condition.then.evaluate(context, tuple,),
         },)
       ),),
@@ -36305,7 +36330,7 @@ var ScalarCase = class extends ScalarNode {
           then,
         } of conditions
       ) {
-        if (toBoolean(when,)) {
+        if (valueToBoolean(when,)) {
           return then;
         }
       }
@@ -36742,7 +36767,8 @@ var RelationalFilter = class extends RelationalNode {
     super(input.isSynchronous && predicate.isSynchronous,);
     this.input = input;
     this.predicate = predicate;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('RelationalFilter', this.inputGroup.id, this.predicate,);
@@ -36780,7 +36806,7 @@ var RelationalFilter = class extends RelationalNode {
     },),);
     return input.filter((_, index,) => {
       const predicate = predicates[index] ?? null;
-      return toBoolean(predicate,);
+      return valueToBoolean(predicate,);
     },);
   }
 };
@@ -36832,8 +36858,10 @@ var RelationalIntersection = class extends RelationalNode {
     super(left.isSynchronous && right.isSynchronous,);
     this.left = left;
     this.right = right;
-    __publicField(this, 'leftGroup', this.left.getGroup(),);
-    __publicField(this, 'rightGroup', this.right.getGroup(),);
+    __publicField(this, 'leftGroup',);
+    __publicField(this, 'rightGroup',);
+    this.leftGroup = left.getGroup();
+    this.rightGroup = right.getGroup();
   }
   getHash() {
     return calculateHash('RelationalIntersection', this.leftGroup.id, this.rightGroup.id,);
@@ -36904,9 +36932,6 @@ var ScalarEquals = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarEquals', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} == ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -36937,8 +36962,10 @@ var RelationalLeftJoin = class extends RelationalNode {
     this.left = left;
     this.right = right;
     this.constraint = constraint;
-    __publicField(this, 'leftGroup', this.left.getGroup(),);
-    __publicField(this, 'rightGroup', this.right.getGroup(),);
+    __publicField(this, 'leftGroup',);
+    __publicField(this, 'rightGroup',);
+    this.leftGroup = left.getGroup();
+    this.rightGroup = right.getGroup();
   }
   getHash() {
     return calculateHash('RelationalLeftJoin', this.leftGroup.id, this.rightGroup.id, this.constraint,);
@@ -37047,7 +37074,7 @@ var RelationalLeftJoin = class extends RelationalNode {
         tuple.merge(leftTuple,);
         tuple.merge(rightTuple,);
         const value = yield* this.constraint.evaluate(context, tuple,);
-        if (toBoolean(value,)) {
+        if (valueToBoolean(value,)) {
           result.push(tuple,);
           hasMatch = true;
         }
@@ -37065,8 +37092,10 @@ var RelationalRightJoin = class extends RelationalNode {
     this.left = left;
     this.right = right;
     this.constraint = constraint;
-    __publicField(this, 'leftGroup', this.left.getGroup(),);
-    __publicField(this, 'rightGroup', this.right.getGroup(),);
+    __publicField(this, 'leftGroup',);
+    __publicField(this, 'rightGroup',);
+    this.leftGroup = left.getGroup();
+    this.rightGroup = right.getGroup();
   }
   getHash() {
     return calculateHash('RelationalRightJoin', this.leftGroup.id, this.rightGroup.id, this.constraint,);
@@ -37175,7 +37204,7 @@ var RelationalRightJoin = class extends RelationalNode {
         tuple.merge(rightTuple,);
         tuple.merge(leftTuple,);
         const value = yield* this.constraint.evaluate(context, tuple,);
-        if (toBoolean(value,)) {
+        if (valueToBoolean(value,)) {
           result.push(tuple,);
           hasMatch = true;
         }
@@ -37231,8 +37260,10 @@ var RelationalUnion = class extends RelationalNode {
     super(left.isSynchronous && right.isSynchronous,);
     this.left = left;
     this.right = right;
-    __publicField(this, 'leftGroup', this.left.getGroup(),);
-    __publicField(this, 'rightGroup', this.right.getGroup(),);
+    __publicField(this, 'leftGroup',);
+    __publicField(this, 'rightGroup',);
+    this.leftGroup = left.getGroup();
+    this.rightGroup = right.getGroup();
   }
   getHash() {
     return calculateHash('RelationalUnion', this.leftGroup.id, this.rightGroup.id,);
@@ -37303,9 +37334,6 @@ var ScalarAnd = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarAnd', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} && ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37326,7 +37354,7 @@ var ScalarAnd = class extends ScalarNode {
     },);
     return {
       type: 'boolean',
-      value: toBoolean(left,) && toBoolean(right,),
+      value: valueToBoolean(left,) && valueToBoolean(right,),
     };
   }
 };
@@ -37341,16 +37369,13 @@ var ScalarConstant = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarConstant', this.definition, this.value,);
   }
-  toString() {
-    return DatabaseValue.stringify(this.value,);
-  }
   optimize() {
     return new Cost(0,);
   }
   getOptimized() {
     return this;
   }
-  // eslint-disable-next-line require-yield
+  // biome-ignore lint/correctness/useYield: Required by the super class.
   *evaluate() {
     return this.value;
   }
@@ -37379,9 +37404,6 @@ var ScalarContains = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarContains', this.source, this.target,);
   }
-  toString() {
-    return `CONTAINS(${this.source}, ${this.target})`;
-  }
   optimize(optimizer,) {
     const sourceCost = this.source.optimize(optimizer,);
     const targetCost = this.target.optimize(optimizer,);
@@ -37430,9 +37452,6 @@ var ScalarEndsWith = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarEndsWith', this.source, this.target,);
   }
-  toString() {
-    return `ENDS_WITH(${this.source}, ${this.target})`;
-  }
   optimize(optimizer,) {
     const sourceCost = this.source.optimize(optimizer,);
     const targetCost = this.target.optimize(optimizer,);
@@ -37477,9 +37496,6 @@ var ScalarGreaterThan = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarGreaterThan', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} > ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37524,9 +37540,6 @@ var ScalarGreaterThanOrEqual = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarGreaterThanOrEqual', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} >= ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37571,9 +37584,6 @@ var ScalarLessThan = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarLessThan', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} < ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37618,9 +37628,6 @@ var ScalarLessThanOrEqual = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarLessThanOrEqual', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} <= ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37665,9 +37672,6 @@ var ScalarNotEquals = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarNotEquals', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} != ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37712,9 +37716,6 @@ var ScalarOr = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarOr', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} || ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -37735,7 +37736,7 @@ var ScalarOr = class extends ScalarNode {
     },);
     return {
       type: 'boolean',
-      value: toBoolean(left,) || toBoolean(right,),
+      value: valueToBoolean(left,) || valueToBoolean(right,),
     };
   }
 };
@@ -37763,9 +37764,6 @@ var ScalarStartsWith = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarStartsWith', this.source, this.target,);
   }
-  toString() {
-    return `STARTS_WITH(${this.source}, ${this.target})`;
-  }
   optimize(optimizer,) {
     const sourceCost = this.source.optimize(optimizer,);
     const targetCost = this.target.optimize(optimizer,);
@@ -37793,7 +37791,8 @@ var ScalarStartsWith = class extends ScalarNode {
 var Explorer = class {
   constructor(normalizer,) {
     this.normalizer = normalizer;
-    __publicField(this, 'memo', this.normalizer.memo,);
+    __publicField(this, 'memo',);
+    this.memo = normalizer.memo;
   }
   explore(before,) {
     const group = before.getGroup();
@@ -38023,7 +38022,8 @@ var RelationalLimit = class extends RelationalNode {
     this.input = input;
     this.limit = limit;
     this.ordering = ordering;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('RelationalLimit', this.inputGroup.id, this.limit,);
@@ -38062,7 +38062,7 @@ var RelationalLimit = class extends RelationalNode {
       input: this.input.evaluate(context,),
       limit: this.limit.evaluate(context, void 0,),
     },);
-    const value = toNumber2(limit,) ?? Infinity;
+    const value = valueToNumber(limit,) ?? Infinity;
     if (value === Infinity) return input;
     return input.slice(0, value,);
   }
@@ -38073,7 +38073,8 @@ var RelationalOffset = class extends RelationalNode {
     this.input = input;
     this.offset = offset;
     this.ordering = ordering;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('RelationalOffset', this.inputGroup.id, this.offset,);
@@ -38112,7 +38113,7 @@ var RelationalOffset = class extends RelationalNode {
       input: this.input.evaluate(context,),
       offset: this.offset.evaluate(context, void 0,),
     },);
-    const value = toNumber2(offset,) ?? 0;
+    const value = valueToNumber(offset,) ?? 0;
     if (value === 0) return input;
     return input.slice(value,);
   }
@@ -38125,8 +38126,9 @@ var ScalarArray = class extends ScalarNode {
     this.ordering = ordering;
     this.referencedFields = referencedFields;
     this.referencedOuterFields = referencedOuterFields;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
     __publicField(this, 'definition',);
+    this.inputGroup = input.getGroup();
     const itemDefinitions = {};
     const namedFieldEntries = Object.entries(namedFields,);
     for (const [name, field,] of namedFieldEntries) {
@@ -38157,9 +38159,6 @@ var ScalarArray = class extends ScalarNode {
       this.referencedOuterFields,
     );
   }
-  toString() {
-    return `ARRAY(${this.inputGroup.id})`;
-  }
   getInputRequiredProps() {
     const resolvedFields = new Fields();
     const fields = Object.values(this.namedFields,);
@@ -38210,9 +38209,6 @@ var ScalarCast = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarCast', this.input, this.definition,);
   }
-  toString() {
-    return `CAST(${this.input} AS ${this.definition.type.toUpperCase()})`;
-  }
   optimize(optimizer,) {
     return this.input.optimize(optimizer,);
   }
@@ -38233,12 +38229,13 @@ var ScalarFlatArray = class extends ScalarNode {
     this.ordering = ordering;
     this.referencedFields = referencedFields;
     this.referencedOuterFields = referencedOuterFields;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
     __publicField(this, 'definition',);
+    this.inputGroup = input.getGroup();
     this.definition = {
       type: 'array',
       isNullable: false,
-      definition: this.field.definition,
+      definition: field.definition,
     };
   }
   getHash() {
@@ -38251,9 +38248,6 @@ var ScalarFlatArray = class extends ScalarNode {
       this.referencedOuterFields,
     );
   }
-  toString() {
-    return `FLAT_ARRAY(${this.inputGroup.id})`;
-  }
   getInputRequiredProps() {
     const resolvedFields = new Fields();
     if (!isUndefined(this.field.collection,)) {
@@ -38308,9 +38302,6 @@ var ScalarIn = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarIn', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} IN ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -38359,9 +38350,6 @@ var ScalarIndexOf = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarIndexOf', this.source, this.target,);
   }
-  toString() {
-    return `INDEX_OF(${this.source}, ${this.target})`;
-  }
   optimize(optimizer,) {
     const sourceCost = this.source.optimize(optimizer,);
     const targetCost = this.target.optimize(optimizer,);
@@ -38398,9 +38386,6 @@ var ScalarLength = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarLength', this.input,);
   }
-  toString() {
-    return `LENGTH(${this.input})`;
-  }
   optimize(optimizer,) {
     return this.input.optimize(optimizer,);
   }
@@ -38428,9 +38413,6 @@ var ScalarNot = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarNot', this.input,);
   }
-  toString() {
-    return `NOT ${this.input}`;
-  }
   optimize(optimizer,) {
     return this.input.optimize(optimizer,);
   }
@@ -38442,7 +38424,7 @@ var ScalarNot = class extends ScalarNode {
     const input = yield* this.input.evaluate(context, tuple,);
     return {
       type: 'boolean',
-      value: !toBoolean(input,),
+      value: !valueToBoolean(input,),
     };
   }
 };
@@ -38470,9 +38452,6 @@ var ScalarNotIn = class extends ScalarNode {
   getHash() {
     return calculateHash('ScalarNotIn', this.left, this.right,);
   }
-  toString() {
-    return `${this.left} NOT IN ${this.right}`;
-  }
   optimize(optimizer,) {
     const leftCost = this.left.optimize(optimizer,);
     const rightCost = this.right.optimize(optimizer,);
@@ -38510,21 +38489,19 @@ var ScalarVariable = class extends ScalarNode {
     super(referencedFields, referencedOuterFields, true,);
     this.field = field;
     this.isOuterField = isOuterField;
-    __publicField(this, 'definition', this.field.definition,);
+    __publicField(this, 'definition',);
+    this.definition = field.definition;
   }
   getHash() {
     return calculateHash('ScalarVariable', this.field.id, this.isOuterField,);
   }
-  toString() {
-    return `"${this.field.name}" /* ${this.field.id} */`;
-  }
   optimize() {
     return new Cost(0,);
   }
   getOptimized() {
     return this;
   }
-  // eslint-disable-next-line require-yield
+  // biome-ignore lint/correctness/useYield: Required by the super class.
   *evaluate(context, tuple,) {
     if (this.isOuterField) {
       assert(context, 'Context must exist',);
@@ -38850,7 +38827,8 @@ var EnforcerResolve = class extends EnforcerNode {
     super(false,);
     this.input = input;
     this.fields = fields;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('EnforcerResolve', this.inputGroup.id, this.fields,);
@@ -38933,7 +38911,8 @@ var EnforcerSort = class extends EnforcerNode {
     super(input.isSynchronous,);
     this.input = input;
     this.ordering = ordering;
-    __publicField(this, 'inputGroup', this.input.getGroup(),);
+    __publicField(this, 'inputGroup',);
+    this.inputGroup = input.getGroup();
   }
   getHash() {
     return calculateHash('EnforcerSort', this.inputGroup.id, this.ordering,);