34 lines
1.0 KiB
JavaScript
34 lines
1.0 KiB
JavaScript
/**
|
|
* Creates a Map for efficient lookup of node positions in the sorted array.
|
|
*
|
|
* Builds an index map that associates each sorting node with its position in
|
|
* the array. This is used to quickly determine the relative order of nodes
|
|
* without repeated array searches, improving performance when generating error
|
|
* messages for incorrectly sorted elements.
|
|
*
|
|
* @example
|
|
*
|
|
* ```ts
|
|
* const nodes = [
|
|
* { name: 'foo', node: fooNode },
|
|
* { name: 'bar', node: barNode },
|
|
* { name: 'baz', node: bazNode },
|
|
* ]
|
|
* const indexMap = createNodeIndexMap(nodes)
|
|
* indexMap.get(nodes[0]) // Returns: 0
|
|
* indexMap.get(nodes[2]) // Returns: 2
|
|
* ```
|
|
*
|
|
* @template Node - Type of the AST node.
|
|
* @param nodes - Array of sorting nodes in their sorted order.
|
|
* @returns Map where keys are sorting nodes and values are their indices.
|
|
*/
|
|
function createNodeIndexMap(nodes) {
|
|
let nodeIndexMap = /* @__PURE__ */ new Map()
|
|
for (let [index, node] of nodes.entries()) {
|
|
nodeIndexMap.set(node, index)
|
|
}
|
|
return nodeIndexMap
|
|
}
|
|
export { createNodeIndexMap }
|