@gabrielrufino/cube 2.0.10 → 2.0.12

package/dist/BinarySearchTree/index.js

@@ -46,11 +46,12 @@ var BinarySearchTree = /** @class */ (function () {
     });
     Object.defineProperty(BinarySearchTree.prototype, "min", {
         get: function () {
+            var _a;
             var current = this._root;
             while (current && current.left) {
                 current = current.left;
             }
-            return (current === null || current === void 0 ? void 0 : current.value) || null;
+            return (_a = current === null || current === void 0 ? void 0 : current.value) !== null && _a !== void 0 ? _a : null;
         },
         enumerable: false,
         configurable: true
@@ -58,7 +59,7 @@ var BinarySearchTree = /** @class */ (function () {
     Object.defineProperty(BinarySearchTree.prototype, "max", {
         get: function () {
             var current = this._root;
-            while (current && current.right) {
+            while (current === null || current === void 0 ? void 0 : current.right) {
                 current = current.right;
             }
             return (current === null || current === void 0 ? void 0 : current.value) || null;

package/dist/DoublyLinkedList/index.js

@@ -24,14 +24,14 @@ var DoublyLinkedList = /** @class */ (function () {
     }
     Object.defineProperty(DoublyLinkedList.prototype, "data", {
         get: function () {
-            var _a, _b;
+            var _a, _b, _c, _d;
             var current = this._head;
             var data = [];
             while (current) {
                 data.push({
-                    previous: ((_a = current.previous) === null || _a === void 0 ? void 0 : _a.value) || null,
+                    previous: (_b = (_a = current.previous) === null || _a === void 0 ? void 0 : _a.value) !== null && _b !== void 0 ? _b : null,
                     value: current.value,
-                    next: ((_b = current.next) === null || _b === void 0 ? void 0 : _b.value) || null,
+                    next: (_d = (_c = current.next) === null || _c === void 0 ? void 0 : _c.value) !== null && _d !== void 0 ? _d : null,
                 });
                 current = current.next;
             }
@@ -67,7 +67,7 @@ var DoublyLinkedList = /** @class */ (function () {
      * Complexity: O(n/2)
      */
     DoublyLinkedList.prototype.getFromPosition = function (position) {
-        var _a, _b;
+        var _a, _b, _c, _d;
         if (position < 0 || position >= this.size) {
             return undefined;
         }
@@ -88,9 +88,9 @@ var DoublyLinkedList = /** @class */ (function () {
         }
         if (current === null || current === void 0 ? void 0 : current.value) {
             return {
-                previous: ((_a = current.previous) === null || _a === void 0 ? void 0 : _a.value) || null,
+                previous: (_b = (_a = current.previous) === null || _a === void 0 ? void 0 : _a.value) !== null && _b !== void 0 ? _b : null,
                 value: current.value,
-                next: ((_b = current.next) === null || _b === void 0 ? void 0 : _b.value) || null,
+                next: (_d = (_c = current.next) === null || _c === void 0 ? void 0 : _c.value) !== null && _d !== void 0 ? _d : null,
             };
         }
     };
@@ -107,7 +107,7 @@ var DoublyLinkedList = /** @class */ (function () {
      * Complexity: O(n)
      */
     DoublyLinkedList.prototype.insertInPosition = function (element, position) {
-        var _a;
+        var _a, _b;
         if (position < 0 || position > this.size) {
             return undefined;
         }
@@ -119,9 +119,9 @@ var DoublyLinkedList = /** @class */ (function () {
             this._size += 1;
             return element;
         }
-        if (position === this.size - 1 && this._tail && this._tail.previous) {
+        if (position === this.size - 1 && ((_a = this._tail) === null || _a === void 0 ? void 0 : _a.previous)) {
             this._tail.previous.next = node;
-            node.previous = ((_a = this._tail) === null || _a === void 0 ? void 0 : _a.previous) || null;
+            node.previous = ((_b = this._tail) === null || _b === void 0 ? void 0 : _b.previous) || null;
             node.next = this._tail;
             this._tail.previous = node;
             this._size += 1;
@@ -148,7 +148,7 @@ var DoublyLinkedList = /** @class */ (function () {
                 current = (current === null || current === void 0 ? void 0 : current.previous) || null;
             }
         }
-        if (current && current.previous) {
+        if (current === null || current === void 0 ? void 0 : current.previous) {
             current.previous.next = node;
             node.previous = current.previous;
             node.next = current;

package/dist/HashTable/index.js

@@ -15,7 +15,7 @@ var HashTable = /** @class */ (function () {
     function HashTable(inputs, _a) {
         if (inputs === void 0) { inputs = {}; }
         var _b = _a === void 0 ? {} : _a, _c = _b.maxSize, maxSize = _c === void 0 ? 100 : _c;
-        this._data = [];
+        this._data = Array.from({ length: maxSize });
         this.maxSize = maxSize;
         for (var _i = 0, _d = Object.entries(inputs); _i < _d.length; _i++) {
             var _e = _d[_i], key = _e[0], value = _e[1];
@@ -26,6 +26,10 @@ var HashTable = /** @class */ (function () {
         get: function () {
             return this._data
                 .map(function (value, index) { return ({ index: index, value: value }); })
+                .filter(function (_a) {
+                var value = _a.value;
+                return value !== undefined;
+            })
                 .reduce(function (accumulator, current) {
                 var _a;
                 return (__assign(__assign({}, accumulator), (_a = {}, _a[current.index] = current.value, _a)));

package/dist/HashTableLinearProbing/index.d.ts

@@ -3,7 +3,7 @@ import type IHashTableLinearProbingInputs from './IHashTableLinearProbingInputs'
 import type IHashTableLinearProbingOptions from './IHashTableLinearProbingOptions';
 import HashTableLinearProbingElement from './HashTableLinearProbingElement';
 export default class HashTableLinearProbing<T = number> implements IHashTableLinearProbing<T> {
-    private _maxSize;
+    private readonly _maxSize;
     private _data;
     constructor(inputs?: Readonly<IHashTableLinearProbingInputs<T>>, { maxSize }?: IHashTableLinearProbingOptions);
     get data(): {

package/dist/LinkedList/index.js

@@ -22,13 +22,13 @@ var LinkedList = /** @class */ (function () {
     }
     Object.defineProperty(LinkedList.prototype, "data", {
         get: function () {
-            var _a;
+            var _a, _b;
             var data = [];
             var current = this._head;
             while (current) {
                 data.push({
                     value: current.value,
-                    next: ((_a = current.next) === null || _a === void 0 ? void 0 : _a.value) || null,
+                    next: (_b = (_a = current.next) === null || _a === void 0 ? void 0 : _a.value) !== null && _b !== void 0 ? _b : null,
                 });
                 current = current.next;
             }
@@ -104,14 +104,14 @@ var LinkedList = /** @class */ (function () {
         return element;
     };
     LinkedList.prototype.getFromPosition = function (position) {
-        var _a;
+        var _a, _b;
         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,
+            next: (_b = (_a = node.next) === null || _a === void 0 ? void 0 : _a.value) !== null && _b !== void 0 ? _b : null,
         };
     };
     LinkedList.prototype.removeFromPosition = function (position) {

package/dist/MaxHeap/index.d.ts

@@ -9,10 +9,10 @@ export default class MaxHeap<T = number> implements IMaxHeap<T> {
     get max(): T | null;
     insert(value: T): T;
     extract(): T | null;
-    private _greaterThanOrEqualTo;
-    private _getLeftIndex;
-    private _getRightIndex;
-    private _getParentIndex;
+    private readonly _greaterThanOrEqualTo;
+    private readonly _getLeftIndex;
+    private readonly _getRightIndex;
+    private readonly _getParentIndex;
     private _siftUp;
     private _siftDown;
     private [Symbol.toPrimitive];

package/dist/MinHeap/index.d.ts

@@ -9,10 +9,10 @@ export default class MinHeap<T = number> implements IMinHeap<T> {
     get min(): T | null;
     insert(value: T): T;
     extract(): T | null;
-    private _lessThanOrEqualTo;
-    private _getLeftIndex;
-    private _getRightIndex;
-    private _getParentIndex;
+    private readonly _lessThanOrEqualTo;
+    private readonly _getLeftIndex;
+    private readonly _getRightIndex;
+    private readonly _getParentIndex;
     private _siftUp;
     private _siftDown;
     private [Symbol.toPrimitive];

package/dist/Set/index.d.ts

@@ -1,6 +1,6 @@
 import type ISet from './ISet';
 export default class Set<T = number> implements ISet<T> {
-    private _data;
+    private readonly _data;
     constructor(...inputs: Readonly<T[]>);
     get data(): T[];
     get size(): number;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gabrielrufino/cube",
-  "version": "2.0.10",
+  "version": "2.0.12",
   "description": "Data structures made in Typescript",
   "author": "Gabriel Rufino <contato@gabrielrufino.com>",
   "license": "UNLICENSED",
@@ -29,13 +29,13 @@
     "test:watch": "vitest"
   },
   "devDependencies": {
-    "@antfu/eslint-config": "^4.13.0",
+    "@antfu/eslint-config": "^4.13.1",
     "@commitlint/cli": "^19.8.1",
     "@commitlint/config-conventional": "^19.8.1",
-    "@faker-js/faker": "^9.7.0",
+    "@faker-js/faker": "^9.8.0",
     "@stryker-mutator/vitest-runner": "^8.7.1",
     "@vitest/coverage-v8": "^3.1.3",
-    "eslint": "^9.26.0",
+    "eslint": "^9.27.0",
     "husky": "^9.1.7",
     "typescript": "^5.8.3",
     "vitest": "^3.0.4"