@gabrielrufino/cube 1.0.1

package/build/Dictionary/index.js

@@ -0,0 +1,110 @@
+"use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var Dictionary = /** @class */ (function () {
+    function Dictionary(inputs) {
+        if (inputs === void 0) { inputs = {}; }
+        this._data = {};
+        this._data = inputs;
+    }
+    Object.defineProperty(Dictionary.prototype, "data", {
+        get: function () {
+            return __assign({}, this._data);
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Dictionary.prototype, "size", {
+        get: function () {
+            return Reflect.ownKeys(this.data).length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Dictionary.prototype, "isEmpty", {
+        get: function () {
+            return this.size === 0;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Dictionary.prototype, "keys", {
+        get: function () {
+            return Reflect
+                .ownKeys(this.data)
+                .map(function (key) { return String(key); });
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Dictionary.prototype, "values", {
+        get: function () {
+            return Object.values(this.data);
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Dictionary.prototype, "pairs", {
+        get: function () {
+            return Object.entries(this.data);
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Dictionary.prototype.set = function (key, value) {
+        Reflect.set(this._data, key, value);
+        return [key, value];
+    };
+    Dictionary.prototype.remove = function (key) {
+        if (this.hasKey(key)) {
+            var value = Reflect.get(this.data, key);
+            Reflect.deleteProperty(this._data, key);
+            return [key, value];
+        }
+        return null;
+    };
+    Dictionary.prototype.hasKey = function (key) {
+        return Reflect.has(this.data, key);
+    };
+    Dictionary.prototype.get = function (key) {
+        if (this.hasKey(key)) {
+            return Reflect.get(this.data, key);
+        }
+        return null;
+    };
+    Dictionary.prototype.clear = function () {
+        var dictionary = __assign({}, this.data);
+        this._data = {};
+        return dictionary;
+    };
+    Dictionary.prototype.forEach = function (func) {
+        for (var _i = 0, _a = this.pairs; _i < _a.length; _i++) {
+            var _b = _a[_i], key = _b[0], value = _b[1];
+            func(key, value);
+        }
+    };
+    Dictionary.prototype[Symbol.toPrimitive] = function (type) {
+        if (type === 'string') {
+            return "{ ".concat(this.pairs.map(function (_a) {
+                var key = _a[0], value = _a[1];
+                return "".concat(key, " => ").concat(value);
+            }).join(', '), " }");
+        }
+        if (type === 'number') {
+            return this.size;
+        }
+        return null;
+    };
+    return Dictionary;
+}());
+exports.default = Dictionary;

package/build/DoublyLinkedList/IDoublyLinkedList.d.ts

@@ -0,0 +1,16 @@
+export interface IDoublyLinkedListItem<T> {
+    previous: T | null;
+    value: T;
+    next: T | null;
+}
+interface IDoublyLinkedList<T> {
+    get data(): IDoublyLinkedListItem<T>[];
+    get size(): number;
+    push(_element: T): T;
+    getFromPosition(_position: number): IDoublyLinkedListItem<T> | undefined;
+    positionOf(_element: T): number | undefined;
+    insertInPosition(_element: T, _position: number): T | undefined;
+    remove(_element: T): T | undefined;
+    removeFromPosition(_position: number): T | undefined;
+}
+export default IDoublyLinkedList;

package/build/DoublyLinkedList/IDoublyLinkedList.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/build/DoublyLinkedList/Node.d.ts

@@ -0,0 +1,6 @@
+export default class Node<T> {
+    value: T;
+    previous: Node<T> | null;
+    next: Node<T> | null;
+    constructor(value: T);
+}

package/build/DoublyLinkedList/Node.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var Node = /** @class */ (function () {
+    function Node(value) {
+        this.previous = null;
+        this.next = null;
+        this.value = value;
+    }
+    return Node;
+}());
+exports.default = Node;

package/build/DoublyLinkedList/index.d.ts

@@ -0,0 +1,32 @@
+import IDoublyLinkedList, { IDoublyLinkedListItem } from './IDoublyLinkedList';
+export default class DoublyLinkedList<T = number> implements IDoublyLinkedList<T> {
+    private _head;
+    private _tail;
+    private _size;
+    constructor(...inputs: T[]);
+    get data(): IDoublyLinkedListItem<T>[];
+    get size(): number;
+    /**
+     * Complexity: O(1)
+     */
+    push(element: T): T;
+    /**
+     * Complexity: O(n/2)
+     */
+    getFromPosition(position: number): IDoublyLinkedListItem<T> | undefined;
+    positionOf(element: T): number | undefined;
+    /**
+     * Complexity: O(n)
+     */
+    insertInPosition(element: T, position: number): T | undefined;
+    /**
+     * Complexity: O(n)
+     */
+    remove(element: T): T | undefined;
+    /**
+     * Complexity: O(n)
+     */
+    removeFromPosition(position: number): T | undefined;
+    private _findFasterWayToPosition;
+    private [Symbol.toPrimitive];
+}

package/build/DoublyLinkedList/index.js

@@ -0,0 +1,221 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var Node_1 = __importDefault(require("./Node"));
+var DoublyLinkedList = /** @class */ (function () {
+    function DoublyLinkedList() {
+        var inputs = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            inputs[_i] = arguments[_i];
+        }
+        this._head = null;
+        this._tail = null;
+        this._size = 0;
+        if (inputs.length) {
+            var nodes = inputs.map(function (input) { return new Node_1.default(input); });
+            for (var i = 0; i < inputs.length; i++) {
+                nodes[i].previous = nodes[i - 1] || null;
+                nodes[i].next = nodes[i + 1] || null;
+            }
+            this._head = nodes[0];
+            this._tail = nodes[nodes.length - 1];
+            this._size = inputs.length;
+        }
+    }
+    Object.defineProperty(DoublyLinkedList.prototype, "data", {
+        get: function () {
+            var _a, _b;
+            var current = this._head;
+            var data = [];
+            while (current) {
+                data.push({
+                    previous: ((_a = current.previous) === null || _a === void 0 ? void 0 : _a.value) || null,
+                    value: current.value,
+                    next: ((_b = current.next) === null || _b === void 0 ? void 0 : _b.value) || null,
+                });
+                current = current.next;
+            }
+            return data;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(DoublyLinkedList.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * Complexity: O(1)
+     */
+    DoublyLinkedList.prototype.push = function (element) {
+        var node = new Node_1.default(element);
+        if (this._tail) {
+            this._tail.next = node;
+            node.previous = this._tail;
+        }
+        else {
+            this._head = node;
+            this._tail = node;
+        }
+        this._size += 1;
+        return element;
+    };
+    /**
+     * Complexity: O(n/2)
+     */
+    DoublyLinkedList.prototype.getFromPosition = function (position) {
+        var _a, _b;
+        if (position < 0 || position >= this._size) {
+            return undefined;
+        }
+        var distanceToTheHead = position;
+        var distanceToTheTail = this.size - position - 1;
+        var current;
+        if (distanceToTheTail > distanceToTheHead) {
+            current = this._head;
+            for (var i = 0; i < position; i++) {
+                current = (current === null || current === void 0 ? void 0 : current.next) || null;
+            }
+        }
+        else {
+            current = this._tail;
+            for (var i = this.size - 1; i > position; i--) {
+                current = (current === null || current === void 0 ? void 0 : current.previous) || null;
+            }
+        }
+        if (current === null || current === void 0 ? void 0 : current.value) {
+            return {
+                previous: ((_a = current === null || current === void 0 ? void 0 : current.previous) === null || _a === void 0 ? void 0 : _a.value) || null,
+                value: current === null || current === void 0 ? void 0 : current.value,
+                next: ((_b = current === null || current === void 0 ? void 0 : current.next) === null || _b === void 0 ? void 0 : _b.value) || null,
+            };
+        }
+    };
+    DoublyLinkedList.prototype.positionOf = function (element) {
+        var current = this._head;
+        var position = 0;
+        while (current && current.value !== element) {
+            current = current.next;
+            position += 1;
+        }
+        return position === this.size ? undefined : position;
+    };
+    /**
+     * Complexity: O(n)
+     */
+    DoublyLinkedList.prototype.insertInPosition = function (element, position) {
+        var _a;
+        if (position < 0 || position > this.size) {
+            return undefined;
+        }
+        var node = new Node_1.default(element);
+        if (position === 0 && this._head) {
+            node.next = this._head;
+            this._head.previous = node;
+            this._head = node;
+            this._size += 1;
+            return element;
+        }
+        if (position === this.size - 1 && this._tail && this._tail.previous) {
+            this._tail.previous.next = node;
+            node.previous = ((_a = this._tail) === null || _a === void 0 ? void 0 : _a.previous) || null;
+            node.next = this._tail;
+            this._tail.previous = node;
+            this._size += 1;
+            return element;
+        }
+        if (position === this.size && this._tail) {
+            node.previous = this._tail;
+            this._tail.next = node;
+            this._tail = node;
+            this._size += 1;
+            return element;
+        }
+        var way = this._findFasterWayToPosition(position);
+        var current;
+        if (way === 'ASC') {
+            current = this._head;
+            for (var i = 0; i < position; i++) {
+                current = (current === null || current === void 0 ? void 0 : current.next) || null;
+            }
+        }
+        else {
+            current = this._tail;
+            for (var i = this.size - 1; i > position; i--) {
+                current = (current === null || current === void 0 ? void 0 : current.previous) || null;
+            }
+        }
+        if (current && current.previous) {
+            current.previous.next = node;
+            node.previous = current.previous;
+            node.next = current;
+            current.previous = node;
+        }
+        this._size += 1;
+        return element;
+    };
+    /**
+     * Complexity: O(n)
+     */
+    DoublyLinkedList.prototype.remove = function (element) {
+        var current = this._head;
+        while (current && current.value !== element) {
+            current = current.next;
+        }
+        if (current) {
+            if (current.previous) {
+                current.previous.next = current.next;
+            }
+            if (current.next) {
+                current.next.previous = current.previous;
+            }
+            if (current === this._head) {
+                this._head = current.next;
+            }
+            if (current === this._tail) {
+                this._tail = current.previous;
+            }
+            this._size -= 1;
+            return current.value;
+        }
+        return undefined;
+    };
+    /**
+     * Complexity: O(n)
+     */
+    DoublyLinkedList.prototype.removeFromPosition = function (position) {
+        var item = this.getFromPosition(position);
+        if (item) {
+            this.remove(item.value);
+            return item.value;
+        }
+        return undefined;
+    };
+    DoublyLinkedList.prototype._findFasterWayToPosition = function (position) {
+        var distanceToTheHead = position;
+        var distanceToTheTail = this.size - position - 1;
+        if (distanceToTheTail > distanceToTheHead) {
+            return 'ASC';
+        }
+        return 'DESC';
+    };
+    DoublyLinkedList.prototype[Symbol.toPrimitive] = function (type) {
+        if (type === 'string') {
+            return "[Head] ".concat(this.data.map(function (_a) {
+                var value = _a.value;
+                return value;
+            }).join(' <=> '), " [Tail]");
+        }
+        if (type === 'number') {
+            return this.size;
+        }
+        return null;
+    };
+    return DoublyLinkedList;
+}());
+exports.default = DoublyLinkedList;

package/build/Graph/GraphNodeNotFoundError.d.ts

@@ -0,0 +1,3 @@
+export default class GraphNodeNotFoundError extends Error {
+    constructor(node: string);
+}

package/build/Graph/GraphNodeNotFoundError.js

@@ -0,0 +1,27 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var GraphNodeNotFoundError = /** @class */ (function (_super) {
+    __extends(GraphNodeNotFoundError, _super);
+    function GraphNodeNotFoundError(node) {
+        var _this = _super.call(this, "Node ".concat(node, " not found")) || this;
+        _this.name = 'GraphNodeNotFoundError';
+        return _this;
+    }
+    return GraphNodeNotFoundError;
+}(Error));
+exports.default = GraphNodeNotFoundError;

package/build/Graph/GraphSearchNodeStates.d.ts

@@ -0,0 +1,6 @@
+declare enum GraphSearchNodeStates {
+    UNEXPLORED = 0,
+    DISCOVERED = 1,
+    EXPLORED = 2
+}
+export default GraphSearchNodeStates;

package/build/Graph/GraphSearchNodeStates.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/* eslint-disable no-unused-vars */
+var GraphSearchNodeStates;
+(function (GraphSearchNodeStates) {
+    GraphSearchNodeStates[GraphSearchNodeStates["UNEXPLORED"] = 0] = "UNEXPLORED";
+    GraphSearchNodeStates[GraphSearchNodeStates["DISCOVERED"] = 1] = "DISCOVERED";
+    GraphSearchNodeStates[GraphSearchNodeStates["EXPLORED"] = 2] = "EXPLORED";
+})(GraphSearchNodeStates || (GraphSearchNodeStates = {}));
+exports.default = GraphSearchNodeStates;

package/build/Graph/IGraph.d.ts

@@ -0,0 +1,16 @@
+interface IGraph {
+    get isDirected(): boolean;
+    get data(): {
+        [key: string]: string[];
+    };
+    get size(): number;
+    get nodes(): string[];
+    get edges(): [string, string][];
+    insert(_node: string): string | null;
+    connect(_node1: string, _node2: string): [string, string];
+    breadthFirstSearch(_startNode: string, _callback: (_node: string) => void): void;
+    getDistancesFrom(_node: string): {
+        [key: string]: number;
+    };
+}
+export default IGraph;

package/build/Graph/IGraph.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/build/Graph/IGraphOptions.d.ts

@@ -0,0 +1,7 @@
+interface IGraphOptions {
+    inputs?: {
+        [key: string]: string[];
+    };
+    isDirected?: boolean;
+}
+export default IGraphOptions;

package/build/Graph/IGraphOptions.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/build/Graph/index.d.ts

@@ -0,0 +1,20 @@
+import IGraph from './IGraph';
+import IGraphOptions from './IGraphOptions';
+export default class Graph implements IGraph {
+    private _isDirected;
+    private _data;
+    constructor({ inputs, isDirected }?: IGraphOptions);
+    get isDirected(): boolean;
+    get data(): {
+        [key: string]: string[];
+    };
+    get size(): number;
+    get nodes(): string[];
+    get edges(): [string, string][];
+    insert(node: string): string | null;
+    connect(node1: string, node2: string): [string, string];
+    breadthFirstSearch(startNode: string, callback: (_node: string) => void): void;
+    getDistancesFrom(node: string): {
+        [key: string]: number;
+    };
+}