@figliolia/data-structures
Version:
Efficient data structures for every day programming
30 lines (29 loc) • 1.36 kB
JavaScript
;
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
var desc = Object.getOwnPropertyDescriptor(m, k);
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
desc = { enumerable: true, get: function() { return m[k]; } };
}
Object.defineProperty(o, k2, desc);
}) : (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
o[k2] = m[k];
}));
var __exportStar = (this && this.__exportStar) || function(m, exports) {
for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
};
Object.defineProperty(exports, "__esModule", { value: true });
__exportStar(require("./Queue"), exports);
__exportStar(require("./Stack"), exports);
__exportStar(require("./Trie"), exports);
__exportStar(require("./Graph"), exports);
__exportStar(require("./MinHeap"), exports);
__exportStar(require("./MaxHeap"), exports);
__exportStar(require("./MinStack"), exports);
__exportStar(require("./MaxStack"), exports);
__exportStar(require("./LinkedList"), exports);
__exportStar(require("./QuickStack"), exports);
__exportStar(require("./QuickQueue"), exports);
__exportStar(require("./PriorityQueue"), exports);
__exportStar(require("./binary-search"), exports);