@machhub-dev/node-red-nodes 1.0.5

package/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js

@@ -0,0 +1,323 @@
+var __extends = this && this.t || function() {
+    var extendStatics = function(t, r) {
+        extendStatics = Object.setPrototypeOf || {
+            __proto__: []
+        } instanceof Array && function(t, r) {
+            t.__proto__ = r;
+        } || function(t, r) {
+            for (var e in r) if (Object.prototype.hasOwnProperty.call(r, e)) t[e] = r[e];
+        };
+        return extendStatics(t, r);
+    };
+    return function(t, r) {
+        if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
+        extendStatics(t, r);
+        function __() {
+            this.constructor = t;
+        }
+        t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
+    };
+}();
+
+var __generator = this && this.i || function(t, r) {
+    var e = {
+        label: 0,
+        sent: function() {
+            if (o[0] & 1) throw o[1];
+            return o[1];
+        },
+        trys: [],
+        ops: []
+    }, n, i, o, u;
+    return u = {
+        next: verb(0),
+        throw: verb(1),
+        return: verb(2)
+    }, typeof Symbol === "function" && (u[Symbol.iterator] = function() {
+        return this;
+    }), u;
+    function verb(t) {
+        return function(r) {
+            return step([ t, r ]);
+        };
+    }
+    function step(u) {
+        if (n) throw new TypeError("Generator is already executing.");
+        while (e) try {
+            if (n = 1, i && (o = u[0] & 2 ? i["return"] : u[0] ? i["throw"] || ((o = i["return"]) && o.call(i), 
+            0) : i.next) && !(o = o.call(i, u[1])).done) return o;
+            if (i = 0, o) u = [ u[0] & 2, o.value ];
+            switch (u[0]) {
+              case 0:
+              case 1:
+                o = u;
+                break;
+
+              case 4:
+                e.label++;
+                return {
+                    value: u[1],
+                    done: false
+                };
+
+              case 5:
+                e.label++;
+                i = u[1];
+                u = [ 0 ];
+                continue;
+
+              case 7:
+                u = e.ops.pop();
+                e.trys.pop();
+                continue;
+
+              default:
+                if (!(o = e.trys, o = o.length > 0 && o[o.length - 1]) && (u[0] === 6 || u[0] === 2)) {
+                    e = 0;
+                    continue;
+                }
+                if (u[0] === 3 && (!o || u[1] > o[0] && u[1] < o[3])) {
+                    e.label = u[1];
+                    break;
+                }
+                if (u[0] === 6 && e.label < o[1]) {
+                    e.label = o[1];
+                    o = u;
+                    break;
+                }
+                if (o && e.label < o[2]) {
+                    e.label = o[2];
+                    e.ops.push(u);
+                    break;
+                }
+                if (o[2]) e.ops.pop();
+                e.trys.pop();
+                continue;
+            }
+            u = r.call(t, e);
+        } catch (t) {
+            u = [ 6, t ];
+            i = 0;
+        } finally {
+            n = o = 0;
+        }
+        if (u[0] & 5) throw u[1];
+        return {
+            value: u[0] ? u[1] : void 0,
+            done: true
+        };
+    }
+};
+
+var __read = this && this.q || function(t, r) {
+    var e = typeof Symbol === "function" && t[Symbol.iterator];
+    if (!e) return t;
+    var n = e.call(t), i, o = [], u;
+    try {
+        while ((r === void 0 || r-- > 0) && !(i = n.next()).done) o.push(i.value);
+    } catch (t) {
+        u = {
+            error: t
+        };
+    } finally {
+        try {
+            if (i && !i.done && (e = n["return"])) e.call(n);
+        } finally {
+            if (u) throw u.error;
+        }
+    }
+    return o;
+};
+
+var __spreadArray = this && this.D || function(t, r, e) {
+    if (e || arguments.length === 2) for (var n = 0, i = r.length, o; n < i; n++) {
+        if (o || !(n in r)) {
+            if (!o) o = Array.prototype.slice.call(r, 0, n);
+            o[n] = r[n];
+        }
+    }
+    return t.concat(o || Array.prototype.slice.call(r));
+};
+
+var __values = this && this.V || function(t) {
+    var r = typeof Symbol === "function" && Symbol.iterator, e = r && t[r], n = 0;
+    if (e) return e.call(t);
+    if (t && typeof t.length === "number") return {
+        next: function() {
+            if (t && n >= t.length) t = void 0;
+            return {
+                value: t && t[n++],
+                done: !t
+            };
+        }
+    };
+    throw new TypeError(r ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+
+import SequentialContainer from "./Base";
+
+import { RandomIterator } from "./Base/RandomIterator";
+
+var VectorIterator = function(t) {
+    __extends(VectorIterator, t);
+    function VectorIterator(r, e, n) {
+        var i = t.call(this, r, n) || this;
+        i.container = e;
+        return i;
+    }
+    VectorIterator.prototype.copy = function() {
+        return new VectorIterator(this.o, this.container, this.iteratorType);
+    };
+    return VectorIterator;
+}(RandomIterator);
+
+var Vector = function(t) {
+    __extends(Vector, t);
+    function Vector(r, e) {
+        if (r === void 0) {
+            r = [];
+        }
+        if (e === void 0) {
+            e = true;
+        }
+        var n = t.call(this) || this;
+        if (Array.isArray(r)) {
+            n.J = e ? __spreadArray([], __read(r), false) : r;
+            n.M = r.length;
+        } else {
+            n.J = [];
+            var i = n;
+            r.forEach((function(t) {
+                i.pushBack(t);
+            }));
+        }
+        return n;
+    }
+    Vector.prototype.clear = function() {
+        this.M = 0;
+        this.J.length = 0;
+    };
+    Vector.prototype.begin = function() {
+        return new VectorIterator(0, this);
+    };
+    Vector.prototype.end = function() {
+        return new VectorIterator(this.M, this);
+    };
+    Vector.prototype.rBegin = function() {
+        return new VectorIterator(this.M - 1, this, 1);
+    };
+    Vector.prototype.rEnd = function() {
+        return new VectorIterator(-1, this, 1);
+    };
+    Vector.prototype.front = function() {
+        return this.J[0];
+    };
+    Vector.prototype.back = function() {
+        return this.J[this.M - 1];
+    };
+    Vector.prototype.getElementByPos = function(t) {
+        if (t < 0 || t > this.M - 1) {
+            throw new RangeError;
+        }
+        return this.J[t];
+    };
+    Vector.prototype.eraseElementByPos = function(t) {
+        if (t < 0 || t > this.M - 1) {
+            throw new RangeError;
+        }
+        this.J.splice(t, 1);
+        this.M -= 1;
+        return this.M;
+    };
+    Vector.prototype.eraseElementByValue = function(t) {
+        var r = 0;
+        for (var e = 0; e < this.M; ++e) {
+            if (this.J[e] !== t) {
+                this.J[r++] = this.J[e];
+            }
+        }
+        this.M = this.J.length = r;
+        return this.M;
+    };
+    Vector.prototype.eraseElementByIterator = function(t) {
+        var r = t.o;
+        t = t.next();
+        this.eraseElementByPos(r);
+        return t;
+    };
+    Vector.prototype.pushBack = function(t) {
+        this.J.push(t);
+        this.M += 1;
+        return this.M;
+    };
+    Vector.prototype.popBack = function() {
+        if (this.M === 0) return;
+        this.M -= 1;
+        return this.J.pop();
+    };
+    Vector.prototype.setElementByPos = function(t, r) {
+        if (t < 0 || t > this.M - 1) {
+            throw new RangeError;
+        }
+        this.J[t] = r;
+    };
+    Vector.prototype.insert = function(t, r, e) {
+        var n;
+        if (e === void 0) {
+            e = 1;
+        }
+        if (t < 0 || t > this.M) {
+            throw new RangeError;
+        }
+        (n = this.J).splice.apply(n, __spreadArray([ t, 0 ], __read(new Array(e).fill(r)), false));
+        this.M += e;
+        return this.M;
+    };
+    Vector.prototype.find = function(t) {
+        for (var r = 0; r < this.M; ++r) {
+            if (this.J[r] === t) {
+                return new VectorIterator(r, this);
+            }
+        }
+        return this.end();
+    };
+    Vector.prototype.reverse = function() {
+        this.J.reverse();
+    };
+    Vector.prototype.unique = function() {
+        var t = 1;
+        for (var r = 1; r < this.M; ++r) {
+            if (this.J[r] !== this.J[r - 1]) {
+                this.J[t++] = this.J[r];
+            }
+        }
+        this.M = this.J.length = t;
+        return this.M;
+    };
+    Vector.prototype.sort = function(t) {
+        this.J.sort(t);
+    };
+    Vector.prototype.forEach = function(t) {
+        for (var r = 0; r < this.M; ++r) {
+            t(this.J[r], r, this);
+        }
+    };
+    Vector.prototype[Symbol.iterator] = function() {
+        return function() {
+            return __generator(this, (function(t) {
+                switch (t.label) {
+                  case 0:
+                    return [ 5, __values(this.J) ];
+
+                  case 1:
+                    t.sent();
+                    return [ 2 ];
+                }
+            }));
+        }.bind(this)();
+    };
+    return Vector;
+}(SequentialContainer);
+
+export default Vector;
+//# sourceMappingURL=Vector.js.map

package/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["container/SequentialContainer/Vector.js","../../src/container/SequentialContainer/Vector.ts"],"names":["__extends","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","TypeError","String","__","constructor","create","__generator","thisArg","body","_","label","sent","t","trys","ops","f","y","g","next","verb","throw","return","Symbol","iterator","n","v","step","op","done","value","pop","length","push","e","__read","o","m","i","r","ar","error","__spreadArray","to","from","pack","arguments","l","slice","concat","__values","s","SequentialContainer","RandomIterator","VectorIterator","_super","node","container","iteratorType","_this","copy","_node","Vector","isArray","_vector","_length","self_1","forEach","el","pushBack","clear","begin","end","rBegin","rEnd","front","back","getElementByPos","pos","RangeError","eraseElementByPos","splice","eraseElementByValue","index","eraseElementByIterator","iter","element","popBack","setElementByPos","insert","num","_a","apply","fill","find","reverse","unique","sort","cmp","callback","bind"],"mappings":"AAAA,IAAIA,YAAaC,QAAQA,KAAKD,KAAe;IACzC,IAAIE,gBAAgB,SAAUC,GAAGC;QAC7BF,gBAAgBG,OAAOC,kBAClB;YAAEC,WAAW;qBAAgBC,SAAS,SAAUL,GAAGC;YAAKD,EAAEI,YAAYH;AAAG,aAC1E,SAAUD,GAAGC;YAAK,KAAK,IAAIK,KAAKL,GAAG,IAAIC,OAAOK,UAAUC,eAAeC,KAAKR,GAAGK,IAAIN,EAAEM,KAAKL,EAAEK;AAAI;QACpG,OAAOP,cAAcC,GAAGC;AAC5B;IACA,OAAO,SAAUD,GAAGC;QAChB,WAAWA,MAAM,cAAcA,MAAM,MACjC,MAAM,IAAIS,UAAU,yBAAyBC,OAAOV,KAAK;QAC7DF,cAAcC,GAAGC;QACjB,SAASW;YAAOd,KAAKe,cAAcb;AAAG;QACtCA,EAAEO,YAAYN,MAAM,OAAOC,OAAOY,OAAOb,MAAMW,GAAGL,YAAYN,EAAEM,WAAW,IAAIK;AACnF;AACJ,CAd6C;;AAe7C,IAAIG,cAAejB,QAAQA,KAAKiB,KAAgB,SAAUC,GAASC;IAC/D,IAAIC,IAAI;QAAEC,OAAO;QAAGC,MAAM;YAAa,IAAIC,EAAE,KAAK,GAAG,MAAMA,EAAE;YAAI,OAAOA,EAAE;AAAI;QAAGC,MAAM;QAAIC,KAAK;OAAMC,GAAGC,GAAGJ,GAAGK;IAC/G,OAAOA,IAAI;QAAEC,MAAMC,KAAK;QAAIC,OAASD,KAAK;QAAIE,QAAUF,KAAK;cAAaG,WAAW,eAAeL,EAAEK,OAAOC,YAAY;QAAa,OAAOlC;AAAM,QAAI4B;IACvJ,SAASE,KAAKK;QAAK,OAAO,SAAUC;YAAK,OAAOC,KAAK,EAACF,GAAGC;AAAK;AAAG;IACjE,SAASC,KAAKC;QACV,IAAIZ,GAAG,MAAM,IAAId,UAAU;QAC3B,OAAOQ;YACH,IAAIM,IAAI,GAAGC,MAAMJ,IAAIe,EAAG,KAAK,IAAIX,EAAE,YAAYW,EAAG,KAAKX,EAAE,cAAcJ,IAAII,EAAE,cAAcJ,EAAEZ,KAAKgB;YAAI,KAAKA,EAAEE,WAAWN,IAAIA,EAAEZ,KAAKgB,GAAGW,EAAG,KAAKC,MAAM,OAAOhB;YAC3J,IAAII,IAAI,GAAGJ,GAAGe,IAAK,EAACA,EAAG,KAAK,GAAGf,EAAEiB;YACjC,QAAQF,EAAG;cACP,KAAK;cAAG,KAAK;gBAAGf,IAAIe;gBAAI;;cACxB,KAAK;gBAAGlB,EAAEC;gBAAS,OAAO;oBAAEmB,OAAOF,EAAG;oBAAIC,MAAM;;;cAChD,KAAK;gBAAGnB,EAAEC;gBAASM,IAAIW,EAAG;gBAAIA,IAAK,EAAC;gBAAI;;cACxC,KAAK;gBAAGA,IAAKlB,EAAEK,IAAIgB;gBAAOrB,EAAEI,KAAKiB;gBAAO;;cACxC;gBACI,MAAMlB,IAAIH,EAAEI,MAAMD,IAAIA,EAAEmB,SAAS,KAAKnB,EAAEA,EAAEmB,SAAS,QAAQJ,EAAG,OAAO,KAAKA,EAAG,OAAO,IAAI;oBAAElB,IAAI;oBAAG;AAAU;gBAC3G,IAAIkB,EAAG,OAAO,OAAOf,KAAMe,EAAG,KAAKf,EAAE,MAAMe,EAAG,KAAKf,EAAE,KAAM;oBAAEH,EAAEC,QAAQiB,EAAG;oBAAI;AAAO;gBACrF,IAAIA,EAAG,OAAO,KAAKlB,EAAEC,QAAQE,EAAE,IAAI;oBAAEH,EAAEC,QAAQE,EAAE;oBAAIA,IAAIe;oBAAI;AAAO;gBACpE,IAAIf,KAAKH,EAAEC,QAAQE,EAAE,IAAI;oBAAEH,EAAEC,QAAQE,EAAE;oBAAIH,EAAEK,IAAIkB,KAAKL;oBAAK;AAAO;gBAClE,IAAIf,EAAE,IAAIH,EAAEK,IAAIgB;gBAChBrB,EAAEI,KAAKiB;gBAAO;;YAEtBH,IAAKnB,EAAKR,KAAKO,GAASE;UAC1B,OAAOwB;YAAKN,IAAK,EAAC,GAAGM;YAAIjB,IAAI;AAAG,UAAC;YAAWD,IAAIH,IAAI;AAAG;QACzD,IAAIe,EAAG,KAAK,GAAG,MAAMA,EAAG;QAAI,OAAO;YAAEE,OAAOF,EAAG,KAAKA,EAAG,UAAU;YAAGC,MAAM;;AAC9E;AACJ;;AACA,IAAIM,SAAU7C,QAAQA,KAAK6C,KAAW,SAAUC,GAAGX;IAC/C,IAAIY,WAAWd,WAAW,cAAca,EAAEb,OAAOC;IACjD,KAAKa,GAAG,OAAOD;IACf,IAAIE,IAAID,EAAEpC,KAAKmC,IAAIG,GAAGC,IAAK,IAAIN;IAC/B;QACI,QAAQT,WAAW,KAAKA,MAAM,QAAQc,IAAID,EAAEnB,QAAQU,MAAMW,EAAGP,KAAKM,EAAET;AAQxE,MANA,OAAOW;QAASP,IAAI;YAAEO,OAAOA;;AAAS,MAAC;QAEnC;YACI,IAAIF,MAAMA,EAAEV,SAASQ,IAAIC,EAAE,YAAYD,EAAEpC,KAAKqC;AAElB,UAD/B;YACS,IAAIJ,GAAG,MAAMA,EAAEO;AAAO;AACpC;IACA,OAAOD;AACX;;AACA,IAAIE,gBAAiBpD,QAAQA,KAAKoD,KAAkB,SAAUC,GAAIC,GAAMC;IACpE,IAAIA,KAAQC,UAAUd,WAAW,GAAG,KAAK,IAAIM,IAAI,GAAGS,IAAIH,EAAKZ,QAAQQ,GAAIF,IAAIS,GAAGT,KAAK;QACjF,IAAIE,OAAQF,KAAKM,IAAO;YACpB,KAAKJ,GAAIA,IAAK3C,MAAME,UAAUiD,MAAM/C,KAAK2C,GAAM,GAAGN;YAClDE,EAAGF,KAAKM,EAAKN;AACjB;AACJ;IACA,OAAOK,EAAGM,OAAOT,KAAM3C,MAAME,UAAUiD,MAAM/C,KAAK2C;AACtD;;AACA,IAAIM,WAAY5D,QAAQA,KAAK4D,KAAa,SAASd;IAC/C,IAAIe,WAAW5B,WAAW,cAAcA,OAAOC,UAAUa,IAAIc,KAAKf,EAAEe,IAAIb,IAAI;IAC5E,IAAID,GAAG,OAAOA,EAAEpC,KAAKmC;IACrB,IAAIA,YAAYA,EAAEJ,WAAW,UAAU,OAAO;QAC1Cb,MAAM;YACF,IAAIiB,KAAKE,KAAKF,EAAEJ,QAAQI,SAAS;YACjC,OAAO;gBAAEN,OAAOM,KAAKA,EAAEE;gBAAMT,OAAOO;;AACxC;;IAEJ,MAAM,IAAIlC,UAAUiD,IAAI,4BAA4B;AACxD;;OC7EOC,yBAAyB;;SAEvBC,sBAAgB;;AAGzB,IAAAC,iBAAA,SAAAC;IAAgClE,UAAAiE,gBAAAC;IAE9B,SAAAD,eAAYE,GAAcC,GAAsBC;QAAhD,IAAAC,IACEJ,EAAAtD,KAAAX,MAAMkE,GAAME,MAAapE;QACzBqE,EAAKF,YAAYA;QD6Eb,OAAOE;AACX;IC5EFL,eAAAvD,UAAA6D,OAAA;QACE,OAAO,IAAIN,eAAkBhE,KAAKuE,GAAOvE,KAAKmE,WAAWnE,KAAKoE;AD8E9D;IC1EJ,OAAAJ;AAAA,CAXA,CAAgCD;;AAehC,IAAAS,SAAA,SAAAP;IAAwBlE,UAAAyE,QAAAP;IAUtB,SAAAO,OAAYL,GAAkCG;QAAlC,IAAAH,WAAA,GAAA;YAAAA,IAAA;AAAgC;QAAE,IAAAG,WAAA,GAAA;YAAAA,IAAA;AAAW;QAAzD,IAAAD,IACEJ,EAAAtD,KAAAX,SAAOA;QACP,IAAIO,MAAMkE,QAAQN,IAAY;YAC5BE,EAAKK,IAAUJ,IAAMlB,cAAA,IAAAP,OAAKsB,IAAS,SAAIA;YACvCE,EAAKM,IAAUR,EAAUzB;ADyEvB,eCxEG;YACL2B,EAAKK,IAAU;YACf,IAAME,IAAOP;YACbF,EAAUU,SAAQ,SAAUC;gBAC1BF,EAAKG,SAASD;AD0EV;AACJ;QACA,OAAOT;AACX;ICzEFG,OAAA/D,UAAAuE,QAAA;QACEhF,KAAK2E,IAAU;QACf3E,KAAK0E,EAAQhC,SAAS;AD2EtB;ICzEF8B,OAAA/D,UAAAwE,QAAA;QACE,OAAO,IAAIjB,eAAkB,GAAGhE;AD2EhC;ICzEFwE,OAAA/D,UAAAyE,MAAA;QACE,OAAO,IAAIlB,eAAkBhE,KAAK2E,GAAS3E;AD2E3C;ICzEFwE,OAAA/D,UAAA0E,SAAA;QACE,OAAO,IAAInB,eAAkBhE,KAAK2E,IAAU,GAAG3E,MAAI;AD2EnD;ICzEFwE,OAAA/D,UAAA2E,OAAA;QACE,OAAO,IAAIpB,gBAAmB,GAAGhE,MAAI;AD2ErC;ICzEFwE,OAAA/D,UAAA4E,QAAA;QACE,OAAOrF,KAAK0E,EAAQ;AD2EpB;ICzEFF,OAAA/D,UAAA6E,OAAA;QACE,OAAOtF,KAAK0E,EAAQ1E,KAAK2E,IAAU;AD2EnC;ICzEFH,OAAA/D,UAAA8E,kBAAA,SAAgBC;QD2EV,IC1EsBA,IAAG,KAAHA,IAAQxF,KAAK2E,IAAO,GA3DpC;YAAE,MAAU,IAAIc;ADuItB;QC3EJ,OAAOzF,KAAK0E,EAAQc;AD6EpB;IC3EFhB,OAAA/D,UAAAiF,oBAAA,SAAkBF;QD6EZ,IC5EsBA,IAAG,KAAHA,IAAQxF,KAAK2E,IAAO,GA/DpC;YAAE,MAAU,IAAIc;AD6ItB;QC7EJzF,KAAK0E,EAAQiB,OAAOH,GAAK;QACzBxF,KAAK2E,KAAW;QAChB,OAAO3E,KAAK2E;AD+EZ;IC7EFH,OAAA/D,UAAAmF,sBAAA,SAAoBpD;QAClB,IAAIqD,IAAQ;QACZ,KAAK,IAAI7C,IAAI,GAAGA,IAAIhD,KAAK2E,KAAW3B,GAAG;YACrC,IAAIhD,KAAK0E,EAAQ1B,OAAOR,GAAO;gBAC7BxC,KAAK0E,EAAQmB,OAAW7F,KAAK0E,EAAQ1B;AD+EjC;AACJ;QC7EJhD,KAAK2E,IAAU3E,KAAK0E,EAAQhC,SAASmD;QACrC,OAAO7F,KAAK2E;AD+EZ;IC7EFH,OAAA/D,UAAAqF,yBAAA,SAAuBC;QACrB,IAAMxB,IAAQwB,EAAKxB;QACnBwB,IAAOA,EAAKlE;QACZ7B,KAAK0F,kBAAkBnB;QACvB,OAAOwB;AD+EP;IC7EFvB,OAAA/D,UAAAsE,WAAA,SAASiB;QACPhG,KAAK0E,EAAQ/B,KAAKqD;QAClBhG,KAAK2E,KAAW;QAChB,OAAO3E,KAAK2E;AD+EZ;IC7EFH,OAAA/D,UAAAwF,UAAA;QACE,IAAIjG,KAAK2E,MAAY,GAAG;QACxB3E,KAAK2E,KAAW;QAChB,OAAO3E,KAAK0E,EAAQjC;ADgFpB;IC9EF+B,OAAA/D,UAAAyF,kBAAA,SAAgBV,GAAaQ;QDgFvB,IC/EsBR,IAAG,KAAHA,IAAQxF,KAAK2E,IAAO,GA/FpC;YAAE,MAAU,IAAIc;ADgLtB;QChFJzF,KAAK0E,EAAQc,KAAOQ;ADkFpB;IChFFxB,OAAA/D,UAAA0F,SAAA,SAAOX,GAAaQ,GAAYI;QDkF1B,IAAIC;QClFsB,IAAAD,WAAA,GAAA;YAAAA,IAAA;AAAO;QDoFjC,ICnFsBZ,IAAG,KAAHA,IAAQxF,KAAK2E,GAnG7B;YAAE,MAAU,IAAIc;ADwLtB;SCpFJY,IAAArG,KAAK0E,GAAQiB,OAAMW,MAAAD,GAAAjD,cAAA,EAACoC,GAAK,KAAC3C,OAAK,IAAItC,MAAS6F,GAAKG,KAAKP,KAAQ;QAC9DhG,KAAK2E,KAAWyB;QAChB,OAAOpG,KAAK2E;ADsFZ;ICpFFH,OAAA/D,UAAA+F,OAAA,SAAKR;QACH,KAAK,IAAIhD,IAAI,GAAGA,IAAIhD,KAAK2E,KAAW3B,GAAG;YACrC,IAAIhD,KAAK0E,EAAQ1B,OAAOgD,GAAS;gBAC/B,OAAO,IAAIhC,eAAkBhB,GAAGhD;ADsF5B;AACJ;QCpFJ,OAAOA,KAAKkF;ADsFZ;ICpFFV,OAAA/D,UAAAgG,UAAA;QACEzG,KAAK0E,EAAQ+B;ADsFb;ICpFFjC,OAAA/D,UAAAiG,SAAA;QACE,IAAIb,IAAQ;QACZ,KAAK,IAAI7C,IAAI,GAAGA,IAAIhD,KAAK2E,KAAW3B,GAAG;YACrC,IAAIhD,KAAK0E,EAAQ1B,OAAOhD,KAAK0E,EAAQ1B,IAAI,IAAI;gBAC3ChD,KAAK0E,EAAQmB,OAAW7F,KAAK0E,EAAQ1B;ADsFjC;AACJ;QCpFJhD,KAAK2E,IAAU3E,KAAK0E,EAAQhC,SAASmD;QACrC,OAAO7F,KAAK2E;ADsFZ;ICpFFH,OAAA/D,UAAAkG,OAAA,SAAKC;QACH5G,KAAK0E,EAAQiC,KAAKC;ADsFlB;ICpFFpC,OAAA/D,UAAAoE,UAAA,SAAQgC;QACN,KAAK,IAAI7D,IAAI,GAAGA,IAAIhD,KAAK2E,KAAW3B,GAAG;YACrC6D,EAAS7G,KAAK0E,EAAQ1B,IAAIA,GAAGhD;ADsF3B;AACJ;ICpFFwE,OAAA/D,UAACwB,OAAOC,YAAR;QACE,OAAO;YDsFC,OAAOjB,YAAYjB,OAAM,SAAUqG;gBAC/B,QAAQA,EAAGhF;kBACP,KAAK;oBCvFnB,OAAA,EAAA,GAAAuC,SAAQ5D,KAAK0E;;kBDwFC,KAAK;oBCxFnB2B,EAAA/E;oBD0FkB,OAAO,EAAC;;AAEpB;AACJ,UC5FFwF,KAAK9G,KAFA;AD+FP;IC3FJ,OAAAwE;AAAA,CA7HA,CAAwBV;;eA+HTU","file":"Vector.js","sourcesContent":["var __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n    function verb(n) { return function (v) { return step([n, v]); }; }\n    function step(op) {\n        if (f) throw new TypeError(\"Generator is already executing.\");\n        while (_) try {\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n            if (y = 0, t) op = [op[0] & 2, t.value];\n            switch (op[0]) {\n                case 0: case 1: t = op; break;\n                case 4: _.label++; return { value: op[1], done: false };\n                case 5: _.label++; y = op[1]; op = [0]; continue;\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\n                default:\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                    if (t[2]) _.ops.pop();\n                    _.trys.pop(); continue;\n            }\n            op = body.call(thisArg, _);\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n    }\n};\nvar __read = (this && this.__read) || function (o, n) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n    if (!m) return o;\n    var i = m.call(o), r, ar = [], e;\n    try {\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n    }\n    catch (error) { e = { error: error }; }\n    finally {\n        try {\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\n        }\n        finally { if (e) throw e.error; }\n    }\n    return ar;\n};\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n        if (ar || !(i in from)) {\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n            ar[i] = from[i];\n        }\n    }\n    return to.concat(ar || Array.prototype.slice.call(from));\n};\nvar __values = (this && this.__values) || function(o) {\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n    if (m) return m.call(o);\n    if (o && typeof o.length === \"number\") return {\n        next: function () {\n            if (o && i >= o.length) o = void 0;\n            return { value: o && o[i++], done: !o };\n        }\n    };\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n};\nimport SequentialContainer from './Base';\nimport { RandomIterator } from \"./Base/RandomIterator\";\nimport $checkWithinAccessParams from \"../../utils/checkParams.macro\";\nvar VectorIterator = /** @class */ (function (_super) {\n    __extends(VectorIterator, _super);\n    function VectorIterator(node, container, iteratorType) {\n        var _this = _super.call(this, node, iteratorType) || this;\n        _this.container = container;\n        return _this;\n    }\n    VectorIterator.prototype.copy = function () {\n        return new VectorIterator(this._node, this.container, this.iteratorType);\n    };\n    return VectorIterator;\n}(RandomIterator));\nvar Vector = /** @class */ (function (_super) {\n    __extends(Vector, _super);\n    /**\n     * @param container - Initialize container, must have a forEach function.\n     * @param copy - When the container is an array, you can choose to directly operate on the original object of\n     *               the array or perform a shallow copy. The default is shallow copy.\n     */\n    function Vector(container, copy) {\n        if (container === void 0) { container = []; }\n        if (copy === void 0) { copy = true; }\n        var _this = _super.call(this) || this;\n        if (Array.isArray(container)) {\n            _this._vector = copy ? __spreadArray([], __read(container), false) : container;\n            _this._length = container.length;\n        }\n        else {\n            _this._vector = [];\n            var self_1 = _this;\n            container.forEach(function (el) {\n                self_1.pushBack(el);\n            });\n        }\n        return _this;\n    }\n    Vector.prototype.clear = function () {\n        this._length = 0;\n        this._vector.length = 0;\n    };\n    Vector.prototype.begin = function () {\n        return new VectorIterator(0, this);\n    };\n    Vector.prototype.end = function () {\n        return new VectorIterator(this._length, this);\n    };\n    Vector.prototype.rBegin = function () {\n        return new VectorIterator(this._length - 1, this, 1 /* IteratorType.REVERSE */);\n    };\n    Vector.prototype.rEnd = function () {\n        return new VectorIterator(-1, this, 1 /* IteratorType.REVERSE */);\n    };\n    Vector.prototype.front = function () {\n        return this._vector[0];\n    };\n    Vector.prototype.back = function () {\n        return this._vector[this._length - 1];\n    };\n    Vector.prototype.getElementByPos = function (pos) {\n        if (pos < 0 || pos > this._length - 1) {\n            throw new RangeError();\n        }\n        return this._vector[pos];\n    };\n    Vector.prototype.eraseElementByPos = function (pos) {\n        if (pos < 0 || pos > this._length - 1) {\n            throw new RangeError();\n        }\n        this._vector.splice(pos, 1);\n        this._length -= 1;\n        return this._length;\n    };\n    Vector.prototype.eraseElementByValue = function (value) {\n        var index = 0;\n        for (var i = 0; i < this._length; ++i) {\n            if (this._vector[i] !== value) {\n                this._vector[index++] = this._vector[i];\n            }\n        }\n        this._length = this._vector.length = index;\n        return this._length;\n    };\n    Vector.prototype.eraseElementByIterator = function (iter) {\n        var _node = iter._node;\n        iter = iter.next();\n        this.eraseElementByPos(_node);\n        return iter;\n    };\n    Vector.prototype.pushBack = function (element) {\n        this._vector.push(element);\n        this._length += 1;\n        return this._length;\n    };\n    Vector.prototype.popBack = function () {\n        if (this._length === 0)\n            return;\n        this._length -= 1;\n        return this._vector.pop();\n    };\n    Vector.prototype.setElementByPos = function (pos, element) {\n        if (pos < 0 || pos > this._length - 1) {\n            throw new RangeError();\n        }\n        this._vector[pos] = element;\n    };\n    Vector.prototype.insert = function (pos, element, num) {\n        var _a;\n        if (num === void 0) { num = 1; }\n        if (pos < 0 || pos > this._length) {\n            throw new RangeError();\n        }\n        (_a = this._vector).splice.apply(_a, __spreadArray([pos, 0], __read(new Array(num).fill(element)), false));\n        this._length += num;\n        return this._length;\n    };\n    Vector.prototype.find = function (element) {\n        for (var i = 0; i < this._length; ++i) {\n            if (this._vector[i] === element) {\n                return new VectorIterator(i, this);\n            }\n        }\n        return this.end();\n    };\n    Vector.prototype.reverse = function () {\n        this._vector.reverse();\n    };\n    Vector.prototype.unique = function () {\n        var index = 1;\n        for (var i = 1; i < this._length; ++i) {\n            if (this._vector[i] !== this._vector[i - 1]) {\n                this._vector[index++] = this._vector[i];\n            }\n        }\n        this._length = this._vector.length = index;\n        return this._length;\n    };\n    Vector.prototype.sort = function (cmp) {\n        this._vector.sort(cmp);\n    };\n    Vector.prototype.forEach = function (callback) {\n        for (var i = 0; i < this._length; ++i) {\n            callback(this._vector[i], i, this);\n        }\n    };\n    Vector.prototype[Symbol.iterator] = function () {\n        return function () {\n            return __generator(this, function (_a) {\n                switch (_a.label) {\n                    case 0: return [5 /*yield**/, __values(this._vector)];\n                    case 1:\n                        _a.sent();\n                        return [2 /*return*/];\n                }\n            });\n        }.bind(this)();\n    };\n    return Vector;\n}(SequentialContainer));\nexport default Vector;\n","import SequentialContainer from './Base';\nimport { initContainer, IteratorType } from '@/container/ContainerBase';\nimport { RandomIterator } from '@/container/SequentialContainer/Base/RandomIterator';\nimport $checkWithinAccessParams from '@/utils/checkParams.macro';\n\nclass VectorIterator<T> extends RandomIterator<T> {\n  container: Vector<T>;\n  constructor(node: number, container: Vector<T>, iteratorType?: IteratorType) {\n    super(node, iteratorType);\n    this.container = container;\n  }\n  copy() {\n    return new VectorIterator<T>(this._node, this.container, this.iteratorType);\n  }\n  // @ts-ignore\n  equals(iter: VectorIterator<T>): boolean;\n}\n\nexport type { VectorIterator };\n\nclass Vector<T> extends SequentialContainer<T> {\n  /**\n   * @internal\n   */\n  private readonly _vector: T[];\n  /**\n   * @param container - Initialize container, must have a forEach function.\n   * @param copy - When the container is an array, you can choose to directly operate on the original object of\n   *               the array or perform a shallow copy. The default is shallow copy.\n   */\n  constructor(container: initContainer<T> = [], copy = true) {\n    super();\n    if (Array.isArray(container)) {\n      this._vector = copy ? [...container] : container;\n      this._length = container.length;\n    } else {\n      this._vector = [];\n      const self = this;\n      container.forEach(function (el) {\n        self.pushBack(el);\n      });\n    }\n  }\n  clear() {\n    this._length = 0;\n    this._vector.length = 0;\n  }\n  begin() {\n    return new VectorIterator<T>(0, this);\n  }\n  end() {\n    return new VectorIterator<T>(this._length, this);\n  }\n  rBegin() {\n    return new VectorIterator<T>(this._length - 1, this, IteratorType.REVERSE);\n  }\n  rEnd() {\n    return new VectorIterator<T>(-1, this, IteratorType.REVERSE);\n  }\n  front(): T | undefined {\n    return this._vector[0];\n  }\n  back(): T | undefined {\n    return this._vector[this._length - 1];\n  }\n  getElementByPos(pos: number) {\n    $checkWithinAccessParams!(pos, 0, this._length - 1);\n    return this._vector[pos];\n  }\n  eraseElementByPos(pos: number) {\n    $checkWithinAccessParams!(pos, 0, this._length - 1);\n    this._vector.splice(pos, 1);\n    this._length -= 1;\n    return this._length;\n  }\n  eraseElementByValue(value: T) {\n    let index = 0;\n    for (let i = 0; i < this._length; ++i) {\n      if (this._vector[i] !== value) {\n        this._vector[index++] = this._vector[i];\n      }\n    }\n    this._length = this._vector.length = index;\n    return this._length;\n  }\n  eraseElementByIterator(iter: VectorIterator<T>) {\n    const _node = iter._node;\n    iter = iter.next();\n    this.eraseElementByPos(_node);\n    return iter;\n  }\n  pushBack(element: T) {\n    this._vector.push(element);\n    this._length += 1;\n    return this._length;\n  }\n  popBack() {\n    if (this._length === 0) return;\n    this._length -= 1;\n    return this._vector.pop();\n  }\n  setElementByPos(pos: number, element: T) {\n    $checkWithinAccessParams!(pos, 0, this._length - 1);\n    this._vector[pos] = element;\n  }\n  insert(pos: number, element: T, num = 1) {\n    $checkWithinAccessParams!(pos, 0, this._length);\n    this._vector.splice(pos, 0, ...new Array<T>(num).fill(element));\n    this._length += num;\n    return this._length;\n  }\n  find(element: T) {\n    for (let i = 0; i < this._length; ++i) {\n      if (this._vector[i] === element) {\n        return new VectorIterator<T>(i, this);\n      }\n    }\n    return this.end();\n  }\n  reverse() {\n    this._vector.reverse();\n  }\n  unique() {\n    let index = 1;\n    for (let i = 1; i < this._length; ++i) {\n      if (this._vector[i] !== this._vector[i - 1]) {\n        this._vector[index++] = this._vector[i];\n      }\n    }\n    this._length = this._vector.length = index;\n    return this._length;\n  }\n  sort(cmp?: (x: T, y: T) => number) {\n    this._vector.sort(cmp);\n  }\n  forEach(callback: (element: T, index: number, vector: Vector<T>) => void) {\n    for (let i = 0; i < this._length; ++i) {\n      callback(this._vector[i], i, this);\n    }\n  }\n  [Symbol.iterator]() {\n    return function * (this: Vector<T>) {\n      yield * this._vector;\n    }.bind(this)();\n  }\n}\n\nexport default Vector;\n"]}

package/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.d.ts

@@ -0,0 +1,18 @@
+import { ContainerIterator } from "../../ContainerBase";
+import TreeContainer from "./index";
+declare abstract class TreeIterator<K, V> extends ContainerIterator<K | [K, V]> {
+    abstract readonly container: TreeContainer<K, V>;
+    /**
+     * @description Get the sequential index of the iterator in the tree container.<br/>
+     *              <strong>Note:</strong>
+     *              This function only takes effect when the specified tree container `enableIndex = true`.
+     * @returns The index subscript of the node in the tree.
+     * @example
+     * const st = new OrderedSet([1, 2, 3], true);
+     * console.log(st.begin().next().index);  // 1
+     */
+    get index(): number;
+    pre(): this;
+    next(): this;
+}
+export default TreeIterator;

package/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js

@@ -0,0 +1,98 @@
+var __extends = this && this.t || function() {
+    var extendStatics = function(r, t) {
+        extendStatics = Object.setPrototypeOf || {
+            __proto__: []
+        } instanceof Array && function(r, t) {
+            r.__proto__ = t;
+        } || function(r, t) {
+            for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) r[e] = t[e];
+        };
+        return extendStatics(r, t);
+    };
+    return function(r, t) {
+        if (typeof t !== "function" && t !== null) throw new TypeError("Class extends value " + String(t) + " is not a constructor or null");
+        extendStatics(r, t);
+        function __() {
+            this.constructor = r;
+        }
+        r.prototype = t === null ? Object.create(t) : (__.prototype = t.prototype, new __);
+    };
+}();
+
+import { ContainerIterator } from "../../ContainerBase";
+
+import { throwIteratorAccessError } from "../../../utils/throwError";
+
+var TreeIterator = function(r) {
+    __extends(TreeIterator, r);
+    function TreeIterator(t, e, i) {
+        var n = r.call(this, i) || this;
+        n.o = t;
+        n.h = e;
+        if (n.iteratorType === 0) {
+            n.pre = function() {
+                if (this.o === this.h.K) {
+                    throwIteratorAccessError();
+                }
+                this.o = this.o.L();
+                return this;
+            };
+            n.next = function() {
+                if (this.o === this.h) {
+                    throwIteratorAccessError();
+                }
+                this.o = this.o.m();
+                return this;
+            };
+        } else {
+            n.pre = function() {
+                if (this.o === this.h.N) {
+                    throwIteratorAccessError();
+                }
+                this.o = this.o.m();
+                return this;
+            };
+            n.next = function() {
+                if (this.o === this.h) {
+                    throwIteratorAccessError();
+                }
+                this.o = this.o.L();
+                return this;
+            };
+        }
+        return n;
+    }
+    Object.defineProperty(TreeIterator.prototype, "index", {
+        get: function() {
+            var r = this.o;
+            var t = this.h.rr;
+            if (r === this.h) {
+                if (t) {
+                    return t.tr - 1;
+                }
+                return 0;
+            }
+            var e = 0;
+            if (r.K) {
+                e += r.K.tr;
+            }
+            while (r !== t) {
+                var i = r.rr;
+                if (r === i.N) {
+                    e += 1;
+                    if (i.K) {
+                        e += i.K.tr;
+                    }
+                }
+                r = i;
+            }
+            return e;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return TreeIterator;
+}(ContainerIterator);
+
+export default TreeIterator;
+//# sourceMappingURL=TreeIterator.js.map

package/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["container/TreeContainer/Base/TreeIterator.js","../../src/container/TreeContainer/Base/TreeIterator.ts"],"names":["__extends","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","TypeError","String","__","constructor","create","ContainerIterator","throwIteratorAccessError","TreeIterator","_super","node","header","iteratorType","_this","_node","_header","pre","_left","_pre","next","_next","_right","defineProperty","get","root","_parent","_subTreeSize","index","enumerable","configurable"],"mappings":"AAAA,IAAIA,YAAaC,QAAQA,KAAKD,KAAe;IACzC,IAAIE,gBAAgB,SAAUC,GAAGC;QAC7BF,gBAAgBG,OAAOC,kBAClB;YAAEC,WAAW;qBAAgBC,SAAS,SAAUL,GAAGC;YAAKD,EAAEI,YAAYH;AAAG,aAC1E,SAAUD,GAAGC;YAAK,KAAK,IAAIK,KAAKL,GAAG,IAAIC,OAAOK,UAAUC,eAAeC,KAAKR,GAAGK,IAAIN,EAAEM,KAAKL,EAAEK;AAAI;QACpG,OAAOP,cAAcC,GAAGC;AAC5B;IACA,OAAO,SAAUD,GAAGC;QAChB,WAAWA,MAAM,cAAcA,MAAM,MACjC,MAAM,IAAIS,UAAU,yBAAyBC,OAAOV,KAAK;QAC7DF,cAAcC,GAAGC;QACjB,SAASW;YAAOd,KAAKe,cAAcb;AAAG;QACtCA,EAAEO,YAAYN,MAAM,OAAOC,OAAOY,OAAOb,MAAMW,GAAGL,YAAYN,EAAEM,WAAW,IAAIK;AACnF;AACJ,CAd6C;;SCEpCG,yBAAiC;;SAEjCC,gCAA0B;;AAEnC,IAAAC,eAAA,SAAAC;IAA0CrB,UAAAoB,cAAAC;IAaxC,SAAAD,aACEE,GACAC,GACAC;QAHF,IAAAC,IAKEJ,EAAAT,KAAAX,MAAMuB,MAAavB;QACnBwB,EAAKC,IAAQJ;QACbG,EAAKE,IAAUJ;QACf,IAAIE,EAAKD,iBAAY,GAA0B;YAC7CC,EAAKG,MAAM;gBACT,IAAI3B,KAAKyB,MAAUzB,KAAK0B,EAAQE,GAAO;oBACrCV;ADAM;gBCERlB,KAAKyB,IAAQzB,KAAKyB,EAAMI;gBACxB,OAAO7B;ADAH;YCGNwB,EAAKM,OAAO;gBACV,IAAI9B,KAAKyB,MAAUzB,KAAK0B,GAAS;oBAC/BR;ADDM;gBCGRlB,KAAKyB,IAAQzB,KAAKyB,EAAMM;gBACxB,OAAO/B;ADDH;AACJ,eCEG;YACLwB,EAAKG,MAAM;gBACT,IAAI3B,KAAKyB,MAAUzB,KAAK0B,EAAQM,GAAQ;oBACtCd;ADAM;gBCERlB,KAAKyB,IAAQzB,KAAKyB,EAAMM;gBACxB,OAAO/B;ADAH;YCGNwB,EAAKM,OAAO;gBACV,IAAI9B,KAAKyB,MAAUzB,KAAK0B,GAAS;oBAC/BR;ADDM;gBCGRlB,KAAKyB,IAAQzB,KAAKyB,EAAMI;gBACxB,OAAO7B;ADDH;AACJ;QACA,OAAOwB;AACX;ICWFpB,OAAA6B,eAAId,aAAAV,WAAA,SAAK;QDAHyB,KCAN;YACE,IAAIT,IAAQzB,KAAKyB;YACjB,IAAMU,IAAOnC,KAAK0B,EAAQU;YAC1B,IAAIX,MAAUzB,KAAK0B,GAAS;gBAC1B,IAAIS,GAAM;oBACR,OAAOA,EAAKE,KAAe;ADCnB;gBCCV,OAAO;ADCD;YCCR,IAAIC,IAAQ;YACZ,IAAIb,EAAMG,GAAO;gBACfU,KAAUb,EAAMG,EAAoCS;ADC9C;YCCR,OAAOZ,MAAUU,GAAM;gBACrB,IAAMC,IAAUX,EAAMW;gBACtB,IAAIX,MAAUW,EAAQJ,GAAQ;oBAC5BM,KAAS;oBACT,IAAIF,EAAQR,GAAO;wBACjBU,KAAUF,EAAQR,EAAoCS;ADC5C;AACJ;gBCCVZ,IAAQW;ADCF;YCCR,OAAOE;ADCH;QACAC,YAAY;QACZC,cAAc;;ICGtB,OAAArB;AAAA,CA7FA,CAA0CF;;eA+F3BE","file":"TreeIterator.js","sourcesContent":["var __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nimport { ContainerIterator } from \"../../ContainerBase\";\nimport { throwIteratorAccessError } from \"../../../utils/throwError\";\nvar TreeIterator = /** @class */ (function (_super) {\n    __extends(TreeIterator, _super);\n    /**\n     * @internal\n     */\n    function TreeIterator(node, header, iteratorType) {\n        var _this = _super.call(this, iteratorType) || this;\n        _this._node = node;\n        _this._header = header;\n        if (_this.iteratorType === 0 /* IteratorType.NORMAL */) {\n            _this.pre = function () {\n                if (this._node === this._header._left) {\n                    throwIteratorAccessError();\n                }\n                this._node = this._node._pre();\n                return this;\n            };\n            _this.next = function () {\n                if (this._node === this._header) {\n                    throwIteratorAccessError();\n                }\n                this._node = this._node._next();\n                return this;\n            };\n        }\n        else {\n            _this.pre = function () {\n                if (this._node === this._header._right) {\n                    throwIteratorAccessError();\n                }\n                this._node = this._node._next();\n                return this;\n            };\n            _this.next = function () {\n                if (this._node === this._header) {\n                    throwIteratorAccessError();\n                }\n                this._node = this._node._pre();\n                return this;\n            };\n        }\n        return _this;\n    }\n    Object.defineProperty(TreeIterator.prototype, \"index\", {\n        /**\n         * @description Get the sequential index of the iterator in the tree container.<br/>\n         *              <strong>Note:</strong>\n         *              This function only takes effect when the specified tree container `enableIndex = true`.\n         * @returns The index subscript of the node in the tree.\n         * @example\n         * const st = new OrderedSet([1, 2, 3], true);\n         * console.log(st.begin().next().index);  // 1\n         */\n        get: function () {\n            var _node = this._node;\n            var root = this._header._parent;\n            if (_node === this._header) {\n                if (root) {\n                    return root._subTreeSize - 1;\n                }\n                return 0;\n            }\n            var index = 0;\n            if (_node._left) {\n                index += _node._left._subTreeSize;\n            }\n            while (_node !== root) {\n                var _parent = _node._parent;\n                if (_node === _parent._right) {\n                    index += 1;\n                    if (_parent._left) {\n                        index += _parent._left._subTreeSize;\n                    }\n                }\n                _node = _parent;\n            }\n            return index;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    return TreeIterator;\n}(ContainerIterator));\nexport default TreeIterator;\n","import { TreeNode } from './TreeNode';\nimport type { TreeNodeEnableIndex } from './TreeNode';\nimport { ContainerIterator, IteratorType } from '@/container/ContainerBase';\nimport TreeContainer from '@/container/TreeContainer/Base/index';\nimport { throwIteratorAccessError } from '@/utils/throwError';\n\nabstract class TreeIterator<K, V> extends ContainerIterator<K | [K, V]> {\n  abstract readonly container: TreeContainer<K, V>;\n  /**\n   * @internal\n   */\n  _node: TreeNode<K, V>;\n  /**\n   * @internal\n   */\n  protected _header: TreeNode<K, V>;\n  /**\n   * @internal\n   */\n  protected constructor(\n    node: TreeNode<K, V>,\n    header: TreeNode<K, V>,\n    iteratorType?: IteratorType\n  ) {\n    super(iteratorType);\n    this._node = node;\n    this._header = header;\n    if (this.iteratorType === IteratorType.NORMAL) {\n      this.pre = function () {\n        if (this._node === this._header._left) {\n          throwIteratorAccessError();\n        }\n        this._node = this._node._pre();\n        return this;\n      };\n\n      this.next = function () {\n        if (this._node === this._header) {\n          throwIteratorAccessError();\n        }\n        this._node = this._node._next();\n        return this;\n      };\n    } else {\n      this.pre = function () {\n        if (this._node === this._header._right) {\n          throwIteratorAccessError();\n        }\n        this._node = this._node._next();\n        return this;\n      };\n\n      this.next = function () {\n        if (this._node === this._header) {\n          throwIteratorAccessError();\n        }\n        this._node = this._node._pre();\n        return this;\n      };\n    }\n  }\n  /**\n   * @description Get the sequential index of the iterator in the tree container.<br/>\n   *              <strong>Note:</strong>\n   *              This function only takes effect when the specified tree container `enableIndex = true`.\n   * @returns The index subscript of the node in the tree.\n   * @example\n   * const st = new OrderedSet([1, 2, 3], true);\n   * console.log(st.begin().next().index);  // 1\n   */\n  get index() {\n    let _node = this._node as TreeNodeEnableIndex<K, V>;\n    const root = this._header._parent as TreeNodeEnableIndex<K, V>;\n    if (_node === this._header) {\n      if (root) {\n        return root._subTreeSize - 1;\n      }\n      return 0;\n    }\n    let index = 0;\n    if (_node._left) {\n      index += (_node._left as TreeNodeEnableIndex<K, V>)._subTreeSize;\n    }\n    while (_node !== root) {\n      const _parent = _node._parent as TreeNodeEnableIndex<K, V>;\n      if (_node === _parent._right) {\n        index += 1;\n        if (_parent._left) {\n          index += (_parent._left as TreeNodeEnableIndex<K, V>)._subTreeSize;\n        }\n      }\n      _node = _parent;\n    }\n    return index;\n  }\n  // @ts-ignore\n  pre(): this;\n  // @ts-ignore\n  next(): this;\n}\n\nexport default TreeIterator;\n"]}

package/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.d.ts

@@ -0,0 +1,47 @@
+export declare const enum TreeNodeColor {
+    RED = 1,
+    BLACK = 0
+}
+export declare class TreeNode<K, V> {
+    _color: TreeNodeColor;
+    _key: K | undefined;
+    _value: V | undefined;
+    _left: TreeNode<K, V> | undefined;
+    _right: TreeNode<K, V> | undefined;
+    _parent: TreeNode<K, V> | undefined;
+    constructor(key?: K, value?: V);
+    /**
+     * @description Get the pre node.
+     * @returns TreeNode about the pre node.
+     */
+    _pre(): TreeNode<K, V>;
+    /**
+     * @description Get the next node.
+     * @returns TreeNode about the next node.
+     */
+    _next(): TreeNode<K, V>;
+    /**
+     * @description Rotate left.
+     * @returns TreeNode about moved to original position after rotation.
+     */
+    _rotateLeft(): TreeNode<K, V>;
+    /**
+     * @description Rotate right.
+     * @returns TreeNode about moved to original position after rotation.
+     */
+    _rotateRight(): TreeNode<K, V>;
+}
+export declare class TreeNodeEnableIndex<K, V> extends TreeNode<K, V> {
+    _subTreeSize: number;
+    /**
+     * @description Rotate left and do recount.
+     * @returns TreeNode about moved to original position after rotation.
+     */
+    _rotateLeft(): TreeNodeEnableIndex<K, V>;
+    /**
+     * @description Rotate right and do recount.
+     * @returns TreeNode about moved to original position after rotation.
+     */
+    _rotateRight(): TreeNodeEnableIndex<K, V>;
+    _recount(): void;
+}