Function pushComputedPropsSpec has 44 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function pushComputedPropsSpec(path, file) {
  const { node, scope, parent } = path;
  const left = node.left;
  let declar;

Function getBindingIdentifierPaths has 44 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function getBindingIdentifierPaths(
  duplicates?: boolean = false,
  outerOnly?: boolean = false,
): { [string]: NodePath } {
  const path = this;

Function validateNested has 44 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function validateNested(loc: NestingPath, opts: {}) {
  const type = getSource(loc);

  assertNoDuplicateSourcemap(opts);

Function validatePlugins has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export function validatePlugins(plugins: PluginList) {
  if (hasPlugin(plugins, "decorators")) {
    if (hasPlugin(plugins, "decorators-legacy")) {
      throw new Error(
        "Cannot use the decorators and decorators-legacy plugin together",

• Read up
  Read up

Function transpileEnum has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export default function transpileEnum(path, t) {
  const { node } = path;
  if (node.const) {
    throw path.buildCodeFrameError("'const' enums are not supported.");
  }

• Read up
  Read up

Function readToken_numberSign has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

  readToken_numberSign(): void {
    if (this.state.pos === 0 && this.readToken_interpreter()) {
      return;
    }

• Read up
  Read up

Function verifyBreakContinue has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

  verifyBreakContinue(
    node: N.BreakStatement | N.ContinueStatement,
    keyword: string,
  ) {
    const isBreak = keyword === "break";

• Read up
  Read up

Function checkDuplicatedProto has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

  checkDuplicatedProto(
    prop: N.ObjectMember | N.SpreadElement,
    protoRef: { used: boolean },
    refExpressionErrors: ?ExpressionErrors,
  ): void {

• Read up
  Read up

Function parseExport has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

  parseExport(node: N.Node): N.AnyExport {
    const hasDefault = this.maybeParseExportDefaultSpecifier(node);
    const parseAfterDefault = !hasDefault || this.eat(tt.comma);
    const hasStar = parseAfterDefault && this.eatExportStar(node);
    const hasNamespace =

• Read up
  Read up

Function cleanJSXElementLiteralChild has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export default function cleanJSXElementLiteralChild(
  child: { value: string },
  args: Array<Object>,
) {
  const lines = child.value.split(/\r\n|\n|\r/);

• Read up
  Read up

Function wrap has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

function wrap(state, method, id, scope) {
  if (state.selfReference) {
    if (scope.hasBinding(id.name) && !scope.hasGlobal(id.name)) {
      // we can just munge the local binding
      scope.rename(id.name);

• Read up
  Read up

Function isReferenced has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export default function isReferenced(
  node: Object,
  parent: Object,
  grandparent?: Object,
): boolean {

• Read up
  Read up

Function printJoin has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

  printJoin(nodes: ?Array, parent: Object, opts = {}) {
    if (!nodes?.length) return;

    if (opts.indent) this.indent();

• Read up
  Read up

Function getTokenType has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

function getTokenType(match) {
  const [offset, text] = match.slice(-2);
  const token = matchToToken(match);

  if (token.type === "name") {

• Read up
  Read up

Function VariableDeclaration has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export function VariableDeclaration(node: Object, parent: Object) {
  if (node.declare) {
    // TS
    this.word("declare");
    this.space();

• Read up
  Read up

Function crawl has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

function crawl(node, state = {}) {
  if (t.isMemberExpression(node) || t.isOptionalMemberExpression(node)) {
    crawl(node.object, state);
    if (node.computed) crawl(node.property, state);
  } else if (t.isBinary(node) || t.isAssignmentExpression(node)) {

• Read up
  Read up

Function _guessExecutionStatusRelativeToDifferentFunctions has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export function _guessExecutionStatusRelativeToDifferentFunctions(
  target: NodePath,
): RelativeExecutionStatus {
  if (
    !target.isFunctionDeclaration() ||

• Read up
  Read up

Function _getTypeAnnotation has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export function _getTypeAnnotation(): ?Object {
  const node = this.node;

  if (!node) {
    // handle initializerless variables, add in checks for loop initializers too

• Read up
  Read up

Function default has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

export default function (classPath) {
  classPath.assertClass();

  const memoisedExpressions = [];

• Read up
  Read up

Function inferAnnotationFromBinaryExpression has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

function inferAnnotationFromBinaryExpression(name, path) {
  const operator = path.node.operator;

  const right = path.get("right").resolve();
  const left = path.get("left").resolve();

• Read up
  Read up