@zk-tech/bedrock 0.0.1

package/dist/structure/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/structure/graph.ts","../../src/structure/linked-list.ts","../../src/structure/min-heap.ts"],"names":[],"mappings":";;;AAAA,IAAM,OAAN,MAAiB;AAAA,EAIf,WAAA,CACS,KACA,IAAA,EACP;AAFO,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AALT,IAAA,IAAA,CAAS,QAAA,uBAAe,GAAA,EAAmB;AAC3C,IAAA,IAAA,CAAS,QAAA,uBAAe,GAAA,EAAmB;AAAA,EAKxC;AACL,CAAA;AAEO,IAAM,QAAN,MAAkB;AAAA,EAGvB,YAA6B,OAAA,EAA4B;AAA5B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAF7B,IAAA,IAAA,CAAiB,MAAA,uBAAa,GAAA,EAAmB;AAAA,EAES;AAAA;AAAA,EAGnD,KAAA,GAAsB;AAC3B,IAAA,MAAM,MAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAO,EAAG;AACvC,MAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,CAAA,EAAG;AAC5B,QAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,MACf;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA,EAGO,UAAA,CAAW,MAAS,EAAA,EAAa;AACtC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAC7C,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,EAAE,CAAA;AAEzC,IAAA,QAAA,CAAS,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AACxC,IAAA,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,QAAA,CAAS,GAAA,EAAK,QAAQ,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGO,WAAW,IAAA,EAAe;AAC/B,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC7B,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,GAAG,CAAA;AACtB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAO,EAAG;AACvC,MAAA,IAAA,CAAK,QAAA,CAAS,OAAO,GAAG,CAAA;AACxB,MAAA,IAAA,CAAK,QAAA,CAAS,OAAO,GAAG,CAAA;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAGO,OAAO,IAAA,EAAiC;AAC7C,IAAA,OAAO,KAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAC,CAAA;AAAA,EAC3C;AAAA;AAAA,EAGO,mBAAmB,IAAA,EAAqB;AAC7C,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC7B,IAAA,IAAI,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAE9B,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,IAAA,GAAO,IAAI,IAAA,CAAK,GAAA,EAAK,IAAI,CAAA;AACzB,MAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IAC3B;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,OAAO,IAAA,KAAS,CAAA;AAAA,EAC9B;AAAA,EAEO,QAAA,GAAmB;AACxB,IAAA,MAAM,OAAiB,EAAC;AACxB,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,KAAK,MAAA,EAAQ;AACtC,MAAA,IAAA,CAAK,IAAA;AAAA,QACH,GAAG,GAAG;AAAA,eAAA,EAAqB,CAAC,GAAG,KAAA,CAAM,QAAA,CAAS,MAAM,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,eAAA,EAAsB;AAAA,UACpF,GAAG,KAAA,CAAM,QAAA,CAAS,IAAA;AAAK,SACzB,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA;AAAA,OACb;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACvB;AAAA,EAEO,aAAA,GAAgB;AACrB,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,IAAI,CAAA,IAAK,KAAK,MAAA,EAAQ;AACpC,MAAA,MAAM,IAAA,mBAAO,IAAI,GAAA,CAAO,CAAC,EAAE,CAAC,CAAA;AAC5B,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,CAAW,IAAA,EAAM,IAAI,CAAA;AACtC,MAAA,IAAI,GAAA,EAAK;AACP,QAAA,OAAO,GAAA;AAAA,MACT;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,UAAA,CAAW,MAAkB,IAAA,EAAkC;AACrE,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,QAAQ,CAAA,IAAK,KAAK,QAAA,EAAU;AAC1C,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,EAAG;AAChB,QAAA,OAAO,CAAC,GAAG,IAAA,EAAM,EAAE,CAAA,CAAE,KAAK,MAAM,CAAA;AAAA,MAClC;AACA,MAAA,IAAA,CAAK,IAAI,EAAE,CAAA;AACX,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,QAAA,EAAU,IAAI,CAAA;AAC5C,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAA,CAAK,OAAO,EAAE,CAAA;AAAA,IAChB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACF;;;ACxGA,IAAM,WAAN,MAAkB;AAAA,EAChB,WAAA,CACS,KAAA,EACA,IAAA,GAA2B,IAAA,EAC3B,OAA2B,IAAA,EAClC;AAHO,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAAA,EACN;AACL,CAAA;AAEO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,MAAA,GAAS,CAAA;AAAA,EAAA;AAAA,EAEnB,IAAW,IAAA,GAAe;AACxB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA,EAEA,IAAW,SAAA,GAAgC;AACzC,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEO,OAAA,GAAmB;AACxB,IAAA,OAAO,KAAK,KAAA,KAAU,IAAA;AAAA,EACxB;AAAA,EAEO,KAAA,GAAc;AACnB,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAO,OAAA,CAAQ,IAAA;AACrB,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAEA,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,MAAA,GAAS,CAAA;AAAA,EAChB;AAAA,EAEO,QAAQ,KAAA,EAAyB;AACtC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAK,KAAA,EAAyB;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,GAAA,GAAgB;AACrB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,OAAA,GAAe;AACpB,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,KAAA,MAAW,SAAS,IAAA,EAAM;AACxB,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACnB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEA,EAAS,MAAA,CAAO,QAAQ,CAAA,GAAiB;AACvC,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAA,CAAQ,KAAA;AACd,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEU,QAAQ,IAAA,EAAyB;AAEzC,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,IAAA,CAAK,KAAA,IAAS,IAAA,KAAS,IAAA,CAAK,KAAA,EAAO;AAC1F,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AAGA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AACA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AAGA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,MAAA,EAAA;AAAA,EACP;AACF;;;AChJO,IAAM,UAAN,MAAiB;AAAA,EAItB,YAAY,eAAA,EAA0C;AAHtD,IAAA,IAAA,CAAiB,QAAa,EAAC;AAI7B,IAAA,IAAI,eAAA,EAAiB;AACnB,MAAA,IAAA,CAAK,QAAA,GAAW,eAAA;AAAA,IAClB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,QAAA,GAAW,CAAC,CAAA,EAAG,CAAA,KAAM;AACxB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,QAAA,OAAO,CAAA;AAAA,MACT,CAAA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,OAAO,KAAA,EAAgB;AAC5B,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,KAAK,CAAA;AACrB,IAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,EACf;AAAA,EAEO,IAAA,GAAiB;AACtB,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA,GAAS,IAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA;AAAA,EACjD;AAAA,EAEO,MAAA,GAAmB;AACxB,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AACpC,IAAA,IAAI,KAAK,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,IAAA,CAAK,MAAM,GAAA,EAAI;AAEnD,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACzB,IAAA,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA,CAAK,MAAM,GAAA,EAAI;AAC/B,IAAA,IAAA,CAAK,SAAA,EAAU;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,IAAA,GAAe;AACpB,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA,EAEO,KAAA,GAAc;AACnB,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AAAA,EACtB;AAAA,EAEQ,mBAAmB,WAAA,EAA6B;AACtD,IAAA,OAAO,IAAI,WAAA,GAAc,CAAA;AAAA,EAC3B;AAAA,EAEQ,oBAAoB,WAAA,EAA6B;AACvD,IAAA,OAAO,IAAI,WAAA,GAAc,CAAA;AAAA,EAC3B;AAAA,EAEQ,gBAAgB,UAAA,EAA4B;AAClD,IAAA,OAAO,IAAA,CAAK,KAAA,CAAA,CAAO,UAAA,GAAa,CAAA,IAAK,CAAC,CAAA;AAAA,EACxC;AAAA,EAEQ,KAAA,CAAM,UAAkB,QAAA,EAAwB;AACtD,IAAA,CAAC,KAAK,KAAA,CAAM,QAAQ,CAAA,EAAG,IAAA,CAAK,MAAM,QAAQ,CAAC,CAAA,GAAI,CAAC,KAAK,KAAA,CAAM,QAAQ,GAAG,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAC,CAAA;AAAA,EAC5F;AAAA,EAEQ,OAAA,GAAgB;AACtB,IAAA,IAAI,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,MAAA,GAAS,CAAA;AAChC,IAAA,OAAO,QAAQ,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,MAAM,IAAA,CAAK,eAAA,CAAgB,KAAK,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,IAAI,CAAA,EAAG;AACjG,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,eAAA,CAAgB,KAAK,CAAA;AAC9C,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,WAAW,CAAA;AAC7B,MAAA,KAAA,GAAQ,WAAA;AAAA,IACV;AAAA,EACF;AAAA,EAEQ,SAAA,GAAkB;AACxB,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,IAAI,iBAAA,GAAoB,IAAA,CAAK,kBAAA,CAAmB,KAAK,CAAA;AAErD,IAAA,OAAO,iBAAA,GAAoB,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ;AAC5C,MAAA,MAAM,eAAA,GAAkB,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AACtD,MAAA,IACE,eAAA,GAAkB,IAAA,CAAK,KAAA,CAAM,MAAA,IAC7B,KAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,eAAe,GAAG,IAAA,CAAK,KAAA,CAAM,iBAAiB,CAAC,IAAI,CAAA,EAC5E;AACA,QAAA,iBAAA,GAAoB,eAAA;AAAA,MACtB;AAEA,MAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,iBAAiB,CAAC,CAAA,IAAK,CAAA,EAAG;AACxE,QAAA;AAAA,MACF;AAEA,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,iBAAiB,CAAA;AACnC,MAAA,KAAA,GAAQ,iBAAA;AACR,MAAA,iBAAA,GAAoB,IAAA,CAAK,mBAAmB,KAAK,CAAA;AAAA,IACnD;AAAA,EACF;AACF","file":"index.cjs","sourcesContent":["class Node<K, T> {\n  readonly incoming = new Map<K, Node<K, T>>();\n  readonly outgoing = new Map<K, Node<K, T>>();\n\n  constructor(\n    public key: K,\n    public data: T,\n  ) {}\n}\n\nexport class Graph<K, T> {\n  private readonly _nodes = new Map<K, Node<K, T>>();\n\n  constructor(private readonly _hashFn: (element: T) => K) {}\n\n  // 寻找所有的叶子节点\n  public leafs(): Node<K, T>[] {\n    const ret: Node<K, T>[] = [];\n    for (const node of this._nodes.values()) {\n      if (node.outgoing.size === 0) {\n        ret.push(node);\n      }\n    }\n    return ret;\n  }\n\n  // 插入一条边\n  public insertEdge(from: T, to: T): void {\n    const fromNode = this.lookupOrInsertNode(from);\n    const toNode = this.lookupOrInsertNode(to);\n\n    fromNode.outgoing.set(toNode.key, toNode);\n    toNode.incoming.set(fromNode.key, fromNode);\n  }\n\n  // 移除某个节点\n  public removeNode(data: T): void {\n    const key = this._hashFn(data);\n    this._nodes.delete(key);\n    for (const node of this._nodes.values()) {\n      node.outgoing.delete(key);\n      node.incoming.delete(key);\n    }\n  }\n\n  // 查找某个节点\n  public lookup(data: T): Node<K, T> | undefined {\n    return this._nodes.get(this._hashFn(data));\n  }\n\n  // 查找某个节点，不存在则插入\n  public lookupOrInsertNode(data: T): Node<K, T> {\n    const key = this._hashFn(data);\n    let node = this._nodes.get(key);\n\n    if (!node) {\n      node = new Node(key, data);\n      this._nodes.set(key, node);\n    }\n\n    return node;\n  }\n\n  public isEmpty(): boolean {\n    return this._nodes.size === 0;\n  }\n\n  public toString(): string {\n    const data: string[] = [];\n    for (const [key, value] of this._nodes) {\n      data.push(\n        `${key}\\n\\t(-> incoming)[${[...value.incoming.keys()].join(', ')}]\\n\\t(outgoing ->)[${[\n          ...value.outgoing.keys(),\n        ].join(',')}]\\n`,\n      );\n    }\n    return data.join('\\n');\n  }\n\n  public findCycleSlow() {\n    for (const [id, node] of this._nodes) {\n      const seen = new Set<K>([id]);\n      const res = this._findCycle(node, seen);\n      if (res) {\n        return res;\n      }\n    }\n    return undefined;\n  }\n\n  private _findCycle(node: Node<K, T>, seen: Set<K>): string | undefined {\n    for (const [id, outgoing] of node.outgoing) {\n      if (seen.has(id)) {\n        return [...seen, id].join(' -> ');\n      }\n      seen.add(id);\n      const value = this._findCycle(outgoing, seen);\n      if (value) {\n        return value;\n      }\n      seen.delete(id);\n    }\n    return undefined;\n  }\n}\n","class ListNode<T> {\n  constructor(\n    public value: T,\n    public next: ListNode<T> | null = null,\n    public prev: ListNode<T> | null = null,\n  ) {}\n}\n\nexport class LinkedList<T> {\n  protected _head: ListNode<T> | null = null;\n  protected _tail: ListNode<T> | null = null;\n  protected _count = 0;\n\n  public get size(): number {\n    return this._count;\n  }\n\n  public get firstNode(): ListNode<T> | null {\n    return this._head;\n  }\n\n  public isEmpty(): boolean {\n    return this._head === null;\n  }\n\n  public clear(): void {\n    let current = this._head;\n    while (current !== null) {\n      const next = current.next;\n      current.prev = null;\n      current.next = null;\n      current = next;\n    }\n\n    this._head = null;\n    this._tail = null;\n    this._count = 0;\n  }\n\n  public unshift(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldHead = this._head;\n      this._head = node;\n      node.next = oldHead;\n      oldHead!.prev = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public push(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldTail = this._tail;\n      this._tail = node;\n      node.prev = oldTail;\n      oldTail!.next = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public shift(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._head!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public pop(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._tail!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public toArray(): T[] {\n    const result: T[] = [];\n    for (const value of this) {\n      result.push(value);\n    }\n    return result;\n  }\n\n  public *[Symbol.iterator](): Iterator<T> {\n    let current = this._head;\n    while (current !== null) {\n      yield current.value;\n      current = current.next;\n    }\n  }\n\n  protected _remove(node: ListNode<T>): void {\n    // 如果节点已经被移除（prev 和 next 都为 null），直接返回\n    if (node.prev === null && node.next === null && node !== this._head && node !== this._tail) {\n      return;\n    }\n\n    // 更新链表头尾指针\n    if (node === this._head) {\n      this._head = node.next;\n      if (this._head) {\n        this._head.prev = null;\n      }\n    }\n    if (node === this._tail) {\n      this._tail = node.prev;\n      if (this._tail) {\n        this._tail.next = null;\n      }\n    }\n\n    // 更新相邻节点的引用\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    }\n\n    // 清理被移除节点的引用\n    node.prev = null;\n    node.next = null;\n    this._count--;\n  }\n}\n","export class MinHeap<T> {\n  private readonly _heap: T[] = [];\n  private readonly _compare: (a: T, b: T) => number;\n\n  constructor(compareFunction?: (a: T, b: T) => number) {\n    if (compareFunction) {\n      this._compare = compareFunction;\n    } else {\n      this._compare = (a, b) => {\n        if (a < b) return -1;\n        if (a > b) return 1;\n        return 0;\n      };\n    }\n  }\n\n  public insert(value: T): void {\n    this._heap.push(value);\n    this._siftUp();\n  }\n\n  public peek(): T | null {\n    return this._heap.length > 0 ? this._heap[0] : null;\n  }\n\n  public remove(): T | null {\n    if (this._heap.length === 0) return null;\n    if (this._heap.length === 1) return this._heap.pop()!;\n\n    const item = this._heap[0];\n    this._heap[0] = this._heap.pop()!;\n    this._siftDown();\n    return item;\n  }\n\n  public size(): number {\n    return this._heap.length;\n  }\n\n  public clear(): void {\n    this._heap.length = 0;\n  }\n\n  private _getLeftChildIndex(parentIndex: number): number {\n    return 2 * parentIndex + 1;\n  }\n\n  private _getRightChildIndex(parentIndex: number): number {\n    return 2 * parentIndex + 2;\n  }\n\n  private _getParentIndex(childIndex: number): number {\n    return Math.floor((childIndex - 1) / 2);\n  }\n\n  private _swap(indexOne: number, indexTwo: number): void {\n    [this._heap[indexOne], this._heap[indexTwo]] = [this._heap[indexTwo], this._heap[indexOne]];\n  }\n\n  private _siftUp(): void {\n    let index = this._heap.length - 1;\n    while (index > 0 && this._compare(this._heap[this._getParentIndex(index)], this._heap[index]) > 0) {\n      const parentIndex = this._getParentIndex(index);\n      this._swap(index, parentIndex);\n      index = parentIndex;\n    }\n  }\n\n  private _siftDown(): void {\n    let index = 0;\n    let smallerChildIndex = this._getLeftChildIndex(index);\n\n    while (smallerChildIndex < this._heap.length) {\n      const rightChildIndex = this._getRightChildIndex(index);\n      if (\n        rightChildIndex < this._heap.length &&\n        this._compare(this._heap[rightChildIndex], this._heap[smallerChildIndex]) < 0\n      ) {\n        smallerChildIndex = rightChildIndex;\n      }\n\n      if (this._compare(this._heap[index], this._heap[smallerChildIndex]) <= 0) {\n        break;\n      }\n\n      this._swap(index, smallerChildIndex);\n      index = smallerChildIndex;\n      smallerChildIndex = this._getLeftChildIndex(index);\n    }\n  }\n}\n"]}

package/dist/structure/index.d.cts

@@ -0,0 +1,21 @@
+export { G as Graph } from '../graph-BGbNOniY.cjs';
+export { L as LinkedList } from '../linked-list-CUkue5DZ.cjs';
+
+declare class MinHeap<T> {
+    private readonly _heap;
+    private readonly _compare;
+    constructor(compareFunction?: (a: T, b: T) => number);
+    insert(value: T): void;
+    peek(): T | null;
+    remove(): T | null;
+    size(): number;
+    clear(): void;
+    private _getLeftChildIndex;
+    private _getRightChildIndex;
+    private _getParentIndex;
+    private _swap;
+    private _siftUp;
+    private _siftDown;
+}
+
+export { MinHeap };

package/dist/structure/index.d.ts

@@ -0,0 +1,21 @@
+export { G as Graph } from '../graph-BGbNOniY.js';
+export { L as LinkedList } from '../linked-list-CUkue5DZ.js';
+
+declare class MinHeap<T> {
+    private readonly _heap;
+    private readonly _compare;
+    constructor(compareFunction?: (a: T, b: T) => number);
+    insert(value: T): void;
+    peek(): T | null;
+    remove(): T | null;
+    size(): number;
+    clear(): void;
+    private _getLeftChildIndex;
+    private _getRightChildIndex;
+    private _getParentIndex;
+    private _swap;
+    private _siftUp;
+    private _siftDown;
+}
+
+export { MinHeap };

package/dist/structure/index.js

@@ -0,0 +1,296 @@
+// src/structure/graph.ts
+var Node = class {
+  constructor(key, data) {
+    this.key = key;
+    this.data = data;
+    this.incoming = /* @__PURE__ */ new Map();
+    this.outgoing = /* @__PURE__ */ new Map();
+  }
+};
+var Graph = class {
+  constructor(_hashFn) {
+    this._hashFn = _hashFn;
+    this._nodes = /* @__PURE__ */ new Map();
+  }
+  // 寻找所有的叶子节点
+  leafs() {
+    const ret = [];
+    for (const node of this._nodes.values()) {
+      if (node.outgoing.size === 0) {
+        ret.push(node);
+      }
+    }
+    return ret;
+  }
+  // 插入一条边
+  insertEdge(from, to) {
+    const fromNode = this.lookupOrInsertNode(from);
+    const toNode = this.lookupOrInsertNode(to);
+    fromNode.outgoing.set(toNode.key, toNode);
+    toNode.incoming.set(fromNode.key, fromNode);
+  }
+  // 移除某个节点
+  removeNode(data) {
+    const key = this._hashFn(data);
+    this._nodes.delete(key);
+    for (const node of this._nodes.values()) {
+      node.outgoing.delete(key);
+      node.incoming.delete(key);
+    }
+  }
+  // 查找某个节点
+  lookup(data) {
+    return this._nodes.get(this._hashFn(data));
+  }
+  // 查找某个节点，不存在则插入
+  lookupOrInsertNode(data) {
+    const key = this._hashFn(data);
+    let node = this._nodes.get(key);
+    if (!node) {
+      node = new Node(key, data);
+      this._nodes.set(key, node);
+    }
+    return node;
+  }
+  isEmpty() {
+    return this._nodes.size === 0;
+  }
+  toString() {
+    const data = [];
+    for (const [key, value] of this._nodes) {
+      data.push(
+        `${key}
+	(-> incoming)[${[...value.incoming.keys()].join(", ")}]
+	(outgoing ->)[${[
+          ...value.outgoing.keys()
+        ].join(",")}]
+`
+      );
+    }
+    return data.join("\n");
+  }
+  findCycleSlow() {
+    for (const [id, node] of this._nodes) {
+      const seen = /* @__PURE__ */ new Set([id]);
+      const res = this._findCycle(node, seen);
+      if (res) {
+        return res;
+      }
+    }
+    return void 0;
+  }
+  _findCycle(node, seen) {
+    for (const [id, outgoing] of node.outgoing) {
+      if (seen.has(id)) {
+        return [...seen, id].join(" -> ");
+      }
+      seen.add(id);
+      const value = this._findCycle(outgoing, seen);
+      if (value) {
+        return value;
+      }
+      seen.delete(id);
+    }
+    return void 0;
+  }
+};
+
+// src/structure/linked-list.ts
+var ListNode = class {
+  constructor(value, next = null, prev = null) {
+    this.value = value;
+    this.next = next;
+    this.prev = prev;
+  }
+};
+var LinkedList = class {
+  constructor() {
+    this._head = null;
+    this._tail = null;
+    this._count = 0;
+  }
+  get size() {
+    return this._count;
+  }
+  get firstNode() {
+    return this._head;
+  }
+  isEmpty() {
+    return this._head === null;
+  }
+  clear() {
+    let current = this._head;
+    while (current !== null) {
+      const next = current.next;
+      current.prev = null;
+      current.next = null;
+      current = next;
+    }
+    this._head = null;
+    this._tail = null;
+    this._count = 0;
+  }
+  unshift(value) {
+    const node = new ListNode(value);
+    if (this.isEmpty()) {
+      this._head = node;
+      this._tail = node;
+    } else {
+      const oldHead = this._head;
+      this._head = node;
+      node.next = oldHead;
+      oldHead.prev = node;
+    }
+    this._count++;
+    return this;
+  }
+  push(value) {
+    const node = new ListNode(value);
+    if (this.isEmpty()) {
+      this._head = node;
+      this._tail = node;
+    } else {
+      const oldTail = this._tail;
+      this._tail = node;
+      node.prev = oldTail;
+      oldTail.next = node;
+    }
+    this._count++;
+    return this;
+  }
+  shift() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const node = this._head;
+    const value = node.value;
+    this._remove(node);
+    return value;
+  }
+  pop() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const node = this._tail;
+    const value = node.value;
+    this._remove(node);
+    return value;
+  }
+  toArray() {
+    const result = [];
+    for (const value of this) {
+      result.push(value);
+    }
+    return result;
+  }
+  *[Symbol.iterator]() {
+    let current = this._head;
+    while (current !== null) {
+      yield current.value;
+      current = current.next;
+    }
+  }
+  _remove(node) {
+    if (node.prev === null && node.next === null && node !== this._head && node !== this._tail) {
+      return;
+    }
+    if (node === this._head) {
+      this._head = node.next;
+      if (this._head) {
+        this._head.prev = null;
+      }
+    }
+    if (node === this._tail) {
+      this._tail = node.prev;
+      if (this._tail) {
+        this._tail.next = null;
+      }
+    }
+    if (node.prev) {
+      node.prev.next = node.next;
+    }
+    if (node.next) {
+      node.next.prev = node.prev;
+    }
+    node.prev = null;
+    node.next = null;
+    this._count--;
+  }
+};
+
+// src/structure/min-heap.ts
+var MinHeap = class {
+  constructor(compareFunction) {
+    this._heap = [];
+    if (compareFunction) {
+      this._compare = compareFunction;
+    } else {
+      this._compare = (a, b) => {
+        if (a < b) return -1;
+        if (a > b) return 1;
+        return 0;
+      };
+    }
+  }
+  insert(value) {
+    this._heap.push(value);
+    this._siftUp();
+  }
+  peek() {
+    return this._heap.length > 0 ? this._heap[0] : null;
+  }
+  remove() {
+    if (this._heap.length === 0) return null;
+    if (this._heap.length === 1) return this._heap.pop();
+    const item = this._heap[0];
+    this._heap[0] = this._heap.pop();
+    this._siftDown();
+    return item;
+  }
+  size() {
+    return this._heap.length;
+  }
+  clear() {
+    this._heap.length = 0;
+  }
+  _getLeftChildIndex(parentIndex) {
+    return 2 * parentIndex + 1;
+  }
+  _getRightChildIndex(parentIndex) {
+    return 2 * parentIndex + 2;
+  }
+  _getParentIndex(childIndex) {
+    return Math.floor((childIndex - 1) / 2);
+  }
+  _swap(indexOne, indexTwo) {
+    [this._heap[indexOne], this._heap[indexTwo]] = [this._heap[indexTwo], this._heap[indexOne]];
+  }
+  _siftUp() {
+    let index = this._heap.length - 1;
+    while (index > 0 && this._compare(this._heap[this._getParentIndex(index)], this._heap[index]) > 0) {
+      const parentIndex = this._getParentIndex(index);
+      this._swap(index, parentIndex);
+      index = parentIndex;
+    }
+  }
+  _siftDown() {
+    let index = 0;
+    let smallerChildIndex = this._getLeftChildIndex(index);
+    while (smallerChildIndex < this._heap.length) {
+      const rightChildIndex = this._getRightChildIndex(index);
+      if (rightChildIndex < this._heap.length && this._compare(this._heap[rightChildIndex], this._heap[smallerChildIndex]) < 0) {
+        smallerChildIndex = rightChildIndex;
+      }
+      if (this._compare(this._heap[index], this._heap[smallerChildIndex]) <= 0) {
+        break;
+      }
+      this._swap(index, smallerChildIndex);
+      index = smallerChildIndex;
+      smallerChildIndex = this._getLeftChildIndex(index);
+    }
+  }
+};
+
+export { Graph, LinkedList, MinHeap };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/structure/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/structure/graph.ts","../../src/structure/linked-list.ts","../../src/structure/min-heap.ts"],"names":[],"mappings":";AAAA,IAAM,OAAN,MAAiB;AAAA,EAIf,WAAA,CACS,KACA,IAAA,EACP;AAFO,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AALT,IAAA,IAAA,CAAS,QAAA,uBAAe,GAAA,EAAmB;AAC3C,IAAA,IAAA,CAAS,QAAA,uBAAe,GAAA,EAAmB;AAAA,EAKxC;AACL,CAAA;AAEO,IAAM,QAAN,MAAkB;AAAA,EAGvB,YAA6B,OAAA,EAA4B;AAA5B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAF7B,IAAA,IAAA,CAAiB,MAAA,uBAAa,GAAA,EAAmB;AAAA,EAES;AAAA;AAAA,EAGnD,KAAA,GAAsB;AAC3B,IAAA,MAAM,MAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAO,EAAG;AACvC,MAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,CAAA,EAAG;AAC5B,QAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,MACf;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA,EAGO,UAAA,CAAW,MAAS,EAAA,EAAa;AACtC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAC7C,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,EAAE,CAAA;AAEzC,IAAA,QAAA,CAAS,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AACxC,IAAA,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,QAAA,CAAS,GAAA,EAAK,QAAQ,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGO,WAAW,IAAA,EAAe;AAC/B,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC7B,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,GAAG,CAAA;AACtB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAO,EAAG;AACvC,MAAA,IAAA,CAAK,QAAA,CAAS,OAAO,GAAG,CAAA;AACxB,MAAA,IAAA,CAAK,QAAA,CAAS,OAAO,GAAG,CAAA;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAGO,OAAO,IAAA,EAAiC;AAC7C,IAAA,OAAO,KAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAC,CAAA;AAAA,EAC3C;AAAA;AAAA,EAGO,mBAAmB,IAAA,EAAqB;AAC7C,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC7B,IAAA,IAAI,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAE9B,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,IAAA,GAAO,IAAI,IAAA,CAAK,GAAA,EAAK,IAAI,CAAA;AACzB,MAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IAC3B;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,OAAA,GAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,OAAO,IAAA,KAAS,CAAA;AAAA,EAC9B;AAAA,EAEO,QAAA,GAAmB;AACxB,IAAA,MAAM,OAAiB,EAAC;AACxB,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,KAAK,MAAA,EAAQ;AACtC,MAAA,IAAA,CAAK,IAAA;AAAA,QACH,GAAG,GAAG;AAAA,eAAA,EAAqB,CAAC,GAAG,KAAA,CAAM,QAAA,CAAS,MAAM,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,eAAA,EAAsB;AAAA,UACpF,GAAG,KAAA,CAAM,QAAA,CAAS,IAAA;AAAK,SACzB,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA;AAAA,OACb;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACvB;AAAA,EAEO,aAAA,GAAgB;AACrB,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,IAAI,CAAA,IAAK,KAAK,MAAA,EAAQ;AACpC,MAAA,MAAM,IAAA,mBAAO,IAAI,GAAA,CAAO,CAAC,EAAE,CAAC,CAAA;AAC5B,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,CAAW,IAAA,EAAM,IAAI,CAAA;AACtC,MAAA,IAAI,GAAA,EAAK;AACP,QAAA,OAAO,GAAA;AAAA,MACT;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,UAAA,CAAW,MAAkB,IAAA,EAAkC;AACrE,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,QAAQ,CAAA,IAAK,KAAK,QAAA,EAAU;AAC1C,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,EAAG;AAChB,QAAA,OAAO,CAAC,GAAG,IAAA,EAAM,EAAE,CAAA,CAAE,KAAK,MAAM,CAAA;AAAA,MAClC;AACA,MAAA,IAAA,CAAK,IAAI,EAAE,CAAA;AACX,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,QAAA,EAAU,IAAI,CAAA;AAC5C,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAA,CAAK,OAAO,EAAE,CAAA;AAAA,IAChB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACF;;;ACxGA,IAAM,WAAN,MAAkB;AAAA,EAChB,WAAA,CACS,KAAA,EACA,IAAA,GAA2B,IAAA,EAC3B,OAA2B,IAAA,EAClC;AAHO,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAAA,EACN;AACL,CAAA;AAEO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,KAAA,GAA4B,IAAA;AACtC,IAAA,IAAA,CAAU,MAAA,GAAS,CAAA;AAAA,EAAA;AAAA,EAEnB,IAAW,IAAA,GAAe;AACxB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA,EAEA,IAAW,SAAA,GAAgC;AACzC,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEO,OAAA,GAAmB;AACxB,IAAA,OAAO,KAAK,KAAA,KAAU,IAAA;AAAA,EACxB;AAAA,EAEO,KAAA,GAAc;AACnB,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAO,OAAA,CAAQ,IAAA;AACrB,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,CAAQ,IAAA,GAAO,IAAA;AACf,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAEA,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,MAAA,GAAS,CAAA;AAAA,EAChB;AAAA,EAEO,QAAQ,KAAA,EAAyB;AACtC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAK,KAAA,EAAyB;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,QAAA,CAAS,KAAK,CAAA;AAE/B,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,MAAM,UAAU,IAAA,CAAK,KAAA;AACrB,MAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA,OAAA,CAAS,IAAA,GAAO,IAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,KAAA,GAAkB;AACvB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,GAAA,GAAgB;AACrB,IAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEO,OAAA,GAAe;AACpB,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,KAAA,MAAW,SAAS,IAAA,EAAM;AACxB,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACnB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEA,EAAS,MAAA,CAAO,QAAQ,CAAA,GAAiB;AACvC,IAAA,IAAI,UAAU,IAAA,CAAK,KAAA;AACnB,IAAA,OAAO,YAAY,IAAA,EAAM;AACvB,MAAA,MAAM,OAAA,CAAQ,KAAA;AACd,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEU,QAAQ,IAAA,EAAyB;AAEzC,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,IAAA,CAAK,KAAA,IAAS,IAAA,KAAS,IAAA,CAAK,KAAA,EAAO;AAC1F,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,KAAK,KAAA,EAAO;AACvB,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AAClB,MAAA,IAAI,KAAK,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAM,IAAA,GAAO,IAAA;AAAA,MACpB;AAAA,IACF;AAGA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AACA,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AAAA,IACxB;AAGA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,MAAA,EAAA;AAAA,EACP;AACF;;;AChJO,IAAM,UAAN,MAAiB;AAAA,EAItB,YAAY,eAAA,EAA0C;AAHtD,IAAA,IAAA,CAAiB,QAAa,EAAC;AAI7B,IAAA,IAAI,eAAA,EAAiB;AACnB,MAAA,IAAA,CAAK,QAAA,GAAW,eAAA;AAAA,IAClB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,QAAA,GAAW,CAAC,CAAA,EAAG,CAAA,KAAM;AACxB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,QAAA,OAAO,CAAA;AAAA,MACT,CAAA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,OAAO,KAAA,EAAgB;AAC5B,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,KAAK,CAAA;AACrB,IAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,EACf;AAAA,EAEO,IAAA,GAAiB;AACtB,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA,GAAS,IAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA;AAAA,EACjD;AAAA,EAEO,MAAA,GAAmB;AACxB,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AACpC,IAAA,IAAI,KAAK,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,IAAA,CAAK,MAAM,GAAA,EAAI;AAEnD,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACzB,IAAA,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA,CAAK,MAAM,GAAA,EAAI;AAC/B,IAAA,IAAA,CAAK,SAAA,EAAU;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEO,IAAA,GAAe;AACpB,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA,EAEO,KAAA,GAAc;AACnB,IAAA,IAAA,CAAK,MAAM,MAAA,GAAS,CAAA;AAAA,EACtB;AAAA,EAEQ,mBAAmB,WAAA,EAA6B;AACtD,IAAA,OAAO,IAAI,WAAA,GAAc,CAAA;AAAA,EAC3B;AAAA,EAEQ,oBAAoB,WAAA,EAA6B;AACvD,IAAA,OAAO,IAAI,WAAA,GAAc,CAAA;AAAA,EAC3B;AAAA,EAEQ,gBAAgB,UAAA,EAA4B;AAClD,IAAA,OAAO,IAAA,CAAK,KAAA,CAAA,CAAO,UAAA,GAAa,CAAA,IAAK,CAAC,CAAA;AAAA,EACxC;AAAA,EAEQ,KAAA,CAAM,UAAkB,QAAA,EAAwB;AACtD,IAAA,CAAC,KAAK,KAAA,CAAM,QAAQ,CAAA,EAAG,IAAA,CAAK,MAAM,QAAQ,CAAC,CAAA,GAAI,CAAC,KAAK,KAAA,CAAM,QAAQ,GAAG,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAC,CAAA;AAAA,EAC5F;AAAA,EAEQ,OAAA,GAAgB;AACtB,IAAA,IAAI,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,MAAA,GAAS,CAAA;AAChC,IAAA,OAAO,QAAQ,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,MAAM,IAAA,CAAK,eAAA,CAAgB,KAAK,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,IAAI,CAAA,EAAG;AACjG,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,eAAA,CAAgB,KAAK,CAAA;AAC9C,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,WAAW,CAAA;AAC7B,MAAA,KAAA,GAAQ,WAAA;AAAA,IACV;AAAA,EACF;AAAA,EAEQ,SAAA,GAAkB;AACxB,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,IAAI,iBAAA,GAAoB,IAAA,CAAK,kBAAA,CAAmB,KAAK,CAAA;AAErD,IAAA,OAAO,iBAAA,GAAoB,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ;AAC5C,MAAA,MAAM,eAAA,GAAkB,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AACtD,MAAA,IACE,eAAA,GAAkB,IAAA,CAAK,KAAA,CAAM,MAAA,IAC7B,KAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,eAAe,GAAG,IAAA,CAAK,KAAA,CAAM,iBAAiB,CAAC,IAAI,CAAA,EAC5E;AACA,QAAA,iBAAA,GAAoB,eAAA;AAAA,MACtB;AAEA,MAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,iBAAiB,CAAC,CAAA,IAAK,CAAA,EAAG;AACxE,QAAA;AAAA,MACF;AAEA,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,iBAAiB,CAAA;AACnC,MAAA,KAAA,GAAQ,iBAAA;AACR,MAAA,iBAAA,GAAoB,IAAA,CAAK,mBAAmB,KAAK,CAAA;AAAA,IACnD;AAAA,EACF;AACF","file":"index.js","sourcesContent":["class Node<K, T> {\n  readonly incoming = new Map<K, Node<K, T>>();\n  readonly outgoing = new Map<K, Node<K, T>>();\n\n  constructor(\n    public key: K,\n    public data: T,\n  ) {}\n}\n\nexport class Graph<K, T> {\n  private readonly _nodes = new Map<K, Node<K, T>>();\n\n  constructor(private readonly _hashFn: (element: T) => K) {}\n\n  // 寻找所有的叶子节点\n  public leafs(): Node<K, T>[] {\n    const ret: Node<K, T>[] = [];\n    for (const node of this._nodes.values()) {\n      if (node.outgoing.size === 0) {\n        ret.push(node);\n      }\n    }\n    return ret;\n  }\n\n  // 插入一条边\n  public insertEdge(from: T, to: T): void {\n    const fromNode = this.lookupOrInsertNode(from);\n    const toNode = this.lookupOrInsertNode(to);\n\n    fromNode.outgoing.set(toNode.key, toNode);\n    toNode.incoming.set(fromNode.key, fromNode);\n  }\n\n  // 移除某个节点\n  public removeNode(data: T): void {\n    const key = this._hashFn(data);\n    this._nodes.delete(key);\n    for (const node of this._nodes.values()) {\n      node.outgoing.delete(key);\n      node.incoming.delete(key);\n    }\n  }\n\n  // 查找某个节点\n  public lookup(data: T): Node<K, T> | undefined {\n    return this._nodes.get(this._hashFn(data));\n  }\n\n  // 查找某个节点，不存在则插入\n  public lookupOrInsertNode(data: T): Node<K, T> {\n    const key = this._hashFn(data);\n    let node = this._nodes.get(key);\n\n    if (!node) {\n      node = new Node(key, data);\n      this._nodes.set(key, node);\n    }\n\n    return node;\n  }\n\n  public isEmpty(): boolean {\n    return this._nodes.size === 0;\n  }\n\n  public toString(): string {\n    const data: string[] = [];\n    for (const [key, value] of this._nodes) {\n      data.push(\n        `${key}\\n\\t(-> incoming)[${[...value.incoming.keys()].join(', ')}]\\n\\t(outgoing ->)[${[\n          ...value.outgoing.keys(),\n        ].join(',')}]\\n`,\n      );\n    }\n    return data.join('\\n');\n  }\n\n  public findCycleSlow() {\n    for (const [id, node] of this._nodes) {\n      const seen = new Set<K>([id]);\n      const res = this._findCycle(node, seen);\n      if (res) {\n        return res;\n      }\n    }\n    return undefined;\n  }\n\n  private _findCycle(node: Node<K, T>, seen: Set<K>): string | undefined {\n    for (const [id, outgoing] of node.outgoing) {\n      if (seen.has(id)) {\n        return [...seen, id].join(' -> ');\n      }\n      seen.add(id);\n      const value = this._findCycle(outgoing, seen);\n      if (value) {\n        return value;\n      }\n      seen.delete(id);\n    }\n    return undefined;\n  }\n}\n","class ListNode<T> {\n  constructor(\n    public value: T,\n    public next: ListNode<T> | null = null,\n    public prev: ListNode<T> | null = null,\n  ) {}\n}\n\nexport class LinkedList<T> {\n  protected _head: ListNode<T> | null = null;\n  protected _tail: ListNode<T> | null = null;\n  protected _count = 0;\n\n  public get size(): number {\n    return this._count;\n  }\n\n  public get firstNode(): ListNode<T> | null {\n    return this._head;\n  }\n\n  public isEmpty(): boolean {\n    return this._head === null;\n  }\n\n  public clear(): void {\n    let current = this._head;\n    while (current !== null) {\n      const next = current.next;\n      current.prev = null;\n      current.next = null;\n      current = next;\n    }\n\n    this._head = null;\n    this._tail = null;\n    this._count = 0;\n  }\n\n  public unshift(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldHead = this._head;\n      this._head = node;\n      node.next = oldHead;\n      oldHead!.prev = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public push(value: T): LinkedList<T> {\n    const node = new ListNode(value);\n\n    if (this.isEmpty()) {\n      this._head = node;\n      this._tail = node;\n    } else {\n      const oldTail = this._tail;\n      this._tail = node;\n      node.prev = oldTail;\n      oldTail!.next = node;\n    }\n\n    this._count++;\n    return this;\n  }\n\n  public shift(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._head!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public pop(): T | null {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const node = this._tail!;\n    const value = node.value;\n    this._remove(node);\n    return value;\n  }\n\n  public toArray(): T[] {\n    const result: T[] = [];\n    for (const value of this) {\n      result.push(value);\n    }\n    return result;\n  }\n\n  public *[Symbol.iterator](): Iterator<T> {\n    let current = this._head;\n    while (current !== null) {\n      yield current.value;\n      current = current.next;\n    }\n  }\n\n  protected _remove(node: ListNode<T>): void {\n    // 如果节点已经被移除（prev 和 next 都为 null），直接返回\n    if (node.prev === null && node.next === null && node !== this._head && node !== this._tail) {\n      return;\n    }\n\n    // 更新链表头尾指针\n    if (node === this._head) {\n      this._head = node.next;\n      if (this._head) {\n        this._head.prev = null;\n      }\n    }\n    if (node === this._tail) {\n      this._tail = node.prev;\n      if (this._tail) {\n        this._tail.next = null;\n      }\n    }\n\n    // 更新相邻节点的引用\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    }\n\n    // 清理被移除节点的引用\n    node.prev = null;\n    node.next = null;\n    this._count--;\n  }\n}\n","export class MinHeap<T> {\n  private readonly _heap: T[] = [];\n  private readonly _compare: (a: T, b: T) => number;\n\n  constructor(compareFunction?: (a: T, b: T) => number) {\n    if (compareFunction) {\n      this._compare = compareFunction;\n    } else {\n      this._compare = (a, b) => {\n        if (a < b) return -1;\n        if (a > b) return 1;\n        return 0;\n      };\n    }\n  }\n\n  public insert(value: T): void {\n    this._heap.push(value);\n    this._siftUp();\n  }\n\n  public peek(): T | null {\n    return this._heap.length > 0 ? this._heap[0] : null;\n  }\n\n  public remove(): T | null {\n    if (this._heap.length === 0) return null;\n    if (this._heap.length === 1) return this._heap.pop()!;\n\n    const item = this._heap[0];\n    this._heap[0] = this._heap.pop()!;\n    this._siftDown();\n    return item;\n  }\n\n  public size(): number {\n    return this._heap.length;\n  }\n\n  public clear(): void {\n    this._heap.length = 0;\n  }\n\n  private _getLeftChildIndex(parentIndex: number): number {\n    return 2 * parentIndex + 1;\n  }\n\n  private _getRightChildIndex(parentIndex: number): number {\n    return 2 * parentIndex + 2;\n  }\n\n  private _getParentIndex(childIndex: number): number {\n    return Math.floor((childIndex - 1) / 2);\n  }\n\n  private _swap(indexOne: number, indexTwo: number): void {\n    [this._heap[indexOne], this._heap[indexTwo]] = [this._heap[indexTwo], this._heap[indexOne]];\n  }\n\n  private _siftUp(): void {\n    let index = this._heap.length - 1;\n    while (index > 0 && this._compare(this._heap[this._getParentIndex(index)], this._heap[index]) > 0) {\n      const parentIndex = this._getParentIndex(index);\n      this._swap(index, parentIndex);\n      index = parentIndex;\n    }\n  }\n\n  private _siftDown(): void {\n    let index = 0;\n    let smallerChildIndex = this._getLeftChildIndex(index);\n\n    while (smallerChildIndex < this._heap.length) {\n      const rightChildIndex = this._getRightChildIndex(index);\n      if (\n        rightChildIndex < this._heap.length &&\n        this._compare(this._heap[rightChildIndex], this._heap[smallerChildIndex]) < 0\n      ) {\n        smallerChildIndex = rightChildIndex;\n      }\n\n      if (this._compare(this._heap[index], this._heap[smallerChildIndex]) <= 0) {\n        break;\n      }\n\n      this._swap(index, smallerChildIndex);\n      index = smallerChildIndex;\n      smallerChildIndex = this._getLeftChildIndex(index);\n    }\n  }\n}\n"]}

package/dist/type/index.cjs

@@ -0,0 +1,4 @@
+'use strict';
+
+//# sourceMappingURL=index.cjs.map
+//# sourceMappingURL=index.cjs.map

package/dist/type/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"index.cjs"}

