@wener/utils 1.1.51 → 1.1.53

package/src/cn/division/DivisionCode.ts

@@ -1,173 +0,0 @@
-const DivisionCodeLevels = [
-  {
-    level: 1,
-    code: 'Province',
-    length: 2,
-    label: '省',
-  },
-  {
-    level: 2,
-    code: 'City',
-    length: 4,
-    label: '市',
-  },
-  {
-    level: 3,
-    code: 'County',
-    length: 6,
-    label: '区县',
-  },
-  {
-    level: 4,
-    code: 'Town',
-    length: 9,
-    label: '乡镇',
-  },
-  {
-    level: 5,
-    code: 'Village',
-    length: 12,
-    label: '村',
-  },
-] as const;
-
-// String(Number.MAX_SAFE_INTEGER).length=16
-// 12 is safe int
-
-/**
- * Codes for the administrative divisions of the People's Republic of China
- *
- * @see https://zh.wikipedia.org/wiki/GB/T_2260 中华人民共和国行政区划代码
- */
-export namespace DivisionCode {
-  export const levels = DivisionCodeLevels;
-
-  export const regex = /^(?<province>\d{2})(?<city>\d{2})?(?<county>\d{2})?(?<town>\d{3})?(?<village>\d{3})?$/;
-
-  const provinces: Array<[number, string]> = [
-    [11, '北京市'],
-    [12, '天津市'],
-    [13, '河北省'],
-    [14, '山西省'],
-    [15, '内蒙古自治区'],
-    [21, '辽宁省'],
-    [22, '吉林省'],
-    [23, '黑龙江省'],
-    [31, '上海市'],
-    [32, '江苏省'],
-    [33, '浙江省'],
-    [34, '安徽省'],
-    [35, '福建省'],
-    [36, '江西省'],
-    [37, '山东省'],
-    [41, '河南省'],
-    [42, '湖北省'],
-    [43, '湖南省'],
-    [44, '广东省'],
-    [45, '广西壮族自治区'],
-    [46, '海南省'],
-    [50, '重庆市'],
-    [51, '四川省'],
-    [52, '贵州省'],
-    [53, '云南省'],
-    [54, '西藏自治区'],
-    [61, '陕西省'],
-    [62, '甘肃省'],
-    [63, '青海省'],
-    [64, '宁夏回族自治区'],
-    [65, '新疆维吾尔自治区'],
-    [71, '台湾省'],
-    [81, '香港特别行政区'],
-    [82, '澳门特别行政区'],
-    // 9 国外
-  ];
-
-  export type ParsedCode = {
-    province: string;
-    city?: string;
-    county?: string;
-    town?: string;
-    village?: string;
-  };
-
-  export function parse(code: string): ParsedCode | undefined {
-    if (!code) return;
-    const match = regex.exec(code);
-    if (!match) return;
-    const { province, city, county, town, village } = match.groups ?? {};
-    if (!province) return;
-
-    return {
-      province,
-      city,
-      county,
-      town,
-      village,
-    };
-  }
-
-  export function random(level: DivisionCodeLevel = 'County'): string {
-    const l = DivisionCodeLevels.find((v) => v.code === level) || DivisionCodeLevels[2];
-    const l1 = randomPick(provinces);
-    if (l.level === 1) {
-      return String(l1[0]);
-    }
-    return l1 + String(Math.floor(Math.random() * parseFloat(`1e${l.length - 2}`) - 1));
-  }
-}
-
-interface DivisionTreeNode {
-  sub: string; // sub code
-  children?: Record<string, DivisionTreeNode>;
-
-  code: string; // full code
-  name?: string; // name of division
-}
-
-export type DivisionCodeLevel = 'Village' | 'Town' | 'County' | 'City' | 'Province';
-
-export interface ParsedDivisionCode {
-  level: DivisionCodeLevel;
-  code: string;
-  name?: string;
-  fullName?: string;
-  names: string[];
-  // 村级（村委会、居委会）
-  // 12 位
-  village?: CodeName;
-  // 乡级（乡镇、街道）
-  // 9 位
-  town?: CodeName;
-  // 县级（区县）
-  // 6 位 - 常用 - 2985 个
-  county?: CodeName;
-  // 地级（城市）
-  // 4 位 - 343 个
-  city?: CodeName;
-  // 省级（省份、直辖市、自治区）
-  // 2 位 - 32 个
-  province: CodeName;
-
-  children?: Array<{ code: string; name?: string }>;
-}
-
-export interface CodeName {
-  code: string;
-  name: string;
-}
-
-// export function getSimpleProvinceLabel(value: string) {
-//   if (!value) {
-//     return;
-//   }
-//   let label = value;
-//   if (/[0-9]/.test(label)) {
-//     label = label.slice(0, 2);
-//     label = options.find((v) => v.value === label)?.label || label;
-//   }
-//   return label.replace(/省|市|(回族|维吾尔|壮族)?自治区|特别行政区$/, '');
-// }
-
-export function randomPick<T>(s: T[]) {
-  return s[Math.floor(Math.random() * s.length)];
-}

