aoye 0.0.2 → 0.0.6

package/dist/aoye.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aoye.esm.js","sources":["../src/global.ts","../src/priority-queue.ts","../src/task.ts","../src/util.ts","../src/schedule.ts","../src/dfs.ts","../src/line.ts","../src/scope.ts","../src/signal.ts","../src/index.ts"],"sourcesContent":["import { SortMap, BaseEvent as Event } from 'bobe-shared';\nimport type { Signal } from './signal';\n\nexport const evt = new Event();\n\nexport const G = {\n  /** 原子 signal 更新次数 */\n  version: 0,\n  id: 0,\n  /** scope 销毁任务序号 */\n  scopeDisposeI: 0,\n  PullingSignal: null as Signal | null\n};\n\nexport const dirtyLeafs = new SortMap<Signal>();\n\nexport enum State {\n  Clean = 0,\n  /** watch 节点执行 watcher 时只连接 scope */\n  LinkScopeOnly = 0b0000_0000_0000_0000_0000_0000_0100_0000,\n  /** 仅用于 scope 节点是否 abort */\n  ScopeAbort = 0b0000_0000_0000_0000_0000_0000_0010_0000,\n  /** 仅用于 scope 节点是否 ready */\n  ScopeReady = 0b0000_0000_0000_0000_0000_0000_0001_0000,\n  /** 当前节点是 scope 节点 */\n  IsScope = 0b0000_0000_0000_0000_0000_0000_0000_1000,\n  /** 当前节点可能变化 */\n  Unknown = 0b0000_0000_0000_0000_0000_0000_0000_0100,\n  /** 当前节点有变化 */\n  Dirty = 0b0000_0000_0000_0000_0000_0000_0000_0010,\n  /** 当前节点正在进行 pull 预检处理 */\n  Check = 0b0000_0000_0000_0000_0000_0000_0000_0001\n}\n\nexport const DirtyState = State.Unknown | State.Dirty;\nexport const ScopeExecuted = State.ScopeReady | State.ScopeAbort;\nexport const ScopeAbort = State.ScopeAbort;\n","/**\n * 这是一个优先队列 （满足子节点总是比父节点大）\n *                    1\n *\n *               10          20\n *\n *          15    30      25      30\n *\n *       17\n *  现在插入 7 ， 会按广度优先的顺序插入在数组尾部\n *                    1\n *\n *               10          20\n *\n *          15    30      25      30\n *\n *       17    7\n * 接着我们只需要将 7  逐层与上门的父节点比较， 7 较小则两者交互，一直让 7 上浮到适合的位置\n *\n *                          0\n *\n *                    1           2                 2^0 得到第二层第一个索引\n *\n *              3       4     5       6            2^0 + 2^1 。。。 + 2^n + x = y\n *\n *          7      8\n * 上浮后我们得到以上的树\n */\n// 父子节点的关系\n// 计算一个节点的 index 公式 ①   2^0 + 2^1 。。。 + 2^n + y = x 已知\n// 节点的左子节点 index     ②   2^0 + 2^1 。。。 + 2^n + 2^(n+1) + z = res 求 res\n// ② - ① 得到 2^(n+1) + (z-y) = res - x\n// 2^(n+1) + (z-y) + x = res\n// 而 z 和 y 的关系是，③ z = 2y\n\n// 2^(n+1) + y + x = res;\n// 2^n +  (2^n + y) + x = res;\n\n// 根据① 可得  2^n + y = x - 2^0~2^(n-1);\n// 2^n +  (2^n + y) + x = res;\n// 2^n + (x - (2^0+~2^(n-1))) + x = res;\n// 2^n - (2^0+~2^(n-1)) + 2x = res;\n// 1 + 2x = res;\n\ntype IGetIndex = (v: number, max: number) => number | null;\nexport const leakI: IGetIndex = (y, max) => (y < 0 || y >= max ? null : y);\nconst getLeft: IGetIndex = (x, max) => leakI(x * 2 + 1, max);\nconst getRight: IGetIndex = (x, max) => leakI(x * 2 + 2, max);\nconst getParent: IGetIndex = (x, max) => leakI((x - 1) >>> 1, max);\n\nconst exchange = (arr, i, j) => ([arr[i], arr[j]] = [arr[j], arr[i]]);\nexport class PriorityQueue<T> {\n  arr: T[] = [];\n  // 构造函数接受一个compare函数\n  // compare返回的-1, 0, 1决定元素是否优先被去除\n  constructor(public aIsUrgent: (a: T, b: T) => boolean) {\n  }\n\n  // 添加一个元素\n  _add(current: T) {\n    // console.log(`加入 ${current}`);\n    this.arr.push(current);\n    const len = this.size();\n    // this.logTree();\n    if (len === 1) {\n      return;\n    }\n    this.goUp(this.arr, current, len);\n  }\n\n  add(...items: T[]) {\n    items.forEach(it => this._add(it));\n  }\n\n  goUp = (arr: T[], current: T, len: number) => {\n    let i = len - 1;\n    while (i > 0) {\n      const item = arr[i];\n      const pI = getParent(i, len)!;\n      const parent = arr[pI];\n      if (this.aIsUrgent(item, parent)) {\n        // console.log(`交换 parent:${parent} -> child:${item} `);\n        exchange(arr, i, pI);\n        // this.logTree();\n        i = pI;\n      } else {\n        // console.log(`parent:${parent} child:${item} 不需要交换 \\n`);\n        break;\n      }\n    }\n  };\n\n  // 去除头元素并返回\n  poll() {\n    const { arr } = this;\n    // console.log(`弹出 ${arr[0]} 把 ${arr[arr.length - 1]} 放置到队头 `);\n    const len = this.size();\n    if (len <= 2) {\n      return arr.shift();\n    }\n\n    const last = arr.pop();\n    const first = arr[0];\n    arr[0] = last!;\n    // this.logTree();\n    this.goDown(this.arr, 0);\n    return first;\n  }\n\n  goDown = (arr: T[], i: number) => {\n    const len = this.size();\n    const half = len >>> 1;\n    while (i < half) {\n      const lI = getLeft(i, len);\n      const rI = getRight(i, len);\n      let point = i;\n\n      if (lI != null && this.aIsUrgent(arr[lI], arr[point])) {\n        point = lI;\n      }\n      if (rI != null && this.aIsUrgent(arr[rI], arr[point])) {\n        point = rI;\n      }\n      if (point === i) {\n        break;\n      }\n      // console.log(`交换 parent:${arr[i]} -> child:${arr[point]} `);\n      exchange(arr, i, point);\n      // this.logTree();\n      i = point;\n    }\n  };\n\n  // 取得头元素\n  peek() {\n    return this.arr[0];\n  }\n  // 取得元素数量\n  size() {\n    return this.arr.length;\n  }\n\n  logTree() {\n    const { arr } = this;\n    let i = 0;\n    let j = 1;\n    let level = 0;\n    const matrix: T[][] = [];\n    do {\n      matrix.push(arr.slice(i, j));\n      i = i * 2 + 1;\n      j = i + Math.pow(2, level) + 1;\n      level++;\n    } while (i < arr.length);\n    const last = Math.pow(2, matrix.length - 1);\n    const arrStr = JSON.stringify(last);\n    const halfLen = arrStr.length >>> 1;\n\n    matrix.forEach(it => {\n      const str = JSON.stringify(it);\n      const halfIt = str.length >>> 1;\n      console.log(str.padStart(halfLen + halfIt, ' '));\n    });\n    console.log('\\n');\n  }\n}\n\n// case 1\n// const pq = new PriorityQueue((a, b) => a - b)\n// pq.add(5)\n// pq.add(3)\n// pq.add(1)\n// pq.add(4)\n// pq.add(2)\n// const result = []\n// while (pq.size() > 0) {\n//   result.push(pq.poll())\n// }\n// console.log(result);\n// [1,2,3,4,5]\n\n// case 2\n// const pq = new PriorityQueue((a, b) => b - a)\n// pq.add(1)\n// pq.add(3)\n// pq.add(4)\n// pq.add(5)\n// pq.add(2)\n// const result = []\n// while (pq.size() > 0) {\n//   result.push(pq.poll())\n// }\n// console.log(result);\n// [5,4,3,2,1]\n","import { evt } from './global';\nimport { PriorityQueue } from './priority-queue';\nimport { CreateTaskProps, Task } from './type';\n\n/** TODO: 支持配置是否继续在同一任务中完成后续任务 */\nexport class TaskQueue<T> {\n  constructor(\n    public callbackAble: CreateTaskProps<T>['callbackAble'],\n    public aIsUrgent: CreateTaskProps<T>['aIsUrgent']\n  ) {}\n  isScheduling = false;\n  taskQueue: PriorityQueue<Task & T>;\n  static create<T>({ callbackAble, aIsUrgent }: CreateTaskProps<T>) {\n    const queue = new TaskQueue<Task & T>(callbackAble, aIsUrgent);\n    queue.taskQueue = new PriorityQueue<Task & T>(aIsUrgent);\n    return queue;\n  }\n\n  pushTask(task: Task & T) {\n    const { taskQueue, isScheduling } = this;\n    taskQueue._add(task);\n    if (!isScheduling) {\n      this.callbackAble(this.scheduleTask.bind(this));\n      this.isScheduling = true;\n    }\n  }\n\n  scheduleTask() {\n    const { taskQueue } = this;\n    // console.log('调度 dispose');\n    const fn = taskQueue.peek();\n    if (!fn) return (this.isScheduling = false);\n\n    const hasRemain = fn();\n\n    // 未完成\n    if (hasRemain) {\n      this.callbackAble(this.scheduleTask.bind(this));\n      return;\n    }\n\n    // 完成\n    taskQueue.poll();\n    evt.emit('one', fn)\n    if (taskQueue.size() === 0) {\n      evt.emit('done', fn)\n      return (this.isScheduling = false)\n    };\n\n    // 任务列表中还有任务\n    this.callbackAble(this.scheduleTask.bind(this));\n  }\n}\n","export const ide =\n  globalThis.requestIdleCallback ||\n  (globalThis.requestAnimationFrame\n    ? (fn: Function) =>\n        globalThis.requestAnimationFrame(() => {\n          setTimeout(() => {\n            fn();\n          });\n        })\n    : globalThis.setTimeout);\n\nexport const now = () => {\n  const timer = globalThis.performance || globalThis.Date;\n  return timer.now();\n};\nlet channel: MessageChannel = globalThis.MessageChannel ? new MessageChannel() : null;\nif (globalThis.MessageChannel) {\n  channel = new MessageChannel();\n}\nlet msgId = 0;\nexport const macro = fn => {\n  if (!channel) {\n    setTimeout(fn);\n  }\n  const memoId = msgId;\n  function onMessage(e) {\n    if (memoId === e.data) {\n      fn();\n      channel.port2.removeEventListener('message', onMessage);\n    }\n  }\n  channel.port2.addEventListener('message', onMessage);\n  channel.port1.postMessage(msgId++);\n};\n\nconst p = Promise.resolve();\nexport const micro = (cb: () => any) => {\n  p.then(cb)\n}","import type { Signal } from './signal';\nimport { TaskQueue } from './task';\nimport { ScheduleHandler } from './type';\nimport { macro, micro } from './util';\n\nexport enum Scheduler {\n  Sync = '__Sync_',\n  Layout = '__Layout_',\n  Micro = '__Micro_',\n  Macro = '__Macro_'\n}\n\nexport const _scheduler: Record<string | symbol, ScheduleHandler> = {\n  [Scheduler.Sync]: defaultScheduler,\n  [Scheduler.Micro]: microScheduler,\n  [Scheduler.Macro]: macroScheduler,\n  [Scheduler.Layout]: layoutScheduler\n};\nexport const scheduler = (key: string | symbol, value: ScheduleHandler) => (_scheduler[key] = value);\n\nfunction defaultScheduler(effects: Signal[]) {\n  for (const effect of effects) {\n    effect.runIfDirty();\n  }\n}\n\nlet microSTaskQueue: TaskQueue<{ time: number }>;\nlet macroSTaskQueue: TaskQueue<{ time: number }>;\nlet layoutSTaskQueue: TaskQueue<{ time: number }>;\nfunction microScheduler(effects: Signal[]) {\n  microSTaskQueue = microSTaskQueue || TaskQueue.create({ callbackAble: micro, aIsUrgent: (a, b) => a.time < b.time });\n  microSTaskQueue.pushTask(defaultScheduler.bind(null, effects));\n}\n\nfunction macroScheduler(effects: Signal[]) {\n  macroSTaskQueue = macroSTaskQueue || TaskQueue.create({ callbackAble: macro, aIsUrgent: (a, b) => a.time < b.time });\n  macroSTaskQueue.pushTask(defaultScheduler.bind(null, effects));\n}\nfunction layoutScheduler(effects: Signal[]) {\n  layoutSTaskQueue =\n    layoutSTaskQueue || TaskQueue.create({ callbackAble: macro, aIsUrgent: (a, b) => a.time < b.time });\n  layoutSTaskQueue.pushTask(defaultScheduler.bind(null, effects));\n}\n","import type { Signal } from './signal';\nimport { Line } from './line';\nimport { DFSCtxBegin, DFSCtxCompete, Vertex } from './type';\n\nconst DefaultDFSOpt = {\n  isUp: false,\n  begin: null as (dfsCtx: DFSCtxBegin) => any,\n  complete: null as (dfsCtx: DFSCtxCompete) => any,\n  breakStack: [] as Line[],\n  breakLine: null as Line,\n  breakNode: null as Signal\n};\n\ntype DFSOpt = typeof DefaultDFSOpt;\n\nexport function dfs(root: Vertex, opt: Partial<DFSOpt> = {}) {\n  const { isUp, begin, complete, breakStack: lineStack, breakLine } = { ...DefaultDFSOpt, ...opt };\n  let node = opt.breakNode || root;\n  let line: Line = breakLine;\n  const listKey = isUp ? 'recStart' : 'emitStart';\n  const nodeKey = isUp ? 'upstream' : 'downstream';\n  // 向上意味着要找所有节点的入度\n  const nextLineKey = isUp ? 'nextRecLine' : 'nextEmitLine';\n  const reverseNodeKey = isUp ? 'downstream' : 'upstream';\n\n  while (1) {\n    let notGoDeep = begin?.({\n      node: node as Signal,\n      lineFromUp: line,\n      walkedLine: lineStack\n    });\n    lineStack.push(line);\n    line = node[listKey];\n\n    if (line && !notGoDeep) {\n      const firstChild = line[nodeKey];\n      node = firstChild;\n      continue;\n    }\n\n    while (1) {\n      const noGoSibling = complete?.({\n        node: node as Signal,\n        lineToDeep: line,\n        walkedLine: lineStack,\n        notGoDeep\n      });\n      // 只对当前不下钻的节点生效\n      // notGoDeep = false;\n      line = lineStack.pop();\n      // 递归出口，回到起点\n      if (node === root) {\n        return;\n      }\n      notGoDeep = false;\n      const nextLine = line[nextLineKey];\n      // 有兄弟节点， 进入外循环，向下遍历兄弟节点\n      if (!noGoSibling && nextLine) {\n        // 外层循环后会把 sibling line 入栈，这里不需要处理\n        line = nextLine;\n        node = nextLine[nodeKey];\n        break;\n      }\n      // 没有兄弟节点就上浮\n      node = line[reverseNodeKey];\n    }\n  }\n}\n","import { State } from './global';\nimport type { Signal } from './signal';\nimport { Vertex } from './type';\n\nexport class Line {\n  static link(v1: Signal, v2: Signal) {\n    let { emitEnd } = v1,\n      { recEnd, recStart } = v2,\n      noRecEnd = !recEnd,\n      /** 模拟头节点 */\n      head = { nextRecLine: recStart } as Line,\n      line: Line;\n    recEnd = recEnd || head;\n\n    const { nextRecLine } = recEnd || {};\n    // 没有下一个收到的线\n    if (!nextRecLine) {\n      line = new Line();\n      // 内部会处理空链表的情况，即同步头部\n      Line.emit_line(v1, line);\n      Line.rec_line(v2, line);\n      emitEnd && Line.line_line_emit(emitEnd, line);\n      !noRecEnd && Line.line_line_rec(recEnd, line);\n    }\n    // 复用\n    else if (nextRecLine.upstream === v1) {\n      v2.recEnd = nextRecLine;\n      // TODO: link 版本标记\n    }\n    // 插入(这么做): v1 和 下一个 入度(订阅)节点不同\n    // TODO: v2上次真依赖了 v1 只是没检查出来，需要删除原依赖\n    else {\n      line = new Line();\n      Line.emit_line(v1, line);\n      Line.rec_line(v2, line);\n      emitEnd && Line.line_line_emit(emitEnd, line);\n      Line.insert_line_rec(recEnd, nextRecLine, line);\n    }\n    // 消除 head\n    for (const key in head) {\n      head[key] = null;\n    }\n    // v1 和 v2 处于不同 scope，v1 不是 scope\n    // => v1 是外部 signal\n    if (line && v2.scope && v1.scope !== v2.scope && !(v1.state & State.IsScope)) {\n      const first = v2.scope.outLink;\n      if (!first) {\n        v2.scope.outLink = line;\n      } else {\n        first.prevOutLink = line;\n        line.nextOutLink = first;\n        v2.scope.outLink = line;\n      }\n    }\n  }\n\n  static unlink(line: Line) {\n    let { prevEmitLine, nextEmitLine, prevRecLine, nextRecLine, upstream, downstream, nextOutLink, prevOutLink } = line;\n    line.prevEmitLine = null;\n    line.nextEmitLine = null;\n    line.prevRecLine = null;\n    line.nextRecLine = null;\n    line.upstream = null;\n    line.downstream = null;\n    line.prevOutLink = null;\n    line.nextOutLink = null;\n\n    const downNode = downstream as Signal;\n    // 有兄弟外部引用\n    if(prevOutLink) {\n      prevOutLink.nextOutLink = nextOutLink;\n    } \n    if(nextOutLink) {\n      nextOutLink.prevOutLink = prevOutLink;\n    }\n    // 是 first 节点\n    if(downNode.scope && downNode.scope.outLink === line) {\n      downNode.scope.outLink = nextOutLink;\n    }\n\n\n    /** 上游节点发出的线 前一条 关联 后一条 */\n    if (prevEmitLine) {\n      prevEmitLine.nextEmitLine = nextEmitLine;\n    } else {\n      // 删除的是首个节点\n      upstream.emitStart = nextEmitLine;\n    }\n    if (nextEmitLine) {\n      nextEmitLine.prevEmitLine = prevEmitLine;\n    } else {\n      // 删除尾节点\n      upstream.emitEnd = prevEmitLine;\n    }\n\n    /** 下游节点接收的线，我们从 recEnd 开始删除的，\n     * 接收信息，不需要设置 recEnd ，\n     * 因为 recStart ~ recEnd 是经过上级 get 确认的有用依赖\n     * */\n    if (prevRecLine) {\n      prevRecLine.nextRecLine = nextRecLine;\n    } else {\n      // 删除的是首个节点，大概率不可能从有依赖 变成无依赖\n      downstream.recStart = nextRecLine;\n    }\n    if (nextRecLine) {\n      nextRecLine.prevRecLine = prevRecLine;\n    } else {\n      // 删除尾节点\n      downstream.recEnd = prevRecLine;\n    }\n  }\n\n  static unlinkRec(line: Line) {\n    // 作为下游，执行完 get 上游节点已经完成了依赖更新，把 recEnd 后的依赖删除即可\n    let toDel = line;\n    while (toDel) {\n      const memoNext = toDel.nextRecLine;\n      Line.unlink(toDel);\n      toDel = memoNext;\n    }\n  }\n  static unlinkEmit(line: Line) {\n    // 作为下游，执行完 get 上游节点已经完成了依赖更新，把 recEnd 后的依赖删除即可\n    let toDel = line;\n    while (toDel) {\n      const memoNext = toDel.nextEmitLine;\n      Line.unlink(toDel);\n      toDel = memoNext;\n    }\n  }\n\n  /** 上游节点 连 link */\n  static emit_line(upstream: Vertex, line: Line) {\n    if (!upstream.emitStart) {\n      upstream.emitStart = line;\n    }\n    upstream.emitEnd = line;\n    line.upstream = upstream;\n  }\n  /** 下游节点 连 link */\n  static rec_line(downstream: Vertex, line: Line) {\n    if (!downstream.recStart) {\n      downstream.recStart = line;\n    }\n    downstream.recEnd = line;\n    line.downstream = downstream;\n  }\n\n  /** 同一节点发出的 两个条线 相连 */\n  static line_line_emit(l1: Line, l2: Line) {\n    if (!l1 || !l2) return;\n    l1.nextEmitLine = l2;\n    l2.prevEmitLine = l1;\n  }\n\n  /** 同一节点接收的 两个条线 相连 */\n  static line_line_rec(l1: Line, l2: Line) {\n    if (!l1 || !l2) return;\n    l1.nextRecLine = l2;\n    l2.prevRecLine = l1;\n  }\n\n  static insert_line_emit(l1: Line, l2: Line, ins: Line) {\n    l1.nextEmitLine = ins;\n    ins.prevEmitLine = l1;\n    l2.prevEmitLine = ins;\n    ins.nextEmitLine = l2;\n  }\n\n  static insert_line_rec(l1: Line, l2: Line, ins: Line) {\n    l1.nextRecLine = ins;\n    ins.prevRecLine = l1;\n    l2.prevRecLine = ins;\n    ins.nextRecLine = l2;\n  }\n\n  /** 上游顶点 */\n  public upstream: Vertex = null;\n  /** 上游节点 发出的上一条线 */\n  public prevEmitLine: Line = null;\n  /** 上游节点 发出的下一条线 */\n  public nextEmitLine: Line = null;\n\n  /** 下游顶点 */\n  public downstream: Vertex = null;\n  /** 下游节点 接收的上一条线 */\n  public prevRecLine: Line = null;\n  /** 下游节点 接收的下一条线 */\n  public nextRecLine: Line = null;\n  /** 表示 scope 当前存在的 外部 link  */\n  public prevOutLink = null;\n  public nextOutLink = null;\n  constructor() {}\n}\n","import { dfs } from './dfs';\nimport { G, ScopeAbort, State } from './global';\nimport { Line } from './line';\nimport type { Signal } from './signal';\n\n/** 子 scope 释放，把其 only 被其持有的 signal 挂回其属于的 scope */\nexport const trackByOtherScopeDispose = (signal: Signal) => {\n  const line = new Line();\n  const { recEnd } = signal.scope;\n  Line.emit_line(signal, line);\n  Line.rec_line(signal.scope, line);\n  Line.line_line_rec(recEnd, line);\n};\n\nexport function unlinkRecWithScope(line: Line) {\n  // 作为下游，执行完 get 上游节点已经完成了依赖更新，把 recEnd 后的依赖删除即可\n  let toDel = line;\n  while (toDel) {\n    const memoNext = toDel.nextRecLine;\n    const upstream = toDel.upstream as Signal;\n    // 的上游是 scope\n    if (upstream.state & State.IsScope) {\n      dispose.call(upstream);\n    }\n    // 删除的上游是 signal\n    else {\n      unlinkSingleLine(toDel);\n    }\n    // trackIsland(upstream);\n    toDel = memoNext;\n  }\n}\n\nexport function unlinkSingleLine(line: Line) {\n  const upstream = line.upstream as Signal;\n  if (upstream.emitStart === upstream.emitEnd) {\n    unlinkSingleRefedNode(upstream);\n  }\n  // 多处引用，断开当前即可\n  else {\n    Line.unlink(line);\n  }\n}\n\nexport function unlinkSingleRefedNode(delRoot: Signal) {\n  let toUnlink: Line;\n  dfs(delRoot, {\n    isUp: true,\n    begin: ({ node }) => {\n      doUnlink(toUnlink);\n      toUnlink = null;\n      // 1.节点不止一个引用\n      if (node.emitStart !== node.emitEnd) {\n        return true;\n      }\n    },\n    complete: ({ node, notGoDeep }) => {\n      doUnlink(toUnlink);\n      toUnlink = null;\n      const isSingleRefed = !notGoDeep;\n      // 先记录，离开这个节点后执行 unlink\n      if (isSingleRefed) {\n        toUnlink = node.emitStart;\n      }\n    }\n  });\n  doUnlink(toUnlink);\n}\n\nfunction doUnlink(line: Line) {\n  if (!line) {\n    return;\n  }\n  Line.unlink(line);\n}\n\n/** 释放 scope effect watch 的外链 */\nexport function dispose(this: Signal) {\n  // 断开子节点的外链，以及其引用的 signals\n  let toDel = this.recStart;\n  while (toDel) {\n    const memoNext = toDel.nextRecLine;\n    const upstream = toDel.upstream as Signal;\n    // 的上游是 scope，交给 dfs 处理\n    if (upstream.state & State.IsScope) {\n      dfs(upstream, {\n        isUp: true,\n        begin: ({ node }) => {\n          // 1. 不是 scope 直接忽略\n          // 2. 已完成标记 或 清理\n          if (!(node.state & State.IsScope) || node.state & ScopeAbort) return true;\n        },\n        complete: ({ node: scope, notGoDeep }) => {\n          const shouldAbort = !notGoDeep;\n          if (shouldAbort) {\n            releaseScope(scope);\n          }\n        }\n      });\n    }\n    // 删除的上游是 signal\n    else {\n      unlinkSingleLine(toDel);\n    }\n    // trackIsland(upstream);\n    toDel = memoNext;\n  }\n  // 自身的外链也需要断开\n  releaseScope(this);\n  doUnlink(this.emitStart);\n}\n\nfunction releaseScope(scope: Signal) {\n  let outLink = scope.outLink;\n  while (outLink) {\n    const memoNext = outLink.nextOutLink;\n    unlinkSingleLine(outLink);\n    outLink = memoNext;\n  }\n  scope.state |= State.ScopeAbort;\n  // clean 在 scope 释放时执行\n  scope.clean?.();\n  scope.clean = null;\n}\n\nexport function clean(cb: () => void) {\n  G.PullingSignal.clean = () => runWithPulling(cb, null) ;\n}\n\nexport function runWithPulling(fn: Function, signal: Signal | null) {\n  const prevPulling = G.PullingSignal;\n  G.PullingSignal = signal;\n  fn();\n  G.PullingSignal = prevPulling;\n}","import { dfs } from './dfs';\nimport { dirtyLeafs, DirtyState, G, ScopeExecuted, State } from './global';\nimport { Line } from './line';\nimport { _scheduler } from './schedule';\nimport { runWithPulling, unlinkRecWithScope } from './scope';\nimport { SignalOpt, Vertex } from './type';\n\nconst markDeep = (signal: Signal) => {\n  let level = 0;\n  dfs(signal, {\n    isUp: false,\n    begin: ({ node }) => {\n      /**\n       * 1. 当前节点在预检  应该跳过\n       * 2. 当前节点       已标记\n       * 3. 当前节点       已放弃\n       */\n      // console.log('markBegin', node.id);\n\n      if (node.state & (State.Check | State.Unknown | State.Dirty) || node.isDisabled()) {\n        return true;\n      }\n\n      const isEffect = level > 0;\n      // 没有下游，或者下游是 scope\n      const isLeaf = !node.emitStart || node.emitStart.downstream === node.scope;\n      if (isEffect) {\n        node.state |= State.Unknown;\n      }\n      // 源节点是叶子节点，不做标记，后续可以通过 get 重新拉取到新值\n      else if (!isLeaf) {\n        node.state |= State.Dirty;\n      }\n\n      if (isLeaf && isEffect) {\n        dirtyLeafs.add(node.scheduler, node);\n      }\n      level++;\n    }\n  });\n  for (const key in dirtyLeafs.data) {\n    const effects = dirtyLeafs.data[key];\n    const scheduler = _scheduler[key];\n    scheduler(effects);\n  }\n  dirtyLeafs.clear();\n};\n\nexport class Signal<T = any> implements Vertex {\n  version = -1;\n  id = G.id++;\n  state = State.Clean;\n  /** 当前节点创建时处于的 effect 就是 scope */\n  scope: Signal = G.PullingSignal;\n  recEnd: Line = null;\n  recStart: Line = null;\n  emitStart: Line = null;\n  emitEnd: Line = null;\n  scheduler: string = null;\n  value: T = null;\n  outLink: Line = null;\n  static Pulling: Signal = null;\n  pull: () => T = null;\n\n  constructor(\n    private nextValue: T,\n    /** 为什么是 shallow，因为 pullDeep 会把\n     * 上游节点 get 执行完成，让其可以直接拿到缓存值\n     */\n    private customPull?: () => T\n  ) {}\n\n  static create<T>(nextValue: T, { customPull, isScope, immediate, ...rest }: SignalOpt<T>) {\n    const s = new Signal(nextValue, customPull);\n    s.pull = s.customPull || s.DEFAULT_PULL;\n    Object.assign(s, rest);\n    if (isScope) {\n      s.state |= State.IsScope;\n    }\n    return s;\n  }\n\n  DEFAULT_PULL() {\n    return this.nextValue;\n  }\n\n  /**\n   * 递归拉取负责建立以来链\n   */\n  pullRecurse(shouldLink = true) {\n    let downstream = G.PullingSignal;\n    const isScope = this.state & State.IsScope;\n\n    if (\n      // 1. 外部支持 link\n      shouldLink &&\n      // 2. 有下游\n      downstream &&\n      // 3. 下游是 watcher，不链接非 scope\n      !(downstream.state & State.LinkScopeOnly && !isScope)\n    ) {\n      Line.link(this, downstream);\n    }\n    try {\n      if (this.version === G.version) {\n        return this.value;\n      }\n\n      // 进 pullShallow 前重置 recEnd，让子 getter 重构订阅链表\n      this.recEnd = null;\n\n      G.PullingSignal = this;\n      this.clean?.();\n      this.clean = null;\n      let v = this.pull();\n      if (isScope && typeof v === 'function') {\n        const fn = v;\n        this.clean = () => runWithPulling(fn, null);\n        v = this.value;\n      }\n      // 如果使用了 DEFAULT_PULL，处理一次 set 的取值后，替换回 customPull，如果有的话\n      this.pull = this.customPull || this.DEFAULT_PULL;\n      this.value = v;\n      // 依赖上游的 版本号\n      this.version = G.version;\n      // if (this.value !== v) {\n      // }\n      return this.value;\n    } catch (error) {\n      console.error('计算属性报错这次不触发，后续状态可能出错', error);\n      return this.value;\n    } finally {\n      // 本 getter 执行完成时上游 getter 通过 link，完成对下游 recLines 的更新\n      const toDel = this.recEnd?.nextRecLine;\n      unlinkRecWithScope(toDel);\n      G.PullingSignal = downstream;\n    }\n  }\n\n  pullDeep() {\n    /*----------------- 有上游节点，通过 dfs 重新计算结果 -----------------*/\n    const signal = this;\n    // 优化执行\n    if (!(signal.state & DirtyState)) {\n      return this.value;\n    }\n    dfs(signal, {\n      isUp: true,\n      begin: ({ node }) => {\n        // console.log('begin', node.id);\n\n        /**\n         * 不需要检查\n         * 1. 正在查\n         * 2. 干净\n         * 3. 放弃 或者为 scope 节点\n         */\n        if (node.state & State.Check || !(node.state & DirtyState) || node.isDisabled()) {\n          return true;\n        }\n        node.state |= State.Check;\n      },\n      complete: ({ node, notGoDeep: currentClean, walkedLine }) => {\n        let noGoSibling = false;\n        const last = walkedLine[walkedLine.length - 1];\n        const downstream = last?.downstream as Signal;\n        // 当前正在检查，生成检查屏障，同时避免重新标记 和\n        if (currentClean) {\n        }\n        // 当前节点需要重新计算\n        else if (node.state & State.Dirty) {\n          // 优化：源节点变化，直接让下游节点重新计算\n          if (!node.recStart && node.value !== node.nextValue) {\n            node.markDownStreamsDirty();\n            node.state &= ~State.Dirty;\n            node.state &= ~State.Check;\n            return;\n          }\n          // 预检数据\n          else {\n            const prevPulling = G.PullingSignal;\n            G.PullingSignal = downstream;\n            const prevValue = node.value;\n            // 递归转用递归拉取，且不需要重建 link 因为dfs的前提就是上游节点依赖于 本节点\n            node.pullRecurse(false);\n            // dirty 传播， 由于本节点值已被计算出，因此消除 dirty\n            if (prevValue !== node.value) {\n              node.markDownStreamsDirty();\n            }\n            node.state &= ~State.Dirty;\n            G.PullingSignal = prevPulling;\n            // 立刻返回父节点重新计算\n            noGoSibling = true;\n          }\n        }\n        // 没被上游节点标记为 Dirty，说明是干净的\n        else if (node.state & State.Unknown) {\n          node.state &= ~State.Unknown;\n        }\n        node.version = G.version;\n        node.state &= ~State.Check;\n        return noGoSibling;\n      }\n    });\n    return this.value;\n  }\n\n  get v() {\n    if (this.isDisabled()) {\n      return this.value;\n    }\n    // 没有上游节点，应该通过递归重新建立\n    if (!this.recStart) {\n      return this.pullRecurse(true);\n    }\n    // 有上游节点则采用 dfs 直接遍历，查看情况\n    return this.pullDeep();\n  }\n\n  // pause() {\n  //   this.state |= State.SelfPaused;\n  // }\n\n  // resume() {\n  //   this.state &= ~State.SelfPaused;\n  // }\n\n  markDownStreamsDirty() {\n    let point = this.emitStart;\n    while (point != null) {\n      const downstream = point.downstream as Signal;\n      downstream.state |= State.Dirty;\n      downstream.state &= ~State.Unknown;\n      point = point.nextEmitLine;\n    }\n  }\n\n  set v(v: T) {\n    if (this.isDisabled() || this.nextValue === v) {\n      return;\n    }\n    this.nextValue = v;\n    // 手动设值后，采用默认拉取，能拉取到设置的值，拉取完成后在替换回 customPull\n    this.pull = this.DEFAULT_PULL;\n    G.version++;\n    markDeep(this as any);\n  }\n\n  runIfDirty() {\n    this.state & (State.Unknown | State.Dirty) && this.v;\n  }\n\n  isDisabled() {\n    return (\n      // scope 被取消\n      (this.scope && this.scope.state & State.ScopeAbort) ||\n      // 是 scope 节点，且处于 ready 状态，不需要重复执行\n      (this.state & State.IsScope && this.state & ScopeExecuted)\n    );\n  }\n  /** 记录当前 effect 中 clean */\n  clean: () => void = null;\n}\n","import { State } from './global';\nimport { Scheduler } from './schedule';\nimport { dispose } from './scope';\nimport { Signal } from './signal';\nimport { Dispose, Getter, Mix, ValueDiff } from './type';\n\nexport { Scheduler, scheduler } from './schedule';\nexport { TaskQueue } from './task';\nexport { runWithPulling, clean } from './scope';\nexport * from './type';\n\nconst DefaultCustomSignalOpt = {\n  scheduler: Scheduler.Sync,\n  isScope: false,\n  immediate: true\n};\nexport type CustomSignalOpt = Partial<typeof DefaultCustomSignalOpt>;\n\nexport type CreateSignal = {\n  <T extends (...args: any[]) => any>(get: T, opt?: CustomSignalOpt): Signal<ReturnType<T>>;\n  <T = any>(value: T, opt?: CustomSignalOpt): Signal<T>;\n};\n\nexport const $: CreateSignal = (init?: unknown) => {\n  let intiValue: any, customPull: Getter;\n  if (init instanceof Function) {\n    intiValue = null;\n    customPull = init as Getter;\n  } else {\n    intiValue = init;\n  }\n  const s = Signal.create(intiValue, {\n    scheduler: Scheduler.Sync,\n    isScope: false,\n    customPull\n  });\n\n  return s;\n};\n\n/** @deprecated */\nconst watch = (values: Getter[], watcher: (...args: ValueDiff[]) => void, opt: CustomSignalOpt = {}) => {\n  let mounted = false;\n  const vs: ValueDiff[] = Array.from({ length: values.length }, () => ({ old: null, val: null }));\n  const s = Signal.create(null, {\n    customPull() {\n      for (let i = 0; i < values.length; i++) {\n        const value = values[i]();\n        vs[i].old = vs[i].val;\n        vs[i].val = value;\n      }\n\n      if (mounted) {\n        s.state |= State.LinkScopeOnly;\n        watcher(...vs);\n        s.state &= ~State.LinkScopeOnly;\n      }\n      mounted = true;\n    },\n    scheduler: Scheduler.Sync,\n    isScope: true,\n    ...opt\n  });\n\n  s.v;\n  const bound = dispose.bind(s);\n  bound.ins = s;\n  return bound;\n};\n\nexport const effect = (\n  customPull: (...args: ValueDiff[]) => void,\n  depOrOpt?: Signal<any>[] | CustomSignalOpt,\n  opt?: CustomSignalOpt\n) => {\n  /*----------------- 自动收集 -----------------*/\n  const hasDep = Array.isArray(depOrOpt);\n  opt = hasDep ? opt || {} : depOrOpt || {};\n  // 立即执行\n  if (!hasDep) {\n    const s = Signal.create(null, {\n      customPull,\n      scheduler: Scheduler.Sync,\n      isScope: true,\n      ...opt\n    });\n\n    s.v;\n    const bound = dispose.bind(s);\n    bound.ins = s;\n    return bound;\n  }\n\n  /*----------------- 指定依赖， watcher -----------------*/\n  let mounted = false;\n  const deps = depOrOpt as Signal[];\n  const immediate = deps.length === 0 ? true : (opt.immediate ?? true);\n  const vs: ValueDiff[] = Array.from({ length: deps.length }, () => ({ old: null, val: null }));\n  const s = Signal.create(null, {\n    customPull() {\n      for (let i = 0; i < deps.length; i++) {\n        const value = deps[i].v;\n        vs[i].old = vs[i].val;\n        vs[i].val = value;\n      }\n\n      if (mounted || immediate) {\n        s.state |= State.LinkScopeOnly;\n        customPull(...vs);\n        s.state &= ~State.LinkScopeOnly;\n      }\n      mounted = true;\n    },\n    scheduler: Scheduler.Sync,\n    isScope: true,\n    ...opt\n  });\n\n  s.v;\n  const bound = dispose.bind(s);\n  bound.ins = s;\n  return bound as Dispose;\n};\n\nexport const scope = (customPull: () => void) => {\n  const s = Signal.create(null, {\n    customPull,\n    scheduler: Scheduler.Sync,\n    isScope: true\n  });\n\n  s.v;\n  s.state |= State.ScopeReady;\n\n  const bound = dispose.bind(s);\n  bound.ins = s;\n  return bound as Dispose;\n};\n\n/**\n * 数据变化时，自定义 触发订阅函数的时机\n * @param {CustomSignalOpt} opt 配置如下:\n * @prop scheduler: (runIfDirty, effect) => void 执行 runIfDirty 定制触发 effect 时机\n * @prop scope: 用于统一释放 effect link 的作用域 默认是 defaultScope 可以全局获取\n */\nexport const customEffect = (opt?: CustomSignalOpt) => {\n  return ((init: any, innerOpt: any = {}) => {\n    return effect(init, { ...opt, ...innerOpt });\n  }) as typeof effect;\n};\n"],"names":["Event","State","Scheduler","__spreadValues","s","bound"],"mappings":";;AAGO,MAAM,GAAA,GAAM,IAAIA,SAAA,EAAM;AAEtB,MAAM,CAAA,GAAI;AAAA;AAAA,EAEf,OAAA,EAAS,CAAA;AAAA,EACT,EAAA,EAAI,CAAA;AAAA;AAAA,EAEJ,aAAA,EAAe,CAAA;AAAA,EACf,aAAA,EAAe;AACjB,CAAA;AAEO,MAAM,UAAA,GAAa,IAAI,OAAA,EAAgB;AAEvC,IAAK,KAAA,qBAAAC,MAAAA,KAAL;AACL,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,mBAAgB,EAAA,CAAA,GAAhB,eAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,gBAAa,EAAA,CAAA,GAAb,YAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,gBAAa,EAAA,CAAA,GAAb,YAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,aAAU,CAAA,CAAA,GAAV,SAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,aAAU,CAAA,CAAA,GAAV,SAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAEA,EAAAA,MAAAA,CAAAA,MAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAfU,EAAA,OAAAA,MAAAA;AAAA,CAAA,EAAA,KAAA,IAAA,EAAA,CAAA;AAkBL,MAAM,aAAa,CAAA,iBAAgB,CAAA;AACnC,MAAM,gBAAgB,EAAA,oBAAmB,EAAA;AACzC,MAAM,UAAA,GAAa,EAAA;;ACSnB,MAAM,KAAA,GAAmB,CAAC,CAAA,EAAG,GAAA,KAAS,IAAI,CAAA,IAAK,CAAA,IAAK,MAAM,IAAA,GAAO,CAAA;AACxE,MAAM,OAAA,GAAqB,CAAC,CAAA,EAAG,GAAA,KAAQ,MAAM,CAAA,GAAI,CAAA,GAAI,GAAG,GAAG,CAAA;AAC3D,MAAM,QAAA,GAAsB,CAAC,CAAA,EAAG,GAAA,KAAQ,MAAM,CAAA,GAAI,CAAA,GAAI,GAAG,GAAG,CAAA;AAC5D,MAAM,SAAA,GAAuB,CAAC,CAAA,EAAG,GAAA,KAAQ,MAAO,CAAA,GAAI,CAAA,KAAO,GAAG,GAAG,CAAA;AAEjE,MAAM,WAAW,CAAC,GAAA,EAAK,GAAG,CAAA,KAAO,CAAC,IAAI,CAAC,CAAA,EAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAA,CAAI,CAAC,CAAA,EAAG,GAAA,CAAI,CAAC,CAAC,CAAA;AAC5D,MAAM,aAAA,CAAiB;AAAA;AAAA;AAAA,EAI5B,YAAmB,SAAA,EAAoC;AAApC,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAHnB,IAAA,IAAA,CAAA,GAAA,GAAW,EAAC;AAsBZ,IAAA,IAAA,CAAA,IAAA,GAAO,CAAC,GAAA,EAAU,OAAA,EAAY,GAAA,KAAgB;AAC5C,MAAA,IAAI,IAAI,GAAA,GAAM,CAAA;AACd,MAAA,OAAO,IAAI,CAAA,EAAG;AACZ,QAAA,MAAM,IAAA,GAAO,IAAI,CAAC,CAAA;AAClB,QAAA,MAAM,EAAA,GAAK,SAAA,CAAU,CAAA,EAAG,GAAG,CAAA;AAC3B,QAAA,MAAM,MAAA,GAAS,IAAI,EAAE,CAAA;AACrB,QAAA,IAAI,IAAA,CAAK,SAAA,CAAU,IAAA,EAAM,MAAM,CAAA,EAAG;AAEhC,UAAA,QAAA,CAAS,GAAA,EAAK,GAAG,EAAE,CAAA;AAEnB,UAAA,CAAA,GAAI,EAAA;AAAA,QACN,CAAA,MAAO;AAEL,UAAA;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAA;AAmBA,IAAA,IAAA,CAAA,MAAA,GAAS,CAAC,KAAU,CAAA,KAAc;AAChC,MAAA,MAAM,GAAA,GAAM,KAAK,IAAA,EAAK;AACtB,MAAA,MAAM,OAAO,GAAA,KAAQ,CAAA;AACrB,MAAA,OAAO,IAAI,IAAA,EAAM;AACf,QAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,CAAA,EAAG,GAAG,CAAA;AACzB,QAAA,MAAM,EAAA,GAAK,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AAC1B,QAAA,IAAI,KAAA,GAAQ,CAAA;AAEZ,QAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,EAAE,CAAA,EAAG,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AACrD,UAAA,KAAA,GAAQ,EAAA;AAAA,QACV;AACA,QAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,EAAE,CAAA,EAAG,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AACrD,UAAA,KAAA,GAAQ,EAAA;AAAA,QACV;AACA,QAAA,IAAI,UAAU,CAAA,EAAG;AACf,UAAA;AAAA,QACF;AAEA,QAAA,QAAA,CAAS,GAAA,EAAK,GAAG,KAAK,CAAA;AAEtB,QAAA,CAAA,GAAI,KAAA;AAAA,MACN;AAAA,IACF,CAAA;AAAA,EA3EA;AAAA;AAAA,EAGA,KAAK,OAAA,EAAY;AAEf,IAAA,IAAA,CAAK,GAAA,CAAI,KAAK,OAAO,CAAA;AACrB,IAAA,MAAM,GAAA,GAAM,KAAK,IAAA,EAAK;AAEtB,IAAA,IAAI,QAAQ,CAAA,EAAG;AACb,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAAA,EAClC;AAAA,EAEA,OAAO,KAAA,EAAY;AACjB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAA,EAAA,KAAM,IAAA,CAAK,IAAA,CAAK,EAAE,CAAC,CAAA;AAAA,EACnC;AAAA;AAAA,EAqBA,IAAA,GAAO;AACL,IAAA,MAAM,EAAE,KAAI,GAAI,IAAA;AAEhB,IAAA,MAAM,GAAA,GAAM,KAAK,IAAA,EAAK;AACtB,IAAA,IAAI,OAAO,CAAA,EAAG;AACZ,MAAA,OAAO,IAAI,KAAA,EAAM;AAAA,IACnB;AAEA,IAAA,MAAM,IAAA,GAAO,IAAI,GAAA,EAAI;AACrB,IAAA,MAAM,KAAA,GAAQ,IAAI,CAAC,CAAA;AACnB,IAAA,GAAA,CAAI,CAAC,CAAA,GAAI,IAAA;AAET,IAAA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAA,EAAK,CAAC,CAAA;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA,EA2BA,IAAA,GAAO;AACL,IAAA,OAAO,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EACnB;AAAA;AAAA,EAEA,IAAA,GAAO;AACL,IAAA,OAAO,KAAK,GAAA,CAAI,MAAA;AAAA,EAClB;AAAA,EAEA,OAAA,GAAU;AACR,IAAA,MAAM,EAAE,KAAI,GAAI,IAAA;AAChB,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,MAAM,SAAgB,EAAC;AACvB,IAAA,GAAG;AACD,MAAA,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AAC3B,MAAA,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AACZ,MAAA,CAAA,GAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,GAAI,CAAA;AAC7B,MAAA,KAAA,EAAA;AAAA,IACF,CAAA,QAAS,IAAI,GAAA,CAAI,MAAA;AACjB,IAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAA,CAAO,SAAS,CAAC,CAAA;AAC1C,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA;AAClC,IAAA,MAAM,OAAA,GAAU,OAAO,MAAA,KAAW,CAAA;AAElC,IAAA,MAAA,CAAO,QAAQ,CAAA,EAAA,KAAM;AACnB,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,EAAE,CAAA;AAC7B,MAAA,MAAM,MAAA,GAAS,IAAI,MAAA,KAAW,CAAA;AAC9B,MAAA,OAAA,CAAQ,IAAI,GAAA,CAAI,QAAA,CAAS,OAAA,GAAU,MAAA,EAAQ,GAAG,CAAC,CAAA;AAAA,IACjD,CAAC,CAAA;AACD,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAAA,EAClB;AACF;;AChKO,MAAM,SAAA,CAAa;AAAA,EACxB,WAAA,CACS,cACA,SAAA,EACP;AAFO,IAAA,IAAA,CAAA,YAAA,GAAA,YAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAET,IAAA,IAAA,CAAA,YAAA,GAAe,KAAA;AAAA,EADZ;AAAA,EAGH,OAAO,MAAA,CAAU,EAAE,YAAA,EAAc,WAAU,EAAuB;AAChE,IAAA,MAAM,KAAA,GAAQ,IAAI,SAAA,CAAoB,YAAA,EAAc,SAAS,CAAA;AAC7D,IAAA,KAAA,CAAM,SAAA,GAAY,IAAI,aAAA,CAAwB,SAAS,CAAA;AACvD,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEA,SAAS,IAAA,EAAgB;AACvB,IAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAa,GAAI,IAAA;AACpC,IAAA,SAAA,CAAU,KAAK,IAAI,CAAA;AACnB,IAAA,IAAI,CAAC,YAAA,EAAc;AACjB,MAAA,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA;AAC9C,MAAA,IAAA,CAAK,YAAA,GAAe,IAAA;AAAA,IACtB;AAAA,EACF;AAAA,EAEA,YAAA,GAAe;AACb,IAAA,MAAM,EAAE,WAAU,GAAI,IAAA;AAEtB,IAAA,MAAM,EAAA,GAAK,UAAU,IAAA,EAAK;AAC1B,IAAA,IAAI,CAAC,EAAA,EAAI,OAAQ,IAAA,CAAK,YAAA,GAAe,KAAA;AAErC,IAAA,MAAM,YAAY,EAAA,EAAG;AAGrB,IAAA,IAAI,SAAA,EAAW;AACb,MAAA,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA;AAC9C,MAAA;AAAA,IACF;AAGA,IAAA,SAAA,CAAU,IAAA,EAAK;AACf,IAAA,GAAA,CAAI,IAAA,CAAK,OAAO,EAAE,CAAA;AAClB,IAAA,IAAI,SAAA,CAAU,IAAA,EAAK,KAAM,CAAA,EAAG;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,QAAQ,EAAE,CAAA;AACnB,MAAA,OAAQ,KAAK,YAAA,GAAe,KAAA;AAAA,IAC9B;AAGA,IAAA,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EAChD;AACF;;ACrCA,IAAI,OAAA,GAA0B,UAAA,CAAW,cAAA,GAAiB,IAAI,gBAAe,GAAI,IAAA;AACjF,IAAI,WAAW,cAAA,EAAgB;AAC7B,EAAA,OAAA,GAAU,IAAI,cAAA,EAAe;AAC/B;AACA,IAAI,KAAA,GAAQ,CAAA;AACL,MAAM,QAAQ,CAAA,EAAA,KAAM;AACzB,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,UAAA,CAAW,EAAE,CAAA;AAAA,EACf;AACA,EAAA,MAAM,MAAA,GAAS,KAAA;AACf,EAAA,SAAS,UAAU,CAAA,EAAG;AACpB,IAAA,IAAI,MAAA,KAAW,EAAE,IAAA,EAAM;AACrB,MAAA,EAAA,EAAG;AACH,MAAA,OAAA,CAAQ,KAAA,CAAM,mBAAA,CAAoB,SAAA,EAAW,SAAS,CAAA;AAAA,IACxD;AAAA,EACF;AACA,EAAA,OAAA,CAAQ,KAAA,CAAM,gBAAA,CAAiB,SAAA,EAAW,SAAS,CAAA;AACnD,EAAA,OAAA,CAAQ,KAAA,CAAM,YAAY,KAAA,EAAO,CAAA;AACnC,CAAA;AAEA,MAAM,CAAA,GAAI,QAAQ,OAAA,EAAQ;AACnB,MAAM,KAAA,GAAQ,CAAC,EAAA,KAAkB;AACtC,EAAA,CAAA,CAAE,KAAK,EAAE,CAAA;AACX,CAAA;;ACjCO,IAAK,SAAA,qBAAAC,UAAAA,KAAL;AACL,EAAAA,WAAA,MAAA,CAAA,GAAO,SAAA;AACP,EAAAA,WAAA,QAAA,CAAA,GAAS,WAAA;AACT,EAAAA,WAAA,OAAA,CAAA,GAAQ,UAAA;AACR,EAAAA,WAAA,OAAA,CAAA,GAAQ,UAAA;AAJE,EAAA,OAAAA,UAAAA;AAAA,CAAA,EAAA,SAAA,IAAA,EAAA;AAOL,MAAM,UAAA,GAAuD;AAAA,EAClE,CAAC,uBAAiB,gBAAA;AAAA,EAClB,CAAC,yBAAkB,cAAA;AAAA,EACnB,CAAC,yBAAkB,cAAA;AAAA,EACnB,CAAC,2BAAmB;AACtB,CAAA;AACO,MAAM,YAAY,CAAC,GAAA,EAAsB,KAAA,KAA4B,UAAA,CAAW,GAAG,CAAA,GAAI;AAE9F,SAAS,iBAAiB,OAAA,EAAmB;AAC3C,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,MAAA,CAAO,UAAA,EAAW;AAAA,EACpB;AACF;AAEA,IAAI,eAAA;AACJ,IAAI,eAAA;AACJ,IAAI,gBAAA;AACJ,SAAS,eAAe,OAAA,EAAmB;AACzC,EAAA,eAAA,GAAkB,eAAA,IAAmB,SAAA,CAAU,MAAA,CAAO,EAAE,cAAc,KAAA,EAAO,SAAA,EAAW,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,MAAM,CAAA;AACnH,EAAA,eAAA,CAAgB,QAAA,CAAS,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,OAAO,CAAC,CAAA;AAC/D;AAEA,SAAS,eAAe,OAAA,EAAmB;AACzC,EAAA,eAAA,GAAkB,eAAA,IAAmB,SAAA,CAAU,MAAA,CAAO,EAAE,cAAc,KAAA,EAAO,SAAA,EAAW,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,MAAM,CAAA;AACnH,EAAA,eAAA,CAAgB,QAAA,CAAS,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,OAAO,CAAC,CAAA;AAC/D;AACA,SAAS,gBAAgB,OAAA,EAAmB;AAC1C,EAAA,gBAAA,GACE,gBAAA,IAAoB,SAAA,CAAU,MAAA,CAAO,EAAE,cAAc,KAAA,EAAO,SAAA,EAAW,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,MAAM,CAAA;AACpG,EAAA,gBAAA,CAAiB,QAAA,CAAS,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,OAAO,CAAC,CAAA;AAChE;;;;;;;;;;;;;;;;;;ACtCA,MAAM,aAAA,GAAgB;AAAA,EACpB,IAAA,EAAM,KAAA;AAAA,EACN,KAAA,EAAO,IAAA;AAAA,EACP,QAAA,EAAU,IAAA;AAAA,EACV,YAAY,EAAC;AAAA,EACb,SAAA,EAAW,IAAA;AAAA,EACX,SAAA,EAAW;AACb,CAAA;AAIO,SAAS,GAAA,CAAI,IAAA,EAAc,GAAA,GAAuB,EAAC,EAAG;AAC3D,EAAA,MAAM,EAAE,MAAM,KAAA,EAAO,QAAA,EAAU,YAAY,SAAA,EAAW,SAAA,EAAU,GAAIC,gBAAA,CAAAA,gBAAA,CAAA,EAAA,EAAK,aAAA,CAAA,EAAkB,GAAA,CAAA;AAC3F,EAAA,IAAI,IAAA,GAAO,IAAI,SAAA,IAAa,IAAA;AAC5B,EAAA,IAAI,IAAA,GAAa,SAAA;AACjB,EAAA,MAAM,OAAA,GAAU,OAAO,UAAA,GAAa,WAAA;AACpC,EAAA,MAAM,OAAA,GAAU,OAAO,UAAA,GAAa,YAAA;AAEpC,EAAA,MAAM,WAAA,GAAc,OAAO,aAAA,GAAgB,cAAA;AAC3C,EAAA,MAAM,cAAA,GAAiB,OAAO,YAAA,GAAe,UAAA;AAE7C,EAAA,OAAO,CAAA,EAAG;AACR,IAAA,IAAI,YAAY,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAQ;AAAA,MACtB,IAAA;AAAA,MACA,UAAA,EAAY,IAAA;AAAA,MACZ,UAAA,EAAY;AAAA,KACd,CAAA;AACA,IAAA,SAAA,CAAU,KAAK,IAAI,CAAA;AACnB,IAAA,IAAA,GAAO,KAAK,OAAO,CAAA;AAEnB,IAAA,IAAI,IAAA,IAAQ,CAAC,SAAA,EAAW;AACtB,MAAA,MAAM,UAAA,GAAa,KAAK,OAAO,CAAA;AAC/B,MAAA,IAAA,GAAO,UAAA;AACP,MAAA;AAAA,IACF;AAEA,IAAA,OAAO,CAAA,EAAG;AACR,MAAA,MAAM,cAAc,QAAA,IAAA,IAAA,GAAA,MAAA,GAAA,QAAA,CAAW;AAAA,QAC7B,IAAA;AAAA,QACA,UAAA,EAAY,IAAA;AAAA,QACZ,UAAA,EAAY,SAAA;AAAA,QACZ;AAAA,OACF,CAAA;AAGA,MAAA,IAAA,GAAO,UAAU,GAAA,EAAI;AAErB,MAAA,IAAI,SAAS,IAAA,EAAM;AACjB,QAAA;AAAA,MACF;AACA,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA,MAAM,QAAA,GAAW,KAAK,WAAW,CAAA;AAEjC,MAAA,IAAI,CAAC,eAAe,QAAA,EAAU;AAE5B,QAAA,IAAA,GAAO,QAAA;AACP,QAAA,IAAA,GAAO,SAAS,OAAO,CAAA;AACvB,QAAA;AAAA,MACF;AAEA,MAAA,IAAA,GAAO,KAAK,cAAc,CAAA;AAAA,IAC5B;AAAA,EACF;AACF;;AC/DO,MAAM,IAAA,CAAK;AAAA,EA6LhB,WAAA,GAAc;AAfd;AAAA,IAAA,IAAA,CAAO,QAAA,GAAmB,IAAA;AAE1B;AAAA,IAAA,IAAA,CAAO,YAAA,GAAqB,IAAA;AAE5B;AAAA,IAAA,IAAA,CAAO,YAAA,GAAqB,IAAA;AAG5B;AAAA,IAAA,IAAA,CAAO,UAAA,GAAqB,IAAA;AAE5B;AAAA,IAAA,IAAA,CAAO,WAAA,GAAoB,IAAA;AAE3B;AAAA,IAAA,IAAA,CAAO,WAAA,GAAoB,IAAA;AAE3B;AAAA,IAAA,IAAA,CAAO,WAAA,GAAc,IAAA;AACrB,IAAA,IAAA,CAAO,WAAA,GAAc,IAAA;AAAA,EACN;AAAA,EA5Lf,OAAO,IAAA,CAAK,EAAA,EAAY,EAAA,EAAY;AAClC,IAAA,IAAI,EAAE,OAAA,EAAQ,GAAI,EAAA,EAChB,EAAE,QAAQ,QAAA,EAAS,GAAI,EAAA,EACvB,QAAA,GAAW,CAAC,MAAA,EAEZ,IAAA,GAAO,EAAE,WAAA,EAAa,UAAS,EAC/B,IAAA;AACF,IAAA,MAAA,GAAS,MAAA,IAAU,IAAA;AAEnB,IAAA,MAAM,EAAE,WAAA,EAAY,GAAI,MAAA,IAAU,EAAC;AAEnC,IAAA,IAAI,CAAC,WAAA,EAAa;AAChB,MAAA,IAAA,GAAO,IAAI,IAAA,EAAK;AAEhB,MAAA,IAAA,CAAK,SAAA,CAAU,IAAI,IAAI,CAAA;AACvB,MAAA,IAAA,CAAK,QAAA,CAAS,IAAI,IAAI,CAAA;AACtB,MAAA,OAAA,IAAW,IAAA,CAAK,cAAA,CAAe,OAAA,EAAS,IAAI,CAAA;AAC5C,MAAA,CAAC,QAAA,IAAY,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,IAAI,CAAA;AAAA,IAC9C,CAAA,MAAA,IAES,WAAA,CAAY,QAAA,KAAa,EAAA,EAAI;AACpC,MAAA,EAAA,CAAG,MAAA,GAAS,WAAA;AAAA,IAEd,CAAA,MAGK;AACH,MAAA,IAAA,GAAO,IAAI,IAAA,EAAK;AAChB,MAAA,IAAA,CAAK,SAAA,CAAU,IAAI,IAAI,CAAA;AACvB,MAAA,IAAA,CAAK,QAAA,CAAS,IAAI,IAAI,CAAA;AACtB,MAAA,OAAA,IAAW,IAAA,CAAK,cAAA,CAAe,OAAA,EAAS,IAAI,CAAA;AAC5C,MAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,WAAA,EAAa,IAAI,CAAA;AAAA,IAChD;AAEA,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,IAAA,CAAK,GAAG,CAAA,GAAI,IAAA;AAAA,IACd;AAGA,IAAA,IAAI,IAAA,IAAQ,EAAA,CAAG,KAAA,IAAS,EAAA,CAAG,KAAA,KAAU,EAAA,CAAG,KAAA,IAAS,EAAE,EAAA,CAAG,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAA,EAAU;AAC5E,MAAA,MAAM,KAAA,GAAQ,GAAG,KAAA,CAAM,OAAA;AACvB,MAAA,IAAI,CAAC,KAAA,EAAO;AACV,QAAA,EAAA,CAAG,MAAM,OAAA,GAAU,IAAA;AAAA,MACrB,CAAA,MAAO;AACL,QAAA,KAAA,CAAM,WAAA,GAAc,IAAA;AACpB,QAAA,IAAA,CAAK,WAAA,GAAc,KAAA;AACnB,QAAA,EAAA,CAAG,MAAM,OAAA,GAAU,IAAA;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,OAAO,IAAA,EAAY;AACxB,IAAA,IAAI,EAAE,cAAc,YAAA,EAAc,WAAA,EAAa,aAAa,QAAA,EAAU,UAAA,EAAY,WAAA,EAAa,WAAA,EAAY,GAAI,IAAA;AAC/G,IAAA,IAAA,CAAK,YAAA,GAAe,IAAA;AACpB,IAAA,IAAA,CAAK,YAAA,GAAe,IAAA;AACpB,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AACnB,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AACnB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAChB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAClB,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AACnB,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AAEnB,IAAA,MAAM,QAAA,GAAW,UAAA;AAEjB,IAAA,IAAG,WAAA,EAAa;AACd,MAAA,WAAA,CAAY,WAAA,GAAc,WAAA;AAAA,IAC5B;AACA,IAAA,IAAG,WAAA,EAAa;AACd,MAAA,WAAA,CAAY,WAAA,GAAc,WAAA;AAAA,IAC5B;AAEA,IAAA,IAAG,QAAA,CAAS,KAAA,IAAS,QAAA,CAAS,KAAA,CAAM,YAAY,IAAA,EAAM;AACpD,MAAA,QAAA,CAAS,MAAM,OAAA,GAAU,WAAA;AAAA,IAC3B;AAIA,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,YAAA,CAAa,YAAA,GAAe,YAAA;AAAA,IAC9B,CAAA,MAAO;AAEL,MAAA,QAAA,CAAS,SAAA,GAAY,YAAA;AAAA,IACvB;AACA,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,YAAA,CAAa,YAAA,GAAe,YAAA;AAAA,IAC9B,CAAA,MAAO;AAEL,MAAA,QAAA,CAAS,OAAA,GAAU,YAAA;AAAA,IACrB;AAMA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,WAAA,CAAY,WAAA,GAAc,WAAA;AAAA,IAC5B,CAAA,MAAO;AAEL,MAAA,UAAA,CAAW,QAAA,GAAW,WAAA;AAAA,IACxB;AACA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,WAAA,CAAY,WAAA,GAAc,WAAA;AAAA,IAC5B,CAAA,MAAO;AAEL,MAAA,UAAA,CAAW,MAAA,GAAS,WAAA;AAAA,IACtB;AAAA,EACF;AAAA,EAEA,OAAO,UAAU,IAAA,EAAY;AAE3B,IAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,IAAA,OAAO,KAAA,EAAO;AACZ,MAAA,MAAM,WAAW,KAAA,CAAM,WAAA;AACvB,MAAA,IAAA,CAAK,OAAO,KAAK,CAAA;AACjB,MAAA,KAAA,GAAQ,QAAA;AAAA,IACV;AAAA,EACF;AAAA,EACA,OAAO,WAAW,IAAA,EAAY;AAE5B,IAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,IAAA,OAAO,KAAA,EAAO;AACZ,MAAA,MAAM,WAAW,KAAA,CAAM,YAAA;AACvB,MAAA,IAAA,CAAK,OAAO,KAAK,CAAA;AACjB,MAAA,KAAA,GAAQ,QAAA;AAAA,IACV;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,SAAA,CAAU,QAAA,EAAkB,IAAA,EAAY;AAC7C,IAAA,IAAI,CAAC,SAAS,SAAA,EAAW;AACvB,MAAA,QAAA,CAAS,SAAA,GAAY,IAAA;AAAA,IACvB;AACA,IAAA,QAAA,CAAS,OAAA,GAAU,IAAA;AACnB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAAA,EAClB;AAAA;AAAA,EAEA,OAAO,QAAA,CAAS,UAAA,EAAoB,IAAA,EAAY;AAC9C,IAAA,IAAI,CAAC,WAAW,QAAA,EAAU;AACxB,MAAA,UAAA,CAAW,QAAA,GAAW,IAAA;AAAA,IACxB;AACA,IAAA,UAAA,CAAW,MAAA,GAAS,IAAA;AACpB,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAAA,EACpB;AAAA;AAAA,EAGA,OAAO,cAAA,CAAe,EAAA,EAAU,EAAA,EAAU;AACxC,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;AAChB,IAAA,EAAA,CAAG,YAAA,GAAe,EAAA;AAClB,IAAA,EAAA,CAAG,YAAA,GAAe,EAAA;AAAA,EACpB;AAAA;AAAA,EAGA,OAAO,aAAA,CAAc,EAAA,EAAU,EAAA,EAAU;AACvC,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;AAChB,IAAA,EAAA,CAAG,WAAA,GAAc,EAAA;AACjB,IAAA,EAAA,CAAG,WAAA,GAAc,EAAA;AAAA,EACnB;AAAA,EAEA,OAAO,gBAAA,CAAiB,EAAA,EAAU,EAAA,EAAU,GAAA,EAAW;AACrD,IAAA,EAAA,CAAG,YAAA,GAAe,GAAA;AAClB,IAAA,GAAA,CAAI,YAAA,GAAe,EAAA;AACnB,IAAA,EAAA,CAAG,YAAA,GAAe,GAAA;AAClB,IAAA,GAAA,CAAI,YAAA,GAAe,EAAA;AAAA,EACrB;AAAA,EAEA,OAAO,eAAA,CAAgB,EAAA,EAAU,EAAA,EAAU,GAAA,EAAW;AACpD,IAAA,EAAA,CAAG,WAAA,GAAc,GAAA;AACjB,IAAA,GAAA,CAAI,WAAA,GAAc,EAAA;AAClB,IAAA,EAAA,CAAG,WAAA,GAAc,GAAA;AACjB,IAAA,GAAA,CAAI,WAAA,GAAc,EAAA;AAAA,EACpB;AAmBF;;ACpLO,SAAS,mBAAmB,IAAA,EAAY;AAE7C,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,MAAM,WAAW,KAAA,CAAM,WAAA;AACvB,IAAA,MAAM,WAAW,KAAA,CAAM,QAAA;AAEvB,IAAA,IAAI,QAAA,CAAS,KAAA,GAAQ,KAAA,CAAM,OAAA,EAAS;AAClC,MAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AAAA,IACvB,CAAA,MAEK;AACH,MAAA,gBAAA,CAAiB,KAAK,CAAA;AAAA,IACxB;AAEA,IAAA,KAAA,GAAQ,QAAA;AAAA,EACV;AACF;AAEO,SAAS,iBAAiB,IAAA,EAAY;AAC3C,EAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,EAAA,IAAI,QAAA,CAAS,SAAA,KAAc,QAAA,CAAS,OAAA,EAAS;AAC3C,IAAA,qBAAA,CAAsB,QAAQ,CAAA;AAAA,EAChC,CAAA,MAEK;AACH,IAAA,IAAA,CAAK,OAAO,IAAI,CAAA;AAAA,EAClB;AACF;AAEO,SAAS,sBAAsB,OAAA,EAAiB;AACrD,EAAA,IAAI,QAAA;AACJ,EAAA,GAAA,CAAI,OAAA,EAAS;AAAA,IACX,IAAA,EAAM,IAAA;AAAA,IACN,KAAA,EAAO,CAAC,EAAE,IAAA,EAAK,KAAM;AACnB,MAAA,QAAA,CAAS,QAAQ,CAAA;AACjB,MAAA,QAAA,GAAW,IAAA;AAEX,MAAA,IAAI,IAAA,CAAK,SAAA,KAAc,IAAA,CAAK,OAAA,EAAS;AACnC,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF,CAAA;AAAA,IACA,QAAA,EAAU,CAAC,EAAE,IAAA,EAAM,WAAU,KAAM;AACjC,MAAA,QAAA,CAAS,QAAQ,CAAA;AACjB,MAAA,QAAA,GAAW,IAAA;AACX,MAAA,MAAM,gBAAgB,CAAC,SAAA;AAEvB,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,QAAA,GAAW,IAAA,CAAK,SAAA;AAAA,MAClB;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,QAAA,CAAS,QAAQ,CAAA;AACnB;AAEA,SAAS,SAAS,IAAA,EAAY;AAC5B,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA;AAAA,EACF;AACA,EAAA,IAAA,CAAK,OAAO,IAAI,CAAA;AAClB;AAGO,SAAS,OAAA,GAAsB;AAEpC,EAAA,IAAI,QAAQ,IAAA,CAAK,QAAA;AACjB,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,MAAM,WAAW,KAAA,CAAM,WAAA;AACvB,IAAA,MAAM,WAAW,KAAA,CAAM,QAAA;AAEvB,IAAA,IAAI,QAAA,CAAS,KAAA,GAAQ,KAAA,CAAM,OAAA,EAAS;AAClC,MAAA,GAAA,CAAI,QAAA,EAAU;AAAA,QACZ,IAAA,EAAM,IAAA;AAAA,QACN,KAAA,EAAO,CAAC,EAAE,IAAA,EAAK,KAAM;AAGnB,UAAA,IAAI,EAAE,KAAK,KAAA,GAAQ,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,GAAQ,YAAY,OAAO,IAAA;AAAA,QACvE,CAAA;AAAA,QACA,UAAU,CAAC,EAAE,IAAA,EAAM,KAAA,EAAO,WAAU,KAAM;AACxC,UAAA,MAAM,cAAc,CAAC,SAAA;AACrB,UAAA,IAAI,WAAA,EAAa;AACf,YAAA,YAAA,CAAa,KAAK,CAAA;AAAA,UACpB;AAAA,QACF;AAAA,OACD,CAAA;AAAA,IACH,CAAA,MAEK;AACH,MAAA,gBAAA,CAAiB,KAAK,CAAA;AAAA,IACxB;AAEA,IAAA,KAAA,GAAQ,QAAA;AAAA,EACV;AAEA,EAAA,YAAA,CAAa,IAAI,CAAA;AACjB,EAAA,QAAA,CAAS,KAAK,SAAS,CAAA;AACzB;AAEA,SAAS,aAAa,KAAA,EAAe;AAhHrC,EAAA,IAAA,EAAA;AAiHE,EAAA,IAAI,UAAU,KAAA,CAAM,OAAA;AACpB,EAAA,OAAO,OAAA,EAAS;AACd,IAAA,MAAM,WAAW,OAAA,CAAQ,WAAA;AACzB,IAAA,gBAAA,CAAiB,OAAO,CAAA;AACxB,IAAA,OAAA,GAAU,QAAA;AAAA,EACZ;AACA,EAAA,KAAA,CAAM,SAAS,KAAA,CAAM,UAAA;AAErB,EAAA,CAAA,EAAA,GAAA,KAAA,CAAM,KAAA,KAAN,IAAA,GAAA,MAAA,GAAA,EAAA,CAAA,IAAA,CAAA,KAAA,CAAA;AACA,EAAA,KAAA,CAAM,KAAA,GAAQ,IAAA;AAChB;AAEO,SAAS,MAAM,EAAA,EAAgB;AACpC,EAAA,CAAA,CAAE,aAAA,CAAc,KAAA,GAAQ,MAAM,cAAA,CAAe,IAAI,IAAI,CAAA;AACvD;AAEO,SAAS,cAAA,CAAe,IAAc,MAAA,EAAuB;AAClE,EAAA,MAAM,cAAc,CAAA,CAAE,aAAA;AACtB,EAAA,CAAA,CAAE,aAAA,GAAgB,MAAA;AAClB,EAAA,EAAA,EAAG;AACH,EAAA,CAAA,CAAE,aAAA,GAAgB,WAAA;AACpB;;;;;;;;;;;;;;;;;AC/HA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAmB;AACnC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,GAAA,CAAI,MAAA,EAAQ;AAAA,IACV,IAAA,EAAM,KAAA;AAAA,IACN,KAAA,EAAO,CAAC,EAAE,IAAA,EAAK,KAAM;AAQnB,MAAA,IAAI,IAAA,CAAK,KAAA,IAAS,KAAA,CAAM,KAAA,GAAQ,KAAA,CAAM,UAAU,KAAA,CAAM,KAAA,CAAA,IAAU,IAAA,CAAK,UAAA,EAAW,EAAG;AACjF,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,MAAM,WAAW,KAAA,GAAQ,CAAA;AAEzB,MAAA,MAAM,SAAS,CAAC,IAAA,CAAK,aAAa,IAAA,CAAK,SAAA,CAAU,eAAe,IAAA,CAAK,KAAA;AACrE,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,IAAA,CAAK,SAAS,KAAA,CAAM,OAAA;AAAA,MACtB,CAAA,MAAA,IAES,CAAC,MAAA,EAAQ;AAChB,QAAA,IAAA,CAAK,SAAS,KAAA,CAAM,KAAA;AAAA,MACtB;AAEA,MAAA,IAAI,UAAU,QAAA,EAAU;AACtB,QAAA,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,SAAA,EAAW,IAAI,CAAA;AAAA,MACrC;AACA,MAAA,KAAA,EAAA;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,MAAW,GAAA,IAAO,WAAW,IAAA,EAAM;AACjC,IAAA,MAAM,OAAA,GAAU,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA;AACnC,IAAA,MAAM,SAAA,GAAY,WAAW,GAAG,CAAA;AAChC,IAAA,SAAA,CAAU,OAAO,CAAA;AAAA,EACnB;AACA,EAAA,UAAA,CAAW,KAAA,EAAM;AACnB,CAAA;AAEO,MAAM,OAAA,GAAN,MAAM,OAAA,CAAkC;AAAA,EAgB7C,WAAA,CACU,WAIA,UAAA,EACR;AALQ,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAIA,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AApBV,IAAA,IAAA,CAAA,OAAA,GAAU,EAAA;AACV,IAAA,IAAA,CAAA,EAAA,GAAK,CAAA,CAAE,EAAA,EAAA;AACP,IAAA,IAAA,CAAA,KAAA,GAAQ,KAAA,CAAM,KAAA;AAEd;AAAA,IAAA,IAAA,CAAA,KAAA,GAAgB,CAAA,CAAE,aAAA;AAClB,IAAA,IAAA,CAAA,MAAA,GAAe,IAAA;AACf,IAAA,IAAA,CAAA,QAAA,GAAiB,IAAA;AACjB,IAAA,IAAA,CAAA,SAAA,GAAkB,IAAA;AAClB,IAAA,IAAA,CAAA,OAAA,GAAgB,IAAA;AAChB,IAAA,IAAA,CAAA,SAAA,GAAoB,IAAA;AACpB,IAAA,IAAA,CAAA,KAAA,GAAW,IAAA;AACX,IAAA,IAAA,CAAA,OAAA,GAAgB,IAAA;AAEhB,IAAA,IAAA,CAAA,IAAA,GAAgB,IAAA;AAuMhB;AAAA,IAAA,IAAA,CAAA,KAAA,GAAoB,IAAA;AAAA,EA/LjB;AAAA,EAEH,OAAO,MAAA,CAAU,SAAA,EAAc,EAAA,EAA2D;AAA3D,IAAA,IAAA,EAAA,GAAA,EAAA,EAAE,EAAA,UAAA,EAAY,SAAS,SAAA,EAxExD,GAwEiC,IAAqC,IAAA,GAAA,SAAA,CAArC,EAAA,EAAqC,CAAnC,YAAA,EAAY,SAAA,EAAS,WAAA,CAAA,CAAA;AACpD,IAAA,MAAM,CAAA,GAAI,IAAI,OAAA,CAAO,SAAA,EAAW,UAAU,CAAA;AAC1C,IAAA,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,YAAA;AAC3B,IAAA,MAAA,CAAO,MAAA,CAAO,GAAG,IAAI,CAAA;AACrB,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,CAAA,CAAE,SAAS,KAAA,CAAM,OAAA;AAAA,IACnB;AACA,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEA,YAAA,GAAe;AACb,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,CAAY,aAAa,IAAA,EAAM;AAzFjC,IAAA,IAAA,EAAA,EAAA,EAAA;AA0FI,IAAA,IAAI,aAAa,CAAA,CAAE,aAAA;AACnB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,OAAA;AAEnC,IAAA;AAAA;AAAA,MAEE,UAAA;AAAA,MAEA,UAAA;AAAA,MAEA,EAAE,UAAA,CAAW,KAAA,GAAQ,KAAA,CAAM,iBAAiB,CAAC,OAAA;AAAA,MAC7C;AACA,MAAA,IAAA,CAAK,IAAA,CAAK,MAAM,UAAU,CAAA;AAAA,IAC5B;AACA,IAAA,IAAI;AACF,MAAA,IAAI,IAAA,CAAK,OAAA,KAAY,CAAA,CAAE,OAAA,EAAS;AAC9B,QAAA,OAAO,IAAA,CAAK,KAAA;AAAA,MACd;AAGA,MAAA,IAAA,CAAK,MAAA,GAAS,IAAA;AAEd,MAAA,CAAA,CAAE,aAAA,GAAgB,IAAA;AAClB,MAAA,CAAA,EAAA,GAAA,IAAA,CAAK,KAAA,KAAL,IAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAAA,IAAA,CAAA,IAAA,CAAA;AACA,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAI,CAAA,GAAI,KAAK,IAAA,EAAK;AAClB,MAAA,IAAI,OAAA,IAAW,OAAO,CAAA,KAAM,UAAA,EAAY;AACtC,QAAA,MAAM,EAAA,GAAK,CAAA;AACX,QAAA,IAAA,CAAK,KAAA,GAAQ,MAAM,cAAA,CAAe,EAAA,EAAI,IAAI,CAAA;AAC1C,QAAA,CAAA,GAAI,IAAA,CAAK,KAAA;AAAA,MACX;AAEA,MAAA,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,UAAA,IAAc,IAAA,CAAK,YAAA;AACpC,MAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AAEb,MAAA,IAAA,CAAK,UAAU,CAAA,CAAE,OAAA;AAGjB,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACd,SAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,KAAA,CAAM,4HAAwB,KAAK,CAAA;AAC3C,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACd,CAAA,SAAE;AAEA,MAAA,MAAM,KAAA,GAAA,CAAQ,EAAA,GAAA,IAAA,CAAK,MAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAa,WAAA;AAC3B,MAAA,kBAAA,CAAmB,KAAK,CAAA;AACxB,MAAA,CAAA,CAAE,aAAA,GAAgB,UAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEA,QAAA,GAAW;AAET,IAAA,MAAM,MAAA,GAAS,IAAA;AAEf,IAAA,IAAI,EAAE,MAAA,CAAO,KAAA,GAAQ,UAAA,CAAA,EAAa;AAChC,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACd;AACA,IAAA,GAAA,CAAI,MAAA,EAAQ;AAAA,MACV,IAAA,EAAM,IAAA;AAAA,MACN,KAAA,EAAO,CAAC,EAAE,IAAA,EAAK,KAAM;AASnB,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,IAAS,EAAE,KAAK,KAAA,GAAQ,UAAA,CAAA,IAAe,IAAA,CAAK,UAAA,EAAW,EAAG;AAC/E,UAAA,OAAO,IAAA;AAAA,QACT;AACA,QAAA,IAAA,CAAK,SAAS,KAAA,CAAM,KAAA;AAAA,MACtB,CAAA;AAAA,MACA,UAAU,CAAC,EAAE,MAAM,SAAA,EAAW,YAAA,EAAc,YAAW,KAAM;AAC3D,QAAA,IAAI,WAAA,GAAc,KAAA;AAClB,QAAA,MAAM,IAAA,GAAO,UAAA,CAAW,UAAA,CAAW,MAAA,GAAS,CAAC,CAAA;AAC7C,QAAA,MAAM,aAAa,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,UAAA;AAEzB,QAAA,IAAI,YAAA,EAAc,CAClB,MAAA,IAES,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAEjC,UAAA,IAAI,CAAC,IAAA,CAAK,QAAA,IAAY,IAAA,CAAK,KAAA,KAAU,KAAK,SAAA,EAAW;AACnD,YAAA,IAAA,CAAK,oBAAA,EAAqB;AAC1B,YAAA,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA;AACrB,YAAA,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA;AACrB,YAAA;AAAA,UACF,CAAA,MAEK;AACH,YAAA,MAAM,cAAc,CAAA,CAAE,aAAA;AACtB,YAAA,CAAA,CAAE,aAAA,GAAgB,UAAA;AAClB,YAAA,MAAM,YAAY,IAAA,CAAK,KAAA;AAEvB,YAAA,IAAA,CAAK,YAAY,KAAK,CAAA;AAEtB,YAAA,IAAI,SAAA,KAAc,KAAK,KAAA,EAAO;AAC5B,cAAA,IAAA,CAAK,oBAAA,EAAqB;AAAA,YAC5B;AACA,YAAA,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA;AACrB,YAAA,CAAA,CAAE,aAAA,GAAgB,WAAA;AAElB,YAAA,WAAA,GAAc,IAAA;AAAA,UAChB;AAAA,QACF,CAAA,MAAA,IAES,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,OAAA,EAAS;AACnC,UAAA,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,OAAA;AAAA,QACvB;AACA,QAAA,IAAA,CAAK,UAAU,CAAA,CAAE,OAAA;AACjB,QAAA,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA;AACrB,QAAA,OAAO,WAAA;AAAA,MACT;AAAA,KACD,CAAA;AACD,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEA,IAAI,CAAA,GAAI;AACN,IAAA,IAAI,IAAA,CAAK,YAAW,EAAG;AACrB,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACd;AAEA,IAAA,IAAI,CAAC,KAAK,QAAA,EAAU;AAClB,MAAA,OAAO,IAAA,CAAK,YAAY,IAAI,CAAA;AAAA,IAC9B;AAEA,IAAA,OAAO,KAAK,QAAA,EAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,oBAAA,GAAuB;AACrB,IAAA,IAAI,QAAQ,IAAA,CAAK,SAAA;AACjB,IAAA,OAAO,SAAS,IAAA,EAAM;AACpB,MAAA,MAAM,aAAa,KAAA,CAAM,UAAA;AACzB,MAAA,UAAA,CAAW,SAAS,KAAA,CAAM,KAAA;AAC1B,MAAA,UAAA,CAAW,KAAA,IAAS,CAAC,KAAA,CAAM,OAAA;AAC3B,MAAA,KAAA,GAAQ,KAAA,CAAM,YAAA;AAAA,IAChB;AAAA,EACF;AAAA,EAEA,IAAI,EAAE,CAAA,EAAM;AACV,IAAA,IAAI,IAAA,CAAK,UAAA,EAAW,IAAK,IAAA,CAAK,cAAc,CAAA,EAAG;AAC7C,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,SAAA,GAAY,CAAA;AAEjB,IAAA,IAAA,CAAK,OAAO,IAAA,CAAK,YAAA;AACjB,IAAA,CAAA,CAAE,OAAA,EAAA;AACF,IAAA,QAAA,CAAS,IAAW,CAAA;AAAA,EACtB;AAAA,EAEA,UAAA,GAAa;AACX,IAAA,IAAA,CAAK,KAAA,IAAS,KAAA,CAAM,OAAA,GAAU,KAAA,CAAM,UAAU,IAAA,CAAK,CAAA;AAAA,EACrD;AAAA,EAEA,UAAA,GAAa;AACX,IAAA;AAAA;AAAA,MAEG,IAAA,CAAK,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,QAAQ,KAAA,CAAM,UAAA;AAAA,MAEvC,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,OAAA,IAAW,KAAK,KAAA,GAAQ;AAAA;AAAA,EAEhD;AAGF,CAAA;AAtNa,OAAA,CAaJ,OAAA,GAAkB,IAAA;AAbpB,IAAM,MAAA,GAAN,OAAA;;;;;;;;;;;;;;;;;;CCrCwB;AAAA,EAC7B,WAAW,SAAA,CAAU,IAGvB;AAQO,MAAM,CAAA,GAAkB,CAAC,IAAA,KAAmB;AACjD,EAAA,IAAI,SAAA,EAAgB,UAAA;AACpB,EAAA,IAAI,gBAAgB,QAAA,EAAU;AAC5B,IAAA,SAAA,GAAY,IAAA;AACZ,IAAA,UAAA,GAAa,IAAA;AAAA,EACf,CAAA,MAAO;AACL,IAAA,SAAA,GAAY,IAAA;AAAA,EACd;AACA,EAAA,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW;AAAA,IACjC,WAAW,SAAA,CAAU,IAAA;AAAA,IACrB,OAAA,EAAS,KAAA;AAAA,IACT;AAAA,GACD,CAAA;AAED,EAAA,OAAO,CAAA;AACT;AAgCO,MAAM,MAAA,GAAS,CACpB,UAAA,EACA,QAAA,EACA,GAAA,KACG;AA1EL,EAAA,IAAA,EAAA;AA4EE,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,QAAQ,CAAA;AACrC,EAAA,GAAA,GAAM,MAAA,GAAS,GAAA,IAAO,EAAC,GAAI,YAAY,EAAC;AAExC,EAAA,IAAI,CAAC,MAAA,EAAQ;AACX,IAAA,MAAMC,EAAAA,GAAI,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,cAAA,CAAA;AAAA,MAC5B,UAAA;AAAA,MACA,WAAW,SAAA,CAAU,IAAA;AAAA,MACrB,OAAA,EAAS;AAAA,KAAA,EACN,GAAA,CACJ,CAAA;AAED,IAAAA,EAAAA,CAAE,CAAA;AACF,IAAA,MAAMC,MAAAA,GAAQ,OAAA,CAAQ,IAAA,CAAKD,EAAC,CAAA;AAC5B,IAAAC,OAAM,GAAA,GAAMD,EAAAA;AACZ,IAAA,OAAOC,MAAAA;AAAA,EACT;AAGA,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,MAAM,IAAA,GAAO,QAAA;AACb,EAAA,MAAM,YAAY,IAAA,CAAK,MAAA,KAAW,IAAI,IAAA,GAAA,CAAQ,EAAA,GAAA,GAAA,CAAI,cAAJ,IAAA,GAAA,EAAA,GAAiB,IAAA;AAC/D,EAAA,MAAM,EAAA,GAAkB,KAAA,CAAM,IAAA,CAAK,EAAE,QAAQ,IAAA,CAAK,MAAA,EAAO,EAAG,OAAO,EAAE,GAAA,EAAK,IAAA,EAAM,GAAA,EAAK,MAAK,CAAE,CAAA;AAC5F,EAAA,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,cAAA,CAAA;AAAA,IAC5B,UAAA,GAAa;AACX,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AACtB,QAAA,EAAA,CAAG,CAAC,CAAA,CAAE,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,CAAE,GAAA;AAClB,QAAA,EAAA,CAAG,CAAC,EAAE,GAAA,GAAM,KAAA;AAAA,MACd;AAEA,MAAA,IAAI,WAAW,SAAA,EAAW;AACxB,QAAA,CAAA,CAAE,SAAS,KAAA,CAAM,aAAA;AACjB,QAAA,UAAA,CAAW,GAAG,EAAE,CAAA;AAChB,QAAA,CAAA,CAAE,KAAA,IAAS,CAAC,KAAA,CAAM,aAAA;AAAA,MACpB;AACA,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ,CAAA;AAAA,IACA,WAAW,SAAA,CAAU,IAAA;AAAA,IACrB,OAAA,EAAS;AAAA,GAAA,EACN,GAAA,CACJ,CAAA;AAED,EAAA,CAAA,CAAE,CAAA;AACF,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA;AAC5B,EAAA,KAAA,CAAM,GAAA,GAAM,CAAA;AACZ,EAAA,OAAO,KAAA;AACT;AAEO,MAAM,KAAA,GAAQ,CAAC,UAAA,KAA2B;AAC/C,EAAA,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM;AAAA,IAC5B,UAAA;AAAA,IACA,WAAW,SAAA,CAAU,IAAA;AAAA,IACrB,OAAA,EAAS;AAAA,GACV,CAAA;AAED,EAAA,CAAA,CAAE,CAAA;AACF,EAAA,CAAA,CAAE,SAAS,KAAA,CAAM,UAAA;AAEjB,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA;AAC5B,EAAA,KAAA,CAAM,GAAA,GAAM,CAAA;AACZ,EAAA,OAAO,KAAA;AACT;AAQO,MAAM,YAAA,GAAe,CAAC,GAAA,KAA0B;AACrD,EAAA,QAAQ,CAAC,IAAA,EAAW,QAAA,GAAgB,EAAC,KAAM;AACzC,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,cAAA,CAAA,cAAA,CAAA,EAAA,EAAK,GAAA,CAAA,EAAQ,QAAA,CAAU,CAAA;AAAA,EAC7C,CAAA;AACF;;;;"}

