aberdeen 0.2.4 → 0.5.0

package/dist/aberdeen.js

@@ -1,1756 +1,1199 @@
-let queueArray = [];
-let queueSet = new Set();
-let queueOrdered = true;
-let runQueueDepth = 0;
-let queueIndex;
+// src/helpers/reverseSortedSet.ts
+class ReverseSortedSet {
+  keyProp;
+  tail;
+  symbols;
+  constructor(keyProp) {
+    this.keyProp = keyProp;
+    this.tail = {};
+    this.symbols = [Symbol(0)];
+  }
+  add(item) {
+    if (this.symbols[0] in item)
+      return false;
+    const level = 1 + (Math.clz32(Math.random() * 4294967295) >> 2);
+    for (let l = this.symbols.length;l < level; l++)
+      this.symbols.push(Symbol(l));
+    const keyProp = this.keyProp;
+    const key = item[keyProp];
+    let prev;
+    let current = this.tail;
+    for (let l = this.symbols.length - 1;l >= 0; l--) {
+      const symbol = this.symbols[l];
+      while ((prev = current[symbol]) && prev[keyProp] > key)
+        current = prev;
+      if (l < level) {
+        item[symbol] = current[symbol];
+        current[symbol] = item;
+      }
+    }
+    return true;
+  }
+  has(item) {
+    return this.symbols[0] in item;
+  }
+  fetchLast() {
+    let item = this.tail[this.symbols[0]];
+    if (item) {
+      this.remove(item);
+      return item;
+    }
+  }
+  isEmpty() {
+    return this.tail[this.symbols[0]] === undefined;
+  }
+  get(indexValue) {
+    const keyProp = this.keyProp;
+    let current = this.tail;
+    let prev;
+    for (let l = this.symbols.length - 1;l >= 0; l--) {
+      const symbol = this.symbols[l];
+      while ((prev = current[symbol]) && prev[keyProp] > indexValue)
+        current = prev;
+    }
+    return current[this.symbols[0]]?.[keyProp] === indexValue ? current[this.symbols[0]] : undefined;
+  }
+  *[Symbol.iterator]() {
+    let symbol = this.symbols[0];
+    let node = this.tail[symbol];
+    while (node) {
+      yield node;
+      node = node[symbol];
+    }
+  }
+  prev(item) {
+    return item[this.symbols[0]];
+  }
+  remove(item) {
+    if (!(this.symbols[0] in item))
+      return false;
+    const keyProp = this.keyProp;
+    const prop = item[keyProp];
+    let prev;
+    let current = this.tail;
+    for (let l = this.symbols.length - 1;l >= 0; l--) {
+      const symbol = this.symbols[l];
+      while ((prev = current[symbol]) && prev[keyProp] >= prop && prev !== item)
+        current = prev;
+      if (prev === item) {
+        current[symbol] = prev[symbol];
+        delete prev[symbol];
+      }
+    }
+    return prev === item;
+  }
+  clear() {
+    const symbol = this.symbols[0];
+    let current = this.tail;
+    while (current) {
+      const prev = current[symbol];
+      for (const symbol2 of this.symbols) {
+        if (!(symbol2 in current))
+          break;
+        delete current[symbol2];
+      }
+      current = prev;
+    }
+    this.tail = {};
+  }
+}
+
+// src/aberdeen.ts
+var sortedQueue;
+var runQueueDepth = 0;
+var topRedrawScope;
 function queue(runner) {
-    if (queueSet.has(runner))
-        return;
-    if (runQueueDepth > 42) {
-        throw new Error("Too many recursive updates from observes");
-    }
-    if (!queueArray.length) {
-        setTimeout(runQueue, 0);
-    }
-    else if (runner._queueOrder < queueArray[queueArray.length - 1]._queueOrder) {
-        queueOrdered = false;
-    }
-    queueArray.push(runner);
-    queueSet.add(runner);
+  if (!sortedQueue) {
+    sortedQueue = new ReverseSortedSet("prio");
+    setTimeout(runQueue, 0);
+  } else if (!(runQueueDepth & 1)) {
+    runQueueDepth++;
+    if (runQueueDepth > 98) {
+      throw new Error("Too many recursive updates from observes");
+    }
+  }
+  sortedQueue.add(runner);
 }
 function runQueue() {
-    onCreateEnabled = true;
-    for (queueIndex = 0; queueIndex < queueArray.length;) {
-        // Sort queue if new unordered items have been added since last time.
-        if (!queueOrdered) {
-            queueArray.splice(0, queueIndex);
-            queueIndex = 0;
-            // Order queued observers by depth, lowest first.
-            queueArray.sort((a, b) => a._queueOrder - b._queueOrder);
-            queueOrdered = true;
-        }
-        // Process the rest of what's currently in the queue.
-        let batchEndIndex = queueArray.length;
-        for (; queueIndex < batchEndIndex && queueOrdered; queueIndex++) {
-            let runner = queueArray[queueIndex];
-            queueSet.delete(runner);
-            runner._queueRun();
-        }
-        // If new items have been added to the queue while processing the previous
-        // batch, we'll need to run this loop again.
-        runQueueDepth++;
-    }
-    queueArray.length = 0;
-    queueIndex = undefined;
-    runQueueDepth = 0;
-    onCreateEnabled = false;
+  let time = Date.now();
+  while (sortedQueue) {
+    const runner = sortedQueue.fetchLast();
+    if (!runner)
+      break;
+    if (runQueueDepth & 1)
+      runQueueDepth++;
+    runner.queueRun();
+  }
+  sortedQueue = undefined;
+  runQueueDepth = 0;
+  time = Date.now() - time;
+  if (time > 1)
+    console.debug(`Aberdeen queue took ${time}ms`);
 }
