@gabrielrufino/cube 1.0.20 → 1.0.23

package/build/BinarySearchTree/BinarySearchTreeNode.d.ts

@@ -3,5 +3,5 @@ export default class BinarySearchTreeNode<T> {
     left: BinarySearchTreeNode<T> | null;
     right: BinarySearchTreeNode<T> | null;
     constructor(value: T);
-    [Symbol.toPrimitive](type: string): string | number | null;
+    private [Symbol.toPrimitive];
 }

package/build/BinarySearchTree/BinarySearchTreeNode.js

@@ -9,13 +9,12 @@ var BinarySearchTreeNode = /** @class */ (function () {
         this.right = null;
     }
     BinarySearchTreeNode.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "[".concat(this.left, "] <= (").concat(this.value, ") => [").concat(this.right, "]");
-        }
-        if (type === 'number') {
-            return 1 + (this.left ? 1 : 0) + (this.right ? 1 : 0);
-        }
-        return null;
+        var primitives = {
+            default: true,
+            number: 1 + (this.left ? 1 : 0) + (this.right ? 1 : 0),
+            string: "[".concat(this.left, "] <= (").concat(this.value, ") => [").concat(this.right, "]"),
+        };
+        return primitives[type];
     };
     return BinarySearchTreeNode;
 }());

package/build/BinarySearchTree/index.js

@@ -17,7 +17,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 var BinarySearchTreeNode_1 = __importDefault(require("./BinarySearchTreeNode"));
 var BinarySearchTree = /** @class */ (function () {
     function BinarySearchTree(_a) {
-        var _b = _a === void 0 ? { inputs: [] } : _a, _c = _b.inputs, inputs = _c === void 0 ? [] : _c, lessThanOrEqualTo = _b.lessThanOrEqualTo;
+        var _b = _a === void 0 ? {} : _a, _c = _b.inputs, inputs = _c === void 0 ? [] : _c, lessThanOrEqualTo = _b.lessThanOrEqualTo;
         this._root = null;
         this._size = 0;
         if (lessThanOrEqualTo) {
@@ -183,13 +183,12 @@ var BinarySearchTree = /** @class */ (function () {
         }
     };
     BinarySearchTree.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "".concat(this._root);
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: "".concat(this._root),
+        };
+        return primitives[type];
     };
     return BinarySearchTree;
 }());

package/build/DoublyLinkedList/index.js