package/src/cn/division/binarySearch.test.ts

@@ -1,64 +0,0 @@
-import { describe, expect, test } from 'vitest';
-import { binarySearch } from './binarySearch';
-
-describe('binarySearch', () => {
-  test('finds an existing element in the middle of the array', () => {
-    const arr = [1, 3, 5, 7, 9];
-    const result = binarySearch(arr, 5, (a, b) => a - b);
-    expect(result).toEqual({ match: true, index: 2, value: 5 });
-  });
-
-  test('finds an existing element at the start of the array', () => {
-    const arr = [1, 3, 5, 7, 9];
-    const result = binarySearch(arr, 1, (a, b) => a - b);
-    expect(result).toEqual({ match: true, index: 0, value: 1 });
-  });
-
-  test('finds an existing element at the end of the array', () => {
-    const arr = [1, 3, 5, 7, 9];
-    const result = binarySearch(arr, 9, (a, b) => a - b);
-    expect(result).toEqual({ match: true, index: 4, value: 9 });
-  });
-
-  test('searches for a value not in the array, insert in the middle', () => {
-    const arr = [1, 3, 7, 9];
-    const result = binarySearch(arr, 5, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 2, value: null });
-  });
-
-  test('searches for a value not in the array, insert at the start', () => {
-    const arr = [3, 5, 7, 9];
-    const result = binarySearch(arr, 1, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 0, value: null });
-  });
-
-  test('searches for a value not in the array, insert at the end', () => {
-    const arr = [1, 3, 5, 7];
-    const result = binarySearch(arr, 9, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 4, value: null });
-  });
-
-  test('searches in an empty array', () => {
-    const arr: number[] = [];
-    const result = binarySearch(arr, 1, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 0, value: null });
-  });
-
-  test('searches in a single-element array, element matches', () => {
-    const arr = [5];
-    const result = binarySearch(arr, 5, (a, b) => a - b);
-    expect(result).toEqual({ match: true, index: 0, value: 5 });
-  });
-
-  test('searches in a single-element array, insert at the start', () => {
-    const arr = [3];
-    const result = binarySearch(arr, 1, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 0, value: null });
-  });
-
-  test('searches in a single-element array, insert at the end', () => {
-    const arr = [1];
-    const result = binarySearch(arr, 3, (a, b) => a - b);
-    expect(result).toEqual({ match: false, index: 1, value: null });
-  });
-});

package/src/cn/division/binarySearch.ts

@@ -1,25 +0,0 @@
-export function binarySearch<T, S = number>(
-  arr: T[],
-  value: S,
-  compare: (a: T, b: S) => number,
-): {
-  match: boolean;
-  index: number;
-  value: T | null;
-} {
-  let low = 0;
-  let high = arr.length - 1;
-  while (low <= high) {
-    const mid = (low + high) >> 1;
-    const cmp = compare(arr[mid], value);
-    if (cmp < 0) {
-      low = mid + 1;
-    } else if (cmp > 0) {
-      high = mid - 1;
-    } else {
-      return { match: true, index: mid, value: arr[mid] };
-    }
-  }
-  // When no match is found, `low` will be the correct insertIndex.
-  return { match: false, index: low, value: null };
-}

package/src/cn/division/division.test.ts

@@ -1,22 +0,0 @@
-import { expect, test } from 'vitest';
-import { DivisionCode } from './DivisionCode';
-
-test('division', () => {
-  for (const [a, b] of [
-    [
-      '441900003001',
-      {
-        province: '44',
-        city: '19',
-        county: '00',
-        town: '003',
-        village: '001',
-      },
-    ],
-    ['31', { province: '31' }],
-    ['4', undefined],
-    ['', undefined],
-  ] as Array<[string, any]>) {
-    expect(DivisionCode.parse(a)).toMatchObject(b);
-  }
-});

package/src/cn/formatChineseAmount.ts

