fastds 0.0.1-rc.0

package/build/ring-buffer.cjs

@@ -0,0 +1,469 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+Object.defineProperty(exports, "RingBuffer", {
+    enumerable: true,
+    get: function() {
+        return RingBuffer;
+    }
+});
+const DEFAULT_CAPACITY = 8;
+class RingBuffer {
+    #buffer;
+    #head = 0;
+    #tail = 0;
+    #mask;
+    #length = 0;
+    static from(values) {
+        const n = values.length;
+        const ring = new RingBuffer(n);
+        for(let i = 0; i < n; i++){
+            ring.#buffer[i] = values[i];
+        }
+        ring.#head = 0;
+        ring.#tail = n;
+        ring.#length = n;
+        return ring;
+    }
+    [Symbol.toStringTag] = 'RingBuffer';
+    constructor(capacity = DEFAULT_CAPACITY){
+        const size = Math.max(1 << 32 - Math.clz32(capacity), DEFAULT_CAPACITY);
+        this.#buffer = new Array(size);
+        this.#mask = size - 1;
+    }
+    get capacity() {
+        return this.#mask + 1;
+    }
+    get length() {
+        return this.#length;
+    }
+    isEmpty() {
+        return this.#tail === this.#head;
+    }
+    isWrapped() {
+        return this.#head > this.#tail;
+    }
+    getHeadOffset(index) {
+        return this.#head + index & this.#mask;
+    }
+    getTailOffset(index) {
+        return this.#tail + index & this.#mask;
+    }
+    grow(capacity = this.#mask + 1) {
+        const buffer = this.#buffer;
+        const bufferLength = buffer.length;
+        if (bufferLength >= capacity + 1) {
+            return;
+        }
+        const size = 1 << 32 - Math.clz32(capacity);
+        this.#buffer.length = size;
+        const oldTail = this.#tail;
+        if (oldTail < this.#head) {
+            const buffer = this.#buffer;
+            for(let i = 0; i < oldTail; i++){
+                buffer[bufferLength + i] = buffer[i];
+            }
+            this.#tail = bufferLength + oldTail;
+        }
+        this.#mask = size - 1;
+    }
+    allocate(index, count) {
+        const prevLength = this.#length;
+        if (index < 0 || index > prevLength || count <= 0) {
+            return false;
+        }
+        const buffer = this.#buffer;
+        const head = this.#head;
+        const tail = this.#tail;
+        const prevMask = this.#mask;
+        const nextLength = count + prevLength;
+        const wrapIndex = buffer.length - head;
+        const isWrapped = head > tail;
+        if (nextLength >= buffer.length) {
+            const size = 1 << 32 - Math.clz32(nextLength);
+            buffer.length = size;
+            this.#mask = size - 1;
+        }
+        const mask = this.#mask;
+        const isResized = prevMask !== mask;
+        const leftMoveCount = index;
+        const rightMoveCount = prevLength - index;
+        if (leftMoveCount < rightMoveCount) {
+            if (isResized && isWrapped) {
+                for(let i = 0; i < tail; i++){
+                    const read = i;
+                    const write = head + wrapIndex + i & mask;
+                    buffer[write] = buffer[read];
+                    buffer[read] = undefined;
+                }
+            }
+            const writeBase = head - count & mask;
+            for(let i = 0; i < leftMoveCount; i++){
+                const read = head + i & mask;
+                const write = writeBase + i & mask;
+                buffer[write] = buffer[read];
+                buffer[read] = undefined;
+            }
+            this.#head = writeBase;
+        } else {
+            if (isResized && isWrapped) {
+                for(let i = 0; i < tail; i++){
+                    const read = i;
+                    const write = head + wrapIndex + i & mask;
+                    buffer[write] = buffer[read];
+                    buffer[read] = undefined;
+                }
+            }
+            for(let i = rightMoveCount - 1; i >= 0; i--){
+                const read = head + index + i & mask;
+                const write = head + index + count + i & mask;
+                buffer[write] = buffer[read];
+                buffer[read] = undefined;
+            }
+            this.#tail = head + nextLength & mask;
+        }
+        this.#length = nextLength;
+        return true;
+    }
+    deallocate(index, count) {
+        const prevLength = this.#length;
+        if (index < 0 || index >= prevLength || count <= 0) {
+            return false;
+        }
+        const actualCount = Math.min(count, prevLength - index);
+        const nextLength = prevLength - actualCount;
+        const buffer = this.#buffer;
+        const head = this.#head;
+        const tail = this.#tail;
+        const mask = this.#mask;
+        if (index === 0) {
+            for(let i = 0; i < actualCount; i++){
+                buffer[head + i & mask] = undefined;
+            }
+            this.#head = head + actualCount & mask;
+            this.#length = nextLength;
+            return true;
+        }
+        if (index + actualCount === prevLength) {
+            for(let i = 0; i < actualCount; i++){
+                buffer[tail - i - 1 & mask] = undefined;
+            }
+            this.#tail = tail - actualCount & mask;
+            this.#length = nextLength;
+            return true;
+        }
+        const leftMoveCount = index;
+        const rightMoveCount = prevLength - index - actualCount;
+        if (leftMoveCount < rightMoveCount) {
+            for(let i = leftMoveCount - 1; i >= 0; i--){
+                const read = head + i & mask;
+                const write = head + i + actualCount & mask;
+                buffer[write] = buffer[read];
+            }
+            for(let i = 0; i < actualCount; i++){
+                buffer[head + i & mask] = undefined;
+            }
+            this.#head = head + actualCount & mask;
+        } else {
+            for(let i = 0; i < rightMoveCount; i++){
+                const read = head + index + actualCount + i & mask;
+                const write = head + index + i & mask;
+                buffer[write] = buffer[read];
+            }
+            this.#tail = tail - actualCount & mask;
+            for(let i = 0; i < actualCount; i++){
+                buffer[tail + i & mask] = undefined;
+            }
+        }
+        this.#length = nextLength;
+        return true;
+    }
+    indexOf(value, index = 0) {
+        const length = this.#length;
+        const buffer = this.#buffer;
+        const head = this.#head;
+        const tail = this.#tail;
+        if (head < tail) {
+            const offset = head + index;
+            const result = buffer.indexOf(value, offset);
+            if (result !== -1 && result < tail) {
+                return result - head;
+            }
+            return -1;
+        }
+        const capacity = buffer.length;
+        const firstSegmentLength = capacity - head;
+        if (index < firstSegmentLength) {
+            const startOffset = head + index;
+            const result = buffer.indexOf(value, startOffset);
+            if (result !== -1) {
+                return result - head;
+            }
+            index = firstSegmentLength;
+        }
+        if (index < length) {
+            if (tail > length / 2) {
+                const result = buffer.indexOf(value);
+                if (result !== -1 && result < tail) {
+                    return firstSegmentLength + result;
+                }
+            } else {
+                for(let i = 0; i < tail; i++){
+                    if (buffer[i] === value) {
+                        return firstSegmentLength + i;
+                    }
+                }
+            }
+        }
+        return -1;
+    }
+    unwrap() {
+        if (this.isEmpty()) {
+            return false;
+        }
+        const length = this.#length;
+        const buffer = this.#buffer;
+        const prevHead = this.#head;
+        const prevTail = this.#tail;
+        if (prevHead > prevTail) {
+            const bufferLength = buffer.length;
+            buffer.length = bufferLength + prevTail;
+            for(let i = 0; i < prevTail; i++){
+                buffer[bufferLength + i] = buffer[i];
+                buffer[i] = undefined;
+            }
+        }
+        for(let i = 0; i < length; i++){
+            buffer[i] = buffer[prevHead + i];
+        }
+        buffer.length = this.#mask + 1;
+        this.#head = 0;
+        this.#tail = length;
+        this.#length = length;
+        return true;
+    }
+    compact(filter) {
+        if (this.isEmpty()) {
+            return false;
+        }
+        const length = this.#length;
+        const buffer = this.#buffer;
+        const head = this.#head;
+        const mask = this.#mask;
+        let bufferLength = buffer.length;
+        let write = 0;
+        for(let read = 0; read < length; read++){
+            const readOffset = head + read & mask;
+            const value = buffer[readOffset];
+            if (filter(value, read)) {
+                if (read !== write) {
+                    const writeOffset = head + write & mask;
+                    buffer[writeOffset] = value;
+                }
+                write++;
+            }
+        }
+        if (write === length) {
+            return false;
+        }
+        if (write < bufferLength / 2) {
+            const size = 1 << 32 - Math.clz32(write - 1);
+            buffer.length = size;
+            bufferLength = size;
+        }
+        for(let i = write; i < bufferLength; i++){
+            buffer[i] = undefined;
+        }
+        this.#head = 0;
+        this.#tail = write;
+        this.#length = write;
+        return true;
+    }
+    push(value) {
+        const tail = this.getTailOffset(1);
+        if (tail === this.#head) {
+            this.grow(this.#mask + 2);
+        }
+        this.#buffer[this.#tail] = value;
+        this.#tail = this.getTailOffset(1);
+        this.#length++;
+        return this;
+    }
+    unshift(value) {
+        const head = this.getHeadOffset(-1);
+        if (head === this.#tail) {
+            this.grow(this.#mask + 2);
+        }
+        this.#head = this.getHeadOffset(-1);
+        this.#buffer[this.#head] = value;
+        this.#length++;
+        return this;
+    }
+    shift() {
+        if (this.#head === this.#tail) {
+            return undefined;
+        }
+        const value = this.#buffer[this.#head];
+        this.#buffer[this.#head] = undefined;
+        this.#head = this.getHeadOffset(1);
+        this.#length--;
+        return value;
+    }
+    pop() {
+        if (this.#head === this.#tail) {
+            return undefined;
+        }
+        this.#tail = this.getTailOffset(-1);
+        const value = this.#buffer[this.#tail];
+        this.#buffer[this.#tail] = undefined;
+        this.#length--;
+        return value;
+    }
+    peekAt(index) {
+        if (index < 0 || index >= this.#length) {
+            return undefined;
+        }
+        const offset = this.getHeadOffset(index);
+        return this.#buffer[offset];
+    }
+    peekFirst() {
+        return this.#buffer[this.#head];
+    }
+    peekLast() {
+        const offset = this.getTailOffset(-1);
+        return this.#buffer[offset];
+    }
+    has(value) {
+        return this.indexOf(value) !== -1;
+    }
+    insertOne(index, value) {
+        this.allocate(index, 1);
+        this.#buffer[this.#head + index & this.#mask] = value;
+        return index;
+    }
+    insert(index, values) {
+        const length = values.length;
+        const writeBase = this.#head + index;
+        this.allocate(index, length);
+        for(let i = 0; i < length; i++){
+            this.#buffer[writeBase + i & this.#mask] = values[i];
+        }
+        return index;
+    }
+    removeOne(index) {
+        const length = this.#length;
+        if (index < 0 || index >= length) {
+            return -1;
+        }
+        const buffer = this.#buffer;
+        const mask = this.#mask;
+        const head = this.#head;
+        const leftMoveCount = index;
+        const rightMoveCount = length - index;
+        if (leftMoveCount < rightMoveCount) {
+            for(let i = index; i > 0; i--){
+                buffer[head + i & mask] = buffer[head + i - 1 & mask];
+            }
+            buffer[head] = undefined;
+            this.#head = head + 1 & mask;
+        } else {
+            for(let i = index; i < length - 1; i++){
+                buffer[head + i & mask] = buffer[head + i + 1 & mask];
+            }
+            const tail = head + length - 1 & mask;
+            buffer[tail] = undefined;
+            this.#tail = tail;
+        }
+        this.#length = length - 1;
+        return index;
+    }
+    removeFirst(value, index = 0) {
+        const foundIndex = this.indexOf(value, index);
+        if (foundIndex === -1) {
+            return -1;
+        }
+        return this.removeOne(foundIndex);
+    }
+    remove(index, count) {
+        const result = this.slice(index, count);
+        this.deallocate(index, count);
+        return result;
+    }
+    clear() {
+        this.#buffer.length = 0;
+        this.#buffer.length = DEFAULT_CAPACITY;
+        this.#head = 0;
+        this.#tail = 0;
+        this.#length = 0;
+        this.#mask = DEFAULT_CAPACITY - 1;
+        return this;
+    }
+    slice(start = 0, end = this.#length) {
+        const length = this.#length;
+        const buffer = this.#buffer;
+        const head = this.#head;
+        const tail = this.#tail;
+        const mask = this.#mask;
+        const actualStart = start < 0 ? Math.max(length + start, 0) : Math.min(start, length);
+        const actualEnd = end < 0 ? Math.max(length + end, 0) : Math.min(end, length);
+        if (head <= tail) {
+            return this.#buffer.slice(head + actualStart & mask, head + actualEnd & mask);
+        }
+        const size = Math.max(actualEnd - actualStart, 0);
+        const result = new Array(size);
+        for(let i = 0; i < size; i++){
+            result[i] = buffer[head + actualStart + i & mask];
+        }
+        return result;
+    }
+    toArray() {
+        return this.slice();
+    }
+    drain() {
+        return Iterator.from({
+            [Symbol.iterator]: ()=>{
+                return {
+                    next: ()=>{
+                        if (this.#length === 0) {
+                            return {
+                                done: true,
+                                value: undefined
+                            };
+                        }
+                        const value = this.shift();
+                        return {
+                            done: false,
+                            value
+                        };
+                    }
+                };
+            }
+        });
+    }
+    iter() {
+        return Iterator.from(this[Symbol.iterator]());
+    }
+    [Symbol.iterator]() {
+        const buffer = this.#buffer;
+        let idx = this.#head;
+        return {
+            next: ()=>{
+                if (idx >= this.#head + this.#length) {
+                    return {
+                        done: true,
+                        value: undefined
+                    };
+                }
+                const offset = idx++ & this.#mask;
+                const value = buffer[offset];
+                return {
+                    done: false,
+                    value
+                };
+            }
+        };
+    }
+}
+
+//# sourceMappingURL=ring-buffer.cjs.map

package/build/ring-buffer.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/ring-buffer.ts"],"sourcesContent":["const DEFAULT_CAPACITY = 8;\n\nexport interface FilterFunction<T> {\n  (value: T, index: number): boolean;\n}\n\nexport class RingBuffer<T> {\n  #buffer: Array<T | undefined>;\n  #head = 0;\n  #tail = 0;\n  #mask: number;\n  #length = 0;\n\n  static from<T>(values: T[]): RingBuffer<T> {\n    const n = values.length;\n    const ring = new RingBuffer<T>(n);\n    for (let i = 0; i < n; i++) {\n      ring.#buffer[i] = values[i];\n    }\n    ring.#head = 0;\n    ring.#tail = n;\n    ring.#length = n;\n\n    return ring;\n  }\n\n  readonly [Symbol.toStringTag] = 'RingBuffer';\n\n  constructor(capacity: number = DEFAULT_CAPACITY) {\n    const size = Math.max(1 << (32 - Math.clz32(capacity)), DEFAULT_CAPACITY);\n    this.#buffer = new Array<T>(size);\n    this.#mask = size - 1;\n  }\n\n\n  get capacity() {\n    return this.#mask + 1;\n  }\n\n  get length() {\n    return this.#length;\n  }\n\n  isEmpty(): boolean {\n    return this.#tail === this.#head;\n  }\n\n  isWrapped(): boolean {\n    return this.#head > this.#tail;\n  }\n\n  getHeadOffset(index: number): number {\n    return (this.#head + index) & this.#mask;\n  }\n\n  getTailOffset(index: number): number {\n    return (this.#tail + index) & this.#mask;\n  }\n\n  grow(capacity: number = this.#mask + 1): void {\n    const buffer = this.#buffer;\n    const bufferLength = buffer.length;\n    if (bufferLength >= capacity + 1) {\n      return;\n    }\n    const size = 1 << (32 - Math.clz32(capacity));\n    this.#buffer.length = size;\n\n    const oldTail = this.#tail;\n    if (oldTail < this.#head) {\n      const buffer = this.#buffer;\n      for (let i = 0; i < oldTail; i++) {\n        buffer[bufferLength + i] = buffer[i];\n      }\n      this.#tail = bufferLength + oldTail;\n    }\n\n    this.#mask = size - 1;\n  }\n\n  allocate(index: number, count: number): boolean {\n    const prevLength = this.#length;\n    if (index < 0 || index > prevLength || count <= 0) {\n      return false;\n    }\n\n    const buffer = this.#buffer;\n    const head = this.#head;\n    const tail = this.#tail;\n    const prevMask = this.#mask;\n\n    const nextLength = count + prevLength;\n    const wrapIndex = buffer.length - head;\n    const isWrapped = head > tail;\n\n    if (nextLength >= buffer.length) {\n      const size = 1 << (32 - Math.clz32(nextLength));\n      buffer.length = size;\n      this.#mask = size - 1;\n    }\n\n    const mask = this.#mask;\n    const isResized = prevMask !== mask;\n\n    const leftMoveCount = index;\n    const rightMoveCount = prevLength - index;\n\n    if (leftMoveCount < rightMoveCount) {\n      if (isResized && isWrapped) {\n        for (let i = 0; i < tail; i++) {\n          const read = i;\n          const write = (head + wrapIndex + i) & mask;\n          buffer[write] = buffer[read];\n          buffer[read] = undefined;\n        }\n      }\n      const writeBase = (head - count) & mask;\n      for (let i = 0; i < leftMoveCount; i++) {\n        const read = (head + i) & mask;\n        const write = (writeBase + i) & mask;\n        buffer[write] = buffer[read];\n        buffer[read] = undefined;\n      }\n      this.#head = writeBase;\n    } else {\n      if (isResized && isWrapped) {\n        for (let i = 0; i < tail; i++) {\n          const read = i;\n          const write = (head + wrapIndex + i) & mask;\n          buffer[write] = buffer[read];\n          buffer[read] = undefined;\n        }\n      }\n\n      for (let i = rightMoveCount - 1; i >= 0; i--) {\n        const read = (head + index + i) & mask;\n        const write = (head + index + count + i) & mask;\n\n        buffer[write] = buffer[read];\n        buffer[read] = undefined;\n      }\n\n      this.#tail = (head + nextLength) & mask;\n    }\n\n    this.#length = nextLength;\n    return true;\n  }\n\n  deallocate(index: number, count: number): boolean {\n    const prevLength = this.#length;\n    if (index < 0 || index >= prevLength || count <= 0) {\n      return false;\n    }\n\n    const actualCount = Math.min(count, prevLength - index);\n    const nextLength = prevLength - actualCount;\n\n    const buffer = this.#buffer;\n    const head = this.#head;\n    const tail = this.#tail;\n    const mask = this.#mask;\n\n    if (index === 0) {\n      for (let i = 0; i < actualCount; i++) {\n        buffer[(head + i) & mask] = undefined;\n      }\n      this.#head = (head + actualCount) & mask;\n      this.#length = nextLength;\n      return true;\n    }\n\n    if (index + actualCount === prevLength) {\n      for (let i = 0; i < actualCount; i++) {\n        buffer[(tail - i - 1) & mask] = undefined;\n      }\n      this.#tail = (tail - actualCount) & mask;\n      this.#length = nextLength;\n      return true;\n    }\n\n    const leftMoveCount = index;\n    const rightMoveCount = prevLength - index - actualCount;\n\n    if (leftMoveCount < rightMoveCount) {\n      for (let i = leftMoveCount - 1; i >= 0; i--) {\n        const read = (head + i) & mask;\n        const write = (head + i + actualCount) & mask;\n        buffer[write] = buffer[read];\n      }\n      for (let i = 0; i < actualCount; i++) {\n        buffer[(head + i) & mask] = undefined;\n      }\n      this.#head = (head + actualCount) & mask;\n    } else {\n      for (let i = 0; i < rightMoveCount; i++) {\n        const read = (head + index + actualCount + i) & mask;\n        const write = (head + index + i) & mask;\n        buffer[write] = buffer[read];\n      }\n      this.#tail = (tail - actualCount) & mask;\n      for (let i = 0; i < actualCount; i++) {\n        buffer[(tail + i) & mask] = undefined;\n      }\n    }\n\n    this.#length = nextLength;\n    return true;\n  }\n\n  indexOf(value: T, index: number = 0): number {\n    const length = this.#length;\n    const buffer = this.#buffer;\n    const head = this.#head;\n    const tail = this.#tail;\n\n    if (head < tail) {\n      const offset = head + index;\n      const result = buffer.indexOf(value, offset);\n      if (result !== -1 && result < tail) {\n        return result - head;\n      }\n      return -1;\n    }\n    const capacity = buffer.length;\n    const firstSegmentLength = capacity - head;\n\n    if (index < firstSegmentLength) {\n      const startOffset = head + index;\n      const result = buffer.indexOf(value, startOffset);\n      if (result !== -1) {\n        return result - head;\n      }\n      index = firstSegmentLength;\n    }\n\n    if (index < length) {\n      if (tail > length / 2) {\n        const result = buffer.indexOf(value);\n        if (result !== -1 && result < tail) {\n          return firstSegmentLength + result;\n        }\n      } else {\n        for (let i = 0; i < tail; i++) {\n          if (buffer[i] === value) {\n            return firstSegmentLength + i;\n          }\n        }\n      }\n    }\n    return -1;\n  }\n\n  unwrap(): boolean {\n    if (this.isEmpty()) {\n      return false;\n    }\n    const length = this.#length;\n    const buffer = this.#buffer;\n    const prevHead = this.#head;\n    const prevTail = this.#tail;\n\n    if (prevHead > prevTail) {\n      const bufferLength = buffer.length;\n      buffer.length = bufferLength + prevTail;\n      for (let i = 0; i < prevTail; i++) {\n        buffer[bufferLength + i] = buffer[i];\n        buffer[i] = undefined;\n      }\n    }\n    for (let i = 0; i < length; i++) {\n      buffer[i] = buffer[prevHead + i];\n    }\n\n    buffer.length = this.#mask + 1;\n    this.#head = 0;\n    this.#tail = length;\n    this.#length = length;\n\n    return true;\n  }\n\n  compact(filter: FilterFunction<T>): boolean {\n    if (this.isEmpty()) {\n      return false;\n    }\n    const length = this.#length;\n    const buffer = this.#buffer;\n    const head = this.#head;\n    const mask = this.#mask;\n\n    let bufferLength = buffer.length;\n    let write = 0;\n    for (let read = 0; read < length; read++) {\n      const readOffset = (head + read) & mask;\n      const value = buffer[readOffset]!;\n      if (filter(value, read)) {\n        if (read !== write) {\n          const writeOffset = (head + write) & mask;\n          buffer[writeOffset] = value;\n        }\n        write++;\n      }\n    }\n    if (write === length) {\n      return false;\n    }\n    if (write < bufferLength / 2) {\n      const size = 1 << (32 - Math.clz32(write - 1));\n      buffer.length = size;\n      bufferLength = size;\n    }\n\n    for (let i = write; i < bufferLength; i++) {\n      buffer[i] = undefined;\n    }\n\n    this.#head = 0;\n    this.#tail = write;\n    this.#length = write;\n    return true;\n  }\n\n  push(value: T) {\n    const tail = this.getTailOffset(1);\n    if (tail === this.#head) {\n      this.grow(this.#mask + 2);\n    }\n    this.#buffer[this.#tail] = value;\n    this.#tail = this.getTailOffset(1);\n    this.#length++;\n    return this;\n  }\n\n  unshift(value: T): this {\n    const head = this.getHeadOffset(-1);\n    if (head === this.#tail) {\n      this.grow(this.#mask + 2);\n    }\n    this.#head = this.getHeadOffset(-1);\n    this.#buffer[this.#head] = value;\n    this.#length++;\n    return this;\n  }\n\n  shift(): T | undefined {\n    if (this.#head === this.#tail) {\n      return undefined;\n    }\n    const value = this.#buffer[this.#head];\n    this.#buffer[this.#head] = undefined;\n    this.#head = this.getHeadOffset(1);\n    this.#length--;\n    return value;\n  }\n\n  pop(): T | undefined {\n    if (this.#head === this.#tail) {\n      return undefined;\n    }\n    this.#tail = this.getTailOffset(-1);\n    const value = this.#buffer[this.#tail];\n    this.#buffer[this.#tail] = undefined;\n    this.#length--;\n    return value;\n  }\n\n  peekAt(index: number): T | undefined {\n    if (index < 0 || index >= this.#length) {\n      return undefined;\n    }\n    const offset = this.getHeadOffset(index);\n    return this.#buffer[offset];\n  }\n\n  peekFirst(): T | undefined {\n    return this.#buffer[this.#head];\n  }\n\n  peekLast(): T | undefined {\n    const offset = this.getTailOffset(-1);\n    return this.#buffer[offset];\n  }\n\n  has(value: T): boolean {\n    return this.indexOf(value) !== -1;\n  }\n\n  insertOne(index: number, value: T): number {\n    this.allocate(index, 1);\n    this.#buffer[(this.#head + index) & this.#mask] = value;\n    return index;\n  }\n\n  insert(index: number, values: T[]): number {\n    const length = values.length;\n    const writeBase = this.#head + index;\n    this.allocate(index, length);\n    for (let i = 0; i < length; i++) {\n      this.#buffer[(writeBase + i) & this.#mask] = values[i];\n    }\n\n    return index;\n  }\n\n  removeOne(index: number): number {\n    const length = this.#length;\n    if (index < 0 || index >= length) {\n      return -1;\n    }\n    const buffer = this.#buffer;\n    const mask = this.#mask;\n    const head = this.#head;\n\n    const leftMoveCount = index;\n    const rightMoveCount = length - index;\n\n    if (leftMoveCount < rightMoveCount) {\n      for (let i = index; i > 0; i--) {\n        buffer[(head + i) & mask] = buffer[(head + i - 1) & mask];\n      }\n      buffer[head] = undefined;\n      this.#head = (head + 1) & mask;\n    } else {\n      for (let i = index; i < length - 1; i++) {\n        buffer[(head + i) & mask] = buffer[(head + i + 1) & mask];\n      }\n      const tail = (head + length - 1) & mask;\n      buffer[tail] = undefined;\n      this.#tail = tail;\n    }\n    this.#length = length - 1;\n\n    return index;\n  }\n\n  removeFirst(value: T, index: number = 0): number {\n    const foundIndex = this.indexOf(value, index);\n    if (foundIndex === -1) {\n      return -1;\n    }\n    return this.removeOne(foundIndex);\n  }\n\n  remove(index: number, count: number): T[] {\n    const result = this.slice(index, count);\n    this.deallocate(index, count);\n    return result;\n  }\n\n  clear(): this {\n    this.#buffer.length = 0;\n    this.#buffer.length = DEFAULT_CAPACITY;\n    this.#head = 0;\n    this.#tail = 0;\n    this.#length = 0;\n    this.#mask = DEFAULT_CAPACITY - 1;\n    return this;\n  }\n\n  slice(start: number = 0, end: number = this.#length): T[] {\n    const length = this.#length;\n    const buffer = this.#buffer;\n    const head = this.#head;\n    const tail = this.#tail;\n    const mask = this.#mask;\n\n    const actualStart = start < 0 ? Math.max(length + start, 0) : Math.min(start, length);\n    const actualEnd = end < 0 ? Math.max(length + end, 0) : Math.min(end, length);\n\n    if (head <= tail) {\n      return this.#buffer.slice(\n        (head + actualStart) & mask,\n        (head + actualEnd) & mask,\n      ) as T[];\n    }\n\n    const size = Math.max(actualEnd - actualStart, 0);\n    const result = new Array<T>(size);\n    for (let i = 0; i < size; i++) {\n      result[i] = buffer[(head + actualStart + i) & mask]!;\n    }\n    return result;\n  }\n\n  toArray(): T[] {\n    return this.slice();\n  }\n\n  drain(): IteratorObject<T, void, unknown> {\n    return Iterator.from({\n      [Symbol.iterator]: () => {\n        return {\n          next: (): IteratorResult<T> => {\n            if (this.#length === 0) {\n              return { done: true, value: undefined };\n            }\n            const value = this.shift()!;\n            return { done: false, value };\n          },\n        };\n      },\n    });\n  }\n\n  iter(): IteratorObject<T, void, unknown> {\n    return Iterator.from(this[Symbol.iterator]());\n  }\n\n  [Symbol.iterator](): Iterator<T, void, unknown> {\n    const buffer = this.#buffer;\n    let idx = this.#head;\n    return {\n      next: (): IteratorResult<T> => {\n        if (idx >= this.#head + this.#length) {\n          return { done: true, value: undefined };\n        }\n        const offset = idx++ & this.#mask;\n        const value = buffer[offset]!;\n        return { done: false, value };\n      },\n    };\n  }\n}\n\n\n"],"names":["RingBuffer","DEFAULT_CAPACITY","from","values","n","length","ring","i","Symbol","toStringTag","constructor","capacity","size","Math","max","clz32","Array","isEmpty","isWrapped","getHeadOffset","index","getTailOffset","grow","buffer","bufferLength","oldTail","allocate","count","prevLength","head","tail","prevMask","nextLength","wrapIndex","mask","isResized","leftMoveCount","rightMoveCount","read","write","undefined","writeBase","deallocate","actualCount","min","indexOf","value","offset","result","firstSegmentLength","startOffset","unwrap","prevHead","prevTail","compact","filter","readOffset","writeOffset","push","unshift","shift","pop","peekAt","peekFirst","peekLast","has","insertOne","insert","removeOne","removeFirst","foundIndex","remove","slice","clear","start","end","actualStart","actualEnd","toArray","drain","Iterator","iterator","next","done","iter","idx"],"mappings":";;;;+BAMaA;;;eAAAA;;;AANb,MAAMC,mBAAmB;AAMlB,MAAMD;IACX,CAAA,MAAO,CAAuB;IAC9B,CAAA,IAAK,GAAG,EAAE;IACV,CAAA,IAAK,GAAG,EAAE;IACV,CAAA,IAAK,CAAS;IACd,CAAA,MAAO,GAAG,EAAE;IAEZ,OAAOE,KAAQC,MAAW,EAAiB;QACzC,MAAMC,IAAID,OAAOE,MAAM;QACvB,MAAMC,OAAO,IAAIN,WAAcI;QAC/B,IAAK,IAAIG,IAAI,GAAGA,IAAIH,GAAGG,IAAK;YAC1BD,KAAK,CAAA,MAAO,CAACC,EAAE,GAAGJ,MAAM,CAACI,EAAE;QAC7B;QACAD,KAAK,CAAA,IAAK,GAAG;QACbA,KAAK,CAAA,IAAK,GAAGF;QACbE,KAAK,CAAA,MAAO,GAAGF;QAEf,OAAOE;IACT;IAES,CAACE,OAAOC,WAAW,CAAC,GAAG,aAAa;IAE7CC,YAAYC,WAAmBV,gBAAgB,CAAE;QAC/C,MAAMW,OAAOC,KAAKC,GAAG,CAAC,KAAM,KAAKD,KAAKE,KAAK,CAACJ,WAAYV;QACxD,IAAI,CAAC,CAAA,MAAO,GAAG,IAAIe,MAASJ;QAC5B,IAAI,CAAC,CAAA,IAAK,GAAGA,OAAO;IACtB;IAGA,IAAID,WAAW;QACb,OAAO,IAAI,CAAC,CAAA,IAAK,GAAG;IACtB;IAEA,IAAIN,SAAS;QACX,OAAO,IAAI,CAAC,CAAA,MAAO;IACrB;IAEAY,UAAmB;QACjB,OAAO,IAAI,CAAC,CAAA,IAAK,KAAK,IAAI,CAAC,CAAA,IAAK;IAClC;IAEAC,YAAqB;QACnB,OAAO,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAAC,CAAA,IAAK;IAChC;IAEAC,cAAcC,KAAa,EAAU;QACnC,OAAO,AAAC,IAAI,CAAC,CAAA,IAAK,GAAGA,QAAS,IAAI,CAAC,CAAA,IAAK;IAC1C;IAEAC,cAAcD,KAAa,EAAU;QACnC,OAAO,AAAC,IAAI,CAAC,CAAA,IAAK,GAAGA,QAAS,IAAI,CAAC,CAAA,IAAK;IAC1C;IAEAE,KAAKX,WAAmB,IAAI,CAAC,CAAA,IAAK,GAAG,CAAC,EAAQ;QAC5C,MAAMY,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMC,eAAeD,OAAOlB,MAAM;QAClC,IAAImB,gBAAgBb,WAAW,GAAG;YAChC;QACF;QACA,MAAMC,OAAO,KAAM,KAAKC,KAAKE,KAAK,CAACJ;QACnC,IAAI,CAAC,CAAA,MAAO,CAACN,MAAM,GAAGO;QAEtB,MAAMa,UAAU,IAAI,CAAC,CAAA,IAAK;QAC1B,IAAIA,UAAU,IAAI,CAAC,CAAA,IAAK,EAAE;YACxB,MAAMF,SAAS,IAAI,CAAC,CAAA,MAAO;YAC3B,IAAK,IAAIhB,IAAI,GAAGA,IAAIkB,SAASlB,IAAK;gBAChCgB,MAAM,CAACC,eAAejB,EAAE,GAAGgB,MAAM,CAAChB,EAAE;YACtC;YACA,IAAI,CAAC,CAAA,IAAK,GAAGiB,eAAeC;QAC9B;QAEA,IAAI,CAAC,CAAA,IAAK,GAAGb,OAAO;IACtB;IAEAc,SAASN,KAAa,EAAEO,KAAa,EAAW;QAC9C,MAAMC,aAAa,IAAI,CAAC,CAAA,MAAO;QAC/B,IAAIR,QAAQ,KAAKA,QAAQQ,cAAcD,SAAS,GAAG;YACjD,OAAO;QACT;QAEA,MAAMJ,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMM,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,WAAW,IAAI,CAAC,CAAA,IAAK;QAE3B,MAAMC,aAAaL,QAAQC;QAC3B,MAAMK,YAAYV,OAAOlB,MAAM,GAAGwB;QAClC,MAAMX,YAAYW,OAAOC;QAEzB,IAAIE,cAAcT,OAAOlB,MAAM,EAAE;YAC/B,MAAMO,OAAO,KAAM,KAAKC,KAAKE,KAAK,CAACiB;YACnCT,OAAOlB,MAAM,GAAGO;YAChB,IAAI,CAAC,CAAA,IAAK,GAAGA,OAAO;QACtB;QAEA,MAAMsB,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,YAAYJ,aAAaG;QAE/B,MAAME,gBAAgBhB;QACtB,MAAMiB,iBAAiBT,aAAaR;QAEpC,IAAIgB,gBAAgBC,gBAAgB;YAClC,IAAIF,aAAajB,WAAW;gBAC1B,IAAK,IAAIX,IAAI,GAAGA,IAAIuB,MAAMvB,IAAK;oBAC7B,MAAM+B,OAAO/B;oBACb,MAAMgC,QAAQ,AAACV,OAAOI,YAAY1B,IAAK2B;oBACvCX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;oBAC5Bf,MAAM,CAACe,KAAK,GAAGE;gBACjB;YACF;YACA,MAAMC,YAAY,AAACZ,OAAOF,QAASO;YACnC,IAAK,IAAI3B,IAAI,GAAGA,IAAI6B,eAAe7B,IAAK;gBACtC,MAAM+B,OAAO,AAACT,OAAOtB,IAAK2B;gBAC1B,MAAMK,QAAQ,AAACE,YAAYlC,IAAK2B;gBAChCX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;gBAC5Bf,MAAM,CAACe,KAAK,GAAGE;YACjB;YACA,IAAI,CAAC,CAAA,IAAK,GAAGC;QACf,OAAO;YACL,IAAIN,aAAajB,WAAW;gBAC1B,IAAK,IAAIX,IAAI,GAAGA,IAAIuB,MAAMvB,IAAK;oBAC7B,MAAM+B,OAAO/B;oBACb,MAAMgC,QAAQ,AAACV,OAAOI,YAAY1B,IAAK2B;oBACvCX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;oBAC5Bf,MAAM,CAACe,KAAK,GAAGE;gBACjB;YACF;YAEA,IAAK,IAAIjC,IAAI8B,iBAAiB,GAAG9B,KAAK,GAAGA,IAAK;gBAC5C,MAAM+B,OAAO,AAACT,OAAOT,QAAQb,IAAK2B;gBAClC,MAAMK,QAAQ,AAACV,OAAOT,QAAQO,QAAQpB,IAAK2B;gBAE3CX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;gBAC5Bf,MAAM,CAACe,KAAK,GAAGE;YACjB;YAEA,IAAI,CAAC,CAAA,IAAK,GAAG,AAACX,OAAOG,aAAcE;QACrC;QAEA,IAAI,CAAC,CAAA,MAAO,GAAGF;QACf,OAAO;IACT;IAEAU,WAAWtB,KAAa,EAAEO,KAAa,EAAW;QAChD,MAAMC,aAAa,IAAI,CAAC,CAAA,MAAO;QAC/B,IAAIR,QAAQ,KAAKA,SAASQ,cAAcD,SAAS,GAAG;YAClD,OAAO;QACT;QAEA,MAAMgB,cAAc9B,KAAK+B,GAAG,CAACjB,OAAOC,aAAaR;QACjD,MAAMY,aAAaJ,aAAae;QAEhC,MAAMpB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMM,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMI,OAAO,IAAI,CAAC,CAAA,IAAK;QAEvB,IAAId,UAAU,GAAG;YACf,IAAK,IAAIb,IAAI,GAAGA,IAAIoC,aAAapC,IAAK;gBACpCgB,MAAM,CAAC,AAACM,OAAOtB,IAAK2B,KAAK,GAAGM;YAC9B;YACA,IAAI,CAAC,CAAA,IAAK,GAAG,AAACX,OAAOc,cAAeT;YACpC,IAAI,CAAC,CAAA,MAAO,GAAGF;YACf,OAAO;QACT;QAEA,IAAIZ,QAAQuB,gBAAgBf,YAAY;YACtC,IAAK,IAAIrB,IAAI,GAAGA,IAAIoC,aAAapC,IAAK;gBACpCgB,MAAM,CAAC,AAACO,OAAOvB,IAAI,IAAK2B,KAAK,GAAGM;YAClC;YACA,IAAI,CAAC,CAAA,IAAK,GAAG,AAACV,OAAOa,cAAeT;YACpC,IAAI,CAAC,CAAA,MAAO,GAAGF;YACf,OAAO;QACT;QAEA,MAAMI,gBAAgBhB;QACtB,MAAMiB,iBAAiBT,aAAaR,QAAQuB;QAE5C,IAAIP,gBAAgBC,gBAAgB;YAClC,IAAK,IAAI9B,IAAI6B,gBAAgB,GAAG7B,KAAK,GAAGA,IAAK;gBAC3C,MAAM+B,OAAO,AAACT,OAAOtB,IAAK2B;gBAC1B,MAAMK,QAAQ,AAACV,OAAOtB,IAAIoC,cAAeT;gBACzCX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;YAC9B;YACA,IAAK,IAAI/B,IAAI,GAAGA,IAAIoC,aAAapC,IAAK;gBACpCgB,MAAM,CAAC,AAACM,OAAOtB,IAAK2B,KAAK,GAAGM;YAC9B;YACA,IAAI,CAAC,CAAA,IAAK,GAAG,AAACX,OAAOc,cAAeT;QACtC,OAAO;YACL,IAAK,IAAI3B,IAAI,GAAGA,IAAI8B,gBAAgB9B,IAAK;gBACvC,MAAM+B,OAAO,AAACT,OAAOT,QAAQuB,cAAcpC,IAAK2B;gBAChD,MAAMK,QAAQ,AAACV,OAAOT,QAAQb,IAAK2B;gBACnCX,MAAM,CAACgB,MAAM,GAAGhB,MAAM,CAACe,KAAK;YAC9B;YACA,IAAI,CAAC,CAAA,IAAK,GAAG,AAACR,OAAOa,cAAeT;YACpC,IAAK,IAAI3B,IAAI,GAAGA,IAAIoC,aAAapC,IAAK;gBACpCgB,MAAM,CAAC,AAACO,OAAOvB,IAAK2B,KAAK,GAAGM;YAC9B;QACF;QAEA,IAAI,CAAC,CAAA,MAAO,GAAGR;QACf,OAAO;IACT;IAEAa,QAAQC,KAAQ,EAAE1B,QAAgB,CAAC,EAAU;QAC3C,MAAMf,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMkB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMM,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,OAAO,IAAI,CAAC,CAAA,IAAK;QAEvB,IAAID,OAAOC,MAAM;YACf,MAAMiB,SAASlB,OAAOT;YACtB,MAAM4B,SAASzB,OAAOsB,OAAO,CAACC,OAAOC;YACrC,IAAIC,WAAW,CAAC,KAAKA,SAASlB,MAAM;gBAClC,OAAOkB,SAASnB;YAClB;YACA,OAAO,CAAC;QACV;QACA,MAAMlB,WAAWY,OAAOlB,MAAM;QAC9B,MAAM4C,qBAAqBtC,WAAWkB;QAEtC,IAAIT,QAAQ6B,oBAAoB;YAC9B,MAAMC,cAAcrB,OAAOT;YAC3B,MAAM4B,SAASzB,OAAOsB,OAAO,CAACC,OAAOI;YACrC,IAAIF,WAAW,CAAC,GAAG;gBACjB,OAAOA,SAASnB;YAClB;YACAT,QAAQ6B;QACV;QAEA,IAAI7B,QAAQf,QAAQ;YAClB,IAAIyB,OAAOzB,SAAS,GAAG;gBACrB,MAAM2C,SAASzB,OAAOsB,OAAO,CAACC;gBAC9B,IAAIE,WAAW,CAAC,KAAKA,SAASlB,MAAM;oBAClC,OAAOmB,qBAAqBD;gBAC9B;YACF,OAAO;gBACL,IAAK,IAAIzC,IAAI,GAAGA,IAAIuB,MAAMvB,IAAK;oBAC7B,IAAIgB,MAAM,CAAChB,EAAE,KAAKuC,OAAO;wBACvB,OAAOG,qBAAqB1C;oBAC9B;gBACF;YACF;QACF;QACA,OAAO,CAAC;IACV;IAEA4C,SAAkB;QAChB,IAAI,IAAI,CAAClC,OAAO,IAAI;YAClB,OAAO;QACT;QACA,MAAMZ,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMkB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAM6B,WAAW,IAAI,CAAC,CAAA,IAAK;QAC3B,MAAMC,WAAW,IAAI,CAAC,CAAA,IAAK;QAE3B,IAAID,WAAWC,UAAU;YACvB,MAAM7B,eAAeD,OAAOlB,MAAM;YAClCkB,OAAOlB,MAAM,GAAGmB,eAAe6B;YAC/B,IAAK,IAAI9C,IAAI,GAAGA,IAAI8C,UAAU9C,IAAK;gBACjCgB,MAAM,CAACC,eAAejB,EAAE,GAAGgB,MAAM,CAAChB,EAAE;gBACpCgB,MAAM,CAAChB,EAAE,GAAGiC;YACd;QACF;QACA,IAAK,IAAIjC,IAAI,GAAGA,IAAIF,QAAQE,IAAK;YAC/BgB,MAAM,CAAChB,EAAE,GAAGgB,MAAM,CAAC6B,WAAW7C,EAAE;QAClC;QAEAgB,OAAOlB,MAAM,GAAG,IAAI,CAAC,CAAA,IAAK,GAAG;QAC7B,IAAI,CAAC,CAAA,IAAK,GAAG;QACb,IAAI,CAAC,CAAA,IAAK,GAAGA;QACb,IAAI,CAAC,CAAA,MAAO,GAAGA;QAEf,OAAO;IACT;IAEAiD,QAAQC,MAAyB,EAAW;QAC1C,IAAI,IAAI,CAACtC,OAAO,IAAI;YAClB,OAAO;QACT;QACA,MAAMZ,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMkB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMM,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMK,OAAO,IAAI,CAAC,CAAA,IAAK;QAEvB,IAAIV,eAAeD,OAAOlB,MAAM;QAChC,IAAIkC,QAAQ;QACZ,IAAK,IAAID,OAAO,GAAGA,OAAOjC,QAAQiC,OAAQ;YACxC,MAAMkB,aAAa,AAAC3B,OAAOS,OAAQJ;YACnC,MAAMY,QAAQvB,MAAM,CAACiC,WAAW;YAChC,IAAID,OAAOT,OAAOR,OAAO;gBACvB,IAAIA,SAASC,OAAO;oBAClB,MAAMkB,cAAc,AAAC5B,OAAOU,QAASL;oBACrCX,MAAM,CAACkC,YAAY,GAAGX;gBACxB;gBACAP;YACF;QACF;QACA,IAAIA,UAAUlC,QAAQ;YACpB,OAAO;QACT;QACA,IAAIkC,QAAQf,eAAe,GAAG;YAC5B,MAAMZ,OAAO,KAAM,KAAKC,KAAKE,KAAK,CAACwB,QAAQ;YAC3ChB,OAAOlB,MAAM,GAAGO;YAChBY,eAAeZ;QACjB;QAEA,IAAK,IAAIL,IAAIgC,OAAOhC,IAAIiB,cAAcjB,IAAK;YACzCgB,MAAM,CAAChB,EAAE,GAAGiC;QACd;QAEA,IAAI,CAAC,CAAA,IAAK,GAAG;QACb,IAAI,CAAC,CAAA,IAAK,GAAGD;QACb,IAAI,CAAC,CAAA,MAAO,GAAGA;QACf,OAAO;IACT;IAEAmB,KAAKZ,KAAQ,EAAE;QACb,MAAMhB,OAAO,IAAI,CAACT,aAAa,CAAC;QAChC,IAAIS,SAAS,IAAI,CAAC,CAAA,IAAK,EAAE;YACvB,IAAI,CAACR,IAAI,CAAC,IAAI,CAAC,CAAA,IAAK,GAAG;QACzB;QACA,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC,GAAGwB;QAC3B,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAACzB,aAAa,CAAC;QAChC,IAAI,CAAC,CAAA,MAAO;QACZ,OAAO,IAAI;IACb;IAEAsC,QAAQb,KAAQ,EAAQ;QACtB,MAAMjB,OAAO,IAAI,CAACV,aAAa,CAAC,CAAC;QACjC,IAAIU,SAAS,IAAI,CAAC,CAAA,IAAK,EAAE;YACvB,IAAI,CAACP,IAAI,CAAC,IAAI,CAAC,CAAA,IAAK,GAAG;QACzB;QACA,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAACH,aAAa,CAAC,CAAC;QACjC,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG2B;QAC3B,IAAI,CAAC,CAAA,MAAO;QACZ,OAAO,IAAI;IACb;IAEAc,QAAuB;QACrB,IAAI,IAAI,CAAC,CAAA,IAAK,KAAK,IAAI,CAAC,CAAA,IAAK,EAAE;YAC7B,OAAOpB;QACT;QACA,MAAMM,QAAQ,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC;QACtC,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC,GAAGN;QAC3B,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAACrB,aAAa,CAAC;QAChC,IAAI,CAAC,CAAA,MAAO;QACZ,OAAO2B;IACT;IAEAe,MAAqB;QACnB,IAAI,IAAI,CAAC,CAAA,IAAK,KAAK,IAAI,CAAC,CAAA,IAAK,EAAE;YAC7B,OAAOrB;QACT;QACA,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAACnB,aAAa,CAAC,CAAC;QACjC,MAAMyB,QAAQ,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC;QACtC,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC,GAAGN;QAC3B,IAAI,CAAC,CAAA,MAAO;QACZ,OAAOM;IACT;IAEAgB,OAAO1C,KAAa,EAAiB;QACnC,IAAIA,QAAQ,KAAKA,SAAS,IAAI,CAAC,CAAA,MAAO,EAAE;YACtC,OAAOoB;QACT;QACA,MAAMO,SAAS,IAAI,CAAC5B,aAAa,CAACC;QAClC,OAAO,IAAI,CAAC,CAAA,MAAO,CAAC2B,OAAO;IAC7B;IAEAgB,YAA2B;QACzB,OAAO,IAAI,CAAC,CAAA,MAAO,CAAC,IAAI,CAAC,CAAA,IAAK,CAAC;IACjC;IAEAC,WAA0B;QACxB,MAAMjB,SAAS,IAAI,CAAC1B,aAAa,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,CAAA,MAAO,CAAC0B,OAAO;IAC7B;IAEAkB,IAAInB,KAAQ,EAAW;QACrB,OAAO,IAAI,CAACD,OAAO,CAACC,WAAW,CAAC;IAClC;IAEAoB,UAAU9C,KAAa,EAAE0B,KAAQ,EAAU;QACzC,IAAI,CAACpB,QAAQ,CAACN,OAAO;QACrB,IAAI,CAAC,CAAA,MAAO,CAAC,AAAC,IAAI,CAAC,CAAA,IAAK,GAAGA,QAAS,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG0B;QAClD,OAAO1B;IACT;IAEA+C,OAAO/C,KAAa,EAAEjB,MAAW,EAAU;QACzC,MAAME,SAASF,OAAOE,MAAM;QAC5B,MAAMoC,YAAY,IAAI,CAAC,CAAA,IAAK,GAAGrB;QAC/B,IAAI,CAACM,QAAQ,CAACN,OAAOf;QACrB,IAAK,IAAIE,IAAI,GAAGA,IAAIF,QAAQE,IAAK;YAC/B,IAAI,CAAC,CAAA,MAAO,CAAC,AAACkC,YAAYlC,IAAK,IAAI,CAAC,CAAA,IAAK,CAAC,GAAGJ,MAAM,CAACI,EAAE;QACxD;QAEA,OAAOa;IACT;IAEAgD,UAAUhD,KAAa,EAAU;QAC/B,MAAMf,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,IAAIe,QAAQ,KAAKA,SAASf,QAAQ;YAChC,OAAO,CAAC;QACV;QACA,MAAMkB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMW,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAML,OAAO,IAAI,CAAC,CAAA,IAAK;QAEvB,MAAMO,gBAAgBhB;QACtB,MAAMiB,iBAAiBhC,SAASe;QAEhC,IAAIgB,gBAAgBC,gBAAgB;YAClC,IAAK,IAAI9B,IAAIa,OAAOb,IAAI,GAAGA,IAAK;gBAC9BgB,MAAM,CAAC,AAACM,OAAOtB,IAAK2B,KAAK,GAAGX,MAAM,CAAC,AAACM,OAAOtB,IAAI,IAAK2B,KAAK;YAC3D;YACAX,MAAM,CAACM,KAAK,GAAGW;YACf,IAAI,CAAC,CAAA,IAAK,GAAG,AAACX,OAAO,IAAKK;QAC5B,OAAO;YACL,IAAK,IAAI3B,IAAIa,OAAOb,IAAIF,SAAS,GAAGE,IAAK;gBACvCgB,MAAM,CAAC,AAACM,OAAOtB,IAAK2B,KAAK,GAAGX,MAAM,CAAC,AAACM,OAAOtB,IAAI,IAAK2B,KAAK;YAC3D;YACA,MAAMJ,OAAO,AAACD,OAAOxB,SAAS,IAAK6B;YACnCX,MAAM,CAACO,KAAK,GAAGU;YACf,IAAI,CAAC,CAAA,IAAK,GAAGV;QACf;QACA,IAAI,CAAC,CAAA,MAAO,GAAGzB,SAAS;QAExB,OAAOe;IACT;IAEAiD,YAAYvB,KAAQ,EAAE1B,QAAgB,CAAC,EAAU;QAC/C,MAAMkD,aAAa,IAAI,CAACzB,OAAO,CAACC,OAAO1B;QACvC,IAAIkD,eAAe,CAAC,GAAG;YACrB,OAAO,CAAC;QACV;QACA,OAAO,IAAI,CAACF,SAAS,CAACE;IACxB;IAEAC,OAAOnD,KAAa,EAAEO,KAAa,EAAO;QACxC,MAAMqB,SAAS,IAAI,CAACwB,KAAK,CAACpD,OAAOO;QACjC,IAAI,CAACe,UAAU,CAACtB,OAAOO;QACvB,OAAOqB;IACT;IAEAyB,QAAc;QACZ,IAAI,CAAC,CAAA,MAAO,CAACpE,MAAM,GAAG;QACtB,IAAI,CAAC,CAAA,MAAO,CAACA,MAAM,GAAGJ;QACtB,IAAI,CAAC,CAAA,IAAK,GAAG;QACb,IAAI,CAAC,CAAA,IAAK,GAAG;QACb,IAAI,CAAC,CAAA,MAAO,GAAG;QACf,IAAI,CAAC,CAAA,IAAK,GAAGA,mBAAmB;QAChC,OAAO,IAAI;IACb;IAEAuE,MAAME,QAAgB,CAAC,EAAEC,MAAc,IAAI,CAAC,CAAA,MAAO,EAAO;QACxD,MAAMtE,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMkB,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,MAAMM,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMC,OAAO,IAAI,CAAC,CAAA,IAAK;QACvB,MAAMI,OAAO,IAAI,CAAC,CAAA,IAAK;QAEvB,MAAM0C,cAAcF,QAAQ,IAAI7D,KAAKC,GAAG,CAACT,SAASqE,OAAO,KAAK7D,KAAK+B,GAAG,CAAC8B,OAAOrE;QAC9E,MAAMwE,YAAYF,MAAM,IAAI9D,KAAKC,GAAG,CAACT,SAASsE,KAAK,KAAK9D,KAAK+B,GAAG,CAAC+B,KAAKtE;QAEtE,IAAIwB,QAAQC,MAAM;YAChB,OAAO,IAAI,CAAC,CAAA,MAAO,CAAC0C,KAAK,CACvB,AAAC3C,OAAO+C,cAAe1C,MACvB,AAACL,OAAOgD,YAAa3C;QAEzB;QAEA,MAAMtB,OAAOC,KAAKC,GAAG,CAAC+D,YAAYD,aAAa;QAC/C,MAAM5B,SAAS,IAAIhC,MAASJ;QAC5B,IAAK,IAAIL,IAAI,GAAGA,IAAIK,MAAML,IAAK;YAC7ByC,MAAM,CAACzC,EAAE,GAAGgB,MAAM,CAAC,AAACM,OAAO+C,cAAcrE,IAAK2B,KAAK;QACrD;QACA,OAAOc;IACT;IAEA8B,UAAe;QACb,OAAO,IAAI,CAACN,KAAK;IACnB;IAEAO,QAA0C;QACxC,OAAOC,SAAS9E,IAAI,CAAC;YACnB,CAACM,OAAOyE,QAAQ,CAAC,EAAE;gBACjB,OAAO;oBACLC,MAAM;wBACJ,IAAI,IAAI,CAAC,CAAA,MAAO,KAAK,GAAG;4BACtB,OAAO;gCAAEC,MAAM;gCAAMrC,OAAON;4BAAU;wBACxC;wBACA,MAAMM,QAAQ,IAAI,CAACc,KAAK;wBACxB,OAAO;4BAAEuB,MAAM;4BAAOrC;wBAAM;oBAC9B;gBACF;YACF;QACF;IACF;IAEAsC,OAAyC;QACvC,OAAOJ,SAAS9E,IAAI,CAAC,IAAI,CAACM,OAAOyE,QAAQ,CAAC;IAC5C;IAEA,CAACzE,OAAOyE,QAAQ,CAAC,GAA+B;QAC9C,MAAM1D,SAAS,IAAI,CAAC,CAAA,MAAO;QAC3B,IAAI8D,MAAM,IAAI,CAAC,CAAA,IAAK;QACpB,OAAO;YACLH,MAAM;gBACJ,IAAIG,OAAO,IAAI,CAAC,CAAA,IAAK,GAAG,IAAI,CAAC,CAAA,MAAO,EAAE;oBACpC,OAAO;wBAAEF,MAAM;wBAAMrC,OAAON;oBAAU;gBACxC;gBACA,MAAMO,SAASsC,QAAQ,IAAI,CAAC,CAAA,IAAK;gBACjC,MAAMvC,QAAQvB,MAAM,CAACwB,OAAO;gBAC5B,OAAO;oBAAEoC,MAAM;oBAAOrC;gBAAM;YAC9B;QACF;IACF;AACF"}

package/build/ring-buffer.d.ts

@@ -0,0 +1,40 @@
+export interface FilterFunction<T> {
+    (value: T, index: number): boolean;
+}
+export declare class RingBuffer<T> {
+    #private;
+    static from<T>(values: T[]): RingBuffer<T>;
+    readonly [Symbol.toStringTag] = "RingBuffer";
+    constructor(capacity?: number);
+    get capacity(): number;
+    get length(): number;
+    isEmpty(): boolean;
+    isWrapped(): boolean;
+    getHeadOffset(index: number): number;
+    getTailOffset(index: number): number;
+    grow(capacity?: number): void;
+    allocate(index: number, count: number): boolean;
+    deallocate(index: number, count: number): boolean;
+    indexOf(value: T, index?: number): number;
+    unwrap(): boolean;
+    compact(filter: FilterFunction<T>): boolean;
+    push(value: T): this;
+    unshift(value: T): this;
+    shift(): T | undefined;
+    pop(): T | undefined;
+    peekAt(index: number): T | undefined;
+    peekFirst(): T | undefined;
+    peekLast(): T | undefined;
+    has(value: T): boolean;
+    insertOne(index: number, value: T): number;
+    insert(index: number, values: T[]): number;
+    removeOne(index: number): number;
+    removeFirst(value: T, index?: number): number;
+    remove(index: number, count: number): T[];
+    clear(): this;
+    slice(start?: number, end?: number): T[];
+    toArray(): T[];
+    drain(): IteratorObject<T, void, unknown>;
+    iter(): IteratorObject<T, void, unknown>;
+    [Symbol.iterator](): Iterator<T, void, unknown>;
+}