Function seq has 122 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function seq(empty, size) {
    const Seq = function (tree) {
        this.tree = tree;
    };

Function seq has a Cognitive Complexity of 32 (exceeds 5 allowed). Consider refactoring.

Open

export function seq(empty, size) {
    const Seq = function (tree) {
        this.tree = tree;
    };

• Read up
  Read up

Function intervaltree has 80 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function intervaltree(empty, M) {
    const atleast = function (k, [_, n]) {
        return k <= n;
    };

Function indordseq has 76 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function indordseq(empty, key, size, measure) {
    // Probably needs a total order instead of a measure
    // this causes generality problems in the insert, merge, partition and delete
    // methods

Function ordseq has 65 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function ordseq(empty, key) {
    // Probably needs a total order instead of a key measure
    // this causes generality problems in the insert, merge, partition and delete
    // methods

Function splice has 30 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    Seq.prototype.splice = function (start, deleteCount, ...items) {
        const length = this.len();

        if (start < -length || start >= length)
            throw new Error(`wrong start '${start}'`);

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

Open

export function intervaltree(empty, M) {
    const atleast = function (k, [_, n]) {
        return k <= n;
    };

• Read up
  Read up

Function heap has 26 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function heap(empty, max) {
    const Heap = function (tree) {
        this.tree = tree;
    };

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

Open

export function indordseq(empty, key, size, measure) {
    // Probably needs a total order instead of a measure
    // this causes generality problems in the insert, merge, partition and delete
    // methods

• Read up
  Read up

Avoid too many return statements within this function.

Open

        return [new Seq(prefix.append(items).concat(suffix)), new Seq(deleted)];

Avoid too many return statements within this function.

Open

            return [new Seq(prefix.append(items)), new Seq(rest)];