@gabrielrufino/cube 1.0.18 → 1.0.21

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/Dictionary/index.js

@@ -94,16 +94,15 @@ var Dictionary = /** @class */ (function () {
         }
     };
     Dictionary.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "{ ".concat(this.pairs.map(function (_a) {
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: "{ ".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;
+            }).join(', '), " }"),
+        };
+        return primitives[type];
     };
     return Dictionary;
 }());

package/build/HashTable/IHashTable.d.ts

@@ -2,6 +2,7 @@ import IHashTableData from './IHashTableData';
 interface IHashTable<T> {
     get data(): IHashTableData<T>;
     get size(): number;
+    get maxSize(): number;
     put(_key: string, _value: T): T;
     get(_key: string): T | null;
     remove(_key: string): T | null;

package/build/HashTable/index.d.ts

@@ -3,11 +3,11 @@ import IHashTableData from './IHashTableData';
 import IHashTableInputs from './IHashTableInputs';
 import IHashTableOptions from './IHashTableOptions';
 export default class HashTable<T = number> implements IHashTable<T> {
-    private _maxSize;
     private _data;
     constructor(inputs?: IHashTableInputs<T>, { maxSize }?: IHashTableOptions);
     get data(): IHashTableData<T>;
     get size(): number;
+    get maxSize(): number;
     put(key: string, value: T): T;
     get(key: string): T | null;
     remove(key: string): T | null;

package/build/HashTable/index.js

@@ -14,9 +14,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 var HashTable = /** @class */ (function () {
     function HashTable(inputs, _a) {
         if (inputs === void 0) { inputs = {}; }
-        var _b = _a === void 0 ? { maxSize: 100 } : _a, _c = _b.maxSize, maxSize = _c === void 0 ? 100 : _c;
-        this._maxSize = maxSize;
-        this._data = new Array(this._maxSize);
+        var _b = _a === void 0 ? {} : _a, _c = _b.maxSize, maxSize = _c === void 0 ? 100 : _c;
+        this._data = new Array(maxSize);
         for (var _i = 0, _d = Object.entries(inputs); _i < _d.length; _i++) {
             var _e = _d[_i], key = _e[0], value = _e[1];
             this.put(key, value);
@@ -41,6 +40,13 @@ var HashTable = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(HashTable.prototype, "maxSize", {
+        get: function () {
+            return this._data.length;
+        },
+        enumerable: false,
+        configurable: true
+    });
     HashTable.prototype.put = function (key, value) {
         var position = this._hashCode(key);
         this._data[position] = value;
@@ -52,31 +58,27 @@ var HashTable = /** @class */ (function () {
     };
     HashTable.prototype.remove = function (key) {
         var value = this.get(key);
-        if (value) {
-            var position = this._hashCode(key);
-            Reflect.deleteProperty(this._data, position);
-            return value;
-        }
-        return null;
+        var position = this._hashCode(key);
+        Reflect.deleteProperty(this._data, position);
+        return value;
     };
     HashTable.prototype._hashCode = function (key) {
         var code = key
             .split('')
             .map(function (character) { return character.charCodeAt(0); })
             .reduce(function (previous, current) { return previous + current; }, 0);
-        return code % this._maxSize;
+        return code % this.maxSize;
     };
     HashTable.prototype[Symbol.toPrimitive] = function (type) {
-        if (type === 'string') {
-            return "[ ".concat(Object.entries(this.data).map(function (_a) {
+        var primitives = {
+            default: true,
+            number: this.size,
+            string: "[ ".concat(Object.entries(this.data).map(function (_a) {
                 var key = _a[0], value = _a[1];
                 return "".concat(key, " => ").concat(value);
-            }).join(', '), " ]");
-        }
-        if (type === 'number') {
-            return this.size;
-        }
-        return null;
+            }).join(', '), " ]"),
+        };
+        return primitives[type];
     };
     return HashTable;
 }());

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.18",
+  "version": "1.0.21",
   "description": "Data Structures and Algorithms made in Typescript",
   "main": "build/index.js",
   "scripts": {