@graffy/common 0.16.19 → 0.16.20-alpha.2

package/index.cjs

@@ -19,12 +19,10 @@ function err(message, { cause = null, ...args } = {}) {
   throw e;
 }
 function errIf(message, condition, args) {
-  if (condition)
-    err(message, args);
+  if (condition) err(message, args);
 }
 function isEmpty(object) {
-  for (const _ in object)
-    return false;
+  for (const _ in object) return false;
   return true;
 }
 function isDef(value) {
@@ -42,15 +40,11 @@ function clone$1(obj) {
 function cmp(a, b) {
   const l = a.length < b.length ? a.length : b.length;
   for (let i = 0; i < l; i++) {
-    if (a[i] < b[i])
-      return -1;
-    if (a[i] > b[i])
-      return 1;
-  }
-  if (a.length < b.length)
-    return -1;
-  if (a.length > b.length)
-    return 1;
+    if (a[i] < b[i]) return -1;
+    if (a[i] > b[i]) return 1;
+  }
+  if (a.length < b.length) return -1;
+  if (a.length > b.length) return 1;
   return 0;
 }
 function find(items, compare2, first = 0, last = items.length) {
@@ -71,8 +65,7 @@ function find(items, compare2, first = 0, last = items.length) {
 }
 function stringify() {
   var _a;
-  if ((this == null ? void 0 : this.length) === 0)
-    return "·";
+  if ((this == null ? void 0 : this.length) === 0) return "·";
   let str = "";
   let bull = false;
   (_a = this == null ? void 0 : this.forEach) == null ? void 0 : _a.call(this, (value, i) => {
@@ -88,10 +81,8 @@ function stringify() {
 }
 const inspectSymbol = Symbol.for("nodejs.util.inspect.custom");
 function addStringify(buffer) {
-  if (!isDebugMode)
-    return buffer;
-  if ("toJSON" in buffer || inspectSymbol in buffer)
-    return buffer;
+  if (!isDebugMode) return buffer;
+  if ("toJSON" in buffer || inspectSymbol in buffer) return buffer;
   buffer.toJSON = stringify;
   buffer.toString = stringify;
   buffer[inspectSymbol] = stringify;
@@ -164,31 +155,22 @@ function encodeObject(object) {
   ];
 }
 function encodeParts(value) {
-  if (value === null)
-    return [NULL];
-  if (value === false)
-    return [FALSE];
-  if (value === true)
-    return [TRUE];
-  if (typeof value === "number")
-    return [NUM, encode$6(value)];
-  if (typeof value === "string")
-    return [STR, encode$5(value), END];
-  if (Array.isArray(value))
-    return encodeArray(value);
-  if (typeof value === "object")
-    return encodeObject(value);
+  if (value === null) return [NULL];
+  if (value === false) return [FALSE];
+  if (value === true) return [TRUE];
+  if (typeof value === "number") return [NUM, encode$6(value)];
+  if (typeof value === "string") return [STR, encode$5(value), END];
+  if (Array.isArray(value)) return encodeArray(value);
+  if (typeof value === "object") return encodeObject(value);
   return [NULL];
 }
 function encode$4(value) {
   const parts = encodeParts(value);
-  while (parts[parts.length - 1] === END)
-    parts.pop();
+  while (parts[parts.length - 1] === END) parts.pop();
   const lastPart = parts[parts.length - 1];
   if (typeof lastPart !== "number") {
     let end = lastPart.length - 1;
-    while (end >= 0 && !lastPart[end])
-      end--;
+    while (end >= 0 && !lastPart[end]) end--;
     if (lastPart[end] !== 255) {
       parts[parts.length - 1] = lastPart.slice(0, end + 1);
     } else {
@@ -219,18 +201,15 @@ function decode$4(buffer) {
   const stack = [[]];
   function readString() {
     const start = i;
-    while (i < buffer.length && buffer[i] !== END)
-      i++;
+    while (i < buffer.length && buffer[i] !== END) i++;
     const str = decode$5(buffer.subarray(start, i));
     i++;
     return str;
   }
   function pushToken(type, value) {
     const current = stack[stack.length - 1];
-    if (type === ARR || type === OBJ)
-      stack.push(value);
-    if (!current)
-      return;
+    if (type === ARR || type === OBJ) stack.push(value);
+    if (!current) return;
     if (Array.isArray(current)) {
       current.push(value);
     } else {
@@ -283,10 +262,8 @@ function decode$4(buffer) {
   return stack[0][0];
 }
 function keyStep(key) {
-  if (isMinKey(key))
-    return { key, step: 1 };
-  if (isMaxKey(key))
-    return { key, step: -1 };
+  if (isMinKey(key)) return { key, step: 1 };
+  if (isMaxKey(key)) return { key, step: -1 };
   const l = key.length - 1;
   let newKey;
   let step;
@@ -309,8 +286,7 @@ function keyStep(key) {
   return { key: newKey, step };
 }
 function keyBefore(key) {
-  if (isMinKey(key) || isMaxKey(key))
-    return key;
+  if (isMinKey(key) || isMaxKey(key)) return key;
   const l = key.length - 1;
   let newKey;
   if (key[l] === 0) {
@@ -325,8 +301,7 @@ function keyBefore(key) {
   return newKey;
 }
 function keyAfter(key) {
-  if (isMaxKey(key))
-    return key;
+  if (isMaxKey(key)) return key;
   const l = key.length - 1;
   let newKey;
   if (key[l] === 255) {
@@ -342,8 +317,7 @@ function keyAfter(key) {
 }
 function decodeBound(bound) {
   const { key, step } = keyStep(bound);
-  if (isMinKey(key) || isMaxKey(key))
-    return { step };
+  if (isMinKey(key) || isMaxKey(key)) return { step };
   const value = decode$4(key);
   return { key: value, step };
 }
@@ -360,20 +334,17 @@ const pageProps = {
 function splitArgs(arg) {
   const page = {};
   const filter = {};
-  for (const p in arg)
-    (p in pageProps ? page : filter)[p] = arg[p];
+  for (const p in arg) (p in pageProps ? page : filter)[p] = arg[p];
   return [
     isEmpty(page) ? void 0 : page,
     isEmpty(filter) ? void 0 : filter
   ];
 }
 function encode$3(arg) {
-  if (!isPlainObject(arg))
-    return { key: encode$4(arg) };
+  if (!isPlainObject(arg)) return { key: encode$4(arg) };
   const [page, filter] = splitArgs(arg);
   errIf("page_and_filter", page && filter, arg);
-  if (!page)
-    return { key: encode$4(filter || {}) };
+  if (!page) return { key: encode$4(filter || {}) };
   const { $cursor, ...range } = page;
   const { $first, $all, $last, $after, $before, $since, $until } = range;
   const hasRange = !isEmpty(range);
@@ -384,23 +355,15 @@ function encode$3(arg) {
   errIf("before_and_until", isDef($before) && isDef($until), arg);
   errIf("cursor_and_range_arg", isDef($cursor) && hasRange, arg);
   let [key, end] = hasRange ? [MIN_KEY, MAX_KEY] : [];
-  if (isDef($cursor))
-    key = encode$4($cursor);
-  if (isDef($after))
-    key = keyAfter(encode$4($after));
-  if (isDef($before))
-    end = keyBefore(encode$4($before));
-  if (isDef($since))
-    key = encode$4($since);
-  if (isDef($until))
-    end = encode$4($until);
-  if (isDef($last))
-    [key, end] = [end, key];
+  if (isDef($cursor)) key = encode$4($cursor);
+  if (isDef($after)) key = keyAfter(encode$4($after));
+  if (isDef($before)) end = keyBefore(encode$4($before));
+  if (isDef($since)) key = encode$4($since);
+  if (isDef($until)) end = encode$4($until);
+  if (isDef($last)) [key, end] = [end, key];
   const node = { key };
-  if (isDef(end))
-    node.end = end;
-  if ($first || $last)
-    node.limit = $first || $last;
+  if (isDef(end)) node.end = end;
+  if ($first || $last) node.limit = $first || $last;
   return node;
 }
 function decode$3(node) {
@@ -408,8 +371,7 @@ function decode$3(node) {
   errIf("no_key", !isDef(key));
   errIf("limit_without_end", isDef(limit) && !isDef(end));
   const kParts = decodeBound(key);
-  if (!isDef(end) || cmp(key, end) === 0)
-    return kParts.key;
+  if (!isDef(end) || cmp(key, end) === 0) return kParts.key;
   const eParts = decodeBound(end);
   const reverse = cmp(key, end) > 0;
   const [lower, upper] = reverse ? [eParts, kParts] : [kParts, eParts];
@@ -430,25 +392,21 @@ function decode$3(node) {
 const PATH_SEPARATOR = ".";
 function encode$2(path) {
   if (typeof path === "string") {
-    if (!path.length || path === PATH_SEPARATOR)
-      return [];
+    if (!path.length || path === PATH_SEPARATOR) return [];
     path = path.split(PATH_SEPARATOR);
   }
   if (!Array.isArray(path)) {
     throw Error(`encodePath.invalid:${JSON.stringify(path)}`);
   }
   function encodeSegment(seg) {
-    if (ArrayBuffer.isView(seg))
-      return seg;
+    if (ArrayBuffer.isView(seg)) return seg;
     const node = encode$3(seg);
-    if (node.end)
-      return node;
+    if (node.end) return node;
     return node.key;
   }
   if (isPlainObject(path[path.length - 1])) {
     const [page, filter] = splitArgs(path[path.length - 1]);
-    if (page)
-      path = path.slice(0, -1).concat([filter || MIN_KEY]);
+    if (page) path = path.slice(0, -1).concat([filter || MIN_KEY]);
   }
   return path.map(encodeSegment);
 }
@@ -459,11 +417,9 @@ function decode$2(path) {
   return path.map((key) => decode$3({ key }));
 }
 function splitRef($ref) {
-  if (!Array.isArray($ref))
-    return [];
+  if (!Array.isArray($ref)) return [];
   const tail = $ref[$ref.length - 1];
-  if (!isPlainObject(tail))
-    return [];
+  if (!isPlainObject(tail)) return [];
   return splitArgs(tail);
 }
 let customAlphabet = (alphabet, defaultSize = 21) => {
@@ -484,8 +440,7 @@ function findFirst(children, target, first, last) {
     ({ key, end }) => {
       const keyCmp = cmp(key, target);
       const endCmp = end && cmp(end, target);
-      if (end && keyCmp < 0 && endCmp >= 0)
-        return 0;
+      if (end && keyCmp < 0 && endCmp >= 0) return 0;
       return keyCmp;
     },
     first,
@@ -553,20 +508,17 @@ function compare(node) {
   };
 }
 function compareValue(a, b) {
-  if (a === b)
-    return 0;
+  if (a === b) return 0;
   return a < b ? -1 : 1;
 }
 function clone(node) {
   const copy = { ...node };
-  if (node.children)
-    copy.children = node.children.map((child) => clone(child));
+  if (node.children) copy.children = node.children.map((child) => clone(child));
   return copy;
 }
 function merge(current, changes) {
   let index = 0;
-  if (typeof changes === "undefined")
-    return current;
+  if (typeof changes === "undefined") return current;
   for (const change of changes) {
     index = isRange(change) ? insertRange$1(current, change, index) : insertNode$1(current, change, index);
   }
@@ -589,8 +541,7 @@ function insertRange$1(current, change, start = 0) {
   return keyIx + insertions.length - 1;
 }
 function mergeRanges$1(base, node) {
-  if (node.version < base.version)
-    [node, base] = [base, node];
+  if (node.version < base.version) [node, base] = [base, node];
   return [
     cmp(base.key, node.key) < 0 && { ...base, end: keyBefore(node.key) },
     node,
@@ -598,8 +549,7 @@ function mergeRanges$1(base, node) {
   ].filter(Boolean);
 }
 function insertNode$1(current, change, start = 0) {
-  if (!current)
-    throw new Error(`merge.insertNode: ${current}`);
+  if (!current) throw new Error(`merge.insertNode: ${current}`);
   const key = change.key;
   const index = findFirst(current, key, start);
   const node = current[index];
@@ -613,8 +563,7 @@ function insertNodeIntoRange$1(current, index, change) {
   const key = change.key;
   const range = current[index];
   const newChange = getNewer(change, range);
-  if (!newChange)
-    return;
+  if (!newChange) return;
   const insertions = [
     cmp(range.key, key) < 0 && { ...range, end: keyBefore(key) },
     newChange,
@@ -632,11 +581,9 @@ function updateNode$1(current, index, change) {
     current[index] = newNode || change;
   } else {
     const newChange = getNewer(change, node);
-    if (newChange)
-      current[index] = newChange;
+    if (newChange) current[index] = newChange;
   }
-  if (change.prefix)
-    current[index].prefix = true;
+  if (change.prefix) current[index].prefix = true;
   return index + 1;
 }
 function getNewer(node, base) {
@@ -650,8 +597,7 @@ function getNewer(node, base) {
 }
 const IS_VAL = Symbol("IS_VAL");
 function makeNode(seg, props2) {
-  if (ArrayBuffer.isView(seg))
-    return { key: seg, ...props2 };
+  if (ArrayBuffer.isView(seg)) return { key: seg, ...props2 };
   return { ...seg, ...props2 };
 }
 function wrapValue(value, path, version = 0) {
@@ -659,74 +605,56 @@ function wrapValue(value, path, version = 0) {
   return wrap([node], path.slice(0, -1), version);
 }
 function wrap(children, path, version = 0, prefix = false) {
-  if (!Array.isArray(path))
-    throw Error(`wrap.path_not_array ${path}`);
-  if (!path.length)
-    return children;
+  if (!Array.isArray(path)) throw Error(`wrap.path_not_array ${path}`);
+  if (!path.length) return children;
   let i = path.length - 1;
   if (!Array.isArray(children)) {
     children = [makeNode(path[i--], { value: children, version })];
   } else {
-    if (!children.length)
-      return;
+    if (!children.length) return;
     children = [makeNode(path[i--], { children, version })];
   }
-  if (prefix)
-    children[0].prefix = true;
-  while (i >= 0)
-    children = [makeNode(path[i--], { children, version })];
+  if (prefix) children[0].prefix = true;
+  while (i >= 0) children = [makeNode(path[i--], { children, version })];
   return children;
 }
 function unwrap(tree, path) {
-  if (!Array.isArray(path))
-    throw Error(`unwrap.path_not_array ${path}`);
+  if (!Array.isArray(path)) throw Error(`unwrap.path_not_array ${path}`);
   let children = tree;
   let node = { children };
   for (let i = 0; i < path.length; i++) {
     const key = path[i];
-    if (!ArrayBuffer.isView(key))
-      throw Error("unwrap.ranges_unsupported");
+    if (!ArrayBuffer.isView(key)) throw Error("unwrap.ranges_unsupported");
     children = node.children;
-    if (!children)
-      return null;
+    if (!children) return null;
     node = children[findFirst(children, key)];
-    if (!node || cmp(node.key, key) > 0)
-      return void 0;
-    if (isRange(node))
-      return null;
-    if (node.path)
-      return unwrap(tree, node.path.concat(path.slice(i + 1)));
+    if (!node || cmp(node.key, key) > 0) return void 0;
+    if (isRange(node)) return null;
+    if (node.path) return unwrap(tree, node.path.concat(path.slice(i + 1)));
   }
   return getNodeValue(node);
 }
 function getNodeValue(node) {
-  if (node.children)
-    return node.children;
+  if (node.children) return node.children;
   if (node.value && typeof node.value === "object") {
     node.value[IS_VAL] = true;
   }
   return node.value;
 }
 function remove(children, path) {
-  if (!Array.isArray(path))
-    throw Error(`del.path_not_array ${path}`);
-  if (!children)
-    return null;
-  if (!path.length)
-    return [];
+  if (!Array.isArray(path)) throw Error(`del.path_not_array ${path}`);
+  if (!children) return null;
+  if (!path.length) return [];
   const key = path[0];
   const ix = findFirst(children, key);
   const node = children[ix];
-  if (!node || cmp(node.key, key) > 0 || isRange(node))
-    return children;
+  if (!node || cmp(node.key, key) > 0 || isRange(node)) return children;
   if (path.length === 1) {
     return children.slice(0, ix).concat(children.slice(ix + 1));
   }
-  if (!isBranch(node))
-    return children;
+  if (!isBranch(node)) return children;
   const filteredChildren = remove(node.children, path.slice(1));
-  if (filteredChildren === children)
-    return children;
+  if (filteredChildren === children) return children;
   const filteredNode = filteredChildren.length ? { ...node, children: filteredChildren } : [];
   return children.slice(0, ix).concat(filteredNode, children.slice(ix + 1));
 }
@@ -743,8 +671,7 @@ class Result {
     this.unknown.push(node);
   }
   addLinked(children) {
-    if (this.root !== this)
-      return this.root.addLinked(children);
+    if (this.root !== this) return this.root.addLinked(children);
     this.linked = this.linked || [];
     add(this.linked, children);
   }
@@ -786,10 +713,8 @@ function sliceNode(graph, query, result) {
     }
   } else if (isBranch(graph) && isBranch(query)) {
     const { known, unknown } = slice(graph.children, query.children, root);
-    if (known)
-      result.addKnown({ ...graph, children: known });
-    if (unknown)
-      result.addUnknown({ ...query, children: unknown });
+    if (known) result.addKnown({ ...graph, children: known });
+    if (unknown) result.addUnknown({ ...query, children: unknown });
   } else if (isLink(graph)) {
     result.addKnown(graph);
     if (graph.prefix && isRange(query)) {
@@ -821,17 +746,14 @@ function sliceRange(graph, query, result) {
   const step = cmp(key, end) < 0 ? 1 : -1;
   if (isMinKey(graph[0].key) && graph[0].prefix && graph[0].children) {
     const { known, unknown } = slice(graph[0].children, [query], result.root);
-    if (known)
-      result.addKnown({ ...graph[0], children: known });
-    if (unknown)
-      result.addUnknown({ ...query[0], children: unknown });
+    if (known) result.addKnown({ ...graph[0], children: known });
+    if (unknown) result.addUnknown({ ...query[0], children: unknown });
     return;
   }
   if (cmp(key, end) < 0) {
     for (let i = findFirst(graph, key); cmp(key, end) <= 0 && limit > 0; i++) {
       const node = graph[i];
-      if (!node || cmp(key, node.key) < 0 || isOlder(node, version))
-        break;
+      if (!node || cmp(key, node.key) < 0 || isOlder(node, version)) break;
       if (isRange(node)) {
         result.addKnown(getOverlap(node, key, end));
       } else {
@@ -860,8 +782,7 @@ function sliceRange(graph, query, result) {
   }
 }
 function getOverlap(node, key, end) {
-  if (cmp(node.key, key) >= 0 && cmp(node.end, end) <= 0)
-    return node;
+  if (cmp(node.key, key) >= 0 && cmp(node.end, end) <= 0) return node;
   return {
     ...node,
     key: cmp(node.key, key) > 0 ? node.key : key,
@@ -916,8 +837,7 @@ function insertRange(current, change, result, start = 0) {
       version: change.version
     });
   }
-  if (appliedChange.length)
-    result.push(...appliedChange);
+  if (appliedChange.length) result.push(...appliedChange);
   const insertions = [change];
   for (let i = keyIx; i < endIx; i++) {
     const node = current[i];
@@ -931,8 +851,7 @@ function insertRange(current, change, result, start = 0) {
   return keyIx + insertions.length - 1;
 }
 function mergeRanges(base, node) {
-  if (node.version < base.version)
-    [node, base] = [base, node];
+  if (node.version < base.version) [node, base] = [base, node];
   return [
     cmp(base.key, node.key) < 0 && { ...base, end: keyBefore(node.key) },
     node,
@@ -953,8 +872,7 @@ function insertNodeIntoRange(current, index, change, result) {
   const range = current[index];
   const newChange = getNewerChange(change, range);
   const newNode = getNewerNode(change, range);
-  if (!newChange)
-    return;
+  if (!newChange) return;
   result.push(newChange);
   const insertions = [
     cmp(range.key, key) < 0 && { ...range, end: keyBefore(key) },
@@ -970,18 +888,15 @@ function updateNode(current, index, change, result) {
     const nextResult = [];
     node.version = change.version;
     sieve(node.children, change.children, nextResult);
-    if (nextResult.length)
-      result.push({ ...change, children: nextResult });
+    if (nextResult.length) result.push({ ...change, children: nextResult });
   } else if (isBranch(node)) {
     const newNode = getNewerNode(node, change);
     current[index] = newNode || change;
-    if (!newNode)
-      result.push(change);
+    if (!newNode) result.push(change);
   } else {
     const newChange = getNewerChange(change, node);
     const newNode = getNewerNode(change, node);
-    if (newNode)
-      current[index] = newNode;
+    if (newNode) current[index] = newNode;
     if (newChange && (change.value !== node.value || !isPathEqual(change.path, node.path))) {
       result.push(newChange);
     }
@@ -989,15 +904,11 @@ function updateNode(current, index, change, result) {
   return index + 1;
 }
 function isPathEqual(first, second) {
-  if (!(first || second))
-    return true;
-  if (!(first && second))
-    return false;
-  if (first.length !== second.length)
-    return false;
+  if (!(first || second)) return true;
+  if (!(first && second)) return false;
+  if (first.length !== second.length) return false;
   for (let i = 0; i < first.length; i++) {
-    if (first[i] !== second[i])
-      return false;
+    if (first[i] !== second[i]) return false;
   }
   return true;
 }
@@ -1021,10 +932,8 @@ function getNewerChange(node, base) {
 }
 function setVersion(graph, version, onlyIfZero = false) {
   for (const node of graph) {
-    if (!(onlyIfZero && node.version))
-      node.version = version;
-    if (node.children)
-      setVersion(node.children, version, onlyIfZero);
+    if (!(onlyIfZero && node.version)) node.version = version;
+    if (node.children) setVersion(node.children, version, onlyIfZero);
   }
   return graph;
 }
@@ -1033,8 +942,7 @@ function getKnown(graph, version = 0) {
   for (const { key, end, children } of graph) {
     const node = { key, version };
     if (end) {
-      if (cmp(end, key) !== 0)
-        node.end = end;
+      if (cmp(end, key) !== 0) node.end = end;
       node.value = 1;
     }
     if (children) {
@@ -1049,10 +957,8 @@ function getKnown(graph, version = 0) {
 function finalize(graph, query, version = Date.now()) {
   let result = [{ key: MIN_KEY, end: MAX_KEY, version: 0 }];
   merge(result, graph);
-  if (query)
-    result = slice(result, query).known || [];
-  if (version !== false)
-    result = setVersion(result, version, true);
+  if (query) result = slice(result, query).known || [];
+  if (version !== false) result = setVersion(result, version, true);
   return result;
 }
 const PRE_CHI_PUT = Symbol("PREFIX_CHILDREN_$PUT");
@@ -1063,10 +969,8 @@ function decode$1(nodes = [], { isGraph } = {}) {
     let allNums = true;
     function pushResult(...objects) {
       for (const object of objects) {
-        if (isDef(object) && !Number.isInteger(object.$key))
-          allNums = false;
-        if (isDef(object) && typeof object.$key !== "string")
-          allStrs = false;
+        if (isDef(object) && !Number.isInteger(object.$key)) allNums = false;
+        if (isDef(object) && typeof object.$key !== "string") allStrs = false;
       }
       result.push(...objects);
     }
@@ -1095,22 +999,17 @@ function decode$1(nodes = [], { isGraph } = {}) {
       return false;
     }
     for (const node of nodes2) {
-      if (isGraph && addPutRange(node))
-        continue;
+      if (isGraph && addPutRange(node)) continue;
       if (isPrefix(node)) {
         const decodedChildren = decodePrefixNode(node);
         if (PRE_CHI_PUT in decodedChildren) {
           prefixChildPuts.push(...decodedChildren[PRE_CHI_PUT]);
         }
         pushResult(...decodedChildren);
-      } else if (isGraph && isRange(node))
-        pushResult(decodeRangeNode(node));
-      else if (isBranch(node))
-        pushResult(decodeBranchNode(node));
-      else if (isLink(node))
-        pushResult(decodeLinkNode(node));
-      else
-        pushResult(decodeLeafNode(node));
+      } else if (isGraph && isRange(node)) pushResult(decodeRangeNode(node));
+      else if (isBranch(node)) pushResult(decodeBranchNode(node));
+      else if (isLink(node)) pushResult(decodeLinkNode(node));
+      else pushResult(decodeLeafNode(node));
     }
     if (allStrs || allNums && putRanges.length === 1 && cmp(putRanges[0].key, 0) === 0 && cmp(putRanges[0].end, Number.POSITIVE_INFINITY) === 0) {
       result = result.reduce(
@@ -1150,8 +1049,7 @@ function decode$1(nodes = [], { isGraph } = {}) {
   }
   function decodePrefixNode(node) {
     let args = decode$3(node);
-    if (!args)
-      args = {};
+    if (!args) args = {};
     if (typeof args === "string") {
       throw Error(`decode.unencoded_prefix: ${args}`);
     }
@@ -1224,12 +1122,9 @@ const REF = Symbol();
 const PRE = Symbol();
 function decorate(rootGraph, rootQuery) {
   function construct(plumGraph, query) {
-    if (plumGraph === null)
-      return null;
-    if (!isDef(plumGraph))
-      plumGraph = [];
-    if (query.$key)
-      query = [query];
+    if (plumGraph === null) return null;
+    if (!isDef(plumGraph)) plumGraph = [];
+    if (query.$key) query = [query];
     let graph;
     if (query.$ref) {
       const { $ref, ...props2 } = query;
@@ -1237,8 +1132,7 @@ function decorate(rootGraph, rootQuery) {
       const path = encode$2($ref);
       const targetPlumGraph = unwrap(rootGraph, path);
       if (targetPlumGraph) {
-        if (range)
-          targetPlumGraph[PRE] = filter;
+        if (range) targetPlumGraph[PRE] = filter;
         graph = construct(
           targetPlumGraph,
           range ? { $key: range, ...props2 } : props2
@@ -1272,8 +1166,7 @@ function decorate(rootGraph, rootQuery) {
           return subResult;
         });
       });
-      if (pageKey)
-        addPageMeta(graph, pageKey);
+      if (pageKey) addPageMeta(graph, pageKey);
     } else if (typeof query === "object") {
       graph = {};
       for (const prop in query) {
@@ -1302,27 +1195,21 @@ function decorate(rootGraph, rootQuery) {
   }
   function descend(children, $key) {
     const key = ArrayBuffer.isView($key) ? $key : encode$3($key).key;
-    if (!Array.isArray(children))
-      return null;
+    if (!Array.isArray(children)) return null;
     const ix = findFirst(children, key);
     const node = children[ix];
-    if (!node)
-      return;
-    if (isRange(node) && node.end >= key)
-      return null;
-    if (cmp(node.key, key) !== 0)
-      return;
+    if (!node) return;
+    if (isRange(node) && node.end >= key) return null;
+    if (cmp(node.key, key) !== 0) return;
     const result2 = getValue(node);
-    if (node.prefix)
-      result2[PRE] = $key;
+    if (node.prefix) result2[PRE] = $key;
     return result2;
   }
   function getValue(node) {
     let result2;
     if (node.path) {
       result2 = unwrap(rootGraph, node.path);
-      if (typeof result2 === "object" && result2)
-        result2[REF] = node.path;
+      if (typeof result2 === "object" && result2) result2[REF] = node.path;
     } else {
       result2 = getNodeValue(node);
     }
@@ -1341,33 +1228,26 @@ function decorate(rootGraph, rootQuery) {
     let result2;
     if (cmp(key, end) < 0) {
       for (let n = 0; i < children.length && n < limit; i++) {
-        if (!isRange(children[i]))
-          n++;
+        if (!isRange(children[i])) n++;
       }
       result2 = children.slice(ix, i);
     } else {
       for (let n = 0; i >= 0 && n < limit; i--) {
-        if (!isRange(children[i]))
-          n++;
+        if (!isRange(children[i])) n++;
       }
       result2 = children.slice(i + 1, ix + 1);
     }
-    if (children[REF])
-      result2[REF] = children[REF];
-    if (children[PRE])
-      result2[PRE] = children[PRE];
+    if (children[REF]) result2[REF] = children[REF];
+    if (children[PRE]) result2[PRE] = children[PRE];
     return result2;
   }
   const result = construct(rootGraph, rootQuery);
   return result;
 }
 function deValNull(graph) {
-  if (typeof graph !== "object" || !graph)
-    return graph;
-  if ("$val" in graph && graph.$val !== true)
-    return graph.$val;
-  for (const prop in graph)
-    graph[prop] = deValNull(graph[prop]);
+  if (typeof graph !== "object" || !graph) return graph;
+  if ("$val" in graph && graph.$val !== true) return graph.$val;
+  for (const prop in graph) graph[prop] = deValNull(graph[prop]);
   return graph;
 }
 function addPageMeta(graph, args) {
@@ -1420,8 +1300,7 @@ function decode(string, start = 0) {
   for (let i = start; i < string.length; i += 4) {
     let value = (getChar(string, i) << 18) + (getChar(string, i + 1) << 12) + (getChar(string, i + 2) << 6) + getChar(string, i + 3);
     for (let j = i * 3 / 4 + 2; j >= i * 3 / 4; j--) {
-      if (j < view.byteLength)
-        view.setUint8(j, value & 255);
+      if (j < view.byteLength) view.setUint8(j, value & 255);
       value = value >> 8 | 0;
     }
   }
@@ -1446,27 +1325,20 @@ function serializeKey(key) {
   return `\0${encode$1(key)}`;
 }
 function deserializeKey(key) {
-  if (key[0] === "\0")
-    return decode(key.slice(1));
+  if (key[0] === "\0") return decode(key.slice(1));
   return encode$4(key);
 }
 function pack(children, parentVersion) {
-  if (!Array.isArray(children))
-    return children;
+  if (!Array.isArray(children)) return children;
   const array = children.map(
     (node) => props.reduce(
       (array2, prop, i) => {
-        if (!(prop in node))
-          return array2;
+        if (!(prop in node)) return array2;
         let value = node[prop];
-        if (prop === "version" && value === parentVersion)
-          return array2;
-        if (prop === "children")
-          value = pack(value, node.version);
-        if (prop === "end")
-          value = serializeKey(value);
-        if (prop === "path")
-          value = value.map(serializeKey);
+        if (prop === "version" && value === parentVersion) return array2;
+        if (prop === "children") value = pack(value, node.version);
+        if (prop === "end") value = serializeKey(value);
+        if (prop === "path") value = value.map(serializeKey);
         array2[1] |= 1 << i;
         array2.push(value);
         return array2;
@@ -1477,20 +1349,15 @@ function pack(children, parentVersion) {
   return array;
 }
 function unpack(children, parentVersion) {
-  if (!Array.isArray(children))
-    return children;
+  if (!Array.isArray(children)) return children;
   const node = children.map(
     ([key, type, ...values]) => props.reduce(
       (node2, prop, i) => {
-        if (!(type & 1 << i))
-          return node2;
+        if (!(type & 1 << i)) return node2;
         let value = values.shift();
-        if (prop === "children")
-          value = unpack(value, node2.version);
-        if (prop === "end")
-          value = deserializeKey(value);
-        if (prop === "path")
-          value = value.map(deserializeKey);
+        if (prop === "children") value = unpack(value, node2.version);
+        if (prop === "end") value = deserializeKey(value);
+        if (prop === "path") value = value.map(deserializeKey);
         node2[prop] = value;
         return node2;
       },
@@ -1514,8 +1381,7 @@ function encode(value, { version, isGraph } = {}) {
   const combine = isGraph ? merge : add;
   function makeNode2(object, key, ver, parentPuts = []) {
     var _a2;
-    if (!isDef(object))
-      return;
+    if (!isDef(object)) return;
     const { $key, $ver, $ref, $val, $chi, $put, ...props2 } = object || {};
     if (typeof object === "object" && object && !Array.isArray(object)) {
       object = {
@@ -1532,10 +1398,8 @@ function encode(value, { version, isGraph } = {}) {
         ...props2
       };
     }
-    if (typeof object === "object" && object && isEmpty(object))
-      return;
-    if (isDef($ver))
-      ver = $ver;
+    if (typeof object === "object" && object && isEmpty(object)) return;
+    if (isDef($ver)) ver = $ver;
     if (isPlainObject($key)) {
       const [page, filter] = splitArgs($key);
       if (page) {
@@ -1544,19 +1408,16 @@ function encode(value, { version, isGraph } = {}) {
           object.$key = filter || {};
           object.$put = foundPuts;
           const node2 = makeNode2(object, key, ver);
-          if (!filter)
-            node2.key = MIN_KEY;
+          if (!filter) node2.key = MIN_KEY;
           node2.prefix = true;
           return node2;
         }
         if ((!isDef(key) || Number.isInteger(key)) && (filter || isDef(page.$cursor))) {
           object.$key = isDef(page.$cursor) ? page.$cursor : page;
           const wrapper = { $key: filter || {}, $chi: [object] };
-          if (isGraph)
-            wrapper.$put = foundPuts;
+          if (isGraph) wrapper.$put = foundPuts;
           const node2 = makeNode2(wrapper, key, ver);
-          if (!filter)
-            node2.key = MIN_KEY;
+          if (!filter) node2.key = MIN_KEY;
           node2.prefix = true;
           return node2;
         }
@@ -1582,8 +1443,7 @@ function encode(value, { version, isGraph } = {}) {
     } else if (isDef($put)) {
       classifyPut($put);
     }
-    if (isDef($key) && (Number.isInteger(key) || !isDef(key)))
-      key = $key;
+    if (isDef($key) && (Number.isInteger(key) || !isDef(key))) key = $key;
     const node = key === ROOT_KEY || !isDef(key) ? {} : encode$3(key);
     node.version = ver;
     if (object === null) {
@@ -1595,8 +1455,7 @@ function encode(value, { version, isGraph } = {}) {
       return node;
     } else if ($ref) {
       pushLink($ref, node.version, props2, $val, $chi);
-      if (!isGraph)
-        return;
+      if (!isGraph) return;
       node.path = encode$2($ref);
     } else if ($val === true) {
       node.value = Array.isArray(object) ? clone$1(object) : props2;
@@ -1621,16 +1480,12 @@ function encode(value, { version, isGraph } = {}) {
       const children = Object.keys(props2).sort().map((key2) => makeNode2(object[key2], key2, ver)).filter(Boolean);
       if (children.length) {
         node.children = children;
-      } else if (putRange.length)
-        ;
+      } else if (putRange.length) ;
       else if (isGraph) {
-        if (!(isDef($key) || isDef($put)))
-          return;
-        if (node.key && !node.end)
-          node.end = node.key;
+        if (!(isDef($key) || isDef($put))) return;
+        if (node.key && !node.end) node.end = node.key;
       } else {
-        if (!isDef($key))
-          return;
+        if (!isDef($key)) return;
         node.value = 1;
       }
     }
@@ -1649,8 +1504,7 @@ function encode(value, { version, isGraph } = {}) {
       return node;
     }
   }
-  if (value == null ? void 0 : value.$key)
-    value = [value];
+  if (value == null ? void 0 : value.$key) value = [value];
   const result = ((_a = makeNode2(value, ROOT_KEY, version)) == null ? void 0 : _a.children) || [];
   while (links.length) {
     combine(result, [links.pop()]);
@@ -1670,13 +1524,11 @@ async function* mergeStreams(...streams) {
   if (firstValues.some((value) => typeof value === "undefined")) {
     yield void 0;
     for (const value of firstValues) {
-      if (typeof value !== "undefined")
-        yield value;
+      if (typeof value !== "undefined") yield value;
     }
   } else {
     const merged = [];
-    for (const value of firstValues)
-      merge(merged, value);
+    for (const value of firstValues) merge(merged, value);
     yield merged;
   }
   yield* mergeIterators(streams);
@@ -1684,14 +1536,12 @@ async function* mergeStreams(...streams) {
 function makeWatcher() {
   const listeners = /* @__PURE__ */ new Set();
   function write(change) {
-    for (const push of listeners)
-      push(change);
+    for (const push of listeners) push(change);
   }
   function watch(...args) {
     return stream.makeStream((push, _end) => {
       listeners.add(push);
-      if (args.length)
-        Promise.resolve(args[0]).then(push);
+      if (args.length) Promise.resolve(args[0]).then(push);
       return () => listeners.delete(push);
     });
   }
@@ -1722,15 +1572,13 @@ function cloneObject(object) {
   const clone2 = {};
   for (const prop in object) {
     const value = cloneObject(object[prop]);
-    if (value === null)
-      continue;
+    if (value === null) continue;
     clone2[prop] = value;
   }
   return isEmpty(clone2) ? null : clone2;
 }
 function wrapObject(object, path) {
-  if (!Array.isArray(path))
-    throw Error(`wrapObject.path_not_array ${path}`);
+  if (!Array.isArray(path)) throw Error(`wrapObject.path_not_array ${path}`);
   for (let i = path.length - 1; i >= 0; i--) {
     const $key = path[i];
     if (typeof $key === "string") {
@@ -1744,11 +1592,9 @@ function wrapObject(object, path) {
   return object;
 }
 function unwrapObject(object, path) {
-  if (!Array.isArray(path))
-    throw Error(`unwrapObject.path_not_array ${path}`);
+  if (!Array.isArray(path)) throw Error(`unwrapObject.path_not_array ${path}`);
   for (let i = 0; i < path.length; i++) {
-    if (!object || typeof object !== "object")
-      return;
+    if (!object || typeof object !== "object") return;
     const $key = path[i];
     if (typeof $key === "string") {
       if (Array.isArray(object)) {