pythonlib 0.1.0

package/dist/chunk-TOI6IG3T.js

@@ -0,0 +1,337 @@
+import {
+  __export
+} from "./chunk-PZ5AY32C.js";
+
+// src/itertools.ts
+var itertools_exports = {};
+__export(itertools_exports, {
+  accumulate: () => accumulate,
+  chain: () => chain,
+  combinations: () => combinations,
+  combinations_with_replacement: () => combinations_with_replacement,
+  compress: () => compress,
+  count: () => count,
+  cycle: () => cycle,
+  dropwhile: () => dropwhile,
+  filterfalse: () => filterfalse,
+  groupby: () => groupby,
+  islice: () => islice,
+  pairwise: () => pairwise,
+  permutations: () => permutations,
+  product: () => product,
+  productRepeat: () => productRepeat,
+  repeat: () => repeat,
+  takewhile: () => takewhile,
+  tee: () => tee,
+  zip_longest: () => zip_longest
+});
+function chain(...iterables) {
+  return iterables.flatMap((it) => [...it]);
+}
+function combinations(iterable, r) {
+  const pool = [...iterable];
+  const n = pool.length;
+  if (r > n || r < 0) return [];
+  const result = [];
+  const indices = Array.from({ length: r }, (_, i) => i);
+  result.push(indices.map((i) => pool[i]));
+  for (; ; ) {
+    let i = r - 1;
+    while (i >= 0 && indices[i] === i + n - r) i--;
+    if (i < 0) break;
+    indices[i]++;
+    for (let j = i + 1; j < r; j++) {
+      indices[j] = indices[j - 1] + 1;
+    }
+    result.push(indices.map((idx) => pool[idx]));
+  }
+  return result;
+}
+function permutations(iterable, r) {
+  const pool = [...iterable];
+  const n = pool.length;
+  const rLen = r === void 0 ? n : r;
+  if (rLen > n || rLen < 0) return [];
+  const result = [];
+  const indices = Array.from({ length: n }, (_, i) => i);
+  const cycles = Array.from({ length: rLen }, (_, i) => n - i);
+  result.push(indices.slice(0, rLen).map((i) => pool[i]));
+  outer: for (; ; ) {
+    for (let i = rLen - 1; i >= 0; i--) {
+      ;
+      cycles[i]--;
+      if (cycles[i] === 0) {
+        const temp = indices[i];
+        for (let j = i; j < n - 1; j++) {
+          indices[j] = indices[j + 1];
+        }
+        indices[n - 1] = temp;
+        cycles[i] = n - i;
+      } else {
+        const j = n - cycles[i];
+        const swap = indices[j];
+        indices[j] = indices[i];
+        indices[i] = swap;
+        result.push(indices.slice(0, rLen).map((idx) => pool[idx]));
+        continue outer;
+      }
+    }
+    break;
+  }
+  return result;
+}
+function product(...iterables) {
+  if (iterables.length === 0) return [[]];
+  const pools = iterables.map((it) => [...it]);
+  if (pools.some((p) => p.length === 0)) return [];
+  const result = [];
+  const indices = new Array(pools.length).fill(0);
+  result.push(pools.map((p, i) => p[indices[i]]));
+  for (; ; ) {
+    let i = pools.length - 1;
+    while (i >= 0) {
+      ;
+      indices[i]++;
+      const currentPool = pools[i];
+      if (indices[i] < currentPool.length) {
+        result.push(pools.map((p, j) => p[indices[j]]));
+        break;
+      }
+      indices[i] = 0;
+      i--;
+    }
+    if (i < 0) break;
+  }
+  return result;
+}
+function* cycle(iterable) {
+  const saved = [];
+  for (const element of iterable) {
+    yield element;
+    saved.push(element);
+  }
+  if (saved.length === 0) return;
+  for (; ; ) {
+    yield* saved;
+  }
+}
+function repeat(obj, times) {
+  if (times !== void 0) {
+    return Array.from({ length: times }, () => obj);
+  }
+  return (function* () {
+    for (; ; ) {
+      yield obj;
+    }
+  })();
+}
+function islice(iterable, start, stop, step = 1) {
+  let actualStart = start;
+  let actualStop = stop;
+  if (actualStop === void 0) {
+    actualStop = start;
+    actualStart = 0;
+  }
+  if (step < 1) {
+    throw new Error("step must be >= 1");
+  }
+  const result = [];
+  let index = 0;
+  let nextIndex = actualStart;
+  for (const element of iterable) {
+    if (index >= actualStop) break;
+    if (index === nextIndex) {
+      result.push(element);
+      nextIndex += step;
+    }
+    index++;
+  }
+  return result;
+}
+function takewhile(predicate, iterable) {
+  const result = [];
+  for (const element of iterable) {
+    if (predicate(element)) {
+      result.push(element);
+    } else {
+      break;
+    }
+  }
+  return result;
+}
+function dropwhile(predicate, iterable) {
+  const result = [];
+  let dropping = true;
+  for (const element of iterable) {
+    if (dropping && predicate(element)) {
+      continue;
+    }
+    dropping = false;
+    result.push(element);
+  }
+  return result;
+}
+function zip_longest(...args) {
+  let fillvalue;
+  let iterables;
+  const lastArg = args[args.length - 1];
+  if (lastArg && typeof lastArg === "object" && !Array.isArray(lastArg) && !(Symbol.iterator in lastArg)) {
+    fillvalue = lastArg.fillvalue;
+    iterables = args.slice(0, -1);
+  } else {
+    iterables = args;
+  }
+  if (iterables.length === 0) return [];
+  const arrays = iterables.map((it) => [...it]);
+  const maxLen = Math.max(...arrays.map((a) => a.length));
+  const result = [];
+  for (let i = 0; i < maxLen; i++) {
+    const tuple = [];
+    for (const arr of arrays) {
+      tuple.push(i < arr.length ? arr[i] : fillvalue);
+    }
+    result.push(tuple);
+  }
+  return result;
+}
+function compress(data, selectors) {
+  const result = [];
+  const dataArr = [...data];
+  const selectorsArr = [...selectors];
+  const len = Math.min(dataArr.length, selectorsArr.length);
+  for (let i = 0; i < len; i++) {
+    if (selectorsArr[i]) {
+      result.push(dataArr[i]);
+    }
+  }
+  return result;
+}
+function filterfalse(predicate, iterable) {
+  const result = [];
+  for (const element of iterable) {
+    if (!predicate(element)) {
+      result.push(element);
+    }
+  }
+  return result;
+}
+function accumulate(iterable, func, initial) {
+  const result = [];
+  const arr = [...iterable];
+  if (arr.length === 0) {
+    if (initial !== void 0) {
+      return [initial];
+    }
+    return [];
+  }
+  const operation = func ?? ((a, b) => a + b);
+  let acc;
+  let startIdx;
+  if (initial !== void 0) {
+    acc = initial;
+    startIdx = 0;
+    result.push(acc);
+  } else {
+    acc = arr[0];
+    startIdx = 1;
+    result.push(acc);
+  }
+  for (let i = startIdx; i < arr.length; i++) {
+    acc = operation(acc, arr[i]);
+    result.push(acc);
+  }
+  return result;
+}
+function groupby(iterable, key) {
+  const result = [];
+  const keyFunc = key ?? ((x) => x);
+  let currentKey;
+  let currentGroup = [];
+  let first = true;
+  for (const element of iterable) {
+    const k = keyFunc(element);
+    if (first) {
+      currentKey = k;
+      currentGroup = [element];
+      first = false;
+    } else if (k === currentKey) {
+      currentGroup.push(element);
+    } else {
+      result.push([currentKey, currentGroup]);
+      currentKey = k;
+      currentGroup = [element];
+    }
+  }
+  if (!first) {
+    result.push([currentKey, currentGroup]);
+  }
+  return result;
+}
+function* count(start = 0, step = 1) {
+  let n = start;
+  for (; ; ) {
+    yield n;
+    n += step;
+  }
+}
+function tee(iterable, n = 2) {
+  const arr = [...iterable];
+  return Array.from({ length: n }, () => [...arr]);
+}
+function pairwise(iterable) {
+  const arr = [...iterable];
+  const result = [];
+  for (let i = 0; i < arr.length - 1; i++) {
+    result.push([arr[i], arr[i + 1]]);
+  }
+  return result;
+}
+function productRepeat(iterable, repeat2 = 1) {
+  const pool = [...iterable];
+  if (repeat2 < 1 || pool.length === 0) return repeat2 === 0 ? [[]] : [];
+  const pools = Array.from({ length: repeat2 }, () => pool);
+  return product(...pools);
+}
+function combinations_with_replacement(iterable, r) {
+  const pool = [...iterable];
+  const n = pool.length;
+  if (r < 0 || n === 0) return r === 0 ? [[]] : [];
+  const result = [];
+  const indices = new Array(r).fill(0);
+  result.push(indices.map((i) => pool[i]));
+  for (; ; ) {
+    let i = r - 1;
+    while (i >= 0 && indices[i] === n - 1) i--;
+    if (i < 0) break;
+    const newVal = indices[i] + 1;
+    for (let j = i; j < r; j++) {
+      indices[j] = newVal;
+    }
+    result.push(indices.map((idx) => pool[idx]));
+  }
+  return result;
+}
+
+export {
+  chain,
+  combinations,
+  permutations,
+  product,
+  cycle,
+  repeat,
+  islice,
+  takewhile,
+  dropwhile,
+  zip_longest,
+  compress,
+  filterfalse,
+  accumulate,
+  groupby,
+  count,
+  tee,
+  pairwise,
+  productRepeat,
+  combinations_with_replacement,
+  itertools_exports
+};
+//# sourceMappingURL=chunk-TOI6IG3T.js.map