package/dist/type/index.d.cts

@@ -0,0 +1,20 @@
+type DistributiveOmit<T, K extends keyof any> = T extends any ? Omit<T, K> : never;
+
+/**
+ * 提取对象的 key 用 . 拼接成 path 形式
+ * type T1 = ObjectKeyPaths<{ name: string; age: number }>; // expected to be 'name' | 'age'
+ * type T2 = ObjectKeyPaths<{
+ *    refCount: number;
+ *    person: { name: string; age: number };
+ *  }>; // expected to be 'refCount' | 'person' | 'person.name' | 'person.age'
+ */
+type GenNode<K extends string | number, IsRoot extends boolean> = IsRoot extends true ? `${K}` : `.${K}` | (K extends number ? `[${K}]` : never);
+type ObjectKeyPaths<T extends Record<string, unknown>, IsRoot extends boolean = true, K extends keyof T = keyof T> = K extends string | number ? GenNode<K, IsRoot> | (T[K] extends Record<string, unknown> ? `${GenNode<K, IsRoot>}${ObjectKeyPaths<T[K], false>}` : never) : never;
+/**
+ * 获取对象 path 对应的类型
+ * type T = ValueAtPath<{ a: { b: number } }, 'a.b'>; // expected to be number
+ */
+type ValueAtPath<T extends Record<string, unknown>, // 泛型类型参数 T 表示对象类型
+P extends ObjectKeyPaths<T>> = P extends `${infer K}.${infer R}` ? K extends keyof T ? T[K] extends Record<string, unknown> ? ValueAtPath<T[K], R> : never : never : P extends keyof T ? T[P] : never;
+
+export type { DistributiveOmit, ObjectKeyPaths, ValueAtPath };

