tom-weatherhead/common-utilities.ts

View on GitHub
src/collection-classes/priority-queue.ts

Summary

Maintainability
A
2 hrs
Test Coverage

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.
Severity: Minor
Found in src/collection-classes/priority-queue.ts - 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 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.
Severity: Minor
Found in src/collection-classes/priority-queue.ts - About 1 hr to fix

    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 :
    Severity: Minor
    Found in src/collection-classes/priority-queue.ts - About 45 mins 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

    There are no issues that match your filters.

    Category
    Status