@wener/utils 1.1.50 → 1.1.53

package/src/cn/parseChineseNumber.ts

@@ -1,97 +0,0 @@
-const ToNumber: Record<string, number> = {
-  〇: 0,
-  一: 1,
-  二: 2,
-  三: 3,
-  四: 4,
-  五: 5,
-  六: 6,
-  七: 7,
-  八: 8,
-  九: 9,
-  十: 10,
-  百: 100,
-  千: 1000,
-  万: 10_000,
-  零: 0,
-  壹: 1,
-  贰: 2,
-  叁: 3,
-  肆: 4,
-  伍: 5,
-  陆: 6,
-  柒: 7,
-  捌: 8,
-  玖: 9,
-  拾: 10,
-  佰: 100,
-  仟: 1000,
-  0: 0,
-  1: 1,
-  2: 2,
-  3: 3,
-  4: 4,
-  5: 5,
-  6: 6,
-  7: 7,
-  8: 8,
-  9: 9,
-};
-
-// 一万一 -> 10001
-// 一万一百一 -> 10101
-// 一万 -> 10000
-// 10000 -> 10000
-export function parseChineseNumber(s: string | number) {
-  if (typeof s === 'number') {
-    return s;
-  }
-
-  let n = 0;
-  let c = 0;
-  let base = 0;
-  let shouldAddLast = false;
-  for (const char of s.split('').reverse()) {
-    c = ToNumber[char];
-    if (c === undefined) {
-      throw new Error(`无法解析的数字: ${char}`);
-    }
-
-    switch (c) {
-      case 10: {
-        base = 1;
-        break;
-      }
-
-      case 100: {
-        base = 2;
-        break;
-      }
-
-      case 1000: {
-        base = 3;
-        break;
-      }
-
-      case 10_000: {
-        base = 4;
-        break;
-      }
-    }
-
-    //
-    if (c < 10) {
-      n += c * 10 ** base;
-      base++;
-      shouldAddLast = false;
-    } else {
-      shouldAddLast = true;
-    }
-  }
-
-  if (shouldAddLast) {
-    n += c;
-  }
-
-  return n;
-}

package/src/cn/pinyin/cartesianProduct.test.ts

@@ -1,64 +0,0 @@
-import { describe, expect, test } from 'vitest';
-import { cartesianProduct } from './cartesianProduct';
-
-describe('cartesianProduct', () => {
-  test('combines two arrays with multiple elements', () => {
-    expect(
-      cartesianProduct([
-        [1, 2],
-        [3, 4],
-      ]),
-    ).toEqual([
-      [1, 3],
-      [1, 4],
-      [2, 3],
-      [2, 4],
-    ]);
-  });
-
-  test('combines multiple arrays', () => {
-    expect(cartesianProduct([[1, 2], [3], [4, 5]])).toEqual([
-      [1, 3, 4],
-      [1, 3, 5],
-      [2, 3, 4],
-      [2, 3, 5],
-    ]);
-  });
-
-  test('handles an empty array input correctly', () => {
-    expect(cartesianProduct([])).toEqual([]);
-  });
-
-  test('handles one array being empty', () => {
-    expect(cartesianProduct([[1, 2], [], [3]])).toEqual([]);
-  });
-
-  test('works with arrays of different types', () => {
-    expect(
-      cartesianProduct<string | number>([
-        ['a', 'b'],
-        [1, 2],
-      ]),
-    ).toEqual([
-      ['a', 1],
-      ['a', 2],
-      ['b', 1],
-      ['b', 2],
-    ]);
-  });
-
-  test('handles single-element arrays', () => {
-    expect(cartesianProduct([[1], [2], [3]])).toEqual([[1, 2, 3]]);
-  });
-
-  test('works with more complex objects', () => {
-    expect(cartesianProduct<any>([[{ id: 1 }, { id: 2 }], ['a']])).toEqual([
-      [{ id: 1 }, 'a'],
-      [{ id: 2 }, 'a'],
-    ]);
-  });
-
-  test('handles an array containing a single array', () => {
-    expect(cartesianProduct([[1, 2, 3]])).toEqual([[1], [2], [3]]);
-  });
-});

package/src/cn/pinyin/cartesianProduct.ts

@@ -1,24 +0,0 @@
-export function cartesianProduct<T>(args: T[][]): T[][] {
-  if (args.length === 0) return [];
-
-  const product: T[][] = [];
-  const counts = args.map((arr) => arr.length);
-  const counter = new Array(args.length).fill(0);
-  const total = counts.reduce((acc, val) => acc * val, 1);
-
-  for (let i = 0; i < total; i++) {
-    product.push(counter.map((count, index) => args[index][count]));
-
-    // Update the counter for the next row in the Cartesian product.
-    for (let j = args.length - 1; j >= 0; j--) {
-      if (counter[j] + 1 < counts[j]) {
-        counter[j]++;
-        break; // Stop as we've found a digit that can be incremented.
-      } else {
-        counter[j] = 0; // Reset this digit and increment the next digit in the next iteration.
-      }
-    }
-  }
-
-  return product;
-}