@extable/sequence 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/README.md

@@ -0,0 +1,105 @@
+# @extable/sequence
+
+[![npm](https://img.shields.io/npm/v/@extable/sequence?color=2b6cb0&label=npm)](https://www.npmjs.com/package/@extable/sequence)
+[![TypeScript](https://img.shields.io/badge/TypeScript-5.6-3178c6?logo=typescript&logoColor=white)](https://www.typescriptlang.org/)
+[![License](https://img.shields.io/npm/l/@extable/sequence)](../LICENSE)
+[![CI](https://github.com/shibukawa/extable/actions/workflows/test.yml/badge.svg)](https://github.com/shibukawa/extable/actions/workflows/test.yml)
+[![Bundle Size](https://img.shields.io/bundlephobia/minzip/@extable/sequence?label=bundle%20size)](https://bundlephobia.com/package/@extable/sequence)
+
+Sequence inference engine for Extable auto-fill.
+
+This package provides a small, composable sequence engine that can detect list patterns,
+arithmetic/geometric progressions, and structured string patterns (embedded numbers, roman numerals,
+English ordinals) and then generate subsequent values.
+
+## Install
+
+```bash
+npm install @extable/sequence
+```
+
+## Usage
+
+```ts
+import { inferSequence, createBuiltInRegistry } from "@extable/sequence";
+
+const registry = createBuiltInRegistry(["ja", "en"]);
+const seq = inferSequence(["Jan", "Feb"], { registry });
+
+// The iterator yields values *after* the seed.
+seq.next().value; // "March"
+```
+
+## API
+
+### inferSequence
+
+```ts
+inferSequence(seed: readonly number[], options?: { registry?: SequenceRegistry }): Sequence<number>
+inferSequence(seed: readonly Date[], options?: { registry?: SequenceRegistry }): Sequence<Date>
+inferSequence(seed: readonly string[], options?: { registry?: SequenceRegistry }): Sequence<string>
+```
+
+Inference priority:
+1. Single-item seed -> copy
+2. Built-in/custom list match
+3. Arithmetic progression
+4. Geometric progression (numbers only)
+5. Seed repeat
+
+### SequenceRegistry
+
+```ts
+const registry = new SequenceRegistry({ langs: ["ja", "en"] });
+registry.register(list);
+registry.registerMatch(matcher);
+```
+
+- `langs` controls language preference (no `navigator` dependency).
+- `en` is appended if missing.
+
+## Built-in Lists
+
+Cycle lists (wrap-around):
+- Weekdays (en/ja)
+- Months (en/ja, traditional Japanese month names)
+- Quarters (en/ja)
+- Zodiac animals (十二支)
+- Zodiac signs (en/ja)
+- Directions (16-wind, en/ja)
+- AM/PM (en/ja)
+- Seasons (en/ja)
+- Solfege (en/ja)
+- Rokuyo (六曜)
+- Greek letters (en/ja/symbols)
+
+Finite lists (stop at end):
+- Ten Heavenly Stems (十干)
+- Planets (en/ja, 8 planets)
+- Kuji-in (九字)
+- Eight virtues (八徳)
+
+## Custom Matchers
+
+You can register custom matchers with a score to override built-ins:
+
+```ts
+registry.registerMatch({
+  id: "custom",
+  match(seed) {
+    if (seed[0] === "A" && seed[1] === "B") return { score: 100 };
+    return null;
+  },
+  createIterator() {
+    return {
+      next() {
+        return { value: "Z", done: false };
+      }
+    };
+  }
+});
+```
+
+## License
+
+Apache-2.0

package/dist/builtins.d.ts

@@ -0,0 +1,4 @@
+import { SequenceRegistry } from './registry';
+export declare const registerBuiltInLists: (registry: SequenceRegistry) => void;
+export declare const registerBuiltInMatchers: (registry: SequenceRegistry) => void;
+export declare const createBuiltInRegistry: (langs?: readonly string[]) => SequenceRegistry;

package/dist/index.d.ts

@@ -0,0 +1,5 @@
+export * from './builtins';
+export * from './infer';
+export * from './registry';
+export * from './sequence';
+export * from './types';

package/dist/index.js

@@ -0,0 +1,768 @@
+const m = (e) => e.trim().normalize("NFKC").toLowerCase().replace(/\s+/g, " "), j = (e) => {
+  const t = [];
+  if (e)
+    for (const n of e) {
+      const r = n.trim();
+      !r || t.includes(r) || t.push(r);
+    }
+  return t.length === 0 ? t.push("en") : t.includes("en") || t.push("en"), t;
+}, T = (e, t) => {
+  const n = e.items.indexOf(t);
+  if (n !== -1)
+    return n;
+  if (!e.aliases)
+    return null;
+  const r = e.aliases[t];
+  if (!r)
+    return null;
+  const s = e.items.indexOf(r);
+  return s === -1 ? null : s;
+}, M = (e, t) => {
+  const n = m(t);
+  if (m(e.id).includes(n))
+    return !0;
+  for (const r of e.items)
+    if (m(r).includes(n))
+      return !0;
+  return e.aliases ? Object.keys(e.aliases).some(
+    (r) => m(r).includes(n)
+  ) : !1;
+}, w = (e, t) => {
+  if (e.langs.length === 0)
+    return 0;
+  let n = Number.POSITIVE_INFINITY;
+  for (const r of e.langs) {
+    const s = t.indexOf(r);
+    s !== -1 && s < n && (n = s);
+  }
+  return n;
+}, E = (e, t) => !e.langs || e.langs.length === 0 ? !0 : e.langs.some((n) => t.includes(n));
+class J {
+  constructor(t) {
+    this.lists = [], this.matchers = [], this.langs = j(t?.langs);
+  }
+  register(t) {
+    const n = this.lists.findIndex((r) => r.id === t.id);
+    n === -1 ? this.lists.push(t) : this.lists[n] = t;
+  }
+  registerMatch(t) {
+    const n = this.matchers.findIndex((r) => r.id === t.id);
+    n === -1 ? this.matchers.push(t) : this.matchers[n] = t;
+  }
+  unregister(t) {
+    this.lists = this.lists.filter((n) => n.id !== t), this.matchers = this.matchers.filter((n) => n.id !== t);
+  }
+  list(t) {
+    let n = [...this.lists];
+    if (t?.enabledIds && t.enabledIds.length > 0) {
+      const s = new Set(t.enabledIds);
+      n = n.filter((i) => s.has(i.id));
+    }
+    const r = t?.queryText;
+    return r && (n = n.filter((s) => M(s, r))), n;
+  }
+  match(t, n) {
+    if (t.length === 0)
+      return null;
+    let r = null, s = Number.NEGATIVE_INFINITY;
+    const i = n?.enabledIds ? new Set(n.enabledIds) : null;
+    for (const o of this.matchers) {
+      if (i && !i.has(o.id) || !E(o, this.langs))
+        continue;
+      const l = o.match(t);
+      if (!l)
+        continue;
+      const u = l.score;
+      Number.isFinite(u) && u > s && (s = u, r = {
+        kind: "matcher",
+        matcher: o,
+        step: l.step ?? 1,
+        state: l.state
+      });
+    }
+    const a = this.list(n).map((o) => ({ list: o, rank: w(o, this.langs) })).filter((o) => Number.isFinite(o.rank)).sort((o, l) => o.rank - l.rank);
+    for (const { list: o, rank: l } of a) {
+      const u = [];
+      let f = !1;
+      for (const N of t) {
+        const p = T(o, N);
+        if (p === null) {
+          f = !0;
+          break;
+        }
+        u.push(p);
+      }
+      if (f)
+        continue;
+      const h = this.inferStep(o, u);
+      if (h === null)
+        continue;
+      const g = 10 - l;
+      g > s && (s = g, r = {
+        kind: "list",
+        list: o,
+        startIndex: u[u.length - 1] ?? 0,
+        step: h
+      });
+    }
+    return r;
+  }
+  inferStep(t, n) {
+    if (n.length < 2)
+      return 1;
+    const r = t.items.length, s = this.stepBetween(t.mode, r, n[0], n[1]);
+    if (s === null)
+      return null;
+    for (let i = 2; i < n.length; i += 1) {
+      const a = this.nextIndex(t.mode, r, n[i - 1], s);
+      if (a === null || a !== n[i])
+        return null;
+    }
+    return s;
+  }
+  stepBetween(t, n, r, s) {
+    if (t === "cycle")
+      return (s - r + n) % n;
+    const i = s - r;
+    return i < 0 ? null : i;
+  }
+  nextIndex(t, n, r, s) {
+    if (t === "cycle")
+      return (r + s) % n;
+    const i = r + s;
+    return i >= n ? null : i;
+  }
+}
+const A = {
+  id: "weekdays-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"],
+  aliases: {
+    Mon: "Monday",
+    Tue: "Tuesday",
+    Tues: "Tuesday",
+    Wed: "Wednesday",
+    Thu: "Thursday",
+    Thur: "Thursday",
+    Thurs: "Thursday",
+    Fri: "Friday",
+    Sat: "Saturday",
+    Sun: "Sunday"
+  }
+}, L = {
+  id: "weekdays-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["月曜日", "火曜日", "水曜日", "木曜日", "金曜日", "土曜日", "日曜日"],
+  aliases: {
+    月曜: "月曜日",
+    月: "月曜日",
+    火曜: "火曜日",
+    火: "火曜日",
+    水曜: "水曜日",
+    水: "水曜日",
+    木曜: "木曜日",
+    木: "木曜日",
+    金曜: "金曜日",
+    金: "金曜日",
+    土曜: "土曜日",
+    土: "土曜日",
+    日曜: "日曜日",
+    日: "日曜日"
+  }
+}, F = {
+  id: "months-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: [
+    "January",
+    "February",
+    "March",
+    "April",
+    "May",
+    "June",
+    "July",
+    "August",
+    "September",
+    "October",
+    "November",
+    "December"
+  ],
+  aliases: {
+    Jan: "January",
+    Feb: "February",
+    Mar: "March",
+    Apr: "April",
+    Jun: "June",
+    Jul: "July",
+    Aug: "August",
+    Sep: "September",
+    Sept: "September",
+    Oct: "October",
+    Nov: "November",
+    Dec: "December"
+  }
+}, v = {
+  id: "months-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["1月", "2月", "3月", "4月", "5月", "6月", "7月", "8月", "9月", "10月", "11月", "12月"]
+}, z = {
+  id: "months-ja-traditional",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["睦月", "如月", "弥生", "卯月", "皐月", "水無月", "文月", "葉月", "長月", "神無月", "霜月", "師走"]
+}, O = {
+  id: "quarters-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: ["Q1", "Q2", "Q3", "Q4"]
+}, P = {
+  id: "quarters-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["第1四半期", "第2四半期", "第3四半期", "第4四半期"]
+}, R = {
+  id: "zodiac-animals-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["子", "丑", "寅", "卯", "辰", "巳", "午", "未", "申", "酉", "戌", "亥"]
+}, C = {
+  id: "zodiac-signs-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: [
+    "Aries",
+    "Taurus",
+    "Gemini",
+    "Cancer",
+    "Leo",
+    "Virgo",
+    "Libra",
+    "Scorpio",
+    "Sagittarius",
+    "Capricorn",
+    "Aquarius",
+    "Pisces"
+  ]
+}, D = {
+  id: "zodiac-signs-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["牡羊座", "牡牛座", "双子座", "蟹座", "獅子座", "乙女座", "天秤座", "蠍座", "射手座", "山羊座", "水瓶座", "魚座"],
+  aliases: {
+    さそり座: "蠍座"
+  }
+}, $ = {
+  id: "directions-16-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: [
+    "North",
+    "North-Northeast",
+    "Northeast",
+    "East-Northeast",
+    "East",
+    "East-Southeast",
+    "Southeast",
+    "South-Southeast",
+    "South",
+    "South-Southwest",
+    "Southwest",
+    "West-Southwest",
+    "West",
+    "West-Northwest",
+    "Northwest",
+    "North-Northwest"
+  ]
+}, V = {
+  id: "directions-16-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: [
+    "北",
+    "北北東",
+    "北東",
+    "東北東",
+    "東",
+    "東南東",
+    "南東",
+    "南南東",
+    "南",
+    "南南西",
+    "南西",
+    "西南西",
+    "西",
+    "西北西",
+    "北西",
+    "北北西"
+  ]
+}, W = {
+  id: "ampm-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: ["AM", "PM"],
+  aliases: {
+    "A.M.": "AM",
+    "P.M.": "PM"
+  }
+}, B = {
+  id: "ampm-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["午前", "午後"]
+}, Q = {
+  id: "seasons-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: ["Spring", "Summer", "Autumn", "Winter"],
+  aliases: {
+    Fall: "Autumn"
+  }
+}, q = {
+  id: "seasons-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["春", "夏", "秋", "冬"]
+}, G = {
+  id: "solfege-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["ド", "レ", "ミ", "ファ", "ソ", "ラ", "シ"]
+}, X = {
+  id: "solfege-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: ["Do", "Re", "Mi", "Fa", "Sol", "La", "Ti"],
+  aliases: {
+    So: "Sol",
+    Si: "Ti"
+  }
+}, U = {
+  id: "greek-letters-en",
+  mode: "cycle",
+  langs: ["en"],
+  items: [
+    "Alpha",
+    "Beta",
+    "Gamma",
+    "Delta",
+    "Epsilon",
+    "Zeta",
+    "Eta",
+    "Theta",
+    "Iota",
+    "Kappa",
+    "Lambda",
+    "Mu",
+    "Nu",
+    "Xi",
+    "Omicron",
+    "Pi",
+    "Rho",
+    "Sigma",
+    "Tau",
+    "Upsilon",
+    "Phi",
+    "Chi",
+    "Psi",
+    "Omega"
+  ]
+}, K = {
+  id: "greek-letters-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: [
+    "アルファ",
+    "ベータ",
+    "ガンマ",
+    "デルタ",
+    "イプシロン",
+    "ゼータ",
+    "イータ",
+    "シータ",
+    "イオタ",
+    "カッパ",
+    "ラムダ",
+    "ミュー",
+    "ニュー",
+    "クサイ",
+    "オミクロン",
+    "パイ",
+    "ロー",
+    "シグマ",
+    "タウ",
+    "ウプシロン",
+    "ファイ",
+    "カイ",
+    "プサイ",
+    "オメガ"
+  ]
+}, Y = {
+  id: "greek-letters-symbols",
+  mode: "cycle",
+  langs: ["en", "ja"],
+  items: [
+    "α",
+    "β",
+    "γ",
+    "δ",
+    "ε",
+    "ζ",
+    "η",
+    "θ",
+    "ι",
+    "κ",
+    "λ",
+    "μ",
+    "ν",
+    "ξ",
+    "ο",
+    "π",
+    "ρ",
+    "σ",
+    "τ",
+    "υ",
+    "φ",
+    "χ",
+    "ψ",
+    "ω"
+  ],
+  aliases: {
+    ς: "σ"
+  }
+}, H = {
+  id: "rokuyo-ja",
+  mode: "cycle",
+  langs: ["ja"],
+  items: ["先勝", "友引", "先負", "仏滅", "大安", "赤口"]
+}, Z = {
+  id: "heavenly-stems-ja",
+  mode: "finite",
+  langs: ["ja"],
+  items: ["甲", "乙", "丙", "丁", "戊", "己", "庚", "辛", "壬", "癸"]
+}, _ = {
+  id: "planets-en",
+  mode: "finite",
+  langs: ["en"],
+  items: ["Mercury", "Venus", "Earth", "Mars", "Jupiter", "Saturn", "Uranus", "Neptune"]
+}, ee = {
+  id: "planets-ja",
+  mode: "finite",
+  langs: ["ja"],
+  items: ["水星", "金星", "地球", "火星", "木星", "土星", "天王星", "海王星"]
+}, te = {
+  id: "kuji-in-ja",
+  mode: "finite",
+  langs: ["ja"],
+  items: ["臨", "兵", "闘", "者", "皆", "陣", "烈", "在", "前"]
+}, ne = {
+  id: "eight-virtues-ja",
+  mode: "finite",
+  langs: ["ja"],
+  items: ["仁", "義", "礼", "智", "忠", "信", "孝", "悌"]
+}, re = [
+  A,
+  L,
+  F,
+  v,
+  z,
+  O,
+  P,
+  R,
+  C,
+  D,
+  $,
+  V,
+  W,
+  B,
+  Q,
+  q,
+  G,
+  X,
+  U,
+  K,
+  Y,
+  H,
+  Z,
+  _,
+  ee,
+  te,
+  ne
+], b = (e) => {
+  const t = e % 100;
+  if (t >= 11 && t <= 13) return "th";
+  const n = e % 10;
+  return n === 1 ? "st" : n === 2 ? "nd" : n === 3 ? "rd" : "th";
+}, y = (e) => {
+  const t = /^(\d+)(st|nd|rd|th)$/.exec(e);
+  if (!t) return null;
+  const n = Number(t[1]);
+  if (!Number.isFinite(n) || n <= 0) return null;
+  const r = t[2];
+  return b(n) !== r ? null : n;
+}, se = {
+  id: "ordinal-en",
+  langs: ["en"],
+  match(e) {
+    if (e.length < 2) return null;
+    const t = e.map((s) => y(s));
+    if (t.some((s) => s === null)) return null;
+    const n = t, r = n[1] - n[0];
+    for (let s = 2; s < n.length; s += 1)
+      if (n[s] - n[s - 1] !== r) return null;
+    return { score: 80, step: r };
+  },
+  createIterator(e, t) {
+    let r = y(e[e.length - 1] ?? "") ?? 0;
+    return {
+      next() {
+        return r += t.step, r <= 0 || !Number.isFinite(r) ? { value: void 0, done: !0 } : { value: `${r}${b(r)}`, done: !1 };
+      }
+    };
+  }
+}, ie = (e) => {
+  for (const t of re)
+    e.register(t);
+}, ae = (e) => {
+  e.registerMatch(se);
+}, oe = (e) => {
+  const t = new J({ langs: e });
+  return ie(t), ae(t), t;
+}, le = (e) => {
+  let t = 0;
+  return {
+    next() {
+      if (e.length === 0)
+        return { value: void 0, done: !0 };
+      const n = e[t % e.length];
+      return t += 1, { value: n, done: !1 };
+    }
+  };
+};
+class c {
+  constructor(...t) {
+    const n = t;
+    this.seed = n, this.kind = n.length === 1 ? "copy" : "seed-repeat", this.iterator = le(n);
+  }
+  static fromSeed(t, n, r) {
+    const s = new c(...t);
+    return s.kind = n, s.iterator = r, s;
+  }
+  next() {
+    return this.iterator.next();
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+}
+const x = 1e-9, ce = 100, ue = (e) => ({
+  next() {
+    return { value: e, done: !1 };
+  }
+}), S = (e) => {
+  let t = 0;
+  return {
+    next() {
+      if (e.length === 0)
+        return { value: void 0, done: !0 };
+      const n = e[t % e.length];
+      return t += 1, { value: n, done: !1 };
+    }
+  };
+}, me = (e, t) => {
+  let n = 0;
+  return {
+    next() {
+      return n += 1, { value: e + t * n, done: !1 };
+    }
+  };
+}, de = (e, t) => {
+  let n = 0;
+  return {
+    next() {
+      return n += 1, { value: new Date(e.getTime() + t * n), done: !1 };
+    }
+  };
+}, fe = (e, t) => {
+  let n = 0;
+  return {
+    next() {
+      return n += 1, { value: e * t ** n, done: !1 };
+    }
+  };
+}, he = (e, t) => {
+  if (e.kind === "matcher")
+    return e.matcher.createIterator(t, { step: e.step, state: e.state });
+  const { list: n, startIndex: r, step: s } = e, i = n.items.length;
+  let a = r;
+  return {
+    next() {
+      if (n.mode === "finite") {
+        const o = a + s;
+        return o >= i ? { value: void 0, done: !0 } : (a = o, { value: n.items[a], done: !1 });
+      }
+      return a = (a + s) % i, { value: n.items[a], done: !1 };
+    }
+  };
+}, ge = (e) => e.every((t) => typeof t == "number" && Number.isFinite(t)), pe = (e) => e.every((t) => t instanceof Date && !Number.isNaN(t.getTime())), ye = (e) => e.every((t) => typeof t == "string"), Se = (e) => {
+  const t = /^(.*?)(-?\d+)([^0-9]*)$/.exec(e);
+  if (!t)
+    return null;
+  const n = t[1] ?? "", r = t[2] ?? "", s = t[3] ?? "", i = Number(r);
+  if (!Number.isFinite(i))
+    return null;
+  const a = r.replace("-", "").length;
+  return { prefix: n, num: i, width: a, suffix: s };
+}, be = (e, t, n) => {
+  let r = 0;
+  return {
+    next() {
+      r += 1;
+      const s = t + n * r, i = s < 0 ? "-" : "", a = Math.abs(s).toString().padStart(e.width, "0");
+      return { value: `${e.prefix}${i}${a}${e.suffix}`, done: !1 };
+    }
+  };
+}, I = [
+  ["C", 100],
+  ["XC", 90],
+  ["L", 50],
+  ["XL", 40],
+  ["X", 10],
+  ["IX", 9],
+  ["V", 5],
+  ["IV", 4],
+  ["I", 1]
+], k = (e) => {
+  if (e < 1 || e > ce)
+    return null;
+  let t = e, n = "";
+  for (const [r, s] of I)
+    for (; t >= s; )
+      n += r, t -= s;
+  return n;
+}, xe = (e) => {
+  if (e.length === 0 || e !== e.toUpperCase())
+    return null;
+  let t = e, n = 0;
+  for (const [s, i] of I)
+    for (; t.startsWith(s); )
+      n += i, t = t.slice(s.length);
+  if (t.length > 0)
+    return null;
+  const r = k(n);
+  return !r || r !== e ? null : n;
+}, Ie = (e, t) => {
+  let n = 0;
+  return {
+    next() {
+      n += 1;
+      const r = e + t * n, s = k(r);
+      return s ? { value: s, done: !1 } : { value: void 0, done: !0 };
+    }
+  };
+}, d = (e) => {
+  if (e.length < 2)
+    return null;
+  const t = e[1] - e[0];
+  for (let n = 2; n < e.length; n += 1)
+    if (Math.abs(e[n] - e[n - 1] - t) > x)
+      return null;
+  return t;
+}, ke = (e) => {
+  if (e.length < 2 || e[0] === 0)
+    return null;
+  const t = e[1] / e[0];
+  for (let n = 2; n < e.length; n += 1)
+    if (e[n - 1] === 0 || Math.abs(e[n] / e[n - 1] - t) > x)
+      return null;
+  return t;
+}, Ne = (e) => {
+  const t = e.map((r) => Se(r));
+  if (t.every(Boolean)) {
+    const r = t[0], s = t[t.length - 1];
+    if (t.every(
+      (a) => a?.prefix === r.prefix && a?.suffix === r.suffix
+    )) {
+      const a = t.map((l) => l?.num ?? 0), o = d(a);
+      if (o !== null)
+        return {
+          kind: "arithmetic",
+          iterator: be(
+            { prefix: s.prefix, suffix: s.suffix, width: s.width },
+            s.num,
+            o
+          )
+        };
+    }
+  }
+  const n = e.map((r) => xe(r));
+  if (n.every((r) => r !== null)) {
+    const r = n, s = d(r);
+    if (s !== null) {
+      const i = r[r.length - 1];
+      return {
+        kind: "arithmetic",
+        iterator: Ie(i, s)
+      };
+    }
+  }
+  return null;
+}, je = (e, t) => {
+  const n = t.match(e);
+  return n ? {
+    kind: "list",
+    iterator: he(n, e)
+  } : null;
+};
+function Te(e, t) {
+  const n = t?.registry ?? oe();
+  if (e.length === 0)
+    return c.fromSeed(e, "seed-repeat", S(e));
+  if (e.length === 1)
+    return c.fromSeed(e, "copy", ue(e[0]));
+  if (ye(e)) {
+    const r = je(e, n);
+    if (r)
+      return c.fromSeed(e, r.kind, r.iterator);
+    const s = Ne(e);
+    if (s)
+      return c.fromSeed(e, s.kind, s.iterator);
+  }
+  if (ge(e)) {
+    const r = d(e);
+    if (r !== null)
+      return c.fromSeed(
+        e,
+        "arithmetic",
+        me(e[e.length - 1], r)
+      );
+    const s = ke(e);
+    if (s !== null)
+      return c.fromSeed(
+        e,
+        "geometric",
+        fe(e[e.length - 1], s)
+      );
+  }
+  if (pe(e)) {
+    const r = e.map((i) => i.getTime()), s = d(r);
+    if (s !== null)
+      return c.fromSeed(
+        e,
+        "arithmetic",
+        de(e[e.length - 1], s)
+      );
+  }
+  return c.fromSeed(e, "seed-repeat", S(e));
+}
+export {
+  c as Sequence,
+  J as SequenceRegistry,
+  oe as createBuiltInRegistry,
+  Te as inferSequence,
+  ie as registerBuiltInLists,
+  ae as registerBuiltInMatchers
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../src/registry.ts","../src/builtins.ts","../src/sequence.ts","../src/infer.ts"],"sourcesContent":["export type SequenceListMode = 'cycle' | 'finite';\n\nexport type SequenceList = {\n  id: string;\n  mode: SequenceListMode;\n  langs: readonly string[];\n  items: readonly string[];\n  aliases?: Record<string, string>;\n};\n\nexport type SequenceMatch = {\n  id: string;\n  langs?: readonly string[];\n  match(seed: readonly string[]):\n    | { score: number; startIndex?: number; step?: number; state?: unknown }\n    | null;\n  createIterator(\n    seed: readonly string[],\n    ctx: { step: number; state?: unknown }\n  ): Iterator<string>;\n};\n\nexport type RegistryQuery = {\n  enabledIds?: readonly string[];\n  queryText?: string;\n};\n\nexport type SequenceMatchResult =\n  | {\n      kind: 'list';\n      list: SequenceList;\n      startIndex: number;\n      step: number;\n    }\n  | {\n      kind: 'matcher';\n      matcher: SequenceMatch;\n      step: number;\n      state?: unknown;\n    };\n\nconst fallbackLang = 'en';\n\nconst normalizeQueryToken = (value: string): string => {\n  return value.trim().normalize('NFKC').toLowerCase().replace(/\\s+/g, ' ');\n};\n\nconst normalizeLangs = (langs?: readonly string[]): readonly string[] => {\n  const result: string[] = [];\n  if (langs) {\n    for (const lang of langs) {\n      const normalized = lang.trim();\n      if (!normalized || result.includes(normalized)) {\n        continue;\n      }\n      result.push(normalized);\n    }\n  }\n  if (result.length === 0) {\n    result.push(fallbackLang);\n  } else if (!result.includes(fallbackLang)) {\n    result.push(fallbackLang);\n  }\n  return result;\n};\n\nconst resolveIndex = (list: SequenceList, token: string): number | null => {\n  const directIndex = list.items.indexOf(token);\n  if (directIndex !== -1) {\n    return directIndex;\n  }\n  if (!list.aliases) {\n    return null;\n  }\n  const canonical = list.aliases[token];\n  if (!canonical) {\n    return null;\n  }\n  const canonicalIndex = list.items.indexOf(canonical);\n  return canonicalIndex === -1 ? null : canonicalIndex;\n};\n\nconst hasQueryHit = (list: SequenceList, queryText: string): boolean => {\n  const normalizedQuery = normalizeQueryToken(queryText);\n  if (normalizeQueryToken(list.id).includes(normalizedQuery)) {\n    return true;\n  }\n  for (const item of list.items) {\n    if (normalizeQueryToken(item).includes(normalizedQuery)) {\n      return true;\n    }\n  }\n  if (!list.aliases) {\n    return false;\n  }\n  return Object.keys(list.aliases).some((alias) =>\n    normalizeQueryToken(alias).includes(normalizedQuery)\n  );\n};\n\nconst langsRank = (list: SequenceList, langs: readonly string[]): number => {\n  if (list.langs.length === 0) {\n    return 0;\n  }\n  let best = Number.POSITIVE_INFINITY;\n  for (const lang of list.langs) {\n    const index = langs.indexOf(lang);\n    if (index !== -1 && index < best) {\n      best = index;\n    }\n  }\n  return best;\n};\n\nconst matcherLangsAllowed = (matcher: SequenceMatch, langs: readonly string[]): boolean => {\n  if (!matcher.langs || matcher.langs.length === 0) {\n    return true;\n  }\n  return matcher.langs.some((lang) => langs.includes(lang));\n};\n\nexport class SequenceRegistry {\n  readonly langs: readonly string[];\n\n  private lists: SequenceList[] = [];\n  private matchers: SequenceMatch[] = [];\n\n  constructor(opts?: { langs?: readonly string[] }) {\n    this.langs = normalizeLangs(opts?.langs);\n  }\n\n  register(list: SequenceList): void {\n    const index = this.lists.findIndex((item) => item.id === list.id);\n    if (index === -1) {\n      this.lists.push(list);\n    } else {\n      this.lists[index] = list;\n    }\n  }\n\n  registerMatch(matcher: SequenceMatch): void {\n    const index = this.matchers.findIndex((item) => item.id === matcher.id);\n    if (index === -1) {\n      this.matchers.push(matcher);\n    } else {\n      this.matchers[index] = matcher;\n    }\n  }\n\n  unregister(id: string): void {\n    this.lists = this.lists.filter((item) => item.id !== id);\n    this.matchers = this.matchers.filter((item) => item.id !== id);\n  }\n\n  list(query?: RegistryQuery): SequenceList[] {\n    let lists = [...this.lists];\n    if (query?.enabledIds && query.enabledIds.length > 0) {\n      const enabled = new Set(query.enabledIds);\n      lists = lists.filter((list) => enabled.has(list.id));\n    }\n    const queryText = query?.queryText;\n    if (queryText) {\n      lists = lists.filter((list) => hasQueryHit(list, queryText));\n    }\n    return lists;\n  }\n\n  match(seed: readonly string[], query?: RegistryQuery): SequenceMatchResult | null {\n    if (seed.length === 0) {\n      return null;\n    }\n    let bestMatch: SequenceMatchResult | null = null;\n    let bestScore = Number.NEGATIVE_INFINITY;\n\n    const enabledIds = query?.enabledIds ? new Set(query.enabledIds) : null;\n    for (const matcher of this.matchers) {\n      if (enabledIds && !enabledIds.has(matcher.id)) {\n        continue;\n      }\n      if (!matcherLangsAllowed(matcher, this.langs)) {\n        continue;\n      }\n      const matched = matcher.match(seed);\n      if (!matched) {\n        continue;\n      }\n      const score = matched.score;\n      if (!Number.isFinite(score)) {\n        continue;\n      }\n      if (score > bestScore) {\n        bestScore = score;\n        bestMatch = {\n          kind: 'matcher',\n          matcher,\n          step: matched.step ?? 1,\n          state: matched.state\n        };\n      }\n    }\n\n    const candidates = this.list(query)\n      .map((list) => ({ list, rank: langsRank(list, this.langs) }))\n      .filter((candidate) => Number.isFinite(candidate.rank))\n      .sort((a, b) => a.rank - b.rank);\n\n    for (const { list, rank } of candidates) {\n      const indices: number[] = [];\n      let matchFailed = false;\n      for (const token of seed) {\n        const index = resolveIndex(list, token);\n        if (index === null) {\n          matchFailed = true;\n          break;\n        }\n        indices.push(index);\n      }\n      if (matchFailed) {\n        continue;\n      }\n      const step = this.inferStep(list, indices);\n      if (step === null) {\n        continue;\n      }\n      const listScore = 10 - rank;\n      if (listScore > bestScore) {\n        bestScore = listScore;\n        bestMatch = {\n          kind: 'list',\n          list,\n          startIndex: indices[indices.length - 1] ?? 0,\n          step\n        };\n      }\n    }\n\n    return bestMatch;\n  }\n\n  private inferStep(list: SequenceList, indices: number[]): number | null {\n    if (indices.length < 2) {\n      return 1;\n    }\n    const length = list.items.length;\n    const baseStep = this.stepBetween(list.mode, length, indices[0]!, indices[1]!);\n    if (baseStep === null) {\n      return null;\n    }\n    for (let i = 2; i < indices.length; i += 1) {\n      const expected = this.nextIndex(list.mode, length, indices[i - 1]!, baseStep);\n      if (expected === null || expected !== indices[i]) {\n        return null;\n      }\n    }\n    return baseStep;\n  }\n\n  private stepBetween(\n    mode: SequenceListMode,\n    length: number,\n    from: number,\n    to: number\n  ): number | null {\n    if (mode === 'cycle') {\n      const step = (to - from + length) % length;\n      return step;\n    }\n    const step = to - from;\n    if (step < 0) {\n      return null;\n    }\n    return step;\n  }\n\n  private nextIndex(\n    mode: SequenceListMode,\n    length: number,\n    from: number,\n    step: number\n  ): number | null {\n    if (mode === 'cycle') {\n      return (from + step) % length;\n    }\n    const next = from + step;\n    if (next >= length) {\n      return null;\n    }\n    return next;\n  }\n}\n","import type { SequenceList, SequenceMatch } from './registry';\nimport { SequenceRegistry } from './registry';\n\nconst weekdaysEn: SequenceList = {\n  id: 'weekdays-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: ['Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday', 'Sunday'],\n  aliases: {\n    Mon: 'Monday',\n    Tue: 'Tuesday',\n    Tues: 'Tuesday',\n    Wed: 'Wednesday',\n    Thu: 'Thursday',\n    Thur: 'Thursday',\n    Thurs: 'Thursday',\n    Fri: 'Friday',\n    Sat: 'Saturday',\n    Sun: 'Sunday'\n  }\n};\n\nconst weekdaysJa: SequenceList = {\n  id: 'weekdays-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['月曜日', '火曜日', '水曜日', '木曜日', '金曜日', '土曜日', '日曜日'],\n  aliases: {\n    月曜: '月曜日',\n    月: '月曜日',\n    火曜: '火曜日',\n    火: '火曜日',\n    水曜: '水曜日',\n    水: '水曜日',\n    木曜: '木曜日',\n    木: '木曜日',\n    金曜: '金曜日',\n    金: '金曜日',\n    土曜: '土曜日',\n    土: '土曜日',\n    日曜: '日曜日',\n    日: '日曜日'\n  }\n};\n\nconst monthsEn: SequenceList = {\n  id: 'months-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: [\n    'January',\n    'February',\n    'March',\n    'April',\n    'May',\n    'June',\n    'July',\n    'August',\n    'September',\n    'October',\n    'November',\n    'December'\n  ],\n  aliases: {\n    Jan: 'January',\n    Feb: 'February',\n    Mar: 'March',\n    Apr: 'April',\n    Jun: 'June',\n    Jul: 'July',\n    Aug: 'August',\n    Sep: 'September',\n    Sept: 'September',\n    Oct: 'October',\n    Nov: 'November',\n    Dec: 'December'\n  }\n};\n\nconst monthsJa: SequenceList = {\n  id: 'months-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['1月', '2月', '3月', '4月', '5月', '6月', '7月', '8月', '9月', '10月', '11月', '12月']\n};\n\nconst monthsJaTraditional: SequenceList = {\n  id: 'months-ja-traditional',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['睦月', '如月', '弥生', '卯月', '皐月', '水無月', '文月', '葉月', '長月', '神無月', '霜月', '師走']\n};\n\nconst quartersEn: SequenceList = {\n  id: 'quarters-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: ['Q1', 'Q2', 'Q3', 'Q4']\n};\n\nconst quartersJa: SequenceList = {\n  id: 'quarters-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['第1四半期', '第2四半期', '第3四半期', '第4四半期']\n};\n\nconst zodiacAnimals: SequenceList = {\n  id: 'zodiac-animals-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['子', '丑', '寅', '卯', '辰', '巳', '午', '未', '申', '酉', '戌', '亥']\n};\n\nconst zodiacSignsEn: SequenceList = {\n  id: 'zodiac-signs-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: [\n    'Aries',\n    'Taurus',\n    'Gemini',\n    'Cancer',\n    'Leo',\n    'Virgo',\n    'Libra',\n    'Scorpio',\n    'Sagittarius',\n    'Capricorn',\n    'Aquarius',\n    'Pisces'\n  ]\n};\n\nconst zodiacSignsJa: SequenceList = {\n  id: 'zodiac-signs-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['牡羊座', '牡牛座', '双子座', '蟹座', '獅子座', '乙女座', '天秤座', '蠍座', '射手座', '山羊座', '水瓶座', '魚座'],\n  aliases: {\n    さそり座: '蠍座'\n  }\n};\n\nconst directions16En: SequenceList = {\n  id: 'directions-16-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: [\n    'North',\n    'North-Northeast',\n    'Northeast',\n    'East-Northeast',\n    'East',\n    'East-Southeast',\n    'Southeast',\n    'South-Southeast',\n    'South',\n    'South-Southwest',\n    'Southwest',\n    'West-Southwest',\n    'West',\n    'West-Northwest',\n    'Northwest',\n    'North-Northwest'\n  ]\n};\n\nconst directions16Ja: SequenceList = {\n  id: 'directions-16-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: [\n    '北',\n    '北北東',\n    '北東',\n    '東北東',\n    '東',\n    '東南東',\n    '南東',\n    '南南東',\n    '南',\n    '南南西',\n    '南西',\n    '西南西',\n    '西',\n    '西北西',\n    '北西',\n    '北北西'\n  ]\n};\n\nconst ampmEn: SequenceList = {\n  id: 'ampm-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: ['AM', 'PM'],\n  aliases: {\n    'A.M.': 'AM',\n    'P.M.': 'PM'\n  }\n};\n\nconst ampmJa: SequenceList = {\n  id: 'ampm-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['午前', '午後']\n};\n\nconst seasonsEn: SequenceList = {\n  id: 'seasons-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: ['Spring', 'Summer', 'Autumn', 'Winter'],\n  aliases: {\n    Fall: 'Autumn'\n  }\n};\n\nconst seasonsJa: SequenceList = {\n  id: 'seasons-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['春', '夏', '秋', '冬']\n};\n\nconst solfegeJa: SequenceList = {\n  id: 'solfege-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['ド', 'レ', 'ミ', 'ファ', 'ソ', 'ラ', 'シ']\n};\n\nconst solfegeEn: SequenceList = {\n  id: 'solfege-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: ['Do', 'Re', 'Mi', 'Fa', 'Sol', 'La', 'Ti'],\n  aliases: {\n    So: 'Sol',\n    Si: 'Ti'\n  }\n};\n\nconst greekLettersEn: SequenceList = {\n  id: 'greek-letters-en',\n  mode: 'cycle',\n  langs: ['en'],\n  items: [\n    'Alpha',\n    'Beta',\n    'Gamma',\n    'Delta',\n    'Epsilon',\n    'Zeta',\n    'Eta',\n    'Theta',\n    'Iota',\n    'Kappa',\n    'Lambda',\n    'Mu',\n    'Nu',\n    'Xi',\n    'Omicron',\n    'Pi',\n    'Rho',\n    'Sigma',\n    'Tau',\n    'Upsilon',\n    'Phi',\n    'Chi',\n    'Psi',\n    'Omega'\n  ]\n};\n\nconst greekLettersJa: SequenceList = {\n  id: 'greek-letters-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: [\n    'アルファ',\n    'ベータ',\n    'ガンマ',\n    'デルタ',\n    'イプシロン',\n    'ゼータ',\n    'イータ',\n    'シータ',\n    'イオタ',\n    'カッパ',\n    'ラムダ',\n    'ミュー',\n    'ニュー',\n    'クサイ',\n    'オミクロン',\n    'パイ',\n    'ロー',\n    'シグマ',\n    'タウ',\n    'ウプシロン',\n    'ファイ',\n    'カイ',\n    'プサイ',\n    'オメガ'\n  ]\n};\n\nconst greekLettersSymbols: SequenceList = {\n  id: 'greek-letters-symbols',\n  mode: 'cycle',\n  langs: ['en', 'ja'],\n  items: [\n    'α',\n    'β',\n    'γ',\n    'δ',\n    'ε',\n    'ζ',\n    'η',\n    'θ',\n    'ι',\n    'κ',\n    'λ',\n    'μ',\n    'ν',\n    'ξ',\n    'ο',\n    'π',\n    'ρ',\n    'σ',\n    'τ',\n    'υ',\n    'φ',\n    'χ',\n    'ψ',\n    'ω'\n  ],\n  aliases: {\n    'ς': 'σ'\n  }\n};\n\nconst rokuyo: SequenceList = {\n  id: 'rokuyo-ja',\n  mode: 'cycle',\n  langs: ['ja'],\n  items: ['先勝', '友引', '先負', '仏滅', '大安', '赤口']\n};\n\nconst heavenlyStems: SequenceList = {\n  id: 'heavenly-stems-ja',\n  mode: 'finite',\n  langs: ['ja'],\n  items: ['甲', '乙', '丙', '丁', '戊', '己', '庚', '辛', '壬', '癸']\n};\n\nconst planetsEn: SequenceList = {\n  id: 'planets-en',\n  mode: 'finite',\n  langs: ['en'],\n  items: ['Mercury', 'Venus', 'Earth', 'Mars', 'Jupiter', 'Saturn', 'Uranus', 'Neptune']\n};\n\nconst planetsJa: SequenceList = {\n  id: 'planets-ja',\n  mode: 'finite',\n  langs: ['ja'],\n  items: ['水星', '金星', '地球', '火星', '木星', '土星', '天王星', '海王星']\n};\n\nconst kujiIn: SequenceList = {\n  id: 'kuji-in-ja',\n  mode: 'finite',\n  langs: ['ja'],\n  items: ['臨', '兵', '闘', '者', '皆', '陣', '烈', '在', '前']\n};\n\nconst eightVirtues: SequenceList = {\n  id: 'eight-virtues-ja',\n  mode: 'finite',\n  langs: ['ja'],\n  items: ['仁', '義', '礼', '智', '忠', '信', '孝', '悌']\n};\n\nconst builtInLists: SequenceList[] = [\n  weekdaysEn,\n  weekdaysJa,\n  monthsEn,\n  monthsJa,\n  monthsJaTraditional,\n  quartersEn,\n  quartersJa,\n  zodiacAnimals,\n  zodiacSignsEn,\n  zodiacSignsJa,\n  directions16En,\n  directions16Ja,\n  ampmEn,\n  ampmJa,\n  seasonsEn,\n  seasonsJa,\n  solfegeJa,\n  solfegeEn,\n  greekLettersEn,\n  greekLettersJa,\n  greekLettersSymbols,\n  rokuyo,\n  heavenlyStems,\n  planetsEn,\n  planetsJa,\n  kujiIn,\n  eightVirtues\n];\n\nconst ordinalSuffix = (value: number): string => {\n  const mod100 = value % 100;\n  if (mod100 >= 11 && mod100 <= 13) return 'th';\n  const mod10 = value % 10;\n  if (mod10 === 1) return 'st';\n  if (mod10 === 2) return 'nd';\n  if (mod10 === 3) return 'rd';\n  return 'th';\n};\n\nconst parseOrdinal = (value: string): number | null => {\n  const match = /^(\\d+)(st|nd|rd|th)$/.exec(value);\n  if (!match) return null;\n  const num = Number(match[1]);\n  if (!Number.isFinite(num) || num <= 0) return null;\n  const suffix = match[2];\n  if (ordinalSuffix(num) !== suffix) return null;\n  return num;\n};\n\nconst ordinalMatcher: SequenceMatch = {\n  id: 'ordinal-en',\n  langs: ['en'],\n  match(seed) {\n    if (seed.length < 2) return null;\n    const values = seed.map((value) => parseOrdinal(value));\n    if (values.some((value) => value === null)) return null;\n    const nums = values as number[];\n    const step = nums[1]! - nums[0]!;\n    for (let i = 2; i < nums.length; i += 1) {\n      if (nums[i]! - nums[i - 1]! !== step) return null;\n    }\n    return { score: 80, step };\n  },\n  createIterator(seed, ctx) {\n    const last = parseOrdinal(seed[seed.length - 1] ?? '');\n    let current = last ?? 0;\n    return {\n      next() {\n        current += ctx.step;\n        if (current <= 0 || !Number.isFinite(current)) {\n          return { value: undefined, done: true } as IteratorResult<string>;\n        }\n        return { value: `${current}${ordinalSuffix(current)}`, done: false };\n      }\n    };\n  }\n};\n\nexport const registerBuiltInLists = (registry: SequenceRegistry): void => {\n  for (const list of builtInLists) {\n    registry.register(list);\n  }\n};\n\nexport const registerBuiltInMatchers = (registry: SequenceRegistry): void => {\n  registry.registerMatch(ordinalMatcher);\n};\n\nexport const createBuiltInRegistry = (langs?: readonly string[]): SequenceRegistry => {\n  const registry = new SequenceRegistry({ langs });\n  registerBuiltInLists(registry);\n  registerBuiltInMatchers(registry);\n  return registry;\n};\n","import type { SequenceKind, SequenceValue } from './types';\n\nconst createSeedRepeatIterator = <T>(seed: readonly T[]): Iterator<T> => {\n  let index = 0;\n  return {\n    next() {\n      if (seed.length === 0) {\n        return { value: undefined, done: true } as IteratorResult<T>;\n      }\n      const value = seed[index % seed.length] as T;\n      index += 1;\n      return { value, done: false };\n    }\n  };\n};\n\nexport class Sequence<T extends SequenceValue> implements Iterable<T>, Iterator<T> {\n  readonly seed: readonly T[];\n  kind: SequenceKind;\n  private iterator: Iterator<T>;\n\n  constructor(...seed: T[]);\n  constructor(...args: unknown[]) {\n    const seed = args as T[];\n    this.seed = seed;\n    this.kind = seed.length === 1 ? 'copy' : 'seed-repeat';\n    this.iterator = createSeedRepeatIterator(seed);\n  }\n\n  static fromSeed<T extends SequenceValue>(\n    seed: readonly T[],\n    kind: SequenceKind,\n    iterator: Iterator<T>\n  ): Sequence<T> {\n    const instance = new Sequence<T>(...seed);\n    instance.kind = kind;\n    instance.iterator = iterator;\n    return instance;\n  }\n\n  next(): IteratorResult<T> {\n    return this.iterator.next();\n  }\n\n  [Symbol.iterator](): Iterator<T> {\n    return this;\n  }\n}\n","import { createBuiltInRegistry } from './builtins';\nimport { Sequence } from './sequence';\nimport type { SequenceKind, SequenceValue } from './types';\nimport type { SequenceMatchResult, SequenceRegistry } from './registry';\n\nconst numberEpsilon = 1e-9;\nconst romanMax = 100;\n\nconst createCopyIterator = <T>(value: T): Iterator<T> => {\n  return {\n    next() {\n      return { value, done: false };\n    }\n  };\n};\n\nconst createSeedRepeatIterator = <T>(seed: readonly T[]): Iterator<T> => {\n  let index = 0;\n  return {\n    next() {\n      if (seed.length === 0) {\n        return { value: undefined, done: true } as IteratorResult<T>;\n      }\n      const value = seed[index % seed.length] as T;\n      index += 1;\n      return { value, done: false };\n    }\n  };\n};\n\nconst createArithmeticNumberIterator = (last: number, step: number): Iterator<number> => {\n  let offset = 0;\n  return {\n    next() {\n      offset += 1;\n      const value = last + step * offset;\n      return { value, done: false };\n    }\n  };\n};\n\nconst createArithmeticDateIterator = (last: Date, stepMs: number): Iterator<Date> => {\n  let offset = 0;\n  return {\n    next() {\n      offset += 1;\n      const value = new Date(last.getTime() + stepMs * offset);\n      return { value, done: false };\n    }\n  };\n};\n\nconst createGeometricIterator = (last: number, ratio: number): Iterator<number> => {\n  let offset = 0;\n  return {\n    next() {\n      offset += 1;\n      const value = last * ratio ** offset;\n      return { value, done: false };\n    }\n  };\n};\n\nconst createListIterator = (\n  match: SequenceMatchResult,\n  seed: readonly string[]\n): Iterator<string> => {\n  if (match.kind === 'matcher') {\n    return match.matcher.createIterator(seed, { step: match.step, state: match.state });\n  }\n  const { list, startIndex, step } = match;\n  const length = list.items.length;\n  let currentIndex = startIndex;\n  return {\n    next() {\n      if (list.mode === 'finite') {\n        const nextIndex = currentIndex + step;\n        if (nextIndex >= length) {\n          return { value: undefined, done: true } as IteratorResult<string>;\n        }\n        currentIndex = nextIndex;\n        return { value: list.items[currentIndex] as string, done: false };\n      }\n      currentIndex = (currentIndex + step) % length;\n      return { value: list.items[currentIndex] as string, done: false };\n    }\n  };\n};\n\nconst isNumberSeed = (seed: readonly SequenceValue[]): seed is readonly number[] => {\n  return seed.every((value) => typeof value === 'number' && Number.isFinite(value));\n};\n\nconst isDateSeed = (seed: readonly SequenceValue[]): seed is readonly Date[] => {\n  return seed.every((value) => value instanceof Date && !Number.isNaN(value.getTime()));\n};\n\nconst isStringSeed = (seed: readonly SequenceValue[]): seed is readonly string[] => {\n  return seed.every((value) => typeof value === 'string');\n};\n\nconst parseEmbeddedNumber = (value: string): { prefix: string; num: number; width: number; suffix: string } | null => {\n  const match = /^(.*?)(-?\\d+)([^0-9]*)$/.exec(value);\n  if (!match) {\n    return null;\n  }\n  const prefix = match[1] ?? '';\n  const digits = match[2] ?? '';\n  const suffix = match[3] ?? '';\n  const num = Number(digits);\n  if (!Number.isFinite(num)) {\n    return null;\n  }\n  const width = digits.replace('-', '').length;\n  return { prefix, num, width, suffix };\n};\n\nconst createEmbeddedNumberIterator = (\n  template: { prefix: string; suffix: string; width: number },\n  last: number,\n  step: number\n): Iterator<string> => {\n  let offset = 0;\n  return {\n    next() {\n      offset += 1;\n      const next = last + step * offset;\n      const sign = next < 0 ? '-' : '';\n      const digits = Math.abs(next).toString().padStart(template.width, '0');\n      return { value: `${template.prefix}${sign}${digits}${template.suffix}`, done: false };\n    }\n  };\n};\n\nconst romanMap: Array<[string, number]> = [\n  ['C', 100],\n  ['XC', 90],\n  ['L', 50],\n  ['XL', 40],\n  ['X', 10],\n  ['IX', 9],\n  ['V', 5],\n  ['IV', 4],\n  ['I', 1]\n];\n\nconst toRoman = (value: number): string | null => {\n  if (value < 1 || value > romanMax) {\n    return null;\n  }\n  let remaining = value;\n  let output = '';\n  for (const [symbol, amount] of romanMap) {\n    while (remaining >= amount) {\n      output += symbol;\n      remaining -= amount;\n    }\n  }\n  return output;\n};\n\nconst parseRoman = (value: string): number | null => {\n  if (value.length === 0) {\n    return null;\n  }\n  if (value !== value.toUpperCase()) {\n    return null;\n  }\n  let remaining = value;\n  let total = 0;\n  for (const [symbol, amount] of romanMap) {\n    while (remaining.startsWith(symbol)) {\n      total += amount;\n      remaining = remaining.slice(symbol.length);\n    }\n  }\n  if (remaining.length > 0) {\n    return null;\n  }\n  const canonical = toRoman(total);\n  if (!canonical || canonical !== value) {\n    return null;\n  }\n  return total;\n};\n\nconst createRomanIterator = (last: number, step: number): Iterator<string> => {\n  let offset = 0;\n  return {\n    next() {\n      offset += 1;\n      const next = last + step * offset;\n      const roman = toRoman(next);\n      if (!roman) {\n        return { value: undefined, done: true } as IteratorResult<string>;\n      }\n      return { value: roman, done: false };\n    }\n  };\n};\n\nconst matchArithmetic = (values: readonly number[]): number | null => {\n  if (values.length < 2) {\n    return null;\n  }\n  const step = values[1]! - values[0]!;\n  for (let i = 2; i < values.length; i += 1) {\n    if (Math.abs(values[i]! - values[i - 1]! - step) > numberEpsilon) {\n      return null;\n    }\n  }\n  return step;\n};\n\nconst matchGeometric = (values: readonly number[]): number | null => {\n  if (values.length < 2) {\n    return null;\n  }\n  if (values[0] === 0) {\n    return null;\n  }\n  const ratio = values[1]! / values[0]!;\n  for (let i = 2; i < values.length; i += 1) {\n    if (values[i - 1] === 0) {\n      return null;\n    }\n    if (Math.abs(values[i]! / values[i - 1]! - ratio) > numberEpsilon) {\n      return null;\n    }\n  }\n  return ratio;\n};\n\nconst inferStringSequence = (\n  seed: readonly string[]\n): { kind: SequenceKind; iterator: Iterator<string> } | null => {\n  const embedded = seed.map((value) => parseEmbeddedNumber(value));\n  if (embedded.every(Boolean)) {\n    const first = embedded[0]!;\n    const last = embedded[embedded.length - 1]!;\n    const samePattern = embedded.every(\n      (entry) => entry?.prefix === first.prefix && entry?.suffix === first.suffix\n    );\n    if (samePattern) {\n      const values = embedded.map((entry) => entry?.num ?? 0);\n      const step = matchArithmetic(values);\n      if (step !== null) {\n        return {\n          kind: 'arithmetic',\n          iterator: createEmbeddedNumberIterator(\n            { prefix: last.prefix, suffix: last.suffix, width: last.width },\n            last.num,\n            step\n          )\n        };\n      }\n    }\n  }\n\n  const romanValues = seed.map((value) => parseRoman(value));\n  if (romanValues.every((value) => value !== null)) {\n    const numeric = romanValues as number[];\n    const step = matchArithmetic(numeric);\n    if (step !== null) {\n      const last = numeric[numeric.length - 1]!;\n      return {\n        kind: 'arithmetic',\n        iterator: createRomanIterator(last, step)\n      };\n    }\n  }\n\n  return null;\n};\n\nconst inferFromList = (\n  seed: readonly string[],\n  registry: SequenceRegistry\n): { kind: SequenceKind; iterator: Iterator<string> } | null => {\n  const match = registry.match(seed);\n  if (!match) {\n    return null;\n  }\n  return {\n    kind: 'list',\n    iterator: createListIterator(match, seed)\n  };\n};\n\nexport function inferSequence(seed: readonly number[], options?: { registry?: SequenceRegistry }): Sequence<number>;\nexport function inferSequence(seed: readonly Date[], options?: { registry?: SequenceRegistry }): Sequence<Date>;\nexport function inferSequence(seed: readonly string[], options?: { registry?: SequenceRegistry }): Sequence<string>;\nexport function inferSequence(\n  seed: readonly SequenceValue[],\n  options?: { registry?: SequenceRegistry }\n): Sequence<SequenceValue> {\n  const registry = options?.registry ?? createBuiltInRegistry();\n  if (seed.length === 0) {\n    return Sequence.fromSeed(seed, 'seed-repeat', createSeedRepeatIterator(seed));\n  }\n  if (seed.length === 1) {\n    return Sequence.fromSeed(seed, 'copy', createCopyIterator(seed[0]!));\n  }\n\n  if (isStringSeed(seed)) {\n    const listSequence = inferFromList(seed, registry);\n    if (listSequence) {\n      return Sequence.fromSeed(seed, listSequence.kind, listSequence.iterator);\n    }\n    const structured = inferStringSequence(seed);\n    if (structured) {\n      return Sequence.fromSeed(seed, structured.kind, structured.iterator);\n    }\n  }\n\n  if (isNumberSeed(seed)) {\n    const step = matchArithmetic(seed);\n    if (step !== null) {\n      return Sequence.fromSeed(\n        seed,\n        'arithmetic',\n        createArithmeticNumberIterator(seed[seed.length - 1]!, step)\n      );\n    }\n    const ratio = matchGeometric(seed);\n    if (ratio !== null) {\n      return Sequence.fromSeed(\n        seed,\n        'geometric',\n        createGeometricIterator(seed[seed.length - 1]!, ratio)\n      );\n    }\n  }\n\n  if (isDateSeed(seed)) {\n    const times = seed.map((value) => value.getTime());\n    const step = matchArithmetic(times);\n    if (step !== null) {\n      return Sequence.fromSeed(\n        seed,\n        'arithmetic',\n        createArithmeticDateIterator(seed[seed.length - 1]!, step)\n      );\n    }\n  }\n\n  return Sequence.fromSeed(seed, 'seed-repeat', createSeedRepeatIterator(seed));\n}\n"],"names":["normalizeQueryToken","value","normalizeLangs","langs","result","lang","normalized","resolveIndex","list","token","directIndex","canonical","canonicalIndex","hasQueryHit","queryText","normalizedQuery","item","alias","langsRank","best","index","matcherLangsAllowed","matcher","SequenceRegistry","opts","id","query","lists","enabled","seed","bestMatch","bestScore","enabledIds","matched","score","candidates","candidate","a","b","rank","indices","matchFailed","step","listScore","length","baseStep","expected","mode","from","to","next","weekdaysEn","weekdaysJa","monthsEn","monthsJa","monthsJaTraditional","quartersEn","quartersJa","zodiacAnimals","zodiacSignsEn","zodiacSignsJa","directions16En","directions16Ja","ampmEn","ampmJa","seasonsEn","seasonsJa","solfegeJa","solfegeEn","greekLettersEn","greekLettersJa","greekLettersSymbols","rokuyo","heavenlyStems","planetsEn","planetsJa","kujiIn","eightVirtues","builtInLists","ordinalSuffix","mod100","mod10","parseOrdinal","match","num","suffix","ordinalMatcher","values","nums","i","ctx","current","registerBuiltInLists","registry","registerBuiltInMatchers","createBuiltInRegistry","createSeedRepeatIterator","Sequence","args","kind","iterator","instance","numberEpsilon","romanMax","createCopyIterator","createArithmeticNumberIterator","last","offset","createArithmeticDateIterator","stepMs","createGeometricIterator","ratio","createListIterator","startIndex","currentIndex","nextIndex","isNumberSeed","isDateSeed","isStringSeed","parseEmbeddedNumber","prefix","digits","width","createEmbeddedNumberIterator","template","sign","romanMap","toRoman","remaining","output","symbol","amount","parseRoman","total","createRomanIterator","roman","matchArithmetic","matchGeometric","inferStringSequence","embedded","first","entry","romanValues","numeric","inferFromList","inferSequence","options","listSequence","structured","times"],"mappings":"AA2CA,MAAMA,IAAsB,CAACC,MACpBA,EAAM,KAAA,EAAO,UAAU,MAAM,EAAE,cAAc,QAAQ,QAAQ,GAAG,GAGnEC,IAAiB,CAACC,MAAiD;AACvE,QAAMC,IAAmB,CAAA;AACzB,MAAID;AACF,eAAWE,KAAQF,GAAO;AACxB,YAAMG,IAAaD,EAAK,KAAA;AACxB,MAAI,CAACC,KAAcF,EAAO,SAASE,CAAU,KAG7CF,EAAO,KAAKE,CAAU;AAAA,IACxB;AAEF,SAAIF,EAAO,WAAW,IACpBA,EAAO,KAAK,IAAY,IACdA,EAAO,SAAS,IAAY,KACtCA,EAAO,KAAK,IAAY,GAEnBA;AACT,GAEMG,IAAe,CAACC,GAAoBC,MAAiC;AACzE,QAAMC,IAAcF,EAAK,MAAM,QAAQC,CAAK;AAC5C,MAAIC,MAAgB;AAClB,WAAOA;AAET,MAAI,CAACF,EAAK;AACR,WAAO;AAET,QAAMG,IAAYH,EAAK,QAAQC,CAAK;AACpC,MAAI,CAACE;AACH,WAAO;AAET,QAAMC,IAAiBJ,EAAK,MAAM,QAAQG,CAAS;AACnD,SAAOC,MAAmB,KAAK,OAAOA;AACxC,GAEMC,IAAc,CAACL,GAAoBM,MAA+B;AACtE,QAAMC,IAAkBf,EAAoBc,CAAS;AACrD,MAAId,EAAoBQ,EAAK,EAAE,EAAE,SAASO,CAAe;AACvD,WAAO;AAET,aAAWC,KAAQR,EAAK;AACtB,QAAIR,EAAoBgB,CAAI,EAAE,SAASD,CAAe;AACpD,aAAO;AAGX,SAAKP,EAAK,UAGH,OAAO,KAAKA,EAAK,OAAO,EAAE;AAAA,IAAK,CAACS,MACrCjB,EAAoBiB,CAAK,EAAE,SAASF,CAAe;AAAA,EAAA,IAH5C;AAKX,GAEMG,IAAY,CAACV,GAAoBL,MAAqC;AAC1E,MAAIK,EAAK,MAAM,WAAW;AACxB,WAAO;AAET,MAAIW,IAAO,OAAO;AAClB,aAAWd,KAAQG,EAAK,OAAO;AAC7B,UAAMY,IAAQjB,EAAM,QAAQE,CAAI;AAChC,IAAIe,MAAU,MAAMA,IAAQD,MAC1BA,IAAOC;AAAA,EAEX;AACA,SAAOD;AACT,GAEME,IAAsB,CAACC,GAAwBnB,MAC/C,CAACmB,EAAQ,SAASA,EAAQ,MAAM,WAAW,IACtC,KAEFA,EAAQ,MAAM,KAAK,CAACjB,MAASF,EAAM,SAASE,CAAI,CAAC;AAGnD,MAAMkB,EAAiB;AAAA,EAM5B,YAAYC,GAAsC;AAHlD,SAAQ,QAAwB,CAAA,GAChC,KAAQ,WAA4B,CAAA,GAGlC,KAAK,QAAQtB,EAAesB,GAAM,KAAK;AAAA,EACzC;AAAA,EAEA,SAAShB,GAA0B;AACjC,UAAMY,IAAQ,KAAK,MAAM,UAAU,CAACJ,MAASA,EAAK,OAAOR,EAAK,EAAE;AAChE,IAAIY,MAAU,KACZ,KAAK,MAAM,KAAKZ,CAAI,IAEpB,KAAK,MAAMY,CAAK,IAAIZ;AAAA,EAExB;AAAA,EAEA,cAAcc,GAA8B;AAC1C,UAAMF,IAAQ,KAAK,SAAS,UAAU,CAACJ,MAASA,EAAK,OAAOM,EAAQ,EAAE;AACtE,IAAIF,MAAU,KACZ,KAAK,SAAS,KAAKE,CAAO,IAE1B,KAAK,SAASF,CAAK,IAAIE;AAAA,EAE3B;AAAA,EAEA,WAAWG,GAAkB;AAC3B,SAAK,QAAQ,KAAK,MAAM,OAAO,CAACT,MAASA,EAAK,OAAOS,CAAE,GACvD,KAAK,WAAW,KAAK,SAAS,OAAO,CAACT,MAASA,EAAK,OAAOS,CAAE;AAAA,EAC/D;AAAA,EAEA,KAAKC,GAAuC;AAC1C,QAAIC,IAAQ,CAAC,GAAG,KAAK,KAAK;AAC1B,QAAID,GAAO,cAAcA,EAAM,WAAW,SAAS,GAAG;AACpD,YAAME,IAAU,IAAI,IAAIF,EAAM,UAAU;AACxC,MAAAC,IAAQA,EAAM,OAAO,CAACnB,MAASoB,EAAQ,IAAIpB,EAAK,EAAE,CAAC;AAAA,IACrD;AACA,UAAMM,IAAYY,GAAO;AACzB,WAAIZ,MACFa,IAAQA,EAAM,OAAO,CAACnB,MAASK,EAAYL,GAAMM,CAAS,CAAC,IAEtDa;AAAA,EACT;AAAA,EAEA,MAAME,GAAyBH,GAAmD;AAChF,QAAIG,EAAK,WAAW;AAClB,aAAO;AAET,QAAIC,IAAwC,MACxCC,IAAY,OAAO;AAEvB,UAAMC,IAAaN,GAAO,aAAa,IAAI,IAAIA,EAAM,UAAU,IAAI;AACnE,eAAWJ,KAAW,KAAK,UAAU;AAInC,UAHIU,KAAc,CAACA,EAAW,IAAIV,EAAQ,EAAE,KAGxC,CAACD,EAAoBC,GAAS,KAAK,KAAK;AAC1C;AAEF,YAAMW,IAAUX,EAAQ,MAAMO,CAAI;AAClC,UAAI,CAACI;AACH;AAEF,YAAMC,IAAQD,EAAQ;AACtB,MAAK,OAAO,SAASC,CAAK,KAGtBA,IAAQH,MACVA,IAAYG,GACZJ,IAAY;AAAA,QACV,MAAM;AAAA,QACN,SAAAR;AAAA,QACA,MAAMW,EAAQ,QAAQ;AAAA,QACtB,OAAOA,EAAQ;AAAA,MAAA;AAAA,IAGrB;AAEA,UAAME,IAAa,KAAK,KAAKT,CAAK,EAC/B,IAAI,CAAClB,OAAU,EAAE,MAAAA,GAAM,MAAMU,EAAUV,GAAM,KAAK,KAAK,EAAA,EAAI,EAC3D,OAAO,CAAC4B,MAAc,OAAO,SAASA,EAAU,IAAI,CAAC,EACrD,KAAK,CAACC,GAAGC,MAAMD,EAAE,OAAOC,EAAE,IAAI;AAEjC,eAAW,EAAE,MAAA9B,GAAM,MAAA+B,EAAA,KAAUJ,GAAY;AACvC,YAAMK,IAAoB,CAAA;AAC1B,UAAIC,IAAc;AAClB,iBAAWhC,KAASoB,GAAM;AACxB,cAAMT,IAAQb,EAAaC,GAAMC,CAAK;AACtC,YAAIW,MAAU,MAAM;AAClB,UAAAqB,IAAc;AACd;AAAA,QACF;AACA,QAAAD,EAAQ,KAAKpB,CAAK;AAAA,MACpB;AACA,UAAIqB;AACF;AAEF,YAAMC,IAAO,KAAK,UAAUlC,GAAMgC,CAAO;AACzC,UAAIE,MAAS;AACX;AAEF,YAAMC,IAAY,KAAKJ;AACvB,MAAII,IAAYZ,MACdA,IAAYY,GACZb,IAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAAtB;AAAA,QACA,YAAYgC,EAAQA,EAAQ,SAAS,CAAC,KAAK;AAAA,QAC3C,MAAAE;AAAA,MAAA;AAAA,IAGN;AAEA,WAAOZ;AAAA,EACT;AAAA,EAEQ,UAAUtB,GAAoBgC,GAAkC;AACtE,QAAIA,EAAQ,SAAS;AACnB,aAAO;AAET,UAAMI,IAASpC,EAAK,MAAM,QACpBqC,IAAW,KAAK,YAAYrC,EAAK,MAAMoC,GAAQJ,EAAQ,CAAC,GAAIA,EAAQ,CAAC,CAAE;AAC7E,QAAIK,MAAa;AACf,aAAO;AAET,aAAS,IAAI,GAAG,IAAIL,EAAQ,QAAQ,KAAK,GAAG;AAC1C,YAAMM,IAAW,KAAK,UAAUtC,EAAK,MAAMoC,GAAQJ,EAAQ,IAAI,CAAC,GAAIK,CAAQ;AAC5E,UAAIC,MAAa,QAAQA,MAAaN,EAAQ,CAAC;AAC7C,eAAO;AAAA,IAEX;AACA,WAAOK;AAAA,EACT;AAAA,EAEQ,YACNE,GACAH,GACAI,GACAC,GACe;AACf,QAAIF,MAAS;AAEX,cADcE,IAAKD,IAAOJ,KAAUA;AAGtC,UAAMF,IAAOO,IAAKD;AAClB,WAAIN,IAAO,IACF,OAEFA;AAAA,EACT;AAAA,EAEQ,UACNK,GACAH,GACAI,GACAN,GACe;AACf,QAAIK,MAAS;AACX,cAAQC,IAAON,KAAQE;AAEzB,UAAMM,IAAOF,IAAON;AACpB,WAAIQ,KAAQN,IACH,OAEFM;AAAA,EACT;AACF;AC9RA,MAAMC,IAA2B;AAAA,EAC/B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,UAAU,WAAW,aAAa,YAAY,UAAU,YAAY,QAAQ;AAAA,EACpF,SAAS;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EAAA;AAET,GAEMC,IAA2B;AAAA,EAC/B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAAA,EACvD,SAAS;AAAA,IACP,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,GAAG;AAAA,EAAA;AAEP,GAEMC,IAAyB;AAAA,EAC7B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAAA,EAEF,SAAS;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EAAA;AAET,GAEMC,IAAyB;AAAA,EAC7B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,OAAO,KAAK;AACnF,GAEMC,IAAoC;AAAA,EACxC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI;AAClF,GAEMC,IAA2B;AAAA,EAC/B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,IAAI;AAChC,GAEMC,IAA2B;AAAA,EAC/B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,SAAS,SAAS,SAAS,OAAO;AAC5C,GAEMC,IAA8B;AAAA,EAClC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACpE,GAEMC,IAA8B;AAAA,EAClC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,GAEMC,IAA8B;AAAA,EAClC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,OAAO,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO,IAAI;AAAA,EACvF,SAAS;AAAA,IACP,MAAM;AAAA,EAAA;AAEV,GAEMC,IAA+B;AAAA,EACnC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,GAEMC,IAA+B;AAAA,EACnC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,GAEMC,IAAuB;AAAA,EAC3B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,IAAI;AAAA,EAClB,SAAS;AAAA,IACP,QAAQ;AAAA,IACR,QAAQ;AAAA,EAAA;AAEZ,GAEMC,IAAuB;AAAA,EAC3B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,IAAI;AACpB,GAEMC,IAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,UAAU,UAAU,UAAU,QAAQ;AAAA,EAC9C,SAAS;AAAA,IACP,MAAM;AAAA,EAAA;AAEV,GAEMC,IAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,GAAG;AAC5B,GAEMC,IAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG;AAC5C,GAEMC,IAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI;AAAA,EACjD,SAAS;AAAA,IACP,IAAI;AAAA,IACJ,IAAI;AAAA,EAAA;AAER,GAEMC,IAA+B;AAAA,EACnC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,GAEMC,IAA+B;AAAA,EACnC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,GAEMC,IAAoC;AAAA,EACxC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,MAAM,IAAI;AAAA,EAClB,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAAA,EAEF,SAAS;AAAA,IACP,GAAK;AAAA,EAAA;AAET,GAEMC,IAAuB;AAAA,EAC3B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;AAC5C,GAEMC,IAA8B;AAAA,EAClC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAC1D,GAEMC,IAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,WAAW,SAAS,SAAS,QAAQ,WAAW,UAAU,UAAU,SAAS;AACvF,GAEMC,KAA0B;AAAA,EAC9B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AAC1D,GAEMC,KAAuB;AAAA,EAC3B,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACrD,GAEMC,KAA6B;AAAA,EACjC,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO,CAAC,IAAI;AAAA,EACZ,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAChD,GAEMC,KAA+B;AAAA,EACnC3B;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AACF,GAEME,IAAgB,CAAC9E,MAA0B;AAC/C,QAAM+E,IAAS/E,IAAQ;AACvB,MAAI+E,KAAU,MAAMA,KAAU,GAAI,QAAO;AACzC,QAAMC,IAAQhF,IAAQ;AACtB,SAAIgF,MAAU,IAAU,OACpBA,MAAU,IAAU,OACpBA,MAAU,IAAU,OACjB;AACT,GAEMC,IAAe,CAACjF,MAAiC;AACrD,QAAMkF,IAAQ,uBAAuB,KAAKlF,CAAK;AAC/C,MAAI,CAACkF,EAAO,QAAO;AACnB,QAAMC,IAAM,OAAOD,EAAM,CAAC,CAAC;AAC3B,MAAI,CAAC,OAAO,SAASC,CAAG,KAAKA,KAAO,EAAG,QAAO;AAC9C,QAAMC,IAASF,EAAM,CAAC;AACtB,SAAIJ,EAAcK,CAAG,MAAMC,IAAe,OACnCD;AACT,GAEME,KAAgC;AAAA,EACpC,IAAI;AAAA,EACJ,OAAO,CAAC,IAAI;AAAA,EACZ,MAAMzD,GAAM;AACV,QAAIA,EAAK,SAAS,EAAG,QAAO;AAC5B,UAAM0D,IAAS1D,EAAK,IAAI,CAAC5B,MAAUiF,EAAajF,CAAK,CAAC;AACtD,QAAIsF,EAAO,KAAK,CAACtF,MAAUA,MAAU,IAAI,EAAG,QAAO;AACnD,UAAMuF,IAAOD,GACP7C,IAAO8C,EAAK,CAAC,IAAKA,EAAK,CAAC;AAC9B,aAASC,IAAI,GAAGA,IAAID,EAAK,QAAQC,KAAK;AACpC,UAAID,EAAKC,CAAC,IAAKD,EAAKC,IAAI,CAAC,MAAO/C,EAAM,QAAO;AAE/C,WAAO,EAAE,OAAO,IAAI,MAAAA,EAAA;AAAA,EACtB;AAAA,EACA,eAAeb,GAAM6D,GAAK;AAExB,QAAIC,IADST,EAAarD,EAAKA,EAAK,SAAS,CAAC,KAAK,EAAE,KAC/B;AACtB,WAAO;AAAA,MACL,OAAO;AAEL,eADA8D,KAAWD,EAAI,MACXC,KAAW,KAAK,CAAC,OAAO,SAASA,CAAO,IACnC,EAAE,OAAO,QAAW,MAAM,GAAA,IAE5B,EAAE,OAAO,GAAGA,CAAO,GAAGZ,EAAcY,CAAO,CAAC,IAAI,MAAM,GAAA;AAAA,MAC/D;AAAA,IAAA;AAAA,EAEJ;AACF,GAEaC,KAAuB,CAACC,MAAqC;AACxE,aAAWrF,KAAQsE;AACjB,IAAAe,EAAS,SAASrF,CAAI;AAE1B,GAEasF,KAA0B,CAACD,MAAqC;AAC3E,EAAAA,EAAS,cAAcP,EAAc;AACvC,GAEaS,KAAwB,CAAC5F,MAAgD;AACpF,QAAM0F,IAAW,IAAItE,EAAiB,EAAE,OAAApB,GAAO;AAC/C,SAAAyF,GAAqBC,CAAQ,GAC7BC,GAAwBD,CAAQ,GACzBA;AACT,GC9dMG,KAA2B,CAAInE,MAAoC;AACvE,MAAIT,IAAQ;AACZ,SAAO;AAAA,IACL,OAAO;AACL,UAAIS,EAAK,WAAW;AAClB,eAAO,EAAE,OAAO,QAAW,MAAM,GAAA;AAEnC,YAAM5B,IAAQ4B,EAAKT,IAAQS,EAAK,MAAM;AACtC,aAAAT,KAAS,GACF,EAAE,OAAAnB,GAAO,MAAM,GAAA;AAAA,IACxB;AAAA,EAAA;AAEJ;AAEO,MAAMgG,EAAsE;AAAA,EAMjF,eAAeC,GAAiB;AAC9B,UAAMrE,IAAOqE;AACb,SAAK,OAAOrE,GACZ,KAAK,OAAOA,EAAK,WAAW,IAAI,SAAS,eACzC,KAAK,WAAWmE,GAAyBnE,CAAI;AAAA,EAC/C;AAAA,EAEA,OAAO,SACLA,GACAsE,GACAC,GACa;AACb,UAAMC,IAAW,IAAIJ,EAAY,GAAGpE,CAAI;AACxC,WAAAwE,EAAS,OAAOF,GAChBE,EAAS,WAAWD,GACbC;AAAA,EACT;AAAA,EAEA,OAA0B;AACxB,WAAO,KAAK,SAAS,KAAA;AAAA,EACvB;AAAA,EAEA,CAAC,OAAO,QAAQ,IAAiB;AAC/B,WAAO;AAAA,EACT;AACF;AC1CA,MAAMC,IAAgB,MAChBC,KAAW,KAEXC,KAAqB,CAAIvG,OACtB;AAAA,EACL,OAAO;AACL,WAAO,EAAE,OAAAA,GAAO,MAAM,GAAA;AAAA,EACxB;AAAA,IAIE+F,IAA2B,CAAInE,MAAoC;AACvE,MAAIT,IAAQ;AACZ,SAAO;AAAA,IACL,OAAO;AACL,UAAIS,EAAK,WAAW;AAClB,eAAO,EAAE,OAAO,QAAW,MAAM,GAAA;AAEnC,YAAM5B,IAAQ4B,EAAKT,IAAQS,EAAK,MAAM;AACtC,aAAAT,KAAS,GACF,EAAE,OAAAnB,GAAO,MAAM,GAAA;AAAA,IACxB;AAAA,EAAA;AAEJ,GAEMwG,KAAiC,CAACC,GAAchE,MAAmC;AACvF,MAAIiE,IAAS;AACb,SAAO;AAAA,IACL,OAAO;AACL,aAAAA,KAAU,GAEH,EAAE,OADKD,IAAOhE,IAAOiE,GACZ,MAAM,GAAA;AAAA,IACxB;AAAA,EAAA;AAEJ,GAEMC,KAA+B,CAACF,GAAYG,MAAmC;AACnF,MAAIF,IAAS;AACb,SAAO;AAAA,IACL,OAAO;AACL,aAAAA,KAAU,GAEH,EAAE,OADK,IAAI,KAAKD,EAAK,QAAA,IAAYG,IAASF,CAAM,GACvC,MAAM,GAAA;AAAA,IACxB;AAAA,EAAA;AAEJ,GAEMG,KAA0B,CAACJ,GAAcK,MAAoC;AACjF,MAAIJ,IAAS;AACb,SAAO;AAAA,IACL,OAAO;AACL,aAAAA,KAAU,GAEH,EAAE,OADKD,IAAOK,KAASJ,GACd,MAAM,GAAA;AAAA,IACxB;AAAA,EAAA;AAEJ,GAEMK,KAAqB,CACzB7B,GACAtD,MACqB;AACrB,MAAIsD,EAAM,SAAS;AACjB,WAAOA,EAAM,QAAQ,eAAetD,GAAM,EAAE,MAAMsD,EAAM,MAAM,OAAOA,EAAM,MAAA,CAAO;AAEpF,QAAM,EAAE,MAAA3E,GAAM,YAAAyG,GAAY,MAAAvE,EAAA,IAASyC,GAC7BvC,IAASpC,EAAK,MAAM;AAC1B,MAAI0G,IAAeD;AACnB,SAAO;AAAA,IACL,OAAO;AACL,UAAIzG,EAAK,SAAS,UAAU;AAC1B,cAAM2G,IAAYD,IAAexE;AACjC,eAAIyE,KAAavE,IACR,EAAE,OAAO,QAAW,MAAM,GAAA,KAEnCsE,IAAeC,GACR,EAAE,OAAO3G,EAAK,MAAM0G,CAAY,GAAa,MAAM,GAAA;AAAA,MAC5D;AACA,aAAAA,KAAgBA,IAAexE,KAAQE,GAChC,EAAE,OAAOpC,EAAK,MAAM0G,CAAY,GAAa,MAAM,GAAA;AAAA,IAC5D;AAAA,EAAA;AAEJ,GAEME,KAAe,CAACvF,MACbA,EAAK,MAAM,CAAC5B,MAAU,OAAOA,KAAU,YAAY,OAAO,SAASA,CAAK,CAAC,GAG5EoH,KAAa,CAACxF,MACXA,EAAK,MAAM,CAAC5B,MAAUA,aAAiB,QAAQ,CAAC,OAAO,MAAMA,EAAM,QAAA,CAAS,CAAC,GAGhFqH,KAAe,CAACzF,MACbA,EAAK,MAAM,CAAC5B,MAAU,OAAOA,KAAU,QAAQ,GAGlDsH,KAAsB,CAACtH,MAAyF;AACpH,QAAMkF,IAAQ,0BAA0B,KAAKlF,CAAK;AAClD,MAAI,CAACkF;AACH,WAAO;AAET,QAAMqC,IAASrC,EAAM,CAAC,KAAK,IACrBsC,IAAStC,EAAM,CAAC,KAAK,IACrBE,IAASF,EAAM,CAAC,KAAK,IACrBC,IAAM,OAAOqC,CAAM;AACzB,MAAI,CAAC,OAAO,SAASrC,CAAG;AACtB,WAAO;AAET,QAAMsC,IAAQD,EAAO,QAAQ,KAAK,EAAE,EAAE;AACtC,SAAO,EAAE,QAAAD,GAAQ,KAAApC,GAAK,OAAAsC,GAAO,QAAArC,EAAA;AAC/B,GAEMsC,KAA+B,CACnCC,GACAlB,GACAhE,MACqB;AACrB,MAAIiE,IAAS;AACb,SAAO;AAAA,IACL,OAAO;AACL,MAAAA,KAAU;AACV,YAAMzD,IAAOwD,IAAOhE,IAAOiE,GACrBkB,IAAO3E,IAAO,IAAI,MAAM,IACxBuE,IAAS,KAAK,IAAIvE,CAAI,EAAE,WAAW,SAAS0E,EAAS,OAAO,GAAG;AACrE,aAAO,EAAE,OAAO,GAAGA,EAAS,MAAM,GAAGC,CAAI,GAAGJ,CAAM,GAAGG,EAAS,MAAM,IAAI,MAAM,GAAA;AAAA,IAChF;AAAA,EAAA;AAEJ,GAEME,IAAoC;AAAA,EACxC,CAAC,KAAK,GAAG;AAAA,EACT,CAAC,MAAM,EAAE;AAAA,EACT,CAAC,KAAK,EAAE;AAAA,EACR,CAAC,MAAM,EAAE;AAAA,EACT,CAAC,KAAK,EAAE;AAAA,EACR,CAAC,MAAM,CAAC;AAAA,EACR,CAAC,KAAK,CAAC;AAAA,EACP,CAAC,MAAM,CAAC;AAAA,EACR,CAAC,KAAK,CAAC;AACT,GAEMC,IAAU,CAAC9H,MAAiC;AAChD,MAAIA,IAAQ,KAAKA,IAAQsG;AACvB,WAAO;AAET,MAAIyB,IAAY/H,GACZgI,IAAS;AACb,aAAW,CAACC,GAAQC,CAAM,KAAKL;AAC7B,WAAOE,KAAaG;AAClB,MAAAF,KAAUC,GACVF,KAAaG;AAGjB,SAAOF;AACT,GAEMG,KAAa,CAACnI,MAAiC;AAInD,MAHIA,EAAM,WAAW,KAGjBA,MAAUA,EAAM;AAClB,WAAO;AAET,MAAI+H,IAAY/H,GACZoI,IAAQ;AACZ,aAAW,CAACH,GAAQC,CAAM,KAAKL;AAC7B,WAAOE,EAAU,WAAWE,CAAM;AAChC,MAAAG,KAASF,GACTH,IAAYA,EAAU,MAAME,EAAO,MAAM;AAG7C,MAAIF,EAAU,SAAS;AACrB,WAAO;AAET,QAAMrH,IAAYoH,EAAQM,CAAK;AAC/B,SAAI,CAAC1H,KAAaA,MAAcV,IACvB,OAEFoI;AACT,GAEMC,KAAsB,CAAC5B,GAAchE,MAAmC;AAC5E,MAAIiE,IAAS;AACb,SAAO;AAAA,IACL,OAAO;AACL,MAAAA,KAAU;AACV,YAAMzD,IAAOwD,IAAOhE,IAAOiE,GACrB4B,IAAQR,EAAQ7E,CAAI;AAC1B,aAAKqF,IAGE,EAAE,OAAOA,GAAO,MAAM,GAAA,IAFpB,EAAE,OAAO,QAAW,MAAM,GAAA;AAAA,IAGrC;AAAA,EAAA;AAEJ,GAEMC,IAAkB,CAACjD,MAA6C;AACpE,MAAIA,EAAO,SAAS;AAClB,WAAO;AAET,QAAM7C,IAAO6C,EAAO,CAAC,IAAKA,EAAO,CAAC;AAClC,WAASE,IAAI,GAAGA,IAAIF,EAAO,QAAQE,KAAK;AACtC,QAAI,KAAK,IAAIF,EAAOE,CAAC,IAAKF,EAAOE,IAAI,CAAC,IAAK/C,CAAI,IAAI4D;AACjD,aAAO;AAGX,SAAO5D;AACT,GAEM+F,KAAiB,CAAClD,MAA6C;AAInE,MAHIA,EAAO,SAAS,KAGhBA,EAAO,CAAC,MAAM;AAChB,WAAO;AAET,QAAMwB,IAAQxB,EAAO,CAAC,IAAKA,EAAO,CAAC;AACnC,WAASE,IAAI,GAAGA,IAAIF,EAAO,QAAQE,KAAK;AAItC,QAHIF,EAAOE,IAAI,CAAC,MAAM,KAGlB,KAAK,IAAIF,EAAOE,CAAC,IAAKF,EAAOE,IAAI,CAAC,IAAKsB,CAAK,IAAIT;AAClD,aAAO;AAGX,SAAOS;AACT,GAEM2B,KAAsB,CAC1B7G,MAC8D;AAC9D,QAAM8G,IAAW9G,EAAK,IAAI,CAAC5B,MAAUsH,GAAoBtH,CAAK,CAAC;AAC/D,MAAI0I,EAAS,MAAM,OAAO,GAAG;AAC3B,UAAMC,IAAQD,EAAS,CAAC,GAClBjC,IAAOiC,EAASA,EAAS,SAAS,CAAC;AAIzC,QAHoBA,EAAS;AAAA,MAC3B,CAACE,MAAUA,GAAO,WAAWD,EAAM,UAAUC,GAAO,WAAWD,EAAM;AAAA,IAAA,GAEtD;AACf,YAAMrD,IAASoD,EAAS,IAAI,CAACE,MAAUA,GAAO,OAAO,CAAC,GAChDnG,IAAO8F,EAAgBjD,CAAM;AACnC,UAAI7C,MAAS;AACX,eAAO;AAAA,UACL,MAAM;AAAA,UACN,UAAUiF;AAAA,YACR,EAAE,QAAQjB,EAAK,QAAQ,QAAQA,EAAK,QAAQ,OAAOA,EAAK,MAAA;AAAA,YACxDA,EAAK;AAAA,YACLhE;AAAA,UAAA;AAAA,QACF;AAAA,IAGN;AAAA,EACF;AAEA,QAAMoG,IAAcjH,EAAK,IAAI,CAAC5B,MAAUmI,GAAWnI,CAAK,CAAC;AACzD,MAAI6I,EAAY,MAAM,CAAC7I,MAAUA,MAAU,IAAI,GAAG;AAChD,UAAM8I,IAAUD,GACVpG,IAAO8F,EAAgBO,CAAO;AACpC,QAAIrG,MAAS,MAAM;AACjB,YAAMgE,IAAOqC,EAAQA,EAAQ,SAAS,CAAC;AACvC,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAUT,GAAoB5B,GAAMhE,CAAI;AAAA,MAAA;AAAA,IAE5C;AAAA,EACF;AAEA,SAAO;AACT,GAEMsG,KAAgB,CACpBnH,GACAgE,MAC8D;AAC9D,QAAMV,IAAQU,EAAS,MAAMhE,CAAI;AACjC,SAAKsD,IAGE;AAAA,IACL,MAAM;AAAA,IACN,UAAU6B,GAAmB7B,GAAOtD,CAAI;AAAA,EAAA,IAJjC;AAMX;AAKO,SAASoH,GACdpH,GACAqH,GACyB;AACzB,QAAMrD,IAAWqD,GAAS,YAAYnD,GAAA;AACtC,MAAIlE,EAAK,WAAW;AAClB,WAAOoE,EAAS,SAASpE,GAAM,eAAemE,EAAyBnE,CAAI,CAAC;AAE9E,MAAIA,EAAK,WAAW;AAClB,WAAOoE,EAAS,SAASpE,GAAM,QAAQ2E,GAAmB3E,EAAK,CAAC,CAAE,CAAC;AAGrE,MAAIyF,GAAazF,CAAI,GAAG;AACtB,UAAMsH,IAAeH,GAAcnH,GAAMgE,CAAQ;AACjD,QAAIsD;AACF,aAAOlD,EAAS,SAASpE,GAAMsH,EAAa,MAAMA,EAAa,QAAQ;AAEzE,UAAMC,IAAaV,GAAoB7G,CAAI;AAC3C,QAAIuH;AACF,aAAOnD,EAAS,SAASpE,GAAMuH,EAAW,MAAMA,EAAW,QAAQ;AAAA,EAEvE;AAEA,MAAIhC,GAAavF,CAAI,GAAG;AACtB,UAAMa,IAAO8F,EAAgB3G,CAAI;AACjC,QAAIa,MAAS;AACX,aAAOuD,EAAS;AAAA,QACdpE;AAAA,QACA;AAAA,QACA4E,GAA+B5E,EAAKA,EAAK,SAAS,CAAC,GAAIa,CAAI;AAAA,MAAA;AAG/D,UAAMqE,IAAQ0B,GAAe5G,CAAI;AACjC,QAAIkF,MAAU;AACZ,aAAOd,EAAS;AAAA,QACdpE;AAAA,QACA;AAAA,QACAiF,GAAwBjF,EAAKA,EAAK,SAAS,CAAC,GAAIkF,CAAK;AAAA,MAAA;AAAA,EAG3D;AAEA,MAAIM,GAAWxF,CAAI,GAAG;AACpB,UAAMwH,IAAQxH,EAAK,IAAI,CAAC5B,MAAUA,EAAM,SAAS,GAC3CyC,IAAO8F,EAAgBa,CAAK;AAClC,QAAI3G,MAAS;AACX,aAAOuD,EAAS;AAAA,QACdpE;AAAA,QACA;AAAA,QACA+E,GAA6B/E,EAAKA,EAAK,SAAS,CAAC,GAAIa,CAAI;AAAA,MAAA;AAAA,EAG/D;AAEA,SAAOuD,EAAS,SAASpE,GAAM,eAAemE,EAAyBnE,CAAI,CAAC;AAC9E;"}

package/dist/infer.d.ts

@@ -0,0 +1,11 @@
+import { Sequence } from './sequence';
+import type { SequenceRegistry } from './registry';
+export declare function inferSequence(seed: readonly number[], options?: {
+    registry?: SequenceRegistry;
+}): Sequence<number>;
+export declare function inferSequence(seed: readonly Date[], options?: {
+    registry?: SequenceRegistry;
+}): Sequence<Date>;
+export declare function inferSequence(seed: readonly string[], options?: {
+    registry?: SequenceRegistry;
+}): Sequence<string>;

package/dist/registry.d.ts

@@ -0,0 +1,53 @@
+export type SequenceListMode = 'cycle' | 'finite';
+export type SequenceList = {
+    id: string;
+    mode: SequenceListMode;
+    langs: readonly string[];
+    items: readonly string[];
+    aliases?: Record<string, string>;
+};
+export type SequenceMatch = {
+    id: string;
+    langs?: readonly string[];
+    match(seed: readonly string[]): {
+        score: number;
+        startIndex?: number;
+        step?: number;
+        state?: unknown;
+    } | null;
+    createIterator(seed: readonly string[], ctx: {
+        step: number;
+        state?: unknown;
+    }): Iterator<string>;
+};
+export type RegistryQuery = {
+    enabledIds?: readonly string[];
+    queryText?: string;
+};
+export type SequenceMatchResult = {
+    kind: 'list';
+    list: SequenceList;
+    startIndex: number;
+    step: number;
+} | {
+    kind: 'matcher';
+    matcher: SequenceMatch;
+    step: number;
+    state?: unknown;
+};
+export declare class SequenceRegistry {
+    readonly langs: readonly string[];
+    private lists;
+    private matchers;
+    constructor(opts?: {
+        langs?: readonly string[];
+    });
+    register(list: SequenceList): void;
+    registerMatch(matcher: SequenceMatch): void;
+    unregister(id: string): void;
+    list(query?: RegistryQuery): SequenceList[];
+    match(seed: readonly string[], query?: RegistryQuery): SequenceMatchResult | null;
+    private inferStep;
+    private stepBetween;
+    private nextIndex;
+}

package/dist/sequence.d.ts

@@ -0,0 +1,10 @@
+import type { SequenceKind, SequenceValue } from './types';
+export declare class Sequence<T extends SequenceValue> implements Iterable<T>, Iterator<T> {
+    readonly seed: readonly T[];
+    kind: SequenceKind;
+    private iterator;
+    constructor(...seed: T[]);
+    static fromSeed<T extends SequenceValue>(seed: readonly T[], kind: SequenceKind, iterator: Iterator<T>): Sequence<T>;
+    next(): IteratorResult<T>;
+    [Symbol.iterator](): Iterator<T>;
+}

package/dist/types.d.ts

@@ -0,0 +1,6 @@
+import type { SequenceRegistry } from './registry';
+export type SequenceValue = string | number | Date;
+export type SequenceKind = 'copy' | 'list' | 'arithmetic' | 'geometric' | 'seed-repeat';
+export type InferOptions = {
+    registry?: SequenceRegistry;
+};

package/package.json

@@ -0,0 +1,40 @@
+{
+  "name": "@extable/sequence",
+  "version": "0.1.0",
+  "type": "module",
+  "main": "./dist/index.js",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json --emitDeclarationOnly && vite build",
+    "test": "vitest run",
+    "lint": "biome lint .",
+    "format": "biome format --write ."
+  },
+  "devDependencies": {
+    "typescript": "^5.6.3"
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/shibukawa/extable.git"
+  },
+  "homepage": "https://shibukawa.github.io/extable/",
+  "author": "Yoshiki Shibukawa",
+  "license": "Apache-2.0",
+  "peerDependencies": {}
+}