@tombcato/smart-ticker 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 tombcato
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,164 @@
+<p align="center">
+  <img src="./public/logo.svg#gh-light-mode-only" alt="Smart Ticker" width="120" />
+  <img src="./public/logo-dark.svg#gh-dark-mode-only" alt="Smart Ticker" width="120" />
+</p>
+
+<h1 align="center">Smart Ticker</h1>
+
+<p align="center">
+  高性能智能文本差异滚动组件，基于 Levenshtein diff 算法，支持多字符集，适用于React/Vue
+</p>
+
+<p align="center">
+  <img src="./smartticker.gif" alt="Demo" width="600" />
+</p>
+
+<p align="center">
+  <img src="https://img.shields.io/badge/React-18+-61DAFB?logo=react" alt="React" />
+  <img src="https://img.shields.io/badge/Vue-3+-4FC08D?logo=vuedotjs" alt="Vue" />
+  <img src="https://img.shields.io/badge/TypeScript-5+-3178C6?logo=typescript" alt="TypeScript" />
+  <img src="https://img.shields.io/npm/v/@tombcato/smart-ticker?color=cb3837&logo=npm" alt="npm" />
+</p>
+
+<p align="center">
+  <a href="https://tombcato.github.io/smart-ticker/">📺 官网演示</a> ·
+  <a href="https://www.npmjs.com/package/@tombcato/smart-ticker">📥 NPM</a>
+</p>
+
+## ✨ 特性
+
+- **智能差异动画** - 只有变化的字符会滚动，相同的字符保持静止
+- **平滑中断** - 动画过程中值变化时，从当前位置无缝衔接到新目标
+- **多种缓动曲线** - 支持 `linear`、`easeInOut`、`bounce` 等多种动画效果
+- **字符宽度可调** - 通过 `charWidth` 属性控制字符间距
+- **多字符集支持** - 支持数字、字母、符号等多种字符集，可混合使用
+- **双框架支持** - 提供 React 组件和 Vue 组件
+- **高性能** - 使用 `requestAnimationFrame` 和 `React.memo` 优化渲染
+
+## 📦 安装
+
+### NPM 安装（推荐）
+
+```bash
+npm install @tombcato/smart-ticker
+```
+
+### 从源码安装
+
+```bash
+# 克隆仓库
+git clone https://github.com/tombcato/smart-ticker.git
+
+# 安装依赖
+cd smart-ticker
+npm install
+
+# 启动开发服务器
+npm run dev
+```
+
+## 🚀 使用方法
+
+### React
+
+```tsx
+import { Ticker } from './components/Ticker';
+
+function App() {
+  const [price, setPrice] = useState(73.18);
+
+  return (
+    <Ticker
+      value={price.toFixed(2)}
+      duration={800}
+      easing="easeInOut"
+      charWidth={1}
+      characterLists={['0123456789.,']}
+    />
+  );
+}
+```
+
+### Vue
+
+```vue
+<template>
+  <Ticker
+    :value="price"
+    :duration="800"
+    easing="easeInOut"
+    :char-width="1"
+    :character-lists="['0123456789.,']"
+  />
+</template>
+
+<script setup>
+import Ticker from './components/vue/Ticker.vue';
+import { ref } from 'vue';
+
+const price = ref('73.18');
+</script>
+```
+
+## ⚙️ API
+
+### Props
+
+| 属性 | 类型 | 默认值 | 说明 |
+|------|------|--------|------|
+| `value` | `string` | - | 要显示的文本值（必填） |
+| `duration` | `number` | `500` | 动画持续时间（毫秒） |
+| `easing` | `string` | `'easeInOut'` | 缓动函数：`linear`、`easeIn`、`easeOut`、`easeInOut`、`bounce` |
+| `direction` | `string` | `'ANY'` | 滚动方向：`UP`、`DOWN`、`ANY`（自动选择最短路径） |
+| `charWidth` | `number` | `1` | 字符宽度倍率（基准为 0.8em） |
+| `characterLists` | `string[]` | `['0123456789']` | 支持的字符列表 |
+| `className` | `string` | `''` | 自定义 CSS 类名 |
+
+### 内置字符列表
+
+```ts
+import { TickerUtils } from './components/Ticker';
+
+TickerUtils.provideNumberList()        // '0123456789'
+TickerUtils.provideAlphabeticalList()  // 'abcdefghijklmnopqrstuvwxyz'
+TickerUtils.provideHexadecimalList()   // '0123456789ABCDEF'
+```
+
+## 🎨 示例场景
+
+- **金融数据** - 股票价格、加密货币行情
+- **计数器** - 访问量、点赞数
+- **比分牌** - 体育比赛实时比分
+- **机场信息牌** - 航班号、登机口
+- **隐私模式** - 余额隐藏/显示切换
+
+## 📁 项目结构
+
+```
+ticker-smart-text-diff/
+├── src/
+│   ├── components/
+│   │   ├── Ticker.tsx      # React 组件
+│   │   ├── Ticker.css      # 组件样式
+│   │   └── vue/
+│   │       └── Ticker.vue  # Vue 组件
+│   ├── core/
+│   │   └── TickerCore.ts   # 核心逻辑（框架无关）
+│   ├── App.tsx             # React Demo
+│   └── App.css             # Demo 样式
+├── public/
+│   └── vue-demo.html       # Vue CDN Demo
+└── package.json
+```
+
+## 🔧 技术栈
+
+- **构建工具**: Vite
+- **语言**: TypeScript
+- **框架**: React 18 / Vue 3
+- **样式**: CSS Variables + 响应式设计
+
+## 📄 License
+
+MIT
+

