@gabrielrufino/cube 1.0.96 → 2.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -1,6 +1,6 @@
1
1
  # Cube
2
2
 
3
- Data Structures and Algorithms made in Typescript
3
+ Data structures made in Typescript
4
4
 
5
5
  <small>Black Tech By [Gabriel Rufino](https://github.com/gabrielrufino) 🖤</small>
6
6
 
package/build/index.d.ts CHANGED
@@ -1,4 +1,3 @@
1
- export { default as Algorithms } from './Algorithms';
2
1
  export { default as Array } from './Array';
3
2
  export { default as BinarySearchTree } from './BinarySearchTree';
4
3
  export { default as Deck } from './Deck';
package/build/index.js CHANGED
@@ -3,9 +3,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
3
3
  return (mod && mod.__esModule) ? mod : { "default": mod };
4
4
  };
5
5
  Object.defineProperty(exports, "__esModule", { value: true });
6
- exports.Stack = exports.Set = exports.Queue = exports.MinHeap = exports.MaxHeap = exports.List = exports.LinkedList = exports.HashTableSeparateChaining = exports.HashTableLinearProbing = exports.HashTable = exports.Graph = exports.DoublyLinkedList = exports.Dictionary = exports.Deck = exports.BinarySearchTree = exports.Array = exports.Algorithms = void 0;
7
- var Algorithms_1 = require("./Algorithms");
8
- Object.defineProperty(exports, "Algorithms", { enumerable: true, get: function () { return __importDefault(Algorithms_1).default; } });
6
+ exports.Stack = exports.Set = exports.Queue = exports.MinHeap = exports.MaxHeap = exports.List = exports.LinkedList = exports.HashTableSeparateChaining = exports.HashTableLinearProbing = exports.HashTable = exports.Graph = exports.DoublyLinkedList = exports.Dictionary = exports.Deck = exports.BinarySearchTree = exports.Array = void 0;
9
7
  var Array_1 = require("./Array");
10
8
  Object.defineProperty(exports, "Array", { enumerable: true, get: function () { return __importDefault(Array_1).default; } });
11
9
  var BinarySearchTree_1 = require("./BinarySearchTree");
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "@gabrielrufino/cube",
3
- "version": "1.0.96",
4
- "description": "Data Structures and Algorithms made in Typescript",
3
+ "version": "2.0.0",
4
+ "description": "Data structures made in Typescript",
5
5
  "main": "build/index.js",
6
6
  "scripts": {
7
7
  "build": "tsc",
@@ -18,8 +18,7 @@
18
18
  },
19
19
  "keywords": [
20
20
  "Data",
21
- "Structures",
22
- "Algorithms"
21
+ "Structures"
23
22
  ],
24
23
  "author": "Gabriel Rufino <contato@gabrielrufino.com>",
25
24
  "funding": "https://github.com/sponsors/gabrielrufino",
@@ -29,8 +28,8 @@
29
28
  },
30
29
  "homepage": "https://github.com/gabrielrufino/cube#readme",
31
30
  "devDependencies": {
32
- "@commitlint/cli": "^19.4.1",
33
- "@commitlint/config-conventional": "^19.4.1",
31
+ "@commitlint/cli": "^19.5.0",
32
+ "@commitlint/config-conventional": "^19.5.0",
34
33
  "@faker-js/faker": "^8.4.1",
35
34
  "@stryker-mutator/core": "^8.5.0",
36
35
  "@stryker-mutator/jest-runner": "^8.5.0",
@@ -40,10 +39,10 @@
40
39
  "@typescript-eslint/parser": "^5.62.0",
41
40
  "eslint": "^8.57.0",
42
41
  "eslint-config-xo": "^0.43.1",
43
- "husky": "^9.1.5",
44
- "jest": "^28.1.3",
45
- "ts-jest": "^28.0.8",
42
+ "husky": "^9.1.6",
43
+ "jest": "^29.7.0",
44
+ "ts-jest": "^29.2.5",
46
45
  "ts-node": "^10.9.2",
47
- "typescript": "^4.9.5"
46
+ "typescript": "^5.6.2"
48
47
  }
49
48
  }
@@ -1,3 +0,0 @@
1
- export default class Algorithms {
2
- static decimalToBinary(n: number): string;
3
- }
@@ -1,22 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- var __1 = require("..");
4
- var Algorithms = /** @class */ (function () {
5
- function Algorithms() {
6
- }
7
- Algorithms.decimalToBinary = function (n) {
8
- var stack = new __1.Stack();
9
- while (n > 0) {
10
- var rem = Math.floor(n % 2);
11
- stack.push(rem);
12
- n = Math.floor(n / 2);
13
- }
14
- var binary = '';
15
- while (!stack.isEmpty) {
16
- binary += stack.pop().toString();
17
- }
18
- return binary;
19
- };
20
- return Algorithms;
21
- }());
22
- exports.default = Algorithms;