Sign upLogin

JoeKarlsson/data-structures

View on GitHub
Star

Showing 50 of 50 total issues

Function dfs has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring.
Open

const dfs = (start, searchFor) => {
  if (!searchFor || !start) {
    throw new Error('Invalid input');
  }
 
 
Severity: Minor
Found in graph-traversing/depth-first-search-recursive.js - About 35 mins to fix

Function getDepth has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring.
Open

  getDepth() {
    let maxDepth = 0;
    const node = this.root;
    const traverse = (node, depth) => {
      if ( !node ) return null;
Severity: Minor
Found in search/binary-search-tree.js - About 35 mins to fix

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

    [array.real[i], array.real[r_i]] = [array.real[r_i], array.real[i]];
Severity: Minor
Found in fast-fourier-transforms/fft.js and 1 other location - About 30 mins to fix
fast-fourier-transforms/fft.js on lines 170..170

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

    [array.imag[i], array.imag[r_i]] = [array.imag[r_i], array.imag[i]];
Severity: Minor
Found in fast-fourier-transforms/fft.js and 1 other location - About 30 mins to fix
fast-fourier-transforms/fft.js on lines 169..169

Function DFS has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

const DFS = (start, searchFor) => {
  const stack = [start];
  const visited = [];
  let currNode = start;
 
 
Severity: Minor
Found in graph-traversing/depth-first-search-imperative.js - About 25 mins to fix

Function countLeaves has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

  countLeaves() {
    let count = 0;
    const node = this.root;
    const traverse = ( node ) => {
      if ( !node) {
Severity: Minor
Found in search/binary-search-tree.js - About 25 mins to fix

Function reduce has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

  reduce(callbackFn, startingValue, extractValues = true) {
    let currentNode;
    let accumulated;
 
    let extractorFn;
Severity: Minor
Found in list/list.js - About 25 mins to fix

Function contains has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

  contains(value) {
    const node = this.root;
    const traverse = ( node ) => {
      if (!node) {
        return false;
Severity: Minor
Found in search/binary-search-tree.js - About 25 mins to fix

Function searchRabinKarp has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

const searchRabinKarp = ( text, str ) => {
  const matches = [];
 
  const hashStr = hashFromTo(str, 0, str.length); // hash the substring
  const primeToPower = Math.pow(primeBase, str.length);
Severity: Minor
Found in rabin-karp/rk.js - About 25 mins to fix

Function insertionModule has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
Open

const insertionModule = (() => {
  // swap method because its used multiple times
  const swap = ( array, index1, index2 ) => {
    // store a tmp variable at pos index2
    const tmp = array[index2];
Severity: Minor
Found in sorting/insertionsort.js - About 25 mins to fix
Severity
Category
Status
Source
Language