Sign upLogin

ivan-nor/frontend-project-lvl2

View on GitHub
Star

Showing 7 of 9 total issues

Function buildInternalTree has 40 lines of code (exceeds 25 allowed). Consider refactoring.
Open

const buildInternalTree = (beforeData, afterData) => {
  const result = _
    .union(_.keys(beforeData), _.keys(afterData))
    .map((key) => {
      const name = key;
Severity: Minor
Found in src/builder.js - About 1 hr to fix

    Function result has 35 lines of code (exceeds 25 allowed). Consider refactoring.
    Open

        .map((key) => {
      const name = key;
      if (_.isObject(beforeData[key]) && _.isObject(afterData[key])) {
        return {
          name,
    Severity: Minor
    Found in src/builder.js - About 1 hr to fix

      Function buildInternalTree has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.
      Open

      const buildInternalTree = (beforeData, afterData) => {
  const result = _
    .union(_.keys(beforeData), _.keys(afterData))
    .map((key) => {
      const name = key;
      Severity: Minor
      Found in src/builder.js - About 1 hr to fix

      Cognitive Complexity

      Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

      A method's cognitive complexity is based on a few simple rules:

      • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
      • Code is considered more complex for each "break in the linear flow of the code"
      • Code is considered more complex when "flow breaking structures are nested"

      Further reading

      Function astToPlain has 27 lines of code (exceeds 25 allowed). Consider refactoring.
      Open

      const astToPlain = (ast) => {
  const iter = (tree, accName = '') => {
    const nodes = tree
      .filter(({ type }) => type !== 'unchanged')
      .map(({
      Severity: Minor
      Found in src/formatters/plain.js - About 1 hr to fix

        Function astToRecursive has 27 lines of code (exceeds 25 allowed). Consider refactoring.
        Open

        const astToRecursive = (ast) => {
  const iter = (tree, depthIndent = 1) => {
    const nodes = tree.map(({
      name, type, nextValue, prevValue, children,
    }) => {
        Severity: Minor
        Found in src/formatters/recursive.js - About 1 hr to fix

          Avoid too many return statements within this function.
          Open

                return {
        name,
        type: 'changed',
        nextValue: afterData[key],
        prevValue: beforeData[key],
          Severity: Major
          Found in src/builder.js - About 30 mins to fix

            Avoid too many return statements within this function.
            Open

                      return `${indent}  ${name}: ${stringify(nextValue, depthIndent + 2)}`;
            Severity: Major
            Found in src/formatters/recursive.js - About 30 mins to fix
              Severity
              Category
              Status
              Source
              Language