slim-stack
Version:
stack implementation for JavaScript
145 lines • 4.65 kB
JavaScript
;
/*!
* slim-stack <https://github.com/nivrith/slim-stack>
*
* Copyright (c) Nivrith
* Licensed under the MIT License.
*/
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 };
}
};
var __read = (this && this.__read) || function (o, n) {
var m = typeof Symbol === "function" && o[Symbol.iterator];
if (!m) return o;
var i = m.call(o), r, ar = [], e;
try {
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
}
catch (error) { e = { error: error }; }
finally {
try {
if (r && !r.done && (m = i["return"])) m.call(i);
}
finally { if (e) throw e.error; }
}
return ar;
};
var __spread = (this && this.__spread) || function () {
for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));
return ar;
};
var __values = (this && this.__values) || function (o) {
var m = typeof Symbol === "function" && o[Symbol.iterator], i = 0;
if (m) return m.call(o);
return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
};
Object.defineProperty(exports, "__esModule", { value: true });
/**
*
*
* @export
* @class SlimStack
* @template T
*/
var SlimStack = /** @class */ (function () {
/**
*Creates an instance of SlimStack.
* @param {Array<T>} [array=[]]
* @memberof SlimStack
*/
function SlimStack(array) {
if (array === void 0) { array = []; }
/**
*
*
* @private
* @type {number}
* @memberof SlimStack
*/
this.length = 0;
this.stack = array;
this.length = array.length;
}
/**
*
*
* @memberof SlimStack
*/
SlimStack.prototype.push = function (item) {
this.stack.push(item);
return ++this.length;
};
/**
*
*
* @memberof SlimStack
*/
SlimStack.prototype.pop = function () {
var item = this.stack.pop();
this.length--;
return item;
};
/**
*
*
* @memberof SlimStack
*/
SlimStack.prototype.size = function () {
return this.length;
};
/**
*
*
* @memberof SlimStack
*/
SlimStack.prototype.peek = function () {
return this.stack[this.length - 1];
};
/**
*
*
* @memberof SlimStack
*/
SlimStack.prototype[Symbol.iterator] = function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(__spread(this.stack).reverse())];
case 1:
_a.sent();
return [2 /*return*/];
}
});
};
return SlimStack;
}());
exports.SlimStack = SlimStack;
//# sourceMappingURL=index.js.map