commit e4a0fc721fabff1e638b9e3c940de26e77264372
Author: D4VID <d4vid@d4vid.xyz>
Date:   Mon Jun 16 16:52:05 2025 +0200

    Calculating primes

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..ea8c4bf
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+/target
diff --git a/Cargo.lock b/Cargo.lock
new file mode 100644
index 0000000..0598ef3
--- /dev/null
+++ b/Cargo.lock
@@ -0,0 +1,7 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "primes"
+version = "0.1.0"
diff --git a/Cargo.toml b/Cargo.toml
new file mode 100644
index 0000000..164304b
--- /dev/null
+++ b/Cargo.toml
@@ -0,0 +1,8 @@
+[package]
+name = "primes"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/src/main.rs b/src/main.rs
new file mode 100644
index 0000000..46d6518
--- /dev/null
+++ b/src/main.rs
@@ -0,0 +1,72 @@
+const SEGMENT_MAX: usize = 8;
+const SEGMENT_SIZE: usize = SEGMENT_MAX*SEGMENT_MAX;
+
+// Calculates the primes in the first segment using the simple sieve
+// Returns the primes in the primes array with n being the number of found primes
+fn simple_sieve(primes: &mut [usize; SEGMENT_SIZE], n: &mut usize) {
+    let mut segment = [true; SEGMENT_SIZE];
+    segment[0] = false;
+    segment[1] = false;
+
+    for x in 2..SEGMENT_MAX {
+        if segment[x] {
+            for y in ((x * x)..SEGMENT_SIZE).step_by(x) {
+                segment[y] = false;
+            }
+        }
+    }
+    let mut index = 0;
+    for (x,prime) in segment.iter().enumerate() {
+        if *prime {
+            primes[index] = x;
+            index += 1;
+        }
+    }
+    *n = index;
+}
+
+fn segment_sieve(primes: &[usize], prime_multiple: &mut [usize]) {
+    let mut low: usize = SEGMENT_SIZE;
+    let mut high: usize = SEGMENT_SIZE*2;
+    for _ in 1..SEGMENT_SIZE { // there are [SEGMENT_SIZE] number of segments
+        let mut segment = [true; SEGMENT_SIZE];
+        for (i,p) in primes.iter().enumerate() {
+            let mut multiple = prime_multiple[i];
+            while multiple < high {
+                segment[multiple-low] = false;
+                multiple += *p;
+            }
+            prime_multiple[i] = multiple;
+        }
+
+        for (x,prime) in segment.iter().enumerate() {
+            if *prime {
+                println!("{},", low+x);
+            }
+        }
+
+        low = high;
+        high += SEGMENT_SIZE;
+    }
+}
+
+fn main() {
+    // There will be no more than [SEGMENT_SIZE] primes in the segment
+    let mut primes_buffer = [0; SEGMENT_SIZE];
+    let mut n = 0;
+    simple_sieve(&mut primes_buffer, &mut n);
+
+    let primes = &primes_buffer[..n];
+
+    let mut prime_multiple = [0; SEGMENT_SIZE];
+    for (i,x) in primes.iter().enumerate() {
+        println!("{},", x);
+        let mut multiple = *x;
+        while multiple < SEGMENT_SIZE {
+            multiple += x;
+        }
+        prime_multiple[i] = multiple;
+    }
+    segment_sieve(primes, &mut prime_multiple);
+    println!();
+}