package/dist/TickerCore-DDdYkrsq.js

@@ -0,0 +1,244 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+const EMPTY_CHAR = "\0";
+const TickerUtils = {
+  provideNumberList: () => "0123456789",
+  provideAlphabeticalList: () => "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
+};
+class TickerCharacterList {
+  constructor(characterList) {
+    __publicField(this, "numOriginalCharacters");
+    __publicField(this, "characterList");
+    __publicField(this, "characterIndicesMap");
+    const charsArray = characterList.split("");
+    const length = charsArray.length;
+    this.numOriginalCharacters = length;
+    this.characterIndicesMap = /* @__PURE__ */ new Map();
+    for (let i = 0; i < length; i++) {
+      this.characterIndicesMap.set(charsArray[i], i);
+    }
+    this.characterList = new Array(length * 2 + 1);
+    this.characterList[0] = EMPTY_CHAR;
+    for (let i = 0; i < length; i++) {
+      this.characterList[1 + i] = charsArray[i];
+      this.characterList[1 + length + i] = charsArray[i];
+    }
+  }
+  getCharacterIndices(start, end, direction) {
+    let startIndex = this.getIndexOfChar(start);
+    let endIndex = this.getIndexOfChar(end);
+    if (startIndex < 0 || endIndex < 0) return null;
+    switch (direction) {
+      case "DOWN":
+        if (end === EMPTY_CHAR) {
+          endIndex = this.characterList.length;
+        } else if (endIndex < startIndex) {
+          endIndex += this.numOriginalCharacters;
+        }
+        break;
+      case "UP":
+        if (startIndex < endIndex) {
+          startIndex += this.numOriginalCharacters;
+        }
+        break;
+      case "ANY":
+        if (start !== EMPTY_CHAR && end !== EMPTY_CHAR) {
+          if (endIndex < startIndex) {
+            const nonWrap = startIndex - endIndex;
+            const wrap = this.numOriginalCharacters - startIndex + endIndex;
+            if (wrap < nonWrap) endIndex += this.numOriginalCharacters;
+          } else if (startIndex < endIndex) {
+            const nonWrap = endIndex - startIndex;
+            const wrap = this.numOriginalCharacters - endIndex + startIndex;
+            if (wrap < nonWrap) startIndex += this.numOriginalCharacters;
+          }
+        }
+        break;
+    }
+    return { startIndex, endIndex };
+  }
+  getSupportedCharacters() {
+    return new Set(this.characterIndicesMap.keys());
+  }
+  getCharacterList() {
+    return this.characterList;
+  }
+  getIndexOfChar(c) {
+    if (c === EMPTY_CHAR) return 0;
+    if (this.characterIndicesMap.has(c)) return this.characterIndicesMap.get(c) + 1;
+    return -1;
+  }
+}
+const ACTION_SAME = 0;
+const ACTION_INSERT = 1;
+const ACTION_DELETE = 2;
+function computeColumnActions(source, target, supported) {
+  let si = 0, ti = 0;
+  const actions = [];
+  while (true) {
+    const endS = si === source.length;
+    const endT = ti === target.length;
+    if (endS && endT) break;
+    if (endS) {
+      for (; ti < target.length; ti++) actions.push(ACTION_INSERT);
+      break;
+    }
+    if (endT) {
+      for (; si < source.length; si++) actions.push(ACTION_DELETE);
+      break;
+    }
+    const sSupp = supported.has(source[si]);
+    const tSupp = supported.has(target[ti]);
+    if (sSupp && tSupp) {
+      let se = si + 1, te = ti + 1;
+      while (se < source.length && supported.has(source[se])) se++;
+      while (te < target.length && supported.has(target[te])) te++;
+      const sLen = se - si, tLen = te - ti;
+      if (sLen === tLen) {
+        for (let i = 0; i < sLen; i++) actions.push(ACTION_SAME);
+      } else {
+        const matrix = Array(sLen + 1).fill(null).map(() => Array(tLen + 1).fill(0));
+        for (let i = 0; i <= sLen; i++) matrix[i][0] = i;
+        for (let j = 0; j <= tLen; j++) matrix[0][j] = j;
+        for (let r2 = 1; r2 <= sLen; r2++) {
+          for (let c2 = 1; c2 <= tLen; c2++) {
+            const cost = source[si + r2 - 1] === target[ti + c2 - 1] ? 0 : 1;
+            matrix[r2][c2] = Math.min(matrix[r2 - 1][c2] + 1, matrix[r2][c2 - 1] + 1, matrix[r2 - 1][c2 - 1] + cost);
+          }
+        }
+        const result = [];
+        let r = sLen, c = tLen;
+        while (r > 0 || c > 0) {
+          if (r === 0) {
+            result.push(ACTION_INSERT);
+            c--;
+          } else if (c === 0) {
+            result.push(ACTION_DELETE);
+            r--;
+          } else {
+            const ins = matrix[r][c - 1], del = matrix[r - 1][c], rep = matrix[r - 1][c - 1];
+            if (ins < del && ins < rep) {
+              result.push(ACTION_INSERT);
+              c--;
+            } else if (del < rep) {
+              result.push(ACTION_DELETE);
+              r--;
+            } else {
+              result.push(ACTION_SAME);
+              r--;
+              c--;
+            }
+          }
+        }
+        for (let i = result.length - 1; i >= 0; i--) actions.push(result[i]);
+      }
+      si = se;
+      ti = te;
+    } else if (sSupp) {
+      actions.push(ACTION_INSERT);
+      ti++;
+    } else if (tSupp) {
+      actions.push(ACTION_DELETE);
+      si++;
+    } else {
+      actions.push(ACTION_SAME);
+      si++;
+      ti++;
+    }
+  }
+  return actions;
+}
+function createColumn() {
+  return {
+    currentChar: EMPTY_CHAR,
+    targetChar: EMPTY_CHAR,
+    charList: null,
+    startIndex: 0,
+    endIndex: 0,
+    sourceWidth: 0,
+    currentWidth: 0,
+    targetWidth: 0,
+    directionAdj: 1,
+    prevDelta: 0,
+    currDelta: 0
+  };
+}
+function setTarget(col, target, lists, dir) {
+  const c = { ...col };
+  c.targetChar = target;
+  c.sourceWidth = c.currentWidth;
+  c.targetWidth = target === EMPTY_CHAR ? 0 : 1;
+  let found = false;
+  for (const list of lists) {
+    const indices = list.getCharacterIndices(c.currentChar, target, dir);
+    if (indices) {
+      c.charList = list.getCharacterList();
+      c.startIndex = indices.startIndex;
+      c.endIndex = indices.endIndex;
+      found = true;
+      break;
+    }
+  }
+  if (!found) {
+    c.charList = c.currentChar === target ? [c.currentChar] : [c.currentChar, target];
+    c.startIndex = 0;
+    c.endIndex = c.currentChar === target ? 0 : 1;
+  }
+  c.directionAdj = c.endIndex >= c.startIndex ? 1 : -1;
+  c.prevDelta = c.currDelta;
+  c.currDelta = 0;
+  return c;
+}
+function applyProgress(col, progress, forceUpdate = false) {
+  const c = { ...col };
+  const total = Math.abs(c.endIndex - c.startIndex);
+  const pos = progress * total;
+  const offset = pos - Math.floor(pos);
+  const additional = c.prevDelta * (1 - progress);
+  const delta = offset * c.directionAdj + additional;
+  const charIdx = c.startIndex + Math.floor(pos) * c.directionAdj;
+  if (progress >= 1) {
+    c.currentChar = c.targetChar;
+    c.currDelta = 0;
+    c.prevDelta = 0;
+  } else if (forceUpdate && c.charList && charIdx >= 0 && charIdx < c.charList.length) {
+    c.currentChar = c.charList[charIdx];
+    c.currDelta = delta;
+  }
+  c.currentWidth = c.sourceWidth + (c.targetWidth - c.sourceWidth) * progress;
+  return { col: c, charIdx, delta };
+}
+const easingFunctions = {
+  linear: (t) => t,
+  easeIn: (t) => t * t,
+  easeOut: (t) => 1 - (1 - t) * (1 - t),
+  easeInOut: (t) => t < 0.5 ? 2 * t * t : 1 - Math.pow(-2 * t + 2, 2) / 2,
+  bounce: (t) => {
+    const n1 = 7.5625;
+    const d1 = 2.75;
+    if (t < 1 / d1) {
+      return n1 * t * t;
+    } else if (t < 2 / d1) {
+      return n1 * (t -= 1.5 / d1) * t + 0.75;
+    } else if (t < 2.5 / d1) {
+      return n1 * (t -= 2.25 / d1) * t + 0.9375;
+    } else {
+      return n1 * (t -= 2.625 / d1) * t + 0.984375;
+    }
+  }
+};
+export {
+  ACTION_INSERT as A,
+  EMPTY_CHAR as E,
+  TickerUtils as T,
+  TickerCharacterList as a,
+  applyProgress as b,
+  computeColumnActions as c,
+  createColumn as d,
+  ACTION_SAME as e,
+  easingFunctions as f,
+  ACTION_DELETE as g,
+  setTarget as s
+};
+//# sourceMappingURL=TickerCore-DDdYkrsq.js.map

