Sign upLogin

JoeKarlsson/data-structures

View on GitHub
Star

Showing 50 of 50 total issues

Similar blocks of code found in 2 locations. Consider refactoring.
Open

  findMin() {
    const node = this.root;
    const traverse = ( node ) => {
      return !node.left ? node.value : traverse( node.left );
    };
Severity: Major
Found in search/binary-search-tree.js and 1 other location - About 1 hr to fix
search/binary-search-tree.js on lines 194..200

Similar blocks of code found in 3 locations. Consider refactoring.
Open

  const swap = ( array, index1, index2 ) => {
    // store a tmp variable at pos index2
    const tmp = array[index2];
 
    // set value  of index2 to our value at index
Severity: Major
Found in sorting/insertionsort.js and 2 other locations - About 1 hr to fix
sorting/quicksort.js on lines 5..15
sorting/selectionsort.js on lines 3..12

Similar blocks of code found in 3 locations. Consider refactoring.
Open

  const swap = ( array, index1, index2 ) => {
 
    // store a tmp variable at pos index2
    const tmp = array[index2];
 
 
Severity: Major
Found in sorting/quicksort.js and 2 other locations - About 1 hr to fix
sorting/insertionsort.js on lines 3..12
sorting/selectionsort.js on lines 3..12

Similar blocks of code found in 3 locations. Consider refactoring.
Open

  const swap = (array, index1, index2) => {
    // store a tmp variable at pos index2
    const tmp = array[index2];
 
    // set value  of index2 to our value at index
Severity: Major
Found in sorting/selectionsort.js and 2 other locations - About 1 hr to fix
sorting/insertionsort.js on lines 3..12
sorting/quicksort.js on lines 5..15

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

const quickModule = (() => {
  // Private Methods and variables
 
  // swap method because its used multiple times
  const swap = ( array, index1, index2 ) => {
Severity: Minor
Found in sorting/quicksort.js - About 1 hr to fix

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

function FFT_Recursive(input, inverse) {
  const n = input.length;
 
  if (n === 1) {
    return input;
Severity: Minor
Found in fast-fourier-transforms/fft.js - About 1 hr to fix

Function FFT_2_Iterative has 31 lines of code (exceeds 25 allowed). Consider refactoring.
Open

function FFT_2_Iterative(input, inverse) {
  const n = input.length;
 
  const output = BitReverseComplexArray(input);
  const output_r = output.real;
Severity: Minor
Found in fast-fourier-transforms/fft.js - About 1 hr to fix

    Function neighbors has 31 lines of code (exceeds 25 allowed). Consider refactoring.
    Open

      neighbors(node) {
        const ret = [];
        const x = node.x;
        const y = node.y;
        const grid = this.grid;
    Severity: Minor
    Found in graph/gridGraph.js - About 1 hr to fix

      Function nodeAverages has 29 lines of code (exceeds 25 allowed). Consider refactoring.
      Open

        nodeAverages() {
          const node = this.root;
          const result = {};
          const depthAverages = [];
       
       
      Severity: Minor
      Found in search/binary-search-tree.js - About 1 hr to fix

        Similar blocks of code found in 2 locations. Consider refactoring.
        Open

            if (grid[x + 1] && grid[x + 1][y]) {
              ret.push(grid[x + 1][y]);
            }
        Severity: Major
        Found in graph/gridGraph.js and 1 other location - About 1 hr to fix
        graph/gridGraph.js on lines 50..52

        Similar blocks of code found in 2 locations. Consider refactoring.
        Open

            if (grid[x - 1] && grid[x - 1][y]) {
              ret.push(grid[x - 1][y]);
            }
        Severity: Major
        Found in graph/gridGraph.js and 1 other location - About 1 hr to fix
        graph/gridGraph.js on lines 55..57

        Function mergeModule has 28 lines of code (exceeds 25 allowed). Consider refactoring.
        Open

        const mergeModule = ( () => {
          // used to merge all of our pieces back together after recursively separating the array
          const merge = ( left, right ) => {
            // initialize array to return
            const result = [];
        Severity: Minor
        Found in sorting/mergesort.js - About 1 hr to fix

          Identical blocks of code found in 2 locations. Consider refactoring.
          Open

            const swap = ( arr, i1, i2) => {
              const tmp = arr[i1];
              arr[i1] = arr[i2];
              arr[i2] = tmp;
              return arr;
          Severity: Minor
          Found in sorting/bubblesort.js and 1 other location - About 55 mins to fix
          sorting/bubble-recursive.js on lines 1..6

          Identical blocks of code found in 2 locations. Consider refactoring.
          Open

          const swap = ( arr, i1, i2 ) => {
            const tmp = arr[i1];
            arr[i1] = arr[i2];
            arr[i2] = tmp;
            return arr;
          Severity: Minor
          Found in sorting/bubble-recursive.js and 1 other location - About 55 mins to fix
          sorting/bubblesort.js on lines 2..7

          Function bubbleModule has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.
          Open

          const bubbleModule = (() => {
            const swap = ( arr, i1, i2) => {
              const tmp = arr[i1];
              arr[i1] = arr[i2];
              arr[i2] = tmp;
          Severity: Minor
          Found in sorting/bubblesort.js - About 55 mins to fix

          Function insert has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.
          Open

            insert(currentNode) {
              const value = currentNode.value;
           
              const traverse = (node) => {
                if (value > node.value) {
          Severity: Minor
          Found in search/binary-search-tree.js - About 55 mins to fix

          Function FFT_2_Iterative has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.
          Open

          function FFT_2_Iterative(input, inverse) {
            const n = input.length;
           
            const output = BitReverseComplexArray(input);
            const output_r = output.real;
          Severity: Minor
          Found in fast-fourier-transforms/fft.js - About 45 mins to fix

          Similar blocks of code found in 2 locations. Consider refactoring.
          Open

              for (let i = 0; i < this.dirtyNodes.length; i++) {
                astar.cleanNode(this.dirtyNodes[i]);
              }
          Severity: Minor
          Found in graph/gridGraph.js and 1 other location - About 45 mins to fix
          graph/gridGraph.js on lines 27..29

          Avoid deeply nested control flow statements.
          Open

                      if (
                        neighbor.h < closestNode.h ||
                        (neighbor.h === closestNode.h && neighbor.g < closestNode.g)
                      ) {
                        closestNode = neighbor;
          Severity: Major
          Found in shortest-path/aStar.js - About 45 mins to fix

            Similar blocks of code found in 2 locations. Consider refactoring.
            Open

                for (let i = 0; i < this.nodes.length; i++) {
                  astar.cleanNode(this.nodes[i]);
                }
            Severity: Minor
            Found in graph/gridGraph.js and 1 other location - About 45 mins to fix
            graph/gridGraph.js on lines 33..35
            Severity
            Category
            Status
            Source
            Language