0x1998 - MANAGER

Düzenlenen Dosya: token-map.js.map

{"version":3,"names":["_t","require","traverseFast","VISITOR_KEYS","TokenMap","constructor","ast","tokens","source","_tokens","_source","_nodesToTokenIndexes","Map","_nodesOccurrencesCountCache","_tokensCache","node","indexes","_getTokensIndexesOfNode","length","set","clear","has","getIndexes","get","find","condition","k","index","tok","findLastIndex","findMatching","test","occurrenceCount","String","fromCharCode","i","count","cache","matchesOriginal","token","end","start","value","startsWith","startMatches","endMatches","_node$declaration","first","last","_findTokensOfNode","low","children","childrenIterator","type","declaration","next","child","childTok","high","push","cached","_findFirstTokenOfNode","_findLastTokenOfNode","mid","exports","quasis","expressions","keys","key","Array","isArray"],"sources":["../src/token-map.ts"],"sourcesContent":["import type * as t from \"@babel/types\";\nimport type { Token } from \"@babel/parser\";\n\nimport { traverseFast, VISITOR_KEYS } from \"@babel/types\";\n\nexport class TokenMap {\n _tokens: Token[];\n _source: string;\n\n _nodesToTokenIndexes = new Map<t.Node, number[]>();\n _nodesOccurrencesCountCache = new Map<\n t.Node,\n { test: string; count: number; i: number }\n >();\n\n _tokensCache = new Map<t.Node, { first: number; last: number }>();\n\n constructor(ast: t.Node, tokens: Token[], source: string) {\n this._tokens = tokens;\n this._source = source;\n\n traverseFast(ast, node => {\n const indexes = this._getTokensIndexesOfNode(node);\n if (indexes.length > 0) this._nodesToTokenIndexes.set(node, indexes);\n });\n\n this._tokensCache.clear();\n }\n\n has(node: t.Node): boolean {\n return this._nodesToTokenIndexes.has(node);\n }\n\n getIndexes(node: t.Node): readonly number[] | undefined {\n return this._nodesToTokenIndexes.get(node);\n }\n\n find(\n node: t.Node,\n condition: (token: Token, index: number) => boolean,\n ): Token | null {\n const indexes = this._nodesToTokenIndexes.get(node);\n if (indexes) {\n for (let k = 0; k < indexes.length; k++) {\n const index = indexes[k];\n const tok = this._tokens[index];\n if (condition(tok, index)) return tok;\n }\n }\n return null;\n }\n\n findLastIndex(\n node: t.Node,\n condition: (token: Token, index: number) => boolean,\n ): number {\n const indexes = this._nodesToTokenIndexes.get(node);\n if (indexes) {\n for (let k = indexes.length - 1; k >= 0; k--) {\n const index = indexes[k];\n const tok = this._tokens[index];\n if (condition(tok, index)) return index;\n }\n }\n return -1;\n }\n\n findMatching(\n node: t.Node,\n test: string | number,\n occurrenceCount: number = 0,\n ): Token | null {\n const indexes = this._nodesToTokenIndexes.get(node);\n if (indexes) {\n if (typeof test === \"number\") {\n test = String.fromCharCode(test);\n }\n let i = 0;\n const count = occurrenceCount;\n\n // To avoid O(n^2) search when printing lists (such as arrays), we\n // cache the last index of a given token for a given occurrence count.\n // If then we are asked to find the next occurrence of the same token,\n // we start from the index of the previously found token.\n // This cache only kicks in after 2 tokens of the same type, to avoid\n // overhead in the simple case of having unique tokens per node.\n if (count > 1) {\n const cache = this._nodesOccurrencesCountCache.get(node);\n if (cache?.test === test && cache.count < count) {\n i = cache.i + 1;\n occurrenceCount -= cache.count + 1;\n }\n }\n\n for (; i < indexes.length; i++) {\n const tok = this._tokens[indexes[i]];\n if (this.matchesOriginal(tok, test)) {\n if (occurrenceCount === 0) {\n if (count > 0) {\n this._nodesOccurrencesCountCache.set(node, { test, count, i });\n }\n return tok;\n }\n occurrenceCount--;\n }\n }\n }\n return null;\n }\n\n matchesOriginal(token: Token, test: string) {\n if (token.end - token.start !== test.length) return false;\n if (token.value != null) return token.value === test;\n return this._source.startsWith(test, token.start);\n }\n\n startMatches(node: t.Node, test: string): boolean {\n const indexes = this._nodesToTokenIndexes.get(node);\n if (!indexes) return false;\n const tok = this._tokens[indexes[0]];\n if (tok.start !== node.start) return false;\n return this.matchesOriginal(tok, test);\n }\n\n endMatches(node: t.Node, test: string): boolean {\n const indexes = this._nodesToTokenIndexes.get(node);\n if (!indexes) return false;\n const tok = this._tokens[indexes[indexes.length - 1]];\n if (tok.end !== node.end) return false;\n return this.matchesOriginal(tok, test);\n }\n\n _getTokensIndexesOfNode(node: t.Node): number[] {\n if (node.start == null || node.end == null) return [];\n\n const { first, last } = this._findTokensOfNode(\n node,\n 0,\n this._tokens.length - 1,\n );\n\n let low = first;\n\n const children = childrenIterator(node);\n\n if (\n (node.type === \"ExportNamedDeclaration\" ||\n node.type === \"ExportDefaultDeclaration\") &&\n node.declaration?.type === \"ClassDeclaration\"\n ) {\n // Exported class declarations can be not properly nested inside\n // the export declaration that contains them. For example, in\n // `@dec export class Foo {}` the `export` is covered by the\n // ClassDeclaration range. Skip the class declaration from the list\n // of children to skip, so that when looking for `export` we also\n // traverse its tokens.\n children.next();\n }\n\n const indexes = [];\n\n for (const child of children) {\n if (child == null) continue;\n if (child.start == null || child.end == null) continue;\n\n const childTok = this._findTokensOfNode(child, low, last);\n\n const high = childTok.first;\n for (let k = low; k < high; k++) indexes.push(k);\n\n low = childTok.last + 1;\n }\n\n for (let k = low; k <= last; k++) indexes.push(k);\n\n return indexes;\n }\n\n _findTokensOfNode(node: t.Node, low: number, high: number) {\n const cached = this._tokensCache.get(node);\n if (cached) return cached;\n\n const first = this._findFirstTokenOfNode(node.start!, low, high);\n const last = this._findLastTokenOfNode(node.end!, first, high);\n\n this._tokensCache.set(node, { first, last });\n return { first, last };\n }\n\n _findFirstTokenOfNode(start: number, low: number, high: number): number {\n while (low <= high) {\n const mid = (high + low) >> 1;\n if (start < this._tokens[mid].start) {\n high = mid - 1;\n } else if (start > this._tokens[mid].start) {\n low = mid + 1;\n } else {\n return mid;\n }\n }\n return low;\n }\n\n _findLastTokenOfNode(end: number, low: number, high: number): number {\n while (low <= high) {\n const mid = (high + low) >> 1;\n if (end < this._tokens[mid].end) {\n high = mid - 1;\n } else if (end > this._tokens[mid].end) {\n low = mid + 1;\n } else {\n return mid;\n }\n }\n return high;\n }\n}\n\nfunction* childrenIterator(node: t.Node) {\n // We need special handling to iterate TemplateLiteral\n // children in order, since the two lists are interleaved.\n if (node.type === \"TemplateLiteral\") {\n yield node.quasis[0];\n for (let i = 1; i < node.quasis.length; i++) {\n yield node.expressions[i - 1];\n yield node.quasis[i];\n }\n return;\n }\n\n const keys = VISITOR_KEYS[node.type];\n for (const key of keys) {\n const child = (node as any)[key];\n if (!child) continue;\n if (Array.isArray(child)) {\n yield* child;\n } else {\n yield child;\n }\n }\n}\n"],"mappings":";;;;;;AAGA,IAAAA,EAAA,GAAAC,OAAA;AAA0D;EAAjDC,YAAY;EAAEC;AAAY,IAAAH,EAAA;AAE5B,MAAMI,QAAQ,CAAC;EAYpBC,WAAWA,CAACC,GAAW,EAAEC,MAAe,EAAEC,MAAc,EAAE;IAAA,KAX1DC,OAAO;IAAA,KACPC,OAAO;IAAA,KAEPC,oBAAoB,GAAG,IAAIC,GAAG,CAAmB,CAAC;IAAA,KAClDC,2BAA2B,GAAG,IAAID,GAAG,CAGnC,CAAC;IAAA,KAEHE,YAAY,GAAG,IAAIF,GAAG,CAA0C,CAAC;IAG/D,IAAI,CAACH,OAAO,GAAGF,MAAM;IACrB,IAAI,CAACG,OAAO,GAAGF,MAAM;IAErBN,YAAY,CAACI,GAAG,EAAES,IAAI,IAAI;MACxB,MAAMC,OAAO,GAAG,IAAI,CAACC,uBAAuB,CAACF,IAAI,CAAC;MAClD,IAAIC,OAAO,CAACE,MAAM,GAAG,CAAC,EAAE,IAAI,CAACP,oBAAoB,CAACQ,GAAG,CAACJ,IAAI,EAAEC,OAAO,CAAC;IACtE,CAAC,CAAC;IAEF,IAAI,CAACF,YAAY,CAACM,KAAK,CAAC,CAAC;EAC3B;EAEAC,GAAGA,CAACN,IAAY,EAAW;IACzB,OAAO,IAAI,CAACJ,oBAAoB,CAACU,GAAG,CAACN,IAAI,CAAC;EAC5C;EAEAO,UAAUA,CAACP,IAAY,EAAiC;IACtD,OAAO,IAAI,CAACJ,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;EAC5C;EAEAS,IAAIA,CACFT,IAAY,EACZU,SAAmD,EACrC;IACd,MAAMT,OAAO,GAAG,IAAI,CAACL,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;IACnD,IAAIC,OAAO,EAAE;MACX,KAAK,IAAIU,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGV,OAAO,CAACE,MAAM,EAAEQ,CAAC,EAAE,EAAE;QACvC,MAAMC,KAAK,GAAGX,OAAO,CAACU,CAAC,CAAC;QACxB,MAAME,GAAG,GAAG,IAAI,CAACnB,OAAO,CAACkB,KAAK,CAAC;QAC/B,IAAIF,SAAS,CAACG,GAAG,EAAED,KAAK,CAAC,EAAE,OAAOC,GAAG;MACvC;IACF;IACA,OAAO,IAAI;EACb;EAEAC,aAAaA,CACXd,IAAY,EACZU,SAAmD,EAC3C;IACR,MAAMT,OAAO,GAAG,IAAI,CAACL,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;IACnD,IAAIC,OAAO,EAAE;MACX,KAAK,IAAIU,CAAC,GAAGV,OAAO,CAACE,MAAM,GAAG,CAAC,EAAEQ,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;QAC5C,MAAMC,KAAK,GAAGX,OAAO,CAACU,CAAC,CAAC;QACxB,MAAME,GAAG,GAAG,IAAI,CAACnB,OAAO,CAACkB,KAAK,CAAC;QAC/B,IAAIF,SAAS,CAACG,GAAG,EAAED,KAAK,CAAC,EAAE,OAAOA,KAAK;MACzC;IACF;IACA,OAAO,CAAC,CAAC;EACX;EAEAG,YAAYA,CACVf,IAAY,EACZgB,IAAqB,EACrBC,eAAuB,GAAG,CAAC,EACb;IACd,MAAMhB,OAAO,GAAG,IAAI,CAACL,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;IACnD,IAAIC,OAAO,EAAE;MACX,IAAI,OAAOe,IAAI,KAAK,QAAQ,EAAE;QAC5BA,IAAI,GAAGE,MAAM,CAACC,YAAY,CAACH,IAAI,CAAC;MAClC;MACA,IAAII,CAAC,GAAG,CAAC;MACT,MAAMC,KAAK,GAAGJ,eAAe;MAQ7B,IAAII,KAAK,GAAG,CAAC,EAAE;QACb,MAAMC,KAAK,GAAG,IAAI,CAACxB,2BAA2B,CAACU,GAAG,CAACR,IAAI,CAAC;QACxD,IAAI,CAAAsB,KAAK,oBAALA,KAAK,CAAEN,IAAI,MAAKA,IAAI,IAAIM,KAAK,CAACD,KAAK,GAAGA,KAAK,EAAE;UAC/CD,CAAC,GAAGE,KAAK,CAACF,CAAC,GAAG,CAAC;UACfH,eAAe,IAAIK,KAAK,CAACD,KAAK,GAAG,CAAC;QACpC;MACF;MAEA,OAAOD,CAAC,GAAGnB,OAAO,CAACE,MAAM,EAAEiB,CAAC,EAAE,EAAE;QAC9B,MAAMP,GAAG,GAAG,IAAI,CAACnB,OAAO,CAACO,OAAO,CAACmB,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAACG,eAAe,CAACV,GAAG,EAAEG,IAAI,CAAC,EAAE;UACnC,IAAIC,eAAe,KAAK,CAAC,EAAE;YACzB,IAAII,KAAK,GAAG,CAAC,EAAE;cACb,IAAI,CAACvB,2BAA2B,CAACM,GAAG,CAACJ,IAAI,EAAE;gBAAEgB,IAAI;gBAAEK,KAAK;gBAAED;cAAE,CAAC,CAAC;YAChE;YACA,OAAOP,GAAG;UACZ;UACAI,eAAe,EAAE;QACnB;MACF;IACF;IACA,OAAO,IAAI;EACb;EAEAM,eAAeA,CAACC,KAAY,EAAER,IAAY,EAAE;IAC1C,IAAIQ,KAAK,CAACC,GAAG,GAAGD,KAAK,CAACE,KAAK,KAAKV,IAAI,CAACb,MAAM,EAAE,OAAO,KAAK;IACzD,IAAIqB,KAAK,CAACG,KAAK,IAAI,IAAI,EAAE,OAAOH,KAAK,CAACG,KAAK,KAAKX,IAAI;IACpD,OAAO,IAAI,CAACrB,OAAO,CAACiC,UAAU,CAACZ,IAAI,EAAEQ,KAAK,CAACE,KAAK,CAAC;EACnD;EAEAG,YAAYA,CAAC7B,IAAY,EAAEgB,IAAY,EAAW;IAChD,MAAMf,OAAO,GAAG,IAAI,CAACL,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;IACnD,IAAI,CAACC,OAAO,EAAE,OAAO,KAAK;IAC1B,MAAMY,GAAG,GAAG,IAAI,CAACnB,OAAO,CAACO,OAAO,CAAC,CAAC,CAAC,CAAC;IACpC,IAAIY,GAAG,CAACa,KAAK,KAAK1B,IAAI,CAAC0B,KAAK,EAAE,OAAO,KAAK;IAC1C,OAAO,IAAI,CAACH,eAAe,CAACV,GAAG,EAAEG,IAAI,CAAC;EACxC;EAEAc,UAAUA,CAAC9B,IAAY,EAAEgB,IAAY,EAAW;IAC9C,MAAMf,OAAO,GAAG,IAAI,CAACL,oBAAoB,CAACY,GAAG,CAACR,IAAI,CAAC;IACnD,IAAI,CAACC,OAAO,EAAE,OAAO,KAAK;IAC1B,MAAMY,GAAG,GAAG,IAAI,CAACnB,OAAO,CAACO,OAAO,CAACA,OAAO,CAACE,MAAM,GAAG,CAAC,CAAC,CAAC;IACrD,IAAIU,GAAG,CAACY,GAAG,KAAKzB,IAAI,CAACyB,GAAG,EAAE,OAAO,KAAK;IACtC,OAAO,IAAI,CAACF,eAAe,CAACV,GAAG,EAAEG,IAAI,CAAC;EACxC;EAEAd,uBAAuBA,CAACF,IAAY,EAAY;IAAA,IAAA+B,iBAAA;IAC9C,IAAI/B,IAAI,CAAC0B,KAAK,IAAI,IAAI,IAAI1B,IAAI,CAACyB,GAAG,IAAI,IAAI,EAAE,OAAO,EAAE;IAErD,MAAM;MAAEO,KAAK;MAAEC;IAAK,CAAC,GAAG,IAAI,CAACC,iBAAiB,CAC5ClC,IAAI,EACJ,CAAC,EACD,IAAI,CAACN,OAAO,CAACS,MAAM,GAAG,CACxB,CAAC;IAED,IAAIgC,GAAG,GAAGH,KAAK;IAEf,MAAMI,QAAQ,GAAGC,gBAAgB,CAACrC,IAAI,CAAC;IAEvC,IACE,CAACA,IAAI,CAACsC,IAAI,KAAK,wBAAwB,IACrCtC,IAAI,CAACsC,IAAI,KAAK,0BAA0B,KAC1C,EAAAP,iBAAA,GAAA/B,IAAI,CAACuC,WAAW,qBAAhBR,iBAAA,CAAkBO,IAAI,MAAK,kBAAkB,EAC7C;MAOAF,QAAQ,CAACI,IAAI,CAAC,CAAC;IACjB;IAEA,MAAMvC,OAAO,GAAG,EAAE;IAElB,KAAK,MAAMwC,KAAK,IAAIL,QAAQ,EAAE;MAC5B,IAAIK,KAAK,IAAI,IAAI,EAAE;MACnB,IAAIA,KAAK,CAACf,KAAK,IAAI,IAAI,IAAIe,KAAK,CAAChB,GAAG,IAAI,IAAI,EAAE;MAE9C,MAAMiB,QAAQ,GAAG,IAAI,CAACR,iBAAiB,CAACO,KAAK,EAAEN,GAAG,EAAEF,IAAI,CAAC;MAEzD,MAAMU,IAAI,GAAGD,QAAQ,CAACV,KAAK;MAC3B,KAAK,IAAIrB,CAAC,GAAGwB,GAAG,EAAExB,CAAC,GAAGgC,IAAI,EAAEhC,CAAC,EAAE,EAAEV,OAAO,CAAC2C,IAAI,CAACjC,CAAC,CAAC;MAEhDwB,GAAG,GAAGO,QAAQ,CAACT,IAAI,GAAG,CAAC;IACzB;IAEA,KAAK,IAAItB,CAAC,GAAGwB,GAAG,EAAExB,CAAC,IAAIsB,IAAI,EAAEtB,CAAC,EAAE,EAAEV,OAAO,CAAC2C,IAAI,CAACjC,CAAC,CAAC;IAEjD,OAAOV,OAAO;EAChB;EAEAiC,iBAAiBA,CAAClC,IAAY,EAAEmC,GAAW,EAAEQ,IAAY,EAAE;IACzD,MAAME,MAAM,GAAG,IAAI,CAAC9C,YAAY,CAACS,GAAG,CAACR,IAAI,CAAC;IAC1C,IAAI6C,MAAM,EAAE,OAAOA,MAAM;IAEzB,MAAMb,KAAK,GAAG,IAAI,CAACc,qBAAqB,CAAC9C,IAAI,CAAC0B,KAAK,EAAGS,GAAG,EAAEQ,IAAI,CAAC;IAChE,MAAMV,IAAI,GAAG,IAAI,CAACc,oBAAoB,CAAC/C,IAAI,CAACyB,GAAG,EAAGO,KAAK,EAAEW,IAAI,CAAC;IAE9D,IAAI,CAAC5C,YAAY,CAACK,GAAG,CAACJ,IAAI,EAAE;MAAEgC,KAAK;MAAEC;IAAK,CAAC,CAAC;IAC5C,OAAO;MAAED,KAAK;MAAEC;IAAK,CAAC;EACxB;EAEAa,qBAAqBA,CAACpB,KAAa,EAAES,GAAW,EAAEQ,IAAY,EAAU;IACtE,OAAOR,GAAG,IAAIQ,IAAI,EAAE;MAClB,MAAMK,GAAG,GAAIL,IAAI,GAAGR,GAAG,IAAK,CAAC;MAC7B,IAAIT,KAAK,GAAG,IAAI,CAAChC,OAAO,CAACsD,GAAG,CAAC,CAACtB,KAAK,EAAE;QACnCiB,IAAI,GAAGK,GAAG,GAAG,CAAC;MAChB,CAAC,MAAM,IAAItB,KAAK,GAAG,IAAI,CAAChC,OAAO,CAACsD,GAAG,CAAC,CAACtB,KAAK,EAAE;QAC1CS,GAAG,GAAGa,GAAG,GAAG,CAAC;MACf,CAAC,MAAM;QACL,OAAOA,GAAG;MACZ;IACF;IACA,OAAOb,GAAG;EACZ;EAEAY,oBAAoBA,CAACtB,GAAW,EAAEU,GAAW,EAAEQ,IAAY,EAAU;IACnE,OAAOR,GAAG,IAAIQ,IAAI,EAAE;MAClB,MAAMK,GAAG,GAAIL,IAAI,GAAGR,GAAG,IAAK,CAAC;MAC7B,IAAIV,GAAG,GAAG,IAAI,CAAC/B,OAAO,CAACsD,GAAG,CAAC,CAACvB,GAAG,EAAE;QAC/BkB,IAAI,GAAGK,GAAG,GAAG,CAAC;MAChB,CAAC,MAAM,IAAIvB,GAAG,GAAG,IAAI,CAAC/B,OAAO,CAACsD,GAAG,CAAC,CAACvB,GAAG,EAAE;QACtCU,GAAG,GAAGa,GAAG,GAAG,CAAC;MACf,CAAC,MAAM;QACL,OAAOA,GAAG;MACZ;IACF;IACA,OAAOL,IAAI;EACb;AACF;AAACM,OAAA,CAAA5D,QAAA,GAAAA,QAAA;AAED,UAAUgD,gBAAgBA,CAACrC,IAAY,EAAE;EAGvC,IAAIA,IAAI,CAACsC,IAAI,KAAK,iBAAiB,EAAE;IACnC,MAAMtC,IAAI,CAACkD,MAAM,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI9B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGpB,IAAI,CAACkD,MAAM,CAAC/C,MAAM,EAAEiB,CAAC,EAAE,EAAE;MAC3C,MAAMpB,IAAI,CAACmD,WAAW,CAAC/B,CAAC,GAAG,CAAC,CAAC;MAC7B,MAAMpB,IAAI,CAACkD,MAAM,CAAC9B,CAAC,CAAC;IACtB;IACA;EACF;EAEA,MAAMgC,IAAI,GAAGhE,YAAY,CAACY,IAAI,CAACsC,IAAI,CAAC;EACpC,KAAK,MAAMe,GAAG,IAAID,IAAI,EAAE;IACtB,MAAMX,KAAK,GAAIzC,IAAI,CAASqD,GAAG,CAAC;IAChC,IAAI,CAACZ,KAAK,EAAE;IACZ,IAAIa,KAAK,CAACC,OAAO,CAACd,KAAK,CAAC,EAAE;MACxB,OAAOA,KAAK;IACd,CAAC,MAAM;MACL,MAAMA,KAAK;IACb;EACF;AACF","ignoreList":[]}
geri dön