@gabrielrufino/cerebrum 1.4.0 → 1.5.0

package/dist/Math/SieveOfErastosthenes.js

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SieveOfErastosthenes = void 0;
+class SieveOfErastosthenes {
+    constructor(limit) {
+        this.limit = limit;
+    }
+    execute() {
+        if (this.limit < 2)
+            return [];
+        const isPrime = Array(this.limit + 1).fill(true);
+        isPrime[0] = false;
+        isPrime[1] = false;
+        for (let i = 2; i * i <= this.limit; i++) {
+            if (isPrime[i]) {
+                for (let j = i * i; j <= this.limit; j += i) {
+                    isPrime[j] = false;
+                }
+            }
+        }
+        return isPrime
+            .map((prime, index) => prime ? index : -1)
+            .filter(num => num !== -1);
+    }
+}
+exports.SieveOfErastosthenes = SieveOfErastosthenes;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gabrielrufino/cerebrum",
-  "version": "1.4.0",
+  "version": "1.5.0",
   "description": "Algorithms made in TypeScript",
   "main": "dist/index.js",
   "type": "module",
@@ -19,7 +19,7 @@
     "@commitlint/config-conventional": "^19.6.0",
     "@faker-js/faker": "^8.4.1",
     "@gabrielrufino/eslint-config": "^1.6.0",
-    "@vitest/coverage-v8": "^2.1.5",
+    "@vitest/coverage-v8": "^2.1.8",
     "eslint": "^8.57.1",
     "husky": "^9.1.7",
     "typescript": "^5.7.2",

package/src/Math/SieveOfErastosthenes.spec.ts

@@ -0,0 +1,48 @@
+import { describe, it, expect } from 'vitest';
+
+import { SieveOfErastosthenes } from './SieveOfErastosthenes';
+
+describe('SieveOfErastosthenes', () => {
+  it('should return an empty array if the limit is less than 2', () => {
+    const primes = new SieveOfErastosthenes(1)
+      .execute();
+
+    expect(primes).toEqual([]);
+  });
+
+  it('should return correct primes for small limits', () => {
+    const primes = new SieveOfErastosthenes(10)
+      .execute();
+
+    expect(primes).toEqual([2, 3, 5, 7]);
+  });
+
+  it('should return correct primes for a larger limit', () => {
+    const primes = new SieveOfErastosthenes(20)
+      .execute();
+
+    expect(primes).toEqual([2, 3, 5, 7, 11, 13, 17, 19]);
+  });
+
+  it('should handle the edge case of limit = 2', () => {
+    const primes = new SieveOfErastosthenes(2)
+      .execute();
+    expect(primes).toEqual([2]);
+  });
+
+  it('should handle the edge case of limit = 0', () => {
+    const primes = new SieveOfErastosthenes(0)
+      .execute();
+    expect(primes).toEqual([]);
+  });
+
+  it('should handle the edge case of limit = 100', () => {
+    const primes = new SieveOfErastosthenes(100)
+      .execute();
+
+    expect(primes).toEqual([
+      2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
+      53, 59, 61, 67, 71, 73, 79, 83, 89, 97
+    ]);
+  });
+});

package/src/Math/SieveOfErastosthenes.ts

@@ -0,0 +1,25 @@
+export class SieveOfErastosthenes {
+  constructor (
+    private readonly limit: number
+  ) {}
+
+  public execute(): Array<number> {
+    if (this.limit < 2) return []
+
+    const isPrime = Array(this.limit + 1).fill(true)
+    isPrime[0] = false
+    isPrime[1] = false
+
+    for (let i = 2; i * i <= this.limit; i++) {
+      if (isPrime[i]) {
+        for (let j = i * i; j <= this.limit; j += i) {
+          isPrime[j] = false
+        }
+      }
+    }
+
+    return isPrime
+      .map((prime, index) => prime ? index : -1)
+      .filter(num => num !== -1)
+  }
+}