summaryrefslogtreecommitdiff
path: root/exercises/iterators
diff options
context:
space:
mode:
Diffstat (limited to 'exercises/iterators')
-rw-r--r--exercises/iterators/README.md8
-rw-r--r--exercises/iterators/iterators1.rs24
-rw-r--r--exercises/iterators/iterators2.rs60
-rw-r--r--exercises/iterators/iterators3.rs85
-rw-r--r--exercises/iterators/iterators4.rs40
-rw-r--r--exercises/iterators/iterators5.rs124
6 files changed, 341 insertions, 0 deletions
diff --git a/exercises/iterators/README.md b/exercises/iterators/README.md
new file mode 100644
index 0000000..0e8b671
--- /dev/null
+++ b/exercises/iterators/README.md
@@ -0,0 +1,8 @@
+# Iterators
+
+This section will teach you about Iterators.
+
+## Further information
+
+- [Iterator](https://doc.rust-lang.org/book/ch13-02-iterators.html)
+- [Iterator documentation](https://doc.rust-lang.org/stable/std/iter/)
diff --git a/exercises/iterators/iterators1.rs b/exercises/iterators/iterators1.rs
new file mode 100644
index 0000000..0379c6b
--- /dev/null
+++ b/exercises/iterators/iterators1.rs
@@ -0,0 +1,24 @@
+// iterators1.rs
+//
+// Make me compile by filling in the `???`s
+//
+// When performing operations on elements within a collection, iterators are essential.
+// This module helps you get familiar with the structure of using an iterator and
+// how to go through elements within an iterable collection.
+//
+// Execute `rustlings hint iterators1` or use the `hint` watch subcommand for a hint.
+
+// I AM NOT DONE
+
+fn main () {
+ let my_fav_fruits = vec!["banana", "custard apple", "avocado", "peach", "raspberry"];
+
+ let mut my_iterable_fav_fruits = ???; // TODO: Step 1
+
+ assert_eq!(my_iterable_fav_fruits.next(), Some(&"banana"));
+ assert_eq!(my_iterable_fav_fruits.next(), ???); // TODO: Step 2
+ assert_eq!(my_iterable_fav_fruits.next(), Some(&"avocado"));
+ assert_eq!(my_iterable_fav_fruits.next(), ???); // TODO: Step 3
+ assert_eq!(my_iterable_fav_fruits.next(), Some(&"raspberry"));
+ assert_eq!(my_iterable_fav_fruits.next(), ???); // TODO: Step 4
+}
diff --git a/exercises/iterators/iterators2.rs b/exercises/iterators/iterators2.rs
new file mode 100644
index 0000000..29c53af
--- /dev/null
+++ b/exercises/iterators/iterators2.rs
@@ -0,0 +1,60 @@
+// iterators2.rs
+// In this exercise, you'll learn some of the unique advantages that iterators
+// can offer. Follow the steps to complete the exercise.
+// Execute `rustlings hint iterators2` or use the `hint` watch subcommand for a hint.
+
+// I AM NOT DONE
+
+// Step 1.
+// Complete the `capitalize_first` function.
+// "hello" -> "Hello"
+pub fn capitalize_first(input: &str) -> String {
+ let mut c = input.chars();
+ match c.next() {
+ None => String::new(),
+ Some(first) => ???,
+ }
+}
+
+// Step 2.
+// Apply the `capitalize_first` function to a slice of string slices.
+// Return a vector of strings.
+// ["hello", "world"] -> ["Hello", "World"]
+pub fn capitalize_words_vector(words: &[&str]) -> Vec<String> {
+ vec![]
+}
+
+// Step 3.
+// Apply the `capitalize_first` function again to a slice of string slices.
+// Return a single string.
+// ["hello", " ", "world"] -> "Hello World"
+pub fn capitalize_words_string(words: &[&str]) -> String {
+ String::new()
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_success() {
+ assert_eq!(capitalize_first("hello"), "Hello");
+ }
+
+ #[test]
+ fn test_empty() {
+ assert_eq!(capitalize_first(""), "");
+ }
+
+ #[test]
+ fn test_iterate_string_vec() {
+ let words = vec!["hello", "world"];
+ assert_eq!(capitalize_words_vector(&words), ["Hello", "World"]);
+ }
+
+ #[test]
+ fn test_iterate_into_string() {
+ let words = vec!["hello", " ", "world"];
+ assert_eq!(capitalize_words_string(&words), "Hello World");
+ }
+}
diff --git a/exercises/iterators/iterators3.rs b/exercises/iterators/iterators3.rs
new file mode 100644
index 0000000..c97a625
--- /dev/null
+++ b/exercises/iterators/iterators3.rs
@@ -0,0 +1,85 @@
+// iterators3.rs
+// This is a bigger exercise than most of the others! You can do it!
+// Here is your mission, should you choose to accept it:
+// 1. Complete the divide function to get the first four tests to pass.
+// 2. Get the remaining tests to pass by completing the result_with_list and
+// list_of_results functions.
+// Execute `rustlings hint iterators3` or use the `hint` watch subcommand for a hint.
+
+// I AM NOT DONE
+
+#[derive(Debug, PartialEq, Eq)]
+pub enum DivisionError {
+ NotDivisible(NotDivisibleError),
+ DivideByZero,
+}
+
+#[derive(Debug, PartialEq, Eq)]
+pub struct NotDivisibleError {
+ dividend: i32,
+ divisor: i32,
+}
+
+// Calculate `a` divided by `b` if `a` is evenly divisible by `b`.
+// Otherwise, return a suitable error.
+pub fn divide(a: i32, b: i32) -> Result<i32, DivisionError> {
+ todo!();
+}
+
+// Complete the function and return a value of the correct type so the test passes.
+// Desired output: Ok([1, 11, 1426, 3])
+fn result_with_list() -> () {
+ let numbers = vec![27, 297, 38502, 81];
+ let division_results = numbers.into_iter().map(|n| divide(n, 27));
+}
+
+// Complete the function and return a value of the correct type so the test passes.
+// Desired output: [Ok(1), Ok(11), Ok(1426), Ok(3)]
+fn list_of_results() -> () {
+ let numbers = vec![27, 297, 38502, 81];
+ let division_results = numbers.into_iter().map(|n| divide(n, 27));
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_success() {
+ assert_eq!(divide(81, 9), Ok(9));
+ }
+
+ #[test]
+ fn test_not_divisible() {
+ assert_eq!(
+ divide(81, 6),
+ Err(DivisionError::NotDivisible(NotDivisibleError {
+ dividend: 81,
+ divisor: 6
+ }))
+ );
+ }
+
+ #[test]
+ fn test_divide_by_0() {
+ assert_eq!(divide(81, 0), Err(DivisionError::DivideByZero));
+ }
+
+ #[test]
+ fn test_divide_0_by_something() {
+ assert_eq!(divide(0, 81), Ok(0));
+ }
+
+ #[test]
+ fn test_result_with_list() {
+ assert_eq!(format!("{:?}", result_with_list()), "Ok([1, 11, 1426, 3])");
+ }
+
+ #[test]
+ fn test_list_of_results() {
+ assert_eq!(
+ format!("{:?}", list_of_results()),
+ "[Ok(1), Ok(11), Ok(1426), Ok(3)]"
+ );
+ }
+}
diff --git a/exercises/iterators/iterators4.rs b/exercises/iterators/iterators4.rs
new file mode 100644
index 0000000..a02470e
--- /dev/null
+++ b/exercises/iterators/iterators4.rs
@@ -0,0 +1,40 @@
+// iterators4.rs
+// Execute `rustlings hint iterators4` or use the `hint` watch subcommand for a hint.
+
+// I AM NOT DONE
+
+pub fn factorial(num: u64) -> u64 {
+ // Complete this function to return the factorial of num
+ // Do not use:
+ // - return
+ // Try not to use:
+ // - imperative style loops (for, while)
+ // - additional variables
+ // For an extra challenge, don't use:
+ // - recursion
+ // Execute `rustlings hint iterators4` for hints.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn factorial_of_0() {
+ assert_eq!(1, factorial(0));
+ }
+
+ #[test]
+ fn factorial_of_1() {
+ assert_eq!(1, factorial(1));
+ }
+ #[test]
+ fn factorial_of_2() {
+ assert_eq!(2, factorial(2));
+ }
+
+ #[test]
+ fn factorial_of_4() {
+ assert_eq!(24, factorial(4));
+ }
+}
diff --git a/exercises/iterators/iterators5.rs b/exercises/iterators/iterators5.rs
new file mode 100644
index 0000000..0593d12
--- /dev/null
+++ b/exercises/iterators/iterators5.rs
@@ -0,0 +1,124 @@
+// iterators5.rs
+// Let's define a simple model to track Rustlings exercise progress. Progress
+// will be modelled using a hash map. The name of the exercise is the key and
+// the progress is the value. Two counting functions were created to count the
+// number of exercises with a given progress. These counting functions use
+// imperative style for loops. Recreate this counting functionality using
+// iterators. Only the two iterator methods (count_iterator and
+// count_collection_iterator) need to be modified.
+// Execute `rustlings hint iterators5` or use the `hint` watch subcommand for a hint.
+//
+// Make the code compile and the tests pass.
+
+// I AM NOT DONE
+
+use std::collections::HashMap;
+
+#[derive(Clone, Copy, PartialEq, Eq)]
+enum Progress {
+ None,
+ Some,
+ Complete,
+}
+
+fn count_for(map: &HashMap<String, Progress>, value: Progress) -> usize {
+ let mut count = 0;
+ for val in map.values() {
+ if val == &value {
+ count += 1;
+ }
+ }
+ count
+}
+
+fn count_iterator(map: &HashMap<String, Progress>, value: Progress) -> usize {
+ // map is a hashmap with String keys and Progress values.
+ // map = { "variables1": Complete, "from_str": None, ... }
+ todo!();
+}
+
+fn count_collection_for(collection: &[HashMap<String, Progress>], value: Progress) -> usize {
+ let mut count = 0;
+ for map in collection {
+ for val in map.values() {
+ if val == &value {
+ count += 1;
+ }
+ }
+ }
+ count
+}
+
+fn count_collection_iterator(collection: &[HashMap<String, Progress>], value: Progress) -> usize {
+ // collection is a slice of hashmaps.
+ // collection = [{ "variables1": Complete, "from_str": None, ... },
+ // { "variables2": Complete, ... }, ... ]
+ todo!();
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn count_complete() {
+ let map = get_map();
+ assert_eq!(3, count_iterator(&map, Progress::Complete));
+ }
+
+ #[test]
+ fn count_equals_for() {
+ let map = get_map();
+ assert_eq!(
+ count_for(&map, Progress::Complete),
+ count_iterator(&map, Progress::Complete)
+ );
+ }
+
+ #[test]
+ fn count_collection_complete() {
+ let collection = get_vec_map();
+ assert_eq!(
+ 6,
+ count_collection_iterator(&collection, Progress::Complete)
+ );
+ }
+
+ #[test]
+ fn count_collection_equals_for() {
+ let collection = get_vec_map();
+ assert_eq!(
+ count_collection_for(&collection, Progress::Complete),
+ count_collection_iterator(&collection, Progress::Complete)
+ );
+ }
+
+ fn get_map() -> HashMap<String, Progress> {
+ use Progress::*;
+
+ let mut map = HashMap::new();
+ map.insert(String::from("variables1"), Complete);
+ map.insert(String::from("functions1"), Complete);
+ map.insert(String::from("hashmap1"), Complete);
+ map.insert(String::from("arc1"), Some);
+ map.insert(String::from("as_ref_mut"), None);
+ map.insert(String::from("from_str"), None);
+
+ map
+ }
+
+ fn get_vec_map() -> Vec<HashMap<String, Progress>> {
+ use Progress::*;
+
+ let map = get_map();
+
+ let mut other = HashMap::new();
+ other.insert(String::from("variables2"), Complete);
+ other.insert(String::from("functions2"), Complete);
+ other.insert(String::from("if1"), Complete);
+ other.insert(String::from("from_into"), None);
+ other.insert(String::from("try_from_into"), None);
+
+ vec![map, other]
+ }
+}