functional-data-structure/persistent

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

Similar blocks of code found in 4 locations. Consider refactoring.

Open

    OrdSeq.prototype.split = function (predicate) {
        const [left, right] = this.tree.split(predicate);
        return [new OrdSeq(left), new OrdSeq(right)];
    };

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

    OrdSeq.prototype.insertValues = function (values) {
        let s = this;

        for (const value of values) s = s.insert(value);

• Read up
  Read up

Similar blocks of code found in 6 locations. Consider refactoring.

Open

    OrdSeq.prototype.min = OrdSeq.prototype.head = function () {
        return this.tree.head();
    };

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

        return new OrdSeq(l.tree.push(a).concat(r.merge(other.tail()).tree));

• Read up
  Read up

Similar blocks of code found in 6 locations. Consider refactoring.

Open

    OrdSeq.prototype.max = OrdSeq.prototype.last = function () {
        return this.tree.last();
    };

• Read up
  Read up

Similar blocks of code found in 5 locations. Consider refactoring.

Open

    return {
        empty: () => new OrdSeq(empty(key)),
        from: (iterable) => new OrdSeq(empty(key)).insertValues(iterable),
    };

• Read up
  Read up