package/dist/chunk-TOI6IG3T.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/itertools.ts"],"sourcesContent":["/**\n * Python itertools module for TypeScript\n *\n * Provides iterator building blocks inspired by Python's itertools module.\n *\n * Design Decision (ADR-0008):\n * - Most functions return eager arrays for better debugging and familiarity\n * - Only infinite sequences (cycle, repeat without count) use generators\n */\n\n/**\n * Chain multiple iterables together into a single array\n * chain([1, 2], [3, 4]) -> [1, 2, 3, 4]\n */\nexport function chain<T>(...iterables: Iterable<T>[]): T[] {\n  return iterables.flatMap((it) => [...it])\n}\n\n/**\n * Return successive r-length combinations of elements\n * combinations([1, 2, 3], 2) -> [[1, 2], [1, 3], [2, 3]]\n */\nexport function combinations<T>(iterable: Iterable<T>, r: number): T[][] {\n  const pool = [...iterable]\n  const n = pool.length\n  if (r > n || r < 0) return []\n\n  const result: T[][] = []\n  const indices: number[] = Array.from({ length: r }, (_, i) => i)\n  result.push(indices.map((i) => pool[i] as T))\n\n  for (;;) {\n    let i = r - 1\n    while (i >= 0 && indices[i] === i + n - r) i--\n    if (i < 0) break\n    ;(indices[i] as number)++\n    for (let j = i + 1; j < r; j++) {\n      indices[j] = (indices[j - 1] as number) + 1\n    }\n    result.push(indices.map((idx) => pool[idx] as T))\n  }\n\n  return result\n}\n\n/**\n * Return successive r-length permutations of elements\n * permutations([1, 2, 3], 2) -> [[1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2]]\n */\nexport function permutations<T>(iterable: Iterable<T>, r?: number): T[][] {\n  const pool = [...iterable]\n  const n = pool.length\n  const rLen = r === undefined ? n : r\n  if (rLen > n || rLen < 0) return []\n\n  const result: T[][] = []\n  const indices: number[] = Array.from({ length: n }, (_, i) => i)\n  const cycles: number[] = Array.from({ length: rLen }, (_, i) => n - i)\n\n  result.push(indices.slice(0, rLen).map((i) => pool[i] as T))\n\n  outer: for (;;) {\n    for (let i = rLen - 1; i >= 0; i--) {\n      ;(cycles[i] as number)--\n      if (cycles[i] === 0) {\n        // Rotate indices[i:] left by one\n        const temp = indices[i] as number\n        for (let j = i; j < n - 1; j++) {\n          indices[j] = indices[j + 1] as number\n        }\n        indices[n - 1] = temp\n        cycles[i] = n - i\n      } else {\n        const j = n - (cycles[i] as number)\n        const swap = indices[j] as number\n        indices[j] = indices[i] as number\n        indices[i] = swap\n        result.push(indices.slice(0, rLen).map((idx) => pool[idx] as T))\n        continue outer\n      }\n    }\n    break\n  }\n\n  return result\n}\n\n/**\n * Cartesian product of input iterables\n * product([1, 2], ['a', 'b']) -> [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]\n */\nexport function product<T>(...iterables: Iterable<T>[]): T[][] {\n  if (iterables.length === 0) return [[]]\n\n  const pools = iterables.map((it) => [...it])\n\n  // Check if any pool is empty\n  if (pools.some((p) => p.length === 0)) return []\n\n  const result: T[][] = []\n  const indices: number[] = new Array<number>(pools.length).fill(0)\n  result.push(pools.map((p, i) => p[indices[i] as number] as T))\n\n  for (;;) {\n    let i = pools.length - 1\n    while (i >= 0) {\n      ;(indices[i] as number)++\n      const currentPool = pools[i] as T[]\n      if ((indices[i] as number) < currentPool.length) {\n        result.push(pools.map((p, j) => p[indices[j] as number] as T))\n        break\n      }\n      indices[i] = 0\n      i--\n    }\n    if (i < 0) break\n  }\n\n  return result\n}\n\n/**\n * Cycle through an iterable indefinitely (INFINITE - returns Generator)\n * cycle([1, 2, 3]) -> 1, 2, 3, 1, 2, 3, 1, 2, 3, ...\n *\n * WARNING: This is infinite! Use with for...of and break, or islice.\n */\nexport function* cycle<T>(iterable: Iterable<T>): Generator<T> {\n  const saved: T[] = []\n  for (const element of iterable) {\n    yield element\n    saved.push(element)\n  }\n  if (saved.length === 0) return\n  for (;;) {\n    yield* saved\n  }\n}\n\n/**\n * Repeat an object. If times is specified, returns an array. Otherwise returns\n * an infinite generator.\n *\n * repeat('x', 3) -> ['x', 'x', 'x']\n * repeat('x') -> Generator that yields 'x' forever (INFINITE)\n */\nexport function repeat<T>(obj: T, times?: number): T[] | Generator<T> {\n  if (times !== undefined) {\n    // Finite: return array\n    return Array.from({ length: times }, () => obj)\n  }\n  // Infinite: return generator\n  return (function* () {\n    for (;;) {\n      yield obj\n    }\n  })()\n}\n\n/**\n * Slice an iterable from start to stop with step\n * islice([1, 2, 3, 4, 5], 1, 4) -> [2, 3, 4]\n * islice([1, 2, 3, 4, 5], 3) -> [1, 2, 3]\n */\nexport function islice<T>(\n  iterable: Iterable<T>,\n  start: number,\n  stop?: number,\n  step: number = 1\n): T[] {\n  // Handle single argument (stop only): islice(it, 5) means islice(it, 0, 5, 1)\n  let actualStart = start\n  let actualStop = stop\n  if (actualStop === undefined) {\n    actualStop = start\n    actualStart = 0\n  }\n\n  if (step < 1) {\n    throw new Error(\"step must be >= 1\")\n  }\n\n  const result: T[] = []\n  let index = 0\n  let nextIndex = actualStart\n\n  for (const element of iterable) {\n    if (index >= actualStop) break\n    if (index === nextIndex) {\n      result.push(element)\n      nextIndex += step\n    }\n    index++\n  }\n\n  return result\n}\n\n/**\n * Take elements while predicate is true\n * takewhile(x => x < 5, [1, 4, 6, 4, 1]) -> [1, 4]\n */\nexport function takewhile<T>(predicate: (x: T) => boolean, iterable: Iterable<T>): T[] {\n  const result: T[] = []\n  for (const element of iterable) {\n    if (predicate(element)) {\n      result.push(element)\n    } else {\n      break\n    }\n  }\n  return result\n}\n\n/**\n * Skip elements while predicate is true, then return the rest\n * dropwhile(x => x < 5, [1, 4, 6, 4, 1]) -> [6, 4, 1]\n */\nexport function dropwhile<T>(predicate: (x: T) => boolean, iterable: Iterable<T>): T[] {\n  const result: T[] = []\n  let dropping = true\n  for (const element of iterable) {\n    if (dropping && predicate(element)) {\n      continue\n    }\n    dropping = false\n    result.push(element)\n  }\n  return result\n}\n\n/**\n * Zip iterables together, filling missing values with fillvalue\n * zip_longest([1, 2, 3], ['a', 'b'], { fillvalue: '-' }) -> [[1, 'a'], [2, 'b'], [3, '-']]\n */\nexport function zip_longest<T>(\n  ...args: [...Iterable<T>[], { fillvalue?: T }] | Iterable<T>[]\n): T[][] {\n  let fillvalue: T | undefined\n  let iterables: Iterable<T>[]\n\n  // Check if last argument is options object\n  const lastArg = args[args.length - 1]\n  if (\n    lastArg &&\n    typeof lastArg === \"object\" &&\n    !Array.isArray(lastArg) &&\n    !(Symbol.iterator in lastArg)\n  ) {\n    fillvalue = (lastArg as { fillvalue?: T }).fillvalue\n    iterables = args.slice(0, -1) as Iterable<T>[]\n  } else {\n    iterables = args as Iterable<T>[]\n  }\n\n  if (iterables.length === 0) return []\n\n  const arrays = iterables.map((it) => [...it])\n  const maxLen = Math.max(...arrays.map((a) => a.length))\n  const result: T[][] = []\n\n  for (let i = 0; i < maxLen; i++) {\n    const tuple: T[] = []\n    for (const arr of arrays) {\n      tuple.push(i < arr.length ? (arr[i] as T) : (fillvalue as T))\n    }\n    result.push(tuple)\n  }\n\n  return result\n}\n\n/**\n * Return elements from iterable where the corresponding selector is true\n * compress([1, 2, 3, 4, 5], [1, 0, 1, 0, 1]) -> [1, 3, 5]\n */\nexport function compress<T>(data: Iterable<T>, selectors: Iterable<unknown>): T[] {\n  const result: T[] = []\n  const dataArr = [...data]\n  const selectorsArr = [...selectors]\n  const len = Math.min(dataArr.length, selectorsArr.length)\n\n  for (let i = 0; i < len; i++) {\n    if (selectorsArr[i]) {\n      result.push(dataArr[i] as T)\n    }\n  }\n  return result\n}\n\n/**\n * Return elements for which predicate is false\n * filterfalse(x => x % 2, [1, 2, 3, 4, 5]) -> [2, 4]\n */\nexport function filterfalse<T>(predicate: (x: T) => unknown, iterable: Iterable<T>): T[] {\n  const result: T[] = []\n  for (const element of iterable) {\n    if (!predicate(element)) {\n      result.push(element)\n    }\n  }\n  return result\n}\n\n/**\n * Make an iterator that returns accumulated sums or accumulated results\n * accumulate([1, 2, 3, 4, 5]) -> [1, 3, 6, 10, 15]\n * accumulate([1, 2, 3, 4, 5], (x, y) => x * y) -> [1, 2, 6, 24, 120]\n */\nexport function accumulate<T>(\n  iterable: Iterable<T>,\n  func?: (acc: T, val: T) => T,\n  initial?: T\n): T[] {\n  const result: T[] = []\n  const arr = [...iterable]\n\n  if (arr.length === 0) {\n    if (initial !== undefined) {\n      return [initial]\n    }\n    return []\n  }\n\n  const operation = func ?? ((a: T, b: T): T => ((a as number) + (b as number)) as unknown as T)\n\n  let acc: T\n  let startIdx: number\n\n  if (initial !== undefined) {\n    acc = initial\n    startIdx = 0\n    result.push(acc)\n  } else {\n    acc = arr[0] as T\n    startIdx = 1\n    result.push(acc)\n  }\n\n  for (let i = startIdx; i < arr.length; i++) {\n    acc = operation(acc, arr[i] as T)\n    result.push(acc)\n  }\n\n  return result\n}\n\n/**\n * Return consecutive keys and groups from the iterable\n * groupby([1, 1, 2, 2, 2, 3, 1, 1]) -> [[1, [1, 1]], [2, [2, 2, 2]], [3, [3]], [1, [1, 1]]]\n */\nexport function groupby<T, K = T>(iterable: Iterable<T>, key?: (x: T) => K): [K, T[]][] {\n  const result: [K, T[]][] = []\n  const keyFunc = key ?? ((x: T) => x as unknown as K)\n\n  let currentKey: K | undefined\n  let currentGroup: T[] = []\n  let first = true\n\n  for (const element of iterable) {\n    const k = keyFunc(element)\n    if (first) {\n      currentKey = k\n      currentGroup = [element]\n      first = false\n    } else if (k === currentKey) {\n      currentGroup.push(element)\n    } else {\n      result.push([currentKey as K, currentGroup])\n      currentKey = k\n      currentGroup = [element]\n    }\n  }\n\n  if (!first) {\n    result.push([currentKey as K, currentGroup])\n  }\n\n  return result\n}\n\n/**\n * Make an iterator that returns evenly spaced values starting with n\n * count(10, 2) -> 10, 12, 14, 16, 18, ...  (INFINITE Generator)\n */\nexport function* count(start: number = 0, step: number = 1): Generator<number> {\n  let n = start\n  for (;;) {\n    yield n\n    n += step\n  }\n}\n\n/**\n * Return n independent iterators from a single iterable\n * tee([1, 2, 3], 2) -> [[1, 2, 3], [1, 2, 3]]\n */\nexport function tee<T>(iterable: Iterable<T>, n: number = 2): T[][] {\n  const arr = [...iterable]\n  return Array.from({ length: n }, () => [...arr])\n}\n\n/**\n * Return successive overlapping pairs from the iterable\n * pairwise([1, 2, 3, 4, 5]) -> [[1, 2], [2, 3], [3, 4], [4, 5]]\n */\nexport function pairwise<T>(iterable: Iterable<T>): [T, T][] {\n  const arr = [...iterable]\n  const result: [T, T][] = []\n  for (let i = 0; i < arr.length - 1; i++) {\n    result.push([arr[i] as T, arr[i + 1] as T])\n  }\n  return result\n}\n\n/**\n * Cartesian product with repeat (product(range(3), repeat=2) like nested loops)\n * productRepeat([0, 1], 2) -> [[0, 0], [0, 1], [1, 0], [1, 1]]\n */\nexport function productRepeat<T>(iterable: Iterable<T>, repeat: number = 1): T[][] {\n  const pool = [...iterable]\n  if (repeat < 1 || pool.length === 0) return repeat === 0 ? [[]] : []\n\n  const pools = Array.from({ length: repeat }, () => pool)\n  return product(...pools)\n}\n\n/**\n * Return r-length combinations with replacement\n * combinations_with_replacement([1, 2, 3], 2) -> [[1, 1], [1, 2], [1, 3], [2, 2], [2, 3], [3, 3]]\n */\nexport function combinations_with_replacement<T>(iterable: Iterable<T>, r: number): T[][] {\n  const pool = [...iterable]\n  const n = pool.length\n  if (r < 0 || n === 0) return r === 0 ? [[]] : []\n\n  const result: T[][] = []\n  const indices: number[] = new Array<number>(r).fill(0)\n  result.push(indices.map((i) => pool[i] as T))\n\n  for (;;) {\n    let i = r - 1\n    while (i >= 0 && indices[i] === n - 1) i--\n    if (i < 0) break\n    const newVal = (indices[i] as number) + 1\n    for (let j = i; j < r; j++) {\n      indices[j] = newVal\n    }\n    result.push(indices.map((idx) => pool[idx] as T))\n  }\n\n  return result\n}\n"],"mappings":";;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcO,SAAS,SAAY,WAA+B;AACzD,SAAO,UAAU,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;AAC1C;AAMO,SAAS,aAAgB,UAAuB,GAAkB;AACvE,QAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,QAAM,IAAI,KAAK;AACf,MAAI,IAAI,KAAK,IAAI,EAAG,QAAO,CAAC;AAE5B,QAAM,SAAgB,CAAC;AACvB,QAAM,UAAoB,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AAC/D,SAAO,KAAK,QAAQ,IAAI,CAAC,MAAM,KAAK,CAAC,CAAM,CAAC;AAE5C,aAAS;AACP,QAAI,IAAI,IAAI;AACZ,WAAO,KAAK,KAAK,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAG;AAC3C,QAAI,IAAI,EAAG;AACV,IAAC,QAAQ,CAAC;AACX,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,cAAQ,CAAC,IAAK,QAAQ,IAAI,CAAC,IAAe;AAAA,IAC5C;AACA,WAAO,KAAK,QAAQ,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAM,CAAC;AAAA,EAClD;AAEA,SAAO;AACT;AAMO,SAAS,aAAgB,UAAuB,GAAmB;AACxE,QAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,QAAM,IAAI,KAAK;AACf,QAAM,OAAO,MAAM,SAAY,IAAI;AACnC,MAAI,OAAO,KAAK,OAAO,EAAG,QAAO,CAAC;AAElC,QAAM,SAAgB,CAAC;AACvB,QAAM,UAAoB,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AAC/D,QAAM,SAAmB,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC;AAErE,SAAO,KAAK,QAAQ,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAM,CAAC;AAE3D,QAAO,YAAS;AACd,aAAS,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;AAClC;AAAC,MAAC,OAAO,CAAC;AACV,UAAI,OAAO,CAAC,MAAM,GAAG;AAEnB,cAAM,OAAO,QAAQ,CAAC;AACtB,iBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,kBAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;AAAA,QAC5B;AACA,gBAAQ,IAAI,CAAC,IAAI;AACjB,eAAO,CAAC,IAAI,IAAI;AAAA,MAClB,OAAO;AACL,cAAM,IAAI,IAAK,OAAO,CAAC;AACvB,cAAM,OAAO,QAAQ,CAAC;AACtB,gBAAQ,CAAC,IAAI,QAAQ,CAAC;AACtB,gBAAQ,CAAC,IAAI;AACb,eAAO,KAAK,QAAQ,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAM,CAAC;AAC/D,iBAAS;AAAA,MACX;AAAA,IACF;AACA;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,WAAc,WAAiC;AAC7D,MAAI,UAAU,WAAW,EAAG,QAAO,CAAC,CAAC,CAAC;AAEtC,QAAM,QAAQ,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;AAG3C,MAAI,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,EAAG,QAAO,CAAC;AAE/C,QAAM,SAAgB,CAAC;AACvB,QAAM,UAAoB,IAAI,MAAc,MAAM,MAAM,EAAE,KAAK,CAAC;AAChE,SAAO,KAAK,MAAM,IAAI,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,CAAW,CAAM,CAAC;AAE7D,aAAS;AACP,QAAI,IAAI,MAAM,SAAS;AACvB,WAAO,KAAK,GAAG;AACb;AAAC,MAAC,QAAQ,CAAC;AACX,YAAM,cAAc,MAAM,CAAC;AAC3B,UAAK,QAAQ,CAAC,IAAe,YAAY,QAAQ;AAC/C,eAAO,KAAK,MAAM,IAAI,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,CAAW,CAAM,CAAC;AAC7D;AAAA,MACF;AACA,cAAQ,CAAC,IAAI;AACb;AAAA,IACF;AACA,QAAI,IAAI,EAAG;AAAA,EACb;AAEA,SAAO;AACT;AAQO,UAAU,MAAS,UAAqC;AAC7D,QAAM,QAAa,CAAC;AACpB,aAAW,WAAW,UAAU;AAC9B,UAAM;AACN,UAAM,KAAK,OAAO;AAAA,EACpB;AACA,MAAI,MAAM,WAAW,EAAG;AACxB,aAAS;AACP,WAAO;AAAA,EACT;AACF;AASO,SAAS,OAAU,KAAQ,OAAoC;AACpE,MAAI,UAAU,QAAW;AAEvB,WAAO,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,MAAM,GAAG;AAAA,EAChD;AAEA,UAAQ,aAAa;AACnB,eAAS;AACP,YAAM;AAAA,IACR;AAAA,EACF,GAAG;AACL;AAOO,SAAS,OACd,UACA,OACA,MACA,OAAe,GACV;AAEL,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,MAAI,eAAe,QAAW;AAC5B,iBAAa;AACb,kBAAc;AAAA,EAChB;AAEA,MAAI,OAAO,GAAG;AACZ,UAAM,IAAI,MAAM,mBAAmB;AAAA,EACrC;AAEA,QAAM,SAAc,CAAC;AACrB,MAAI,QAAQ;AACZ,MAAI,YAAY;AAEhB,aAAW,WAAW,UAAU;AAC9B,QAAI,SAAS,WAAY;AACzB,QAAI,UAAU,WAAW;AACvB,aAAO,KAAK,OAAO;AACnB,mBAAa;AAAA,IACf;AACA;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,UAAa,WAA8B,UAA4B;AACrF,QAAM,SAAc,CAAC;AACrB,aAAW,WAAW,UAAU;AAC9B,QAAI,UAAU,OAAO,GAAG;AACtB,aAAO,KAAK,OAAO;AAAA,IACrB,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,UAAa,WAA8B,UAA4B;AACrF,QAAM,SAAc,CAAC;AACrB,MAAI,WAAW;AACf,aAAW,WAAW,UAAU;AAC9B,QAAI,YAAY,UAAU,OAAO,GAAG;AAClC;AAAA,IACF;AACA,eAAW;AACX,WAAO,KAAK,OAAO;AAAA,EACrB;AACA,SAAO;AACT;AAMO,SAAS,eACX,MACI;AACP,MAAI;AACJ,MAAI;AAGJ,QAAM,UAAU,KAAK,KAAK,SAAS,CAAC;AACpC,MACE,WACA,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO,KACtB,EAAE,OAAO,YAAY,UACrB;AACA,gBAAa,QAA8B;AAC3C,gBAAY,KAAK,MAAM,GAAG,EAAE;AAAA,EAC9B,OAAO;AACL,gBAAY;AAAA,EACd;AAEA,MAAI,UAAU,WAAW,EAAG,QAAO,CAAC;AAEpC,QAAM,SAAS,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;AAC5C,QAAM,SAAS,KAAK,IAAI,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACtD,QAAM,SAAgB,CAAC;AAEvB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,QAAa,CAAC;AACpB,eAAW,OAAO,QAAQ;AACxB,YAAM,KAAK,IAAI,IAAI,SAAU,IAAI,CAAC,IAAW,SAAe;AAAA,IAC9D;AACA,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,SAAO;AACT;AAMO,SAAS,SAAY,MAAmB,WAAmC;AAChF,QAAM,SAAc,CAAC;AACrB,QAAM,UAAU,CAAC,GAAG,IAAI;AACxB,QAAM,eAAe,CAAC,GAAG,SAAS;AAClC,QAAM,MAAM,KAAK,IAAI,QAAQ,QAAQ,aAAa,MAAM;AAExD,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,aAAa,CAAC,GAAG;AACnB,aAAO,KAAK,QAAQ,CAAC,CAAM;AAAA,IAC7B;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,YAAe,WAA8B,UAA4B;AACvF,QAAM,SAAc,CAAC;AACrB,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,UAAU,OAAO,GAAG;AACvB,aAAO,KAAK,OAAO;AAAA,IACrB;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,WACd,UACA,MACA,SACK;AACL,QAAM,SAAc,CAAC;AACrB,QAAM,MAAM,CAAC,GAAG,QAAQ;AAExB,MAAI,IAAI,WAAW,GAAG;AACpB,QAAI,YAAY,QAAW;AACzB,aAAO,CAAC,OAAO;AAAA,IACjB;AACA,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,YAAY,SAAS,CAAC,GAAM,MAAc,IAAgB;AAEhE,MAAI;AACJ,MAAI;AAEJ,MAAI,YAAY,QAAW;AACzB,UAAM;AACN,eAAW;AACX,WAAO,KAAK,GAAG;AAAA,EACjB,OAAO;AACL,UAAM,IAAI,CAAC;AACX,eAAW;AACX,WAAO,KAAK,GAAG;AAAA,EACjB;AAEA,WAAS,IAAI,UAAU,IAAI,IAAI,QAAQ,KAAK;AAC1C,UAAM,UAAU,KAAK,IAAI,CAAC,CAAM;AAChC,WAAO,KAAK,GAAG;AAAA,EACjB;AAEA,SAAO;AACT;AAMO,SAAS,QAAkB,UAAuB,KAA+B;AACtF,QAAM,SAAqB,CAAC;AAC5B,QAAM,UAAU,QAAQ,CAAC,MAAS;AAElC,MAAI;AACJ,MAAI,eAAoB,CAAC;AACzB,MAAI,QAAQ;AAEZ,aAAW,WAAW,UAAU;AAC9B,UAAM,IAAI,QAAQ,OAAO;AACzB,QAAI,OAAO;AACT,mBAAa;AACb,qBAAe,CAAC,OAAO;AACvB,cAAQ;AAAA,IACV,WAAW,MAAM,YAAY;AAC3B,mBAAa,KAAK,OAAO;AAAA,IAC3B,OAAO;AACL,aAAO,KAAK,CAAC,YAAiB,YAAY,CAAC;AAC3C,mBAAa;AACb,qBAAe,CAAC,OAAO;AAAA,IACzB;AAAA,EACF;AAEA,MAAI,CAAC,OAAO;AACV,WAAO,KAAK,CAAC,YAAiB,YAAY,CAAC;AAAA,EAC7C;AAEA,SAAO;AACT;AAMO,UAAU,MAAM,QAAgB,GAAG,OAAe,GAAsB;AAC7E,MAAI,IAAI;AACR,aAAS;AACP,UAAM;AACN,SAAK;AAAA,EACP;AACF;AAMO,SAAS,IAAO,UAAuB,IAAY,GAAU;AAClE,QAAM,MAAM,CAAC,GAAG,QAAQ;AACxB,SAAO,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC;AACjD;AAMO,SAAS,SAAY,UAAiC;AAC3D,QAAM,MAAM,CAAC,GAAG,QAAQ;AACxB,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;AACvC,WAAO,KAAK,CAAC,IAAI,CAAC,GAAQ,IAAI,IAAI,CAAC,CAAM,CAAC;AAAA,EAC5C;AACA,SAAO;AACT;AAMO,SAAS,cAAiB,UAAuBA,UAAiB,GAAU;AACjF,QAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,MAAIA,UAAS,KAAK,KAAK,WAAW,EAAG,QAAOA,YAAW,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAEnE,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQA,QAAO,GAAG,MAAM,IAAI;AACvD,SAAO,QAAQ,GAAG,KAAK;AACzB;AAMO,SAAS,8BAAiC,UAAuB,GAAkB;AACxF,QAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,QAAM,IAAI,KAAK;AACf,MAAI,IAAI,KAAK,MAAM,EAAG,QAAO,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAE/C,QAAM,SAAgB,CAAC;AACvB,QAAM,UAAoB,IAAI,MAAc,CAAC,EAAE,KAAK,CAAC;AACrD,SAAO,KAAK,QAAQ,IAAI,CAAC,MAAM,KAAK,CAAC,CAAM,CAAC;AAE5C,aAAS;AACP,QAAI,IAAI,IAAI;AACZ,WAAO,KAAK,KAAK,QAAQ,CAAC,MAAM,IAAI,EAAG;AACvC,QAAI,IAAI,EAAG;AACX,UAAM,SAAU,QAAQ,CAAC,IAAe;AACxC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAQ,CAAC,IAAI;AAAA,IACf;AACA,WAAO,KAAK,QAAQ,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAM,CAAC;AAAA,EAClD;AAEA,SAAO;AACT;","names":["repeat"]}

package/dist/chunk-UFMTN4T4.js

@@ -0,0 +1,215 @@
+import {
+  __export
+} from "./chunk-PZ5AY32C.js";
+
+// src/collections.ts
+var collections_exports = {};
+__export(collections_exports, {
+  Counter: () => Counter,
+  defaultdict: () => defaultdict,
+  deque: () => deque
+});
+var Counter = class _Counter extends Map {
+  constructor(iterable) {
+    super();
+    if (iterable) {
+      for (const item of iterable) {
+        this.increment(item);
+      }
+    }
+  }
+  /**
+   * Increment the count for a key
+   */
+  increment(key, n = 1) {
+    this.set(key, (super.get(key) ?? 0) + n);
+  }
+  /**
+   * Get the count for a key (returns 0 for missing keys)
+   */
+  get(key) {
+    return super.get(key) ?? 0;
+  }
+  /**
+   * List the n most common elements and their counts
+   * If n is undefined, list all elements from most common to least
+   */
+  mostCommon(n) {
+    const sorted = [...this.entries()].sort((a, b) => b[1] - a[1]);
+    return n !== void 0 ? sorted.slice(0, n) : sorted;
+  }
+  /**
+   * Iterate over elements, repeating each as many times as its count
+   */
+  *elements() {
+    for (const [key, count] of this) {
+      for (let i = 0; i < count; i++) {
+        yield key;
+      }
+    }
+  }
+  /**
+   * Subtract counts from another iterable or Counter
+   */
+  subtract(iterable) {
+    if (iterable instanceof _Counter) {
+      for (const [key, count] of iterable) {
+        this.set(key, (super.get(key) ?? 0) - count);
+      }
+    } else {
+      for (const item of iterable) {
+        this.set(item, (super.get(item) ?? 0) - 1);
+      }
+    }
+  }
+  /**
+   * Add counts from another iterable or Counter
+   */
+  update(iterable) {
+    if (iterable instanceof _Counter) {
+      for (const [key, count] of iterable) {
+        this.increment(key, count);
+      }
+    } else {
+      for (const item of iterable) {
+        this.increment(item);
+      }
+    }
+  }
+  /**
+   * Return total count of all elements
+   */
+  total() {
+    let sum = 0;
+    for (const count of this.values()) {
+      sum += count;
+    }
+    return sum;
+  }
+};
+function defaultdict(factory) {
+  const map = /* @__PURE__ */ new Map();
+  return new Proxy(map, {
+    get(target, prop, receiver) {
+      if (prop === "get") {
+        return (key) => {
+          if (!target.has(key)) {
+            const defaultValue = factory();
+            target.set(key, defaultValue);
+            return defaultValue;
+          }
+          return target.get(key);
+        };
+      }
+      const val = Reflect.get(target, prop, receiver);
+      if (typeof val === "function") {
+        return val.bind(target);
+      }
+      return val;
+    }
+  });
+}
+var deque = class {
+  items;
+  maxlen;
+  constructor(iterable, maxlen) {
+    this.items = iterable ? [...iterable] : [];
+    this.maxlen = maxlen ?? null;
+    if (this.maxlen !== null && this.items.length > this.maxlen) {
+      this.items = this.items.slice(-this.maxlen);
+    }
+  }
+  /**
+   * Add element to the right end
+   */
+  append(x) {
+    this.items.push(x);
+    if (this.maxlen !== null && this.items.length > this.maxlen) {
+      this.items.shift();
+    }
+  }
+  /**
+   * Add element to the left end
+   */
+  appendleft(x) {
+    this.items.unshift(x);
+    if (this.maxlen !== null && this.items.length > this.maxlen) {
+      this.items.pop();
+    }
+  }
+  /**
+   * Remove and return element from the right end
+   */
+  pop() {
+    return this.items.pop();
+  }
+  /**
+   * Remove and return element from the left end
+   */
+  popleft() {
+    return this.items.shift();
+  }
+  /**
+   * Extend the right side with elements from iterable
+   */
+  extend(iterable) {
+    for (const x of iterable) {
+      this.append(x);
+    }
+  }
+  /**
+   * Extend the left side with elements from iterable
+   */
+  extendleft(iterable) {
+    for (const x of iterable) {
+      this.appendleft(x);
+    }
+  }
+  /**
+   * Rotate the deque n steps to the right (negative n rotates left)
+   */
+  rotate(n = 1) {
+    const len = this.items.length;
+    if (len === 0) return;
+    n = n % len;
+    if (n > 0) {
+      const tail = this.items.splice(-n, n);
+      this.items.unshift(...tail);
+    } else if (n < 0) {
+      const head = this.items.splice(0, -n);
+      this.items.push(...head);
+    }
+  }
+  /**
+   * Remove all elements
+   */
+  clear() {
+    this.items = [];
+  }
+  /**
+   * Number of elements
+   */
+  get length() {
+    return this.items.length;
+  }
+  /**
+   * Make iterable
+   */
+  *[Symbol.iterator]() {
+    yield* this.items;
+  }
+  /**
+   * Convert to array
+   */
+  toArray() {
+    return [...this.items];
+  }
+};
+
+export {
+  Counter,
+  defaultdict,
+  deque,
+  collections_exports
+};
+//# sourceMappingURL=chunk-UFMTN4T4.js.map

package/dist/chunk-UFMTN4T4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/collections.ts"],"sourcesContent":["/**\n * Python collections module for TypeScript\n *\n * Provides specialized container datatypes.\n */\n\n/**\n * Counter: a dict subclass for counting hashable objects\n *\n * Elements are stored as keys and their counts are stored as values.\n */\nexport class Counter<T> extends Map<T, number> {\n  constructor(iterable?: Iterable<T>) {\n    super()\n    if (iterable) {\n      for (const item of iterable) {\n        this.increment(item)\n      }\n    }\n  }\n\n  /**\n   * Increment the count for a key\n   */\n  increment(key: T, n: number = 1): void {\n    this.set(key, (super.get(key) ?? 0) + n)\n  }\n\n  /**\n   * Get the count for a key (returns 0 for missing keys)\n   */\n  get(key: T): number {\n    return super.get(key) ?? 0\n  }\n\n  /**\n   * List the n most common elements and their counts\n   * If n is undefined, list all elements from most common to least\n   */\n  mostCommon(n?: number): [T, number][] {\n    const sorted = [...this.entries()].sort((a, b) => b[1] - a[1])\n    return n !== undefined ? sorted.slice(0, n) : sorted\n  }\n\n  /**\n   * Iterate over elements, repeating each as many times as its count\n   */\n  *elements(): Generator<T> {\n    for (const [key, count] of this) {\n      for (let i = 0; i < count; i++) {\n        yield key\n      }\n    }\n  }\n\n  /**\n   * Subtract counts from another iterable or Counter\n   */\n  subtract(iterable: Iterable<T> | Counter<T>): void {\n    if (iterable instanceof Counter) {\n      for (const [key, count] of iterable) {\n        this.set(key, (super.get(key) ?? 0) - count)\n      }\n    } else {\n      for (const item of iterable) {\n        this.set(item, (super.get(item) ?? 0) - 1)\n      }\n    }\n  }\n\n  /**\n   * Add counts from another iterable or Counter\n   */\n  update(iterable: Iterable<T> | Counter<T>): void {\n    if (iterable instanceof Counter) {\n      for (const [key, count] of iterable) {\n        this.increment(key, count)\n      }\n    } else {\n      for (const item of iterable) {\n        this.increment(item)\n      }\n    }\n  }\n\n  /**\n   * Return total count of all elements\n   */\n  total(): number {\n    let sum = 0\n    for (const count of this.values()) {\n      sum += count\n    }\n    return sum\n  }\n}\n\n/**\n * defaultdict: a dict that provides default values for missing keys\n *\n * Uses a Proxy to automatically call the factory function for missing keys.\n */\nexport function defaultdict<K, V>(factory: () => V): Map<K, V> & { get(key: K): V } {\n  const map = new Map<K, V>()\n  return new Proxy(map, {\n    get(target, prop, receiver): unknown {\n      if (prop === \"get\") {\n        return (key: K): V => {\n          if (!target.has(key)) {\n            const defaultValue = factory()\n            target.set(key, defaultValue)\n            return defaultValue\n          }\n          return target.get(key) as V\n        }\n      }\n      const val: unknown = Reflect.get(target, prop, receiver)\n      if (typeof val === \"function\") {\n        return (val as (...args: unknown[]) => unknown).bind(target)\n      }\n      return val\n    }\n  }) as Map<K, V> & { get(key: K): V }\n}\n\n/**\n * deque: double-ended queue with O(1) append and pop from both ends\n */\nexport class deque<T> {\n  private items: T[]\n  private maxlen: number | null\n\n  constructor(iterable?: Iterable<T>, maxlen?: number) {\n    this.items = iterable ? [...iterable] : []\n    this.maxlen = maxlen ?? null\n    if (this.maxlen !== null && this.items.length > this.maxlen) {\n      this.items = this.items.slice(-this.maxlen)\n    }\n  }\n\n  /**\n   * Add element to the right end\n   */\n  append(x: T): void {\n    this.items.push(x)\n    if (this.maxlen !== null && this.items.length > this.maxlen) {\n      this.items.shift()\n    }\n  }\n\n  /**\n   * Add element to the left end\n   */\n  appendleft(x: T): void {\n    this.items.unshift(x)\n    if (this.maxlen !== null && this.items.length > this.maxlen) {\n      this.items.pop()\n    }\n  }\n\n  /**\n   * Remove and return element from the right end\n   */\n  pop(): T | undefined {\n    return this.items.pop()\n  }\n\n  /**\n   * Remove and return element from the left end\n   */\n  popleft(): T | undefined {\n    return this.items.shift()\n  }\n\n  /**\n   * Extend the right side with elements from iterable\n   */\n  extend(iterable: Iterable<T>): void {\n    for (const x of iterable) {\n      this.append(x)\n    }\n  }\n\n  /**\n   * Extend the left side with elements from iterable\n   */\n  extendleft(iterable: Iterable<T>): void {\n    for (const x of iterable) {\n      this.appendleft(x)\n    }\n  }\n\n  /**\n   * Rotate the deque n steps to the right (negative n rotates left)\n   */\n  rotate(n: number = 1): void {\n    const len = this.items.length\n    if (len === 0) return\n    n = n % len\n    if (n > 0) {\n      // Move last n elements to the front\n      const tail = this.items.splice(-n, n)\n      this.items.unshift(...tail)\n    } else if (n < 0) {\n      // Move first -n elements to the end\n      const head = this.items.splice(0, -n)\n      this.items.push(...head)\n    }\n  }\n\n  /**\n   * Remove all elements\n   */\n  clear(): void {\n    this.items = []\n  }\n\n  /**\n   * Number of elements\n   */\n  get length(): number {\n    return this.items.length\n  }\n\n  /**\n   * Make iterable\n   */\n  *[Symbol.iterator](): Generator<T> {\n    yield* this.items\n  }\n\n  /**\n   * Convert to array\n   */\n  toArray(): T[] {\n    return [...this.items]\n  }\n}\n"],"mappings":";;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWO,IAAM,UAAN,MAAM,iBAAmB,IAAe;AAAA,EAC7C,YAAY,UAAwB;AAClC,UAAM;AACN,QAAI,UAAU;AACZ,iBAAW,QAAQ,UAAU;AAC3B,aAAK,UAAU,IAAI;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAQ,IAAY,GAAS;AACrC,SAAK,IAAI,MAAM,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,KAAgB;AAClB,WAAO,MAAM,IAAI,GAAG,KAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,GAA2B;AACpC,UAAM,SAAS,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7D,WAAO,MAAM,SAAY,OAAO,MAAM,GAAG,CAAC,IAAI;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,CAAC,WAAyB;AACxB,eAAW,CAAC,KAAK,KAAK,KAAK,MAAM;AAC/B,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,UAA0C;AACjD,QAAI,oBAAoB,UAAS;AAC/B,iBAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACnC,aAAK,IAAI,MAAM,MAAM,IAAI,GAAG,KAAK,KAAK,KAAK;AAAA,MAC7C;AAAA,IACF,OAAO;AACL,iBAAW,QAAQ,UAAU;AAC3B,aAAK,IAAI,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAA0C;AAC/C,QAAI,oBAAoB,UAAS;AAC/B,iBAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACnC,aAAK,UAAU,KAAK,KAAK;AAAA,MAC3B;AAAA,IACF,OAAO;AACL,iBAAW,QAAQ,UAAU;AAC3B,aAAK,UAAU,IAAI;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAgB;AACd,QAAI,MAAM;AACV,eAAW,SAAS,KAAK,OAAO,GAAG;AACjC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAOO,SAAS,YAAkB,SAAkD;AAClF,QAAM,MAAM,oBAAI,IAAU;AAC1B,SAAO,IAAI,MAAM,KAAK;AAAA,IACpB,IAAI,QAAQ,MAAM,UAAmB;AACnC,UAAI,SAAS,OAAO;AAClB,eAAO,CAAC,QAAc;AACpB,cAAI,CAAC,OAAO,IAAI,GAAG,GAAG;AACpB,kBAAM,eAAe,QAAQ;AAC7B,mBAAO,IAAI,KAAK,YAAY;AAC5B,mBAAO;AAAA,UACT;AACA,iBAAO,OAAO,IAAI,GAAG;AAAA,QACvB;AAAA,MACF;AACA,YAAM,MAAe,QAAQ,IAAI,QAAQ,MAAM,QAAQ;AACvD,UAAI,OAAO,QAAQ,YAAY;AAC7B,eAAQ,IAAwC,KAAK,MAAM;AAAA,MAC7D;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;AAKO,IAAM,QAAN,MAAe;AAAA,EACZ;AAAA,EACA;AAAA,EAER,YAAY,UAAwB,QAAiB;AACnD,SAAK,QAAQ,WAAW,CAAC,GAAG,QAAQ,IAAI,CAAC;AACzC,SAAK,SAAS,UAAU;AACxB,QAAI,KAAK,WAAW,QAAQ,KAAK,MAAM,SAAS,KAAK,QAAQ;AAC3D,WAAK,QAAQ,KAAK,MAAM,MAAM,CAAC,KAAK,MAAM;AAAA,IAC5C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,GAAY;AACjB,SAAK,MAAM,KAAK,CAAC;AACjB,QAAI,KAAK,WAAW,QAAQ,KAAK,MAAM,SAAS,KAAK,QAAQ;AAC3D,WAAK,MAAM,MAAM;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,GAAY;AACrB,SAAK,MAAM,QAAQ,CAAC;AACpB,QAAI,KAAK,WAAW,QAAQ,KAAK,MAAM,SAAS,KAAK,QAAQ;AAC3D,WAAK,MAAM,IAAI;AAAA,IACjB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAqB;AACnB,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,UAAyB;AACvB,WAAO,KAAK,MAAM,MAAM;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAA6B;AAClC,eAAW,KAAK,UAAU;AACxB,WAAK,OAAO,CAAC;AAAA,IACf;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,UAA6B;AACtC,eAAW,KAAK,UAAU;AACxB,WAAK,WAAW,CAAC;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,IAAY,GAAS;AAC1B,UAAM,MAAM,KAAK,MAAM;AACvB,QAAI,QAAQ,EAAG;AACf,QAAI,IAAI;AACR,QAAI,IAAI,GAAG;AAET,YAAM,OAAO,KAAK,MAAM,OAAO,CAAC,GAAG,CAAC;AACpC,WAAK,MAAM,QAAQ,GAAG,IAAI;AAAA,IAC5B,WAAW,IAAI,GAAG;AAEhB,YAAM,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC;AACpC,WAAK,MAAM,KAAK,GAAG,IAAI;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,QAAQ,CAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,SAAiB;AACnB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,EAAE,OAAO,QAAQ,IAAkB;AACjC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,UAAe;AACb,WAAO,CAAC,GAAG,KAAK,KAAK;AAAA,EACvB;AACF;","names":[]}