@gabrielrufino/cube 1.0.19 → 1.0.22

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/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 () {
@@ -153,16 +151,15 @@ var LinkedList = /** @class */ (function () {
         return node || undefined;
     };
     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/build/MaxHeap/index.js

@@ -11,7 +11,7 @@ var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
 Object.defineProperty(exports, "__esModule", { value: true });
 var MaxHeap = /** @class */ (function () {
     function MaxHeap(_a) {
-        var _b = _a === void 0 ? { inputs: [] } : _a, greaterThanOrEqualTo = _b.greaterThanOrEqualTo, _c = _b.inputs, inputs = _c === void 0 ? [] : _c;
+        var _b = _a === void 0 ? {} : _a, greaterThanOrEqualTo = _b.greaterThanOrEqualTo, _c = _b.inputs, inputs = _c === void 0 ? [] : _c;
         this._data = [];
         this._greaterThanOrEqualTo = function (value1, value2) { return value1 >= value2; };
         this._getLeftIndex = function (index) { return (2 * index) + 1; };
@@ -89,13 +89,12 @@ var MaxHeap = /** @class */ (function () {
         }
     };
     MaxHeap.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return this.data.join(', ');
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: this.data.join(', '),
+        };
+        return primitives[type];
     };
     return MaxHeap;
 }());

package/build/MinHeap/index.js

@@ -11,7 +11,7 @@ var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
 Object.defineProperty(exports, "__esModule", { value: true });
 var MinHeap = /** @class */ (function () {
     function MinHeap(_a) {
-        var _b = _a === void 0 ? { inputs: [] } : _a, lessThanOrEqualTo = _b.lessThanOrEqualTo, _c = _b.inputs, inputs = _c === void 0 ? [] : _c;
+        var _b = _a === void 0 ? {} : _a, lessThanOrEqualTo = _b.lessThanOrEqualTo, _c = _b.inputs, inputs = _c === void 0 ? [] : _c;
         this._data = [];
         this._lessThanOrEqualTo = function (value1, value2) { return value1 <= value2; };
         this._getLeftIndex = function (index) { return (2 * index) + 1; };
@@ -89,13 +89,12 @@ var MinHeap = /** @class */ (function () {
         }
     };
     MinHeap.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return this.data.join(', ');
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: this.data.join(', '),
+        };
+        return primitives[type];
     };
     return MinHeap;
 }());

package/package.json

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