6 files changed, 174 insertions, 0 deletions

diff --git a/rust/sieve/.exercism/metadata.json b/rust/sieve/.exercism/metadata.json
new file mode 100644
index 0000000..8509220
--- /dev/null
+++ b/rust/sieve/.exercism/metadata.json
@@ -0,0 +1 @@
+{"track":"rust","exercise":"sieve","id":"9d898407ffbd41c6a50ec8bb91efec07","url":"https://exercism.io/my/solutions/9d898407ffbd41c6a50ec8bb91efec07","handle":"dyamon","is_requester":true,"auto_approve":false}
\ No newline at end of file
diff --git a/rust/sieve/.gitignore b/rust/sieve/.gitignore
new file mode 100644
index 0000000..db7f315
--- /dev/null
+++ b/rust/sieve/.gitignore
@@ -0,0 +1,8 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+**/*.rs.bk
+
+# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock
diff --git a/rust/sieve/Cargo.toml b/rust/sieve/Cargo.toml
new file mode 100644
index 0000000..3af9123
--- /dev/null
+++ b/rust/sieve/Cargo.toml
@@ -0,0 +1,4 @@
+[package]
+edition = "2018"
+name = "sieve"
+version = "1.1.0"
diff --git a/rust/sieve/README.md b/rust/sieve/README.md
new file mode 100644
index 0000000..8e01d40
--- /dev/null
+++ b/rust/sieve/README.md
@@ -0,0 +1,110 @@
+# Sieve
+
+Use the Sieve of Eratosthenes to find all the primes from 2 up to a given
+number.
+
+The Sieve of Eratosthenes is a simple, ancient algorithm for finding all
+prime numbers up to any given limit. It does so by iteratively marking as
+composite (i.e. not prime) the multiples of each prime, starting with the
+multiples of 2. It does not use any division or remainder operation.
+
+Create your range, starting at two and continuing up to and including the given limit. (i.e. [2, limit])
+
+The algorithm consists of repeating the following over and over:
+
+- take the next available unmarked number in your list (it is prime)
+- mark all the multiples of that number (they are not prime)
+
+Repeat until you have processed each number in your range.
+
+When the algorithm terminates, all the numbers in the list that have not
+been marked are prime.
+
+The wikipedia article has a useful graphic that explains the algorithm:
+https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+
+Notice that this is a very specific algorithm, and the tests don't check
+that you've implemented the algorithm, only that you've come up with the
+correct list of primes. A good first test is to check that you do not use
+division or remainder operations (div, /, mod or % depending on the
+language).
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored. After you get the first test to
+pass, open the tests source file which is located in the `tests` directory
+and remove the `#[ignore]` flag from the next test and get the tests to pass
+again. Each separate test is a function with `#[test]` flag above it.
+Continue, until you pass every test.
+
+If you wish to run all ignored tests without editing the tests source file, use:
+
+```bash
+$ cargo test -- --ignored
+```
+
+To run a specific test, for example `some_test`, you can use:
+
+```bash
+$ cargo test some_test
+```
+
+If the specific test is ignored use:
+
+```bash
+$ cargo test some_test -- --ignored
+```
+
+To learn more about Rust tests refer to the [online test documentation][rust-tests]
+
+Make sure to read the [Modules][modules] chapter if you
+haven't already, it will help you with organizing your files.
+
+## Further improvements
+
+After you have solved the exercise, please consider using the additional utilities, described in the [installation guide](https://exercism.io/tracks/rust/installation), to further refine your final solution.
+
+To format your solution, inside the solution directory use
+
+```bash
+cargo fmt
+```
+
+To see, if your solution contains some common ineffective use cases, inside the solution directory use
+
+```bash
+cargo clippy --all-targets
+```
+
+## Submitting the solution
+
+Generally you should submit all files in which you implemented your solution (`src/lib.rs` in most cases). If you are using any external crates, please consider submitting the `Cargo.toml` file. This will make the review process faster and clearer.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the rust track team are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: https://exercism.io/tracks/rust/learning
+[modules]: https://doc.rust-lang.org/book/ch07-02-defining-modules-to-control-scope-and-privacy.html
+[cargo]: https://doc.rust-lang.org/book/ch14-00-more-about-cargo.html
+[rust-tests]: https://doc.rust-lang.org/book/ch11-02-running-tests.html
+
+## Source
+
+Sieve of Eratosthenes at Wikipedia [http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
diff --git a/rust/sieve/src/lib.rs b/rust/sieve/src/lib.rs
new file mode 100644
index 0000000..307ff83
--- /dev/null
+++ b/rust/sieve/src/lib.rs
@@ -0,0 +1,16 @@
+pub fn primes_up_to(upper_bound: u64) -> Vec<u64> {
+    let mut sieve: Vec<Option<u64>> = (2..=upper_bound).map(Some).collect();
+    primes(&mut sieve);
+    sieve.iter().filter_map(|x| *x).collect()
+}
+
+fn primes(ps: &mut [Option<u64>]) {
+    if let Some(&n) = ps.first() {
+        if let Some(p) = n {
+            (p as usize..ps.len())
+                .step_by(p as usize)
+                .for_each(|x| ps[x] = None)
+        }
+        primes(&mut ps[1..]);
+    }
+}
diff --git a/rust/sieve/tests/sieve.rs b/rust/sieve/tests/sieve.rs
new file mode 100644
index 0000000..eb8fcb6
--- /dev/null
+++ b/rust/sieve/tests/sieve.rs
@@ -0,0 +1,35 @@
+#[test]
+fn limit_lower_than_the_first_prime() {
+    assert_eq!(sieve::primes_up_to(1), []);
+}
+
+#[test]
+fn limit_is_the_first_prime() {
+    assert_eq!(sieve::primes_up_to(2), [2]);
+}
+
+#[test]
+fn primes_up_to_10() {
+    assert_eq!(sieve::primes_up_to(10), [2, 3, 5, 7]);
+}
+
+#[test]
+fn limit_is_prime() {
+    assert_eq!(sieve::primes_up_to(13), [2, 3, 5, 7, 11, 13]);
+}
+
+#[test]
+fn limit_of_1000() {
+    let expected = vec![
+        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, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,
+        191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
+        283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397,
+        401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,
+        509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619,
+        631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,
+        751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
+        877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997,
+    ];
+    assert_eq!(sieve::primes_up_to(1000), expected);
+}