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

Open

export function getIntervalStringFromMilliseconds(milliseconds: number): string {
    const resultArray: string[] = [];
    let seconds = Math.floor(milliseconds / 1000);

    milliseconds -= seconds * 1000;

• Read up
  Read up

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

Open

export function generateHierarchyOfLocalMaximaAndMinima(
    array: number[]
): Record<string, unknown>[][] {
    const result = [];

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

Open

export function getIntervalStringFromMilliseconds(milliseconds: number): string {
    const resultArray: string[] = [];
    let seconds = Math.floor(milliseconds / 1000);

    milliseconds -= seconds * 1000;

Function constructor has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    constructor(fnComparator?: (item1: T, item2: T) => boolean, iterable?: Iterable<T>) {
        // super(iterable);

        // Do not pass iterable; we cannot add items to the queue until
        // we are certain that we have a this.fnComparator function.

• Read up
  Read up

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

Open

    constructor(fnComparator?: (item1: T, item2: T) => boolean, iterable?: Iterable<T>) {
        // super(iterable);

        // Do not pass iterable; we cannot add items to the queue until
        // we are certain that we have a this.fnComparator function.

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

Open

export function createHuffmanEncoding<T>(input: Iterable<[T, number]>): [T, string][] {
    const fnComparator = (
        t1: IHuffmanEncodingTreeNode<T>,
        t2: IHuffmanEncodingTreeNode<T>
    ): boolean => t1.count < t2.count;

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

Open

export function mergeTwoSortedArrays<T>(
    array1: T[],
    array2: T[],
    fnComparator: ComparatorFunction<T>
): T[] {

• Read up
  Read up

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

Open

    private downHeap(): void {
        // Now: Restore the heap condition throughout the heap by propagating lastElement
        // (i.e. the element that is now at index 0) down through the heap, as necessary.

        // The heap condition is: For all integers i where 0 <= i < heap.length :

• Read up
  Read up

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

Open

export function generateHierarchyOfLocalMaximaAndMinima(
    array: number[]
): Record<string, unknown>[][] {
    const result = [];

• Read up
  Read up

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

Open

export function genericQuickSort<T>(array: T[], fnComparator: ComparatorFunction<T>): T[] {
    if (array.length <= 1) {
        return array;
    }

• Read up
  Read up

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

Open

export function genericBubbleSort<T>(array: T[], fnComparator: ComparatorFunction<T>): T[] {
    let changeDetected = true;

    array = cloneArray(array);

• Read up
  Read up

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

Open

export function genericShellSort<T>(arrayParam: T[], fnComparator: ComparatorFunction<T>): T[] {
    const array = cloneArray(arrayParam);

    // Start with a big gap, then reduce the gap.

• Read up
  Read up

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

Open

function treeTraversal<T>(
    treeNode: IHuffmanEncodingTreeNode<T>,
    result: [T, string][],
    bitString: string
): [T, string][] {

• Read up
  Read up