@zk-tech/bedrock 0.0.1

package/dist/undo-redo-stack/index.js

@@ -0,0 +1,542 @@
+// src/dispose/tracker.ts
+
+// src/dispose/disposable-t.ts
+var SafeDisposable = class {
+  constructor(value) {
+    this._value = value;
+  }
+  get value() {
+    return this._value;
+  }
+  isEmpty() {
+    return this._value === void 0;
+  }
+  dispose() {
+    if (!this._value) {
+      return;
+    }
+    this._value.dispose();
+    this._value = void 0;
+  }
+};
+
+// src/dispose/disposable-utils.ts
+function makeSafeDisposable(fn) {
+  const disposable = new SafeDisposable({
+    dispose: fn
+  });
+  return disposable;
+}
+
+// src/structure/linked-list.ts
+var ListNode = class {
+  constructor(value, next = null, prev = null) {
+    this.value = value;
+    this.next = next;
+    this.prev = prev;
+  }
+};
+var LinkedList = class {
+  constructor() {
+    this._head = null;
+    this._tail = null;
+    this._count = 0;
+  }
+  get size() {
+    return this._count;
+  }
+  get firstNode() {
+    return this._head;
+  }
+  isEmpty() {
+    return this._head === null;
+  }
+  clear() {
+    let current = this._head;
+    while (current !== null) {
+      const next = current.next;
+      current.prev = null;
+      current.next = null;
+      current = next;
+    }
+    this._head = null;
+    this._tail = null;
+    this._count = 0;
+  }
+  unshift(value) {
+    const node = new ListNode(value);
+    if (this.isEmpty()) {
+      this._head = node;
+      this._tail = node;
+    } else {
+      const oldHead = this._head;
+      this._head = node;
+      node.next = oldHead;
+      oldHead.prev = node;
+    }
+    this._count++;
+    return this;
+  }
+  push(value) {
+    const node = new ListNode(value);
+    if (this.isEmpty()) {
+      this._head = node;
+      this._tail = node;
+    } else {
+      const oldTail = this._tail;
+      this._tail = node;
+      node.prev = oldTail;
+      oldTail.next = node;
+    }
+    this._count++;
+    return this;
+  }
+  shift() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const node = this._head;
+    const value = node.value;
+    this._remove(node);
+    return value;
+  }
+  pop() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const node = this._tail;
+    const value = node.value;
+    this._remove(node);
+    return value;
+  }
+  toArray() {
+    const result = [];
+    for (const value of this) {
+      result.push(value);
+    }
+    return result;
+  }
+  *[Symbol.iterator]() {
+    let current = this._head;
+    while (current !== null) {
+      yield current.value;
+      current = current.next;
+    }
+  }
+  _remove(node) {
+    if (node.prev === null && node.next === null && node !== this._head && node !== this._tail) {
+      return;
+    }
+    if (node === this._head) {
+      this._head = node.next;
+      if (this._head) {
+        this._head.prev = null;
+      }
+    }
+    if (node === this._tail) {
+      this._tail = node.prev;
+      if (this._tail) {
+        this._tail.next = null;
+      }
+    }
+    if (node.prev) {
+      node.prev.next = node.next;
+    }
+    if (node.next) {
+      node.next.prev = node.prev;
+    }
+    node.prev = null;
+    node.next = null;
+    this._count--;
+  }
+};
+
+// src/event/disposable-linked-list.ts
+var DisposableLinkedList = class extends LinkedList {
+  unshiftAndGetDisposableNode(value) {
+    this.unshift(value);
+    const node = this._head;
+    let hasRemoved = false;
+    return () => {
+      if (!hasRemoved) {
+        hasRemoved = true;
+        super._remove(node);
+      }
+    };
+  }
+  pushAndGetDisposableNode(value) {
+    this.push(value);
+    const node = this._tail;
+    let hasRemoved = false;
+    return () => {
+      if (!hasRemoved) {
+        hasRemoved = true;
+        super._remove(node);
+      }
+    };
+  }
+};
+
+// src/event/error-handler.ts
+function asyncUnexpectedError(e) {
+  setTimeout(() => {
+    throw e;
+  }, 0);
+}
+
+// src/event/emitter.ts
+var Listener = class {
+  constructor(callback, callbackThis) {
+    this._callback = callback;
+    this._callbackThis = callbackThis;
+  }
+  invoke(...args) {
+    this._callback.call(this._callbackThis, ...args);
+  }
+};
+var EventDeliveryQueueElement = class {
+  constructor(emitter, listener, event) {
+    this.emitter = emitter;
+    this.listener = listener;
+    this.event = event;
+  }
+};
+var EventDeliveryQueue = class {
+  constructor(_onListenerError = asyncUnexpectedError) {
+    this._onListenerError = _onListenerError;
+    this._queue = new DisposableLinkedList();
+  }
+  get size() {
+    return this._queue.size;
+  }
+  push(emitter, listener, event) {
+    this._queue.push(new EventDeliveryQueueElement(emitter, listener, event));
+  }
+  clear(emitter) {
+    const newQueue = new DisposableLinkedList();
+    for (const element of this._queue) {
+      if (element.emitter !== emitter) {
+        newQueue.push(element);
+      }
+    }
+    this._queue = newQueue;
+  }
+  deliver() {
+    while (this._queue.size > 0) {
+      const element = this._queue.shift();
+      try {
+        element.listener.invoke(...element.event);
+      } catch (e) {
+        this._onListenerError(e);
+      }
+    }
+  }
+};
+var Emitter = class {
+  constructor(options) {
+    this._disposed = false;
+    this._options = options;
+  }
+  get event() {
+    if (this._event) {
+      return this._event;
+    }
+    this._event = (callback, thisArgs) => {
+      const listener = new Listener(callback, thisArgs);
+      if (!this._listeners) {
+        this._listeners = new DisposableLinkedList();
+      }
+      const removeListener = this._listeners.pushAndGetDisposableNode(listener);
+      if (this._options?.onAddListener) {
+        this._options.onAddListener(this, callback, thisArgs);
+      }
+      const result = () => {
+        if (!this._disposed) {
+          removeListener();
+          if (this._options?.onRemoveListener) {
+            this._options.onRemoveListener(this, callback, thisArgs);
+          }
+        }
+      };
+      return makeSafeDisposable(result);
+    };
+    return this._event;
+  }
+  dispose() {
+    if (this._disposed) {
+      return;
+    }
+    this._disposed = true;
+    this._listeners?.clear();
+    this._deliveryQueue?.clear(this);
+  }
+  fire(...event) {
+    if (!this._listeners || this._listeners.size === 0) {
+      return;
+    }
+    if (this._listeners.size === 1) {
+      const listener = this._listeners.firstNode;
+      try {
+        listener.value.invoke(...event);
+      } catch (e) {
+        if (this._options?.onListenerError) {
+          this._options.onListenerError(e);
+        } else {
+          asyncUnexpectedError(e);
+        }
+      }
+      return;
+    }
+    this._deliveryQueue ?? (this._deliveryQueue = new EventDeliveryQueue(this._options?.onListenerError));
+    for (const listener of this._listeners) {
+      this._deliveryQueue.push(this, listener, event);
+    }
+    this._deliveryQueue.deliver();
+  }
+};
+
+// src/undo-redo-stack/action-stack.ts
+var BaseActionUndoRedoStack = class {
+  constructor(_limitSize = Infinity) {
+    this._limitSize = _limitSize;
+    this._past = [];
+    this._future = [];
+    this._onDidUndo = new Emitter();
+    this._onDidRedo = new Emitter();
+    this._onStackChange = new Emitter();
+    /**
+     * 进行撤销
+     *
+     * 注意：该方法不允许被子类重写
+     */
+    this.undo = () => {
+      if (!this.canUndo()) {
+        return;
+      }
+      const elements = this._popPastElements();
+      if (elements.length <= 0) {
+        return;
+      }
+      for (const elem of elements) {
+        elem.undo();
+        this._future.push(elem);
+      }
+      this._onDidUndo.fire(elements);
+      this._onStackChange.fire();
+    };
+    /**
+     * 进行重做
+     *
+     * 注意：该方法不允许被子类重写
+     */
+    this.redo = () => {
+      if (!this.canRedo()) {
+        return;
+      }
+      const elements = this._popFutureElements();
+      if (elements.length <= 0) {
+        return;
+      }
+      for (const elem of elements) {
+        elem.redo();
+        this._past.push(elem);
+      }
+      this._onDidRedo.fire(elements);
+      this._onStackChange.fire();
+    };
+    /**
+     * 追加操作进入栈中
+     *
+     * 注意：该方法不允许被子类重写
+     */
+    this.pushElement = (element) => {
+      this._future.length = 0;
+      if (this._isOverflow(element)) {
+        this._past.shift();
+      }
+      this._past.push(element);
+      this._onStackChange.fire();
+    };
+    this.onDidUndo = this._onDidUndo.event;
+    this.onDidRedo = this._onDidRedo.event;
+    this.onStackChange = this._onStackChange.event;
+  }
+  /**
+   * 是否可以撤销。子类可以重写
+   */
+  canUndo() {
+    return this._past.length > 0;
+  }
+  /**
+   * 是否可以重做。子类可以重写
+   */
+  canRedo() {
+    return this._future.length > 0;
+  }
+  /**
+   * 清除undo
+   */
+  clearUndo() {
+    if (this._past.length === 0) {
+      return;
+    }
+    this._past.length = 0;
+    this._onStackChange.fire();
+  }
+  /**
+   * 清除redo
+   */
+  clearRedo() {
+    if (this._future.length === 0) {
+      return;
+    }
+    this._future.length = 0;
+    this._onStackChange.fire();
+  }
+  /**
+   * 重置栈
+   * 清空undo和redo
+   */
+  reset() {
+    if (this._past.length === 0 && this._future.length === 0) {
+      return;
+    }
+    this._past.length = 0;
+    this._future.length = 0;
+    this._onStackChange.fire();
+  }
+  /**
+   * 在undo时找出Past中的元素。子类可以重写
+   */
+  _popPastElements() {
+    return this._past.length ? [this._past.pop()] : [];
+  }
+  /**
+   * 在redo时找出Future中的元素。子类可以重写
+   */
+  _popFutureElements() {
+    return this._future.length ? [this._future.pop()] : [];
+  }
+  /**
+   * 判断新添加元素，是否会超出栈的大小。子类可以重写
+   */
+  _isOverflow(_elem) {
+    return this._past.length >= this._limitSize;
+  }
+};
+
+// src/undo-redo-stack/state-stack.ts
+var StateUndoRedoStack = class {
+  constructor(_currentState, _limitSize = Infinity) {
+    this._currentState = _currentState;
+    this._limitSize = _limitSize;
+    this._past = [];
+    this._future = [];
+    this._onDidUndo = new Emitter();
+    this._onDidRedo = new Emitter();
+    this._onStackChange = new Emitter();
+    this.onDidUndo = this._onDidUndo.event;
+    this.onDidRedo = this._onDidRedo.event;
+    this.onStackChange = this._onStackChange.event;
+  }
+  get currentState() {
+    return this._currentState;
+  }
+  /**
+   * 进行撤销
+   */
+  undo() {
+    if (!this.canUndo()) {
+      return;
+    }
+    this._future.push(this._currentState);
+    this._currentState = this._past.pop();
+    this._onDidUndo.fire(this._currentState);
+    this._onStackChange.fire();
+  }
+  /**
+   * 进行重做
+   *
+   * 注意：该方法不允许被子类重写
+   */
+  redo() {
+    if (!this.canRedo()) {
+      return;
+    }
+    this._past.push(this._currentState);
+    this._currentState = this._future.pop();
+    this._onDidRedo.fire(this._currentState);
+    this._onStackChange.fire();
+  }
+  /**
+   * 追加操作进入栈中
+   *
+   * 注意：该方法不允许被子类重写
+   */
+  pushElement(element) {
+    this._future.length = 0;
+    if (this._isOverflow(element)) {
+      this._past.shift();
+    }
+    if (this._currentState) {
+      this._past.push(this._currentState);
+    }
+    this._currentState = element;
+    this._onStackChange.fire();
+  }
+  /**
+   * 是否可以撤销
+   */
+  canUndo() {
+    return this._past.length > 0;
+  }
+  /**
+   * 是否可以重做
+   */
+  canRedo() {
+    return this._future.length > 0;
+  }
+  /**
+   * 清除undo
+   */
+  clearUndo() {
+    if (this._past.length === 0) {
+      return;
+    }
+    this._past.length = 0;
+    this._onStackChange.fire();
+  }
+  /**
+   * 清除redo
+   */
+  clearRedo() {
+    if (this._future.length === 0) {
+      return;
+    }
+    this._future.length = 0;
+    this._onStackChange.fire();
+  }
+  /**
+   * 重置栈
+   * 清空undo和redo
+   */
+  reset(state) {
+    if (this._past.length === 0 && this._future.length === 0 && this._currentState === state) {
+      return;
+    }
+    this._past.length = 0;
+    this._future.length = 0;
+    this._currentState = state;
+    this._onStackChange.fire();
+  }
+  /**
+   * 判断新添加元素，是否会超出栈的大小
+   */
+  _isOverflow(_elem) {
+    return this._past.length >= this._limitSize;
+  }
+};
+
+export { BaseActionUndoRedoStack, StateUndoRedoStack };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/undo-redo-stack/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/dispose/disposable-t.ts","../../src/dispose/disposable-utils.ts","../../src/structure/linked-list.ts","../../src/event/disposable-linked-list.ts","../../src/event/error-handler.ts","../../src/event/emitter.ts","../../src/undo-redo-stack/action-stack.ts","../../src/undo-redo-stack/state-stack.ts"],"names":[],"mappings":";;;AAyGO,IAAM,iBAAN,MAAmE;AAAA,EAGxE,YAAY,KAAA,EAAU;AACpB,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACO,EACvB;AAAA,EAEA,IAAI,KAAA,GAAuB;AACzB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA,EAEA,OAAA,GAAU;AACR,IAAA,OAAO,KAAK,MAAA,KAAW,MAAA;AAAA,EACzB;AAAA,EAEA,OAAA,GAAU;AACR,IAAA,IAAI,CAAC,KAAK,MAAA,EAAQ;AAChB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,OAAO,OAAA,EAAQ;AACpB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACO,EACvB;AACF,CAAA;;;AC7HO,SAAS,mBAAmB,EAAA,EAA2B;AAC5D,EAAA,MAAM,UAAA,GAAa,IAAI,cAAA,CAAe;AAAA,IACpC,OAAA,EAAS;AAAA,GACV,CAAA;AACD,EAAA,OAAO,UAAA;AACT;;;ACTA,IAAM,WAAN,MAAkB;AAAA,EAChB,WAAA,CACS,KAAA,EACA,IAAA,GAA2B,IAAA,EAC3B,OAA2B,IAAA,EAClC;AAHO,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAAA,EACN;AACL,CAAA;AAEO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,MAAA,GAAS,CAAA;AAAA,EAAA;AAAA,EAEnB,IAAW,IAAA,GAAe;AACxB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA,EAEA,IAAW,SAAA,GAAgC;AACzC,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEO,OAAA,GAAmB;AACxB,IAAA,OAAO,KAAK,KAAA,KAAU,IAAA;AAAA,EACxB;AAAA,EAEO,KAAA,GAAc;AACnB,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAO,OAAA,CAAQ,IAAA;AACrB,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAEA,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,MAAA,GAAS,CAAA;AAAA,EAChB;AAAA,EAEO,QAAQ,KAAA,EAAyB;AACtC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAK,KAAA,EAAyB;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,GAAA,GAAgB;AACrB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,OAAA,GAAe;AACpB,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,KAAA,MAAW,SAAS,IAAA,EAAM;AACxB,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACnB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEA,EAAS,MAAA,CAAO,QAAQ,CAAA,GAAiB;AACvC,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAA,CAAQ,KAAA;AACd,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEU,QAAQ,IAAA,EAAyB;AAEzC,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,IAAA,CAAK,KAAA,IAAS,IAAA,KAAS,IAAA,CAAK,KAAA,EAAO;AAC1F,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AAGA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AACA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AAGA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,MAAA,EAAA;AAAA,EACP;AACF,CAAA;;;AC9IO,IAAM,oBAAA,GAAN,cAAsC,UAAA,CAAc;AAAA,EACzD,4BAA4B,KAAA,EAAsB;AAChD,IAAA,IAAA,CAAK,QAAQ,KAAK,CAAA;AAElB,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,IAAI,UAAA,GAAa,KAAA;AACjB,IAAA,OAAO,MAAY;AACjB,MAAA,IAAI,CAAC,UAAA,EAAY;AACf,QAAA,UAAA,GAAa,IAAA;AACb,QAAA,KAAA,CAAM,QAAQ,IAAI,CAAA;AAAA,MACpB;AAAA,IACF,CAAA;AAAA,EACF;AAAA,EAEA,yBAAyB,KAAA,EAAsB;AAC7C,IAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAEf,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,IAAI,UAAA,GAAa,KAAA;AACjB,IAAA,OAAO,MAAY;AACjB,MAAA,IAAI,CAAC,UAAA,EAAY;AACf,QAAA,UAAA,GAAa,IAAA;AACb,QAAA,KAAA,CAAM,QAAQ,IAAI,CAAA;AAAA,MACpB;AAAA,IACF,CAAA;AAAA,EACF;AACF,CAAA;;;ACxBO,SAAS,qBAAqB,CAAA,EAAc;AACjD,EAAA,UAAA,CAAW,MAAM;AACf,IAAA,MAAM,CAAA;AAAA,EACR,GAAG,CAAC,CAAA;AACN;;;ACMA,IAAM,WAAN,MAAoC;AAAA,EAIlC,WAAA,CAAY,UAAoC,YAAA,EAA+B;AAC7E,IAAA,IAAA,CAAK,SAAA,GAAY,QAAA;AACjB,IAAA,IAAA,CAAK,aAAA,GAAgB,YAAA;AAAA,EACvB;AAAA,EAEA,UAAU,IAAA,EAAmB;AAC3B,IAAA,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,IAAA,CAAK,aAAA,EAAe,GAAG,IAAI,CAAA;AAAA,EACjD;AACF,CAAA;AAKA,IAAM,4BAAN,MAAqD;AAAA,EAInD,WAAA,CAAY,OAAA,EAAyB,QAAA,EAA2B,KAAA,EAAc;AAC5E,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AACF,CAAA;AAEO,IAAM,qBAAN,MAAyB;AAAA,EAG9B,WAAA,CAA6B,mBAAyC,oBAAA,EAAsB;AAA/D,IAAA,IAAA,CAAA,gBAAA,GAAA,gBAAA;AAF7B,IAAA,IAAA,CAAU,MAAA,GAAS,IAAI,oBAAA,EAAqD;AAAA,EAEiB;AAAA,EAE7F,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,KAAK,MAAA,CAAO,IAAA;AAAA,EACrB;AAAA,EAEA,IAAA,CAA0B,OAAA,EAAyB,QAAA,EAA2B,KAAA,EAAoB;AAChG,IAAA,IAAA,CAAK,OAAO,IAAA,CAAK,IAAI,0BAA0B,OAAA,EAAS,QAAA,EAAU,KAAK,CAAC,CAAA;AAAA,EAC1E;AAAA,EAEA,MAA2B,OAAA,EAA+B;AACxD,IAAA,MAAM,QAAA,GAAW,IAAI,oBAAA,EAAuD;AAC5E,IAAA,KAAA,MAAW,OAAA,IAAW,KAAK,MAAA,EAAQ;AACjC,MAAA,IAAI,OAAA,CAAQ,YAAY,OAAA,EAAS;AAC/B,QAAA,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,MACvB;AAAA,IACF;AACA,IAAA,IAAA,CAAK,MAAA,GAAS,QAAA;AAAA,EAChB;AAAA,EAEA,OAAA,GAAgB;AACd,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,GAAO,CAAA,EAAG;AAC3B,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,KAAA,EAAM;AAClC,MAAA,IAAI;AACF,QAAA,OAAA,CAAQ,QAAA,CAAS,MAAA,CAAO,GAAG,OAAA,CAAQ,KAAK,CAAA;AAAA,MAC1C,SAAS,CAAA,EAAG;AACV,QAAA,IAAA,CAAK,iBAAiB,CAAC,CAAA;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AACF,CAAA;AAMO,IAAM,UAAN,MAAmC;AAAA,EAOxC,YAAY,OAAA,EAA0B;AAJtC,IAAA,IAAA,CAAQ,SAAA,GAAY,KAAA;AAKlB,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAAA,EAClB;AAAA,EAEA,IAAI,KAAA,GAAsB;AACxB,IAAA,IAAI,KAAK,MAAA,EAAQ;AACf,MAAA,OAAO,IAAA,CAAK,MAAA;AAAA,IACd;AAEA,IAAA,IAAA,CAAK,MAAA,GAAS,CAAC,QAAA,EAAmC,QAAA,KAAgC;AAChF,MAAA,MAAM,QAAA,GAAW,IAAI,QAAA,CAAS,QAAA,EAAU,QAAQ,CAAA;AAEhD,MAAA,IAAI,CAAC,KAAK,UAAA,EAAY;AACpB,QAAA,IAAA,CAAK,UAAA,GAAa,IAAI,oBAAA,EAAqB;AAAA,MAC7C;AAEA,MAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,UAAA,CAAW,wBAAA,CAAyB,QAAQ,CAAA;AAExE,MAAA,IAAI,IAAA,CAAK,UAAU,aAAA,EAAe;AAChC,QAAA,IAAA,CAAK,QAAA,CAAS,aAAA,CAAc,IAAA,EAAM,QAAA,EAAU,QAAQ,CAAA;AAAA,MACtD;AAGA,MAAA,MAAM,SAAS,MAAM;AACnB,QAAA,IAAI,CAAC,KAAK,SAAA,EAAW;AACnB,UAAA,cAAA,EAAe;AACf,UAAA,IAAI,IAAA,CAAK,UAAU,gBAAA,EAAkB;AACnC,YAAA,IAAA,CAAK,QAAA,CAAS,gBAAA,CAAiB,IAAA,EAAM,QAAA,EAAU,QAAQ,CAAA;AAAA,UACzD;AAAA,QACF;AAAA,MACF,CAAA;AAEA,MAAA,OAAO,mBAAmB,MAAM,CAAA;AAAA,IAClC,CAAA;AAEA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA,EAEA,OAAA,GAAgB;AACd,IAAA,IAAI,KAAK,SAAA,EAAW;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AACvB,IAAA,IAAA,CAAK,cAAA,EAAgB,MAAM,IAAI,CAAA;AAAA,EACjC;AAAA,EAEA,QAAQ,KAAA,EAAoB;AAC1B,IAAA,IAAI,CAAC,IAAA,CAAK,UAAA,IAAc,IAAA,CAAK,UAAA,CAAW,SAAS,CAAA,EAAG;AAClD,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,UAAA,CAAW,IAAA,KAAS,CAAA,EAAG;AAC9B,MAAA,MAAM,QAAA,GAAW,KAAK,UAAA,CAAW,SAAA;AACjC,MAAA,IAAI;AACF,QAAA,QAAA,CAAS,KAAA,CAAM,MAAA,CAAO,GAAG,KAAK,CAAA;AAAA,MAChC,SAAS,CAAA,EAAG;AACV,QAAA,IAAI,IAAA,CAAK,UAAU,eAAA,EAAiB;AAClC,UAAA,IAAA,CAAK,QAAA,CAAS,gBAAgB,CAAC,CAAA;AAAA,QACjC,CAAA,MAAO;AACL,UAAA,oBAAA,CAAqB,CAAC,CAAA;AAAA,QACxB;AAAA,MACF;AACA,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,mBAAL,IAAA,CAAK,cAAA,GAAmB,IAAI,kBAAA,CAAmB,IAAA,CAAK,UAAU,eAAe,CAAA,CAAA;AAE7E,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,UAAA,EAAY;AACtC,MAAA,IAAA,CAAK,cAAA,CAAe,IAAA,CAAK,IAAA,EAAM,QAAA,EAAU,KAAK,CAAA;AAAA,IAChD;AACA,IAAA,IAAA,CAAK,eAAe,OAAA,EAAQ;AAAA,EAC9B;AACF,CAAA;;;AC9JO,IAAM,0BAAN,MAA6D;AAAA,EAelE,WAAA,CAA+B,aAAa,QAAA,EAAU;AAAvB,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AAP/B,IAAA,IAAA,CAAmB,QAAa,EAAC;AACjC,IAAA,IAAA,CAAmB,UAAe,EAAC;AAEnC,IAAA,IAAA,CAAU,UAAA,GAAa,IAAI,OAAA,EAAe;AAC1C,IAAA,IAAA,CAAU,UAAA,GAAa,IAAI,OAAA,EAAe;AAC1C,IAAA,IAAA,CAAU,cAAA,GAAiB,IAAI,OAAA,EAAY;AAa3C;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAS,OAAO,MAAY;AAC1B,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnB,QAAA;AAAA,MACF;AACA,MAAA,MAAM,QAAA,GAAW,KAAK,gBAAA,EAAiB;AACvC,MAAA,IAAI,QAAA,CAAS,UAAU,CAAA,EAAG;AACxB,QAAA;AAAA,MACF;AACA,MAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,QAAA,IAAA,CAAK,IAAA,EAAK;AACV,QAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,IAAI,CAAA;AAAA,MACxB;AACA,MAAA,IAAA,CAAK,UAAA,CAAW,KAAK,QAAQ,CAAA;AAC7B,MAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,IAC3B,CAAA;AAOA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAS,OAAO,MAAY;AAC1B,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnB,QAAA;AAAA,MACF;AACA,MAAA,MAAM,QAAA,GAAW,KAAK,kBAAA,EAAmB;AACzC,MAAA,IAAI,QAAA,CAAS,UAAU,CAAA,EAAG;AACxB,QAAA;AAAA,MACF;AACA,MAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,QAAA,IAAA,CAAK,IAAA,EAAK;AACV,QAAA,IAAA,CAAK,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,MACtB;AACA,MAAA,IAAA,CAAK,UAAA,CAAW,KAAK,QAAQ,CAAA;AAC7B,MAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,IAC3B,CAAA;AAOA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAS,WAAA,GAAc,CAAC,OAAA,KAAqB;AAC3C,MAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,MAAA,IAAI,IAAA,CAAK,WAAA,CAAY,OAAO,CAAA,EAAG;AAC7B,QAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,MACnB;AACA,MAAA,IAAA,CAAK,KAAA,CAAM,KAAK,OAAO,CAAA;AACvB,MAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,IAC3B,CAAA;AA3DE,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,UAAA,CAAW,KAAA;AACjC,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,UAAA,CAAW,KAAA;AACjC,IAAA,IAAA,CAAK,aAAA,GAAgB,KAAK,cAAA,CAAe,KAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EA6DO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKO,SAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAC3B,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AACpB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKO,SAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AAC7B,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,KAAA,GAAc;AACnB,IAAA,IAAI,KAAK,KAAA,CAAM,MAAA,KAAW,KAAK,IAAA,CAAK,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxD,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AACpB,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKU,gBAAA,GAAwB;AAChC,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,GAAS,CAAC,KAAK,KAAA,CAAM,GAAA,EAAM,CAAA,GAAI,EAAC;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAKU,kBAAA,GAA0B;AAClC,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAC,KAAK,OAAA,CAAQ,GAAA,EAAM,CAAA,GAAI,EAAC;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAKU,YAAY,KAAA,EAAU;AAC9B,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,IAAU,IAAA,CAAK,UAAA;AAAA,EACnC;AACF;;;AClJO,IAAM,qBAAN,MAA4B;AAAA,EAejC,WAAA,CACY,aAAA,EACS,UAAA,GAAa,QAAA,EAChC;AAFU,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AACS,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AATrB,IAAA,IAAA,CAAmB,QAAa,EAAC;AACjC,IAAA,IAAA,CAAmB,UAAe,EAAC;AAEnC,IAAA,IAAA,CAAU,UAAA,GAAa,IAAI,OAAA,EAAa;AACxC,IAAA,IAAA,CAAU,UAAA,GAAa,IAAI,OAAA,EAAa;AACxC,IAAA,IAAA,CAAU,cAAA,GAAiB,IAAI,OAAA,EAAY;AAMzC,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,UAAA,CAAW,KAAA;AACjC,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,UAAA,CAAW,KAAA;AACjC,IAAA,IAAA,CAAK,aAAA,GAAgB,KAAK,cAAA,CAAe,KAAA;AAAA,EAC3C;AAAA,EAEA,IAAI,YAAA,GAAe;AACjB,IAAA,OAAO,IAAA,CAAK,aAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,IAAA,GAAO;AACZ,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AACpC,IAAA,IAAA,CAAK,aAAA,GAAgB,IAAA,CAAK,KAAA,CAAM,GAAA,EAAI;AACpC,IAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,IAAA,GAAO;AACZ,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AAClC,IAAA,IAAA,CAAK,aAAA,GAAgB,IAAA,CAAK,OAAA,CAAQ,GAAA,EAAI;AACtC,IAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,YAAY,OAAA,EAAY;AAC7B,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAI,IAAA,CAAK,WAAA,CAAY,OAAO,CAAA,EAAG;AAC7B,MAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,IACnB;AACA,IAAA,IAAI,KAAK,aAAA,EAAe;AACtB,MAAA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AAAA,IACpC;AACA,IAAA,IAAA,CAAK,aAAA,GAAgB,OAAA;AACrB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKO,SAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAC3B,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AACpB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKO,SAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AAC7B,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,MAAM,KAAA,EAAgB;AAC3B,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,QAAQ,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,aAAA,KAAkB,KAAA,EAAO;AACxF,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AACpB,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,aAAA,GAAgB,KAAA;AACrB,IAAA,IAAA,CAAK,eAAe,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKU,YAAY,KAAA,EAAU;AAC9B,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,IAAU,IAAA,CAAK,UAAA;AAAA,EACnC;AACF","file":"index.js","sourcesContent":["import { Logger } from '@/_internal/logger';\nimport { lvAssertNotNil } from '@/assert';\nimport { DisposableStore } from './disposable-store';\nimport type { IDisposable } from './dispose-base';\nimport { BRANCH_DISPOSE } from './logger';\nimport { MARK_AS_DISPOSED, SET_PARENT_OF_DISPOSABLE, TRACK_DISPOSABLE } from './tracker';\n\n//\n// Disposable基类\n//\n// 自动添加DisposableStore，提供默认的dispose和register方法\n//\nexport abstract class Disposable implements IDisposable {\n  protected readonly _store = new DisposableStore();\n\n  constructor() {\n    TRACK_DISPOSABLE(this);\n    SET_PARENT_OF_DISPOSABLE(this._store, this);\n  }\n\n  // 销毁该节点和所有的子节点\n  dispose(): void {\n    MARK_AS_DISPOSED(this);\n    BRANCH_DISPOSE(this.constructor.name, this._store.constructor.name);\n\n    this._store.dispose();\n  }\n\n  // 挂载子节点\n  protected _register<T extends IDisposable>(o: T): T {\n    if ((o as unknown as Disposable) === this) {\n      throw new Error('Cannot register a disposable on itself!');\n    }\n    return this._store.add(o);\n  }\n}\n\n/**\n * 容器类\n * 提供一个容器，容器内部的IDisposable对象可以切换更新，每次更新的时候，旧的IDisposable对象会自动进行dispose\n *\n * 使用方式:\n * class Foo {\n *   private readonly _barRef: MutableDisposable;\n *\n *   toggle() {\n *     this._barRef.setValue(new Bar());\n *   }\n *\n *   doSomething() {\n *     this._barRef.value.xxx();\n *   }\n * }\n */\nexport class MutableDisposable<T extends IDisposable> implements IDisposable {\n  private _value?: T;\n  private _isDisposed = false;\n\n  constructor(value?: T) {\n    TRACK_DISPOSABLE(this);\n    this.value = value;\n  }\n\n  get value(): T | undefined {\n    return this._isDisposed ? undefined : this._value;\n  }\n\n  set value(value: T | undefined) {\n    if (this._isDisposed || value === this._value) {\n      return;\n    }\n\n    this._value?.dispose();\n    if (value) {\n      SET_PARENT_OF_DISPOSABLE(value, this);\n    }\n    this._value = value;\n  }\n\n  clear(): void {\n    this.value = undefined;\n  }\n\n  dispose(): void {\n    this._isDisposed = true;\n    MARK_AS_DISPOSED(this);\n    this._value?.dispose();\n    this._value = undefined;\n  }\n\n  release(): T | undefined {\n    const oldValue = this._value;\n    this._value = undefined;\n    if (oldValue) {\n      SET_PARENT_OF_DISPOSABLE(oldValue, null);\n    }\n    return oldValue;\n  }\n}\n\n/**\n * 容器类\n * 通过该容器进行dispose试，可以保证内部的IDisposable一会进行一次dispose\n * 本质是一种防御性质的处理，如果需要使用时，最好有明确的理由\n */\nexport class SafeDisposable<T extends IDisposable> implements IDisposable {\n  private _value?: T;\n\n  constructor(value: T) {\n    this._value = value;\n    TRACK_DISPOSABLE(this);\n  }\n\n  get value(): T | undefined {\n    return this._value;\n  }\n\n  isEmpty() {\n    return this._value === undefined;\n  }\n\n  dispose() {\n    if (!this._value) {\n      return;\n    }\n    this._value.dispose();\n    this._value = undefined;\n    MARK_AS_DISPOSED(this);\n  }\n}\n\n/**\n * 容器类\n * 引用计数容器，当引用为0时自动执行dispose\n * 注意：初始计数为1，默认构造的地方自动获得引用，如果在栈上构造，记得最后调用release\n *\n * 使用实例:\n * class Foo {\n *   private _bar: RefCountedDisposable = new RefCountedDisposable(new Bar());\n *\n *   getBar() {\n *     this._bar.acquire();\n *     return this._bar;\n *   }\n * }\n *\n * // 如果在栈上构造\n * const bar = new RefCountedDisposable(new Bar());\n * makeFoo(bar);\n * makeFoo(bar);\n * bar.release();\n */\nexport class RefCountedDisposable<T extends IDisposable> implements IDisposable {\n  private _counter: number = 1;\n  private _value?: T;\n\n  constructor(value: T) {\n    this._value = value;\n    TRACK_DISPOSABLE(this);\n  }\n\n  get value(): T | undefined {\n    return this._value;\n  }\n\n  acquire() {\n    if (!this._value) {\n      return this;\n    }\n    this._counter++;\n    return this;\n  }\n\n  release() {\n    if (--this._counter === 0) {\n      this._value!.dispose();\n      this._value = undefined;\n      MARK_AS_DISPOSED(this);\n    }\n    return this;\n  }\n\n  dispose() {\n    this.release();\n  }\n}\n\n/**\n * 容器类，表示了一个T生命周期的转移\n *\n * 由于js引用传递的特性，正常情况下，我们默认为传递过来的对象不具备dispose权利\n * class Foo extends Disposable {\n *   private readonly _bar = new Bar();\n *\n *   constructor(\n *     thirdparty: Thirdparty,\n *   ) {\n *     this._register(this._bar);  // class内部构造的，具备dispose权利\n *     this._register(thirdparty);  // ❌，很少会直接这么写，除非能很确定存在生命周期转移\n *   }\n *\n *   constructor(\n *     thirdparty: TransferDisposable<Thirdparty>,  // ✅，明确表示了我依赖了Thirdparty，但是该对象生命周期要归我所有\n *   ) {\n *     this._register(this._bar);\n *     this._register(thirdparty.release());  // ✅，可以直接register\n *   }\n * }\n *\n * 注意：\n * 不同于C++中的unique_ptr，该class只作用于转移场景。\n * 所以class理论上只在栈上出现，不应该在堆上存在。\n * 如果出现了需要在堆上存储的场景，可以联系架构侧\n */\nexport class TransferDisposable<T extends IDisposable> extends Disposable {\n  private _val?: T;\n\n  constructor(val: T) {\n    super();\n\n    this._val = val;\n  }\n\n  release() {\n    // 只能release一次\n    lvAssertNotNil(this._val);\n    const v = this._val;\n    this._val = undefined;\n    return v;\n  }\n\n  dispose(): void {\n    // 虽然它有dispose，但是不应该被执行，应该直接被gc才对\n    Logger.warn(new Error('TransferDisposable call dispose.'));\n    this._val?.dispose();\n    super.dispose();\n  }\n}\n","import { SafeDisposable, TransferDisposable } from './disposable-t';\nimport { EmptyDispose, type IDisposable } from './dispose-base';\nimport { MARK_AS_LEAKED } from './tracker';\n\nexport function makeSafeDisposable(fn: (...args: any) => any) {\n  const disposable = new SafeDisposable({\n    dispose: fn,\n  });\n  return disposable;\n}\n\nexport function makeEmptyDisposable() {\n  return EmptyDispose;\n}\n\n// 忽略dispose\nexport function ignoreDispose(x: IDisposable) {\n  MARK_AS_LEAKED(x);\n}\n\n// 判断一个thing是否是disposable\nexport function isDisposable<E = any>(thing: E): thing is E & IDisposable {\n  return typeof (thing as IDisposable).dispose === 'function' && (thing as IDisposable).dispose.length === 0;\n}\n\nexport function makeTransferDisposable<T extends IDisposable>(val: T) {\n  return new TransferDisposable(val);\n}\n","class ListNode<T> {\n  constructor(\n    public value: T,\n    public next: ListNode<T> | null = null,\n    public prev: ListNode<T> | null = null,\n  ) {}\n}\n\nexport class LinkedList<T> {\n  protected _head: ListNode<T> | null = null;\n  protected _tail: ListNode<T> | null = null;\n  protected _count = 0;\n\n  public get size(): number {\n    return this._count;\n  }\n\n  public get firstNode(): ListNode<T> | null {\n    return this._head;\n  }\n\n  public isEmpty(): boolean {\n    return this._head === null;\n  }\n\n  public clear(): void {\n    let current = this._head;\n    while (current !== null) {\n      const next = current.next;\n      current.prev = null;\n      current.next = null;\n      current = next;\n    }\n\n    this._head = null;\n    this._tail = null;\n    this._count = 0;\n  }\n\n  public unshift(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldHead = this._head;\n      this._head = node;\n      node.next = oldHead;\n      oldHead!.prev = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public push(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldTail = this._tail;\n      this._tail = node;\n      node.prev = oldTail;\n      oldTail!.next = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public shift(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._head!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public pop(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._tail!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public toArray(): T[] {\n    const result: T[] = [];\n    for (const value of this) {\n      result.push(value);\n    }\n    return result;\n  }\n\n  public *[Symbol.iterator](): Iterator<T> {\n    let current = this._head;\n    while (current !== null) {\n      yield current.value;\n      current = current.next;\n    }\n  }\n\n  protected _remove(node: ListNode<T>): void {\n    // 如果节点已经被移除（prev 和 next 都为 null），直接返回\n    if (node.prev === null && node.next === null && node !== this._head && node !== this._tail) {\n      return;\n    }\n\n    // 更新链表头尾指针\n    if (node === this._head) {\n      this._head = node.next;\n      if (this._head) {\n        this._head.prev = null;\n      }\n    }\n    if (node === this._tail) {\n      this._tail = node.prev;\n      if (this._tail) {\n        this._tail.next = null;\n      }\n    }\n\n    // 更新相邻节点的引用\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    }\n\n    // 清理被移除节点的引用\n    node.prev = null;\n    node.next = null;\n    this._count--;\n  }\n}\n","import { LinkedList } from '@/structure/linked-list';\n\nexport class DisposableLinkedList<T> extends LinkedList<T> {\n  unshiftAndGetDisposableNode(value: T): () => void {\n    this.unshift(value);\n\n    const node = this._head!;\n    let hasRemoved = false;\n    return (): void => {\n      if (!hasRemoved) {\n        hasRemoved = true;\n        super._remove(node);\n      }\n    };\n  }\n\n  pushAndGetDisposableNode(value: T): () => void {\n    this.push(value);\n\n    const node = this._tail!;\n    let hasRemoved = false;\n    return (): void => {\n      if (!hasRemoved) {\n        hasRemoved = true;\n        super._remove(node);\n      }\n    };\n  }\n}\n","/**\n * 针对未捕获的错误，异步抛出，不阻塞事件响应主流程\n * 默认模式\n */\nexport function asyncUnexpectedError(e: any): void {\n  setTimeout(() => {\n    throw e;\n  }, 0);\n}\n\n/**\n * 针对未捕获的错误，同步抛出，阻塞事件响应主流程\n */\nexport function syncUnexpectedError(e: any): void {\n  throw e;\n}\n\n/**\n * 针对未捕获的错误，静默掉，不进行处理\n */\n// eslint-disable-next-line @typescript-eslint/no-empty-function\nexport function ignoreUnexpectedError(e: any): void {}\n","import { makeSafeDisposable } from '@/dispose';\nimport type { IDisposable } from '@/dispose';\nimport { DisposableLinkedList } from './disposable-linked-list';\nimport { asyncUnexpectedError } from './error-handler';\n\nexport interface EmitterOptions {\n  onAddListener?: (...args: any) => any;\n  onRemoveListener?: (...args: any) => any;\n  onListenerError?: (e: any) => void;\n}\n\n//\n// 事件监听中的回调实体\n//\nclass Listener<TArgs extends any[]> {\n  private readonly _callback: (...args: TArgs) => void;\n  private readonly _callbackThis: any | undefined;\n\n  constructor(callback: (...args: TArgs) => void, callbackThis: any | undefined) {\n    this._callback = callback;\n    this._callbackThis = callbackThis;\n  }\n\n  invoke(...args: TArgs): void {\n    this._callback.call(this._callbackThis, ...args);\n  }\n}\n\n//\n// 存放在EventDeliveryQueue中的元素\n//\nclass EventDeliveryQueueElement<TArgs extends any[]> {\n  readonly emitter: Emitter<TArgs>;\n  readonly listener: Listener<TArgs>;\n  readonly event: TArgs;\n  constructor(emitter: Emitter<TArgs>, listener: Listener<TArgs>, event: TArgs) {\n    this.emitter = emitter;\n    this.listener = listener;\n    this.event = event;\n  }\n}\n\nexport class EventDeliveryQueue {\n  protected _queue = new DisposableLinkedList<EventDeliveryQueueElement<any>>();\n\n  constructor(private readonly _onListenerError: (e: unknown) => void = asyncUnexpectedError) {}\n\n  get size(): number {\n    return this._queue.size;\n  }\n\n  push<TArgs extends any[]>(emitter: Emitter<TArgs>, listener: Listener<TArgs>, event: TArgs): void {\n    this._queue.push(new EventDeliveryQueueElement(emitter, listener, event));\n  }\n\n  clear<TArgs extends any[]>(emitter: Emitter<TArgs>): void {\n    const newQueue = new DisposableLinkedList<EventDeliveryQueueElement<TArgs>>();\n    for (const element of this._queue) {\n      if (element.emitter !== emitter) {\n        newQueue.push(element);\n      }\n    }\n    this._queue = newQueue;\n  }\n\n  deliver(): void {\n    while (this._queue.size > 0) {\n      const element = this._queue.shift()!;\n      try {\n        element.listener.invoke(...element.event);\n      } catch (e) {\n        this._onListenerError(e);\n      }\n    }\n  }\n}\n\nexport interface Event<T extends any[]> {\n  (listener: (...args: T) => any, thisArgs?: any): IDisposable;\n}\n\nexport class Emitter<TArgs extends any[]> {\n  protected _listeners?: DisposableLinkedList<Listener<TArgs>>;\n  private readonly _options?: EmitterOptions;\n  private _disposed = false;\n  private _event?: Event<TArgs>;\n  private _deliveryQueue?: EventDeliveryQueue;\n\n  constructor(options?: EmitterOptions) {\n    this._options = options;\n  }\n\n  get event(): Event<TArgs> {\n    if (this._event) {\n      return this._event;\n    }\n\n    this._event = (callback: (...args: TArgs) => any, thisArgs?: any): IDisposable => {\n      const listener = new Listener(callback, thisArgs);\n\n      if (!this._listeners) {\n        this._listeners = new DisposableLinkedList();\n      }\n\n      const removeListener = this._listeners.pushAndGetDisposableNode(listener);\n\n      if (this._options?.onAddListener) {\n        this._options.onAddListener(this, callback, thisArgs);\n      }\n\n      // 生成可销毁函数返回\n      const result = () => {\n        if (!this._disposed) {\n          removeListener();\n          if (this._options?.onRemoveListener) {\n            this._options.onRemoveListener(this, callback, thisArgs);\n          }\n        }\n      };\n\n      return makeSafeDisposable(result);\n    };\n\n    return this._event;\n  }\n\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n    this._disposed = true;\n    this._listeners?.clear();\n    this._deliveryQueue?.clear(this);\n  }\n\n  fire(...event: TArgs): void {\n    if (!this._listeners || this._listeners.size === 0) {\n      return;\n    }\n    // 绝大部分场景事件只会有一个监听器，针对性进行性能优化，没必要构造DeliveryQueue结构\n    if (this._listeners.size === 1) {\n      const listener = this._listeners.firstNode!;\n      try {\n        listener.value.invoke(...event);\n      } catch (e) {\n        if (this._options?.onListenerError) {\n          this._options.onListenerError(e);\n        } else {\n          asyncUnexpectedError(e);\n        }\n      }\n      return;\n    }\n\n    this._deliveryQueue ??= new EventDeliveryQueue(this._options?.onListenerError);\n\n    for (const listener of this._listeners) {\n      this._deliveryQueue.push(this, listener, event);\n    }\n    this._deliveryQueue.deliver();\n  }\n}\n","import { Emitter, type Event } from '../event';\nimport type { IActionStackElement } from './element';\n\nexport class BaseActionUndoRedoStack<T extends IActionStackElement> {\n  // 当undo结束后触发\n  public onDidUndo: Event<[T[]]>;\n  // 当redo结束后触发\n  public onDidRedo: Event<[T[]]>;\n  // 当栈发生变化时触发\n  public onStackChange: Event<[]>;\n\n  protected readonly _past: T[] = [];\n  protected readonly _future: T[] = [];\n\n  protected _onDidUndo = new Emitter<[T[]]>();\n  protected _onDidRedo = new Emitter<[T[]]>();\n  protected _onStackChange = new Emitter<[]>();\n\n  constructor(protected readonly _limitSize = Infinity) {\n    this.onDidUndo = this._onDidUndo.event;\n    this.onDidRedo = this._onDidRedo.event;\n    this.onStackChange = this._onStackChange.event;\n  }\n\n  /**\n   * 进行撤销\n   *\n   * 注意：该方法不允许被子类重写\n   */\n  readonly undo = (): void => {\n    if (!this.canUndo()) {\n      return;\n    }\n    const elements = this._popPastElements();\n    if (elements.length <= 0) {\n      return;\n    }\n    for (const elem of elements) {\n      elem.undo();\n      this._future.push(elem);\n    }\n    this._onDidUndo.fire(elements);\n    this._onStackChange.fire();\n  };\n\n  /**\n   * 进行重做\n   *\n   * 注意：该方法不允许被子类重写\n   */\n  readonly redo = (): void => {\n    if (!this.canRedo()) {\n      return;\n    }\n    const elements = this._popFutureElements();\n    if (elements.length <= 0) {\n      return;\n    }\n    for (const elem of elements) {\n      elem.redo();\n      this._past.push(elem);\n    }\n    this._onDidRedo.fire(elements);\n    this._onStackChange.fire();\n  };\n\n  /**\n   * 追加操作进入栈中\n   *\n   * 注意：该方法不允许被子类重写\n   */\n  readonly pushElement = (element: T): void => {\n    this._future.length = 0;\n    if (this._isOverflow(element)) {\n      this._past.shift();\n    }\n    this._past.push(element);\n    this._onStackChange.fire();\n  };\n\n  /**\n   * 是否可以撤销。子类可以重写\n   */\n  public canUndo(): boolean {\n    return this._past.length > 0;\n  }\n\n  /**\n   * 是否可以重做。子类可以重写\n   */\n  public canRedo(): boolean {\n    return this._future.length > 0;\n  }\n\n  /**\n   * 清除undo\n   */\n  public clearUndo(): void {\n    if (this._past.length === 0) {\n      return;\n    }\n    this._past.length = 0;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 清除redo\n   */\n  public clearRedo(): void {\n    if (this._future.length === 0) {\n      return;\n    }\n    this._future.length = 0;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 重置栈\n   * 清空undo和redo\n   */\n  public reset(): void {\n    if (this._past.length === 0 && this._future.length === 0) {\n      return;\n    }\n    this._past.length = 0;\n    this._future.length = 0;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 在undo时找出Past中的元素。子类可以重写\n   */\n  protected _popPastElements(): T[] {\n    return this._past.length ? [this._past.pop()!] : [];\n  }\n\n  /**\n   * 在redo时找出Future中的元素。子类可以重写\n   */\n  protected _popFutureElements(): T[] {\n    return this._future.length ? [this._future.pop()!] : [];\n  }\n\n  /**\n   * 判断新添加元素，是否会超出栈的大小。子类可以重写\n   */\n  protected _isOverflow(_elem: T) {\n    return this._past.length >= this._limitSize;\n  }\n}\n","import type { Event } from '../event';\nimport { Emitter } from '../event';\n\nexport class StateUndoRedoStack<T> {\n  // 当undo结束后触发\n  public onDidUndo: Event<[T]>;\n  // 当redo结束后触发\n  public onDidRedo: Event<[T]>;\n  // 当栈发生变化时触发\n  public onStackChange: Event<[]>;\n\n  protected readonly _past: T[] = [];\n  protected readonly _future: T[] = [];\n\n  protected _onDidUndo = new Emitter<[T]>();\n  protected _onDidRedo = new Emitter<[T]>();\n  protected _onStackChange = new Emitter<[]>();\n\n  constructor(\n    protected _currentState: T,\n    protected readonly _limitSize = Infinity,\n  ) {\n    this.onDidUndo = this._onDidUndo.event;\n    this.onDidRedo = this._onDidRedo.event;\n    this.onStackChange = this._onStackChange.event;\n  }\n\n  get currentState() {\n    return this._currentState;\n  }\n\n  /**\n   * 进行撤销\n   */\n  public undo() {\n    if (!this.canUndo()) {\n      return;\n    }\n    this._future.push(this._currentState);\n    this._currentState = this._past.pop()!;\n    this._onDidUndo.fire(this._currentState);\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 进行重做\n   *\n   * 注意：该方法不允许被子类重写\n   */\n  public redo() {\n    if (!this.canRedo()) {\n      return;\n    }\n    this._past.push(this._currentState);\n    this._currentState = this._future.pop()!;\n    this._onDidRedo.fire(this._currentState);\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 追加操作进入栈中\n   *\n   * 注意：该方法不允许被子类重写\n   */\n  public pushElement(element: T) {\n    this._future.length = 0;\n    if (this._isOverflow(element)) {\n      this._past.shift();\n    }\n    if (this._currentState) {\n      this._past.push(this._currentState);\n    }\n    this._currentState = element;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 是否可以撤销\n   */\n  public canUndo(): boolean {\n    return this._past.length > 0;\n  }\n\n  /**\n   * 是否可以重做\n   */\n  public canRedo(): boolean {\n    return this._future.length > 0;\n  }\n\n  /**\n   * 清除undo\n   */\n  public clearUndo(): void {\n    if (this._past.length === 0) {\n      return;\n    }\n    this._past.length = 0;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 清除redo\n   */\n  public clearRedo(): void {\n    if (this._future.length === 0) {\n      return;\n    }\n    this._future.length = 0;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 重置栈\n   * 清空undo和redo\n   */\n  public reset(state: T): void {\n    if (this._past.length === 0 && this._future.length === 0 && this._currentState === state) {\n      return;\n    }\n    this._past.length = 0;\n    this._future.length = 0;\n    this._currentState = state;\n    this._onStackChange.fire();\n  }\n\n  /**\n   * 判断新添加元素，是否会超出栈的大小\n   */\n  protected _isOverflow(_elem: T) {\n    return this._past.length >= this._limitSize;\n  }\n}\n"]}

