Function remove has a Cognitive Complexity of 44 (exceeds 5 allowed). Consider refactoring.

Open

  remove(value) {
    let found = false;
    let childCount;
    let replacement;
    let replacementParent;

• Read up
  Read up

Function search has a Cognitive Complexity of 29 (exceeds 5 allowed). Consider refactoring.

Open

  search: (graph, start, end, options) => {
    graph.cleanDirty();
    options = options || {};
    const heuristic = options.heuristic || astar.heuristics.manhattan;
    const closest = options.closest || false;

• Read up
  Read up

File binary-search-tree.js has 281 lines of code (exceeds 250 allowed). Consider refactoring.

Open

const LinkedList = require('../linked-list/linkedList');
 
// Private Helper functions
const makeNode = ( value ) => {
  const node = {};

Function remove has 62 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  remove(value) {
    let found = false;
    let childCount;
    let replacement;
    let replacementParent;

Function shortestPath has a Cognitive Complexity of 18 (exceeds 5 allowed). Consider refactoring.

Open

  shortestPath(start, finish) {
    const nodes = new PriorityQueue();
    const distances = {};
    const previous = {};
    const path = [];

• Read up
  Read up

Function sinkDown has a Cognitive Complexity of 17 (exceeds 5 allowed). Consider refactoring.

Open

  sinkDown: function(n) {
    // Look up the target element and its score.
    const length = this.content.length,
    element = this.content[n],
    elemScore = this.scoreFunction(element);

• Read up
  Read up

Function search has 50 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  search: (graph, start, end, options) => {
    graph.cleanDirty();
    options = options || {};
    const heuristic = options.heuristic || astar.heuristics.manhattan;
    const closest = options.closest || false;

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

Open

  neighbors(node) {
    const ret = [];
    const x = node.x;
    const y = node.y;
    const grid = this.grid;

• Read up
  Read up

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

Open

  nodeAverages() {
    const node = this.root;
    const result = {};
    const depthAverages = [];
 
 

• Read up
  Read up

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

Open

  shortestPath(start, finish) {
    const nodes = new PriorityQueue();
    const distances = {};
    const previous = {};
    const path = [];

Function mergeModule has a Cognitive Complexity of 13 (exceeds 5 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 = [];

• Read up
  Read up

Function FFT_Recursive has 37 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function FFT_Recursive(input, inverse) {
  const n = input.length;
 
  if (n === 1) {
    return input;

Function quickModule has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

const quickModule = (() => {
  // Private Methods and variables
 
  // swap method because its used multiple times
  const swap = ( array, index1, index2 ) => {

Function selectionModule has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring.

Open

const selectionModule = (() => {
  // swap method because its used multiple times
  const swap = (array, index1, index2) => {
    // store a tmp variable at pos index2
    const tmp = array[index2];

• Read up
  Read up

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 ) => {

• Read up
  Read up

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;

• Read up
  Read up

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;

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;

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

Open

  nodeAverages() {
    const node = this.root;
    const result = {};
    const depthAverages = [];
 
 

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 = [];