package/dist/TickerCore-DDdYkrsq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TickerCore-DDdYkrsq.js","sources":["../src/core/TickerCore.ts"],"sourcesContent":["// ============================================================================\r\n// Constants\r\n// ============================================================================\r\nexport const EMPTY_CHAR = '\\0';\r\n\r\nexport const TickerUtils = {\r\n    provideNumberList: () => '0123456789',\r\n    provideAlphabeticalList: () => 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ',\r\n};\r\n\r\nexport type ScrollingDirection = 'ANY' | 'UP' | 'DOWN';\r\n\r\n// ============================================================================\r\n// TickerCharacterList\r\n// ============================================================================\r\nexport class TickerCharacterList {\r\n    private numOriginalCharacters: number;\r\n    private characterList: string[];\r\n    private characterIndicesMap: Map<string, number>;\r\n\r\n    constructor(characterList: string) {\r\n        const charsArray = characterList.split('');\r\n        const length = charsArray.length;\r\n        this.numOriginalCharacters = length;\r\n        this.characterIndicesMap = new Map();\r\n\r\n        for (let i = 0; i < length; i++) {\r\n            this.characterIndicesMap.set(charsArray[i], i);\r\n        }\r\n\r\n        this.characterList = new Array(length * 2 + 1);\r\n        this.characterList[0] = EMPTY_CHAR;\r\n        for (let i = 0; i < length; i++) {\r\n            this.characterList[1 + i] = charsArray[i];\r\n            this.characterList[1 + length + i] = charsArray[i];\r\n        }\r\n    }\r\n\r\n    getCharacterIndices(\r\n        start: string,\r\n        end: string,\r\n        direction: ScrollingDirection\r\n    ): { startIndex: number; endIndex: number } | null {\r\n        let startIndex = this.getIndexOfChar(start);\r\n        let endIndex = this.getIndexOfChar(end);\r\n\r\n        if (startIndex < 0 || endIndex < 0) return null;\r\n\r\n        switch (direction) {\r\n            case 'DOWN':\r\n                if (end === EMPTY_CHAR) {\r\n                    endIndex = this.characterList.length;\r\n                } else if (endIndex < startIndex) {\r\n                    endIndex += this.numOriginalCharacters;\r\n                }\r\n                break;\r\n            case 'UP':\r\n                if (startIndex < endIndex) {\r\n                    startIndex += this.numOriginalCharacters;\r\n                }\r\n                break;\r\n            case 'ANY':\r\n                if (start !== EMPTY_CHAR && end !== EMPTY_CHAR) {\r\n                    if (endIndex < startIndex) {\r\n                        const nonWrap = startIndex - endIndex;\r\n                        const wrap = this.numOriginalCharacters - startIndex + endIndex;\r\n                        if (wrap < nonWrap) endIndex += this.numOriginalCharacters;\r\n                    } else if (startIndex < endIndex) {\r\n                        const nonWrap = endIndex - startIndex;\r\n                        const wrap = this.numOriginalCharacters - endIndex + startIndex;\r\n                        if (wrap < nonWrap) startIndex += this.numOriginalCharacters;\r\n                    }\r\n                }\r\n                break;\r\n        }\r\n        return { startIndex, endIndex };\r\n    }\r\n\r\n    getSupportedCharacters(): Set<string> {\r\n        return new Set(this.characterIndicesMap.keys());\r\n    }\r\n\r\n    getCharacterList(): string[] {\r\n        return this.characterList;\r\n    }\r\n\r\n    private getIndexOfChar(c: string): number {\r\n        if (c === EMPTY_CHAR) return 0;\r\n        if (this.characterIndicesMap.has(c)) return this.characterIndicesMap.get(c)! + 1;\r\n        return -1;\r\n    }\r\n}\r\n\r\n// ============================================================================\r\n// Levenshtein\r\n// ============================================================================\r\nexport const ACTION_SAME = 0;\r\nexport const ACTION_INSERT = 1;\r\nexport const ACTION_DELETE = 2;\r\n\r\nexport function computeColumnActions(source: string[], target: string[], supported: Set<string>): number[] {\r\n    let si = 0, ti = 0;\r\n    const actions: number[] = [];\r\n\r\n    while (true) {\r\n        const endS = si === source.length;\r\n        const endT = ti === target.length;\r\n        if (endS && endT) break;\r\n        if (endS) { for (; ti < target.length; ti++) actions.push(ACTION_INSERT); break; }\r\n        if (endT) { for (; si < source.length; si++) actions.push(ACTION_DELETE); break; }\r\n\r\n        const sSupp = supported.has(source[si]);\r\n        const tSupp = supported.has(target[ti]);\r\n\r\n        if (sSupp && tSupp) {\r\n            let se = si + 1, te = ti + 1;\r\n            while (se < source.length && supported.has(source[se])) se++;\r\n            while (te < target.length && supported.has(target[te])) te++;\r\n\r\n            const sLen = se - si, tLen = te - ti;\r\n            if (sLen === tLen) {\r\n                for (let i = 0; i < sLen; i++) actions.push(ACTION_SAME);\r\n            } else {\r\n                const matrix: number[][] = Array(sLen + 1).fill(null).map(() => Array(tLen + 1).fill(0));\r\n                for (let i = 0; i <= sLen; i++) matrix[i][0] = i;\r\n                for (let j = 0; j <= tLen; j++) matrix[0][j] = j;\r\n                for (let r = 1; r <= sLen; r++) {\r\n                    for (let c = 1; c <= tLen; c++) {\r\n                        const cost = source[si + r - 1] === target[ti + c - 1] ? 0 : 1;\r\n                        matrix[r][c] = Math.min(matrix[r - 1][c] + 1, matrix[r][c - 1] + 1, matrix[r - 1][c - 1] + cost);\r\n                    }\r\n                }\r\n                const result: number[] = [];\r\n                let r = sLen, c = tLen;\r\n                while (r > 0 || c > 0) {\r\n                    if (r === 0) { result.push(ACTION_INSERT); c--; }\r\n                    else if (c === 0) { result.push(ACTION_DELETE); r--; }\r\n                    else {\r\n                        const ins = matrix[r][c - 1], del = matrix[r - 1][c], rep = matrix[r - 1][c - 1];\r\n                        if (ins < del && ins < rep) { result.push(ACTION_INSERT); c--; }\r\n                        else if (del < rep) { result.push(ACTION_DELETE); r--; }\r\n                        else { result.push(ACTION_SAME); r--; c--; }\r\n                    }\r\n                }\r\n                for (let i = result.length - 1; i >= 0; i--) actions.push(result[i]);\r\n            }\r\n            si = se; ti = te;\r\n        } else if (sSupp) { actions.push(ACTION_INSERT); ti++; }\r\n        else if (tSupp) { actions.push(ACTION_DELETE); si++; }\r\n        else { actions.push(ACTION_SAME); si++; ti++; }\r\n    }\r\n    return actions;\r\n}\r\n\r\n// ============================================================================\r\n// Column State\r\n// ============================================================================\r\nexport interface ColumnState {\r\n    currentChar: string;\r\n    targetChar: string;\r\n    charList: string[] | null;\r\n    startIndex: number;\r\n    endIndex: number;\r\n    sourceWidth: number;\r\n    currentWidth: number;\r\n    targetWidth: number;\r\n    directionAdj: number;\r\n    prevDelta: number;\r\n    currDelta: number;\r\n}\r\n\r\nexport function createColumn(): ColumnState {\r\n    return {\r\n        currentChar: EMPTY_CHAR, targetChar: EMPTY_CHAR, charList: null,\r\n        startIndex: 0, endIndex: 0, sourceWidth: 0, currentWidth: 0, targetWidth: 0,\r\n        directionAdj: 1, prevDelta: 0, currDelta: 0,\r\n    };\r\n}\r\n\r\nexport function setTarget(col: ColumnState, target: string, lists: TickerCharacterList[], dir: ScrollingDirection): ColumnState {\r\n    const c = { ...col };\r\n    c.targetChar = target;\r\n    c.sourceWidth = c.currentWidth;\r\n    c.targetWidth = target === EMPTY_CHAR ? 0 : 1;\r\n\r\n    let found = false;\r\n    for (const list of lists) {\r\n        const indices = list.getCharacterIndices(c.currentChar, target, dir);\r\n        if (indices) {\r\n            c.charList = list.getCharacterList();\r\n            c.startIndex = indices.startIndex;\r\n            c.endIndex = indices.endIndex;\r\n            found = true;\r\n            break;\r\n        }\r\n    }\r\n    if (!found) {\r\n        c.charList = c.currentChar === target ? [c.currentChar] : [c.currentChar, target];\r\n        c.startIndex = 0;\r\n        c.endIndex = c.currentChar === target ? 0 : 1;\r\n    }\r\n\r\n    c.directionAdj = c.endIndex >= c.startIndex ? 1 : -1;\r\n    c.prevDelta = c.currDelta;\r\n    c.currDelta = 0;\r\n    return c;\r\n}\r\n\r\nexport function applyProgress(col: ColumnState, progress: number, forceUpdate = false): { col: ColumnState; charIdx: number; delta: number } {\r\n    const c = { ...col };\r\n    const total = Math.abs(c.endIndex - c.startIndex);\r\n    const pos = progress * total;\r\n    const offset = pos - Math.floor(pos);\r\n    const additional = c.prevDelta * (1 - progress);\r\n    const delta = offset * c.directionAdj + additional;\r\n    const charIdx = c.startIndex + Math.floor(pos) * c.directionAdj;\r\n\r\n    if (progress >= 1) {\r\n        c.currentChar = c.targetChar;\r\n        c.currDelta = 0;\r\n        c.prevDelta = 0;\r\n    } else if (forceUpdate && c.charList && charIdx >= 0 && charIdx < c.charList.length) {\r\n        c.currentChar = c.charList[charIdx];\r\n        c.currDelta = delta;\r\n    }\r\n\r\n    c.currentWidth = c.sourceWidth + (c.targetWidth - c.sourceWidth) * progress;\r\n    return { col: c, charIdx, delta };\r\n}\r\n\r\n// ============================================================================\r\n// Easing Functions\r\n// ============================================================================\r\nexport const easingFunctions: Record<string, (t: number) => number> = {\r\n    linear: (t) => t,\r\n    easeIn: (t) => t * t,\r\n    easeOut: (t) => 1 - (1 - t) * (1 - t),\r\n    easeInOut: (t) => t < 0.5 ? 2 * t * t : 1 - Math.pow(-2 * t + 2, 2) / 2,\r\n    bounce: (t) => {\r\n        const n1 = 7.5625;\r\n        const d1 = 2.75;\r\n        if (t < 1 / d1) {\r\n            return n1 * t * t;\r\n        } else if (t < 2 / d1) {\r\n            return n1 * (t -= 1.5 / d1) * t + 0.75;\r\n        } else if (t < 2.5 / d1) {\r\n            return n1 * (t -= 2.25 / d1) * t + 0.9375;\r\n        } else {\r\n            return n1 * (t -= 2.625 / d1) * t + 0.984375;\r\n        }\r\n    },\r\n};\r\n"],"names":["r","c"],"mappings":";;;AAGO,MAAM,aAAa;AAEnB,MAAM,cAAc;AAAA,EACvB,mBAAmB,MAAM;AAAA,EACzB,yBAAyB,MAAM;AACnC;AAOO,MAAM,oBAAoB;AAAA,EAK7B,YAAY,eAAuB;AAJ3B;AACA;AACA;AAGJ,UAAM,aAAa,cAAc,MAAM,EAAE;AACzC,UAAM,SAAS,WAAW;AAC1B,SAAK,wBAAwB;AAC7B,SAAK,0CAA0B,IAAA;AAE/B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,WAAK,oBAAoB,IAAI,WAAW,CAAC,GAAG,CAAC;AAAA,IACjD;AAEA,SAAK,gBAAgB,IAAI,MAAM,SAAS,IAAI,CAAC;AAC7C,SAAK,cAAc,CAAC,IAAI;AACxB,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,WAAK,cAAc,IAAI,CAAC,IAAI,WAAW,CAAC;AACxC,WAAK,cAAc,IAAI,SAAS,CAAC,IAAI,WAAW,CAAC;AAAA,IACrD;AAAA,EACJ;AAAA,EAEA,oBACI,OACA,KACA,WAC+C;AAC/C,QAAI,aAAa,KAAK,eAAe,KAAK;AAC1C,QAAI,WAAW,KAAK,eAAe,GAAG;AAEtC,QAAI,aAAa,KAAK,WAAW,EAAG,QAAO;AAE3C,YAAQ,WAAA;AAAA,MACJ,KAAK;AACD,YAAI,QAAQ,YAAY;AACpB,qBAAW,KAAK,cAAc;AAAA,QAClC,WAAW,WAAW,YAAY;AAC9B,sBAAY,KAAK;AAAA,QACrB;AACA;AAAA,MACJ,KAAK;AACD,YAAI,aAAa,UAAU;AACvB,wBAAc,KAAK;AAAA,QACvB;AACA;AAAA,MACJ,KAAK;AACD,YAAI,UAAU,cAAc,QAAQ,YAAY;AAC5C,cAAI,WAAW,YAAY;AACvB,kBAAM,UAAU,aAAa;AAC7B,kBAAM,OAAO,KAAK,wBAAwB,aAAa;AACvD,gBAAI,OAAO,QAAS,aAAY,KAAK;AAAA,UACzC,WAAW,aAAa,UAAU;AAC9B,kBAAM,UAAU,WAAW;AAC3B,kBAAM,OAAO,KAAK,wBAAwB,WAAW;AACrD,gBAAI,OAAO,QAAS,eAAc,KAAK;AAAA,UAC3C;AAAA,QACJ;AACA;AAAA,IAAA;AAER,WAAO,EAAE,YAAY,SAAA;AAAA,EACzB;AAAA,EAEA,yBAAsC;AAClC,WAAO,IAAI,IAAI,KAAK,oBAAoB,MAAM;AAAA,EAClD;AAAA,EAEA,mBAA6B;AACzB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEQ,eAAe,GAAmB;AACtC,QAAI,MAAM,WAAY,QAAO;AAC7B,QAAI,KAAK,oBAAoB,IAAI,CAAC,UAAU,KAAK,oBAAoB,IAAI,CAAC,IAAK;AAC/E,WAAO;AAAA,EACX;AACJ;AAKO,MAAM,cAAc;AACpB,MAAM,gBAAgB;AACtB,MAAM,gBAAgB;AAEtB,SAAS,qBAAqB,QAAkB,QAAkB,WAAkC;AACvG,MAAI,KAAK,GAAG,KAAK;AACjB,QAAM,UAAoB,CAAA;AAE1B,SAAO,MAAM;AACT,UAAM,OAAO,OAAO,OAAO;AAC3B,UAAM,OAAO,OAAO,OAAO;AAC3B,QAAI,QAAQ,KAAM;AAClB,QAAI,MAAM;AAAE,aAAO,KAAK,OAAO,QAAQ,KAAM,SAAQ,KAAK,aAAa;AAAG;AAAA,IAAO;AACjF,QAAI,MAAM;AAAE,aAAO,KAAK,OAAO,QAAQ,KAAM,SAAQ,KAAK,aAAa;AAAG;AAAA,IAAO;AAEjF,UAAM,QAAQ,UAAU,IAAI,OAAO,EAAE,CAAC;AACtC,UAAM,QAAQ,UAAU,IAAI,OAAO,EAAE,CAAC;AAEtC,QAAI,SAAS,OAAO;AAChB,UAAI,KAAK,KAAK,GAAG,KAAK,KAAK;AAC3B,aAAO,KAAK,OAAO,UAAU,UAAU,IAAI,OAAO,EAAE,CAAC,EAAG;AACxD,aAAO,KAAK,OAAO,UAAU,UAAU,IAAI,OAAO,EAAE,CAAC,EAAG;AAExD,YAAM,OAAO,KAAK,IAAI,OAAO,KAAK;AAClC,UAAI,SAAS,MAAM;AACf,iBAAS,IAAI,GAAG,IAAI,MAAM,IAAK,SAAQ,KAAK,WAAW;AAAA,MAC3D,OAAO;AACH,cAAM,SAAqB,MAAM,OAAO,CAAC,EAAE,KAAK,IAAI,EAAE,IAAI,MAAM,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;AACvF,iBAAS,IAAI,GAAG,KAAK,MAAM,IAAK,QAAO,CAAC,EAAE,CAAC,IAAI;AAC/C,iBAAS,IAAI,GAAG,KAAK,MAAM,IAAK,QAAO,CAAC,EAAE,CAAC,IAAI;AAC/C,iBAASA,KAAI,GAAGA,MAAK,MAAMA,MAAK;AAC5B,mBAASC,KAAI,GAAGA,MAAK,MAAMA,MAAK;AAC5B,kBAAM,OAAO,OAAO,KAAKD,KAAI,CAAC,MAAM,OAAO,KAAKC,KAAI,CAAC,IAAI,IAAI;AAC7D,mBAAOD,EAAC,EAAEC,EAAC,IAAI,KAAK,IAAI,OAAOD,KAAI,CAAC,EAAEC,EAAC,IAAI,GAAG,OAAOD,EAAC,EAAEC,KAAI,CAAC,IAAI,GAAG,OAAOD,KAAI,CAAC,EAAEC,KAAI,CAAC,IAAI,IAAI;AAAA,UACnG;AAAA,QACJ;AACA,cAAM,SAAmB,CAAA;AACzB,YAAI,IAAI,MAAM,IAAI;AAClB,eAAO,IAAI,KAAK,IAAI,GAAG;AACnB,cAAI,MAAM,GAAG;AAAE,mBAAO,KAAK,aAAa;AAAG;AAAA,UAAK,WACvC,MAAM,GAAG;AAAE,mBAAO,KAAK,aAAa;AAAG;AAAA,UAAK,OAChD;AACD,kBAAM,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC;AAC/E,gBAAI,MAAM,OAAO,MAAM,KAAK;AAAE,qBAAO,KAAK,aAAa;AAAG;AAAA,YAAK,WACtD,MAAM,KAAK;AAAE,qBAAO,KAAK,aAAa;AAAG;AAAA,YAAK,OAClD;AAAE,qBAAO,KAAK,WAAW;AAAG;AAAK;AAAA,YAAK;AAAA,UAC/C;AAAA,QACJ;AACA,iBAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,IAAK,SAAQ,KAAK,OAAO,CAAC,CAAC;AAAA,MACvE;AACA,WAAK;AAAI,WAAK;AAAA,IAClB,WAAW,OAAO;AAAE,cAAQ,KAAK,aAAa;AAAG;AAAA,IAAM,WAC9C,OAAO;AAAE,cAAQ,KAAK,aAAa;AAAG;AAAA,IAAM,OAChD;AAAE,cAAQ,KAAK,WAAW;AAAG;AAAM;AAAA,IAAM;AAAA,EAClD;AACA,SAAO;AACX;AAmBO,SAAS,eAA4B;AACxC,SAAO;AAAA,IACH,aAAa;AAAA,IAAY,YAAY;AAAA,IAAY,UAAU;AAAA,IAC3D,YAAY;AAAA,IAAG,UAAU;AAAA,IAAG,aAAa;AAAA,IAAG,cAAc;AAAA,IAAG,aAAa;AAAA,IAC1E,cAAc;AAAA,IAAG,WAAW;AAAA,IAAG,WAAW;AAAA,EAAA;AAElD;AAEO,SAAS,UAAU,KAAkB,QAAgB,OAA8B,KAAsC;AAC5H,QAAM,IAAI,EAAE,GAAG,IAAA;AACf,IAAE,aAAa;AACf,IAAE,cAAc,EAAE;AAClB,IAAE,cAAc,WAAW,aAAa,IAAI;AAE5C,MAAI,QAAQ;AACZ,aAAW,QAAQ,OAAO;AACtB,UAAM,UAAU,KAAK,oBAAoB,EAAE,aAAa,QAAQ,GAAG;AACnE,QAAI,SAAS;AACT,QAAE,WAAW,KAAK,iBAAA;AAClB,QAAE,aAAa,QAAQ;AACvB,QAAE,WAAW,QAAQ;AACrB,cAAQ;AACR;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,CAAC,OAAO;AACR,MAAE,WAAW,EAAE,gBAAgB,SAAS,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,aAAa,MAAM;AAChF,MAAE,aAAa;AACf,MAAE,WAAW,EAAE,gBAAgB,SAAS,IAAI;AAAA,EAChD;AAEA,IAAE,eAAe,EAAE,YAAY,EAAE,aAAa,IAAI;AAClD,IAAE,YAAY,EAAE;AAChB,IAAE,YAAY;AACd,SAAO;AACX;AAEO,SAAS,cAAc,KAAkB,UAAkB,cAAc,OAA6D;AACzI,QAAM,IAAI,EAAE,GAAG,IAAA;AACf,QAAM,QAAQ,KAAK,IAAI,EAAE,WAAW,EAAE,UAAU;AAChD,QAAM,MAAM,WAAW;AACvB,QAAM,SAAS,MAAM,KAAK,MAAM,GAAG;AACnC,QAAM,aAAa,EAAE,aAAa,IAAI;AACtC,QAAM,QAAQ,SAAS,EAAE,eAAe;AACxC,QAAM,UAAU,EAAE,aAAa,KAAK,MAAM,GAAG,IAAI,EAAE;AAEnD,MAAI,YAAY,GAAG;AACf,MAAE,cAAc,EAAE;AAClB,MAAE,YAAY;AACd,MAAE,YAAY;AAAA,EAClB,WAAW,eAAe,EAAE,YAAY,WAAW,KAAK,UAAU,EAAE,SAAS,QAAQ;AACjF,MAAE,cAAc,EAAE,SAAS,OAAO;AAClC,MAAE,YAAY;AAAA,EAClB;AAEA,IAAE,eAAe,EAAE,eAAe,EAAE,cAAc,EAAE,eAAe;AACnE,SAAO,EAAE,KAAK,GAAG,SAAS,MAAA;AAC9B;AAKO,MAAM,kBAAyD;AAAA,EAClE,QAAQ,CAAC,MAAM;AAAA,EACf,QAAQ,CAAC,MAAM,IAAI;AAAA,EACnB,SAAS,CAAC,MAAM,KAAK,IAAI,MAAM,IAAI;AAAA,EACnC,WAAW,CAAC,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI;AAAA,EACtE,QAAQ,CAAC,MAAM;AACX,UAAM,KAAK;AACX,UAAM,KAAK;AACX,QAAI,IAAI,IAAI,IAAI;AACZ,aAAO,KAAK,IAAI;AAAA,IACpB,WAAW,IAAI,IAAI,IAAI;AACnB,aAAO,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IACtC,WAAW,IAAI,MAAM,IAAI;AACrB,aAAO,MAAM,KAAK,OAAO,MAAM,IAAI;AAAA,IACvC,OAAO;AACH,aAAO,MAAM,KAAK,QAAQ,MAAM,IAAI;AAAA,IACxC;AAAA,EACJ;AACJ;"}