package/dist/uuid/index.cjs

@@ -0,0 +1,67 @@
+'use strict';
+
+// src/uuid/uuid.ts
+var pattern = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;
+function isUuid(value) {
+  return pattern.test(value);
+}
+var generateUuid = (() => {
+  if (typeof crypto === "object" && typeof crypto.randomUUID === "function") {
+    return crypto.randomUUID.bind(crypto);
+  }
+  let getRandomValues;
+  if (typeof crypto === "object" && typeof crypto.getRandomValues === "function") {
+    getRandomValues = crypto.getRandomValues.bind(crypto);
+  } else {
+    getRandomValues = function(bucket) {
+      for (let i = 0; i < bucket.length; i++) {
+        bucket[i] = Math.floor(Math.random() * 256);
+      }
+      return bucket;
+    };
+  }
+  const data = new Uint8Array(16);
+  const hex = [];
+  for (let i = 0; i < 256; i++) {
+    hex.push(i.toString(16).padStart(2, "0"));
+  }
+  return () => {
+    getRandomValues(data);
+    data[6] = data[6] & 15 | 64;
+    data[8] = data[8] & 63 | 128;
+    let i = 0;
+    let result = "";
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += "-";
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += "-";
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += "-";
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += "-";
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    result += hex[data[i++]];
+    return result;
+  };
+})();
+var generateUpperCaseUuid = () => generateUuid().toUpperCase();
+var uuid = generateUuid;
+var upperCaseUuid = generateUpperCaseUuid;
+
+exports.generateUpperCaseUuid = generateUpperCaseUuid;
+exports.generateUuid = generateUuid;
+exports.isUuid = isUuid;
+exports.upperCaseUuid = upperCaseUuid;
+exports.uuid = uuid;
+//# sourceMappingURL=index.cjs.map
+//# sourceMappingURL=index.cjs.map