@@ -1,61 +0,0 @@
-/**
- * @see https://gist.github.com/tonyc726/00c829a54a40cf80409f
- * @see https://github.com/Siykt/javascript-algorithms/blob/master/src/algorithms/string/getChinesePrice.ts 人民币金额转中文大写
- */
-export function formatChineseAmount(price: number) {
-  if (price === 0) return '零元整';
-  if (price >= 1e12) return '整数位已超过最大值';
-
-  const CHINESE_NUMBER_MAP = ['零', '壹', '贰', '叁', '肆', '伍', '陆', '柒', '捌', '玖'];
-  const CHINESE_UNIT_MAP = ['', '拾', '佰', '仟'];
-  const CHINESE_BIG_UNIT_MAP = ['', '万', '亿'];
-  const CHINESE_SMALL_UNIT_MAP = ['角', '分', '厘', '毫'];
-
-  const priceStr = price.toString();
-  const priceArr = priceStr.split('.');
-  const integer = priceArr[0];
-  const decimal = priceArr[1];
-
-  let chineseIntegerPrice = '';
-  let zeroCount = 0;
-
-  for (let i = 0; i < integer.length; i++) {
-    const num = +integer[i];
-    const unit = integer.length - i - 1; // 当前数字的单位
-    const quotient = Math.floor(unit / 4); // 1w为进位单位, 除 4 即为 万 亿
-    const remainder = unit % 4; // 1w为进位单位, 取模 4 即为 个 十 百 千
-
-    if (num === 0) {
-      zeroCount++;
-    } else {
-      // 处理前置的零
-      if (zeroCount > 0) chineseIntegerPrice += CHINESE_NUMBER_MAP[0];
-      zeroCount = 0;
-      chineseIntegerPrice += CHINESE_NUMBER_MAP[num] + CHINESE_UNIT_MAP[remainder];
-    }
-    if (remainder === 0 && zeroCount < 4) {
-      chineseIntegerPrice += CHINESE_BIG_UNIT_MAP[quotient];
-    }
-  }
-
-  // 价格为小数时，整数部分不显示
-  if (price < 1) chineseIntegerPrice = '';
-  else chineseIntegerPrice += '元';
-
-  let chineseDecimalPrice = '';
-
-  if (!decimal) {
-    chineseDecimalPrice = '整';
-  } else {
-    let hasZero = false;
-    for (let i = 0; i < decimal.length; i++) {
-      const num = +decimal[i];
-      if (num) chineseDecimalPrice += CHINESE_NUMBER_MAP[num] + CHINESE_SMALL_UNIT_MAP[i];
-      else hasZero = true;
-    }
-
-    if (chineseIntegerPrice && hasZero) chineseIntegerPrice += '零';
-  }
-
-  return chineseIntegerPrice + chineseDecimalPrice;
-}

package/src/cn/id/Mod11.ts

@@ -1,26 +0,0 @@
-/**
- * ISO 7064:1983, MOD 11-2.
- */
-export class Mod11Checksum {
-  weights = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1];
-
-  validate(s: string) {
-    return s.at(-1) === this.generate(s.slice(0, s.length - 1));
-  }
-
-  generate(s: string) {
-    const { weights } = this;
-    let sum = 0;
-    for (let i = 0; i < s.length; i++) {
-      sum += parseInt(s[i]) * weights[i];
-    }
-    const num = (12 - (sum % 11)) % 11;
-    if (num < 10) {
-      return num.toString();
-    } else {
-      return 'X';
-    }
-  }
-}
-
-export const Mod11 = new Mod11Checksum();

package/src/cn/id/ResidentIdNumber.ts

