eslint-plugin-de-morgan/dist/utils/find-outermost-parenthesized-node.js

ESLint plugin for transforming negated boolean expressions via De Morgan’s laws

import { isLogicalExpression } from './is-logical-expression.js'
/**
 * Traverses up the parent chain of the given node (if available) to find the
 * outermost logical expression node that is explicitly wrapped in parentheses.
 * The function checks the node and its parents (while they are
 * LogicalExpression) and returns the first node that is wrapped in parentheses
 * (i.e. Where the characters immediately before its range and at its end form a
 * matching pair of parentheses). If none is found, the function returns the
 * topmost LogicalExpression..
 *
 * @param node - The starting expression node.
 * @param sourceCode - The full source code text.
 * @returns The outermost parenthesized node found in the parent chain.
 */
function findOutermostParenthesizedNode(node, sourceCode) {
  let current = node
  let [start, end] = current.range
  if (isInParentheses(start, end, sourceCode)) {
    return current
  }
  while (current.parent && isLogicalExpression(current)) {
    current = current.parent
    ;[start, end] = current.range
    if (isInParentheses(start, end, sourceCode)) {
      return current
    }
  }
  return current
}
/**
 * Checks if the characters immediately before and at the end of the given
 * node's range in the source code form a pair of parentheses.
 *
 * @param start - The start index of the node's range.
 * @param end - The end index of the node's range.
 * @param sourceCode - The full source code text.
 * @returns True if the character immediately before start is `(` and the
 *   character at index end is `)`, false otherwise.
 */
function isInParentheses(start, end, sourceCode) {
  return sourceCode[start - 1] === '(' && sourceCode[end] === ')'
}
export { findOutermostParenthesizedNode }