@spearwolf/shadow-objects 0.32.0 → 0.34.0

package/src/view/ComponentChanges.js

@@ -1,20 +1,24 @@
 import { ChangeTrailPhase, ComponentChangeType, VoidToken } from "../constants.js";
 import { appendToEnd, removeFrom } from "../utils/array-utils.js";
 const ROOT = "#root";
+const PropertyWithoutValue = /* @__PURE__ */ Symbol("shadow-objects/property-without-value");
 class ComponentChanges {
   #uuid;
   get uuid() {
     return this.#uuid;
   }
-  #serial = 0;
   constructor(uuid) {
     this.#uuid = uuid;
   }
   #isNew = true;
   #createCount = 0;
   #destroyCount = 0;
+  /**
+   * Whether this component owes the next change trail anything: a creation, a destruction, or a
+   * pending value in one of the four written ↔ pending pairs.
+   */
   hasChanges() {
-    return this.#serial > 0;
+    return this.#isNew && this.isCreated || this.isDestroyed || this.#nextToken !== void 0 && this.#nextToken !== this.#token || this.#hasPendingParent() || this.#nextOrder !== void 0 && this.#nextOrder !== this.#order || this.#propsChangeOrder.length > 0 || this.#events.length > 0;
   }
   get isNew() {
     return this.#isNew;
@@ -33,7 +37,6 @@ class ComponentChanges {
   #nextParentUuid;
   #nextOrder;
   create(token = VoidToken, parentUuid, order = 0, autoDestructionOnParentRemoval = false) {
-    this.#serial++;
     this.#createCount++;
     this.#nextToken = token;
     this.#nextParentUuid = parentUuid ?? ROOT;
@@ -42,77 +45,161 @@ class ComponentChanges {
   }
   destroy() {
     this.#destroyCount++;
-    this.#serial++;
   }
+  /**
+   * Whether the pending parent asks for something the confirmed one is not already. A pending
+   * value that has come back to the confirmed parent is a change that cancelled itself out.
+   */
+  #hasPendingParent() {
+    if (this.#nextParentUuid === void 0) return false;
+    return (this.#nextParentUuid === ROOT ? void 0 : this.#nextParentUuid) !== this.#parentUuid;
+  }
+  /**
+   * Drop every pending value without writing any of them forward.
+   *
+   * This is the way out for a component whose bookkeeping is about to be replaced wholesale —
+   * `ComponentContext.reCreateChanges` does exactly that. A trail that has gone out is
+   * settled with {@link ComponentChanges.commitChange} instead.
+   */
   clear() {
-    this.#serial = 0;
-    this.#isNew = false;
     this.#nextToken = void 0;
     this.#nextParentUuid = void 0;
     this.#nextOrder = void 0;
     this.#nextProperties.clear();
     this.#propsChangeOrder.length = 0;
+    this.#travellingProperties = void 0;
     this.#events.length = 0;
     this.#transferables.clear();
   }
+  /**
+   * The three scalar pairs below all answer the same question the same way: is anything owed once
+   * the entry that is on its way out has landed?
+   *
+   * The written half alone cannot answer it. It is the last *confirmed* value and stays behind
+   * until the entry is committed, so a value the caller sets back to it while the entry travels
+   * would look like "nothing to do" — and the entry would then be the last word, leaving the
+   * Shadow Environment holding a value the view has already moved on from. So the pending half is
+   * only released where there is nothing in flight to contradict it; where there is, the new value
+   * takes the pending slot and the emitting side decides, against the written half it settles on.
+   */
   changeToken(token) {
-    if (token === this.#token) {
-      this.#nextToken = void 0;
-    } else {
-      this.#nextToken = token;
-      this.#serial++;
-    }
+    token ??= VoidToken;
+    if (token === this.#token && this.#nextToken === void 0 && !this.#isNew) return;
+    this.#nextToken = token;
   }
   setParent(parentUuid) {
-    if (parentUuid === this.#parentUuid) {
-      this.#nextParentUuid = void 0;
-    } else {
-      this.#nextParentUuid = parentUuid ?? ROOT;
-      this.#serial++;
-    }
+    const nextParentUuid = parentUuid ?? ROOT;
+    if (nextParentUuid === (this.#parentUuid ?? ROOT) && this.#nextParentUuid === void 0) return;
+    this.#nextParentUuid = nextParentUuid;
   }
   changeOrder(order) {
-    if (order === this.#order) {
-      this.#nextOrder = void 0;
-    } else {
-      this.#nextOrder = order;
-      this.#serial++;
-    }
+    if (order === this.#order && this.#nextOrder === void 0) return;
+    this.#nextOrder = order;
   }
   #properties = /* @__PURE__ */ new Map();
   #nextProperties = /* @__PURE__ */ new Map();
+  /**
+   * The keys with a queued change, in the order their changes happened — the order an entry
+   * carries them in, and the reason this is a list and not a set.
+   *
+   * A set beside it would answer membership in one step, and per call it does win from about eight
+   * keys on: 8.0 ns for the set against 10.7 ns for the list at eight keys, 10.4 ns against 43.9 ns
+   * at 64. The distance is what decides against it. At the upper stop this repository can produce —
+   * 64 keys, every one of them changed in every frame at 60 fps, so 3840 calls per second — that is
+   * 0.13 ms saved per second of animation. And membership is the smaller half: `removeFrom()` and
+   * `appendToEnd()` are an `indexOf` plus a `splice`, and the splice stays linear no matter what
+   * answers the membership. Numbers measured 2026-08-31 on node v25.9.0.
+   */
   #propsChangeOrder = [];
-  // we use an Array here and not a Set, because we want to keep the change order
+  /**
+   * The keys an entry on its way out carries, until that entry is settled. For those keys the
+   * written half is behind, and {@link ComponentChanges.changeProperty} must not cancel against it.
+   */
+  #travellingProperties;
+  /**
+   * @returns `true` if the value differs from the last value this component asked for
+   */
   changeProperty(key, value, isEqual) {
-    const prevValue = this.#properties.get(key);
-    const valueChanged = isEqual == null && value !== prevValue || isEqual != null && !isEqual(value, prevValue);
-    if (valueChanged) {
-      this.#nextProperties.set(key, value);
-      appendToEnd(this.#propsChangeOrder, key);
-      this.#serial++;
+    const equals = (a, b) => (
+      // a registered rule compares values, and the marker is not one -- handed to it, a rule
+      // would be asked about a property it never saw, and one that reaches into its arguments
+      // throws on a symbol. Where either side is the marker the only question left is whether
+      // it is still the same third form, and identity answers that.
+      a === PropertyWithoutValue || b === PropertyWithoutValue ? a === b : isEqual == null ? a === b : isEqual(a, b)
+    );
+    const isQueued = this.#propsChangeOrder.includes(key);
+    const isTravelling = this.#travellingProperties?.has(key) ?? false;
+    let prevValue;
+    if (isQueued) {
+      prevValue = this.#nextProperties.get(key);
+    } else if (isTravelling) {
+      prevValue = this.#travellingProperties.get(key);
     } else {
+      prevValue = this.#properties.get(key);
+    }
+    const valueChanged = !equals(value, prevValue);
+    const nothingToSend = !isTravelling && (isQueued ? equals(value, this.#properties.get(key)) : !valueChanged);
+    if (nothingToSend) {
       this.#nextProperties.delete(key);
       removeFrom(this.#propsChangeOrder, key);
+    } else {
+      this.#nextProperties.set(key, value);
+      appendToEnd(this.#propsChangeOrder, key);
     }
+    return valueChanged;
+  }
+  /**
+   * Mark `key` as set without giving it a value: the next trail carries an entry that names
+   * only the key. A later {@link ComponentChanges.changeProperty} replaces it with a value,
+   * and {@link ComponentChanges.removeProperty} takes it away like any other property.
+   *
+   * @returns `true` if this differs from the last value this component asked for
+   */
+  setPropertyWithoutValue(key) {
+    return this.changeProperty(key, PropertyWithoutValue);
   }
   removeProperty(key) {
-    const propExists = this.#properties.has(key);
-    if (this.#nextProperties.has(key)) {
-      this.#nextProperties.delete(key);
-      if (!propExists) {
-        removeFrom(this.#propsChangeOrder, key);
-      }
-    } else if (propExists) {
+    const isQueued = this.#propsChangeOrder.includes(key);
+    this.#nextProperties.delete(key);
+    if (!this.#properties.has(key) && !this.#travellingProperties?.has(key)) {
+      removeFrom(this.#propsChangeOrder, key);
+      return;
+    }
+    if (!isQueued) {
       appendToEnd(this.#propsChangeOrder, key);
-      this.#serial++;
     }
   }
+  /**
+   * The properties this component holds at this moment: the ones a change trail has already
+   * carried, overlaid with everything that has accrued since.
+   *
+   * The overlay is what makes the result the current state instead of the state of the last
+   * trail — `#properties` is only written forward while a trail is being built
+   * ({@link ComponentChanges.makeCreateEntityChange},
+   * {@link ComponentChanges.makeChangePropertyChange}). A key whose accrued value is `undefined`
+   * and a key queued for change without an accrued value are both removals, and neither appears
+   * in the result. A key that is set without a value stands in the result with
+   * {@link PropertyWithoutValue}.
+   */
+  getProperties() {
+    const properties = new Map(this.#properties);
+    for (const key of this.#propsChangeOrder) {
+      const value = this.#nextProperties.get(key);
+      if (value === void 0) {
+        properties.delete(key);
+      } else {
+        properties.set(key, value);
+      }
+    }
+    return properties;
+  }
   #events = [];
   #transferables = /* @__PURE__ */ new Set();
   createEvent(type, data, transferables) {
     this.#events.push({ type, data });
-    transferables?.forEach((transferable) => this.#transferables.add(transferable));
-    this.#serial++;
+    for (const transferable of transferables ?? []) {
+      this.#transferables.add(transferable);
+    }
   }
   transferEventsTo(changes) {
     if (this.#events.length > 0) {
@@ -132,7 +219,7 @@ class ComponentChanges {
         if (isNew) {
           trail.push(this.makeCreateEntityChange());
         } else if (!isDestroyed) {
-          if (this.#nextParentUuid !== void 0 && !(this.#nextParentUuid === ROOT && this.#parentUuid === void 0)) {
+          if (this.#hasPendingParent()) {
             trail.push(this.makeSetParentChange());
           } else if (this.#nextOrder !== void 0 && this.#nextOrder !== this.#order) {
             trail.push(this.makeUpdateOrderChange());
@@ -169,25 +256,31 @@ class ComponentChanges {
     return event;
   }
   makeCreateEntityChange() {
+    const token = this.#nextToken ?? this.#token;
     const entry = {
       type: ComponentChangeType.CreateEntities,
       uuid: this.#uuid,
-      token: this.#nextToken
+      token
     };
-    this.#token = this.#nextToken;
-    if (this.#nextParentUuid !== void 0) {
-      const nextParentUuid = this.#nextParentUuid === ROOT ? void 0 : this.#nextParentUuid;
-      this.#parentUuid = nextParentUuid;
-      if (nextParentUuid !== void 0) {
-        entry.parentUuid = nextParentUuid;
-      }
+    if (this.#nextParentUuid !== void 0 && this.#nextParentUuid !== ROOT) {
+      entry.parentUuid = this.#nextParentUuid;
     }
     if (this.#nextProperties.size > 0) {
-      entry.properties = Array.from(this.#nextProperties.entries()).filter(([, value]) => value !== void 0);
-      entry.properties.forEach(([key, value]) => this.#properties.set(key, value));
+      const properties = [];
+      for (const [key, value] of this.#nextProperties) {
+        if (value === PropertyWithoutValue) {
+          properties.push([key]);
+        } else if (value !== void 0) {
+          properties.push([key, value]);
+        }
+      }
+      this.#noteTravellingProperties(properties);
+      if (properties.length > 0) {
+        entry.properties = properties;
+      }
     }
     if (this.#nextOrder !== void 0 && this.#nextOrder !== this.#order) {
-      entry.order = this.#order = this.#nextOrder;
+      entry.order = this.#nextOrder;
     }
     if (this.#autoDestructionOnParentRemoval) {
       entry.autoDestructionOnParentRemoval = true;
@@ -201,52 +294,143 @@ class ComponentChanges {
     };
   }
   makeSetParentChange() {
-    this.#parentUuid = this.#nextParentUuid === ROOT ? void 0 : this.#nextParentUuid;
     const entry = {
       type: ComponentChangeType.SetParent,
       uuid: this.#uuid,
-      parentUuid: this.#parentUuid
+      parentUuid: this.#nextParentUuid === ROOT ? void 0 : this.#nextParentUuid
     };
     if (this.#nextOrder !== void 0 && this.#nextOrder !== this.#order) {
-      entry.order = this.#order = this.#nextOrder;
+      entry.order = this.#nextOrder;
     }
     return entry;
   }
   makeUpdateOrderChange() {
-    this.#order = this.#nextOrder ?? 0;
     return {
       type: ComponentChangeType.UpdateOrder,
       uuid: this.#uuid,
-      order: this.#order
+      order: this.#nextOrder ?? 0
     };
   }
   makeChangeToken() {
-    this.#token = this.#nextToken ?? VoidToken;
     return {
       type: ComponentChangeType.ChangeToken,
       uuid: this.#uuid,
-      token: this.#token
+      token: this.#nextToken ?? VoidToken
     };
   }
   makeChangePropertyChange() {
     const properties = this.#propsChangeOrder.map((key) => {
-      if (this.#nextProperties.has(key)) {
-        const nextValue = this.#nextProperties.get(key);
-        this.#properties.set(key, nextValue);
-        return [key, nextValue];
-      } else {
-        this.#properties.delete(key);
-        return [key, void 0];
-      }
+      const value = this.#nextProperties.get(key);
+      return value === PropertyWithoutValue ? [key] : [key, value];
     });
+    this.#noteTravellingProperties(properties);
     return {
       type: ComponentChangeType.ChangeProperties,
       uuid: this.#uuid,
       properties
     };
   }
+  /**
+   * Records the keys of an entry that is going out, so a later change knows the written half
+   * is behind.
+   */
+  #noteTravellingProperties(properties) {
+    this.#travellingProperties = new Map(
+      properties.map((entry) => [entry[0], entry.length === 1 ? PropertyWithoutValue : entry[1]])
+    );
+  }
+  /**
+   * Fold one trail entry into the written half of this component's bookkeeping: the values the
+   * entry carries become the values the next diff is taken against, and the pending half that
+   * produced them is released. Called once per entry the Shadow Environment has applied.
+   *
+   * A pending value is released only while it is still the value the entry carried. Between the
+   * build of a trail and its confirmation lies a round trip, and whatever changed in that window
+   * is owed to the Shadow Environment — releasing it here would leave the two sides holding
+   * different values with nothing left to correct them.
+   */
+  commitChange(entry) {
+    switch (entry.type) {
+      case ComponentChangeType.CreateEntities:
+        this.#commitToken(entry.token);
+        this.#commitParentUuid(entry.parentUuid);
+        this.#commitOrder(entry.order ?? this.#order);
+        this.#commitProperties(entry.properties);
+        for (const key of this.#propsChangeOrder.slice(0)) {
+          if (this.#nextProperties.get(key) === void 0 && !this.#properties.has(key)) {
+            this.#nextProperties.delete(key);
+            removeFrom(this.#propsChangeOrder, key);
+          }
+        }
+        this.#travellingProperties = void 0;
+        this.#isNew = false;
+        break;
+      case ComponentChangeType.SetParent:
+        this.#commitParentUuid(entry.parentUuid);
+        this.#commitOrder(entry.order ?? this.#order);
+        break;
+      case ComponentChangeType.UpdateOrder:
+        this.#commitOrder(entry.order);
+        break;
+      case ComponentChangeType.ChangeToken:
+        this.#commitToken(entry.token);
+        break;
+      case ComponentChangeType.ChangeProperties:
+        this.#commitProperties(entry.properties);
+        this.#travellingProperties = void 0;
+        break;
+      case ComponentChangeType.SendEvents:
+        this.#events.splice(0, entry.events.length);
+        for (const transferable of entry.transferables ?? []) {
+          this.#transferables.delete(transferable);
+        }
+        break;
+      case ComponentChangeType.DestroyEntities:
+        this.#token = VoidToken;
+        this.#parentUuid = void 0;
+        this.#order = 0;
+        this.#properties.clear();
+        this.#travellingProperties = void 0;
+        this.#isNew = true;
+        break;
+    }
+  }
+  #commitToken(token) {
+    this.#token = token;
+    if (this.#nextToken === token) {
+      this.#nextToken = void 0;
+    }
+  }
+  #commitParentUuid(parentUuid) {
+    this.#parentUuid = parentUuid;
+    if ((this.#nextParentUuid === ROOT ? void 0 : this.#nextParentUuid) === parentUuid) {
+      this.#nextParentUuid = void 0;
+    }
+  }
+  #commitOrder(order) {
+    this.#order = order;
+    if (this.#nextOrder === order) {
+      this.#nextOrder = void 0;
+    }
+  }
+  #commitProperties(properties) {
+    for (const entry of properties ?? []) {
+      const key = entry[0];
+      const value = entry.length === 1 ? PropertyWithoutValue : entry[1];
+      if (value === void 0) {
+        this.#properties.delete(key);
+      } else {
+        this.#properties.set(key, value);
+      }
+      if (this.#nextProperties.get(key) === value) {
+        this.#nextProperties.delete(key);
+        removeFrom(this.#propsChangeOrder, key);
+      }
+    }
+  }
 }
 export {
-  ComponentChanges
+  ComponentChanges,
+  PropertyWithoutValue
 };
 //# sourceMappingURL=ComponentChanges.js.map

package/src/view/ComponentChanges.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/view/ComponentChanges.ts"],
-  "sourcesContent": ["import {ChangeTrailPhase, ComponentChangeType, VoidToken} from '../constants.js';\nimport type {\n  IChangeToken,\n  IComponentChangeType,\n  IComponentEvent,\n  ICreateEntitiesChange,\n  IDestroyEntitiesChange,\n  IPropertiesChange,\n  ISendEvents,\n  ISetParentChange,\n  IUpdateOrderChange,\n} from '../types.js';\nimport {appendToEnd, removeFrom} from '../utils/array-utils.js';\n\nconst ROOT = '#root';\n\nexport class ComponentChanges {\n  readonly #uuid: string;\n\n  get uuid(): string {\n    return this.#uuid;\n  }\n\n  #serial = 0;\n\n  constructor(uuid: string) {\n    this.#uuid = uuid;\n  }\n\n  #isNew = true;\n  #createCount = 0;\n  #destroyCount = 0;\n\n  hasChanges(): boolean {\n    return this.#serial > 0;\n  }\n\n  get isNew(): boolean {\n    return this.#isNew;\n  }\n\n  get isCreated(): boolean {\n    return this.#createCount > 0 && this.#createCount > this.#destroyCount;\n  }\n\n  get isDestroyed(): boolean {\n    return this.#destroyCount > 0 && this.#destroyCount >= this.#createCount;\n  }\n\n  #token: string = VoidToken;\n  #parentUuid?: string;\n  #order: number = 0;\n  #autoDestructionOnParentRemoval = false;\n\n  #nextToken?: string;\n  #nextParentUuid?: string;\n  #nextOrder?: number;\n\n  create(token: string = VoidToken, parentUuid?: string, order: number = 0, autoDestructionOnParentRemoval = false) {\n    this.#serial++;\n    this.#createCount++;\n\n    this.#nextToken = token;\n    this.#nextParentUuid = parentUuid ?? ROOT;\n    this.#nextOrder = !order ? undefined : order;\n    this.#autoDestructionOnParentRemoval = autoDestructionOnParentRemoval;\n  }\n\n  destroy() {\n    this.#destroyCount++;\n    this.#serial++;\n  }\n\n  clear() {\n    this.#serial = 0;\n\n    this.#isNew = false;\n\n    this.#nextToken = undefined;\n    this.#nextParentUuid = undefined;\n    this.#nextOrder = undefined;\n\n    this.#nextProperties.clear();\n    this.#propsChangeOrder.length = 0;\n\n    this.#events.length = 0;\n    this.#transferables.clear();\n  }\n\n  changeToken(token: string | undefined) {\n    if (token === this.#token) {\n      this.#nextToken = undefined;\n    } else {\n      this.#nextToken = token;\n      this.#serial++;\n    }\n  }\n\n  setParent(parentUuid?: string) {\n    if (parentUuid === this.#parentUuid) {\n      this.#nextParentUuid = undefined;\n    } else {\n      this.#nextParentUuid = parentUuid ?? ROOT;\n      this.#serial++;\n    }\n  }\n\n  changeOrder(order: number) {\n    if (order === this.#order) {\n      this.#nextOrder = undefined;\n    } else {\n      this.#nextOrder = order;\n      this.#serial++;\n    }\n  }\n\n  #properties: Map<string, unknown> = new Map();\n  #nextProperties: Map<string, unknown> = new Map();\n  #propsChangeOrder: string[] = []; // we use an Array here and not a Set, because we want to keep the change order\n\n  changeProperty<T = unknown>(key: string, value: T, isEqual?: (a: T, b: T) => boolean) {\n    const prevValue = this.#properties.get(key) as T;\n    const valueChanged = (isEqual == null && value !== prevValue) || (isEqual != null && !isEqual(value, prevValue));\n\n    if (valueChanged) {\n      this.#nextProperties.set(key, value);\n      appendToEnd(this.#propsChangeOrder, key);\n      this.#serial++;\n    } else {\n      this.#nextProperties.delete(key);\n      removeFrom(this.#propsChangeOrder, key);\n    }\n  }\n\n  removeProperty(key: string) {\n    const propExists = this.#properties.has(key);\n    if (this.#nextProperties.has(key)) {\n      this.#nextProperties.delete(key);\n      if (!propExists) {\n        removeFrom(this.#propsChangeOrder, key);\n      }\n    } else if (propExists) {\n      appendToEnd(this.#propsChangeOrder, key);\n      this.#serial++;\n    }\n  }\n\n  #events: IComponentEvent[] = [];\n  #transferables = new Set<Transferable>();\n\n  createEvent(type: string, data: unknown, transferables?: Transferable[]) {\n    this.#events.push({type, data});\n    transferables?.forEach((transferable) => this.#transferables.add(transferable));\n    this.#serial++;\n  }\n\n  transferEventsTo(changes: ComponentChanges) {\n    if (this.#events.length > 0) {\n      changes.#events.push(...this.#events);\n      this.#events.length = 0;\n    }\n    if (this.#transferables.size > 0) {\n      changes.#transferables = new Set([...changes.#transferables, ...this.#transferables]);\n      this.#transferables.clear();\n    }\n  }\n\n  buildChangeTrail(trail: IComponentChangeType[], trailPhase: ChangeTrailPhase) {\n    const {isNew, isCreated, isDestroyed} = this;\n\n    if (isNew && isDestroyed) return;\n\n    switch (trailPhase) {\n      case ChangeTrailPhase.StructuralChanges:\n        if (isNew) {\n          trail.push(this.makeCreateEntityChange());\n        } else if (!isDestroyed) {\n          if (this.#nextParentUuid !== undefined && !(this.#nextParentUuid === ROOT && this.#parentUuid === undefined)) {\n            trail.push(this.makeSetParentChange());\n          } else if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n            trail.push(this.makeUpdateOrderChange());\n          }\n          if (this.#nextToken !== undefined && this.#nextToken !== this.#token) {\n            trail.push(this.makeChangeToken());\n          }\n        }\n        break;\n\n      case ChangeTrailPhase.ContentUpdates:\n        if (!isNew && isCreated && this.#propsChangeOrder.length > 0) {\n          trail.push(this.makeChangePropertyChange());\n        }\n        if (this.#events.length > 0) {\n          trail.push(this.makeEvents());\n        }\n        break;\n\n      case ChangeTrailPhase.Removal:\n        if (isDestroyed) {\n          trail.push(this.makeDestroyEntityChange());\n        }\n        break;\n    }\n  }\n\n  makeEvents(): ISendEvents {\n    const event: ISendEvents = {\n      type: ComponentChangeType.SendEvents,\n      uuid: this.#uuid,\n      events: this.#events.slice(0),\n    };\n    if (this.#transferables.size > 0) {\n      event.transferables = Array.from(this.#transferables);\n    }\n    return event;\n  }\n\n  makeCreateEntityChange(): ICreateEntitiesChange {\n    const entry: ICreateEntitiesChange = {\n      type: ComponentChangeType.CreateEntities,\n      uuid: this.#uuid,\n      token: this.#nextToken,\n    };\n\n    this.#token = this.#nextToken;\n\n    if (this.#nextParentUuid !== undefined) {\n      const nextParentUuid = this.#nextParentUuid === ROOT ? undefined : this.#nextParentUuid;\n      this.#parentUuid = nextParentUuid;\n      if (nextParentUuid !== undefined) {\n        entry.parentUuid = nextParentUuid;\n      }\n    }\n\n    if (this.#nextProperties.size > 0) {\n      entry.properties = Array.from(this.#nextProperties.entries()).filter(([, value]) => value !== undefined);\n      entry.properties.forEach(([key, value]) => this.#properties.set(key, value));\n    }\n\n    if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n      entry.order = this.#order = this.#nextOrder;\n    }\n\n    if (this.#autoDestructionOnParentRemoval) {\n      entry.autoDestructionOnParentRemoval = true;\n    }\n\n    return entry;\n  }\n\n  makeDestroyEntityChange(): IDestroyEntitiesChange {\n    return {\n      type: ComponentChangeType.DestroyEntities,\n      uuid: this.#uuid,\n    };\n  }\n\n  makeSetParentChange(): ISetParentChange {\n    this.#parentUuid = this.#nextParentUuid === ROOT ? undefined : this.#nextParentUuid;\n\n    const entry: ISetParentChange = {\n      type: ComponentChangeType.SetParent,\n      uuid: this.#uuid,\n      parentUuid: this.#parentUuid,\n    };\n\n    if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n      entry.order = this.#order = this.#nextOrder;\n    }\n\n    return entry;\n  }\n\n  makeUpdateOrderChange(): IUpdateOrderChange {\n    this.#order = this.#nextOrder ?? 0;\n\n    return {\n      type: ComponentChangeType.UpdateOrder,\n      uuid: this.#uuid,\n      order: this.#order,\n    };\n  }\n\n  makeChangeToken(): IChangeToken {\n    this.#token = this.#nextToken ?? VoidToken;\n\n    return {\n      type: ComponentChangeType.ChangeToken,\n      uuid: this.#uuid,\n      token: this.#token,\n    };\n  }\n\n  makeChangePropertyChange(): IPropertiesChange {\n    const properties = this.#propsChangeOrder.map((key) => {\n      if (this.#nextProperties.has(key)) {\n        // set prop\n        const nextValue = this.#nextProperties.get(key);\n        this.#properties.set(key, nextValue);\n        return [key, nextValue] as [string, unknown];\n      } else {\n        // remove prop\n        this.#properties.delete(key);\n        return [key, undefined] as [string, unknown];\n      }\n    });\n\n    return {\n      type: ComponentChangeType.ChangeProperties,\n      uuid: this.#uuid,\n      properties,\n    };\n  }\n}"],
-  "mappings": "AAAA,SAAQ,kBAAkB,qBAAqB,iBAAgB;AAY/D,SAAQ,aAAa,kBAAiB;AAEtC,MAAM,OAAO;AAEN,MAAM,iBAAiB;AAAA,EACnB;AAAA,EAET,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,UAAU;AAAA,EAEV,YAAY,MAAc;AACxB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,SAAS;AAAA,EACT,eAAe;AAAA,EACf,gBAAgB;AAAA,EAEhB,aAAsB;AACpB,WAAO,KAAK,UAAU;AAAA,EACxB;AAAA,EAEA,IAAI,QAAiB;AACnB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,YAAqB;AACvB,WAAO,KAAK,eAAe,KAAK,KAAK,eAAe,KAAK;AAAA,EAC3D;AAAA,EAEA,IAAI,cAAuB;AACzB,WAAO,KAAK,gBAAgB,KAAK,KAAK,iBAAiB,KAAK;AAAA,EAC9D;AAAA,EAEA,SAAiB;AAAA,EACjB;AAAA,EACA,SAAiB;AAAA,EACjB,kCAAkC;AAAA,EAElC;AAAA,EACA;AAAA,EACA;AAAA,EAEA,OAAO,QAAgB,WAAW,YAAqB,QAAgB,GAAG,iCAAiC,OAAO;AAChH,SAAK;AACL,SAAK;AAEL,SAAK,aAAa;AAClB,SAAK,kBAAkB,cAAc;AACrC,SAAK,aAAa,CAAC,QAAQ,SAAY;AACvC,SAAK,kCAAkC;AAAA,EACzC;AAAA,EAEA,UAAU;AACR,SAAK;AACL,SAAK;AAAA,EACP;AAAA,EAEA,QAAQ;AACN,SAAK,UAAU;AAEf,SAAK,SAAS;AAEd,SAAK,aAAa;AAClB,SAAK,kBAAkB;AACvB,SAAK,aAAa;AAElB,SAAK,gBAAgB,MAAM;AAC3B,SAAK,kBAAkB,SAAS;AAEhC,SAAK,QAAQ,SAAS;AACtB,SAAK,eAAe,MAAM;AAAA,EAC5B;AAAA,EAEA,YAAY,OAA2B;AACrC,QAAI,UAAU,KAAK,QAAQ;AACzB,WAAK,aAAa;AAAA,IACpB,OAAO;AACL,WAAK,aAAa;AAClB,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,UAAU,YAAqB;AAC7B,QAAI,eAAe,KAAK,aAAa;AACnC,WAAK,kBAAkB;AAAA,IACzB,OAAO;AACL,WAAK,kBAAkB,cAAc;AACrC,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,YAAY,OAAe;AACzB,QAAI,UAAU,KAAK,QAAQ;AACzB,WAAK,aAAa;AAAA,IACpB,OAAO;AACL,WAAK,aAAa;AAClB,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,cAAoC,oBAAI,IAAI;AAAA,EAC5C,kBAAwC,oBAAI,IAAI;AAAA,EAChD,oBAA8B,CAAC;AAAA;AAAA,EAE/B,eAA4B,KAAa,OAAU,SAAmC;AACpF,UAAM,YAAY,KAAK,YAAY,IAAI,GAAG;AAC1C,UAAM,eAAgB,WAAW,QAAQ,UAAU,aAAe,WAAW,QAAQ,CAAC,QAAQ,OAAO,SAAS;AAE9G,QAAI,cAAc;AAChB,WAAK,gBAAgB,IAAI,KAAK,KAAK;AACnC,kBAAY,KAAK,mBAAmB,GAAG;AACvC,WAAK;AAAA,IACP,OAAO;AACL,WAAK,gBAAgB,OAAO,GAAG;AAC/B,iBAAW,KAAK,mBAAmB,GAAG;AAAA,IACxC;AAAA,EACF;AAAA,EAEA,eAAe,KAAa;AAC1B,UAAM,aAAa,KAAK,YAAY,IAAI,GAAG;AAC3C,QAAI,KAAK,gBAAgB,IAAI,GAAG,GAAG;AACjC,WAAK,gBAAgB,OAAO,GAAG;AAC/B,UAAI,CAAC,YAAY;AACf,mBAAW,KAAK,mBAAmB,GAAG;AAAA,MACxC;AAAA,IACF,WAAW,YAAY;AACrB,kBAAY,KAAK,mBAAmB,GAAG;AACvC,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,UAA6B,CAAC;AAAA,EAC9B,iBAAiB,oBAAI,IAAkB;AAAA,EAEvC,YAAY,MAAc,MAAe,eAAgC;AACvE,SAAK,QAAQ,KAAK,EAAC,MAAM,KAAI,CAAC;AAC9B,mBAAe,QAAQ,CAAC,iBAAiB,KAAK,eAAe,IAAI,YAAY,CAAC;AAC9E,SAAK;AAAA,EACP;AAAA,EAEA,iBAAiB,SAA2B;AAC1C,QAAI,KAAK,QAAQ,SAAS,GAAG;AAC3B,cAAQ,QAAQ,KAAK,GAAG,KAAK,OAAO;AACpC,WAAK,QAAQ,SAAS;AAAA,IACxB;AACA,QAAI,KAAK,eAAe,OAAO,GAAG;AAChC,cAAQ,iBAAiB,oBAAI,IAAI,CAAC,GAAG,QAAQ,gBAAgB,GAAG,KAAK,cAAc,CAAC;AACpF,WAAK,eAAe,MAAM;AAAA,IAC5B;AAAA,EACF;AAAA,EAEA,iBAAiB,OAA+B,YAA8B;AAC5E,UAAM,EAAC,OAAO,WAAW,YAAW,IAAI;AAExC,QAAI,SAAS,YAAa;AAE1B,YAAQ,YAAY;AAAA,MAClB,KAAK,iBAAiB;AACpB,YAAI,OAAO;AACT,gBAAM,KAAK,KAAK,uBAAuB,CAAC;AAAA,QAC1C,WAAW,CAAC,aAAa;AACvB,cAAI,KAAK,oBAAoB,UAAa,EAAE,KAAK,oBAAoB,QAAQ,KAAK,gBAAgB,SAAY;AAC5G,kBAAM,KAAK,KAAK,oBAAoB,CAAC;AAAA,UACvC,WAAW,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AAC3E,kBAAM,KAAK,KAAK,sBAAsB,CAAC;AAAA,UACzC;AACA,cAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,kBAAM,KAAK,KAAK,gBAAgB,CAAC;AAAA,UACnC;AAAA,QACF;AACA;AAAA,MAEF,KAAK,iBAAiB;AACpB,YAAI,CAAC,SAAS,aAAa,KAAK,kBAAkB,SAAS,GAAG;AAC5D,gBAAM,KAAK,KAAK,yBAAyB,CAAC;AAAA,QAC5C;AACA,YAAI,KAAK,QAAQ,SAAS,GAAG;AAC3B,gBAAM,KAAK,KAAK,WAAW,CAAC;AAAA,QAC9B;AACA;AAAA,MAEF,KAAK,iBAAiB;AACpB,YAAI,aAAa;AACf,gBAAM,KAAK,KAAK,wBAAwB,CAAC;AAAA,QAC3C;AACA;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,aAA0B;AACxB,UAAM,QAAqB;AAAA,MACzB,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK,QAAQ,MAAM,CAAC;AAAA,IAC9B;AACA,QAAI,KAAK,eAAe,OAAO,GAAG;AAChC,YAAM,gBAAgB,MAAM,KAAK,KAAK,cAAc;AAAA,IACtD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,yBAAgD;AAC9C,UAAM,QAA+B;AAAA,MACnC,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,IACd;AAEA,SAAK,SAAS,KAAK;AAEnB,QAAI,KAAK,oBAAoB,QAAW;AACtC,YAAM,iBAAiB,KAAK,oBAAoB,OAAO,SAAY,KAAK;AACxE,WAAK,cAAc;AACnB,UAAI,mBAAmB,QAAW;AAChC,cAAM,aAAa;AAAA,MACrB;AAAA,IACF;AAEA,QAAI,KAAK,gBAAgB,OAAO,GAAG;AACjC,YAAM,aAAa,MAAM,KAAK,KAAK,gBAAgB,QAAQ,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,UAAU,MAAS;AACvG,YAAM,WAAW,QAAQ,CAAC,CAAC,KAAK,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK,KAAK,CAAC;AAAA,IAC7E;AAEA,QAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,YAAM,QAAQ,KAAK,SAAS,KAAK;AAAA,IACnC;AAEA,QAAI,KAAK,iCAAiC;AACxC,YAAM,iCAAiC;AAAA,IACzC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,0BAAkD;AAChD,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,IACb;AAAA,EACF;AAAA,EAEA,sBAAwC;AACtC,SAAK,cAAc,KAAK,oBAAoB,OAAO,SAAY,KAAK;AAEpE,UAAM,QAA0B;AAAA,MAC9B,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,YAAY,KAAK;AAAA,IACnB;AAEA,QAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,YAAM,QAAQ,KAAK,SAAS,KAAK;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,wBAA4C;AAC1C,SAAK,SAAS,KAAK,cAAc;AAEjC,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,IACd;AAAA,EACF;AAAA,EAEA,kBAAgC;AAC9B,SAAK,SAAS,KAAK,cAAc;AAEjC,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,IACd;AAAA,EACF;AAAA,EAEA,2BAA8C;AAC5C,UAAM,aAAa,KAAK,kBAAkB,IAAI,CAAC,QAAQ;AACrD,UAAI,KAAK,gBAAgB,IAAI,GAAG,GAAG;AAEjC,cAAM,YAAY,KAAK,gBAAgB,IAAI,GAAG;AAC9C,aAAK,YAAY,IAAI,KAAK,SAAS;AACnC,eAAO,CAAC,KAAK,SAAS;AAAA,MACxB,OAAO;AAEL,aAAK,YAAY,OAAO,GAAG;AAC3B,eAAO,CAAC,KAAK,MAAS;AAAA,MACxB;AAAA,IACF,CAAC;AAED,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;",
+  "sourcesContent": ["import {ChangeTrailPhase, ComponentChangeType, VoidToken} from '../constants.js';\nimport type {\n  ComponentPropertiesType,\n  IChangeToken,\n  IComponentChangeType,\n  IComponentEvent,\n  ICreateEntitiesChange,\n  IDestroyEntitiesChange,\n  IPropertiesChange,\n  ISendEvents,\n  ISetParentChange,\n  IUpdateOrderChange,\n} from '../types.js';\nimport {appendToEnd, removeFrom} from '../utils/array-utils.js';\n\nconst ROOT = '#root';\n\n/**\n * The value a property carries in this bookkeeping when it is set without one \u2014 the third form\n * of {@link ComponentPropertiesType}, which travels as a one-element `[key]`. `undefined`\n * cannot say it: that is what a removal reads as, and the two have to stay apart all the way\n * to the entry.\n *\n * It never leaves the View Layer. A change trail runs through `structuredClone()` on its way\n * to a worker, and a symbol on that wire is a `DataCloneError` \u2014 so every method that builds\n * an entry turns it back into the one-element form, and the one reader outside this class,\n * `ComponentContext.transferPropertiesTo()`, tests for it before it hands a value on.\n */\nexport const PropertyWithoutValue = Symbol('shadow-objects/property-without-value');\n\n/**\n * Tracks one component's outstanding changes between two change trails as four written \u2194\n * pending pairs: `#token`/`#nextToken`, `#parentUuid`/`#nextParentUuid`, `#order`/`#nextOrder`\n * and `#properties`/`#nextProperties`. The `make*` methods read the pending half and leave it\n * where it is: a trail entry is a request, and until the Shadow Environment has applied it the\n * change is still owed. {@link ComponentChanges.commitChange} is what moves the line \u2014 it folds\n * one applied entry into the written half and releases exactly the pending values that entry\n * carried, so a value that changed again while the entry was on its way goes out with the next\n * trail instead of being lost.\n *\n * Whether anything is outstanding follows from those pairs rather than from a counter, which is\n * what lets a partly applied trail leave the rest of the component untouched.\n *\n * The create/destroy counts behind {@link ComponentChanges.isCreated} and {@link\n * ComponentChanges.isDestroyed} belong to the uuid, not to a `ViewComponent` instance. They\n * carry the rule `ComponentContext.addComponent` keeps: a uuid names one component of a\n * `ComponentContext` at a time, so a later component takes this bookkeeping over only once\n * its predecessor has counted its own `destroy()`. A count pair that outlives its component\n * therefore describes an entity, and the successor on that uuid continues the same entity\n * rather than starting a second.\n */\nexport class ComponentChanges {\n  readonly #uuid: string;\n\n  get uuid(): string {\n    return this.#uuid;\n  }\n\n  constructor(uuid: string) {\n    this.#uuid = uuid;\n  }\n\n  #isNew = true;\n  #createCount = 0;\n  #destroyCount = 0;\n\n  /**\n   * Whether this component owes the next change trail anything: a creation, a destruction, or a\n   * pending value in one of the four written \u2194 pending pairs.\n   */\n  hasChanges(): boolean {\n    return (\n      (this.#isNew && this.isCreated) ||\n      this.isDestroyed ||\n      (this.#nextToken !== undefined && this.#nextToken !== this.#token) ||\n      this.#hasPendingParent() ||\n      (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) ||\n      this.#propsChangeOrder.length > 0 ||\n      this.#events.length > 0\n    );\n  }\n\n  get isNew(): boolean {\n    return this.#isNew;\n  }\n\n  get isCreated(): boolean {\n    return this.#createCount > 0 && this.#createCount > this.#destroyCount;\n  }\n\n  get isDestroyed(): boolean {\n    return this.#destroyCount > 0 && this.#destroyCount >= this.#createCount;\n  }\n\n  #token: string = VoidToken;\n  #parentUuid?: string | undefined;\n  #order: number = 0;\n  #autoDestructionOnParentRemoval = false;\n\n  #nextToken?: string | undefined;\n  #nextParentUuid?: string | undefined;\n  #nextOrder?: number | undefined;\n\n  create(token: string = VoidToken, parentUuid?: string, order: number = 0, autoDestructionOnParentRemoval = false) {\n    this.#createCount++;\n\n    this.#nextToken = token;\n    this.#nextParentUuid = parentUuid ?? ROOT;\n    this.#nextOrder = !order ? undefined : order;\n    this.#autoDestructionOnParentRemoval = autoDestructionOnParentRemoval;\n  }\n\n  destroy() {\n    this.#destroyCount++;\n  }\n\n  /**\n   * Whether the pending parent asks for something the confirmed one is not already. A pending\n   * value that has come back to the confirmed parent is a change that cancelled itself out.\n   */\n  #hasPendingParent(): boolean {\n    if (this.#nextParentUuid === undefined) return false;\n    return (this.#nextParentUuid === ROOT ? undefined : this.#nextParentUuid) !== this.#parentUuid;\n  }\n\n  /**\n   * Drop every pending value without writing any of them forward.\n   *\n   * This is the way out for a component whose bookkeeping is about to be replaced wholesale \u2014\n   * `ComponentContext.reCreateChanges` does exactly that. A trail that has gone out is\n   * settled with {@link ComponentChanges.commitChange} instead.\n   */\n  clear() {\n    this.#nextToken = undefined;\n    this.#nextParentUuid = undefined;\n    this.#nextOrder = undefined;\n\n    this.#nextProperties.clear();\n    this.#propsChangeOrder.length = 0;\n    this.#travellingProperties = undefined;\n\n    this.#events.length = 0;\n    this.#transferables.clear();\n  }\n\n  /**\n   * The three scalar pairs below all answer the same question the same way: is anything owed once\n   * the entry that is on its way out has landed?\n   *\n   * The written half alone cannot answer it. It is the last *confirmed* value and stays behind\n   * until the entry is committed, so a value the caller sets back to it while the entry travels\n   * would look like \"nothing to do\" \u2014 and the entry would then be the last word, leaving the\n   * Shadow Environment holding a value the view has already moved on from. So the pending half is\n   * only released where there is nothing in flight to contradict it; where there is, the new value\n   * takes the pending slot and the emitting side decides, against the written half it settles on.\n   */\n  changeToken(token: string | undefined) {\n    // an absent token means the void token everywhere else, so normalize here too;\n    // otherwise `undefined` would mark the component dirty without ever emitting a change\n    token ??= VoidToken;\n\n    // nothing pending and the confirmed token is the wanted one: nothing to queue. A component\n    // that has not been flushed yet is the exception \u2014 it still owes the trail its create-token,\n    // and dropping it here would emit a CreateEntities change without any token at all.\n    if (token === this.#token && this.#nextToken === undefined && !this.#isNew) return;\n\n    this.#nextToken = token;\n  }\n\n  setParent(parentUuid?: string) {\n    const nextParentUuid = parentUuid ?? ROOT;\n\n    if (nextParentUuid === (this.#parentUuid ?? ROOT) && this.#nextParentUuid === undefined) return;\n\n    this.#nextParentUuid = nextParentUuid;\n  }\n\n  changeOrder(order: number) {\n    if (order === this.#order && this.#nextOrder === undefined) return;\n\n    this.#nextOrder = order;\n  }\n\n  #properties: Map<string, unknown> = new Map();\n  #nextProperties: Map<string, unknown> = new Map();\n  /**\n   * The keys with a queued change, in the order their changes happened \u2014 the order an entry\n   * carries them in, and the reason this is a list and not a set.\n   *\n   * A set beside it would answer membership in one step, and per call it does win from about eight\n   * keys on: 8.0 ns for the set against 10.7 ns for the list at eight keys, 10.4 ns against 43.9 ns\n   * at 64. The distance is what decides against it. At the upper stop this repository can produce \u2014\n   * 64 keys, every one of them changed in every frame at 60 fps, so 3840 calls per second \u2014 that is\n   * 0.13 ms saved per second of animation. And membership is the smaller half: `removeFrom()` and\n   * `appendToEnd()` are an `indexOf` plus a `splice`, and the splice stays linear no matter what\n   * answers the membership. Numbers measured 2026-08-31 on node v25.9.0.\n   */\n  #propsChangeOrder: string[] = [];\n\n  /**\n   * The keys an entry on its way out carries, until that entry is settled. For those keys the\n   * written half is behind, and {@link ComponentChanges.changeProperty} must not cancel against it.\n   */\n  #travellingProperties?: Map<string, unknown> | undefined;\n\n  /**\n   * @returns `true` if the value differs from the last value this component asked for\n   */\n  changeProperty<T = unknown>(key: string, value: T, isEqual?: (a: T, b: T) => boolean): boolean {\n    const equals = (a: T, b: T) =>\n      // a registered rule compares values, and the marker is not one -- handed to it, a rule\n      // would be asked about a property it never saw, and one that reaches into its arguments\n      // throws on a symbol. Where either side is the marker the only question left is whether\n      // it is still the same third form, and identity answers that.\n      (a as unknown) === PropertyWithoutValue || (b as unknown) === PropertyWithoutValue\n        ? (a as unknown) === (b as unknown)\n        : isEqual == null\n          ? a === b\n          : isEqual(a, b);\n\n    const isQueued = this.#propsChangeOrder.includes(key);\n    const isTravelling = this.#travellingProperties?.has(key) ?? false;\n\n    // the value this component last said the property should have: the pending half where\n    // something is queued, else what an entry on its way out carries, else the confirmed value.\n    // A key that is none of the three reads as `undefined`, and a registered rule decides that\n    // comparison too -- a rule that calls the value equal to `undefined` says there is nothing\n    // to send.\n    let prevValue: T;\n    if (isQueued) {\n      prevValue = this.#nextProperties.get(key) as T;\n    } else if (isTravelling) {\n      prevValue = this.#travellingProperties!.get(key) as T;\n    } else {\n      prevValue = this.#properties.get(key) as T;\n    }\n\n    const valueChanged = !equals(value, prevValue);\n\n    // The pending half is released only where the confirmed value is the wanted one and no entry\n    // carrying another one is on its way out -- such an entry would otherwise be the last word.\n    // The travelling test comes first because it decides the branch on its own, and a comparison\n    // rule can be expensive on a path that runs once per frame. Where nothing is queued the\n    // comparison above was already the one against the confirmed value, so it is reused.\n    const nothingToSend = !isTravelling && (isQueued ? equals(value, this.#properties.get(key) as T) : !valueChanged);\n\n    if (nothingToSend) {\n      this.#nextProperties.delete(key);\n      removeFrom(this.#propsChangeOrder, key);\n    } else {\n      this.#nextProperties.set(key, value);\n      appendToEnd(this.#propsChangeOrder, key);\n    }\n\n    return valueChanged;\n  }\n\n  /**\n   * Mark `key` as set without giving it a value: the next trail carries an entry that names\n   * only the key. A later {@link ComponentChanges.changeProperty} replaces it with a value,\n   * and {@link ComponentChanges.removeProperty} takes it away like any other property.\n   *\n   * @returns `true` if this differs from the last value this component asked for\n   */\n  setPropertyWithoutValue(key: string): boolean {\n    return this.changeProperty(key, PropertyWithoutValue as unknown);\n  }\n\n  removeProperty(key: string) {\n    const isQueued = this.#propsChangeOrder.includes(key);\n\n    this.#nextProperties.delete(key);\n\n    if (!this.#properties.has(key) && !this.#travellingProperties?.has(key)) {\n      // nothing confirmed and nothing travelling: there is nothing to remove\n      removeFrom(this.#propsChangeOrder, key);\n      return;\n    }\n\n    // a key that was already queued keeps the place it took: the entry carries the changes in\n    // the order they happened, and a removal is not a second change to the same key\n    if (!isQueued) {\n      appendToEnd(this.#propsChangeOrder, key);\n    }\n  }\n\n  /**\n   * The properties this component holds at this moment: the ones a change trail has already\n   * carried, overlaid with everything that has accrued since.\n   *\n   * The overlay is what makes the result the current state instead of the state of the last\n   * trail \u2014 `#properties` is only written forward while a trail is being built\n   * ({@link ComponentChanges.makeCreateEntityChange},\n   * {@link ComponentChanges.makeChangePropertyChange}). A key whose accrued value is `undefined`\n   * and a key queued for change without an accrued value are both removals, and neither appears\n   * in the result. A key that is set without a value stands in the result with\n   * {@link PropertyWithoutValue}.\n   */\n  getProperties(): Map<string, unknown> {\n    const properties = new Map(this.#properties);\n\n    for (const key of this.#propsChangeOrder) {\n      const value = this.#nextProperties.get(key);\n      if (value === undefined) {\n        properties.delete(key);\n      } else {\n        properties.set(key, value);\n      }\n    }\n\n    return properties;\n  }\n\n  #events: IComponentEvent[] = [];\n  #transferables = new Set<Transferable>();\n\n  createEvent(type: string, data: unknown, transferables?: Transferable[]) {\n    this.#events.push({type, data});\n    for (const transferable of transferables ?? []) {\n      this.#transferables.add(transferable);\n    }\n  }\n\n  transferEventsTo(changes: ComponentChanges) {\n    if (this.#events.length > 0) {\n      changes.#events.push(...this.#events);\n      this.#events.length = 0;\n    }\n    if (this.#transferables.size > 0) {\n      changes.#transferables = new Set([...changes.#transferables, ...this.#transferables]);\n      this.#transferables.clear();\n    }\n  }\n\n  buildChangeTrail(trail: IComponentChangeType[], trailPhase: ChangeTrailPhase) {\n    const {isNew, isCreated, isDestroyed} = this;\n\n    if (isNew && isDestroyed) return;\n\n    switch (trailPhase) {\n      case ChangeTrailPhase.StructuralChanges:\n        if (isNew) {\n          trail.push(this.makeCreateEntityChange());\n        } else if (!isDestroyed) {\n          if (this.#hasPendingParent()) {\n            trail.push(this.makeSetParentChange());\n          } else if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n            trail.push(this.makeUpdateOrderChange());\n          }\n          if (this.#nextToken !== undefined && this.#nextToken !== this.#token) {\n            trail.push(this.makeChangeToken());\n          }\n        }\n        break;\n\n      case ChangeTrailPhase.ContentUpdates:\n        if (!isNew && isCreated && this.#propsChangeOrder.length > 0) {\n          trail.push(this.makeChangePropertyChange());\n        }\n        if (this.#events.length > 0) {\n          trail.push(this.makeEvents());\n        }\n        break;\n\n      case ChangeTrailPhase.Removal:\n        if (isDestroyed) {\n          trail.push(this.makeDestroyEntityChange());\n        }\n        break;\n    }\n  }\n\n  makeEvents(): ISendEvents {\n    const event: ISendEvents = {\n      type: ComponentChangeType.SendEvents,\n      uuid: this.#uuid,\n      events: this.#events.slice(0),\n    };\n    if (this.#transferables.size > 0) {\n      event.transferables = Array.from(this.#transferables);\n    }\n    return event;\n  }\n\n  makeCreateEntityChange(): ICreateEntitiesChange {\n    // never emit a create without a token: the kernel would register an entity that no\n    // shadow object can ever be looked up for\n    const token = this.#nextToken ?? this.#token;\n\n    const entry: ICreateEntitiesChange = {\n      type: ComponentChangeType.CreateEntities,\n      uuid: this.#uuid,\n      token,\n    };\n\n    if (this.#nextParentUuid !== undefined && this.#nextParentUuid !== ROOT) {\n      entry.parentUuid = this.#nextParentUuid;\n    }\n\n    if (this.#nextProperties.size > 0) {\n      // a create carries only the keys that have a value or are set without one; where nothing\n      // is left, the field stays off the entry \u2014 an absent `properties` and an empty one say\n      // the same thing, and the shorter one is what travels. The note is taken either way: it\n      // records what this entry carries, and an entry with no property is travelling with none\n      const properties: ComponentPropertiesType = [];\n      for (const [key, value] of this.#nextProperties) {\n        if (value === PropertyWithoutValue) {\n          properties.push([key]);\n        } else if (value !== undefined) {\n          properties.push([key, value]);\n        }\n      }\n      this.#noteTravellingProperties(properties);\n      if (properties.length > 0) {\n        entry.properties = properties;\n      }\n    }\n\n    if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n      entry.order = this.#nextOrder;\n    }\n\n    if (this.#autoDestructionOnParentRemoval) {\n      entry.autoDestructionOnParentRemoval = true;\n    }\n\n    return entry;\n  }\n\n  makeDestroyEntityChange(): IDestroyEntitiesChange {\n    return {\n      type: ComponentChangeType.DestroyEntities,\n      uuid: this.#uuid,\n    };\n  }\n\n  makeSetParentChange(): ISetParentChange {\n    const entry: ISetParentChange = {\n      type: ComponentChangeType.SetParent,\n      uuid: this.#uuid,\n      parentUuid: this.#nextParentUuid === ROOT ? undefined : this.#nextParentUuid,\n    };\n\n    if (this.#nextOrder !== undefined && this.#nextOrder !== this.#order) {\n      entry.order = this.#nextOrder;\n    }\n\n    return entry;\n  }\n\n  makeUpdateOrderChange(): IUpdateOrderChange {\n    return {\n      type: ComponentChangeType.UpdateOrder,\n      uuid: this.#uuid,\n      order: this.#nextOrder ?? 0,\n    };\n  }\n\n  makeChangeToken(): IChangeToken {\n    return {\n      type: ComponentChangeType.ChangeToken,\n      uuid: this.#uuid,\n      token: this.#nextToken ?? VoidToken,\n    };\n  }\n\n  makeChangePropertyChange(): IPropertiesChange {\n    // a key without a pending value is a removal, and so is a pending value of `undefined` --\n    // `get()` answers the same for both, which is what the receiving side reads them as. A key\n    // set without a value is the third form and travels as the bare key\n    const properties: ComponentPropertiesType = this.#propsChangeOrder.map((key) => {\n      const value = this.#nextProperties.get(key);\n      return value === PropertyWithoutValue ? [key] : [key, value];\n    });\n\n    this.#noteTravellingProperties(properties);\n\n    return {\n      type: ComponentChangeType.ChangeProperties,\n      uuid: this.#uuid,\n      properties,\n    };\n  }\n\n  /**\n   * Records the keys of an entry that is going out, so a later change knows the written half\n   * is behind.\n   */\n  #noteTravellingProperties(properties: ComponentPropertiesType): void {\n    // the arity carries the meaning on the wire, the marker carries it in here\n    this.#travellingProperties = new Map(\n      properties.map((entry) => [entry[0], entry.length === 1 ? PropertyWithoutValue : entry[1]]),\n    );\n  }\n\n  /**\n   * Fold one trail entry into the written half of this component's bookkeeping: the values the\n   * entry carries become the values the next diff is taken against, and the pending half that\n   * produced them is released. Called once per entry the Shadow Environment has applied.\n   *\n   * A pending value is released only while it is still the value the entry carried. Between the\n   * build of a trail and its confirmation lies a round trip, and whatever changed in that window\n   * is owed to the Shadow Environment \u2014 releasing it here would leave the two sides holding\n   * different values with nothing left to correct them.\n   */\n  commitChange(entry: IComponentChangeType): void {\n    switch (entry.type) {\n      case ComponentChangeType.CreateEntities:\n        this.#commitToken(entry.token);\n        this.#commitParentUuid(entry.parentUuid);\n        this.#commitOrder(entry.order ?? this.#order);\n        this.#commitProperties(entry.properties);\n        // a create carries only the properties that have a value; a pending removal of a key the\n        // entity was never given has nothing left to ask for and is released along with it\n        for (const key of this.#propsChangeOrder.slice(0)) {\n          if (this.#nextProperties.get(key) === undefined && !this.#properties.has(key)) {\n            this.#nextProperties.delete(key);\n            removeFrom(this.#propsChangeOrder, key);\n          }\n        }\n        this.#travellingProperties = undefined;\n        this.#isNew = false;\n        break;\n\n      case ComponentChangeType.SetParent:\n        this.#commitParentUuid(entry.parentUuid);\n        this.#commitOrder(entry.order ?? this.#order);\n        break;\n\n      case ComponentChangeType.UpdateOrder:\n        this.#commitOrder(entry.order);\n        break;\n\n      case ComponentChangeType.ChangeToken:\n        this.#commitToken(entry.token);\n        break;\n\n      case ComponentChangeType.ChangeProperties:\n        this.#commitProperties(entry.properties);\n        this.#travellingProperties = undefined;\n        break;\n\n      case ComponentChangeType.SendEvents:\n        // the entry carries a snapshot taken while the trail was built; anything that arrived\n        // behind it is still waiting to go out\n        this.#events.splice(0, entry.events.length);\n        for (const transferable of entry.transferables ?? []) {\n          this.#transferables.delete(transferable);\n        }\n        break;\n\n      case ComponentChangeType.DestroyEntities:\n        // The entity behind this uuid is gone. Usually the component entry goes with it, but a\n        // uuid its holder has left is free again, and a component that took it over in the\n        // meantime keeps the entry alive. The written half describes an entity that no longer\n        // exists, so it is reset to what a component nobody knows yet looks like -- otherwise the\n        // successor would diff against it and ask for a change to something that is not there.\n        this.#token = VoidToken;\n        this.#parentUuid = undefined;\n        this.#order = 0;\n        this.#properties.clear();\n        this.#travellingProperties = undefined;\n        this.#isNew = true;\n        break;\n    }\n  }\n\n  #commitToken(token: string): void {\n    this.#token = token;\n    if (this.#nextToken === token) {\n      this.#nextToken = undefined;\n    }\n  }\n\n  #commitParentUuid(parentUuid: string | undefined): void {\n    this.#parentUuid = parentUuid;\n    if ((this.#nextParentUuid === ROOT ? undefined : this.#nextParentUuid) === parentUuid) {\n      this.#nextParentUuid = undefined;\n    }\n  }\n\n  #commitOrder(order: number): void {\n    this.#order = order;\n    if (this.#nextOrder === order) {\n      this.#nextOrder = undefined;\n    }\n  }\n\n  #commitProperties(properties: ComponentPropertiesType | undefined): void {\n    for (const entry of properties ?? []) {\n      const key = entry[0];\n      // an entry that names only the key is the third form and not a removal: the written\n      // half has to hold it, or the next diff reads the key as one that was never set\n      const value = entry.length === 1 ? PropertyWithoutValue : entry[1];\n\n      if (value === undefined) {\n        this.#properties.delete(key);\n      } else {\n        this.#properties.set(key, value);\n      }\n\n      if (this.#nextProperties.get(key) === value) {\n        this.#nextProperties.delete(key);\n        removeFrom(this.#propsChangeOrder, key);\n      }\n    }\n  }\n}\n"],
+  "mappings": "AAAA,SAAQ,kBAAkB,qBAAqB,iBAAgB;AAa/D,SAAQ,aAAa,kBAAiB;AAEtC,MAAM,OAAO;AAaN,MAAM,uBAAuB,uBAAO,uCAAuC;AAuB3E,MAAM,iBAAiB;AAAA,EACnB;AAAA,EAET,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,YAAY,MAAc;AACxB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,SAAS;AAAA,EACT,eAAe;AAAA,EACf,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMhB,aAAsB;AACpB,WACG,KAAK,UAAU,KAAK,aACrB,KAAK,eACJ,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,UAC3D,KAAK,kBAAkB,KACtB,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,UAC3D,KAAK,kBAAkB,SAAS,KAChC,KAAK,QAAQ,SAAS;AAAA,EAE1B;AAAA,EAEA,IAAI,QAAiB;AACnB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,YAAqB;AACvB,WAAO,KAAK,eAAe,KAAK,KAAK,eAAe,KAAK;AAAA,EAC3D;AAAA,EAEA,IAAI,cAAuB;AACzB,WAAO,KAAK,gBAAgB,KAAK,KAAK,iBAAiB,KAAK;AAAA,EAC9D;AAAA,EAEA,SAAiB;AAAA,EACjB;AAAA,EACA,SAAiB;AAAA,EACjB,kCAAkC;AAAA,EAElC;AAAA,EACA;AAAA,EACA;AAAA,EAEA,OAAO,QAAgB,WAAW,YAAqB,QAAgB,GAAG,iCAAiC,OAAO;AAChH,SAAK;AAEL,SAAK,aAAa;AAClB,SAAK,kBAAkB,cAAc;AACrC,SAAK,aAAa,CAAC,QAAQ,SAAY;AACvC,SAAK,kCAAkC;AAAA,EACzC;AAAA,EAEA,UAAU;AACR,SAAK;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA6B;AAC3B,QAAI,KAAK,oBAAoB,OAAW,QAAO;AAC/C,YAAQ,KAAK,oBAAoB,OAAO,SAAY,KAAK,qBAAqB,KAAK;AAAA,EACrF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ;AACN,SAAK,aAAa;AAClB,SAAK,kBAAkB;AACvB,SAAK,aAAa;AAElB,SAAK,gBAAgB,MAAM;AAC3B,SAAK,kBAAkB,SAAS;AAChC,SAAK,wBAAwB;AAE7B,SAAK,QAAQ,SAAS;AACtB,SAAK,eAAe,MAAM;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,YAAY,OAA2B;AAGrC,cAAU;AAKV,QAAI,UAAU,KAAK,UAAU,KAAK,eAAe,UAAa,CAAC,KAAK,OAAQ;AAE5E,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,UAAU,YAAqB;AAC7B,UAAM,iBAAiB,cAAc;AAErC,QAAI,oBAAoB,KAAK,eAAe,SAAS,KAAK,oBAAoB,OAAW;AAEzF,SAAK,kBAAkB;AAAA,EACzB;AAAA,EAEA,YAAY,OAAe;AACzB,QAAI,UAAU,KAAK,UAAU,KAAK,eAAe,OAAW;AAE5D,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,cAAoC,oBAAI,IAAI;AAAA,EAC5C,kBAAwC,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAahD,oBAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAM/B;AAAA;AAAA;AAAA;AAAA,EAKA,eAA4B,KAAa,OAAU,SAA4C;AAC7F,UAAM,SAAS,CAAC,GAAM;AAAA;AAAA;AAAA;AAAA;AAAA,MAKnB,MAAkB,wBAAyB,MAAkB,uBACzD,MAAmB,IACpB,WAAW,OACT,MAAM,IACN,QAAQ,GAAG,CAAC;AAAA;AAEpB,UAAM,WAAW,KAAK,kBAAkB,SAAS,GAAG;AACpD,UAAM,eAAe,KAAK,uBAAuB,IAAI,GAAG,KAAK;AAO7D,QAAI;AACJ,QAAI,UAAU;AACZ,kBAAY,KAAK,gBAAgB,IAAI,GAAG;AAAA,IAC1C,WAAW,cAAc;AACvB,kBAAY,KAAK,sBAAuB,IAAI,GAAG;AAAA,IACjD,OAAO;AACL,kBAAY,KAAK,YAAY,IAAI,GAAG;AAAA,IACtC;AAEA,UAAM,eAAe,CAAC,OAAO,OAAO,SAAS;AAO7C,UAAM,gBAAgB,CAAC,iBAAiB,WAAW,OAAO,OAAO,KAAK,YAAY,IAAI,GAAG,CAAM,IAAI,CAAC;AAEpG,QAAI,eAAe;AACjB,WAAK,gBAAgB,OAAO,GAAG;AAC/B,iBAAW,KAAK,mBAAmB,GAAG;AAAA,IACxC,OAAO;AACL,WAAK,gBAAgB,IAAI,KAAK,KAAK;AACnC,kBAAY,KAAK,mBAAmB,GAAG;AAAA,IACzC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,wBAAwB,KAAsB;AAC5C,WAAO,KAAK,eAAe,KAAK,oBAA+B;AAAA,EACjE;AAAA,EAEA,eAAe,KAAa;AAC1B,UAAM,WAAW,KAAK,kBAAkB,SAAS,GAAG;AAEpD,SAAK,gBAAgB,OAAO,GAAG;AAE/B,QAAI,CAAC,KAAK,YAAY,IAAI,GAAG,KAAK,CAAC,KAAK,uBAAuB,IAAI,GAAG,GAAG;AAEvE,iBAAW,KAAK,mBAAmB,GAAG;AACtC;AAAA,IACF;AAIA,QAAI,CAAC,UAAU;AACb,kBAAY,KAAK,mBAAmB,GAAG;AAAA,IACzC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,gBAAsC;AACpC,UAAM,aAAa,IAAI,IAAI,KAAK,WAAW;AAE3C,eAAW,OAAO,KAAK,mBAAmB;AACxC,YAAM,QAAQ,KAAK,gBAAgB,IAAI,GAAG;AAC1C,UAAI,UAAU,QAAW;AACvB,mBAAW,OAAO,GAAG;AAAA,MACvB,OAAO;AACL,mBAAW,IAAI,KAAK,KAAK;AAAA,MAC3B;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,UAA6B,CAAC;AAAA,EAC9B,iBAAiB,oBAAI,IAAkB;AAAA,EAEvC,YAAY,MAAc,MAAe,eAAgC;AACvE,SAAK,QAAQ,KAAK,EAAC,MAAM,KAAI,CAAC;AAC9B,eAAW,gBAAgB,iBAAiB,CAAC,GAAG;AAC9C,WAAK,eAAe,IAAI,YAAY;AAAA,IACtC;AAAA,EACF;AAAA,EAEA,iBAAiB,SAA2B;AAC1C,QAAI,KAAK,QAAQ,SAAS,GAAG;AAC3B,cAAQ,QAAQ,KAAK,GAAG,KAAK,OAAO;AACpC,WAAK,QAAQ,SAAS;AAAA,IACxB;AACA,QAAI,KAAK,eAAe,OAAO,GAAG;AAChC,cAAQ,iBAAiB,oBAAI,IAAI,CAAC,GAAG,QAAQ,gBAAgB,GAAG,KAAK,cAAc,CAAC;AACpF,WAAK,eAAe,MAAM;AAAA,IAC5B;AAAA,EACF;AAAA,EAEA,iBAAiB,OAA+B,YAA8B;AAC5E,UAAM,EAAC,OAAO,WAAW,YAAW,IAAI;AAExC,QAAI,SAAS,YAAa;AAE1B,YAAQ,YAAY;AAAA,MAClB,KAAK,iBAAiB;AACpB,YAAI,OAAO;AACT,gBAAM,KAAK,KAAK,uBAAuB,CAAC;AAAA,QAC1C,WAAW,CAAC,aAAa;AACvB,cAAI,KAAK,kBAAkB,GAAG;AAC5B,kBAAM,KAAK,KAAK,oBAAoB,CAAC;AAAA,UACvC,WAAW,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AAC3E,kBAAM,KAAK,KAAK,sBAAsB,CAAC;AAAA,UACzC;AACA,cAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,kBAAM,KAAK,KAAK,gBAAgB,CAAC;AAAA,UACnC;AAAA,QACF;AACA;AAAA,MAEF,KAAK,iBAAiB;AACpB,YAAI,CAAC,SAAS,aAAa,KAAK,kBAAkB,SAAS,GAAG;AAC5D,gBAAM,KAAK,KAAK,yBAAyB,CAAC;AAAA,QAC5C;AACA,YAAI,KAAK,QAAQ,SAAS,GAAG;AAC3B,gBAAM,KAAK,KAAK,WAAW,CAAC;AAAA,QAC9B;AACA;AAAA,MAEF,KAAK,iBAAiB;AACpB,YAAI,aAAa;AACf,gBAAM,KAAK,KAAK,wBAAwB,CAAC;AAAA,QAC3C;AACA;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,aAA0B;AACxB,UAAM,QAAqB;AAAA,MACzB,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK,QAAQ,MAAM,CAAC;AAAA,IAC9B;AACA,QAAI,KAAK,eAAe,OAAO,GAAG;AAChC,YAAM,gBAAgB,MAAM,KAAK,KAAK,cAAc;AAAA,IACtD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,yBAAgD;AAG9C,UAAM,QAAQ,KAAK,cAAc,KAAK;AAEtC,UAAM,QAA+B;AAAA,MACnC,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX;AAAA,IACF;AAEA,QAAI,KAAK,oBAAoB,UAAa,KAAK,oBAAoB,MAAM;AACvE,YAAM,aAAa,KAAK;AAAA,IAC1B;AAEA,QAAI,KAAK,gBAAgB,OAAO,GAAG;AAKjC,YAAM,aAAsC,CAAC;AAC7C,iBAAW,CAAC,KAAK,KAAK,KAAK,KAAK,iBAAiB;AAC/C,YAAI,UAAU,sBAAsB;AAClC,qBAAW,KAAK,CAAC,GAAG,CAAC;AAAA,QACvB,WAAW,UAAU,QAAW;AAC9B,qBAAW,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,QAC9B;AAAA,MACF;AACA,WAAK,0BAA0B,UAAU;AACzC,UAAI,WAAW,SAAS,GAAG;AACzB,cAAM,aAAa;AAAA,MACrB;AAAA,IACF;AAEA,QAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,YAAM,QAAQ,KAAK;AAAA,IACrB;AAEA,QAAI,KAAK,iCAAiC;AACxC,YAAM,iCAAiC;AAAA,IACzC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,0BAAkD;AAChD,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,IACb;AAAA,EACF;AAAA,EAEA,sBAAwC;AACtC,UAAM,QAA0B;AAAA,MAC9B,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,YAAY,KAAK,oBAAoB,OAAO,SAAY,KAAK;AAAA,IAC/D;AAEA,QAAI,KAAK,eAAe,UAAa,KAAK,eAAe,KAAK,QAAQ;AACpE,YAAM,QAAQ,KAAK;AAAA,IACrB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,wBAA4C;AAC1C,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,KAAK,cAAc;AAAA,IAC5B;AAAA,EACF;AAAA,EAEA,kBAAgC;AAC9B,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,KAAK,cAAc;AAAA,IAC5B;AAAA,EACF;AAAA,EAEA,2BAA8C;AAI5C,UAAM,aAAsC,KAAK,kBAAkB,IAAI,CAAC,QAAQ;AAC9E,YAAM,QAAQ,KAAK,gBAAgB,IAAI,GAAG;AAC1C,aAAO,UAAU,uBAAuB,CAAC,GAAG,IAAI,CAAC,KAAK,KAAK;AAAA,IAC7D,CAAC;AAED,SAAK,0BAA0B,UAAU;AAEzC,WAAO;AAAA,MACL,MAAM,oBAAoB;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B,YAA2C;AAEnE,SAAK,wBAAwB,IAAI;AAAA,MAC/B,WAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,MAAM,WAAW,IAAI,uBAAuB,MAAM,CAAC,CAAC,CAAC;AAAA,IAC5F;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,aAAa,OAAmC;AAC9C,YAAQ,MAAM,MAAM;AAAA,MAClB,KAAK,oBAAoB;AACvB,aAAK,aAAa,MAAM,KAAK;AAC7B,aAAK,kBAAkB,MAAM,UAAU;AACvC,aAAK,aAAa,MAAM,SAAS,KAAK,MAAM;AAC5C,aAAK,kBAAkB,MAAM,UAAU;AAGvC,mBAAW,OAAO,KAAK,kBAAkB,MAAM,CAAC,GAAG;AACjD,cAAI,KAAK,gBAAgB,IAAI,GAAG,MAAM,UAAa,CAAC,KAAK,YAAY,IAAI,GAAG,GAAG;AAC7E,iBAAK,gBAAgB,OAAO,GAAG;AAC/B,uBAAW,KAAK,mBAAmB,GAAG;AAAA,UACxC;AAAA,QACF;AACA,aAAK,wBAAwB;AAC7B,aAAK,SAAS;AACd;AAAA,MAEF,KAAK,oBAAoB;AACvB,aAAK,kBAAkB,MAAM,UAAU;AACvC,aAAK,aAAa,MAAM,SAAS,KAAK,MAAM;AAC5C;AAAA,MAEF,KAAK,oBAAoB;AACvB,aAAK,aAAa,MAAM,KAAK;AAC7B;AAAA,MAEF,KAAK,oBAAoB;AACvB,aAAK,aAAa,MAAM,KAAK;AAC7B;AAAA,MAEF,KAAK,oBAAoB;AACvB,aAAK,kBAAkB,MAAM,UAAU;AACvC,aAAK,wBAAwB;AAC7B;AAAA,MAEF,KAAK,oBAAoB;AAGvB,aAAK,QAAQ,OAAO,GAAG,MAAM,OAAO,MAAM;AAC1C,mBAAW,gBAAgB,MAAM,iBAAiB,CAAC,GAAG;AACpD,eAAK,eAAe,OAAO,YAAY;AAAA,QACzC;AACA;AAAA,MAEF,KAAK,oBAAoB;AAMvB,aAAK,SAAS;AACd,aAAK,cAAc;AACnB,aAAK,SAAS;AACd,aAAK,YAAY,MAAM;AACvB,aAAK,wBAAwB;AAC7B,aAAK,SAAS;AACd;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,aAAa,OAAqB;AAChC,SAAK,SAAS;AACd,QAAI,KAAK,eAAe,OAAO;AAC7B,WAAK,aAAa;AAAA,IACpB;AAAA,EACF;AAAA,EAEA,kBAAkB,YAAsC;AACtD,SAAK,cAAc;AACnB,SAAK,KAAK,oBAAoB,OAAO,SAAY,KAAK,qBAAqB,YAAY;AACrF,WAAK,kBAAkB;AAAA,IACzB;AAAA,EACF;AAAA,EAEA,aAAa,OAAqB;AAChC,SAAK,SAAS;AACd,QAAI,KAAK,eAAe,OAAO;AAC7B,WAAK,aAAa;AAAA,IACpB;AAAA,EACF;AAAA,EAEA,kBAAkB,YAAuD;AACvE,eAAW,SAAS,cAAc,CAAC,GAAG;AACpC,YAAM,MAAM,MAAM,CAAC;AAGnB,YAAM,QAAQ,MAAM,WAAW,IAAI,uBAAuB,MAAM,CAAC;AAEjE,UAAI,UAAU,QAAW;AACvB,aAAK,YAAY,OAAO,GAAG;AAAA,MAC7B,OAAO;AACL,aAAK,YAAY,IAAI,KAAK,KAAK;AAAA,MACjC;AAEA,UAAI,KAAK,gBAAgB,IAAI,GAAG,MAAM,OAAO;AAC3C,aAAK,gBAAgB,OAAO,GAAG;AAC/B,mBAAW,KAAK,mBAAmB,GAAG;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AACF;",
   "names": []
 }