@@ -1,126 +0,0 @@
-import { Mod11 } from './Mod11';
-
-class ResidentIdNumberFormat {
-  checksum = Mod11;
-
-  // 9 https://zh.wikipedia.org/wiki/中华人民共和国外国人永久居留身份证
-  // 9 标识码
-  // 申领地代码 - 2 位行政区划
-  // 国籍国代码 - 3 位数字 https://zh.wikipedia.org/wiki/ISO_3166-1数字代码
-
-  regex =
-    /^(?<division>[1-9]\d{5})(?<year>18|19|20)\d{2}(?<month>0[1-9]|1[0-2])(?<day>0[1-9]|[12]\d|3[01])(?<sequence>\d{3})(?<checksum>[0-9Xx])$/;
-
-  validate(s: string) {
-    if (!s) return false;
-    return this.regex.test(s) && this.checksum.validate(s.toUpperCase());
-  }
-
-  generate(opts: { sex?: 'Male' | 'Female'; age?: number; birthDate?: Date; division?: string }) {}
-
-  parse(s: string): IdNumber | undefined {
-    if (!this.validate(s)) {
-      return;
-    }
-
-    let date = s.slice(6, 14);
-    let y = parseInt(date.slice(0, 4));
-    let m = parseInt(date.slice(4, 6));
-    let d = parseInt(date.slice(6));
-    return new IdNumber(
-      s.slice(0, 6),
-      // new Date(`${y}-${m}-${d}`), // YYYYMMDD
-      new Date(Date.UTC(y, m - 1, d)), // 避免时区问题
-      parseInt(s.slice(14, 17)),
-      s.slice(17, 18).toUpperCase(),
-    );
-  }
-}
-
-interface ParseResidentIdNumberResult {
-  division: string;
-  birthDate: Date;
-  sequence: number;
-  checksum: string;
-
-  valid: boolean;
-  male: boolean;
-  female: boolean;
-  sex: 'Male' | 'Female';
-  age: number;
-}
-
-class IdNumber {
-  constructor(
-    public division: string,
-    public birthDate: Date,
-    public sequence: number,
-    public checksum: string,
-  ) {}
-
-  toString() {
-    return this.base + this.checksum;
-  }
-
-  toJSON() {
-    return this.toString();
-  }
-
-  toObject(): ParseResidentIdNumberResult {
-    const { division, birthDate, sequence, checksum, age, valid, male, female, sex } = this;
-    return {
-      division,
-      birthDate,
-      sequence,
-      checksum,
-      age,
-      valid,
-      male,
-      female,
-      sex,
-    };
-  }
-
-  get valid() {
-    return ResidentIdNumber.validate(this.toString());
-  }
-
-  get male() {
-    return this.sequence % 2 === 1;
-  }
-
-  get female() {
-    return this.sequence % 2 === 0;
-  }
-
-  get age() {
-    return new Date().getFullYear() - this.birthDate.getFullYear();
-  }
-
-  get sex(): 'Male' | 'Female' {
-    return this.sequence % 2 === 1 ? 'Male' : 'Female';
-  }
-
-  /**
-   * base for checksum
-   * @private
-   */
-  private get base() {
-    return [this.division, formatDate(this.birthDate, 'YYYYMMDD'), this.sequence.toString().padStart(3, '0')].join('');
-  }
-}
-
-function formatDate(date: Date, format = 'YYYYMMDD') {
-  switch (format) {
-    case 'YYYYMMDD': {
-      const year = date.getFullYear();
-      const month = (date.getMonth() + 1).toString().padStart(2, '0');
-      const day = date.getDate().toString().padStart(2, '0');
-      return `${year}${month}${day}`;
-    }
-    default:
-      throw new Error(`Invalid format`);
-  }
-}
-
-export const ResidentIdNumber = new ResidentIdNumberFormat();

package/src/cn/id/id.test.ts

@@ -1,20 +0,0 @@
-import { assert, expect, test } from 'vitest';
-import { Mod11 } from './Mod11';
-import { ResidentIdNumber } from './ResidentIdNumber';
-
-test('id', (t) => {
-  const ids = ['11010519491231002X', '11010219840406970X'];
-
-  let cs = Mod11;
-  for (const id of ids) {
-    assert.equal(cs.generate(id.slice(0, -1)), id.at(-1));
-  }
-
-  let parse = ResidentIdNumber.parse(ids[0]);
-  expect(parse?.toObject()).toMatchObject({
-    division: '110105',
-    birthDate: new Date('1949-12-31'),
-    sequence: 2,
-    checksum: 'X',
-  });
-});

package/src/cn/id/types.ts

@@ -1,26 +0,0 @@
-/**
- * 居民身份证
- *
- * @see https://en.wikipedia.org/wiki/Resident_Identity_Card
- * @see https://en.wikipedia.org/wiki/Foreign_Permanent_Resident_ID_Card
- */
-export interface ResidentIdentityCard {
-  // 姓名
-  name: string;
-  // 性别
-  gender: string;
-  // 民族
-  ethnicity: string;
-  // 出生日期
-  birthDate: Date;
-  // 地址
-  domicile: string;
-  // 身份证号
-  idNumber: string;
-  // 签发机关
-  issuingAuthority: string;
-  // 有效期开始日期
-  validStartDate: Date;
-  // 有效期结束日期
-  validEndDate?: Date;
-}

package/src/cn/index.ts

@@ -1,17 +0,0 @@
-/**
- * China related utilities.
- *
- * @packageDocumentation
- */
-
-export { parseChineseNumber } from './parseChineseNumber';
-export { formatChineseAmount } from './formatChineseAmount';
-export { isUSCC } from './uscc/isUSCC';
-export { USCC } from './uscc/USCC';
-
-export { ResidentIdNumber } from './id/ResidentIdNumber';
-
-export { DivisionCode } from './division/DivisionCode';
-
-export { toPinyinPure, toPinyinPureFirst, getCharToPinyinTable } from './pinyin/toPinyinPure';
-export { loadCharToPinyinTable } from './pinyin/loader';