package/dist/type/index.d.ts

@@ -0,0 +1,20 @@
+type DistributiveOmit<T, K extends keyof any> = T extends any ? Omit<T, K> : never;
+
+/**
+ * 提取对象的 key 用 . 拼接成 path 形式
+ * type T1 = ObjectKeyPaths<{ name: string; age: number }>; // expected to be 'name' | 'age'
+ * type T2 = ObjectKeyPaths<{
+ *    refCount: number;
+ *    person: { name: string; age: number };
+ *  }>; // expected to be 'refCount' | 'person' | 'person.name' | 'person.age'
+ */
+type GenNode<K extends string | number, IsRoot extends boolean> = IsRoot extends true ? `${K}` : `.${K}` | (K extends number ? `[${K}]` : never);
+type ObjectKeyPaths<T extends Record<string, unknown>, IsRoot extends boolean = true, K extends keyof T = keyof T> = K extends string | number ? GenNode<K, IsRoot> | (T[K] extends Record<string, unknown> ? `${GenNode<K, IsRoot>}${ObjectKeyPaths<T[K], false>}` : never) : never;
+/**
+ * 获取对象 path 对应的类型
+ * type T = ValueAtPath<{ a: { b: number } }, 'a.b'>; // expected to be number
+ */
+type ValueAtPath<T extends Record<string, unknown>, // 泛型类型参数 T 表示对象类型
+P extends ObjectKeyPaths<T>> = P extends `${infer K}.${infer R}` ? K extends keyof T ? T[K] extends Record<string, unknown> ? ValueAtPath<T[K], R> : never : never : P extends keyof T ? T[P] : never;
+
+export type { DistributiveOmit, ObjectKeyPaths, ValueAtPath };

package/dist/type/index.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/type/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"index.js"}