@@ -13,16 +13,14 @@ var DoublyLinkedList = /** @class */ (function () {
         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;
-        }
+        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 () {
@@ -70,7 +68,7 @@ var DoublyLinkedList = /** @class */ (function () {
      */
     DoublyLinkedList.prototype.getFromPosition = function (position) {
         var _a, _b;
-        if (position < 0 || position >= this._size) {
+        if (position < 0 || position >= this.size) {
             return undefined;
         }
         var distanceToTheHead = position;
@@ -90,9 +88,9 @@ var DoublyLinkedList = /** @class */ (function () {
         }
         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,
+                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,
             };
         }
     };
@@ -205,16 +203,15 @@ var DoublyLinkedList = /** @class */ (function () {
         return 'DESC';
     };
     DoublyLinkedList.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "[Head] ".concat(this.data.map(function (_a) {
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: "[Head] ".concat(this.data.map(function (_a) {
                 var value = _a.value;
                 return value;
-            }).join(' <=> '), " [Tail]");
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+            }).join(' <=> '), " [Tail]"),
+        };
+        return primitives[type];
     };
     return DoublyLinkedList;
 }());

package/build/LinkedList/ILinkedList.d.ts

@@ -4,10 +4,10 @@ interface ILinkedList<T> {
     get size(): number;
     get isEmpty(): boolean;
     push(_element: T): T;
-    getFromPosition(_position: number): ILinkedListItem<T> | undefined;
+    getFromPosition(_position: number): ILinkedListItem<T> | null;
     positionOf(_element: T): number | undefined;
     insertInPosition(_element: T, _position: number): T | undefined;
-    remove(_element: T): T | undefined;
-    removeFromPosition(_position: number): T | undefined;
+    remove(_element: T): T | null;
+    removeFromPosition(_position: number): T | null;
 }
 export default ILinkedList;

package/build/LinkedList/index.d.ts

@@ -1,4 +1,5 @@
 import ILinkedList from './ILinkedList';
+import ILinkedListItem from './ILinkedListItem';
 export default class LinkedList<T = number> implements ILinkedList<T> {
     private readonly _FIRST_POSITION;
     private _head;
@@ -12,13 +13,10 @@ export default class LinkedList<T = number> implements ILinkedList<T> {
     get isEmpty(): boolean;
     positionOf(element: T): number | undefined;
     push(element: T): T;
-    remove(element: T): T | undefined;
+    remove(element: T): T | null;
     insertInPosition(element: T, position: number): T | undefined;
-    getFromPosition(position: number): {
-        value: T;
-        next: T | null;
-    } | undefined;
-    removeFromPosition(position: number): T | undefined;
-    private getNodeFromPosition;
+    getFromPosition(position: number): ILinkedListItem<T> | null;
+    removeFromPosition(position: number): T | null;
+    private _getNodeFromPosition;
     private [Symbol.toPrimitive];
 }

package/build/LinkedList/index.js

@@ -13,14 +13,12 @@ var LinkedList = /** @class */ (function () {
         this._FIRST_POSITION = 0;
         this._head = 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 - 1; i++) {
-                nodes[i].next = nodes[i + 1];
-            }
-            this._head = nodes[0];
-            this._size = nodes.length;
+        var nodes = inputs.map(function (input) { return new Node_1.default(input); });
+        for (var i = 0; i < inputs.length - 1; i++) {
+            nodes[i].next = nodes[i + 1];
         }
+        this._head = nodes[0];
+        this._size = nodes.length;
     }
     Object.defineProperty(LinkedList.prototype, "data", {
         get: function () {
@@ -57,7 +55,7 @@ var LinkedList = /** @class */ (function () {
         var current = this._head;
         var position = 0;
         while (current && current.value !== element) {
-            current = current === null || current === void 0 ? void 0 : current.next;
+            current = current.next;
             position += 1;
         }
         if (current) {
@@ -83,6 +81,7 @@ var LinkedList = /** @class */ (function () {
         if (position) {
             return this.removeFromPosition(position);
         }
+        return null;
     };
     LinkedList.prototype.insertInPosition = function (element, position) {
         if (position < this._FIRST_POSITION || position > this.size) {
@@ -94,7 +93,7 @@ var LinkedList = /** @class */ (function () {
             this._head = node;
         }
         else {
-            var before = this.getNodeFromPosition(position - 1);
+            var before = this._getNodeFromPosition(position - 1);
             var after = (before && before.next) || null;
             if (before) {
                 before.next = node;
@@ -106,63 +105,56 @@ var LinkedList = /** @class */ (function () {
     };
     LinkedList.prototype.getFromPosition = function (position) {
         var _a;
-        if (position < this._FIRST_POSITION || position > this.size - 1) {
-            return undefined;
-        }
-        var node = this._head;
-        for (var i = 0; i < position; i++) {
-            node = (node === null || node === void 0 ? void 0 : node.next) || null;
-        }
-        if (node === null || node === void 0 ? void 0 : node.value) {
-            return {
-                value: node.value,
-                next: ((_a = node.next) === null || _a === void 0 ? void 0 : _a.value) || null,
-            };
-        }
-        return undefined;
+        var node = this._getNodeFromPosition(position);
+        if (!node) {
+            return null;
+        }
+        return {
+            value: node.value,
+            next: ((_a = node.next) === null || _a === void 0 ? void 0 : _a.value) || null,
+        };
     };
     LinkedList.prototype.removeFromPosition = function (position) {
-        if (position < this._FIRST_POSITION || position > (this.size - 1)) {
-            return undefined;
+        if (position < this._FIRST_POSITION || position >= this.size) {
+            return null;
         }
         var current = this._head;
         if (position === this._FIRST_POSITION) {
-            this._head = (current === null || current === void 0 ? void 0 : current.next) || null;
+            this._head = current.next;
         }
         else {
             var previous = void 0;
-            for (var i = 0; i < position; i++) {
+            for (var i = 0; i < position && current; i++) {
                 previous = current;
-                current = (current === null || current === void 0 ? void 0 : current.next) || null;
+                current = current.next;
             }
             if (previous) {
-                previous.next = (current === null || current === void 0 ? void 0 : current.next) || null;
+                previous.next = current.next;
             }
         }
         this._size -= 1;
-        return current === null || current === void 0 ? void 0 : current.value;
+        return current.value;
     };
-    LinkedList.prototype.getNodeFromPosition = function (position) {
-        if (position < this._FIRST_POSITION || position > this.size - 1) {
-            return undefined;
+    LinkedList.prototype._getNodeFromPosition = function (position) {
+        if (position < this._FIRST_POSITION || position > (this.size - 1)) {
+            return null;
         }
         var node = this._head;
-        for (var i = 0; i < position; i++) {
-            node = (node === null || node === void 0 ? void 0 : node.next) || null;
+        for (var i = 0; i < position && (node === null || node === void 0 ? void 0 : node.next); i++) {
+            node = node.next;
         }
-        return node || undefined;
+        return node;
     };
     LinkedList.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "[Head] ".concat(this.data.map(function (_a) {
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: "[Head] ".concat(this.data.map(function (_a) {
                 var value = _a.value;
                 return value;
-            }).join(' => '));
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+            }).join(' => ')),
+        };
+        return primitives[type];
     };
     return LinkedList;
 }());

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gabrielrufino/cube",
-  "version": "1.0.20",
+  "version": "1.0.23",
   "description": "Data Structures and Algorithms made in Typescript",
   "main": "build/index.js",
   "scripts": {