UNPKG

@white-matrix/event-emitter

Version:

The Emitter can be used to expose an Event to the public to fire it from the insides.

174 lines (173 loc) 6.53 kB
"use strict"; /* --------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. * Licensed under the MIT License. See License.txt in the project root for license information. *-------------------------------------------------------------------------------------------- */ var __generator = (this && this.__generator) || function (thisArg, body) { var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g; return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; function verb(n) { return function (v) { return step([n, v]); }; } function step(op) { if (f) throw new TypeError("Generator is already executing."); while (_) try { 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; if (y = 0, t) op = [op[0] & 2, t.value]; switch (op[0]) { case 0: case 1: t = op; break; case 4: _.label++; return { value: op[1], done: false }; case 5: _.label++; y = op[1]; op = [0]; continue; case 7: op = _.ops.pop(); _.trys.pop(); continue; default: if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; } if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; } if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; } if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; } if (t[2]) _.ops.pop(); _.trys.pop(); continue; } op = body.call(thisArg, _); } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; } if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true }; } }; Object.defineProperty(exports, "__esModule", { value: true }); exports.LinkedList = void 0; var Node = /** @class */ (function () { function Node(element) { this.element = element; this.next = Node.Undefined; this.prev = Node.Undefined; } Node.Undefined = new Node(undefined); return Node; }()); var LinkedList = /** @class */ (function () { function LinkedList() { this._first = Node.Undefined; this._last = Node.Undefined; this._size = 0; } Object.defineProperty(LinkedList.prototype, "size", { get: function () { return this._size; }, enumerable: false, configurable: true }); LinkedList.prototype.isEmpty = function () { return this._first === Node.Undefined; }; LinkedList.prototype.clear = function () { this._first = Node.Undefined; this._last = Node.Undefined; this._size = 0; }; LinkedList.prototype.unshift = function (element) { return this._insert(element, false); }; LinkedList.prototype.push = function (element) { return this._insert(element, true); }; LinkedList.prototype.shift = function () { if (this._first === Node.Undefined) { return undefined; } else { var res = this._first.element; this._remove(this._first); return res; } }; LinkedList.prototype.pop = function () { if (this._last === Node.Undefined) { return undefined; } else { var res = this._last.element; this._remove(this._last); return res; } }; LinkedList.prototype[Symbol.iterator] = function () { var node; return __generator(this, function (_a) { switch (_a.label) { case 0: node = this._first; _a.label = 1; case 1: if (!(node !== Node.Undefined)) return [3 /*break*/, 3]; return [4 /*yield*/, node.element]; case 2: _a.sent(); node = node.next; return [3 /*break*/, 1]; case 3: return [2 /*return*/]; } }); }; LinkedList.prototype.toArray = function () { var result = []; for (var node = this._first; node !== Node.Undefined; node = node.next) { result.push(node.element); } return result; }; LinkedList.prototype._insert = function (element, atTheEnd) { var _this = this; var newNode = new Node(element); if (this._first === Node.Undefined) { this._first = newNode; this._last = newNode; } else if (atTheEnd) { // push var oldLast = this._last; this._last = newNode; newNode.prev = oldLast; oldLast.next = newNode; } else { // unshift var oldFirst = this._first; this._first = newNode; newNode.next = oldFirst; oldFirst.prev = newNode; } this._size += 1; var didRemove = false; return function () { if (!didRemove) { didRemove = true; _this._remove(newNode); } }; }; LinkedList.prototype._remove = function (node) { if (node.prev !== Node.Undefined && node.next !== Node.Undefined) { // middle var anchor = node.prev; anchor.next = node.next; node.next.prev = anchor; } else if (node.prev === Node.Undefined && node.next === Node.Undefined) { // only node this._first = Node.Undefined; this._last = Node.Undefined; } else if (node.next === Node.Undefined) { // last this._last = this._last.prev; this._last.next = Node.Undefined; } else if (node.prev === Node.Undefined) { // first this._first = this._first.next; this._first.prev = Node.Undefined; } // done this._size -= 1; }; return LinkedList; }()); exports.LinkedList = LinkedList;