package/dist/index.d.ts

@@ -0,0 +1,203 @@
+declare enum State {
+    Clean = 0,
+    /** watch 节点执行 watcher 时只连接 scope */
+    LinkScopeOnly = 64,
+    /** 仅用于 scope 节点是否 abort */
+    ScopeAbort = 32,
+    /** 仅用于 scope 节点是否 ready */
+    ScopeReady = 16,
+    /** 当前节点是 scope 节点 */
+    IsScope = 8,
+    /** 当前节点可能变化 */
+    Unknown = 4,
+    /** 当前节点有变化 */
+    Dirty = 2,
+    /** 当前节点正在进行 pull 预检处理 */
+    Check = 1
+}
+
+declare class Signal<T = any> implements Vertex {
+    private nextValue;
+    /** 为什么是 shallow，因为 pullDeep 会把
+     * 上游节点 get 执行完成，让其可以直接拿到缓存值
+     */
+    private customPull?;
+    version: number;
+    id: number;
+    state: State;
+    /** 当前节点创建时处于的 effect 就是 scope */
+    scope: Signal;
+    recEnd: Line;
+    recStart: Line;
+    emitStart: Line;
+    emitEnd: Line;
+    scheduler: string;
+    value: T;
+    outLink: Line;
+    static Pulling: Signal;
+    pull: () => T;
+    constructor(nextValue: T, 
+    /** 为什么是 shallow，因为 pullDeep 会把
+     * 上游节点 get 执行完成，让其可以直接拿到缓存值
+     */
+    customPull?: () => T);
+    static create<T>(nextValue: T, { customPull, isScope, immediate, ...rest }: SignalOpt<T>): Signal<T>;
+    DEFAULT_PULL(): T;
+    /**
+     * 递归拉取负责建立以来链
+     */
+    pullRecurse(shouldLink?: boolean): T;
+    pullDeep(): T;
+    get v(): T;
+    markDownStreamsDirty(): void;
+    set v(v: T);
+    runIfDirty(): void;
+    isDisabled(): number;
+    /** 记录当前 effect 中 clean */
+    clean: () => void;
+}
+
+declare class Line {
+    static link(v1: Signal, v2: Signal): void;
+    static unlink(line: Line): void;
+    static unlinkRec(line: Line): void;
+    static unlinkEmit(line: Line): void;
+    /** 上游节点 连 link */
+    static emit_line(upstream: Vertex, line: Line): void;
+    /** 下游节点 连 link */
+    static rec_line(downstream: Vertex, line: Line): void;
+    /** 同一节点发出的 两个条线 相连 */
+    static line_line_emit(l1: Line, l2: Line): void;
+    /** 同一节点接收的 两个条线 相连 */
+    static line_line_rec(l1: Line, l2: Line): void;
+    static insert_line_emit(l1: Line, l2: Line, ins: Line): void;
+    static insert_line_rec(l1: Line, l2: Line, ins: Line): void;
+    /** 上游顶点 */
+    upstream: Vertex;
+    /** 上游节点 发出的上一条线 */
+    prevEmitLine: Line;
+    /** 上游节点 发出的下一条线 */
+    nextEmitLine: Line;
+    /** 下游顶点 */
+    downstream: Vertex;
+    /** 下游节点 接收的上一条线 */
+    prevRecLine: Line;
+    /** 下游节点 接收的下一条线 */
+    nextRecLine: Line;
+    /** 表示 scope 当前存在的 外部 link  */
+    prevOutLink: any;
+    nextOutLink: any;
+    constructor();
+}
+
+type Task = () => any;
+type CreateTaskProps<T> = {
+    callbackAble: (fn: Function) => any;
+    aIsUrgent: (a: Task & T, b: Task & T) => boolean;
+};
+type ScheduleHandler = (effects: Signal[]) => any;
+type SignalOpt<T> = {
+    customPull?: () => T;
+    scheduler?: string;
+    isScope?: boolean;
+    immediate?: boolean;
+};
+type Vertex = {
+    /** 上游来的最后一条线 */
+    recEnd: Line;
+    recStart: Line;
+    /** 向下游发出的最后一条线 */
+    emitEnd: Line;
+    emitStart: Line;
+};
+type DFSCtxBegin = {
+    node: Signal;
+    lineFromUp: Line;
+    walkedLine: Line[];
+    notGoDeep?: boolean;
+};
+type DFSCtxCompete = {
+    node: Signal;
+    lineToDeep: Line;
+    walkedLine: Line[];
+    notGoDeep?: boolean;
+};
+type Getter<T = any> = {
+    (): T;
+    ins?: Signal;
+};
+type Mix<T = any> = {
+    (v: T): void;
+    (): T;
+    v: T;
+    stop(): void;
+};
+type ValueDiff = {
+    old: any;
+    val: any;
+};
+type Dispose = {
+    (): void;
+    ins: Signal;
+};
+
+declare enum Scheduler {
+    Sync = "__Sync_",
+    Layout = "__Layout_",
+    Micro = "__Micro_",
+    Macro = "__Macro_"
+}
+declare const scheduler: (key: string | symbol, value: ScheduleHandler) => ScheduleHandler;
+
+declare class PriorityQueue<T> {
+    aIsUrgent: (a: T, b: T) => boolean;
+    arr: T[];
+    constructor(aIsUrgent: (a: T, b: T) => boolean);
+    _add(current: T): void;
+    add(...items: T[]): void;
+    goUp: (arr: T[], current: T, len: number) => void;
+    poll(): T;
+    goDown: (arr: T[], i: number) => void;
+    peek(): T;
+    size(): number;
+    logTree(): void;
+}
+
+/** TODO: 支持配置是否继续在同一任务中完成后续任务 */
+declare class TaskQueue<T> {
+    callbackAble: CreateTaskProps<T>['callbackAble'];
+    aIsUrgent: CreateTaskProps<T>['aIsUrgent'];
+    constructor(callbackAble: CreateTaskProps<T>['callbackAble'], aIsUrgent: CreateTaskProps<T>['aIsUrgent']);
+    isScheduling: boolean;
+    taskQueue: PriorityQueue<Task & T>;
+    static create<T>({ callbackAble, aIsUrgent }: CreateTaskProps<T>): TaskQueue<Task & T>;
+    pushTask(task: Task & T): void;
+    scheduleTask(): boolean;
+}
+
+declare function clean(cb: () => void): void;
+declare function runWithPulling(fn: Function, signal: Signal | null): void;
+
+declare const DefaultCustomSignalOpt: {
+    scheduler: Scheduler;
+    isScope: boolean;
+    immediate: boolean;
+};
+type CustomSignalOpt = Partial<typeof DefaultCustomSignalOpt>;
+type CreateSignal = {
+    <T extends (...args: any[]) => any>(get: T, opt?: CustomSignalOpt): Signal<ReturnType<T>>;
+    <T = any>(value: T, opt?: CustomSignalOpt): Signal<T>;
+};
+declare const $: CreateSignal;
+declare const effect: (customPull: (...args: ValueDiff[]) => void, depOrOpt?: Signal<any>[] | CustomSignalOpt, opt?: CustomSignalOpt) => any;
+declare const scope: (customPull: () => void) => Dispose;
+/**
+ * 数据变化时，自定义 触发订阅函数的时机
+ * @param {CustomSignalOpt} opt 配置如下:
+ * @prop scheduler: (runIfDirty, effect) => void 执行 runIfDirty 定制触发 effect 时机
+ * @prop scope: 用于统一释放 effect link 的作用域 默认是 defaultScope 可以全局获取
+ */
+declare const customEffect: (opt?: CustomSignalOpt) => typeof effect;
+
+export { $, Scheduler, TaskQueue, clean, customEffect, effect, runWithPulling, scheduler, scope };
+export type { CreateSignal, CreateTaskProps, CustomSignalOpt, DFSCtxBegin, DFSCtxCompete, Dispose, Getter, Mix, ScheduleHandler, SignalOpt, Task, ValueDiff, Vertex };