-/**
- * Schedule a DOM read operation to be executed in Aberdeen's internal task queue.
- *
- * This function is used to batch DOM read operations together, avoiding unnecessary
- * layout recalculations and improving browser performance. A DOM read operation should
- * only *read* from the DOM, such as measuring element dimensions or retrieving computed styles.
- *
- * By batching DOM reads separately from DOM writes, this prevents the browser from
- * interleaving layout reads and writes, which can force additional layout recalculations.
- * This helps reduce visual glitches and flashes by ensuring the browser doesn't render
- * intermediate DOM states during updates.
- *
- * Unlike `setTimeout` or `requestAnimationFrame`, this mechanism ensures that DOM read
- * operations happen before any DOM writes in the same queue cycle, minimizing layout thrashing.
- *
- * @param func The function to be executed as a DOM read operation.
- */
-export function scheduleDomReader(func) {
-    let order = (queueIndex != null && queueIndex < queueArray.length && queueArray[queueIndex]._queueOrder >= 1000) ? ((queueArray[queueIndex]._queueOrder + 1) & (~1)) : 1000;
-    queue({ _queueOrder: order, _queueRun: func });
+function partToStr(part) {
+  if (typeof part === "string") {
+    return part + "\x01";
+  }
+  let result = "";
+  let num = Math.abs(Math.round(part));
+  const negative = part < 0;
+  while (num > 0) {
+    result += String.fromCharCode(negative ? 65534 - num % 65533 : 2 + num % 65533);
+    num = Math.floor(num / 65533);
+  }
+  return String.fromCharCode(128 + (negative ? -result.length : result.length)) + result;
 }
-/**
- * Schedule a DOM write operation to be executed in Aberdeen's internal task queue.
- *
- * This function is used to batch DOM write operations together, avoiding unnecessary
- * layout recalculations and improving browser performance. A DOM write operation should
- * only *write* to the DOM, such as modifying element properties or applying styles.
- *
- * By batching DOM writes separately from DOM reads, this prevents the browser from
- * interleaving layout reads and writes, which can force additional layout recalculations.
- * This helps reduce visual glitches and flashes by ensuring the browser doesn't render
- * intermediate DOM states during updates.
- *
- * Unlike `setTimeout` or `requestAnimationFrame`, this mechanism ensures that DOM write
- * operations happen after all DOM reads in the same queue cycle, minimizing layout thrashing.
- *
- * @param func The function to be executed as a DOM write operation.
- */
-export function scheduleDomWriter(func) {
-    let order = (queueIndex != null && queueIndex < queueArray.length && queueArray[queueIndex]._queueOrder >= 1000) ? (queueArray[queueIndex]._queueOrder | 1) : 1001;
-    queue({ _queueOrder: order, _queueRun: func });
+function invertString(input) {
+  let result = "";
+  for (let i = 0;i < input.length; i++) {
+    result += String.fromCodePoint(65535 - input.charCodeAt(i));
+  }
+  return result;
 }
-/**
- * Given an integer number, a string or an array of these, this function returns a string that can be used
- * to compare items in a natural sorting order. So `[3, 'ab']` should be smaller than `[3, 'ac']`.
- * The resulting string is guaranteed to never be empty.
- */
-function sortKeyToString(key) {
-    if (key instanceof Array) {
-        return key.map(partToStr).join('');
-    }
-    else {
-        return partToStr(key);
-    }
+var lastPrio = 0;
+
+class Scope {
+  prio = --lastPrio;
+  remove() {
+    const lastNode = this.getLastNode();
+    if (lastNode)
+      removeNodes(lastNode, this.getPrecedingNode());
+    this.delete();
+  }
 }
-function partToStr(part) {
-    if (typeof part === 'string') {
-        return part + '\x01';
-    }
-    else {
-        let result = numToString(Math.abs(Math.round(part)), part < 0);
-        // Prefix the number of digits, counting down from 128 for negative and up for positive
-        return String.fromCharCode(128 + (part > 0 ? result.length : -result.length)) + result;
-    }
+
+class ContentScope extends Scope {
+  cleaners;
+  constructor(cleaners = []) {
+    super();
+    this.cleaners = cleaners;
+  }
+  lastChild;
+  redraw() {}
+  getLastNode() {
+    return findLastNodeInPrevSiblings(this.lastChild);
+  }
+  delete() {
+    for (let cleaner of this.cleaners) {
+      if (typeof cleaner === "function")
+        cleaner();
+      else
+        cleaner.delete(this);
+    }
+    this.cleaners.length = 0;
+    sortedQueue?.remove(this);
+    this.lastChild = undefined;
+  }
+  queueRun() {
+    this.remove();
+    topRedrawScope = this;
+    this.redraw();
+    topRedrawScope = undefined;
+  }
+  getInsertAfterNode() {
+    return this.getLastNode() || this.getPrecedingNode();
+  }
+  onChange(index, newData, oldData) {
+    queue(this);
+  }
+  getChildPrevSibling() {
+    return this.lastChild;
+  }
 }
-function numToString(num, neg) {
-    let result = '';
-    while (num > 0) {
-        /*
-        * We're reserving a few character codes:
-        * 0 - for compatibility
-        * 1 - separator between array items
-        * 65535 - for compatibility
-        */
-        result += String.fromCharCode(neg ? 65535 - (num % 65533) : 2 + (num % 65533));
-        num = Math.floor(num / 65533);
-    }
-    return result;
+
+class ChainedScope extends ContentScope {
+  parentElement;
+  prevSibling;
+  constructor(parentElement, useParentCleaners = false) {
+    super(useParentCleaners ? currentScope.cleaners : []);
+    this.parentElement = parentElement;
+    if (parentElement === currentScope.parentElement) {
+      this.prevSibling = currentScope.getChildPrevSibling();
+      currentScope.lastChild = this;
+    }
+    if (!useParentCleaners)
+      currentScope.cleaners.push(this);
+  }
+  getPrecedingNode() {
+    return findLastNodeInPrevSiblings(this.prevSibling);
+  }
+  getChildPrevSibling() {
+    return this.lastChild || this.prevSibling;
+  }
 }
-/*
- * Scope
- * @internal
- *
- * A `Scope` is created with a `render` function that is run initially,
- * and again when any of the `Store`s that this function reads are changed. Any
- * DOM elements that is given a `render` function for its contents has its own scope.
- * The `Scope` manages the position in the DOM tree elements created by `render`
- * are inserted at. Before a rerender, all previously created elements are removed
- * and the `clean` functions for the scope and all sub-scopes are called.
- */
-class Scope {
-    constructor(parentElement, precedingSibling, queueOrder) {
-        // The list of clean functions to be called when this scope is cleaned. These can
-        // be for child scopes, subscriptions as well as `clean(..)` hooks.
-        this._cleaners = [];
-        // Set to true after the scope has been cleaned, causing any spurious reruns to
-        // be ignored.
-        this._isDead = false;
-        this._parentElement = parentElement;
-        this._precedingSibling = precedingSibling;
-        this._queueOrder = queueOrder;
-    }
-    // Get a reference to the last Node preceding this Scope, or undefined if there is none
-    _findPrecedingNode(stopAt = undefined) {
-        let cur = this;
-        let pre;
-        while ((pre = cur._precedingSibling) && pre !== stopAt) {
-            if (pre instanceof Node)
-                return pre;
-            let node = pre._findLastNode();
-            if (node)
-                return node;
-            cur = pre;
-        }
-    }
-    // Get a reference to the last Node within this scope and parentElement
-    _findLastNode() {
-        if (this._lastChild) {
-            if (this._lastChild instanceof Node)
-                return this._lastChild;
-            else
-                return this._lastChild._findLastNode() || this._lastChild._findPrecedingNode(this._precedingSibling);
-        }
-    }
-    _addNode(node) {
-        if (!this._parentElement)
-            throw new ScopeError(true);
-        let prevNode = this._findLastNode() || this._findPrecedingNode();
-        this._parentElement.insertBefore(node, prevNode ? prevNode.nextSibling : this._parentElement.firstChild);
-        this._lastChild = node;
-    }
-    _remove() {
-        if (this._parentElement) {
-            let lastNode = this._findLastNode();
-            if (lastNode) {
-                // at least one DOM node to be removed
-                let nextNode = this._findPrecedingNode();
-                nextNode = (nextNode ? nextNode.nextSibling : this._parentElement.firstChild);
-                this._lastChild = undefined;
-                // Keep removing DOM nodes starting at our first node, until we encounter the last node
-                while (true) {
-                    /* c8 ignore next */
-                    if (!nextNode)
-                        return internalError(1);
-                    const node = nextNode;
-                    nextNode = node.nextSibling || undefined;
-                    let onDestroy = onDestroyMap.get(node);
-                    if (onDestroy && node instanceof Element) {
-                        if (onDestroy !== true) {
-                            if (typeof onDestroy === 'function') {
-                                onDestroy(node);
-                            }
-                            else {
-                                destroyWithClass(node, onDestroy);
-                            }
-                            // This causes the element to be ignored from this function from now on:
-                            onDestroyMap.set(node, true);
-                        }
-                        // Ignore the deleting element
-                    }
-                    else {
-                        this._parentElement.removeChild(node);
-                    }
-                    if (node === lastNode)
-                        break;
-                }
-            }
-        }
-        // run cleaners
-        this._clean();
-    }
-    _clean() {
-        this._isDead = true;
-        for (let cleaner of this._cleaners) {
-            cleaner._clean(this);
-        }
-        this._cleaners.length = 0;
-    }
-    _onChange(index, newData, oldData) {
-        queue(this);
+
+class RegularScope extends ChainedScope {
+  renderer;
+  constructor(parentElement, renderer) {
+    super(parentElement);
+    this.renderer = renderer;
+    this.redraw();
+  }
+  redraw() {
+    let savedScope = currentScope;
+    currentScope = this;
+    try {
+      this.renderer();
+    } catch (e) {
+      handleError(e, true);
     }
+    currentScope = savedScope;
+  }
 }
-class SimpleScope extends Scope {
-    constructor(parentElement, precedingSibling, queueOrder, renderer) {
-        super(parentElement, precedingSibling, queueOrder);
-        this._renderer = renderer;
-    }
-    _queueRun() {
-        /* c8 ignore next */
-        if (currentScope)
-            internalError(2);
-        if (this._isDead)
-            return;
-        this._remove();
-        this._isDead = false;
-        this._update();
-    }
-    _update() {
-        let savedScope = currentScope;
-        currentScope = this;
-        try {
-            this._renderer();
-        }
-        catch (e) {
-            // Throw the error async, so the rest of the rendering can continue
-            handleError(e);
-        }
-        currentScope = savedScope;
-    }
+
+class RootScope extends ContentScope {
+  parentElement = document.body;
+  getPrecedingNode() {
+    return;
+  }
 }
-let immediateQueue = new Set();
-class ImmediateScope extends SimpleScope {
-    _onChange(index, newData, oldData) {
-        immediateQueue.add(this);
-    }
+
+class MountScope extends ContentScope {
+  parentElement;
+  renderer;
+  constructor(parentElement, renderer) {
+    super();
+    this.parentElement = parentElement;
+    this.renderer = renderer;
+    this.redraw();
+    currentScope.cleaners.push(this);
+  }
+  redraw() {
+    RegularScope.prototype.redraw.call(this);
+  }
+  getPrecedingNode() {
+    return;
+  }
+  delete() {
+    removeNodes(this.getLastNode(), this.getPrecedingNode());
+    super.delete();
+  }
+  remove() {
+    this.delete();
+  }
 }
-let immediateQueuerRunning = false;
-function runImmediateQueue() {
-    if (immediateQueuerRunning)
-        return;
-    for (let count = 0; immediateQueue.size; count++) {
-        if (count > 42) {
-            immediateQueue.clear();
-            throw new Error("Too many recursive updates from immediate-mode observes");
-        }
-        immediateQueuerRunning = true;
-        let copy = immediateQueue;
-        immediateQueue = new Set();
-        let savedScope = currentScope;
-        currentScope = undefined;
-        try {
-            for (const scope of copy) {
-                scope._queueRun();
-            }
-        }
-        finally {
-            currentScope = savedScope;
-            immediateQueuerRunning = false;
-        }
-    }
+function removeNodes(node, preNode) {
+  while (node && node !== preNode) {
+    const prevNode = node.previousSibling;
+    let onDestroy = onDestroyMap.get(node);
+    if (onDestroy && node instanceof Element) {
+      if (onDestroy !== true) {
+        if (typeof onDestroy === "function") {
+          onDestroy(node);
+        } else {
+          destroyWithClass(node, onDestroy);
+        }
+        onDestroyMap.set(node, true);
+      }
+    } else {
+      node.remove();
+    }
+    node = prevNode;
+  }
 }
-class IsEmptyObserver {
-    constructor(scope, collection, triggerCount) {
-        this.scope = scope;
-        this.collection = collection;
-        this.triggerCount = triggerCount;
-        this.count = collection._getCount();
-        collection._addObserver(ANY_INDEX, this);
-        scope._cleaners.push(this);
-    }
-    _onChange(index, newData, oldData) {
-        if (newData === undefined) {
-            // oldData is guaranteed not to be undefined
-            if (this.triggerCount || !--this.count)
-                queue(this.scope);
-        }
-        else if (oldData === undefined) {
-            if (this.triggerCount || !this.count++)
-                queue(this.scope);
-        }
+function findLastNodeInPrevSiblings(sibling) {
+  if (!sibling || sibling instanceof Node)
+    return sibling;
+  return sibling.getLastNode() || sibling.getPrecedingNode();
+}
+
+class ResultScope extends ChainedScope {
+  renderer;
+  result = optProxy({ value: undefined });
+  constructor(parentElement, renderer) {
+    super(parentElement);
+    this.renderer = renderer;
+    this.redraw();
+  }
+  redraw() {
+    let savedScope = currentScope;
+    currentScope = this;
+    try {
+      this.result.value = this.renderer();
+    } catch (e) {
+      handleError(e, true);
     }
-    _clean() {
-        this.collection._removeObserver(ANY_INDEX, this);
+    currentScope = savedScope;
+  }
+}
+
+class SetArgScope extends ChainedScope {
+  key;
+  target;
+  constructor(parentElement, key, target) {
+    super(parentElement);
+    this.key = key;
+    this.target = target;
+    this.redraw();
+  }
+  redraw() {
+    let savedScope = currentScope;
+    currentScope = this;
+    applyArg(this.key, this.target.value);
+    currentScope = savedScope;
+  }
+}
+var immediateQueue = new ReverseSortedSet("prio");
+
+class ImmediateScope extends RegularScope {
+  onChange(index, newData, oldData) {
+    immediateQueue.add(this);
+  }
+}
+var immediateQueueRunning = false;
+function runImmediateQueue() {
+  for (let count = 0;!immediateQueue.isEmpty() && !immediateQueueRunning; count++) {
+    if (count > 42) {
+      immediateQueue.clear();
+      throw new Error("Too many immediate-mode recursive updates");
+    }
+    immediateQueueRunning = true;
+    let copy = immediateQueue;
+    immediateQueue = new ReverseSortedSet("prio");
+    try {
+      for (const scope of copy) {
+        scope.queueRun();
+      }
+    } finally {
+      immediateQueueRunning = false;
     }
+  }
 }
-/** @internal */
+
 class OnEachScope extends Scope {
-    constructor(parentElement, precedingSibling, queueOrder, collection, renderer, makeSortKey) {
-        super(parentElement, precedingSibling, queueOrder);
-        /** The ordered list of currently item scopes */
-        this._byPosition = [];
-        /** The item scopes in a Map by index */
-        this._byIndex = new Map();
-        /** Indexes that have been created/removed and need to be handled in the next `queueRun` */
-        this._newIndexes = new Set();
-        this._removedIndexes = new Set();
-        this._collection = collection;
-        this._renderer = renderer;
-        this._makeSortKey = makeSortKey;
-    }
-    // toString(): string {
-    // 	return `OnEachScope(collection=${this.collection})`
-    // }
-    _onChange(index, newData, oldData) {
-        if (oldData === undefined) {
-            if (this._removedIndexes.has(index)) {
-                this._removedIndexes.delete(index);
-            }
-            else {
-                this._newIndexes.add(index);
-                queue(this);
-            }
-        }
-        else if (newData === undefined) {
-            if (this._newIndexes.has(index)) {
-                this._newIndexes.delete(index);
-            }
-            else {
-                this._removedIndexes.add(index);
-                queue(this);
-            }
-        }
-    }
-    _queueRun() {
-        if (this._isDead)
-            return;
-        let indexes = this._removedIndexes;
-        this._removedIndexes = new Set();
-        indexes.forEach(index => {
-            this._removeChild(index);
-        });
-        indexes = this._newIndexes;
-        this._newIndexes = new Set();
-        indexes.forEach(index => {
-            this._addChild(index);
-        });
-    }
-    _clean() {
-        super._clean();
-        this._collection._observers.delete(this);
-        for (const [index, scope] of this._byIndex) {
-            scope._clean();
-        }
-        // Help garbage collection:
-        this._byPosition.length = 0;
-        this._byIndex.clear();
-    }
-    _renderInitial() {
-        /* c8 ignore next */
-        if (!currentScope)
-            return internalError(3);
-        let parentScope = currentScope;
-        this._collection._iterateIndexes(this);
-        currentScope = parentScope;
-    }
-    _addChild(itemIndex) {
-        let scope = new OnEachItemScope(this._parentElement, undefined, this._queueOrder + 1, this, itemIndex);
-        this._byIndex.set(itemIndex, scope);
-        scope._update();
-        // We're not adding a cleaner here, as we'll be calling them from our _clean function
-    }
-    _removeChild(itemIndex) {
-        let scope = this._byIndex.get(itemIndex);
-        /* c8 ignore next */
-        if (!scope)
-            return internalError(6);
-        scope._remove();
-        this._byIndex.delete(itemIndex);
-        this._removeFromPosition(scope);
-    }
-    _findPosition(sortStr) {
-        // In case of duplicate `sortStr`s, this will return the first match.
-        let items = this._byPosition;
-        let min = 0, max = items.length;
-        // Fast-path for elements that are already ordered (as is the case when working with arrays ordered by index)
-        if (!max || sortStr > items[max - 1]._sortStr)
-            return max;
-        // Binary search for the insert position		
-        while (min < max) {
-            let mid = (min + max) >> 1;
-            if (items[mid]._sortStr < sortStr) {
-                min = mid + 1;
-            }
-            else {
-                max = mid;
-            }
-        }
-        return min;
-    }
-    _insertAtPosition(child) {
-        let pos = this._findPosition(child._sortStr);
-        this._byPosition.splice(pos, 0, child);
-        // Based on the position in the list, set the precedingSibling for the new Scope
-        // and for the next sibling.
-        let nextSibling = this._byPosition[pos + 1];
-        if (nextSibling) {
-            child._precedingSibling = nextSibling._precedingSibling;
-            nextSibling._precedingSibling = child;
-        }
-        else {
-            child._precedingSibling = this._lastChild || this._precedingSibling;
-            this._lastChild = child;
-        }
-    }
-    _removeFromPosition(child) {
-        if (child._sortStr === '')
-            return;
-        let pos = this._findPosition(child._sortStr);
-        while (true) {
-            if (this._byPosition[pos] === child) {
-                // Yep, this is the right scope
-                this._byPosition.splice(pos, 1);
-                if (pos < this._byPosition.length) {
-                    let nextSibling = this._byPosition[pos];
-                    /* c8 ignore next */
-                    if (!nextSibling)
-                        return internalError(8);
-                    /* c8 ignore next */
-                    if (nextSibling._precedingSibling !== child)
-                        return internalError(13);
-                    nextSibling._precedingSibling = child._precedingSibling;
-                }
-                else {
-                    /* c8 ignore next */
-                    if (child !== this._lastChild)
-                        return internalError(12);
-                    this._lastChild = child._precedingSibling === this._precedingSibling ? undefined : child._precedingSibling;
-                }
-                return;
-            }
-            // There may be another Scope with the same sortStr
-            /* c8 ignore next */
-            if (++pos >= this._byPosition.length || this._byPosition[pos]._sortStr !== child._sortStr)
-                return internalError(5);
-        }
-    }
+  renderer;
+  makeSortKey;
+  parentElement = currentScope.parentElement;
+  prevSibling;
+  target;
+  byIndex = new Map;
+  sortedSet = new ReverseSortedSet("sortKey");
+  changedIndexes = new Set;
+  constructor(proxy, renderer, makeSortKey) {
+    super();
+    this.renderer = renderer;
+    this.makeSortKey = makeSortKey;
+    const target = this.target = proxy[TARGET_SYMBOL] || proxy;
+    subscribe(target, ANY_SYMBOL, this);
+    this.prevSibling = currentScope.getChildPrevSibling();
+    currentScope.lastChild = this;
+    currentScope.cleaners.push(this);
+    if (target instanceof Array) {
+      for (let i = 0;i < target.length; i++) {
+        if (target[i] !== undefined) {
+          new OnEachItemScope(this, i, false);
+        }
+      }
+    } else {
+      for (const key in target) {
+        if (target[key] !== undefined) {
+          new OnEachItemScope(this, key, false);
+        }
+      }
+    }
+  }
+  getPrecedingNode() {
+    return findLastNodeInPrevSiblings(this.prevSibling);
+  }
+  onChange(index, newData, oldData) {
+    if (!(this.target instanceof Array) || typeof index === "number")
+      this.changedIndexes.add(index);
+    queue(this);
+  }
+  queueRun() {
+    let indexes = this.changedIndexes;
+    this.changedIndexes = new Set;
+    for (let index of indexes) {
+      const oldScope = this.byIndex.get(index);
+      if (oldScope)
+        oldScope.remove();
+      if (this.target[index] === undefined) {
+        this.byIndex.delete(index);
+      } else {
+        new OnEachItemScope(this, index, true);
+      }
+    }
+    topRedrawScope = undefined;
+  }
+  delete() {
+    for (const scope of this.byIndex.values()) {
+      scope.delete();
+    }
+    this.byIndex.clear();
+    setTimeout(() => {
+      this.sortedSet.clear();
+    }, 1);
+  }
+  getLastNode() {
+    for (let scope of this.sortedSet) {
+      const node = scope.getActualLastNode();
+      if (node)
+        return node;
+    }
+  }
 }
-/** @internal */
-class OnEachItemScope extends Scope {
-    constructor(parentElement, precedingSibling, queueOrder, parent, itemIndex) {
-        super(parentElement, precedingSibling, queueOrder);
-        this._sortStr = "";
-        this._parent = parent;
-        this._itemIndex = itemIndex;
-    }
-    // toString(): string {
-    // 	return `OnEachItemScope(itemIndex=${this.itemIndex} parentElement=${this.parentElement} parent=${this.parent} precedingSibling=${this.precedingSibling} lastChild=${this.lastChild})`
-    // }
-    _queueRun() {
-        /* c8 ignore next */
-        if (currentScope)
-            internalError(4);
-        if (this._isDead)
-            return;
-        this._remove();
-        this._isDead = false;
-        this._update();
-    }
-    _update() {
-        // Have the makeSortKey function return an ordering int/string/array.
-        // Since makeSortKey may get() the Store, we'll need to set currentScope first.
-        let savedScope = currentScope;
-        currentScope = this;
-        let itemStore = new Store(this._parent._collection, this._itemIndex);
-        let sortKey;
-        try {
-            sortKey = this._parent._makeSortKey(itemStore);
-        }
-        catch (e) {
-            handleError(e);
-        }
-        let oldSortStr = this._sortStr;
-        let newSortStr = sortKey == null ? '' : sortKeyToString(sortKey);
-        if (oldSortStr !== '' && oldSortStr !== newSortStr) {
-            this._parent._removeFromPosition(this);
-        }
-        this._sortStr = newSortStr;
-        if (newSortStr !== '') {
-            if (newSortStr !== oldSortStr) {
-                this._parent._insertAtPosition(this);
-            }
-            try {
-                this._parent._renderer(itemStore);
-            }
-            catch (e) {
-                handleError(e);
-            }
-        }
-        currentScope = savedScope;
-    }
+
+class OnEachItemScope extends ContentScope {
+  parent;
+  itemIndex;
+  sortKey;
+  parentElement;
+  constructor(parent, itemIndex, topRedraw) {
+    super();
+    this.parent = parent;
+    this.itemIndex = itemIndex;
+    this.parentElement = parent.parentElement;
+    this.parent.byIndex.set(this.itemIndex, this);
+    this.lastChild = this;
+    if (topRedraw)
+      topRedrawScope = this;
+    this.redraw();
+  }
+  getPrecedingNode() {
+    this.parent.sortedSet.add(this);
+    const preScope = this.parent.sortedSet.prev(this);
+    if (preScope)
+      return findLastNodeInPrevSiblings(preScope.lastChild);
+    return this.parent.getPrecedingNode();
+  }
+  getLastNode() {
+    return this.getPrecedingNode();
+  }
+  getActualLastNode() {
+    let child = this.lastChild;
+    while (child && child !== this) {
+      if (child instanceof Node)
+        return child;
+      const node = child.getLastNode();
+      if (node)
+        return node;
+      child = child.getPrecedingNode();
+    }
+  }
+  queueRun() {
+    if (currentScope !== ROOT_SCOPE)
+      internalError(4);
+    if (this.sortKey !== undefined) {
+      const lastNode = this.getActualLastNode();
+      if (lastNode)
+        removeNodes(lastNode, this.getPrecedingNode());
+    }
+    this.delete();
+    this.lastChild = this;
+    topRedrawScope = this;
+    this.redraw();
+    topRedrawScope = undefined;
+  }
+  redraw() {
+    const value = optProxy(this.parent.target[this.itemIndex]);
+    let savedScope = currentScope;
+    currentScope = this;
+    let sortKey;
+    try {
+      if (this.parent.makeSortKey) {
+        let rawSortKey = this.parent.makeSortKey(value, this.itemIndex);
+        if (rawSortKey != null)
+          sortKey = rawSortKey instanceof Array ? rawSortKey.map(partToStr).join("") : rawSortKey;
+      } else {
+        sortKey = this.itemIndex;
+      }
+      if (typeof sortKey === "number")
+        sortKey = partToStr(sortKey);
+      if (this.sortKey !== sortKey) {
+        this.parent.sortedSet.remove(this);
+        this.sortKey = sortKey;
+      }
+      if (sortKey != null)
+        this.parent.renderer(value, this.itemIndex);
+    } catch (e) {
+      handleError(e, sortKey != null);
+    }
+    currentScope = savedScope;
+  }
+  getInsertAfterNode() {
+    if (this.sortKey == null)
+      internalError(1);
+    return findLastNodeInPrevSiblings(this.lastChild);
+  }
+  remove() {
+    if (this.sortKey !== undefined) {
+      const lastNode = this.getActualLastNode();
+      if (lastNode)
+        removeNodes(lastNode, this.getPrecedingNode());
+      this.parent.sortedSet.remove(this);
+      this.sortKey = undefined;
+    }
+    this.delete();
+  }
 }
-/**
- * This global is set during the execution of a `Scope.render`. It is used by
- * functions like `node`, `text` and `clean`.
- */
-let currentScope;
-/**
- * A special Node observer index to subscribe to any value in the map changing.
- */
-const ANY_INDEX = {};
-/** @internal */
-export class ObsCollection {
-    constructor() {
-        this._observers = new Map();
-    }
-    // toString(): string {
-    // 	return JSON.stringify(peek(() => this.getRecursive(3)))
-    // }
-    _addObserver(index, observer) {
-        observer = observer;
-        let obsSet = this._observers.get(index);
-        if (obsSet) {
-            if (obsSet.has(observer))
-                return false;
-            obsSet.add(observer);
-        }
-        else {
-            this._observers.set(index, new Set([observer]));
-        }
-        return true;
-    }
-    _removeObserver(index, observer) {
-        let obsSet = this._observers.get(index);
-        obsSet.delete(observer);
-    }
-    emitChange(index, newData, oldData) {
-        let obsSet = this._observers.get(index);
-        if (obsSet)
-            obsSet.forEach(observer => observer._onChange(index, newData, oldData));
-        obsSet = this._observers.get(ANY_INDEX);
-        if (obsSet)
-            obsSet.forEach(observer => observer._onChange(index, newData, oldData));
-    }
-    _clean(observer) {
-        this._removeObserver(ANY_INDEX, observer);
-    }
-    _setIndex(index, newValue, deleteMissing) {
-        const curData = this.rawGet(index);
-        if (!(curData instanceof ObsCollection) || newValue instanceof Store || !curData._merge(newValue, deleteMissing)) {
-            let newData = valueToData(newValue);
-            if (newData !== curData) {
-                this.rawSet(index, newData);
-                this.emitChange(index, newData, curData);
-            }
-        }
-    }
+function addNode(node) {
+  const parentEl = currentScope.parentElement;
+  const prevNode = currentScope.getInsertAfterNode();
+  parentEl.insertBefore(node, prevNode ? prevNode.nextSibling : parentEl.firstChild);
+  currentScope.lastChild = node;
 }
-/** @internal */
-class ObsArray extends ObsCollection {
-    constructor() {
-        super(...arguments);
-        this._data = [];
-    }
-    _getType() {
-        return "array";
-    }
-    _getRecursive(depth) {
-        if (currentScope) {
-            if (this._addObserver(ANY_INDEX, currentScope)) {
-                currentScope._cleaners.push(this);
-            }
-        }
-        let result = [];
-        for (let i = 0; i < this._data.length; i++) {
-            let v = this._data[i];
-            result.push(v instanceof ObsCollection ? (depth ? v._getRecursive(depth - 1) : new Store(this, i)) : v);
-        }
-        return result;
-    }
-    rawGet(index) {
-        return this._data[index];
-    }
-    rawSet(index, newData) {
-        if (index !== (0 | index) || index < 0 || index > 999999) {
-            throw new Error(`Invalid array index ${JSON.stringify(index)}`);
-        }
-        this._data[index] = newData;
-        // Remove trailing `undefined`s
-        while (this._data.length > 0 && this._data[this._data.length - 1] === undefined) {
-            this._data.pop();
-        }
-    }
-    _merge(newValue, deleteMissing) {
-        if (!(newValue instanceof Array)) {
-            return false;
-        }
-        // newValue is an array
-        for (let i = 0; i < newValue.length; i++) {
-            this._setIndex(i, newValue[i], deleteMissing);
-        }
-        // Overwriting just the first elements of an array and leaving the rest of
-        // the old data in place is just weird and unexpected, so we'll always use
-        // 'replace' behavior for arrays.
-        if ( /*deleteMissing &&*/this._data.length > newValue.length) {
-            for (let i = newValue.length; i < this._data.length; i++) {
-                let old = this._data[i];
-                if (old !== undefined) {
-                    this.emitChange(i, undefined, old);
-                }
-            }
-            this._data.length = newValue.length;
-        }
-        return true;
-    }
-    _iterateIndexes(scope) {
-        for (let i = 0; i < this._data.length; i++) {
-            if (this._data[i] !== undefined) {
-                scope._addChild(i);
-            }
-        }
-    }
-    _normalizeIndex(index) {
-        if (typeof index === 'number')
-            return index;
-        if (typeof index === 'string') {
-            // Convert to int
-            let num = 0 | index;
-            // Check if the number is still the same after conversion
-            if (index.length && num == index)
-                return index;
-        }
-        throw new Error(`Invalid array index ${JSON.stringify(index)}`);
-    }
-    _getCount() {
-        return this._data.length;
-    }
+var ROOT_SCOPE = new RootScope;
+var currentScope = ROOT_SCOPE;
+var ANY_SYMBOL = Symbol("any");
+var TARGET_SYMBOL = Symbol("target");
+var subscribers = new WeakMap;
+var peeking = 0;
+function subscribe(target, index, observer = currentScope) {
+  if (observer === ROOT_SCOPE || peeking)
+    return;
+  let byTarget = subscribers.get(target);
+  if (!byTarget)
+    subscribers.set(target, byTarget = new Map);
+  if (index !== ANY_SYMBOL && byTarget.get(ANY_SYMBOL)?.has(observer))
+    return;
+  let byIndex = byTarget.get(index);
+  if (!byIndex)
+    byTarget.set(index, byIndex = new Set);
+  if (byIndex.has(observer))
+    return;
+  byIndex.add(observer);
+  if (observer === currentScope) {
+    currentScope.cleaners.push(byIndex);
+  } else {
+    currentScope.cleaners.push(function() {
+      byIndex.delete(observer);
+    });
+  }
 }
-/** @internal */
-class ObsMap extends ObsCollection {
-    constructor() {
-        super(...arguments);
-        this.data = new Map();
-    }
-    _getType() {
-        return "map";
-    }
-    _getRecursive(depth) {
-        if (currentScope) {
-            if (this._addObserver(ANY_INDEX, currentScope)) {
-                currentScope._cleaners.push(this);
-            }
-        }
-        let result = new Map();
-        this.data.forEach((v, k) => {
-            result.set(k, (v instanceof ObsCollection) ? (depth ? v._getRecursive(depth - 1) : new Store(this, k)) : v);
-        });
-        return result;
-    }
-    rawGet(index) {
-        return this.data.get(index);
-    }
-    rawSet(index, newData) {
-        if (newData === undefined) {
-            this.data.delete(index);
-        }
-        else {
-            this.data.set(index, newData);
-        }
-    }
-    _merge(newValue, deleteMissing) {
-        if (!(newValue instanceof Map)) {
-            return false;
-        }
-        // Walk the pairs of the new value map
-        newValue.forEach((v, k) => {
-            this._setIndex(k, v, deleteMissing);
-        });
-        if (deleteMissing) {
-            this.data.forEach((v, k) => {
-                if (!newValue.has(k))
-                    this._setIndex(k, undefined, false);
-            });
-        }
-        return true;
-    }
-    _iterateIndexes(scope) {
-        this.data.forEach((_, itemIndex) => {
-            scope._addChild(itemIndex);
-        });
-    }
-    _normalizeIndex(index) {
-        return index;
-    }
-    _getCount() {
-        return this.data.size;
-    }
+function onEach(target, render, makeKey) {
+  if (!target || typeof target !== "object")
+    throw new Error("onEach requires an object");
+  target = target[TARGET_SYMBOL] || target;
+  new OnEachScope(target, render, makeKey);
 }
-/** @internal */
-class ObsObject extends ObsMap {
-    _getType() {
-        return "object";
-    }
-    _getRecursive(depth) {
-        if (currentScope) {
-            if (this._addObserver(ANY_INDEX, currentScope)) {
-                currentScope._cleaners.push(this);
-            }
-        }
-        let result = {};
-        this.data.forEach((v, k) => {
-            result[k] = (v instanceof ObsCollection) ? (depth ? v._getRecursive(depth - 1) : new Store(this, k)) : v;
-        });
-        return result;
-    }
-    _merge(newValue, deleteMissing) {
-        if (!newValue || newValue.constructor !== Object) {
-            return false;
-        }
-        // Walk the pairs of the new value object
-        for (let k in newValue) {
-            this._setIndex(k, newValue[k], deleteMissing);
-        }
-        if (deleteMissing) {
-            this.data.forEach((v, k) => {
-                if (!newValue.hasOwnProperty(k))
-                    this._setIndex(k, undefined, false);
-            });
-        }
-        return true;
-    }
-    _normalizeIndex(index) {
-        let type = typeof index;
-        if (type === 'string')
-            return index;
-        if (type === 'number')
-            return '' + index;
-        throw new Error(`Invalid object index ${JSON.stringify(index)}`);
-    }
-    _getCount() {
-        let cnt = 0;
-        for (let key of this.data)
-            cnt++;
-        return cnt;
-    }
+function isObjEmpty(obj) {
+  for (let k in obj)
+    return false;
+  return true;
 }
-/**
- * A data store that automatically subscribes the current scope to updates
- * whenever data is read from it.
- *
- * Supported data types are: `string`, `number`, `boolean`, `undefined`, `null`,
- * `Array`, `object` and `Map`. The latter three will always have `Store` objects as
- * values, creating a tree of `Store`-objects.
- */
-export class Store {
-    constructor(value = undefined, index = undefined) {
-        if (index === undefined) {
-            this._collection = new ObsArray();
-            this._idx = 0;
-            if (value !== undefined) {
-                this._collection.rawSet(0, valueToData(value));
-            }
-        }
-        else {
-            if (!(value instanceof ObsCollection)) {
-                throw new Error("1st parameter should be an ObsCollection if the 2nd is also given");
-            }
-            this._collection = value;
-            this._idx = index;
-        }
-    }
-    /**
-     *
-     * @returns The index for this Store within its parent collection. This will be a `number`
-     * when the parent collection is an array, a `string` when it's an object, or any data type
-     * when it's a `Map`.
-     *
-     * @example
-     * ```
-     * let store = new Store({x: 123})
-     * let subStore = store.ref('x')
-     * assert(subStore.get() === 123)
-     * assert(subStore.index() === 'x') // <----
-     * ```
-     */
-    index() {
-        return this._idx;
-    }
-    /** @internal */
-    _clean(scope) {
-        this._collection._removeObserver(this._idx, scope);
-    }
-    /**
-     * @returns Resolves `path` and then retrieves the value that is there, subscribing
-     * to all read `Store` values. If `path` does not exist, `undefined` is returned.
-     * @param path - Any path terms to resolve before retrieving the value.
-     * @example
-     * ```
-     * let store = new Store({a: {b: {c: {d: 42}}}})
-     * assert('a' in store.get())
-     * assert(store.get('a', 'b') === {c: {d: 42}})
-     * ```
-     */
-    get(...path) {
-        return this.query({ path });
-    }
-    /**
-     * Like {@link Store.get}, but doesn't subscribe to changes.
-     */
-    peek(...path) {
-        return this.query({ path, peek: true });
-    }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `number`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getNumber(...path) { return this.query({ path, type: 'number' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `string`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getString(...path) { return this.query({ path, type: 'string' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `boolean`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getBoolean(...path) { return this.query({ path, type: 'boolean' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `function`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getFunction(...path) { return this.query({ path, type: 'function' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `array`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getArray(...path) { return this.query({ path, type: 'array' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `object`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getObject(...path) { return this.query({ path, type: 'object' }); }
-    /**
-     * @returns Like {@link Store.get}, but throws a `TypeError` if the resulting value is not of type `map`.
-     * Using this instead of just {@link Store.get} is especially useful from within TypeScript.
-     */
-    getMap(...path) { return this.query({ path, type: 'map' }); }
-    /**
-     * Like {@link Store.get}, but the first parameter is the default value (returned when the Store
-     * contains `undefined`). This default value is also used to determine the expected type,
-     * and to throw otherwise.
-     *
-     * @example
-     * ```
-     * let store = {x: 42}
-     * assert(getOr(99, 'x') == 42)
-     * assert(getOr(99, 'y') == 99)
-     * getOr('hello', x') # throws TypeError (because 42 is not a string)
-     * ```
-     */
-    getOr(defaultValue, ...path) {
-        let type = typeof defaultValue;
-        if (type === 'object') {
-            if (defaultValue instanceof Map)
-                type = 'map';
-            else if (defaultValue instanceof Array)
-                type = 'array';
-        }
-        return this.query({ type, defaultValue, path });
-    }
-    /** Retrieve a value, subscribing to all read `Store` values. This is a more flexible
-     * form of the {@link Store.get} and {@link Store.peek} methods.
-     *
-     * @returns The resulting value, or `undefined` if the `path` does not exist.
-     */
-    query(opts) {
-        if (opts.peek && currentScope) {
-            let savedScope = currentScope;
-            currentScope = undefined;
-            let result = this.query(opts);
-            currentScope = savedScope;
-            return result;
-        }
-        let store = opts.path && opts.path.length ? this.ref(...opts.path) : this;
-        let value = store._observe();
-        if (opts.type && (value !== undefined || opts.defaultValue === undefined)) {
-            let type = (value instanceof ObsCollection) ? value._getType() : (value === null ? "null" : typeof value);
-            if (type !== opts.type)
-                throw new TypeError(`Expecting ${opts.type} but got ${type}`);
-        }
-        if (value instanceof ObsCollection) {
-            return value._getRecursive(opts.depth == null ? -1 : opts.depth - 1);
-        }
-        return value === undefined ? opts.defaultValue : value;
-    }
-    /**
-     * Checks if the specified collection is empty, and subscribes the current scope to changes of the emptiness of this collection.
-     *
-     * @param path Any path terms to resolve before retrieving the value.
-     * @returns When the specified collection is not empty `true` is returned. If it is empty or if the value is undefined, `false` is returned.
-     * @throws When the value is not a collection and not undefined, an Error will be thrown.
-     */
-    isEmpty(...path) {
-        let store = this.ref(...path);
-        let value = store._observe();
-        if (value instanceof ObsCollection) {
-            if (currentScope) {
-                let observer = new IsEmptyObserver(currentScope, value, false);
-                return !observer.count;
-            }
-            else {
-                return !value._getCount();
-            }
-        }
-        else if (value === undefined) {
-            return true;
-        }
-        else {
-            throw new Error(`isEmpty() expects a collection or undefined, but got ${JSON.stringify(value)}`);
-        }
-    }
-    /**
-     * Returns the number of items in the specified collection, and subscribes the current scope to changes in this count.
-     *
-     * @param path Any path terms to resolve before retrieving the value.
-     * @returns The number of items contained in the collection, or 0 if the value is undefined.
-     * @throws When the value is not a collection and not undefined, an Error will be thrown.
-     */
-    count(...path) {
-        let store = this.ref(...path);
-        let value = store._observe();
-        if (value instanceof ObsCollection) {
-            if (currentScope) {
-                let observer = new IsEmptyObserver(currentScope, value, true);
-                return observer.count;
-            }
-            else {
-                return value._getCount();
-            }
-        }
-        else if (value === undefined) {
-            return 0;
-        }
-        else {
-            throw new Error(`count() expects a collection or undefined, but got ${JSON.stringify(value)}`);
-        }
-    }
-    /**
-     * Returns a strings describing the type of the store value, subscribing to changes of this type.
-     * Note: this currently also subscribes to changes of primitive values, so changing a value from 3 to 4
-     * would cause the scope to be rerun. This is not great, and may change in the future. This caveat does
-     * not apply to changes made *inside* an object, `Array` or `Map`.
-     *
-     * @param path Any path terms to resolve before retrieving the value.
-     * @returns Possible options: "undefined", "null", "boolean", "number", "string", "function", "array", "map" or "object".
-     */
-    getType(...path) {
-        let store = this.ref(...path);
-        let value = store._observe();
-        return (value instanceof ObsCollection) ? value._getType() : (value === null ? "null" : typeof value);
-    }
-    /**
-     * Sets the value to the last given argument. Any earlier argument are a Store-path that is first
-     * resolved/created using {@link Store.makeRef}.
-     *
-     * When a `Store` is passed in as the value, its value will be copied (subscribing to changes). In
-     * case the value is an object, an `Array` or a `Map`, a *reference* to that data structure will
-     * be created, so that changes made through one `Store` will be reflected through the other. Be
-     * carefull not to create loops in your `Store` tree that way, as that would cause any future
-     * call to {@link Store.get} to throw a `RangeError` (Maximum call stack size exceeded.)
-     *
-     * If you intent to make a copy instead of a reference, call {@link Store.get} on the origin `Store`.
-     *
-     *
-     * @example
-     * ```
-     * let store = new Store() // Value is `undefined`
-     *
-     * store.set('x', 6) // Causes the store to become an object
-     * assert(store.get() == {x: 6})
-     *
-     * store.set('a', 'b', 'c', 'd') // Create parent path as objects
-     * assert(store.get() == {x: 6, a: {b: {c: 'd'}}})
-     *
-     * store.set(42) // Overwrites all of the above
-     * assert(store.get() == 42)
-     *
-     * store.set('x', 6) // Throw Error (42 is not a collection)
-     * ```
-     */
-    set(...pathAndValue) {
-        let newValue = pathAndValue.pop();
-        let store = this.makeRef(...pathAndValue);
-        store._collection._setIndex(store._idx, newValue, true);
-        runImmediateQueue();
-    }
-    /**
-     * Sets the `Store` to the given `mergeValue`, but without deleting any pre-existing
-     * items when a collection overwrites a similarly typed collection. This results in
-     * a deep merge.
-     *
-     * @example
-     * ```
-     * let store = new Store({a: {x: 1}})
-     * store.merge({a: {y: 2}, b: 3})
-     * assert(store.get() == {a: {x: 1, y: 2}, b: 3})
-     * ```
-     */
-    merge(...pathAndValue) {
-        let mergeValue = pathAndValue.pop();
-        let store = this.makeRef(...pathAndValue);
-        store._collection._setIndex(store._idx, mergeValue, false);
-        runImmediateQueue();
-    }
-    /**
-     * Sets the value for the store to `undefined`, which causes it to be omitted from the map (or array, if it's at the end)
-     *
-     * @example
-     * ```
-     * let store = new Store({a: 1, b: 2})
-     * store.delete('a')
-     * assert(store.get() == {b: 2})
-     *
-     * store = new Store(['a','b','c'])
-     * store.delete(1)
-     * assert(store.get() == ['a', undefined, 'c'])
-     * store.delete(2)
-     * assert(store.get() == ['a'])
-     * ```
-     */
-    delete(...path) {
-        let store = this.makeRef(...path);
-        store._collection._setIndex(store._idx, undefined, true);
-        runImmediateQueue();
-    }
-    /**
-     * Pushes a value to the end of the Array that is at the specified path in the store.
-     * If that store path is `undefined`, an Array is created first.
-     * The last argument is the value to be added, any earlier arguments indicate the path.
-     *
-     * @example
-     * ```
-     * let store = new Store()
-     * store.push(3) // Creates the array
-     * store.push(6)
-     * assert(store.get() == [3,6])
-     *
-     * store = new Store({myArray: [1,2]})
-     * store.push('myArray', 3)
-     * assert(store.get() == {myArray: [1,2,3]})
-     * ```
-     */
-    push(...pathAndValue) {
-        let newValue = pathAndValue.pop();
-        let store = this.makeRef(...pathAndValue);
-        let obsArray = store._collection.rawGet(store._idx);
-        if (obsArray === undefined) {
-            obsArray = new ObsArray();
-            store._collection._setIndex(store._idx, obsArray, true);
-        }
-        else if (!(obsArray instanceof ObsArray)) {
-            throw new Error(`push() is only allowed for an array or undefined (which would become an array)`);
-        }
-        let newData = valueToData(newValue);
-        let pos = obsArray._data.length;
-        obsArray._data.push(newData);
-        obsArray.emitChange(pos, newData, undefined);
-        runImmediateQueue();
-        return pos;
-    }
-    /**
-     * {@link Store.peek} the current value, pass it through `func`, and {@link Store.set} the resulting
-     * value.
-     * @param func The function transforming the value.
-     */
-    modify(func) {
-        this.set(func(this.query({ peek: true })));
-    }
-    /**
-     * Return a `Store` deeper within the tree by resolving the given `path`,
-     * subscribing to every level.
-     * In case `undefined` is encountered while resolving the path, a newly
-     * created `Store` containing `undefined` is returned. In that case, the
-     * `Store`'s {@link Store.isDetached} method will return `true`.
-     * In case something other than a collection is encountered, an error is thrown.
-     */
-    ref(...path) {
-        let store = this;
-        for (let i = 0; i < path.length; i++) {
-            let value = store._observe();
-            if (value instanceof ObsCollection) {
-                store = new Store(value, value._normalizeIndex(path[i]));
-            }
-            else {
-                if (value !== undefined)
-                    throw new Error(`Value ${JSON.stringify(value)} is not a collection (nor undefined) in step ${i} of $(${JSON.stringify(path)})`);
-                return new DetachedStore();
-            }
-        }
-        return store;
-    }
-    /**
-     * Similar to `ref()`, but instead of returning `undefined`, new objects are created when
-     * a path does not exist yet. An error is still thrown when the path tries to index an invalid
-     * type.
-     * Unlike `ref`, `makeRef` does *not* subscribe to the path levels, as it is intended to be
-     * a write-only operation.
-     *
-     * @example
-     * ```
-     * let store = new Store() // Value is `undefined`
-     *
-     * let ref = store.makeRef('a', 'b', 'c')
-     * assert(store.get() == {a: {b: {}}}
-     *
-     * ref.set(42)
-     * assert(store.get() == {a: {b: {c: 42}}}
-     *
-     * ref.makeRef('d') // Throw Error (42 is not a collection)
-     * ```
-     */
-    makeRef(...path) {
-        let store = this;
-        for (let i = 0; i < path.length; i++) {
-            let value = store._collection.rawGet(store._idx);
-            if (!(value instanceof ObsCollection)) {
-                if (value !== undefined)
-                    throw new Error(`Value ${JSON.stringify(value)} is not a collection (nor undefined) in step ${i} of $(${JSON.stringify(path)})`);
-                value = new ObsObject();
-                store._collection.rawSet(store._idx, value);
-                store._collection.emitChange(store._idx, value, undefined);
-            }
-            store = new Store(value, value._normalizeIndex(path[i]));
-        }
-        runImmediateQueue();
-        return store;
-    }
-    /** @internal */
-    _observe() {
-        if (currentScope) {
-            if (this._collection._addObserver(this._idx, currentScope)) {
-                currentScope._cleaners.push(this);
-            }
-        }
-        return this._collection.rawGet(this._idx);
-    }
-    /**
-     * Iterate the specified collection (Array, Map or object), running the given code block for each item.
-     * When items are added to the collection at some later point, the code block will be ran for them as well.
-     * When an item is removed, the {@link Store.clean} handlers left by its code block are executed.
-     *
-     *
-     *
-     * @param pathAndFuncs
-     */
-    onEach(...pathAndFuncs) {
-        let makeSortKey = defaultMakeSortKey;
-        let renderer = pathAndFuncs.pop();
-        if (typeof pathAndFuncs[pathAndFuncs.length - 1] === 'function' && (typeof renderer === 'function' || renderer == null)) {
-            if (renderer != null)
-                makeSortKey = renderer;
-            renderer = pathAndFuncs.pop();
-        }
-        if (typeof renderer !== 'function')
-            throw new Error(`onEach() expects a render function as its last argument but got ${JSON.stringify(renderer)}`);
-        if (!currentScope)
-            throw new ScopeError(false);
-        let store = this.ref(...pathAndFuncs);
-        let val = store._observe();
-        if (val instanceof ObsCollection) {
-            // Subscribe to changes using the specialized OnEachScope
-            let onEachScope = new OnEachScope(currentScope._parentElement, currentScope._lastChild || currentScope._precedingSibling, currentScope._queueOrder + 1, val, renderer, makeSortKey);
-            val._addObserver(ANY_INDEX, onEachScope);
-            currentScope._cleaners.push(onEachScope);
-            currentScope._lastChild = onEachScope;
-            onEachScope._renderInitial();
-        }
-        else if (val !== undefined) {
-            throw new Error(`onEach() attempted on a value that is neither a collection nor undefined`);
-        }
-    }
-    /**
-     * Applies a filter/map function on each item within the `Store`'s collection,
-     * and reactively manages the returned `Map` `Store` to hold any results.
-     *
-     * @param func - Function that transform the given store into an output value or
-     * `undefined` in case this value should be skipped:
-     *
-     * @returns - A map `Store` with the values returned by `func` and the corresponding
-     * keys from the original map, array or object `Store`.
-     *
-     * When items disappear from the `Store` or are changed in a way that `func` depends
-     * upon, the resulting items are removed from the output `Store` as well. When multiple
-     * input items produce the same output keys, this may lead to unexpected results.
-     */
-    map(func) {
-        let out = new Store(new Map());
-        this.onEach((item) => {
-            let value = func(item);
-            if (value !== undefined) {
-                let key = item.index();
-                out.set(key, value);
-                clean(() => {
-                    out.delete(key);
-                });
-            }
-        });
-        return out;
-    }
-    /**
-     * Applies a filter/map function on each item within the `Store`'s collection,
-     * each of which can deliver any number of key/value pairs, and reactively manages the
-     * returned map `Store` to hold any results.
-     *
-     * @param func - Function that transform the given store into output values
-     * that can take one of the following forms:
-     * - an `Object` or a `Map`: Each key/value pair will be added to the output `Store`.
-     * - anything else: No key/value pairs are added to the output `Store`.
-     *
-     * @returns - A map `Store` with the key/value pairs returned by all `func` invocations.
-     *
-     * When items disappear from the `Store` or are changed in a way that `func` depends
-     * upon, the resulting items are removed from the output `Store` as well. When multiple
-     * input items produce the same output keys, this may lead to unexpected results.
-     */
-    multiMap(func) {
-        let out = new Store(new Map());
-        this.onEach((item) => {
-            let result = func(item);
-            let keys;
-            if (result.constructor === Object) {
-                for (let key in result) {
-                    out.set(key, result[key]);
-                }
-                keys = Object.keys(result);
-            }
-            else if (result instanceof Map) {
-                result.forEach((value, key) => {
-                    out.set(key, value);
-                });
-                keys = [...result.keys()];
-            }
-            else {
-                return;
-            }
-            if (keys.length) {
-                clean(() => {
-                    for (let key of keys) {
-                        out.delete(key);
-                    }
-                });
-            }
-        });
-        return out;
-    }
-    /**
-     * @returns Returns `true` when the `Store` was created by {@link Store.ref}ing a path that
-     * does not exist.
-     */
-    isDetached() { return false; }
-    /**
-    * Dump a live view of the `Store` tree as HTML text, `ul` and `li` nodes at
-    * the current mount position. Meant for debugging purposes.
-    */
-    dump() {
-        let type = this.getType();
-        if (type === 'array' || type === 'object' || type === 'map') {
-            text('<' + type + '>');
-            node('ul', () => {
-                this.onEach((sub) => {
-                    node('li', () => {
-                        text(JSON.stringify(sub.index()) + ': ');
-                        sub.dump();
-                    });
-                });
-            });
-        }
-        else {
-            text(JSON.stringify(this.get()));
-        }
-    }
+function isEmpty(proxied) {
+  const target = proxied[TARGET_SYMBOL] || proxied;
+  const scope = currentScope;
+  if (target instanceof Array) {
+    subscribe(target, "length", function(index, newData, oldData) {
+      if (!newData !== !oldData)
+        queue(scope);
+    });
+    return !target.length;
+  } else {
+    const result = isObjEmpty(target);
+    subscribe(target, ANY_SYMBOL, function(index, newData, oldData) {
+      if (result ? oldData === undefined : newData === undefined)
+        queue(scope);
+    });
+    return result;
+  }
+}
+function count(proxied) {
+  if (proxied instanceof Array)
+    return ref(proxied, "length");
+  const target = proxied[TARGET_SYMBOL] || proxied;
+  let cnt = 0;
+  for (let k in target)
+    if (target[k] !== undefined)
+      cnt++;
+  const result = proxy(cnt);
+  subscribe(target, ANY_SYMBOL, function(index, newData, oldData) {
+    if (oldData === newData) {} else if (oldData === undefined)
+      result.value = ++cnt;
+    else if (newData === undefined)
+      result.value = --cnt;
+  });
+  return result;
+}
+function defaultEmitHandler(target, index, newData, oldData) {
+  if (newData === oldData && newData !== undefined)
+    return;
+  const byTarget = subscribers.get(target);
+  if (byTarget === undefined)
+    return;
+  for (const what of [index, ANY_SYMBOL]) {
+    let byIndex = byTarget.get(what);
+    if (byIndex) {
+      for (let observer of byIndex) {
+        if (typeof observer === "function")
+          observer(index, newData, oldData);
+        else
+          observer.onChange(index, newData, oldData);
+      }
+    }
+  }
+}
+var emit = defaultEmitHandler;
+var objectHandler = {
+  get(target, prop) {
+    if (prop === TARGET_SYMBOL)
+      return target;
+    subscribe(target, prop);
+    return optProxy(target[prop]);
+  },
+  set(target, prop, newData) {
+    if (typeof newData === "object" && newData)
+      newData = newData[TARGET_SYMBOL] || newData;
+    const oldData = target[prop];
+    if (newData !== oldData) {
+      target[prop] = newData;
+      emit(target, prop, newData, oldData);
+      runImmediateQueue();
+    }
+    return true;
+  },
+  deleteProperty(target, prop) {
+    const old = target[prop];
+    delete target[prop];
+    emit(target, prop, undefined, old);
+    runImmediateQueue();
+    return true;
+  },
+  has(target, prop) {
+    const result = prop in target;
+    subscribe(target, prop);
+    return result;
+  },
+  ownKeys(target) {
+    subscribe(target, ANY_SYMBOL);
+    return Reflect.ownKeys(target);
+  }
+};
+function arraySet(target, prop, newData) {
+  if (typeof newData === "object" && newData)
+    newData = newData[TARGET_SYMBOL] || newData;
+  const oldData = target[prop];
+  if (newData !== oldData) {
+    let oldLength = target.length;
+    if (prop === "length") {
+      target.length = newData;
+      for (let i = newData;i < oldLength; i++) {
+        emit(target, i, undefined, target[i]);
+      }
+    } else {
+      const intProp = parseInt(prop);
+      if (intProp.toString() === prop)
+        prop = intProp;
+      target[prop] = newData;
+      emit(target, prop, newData, oldData);
+    }
+    if (target.length !== oldLength) {
+      emit(target, "length", target.length, oldLength);
+    }
+    runImmediateQueue();
+  }
+  return true;
+}
+var arrayHandler = {
+  get(target, prop) {
+    if (prop === TARGET_SYMBOL)
+      return target;
+    let subProp = prop;
+    if (typeof prop !== "symbol") {
+      const intProp = parseInt(prop);
+      if (intProp.toString() === prop)
+        subProp = intProp;
+    }
+    subscribe(target, subProp);
+    return optProxy(target[prop]);
+  },
+  set: arraySet,
+  deleteProperty(target, prop) {
+    return arraySet(target, prop, undefined);
+  }
+};
+var proxyMap = new WeakMap;
+function optProxy(value) {
+  if (typeof value !== "object" || !value || value[TARGET_SYMBOL] !== undefined) {
+    return value;
+  }
+  let proxied = proxyMap.get(value);
+  if (proxied)
+    return proxied;
+  proxied = new Proxy(value, value instanceof Array ? arrayHandler : objectHandler);
+  proxyMap.set(value, proxied);
+  return proxied;
+}
+function proxy(target) {
+  return optProxy(typeof target === "object" && target !== null ? target : { value: target });
 }
-class DetachedStore extends Store {
-    isDetached() { return true; }
+function unproxy(target) {
+  return target ? target[TARGET_SYMBOL] || target : target;
 }
-let onCreateEnabled = false;
-let onDestroyMap = new WeakMap();
+var onDestroyMap = new WeakMap;
 function destroyWithClass(element, cls) {
-    element.classList.add(cls);
-    setTimeout(() => element.remove(), 2000);
+  const classes = cls.split(".").filter((c) => c);
+  element.classList.add(...classes);
+  setTimeout(() => element.remove(), 2000);
 }
-/**
- * Create a new DOM element, and insert it into the DOM at the position held by the current scope.
- * @param tag - The tag of the element to be created and optionally dot-separated class names. For example: `h1` or `p.intro.has_avatar`.
- * @param rest - The other arguments are flexible and interpreted based on their types:
- *   - `string`: Used as textContent for the element.
- *   - `object`: Used as attributes, properties or event listeners for the element. See {@link Store.prop} on how the distinction is made and to read about a couple of special keys.
- *   - `function`: The render function used to draw the scope of the element. This function gets its own `Scope`, so that if any `Store` it reads changes, it will redraw by itself.
- *   - `Store`: Presuming `tag` is `"input"`, `"textarea"` or `"select"`, create a two-way binding between this `Store` value and the input element. The initial value of the input will be set to the initial value of the `Store`, or the other way around if the `Store` holds `undefined`. After that, the `Store` will be updated when the input changes and vice versa.
- * @example
- * node('aside.editorial', 'Yada yada yada....', () => {
- *	 node('a', {href: '/bio'}, () => {
- *		 node('img.author', {src: '/me.jpg', alt: 'The author'})
- *	 })
- * })
- */
-export function node(tag = "", ...rest) {
-    if (!currentScope)
-        throw new ScopeError(true);
-    let el;
-    if (tag instanceof Element) {
-        el = tag;
-    }
-    else {
-        let pos = tag.indexOf('.');
-        let classes;
-        if (pos >= 0) {
-            classes = tag.substr(pos + 1);
-            tag = tag.substr(0, pos);
-        }
-        el = document.createElement(tag || 'div');
+function copy(dst, src, flags = 0) {
+  copyRecurse(dst, src, flags);
+  runImmediateQueue();
+}
+var MERGE = 1;
+var SHALLOW = 2;
+var COPY_SUBSCRIBE = 32;
+var COPY_EMIT = 64;
+function clone(src, flags = 0) {
+  const dst = Object.create(Object.getPrototypeOf(src));
+  copyRecurse(dst, src, flags);
+  return dst;
+}
+function copyRecurse(dst, src, flags) {
+  let unproxied = dst[TARGET_SYMBOL];
+  if (unproxied) {
+    dst = unproxied;
+    flags |= COPY_EMIT;
+  }
+  unproxied = src[TARGET_SYMBOL];
+  if (unproxied) {
+    src = unproxied;
+    if (currentScope !== ROOT_SCOPE && !peeking)
+      flags |= COPY_SUBSCRIBE;
+  }
+  if (flags & COPY_SUBSCRIBE)
+    subscribe(src, ANY_SYMBOL);
+  if (src instanceof Array) {
+    if (!(dst instanceof Array))
+      throw new Error("Cannot copy array into object");
+    const dstLen = dst.length;
+    const srcLen = src.length;
+    for (let i = 0;i < srcLen; i++) {
+      copyValue(dst, src, i, flags);
+    }
+    if (srcLen !== dstLen) {
+      if (flags & COPY_EMIT) {
+        for (let i = srcLen;i < dstLen; i++) {
+          const old = dst[i];
+          dst[i] = undefined;
+          emit(dst, i, undefined, old);
+        }
+        dst.length = srcLen;
+        emit(dst, "length", srcLen, dstLen);
+      } else {
+        dst.length = srcLen;
+      }
+    }
+  } else {
+    for (let k in src) {
+      copyValue(dst, src, k, flags);
+    }
+    if (!(flags & MERGE)) {
+      for (let k in dst) {
+        if (!(k in src)) {
+          const old = dst[k];
+          delete dst[k];
+          if (flags & COPY_EMIT && old !== undefined) {
+            emit(dst, k, undefined, old);
+          }
+        }
+      }
+    }
+  }
+}
+function copyValue(dst, src, index, flags) {
+  let dstValue = dst[index];
+  let srcValue = src[index];
+  if (srcValue !== dstValue) {
+    if (srcValue && dstValue && typeof srcValue === "object" && typeof dstValue === "object" && (srcValue.constructor === dstValue.constructor || flags & MERGE && dstValue instanceof Array)) {
+      copyRecurse(dstValue, srcValue, flags);
+      return;
+    }
+    if (!(flags & SHALLOW) && srcValue && typeof srcValue === "object") {
+      let copy2 = Object.create(Object.getPrototypeOf(srcValue));
+      copyRecurse(copy2, srcValue, 0);
+      srcValue = copy2;
+    }
+    const old = dst[index];
+    if (flags & MERGE && srcValue == null)
+      delete dst[index];
+    else
+      dst[index] = srcValue;
+    if (flags & COPY_EMIT)
+      emit(dst, index, srcValue, old);
+  }
+}
+var refHandler = {
+  get(target, prop) {
+    if (prop === TARGET_SYMBOL) {
+      return ref(unproxy(target.proxy), target.index);
+    }
+    if (prop === "value") {
+      return target.proxy[target.index];
+    }
+  },
+  set(target, prop, value) {
+    if (prop === "value") {
+      target.proxy[target.index] = value;
+      return true;
+    }
+    return false;
+  }
+};
+function ref(target, index) {
+  return new Proxy({ proxy: target, index }, refHandler);
+}
+function applyBind(_el, target) {
+  const el = _el;
+  let onProxyChange;
+  let onInputChange;
+  let type = el.getAttribute("type");
+  let value = unproxy(target).value;
+  if (type === "checkbox") {
+    if (value === undefined)
+      target.value = el.checked;
+    onProxyChange = () => el.checked = target.value;
+    onInputChange = () => target.value = el.checked;
+  } else if (type === "radio") {
+    if (value === undefined && el.checked)
+      target.value = el.value;
+    onProxyChange = () => el.checked = target.value === el.value;
+    onInputChange = () => {
+      if (el.checked)
+        target.value = el.value;
+    };
+  } else {
+    onInputChange = () => target.value = type === "number" || type === "range" ? el.value === "" ? null : +el.value : el.value;
+    if (value === undefined)
+      onInputChange();
+    onProxyChange = () => el.value = target.value;
+  }
+  observe(onProxyChange);
+  el.addEventListener("input", onInputChange);
+  clean(() => {
+    el.removeEventListener("input", onInputChange);
+  });
+}
+var SPECIAL_PROPS = {
+  create: function(value) {
+    const el = currentScope.parentElement;
+    if (currentScope !== topRedrawScope)
+      return;
+    if (typeof value === "function") {
+      value(el);
+    } else {
+      const classes = value.split(".").filter((c) => c);
+      el.classList.add(...classes);
+      (async function() {
+        el.offsetHeight;
+        el.classList.remove(...classes);
+      })();
+    }
+  },
+  destroy: function(value) {
+    const el = currentScope.parentElement;
+    onDestroyMap.set(el, value);
+  },
+  html: function(value) {
+    let tmpParent = document.createElement(currentScope.parentElement.tagName);
+    tmpParent.innerHTML = "" + value;
+    while (tmpParent.firstChild)
+      addNode(tmpParent.firstChild);
+  },
+  text: function(value) {
+    addNode(document.createTextNode(value));
+  },
+  element: function(value) {
+    if (!(value instanceof Node))
+      throw new Error(`Unexpected element-argument: ${JSON.parse(value)}`);
+    addNode(value);
+  }
+};
+function $(...args) {
+  let savedCurrentScope;
+  let err;
+  for (let arg of args) {
+    if (arg == null || arg === false)
+      continue;
+    if (typeof arg === "string") {
+      let text, classes;
+      const textPos = arg.indexOf(":");
+      if (textPos >= 0) {
+        text = arg.substring(textPos + 1);
+        arg = arg.substring(0, textPos);
+      }
+      const classPos = arg.indexOf(".");
+      if (classPos >= 0) {
+        classes = arg.substring(classPos + 1);
+        arg = arg.substring(0, classPos);
+      }
+      if (arg === "") {
+        if (text)
+          addNode(document.createTextNode(text));
         if (classes) {
-            // @ts-ignore (replaceAll is polyfilled)
-            el.className = classes.replaceAll('.', ' ');
-        }
-    }
-    currentScope._addNode(el);
-    for (let item of rest) {
-        let type = typeof item;
-        if (type === 'function') {
-            let scope = new SimpleScope(el, undefined, currentScope._queueOrder + 1, item);
-            if (onCreateEnabled) {
-                onCreateEnabled = false;
-                scope._update();
-                onCreateEnabled = true;
-            }
-            else {
-                scope._update();
-            }
-            // Add it to our list of cleaners. Even if `scope` currently has
-            // no cleaners, it may get them in a future refresh.
-            currentScope._cleaners.push(scope);
-        }
-        else if (type === 'string' || type === 'number') {
-            el.textContent = item;
-        }
-        else if (type === 'object' && item && item.constructor === Object) {
-            for (let k in item) {
-                applyProp(el, k, item[k]);
-            }
-        }
-        else if (item instanceof Store) {
-            bindInput(el, item);
-        }
-        else if (item != null) {
-            throw new Error(`Unexpected argument ${JSON.stringify(item)}`);
-        }
-    }
+          const el = currentScope.parentElement;
+          el.classList.add(...classes.split("."));
+          if (!savedCurrentScope) {
+            clean(() => el.classList.remove(...classes.split(".")));
+          }
+        }
+      } else if (arg.indexOf(" ") >= 0) {
+        err = `Tag '${arg}' cannot contain space`;
+        break;
+      } else {
+        const el = document.createElement(arg);
+        if (classes)
+          el.className = classes.replaceAll(".", " ");
+        if (text)
+          el.textContent = text;
+        addNode(el);
+        if (!savedCurrentScope) {
+          savedCurrentScope = currentScope;
+        }
+        let newScope = new ChainedScope(el, true);
+        newScope.lastChild = el.lastChild || undefined;
+        if (topRedrawScope === currentScope)
+          topRedrawScope = newScope;
+        currentScope = newScope;
+      }
+    } else if (typeof arg === "object") {
+      if (arg.constructor !== Object) {
+        err = `Unexpected argument: ${arg}`;
+        break;
+      }
+      for (const key in arg) {
+        const val = arg[key];
+        applyArg(key, val);
+      }
+    } else if (typeof arg === "function") {
+      new RegularScope(currentScope.parentElement, arg);
+    } else {
+      err = `Unexpected argument: ${arg}`;
+      break;
+    }
+  }
+  if (savedCurrentScope) {
+    currentScope = savedCurrentScope;
+  }
+  if (err)
+    throw new Error(err);
 }
-/**
- * Convert an HTML string to one or more DOM elements, and add them to the current DOM scope.
- * @param html - The HTML string. For example `"<section><h2>Test</h2><p>Info..</p></section>"`.
- */
-export function html(html) {
-    if (!currentScope || !currentScope._parentElement)
-        throw new ScopeError(true);
-    let tmpParent = document.createElement(currentScope._parentElement.tagName);
-    tmpParent.innerHTML = '' + html;
-    while (tmpParent.firstChild) {
-        currentScope._addNode(tmpParent.firstChild);
-    }
+var cssCount = 0;
+function insertCss(style, global = false) {
+  const prefix = global ? "" : ".AbdStl" + ++cssCount;
+  let css = styleToCss(style, prefix);
+  if (css)
+    $("style:" + css);
+  return prefix;
 }
-function bindInput(el, store) {
-    let onStoreChange;
-    let onInputChange;
-    let type = el.getAttribute('type');
-    let value = store.query({ peek: true });
-    if (type === 'checkbox') {
-        if (value === undefined)
-            store.set(el.checked);
-        onStoreChange = value => el.checked = value;
-        onInputChange = () => store.set(el.checked);
-    }
-    else if (type === 'radio') {
-        if (value === undefined && el.checked)
-            store.set(el.value);
-        onStoreChange = value => el.checked = (value === el.value);
-        onInputChange = () => {
-            if (el.checked)
-                store.set(el.value);
-        };
-    }
-    else {
-        onInputChange = () => store.set(type === 'number' || type === 'range' ? (el.value === '' ? null : +el.value) : el.value);
-        if (value === undefined)
-            onInputChange();
-        onStoreChange = value => {
-            if (el.value !== value)
-                el.value = value;
-        };
-    }
-    observe(() => {
-        onStoreChange(store.get());
-    });
-    el.addEventListener('input', onInputChange);
-    clean(() => {
-        el.removeEventListener('input', onInputChange);
-    });
+function styleToCss(style, prefix) {
+  let props = "";
+  let rules = "";
+  for (const kOr in style) {
+    const v = style[kOr];
+    for (const k of kOr.split(/, ?/g)) {
+      if (v && typeof v === "object") {
+        if (k.startsWith("@")) {
+          rules += k + `{
+` + styleToCss(v, prefix) + `}
+`;
+        } else {
+          rules += styleToCss(v, k.includes("&") ? k.replace(/&/g, prefix) : prefix + " " + k);
+        }
+      } else {
+        props += k.replace(/[A-Z]/g, (letter) => "-" + letter.toLowerCase()) + ":" + v + ";";
+      }
+    }
+  }
+  if (props)
+    rules = (prefix.trimStart() || "*") + "{" + props + `}
+` + rules;
+  return rules;
 }
-/**
- * Add a text node at the current Scope position.
- */
-export function text(text) {
-    if (!currentScope)
-        throw new ScopeError(true);
-    if (text == null)
-        return;
-    currentScope._addNode(document.createTextNode(text));
+function applyArg(key, value) {
+  const el = currentScope.parentElement;
+  if (typeof value === "object" && value !== null && value[TARGET_SYMBOL]) {
+    if (key === "bind") {
+      applyBind(el, value);
+    } else {
+      new SetArgScope(el, key, value);
+    }
+  } else if (key[0] === ".") {
+    const classes = key.substring(1).split(".");
+    if (value)
+      el.classList.add(...classes);
+    else
+      el.classList.remove(...classes);
+  } else if (key[0] === "$") {
+    const name = key.substring(1);
+    if (value == null || value === false)
+      el.style[name] = "";
+    else
+      el.style[name] = "" + value;
+  } else if (value == null) {} else if (key in SPECIAL_PROPS) {
+    SPECIAL_PROPS[key](value);
+  } else if (typeof value === "function") {
+    el.addEventListener(key, value);
+    clean(() => el.removeEventListener(key, value));
+  } else if (value === true || value === false || key === "value" || key === "selectedIndex") {
+    el[key] = value;
+  } else {
+    el.setAttribute(key, value);
+  }
 }
-export function prop(name, value = undefined) {
-    if (!currentScope || !currentScope._parentElement)
-        throw new ScopeError(true);
-    if (typeof name === 'object') {
-        for (let k in name) {
-            applyProp(currentScope._parentElement, k, name[k]);
-        }
-    }
-    else {
-        applyProp(currentScope._parentElement, name, value);
-    }
+function defaultOnError(error) {
+  console.error("Error while in Aberdeen render:", error);
+  return true;
 }
-/**
- * Return the browser Element that `node()`s would be rendered to at this point.
- * NOTE: Manually changing the DOM is not recommended in most cases. There is
- * usually a better, declarative way. Although there are no hard guarantees on
- * how your changes interact with Aberdeen, in most cases results will not be
- * terribly surprising. Be careful within the parent element of onEach() though.
- */
-export function getParentElement() {
-    if (!currentScope || !currentScope._parentElement)
-        throw new ScopeError(true);
-    return currentScope._parentElement;
+var onError = defaultOnError;
+function setErrorHandler(handler) {
+  onError = handler || defaultOnError;
 }
-/**
- * Register a function that is to be executed right before the current reactive scope
- * disappears or redraws.
- * @param clean - The function to be executed.
- */
-export function clean(clean) {
-    if (!currentScope)
-        throw new ScopeError(false);
-    currentScope._cleaners.push({ _clean: clean });
+function getParentElement() {
+  return currentScope.parentElement;
 }
-/**
- * Reactively run a function, meaning the function will rerun when any `Store` that was read
- * during its execution is updated.
- * Calls to `observe` can be nested, such that changes to `Store`s read by the inner function do
- * no cause the outer function to rerun.
- *
- * @param func - The function to be (repeatedly) executed.
- * @returns The mount id (usable for `unmount`) if this is a top-level observe.
- * @example
- * ```
- * let number = new Store(0)
- * let doubled = new Store()
- * setInterval(() => number.set(0|Math.random()*100)), 1000)
- *
- * observe(() => {
- *   doubled.set(number.get() * 2)
- * })
- *
- * observe(() => {
- *   console.log(doubled.get())
- * })
- */
-export function observe(func) {
-    return _mount(undefined, func, SimpleScope);
+function clean(cleaner) {
+  currentScope.cleaners.push(cleaner);
 }
-/**
- * Like `observe`, but instead of deferring running the observer function until
- * a setTimeout 0, run it immediately and synchronously when a change to one of
- * the observed  `Store`s is made. Use this sparingly, as this prevents Aberdeen
- * from doing the usual batching and smart ordering of observers, leading to
- * performance problems and observing of 'weird' partial states.
- * @param func The function to be (repeatedly) executed.
- * @returns The mount id (usable for `unmount`) if this is a top-level observe.
- */
-export function immediateObserve(func) {
-    return _mount(undefined, func, ImmediateScope);
+function observe(func) {
+  return new ResultScope(currentScope.parentElement, func).result;
 }
-/**
- * Like {@link Store.observe}, but allow the function to create DOM elements using {@link Store.node}.
-
- * @param func - The function to be (repeatedly) executed, possibly adding DOM elements to `parentElement`.
- * @param parentElement - A DOM element that will be used as the parent element for calls to `node`.
- * @returns The mount id (usable for `unmount`) if this is a top-level mount.
- *
- * @example
- * ```
- * let store = new Store(0)
- * setInterval(() => store.modify(v => v+1), 1000)
- *
- * mount(document.body, () => {
- * 	   node('h2', `${store.get()} seconds have passed`)
- * })
- * ```
- *
- * An example nesting {@link Store.observe} within `mount`:
- * ```
- * let selected = new Store(0)
- * let colors = new Store(new Map())
- *
- * mount(document.body, () => {
- * 	// This function will never rerun (as it does not read any `Store`s)
- * 	node('button', '<<', {click: () => selected.modify(n => n-1)})
- * 	node('button', '>>', {click: () => selected.modify(n => n+1)})
- *
- * 	observe(() => {
- * 		// This will rerun whenever `selected` changes, recreating the <h2> and <input>.
- * 		node('h2', '#'+selected.get())
- * 		node('input', {type: 'color', value: '#ffffff'}, colors.ref(selected.get()))
- * 	})
- *
- * 	observe(() => {
- * 		// This function will rerun when `selected` or the selected color changes.
- * 		// It will change the <body> background-color.
- * 		prop({style: {backgroundColor: colors.get(selected.get()) || 'white'}})
- * 	})
- * })
- * ```
-*/
-export function mount(parentElement, func) {
-    return _mount(parentElement, func, SimpleScope);
+function immediateObserve(func) {
+  new ImmediateScope(currentScope.parentElement, func);
 }
-let maxTopScopeId = 0;
-const topScopes = new Map();
-function _mount(parentElement, func, MountScope) {
-    let scope;
-    if (parentElement || !currentScope) {
-        scope = new MountScope(parentElement, undefined, 0, func);
-    }
-    else {
-        scope = new MountScope(currentScope._parentElement, currentScope._lastChild || currentScope._precedingSibling, currentScope._queueOrder + 1, func);
-        currentScope._lastChild = scope;
-    }
-    // Do the initial run
-    scope._update();
-    // Add it to our list of cleaners. Even if `scope` currently has
-    // no cleaners, it may get them in a future refresh.
-    if (currentScope) {
-        currentScope._cleaners.push(scope);
-    }
-    else {
-        topScopes.set(++maxTopScopeId, scope);
-        return maxTopScopeId;
-    }
+function mount(parentElement, func) {
+  new MountScope(parentElement, func);
 }
-/**
- * Unmount one specific or all top-level mounts or observes, meaning those that were created outside of the scope
- * of any other mount or observe.
- * @param id Optional mount number (as returned by `mount`, `observe` or `immediateObserve`). If `undefined`, unmount all.
- */
-export function unmount(id) {
-    if (id == null) {
-        for (let scope of topScopes.values())
-            scope._remove();
-        topScopes.clear();
-    }
-    else {
-        let scope = topScopes.get(id);
-        if (!scope)
-            throw new Error("No such mount " + id);
-        scope._remove();
-    }
+function unmountAll() {
+  ROOT_SCOPE.remove();
+  cssCount = 0;
 }
-/** Runs the given function, while not subscribing the current scope when reading {@link Store.Store} values.
- *
- * @param func Function to be executed immediately.
- * @returns Whatever `func()` returns.
- * @example
- * ```
- * import {Store, peek, text} from aberdeen
- *
- * let store = new Store(['a', 'b', 'c'])
- *
- * mount(document.body, () => {
- *     // Prevent rerender when store changes
- *     let msg = peek(() => `Store has ${store.count()} elements, and the first is ${store.get(0)}`))
- *     text(msg)
- * })
- * ```
- *
- * In the above example `store.get(0)` could be replaced with `store.peek(0)` to achieve the
- * same result without `peek()` wrapping everything. There is no non-subscribing equivalent
- * for `count()` however.
- */
-export function peek(func) {
-    let savedScope = currentScope;
-    currentScope = undefined;
-    try {
-        return func();
-    }
-    finally {
-        currentScope = savedScope;
-    }
+function peek(func) {
+  peeking++;
+  try {
+    return func();
+  } finally {
+    peeking--;
+  }
 }
-/*
- * Helper functions
- */
-function applyProp(el, prop, value) {
-    if (prop === 'create') {
-        if (onCreateEnabled) {
-            if (typeof value === 'function') {
-                value(el);
-            }
-            else {
-                el.classList.add(value);
-                setTimeout(function () { el.classList.remove(value); }, 0);
-            }
-        }
-    }
-    else if (prop === 'destroy') {
-        onDestroyMap.set(el, value);
-    }
-    else if (typeof value === 'function') {
-        // Set an event listener; remove it again on clean.
-        el.addEventListener(prop, value);
-        clean(() => el.removeEventListener(prop, value));
-    }
-    else if (prop === 'value' || prop === 'className' || prop === 'selectedIndex' || value === true || value === false) {
-        // All boolean values and a few specific keys should be set as a property
-        el[prop] = value;
-    }
-    else if (prop === 'text') {
-        // `text` is set as textContent
-        el.textContent = value;
-    }
-    else if ((prop === 'class' || prop === 'className') && typeof value === 'object') {
-        // Allow setting classes using an object where the keys are the names and
-        // the values are booleans stating whether to set or remove.
-        for (let name in value) {
-            if (value[name])
-                el.classList.add(name);
-            else
-                el.classList.remove(name);
-        }
-    }
-    else if (prop === 'style' && typeof value === 'object') {
-        // `style` can receive an object
-        Object.assign(el.style, value);
-    }
-    else {
-        // Everything else is an HTML attribute
-        el.setAttribute(prop, value);
-    }
+function map(source, func) {
+  let out = optProxy(source instanceof Array ? [] : {});
+  onEach(source, (item, key) => {
+    let value = func(item, key);
+    if (value !== undefined) {
+      out[key] = value;
+      clean(() => {
+        delete out[key];
+      });
+    }
+  });
+  return out;
 }
-function valueToData(value) {
-    if (typeof value !== "object" || !value) {
-        // Simple data types
-        return value;
-    }
-    else if (value instanceof Store) {
-        // When a Store is passed pointing at a collection, a reference
-        // is made to that collection.
-        return value._observe();
-    }
-    else if (value instanceof Map) {
-        let result = new ObsMap();
-        value.forEach((v, k) => {
-            let d = valueToData(v);
-            if (d !== undefined)
-                result.rawSet(k, d);
+function multiMap(source, func) {
+  let out = optProxy({});
+  onEach(source, (item, key) => {
+    let pairs = func(item, key);
+    if (pairs) {
+      for (let key2 in pairs)
+        out[key2] = pairs[key2];
+      clean(() => {
+        for (let key2 in pairs)
+          delete out[key2];
+      });
+    }
+  });
+  return out;
+}
+function partition(source, func) {
+  const unproxiedOut = {};
+  const out = proxy(unproxiedOut);
+  onEach(source, (item, key) => {
+    let rsp = func(item, key);
+    if (rsp != null) {
+      const buckets = rsp instanceof Array ? rsp : [rsp];
+      if (buckets.length) {
+        for (let bucket of buckets) {
+          if (unproxiedOut[bucket])
+            out[bucket][key] = item;
+          else
+            out[bucket] = { [key]: item };
+        }
+        clean(() => {
+          for (let bucket of buckets) {
+            delete out[bucket][key];
+            if (isObjEmpty(unproxiedOut[bucket]))
+              delete out[bucket];
+          }
         });
-        return result;
-    }
-    else if (value instanceof Array) {
-        let result = new ObsArray();
-        for (let i = 0; i < value.length; i++) {
-            let d = valueToData(value[i]);
-            if (d !== undefined)
-                result.rawSet(i, d);
-        }
-        return result;
-    }
-    else if (value.constructor === Object) {
-        // A plain (literal) object
-        let result = new ObsObject();
-        for (let k in value) {
-            let d = valueToData(value[k]);
-            if (d !== undefined)
-                result.rawSet(k, d);
-        }
-        return result;
-    }
-    else {
-        // Any other type of object (including ObsCollection)
-        return value;
+      }
     }
+  });
+  return out;
 }
-function defaultMakeSortKey(store) {
-    return store.index();
+function dump(data) {
+  if (data && typeof data === "object") {
+    $({ text: data instanceof Array ? "<array>" : "<object>" });
+    $("ul", () => {
+      onEach(data, (value, key) => {
+        $("li:" + JSON.stringify(key) + ": ", () => {
+          dump(value);
+        });
+      });
+    });
+  } else {
+    $({ text: JSON.stringify(data) });
+  }
+  return data;
 }
-/* c8 ignore start */
 function internalError(code) {
-    let error = new Error("Aberdeen internal error " + code);
-    setTimeout(() => { throw error; }, 0);
-}
-/* c8 ignore end */
-function handleError(e) {
-    // Throw the error async, so the rest of the rendering can continue
-    setTimeout(() => { throw e; }, 0);
-}
-class ScopeError extends Error {
-    constructor(mount) {
-        super(`Operation not permitted outside of ${mount ? "a mount" : "an observe"}() scope`);
-    }
+  throw new Error("Aberdeen internal error " + code);
 }
-/** @internal */
-export function withEmitHandler(handler, func) {
-    const oldEmitHandler = ObsCollection.prototype.emitChange;
-    ObsCollection.prototype.emitChange = handler;
-    try {
-        func();
-    }
-    finally {
-        ObsCollection.prototype.emitChange = oldEmitHandler;
-    }
+function handleError(e, showMessage) {
+  try {
+    if (onError(e) === false)
+      showMessage = false;
+  } catch (e2) {
+    console.error(e2);
+  }
+  try {
+    if (showMessage)
+      $("div.aberdeen-error:Error");
+  } catch {}
 }
-/**
- * Run a function, while *not* causing reactive effects for any changes it makes to `Store`s.
- * @param func The function to be executed once immediately.
- */
-export function inhibitEffects(func) {
-    withEmitHandler(() => { }, func);
+function withEmitHandler(handler, func) {
+  const oldEmitHandler = emit;
+  emit = handler;
+  try {
+    func();
+  } finally {
+    emit = oldEmitHandler;
+  }
 }
-// @ts-ignore
-// c8 ignore next
 if (!String.prototype.replaceAll)
-    String.prototype.replaceAll = function (from, to) { return this.split(from).join(to); };
-//# sourceMappingURL=aberdeen.js.map
+  String.prototype.replaceAll = function(from, to) {
+    return this.split(from).join(to);
+  };
+export {
+  withEmitHandler,
+  unproxy,
+  unmountAll,
+  setErrorHandler,
+  runQueue,
+  ref,
+  proxy,
+  peek,
+  partition,
+  onEach,
+  observe,
+  multiMap,
+  mount,
+  map,
+  isEmpty,
+  invertString,
+  insertCss,
+  immediateObserve,
+  getParentElement,
+  dump,
+  defaultEmitHandler,
+  count,
+  copy,
+  clone,
+  clean,
+  SHALLOW,
+  MERGE,
+  $
+};
+
+//# debugId=DE860A8F16A3286C64756E2164756E21
+//# sourceMappingURL=aberdeen.js.map