File Explorer

1var __extends = this && this.t || function() {2    var extendStatics = function(t, r) {3        extendStatics = Object.setPrototypeOf || {4            __proto__: []5        } instanceof Array && function(t, r) {6            t.__proto__ = r;7        } || function(t, r) {8            for (var e in r) if (Object.prototype.hasOwnProperty.call(r, e)) t[e] = r[e];9        };10        return extendStatics(t, r);11    };12    return function(t, r) {13        if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");14        extendStatics(t, r);15        function __() {16            this.constructor = t;17        }18        t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);19    };20}();21 22var __generator = this && this.i || function(t, r) {23    var e = {24        label: 0,25        sent: function() {26            if (s[0] & 1) throw s[1];27            return s[1];28        },29        trys: [],30        ops: []31    }, n, i, s, a;32    return a = {33        next: verb(0),34        throw: verb(1),35        return: verb(2)36    }, typeof Symbol === "function" && (a[Symbol.iterator] = function() {37        return this;38    }), a;39    function verb(t) {40        return function(r) {41            return step([ t, r ]);42        };43    }44    function step(a) {45        if (n) throw new TypeError("Generator is already executing.");46        while (e) try {47            if (n = 1, i && (s = a[0] & 2 ? i["return"] : a[0] ? i["throw"] || ((s = i["return"]) && s.call(i), 48            0) : i.next) && !(s = s.call(i, a[1])).done) return s;49            if (i = 0, s) a = [ a[0] & 2, s.value ];50            switch (a[0]) {51              case 0:52              case 1:53                s = a;54                break;55 56              case 4:57                e.label++;58                return {59                    value: a[1],60                    done: false61                };62 63              case 5:64                e.label++;65                i = a[1];66                a = [ 0 ];67                continue;68 69              case 7:70                a = e.ops.pop();71                e.trys.pop();72                continue;73 74              default:75                if (!(s = e.trys, s = s.length > 0 && s[s.length - 1]) && (a[0] === 6 || a[0] === 2)) {76                    e = 0;77                    continue;78                }79                if (a[0] === 3 && (!s || a[1] > s[0] && a[1] < s[3])) {80                    e.label = a[1];81                    break;82                }83                if (a[0] === 6 && e.label < s[1]) {84                    e.label = s[1];85                    s = a;86                    break;87                }88                if (s && e.label < s[2]) {89                    e.label = s[2];90                    e.ops.push(a);91                    break;92                }93                if (s[2]) e.ops.pop();94                e.trys.pop();95                continue;96            }97            a = r.call(t, e);98        } catch (t) {99            a = [ 6, t ];100            i = 0;101        } finally {102            n = s = 0;103        }104        if (a[0] & 5) throw a[1];105        return {106            value: a[0] ? a[1] : void 0,107            done: true108        };109    }110};111 112import { HashContainer, HashContainerIterator } from "./Base";113 114import { throwIteratorAccessError } from "../../utils/throwError";115 116var HashSetIterator = function(t) {117    __extends(HashSetIterator, t);118    function HashSetIterator(r, e, n, i) {119        var s = t.call(this, r, e, i) || this;120        s.container = n;121        return s;122    }123    Object.defineProperty(HashSetIterator.prototype, "pointer", {124        get: function() {125            if (this.o === this.h) {126                throwIteratorAccessError();127            }128            return this.o.u;129        },130        enumerable: false,131        configurable: true132    });133    HashSetIterator.prototype.copy = function() {134        return new HashSetIterator(this.o, this.h, this.container, this.iteratorType);135    };136    return HashSetIterator;137}(HashContainerIterator);138 139var HashSet = function(t) {140    __extends(HashSet, t);141    function HashSet(r) {142        if (r === void 0) {143            r = [];144        }145        var e = t.call(this) || this;146        var n = e;147        r.forEach((function(t) {148            n.insert(t);149        }));150        return e;151    }152    HashSet.prototype.begin = function() {153        return new HashSetIterator(this.H, this.h, this);154    };155    HashSet.prototype.end = function() {156        return new HashSetIterator(this.h, this.h, this);157    };158    HashSet.prototype.rBegin = function() {159        return new HashSetIterator(this.l, this.h, this, 1);160    };161    HashSet.prototype.rEnd = function() {162        return new HashSetIterator(this.h, this.h, this, 1);163    };164    HashSet.prototype.front = function() {165        return this.H.u;166    };167    HashSet.prototype.back = function() {168        return this.l.u;169    };170    HashSet.prototype.insert = function(t, r) {171        return this.v(t, undefined, r);172    };173    HashSet.prototype.getElementByPos = function(t) {174        if (t < 0 || t > this.M - 1) {175            throw new RangeError;176        }177        var r = this.H;178        while (t--) {179            r = r.m;180        }181        return r.u;182    };183    HashSet.prototype.find = function(t, r) {184        var e = this.g(t, r);185        return new HashSetIterator(e, this.h, this);186    };187    HashSet.prototype.forEach = function(t) {188        var r = 0;189        var e = this.H;190        while (e !== this.h) {191            t(e.u, r++, this);192            e = e.m;193        }194    };195    HashSet.prototype[Symbol.iterator] = function() {196        return function() {197            var t;198            return __generator(this, (function(r) {199                switch (r.label) {200                  case 0:201                    t = this.H;202                    r.label = 1;203 204                  case 1:205                    if (!(t !== this.h)) return [ 3, 3 ];206                    return [ 4, t.u ];207 208                  case 2:209                    r.sent();210                    t = t.m;211                    return [ 3, 1 ];212 213                  case 3:214                    return [ 2 ];215                }216            }));217        }.bind(this)();218    };219    return HashSet;220}(HashContainer);221 222export default HashSet;223//# sourceMappingURL=HashSet.js.map224