",
+version.workspace = true
+authors.workspace = true
+repository.workspace = true
+license.workspace = true
+edition.workspace = true
+keywords = [
+ "exercise",
+ "learning",
+]
+include = [
+ "/src/",
+ "/exercises/",
+ "/solutions/",
+ # A symlink to be able to include `dev/Cargo.toml` although `dev` is excluded.
+ "/dev-Cargo.toml",
+ "/README.md",
+ "/LICENSE",
]
-edition = "2021"
[dependencies]
-indicatif = "0.17.6"
-console = "0.15"
-notify = "4.0"
-toml = "0.7.6"
-regex = "1.5"
-serde = { version = "1.0", features = ["derive"] }
-serde_json = "1.0.81"
-home = "0.5.3"
-glob = "0.3.0"
-clap = { version = "4.4.0", features = ["derive"] }
-
-[[bin]]
-name = "rustlings"
-path = "src/main.rs"
+anyhow = "1.0.86"
+clap = { version = "4.5.8", features = ["derive"] }
+crossterm = "0.27.0"
+hashbrown = "0.14.5"
+notify-debouncer-mini = { version = "0.4.1", default-features = false }
+os_pipe = "1.2.0"
+ratatui = { version = "0.27.0", default-features = false, features = ["crossterm"] }
+rustlings-macros = { path = "rustlings-macros", version = "=6.0.1" }
+serde_json = "1.0.120"
+serde.workspace = true
+toml_edit.workspace = true
[dev-dependencies]
-assert_cmd = "2.0.12"
-predicates = "3.0.3"
-glob = "0.3.0"
+assert_cmd = "2.0.14"
+predicates = "3.1.0"
+
+[profile.release]
+panic = "abort"
+
+[profile.dev]
+panic = "abort"
+
+[package.metadata.release]
+pre-release-hook = ["./release-hook.sh"]
diff --git a/README.md b/README.md
index fdaee28..373b9c7 100644
--- a/README.md
+++ b/README.md
@@ -1,182 +1,143 @@
-# rustlings 🦀❤️
+# Rustlings 🦀❤️
-Greetings and welcome to `rustlings`. This project contains small exercises to get you used to reading and writing Rust code. This includes reading and responding to compiler messages!
+Greetings and welcome to Rustlings.
+This project contains small exercises to get you used to reading and writing Rust code.
+This includes reading and responding to compiler messages!
-_...looking for the old, web-based version of Rustlings? Try [here](https://github.com/rust-lang/rustlings/tree/rustlings-1)_
+It is recommended to do the Rustlings exercises in parallel to reading [the official Rust book](https://doc.rust-lang.org/book/), the most comprehensive resource for learning Rust 📚️
-Alternatively, for a first-time Rust learner, there are several other resources:
-
-- [The Book](https://doc.rust-lang.org/book/index.html) - The most comprehensive resource for learning Rust, but a bit theoretical sometimes. You will be using this along with Rustlings!
-- [Rust By Example](https://doc.rust-lang.org/rust-by-example/index.html) - Learn Rust by solving little exercises! It's almost like `rustlings`, but online
+[Rust By Example](https://doc.rust-lang.org/rust-by-example/) is another recommended resource that you might find helpful.
+It contains code examples and exercises similar to Rustlings, but online.
## Getting Started
-_Note: If you're on MacOS, make sure you've installed Xcode and its developer tools by typing `xcode-select --install`._
-_Note: If you're on Linux, make sure you've installed gcc. Deb: `sudo apt install gcc`. Yum: `sudo yum -y install gcc`._
+### Installing Rust
-You will need to have Rust installed. You can get it by visiting . This'll also install Cargo, Rust's package/project manager.
+Before installing Rustlings, you need to have _Rust installed_.
+Visit [www.rust-lang.org/tools/install](https://www.rust-lang.org/tools/install) for further instructions on installing Rust.
+This'll also install _Cargo_, Rust's package/project manager.
-## MacOS/Linux
+> 🐧 If you're on Linux, make sure you've installed `gcc` (for a linker).
+>
+> Deb: `sudo apt install gcc`.
+> Dnf: `sudo dnf install gcc`.
-Just run:
+> 🍎 If you're on MacOS, make sure you've installed Xcode and its developer tools by running `xcode-select --install`.
+
+### Installing Rustlings
+
+The following command will download and compile Rustlings:
```bash
-curl -L sh.rustlings.cool | bash
+cargo install rustlings
```
-Or if you want it to be installed to a different path:
+
+If the installation fails… (click to expand)
+
+- Make sure you have the latest Rust version by running `rustup update`
+- Try adding the `--locked` flag: `cargo install rustlings --locked`
+- Otherwise, please [report the issue](https://github.com/rust-lang/rustlings/issues/new)
+
+
+
+### Initialization
+
+After installing Rustlings, run the following command to initialize the `rustlings/` directory:
```bash
-curl -L sh.rustlings.cool | bash -s mypath/
+rustlings init
```
-This will install Rustlings and give you access to the `rustlings` command. Run it to get started!
-
-### Nix
-
-Basically: Clone the repository at the latest tag, finally run `nix develop` or `nix-shell`.
+Now, go into the newly initialized directory and launch Rustlings for further instructions on getting started with the exercises:
```bash
-# find out the latest version at https://github.com/rust-lang/rustlings/releases/latest (on edit 5.6.1)
-git clone -b 5.6.1 --depth 1 https://github.com/rust-lang/rustlings
-cd rustlings
-# if nix version > 2.3
-nix develop
-# if nix version <= 2.3
-nix-shell
+cd rustlings/
+rustlings
```
-## Windows
+## Working environment
-In PowerShell (Run as Administrator), set `ExecutionPolicy` to `RemoteSigned`:
+### Editor
-```ps1
-Set-ExecutionPolicy -ExecutionPolicy RemoteSigned -Scope CurrentUser
-```
+Our general recommendation is [VS Code](https://code.visualstudio.com/) with the [rust-analyzer plugin](https://marketplace.visualstudio.com/items?itemName=rust-lang.rust-analyzer).
+But any editor that supports [rust-analyzer](https://rust-analyzer.github.io/) should be enough for working on the exercises.
-Then, you can run:
+### Terminal
-```ps1
-Start-BitsTransfer -Source https://ps1.rustlings.cool -Destination $env:TMP/install_rustlings.ps1; Unblock-File $env:TMP/install_rustlings.ps1; Invoke-Expression $env:TMP/install_rustlings.ps1
-```
+While working with Rustlings, please use a modern terminal for the best user experience.
+The default terminal on Linux and Mac should be sufficient.
+On Windows, we recommend the [Windows Terminal](https://aka.ms/terminal).
-To install Rustlings. Same as on MacOS/Linux, you will have access to the `rustlings` command after it. Keep in mind that this works best in PowerShell, and any other terminals may give you errors.
-
-If you get a permission denied message, you might have to exclude the directory where you cloned Rustlings in your antivirus.
-
-## Browser
-
-[](https://gitpod.io/#https://github.com/rust-lang/rustlings)
-
-[](https://github.com/codespaces/new/?repo=rust-lang%2Frustlings&ref=main)
-
-## Manually
-
-Basically: Clone the repository at the latest tag, run `cargo install --path .`.
-
-```bash
-# find out the latest version at https://github.com/rust-lang/rustlings/releases/latest (on edit 5.6.1)
-git clone -b 5.6.1 --depth 1 https://github.com/rust-lang/rustlings
-cd rustlings
-cargo install --force --path .
-```
-
-If there are installation errors, ensure that your toolchain is up to date. For the latest, run:
-
-```bash
-rustup update
-```
-
-Then, same as above, run `rustlings` to get started.
+If you use VS Code, the builtin terminal should also be fine.
## Doing exercises
-The exercises are sorted by topic and can be found in the subdirectory `rustlings/exercises/`. For every topic there is an additional README file with some resources to get you started on the topic. We really recommend that you have a look at them before you start.
+The exercises are sorted by topic and can be found in the subdirectory `exercises/`.
+For every topic, there is an additional `README.md` file with some resources to get you started on the topic.
+We highly recommend that you have a look at them before you start 📚️
-The task is simple. Most exercises contain an error that keeps them from compiling, and it's up to you to fix it! Some exercises are also run as tests, but rustlings handles them all the same. To run the exercises in the recommended order, execute:
+Most exercises contain an error that keeps them from compiling, and it's up to you to fix it!
+Some exercises contain tests that need to pass for the exercise to be done ✅
-```bash
-rustlings watch
-```
+Search for `TODO` and `todo!()` to find out what you need to change.
+Ask for hints by entering `h` in the _watch mode_ 💡
-This will try to verify the completion of every exercise in a predetermined order (what we think is best for newcomers). It will also rerun automatically every time you change a file in the `exercises/` directory. If you want to only run it once, you can use:
+### Watch Mode
-```bash
-rustlings verify
-```
+After [initialization](#initialization), Rustlings can be launched by simply running the command `rustlings`.
-This will do the same as watch, but it'll quit after running.
+This will start the _watch mode_ which walks you through the exercises in a predefined order (what we think is best for newcomers).
+It will rerun the current exercise automatically every time you change the exercise's file in the `exercises/` directory.
-In case you want to go by your own order, or want to only verify a single exercise, you can run:
+
+If detecting file changes in the exercises/ directory fails… (click to expand)
-```bash
-rustlings run myExercise1
-```
+> You can add the **`--manual-run`** flag (`rustlings --manual-run`) to manually rerun the current exercise by entering `r` in the watch mode.
+>
+> Please [report the issue](https://github.com/rust-lang/rustlings/issues/new) with some information about your operating system and whether you run Rustlings in a container or virtual machine (e.g. WSL).
-Or simply use the following command to run the next unsolved exercise in the course:
+
-```bash
-rustlings run next
-```
+### Exercise List
-In case you get stuck, you can run the following command to get a hint for your
-exercise:
+In the [watch mode](#watch-mode) (after launching `rustlings`), you can enter `l` to open the interactive exercise list.
-```bash
-rustlings hint myExercise1
-```
+The list allows you to…
-You can also get the hint for the next unsolved exercise with the following command:
+- See the status of all exercises (done or pending)
+- `c`: Continue at another exercise (temporarily skip some exercises or go back to a previous one)
+- `r`: Reset status and file of an exercise (you need to _reload/reopen_ its file in your editor afterwards)
-```bash
-rustlings hint next
-```
-
-To check your progress, you can run the following command:
-
-```bash
-rustlings list
-```
-
-## Testing yourself
-
-After every couple of sections, there will be a quiz that'll test your knowledge on a bunch of sections at once. These quizzes are found in `exercises/quizN.rs`.
-
-## Enabling `rust-analyzer`
-
-Run the command `rustlings lsp` which will generate a `rust-project.json` at the root of the project, this allows [rust-analyzer](https://rust-analyzer.github.io/) to parse each exercise.
+See the footer of the list for all possible keys.
## Continuing On
-Once you've completed Rustlings, put your new knowledge to good use! Continue practicing your Rust skills by building your own projects, contributing to Rustlings, or finding other open-source projects to contribute to.
+Once you've completed Rustlings, put your new knowledge to good use!
+Continue practicing your Rust skills by building your own projects, contributing to Rustlings, or finding other open-source projects to contribute to.
-On [CodeCrafters](https://codecrafters.io/rust) you can get some quality practice through recreating different technologies from scratch in Rust (e.g Build your own BitTorrent, HTTP Server, SQLite, etc).
+## Third-Party Exercises
+
+Do you want to create your own set of Rustlings exercises to focus on some specific topic?
+Or do you want to translate the original Rustlings exercises?
+Then follow the link to the guide about [third-party exercises](THIRD_PARTY_EXERCISES.md)!
## Uninstalling Rustlings
-If you want to remove Rustlings from your system, there are two steps. First, you'll need to remove the exercises folder that the install script created
-for you:
-
-```bash
-rm -rf rustlings # or your custom folder name, if you chose and or renamed it
-```
-
-Second, run `cargo uninstall` to remove the `rustlings` binary:
+If you want to remove Rustlings from your system, run the following command:
```bash
cargo uninstall rustlings
```
-Now you should be done!
-
## Contributing
-See [CONTRIBUTING.md](https://github.com/rust-lang/rustlings/blob/main/CONTRIBUTING.md).
+See [CONTRIBUTING.md](https://github.com/rust-lang/rustlings/blob/main/CONTRIBUTING.md) 🔗
## Contributors ✨
-Thanks goes to the wonderful people listed in [AUTHORS.md](https://github.com/rust-lang/rustlings/blob/main/AUTHORS.md) 🎉
+Thanks to [all the wonderful contributors](https://github.com/rust-lang/rustlings/graphs/contributors) 🎉
diff --git a/THIRD_PARTY_EXERCISES.md b/THIRD_PARTY_EXERCISES.md
new file mode 100644
index 0000000..5c06694
--- /dev/null
+++ b/THIRD_PARTY_EXERCISES.md
@@ -0,0 +1,53 @@
+# Third-Party Exercises
+
+The support of Rustlings for third-party exercises allows you to create your own set of Rustlings exercises to focus on some specific topic.
+You could also offer a translatation of the original Rustlings exercises as third-party exercises.
+
+## Getting started
+
+To create third-party exercises, install Rustlings and run `rustlings dev new PROJECT_NAME`.
+This command will, similar to `cargo new PROJECT_NAME`, create a template directory called `PROJECT_NAME` with all what you need to get started.
+
+Read the comments in the generated `info.toml` file to understand its format.
+It allows you to set a custom welcome and final message and specify the metadata of every exercise.
+
+## Create an exercise
+
+Here is an example of the metadata of one file:
+
+```toml
+[[exercises]]
+name = "intro1"
+hint = """
+To finish this exercise, you need to …
+This link might help you …"""
+```
+
+After entering this in `info.toml`, create the file `intro1.rs` in the `exercises/` directory.
+The exercise needs to contain a `main` function, but it can be empty.
+Adding tests is recommended.
+Look at the official Rustlings exercises for inspiration.
+
+You can optionally add a solution file `intro1.rs` to the `solutions/` directory.
+
+Now, run `rustlings dev check`.
+It will tell you about any issues with your exercises.
+For example, it will tell you to run `rustlings dev update` to update the `Cargo.toml` file to include the new exercise `intro1`.
+
+`rustlings dev check` will also run your solutions (if you have any) to make sure that they run successfully.
+
+That's it!
+You finished your first exercise 🎉
+
+## Publish
+
+Now, add more exercises and publish them as a Git repository.
+
+Users just have to clone that repository and run `rustlings` in it to start working on your set of exercises just like the official ones.
+
+One difference to the official exercises is that the solution files will not be hidden until the user finishes an exercise.
+But you can trust the users to not look at the solution too early 😉
+
+## Share
+
+After publishing your set of exercises, open an issue or a pull request in the official Rustlings repository to link to your project in the README 😃
diff --git a/dev-Cargo.toml b/dev-Cargo.toml
new file mode 120000
index 0000000..9230c2e
--- /dev/null
+++ b/dev-Cargo.toml
@@ -0,0 +1 @@
+dev/Cargo.toml
\ No newline at end of file
diff --git a/dev/Cargo.toml b/dev/Cargo.toml
new file mode 100644
index 0000000..7f3acb5
--- /dev/null
+++ b/dev/Cargo.toml
@@ -0,0 +1,197 @@
+# Don't edit the `bin` list manually! It is updated by `cargo run -- dev update`. This comment line will be stripped in `rustlings init`.
+bin = [
+ { name = "intro1", path = "../exercises/00_intro/intro1.rs" },
+ { name = "intro1_sol", path = "../solutions/00_intro/intro1.rs" },
+ { name = "intro2", path = "../exercises/00_intro/intro2.rs" },
+ { name = "intro2_sol", path = "../solutions/00_intro/intro2.rs" },
+ { name = "variables1", path = "../exercises/01_variables/variables1.rs" },
+ { name = "variables1_sol", path = "../solutions/01_variables/variables1.rs" },
+ { name = "variables2", path = "../exercises/01_variables/variables2.rs" },
+ { name = "variables2_sol", path = "../solutions/01_variables/variables2.rs" },
+ { name = "variables3", path = "../exercises/01_variables/variables3.rs" },
+ { name = "variables3_sol", path = "../solutions/01_variables/variables3.rs" },
+ { name = "variables4", path = "../exercises/01_variables/variables4.rs" },
+ { name = "variables4_sol", path = "../solutions/01_variables/variables4.rs" },
+ { name = "variables5", path = "../exercises/01_variables/variables5.rs" },
+ { name = "variables5_sol", path = "../solutions/01_variables/variables5.rs" },
+ { name = "variables6", path = "../exercises/01_variables/variables6.rs" },
+ { name = "variables6_sol", path = "../solutions/01_variables/variables6.rs" },
+ { name = "functions1", path = "../exercises/02_functions/functions1.rs" },
+ { name = "functions1_sol", path = "../solutions/02_functions/functions1.rs" },
+ { name = "functions2", path = "../exercises/02_functions/functions2.rs" },
+ { name = "functions2_sol", path = "../solutions/02_functions/functions2.rs" },
+ { name = "functions3", path = "../exercises/02_functions/functions3.rs" },
+ { name = "functions3_sol", path = "../solutions/02_functions/functions3.rs" },
+ { name = "functions4", path = "../exercises/02_functions/functions4.rs" },
+ { name = "functions4_sol", path = "../solutions/02_functions/functions4.rs" },
+ { name = "functions5", path = "../exercises/02_functions/functions5.rs" },
+ { name = "functions5_sol", path = "../solutions/02_functions/functions5.rs" },
+ { name = "if1", path = "../exercises/03_if/if1.rs" },
+ { name = "if1_sol", path = "../solutions/03_if/if1.rs" },
+ { name = "if2", path = "../exercises/03_if/if2.rs" },
+ { name = "if2_sol", path = "../solutions/03_if/if2.rs" },
+ { name = "if3", path = "../exercises/03_if/if3.rs" },
+ { name = "if3_sol", path = "../solutions/03_if/if3.rs" },
+ { name = "quiz1", path = "../exercises/quizzes/quiz1.rs" },
+ { name = "quiz1_sol", path = "../solutions/quizzes/quiz1.rs" },
+ { name = "primitive_types1", path = "../exercises/04_primitive_types/primitive_types1.rs" },
+ { name = "primitive_types1_sol", path = "../solutions/04_primitive_types/primitive_types1.rs" },
+ { name = "primitive_types2", path = "../exercises/04_primitive_types/primitive_types2.rs" },
+ { name = "primitive_types2_sol", path = "../solutions/04_primitive_types/primitive_types2.rs" },
+ { name = "primitive_types3", path = "../exercises/04_primitive_types/primitive_types3.rs" },
+ { name = "primitive_types3_sol", path = "../solutions/04_primitive_types/primitive_types3.rs" },
+ { name = "primitive_types4", path = "../exercises/04_primitive_types/primitive_types4.rs" },
+ { name = "primitive_types4_sol", path = "../solutions/04_primitive_types/primitive_types4.rs" },
+ { name = "primitive_types5", path = "../exercises/04_primitive_types/primitive_types5.rs" },
+ { name = "primitive_types5_sol", path = "../solutions/04_primitive_types/primitive_types5.rs" },
+ { name = "primitive_types6", path = "../exercises/04_primitive_types/primitive_types6.rs" },
+ { name = "primitive_types6_sol", path = "../solutions/04_primitive_types/primitive_types6.rs" },
+ { name = "vecs1", path = "../exercises/05_vecs/vecs1.rs" },
+ { name = "vecs1_sol", path = "../solutions/05_vecs/vecs1.rs" },
+ { name = "vecs2", path = "../exercises/05_vecs/vecs2.rs" },
+ { name = "vecs2_sol", path = "../solutions/05_vecs/vecs2.rs" },
+ { name = "move_semantics1", path = "../exercises/06_move_semantics/move_semantics1.rs" },
+ { name = "move_semantics1_sol", path = "../solutions/06_move_semantics/move_semantics1.rs" },
+ { name = "move_semantics2", path = "../exercises/06_move_semantics/move_semantics2.rs" },
+ { name = "move_semantics2_sol", path = "../solutions/06_move_semantics/move_semantics2.rs" },
+ { name = "move_semantics3", path = "../exercises/06_move_semantics/move_semantics3.rs" },
+ { name = "move_semantics3_sol", path = "../solutions/06_move_semantics/move_semantics3.rs" },
+ { name = "move_semantics4", path = "../exercises/06_move_semantics/move_semantics4.rs" },
+ { name = "move_semantics4_sol", path = "../solutions/06_move_semantics/move_semantics4.rs" },
+ { name = "move_semantics5", path = "../exercises/06_move_semantics/move_semantics5.rs" },
+ { name = "move_semantics5_sol", path = "../solutions/06_move_semantics/move_semantics5.rs" },
+ { name = "structs1", path = "../exercises/07_structs/structs1.rs" },
+ { name = "structs1_sol", path = "../solutions/07_structs/structs1.rs" },
+ { name = "structs2", path = "../exercises/07_structs/structs2.rs" },
+ { name = "structs2_sol", path = "../solutions/07_structs/structs2.rs" },
+ { name = "structs3", path = "../exercises/07_structs/structs3.rs" },
+ { name = "structs3_sol", path = "../solutions/07_structs/structs3.rs" },
+ { name = "enums1", path = "../exercises/08_enums/enums1.rs" },
+ { name = "enums1_sol", path = "../solutions/08_enums/enums1.rs" },
+ { name = "enums2", path = "../exercises/08_enums/enums2.rs" },
+ { name = "enums2_sol", path = "../solutions/08_enums/enums2.rs" },
+ { name = "enums3", path = "../exercises/08_enums/enums3.rs" },
+ { name = "enums3_sol", path = "../solutions/08_enums/enums3.rs" },
+ { name = "strings1", path = "../exercises/09_strings/strings1.rs" },
+ { name = "strings1_sol", path = "../solutions/09_strings/strings1.rs" },
+ { name = "strings2", path = "../exercises/09_strings/strings2.rs" },
+ { name = "strings2_sol", path = "../solutions/09_strings/strings2.rs" },
+ { name = "strings3", path = "../exercises/09_strings/strings3.rs" },
+ { name = "strings3_sol", path = "../solutions/09_strings/strings3.rs" },
+ { name = "strings4", path = "../exercises/09_strings/strings4.rs" },
+ { name = "strings4_sol", path = "../solutions/09_strings/strings4.rs" },
+ { name = "modules1", path = "../exercises/10_modules/modules1.rs" },
+ { name = "modules1_sol", path = "../solutions/10_modules/modules1.rs" },
+ { name = "modules2", path = "../exercises/10_modules/modules2.rs" },
+ { name = "modules2_sol", path = "../solutions/10_modules/modules2.rs" },
+ { name = "modules3", path = "../exercises/10_modules/modules3.rs" },
+ { name = "modules3_sol", path = "../solutions/10_modules/modules3.rs" },
+ { name = "hashmaps1", path = "../exercises/11_hashmaps/hashmaps1.rs" },
+ { name = "hashmaps1_sol", path = "../solutions/11_hashmaps/hashmaps1.rs" },
+ { name = "hashmaps2", path = "../exercises/11_hashmaps/hashmaps2.rs" },
+ { name = "hashmaps2_sol", path = "../solutions/11_hashmaps/hashmaps2.rs" },
+ { name = "hashmaps3", path = "../exercises/11_hashmaps/hashmaps3.rs" },
+ { name = "hashmaps3_sol", path = "../solutions/11_hashmaps/hashmaps3.rs" },
+ { name = "quiz2", path = "../exercises/quizzes/quiz2.rs" },
+ { name = "quiz2_sol", path = "../solutions/quizzes/quiz2.rs" },
+ { name = "options1", path = "../exercises/12_options/options1.rs" },
+ { name = "options1_sol", path = "../solutions/12_options/options1.rs" },
+ { name = "options2", path = "../exercises/12_options/options2.rs" },
+ { name = "options2_sol", path = "../solutions/12_options/options2.rs" },
+ { name = "options3", path = "../exercises/12_options/options3.rs" },
+ { name = "options3_sol", path = "../solutions/12_options/options3.rs" },
+ { name = "errors1", path = "../exercises/13_error_handling/errors1.rs" },
+ { name = "errors1_sol", path = "../solutions/13_error_handling/errors1.rs" },
+ { name = "errors2", path = "../exercises/13_error_handling/errors2.rs" },
+ { name = "errors2_sol", path = "../solutions/13_error_handling/errors2.rs" },
+ { name = "errors3", path = "../exercises/13_error_handling/errors3.rs" },
+ { name = "errors3_sol", path = "../solutions/13_error_handling/errors3.rs" },
+ { name = "errors4", path = "../exercises/13_error_handling/errors4.rs" },
+ { name = "errors4_sol", path = "../solutions/13_error_handling/errors4.rs" },
+ { name = "errors5", path = "../exercises/13_error_handling/errors5.rs" },
+ { name = "errors5_sol", path = "../solutions/13_error_handling/errors5.rs" },
+ { name = "errors6", path = "../exercises/13_error_handling/errors6.rs" },
+ { name = "errors6_sol", path = "../solutions/13_error_handling/errors6.rs" },
+ { name = "generics1", path = "../exercises/14_generics/generics1.rs" },
+ { name = "generics1_sol", path = "../solutions/14_generics/generics1.rs" },
+ { name = "generics2", path = "../exercises/14_generics/generics2.rs" },
+ { name = "generics2_sol", path = "../solutions/14_generics/generics2.rs" },
+ { name = "traits1", path = "../exercises/15_traits/traits1.rs" },
+ { name = "traits1_sol", path = "../solutions/15_traits/traits1.rs" },
+ { name = "traits2", path = "../exercises/15_traits/traits2.rs" },
+ { name = "traits2_sol", path = "../solutions/15_traits/traits2.rs" },
+ { name = "traits3", path = "../exercises/15_traits/traits3.rs" },
+ { name = "traits3_sol", path = "../solutions/15_traits/traits3.rs" },
+ { name = "traits4", path = "../exercises/15_traits/traits4.rs" },
+ { name = "traits4_sol", path = "../solutions/15_traits/traits4.rs" },
+ { name = "traits5", path = "../exercises/15_traits/traits5.rs" },
+ { name = "traits5_sol", path = "../solutions/15_traits/traits5.rs" },
+ { name = "quiz3", path = "../exercises/quizzes/quiz3.rs" },
+ { name = "quiz3_sol", path = "../solutions/quizzes/quiz3.rs" },
+ { name = "lifetimes1", path = "../exercises/16_lifetimes/lifetimes1.rs" },
+ { name = "lifetimes1_sol", path = "../solutions/16_lifetimes/lifetimes1.rs" },
+ { name = "lifetimes2", path = "../exercises/16_lifetimes/lifetimes2.rs" },
+ { name = "lifetimes2_sol", path = "../solutions/16_lifetimes/lifetimes2.rs" },
+ { name = "lifetimes3", path = "../exercises/16_lifetimes/lifetimes3.rs" },
+ { name = "lifetimes3_sol", path = "../solutions/16_lifetimes/lifetimes3.rs" },
+ { name = "tests1", path = "../exercises/17_tests/tests1.rs" },
+ { name = "tests1_sol", path = "../solutions/17_tests/tests1.rs" },
+ { name = "tests2", path = "../exercises/17_tests/tests2.rs" },
+ { name = "tests2_sol", path = "../solutions/17_tests/tests2.rs" },
+ { name = "tests3", path = "../exercises/17_tests/tests3.rs" },
+ { name = "tests3_sol", path = "../solutions/17_tests/tests3.rs" },
+ { name = "iterators1", path = "../exercises/18_iterators/iterators1.rs" },
+ { name = "iterators1_sol", path = "../solutions/18_iterators/iterators1.rs" },
+ { name = "iterators2", path = "../exercises/18_iterators/iterators2.rs" },
+ { name = "iterators2_sol", path = "../solutions/18_iterators/iterators2.rs" },
+ { name = "iterators3", path = "../exercises/18_iterators/iterators3.rs" },
+ { name = "iterators3_sol", path = "../solutions/18_iterators/iterators3.rs" },
+ { name = "iterators4", path = "../exercises/18_iterators/iterators4.rs" },
+ { name = "iterators4_sol", path = "../solutions/18_iterators/iterators4.rs" },
+ { name = "iterators5", path = "../exercises/18_iterators/iterators5.rs" },
+ { name = "iterators5_sol", path = "../solutions/18_iterators/iterators5.rs" },
+ { name = "box1", path = "../exercises/19_smart_pointers/box1.rs" },
+ { name = "box1_sol", path = "../solutions/19_smart_pointers/box1.rs" },
+ { name = "rc1", path = "../exercises/19_smart_pointers/rc1.rs" },
+ { name = "rc1_sol", path = "../solutions/19_smart_pointers/rc1.rs" },
+ { name = "arc1", path = "../exercises/19_smart_pointers/arc1.rs" },
+ { name = "arc1_sol", path = "../solutions/19_smart_pointers/arc1.rs" },
+ { name = "cow1", path = "../exercises/19_smart_pointers/cow1.rs" },
+ { name = "cow1_sol", path = "../solutions/19_smart_pointers/cow1.rs" },
+ { name = "threads1", path = "../exercises/20_threads/threads1.rs" },
+ { name = "threads1_sol", path = "../solutions/20_threads/threads1.rs" },
+ { name = "threads2", path = "../exercises/20_threads/threads2.rs" },
+ { name = "threads2_sol", path = "../solutions/20_threads/threads2.rs" },
+ { name = "threads3", path = "../exercises/20_threads/threads3.rs" },
+ { name = "threads3_sol", path = "../solutions/20_threads/threads3.rs" },
+ { name = "macros1", path = "../exercises/21_macros/macros1.rs" },
+ { name = "macros1_sol", path = "../solutions/21_macros/macros1.rs" },
+ { name = "macros2", path = "../exercises/21_macros/macros2.rs" },
+ { name = "macros2_sol", path = "../solutions/21_macros/macros2.rs" },
+ { name = "macros3", path = "../exercises/21_macros/macros3.rs" },
+ { name = "macros3_sol", path = "../solutions/21_macros/macros3.rs" },
+ { name = "macros4", path = "../exercises/21_macros/macros4.rs" },
+ { name = "macros4_sol", path = "../solutions/21_macros/macros4.rs" },
+ { name = "clippy1", path = "../exercises/22_clippy/clippy1.rs" },
+ { name = "clippy1_sol", path = "../solutions/22_clippy/clippy1.rs" },
+ { name = "clippy2", path = "../exercises/22_clippy/clippy2.rs" },
+ { name = "clippy2_sol", path = "../solutions/22_clippy/clippy2.rs" },
+ { name = "clippy3", path = "../exercises/22_clippy/clippy3.rs" },
+ { name = "clippy3_sol", path = "../solutions/22_clippy/clippy3.rs" },
+ { name = "using_as", path = "../exercises/23_conversions/using_as.rs" },
+ { name = "using_as_sol", path = "../solutions/23_conversions/using_as.rs" },
+ { name = "from_into", path = "../exercises/23_conversions/from_into.rs" },
+ { name = "from_into_sol", path = "../solutions/23_conversions/from_into.rs" },
+ { name = "from_str", path = "../exercises/23_conversions/from_str.rs" },
+ { name = "from_str_sol", path = "../solutions/23_conversions/from_str.rs" },
+ { name = "try_from_into", path = "../exercises/23_conversions/try_from_into.rs" },
+ { name = "try_from_into_sol", path = "../solutions/23_conversions/try_from_into.rs" },
+ { name = "as_ref_mut", path = "../exercises/23_conversions/as_ref_mut.rs" },
+ { name = "as_ref_mut_sol", path = "../solutions/23_conversions/as_ref_mut.rs" },
+]
+
+[package]
+name = "exercises"
+edition = "2021"
+# Don't publish the exercises on crates.io!
+publish = false
diff --git a/dev/rustlings-repo.txt b/dev/rustlings-repo.txt
new file mode 100644
index 0000000..6279361
--- /dev/null
+++ b/dev/rustlings-repo.txt
@@ -0,0 +1 @@
+This file is used to check if the user tries to run Rustlings in the repository (the method before v6)
diff --git a/exercises/00_intro/intro1.rs b/exercises/00_intro/intro1.rs
index 5dd18b4..7b8baa2 100644
--- a/exercises/00_intro/intro1.rs
+++ b/exercises/00_intro/intro1.rs
@@ -1,19 +1,9 @@
-// intro1.rs
+// TODO: We sometimes encourage you to keep trying things on a given exercise,
+// even after you already figured it out. If you got everything working and feel
+// ready for the next exercise, enter `n` in the terminal.
//
-// About this `I AM NOT DONE` thing:
-// We sometimes encourage you to keep trying things on a given exercise, even
-// after you already figured it out. If you got everything working and feel
-// ready for the next exercise, remove the `I AM NOT DONE` comment below.
-//
-// If you're running this using `rustlings watch`: The exercise file will be
-// reloaded when you change one of the lines below! Try adding a `println!`
-// line, or try changing what it outputs in your terminal. Try removing a
-// semicolon and see what happens!
-//
-// Execute `rustlings hint intro1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// The exercise file will be reloaded when you change one of the lines below!
+// Try adding a new `println!` and check the updated output in the terminal.
fn main() {
println!("Hello and");
@@ -29,13 +19,7 @@ fn main() {
println!("or logic error. The central concept behind Rustlings is to fix these errors and");
println!("solve the exercises. Good luck!");
println!();
- println!("The source for this exercise is in `exercises/00_intro/intro1.rs`. Have a look!");
- println!(
- "Going forward, the source of the exercises will always be in the success/failure output."
- );
- println!();
- println!(
- "If you want to use rust-analyzer, Rust's LSP implementation, make sure your editor is set"
- );
- println!("up, and then run `rustlings lsp` before continuing.")
+ println!("The file of this exercise is `exercises/00_intro/intro1.rs`. Have a look!");
+ println!("The current exercise path will be always shown under the progress bar.");
+ println!("You can click on the path to open the exercise file in your editor.");
}
diff --git a/exercises/00_intro/intro2.rs b/exercises/00_intro/intro2.rs
index a28ad3d..c6cb645 100644
--- a/exercises/00_intro/intro2.rs
+++ b/exercises/00_intro/intro2.rs
@@ -1,12 +1,4 @@
-// intro2.rs
-//
-// Make the code print a greeting to the world.
-//
-// Execute `rustlings hint intro2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
- printline!("Hello there!")
+ // TODO: Fix the code to print "Hello world!".
+ printline!("Hello world!");
}
diff --git a/exercises/01_variables/variables1.rs b/exercises/01_variables/variables1.rs
index b3e089a..0a9e554 100644
--- a/exercises/01_variables/variables1.rs
+++ b/exercises/01_variables/variables1.rs
@@ -1,13 +1,6 @@
-// variables1.rs
-//
-// Make me compile!
-//
-// Execute `rustlings hint variables1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
+ // TODO: Add missing keyword.
x = 5;
- println!("x has the value {}", x);
+
+ println!("x has the value {x}");
}
diff --git a/exercises/01_variables/variables2.rs b/exercises/01_variables/variables2.rs
index e1c23ed..e2a3603 100644
--- a/exercises/01_variables/variables2.rs
+++ b/exercises/01_variables/variables2.rs
@@ -1,12 +1,7 @@
-// variables2.rs
-//
-// Execute `rustlings hint variables2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
+ // TODO: Change the line below to fix the compiler error.
let x;
+
if x == 10 {
println!("x is ten!");
} else {
diff --git a/exercises/01_variables/variables3.rs b/exercises/01_variables/variables3.rs
index 86bed41..06f35bb 100644
--- a/exercises/01_variables/variables3.rs
+++ b/exercises/01_variables/variables3.rs
@@ -1,11 +1,6 @@
-// variables3.rs
-//
-// Execute `rustlings hint variables3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
+ // TODO: Change the line below to fix the compiler error.
let x: i32;
- println!("Number {}", x);
+
+ println!("Number {x}");
}
diff --git a/exercises/01_variables/variables4.rs b/exercises/01_variables/variables4.rs
index 5394f39..6c138b1 100644
--- a/exercises/01_variables/variables4.rs
+++ b/exercises/01_variables/variables4.rs
@@ -1,13 +1,8 @@
-// variables4.rs
-//
-// Execute `rustlings hint variables4` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Fix the compiler error.
fn main() {
let x = 3;
- println!("Number {}", x);
- x = 5; // don't change this line
- println!("Number {}", x);
+ println!("Number {x}");
+
+ x = 5; // Don't change this line
+ println!("Number {x}");
}
diff --git a/exercises/01_variables/variables5.rs b/exercises/01_variables/variables5.rs
index a29b38b..49db8e9 100644
--- a/exercises/01_variables/variables5.rs
+++ b/exercises/01_variables/variables5.rs
@@ -1,13 +1,8 @@
-// variables5.rs
-//
-// Execute `rustlings hint variables5` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
- let number = "T-H-R-E-E"; // don't change this line
- println!("Spell a Number : {}", number);
- number = 3; // don't rename this variable
- println!("Number plus two is : {}", number + 2);
+ let number = "T-H-R-E-E"; // Don't change this line
+ println!("Spell a number: {}", number);
+
+ // TODO: Fix the compiler error by changing the line below without renaming the variable.
+ number = 3;
+ println!("Number plus two is: {}", number + 2);
}
diff --git a/exercises/01_variables/variables6.rs b/exercises/01_variables/variables6.rs
index 853183b..4a040fd 100644
--- a/exercises/01_variables/variables6.rs
+++ b/exercises/01_variables/variables6.rs
@@ -1,11 +1,6 @@
-// variables6.rs
-//
-// Execute `rustlings hint variables6` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Change the line below to fix the compiler error.
const NUMBER = 3;
+
fn main() {
- println!("Number {}", NUMBER);
+ println!("Number: {NUMBER}");
}
diff --git a/exercises/02_functions/functions1.rs b/exercises/02_functions/functions1.rs
index 40ed9a0..a812c21 100644
--- a/exercises/02_functions/functions1.rs
+++ b/exercises/02_functions/functions1.rs
@@ -1,10 +1,5 @@
-// functions1.rs
-//
-// Execute `rustlings hint functions1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// TODO: Add some function with the name `call_me` without arguments or a return value.
fn main() {
- call_me();
+ call_me(); // Don't change this line
}
diff --git a/exercises/02_functions/functions2.rs b/exercises/02_functions/functions2.rs
index 5154f34..2c773c6 100644
--- a/exercises/02_functions/functions2.rs
+++ b/exercises/02_functions/functions2.rs
@@ -1,16 +1,10 @@
-// functions2.rs
-//
-// Execute `rustlings hint functions2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-fn main() {
- call_me(3);
-}
-
+// TODO: Add the missing type of the argument `num` after the colon `:`.
fn call_me(num:) {
for i in 0..num {
println!("Ring! Call number {}", i + 1);
}
}
+
+fn main() {
+ call_me(3);
+}
diff --git a/exercises/02_functions/functions3.rs b/exercises/02_functions/functions3.rs
index 74f44d6..5d5122a 100644
--- a/exercises/02_functions/functions3.rs
+++ b/exercises/02_functions/functions3.rs
@@ -1,16 +1,10 @@
-// functions3.rs
-//
-// Execute `rustlings hint functions3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-fn main() {
- call_me();
-}
-
fn call_me(num: u32) {
for i in 0..num {
println!("Ring! Call number {}", i + 1);
}
}
+
+fn main() {
+ // TODO: Fix the function call.
+ call_me();
+}
diff --git a/exercises/02_functions/functions4.rs b/exercises/02_functions/functions4.rs
index 77c4b2a..b22bffd 100644
--- a/exercises/02_functions/functions4.rs
+++ b/exercises/02_functions/functions4.rs
@@ -1,21 +1,14 @@
-// functions4.rs
-//
// This store is having a sale where if the price is an even number, you get 10
-// Rustbucks off, but if it's an odd number, it's 3 Rustbucks off. (Don't worry
-// about the function bodies themselves, we're only interested in the signatures
-// for now. If anything, this is a good way to peek ahead to future exercises!)
-//
-// Execute `rustlings hint functions4` or use the `hint` watch subcommand for a
-// hint.
+// Rustbucks off, but if it's an odd number, it's 3 Rustbucks off.
+// Don't worry about the function bodies themselves, we are only interested in
+// the signatures for now.
-// I AM NOT DONE
-
-fn main() {
- let original_price = 51;
- println!("Your sale price is {}", sale_price(original_price));
+fn is_even(num: i64) -> bool {
+ num % 2 == 0
}
-fn sale_price(price: i32) -> {
+// TODO: Fix the function signature.
+fn sale_price(price: i64) -> {
if is_even(price) {
price - 10
} else {
@@ -23,6 +16,7 @@ fn sale_price(price: i32) -> {
}
}
-fn is_even(num: i32) -> bool {
- num % 2 == 0
+fn main() {
+ let original_price = 51;
+ println!("Your sale price is {}", sale_price(original_price));
}
diff --git a/exercises/02_functions/functions5.rs b/exercises/02_functions/functions5.rs
index f1b63f4..34a2ac7 100644
--- a/exercises/02_functions/functions5.rs
+++ b/exercises/02_functions/functions5.rs
@@ -1,15 +1,9 @@
-// functions5.rs
-//
-// Execute `rustlings hint functions5` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-fn main() {
- let answer = square(3);
- println!("The square of 3 is {}", answer);
-}
-
+// TODO: Fix the function body without changing the signature.
fn square(num: i32) -> i32 {
num * num;
}
+
+fn main() {
+ let answer = square(3);
+ println!("The square of 3 is {answer}");
+}
diff --git a/exercises/03_if/if1.rs b/exercises/03_if/if1.rs
index 4734d78..e5a3c5a 100644
--- a/exercises/03_if/if1.rs
+++ b/exercises/03_if/if1.rs
@@ -1,16 +1,15 @@
-// if1.rs
-//
-// Execute `rustlings hint if1` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
-
-pub fn bigger(a: i32, b: i32) -> i32 {
- // Complete this function to return the bigger number!
+fn bigger(a: i32, b: i32) -> i32 {
+ // TODO: Complete this function to return the bigger number!
+ // If both numbers are equal, any of them can be returned.
// Do not use:
// - another function call
// - additional variables
}
+fn main() {
+ // You can optionally experiment here.
+}
+
// Don't mind this for now :)
#[cfg(test)]
mod tests {
diff --git a/exercises/03_if/if2.rs b/exercises/03_if/if2.rs
index f512f13..593a77a 100644
--- a/exercises/03_if/if2.rs
+++ b/exercises/03_if/if2.rs
@@ -1,13 +1,5 @@
-// if2.rs
-//
-// Step 1: Make me compile!
-// Step 2: Get the bar_for_fuzz and default_to_baz tests passing!
-//
-// Execute `rustlings hint if2` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
-
-pub fn foo_if_fizz(fizzish: &str) -> &str {
+// TODO: Fix the compiler error on this function.
+fn foo_if_fizz(fizzish: &str) -> &str {
if fizzish == "fizz" {
"foo"
} else {
@@ -15,23 +7,29 @@ pub fn foo_if_fizz(fizzish: &str) -> &str {
}
}
-// No test changes needed!
+fn main() {
+ // You can optionally experiment here.
+}
+
+// TODO: Read the tests to understand the desired behavior.
+// Make all tests pass without changing them.
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn foo_for_fizz() {
- assert_eq!(foo_if_fizz("fizz"), "foo")
+ // This means that calling `foo_if_fizz` with the argument "fizz" should return "foo".
+ assert_eq!(foo_if_fizz("fizz"), "foo");
}
#[test]
fn bar_for_fuzz() {
- assert_eq!(foo_if_fizz("fuzz"), "bar")
+ assert_eq!(foo_if_fizz("fuzz"), "bar");
}
#[test]
fn default_to_baz() {
- assert_eq!(foo_if_fizz("literally anything"), "baz")
+ assert_eq!(foo_if_fizz("literally anything"), "baz");
}
}
diff --git a/exercises/03_if/if3.rs b/exercises/03_if/if3.rs
index 1696274..89164eb 100644
--- a/exercises/03_if/if3.rs
+++ b/exercises/03_if/if3.rs
@@ -1,10 +1,5 @@
-// if3.rs
-//
-// Execute `rustlings hint if3` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
-
-pub fn animal_habitat(animal: &str) -> &'static str {
+fn animal_habitat(animal: &str) -> &str {
+ // TODO: Fix the compiler error in the statement below.
let identifier = if animal == "crab" {
1
} else if animal == "gopher" {
@@ -15,8 +10,8 @@ pub fn animal_habitat(animal: &str) -> &'static str {
"Unknown"
};
- // DO NOT CHANGE THIS STATEMENT BELOW
- let habitat = if identifier == 1 {
+ // Don't change the expression below!
+ if identifier == 1 {
"Beach"
} else if identifier == 2 {
"Burrow"
@@ -24,12 +19,14 @@ pub fn animal_habitat(animal: &str) -> &'static str {
"Desert"
} else {
"Unknown"
- };
-
- habitat
+ }
}
-// No test changes needed.
+fn main() {
+ // You can optionally experiment here.
+}
+
+// Don't change the tests!
#[cfg(test)]
mod tests {
use super::*;
diff --git a/exercises/04_primitive_types/primitive_types1.rs b/exercises/04_primitive_types/primitive_types1.rs
index 3663340..84923c7 100644
--- a/exercises/04_primitive_types/primitive_types1.rs
+++ b/exercises/04_primitive_types/primitive_types1.rs
@@ -1,19 +1,14 @@
-// primitive_types1.rs
-//
-// Fill in the rest of the line that has code missing! No hints, there's no
-// tricks, just get used to typing these :)
-
-// I AM NOT DONE
+// Booleans (`bool`)
fn main() {
- // Booleans (`bool`)
-
let is_morning = true;
if is_morning {
println!("Good morning!");
}
- let // Finish the rest of this line like the example! Or make it be false!
+ // TODO: Define a boolean variable with the name `is_evening` before the `if` statement below.
+ // The value of the variable should be the negation (opposite) of `is_morning`.
+ // let …
if is_evening {
println!("Good evening!");
}
diff --git a/exercises/04_primitive_types/primitive_types2.rs b/exercises/04_primitive_types/primitive_types2.rs
index f1616ed..1401847 100644
--- a/exercises/04_primitive_types/primitive_types2.rs
+++ b/exercises/04_primitive_types/primitive_types2.rs
@@ -1,13 +1,6 @@
-// primitive_types2.rs
-//
-// Fill in the rest of the line that has code missing! No hints, there's no
-// tricks, just get used to typing these :)
-
-// I AM NOT DONE
+// Characters (`char`)
fn main() {
- // Characters (`char`)
-
// Note the _single_ quotes, these are different from the double quotes
// you've been seeing around.
let my_first_initial = 'C';
@@ -19,9 +12,12 @@ fn main() {
println!("Neither alphabetic nor numeric!");
}
- let // Finish this line like the example! What's your favorite character?
- // Try a letter, try a number, try a special character, try a character
- // from a different language than your own, try an emoji!
+ // TODO: Analogous to the example before, declare a variable called `your_character`
+ // below with your favorite character.
+ // Try a letter, try a digit (in single quotes), try a special character, try a character
+ // from a different language than your own, try an emoji 😉
+ // let your_character = '';
+
if your_character.is_alphabetic() {
println!("Alphabetical!");
} else if your_character.is_numeric() {
diff --git a/exercises/04_primitive_types/primitive_types3.rs b/exercises/04_primitive_types/primitive_types3.rs
index 8b0de44..9b79c0c 100644
--- a/exercises/04_primitive_types/primitive_types3.rs
+++ b/exercises/04_primitive_types/primitive_types3.rs
@@ -1,19 +1,11 @@
-// primitive_types3.rs
-//
-// Create an array with at least 100 elements in it where the ??? is.
-//
-// Execute `rustlings hint primitive_types3` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
fn main() {
- let a = ???
+ // TODO: Create an array called `a` with at least 100 elements in it.
+ // let a = ???
if a.len() >= 100 {
println!("Wow, that's a big array!");
} else {
println!("Meh, I eat arrays like that for breakfast.");
- panic!("Array not big enough, more elements needed")
+ panic!("Array not big enough, more elements needed");
}
}
diff --git a/exercises/04_primitive_types/primitive_types4.rs b/exercises/04_primitive_types/primitive_types4.rs
index d44d877..16e4fd9 100644
--- a/exercises/04_primitive_types/primitive_types4.rs
+++ b/exercises/04_primitive_types/primitive_types4.rs
@@ -1,17 +1,16 @@
-// primitive_types4.rs
-//
-// Get a slice out of Array a where the ??? is so that the test passes.
-//
-// Execute `rustlings hint primitive_types4` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
-fn slice_out_of_array() {
- let a = [1, 2, 3, 4, 5];
-
- let nice_slice = ???
-
- assert_eq!([2, 3, 4], nice_slice)
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn slice_out_of_array() {
+ let a = [1, 2, 3, 4, 5];
+
+ // TODO: Get a slice called `nice_slice` out of the array `a` so that the test passes.
+ // let nice_slice = ???
+
+ assert_eq!([2, 3, 4], nice_slice);
+ }
}
diff --git a/exercises/04_primitive_types/primitive_types5.rs b/exercises/04_primitive_types/primitive_types5.rs
index f646986..6e00ef5 100644
--- a/exercises/04_primitive_types/primitive_types5.rs
+++ b/exercises/04_primitive_types/primitive_types5.rs
@@ -1,15 +1,8 @@
-// primitive_types5.rs
-//
-// Destructure the `cat` tuple so that the println will work.
-//
-// Execute `rustlings hint primitive_types5` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
fn main() {
let cat = ("Furry McFurson", 3.5);
- let /* your pattern here */ = cat;
- println!("{} is {} years old.", name, age);
+ // TODO: Destructure the `cat` tuple in one statement so that the println works.
+ // let /* your pattern here */ = cat;
+
+ println!("{name} is {age} years old");
}
diff --git a/exercises/04_primitive_types/primitive_types6.rs b/exercises/04_primitive_types/primitive_types6.rs
index 07cc46c..a97e531 100644
--- a/exercises/04_primitive_types/primitive_types6.rs
+++ b/exercises/04_primitive_types/primitive_types6.rs
@@ -1,19 +1,17 @@
-// primitive_types6.rs
-//
-// Use a tuple index to access the second element of `numbers`. You can put the
-// expression for the second element where ??? is so that the test passes.
-//
-// Execute `rustlings hint primitive_types6` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
-fn indexing_tuple() {
- let numbers = (1, 2, 3);
- // Replace below ??? with the tuple indexing syntax.
- let second = ???;
-
- assert_eq!(2, second,
- "This is not the 2nd number in the tuple!")
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn indexing_tuple() {
+ let numbers = (1, 2, 3);
+
+ // TODO: Use a tuple index to access the second element of `numbers`
+ // and assign it to a variable called `second`.
+ // let second = ???;
+
+ assert_eq!(second, 2, "This is not the 2nd number in the tuple!");
+ }
}
diff --git a/exercises/05_vecs/vecs1.rs b/exercises/05_vecs/vecs1.rs
index 65b7a7f..68e1aff 100644
--- a/exercises/05_vecs/vecs1.rs
+++ b/exercises/05_vecs/vecs1.rs
@@ -1,21 +1,17 @@
-// vecs1.rs
-//
-// Your task is to create a `Vec` which holds the exact same elements as in the
-// array `a`.
-//
-// Make me compile and pass the test!
-//
-// Execute `rustlings hint vecs1` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
-
fn array_and_vec() -> ([i32; 4], Vec) {
- let a = [10, 20, 30, 40]; // a plain array
- let v = // TODO: declare your vector here with the macro for vectors
+ let a = [10, 20, 30, 40]; // Array
+
+ // TODO: Create a vector called `v` which contains the exact same elements as in the array `a`.
+ // Use the vector macro.
+ // let v = ???;
(a, v)
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -23,6 +19,6 @@ mod tests {
#[test]
fn test_array_and_vec_similarity() {
let (a, v) = array_and_vec();
- assert_eq!(a, v[..]);
+ assert_eq!(a, *v);
}
}
diff --git a/exercises/05_vecs/vecs2.rs b/exercises/05_vecs/vecs2.rs
index e92c970..a9be258 100644
--- a/exercises/05_vecs/vecs2.rs
+++ b/exercises/05_vecs/vecs2.rs
@@ -1,31 +1,36 @@
-// vecs2.rs
-//
-// A Vec of even numbers is given. Your task is to complete the loop so that
-// each number in the Vec is multiplied by 2.
-//
-// Make me pass the test!
-//
-// Execute `rustlings hint vecs2` or use the `hint` watch subcommand for a hint.
+fn vec_loop(input: &[i32]) -> Vec {
+ let mut output = Vec::new();
-// I AM NOT DONE
-
-fn vec_loop(mut v: Vec) -> Vec {
- for element in v.iter_mut() {
- // TODO: Fill this up so that each element in the Vec `v` is
- // multiplied by 2.
- ???
+ for element in input {
+ // TODO: Multiply each element in the `input` slice by 2 and push it to
+ // the `output` vector.
}
- // At this point, `v` should be equal to [4, 8, 12, 16, 20].
- v
+ output
}
-fn vec_map(v: &Vec) -> Vec {
- v.iter().map(|element| {
- // TODO: Do the same thing as above - but instead of mutating the
- // Vec, you can just return the new number!
- ???
- }).collect()
+fn vec_map_example(input: &[i32]) -> Vec {
+ // An example of collecting a vector after mapping.
+ // We map each element of the `input` slice to its value plus 1.
+ // If the input is `[1, 2, 3]`, the output is `[2, 3, 4]`.
+ input.iter().map(|element| element + 1).collect()
+}
+
+fn vec_map(input: &[i32]) -> Vec {
+ // TODO: Here, we also want to multiply each element in the `input` slice
+ // by 2, but with iterator mapping instead of manually pushing into an empty
+ // vector.
+ // See the example in the function `vec_map_example` above.
+ input
+ .iter()
+ .map(|element| {
+ // ???
+ })
+ .collect()
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -34,17 +39,22 @@ mod tests {
#[test]
fn test_vec_loop() {
- let v: Vec = (1..).filter(|x| x % 2 == 0).take(5).collect();
- let ans = vec_loop(v.clone());
+ let input = [2, 4, 6, 8, 10];
+ let ans = vec_loop(&input);
+ assert_eq!(ans, [4, 8, 12, 16, 20]);
+ }
- assert_eq!(ans, v.iter().map(|x| x * 2).collect::>());
+ #[test]
+ fn test_vec_map_example() {
+ let input = [1, 2, 3];
+ let ans = vec_map_example(&input);
+ assert_eq!(ans, [2, 3, 4]);
}
#[test]
fn test_vec_map() {
- let v: Vec = (1..).filter(|x| x % 2 == 0).take(5).collect();
- let ans = vec_map(&v);
-
- assert_eq!(ans, v.iter().map(|x| x * 2).collect::>());
+ let input = [2, 4, 6, 8, 10];
+ let ans = vec_map(&input);
+ assert_eq!(ans, [4, 8, 12, 16, 20]);
}
}
diff --git a/exercises/06_move_semantics/move_semantics1.rs b/exercises/06_move_semantics/move_semantics1.rs
index e063937..4eb3d61 100644
--- a/exercises/06_move_semantics/move_semantics1.rs
+++ b/exercises/06_move_semantics/move_semantics1.rs
@@ -1,19 +1,4 @@
-// move_semantics1.rs
-//
-// Execute `rustlings hint move_semantics1` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
-fn main() {
- let vec0 = vec![22, 44, 66];
-
- let vec1 = fill_vec(vec0);
-
- assert_eq!(vec1, vec![22, 44, 66, 88]);
-}
-
+// TODO: Fix the compiler error in this function.
fn fill_vec(vec: Vec) -> Vec {
let vec = vec;
@@ -21,3 +6,19 @@ fn fill_vec(vec: Vec) -> Vec {
vec
}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn move_semantics1() {
+ let vec0 = vec![22, 44, 66];
+ let vec1 = fill_vec(vec0);
+ assert_eq!(vec1, vec![22, 44, 66, 88]);
+ }
+}
diff --git a/exercises/06_move_semantics/move_semantics2.rs b/exercises/06_move_semantics/move_semantics2.rs
index baf6bcc..a3ab7a0 100644
--- a/exercises/06_move_semantics/move_semantics2.rs
+++ b/exercises/06_move_semantics/move_semantics2.rs
@@ -1,22 +1,3 @@
-// move_semantics2.rs
-//
-// Make the test pass by finding a way to keep both Vecs separate!
-//
-// Execute `rustlings hint move_semantics2` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
-fn main() {
- let vec0 = vec![22, 44, 66];
-
- let mut vec1 = fill_vec(vec0);
-
- assert_eq!(vec0, vec![22, 44, 66]);
- assert_eq!(vec1, vec![22, 44, 66, 88]);
-}
-
fn fill_vec(vec: Vec) -> Vec {
let mut vec = vec;
@@ -24,3 +5,24 @@ fn fill_vec(vec: Vec) -> Vec {
vec
}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ // TODO: Make both vectors `vec0` and `vec1` accessible at the same time to
+ // fix the compiler error in the test.
+ #[test]
+ fn move_semantics2() {
+ let vec0 = vec![22, 44, 66];
+
+ let vec1 = fill_vec(vec0);
+
+ assert_eq!(vec0, [22, 44, 66]);
+ assert_eq!(vec1, [22, 44, 66, 88]);
+ }
+}
diff --git a/exercises/06_move_semantics/move_semantics3.rs b/exercises/06_move_semantics/move_semantics3.rs
index 7af9e69..11dbbbe 100644
--- a/exercises/06_move_semantics/move_semantics3.rs
+++ b/exercises/06_move_semantics/move_semantics3.rs
@@ -1,24 +1,22 @@
-// move_semantics3.rs
-//
-// Make me compile without adding new lines -- just changing existing lines! (no
-// lines with multiple semicolons necessary!)
-//
-// Execute `rustlings hint move_semantics3` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
-fn main() {
- let vec0 = vec![22, 44, 66];
-
- let mut vec1 = fill_vec(vec0);
-
- assert_eq!(vec1, vec![22, 44, 66, 88]);
-}
-
+// TODO: Fix the compiler error in the function without adding any new line.
fn fill_vec(vec: Vec) -> Vec {
vec.push(88);
vec
}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn move_semantics3() {
+ let vec0 = vec![22, 44, 66];
+ let vec1 = fill_vec(vec0);
+ assert_eq!(vec1, [22, 44, 66, 88]);
+ }
+}
diff --git a/exercises/06_move_semantics/move_semantics4.rs b/exercises/06_move_semantics/move_semantics4.rs
index 80b49db..83a0344 100644
--- a/exercises/06_move_semantics/move_semantics4.rs
+++ b/exercises/06_move_semantics/move_semantics4.rs
@@ -1,29 +1,18 @@
-// move_semantics4.rs
-//
-// Refactor this code so that instead of passing `vec0` into the `fill_vec`
-// function, the Vector gets created in the function itself and passed back to
-// the main function.
-//
-// Execute `rustlings hint move_semantics4` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-#[test]
fn main() {
- let vec0 = vec![22, 44, 66];
-
- let mut vec1 = fill_vec(vec0);
-
- assert_eq!(vec1, vec![22, 44, 66, 88]);
+ // You can optionally experiment here.
}
-// `fill_vec()` no longer takes `vec: Vec` as argument - don't change this!
-fn fill_vec() -> Vec {
- // Instead, let's create and fill the Vec in here - how do you do that?
- let mut vec = vec;
-
- vec.push(88);
-
- vec
+#[cfg(test)]
+mod tests {
+ // TODO: Fix the compiler errors only by reordering the lines in the test.
+ // Don't add, change or remove any line.
+ #[test]
+ fn move_semantics4() {
+ let mut x = 100;
+ let y = &mut x;
+ let z = &mut x;
+ *y += 100;
+ *z += 1000;
+ assert_eq!(x, 1200);
+ }
}
diff --git a/exercises/06_move_semantics/move_semantics5.rs b/exercises/06_move_semantics/move_semantics5.rs
index 267bdcc..fc59338 100644
--- a/exercises/06_move_semantics/move_semantics5.rs
+++ b/exercises/06_move_semantics/move_semantics5.rs
@@ -1,19 +1,24 @@
-// move_semantics5.rs
-//
-// Make me compile only by reordering the lines in `main()`, but without adding,
-// changing or removing any of them.
-//
-// Execute `rustlings hint move_semantics5` or use the `hint` watch subcommand
-// for a hint.
+#![allow(clippy::ptr_arg)]
-// I AM NOT DONE
+// TODO: Fix the compiler errors without changing anything except adding or
+// removing references (the character `&`).
-#[test]
fn main() {
- let mut x = 100;
- let y = &mut x;
- let z = &mut x;
- *y += 100;
- *z += 1000;
- assert_eq!(x, 1200);
+ let data = "Rust is great!".to_string();
+
+ get_char(data);
+
+ string_uppercase(&data);
+}
+
+// Shouldn't take ownership
+fn get_char(data: String) -> char {
+ data.chars().last().unwrap()
+}
+
+// Should take ownership
+fn string_uppercase(mut data: &String) {
+ data = data.to_uppercase();
+
+ println!("{data}");
}
diff --git a/exercises/06_move_semantics/move_semantics6.rs b/exercises/06_move_semantics/move_semantics6.rs
deleted file mode 100644
index cace4ca..0000000
--- a/exercises/06_move_semantics/move_semantics6.rs
+++ /dev/null
@@ -1,28 +0,0 @@
-// move_semantics6.rs
-//
-// You can't change anything except adding or removing references.
-//
-// Execute `rustlings hint move_semantics6` or use the `hint` watch subcommand
-// for a hint.
-
-// I AM NOT DONE
-
-fn main() {
- let data = "Rust is great!".to_string();
-
- get_char(data);
-
- string_uppercase(&data);
-}
-
-// Should not take ownership
-fn get_char(data: String) -> char {
- data.chars().last().unwrap()
-}
-
-// Should take ownership
-fn string_uppercase(mut data: &String) {
- data = &data.to_uppercase();
-
- println!("{}", data);
-}
diff --git a/exercises/07_structs/structs1.rs b/exercises/07_structs/structs1.rs
index 5fa5821..959c4c6 100644
--- a/exercises/07_structs/structs1.rs
+++ b/exercises/07_structs/structs1.rs
@@ -1,28 +1,24 @@
-// structs1.rs
-//
-// Address all the TODOs to make the tests pass!
-//
-// Execute `rustlings hint structs1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-struct ColorClassicStruct {
- // TODO: Something goes here
+struct ColorRegularStruct {
+ // TODO: Add the fields that the test `regular_structs` expects.
+ // What types should the fields have? What are the minimum and maximum values for RGB colors?
}
-struct ColorTupleStruct(/* TODO: Something goes here */);
+struct ColorTupleStruct(/* TODO: Add the fields that the test `tuple_structs` expects */);
#[derive(Debug)]
-struct UnitLikeStruct;
+struct UnitStruct;
+
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
use super::*;
#[test]
- fn classic_c_structs() {
- // TODO: Instantiate a classic c struct!
+ fn regular_structs() {
+ // TODO: Instantiate a regular struct.
// let green =
assert_eq!(green.red, 0);
@@ -32,7 +28,7 @@ mod tests {
#[test]
fn tuple_structs() {
- // TODO: Instantiate a tuple struct!
+ // TODO: Instantiate a tuple struct.
// let green =
assert_eq!(green.0, 0);
@@ -42,10 +38,10 @@ mod tests {
#[test]
fn unit_structs() {
- // TODO: Instantiate a unit-like struct!
- // let unit_like_struct =
- let message = format!("{:?}s are fun!", unit_like_struct);
+ // TODO: Instantiate a unit struct.
+ // let unit_struct =
+ let message = format!("{unit_struct:?}s are fun!");
- assert_eq!(message, "UnitLikeStructs are fun!");
+ assert_eq!(message, "UnitStructs are fun!");
}
}
diff --git a/exercises/07_structs/structs2.rs b/exercises/07_structs/structs2.rs
index 328567f..79141af 100644
--- a/exercises/07_structs/structs2.rs
+++ b/exercises/07_structs/structs2.rs
@@ -1,12 +1,3 @@
-// structs2.rs
-//
-// Address all the TODOs to make the tests pass!
-//
-// Execute `rustlings hint structs2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
#[derive(Debug)]
struct Order {
name: String,
@@ -30,6 +21,10 @@ fn create_order_template() -> Order {
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -37,8 +32,10 @@ mod tests {
#[test]
fn your_order() {
let order_template = create_order_template();
+
// TODO: Create your own order using the update syntax and template above!
// let your_order =
+
assert_eq!(your_order.name, "Hacker in Rust");
assert_eq!(your_order.year, order_template.year);
assert_eq!(your_order.made_by_phone, order_template.made_by_phone);
diff --git a/exercises/07_structs/structs3.rs b/exercises/07_structs/structs3.rs
index 7cda5af..93b57fe 100644
--- a/exercises/07_structs/structs3.rs
+++ b/exercises/07_structs/structs3.rs
@@ -1,13 +1,5 @@
-// structs3.rs
-//
// Structs contain data, but can also have logic. In this exercise we have
-// defined the Package struct and we want to test some logic attached to it.
-// Make the code compile and the tests pass!
-//
-// Execute `rustlings hint structs3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// defined the `Package` struct and we want to test some logic attached to it.
#[derive(Debug)]
struct Package {
@@ -17,29 +9,36 @@ struct Package {
}
impl Package {
- fn new(sender_country: String, recipient_country: String, weight_in_grams: u32) -> Package {
+ fn new(sender_country: String, recipient_country: String, weight_in_grams: u32) -> Self {
if weight_in_grams < 10 {
- // This is not how you should handle errors in Rust,
- // but we will learn about error handling later.
- panic!("Can not ship a package with weight below 10 grams.")
- } else {
- Package {
- sender_country,
- recipient_country,
- weight_in_grams,
- }
+ // This isn't how you should handle errors in Rust, but we will
+ // learn about error handling later.
+ panic!("Can't ship a package with weight below 10 grams");
+ }
+
+ Self {
+ sender_country,
+ recipient_country,
+ weight_in_grams,
}
}
- fn is_international(&self) -> ??? {
- // Something goes here...
+ // TODO: Add the correct return type to the function signature.
+ fn is_international(&self) {
+ // TODO: Read the tests that use this method to find out when a package
+ // is considered international.
}
- fn get_fees(&self, cents_per_gram: u32) -> ??? {
- // Something goes here...
+ // TODO: Add the correct return type to the function signature.
+ fn get_fees(&self, cents_per_gram: u32) {
+ // TODO: Calculate the package's fees.
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
diff --git a/exercises/08_enums/enums1.rs b/exercises/08_enums/enums1.rs
index ab87270..c65e641 100644
--- a/exercises/08_enums/enums1.rs
+++ b/exercises/08_enums/enums1.rs
@@ -1,12 +1,6 @@
-// enums1.rs
-//
-// No hints this time! ;)
-
-// I AM NOT DONE
-
#[derive(Debug)]
enum Message {
- // TODO: define a few types of messages as used below
+ // TODO: Define a few types of messages as used below.
}
fn main() {
diff --git a/exercises/08_enums/enums2.rs b/exercises/08_enums/enums2.rs
index 133c779..5a74991 100644
--- a/exercises/08_enums/enums2.rs
+++ b/exercises/08_enums/enums2.rs
@@ -1,13 +1,7 @@
-// enums2.rs
-//
-// Execute `rustlings hint enums2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+#[allow(dead_code)]
#[derive(Debug)]
enum Message {
- // TODO: define the different variants used below
+ // TODO: Define the different variants used below.
}
#[derive(Debug)]
@@ -18,7 +12,7 @@ struct Point {
impl Message {
fn call(&self) {
- println!("{:?}", self);
+ println!("{self:?}");
}
}
diff --git a/exercises/08_enums/enums3.rs b/exercises/08_enums/enums3.rs
index fffb9d0..2d0d82d 100644
--- a/exercises/08_enums/enums3.rs
+++ b/exercises/08_enums/enums3.rs
@@ -1,14 +1,5 @@
-// enums3.rs
-//
-// Address all the TODOs to make the tests pass!
-//
-// Execute `rustlings hint enums3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
enum Message {
- // TODO: implement the message variant types based on their usage below
+ // TODO: Implement the message variant types based on their usage below.
}
struct Point {
@@ -35,25 +26,29 @@ impl State {
}
fn echo(&mut self, s: String) {
- self.message = s
+ self.message = s;
}
- fn resize(&mut self, w: u8, h: u8) {
- self.width = w;
- self.height = h;
+ fn resize(&mut self, width: u8, height: u8) {
+ self.width = width;
+ self.height = height;
}
- fn move_position(&mut self, p: Point) {
- self.position = p;
+ fn move_position(&mut self, point: Point) {
+ self.position = point;
}
fn process(&mut self, message: Message) {
- // TODO: create a match expression to process the different message variants
+ // TODO: Create a match expression to process the different message variants.
// Remember: When passing a tuple as a function argument, you'll need extra parentheses:
- // fn function((t, u, p, l, e))
+ // e.g. `foo((t, u, p, l, e))`
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -66,8 +61,9 @@ mod tests {
height: 0,
position: Point { x: 0, y: 0 },
color: (0, 0, 0),
- message: "hello world".to_string(),
+ message: String::from("hello world"),
};
+
state.process(Message::ChangeColor(255, 0, 255));
state.process(Message::Echo(String::from("Hello world!")));
state.process(Message::Resize { w: 10, h: 30 });
@@ -79,7 +75,7 @@ mod tests {
assert_eq!(state.height, 30);
assert_eq!(state.position.x, 10);
assert_eq!(state.position.y, 15);
- assert_eq!(state.quit, true);
+ assert!(state.quit);
assert_eq!(state.message, "Hello world!");
}
}
diff --git a/exercises/09_strings/strings1.rs b/exercises/09_strings/strings1.rs
index f50e1fa..6abdbb4 100644
--- a/exercises/09_strings/strings1.rs
+++ b/exercises/09_strings/strings1.rs
@@ -1,17 +1,9 @@
-// strings1.rs
-//
-// Make me compile without changing the function signature!
-//
-// Execute `rustlings hint strings1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-fn main() {
- let answer = current_favorite_color();
- println!("My current favorite color is {}", answer);
-}
-
+// TODO: Fix the compiler error without changing the function signature.
fn current_favorite_color() -> String {
"blue"
}
+
+fn main() {
+ let answer = current_favorite_color();
+ println!("My current favorite color is {answer}");
+}
diff --git a/exercises/09_strings/strings2.rs b/exercises/09_strings/strings2.rs
index 4d95d16..93d9cb6 100644
--- a/exercises/09_strings/strings2.rs
+++ b/exercises/09_strings/strings2.rs
@@ -1,21 +1,14 @@
-// strings2.rs
-//
-// Make me compile without changing the function signature!
-//
-// Execute `rustlings hint strings2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// TODO: Fix the compiler error in the `main` function without changing this function.
+fn is_a_color_word(attempt: &str) -> bool {
+ attempt == "green" || attempt == "blue" || attempt == "red"
+}
fn main() {
- let word = String::from("green"); // Try not changing this line :)
+ let word = String::from("green"); // Don't change this line.
+
if is_a_color_word(word) {
println!("That is a color word I know!");
} else {
println!("That is not a color word I know.");
}
}
-
-fn is_a_color_word(attempt: &str) -> bool {
- attempt == "green" || attempt == "blue" || attempt == "red"
-}
diff --git a/exercises/09_strings/strings3.rs b/exercises/09_strings/strings3.rs
index b29f932..39fce18 100644
--- a/exercises/09_strings/strings3.rs
+++ b/exercises/09_strings/strings3.rs
@@ -1,23 +1,17 @@
-// strings3.rs
-//
-// Execute `rustlings hint strings3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-fn trim_me(input: &str) -> String {
- // TODO: Remove whitespace from both ends of a string!
- ???
+fn trim_me(input: &str) -> &str {
+ // TODO: Remove whitespace from both ends of a string.
}
fn compose_me(input: &str) -> String {
- // TODO: Add " world!" to the string! There's multiple ways to do this!
- ???
+ // TODO: Add " world!" to the string! There are multiple ways to do this.
}
fn replace_me(input: &str) -> String {
- // TODO: Replace "cars" in the string with "balloons"!
- ???
+ // TODO: Replace "cars" in the string with "balloons".
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -39,7 +33,13 @@ mod tests {
#[test]
fn replace_a_string() {
- assert_eq!(replace_me("I think cars are cool"), "I think balloons are cool");
- assert_eq!(replace_me("I love to look at cars"), "I love to look at balloons");
+ assert_eq!(
+ replace_me("I think cars are cool"),
+ "I think balloons are cool",
+ );
+ assert_eq!(
+ replace_me("I love to look at cars"),
+ "I love to look at balloons",
+ );
}
}
diff --git a/exercises/09_strings/strings4.rs b/exercises/09_strings/strings4.rs
index e8c54ac..9d9eb48 100644
--- a/exercises/09_strings/strings4.rs
+++ b/exercises/09_strings/strings4.rs
@@ -1,30 +1,36 @@
-// strings4.rs
-//
-// Ok, here are a bunch of values-- some are `String`s, some are `&str`s. Your
-// task is to call one of these two functions on each value depending on what
-// you think each value is. That is, add either `string_slice` or `string`
-// before the parentheses on each line. If you're right, it will compile!
-//
-// No hints this time!
-
-// I AM NOT DONE
+// Calls of this function should be replaced with calls of `string_slice` or `string`.
+fn placeholder() {}
fn string_slice(arg: &str) {
- println!("{}", arg);
+ println!("{arg}");
}
fn string(arg: String) {
- println!("{}", arg);
+ println!("{arg}");
}
+// TODO: Here are a bunch of values - some are `String`, some are `&str`.
+// Your task is to replace `placeholder(…)` with either `string_slice(…)`
+// or `string(…)` depending on what you think each value is.
fn main() {
- ???("blue");
- ???("red".to_string());
- ???(String::from("hi"));
- ???("rust is fun!".to_owned());
- ???("nice weather".into());
- ???(format!("Interpolation {}", "Station"));
- ???(&String::from("abc")[0..1]);
- ???(" hello there ".trim());
- ???("Happy Monday!".to_string().replace("Mon", "Tues"));
- ???("mY sHiFt KeY iS sTiCkY".to_lowercase());
+ placeholder("blue");
+
+ placeholder("red".to_string());
+
+ placeholder(String::from("hi"));
+
+ placeholder("rust is fun!".to_owned());
+
+ placeholder("nice weather".into());
+
+ placeholder(format!("Interpolation {}", "Station"));
+
+ // WARNING: This is byte indexing, not character indexing.
+ // Character indexing can be done using `s.chars().nth(INDEX)`.
+ placeholder(&String::from("abc")[0..1]);
+
+ placeholder(" hello there ".trim());
+
+ placeholder("Happy Monday!".replace("Mon", "Tues"));
+
+ placeholder("mY sHiFt KeY iS sTiCkY".to_lowercase());
}
diff --git a/exercises/10_modules/modules1.rs b/exercises/10_modules/modules1.rs
index 9eb5a48..d97ab23 100644
--- a/exercises/10_modules/modules1.rs
+++ b/exercises/10_modules/modules1.rs
@@ -1,10 +1,4 @@
-// modules1.rs
-//
-// Execute `rustlings hint modules1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Fix the compiler error about calling a private function.
mod sausage_factory {
// Don't let anybody outside of this module see this!
fn get_secret_recipe() -> String {
diff --git a/exercises/10_modules/modules2.rs b/exercises/10_modules/modules2.rs
index 0415454..02eb80a 100644
--- a/exercises/10_modules/modules2.rs
+++ b/exercises/10_modules/modules2.rs
@@ -1,27 +1,20 @@
-// modules2.rs
-//
// You can bring module paths into scopes and provide new names for them with
-// the 'use' and 'as' keywords. Fix these 'use' statements to make the code
-// compile.
-//
-// Execute `rustlings hint modules2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// the `use` and `as` keywords.
+#[allow(dead_code)]
mod delicious_snacks {
- // TODO: Fix these use statements
- use self::fruits::PEAR as ???
- use self::veggies::CUCUMBER as ???
+ // TODO: Add the following two `use` statements after fixing them.
+ // use self::fruits::PEAR as ???;
+ // use self::veggies::CUCUMBER as ???;
mod fruits {
- pub const PEAR: &'static str = "Pear";
- pub const APPLE: &'static str = "Apple";
+ pub const PEAR: &str = "Pear";
+ pub const APPLE: &str = "Apple";
}
mod veggies {
- pub const CUCUMBER: &'static str = "Cucumber";
- pub const CARROT: &'static str = "Carrot";
+ pub const CUCUMBER: &str = "Cucumber";
+ pub const CARROT: &str = "Carrot";
}
}
@@ -29,6 +22,6 @@ fn main() {
println!(
"favorite snacks: {} and {}",
delicious_snacks::fruit,
- delicious_snacks::veggie
+ delicious_snacks::veggie,
);
}
diff --git a/exercises/10_modules/modules3.rs b/exercises/10_modules/modules3.rs
index f2bb050..691608d 100644
--- a/exercises/10_modules/modules3.rs
+++ b/exercises/10_modules/modules3.rs
@@ -1,17 +1,9 @@
-// modules3.rs
-//
-// You can use the 'use' keyword to bring module paths from modules from
-// anywhere and especially from the Rust standard library into your scope. Bring
-// SystemTime and UNIX_EPOCH from the std::time module. Bonus style points if
-// you can do it with one line!
-//
-// Execute `rustlings hint modules3` or use the `hint` watch subcommand for a
-// hint.
+// You can use the `use` keyword to bring module paths from modules from
+// anywhere and especially from the standard library into your scope.
-// I AM NOT DONE
-
-// TODO: Complete this use statement
-use ???
+// TODO: Bring `SystemTime` and `UNIX_EPOCH` from the `std::time` module into
+// your scope. Bonus style points if you can do it with one line!
+// use ???;
fn main() {
match SystemTime::now().duration_since(UNIX_EPOCH) {
diff --git a/exercises/11_hashmaps/hashmaps1.rs b/exercises/11_hashmaps/hashmaps1.rs
index 80829ea..74001d0 100644
--- a/exercises/11_hashmaps/hashmaps1.rs
+++ b/exercises/11_hashmaps/hashmaps1.rs
@@ -1,31 +1,27 @@
-// hashmaps1.rs
-//
// A basket of fruits in the form of a hash map needs to be defined. The key
// represents the name of the fruit and the value represents how many of that
-// particular fruit is in the basket. You have to put at least three different
-// types of fruits (e.g apple, banana, mango) in the basket and the total count
-// of all the fruits should be at least five.
-//
-// Make me compile and pass the tests!
-//
-// Execute `rustlings hint hashmaps1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// particular fruit is in the basket. You have to put at least 3 different
+// types of fruits (e.g. apple, banana, mango) in the basket and the total count
+// of all the fruits should be at least 5.
use std::collections::HashMap;
fn fruit_basket() -> HashMap {
- let mut basket = // TODO: declare your hash map here.
+ // TODO: Declare the hash map.
+ // let mut basket =
// Two bananas are already given for you :)
basket.insert(String::from("banana"), 2);
- // TODO: Put more fruits in your basket here.
+ // TODO: Put more fruits in your basket.
basket
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
diff --git a/exercises/11_hashmaps/hashmaps2.rs b/exercises/11_hashmaps/hashmaps2.rs
index a592569..b3691b6 100644
--- a/exercises/11_hashmaps/hashmaps2.rs
+++ b/exercises/11_hashmaps/hashmaps2.rs
@@ -1,5 +1,3 @@
-// hashmaps2.rs
-//
// We're collecting different fruits to bake a delicious fruit cake. For this,
// we have a basket, which we'll represent in the form of a hash map. The key
// represents the name of each fruit we collect and the value represents how
@@ -8,17 +6,10 @@
// must add fruit to the basket so that there is at least one of each kind and
// more than 11 in total - we have a lot of mouths to feed. You are not allowed
// to insert any more of these fruits!
-//
-// Make me pass the tests!
-//
-// Execute `rustlings hint hashmaps2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
use std::collections::HashMap;
-#[derive(Hash, PartialEq, Eq)]
+#[derive(Hash, PartialEq, Eq, Debug)]
enum Fruit {
Apple,
Banana,
@@ -28,7 +19,7 @@ enum Fruit {
}
fn fruit_basket(basket: &mut HashMap) {
- let fruit_kinds = vec![
+ let fruit_kinds = [
Fruit::Apple,
Fruit::Banana,
Fruit::Mango,
@@ -43,18 +34,18 @@ fn fruit_basket(basket: &mut HashMap) {
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
// Don't modify this function!
fn get_fruit_basket() -> HashMap {
- let mut basket = HashMap::::new();
- basket.insert(Fruit::Apple, 4);
- basket.insert(Fruit::Mango, 2);
- basket.insert(Fruit::Lychee, 5);
-
- basket
+ let content = [(Fruit::Apple, 4), (Fruit::Mango, 2), (Fruit::Lychee, 5)];
+ HashMap::from_iter(content)
}
#[test]
@@ -81,13 +72,25 @@ mod tests {
let count = basket.values().sum::();
assert!(count > 11);
}
-
+
#[test]
fn all_fruit_types_in_basket() {
+ let fruit_kinds = [
+ Fruit::Apple,
+ Fruit::Banana,
+ Fruit::Mango,
+ Fruit::Lychee,
+ Fruit::Pineapple,
+ ];
+
let mut basket = get_fruit_basket();
fruit_basket(&mut basket);
- for amount in basket.values() {
- assert_ne!(amount, &0);
+
+ for fruit_kind in fruit_kinds {
+ let Some(amount) = basket.get(&fruit_kind) else {
+ panic!("Fruit kind {fruit_kind:?} was not found in basket");
+ };
+ assert!(*amount > 0);
}
}
}
diff --git a/exercises/11_hashmaps/hashmaps3.rs b/exercises/11_hashmaps/hashmaps3.rs
index 08e977c..9f8fdd7 100644
--- a/exercises/11_hashmaps/hashmaps3.rs
+++ b/exercises/11_hashmaps/hashmaps3.rs
@@ -1,86 +1,77 @@
-// hashmaps3.rs
-//
// A list of scores (one per line) of a soccer match is given. Each line is of
-// the form : ",,,"
-// Example: England,France,4,2 (England scored 4 goals, France 2).
+// the form ",,,"
+// Example: "England,France,4,2" (England scored 4 goals, France 2).
//
-// You have to build a scores table containing the name of the team, goals the
-// team scored, and goals the team conceded. One approach to build the scores
-// table is to use a Hashmap. The solution is partially written to use a
-// Hashmap, complete it to pass the test.
-//
-// Make me pass the tests!
-//
-// Execute `rustlings hint hashmaps3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// You have to build a scores table containing the name of the team, the total
+// number of goals the team scored, and the total number of goals the team
+// conceded.
use std::collections::HashMap;
// A structure to store the goal details of a team.
+#[derive(Default)]
struct Team {
goals_scored: u8,
goals_conceded: u8,
}
-fn build_scores_table(results: String) -> HashMap {
+fn build_scores_table(results: &str) -> HashMap<&str, Team> {
// The name of the team is the key and its associated struct is the value.
- let mut scores: HashMap = HashMap::new();
+ let mut scores = HashMap::new();
- for r in results.lines() {
- let v: Vec<&str> = r.split(',').collect();
- let team_1_name = v[0].to_string();
- let team_1_score: u8 = v[2].parse().unwrap();
- let team_2_name = v[1].to_string();
- let team_2_score: u8 = v[3].parse().unwrap();
- // TODO: Populate the scores table with details extracted from the
- // current line. Keep in mind that goals scored by team_1
- // will be the number of goals conceded from team_2, and similarly
- // goals scored by team_2 will be the number of goals conceded by
- // team_1.
+ for line in results.lines() {
+ let mut split_iterator = line.split(',');
+ // NOTE: We use `unwrap` because we didn't deal with error handling yet.
+ let team_1_name = split_iterator.next().unwrap();
+ let team_2_name = split_iterator.next().unwrap();
+ let team_1_score: u8 = split_iterator.next().unwrap().parse().unwrap();
+ let team_2_score: u8 = split_iterator.next().unwrap().parse().unwrap();
+
+ // TODO: Populate the scores table with the extracted details.
+ // Keep in mind that goals scored by team 1 will be the number of goals
+ // conceded by team 2. Similarly, goals scored by team 2 will be the
+ // number of goals conceded by team 1.
}
+
scores
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
- fn get_results() -> String {
- let results = "".to_string()
- + "England,France,4,2\n"
- + "France,Italy,3,1\n"
- + "Poland,Spain,2,0\n"
- + "Germany,England,2,1\n";
- results
- }
+ const RESULTS: &str = "England,France,4,2
+France,Italy,3,1
+Poland,Spain,2,0
+Germany,England,2,1
+England,Spain,1,0";
#[test]
fn build_scores() {
- let scores = build_scores_table(get_results());
+ let scores = build_scores_table(RESULTS);
- let mut keys: Vec<&String> = scores.keys().collect();
- keys.sort();
- assert_eq!(
- keys,
- vec!["England", "France", "Germany", "Italy", "Poland", "Spain"]
- );
+ assert!(["England", "France", "Germany", "Italy", "Poland", "Spain"]
+ .into_iter()
+ .all(|team_name| scores.contains_key(team_name)));
}
#[test]
fn validate_team_score_1() {
- let scores = build_scores_table(get_results());
+ let scores = build_scores_table(RESULTS);
let team = scores.get("England").unwrap();
- assert_eq!(team.goals_scored, 5);
+ assert_eq!(team.goals_scored, 6);
assert_eq!(team.goals_conceded, 4);
}
#[test]
fn validate_team_score_2() {
- let scores = build_scores_table(get_results());
+ let scores = build_scores_table(RESULTS);
let team = scores.get("Spain").unwrap();
assert_eq!(team.goals_scored, 0);
- assert_eq!(team.goals_conceded, 2);
+ assert_eq!(team.goals_conceded, 3);
}
}
diff --git a/exercises/12_options/options1.rs b/exercises/12_options/options1.rs
index e131b48..9964807 100644
--- a/exercises/12_options/options1.rs
+++ b/exercises/12_options/options1.rs
@@ -1,19 +1,13 @@
-// options1.rs
-//
-// Execute `rustlings hint options1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
// This function returns how much icecream there is left in the fridge.
-// If it's before 10PM, there's 5 pieces left. At 10PM, someone eats them
-// all, so there'll be no more left :(
-fn maybe_icecream(time_of_day: u16) -> Option {
- // We use the 24-hour system here, so 10PM is a value of 22 and 12AM is a
- // value of 0 The Option output should gracefully handle cases where
- // time_of_day > 23.
- // TODO: Complete the function body - remember to return an Option!
- ???
+// If it's before 22:00 (24-hour system), then 5 scoops are left. At 22:00,
+// someone eats it all, so no icecream is left (value 0). Return `None` if
+// `hour_of_day` is higher than 23.
+fn maybe_icecream(hour_of_day: u16) -> Option {
+ // TODO: Complete the function body.
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -21,19 +15,22 @@ mod tests {
use super::*;
#[test]
- fn check_icecream() {
- assert_eq!(maybe_icecream(9), Some(5));
- assert_eq!(maybe_icecream(10), Some(5));
- assert_eq!(maybe_icecream(23), Some(0));
- assert_eq!(maybe_icecream(22), Some(0));
- assert_eq!(maybe_icecream(25), None);
+ fn raw_value() {
+ // TODO: Fix this test. How do you get the value contained in the
+ // Option?
+ let icecreams = maybe_icecream(12);
+
+ assert_eq!(icecreams, 5); // Don't change this line.
}
#[test]
- fn raw_value() {
- // TODO: Fix this test. How do you get at the value contained in the
- // Option?
- let icecreams = maybe_icecream(12);
- assert_eq!(icecreams, 5);
+ fn check_icecream() {
+ assert_eq!(maybe_icecream(0), Some(5));
+ assert_eq!(maybe_icecream(9), Some(5));
+ assert_eq!(maybe_icecream(18), Some(5));
+ assert_eq!(maybe_icecream(22), Some(0));
+ assert_eq!(maybe_icecream(23), Some(0));
+ assert_eq!(maybe_icecream(24), None);
+ assert_eq!(maybe_icecream(25), None);
}
}
diff --git a/exercises/12_options/options2.rs b/exercises/12_options/options2.rs
index 4d998e7..07c27c6 100644
--- a/exercises/12_options/options2.rs
+++ b/exercises/12_options/options2.rs
@@ -1,9 +1,6 @@
-// options2.rs
-//
-// Execute `rustlings hint options2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
@@ -12,7 +9,7 @@ mod tests {
let target = "rustlings";
let optional_target = Some(target);
- // TODO: Make this an if let statement whose value is "Some" type
+ // TODO: Make this an if-let statement whose value is `Some`.
word = optional_target {
assert_eq!(word, target);
}
@@ -23,15 +20,15 @@ mod tests {
let range = 10;
let mut optional_integers: Vec> = vec![None];
- for i in 1..(range + 1) {
+ for i in 1..=range {
optional_integers.push(Some(i));
}
let mut cursor = range;
- // TODO: make this a while let statement - remember that vector.pop also
- // adds another layer of Option. You can stack `Option`s into
- // while let and if let.
+ // TODO: Make this a while-let statement. Remember that `Vec::pop()`
+ // adds another layer of `Option`. You can do nested pattern matching
+ // in if-let and while-let statements.
integer = optional_integers.pop() {
assert_eq!(integer, cursor);
cursor -= 1;
diff --git a/exercises/12_options/options3.rs b/exercises/12_options/options3.rs
index 23c15ea..4cedb51 100644
--- a/exercises/12_options/options3.rs
+++ b/exercises/12_options/options3.rs
@@ -1,21 +1,17 @@
-// options3.rs
-//
-// Execute `rustlings hint options3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+#[derive(Debug)]
struct Point {
x: i32,
y: i32,
}
fn main() {
- let y: Option = Some(Point { x: 100, y: 200 });
+ let optional_point = Some(Point { x: 100, y: 200 });
- match y {
- Some(p) => println!("Co-ordinates are {},{} ", p.x, p.y),
- _ => panic!("no match!"),
+ // TODO: Fix the compiler error by adding something to this match statement.
+ match optional_point {
+ Some(p) => println!("Co-ordinates are {},{}", p.x, p.y),
+ _ => panic!("No match!"),
}
- y; // Fix without deleting this line.
+
+ println!("{optional_point:?}"); // Don't change this line.
}
diff --git a/exercises/13_error_handling/errors1.rs b/exercises/13_error_handling/errors1.rs
index 0ba59a5..ec7cb3c 100644
--- a/exercises/13_error_handling/errors1.rs
+++ b/exercises/13_error_handling/errors1.rs
@@ -1,25 +1,22 @@
-// errors1.rs
-//
-// This function refuses to generate text to be printed on a nametag if you pass
-// it an empty string. It'd be nicer if it explained what the problem was,
-// instead of just sometimes returning `None`. Thankfully, Rust has a similar
-// construct to `Option` that can be used to express error conditions. Let's use
-// it!
-//
-// Execute `rustlings hint errors1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-pub fn generate_nametag_text(name: String) -> Option {
+// TODO: This function refuses to generate text to be printed on a nametag if
+// you pass it an empty string. It'd be nicer if it explained what the problem
+// was instead of just returning `None`. Thankfully, Rust has a similar
+// construct to `Option` that can be used to express error conditions. Change
+// the function signature and body to return `Result` instead
+// of `Option`.
+fn generate_nametag_text(name: String) -> Option {
if name.is_empty() {
// Empty names aren't allowed.
None
} else {
- Some(format!("Hi! My name is {}", name))
+ Some(format!("Hi! My name is {name}"))
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -27,17 +24,18 @@ mod tests {
#[test]
fn generates_nametag_text_for_a_nonempty_name() {
assert_eq!(
- generate_nametag_text("Beyoncé".into()),
- Ok("Hi! My name is Beyoncé".into())
+ generate_nametag_text("Beyoncé".to_string()).as_deref(),
+ Ok("Hi! My name is Beyoncé"),
);
}
#[test]
fn explains_why_generating_nametag_text_fails() {
assert_eq!(
- generate_nametag_text("".into()),
- // Don't change this line
- Err("`name` was empty; it must be nonempty.".into())
+ generate_nametag_text(String::new())
+ .as_ref()
+ .map_err(|e| e.as_str()),
+ Err("Empty names aren't allowed"),
);
}
}
diff --git a/exercises/13_error_handling/errors2.rs b/exercises/13_error_handling/errors2.rs
index 631fe67..defe359 100644
--- a/exercises/13_error_handling/errors2.rs
+++ b/exercises/13_error_handling/errors2.rs
@@ -1,39 +1,39 @@
-// errors2.rs
-//
// Say we're writing a game where you can buy items with tokens. All items cost
// 5 tokens, and whenever you purchase items there is a processing fee of 1
// token. A player of the game will type in how many items they want to buy, and
// the `total_cost` function will calculate the total cost of the items. Since
-// the player typed in the quantity, though, we get it as a string-- and they
-// might have typed anything, not just numbers!
+// the player typed in the quantity, we get it as a string. They might have
+// typed anything, not just numbers!
//
-// Right now, this function isn't handling the error case at all (and isn't
-// handling the success case properly either). What we want to do is: if we call
-// the `total_cost` function on a string that is not a number, that function
-// will return a `ParseIntError`, and in that case, we want to immediately
-// return that error from our function and not try to multiply and add.
+// Right now, this function isn't handling the error case at all. What we want
+// to do is: If we call the `total_cost` function on a string that is not a
+// number, that function will return a `ParseIntError`. In that case, we want to
+// immediately return that error from our function and not try to multiply and
+// add.
//
-// There are at least two ways to implement this that are both correct-- but one
+// There are at least two ways to implement this that are both correct. But one
// is a lot shorter!
-//
-// Execute `rustlings hint errors2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
use std::num::ParseIntError;
-pub fn total_cost(item_quantity: &str) -> Result {
+fn total_cost(item_quantity: &str) -> Result {
let processing_fee = 1;
let cost_per_item = 5;
+
+ // TODO: Handle the error case as described above.
let qty = item_quantity.parse::();
Ok(qty * cost_per_item + processing_fee)
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
+ use std::num::IntErrorKind;
#[test]
fn item_quantity_is_a_valid_number() {
@@ -43,8 +43,8 @@ mod tests {
#[test]
fn item_quantity_is_an_invalid_number() {
assert_eq!(
- total_cost("beep boop").unwrap_err().to_string(),
- "invalid digit found in string"
+ total_cost("beep boop").unwrap_err().kind(),
+ &IntErrorKind::InvalidDigit,
);
}
}
diff --git a/exercises/13_error_handling/errors3.rs b/exercises/13_error_handling/errors3.rs
index d42d3b1..33a7b87 100644
--- a/exercises/13_error_handling/errors3.rs
+++ b/exercises/13_error_handling/errors3.rs
@@ -1,16 +1,20 @@
-// errors3.rs
-//
// This is a program that is trying to use a completed version of the
// `total_cost` function from the previous exercise. It's not working though!
// Why not? What should we do to fix it?
-//
-// Execute `rustlings hint errors3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
use std::num::ParseIntError;
+// Don't change this function.
+fn total_cost(item_quantity: &str) -> Result {
+ let processing_fee = 1;
+ let cost_per_item = 5;
+ let qty = item_quantity.parse::()?;
+
+ Ok(qty * cost_per_item + processing_fee)
+}
+
+// TODO: Fix the compiler error by changing the signature and body of the
+// `main` function.
fn main() {
let mut tokens = 100;
let pretend_user_input = "8";
@@ -21,14 +25,6 @@ fn main() {
println!("You can't afford that many!");
} else {
tokens -= cost;
- println!("You now have {} tokens.", tokens);
+ println!("You now have {tokens} tokens.");
}
}
-
-pub fn total_cost(item_quantity: &str) -> Result {
- let processing_fee = 1;
- let cost_per_item = 5;
- let qty = item_quantity.parse::()?;
-
- Ok(qty * cost_per_item + processing_fee)
-}
diff --git a/exercises/13_error_handling/errors4.rs b/exercises/13_error_handling/errors4.rs
index d6d6fcb..e41d594 100644
--- a/exercises/13_error_handling/errors4.rs
+++ b/exercises/13_error_handling/errors4.rs
@@ -1,12 +1,4 @@
-// errors4.rs
-//
-// Execute `rustlings hint errors4` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-#[derive(PartialEq, Debug)]
-struct PositiveNonzeroInteger(u64);
+#![allow(clippy::comparison_chain)]
#[derive(PartialEq, Debug)]
enum CreationError {
@@ -14,19 +6,34 @@ enum CreationError {
Zero,
}
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
impl PositiveNonzeroInteger {
- fn new(value: i64) -> Result {
- // Hmm... Why is this always returning an Ok value?
- Ok(PositiveNonzeroInteger(value as u64))
+ fn new(value: i64) -> Result {
+ // TODO: This function shouldn't always return an `Ok`.
+ Ok(Self(value as u64))
}
}
-#[test]
-fn test_creation() {
- assert!(PositiveNonzeroInteger::new(10).is_ok());
- assert_eq!(
- Err(CreationError::Negative),
- PositiveNonzeroInteger::new(-10)
- );
- assert_eq!(Err(CreationError::Zero), PositiveNonzeroInteger::new(0));
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_creation() {
+ assert_eq!(
+ PositiveNonzeroInteger::new(10),
+ Ok(PositiveNonzeroInteger(10)),
+ );
+ assert_eq!(
+ PositiveNonzeroInteger::new(-10),
+ Err(CreationError::Negative),
+ );
+ assert_eq!(PositiveNonzeroInteger::new(0), Err(CreationError::Zero));
+ }
}
diff --git a/exercises/13_error_handling/errors5.rs b/exercises/13_error_handling/errors5.rs
index 92461a7..d0044db 100644
--- a/exercises/13_error_handling/errors5.rs
+++ b/exercises/13_error_handling/errors5.rs
@@ -1,45 +1,18 @@
-// errors5.rs
-//
-// This program uses an altered version of the code from errors4.
-//
-// This exercise uses some concepts that we won't get to until later in the
-// course, like `Box` and the `From` trait. It's not important to understand
-// them in detail right now, but you can read ahead if you like. For now, think
-// of the `Box` type as an "I want anything that does ???" type, which,
-// given Rust's usual standards for runtime safety, should strike you as
-// somewhat lenient!
+// This exercise is an altered version of the `errors4` exercise. It uses some
+// concepts that we won't get to until later in the course, like `Box` and the
+// `From` trait. It's not important to understand them in detail right now, but
+// you can read ahead if you like. For now, think of the `Box` type as
+// an "I want anything that does ???" type.
//
// In short, this particular use case for boxes is for when you want to own a
// value and you care only that it is a type which implements a particular
-// trait. To do so, The Box is declared as of type Box where Trait is
-// the trait the compiler looks for on any value used in that context. For this
-// exercise, that context is the potential errors which can be returned in a
-// Result.
-//
-// What can we use to describe both errors? In other words, is there a trait
-// which both errors implement?
-//
-// Execute `rustlings hint errors5` or use the `hint` watch subcommand for a
-// hint.
+// trait. To do so, The `Box` is declared as of type `Box` where
+// `Trait` is the trait the compiler looks for on any value used in that
+// context. For this exercise, that context is the potential errors which
+// can be returned in a `Result`.
-// I AM NOT DONE
-
-use std::error;
+use std::error::Error;
use std::fmt;
-use std::num::ParseIntError;
-
-// TODO: update the return type of `main()` to make this compile.
-fn main() -> Result<(), Box> {
- let pretend_user_input = "42";
- let x: i64 = pretend_user_input.parse()?;
- println!("output={:?}", PositiveNonzeroInteger::new(x)?);
- Ok(())
-}
-
-// Don't change anything below this line.
-
-#[derive(PartialEq, Debug)]
-struct PositiveNonzeroInteger(u64);
#[derive(PartialEq, Debug)]
enum CreationError {
@@ -47,17 +20,7 @@ enum CreationError {
Zero,
}
-impl PositiveNonzeroInteger {
- fn new(value: i64) -> Result {
- match value {
- x if x < 0 => Err(CreationError::Negative),
- x if x == 0 => Err(CreationError::Zero),
- x => Ok(PositiveNonzeroInteger(x as u64)),
- }
- }
-}
-
-// This is required so that `CreationError` can implement `error::Error`.
+// This is required so that `CreationError` can implement `Error`.
impl fmt::Display for CreationError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let description = match *self {
@@ -68,4 +31,26 @@ impl fmt::Display for CreationError {
}
}
-impl error::Error for CreationError {}
+impl Error for CreationError {}
+
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
+impl PositiveNonzeroInteger {
+ fn new(value: i64) -> Result {
+ match value {
+ 0 => Err(CreationError::Zero),
+ x if x < 0 => Err(CreationError::Negative),
+ x => Ok(PositiveNonzeroInteger(x as u64)),
+ }
+ }
+}
+
+// TODO: Add the correct return type `Result<(), Box>`. What can we
+// use to describe both errors? Is there a trait which both errors implement?
+fn main() {
+ let pretend_user_input = "42";
+ let x: i64 = pretend_user_input.parse()?;
+ println!("output={:?}", PositiveNonzeroInteger::new(x)?);
+ Ok(())
+}
diff --git a/exercises/13_error_handling/errors6.rs b/exercises/13_error_handling/errors6.rs
index aaf0948..b656c61 100644
--- a/exercises/13_error_handling/errors6.rs
+++ b/exercises/13_error_handling/errors6.rs
@@ -1,59 +1,55 @@
-// errors6.rs
-//
-// Using catch-all error types like `Box` isn't recommended
-// for library code, where callers might want to make decisions based on the
-// error content, instead of printing it out or propagating it further. Here, we
-// define a custom error type to make it possible for callers to decide what to
-// do next when our function returns an error.
-//
-// Execute `rustlings hint errors6` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// Using catch-all error types like `Box` isn't recommended for
+// library code where callers might want to make decisions based on the error
+// content instead of printing it out or propagating it further. Here, we define
+// a custom error type to make it possible for callers to decide what to do next
+// when our function returns an error.
use std::num::ParseIntError;
-// This is a custom error type that we will be using in `parse_pos_nonzero()`.
-#[derive(PartialEq, Debug)]
-enum ParsePosNonzeroError {
- Creation(CreationError),
- ParseInt(ParseIntError),
-}
-
-impl ParsePosNonzeroError {
- fn from_creation(err: CreationError) -> ParsePosNonzeroError {
- ParsePosNonzeroError::Creation(err)
- }
- // TODO: add another error conversion function here.
- // fn from_parseint...
-}
-
-fn parse_pos_nonzero(s: &str) -> Result {
- // TODO: change this to return an appropriate error instead of panicking
- // when `parse()` returns an error.
- let x: i64 = s.parse().unwrap();
- PositiveNonzeroInteger::new(x).map_err(ParsePosNonzeroError::from_creation)
-}
-
-// Don't change anything below this line.
-
-#[derive(PartialEq, Debug)]
-struct PositiveNonzeroInteger(u64);
-
#[derive(PartialEq, Debug)]
enum CreationError {
Negative,
Zero,
}
+// A custom error type that we will be using in `PositiveNonzeroInteger::parse`.
+#[derive(PartialEq, Debug)]
+enum ParsePosNonzeroError {
+ Creation(CreationError),
+ ParseInt(ParseIntError),
+}
+
+impl ParsePosNonzeroError {
+ fn from_creation(err: CreationError) -> Self {
+ Self::Creation(err)
+ }
+
+ // TODO: Add another error conversion function here.
+ // fn from_parseint(???) -> Self { ??? }
+}
+
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
impl PositiveNonzeroInteger {
- fn new(value: i64) -> Result {
+ fn new(value: i64) -> Result {
match value {
x if x < 0 => Err(CreationError::Negative),
- x if x == 0 => Err(CreationError::Zero),
- x => Ok(PositiveNonzeroInteger(x as u64)),
+ 0 => Err(CreationError::Zero),
+ x => Ok(Self(x as u64)),
}
}
+
+ fn parse(s: &str) -> Result {
+ // TODO: change this to return an appropriate error instead of panicking
+ // when `parse()` returns an error.
+ let x: i64 = s.parse().unwrap();
+ Self::new(x).map_err(ParsePosNonzeroError::from_creation)
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -62,33 +58,32 @@ mod test {
#[test]
fn test_parse_error() {
- // We can't construct a ParseIntError, so we have to pattern match.
assert!(matches!(
- parse_pos_nonzero("not a number"),
- Err(ParsePosNonzeroError::ParseInt(_))
+ PositiveNonzeroInteger::parse("not a number"),
+ Err(ParsePosNonzeroError::ParseInt(_)),
));
}
#[test]
fn test_negative() {
assert_eq!(
- parse_pos_nonzero("-555"),
- Err(ParsePosNonzeroError::Creation(CreationError::Negative))
+ PositiveNonzeroInteger::parse("-555"),
+ Err(ParsePosNonzeroError::Creation(CreationError::Negative)),
);
}
#[test]
fn test_zero() {
assert_eq!(
- parse_pos_nonzero("0"),
- Err(ParsePosNonzeroError::Creation(CreationError::Zero))
+ PositiveNonzeroInteger::parse("0"),
+ Err(ParsePosNonzeroError::Creation(CreationError::Zero)),
);
}
#[test]
fn test_positive() {
- let x = PositiveNonzeroInteger::new(42);
- assert!(x.is_ok());
- assert_eq!(parse_pos_nonzero("42"), Ok(x.unwrap()));
+ let x = PositiveNonzeroInteger::new(42).unwrap();
+ assert_eq!(x.0, 42);
+ assert_eq!(PositiveNonzeroInteger::parse("42"), Ok(x));
}
}
diff --git a/exercises/14_generics/README.md b/exercises/14_generics/README.md
index de46d50..72cff3f 100644
--- a/exercises/14_generics/README.md
+++ b/exercises/14_generics/README.md
@@ -1,7 +1,7 @@
# Generics
Generics is the topic of generalizing types and functionalities to broader cases.
-This is extremely useful for reducing code duplication in many ways, but can call for rather involving syntax.
+This is extremely useful for reducing code duplication in many ways, but can call for some rather involved syntax.
Namely, being generic requires taking great care to specify over which types a generic type is actually considered valid.
The simplest and most common use of generics is for type parameters.
diff --git a/exercises/14_generics/generics1.rs b/exercises/14_generics/generics1.rs
index 35c1d2f..87ed990 100644
--- a/exercises/14_generics/generics1.rs
+++ b/exercises/14_generics/generics1.rs
@@ -1,14 +1,18 @@
-// generics1.rs
-//
-// This shopping list program isn't compiling! Use your knowledge of generics to
-// fix it.
-//
-// Execute `rustlings hint generics1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// `Vec` is generic over the type `T`. In most cases, the compiler is able to
+// infer `T`, for example after pushing a value with a concrete type to the vector.
+// But in this exercise, the compiler needs some help through a type annotation.
fn main() {
- let mut shopping_list: Vec = Vec::new();
- shopping_list.push("milk");
+ // TODO: Fix the compiler error by annotating the type of the vector
+ // `Vec`. Choose `T` as some integer type that can be created from
+ // `u8` and `i8`.
+ let mut numbers = Vec::new();
+
+ // Don't change the lines below.
+ let n1: u8 = 42;
+ numbers.push(n1.into());
+ let n2: i8 = -1;
+ numbers.push(n2.into());
+
+ println!("{numbers:?}");
}
diff --git a/exercises/14_generics/generics2.rs b/exercises/14_generics/generics2.rs
index 074cd93..8908725 100644
--- a/exercises/14_generics/generics2.rs
+++ b/exercises/14_generics/generics2.rs
@@ -1,23 +1,20 @@
-// generics2.rs
-//
// This powerful wrapper provides the ability to store a positive integer value.
-// Rewrite it using generics so that it supports wrapping ANY type.
-//
-// Execute `rustlings hint generics2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Rewrite it using a generic so that it supports wrapping ANY type.
struct Wrapper {
value: u32,
}
+// TODO: Adapt the struct's implementation to be generic over the wrapped value.
impl Wrapper {
- pub fn new(value: u32) -> Self {
+ fn new(value: u32) -> Self {
Wrapper { value }
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
diff --git a/exercises/15_traits/traits1.rs b/exercises/15_traits/traits1.rs
index 37dfcbf..85be17e 100644
--- a/exercises/15_traits/traits1.rs
+++ b/exercises/15_traits/traits1.rs
@@ -1,26 +1,17 @@
-// traits1.rs
-//
-// Time to implement some traits! Your task is to implement the trait
-// `AppendBar` for the type `String`. The trait AppendBar has only one function,
-// which appends "Bar" to any object implementing this trait.
-//
-// Execute `rustlings hint traits1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// The trait `AppendBar` has only one function which appends "Bar" to any object
+// implementing this trait.
trait AppendBar {
fn append_bar(self) -> Self;
}
impl AppendBar for String {
- // TODO: Implement `AppendBar` for type `String`.
+ // TODO: Implement `AppendBar` for the type `String`.
}
fn main() {
let s = String::from("Foo");
let s = s.append_bar();
- println!("s: {}", s);
+ println!("s: {s}");
}
#[cfg(test)]
@@ -29,14 +20,11 @@ mod tests {
#[test]
fn is_foo_bar() {
- assert_eq!(String::from("Foo").append_bar(), String::from("FooBar"));
+ assert_eq!(String::from("Foo").append_bar(), "FooBar");
}
#[test]
fn is_bar_bar() {
- assert_eq!(
- String::from("").append_bar().append_bar(),
- String::from("BarBar")
- );
+ assert_eq!(String::from("").append_bar().append_bar(), "BarBar");
}
}
diff --git a/exercises/15_traits/traits2.rs b/exercises/15_traits/traits2.rs
index 3e35f8e..d724dc2 100644
--- a/exercises/15_traits/traits2.rs
+++ b/exercises/15_traits/traits2.rs
@@ -1,20 +1,13 @@
-// traits2.rs
-//
-// Your task is to implement the trait `AppendBar` for a vector of strings. To
-// implement this trait, consider for a moment what it means to 'append "Bar"'
-// to a vector of strings.
-//
-// No boiler plate code this time, you can do this!
-//
-// Execute `rustlings hint traits2` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
-
trait AppendBar {
fn append_bar(self) -> Self;
}
-// TODO: Implement trait `AppendBar` for a vector of strings.
+// TODO: Implement the trait `AppendBar` for a vector of strings.
+// `append_bar` should push the string "Bar" into the vector.
+
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
@@ -23,7 +16,7 @@ mod tests {
#[test]
fn is_vec_pop_eq_bar() {
let mut foo = vec![String::from("Foo")].append_bar();
- assert_eq!(foo.pop().unwrap(), String::from("Bar"));
- assert_eq!(foo.pop().unwrap(), String::from("Foo"));
+ assert_eq!(foo.pop().unwrap(), "Bar");
+ assert_eq!(foo.pop().unwrap(), "Foo");
}
}
diff --git a/exercises/15_traits/traits3.rs b/exercises/15_traits/traits3.rs
index 4e2b06b..2e8969e 100644
--- a/exercises/15_traits/traits3.rs
+++ b/exercises/15_traits/traits3.rs
@@ -1,16 +1,10 @@
-// traits3.rs
-//
-// Your task is to implement the Licensed trait for both structures and have
-// them return the same information without writing the same function twice.
-//
-// Consider what you can add to the Licensed trait.
-//
-// Execute `rustlings hint traits3` or use the `hint` watch subcommand for a
-// hint.
+#![allow(dead_code)]
-// I AM NOT DONE
-
-pub trait Licensed {
+trait Licensed {
+ // TODO: Add a default implementation for `licensing_info` so that
+ // implementors like the two structs below can share that default behavior
+ // without repeating the function.
+ // The default license information should be the string "Default license".
fn licensing_info(&self) -> String;
}
@@ -22,8 +16,12 @@ struct OtherSoftware {
version_number: String,
}
-impl Licensed for SomeSoftware {} // Don't edit this line
-impl Licensed for OtherSoftware {} // Don't edit this line
+impl Licensed for SomeSoftware {} // Don't edit this line.
+impl Licensed for OtherSoftware {} // Don't edit this line.
+
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
@@ -31,7 +29,7 @@ mod tests {
#[test]
fn is_licensing_info_the_same() {
- let licensing_info = String::from("Some information");
+ let licensing_info = "Default license";
let some_software = SomeSoftware { version_number: 1 };
let other_software = OtherSoftware {
version_number: "v2.0.0".to_string(),
diff --git a/exercises/15_traits/traits4.rs b/exercises/15_traits/traits4.rs
index 4bda3e5..80092a6 100644
--- a/exercises/15_traits/traits4.rs
+++ b/exercises/15_traits/traits4.rs
@@ -1,30 +1,22 @@
-// traits4.rs
-//
-// Your task is to replace the '??' sections so the code compiles.
-//
-// Don't change any line other than the marked one.
-//
-// Execute `rustlings hint traits4` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-pub trait Licensed {
+trait Licensed {
fn licensing_info(&self) -> String {
- "some information".to_string()
+ "Default license".to_string()
}
}
-struct SomeSoftware {}
-
-struct OtherSoftware {}
+struct SomeSoftware;
+struct OtherSoftware;
impl Licensed for SomeSoftware {}
impl Licensed for OtherSoftware {}
-// YOU MAY ONLY CHANGE THE NEXT LINE
-fn compare_license_types(software: ??, software_two: ??) -> bool {
- software.licensing_info() == software_two.licensing_info()
+// TODO: Fix the compiler error by only changing the signature of this function.
+fn compare_license_types(software1: ???, software2: ???) -> bool {
+ software1.licensing_info() == software2.licensing_info()
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -33,17 +25,11 @@ mod tests {
#[test]
fn compare_license_information() {
- let some_software = SomeSoftware {};
- let other_software = OtherSoftware {};
-
- assert!(compare_license_types(some_software, other_software));
+ assert!(compare_license_types(SomeSoftware, OtherSoftware));
}
#[test]
fn compare_license_information_backwards() {
- let some_software = SomeSoftware {};
- let other_software = OtherSoftware {};
-
- assert!(compare_license_types(other_software, some_software));
+ assert!(compare_license_types(OtherSoftware, SomeSoftware));
}
}
diff --git a/exercises/15_traits/traits5.rs b/exercises/15_traits/traits5.rs
index df18380..5b356ac 100644
--- a/exercises/15_traits/traits5.rs
+++ b/exercises/15_traits/traits5.rs
@@ -1,40 +1,39 @@
-// traits5.rs
-//
-// Your task is to replace the '??' sections so the code compiles.
-//
-// Don't change any line other than the marked one.
-//
-// Execute `rustlings hint traits5` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-pub trait SomeTrait {
+trait SomeTrait {
fn some_function(&self) -> bool {
true
}
}
-pub trait OtherTrait {
+trait OtherTrait {
fn other_function(&self) -> bool {
true
}
}
-struct SomeStruct {}
-struct OtherStruct {}
-
+struct SomeStruct;
impl SomeTrait for SomeStruct {}
impl OtherTrait for SomeStruct {}
+
+struct OtherStruct;
impl SomeTrait for OtherStruct {}
impl OtherTrait for OtherStruct {}
-// YOU MAY ONLY CHANGE THE NEXT LINE
-fn some_func(item: ??) -> bool {
+// TODO: Fix the compiler error by only changing the signature of this function.
+fn some_func(item: ???) -> bool {
item.some_function() && item.other_function()
}
fn main() {
- some_func(SomeStruct {});
- some_func(OtherStruct {});
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_some_func() {
+ assert!(some_func(SomeStruct));
+ assert!(some_func(OtherStruct));
+ }
}
diff --git a/exercises/16_lifetimes/lifetimes1.rs b/exercises/16_lifetimes/lifetimes1.rs
index 87bde49..19e2d39 100644
--- a/exercises/16_lifetimes/lifetimes1.rs
+++ b/exercises/16_lifetimes/lifetimes1.rs
@@ -1,15 +1,9 @@
-// lifetimes1.rs
-//
// The Rust compiler needs to know how to check whether supplied references are
// valid, so that it can let the programmer know if a reference is at risk of
// going out of scope before it is used. Remember, references are borrows and do
// not own their own data. What if their owner goes out of scope?
-//
-// Execute `rustlings hint lifetimes1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// TODO: Fix the compiler error by updating the function signature.
fn longest(x: &str, y: &str) -> &str {
if x.len() > y.len() {
x
@@ -19,9 +13,16 @@ fn longest(x: &str, y: &str) -> &str {
}
fn main() {
- let string1 = String::from("abcd");
- let string2 = "xyz";
-
- let result = longest(string1.as_str(), string2);
- println!("The longest string is '{}'", result);
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_longest() {
+ assert_eq!(longest("abcd", "123"), "abcd");
+ assert_eq!(longest("abc", "1234"), "1234");
+ }
}
diff --git a/exercises/16_lifetimes/lifetimes2.rs b/exercises/16_lifetimes/lifetimes2.rs
index 4f3d8c1..de5a5df 100644
--- a/exercises/16_lifetimes/lifetimes2.rs
+++ b/exercises/16_lifetimes/lifetimes2.rs
@@ -1,13 +1,4 @@
-// lifetimes2.rs
-//
-// So if the compiler is just validating the references passed to the annotated
-// parameters and the return type, what do we need to change?
-//
-// Execute `rustlings hint lifetimes2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// Don't change this function.
fn longest<'a>(x: &'a str, y: &'a str) -> &'a str {
if x.len() > y.len() {
x
@@ -17,11 +8,13 @@ fn longest<'a>(x: &'a str, y: &'a str) -> &'a str {
}
fn main() {
+ // TODO: Fix the compiler error by moving one line.
+
let string1 = String::from("long string is long");
let result;
{
let string2 = String::from("xyz");
- result = longest(string1.as_str(), string2.as_str());
+ result = longest(&string1, &string2);
}
- println!("The longest string is '{}'", result);
+ println!("The longest string is '{result}'");
}
diff --git a/exercises/16_lifetimes/lifetimes3.rs b/exercises/16_lifetimes/lifetimes3.rs
index 9c59f9c..1cc2759 100644
--- a/exercises/16_lifetimes/lifetimes3.rs
+++ b/exercises/16_lifetimes/lifetimes3.rs
@@ -1,21 +1,16 @@
-// lifetimes3.rs
-//
// Lifetimes are also needed when structs hold references.
-//
-// Execute `rustlings hint lifetimes3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// TODO: Fix the compiler errors about the struct.
struct Book {
author: &str,
title: &str,
}
fn main() {
- let name = String::from("Jill Smith");
- let title = String::from("Fish Flying");
- let book = Book { author: &name, title: &title };
+ let book = Book {
+ author: "George Orwell",
+ title: "1984",
+ };
println!("{} by {}", book.title, book.author);
}
diff --git a/exercises/17_tests/tests1.rs b/exercises/17_tests/tests1.rs
index 810277a..7529f9f 100644
--- a/exercises/17_tests/tests1.rs
+++ b/exercises/17_tests/tests1.rs
@@ -1,21 +1,23 @@
-// tests1.rs
-//
// Tests are important to ensure that your code does what you think it should
-// do. Tests can be run on this file with the following command: rustlings run
-// tests1
-//
-// This test has a problem with it -- make the test compile! Make the test pass!
-// Make the test fail!
-//
-// Execute `rustlings hint tests1` or use the `hint` watch subcommand for a
-// hint.
+// do.
-// I AM NOT DONE
+fn is_even(n: i64) -> bool {
+ n % 2 == 0
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
+ // TODO: Import `is_even`. You can use a wildcard to import everything in
+ // the outer module.
+
#[test]
fn you_can_assert() {
+ // TODO: Test the function `is_even` with some values.
+ assert!();
assert!();
}
}
diff --git a/exercises/17_tests/tests2.rs b/exercises/17_tests/tests2.rs
index f8024e9..0c6573e 100644
--- a/exercises/17_tests/tests2.rs
+++ b/exercises/17_tests/tests2.rs
@@ -1,17 +1,23 @@
-// tests2.rs
-//
-// This test has a problem with it -- make the test compile! Make the test pass!
-// Make the test fail!
-//
-// Execute `rustlings hint tests2` or use the `hint` watch subcommand for a
-// hint.
+// Calculates the power of 2 using a bit shift.
+// `1 << n` is equivalent to "2 to the power of n".
+fn power_of_2(n: u8) -> u64 {
+ 1 << n
+}
-// I AM NOT DONE
+fn main() {
+ // You can optionally experiment here.
+}
#[cfg(test)]
mod tests {
+ use super::*;
+
#[test]
fn you_can_assert_eq() {
+ // TODO: Test the function `power_of_2` with some values.
+ assert_eq!();
+ assert_eq!();
+ assert_eq!();
assert_eq!();
}
}
diff --git a/exercises/17_tests/tests3.rs b/exercises/17_tests/tests3.rs
index 4013e38..ec99479 100644
--- a/exercises/17_tests/tests3.rs
+++ b/exercises/17_tests/tests3.rs
@@ -1,16 +1,23 @@
-// tests3.rs
-//
-// This test isn't testing our function -- make it do that in such a way that
-// the test passes. Then write a second test that tests whether we get the
-// result we expect to get when we call `is_even(5)`.
-//
-// Execute `rustlings hint tests3` or use the `hint` watch subcommand for a
-// hint.
+struct Rectangle {
+ width: i32,
+ height: i32,
+}
-// I AM NOT DONE
+impl Rectangle {
+ // Don't change this function.
+ fn new(width: i32, height: i32) -> Self {
+ if width <= 0 || height <= 0 {
+ // Returning a `Result` would be better here. But we want to learn
+ // how to test functions that can panic.
+ panic!("Rectangle width and height can't be negative");
+ }
-pub fn is_even(num: i32) -> bool {
- num % 2 == 0
+ Rectangle { width, height }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -18,12 +25,25 @@ mod tests {
use super::*;
#[test]
- fn is_true_when_even() {
- assert!();
+ fn correct_width_and_height() {
+ // TODO: This test should check if the rectangle has the size that we
+ // pass to its constructor.
+ let rect = Rectangle::new(10, 20);
+ assert_eq!(todo!(), 10); // Check width
+ assert_eq!(todo!(), 20); // Check height
}
+ // TODO: This test should check if the program panics when we try to create
+ // a rectangle with negative width.
#[test]
- fn is_false_when_odd() {
- assert!();
+ fn negative_width() {
+ let _rect = Rectangle::new(-10, 10);
+ }
+
+ // TODO: This test should check if the program panics when we try to create
+ // a rectangle with negative height.
+ #[test]
+ fn negative_height() {
+ let _rect = Rectangle::new(10, -10);
}
}
diff --git a/exercises/17_tests/tests4.rs b/exercises/17_tests/tests4.rs
deleted file mode 100644
index 935d0db..0000000
--- a/exercises/17_tests/tests4.rs
+++ /dev/null
@@ -1,48 +0,0 @@
-// tests4.rs
-//
-// Make sure that we're testing for the correct conditions!
-//
-// Execute `rustlings hint tests4` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-struct Rectangle {
- width: i32,
- height: i32
-}
-
-impl Rectangle {
- // Only change the test functions themselves
- pub fn new(width: i32, height: i32) -> Self {
- if width <= 0 || height <= 0 {
- panic!("Rectangle width and height cannot be negative!")
- }
- Rectangle {width, height}
- }
-}
-
-#[cfg(test)]
-mod tests {
- use super::*;
-
- #[test]
- fn correct_width_and_height() {
- // This test should check if the rectangle is the size that we pass into its constructor
- let rect = Rectangle::new(10, 20);
- assert_eq!(???, 10); // check width
- assert_eq!(???, 20); // check height
- }
-
- #[test]
- fn negative_width() {
- // This test should check if program panics when we try to create rectangle with negative width
- let _rect = Rectangle::new(-10, 10);
- }
-
- #[test]
- fn negative_height() {
- // This test should check if program panics when we try to create rectangle with negative height
- let _rect = Rectangle::new(10, -10);
- }
-}
diff --git a/exercises/18_iterators/iterators1.rs b/exercises/18_iterators/iterators1.rs
index 31076bb..ca937ed 100644
--- a/exercises/18_iterators/iterators1.rs
+++ b/exercises/18_iterators/iterators1.rs
@@ -1,26 +1,25 @@
-// iterators1.rs
-//
// 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.
-//
-// Make me compile by filling in the `???`s
-//
-// Execute `rustlings hint iterators1` or use the `hint` watch subcommand for a
-// hint.
-// I AM NOT DONE
-
-#[test]
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
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn iterators() {
+ let my_fav_fruits = ["banana", "custard apple", "avocado", "peach", "raspberry"];
+
+ // TODO: Create an iterator over the array.
+ let mut fav_fruits_iterator = todo!();
+
+ assert_eq!(fav_fruits_iterator.next(), Some(&"banana"));
+ assert_eq!(fav_fruits_iterator.next(), todo!()); // TODO: Replace `todo!()`
+ assert_eq!(fav_fruits_iterator.next(), Some(&"avocado"));
+ assert_eq!(fav_fruits_iterator.next(), todo!()); // TODO: Replace `todo!()`
+ assert_eq!(fav_fruits_iterator.next(), Some(&"raspberry"));
+ assert_eq!(fav_fruits_iterator.next(), todo!()); // TODO: Replace `todo!()`
+ }
}
diff --git a/exercises/18_iterators/iterators2.rs b/exercises/18_iterators/iterators2.rs
index dda82a0..5903e65 100644
--- a/exercises/18_iterators/iterators2.rs
+++ b/exercises/18_iterators/iterators2.rs
@@ -1,38 +1,32 @@
-// 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.
+// can offer.
-// I AM NOT DONE
-
-// Step 1.
-// Complete the `capitalize_first` function.
+// TODO: Complete the `capitalize_first` function.
// "hello" -> "Hello"
-pub fn capitalize_first(input: &str) -> String {
- let mut c = input.chars();
- match c.next() {
+fn capitalize_first(input: &str) -> String {
+ let mut chars = input.chars();
+ match chars.next() {
None => String::new(),
- Some(first) => ???,
+ Some(first) => todo!(),
}
}
-// Step 2.
-// Apply the `capitalize_first` function to a slice of string slices.
+// TODO: 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 {
- vec![]
+fn capitalize_words_vector(words: &[&str]) -> Vec {
+ // ???
}
-// Step 3.
-// Apply the `capitalize_first` function again to a slice of string slices.
-// Return a single string.
+// TODO: 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()
+fn capitalize_words_string(words: &[&str]) -> String {
+ // ???
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
diff --git a/exercises/18_iterators/iterators3.rs b/exercises/18_iterators/iterators3.rs
index 29fa23a..65a0573 100644
--- a/exercises/18_iterators/iterators3.rs
+++ b/exercises/18_iterators/iterators3.rs
@@ -1,50 +1,33 @@
-// 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),
+enum DivisionError {
DivideByZero,
+ NotDivisible,
}
-#[derive(Debug, PartialEq, Eq)]
-pub struct NotDivisibleError {
- dividend: i32,
- divisor: i32,
-}
-
-// Calculate `a` divided by `b` if `a` is evenly divisible by `b`.
+// TODO: 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 {
+fn divide(a: i32, b: i32) -> Result {
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];
+// TODO: Add the correct return type and complete the function body.
+// Desired output: `Ok([1, 11, 1426, 3])`
+fn result_with_list() {
+ let numbers = [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];
+// TODO: Add the correct return type and complete the function body.
+// Desired output: `[Ok(1), Ok(11), Ok(1426), Ok(3)]`
+fn list_of_results() {
+ let numbers = [27, 297, 38502, 81];
let division_results = numbers.into_iter().map(|n| divide(n, 27));
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -55,19 +38,13 @@ mod tests {
}
#[test]
- fn test_not_divisible() {
- assert_eq!(
- divide(81, 6),
- Err(DivisionError::NotDivisible(NotDivisibleError {
- dividend: 81,
- divisor: 6
- }))
- );
+ fn test_divide_by_0() {
+ assert_eq!(divide(81, 0), Err(DivisionError::DivideByZero));
}
#[test]
- fn test_divide_by_0() {
- assert_eq!(divide(81, 0), Err(DivisionError::DivideByZero));
+ fn test_not_divisible() {
+ assert_eq!(divide(81, 6), Err(DivisionError::NotDivisible));
}
#[test]
@@ -77,14 +54,11 @@ mod tests {
#[test]
fn test_result_with_list() {
- assert_eq!(format!("{:?}", result_with_list()), "Ok([1, 11, 1426, 3])");
+ assert_eq!(result_with_list().unwrap(), [1, 11, 1426, 3]);
}
#[test]
fn test_list_of_results() {
- assert_eq!(
- format!("{:?}", list_of_results()),
- "[Ok(1), Ok(11), Ok(1426), Ok(3)]"
- );
+ assert_eq!(list_of_results(), [Ok(1), Ok(11), Ok(1426), Ok(3)]);
}
}
diff --git a/exercises/18_iterators/iterators4.rs b/exercises/18_iterators/iterators4.rs
index 79e1692..8381dbb 100644
--- a/exercises/18_iterators/iterators4.rs
+++ b/exercises/18_iterators/iterators4.rs
@@ -1,20 +1,16 @@
-// 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
+fn factorial(num: u64) -> u64 {
+ // TODO: Complete this function to return the factorial of `num`.
// Do not use:
- // - return
+ // - early returns (using the `return` keyword explicitly)
// Try not to use:
- // - imperative style loops (for, while)
+ // - imperative style loops (for/while)
// - additional variables
// For an extra challenge, don't use:
// - recursion
- // Execute `rustlings hint iterators4` for hints.
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -23,20 +19,20 @@ mod tests {
#[test]
fn factorial_of_0() {
- assert_eq!(1, factorial(0));
+ assert_eq!(factorial(0), 1);
}
#[test]
fn factorial_of_1() {
- assert_eq!(1, factorial(1));
+ assert_eq!(factorial(1), 1);
}
#[test]
fn factorial_of_2() {
- assert_eq!(2, factorial(2));
+ assert_eq!(factorial(2), 2);
}
#[test]
fn factorial_of_4() {
- assert_eq!(24, factorial(4));
+ assert_eq!(factorial(4), 24);
}
}
diff --git a/exercises/18_iterators/iterators5.rs b/exercises/18_iterators/iterators5.rs
index a062ee4..7e434cc 100644
--- a/exercises/18_iterators/iterators5.rs
+++ b/exercises/18_iterators/iterators5.rs
@@ -1,17 +1,8 @@
-// iterators5.rs
-//
-// Let's define a simple model to track Rustlings exercise progress. Progress
+// 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. Recreate this counting
-// functionality using iterators. Try not to use imperative loops (for, while).
-// 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.
-
-// I AM NOT DONE
+// functionality using iterators. Try to not use imperative loops (for/while).
use std::collections::HashMap;
@@ -25,24 +16,25 @@ enum Progress {
fn count_for(map: &HashMap, value: Progress) -> usize {
let mut count = 0;
for val in map.values() {
- if val == &value {
+ if *val == value {
count += 1;
}
}
count
}
+// TODO: Implement the functionality of `count_for` but with an iterator instead
+// of a `for` loop.
fn count_iterator(map: &HashMap, value: Progress) -> usize {
- // map is a hashmap with String keys and Progress values.
- // map = { "variables1": Complete, "from_str": None, ... }
- todo!();
+ // `map` is a hash map with `String` keys and `Progress` values.
+ // map = { "variables1": Complete, "from_str": None, … }
}
fn count_collection_for(collection: &[HashMap], value: Progress) -> usize {
let mut count = 0;
for map in collection {
for val in map.values() {
- if val == &value {
+ if *val == value {
count += 1;
}
}
@@ -50,81 +42,22 @@ fn count_collection_for(collection: &[HashMap], value: Progres
count
}
+// TODO: Implement the functionality of `count_collection_for` but with an
+// iterator instead of a `for` loop.
fn count_collection_iterator(collection: &[HashMap], value: Progress) -> usize {
- // collection is a slice of hashmaps.
- // collection = [{ "variables1": Complete, "from_str": None, ... },
- // { "variables2": Complete, ... }, ... ]
- todo!();
+ // `collection` is a slice of hash maps.
+ // collection = [{ "variables1": Complete, "from_str": None, … },
+ // { "variables2": Complete, … }, … ]
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[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_some() {
- let map = get_map();
- assert_eq!(1, count_iterator(&map, Progress::Some));
- }
-
- #[test]
- fn count_none() {
- let map = get_map();
- assert_eq!(2, count_iterator(&map, Progress::None));
- }
-
- #[test]
- fn count_complete_equals_for() {
- let map = get_map();
- let progress_states = vec![Progress::Complete, Progress::Some, Progress::None];
- for progress_state in progress_states {
- assert_eq!(
- count_for(&map, progress_state),
- count_iterator(&map, progress_state)
- );
- }
- }
-
- #[test]
- fn count_collection_complete() {
- let collection = get_vec_map();
- assert_eq!(
- 6,
- count_collection_iterator(&collection, Progress::Complete)
- );
- }
-
- #[test]
- fn count_collection_some() {
- let collection = get_vec_map();
- assert_eq!(1, count_collection_iterator(&collection, Progress::Some));
- }
-
- #[test]
- fn count_collection_none() {
- let collection = get_vec_map();
- assert_eq!(4, count_collection_iterator(&collection, Progress::None));
- }
-
- #[test]
- fn count_collection_equals_for() {
- let progress_states = vec![Progress::Complete, Progress::Some, Progress::None];
- let collection = get_vec_map();
-
- for progress_state in progress_states {
- assert_eq!(
- count_collection_for(&collection, progress_state),
- count_collection_iterator(&collection, progress_state)
- );
- }
- }
-
fn get_map() -> HashMap {
use Progress::*;
@@ -153,4 +86,68 @@ mod tests {
vec![map, other]
}
+
+ #[test]
+ fn count_complete() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::Complete), 3);
+ }
+
+ #[test]
+ fn count_some() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::Some), 1);
+ }
+
+ #[test]
+ fn count_none() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::None), 2);
+ }
+
+ #[test]
+ fn count_complete_equals_for() {
+ let map = get_map();
+ let progress_states = [Progress::Complete, Progress::Some, Progress::None];
+ for progress_state in progress_states {
+ assert_eq!(
+ count_for(&map, progress_state),
+ count_iterator(&map, progress_state),
+ );
+ }
+ }
+
+ #[test]
+ fn count_collection_complete() {
+ let collection = get_vec_map();
+ assert_eq!(
+ count_collection_iterator(&collection, Progress::Complete),
+ 6,
+ );
+ }
+
+ #[test]
+ fn count_collection_some() {
+ let collection = get_vec_map();
+ assert_eq!(count_collection_iterator(&collection, Progress::Some), 1);
+ }
+
+ #[test]
+ fn count_collection_none() {
+ let collection = get_vec_map();
+ assert_eq!(count_collection_iterator(&collection, Progress::None), 4);
+ }
+
+ #[test]
+ fn count_collection_equals_for() {
+ let collection = get_vec_map();
+ let progress_states = [Progress::Complete, Progress::Some, Progress::None];
+
+ for progress_state in progress_states {
+ assert_eq!(
+ count_collection_for(&collection, progress_state),
+ count_collection_iterator(&collection, progress_state),
+ );
+ }
+ }
}
diff --git a/exercises/19_smart_pointers/arc1.rs b/exercises/19_smart_pointers/arc1.rs
index 3526ddc..6bb860f 100644
--- a/exercises/19_smart_pointers/arc1.rs
+++ b/exercises/19_smart_pointers/arc1.rs
@@ -1,45 +1,45 @@
-// arc1.rs
+// In this exercise, we are given a `Vec` of `u32` called `numbers` with values
+// ranging from 0 to 99. We would like to use this set of numbers within 8
+// different threads simultaneously. Each thread is going to get the sum of
+// every eighth value with an offset.
//
-// In this exercise, we are given a Vec of u32 called "numbers" with values
-// ranging from 0 to 99 -- [ 0, 1, 2, ..., 98, 99 ] We would like to use this
-// set of numbers within 8 different threads simultaneously. Each thread is
-// going to get the sum of every eighth value, with an offset.
+// The first thread (offset 0), will sum 0, 8, 16, …
+// The second thread (offset 1), will sum 1, 9, 17, …
+// The third thread (offset 2), will sum 2, 10, 18, …
+// …
+// The eighth thread (offset 7), will sum 7, 15, 23, …
//
-// The first thread (offset 0), will sum 0, 8, 16, ...
-// The second thread (offset 1), will sum 1, 9, 17, ...
-// The third thread (offset 2), will sum 2, 10, 18, ...
-// ...
-// The eighth thread (offset 7), will sum 7, 15, 23, ...
+// Each thread should own a reference-counting pointer to the vector of
+// numbers. But `Rc` isn't thread-safe. Therefore, we need to use `Arc`.
//
-// Because we are using threads, our values need to be thread-safe. Therefore,
-// we are using Arc. We need to make a change in each of the two TODOs.
-//
-// Make this code compile by filling in a value for `shared_numbers` where the
-// first TODO comment is, and create an initial binding for `child_numbers`
-// where the second TODO comment is. Try not to create any copies of the
-// `numbers` Vec!
-//
-// Execute `rustlings hint arc1` or use the `hint` watch subcommand for a hint.
+// Don't get distracted by how threads are spawned and joined. We will practice
+// that later in the exercises about threads.
-// I AM NOT DONE
-
-#![forbid(unused_imports)] // Do not change this, (or the next) line.
-use std::sync::Arc;
-use std::thread;
+// Don't change the lines below.
+#![forbid(unused_imports)]
+use std::{sync::Arc, thread};
fn main() {
let numbers: Vec<_> = (0..100u32).collect();
- let shared_numbers = // TODO
- let mut joinhandles = Vec::new();
+
+ // TODO: Define `shared_numbers` by using `Arc`.
+ // let shared_numbers = ???;
+
+ let mut join_handles = Vec::new();
for offset in 0..8 {
- let child_numbers = // TODO
- joinhandles.push(thread::spawn(move || {
+ // TODO: Define `child_numbers` using `shared_numbers`.
+ // let child_numbers = ???;
+
+ let handle = thread::spawn(move || {
let sum: u32 = child_numbers.iter().filter(|&&n| n % 8 == offset).sum();
- println!("Sum of offset {} is {}", offset, sum);
- }));
+ println!("Sum of offset {offset} is {sum}");
+ });
+
+ join_handles.push(handle);
}
- for handle in joinhandles.into_iter() {
+
+ for handle in join_handles.into_iter() {
handle.join().unwrap();
}
}
diff --git a/exercises/19_smart_pointers/box1.rs b/exercises/19_smart_pointers/box1.rs
index 513e7da..d70e1c3 100644
--- a/exercises/19_smart_pointers/box1.rs
+++ b/exercises/19_smart_pointers/box1.rs
@@ -1,58 +1,50 @@
-// box1.rs
-//
// At compile time, Rust needs to know how much space a type takes up. This
// becomes problematic for recursive types, where a value can have as part of
// itself another value of the same type. To get around the issue, we can use a
// `Box` - a smart pointer used to store data on the heap, which also allows us
// to wrap a recursive type.
//
-// The recursive type we're implementing in this exercise is the `cons list` - a
+// The recursive type we're implementing in this exercise is the "cons list", a
// data structure frequently found in functional programming languages. Each
-// item in a cons list contains two elements: the value of the current item and
+// item in a cons list contains two elements: The value of the current item and
// the next item. The last item is a value called `Nil`.
-//
-// Step 1: use a `Box` in the enum definition to make the code compile
-// Step 2: create both empty and non-empty cons lists by replacing `todo!()`
-//
-// Note: the tests should not be changed
-//
-// Execute `rustlings hint box1` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
+// TODO: Use a `Box` in the enum definition to make the code compile.
#[derive(PartialEq, Debug)]
-pub enum List {
+enum List {
Cons(i32, List),
Nil,
}
+// TODO: Create an empty cons list.
+fn create_empty_list() -> List {
+ todo!()
+}
+
+// TODO: Create a non-empty cons list.
+fn create_non_empty_list() -> List {
+ todo!()
+}
+
fn main() {
println!("This is an empty cons list: {:?}", create_empty_list());
println!(
"This is a non-empty cons list: {:?}",
- create_non_empty_list()
+ create_non_empty_list(),
);
}
-pub fn create_empty_list() -> List {
- todo!()
-}
-
-pub fn create_non_empty_list() -> List {
- todo!()
-}
-
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_create_empty_list() {
- assert_eq!(List::Nil, create_empty_list())
+ assert_eq!(create_empty_list(), List::Nil);
}
#[test]
fn test_create_non_empty_list() {
- assert_ne!(create_empty_list(), create_non_empty_list())
+ assert_ne!(create_empty_list(), create_non_empty_list());
}
}
diff --git a/exercises/19_smart_pointers/cow1.rs b/exercises/19_smart_pointers/cow1.rs
index fcd3e0b..5ecf848 100644
--- a/exercises/19_smart_pointers/cow1.rs
+++ b/exercises/19_smart_pointers/cow1.rs
@@ -1,30 +1,22 @@
-// cow1.rs
-//
-// This exercise explores the Cow, or Clone-On-Write type. Cow is a
-// clone-on-write smart pointer. It can enclose and provide immutable access to
-// borrowed data, and clone the data lazily when mutation or ownership is
-// required. The type is designed to work with general borrowed data via the
-// Borrow trait.
-//
-// This exercise is meant to show you what to expect when passing data to Cow.
-// Fix the unit tests by checking for Cow::Owned(_) and Cow::Borrowed(_) at the
-// TODO markers.
-//
-// Execute `rustlings hint cow1` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
+// This exercise explores the `Cow` (Clone-On-Write) smart pointer. It can
+// enclose and provide immutable access to borrowed data and clone the data
+// lazily when mutation or ownership is required. The type is designed to work
+// with general borrowed data via the `Borrow` trait.
use std::borrow::Cow;
-fn abs_all<'a, 'b>(input: &'a mut Cow<'b, [i32]>) -> &'a mut Cow<'b, [i32]> {
- for i in 0..input.len() {
- let v = input[i];
- if v < 0 {
+fn abs_all(input: &mut Cow<[i32]>) {
+ for ind in 0..input.len() {
+ let value = input[ind];
+ if value < 0 {
// Clones into a vector if not already owned.
- input.to_mut()[i] = -v;
+ input.to_mut()[ind] = -value;
}
}
- input
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
@@ -32,47 +24,45 @@ mod tests {
use super::*;
#[test]
- fn reference_mutation() -> Result<(), &'static str> {
+ fn reference_mutation() {
// Clone occurs because `input` needs to be mutated.
- let slice = [-1, 0, 1];
- let mut input = Cow::from(&slice[..]);
- match abs_all(&mut input) {
- Cow::Owned(_) => Ok(()),
- _ => Err("Expected owned value"),
- }
+ let vec = vec![-1, 0, 1];
+ let mut input = Cow::from(&vec);
+ abs_all(&mut input);
+ assert!(matches!(input, Cow::Owned(_)));
}
#[test]
- fn reference_no_mutation() -> Result<(), &'static str> {
+ fn reference_no_mutation() {
// No clone occurs because `input` doesn't need to be mutated.
- let slice = [0, 1, 2];
- let mut input = Cow::from(&slice[..]);
- match abs_all(&mut input) {
- // TODO
- }
+ let vec = vec![0, 1, 2];
+ let mut input = Cow::from(&vec);
+ abs_all(&mut input);
+ // TODO: Replace `todo!()` with `Cow::Owned(_)` or `Cow::Borrowed(_)`.
+ assert!(matches!(input, todo!()));
}
#[test]
- fn owned_no_mutation() -> Result<(), &'static str> {
- // We can also pass `slice` without `&` so Cow owns it directly. In this
- // case no mutation occurs and thus also no clone, but the result is
+ fn owned_no_mutation() {
+ // We can also pass `vec` without `&` so `Cow` owns it directly. In this
+ // case, no mutation occurs and thus also no clone. But the result is
// still owned because it was never borrowed or mutated.
- let slice = vec![0, 1, 2];
- let mut input = Cow::from(slice);
- match abs_all(&mut input) {
- // TODO
- }
+ let vec = vec![0, 1, 2];
+ let mut input = Cow::from(vec);
+ abs_all(&mut input);
+ // TODO: Replace `todo!()` with `Cow::Owned(_)` or `Cow::Borrowed(_)`.
+ assert!(matches!(input, todo!()));
}
#[test]
- fn owned_mutation() -> Result<(), &'static str> {
+ fn owned_mutation() {
// Of course this is also the case if a mutation does occur. In this
- // case the call to `to_mut()` in the abs_all() function returns a
+ // case, the call to `to_mut()` in the `abs_all` function returns a
// reference to the same data as before.
- let slice = vec![-1, 0, 1];
- let mut input = Cow::from(slice);
- match abs_all(&mut input) {
- // TODO
- }
+ let vec = vec![-1, 0, 1];
+ let mut input = Cow::from(vec);
+ abs_all(&mut input);
+ // TODO: Replace `todo!()` with `Cow::Owned(_)` or `Cow::Borrowed(_)`.
+ assert!(matches!(input, todo!()));
}
}
diff --git a/exercises/19_smart_pointers/rc1.rs b/exercises/19_smart_pointers/rc1.rs
index 1b90346..48e19dc 100644
--- a/exercises/19_smart_pointers/rc1.rs
+++ b/exercises/19_smart_pointers/rc1.rs
@@ -1,22 +1,14 @@
-// rc1.rs
-//
// In this exercise, we want to express the concept of multiple owners via the
-// Rc type. This is a model of our solar system - there is a Sun type and
-// multiple Planets. The Planets take ownership of the sun, indicating that they
-// revolve around the sun.
-//
-// Make this code compile by using the proper Rc primitives to express that the
-// sun has multiple owners.
-//
-// Execute `rustlings hint rc1` or use the `hint` watch subcommand for a hint.
-
-// I AM NOT DONE
+// `Rc` type. This is a model of our solar system - there is a `Sun` type and
+// multiple `Planet`s. The planets take ownership of the sun, indicating that
+// they revolve around the sun.
use std::rc::Rc;
#[derive(Debug)]
-struct Sun {}
+struct Sun;
+#[allow(dead_code)]
#[derive(Debug)]
enum Planet {
Mercury(Rc),
@@ -31,75 +23,84 @@ enum Planet {
impl Planet {
fn details(&self) {
- println!("Hi from {:?}!", self)
+ println!("Hi from {self:?}!");
}
}
-#[test]
fn main() {
- let sun = Rc::new(Sun {});
- println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
-
- let mercury = Planet::Mercury(Rc::clone(&sun));
- println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
- mercury.details();
-
- let venus = Planet::Venus(Rc::clone(&sun));
- println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
- venus.details();
-
- let earth = Planet::Earth(Rc::clone(&sun));
- println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
- earth.details();
-
- let mars = Planet::Mars(Rc::clone(&sun));
- println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
- mars.details();
-
- let jupiter = Planet::Jupiter(Rc::clone(&sun));
- println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
- jupiter.details();
-
- // TODO
- let saturn = Planet::Saturn(Rc::new(Sun {}));
- println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
- saturn.details();
-
- // TODO
- let uranus = Planet::Uranus(Rc::new(Sun {}));
- println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
- uranus.details();
-
- // TODO
- let neptune = Planet::Neptune(Rc::new(Sun {}));
- println!("reference count = {}", Rc::strong_count(&sun)); // 9 references
- neptune.details();
-
- assert_eq!(Rc::strong_count(&sun), 9);
-
- drop(neptune);
- println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
-
- drop(uranus);
- println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
-
- drop(saturn);
- println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
-
- drop(jupiter);
- println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
-
- drop(mars);
- println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
-
- // TODO
- println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
-
- // TODO
- println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
-
- // TODO
- println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
-
- assert_eq!(Rc::strong_count(&sun), 1);
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn rc1() {
+ let sun = Rc::new(Sun);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
+
+ let mercury = Planet::Mercury(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
+ mercury.details();
+
+ let venus = Planet::Venus(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
+ venus.details();
+
+ let earth = Planet::Earth(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
+ earth.details();
+
+ let mars = Planet::Mars(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
+ mars.details();
+
+ let jupiter = Planet::Jupiter(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
+ jupiter.details();
+
+ // TODO
+ let saturn = Planet::Saturn(Rc::new(Sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
+ saturn.details();
+
+ // TODO
+ let uranus = Planet::Uranus(Rc::new(Sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
+ uranus.details();
+
+ // TODO
+ let neptune = Planet::Neptune(Rc::new(Sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 9 references
+ neptune.details();
+
+ assert_eq!(Rc::strong_count(&sun), 9);
+
+ drop(neptune);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
+
+ drop(uranus);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
+
+ drop(saturn);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
+
+ drop(jupiter);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
+
+ drop(mars);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
+
+ // TODO
+ println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
+
+ // TODO
+ println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
+
+ // TODO
+ println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
+
+ assert_eq!(Rc::strong_count(&sun), 1);
+ }
}
diff --git a/exercises/20_threads/README.md b/exercises/20_threads/README.md
index dbe6664..0b32fb1 100644
--- a/exercises/20_threads/README.md
+++ b/exercises/20_threads/README.md
@@ -7,3 +7,4 @@ Within your program, you can also have independent parts that run simultaneously
- [Dining Philosophers example](https://doc.rust-lang.org/1.4.0/book/dining-philosophers.html)
- [Using Threads to Run Code Simultaneously](https://doc.rust-lang.org/book/ch16-01-threads.html)
+- [Using Message Passing to Transfer Data Between Threads](https://doc.rust-lang.org/book/ch16-02-message-passing.html)
diff --git a/exercises/20_threads/threads1.rs b/exercises/20_threads/threads1.rs
index 80b6def..01f9ff4 100644
--- a/exercises/20_threads/threads1.rs
+++ b/exercises/20_threads/threads1.rs
@@ -1,40 +1,37 @@
-// threads1.rs
-//
// This program spawns multiple threads that each run for at least 250ms, and
// each thread returns how much time they took to complete. The program should
// wait until all the spawned threads have finished and should collect their
// return values into a vector.
-//
-// Execute `rustlings hint threads1` or use the `hint` watch subcommand for a
-// hint.
-// I AM NOT DONE
-
-use std::thread;
-use std::time::{Duration, Instant};
+use std::{
+ thread,
+ time::{Duration, Instant},
+};
fn main() {
- let mut handles = vec![];
+ let mut handles = Vec::new();
for i in 0..10 {
- handles.push(thread::spawn(move || {
+ let handle = thread::spawn(move || {
let start = Instant::now();
thread::sleep(Duration::from_millis(250));
- println!("thread {} is complete", i);
+ println!("Thread {i} done");
start.elapsed().as_millis()
- }));
+ });
+ handles.push(handle);
}
- let mut results: Vec = vec![];
+ let mut results = Vec::new();
for handle in handles {
- // TODO: a struct is returned from thread::spawn, can you use it?
+ // TODO: Collect the results of all threads into the `results` vector.
+ // Use the `JoinHandle` struct which is returned by `thread::spawn`.
}
if results.len() != 10 {
- panic!("Oh no! All the spawned threads did not finish!");
+ panic!("Oh no! Some thread isn't done yet!");
}
println!();
for (i, result) in results.into_iter().enumerate() {
- println!("thread {} took {}ms", i, result);
+ println!("Thread {i} took {result}ms");
}
}
diff --git a/exercises/20_threads/threads2.rs b/exercises/20_threads/threads2.rs
index 62dad80..7020cb9 100644
--- a/exercises/20_threads/threads2.rs
+++ b/exercises/20_threads/threads2.rs
@@ -1,39 +1,34 @@
-// threads2.rs
-//
// Building on the last exercise, we want all of the threads to complete their
-// work but this time the spawned threads need to be in charge of updating a
-// shared value: JobStatus.jobs_completed
-//
-// Execute `rustlings hint threads2` or use the `hint` watch subcommand for a
-// hint.
+// work. But this time, the spawned threads need to be in charge of updating a
+// shared value: `JobStatus.jobs_done`
-// I AM NOT DONE
-
-use std::sync::Arc;
-use std::thread;
-use std::time::Duration;
+use std::{sync::Arc, thread, time::Duration};
struct JobStatus {
- jobs_completed: u32,
+ jobs_done: u32,
}
fn main() {
- let status = Arc::new(JobStatus { jobs_completed: 0 });
- let mut handles = vec![];
+ // TODO: `Arc` isn't enough if you want a **mutable** shared state.
+ let status = Arc::new(JobStatus { jobs_done: 0 });
+
+ let mut handles = Vec::new();
for _ in 0..10 {
let status_shared = Arc::clone(&status);
let handle = thread::spawn(move || {
thread::sleep(Duration::from_millis(250));
- // TODO: You must take an action before you update a shared value
- status_shared.jobs_completed += 1;
+
+ // TODO: You must take an action before you update a shared value.
+ status_shared.jobs_done += 1;
});
handles.push(handle);
}
+
+ // Waiting for all jobs to complete.
for handle in handles {
handle.join().unwrap();
- // TODO: Print the value of the JobStatus.jobs_completed. Did you notice
- // anything interesting in the output? Do you have to 'join' on all the
- // handles?
- println!("jobs completed {}", ???);
}
+
+ // TODO: Print the value of `JobStatus.jobs_done`.
+ println!("Jobs done: {}", todo!());
}
diff --git a/exercises/20_threads/threads3.rs b/exercises/20_threads/threads3.rs
index 91006bb..8aa7291 100644
--- a/exercises/20_threads/threads3.rs
+++ b/exercises/20_threads/threads3.rs
@@ -1,14 +1,4 @@
-// threads3.rs
-//
-// Execute `rustlings hint threads3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-use std::sync::mpsc;
-use std::sync::Arc;
-use std::thread;
-use std::time::Duration;
+use std::{sync::mpsc, thread, time::Duration};
struct Queue {
length: u32,
@@ -18,7 +8,7 @@ struct Queue {
impl Queue {
fn new() -> Self {
- Queue {
+ Self {
length: 10,
first_half: vec![1, 2, 3, 4, 5],
second_half: vec![6, 7, 8, 9, 10],
@@ -26,42 +16,49 @@ impl Queue {
}
}
-fn send_tx(q: Queue, tx: mpsc::Sender) -> () {
- let qc = Arc::new(q);
- let qc1 = Arc::clone(&qc);
- let qc2 = Arc::clone(&qc);
-
+fn send_tx(q: Queue, tx: mpsc::Sender) {
+ // TODO: We want to send `tx` to both threads. But currently, it is moved
+ // into the first thread. How could you solve this problem?
thread::spawn(move || {
- for val in &qc1.first_half {
- println!("sending {:?}", val);
- tx.send(*val).unwrap();
- thread::sleep(Duration::from_secs(1));
+ for val in q.first_half {
+ println!("Sending {val:?}");
+ tx.send(val).unwrap();
+ thread::sleep(Duration::from_millis(250));
}
});
thread::spawn(move || {
- for val in &qc2.second_half {
- println!("sending {:?}", val);
- tx.send(*val).unwrap();
- thread::sleep(Duration::from_secs(1));
+ for val in q.second_half {
+ println!("Sending {val:?}");
+ tx.send(val).unwrap();
+ thread::sleep(Duration::from_millis(250));
}
});
}
-#[test]
fn main() {
- let (tx, rx) = mpsc::channel();
- let queue = Queue::new();
- let queue_length = queue.length;
-
- send_tx(queue, tx);
-
- let mut total_received: u32 = 0;
- for received in rx {
- println!("Got: {}", received);
- total_received += 1;
- }
-
- println!("total numbers received: {}", total_received);
- assert_eq!(total_received, queue_length)
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn threads3() {
+ let (tx, rx) = mpsc::channel();
+ let queue = Queue::new();
+ let queue_length = queue.length;
+
+ send_tx(queue, tx);
+
+ let mut total_received: u32 = 0;
+ for received in rx {
+ println!("Got: {received}");
+ total_received += 1;
+ }
+
+ println!("Number of received values: {total_received}");
+ assert_eq!(total_received, queue_length);
+ }
}
diff --git a/exercises/21_macros/macros1.rs b/exercises/21_macros/macros1.rs
index 678de6e..fb3c3ff 100644
--- a/exercises/21_macros/macros1.rs
+++ b/exercises/21_macros/macros1.rs
@@ -1,10 +1,3 @@
-// macros1.rs
-//
-// Execute `rustlings hint macros1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
macro_rules! my_macro {
() => {
println!("Check out my macro!");
@@ -12,5 +5,6 @@ macro_rules! my_macro {
}
fn main() {
+ // TODO: Fix the macro call.
my_macro();
}
diff --git a/exercises/21_macros/macros2.rs b/exercises/21_macros/macros2.rs
index 788fc16..2d9dec7 100644
--- a/exercises/21_macros/macros2.rs
+++ b/exercises/21_macros/macros2.rs
@@ -1,14 +1,8 @@
-// macros2.rs
-//
-// Execute `rustlings hint macros2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
my_macro!();
}
+// TODO: Fix the compiler error by moving the whole definition of this macro.
macro_rules! my_macro {
() => {
println!("Check out my macro!");
diff --git a/exercises/21_macros/macros3.rs b/exercises/21_macros/macros3.rs
index b795c14..9537494 100644
--- a/exercises/21_macros/macros3.rs
+++ b/exercises/21_macros/macros3.rs
@@ -1,12 +1,5 @@
-// macros3.rs
-//
-// Make me compile, without taking the macro out of the module!
-//
-// Execute `rustlings hint macros3` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Fix the compiler error without taking the macro definition out of this
+// module.
mod macros {
macro_rules! my_macro {
() => {
diff --git a/exercises/21_macros/macros4.rs b/exercises/21_macros/macros4.rs
index 71b45a0..9d77f6a 100644
--- a/exercises/21_macros/macros4.rs
+++ b/exercises/21_macros/macros4.rs
@@ -1,10 +1,4 @@
-// macros4.rs
-//
-// Execute `rustlings hint macros4` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
+// TODO: Fix the compiler error by adding one or two characters.
#[rustfmt::skip]
macro_rules! my_macro {
() => {
diff --git a/exercises/22_clippy/clippy1.rs b/exercises/22_clippy/clippy1.rs
index 95c0141..7165da4 100644
--- a/exercises/22_clippy/clippy1.rs
+++ b/exercises/22_clippy/clippy1.rs
@@ -1,26 +1,15 @@
-// clippy1.rs
-//
// The Clippy tool is a collection of lints to analyze your code so you can
// catch common mistakes and improve your Rust code.
//
-// For these exercises the code will fail to compile when there are clippy
-// warnings check clippy's suggestions from the output to solve the exercise.
-//
-// Execute `rustlings hint clippy1` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
-use std::f32;
+// For these exercises, the code will fail to compile when there are Clippy
+// warnings. Check Clippy's suggestions from the output to solve the exercise.
fn main() {
- let pi = 3.14f32;
- let radius = 5.00f32;
+ // TODO: Fix the Clippy lint in this line.
+ let pi = 3.14;
+ let radius: f32 = 5.0;
- let area = pi * f32::powi(radius, 2);
+ let area = pi * radius.powi(2);
- println!(
- "The area of a circle with radius {:.2} is {:.5}!",
- radius, area
- )
+ println!("The area of a circle with radius {radius:.2} is {area:.5}");
}
diff --git a/exercises/22_clippy/clippy2.rs b/exercises/22_clippy/clippy2.rs
index 9b87a0b..8cfe6f8 100644
--- a/exercises/22_clippy/clippy2.rs
+++ b/exercises/22_clippy/clippy2.rs
@@ -1,15 +1,10 @@
-// clippy2.rs
-//
-// Execute `rustlings hint clippy2` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
-
fn main() {
let mut res = 42;
let option = Some(12);
+ // TODO: Fix the Clippy lint.
for x in option {
res += x;
}
- println!("{}", res);
+
+ println!("{res}");
}
diff --git a/exercises/22_clippy/clippy3.rs b/exercises/22_clippy/clippy3.rs
index 5a95f5b..4f78834 100644
--- a/exercises/22_clippy/clippy3.rs
+++ b/exercises/22_clippy/clippy3.rs
@@ -1,30 +1,27 @@
-// clippy3.rs
-//
-// Here's a couple more easy Clippy fixes, so you can see its utility.
-// No hints.
-
-// I AM NOT DONE
+// Here are some more easy Clippy fixes so you can see its utility 📎
+// TODO: Fix all the Clippy lints.
+#[rustfmt::skip]
#[allow(unused_variables, unused_assignments)]
fn main() {
let my_option: Option<()> = None;
if my_option.is_none() {
- my_option.unwrap();
+ println!("{:?}", my_option.unwrap());
}
let my_arr = &[
-1, -2, -3
-4, -5, -6
];
- println!("My array! Here it is: {:?}", my_arr);
+ println!("My array! Here it is: {my_arr:?}");
let my_empty_vec = vec![1, 2, 3, 4, 5].resize(0, 5);
- println!("This Vec is empty, see? {:?}", my_empty_vec);
+ println!("This Vec is empty, see? {my_empty_vec:?}");
let mut value_a = 45;
let mut value_b = 66;
// Let's swap these two!
value_a = value_b;
value_b = value_a;
- println!("value a: {}; value b: {}", value_a, value_b);
+ println!("value a: {value_a}; value b: {value_b}");
}
diff --git a/exercises/23_conversions/as_ref_mut.rs b/exercises/23_conversions/as_ref_mut.rs
index 2ba9e3f..54f0cd1 100644
--- a/exercises/23_conversions/as_ref_mut.rs
+++ b/exercises/23_conversions/as_ref_mut.rs
@@ -1,31 +1,27 @@
-// as_ref_mut.rs
-//
// AsRef and AsMut allow for cheap reference-to-reference conversions. Read more
// about them at https://doc.rust-lang.org/std/convert/trait.AsRef.html and
// https://doc.rust-lang.org/std/convert/trait.AsMut.html, respectively.
-//
-// Execute `rustlings hint as_ref_mut` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
// Obtain the number of bytes (not characters) in the given argument.
-// TODO: Add the AsRef trait appropriately as a trait bound.
+// TODO: Add the `AsRef` trait appropriately as a trait bound.
fn byte_counter(arg: T) -> usize {
arg.as_ref().as_bytes().len()
}
// Obtain the number of characters (not bytes) in the given argument.
-// TODO: Add the AsRef trait appropriately as a trait bound.
+// TODO: Add the `AsRef` trait appropriately as a trait bound.
fn char_counter(arg: T) -> usize {
arg.as_ref().chars().count()
}
-// Squares a number using as_mut().
+// Squares a number using `as_mut()`.
// TODO: Add the appropriate trait bound.
fn num_sq(arg: &mut T) {
// TODO: Implement the function body.
- ???
+}
+
+fn main() {
+ // You can optionally experiment here.
}
#[cfg(test)]
diff --git a/exercises/23_conversions/from_into.rs b/exercises/23_conversions/from_into.rs
index 60911f3..bc2783a 100644
--- a/exercises/23_conversions/from_into.rs
+++ b/exercises/23_conversions/from_into.rs
@@ -1,89 +1,79 @@
-// from_into.rs
-//
-// The From trait is used for value-to-value conversions. If From is implemented
-// correctly for a type, the Into trait should work conversely. You can read
-// more about it at https://doc.rust-lang.org/std/convert/trait.From.html
-//
-// Execute `rustlings hint from_into` or use the `hint` watch subcommand for a
-// hint.
+// The `From` trait is used for value-to-value conversions. If `From` is
+// implemented, an implementation of `Into` is automatically provided.
+// You can read more about it in the documentation:
+// https://doc.rust-lang.org/std/convert/trait.From.html
#[derive(Debug)]
struct Person {
name: String,
- age: usize,
+ age: u8,
}
-// We implement the Default trait to use it as a fallback
-// when the provided string is not convertible into a Person object
+// We implement the Default trait to use it as a fallback when the provided
+// string is not convertible into a `Person` object.
impl Default for Person {
- fn default() -> Person {
- Person {
+ fn default() -> Self {
+ Self {
name: String::from("John"),
age: 30,
}
}
}
-// Your task is to complete this implementation in order for the line `let p =
-// Person::from("Mark,20")` to compile Please note that you'll need to parse the
-// age component into a `usize` with something like `"4".parse::()`. The
-// outcome of this needs to be handled appropriately.
+// TODO: Complete this `From` implementation to be able to parse a `Person`
+// out of a string in the form of "Mark,20".
+// Note that you'll need to parse the age component into a `u8` with something
+// like `"4".parse::()`.
//
// Steps:
-// 1. If the length of the provided string is 0, then return the default of
-// Person.
-// 2. Split the given string on the commas present in it.
-// 3. Extract the first element from the split operation and use it as the name.
-// 4. If the name is empty, then return the default of Person.
-// 5. Extract the other element from the split operation and parse it into a
-// `usize` as the age.
-// If while parsing the age, something goes wrong, then return the default of
-// Person Otherwise, then return an instantiated Person object with the results
-
-// I AM NOT DONE
-
+// 1. Split the given string on the commas present in it.
+// 2. If the split operation returns less or more than 2 elements, return the
+// default of `Person`.
+// 3. Use the first element from the split operation as the name.
+// 4. If the name is empty, return the default of `Person`.
+// 5. Parse the second element from the split operation into a `u8` as the age.
+// 6. If parsing the age fails, return the default of `Person`.
impl From<&str> for Person {
- fn from(s: &str) -> Person {
- }
+ fn from(s: &str) -> Self {}
}
fn main() {
- // Use the `from` function
+ // Use the `from` function.
let p1 = Person::from("Mark,20");
- // Since From is implemented for Person, we should be able to use Into
+ println!("{p1:?}");
+
+ // Since `From` is implemented for Person, we are able to use `Into`.
let p2: Person = "Gerald,70".into();
- println!("{:?}", p1);
- println!("{:?}", p2);
+ println!("{p2:?}");
}
#[cfg(test)]
mod tests {
use super::*;
+
#[test]
fn test_default() {
- // Test that the default person is 30 year old John
let dp = Person::default();
assert_eq!(dp.name, "John");
assert_eq!(dp.age, 30);
}
+
#[test]
fn test_bad_convert() {
- // Test that John is returned when bad string is provided
let p = Person::from("");
assert_eq!(p.name, "John");
assert_eq!(p.age, 30);
}
+
#[test]
fn test_good_convert() {
- // Test that "Mark,20" works
let p = Person::from("Mark,20");
assert_eq!(p.name, "Mark");
assert_eq!(p.age, 20);
}
+
#[test]
fn test_bad_age() {
- // Test that "Mark,twenty" will return the default person due to an
- // error in parsing age
let p = Person::from("Mark,twenty");
assert_eq!(p.name, "John");
assert_eq!(p.age, 30);
@@ -127,14 +117,14 @@ mod tests {
#[test]
fn test_trailing_comma() {
let p: Person = Person::from("Mike,32,");
- assert_eq!(p.name, "Mike");
- assert_eq!(p.age, 32);
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
}
#[test]
fn test_trailing_comma_and_some_string() {
- let p: Person = Person::from("Mike,32,man");
- assert_eq!(p.name, "Mike");
- assert_eq!(p.age, 32);
+ let p: Person = Person::from("Mike,32,dog");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
}
}
diff --git a/exercises/23_conversions/from_str.rs b/exercises/23_conversions/from_str.rs
index 34472c3..4b1aaa2 100644
--- a/exercises/23_conversions/from_str.rs
+++ b/exercises/23_conversions/from_str.rs
@@ -1,13 +1,9 @@
-// from_str.rs
-//
-// This is similar to from_into.rs, but this time we'll implement `FromStr` and
-// return errors instead of falling back to a default value. Additionally, upon
-// implementing FromStr, you can use the `parse` method on strings to generate
-// an object of the implementor type. You can read more about it at
+// This is similar to the previous `from_into` exercise. But this time, we'll
+// implement `FromStr` and return errors instead of falling back to a default
+// value. Additionally, upon implementing `FromStr`, you can use the `parse`
+// method on strings to generate an object of the implementor type. You can read
+// more about it in the documentation:
// https://doc.rust-lang.org/std/str/trait.FromStr.html
-//
-// Execute `rustlings hint from_str` or use the `hint` watch subcommand for a
-// hint.
use std::num::ParseIntError;
use std::str::FromStr;
@@ -15,59 +11,54 @@ use std::str::FromStr;
#[derive(Debug, PartialEq)]
struct Person {
name: String,
- age: usize,
+ age: u8,
}
// We will use this error type for the `FromStr` implementation.
#[derive(Debug, PartialEq)]
enum ParsePersonError {
- // Empty input string
- Empty,
// Incorrect number of fields
BadLen,
// Empty name field
NoName,
- // Wrapped error from parse::()
+ // Wrapped error from parse::()
ParseInt(ParseIntError),
}
-// I AM NOT DONE
-
-// Steps:
-// 1. If the length of the provided string is 0, an error should be returned
-// 2. Split the given string on the commas present in it
-// 3. Only 2 elements should be returned from the split, otherwise return an
-// error
-// 4. Extract the first element from the split operation and use it as the name
-// 5. Extract the other element from the split operation and parse it into a
-// `usize` as the age with something like `"4".parse::()`
-// 6. If while extracting the name and the age something goes wrong, an error
-// should be returned
-// If everything goes well, then return a Result of a Person object
+// TODO: Complete this `From` implementation to be able to parse a `Person`
+// out of a string in the form of "Mark,20".
+// Note that you'll need to parse the age component into a `u8` with something
+// like `"4".parse::()`.
//
-// As an aside: `Box` implements `From<&'_ str>`. This means that if
-// you want to return a string error message, you can do so via just using
-// return `Err("my error message".into())`.
-
+// Steps:
+// 1. Split the given string on the commas present in it.
+// 2. If the split operation returns less or more than 2 elements, return the
+// error `ParsePersonError::BadLen`.
+// 3. Use the first element from the split operation as the name.
+// 4. If the name is empty, return the error `ParsePersonError::NoName`.
+// 5. Parse the second element from the split operation into a `u8` as the age.
+// 6. If parsing the age fails, return the error `ParsePersonError::ParseInt`.
impl FromStr for Person {
type Err = ParsePersonError;
- fn from_str(s: &str) -> Result {
- }
+
+ fn from_str(s: &str) -> Result {}
}
fn main() {
- let p = "Mark,20".parse::().unwrap();
- println!("{:?}", p);
+ let p = "Mark,20".parse::();
+ println!("{p:?}");
}
#[cfg(test)]
mod tests {
use super::*;
+ use ParsePersonError::*;
#[test]
fn empty_input() {
- assert_eq!("".parse::(), Err(ParsePersonError::Empty));
+ assert_eq!("".parse::(), Err(BadLen));
}
+
#[test]
fn good_input() {
let p = "John,32".parse::();
@@ -76,58 +67,47 @@ mod tests {
assert_eq!(p.name, "John");
assert_eq!(p.age, 32);
}
+
#[test]
fn missing_age() {
- assert!(matches!(
- "John,".parse::(),
- Err(ParsePersonError::ParseInt(_))
- ));
+ assert!(matches!("John,".parse::(), Err(ParseInt(_))));
}
#[test]
fn invalid_age() {
- assert!(matches!(
- "John,twenty".parse::(),
- Err(ParsePersonError::ParseInt(_))
- ));
+ assert!(matches!("John,twenty".parse::(), Err(ParseInt(_))));
}
#[test]
fn missing_comma_and_age() {
- assert_eq!("John".parse::(), Err(ParsePersonError::BadLen));
+ assert_eq!("John".parse::(), Err(BadLen));
}
#[test]
fn missing_name() {
- assert_eq!(",1".parse::(), Err(ParsePersonError::NoName));
+ assert_eq!(",1".parse::(), Err(NoName));
}
#[test]
fn missing_name_and_age() {
- assert!(matches!(
- ",".parse::(),
- Err(ParsePersonError::NoName | ParsePersonError::ParseInt(_))
- ));
+ assert!(matches!(",".parse::(), Err(NoName | ParseInt(_))));
}
#[test]
fn missing_name_and_invalid_age() {
assert!(matches!(
",one".parse::(),
- Err(ParsePersonError::NoName | ParsePersonError::ParseInt(_))
+ Err(NoName | ParseInt(_)),
));
}
#[test]
fn trailing_comma() {
- assert_eq!("John,32,".parse::(), Err(ParsePersonError::BadLen));
+ assert_eq!("John,32,".parse::(), Err(BadLen));
}
#[test]
fn trailing_comma_and_some_string() {
- assert_eq!(
- "John,32,man".parse::(),
- Err(ParsePersonError::BadLen)
- );
+ assert_eq!("John,32,man".parse::(), Err(BadLen));
}
}
diff --git a/exercises/23_conversions/try_from_into.rs b/exercises/23_conversions/try_from_into.rs
index 32d6ef3..f3ae80a 100644
--- a/exercises/23_conversions/try_from_into.rs
+++ b/exercises/23_conversions/try_from_into.rs
@@ -1,14 +1,10 @@
-// try_from_into.rs
-//
-// TryFrom is a simple and safe type conversion that may fail in a controlled
-// way under some circumstances. Basically, this is the same as From. The main
-// difference is that this should return a Result type instead of the target
-// type itself. You can read more about it at
+// `TryFrom` is a simple and safe type conversion that may fail in a controlled
+// way under some circumstances. Basically, this is the same as `From`. The main
+// difference is that this should return a `Result` type instead of the target
+// type itself. You can read more about it in the documentation:
// https://doc.rust-lang.org/std/convert/trait.TryFrom.html
-//
-// Execute `rustlings hint try_from_into` or use the `hint` watch subcommand for
-// a hint.
+#![allow(clippy::useless_vec)]
use std::convert::{TryFrom, TryInto};
#[derive(Debug, PartialEq)]
@@ -18,7 +14,7 @@ struct Color {
blue: u8,
}
-// We will use this error type for these `TryFrom` conversions.
+// We will use this error type for the `TryFrom` conversions.
#[derive(Debug, PartialEq)]
enum IntoColorError {
// Incorrect length of slice
@@ -27,80 +23,67 @@ enum IntoColorError {
IntConversion,
}
-// I AM NOT DONE
-
-// Your task is to complete this implementation and return an Ok result of inner
-// type Color. You need to create an implementation for a tuple of three
-// integers, an array of three integers, and a slice of integers.
-//
-// Note that the implementation for tuple and array will be checked at compile
-// time, but the slice implementation needs to check the slice length! Also note
-// that correct RGB color values must be integers in the 0..=255 range.
-
-// Tuple implementation
+// TODO: Tuple implementation.
+// Correct RGB color values must be integers in the 0..=255 range.
impl TryFrom<(i16, i16, i16)> for Color {
type Error = IntoColorError;
- fn try_from(tuple: (i16, i16, i16)) -> Result {
- }
+
+ fn try_from(tuple: (i16, i16, i16)) -> Result {}
}
-// Array implementation
+// TODO: Array implementation.
impl TryFrom<[i16; 3]> for Color {
type Error = IntoColorError;
- fn try_from(arr: [i16; 3]) -> Result {
- }
+
+ fn try_from(arr: [i16; 3]) -> Result {}
}
-// Slice implementation
+// TODO: Slice implementation.
+// This implementation needs to check the slice length.
impl TryFrom<&[i16]> for Color {
type Error = IntoColorError;
- fn try_from(slice: &[i16]) -> Result {
- }
+
+ fn try_from(slice: &[i16]) -> Result {}
}
fn main() {
- // Use the `try_from` function
+ // Using the `try_from` function.
let c1 = Color::try_from((183, 65, 14));
- println!("{:?}", c1);
+ println!("{c1:?}");
- // Since TryFrom is implemented for Color, we should be able to use TryInto
+ // Since `TryFrom` is implemented for `Color`, we can use `TryInto`.
let c2: Result = [183, 65, 14].try_into();
- println!("{:?}", c2);
+ println!("{c2:?}");
let v = vec![183, 65, 14];
- // With slice we should use `try_from` function
+ // With slice we should use the `try_from` function
let c3 = Color::try_from(&v[..]);
- println!("{:?}", c3);
- // or take slice within round brackets and use TryInto
+ println!("{c3:?}");
+ // or put the slice within round brackets and use `try_into`.
let c4: Result = (&v[..]).try_into();
- println!("{:?}", c4);
+ println!("{c4:?}");
}
#[cfg(test)]
mod tests {
use super::*;
+ use IntoColorError::*;
#[test]
fn test_tuple_out_of_range_positive() {
- assert_eq!(
- Color::try_from((256, 1000, 10000)),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from((256, 1000, 10000)), Err(IntConversion));
}
+
#[test]
fn test_tuple_out_of_range_negative() {
- assert_eq!(
- Color::try_from((-1, -10, -256)),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from((-1, -10, -256)), Err(IntConversion));
}
+
#[test]
fn test_tuple_sum() {
- assert_eq!(
- Color::try_from((-1, 255, 255)),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from((-1, 255, 255)), Err(IntConversion));
}
+
#[test]
fn test_tuple_correct() {
let c: Result = (183, 65, 14).try_into();
@@ -110,25 +93,29 @@ mod tests {
Color {
red: 183,
green: 65,
- blue: 14
+ blue: 14,
}
);
}
+
#[test]
fn test_array_out_of_range_positive() {
let c: Result = [1000, 10000, 256].try_into();
- assert_eq!(c, Err(IntoColorError::IntConversion));
+ assert_eq!(c, Err(IntConversion));
}
+
#[test]
fn test_array_out_of_range_negative() {
let c: Result = [-10, -256, -1].try_into();
- assert_eq!(c, Err(IntoColorError::IntConversion));
+ assert_eq!(c, Err(IntConversion));
}
+
#[test]
fn test_array_sum() {
let c: Result = [-1, 255, 255].try_into();
- assert_eq!(c, Err(IntoColorError::IntConversion));
+ assert_eq!(c, Err(IntConversion));
}
+
#[test]
fn test_array_correct() {
let c: Result = [183, 65, 14].try_into();
@@ -142,30 +129,25 @@ mod tests {
}
);
}
+
#[test]
fn test_slice_out_of_range_positive() {
let arr = [10000, 256, 1000];
- assert_eq!(
- Color::try_from(&arr[..]),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from(&arr[..]), Err(IntConversion));
}
+
#[test]
fn test_slice_out_of_range_negative() {
let arr = [-256, -1, -10];
- assert_eq!(
- Color::try_from(&arr[..]),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from(&arr[..]), Err(IntConversion));
}
+
#[test]
fn test_slice_sum() {
let arr = [-1, 255, 255];
- assert_eq!(
- Color::try_from(&arr[..]),
- Err(IntoColorError::IntConversion)
- );
+ assert_eq!(Color::try_from(&arr[..]), Err(IntConversion));
}
+
#[test]
fn test_slice_correct() {
let v = vec![183, 65, 14];
@@ -176,18 +158,20 @@ mod tests {
Color {
red: 183,
green: 65,
- blue: 14
+ blue: 14,
}
);
}
+
#[test]
fn test_slice_excess_length() {
let v = vec![0, 0, 0, 0];
- assert_eq!(Color::try_from(&v[..]), Err(IntoColorError::BadLen));
+ assert_eq!(Color::try_from(&v[..]), Err(BadLen));
}
+
#[test]
fn test_slice_insufficient_length() {
let v = vec![0, 0];
- assert_eq!(Color::try_from(&v[..]), Err(IntoColorError::BadLen));
+ assert_eq!(Color::try_from(&v[..]), Err(BadLen));
}
}
diff --git a/exercises/23_conversions/using_as.rs b/exercises/23_conversions/using_as.rs
index 414cef3..c131d1f 100644
--- a/exercises/23_conversions/using_as.rs
+++ b/exercises/23_conversions/using_as.rs
@@ -1,19 +1,10 @@
-// using_as.rs
-//
-// Type casting in Rust is done via the usage of the `as` operator. Please note
-// that the `as` operator is not only used when type casting. It also helps with
-// renaming imports.
-//
-// The goal is to make sure that the division does not fail to compile and
-// returns the proper type.
-//
-// Execute `rustlings hint using_as` or use the `hint` watch subcommand for a
-// hint.
-
-// I AM NOT DONE
+// Type casting in Rust is done via the usage of the `as` operator.
+// Note that the `as` operator is not only used when type casting. It also helps
+// with renaming imports.
fn average(values: &[f64]) -> f64 {
let total = values.iter().sum::();
+ // TODO: Make a conversion before dividing.
total / values.len()
}
diff --git a/exercises/README.md b/exercises/README.md
index c7effa9..237f2f1 100644
--- a/exercises/README.md
+++ b/exercises/README.md
@@ -17,11 +17,11 @@
| error_handling | §9 |
| generics | §10 |
| traits | §10.2 |
-| tests | §11.1 |
| lifetimes | §10.3 |
+| tests | §11.1 |
| iterators | §13.2-4 |
-| threads | §16.1-3 |
| smart_pointers | §15, §16.3 |
-| macros | §19.6 |
+| threads | §16.1-3 |
+| macros | §19.5 |
| clippy | §21.4 |
| conversions | n/a |
diff --git a/exercises/quiz1.rs b/exercises/quiz1.rs
deleted file mode 100644
index 4ee5ada..0000000
--- a/exercises/quiz1.rs
+++ /dev/null
@@ -1,33 +0,0 @@
-// quiz1.rs
-//
-// This is a quiz for the following sections:
-// - Variables
-// - Functions
-// - If
-//
-// Mary is buying apples. The price of an apple is calculated as follows:
-// - An apple costs 2 rustbucks.
-// - If Mary buys more than 40 apples, each apple only costs 1 rustbuck!
-// Write a function that calculates the price of an order of apples given the
-// quantity bought.
-//
-// No hints this time ;)
-
-// I AM NOT DONE
-
-// Put your function here!
-// fn calculate_price_of_apples {
-
-// Don't modify this function!
-#[test]
-fn verify_test() {
- let price1 = calculate_price_of_apples(35);
- let price2 = calculate_price_of_apples(40);
- let price3 = calculate_price_of_apples(41);
- let price4 = calculate_price_of_apples(65);
-
- assert_eq!(70, price1);
- assert_eq!(80, price2);
- assert_eq!(41, price3);
- assert_eq!(65, price4);
-}
diff --git a/exercises/quiz2.rs b/exercises/quiz2.rs
deleted file mode 100644
index 29925ca..0000000
--- a/exercises/quiz2.rs
+++ /dev/null
@@ -1,64 +0,0 @@
-// quiz2.rs
-//
-// This is a quiz for the following sections:
-// - Strings
-// - Vecs
-// - Move semantics
-// - Modules
-// - Enums
-//
-// Let's build a little machine in the form of a function. As input, we're going
-// to give a list of strings and commands. These commands determine what action
-// is going to be applied to the string. It can either be:
-// - Uppercase the string
-// - Trim the string
-// - Append "bar" to the string a specified amount of times
-// The exact form of this will be:
-// - The input is going to be a Vector of a 2-length tuple,
-// the first element is the string, the second one is the command.
-// - The output element is going to be a Vector of strings.
-//
-// No hints this time!
-
-// I AM NOT DONE
-
-pub enum Command {
- Uppercase,
- Trim,
- Append(usize),
-}
-
-mod my_module {
- use super::Command;
-
- // TODO: Complete the function signature!
- pub fn transformer(input: ???) -> ??? {
- // TODO: Complete the output declaration!
- let mut output: ??? = vec![];
- for (string, command) in input.iter() {
- // TODO: Complete the function body. You can do it!
- }
- output
- }
-}
-
-#[cfg(test)]
-mod tests {
- // TODO: What do we need to import to have `transformer` in scope?
- use ???;
- use super::Command;
-
- #[test]
- fn it_works() {
- let output = transformer(vec![
- ("hello".into(), Command::Uppercase),
- (" all roads lead to rome! ".into(), Command::Trim),
- ("foo".into(), Command::Append(1)),
- ("bar".into(), Command::Append(5)),
- ]);
- assert_eq!(output[0], "HELLO");
- assert_eq!(output[1], "all roads lead to rome!");
- assert_eq!(output[2], "foobar");
- assert_eq!(output[3], "barbarbarbarbarbar");
- }
-}
diff --git a/exercises/quizzes/README.md b/exercises/quizzes/README.md
new file mode 100644
index 0000000..4d3bcd9
--- /dev/null
+++ b/exercises/quizzes/README.md
@@ -0,0 +1,3 @@
+# Quizzes
+
+After every couple of sections, there will be a quiz in this directory that'll test your knowledge on a bunch of sections at once.
diff --git a/exercises/quizzes/quiz1.rs b/exercises/quizzes/quiz1.rs
new file mode 100644
index 0000000..afbf1f9
--- /dev/null
+++ b/exercises/quizzes/quiz1.rs
@@ -0,0 +1,31 @@
+// This is a quiz for the following sections:
+// - Variables
+// - Functions
+// - If
+//
+// Mary is buying apples. The price of an apple is calculated as follows:
+// - An apple costs 2 rustbucks.
+// - If Mary buys more than 40 apples, each apple only costs 1 rustbuck!
+// TODO: Write a function that calculates the price of an order of apples given
+// the quantity bought.
+
+// Put your function here!
+// fn calculate_price_of_apples(???) -> ??? {
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+// Don't change the tests!
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn verify_test() {
+ assert_eq!(calculate_price_of_apples(35), 70);
+ assert_eq!(calculate_price_of_apples(40), 80);
+ assert_eq!(calculate_price_of_apples(41), 41);
+ assert_eq!(calculate_price_of_apples(65), 65);
+ }
+}
diff --git a/exercises/quizzes/quiz2.rs b/exercises/quizzes/quiz2.rs
new file mode 100644
index 0000000..8ef1342
--- /dev/null
+++ b/exercises/quizzes/quiz2.rs
@@ -0,0 +1,63 @@
+// This is a quiz for the following sections:
+// - Strings
+// - Vecs
+// - Move semantics
+// - Modules
+// - Enums
+//
+// Let's build a little machine in the form of a function. As input, we're going
+// to give a list of strings and commands. These commands determine what action
+// is going to be applied to the string. It can either be:
+// - Uppercase the string
+// - Trim the string
+// - Append "bar" to the string a specified amount of times
+//
+// The exact form of this will be:
+// - The input is going to be a Vector of 2-length tuples,
+// the first element is the string, the second one is the command.
+// - The output element is going to be a vector of strings.
+
+enum Command {
+ Uppercase,
+ Trim,
+ Append(usize),
+}
+
+mod my_module {
+ use super::Command;
+
+ // TODO: Complete the function.
+ // pub fn transformer(input: ???) -> ??? { ??? }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ // TODO: What do we need to import to have `transformer` in scope?
+ // use ???;
+ use super::Command;
+
+ #[test]
+ fn it_works() {
+ let input = vec![
+ ("hello".to_string(), Command::Uppercase),
+ (" all roads lead to rome! ".to_string(), Command::Trim),
+ ("foo".to_string(), Command::Append(1)),
+ ("bar".to_string(), Command::Append(5)),
+ ];
+ let output = transformer(input);
+
+ assert_eq!(
+ output,
+ [
+ "HELLO",
+ "all roads lead to rome!",
+ "foobar",
+ "barbarbarbarbarbar",
+ ]
+ );
+ }
+}
diff --git a/exercises/quiz3.rs b/exercises/quizzes/quiz3.rs
similarity index 51%
rename from exercises/quiz3.rs
rename to exercises/quizzes/quiz3.rs
index 3b01d31..c877c5f 100644
--- a/exercises/quiz3.rs
+++ b/exercises/quizzes/quiz3.rs
@@ -1,36 +1,37 @@
-// quiz3.rs
-//
// This quiz tests:
// - Generics
// - Traits
//
// An imaginary magical school has a new report card generation system written
-// in Rust! Currently the system only supports creating report cards where the
+// in Rust! Currently, the system only supports creating report cards where the
// student's grade is represented numerically (e.g. 1.0 -> 5.5). However, the
// school also issues alphabetical grades (A+ -> F-) and needs to be able to
// print both types of report card!
//
-// Make the necessary code changes in the struct ReportCard and the impl block
-// to support alphabetical report cards. Change the Grade in the second test to
-// "A+" to show that your changes allow alphabetical grades.
-//
-// Execute `rustlings hint quiz3` or use the `hint` watch subcommand for a hint.
+// Make the necessary code changes in the struct `ReportCard` and the impl
+// block to support alphabetical report cards in addition to numerical ones.
-// I AM NOT DONE
-
-pub struct ReportCard {
- pub grade: f32,
- pub student_name: String,
- pub student_age: u8,
+// TODO: Adjust the struct as described above.
+struct ReportCard {
+ grade: f32,
+ student_name: String,
+ student_age: u8,
}
+// TODO: Adjust the impl block as described above.
impl ReportCard {
- pub fn print(&self) -> String {
- format!("{} ({}) - achieved a grade of {}",
- &self.student_name, &self.student_age, &self.grade)
+ fn print(&self) -> String {
+ format!(
+ "{} ({}) - achieved a grade of {}",
+ &self.student_name, &self.student_age, &self.grade,
+ )
}
}
+fn main() {
+ // You can optionally experiment here.
+}
+
#[cfg(test)]
mod tests {
use super::*;
@@ -44,21 +45,20 @@ mod tests {
};
assert_eq!(
report_card.print(),
- "Tom Wriggle (12) - achieved a grade of 2.1"
+ "Tom Wriggle (12) - achieved a grade of 2.1",
);
}
#[test]
fn generate_alphabetic_report_card() {
- // TODO: Make sure to change the grade here after you finish the exercise.
let report_card = ReportCard {
- grade: 2.1,
+ grade: "A+",
student_name: "Gary Plotter".to_string(),
student_age: 11,
};
assert_eq!(
report_card.print(),
- "Gary Plotter (11) - achieved a grade of A+"
+ "Gary Plotter (11) - achieved a grade of A+",
);
}
}
diff --git a/flake.lock b/flake.lock
deleted file mode 100644
index 1523898..0000000
--- a/flake.lock
+++ /dev/null
@@ -1,78 +0,0 @@
-{
- "nodes": {
- "flake-compat": {
- "flake": false,
- "locked": {
- "lastModified": 1673956053,
- "narHash": "sha256-4gtG9iQuiKITOjNQQeQIpoIB6b16fm+504Ch3sNKLd8=",
- "owner": "edolstra",
- "repo": "flake-compat",
- "rev": "35bb57c0c8d8b62bbfd284272c928ceb64ddbde9",
- "type": "github"
- },
- "original": {
- "owner": "edolstra",
- "repo": "flake-compat",
- "type": "github"
- }
- },
- "flake-utils": {
- "inputs": {
- "systems": "systems"
- },
- "locked": {
- "lastModified": 1692799911,
- "narHash": "sha256-3eihraek4qL744EvQXsK1Ha6C3CR7nnT8X2qWap4RNk=",
- "owner": "numtide",
- "repo": "flake-utils",
- "rev": "f9e7cf818399d17d347f847525c5a5a8032e4e44",
- "type": "github"
- },
- "original": {
- "owner": "numtide",
- "repo": "flake-utils",
- "type": "github"
- }
- },
- "nixpkgs": {
- "locked": {
- "lastModified": 1694183432,
- "narHash": "sha256-YyPGNapgZNNj51ylQMw9lAgvxtM2ai1HZVUu3GS8Fng=",
- "owner": "nixos",
- "repo": "nixpkgs",
- "rev": "db9208ab987cdeeedf78ad9b4cf3c55f5ebd269b",
- "type": "github"
- },
- "original": {
- "owner": "nixos",
- "ref": "nixos-unstable",
- "repo": "nixpkgs",
- "type": "github"
- }
- },
- "root": {
- "inputs": {
- "flake-compat": "flake-compat",
- "flake-utils": "flake-utils",
- "nixpkgs": "nixpkgs"
- }
- },
- "systems": {
- "locked": {
- "lastModified": 1681028828,
- "narHash": "sha256-Vy1rq5AaRuLzOxct8nz4T6wlgyUR7zLU309k9mBC768=",
- "owner": "nix-systems",
- "repo": "default",
- "rev": "da67096a3b9bf56a91d16901293e51ba5b49a27e",
- "type": "github"
- },
- "original": {
- "owner": "nix-systems",
- "repo": "default",
- "type": "github"
- }
- }
- },
- "root": "root",
- "version": 7
-}
diff --git a/flake.nix b/flake.nix
deleted file mode 100644
index 152d38e..0000000
--- a/flake.nix
+++ /dev/null
@@ -1,78 +0,0 @@
-{
- description = "Small exercises to get you used to reading and writing Rust code";
-
- inputs = {
- flake-compat = {
- url = "github:edolstra/flake-compat";
- flake = false;
- };
- flake-utils.url = "github:numtide/flake-utils";
- nixpkgs.url = "github:nixos/nixpkgs/nixos-unstable";
- };
-
- outputs = { self, flake-utils, nixpkgs, ... }:
- flake-utils.lib.eachDefaultSystem (system:
- let
- pkgs = nixpkgs.legacyPackages.${system};
-
- cargoBuildInputs = with pkgs; lib.optionals stdenv.isDarwin [
- darwin.apple_sdk.frameworks.CoreServices
- ];
-
- rustlings =
- pkgs.rustPlatform.buildRustPackage {
- name = "rustlings";
- version = "5.6.1";
-
- buildInputs = cargoBuildInputs;
- nativeBuildInputs = [pkgs.git];
-
- src = with pkgs.lib; cleanSourceWith {
- src = self;
- # a function that returns a bool determining if the path should be included in the cleaned source
- filter = path: type:
- let
- # filename
- baseName = builtins.baseNameOf (toString path);
- # path from root directory
- path' = builtins.replaceStrings [ "${self}/" ] [ "" ] path;
- # checks if path is in the directory
- inDirectory = directory: hasPrefix directory path';
- in
- inDirectory "src" ||
- inDirectory "tests" ||
- hasPrefix "Cargo" baseName ||
- baseName == "info.toml";
- };
-
- cargoLock.lockFile = ./Cargo.lock;
- };
- in
- {
- devShell = pkgs.mkShell {
- RUST_SRC_PATH = "${pkgs.rust.packages.stable.rustPlatform.rustLibSrc}";
-
- buildInputs = with pkgs; [
- cargo
- rustc
- rust-analyzer
- rustlings
- rustfmt
- clippy
- ] ++ cargoBuildInputs;
- };
- apps = let
- rustlings-app = {
- type = "app";
- program = "${rustlings}/bin/rustlings";
- };
- in {
- default = rustlings-app;
- rustlings = rustlings-app;
- };
- packages = {
- inherit rustlings;
- default = rustlings;
- };
- });
-}
diff --git a/install.ps1 b/install.ps1
deleted file mode 100644
index 844b013..0000000
--- a/install.ps1
+++ /dev/null
@@ -1,94 +0,0 @@
-#!/usr/bin/env pwsh
-
-#Requires -Version 5
-param($path = "$home/rustlings")
-
-Write-Host "Let's get you set up with Rustlings!"
-
-Write-Host "Checking requirements..."
-if (Get-Command git -ErrorAction SilentlyContinue) {
- Write-Host "SUCCESS: Git is installed"
-} else {
- Write-Host "WARNING: Git does not seem to be installed."
- Write-Host "Please download Git using your package manager or over https://git-scm.com/!"
- exit 1
-}
-
-if (Get-Command rustc -ErrorAction SilentlyContinue) {
- Write-Host "SUCCESS: Rust is installed"
-} else {
- Write-Host "WARNING: Rust does not seem to be installed."
- Write-Host "Please download Rust using https://rustup.rs!"
- exit 1
-}
-
-if (Get-Command cargo -ErrorAction SilentlyContinue) {
- Write-Host "SUCCESS: Cargo is installed"
-} else {
- Write-Host "WARNING: Cargo does not seem to be installed."
- Write-Host "Please download Rust and Cargo using https://rustup.rs!"
- exit 1
-}
-
-# Function that compares two versions strings v1 and v2 given in arguments (e.g 1.31 and 1.33.0).
-# Returns 1 if v1 > v2, 0 if v1 == v2, 2 if v1 < v2.
-function vercomp($v1, $v2) {
- if ($v1 -eq $v2) {
- return 0
- }
-
- $v1 = $v1.Replace(".", "0")
- $v2 = $v2.Replace(".", "0")
- if ($v1.Length -gt $v2.Length) {
- $v2 = $v2.PadRight($v1.Length, "0")
- } else {
- $v1 = $v1.PadRight($v2.Length, "0")
- }
-
- if ($v1 -gt $v2) {
- return 1
- } else {
- return 2
- }
-}
-
-$rustVersion = $(rustc --version).Split(" ")[1]
-$minRustVersion = "1.70"
-if ((vercomp $rustVersion $minRustVersion) -eq 2) {
- Write-Host "WARNING: Rust version is too old: $rustVersion - needs at least $minRustVersion"
- Write-Host "Please update Rust with 'rustup update'"
- exit 1
-} else {
- Write-Host "SUCCESS: Rust is up to date"
-}
-
-Write-Host "Cloning Rustlings at $path"
-git clone -q https://github.com/rust-lang/rustlings $path
-if (!($LASTEXITCODE -eq 0)) {
- exit 1
-}
-
-# UseBasicParsing is deprecated, pwsh 6 or above will automatically use it,
-# but anyone running pwsh 5 will have to pass the argument.
-$version = Invoke-WebRequest -UseBasicParsing https://api.github.com/repos/rust-lang/rustlings/releases/latest `
- | ConvertFrom-Json | Select-Object -ExpandProperty tag_name
-
-Write-Host "Checking out version $version..."
-Set-Location $path
-git checkout -q tags/$version
-
-Write-Host "Installing the 'rustlings' executable..."
-cargo install --force --path .
-if (!(Get-Command rustlings -ErrorAction SilentlyContinue)) {
- Write-Host "WARNING: Please check that you have '~/.cargo/bin' in your PATH environment variable!"
-}
-
-# Checking whether Clippy is installed.
-# Due to a bug in Cargo, this must be done with Rustup: https://github.com/rust-lang/rustup/issues/1514
-$clippy = (rustup component list | Select-String "clippy" | Select-String "installed") | Out-String
-if (!$clippy) {
- Write-Host "Installing the 'cargo-clippy' executable..."
- rustup component add clippy
-}
-
-Write-Host "All done! Navigate to $path and run 'rustlings' to get started!"
diff --git a/install.sh b/install.sh
deleted file mode 100755
index 5915a33..0000000
--- a/install.sh
+++ /dev/null
@@ -1,184 +0,0 @@
-#!/usr/bin/env bash
-set -euo pipefail
-
-echo -e "\nLet's get you set up with Rustlings!"
-
-echo "Checking requirements..."
-if [ -x "$(command -v git)" ]
-then
- echo "SUCCESS: Git is installed"
-else
- echo "ERROR: Git does not seem to be installed."
- echo "Please download Git using your package manager or over https://git-scm.com/!"
- exit 1
-fi
-
-if [ -x "$(command -v cc)" ]
-then
- echo "SUCCESS: cc is installed"
-else
- echo "ERROR: cc does not seem to be installed."
- echo "Please download (g)cc using your package manager."
- echo "OSX: xcode-select --install"
- echo "Deb: sudo apt install gcc"
- echo "Yum: sudo yum -y install gcc"
- exit 1
-fi
-
-if [ -x "$(command -v rustup)" ]
-then
- echo "SUCCESS: rustup is installed"
-else
- echo "ERROR: rustup does not seem to be installed."
- echo "Please download rustup using https://rustup.rs!"
- exit 1
-fi
-
-if [ -x "$(command -v rustc)" ]
-then
- echo "SUCCESS: Rust is installed"
-else
- echo "ERROR: Rust does not seem to be installed."
- echo "Please download Rust using rustup!"
- exit 1
-fi
-
-if [ -x "$(command -v cargo)" ]
-then
- echo "SUCCESS: Cargo is installed"
-else
- echo "ERROR: Cargo does not seem to be installed."
- echo "Please download Rust and Cargo using rustup!"
- exit 1
-fi
-
-# Look up python installations, starting with 3 with a fallback of 2
-if [ -x "$(command -v python3)" ]
-then
- PY="$(command -v python3)"
-elif [ -x "$(command -v python)" ]
-then
- PY="$(command -v python)"
-elif [ -x "$(command -v python2)" ]
-then
- PY="$(command -v python2)"
-else
- echo "ERROR: No working python installation was found"
- echo "Please install python and add it to the PATH variable"
- exit 1
-fi
-
-# Function that compares two versions strings v1 and v2 given in arguments (e.g 1.31 and 1.33.0).
-# Returns 1 if v1 > v2, 0 if v1 == v2, 2 if v1 < v2.
-function vercomp() {
- if [[ $1 == $2 ]]
- then
- return 0
- fi
- v1=( ${1//./ } )
- v2=( ${2//./ } )
- len1=${#v1[@]}
- len2=${#v2[@]}
- max_len=$len1
- if [[ $max_len -lt $len2 ]]
- then
- max_len=$len2
- fi
-
- #pad right in short arr
- if [[ len1 -gt len2 ]];
- then
- for ((i = len2; i < len1; i++));
- do
- v2[$i]=0
- done
- else
- for ((i = len1; i < len2; i++));
- do
- v1[$i]=0
- done
- fi
-
- for i in `seq 0 $((max_len-1))`
- do
- # Fill empty fields with zeros in v1
- if [ -z "${v1[$i]}" ]
- then
- v1[$i]=0
- fi
- # And in v2
- if [ -z "${v2[$i]}" ]
- then
- v2[$i]=0
- fi
- if [ ${v1[$i]} -gt ${v2[$i]} ]
- then
- return 1
- fi
- if [ ${v1[$i]} -lt ${v2[$i]} ]
- then
- return 2
- fi
- done
- return 0
-}
-
-RustVersion=$(rustc --version | cut -d " " -f 2)
-MinRustVersion=1.70
-vercomp "$RustVersion" $MinRustVersion || ec=$?
-if [ ${ec:-0} -eq 2 ]
-then
- echo "ERROR: Rust version is too old: $RustVersion - needs at least $MinRustVersion"
- echo "Please update Rust with 'rustup update'"
- exit 1
-else
- echo "SUCCESS: Rust is up to date"
-fi
-
-Path=${1:-rustlings/}
-echo "Cloning Rustlings at $Path..."
-git clone -q https://github.com/rust-lang/rustlings "$Path"
-
-cd "$Path"
-
-Version=$(curl -s https://api.github.com/repos/rust-lang/rustlings/releases/latest | ${PY} -c "import json,sys;obj=json.load(sys.stdin);print(obj['tag_name']) if 'tag_name' in obj else sys.exit(f\"Error: {obj['message']}\");")
-CargoBin="${CARGO_HOME:-$HOME/.cargo}/bin"
-
-if [[ -z ${Version} ]]
-then
- echo "The latest tag version could not be fetched remotely."
- echo "Using the local git repository..."
- Version=$(ls -tr .git/refs/tags/ | tail -1)
- if [[ -z ${Version} ]]
- then
- echo "No valid tag version found"
- echo "Rustlings will be installed using the main branch"
- Version="main"
- else
- Version="tags/${Version}"
- fi
-else
- Version="tags/${Version}"
-fi
-
-echo "Checking out version $Version..."
-git checkout -q ${Version}
-
-echo "Installing the 'rustlings' executable..."
-cargo install --force --path .
-
-if ! [ -x "$(command -v rustlings)" ]
-then
- echo "WARNING: Please check that you have '$CargoBin' in your PATH environment variable!"
-fi
-
-# Checking whether Clippy is installed.
-# Due to a bug in Cargo, this must be done with Rustup: https://github.com/rust-lang/rustup/issues/1514
-Clippy=$(rustup component list | grep "clippy" | grep "installed")
-if [ -z "$Clippy" ]
-then
- echo "Installing the 'cargo-clippy' executable..."
- rustup component add clippy
-fi
-
-echo "All done! Run 'rustlings' to get started."
diff --git a/oranda.json b/oranda.json
index be88e5e..ecc490b 100644
--- a/oranda.json
+++ b/oranda.json
@@ -9,16 +9,5 @@
"domain": "rustlings.cool"
}
}
- },
- "components": {
- "artifacts": {
- "auto": true,
- "package_managers": {
- "preferred": {
- "macos/linux/unix": "curl -L https://raw.githubusercontent.com/rust-lang/rustlings/main/install.sh | bash",
- "windows": "Start-BitsTransfer -Source https://raw.githubusercontent.com/rust-lang/rustlings/main/install.ps1 -Destination $env:TMP/install_rustlings.ps1; Unblock-File $env:TMP/install_rustlings.ps1; Invoke-Expression $env:TMP/install_rustlings.ps1"
- }
- }
- }
}
}
diff --git a/release-hook.sh b/release-hook.sh
new file mode 100755
index 0000000..052832f
--- /dev/null
+++ b/release-hook.sh
@@ -0,0 +1,9 @@
+#!/bin/bash
+
+# Error out if any command fails
+set -e
+
+cargo run -- dev check
+typos
+cargo outdated -w --exit-code 1
+cargo test --workspace --all-targets
diff --git a/rustlings-macros/Cargo.toml b/rustlings-macros/Cargo.toml
new file mode 100644
index 0000000..20d6776
--- /dev/null
+++ b/rustlings-macros/Cargo.toml
@@ -0,0 +1,20 @@
+[package]
+name = "rustlings-macros"
+description = "A macros crate intended to be used only by Rustlings"
+version.workspace = true
+authors.workspace = true
+repository.workspace = true
+license.workspace = true
+edition.workspace = true
+include = [
+ "/src/",
+ "/info.toml",
+]
+
+[lib]
+proc-macro = true
+
+[dependencies]
+quote = "1.0.36"
+serde.workspace = true
+toml_edit.workspace = true
diff --git a/info.toml b/rustlings-macros/info.toml
similarity index 51%
rename from info.toml
rename to rustlings-macros/info.toml
index 578d01c..8b72046 100644
--- a/info.toml
+++ b/rustlings-macros/info.toml
@@ -1,39 +1,68 @@
+format_version = 1
+
+welcome_message = """Is this your first time? Don't worry, Rustlings is made for beginners!
+We are going to teach you a lot of things about Rust, but before we can
+get started, here are some notes about how Rustlings operates:
+
+1. The central concept behind Rustlings is that you solve exercises. These
+ exercises usually contain some compiler or logic errors which cause the
+ exercise to fail compilation or testing. It's your job to find all errors
+ and fix them!
+2. Make sure to have your editor open in the `rustlings/` directory. Rustlings
+ will show you the path of the current exercise under the progress bar. Open
+ the exercise file in your editor, fix errors and save the file. Rustlings will
+ automatically detect the file change and rerun the exercise. If all errors are
+ fixed, Rustlings will ask you to move on to the next exercise.
+3. If you're stuck on an exercise, enter `h` to show a hint.
+4. If an exercise doesn't make sense to you, feel free to open an issue on GitHub!
+ (https://github.com/rust-lang/rustlings). We look at every issue, and sometimes,
+ other learners do too so you can help each other out!"""
+
+final_message = """We hope you enjoyed learning about the various aspects of Rust!
+If you noticed any issues, don't hesitate to report them on Github.
+You can also contribute your own exercises to help the greater community!
+
+Before reporting an issue or contributing, please read our guidelines:
+https://github.com/rust-lang/rustlings/blob/main/CONTRIBUTING.md"""
+
# INTRO
[[exercises]]
name = "intro1"
-path = "exercises/00_intro/intro1.rs"
-mode = "compile"
+dir = "00_intro"
+test = false
+skip_check_unsolved = true
hint = """
-Remove the `I AM NOT DONE` comment in the `exercises/intro00/intro1.rs` file
-to move on to the next exercise."""
+Enter `n` to move on to the next exercise.
+You might need to press ENTER after typing `n`."""
[[exercises]]
name = "intro2"
-path = "exercises/00_intro/intro2.rs"
-mode = "compile"
+dir = "00_intro"
+test = false
hint = """
-The compiler is informing us that we've got the name of the print macro wrong, and has suggested an alternative."""
+The compiler is informing us that we've got the name of the print macro wrong.
+It also suggests an alternative."""
# VARIABLES
[[exercises]]
name = "variables1"
-path = "exercises/01_variables/variables1.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
-The declaration in the first line in the main function is missing a keyword
-that is needed in Rust to create a new variable binding."""
+The declaration in the `main` function is missing a keyword that is needed
+in Rust to create a new variable binding."""
[[exercises]]
name = "variables2"
-path = "exercises/01_variables/variables2.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
-The compiler message is saying that Rust cannot infer the type that the
+The compiler message is saying that Rust can't infer the type that the
variable binding `x` has with what is given here.
-What happens if you annotate the first line in the main function with a type
+What happens if you annotate the first line in the `main` function with a type
annotation?
What if you give `x` a value?
@@ -46,12 +75,12 @@ What if `x` is the same type as `10`? What if it's a different type?"""
[[exercises]]
name = "variables3"
-path = "exercises/01_variables/variables3.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
-Oops! In this exercise, we have a variable binding that we've created on in the
-first line in the `main` function, and we're trying to use it in the next line,
-but we haven't given it a value.
+In this exercise, we have a variable binding that we've created in the `main`
+function, and we're trying to use it in the next line, but we haven't given it
+a value.
We can't print out something that isn't there; try giving `x` a value!
@@ -60,17 +89,17 @@ programming language -- thankfully the Rust compiler has caught this for us!"""
[[exercises]]
name = "variables4"
-path = "exercises/01_variables/variables4.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
-In Rust, variable bindings are immutable by default. But here we're trying
+In Rust, variable bindings are immutable by default. But here, we're trying
to reassign a different value to `x`! There's a keyword we can use to make
a variable binding mutable instead."""
[[exercises]]
name = "variables5"
-path = "exercises/01_variables/variables5.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
In `variables4` we already learned how to make an immutable variable mutable
using a special keyword. Unfortunately this doesn't help us much in this
@@ -87,89 +116,80 @@ Try to solve this exercise afterwards using this technique."""
[[exercises]]
name = "variables6"
-path = "exercises/01_variables/variables6.rs"
-mode = "compile"
+dir = "01_variables"
+test = false
hint = """
We know about variables and mutability, but there is another important type of
-variable available: constants.
+variables available: constants.
-Constants are always immutable and they are declared with keyword `const` rather
-than keyword `let`.
+Constants are always immutable. They are declared with the keyword `const` instead
+of `let`.
-Constants types must also always be annotated.
+The type of Constants must always be annotated.
Read more about constants and the differences between variables and constants
under 'Constants' in the book's section 'Variables and Mutability':
-https://doc.rust-lang.org/book/ch03-01-variables-and-mutability.html#constants
-"""
+https://doc.rust-lang.org/book/ch03-01-variables-and-mutability.html#constants"""
# FUNCTIONS
[[exercises]]
name = "functions1"
-path = "exercises/02_functions/functions1.rs"
-mode = "compile"
+dir = "02_functions"
+test = false
hint = """
-This main function is calling a function that it expects to exist, but the
+This `main` function is calling a function that it expects to exist, but the
function doesn't exist. It expects this function to have the name `call_me`.
-It expects this function to not take any arguments and not return a value.
+It also expects this function to not take any arguments and not return a value.
Sounds a lot like `main`, doesn't it?"""
[[exercises]]
name = "functions2"
-path = "exercises/02_functions/functions2.rs"
-mode = "compile"
+dir = "02_functions"
+test = false
hint = """
Rust requires that all parts of a function's signature have type annotations,
but `call_me` is missing the type annotation of `num`."""
[[exercises]]
name = "functions3"
-path = "exercises/02_functions/functions3.rs"
-mode = "compile"
+dir = "02_functions"
+test = false
hint = """
This time, the function *declaration* is okay, but there's something wrong
-with the place where we're calling the function.
-
-As a reminder, you can freely play around with different solutions in Rustlings!
-Watch mode will only jump to the next exercise if you remove the `I AM NOT
-DONE` comment."""
+with the place where we are calling the function."""
[[exercises]]
name = "functions4"
-path = "exercises/02_functions/functions4.rs"
-mode = "compile"
+dir = "02_functions"
+test = false
hint = """
The error message points to the function `sale_price` and says it expects a type
-after the `->`. This is where the function's return type should be -- take a
-look at the `is_even` function for an example!
-
-Also: Did you figure out that, technically, `u32` would be the more fitting type
-for the prices here, since they can't be negative? If so, kudos!"""
+after `->`. This is where the function's return type should be.
+Take a look at the `is_even` function for an example!"""
[[exercises]]
name = "functions5"
-path = "exercises/02_functions/functions5.rs"
-mode = "compile"
+dir = "02_functions"
+test = false
hint = """
This is a really common error that can be fixed by removing one character.
It happens because Rust distinguishes between expressions and statements:
-expressions return a value based on their operand(s), and statements simply
-return a `()` type which behaves just like `void` in C/C++ language.
+Expressions return a value based on their operand(s), and statements simply
+return a `()` type which behaves just like `void` in C/C++.
-We want to return a value of `i32` type from the `square` function, but it is
-returning a `()` type...
+We want to return a value with the type `i32` from the `square` function, but
+it is returning the type `()`.
-They are not the same. There are two solutions:
-1. Add a `return` ahead of `num * num;`
-2. remove `;`, make it to be `num * num`"""
+There are two solutions:
+1. Add the `return` keyword before `num * num;`
+2. Remove the semicolon `;` after `num * num`"""
# IF
[[exercises]]
name = "if1"
-path = "exercises/03_if/if1.rs"
-mode = "test"
+dir = "03_if"
hint = """
It's possible to do this in one line if you would like!
@@ -178,23 +198,23 @@ Some similar examples from other languages:
- In Python this would be: `a if a > b else b`
Remember in Rust that:
-- the `if` condition does not need to be surrounded by parentheses
+- The `if` condition does not need to be surrounded by parentheses
- `if`/`else` conditionals are expressions
-- Each condition is followed by a `{}` block."""
+- Each condition is followed by a `{}` block"""
[[exercises]]
name = "if2"
-path = "exercises/03_if/if2.rs"
-mode = "test"
+dir = "03_if"
hint = """
For that first compiler error, it's important in Rust that each conditional
-block returns the same type! To get the tests passing, you will need a couple
-conditions checking different input values."""
+block returns the same type!
+
+To get the tests passing, you will need a couple conditions checking different
+input values. Read the tests to find out what they expect."""
[[exercises]]
name = "if3"
-path = "exercises/03_if/if3.rs"
-mode = "test"
+dir = "03_if"
hint = """
In Rust, every arm of an `if` expression has to return the same type of value.
Make sure the type is consistent across all arms."""
@@ -203,30 +223,32 @@ Make sure the type is consistent across all arms."""
[[exercises]]
name = "quiz1"
-path = "exercises/quiz1.rs"
-mode = "test"
+dir = "quizzes"
hint = "No hints this time ;)"
# PRIMITIVE TYPES
[[exercises]]
name = "primitive_types1"
-path = "exercises/04_primitive_types/primitive_types1.rs"
-mode = "compile"
-hint = "No hints this time ;)"
+dir = "04_primitive_types"
+test = false
+hint = """
+In Rust, a boolean can be negated using the operator `!` before it.
+Example: `!true == false`
+This also works with boolean variables."""
[[exercises]]
name = "primitive_types2"
-path = "exercises/04_primitive_types/primitive_types2.rs"
-mode = "compile"
+dir = "04_primitive_types"
+test = false
hint = "No hints this time ;)"
[[exercises]]
name = "primitive_types3"
-path = "exercises/04_primitive_types/primitive_types3.rs"
-mode = "compile"
+dir = "04_primitive_types"
+test = false
hint = """
-There's a shorthand to initialize Arrays with a certain size that does not
+There's a shorthand to initialize arrays with a certain size that doesn't
require you to type in 100 items (but you certainly can if you want!).
For example, you can do:
@@ -239,23 +261,22 @@ for `a.len() >= 100`?"""
[[exercises]]
name = "primitive_types4"
-path = "exercises/04_primitive_types/primitive_types4.rs"
-mode = "test"
+dir = "04_primitive_types"
hint = """
Take a look at the 'Understanding Ownership -> Slices -> Other Slices' section
of the book: https://doc.rust-lang.org/book/ch04-03-slices.html and use the
-starting and ending (plus one) indices of the items in the `Array` that you
-want to end up in the slice.
+starting and ending (plus one) indices of the items in the array that you want
+to end up in the slice.
If you're curious why the first argument of `assert_eq!` does not have an
-ampersand for a reference since the second argument is areference, take a look
+ampersand for a reference since the second argument is a reference, take a look
at the coercion chapter of the nomicon:
https://doc.rust-lang.org/nomicon/coercions.html"""
[[exercises]]
name = "primitive_types5"
-path = "exercises/04_primitive_types/primitive_types5.rs"
-mode = "compile"
+dir = "04_primitive_types"
+test = false
hint = """
Take a look at the 'Data Types -> The Tuple Type' section of the book:
https://doc.rust-lang.org/book/ch03-02-data-types.html#the-tuple-type
@@ -263,98 +284,78 @@ Particularly the part about destructuring (second to last example in the
section).
You'll need to make a pattern to bind `name` and `age` to the appropriate parts
-of the tuple. You can do it!!"""
+of the tuple."""
[[exercises]]
name = "primitive_types6"
-path = "exercises/04_primitive_types/primitive_types6.rs"
-mode = "test"
+dir = "04_primitive_types"
hint = """
While you could use a destructuring `let` for the tuple here, try
indexing into it instead, as explained in the last example of the
'Data Types -> The Tuple Type' section of the book:
https://doc.rust-lang.org/book/ch03-02-data-types.html#the-tuple-type
-Now you have another tool in your toolbox!"""
+Now, you have another tool in your toolbox!"""
# VECS
[[exercises]]
name = "vecs1"
-path = "exercises/05_vecs/vecs1.rs"
-mode = "test"
+dir = "05_vecs"
hint = """
In Rust, there are two ways to define a Vector.
1. One way is to use the `Vec::new()` function to create a new vector
and fill it with the `push()` method.
-2. The second way, which is simpler is to use the `vec![]` macro and
- define your elements inside the square brackets.
+2. The second way is to use the `vec![]` macro and define your elements
+ inside the square brackets. This way is simpler when you exactly know
+ the initial values.
Check this chapter: https://doc.rust-lang.org/stable/book/ch08-01-vectors.html
-of the Rust book to learn more.
-"""
+of the Rust book to learn more."""
[[exercises]]
name = "vecs2"
-path = "exercises/05_vecs/vecs2.rs"
-mode = "test"
+dir = "05_vecs"
hint = """
-In the first function we are looping over the Vector and getting a reference to
-one `element` at a time.
+In the first function, we create an empty vector and want to push new elements
+to it.
-To modify the value of that `element` we need to use the `*` dereference
-operator. You can learn more in this chapter of the Rust book:
-https://doc.rust-lang.org/stable/book/ch08-01-vectors.html#iterating-over-the-values-in-a-vector
-
-In the second function this dereferencing is not necessary, because the `map`
-function expects the new value to be returned.
+In the second function, we map the values of the input and collect them into a vector.
After you've completed both functions, decide for yourself which approach you
like better.
-What do you think is the more commonly used pattern under Rust developers?
-"""
+What do you think is the more commonly used pattern under Rust developers?"""
# MOVE SEMANTICS
[[exercises]]
name = "move_semantics1"
-path = "exercises/06_move_semantics/move_semantics1.rs"
-mode = "test"
+dir = "06_move_semantics"
hint = """
-So you've got the "cannot borrow immutable local variable `vec` as mutable"
+So you've got the "cannot borrow `vec` as mutable, as it is not declared as mutable"
error on the line where we push an element to the vector, right?
The fix for this is going to be adding one keyword, and the addition is NOT on
the line where we push to the vector (where the error is).
-Also: Try accessing `vec0` after having called `fill_vec()`. See what
-happens!"""
+Try accessing `vec0` after having called `fill_vec()`. See what happens!"""
[[exercises]]
name = "move_semantics2"
-path = "exercises/06_move_semantics/move_semantics2.rs"
-mode = "test"
+dir = "06_move_semantics"
hint = """
When running this exercise for the first time, you'll notice an error about
"borrow of moved value". In Rust, when an argument is passed to a function and
it's not explicitly returned, you can't use the original variable anymore.
We call this "moving" a variable. When we pass `vec0` into `fill_vec`, it's
-being "moved" into `vec1`, meaning we can't access `vec0` anymore after the
-fact.
+being "moved" into `vec1`, meaning we can't access `vec0` anymore.
-Rust provides a couple of different ways to mitigate this issue, feel free to
-try them all:
-1. You could make another, separate version of the data that's in `vec0` and
- pass that to `fill_vec` instead.
-2. Make `fill_vec` borrow its argument instead of taking ownership of it,
- and then copy the data within the function (`vec.clone()`) in order to
- return an owned `Vec`.
-"""
+You could make another, separate version of the data that's in `vec0` and
+pass it to `fill_vec` instead."""
[[exercises]]
name = "move_semantics3"
-path = "exercises/06_move_semantics/move_semantics3.rs"
-mode = "test"
+dir = "06_move_semantics"
hint = """
The difference between this one and the previous ones is that the first line
of `fn fill_vec` that had `let mut vec = vec;` is no longer there. You can,
@@ -363,87 +364,63 @@ an existing binding to be a mutable binding instead of an immutable one :)"""
[[exercises]]
name = "move_semantics4"
-path = "exercises/06_move_semantics/move_semantics4.rs"
-mode = "test"
+dir = "06_move_semantics"
hint = """
-Stop reading whenever you feel like you have enough direction :) Or try
-doing one step and then fixing the compiler errors that result!
-So the end goal is to:
- - get rid of the first line in main that creates the new vector
- - so then `vec0` doesn't exist, so we can't pass it to `fill_vec`
- - `fill_vec` has had its signature changed, which our call should reflect
- - since we're not creating a new vec in `main` anymore, we need to create
- a new vec in `fill_vec`, and fill it with the expected values"""
+Carefully reason about the range in which each mutable reference is in
+scope. Does it help to update the value of `x` immediately after
+the mutable reference is taken?
+Read more about 'Mutable References' in the book's section 'References and Borrowing':
+https://doc.rust-lang.org/book/ch04-02-references-and-borrowing.html#mutable-references."""
[[exercises]]
name = "move_semantics5"
-path = "exercises/06_move_semantics/move_semantics5.rs"
-mode = "test"
-hint = """
-Carefully reason about the range in which each mutable reference is in
-scope. Does it help to update the value of referent (`x`) immediately after
-the mutable reference is taken? Read more about 'Mutable References'
-in the book's section 'References and Borrowing':
-https://doc.rust-lang.org/book/ch04-02-references-and-borrowing.html#mutable-references.
-"""
-
-[[exercises]]
-name = "move_semantics6"
-path = "exercises/06_move_semantics/move_semantics6.rs"
-mode = "compile"
+dir = "06_move_semantics"
+test = false
hint = """
To find the answer, you can consult the book section "References and Borrowing":
https://doc.rust-lang.org/stable/book/ch04-02-references-and-borrowing.html
The first problem is that `get_char` is taking ownership of the string. So
`data` is moved and can't be used for `string_uppercase`. `data` is moved to
-`get_char` first, meaning that `string_uppercase` cannot manipulate the data.
+`get_char` first, meaning that `string_uppercase` can't manipulate the data.
Once you've fixed that, `string_uppercase`'s function signature will also need
-to be adjusted.
-
-Can you figure out how?
-
-Another hint: it has to do with the `&` character."""
+to be adjusted."""
# STRUCTS
[[exercises]]
name = "structs1"
-path = "exercises/07_structs/structs1.rs"
-mode = "test"
+dir = "07_structs"
hint = """
Rust has more than one type of struct. Three actually, all variants are used to
package related data together.
-There are normal (or classic) structs. These are named collections of related
-data stored in fields.
+There are regular structs. These are named collections of related data stored in
+fields.
Tuple structs are basically just named tuples.
-Finally, Unit-like structs. These don't have any fields and are useful for
-generics.
+Finally, unit structs. These don't have any fields and are useful for generics.
-In this exercise you need to complete and implement one of each kind.
+In this exercise, you need to complete and implement one of each kind.
Read more about structs in The Book:
https://doc.rust-lang.org/book/ch05-01-defining-structs.html"""
[[exercises]]
name = "structs2"
-path = "exercises/07_structs/structs2.rs"
-mode = "test"
+dir = "07_structs"
hint = """
Creating instances of structs is easy, all you need to do is assign some values
to its fields.
There are however some shortcuts that can be taken when instantiating structs.
-Have a look in The Book, to find out more:
+Have a look in The Book to find out more:
https://doc.rust-lang.org/stable/book/ch05-01-defining-structs.html#creating-instances-from-other-instances-with-struct-update-syntax"""
[[exercises]]
name = "structs3"
-path = "exercises/07_structs/structs3.rs"
-mode = "test"
+dir = "07_structs"
hint = """
For `is_international`: What makes a package international? Seems related to
the places it goes through right?
@@ -451,43 +428,42 @@ the places it goes through right?
For `get_fees`: This method takes an additional argument, is there a field in
the `Package` struct that this relates to?
-Have a look in The Book, to find out more about method implementations:
+Have a look in The Book to find out more about method implementations:
https://doc.rust-lang.org/book/ch05-03-method-syntax.html"""
# ENUMS
[[exercises]]
name = "enums1"
-path = "exercises/08_enums/enums1.rs"
-mode = "compile"
+dir = "08_enums"
+test = false
hint = "No hints this time ;)"
[[exercises]]
name = "enums2"
-path = "exercises/08_enums/enums2.rs"
-mode = "compile"
+dir = "08_enums"
+test = false
hint = """
You can create enumerations that have different variants with different types
-such as anonymous structs, structs, a single string, tuples, no data, ...etc"""
+such as anonymous structs, a single string, tuples, no data, etc."""
[[exercises]]
name = "enums3"
-path = "exercises/08_enums/enums3.rs"
-mode = "test"
+dir = "08_enums"
hint = """
-As a first step, you can define enums to compile this code without errors.
+As a first step, define enums to compile the code without errors.
-And then create a match expression in `process()`.
+Then, create a match expression in `process()`.
Note that you need to deconstruct some message variants in the match expression
-to get value in the variant."""
+to get the variant's values."""
# STRINGS
[[exercises]]
name = "strings1"
-path = "exercises/09_strings/strings1.rs"
-mode = "compile"
+dir = "09_strings"
+test = false
hint = """
The `current_favorite_color` function is currently returning a string slice
with the `'static` lifetime. We know this because the data of the string lives
@@ -500,11 +476,11 @@ another way that uses the `From` trait."""
[[exercises]]
name = "strings2"
-path = "exercises/09_strings/strings2.rs"
-mode = "compile"
+dir = "09_strings"
+test = false
hint = """
Yes, it would be really easy to fix this by just changing the value bound to
-`word` to be a string slice instead of a `String`, wouldn't it?? There is a way
+`word` to be a string slice instead of a `String`, wouldn't it? There is a way
to add one character to the `if` statement, though, that will coerce the
`String` into a string slice.
@@ -515,10 +491,10 @@ https://doc.rust-lang.org/stable/book/ch15-02-deref.html#implicit-deref-coercion
[[exercises]]
name = "strings3"
-path = "exercises/09_strings/strings3.rs"
-mode = "test"
+dir = "09_strings"
hint = """
-There's tons of useful standard library functions for strings. Let's try and use some of them:
+There are many useful standard library functions for strings. Let's try and use
+some of them:
https://doc.rust-lang.org/std/string/struct.String.html#method.trim
For the `compose_me` method: You can either use the `format!` macro, or convert
@@ -526,137 +502,136 @@ the string slice into an owned string, which you can then freely extend."""
[[exercises]]
name = "strings4"
-path = "exercises/09_strings/strings4.rs"
-mode = "compile"
-hint = "No hints this time ;)"
+dir = "09_strings"
+test = false
+hint = """
+Replace `placeholder` with either `string` or `string_slice` in the `main` function.
+
+Example:
+`placeholder("blue");`
+should become
+`string_slice("blue");`
+because "blue" is `&str`, not `String`."""
# MODULES
[[exercises]]
name = "modules1"
-path = "exercises/10_modules/modules1.rs"
-mode = "compile"
+dir = "10_modules"
+test = false
hint = """
-Everything is private in Rust by default-- but there's a keyword we can use
-to make something public! The compiler error should point to the thing that
-needs to be public."""
+Everything is private in Rust by default. But there's a keyword we can use
+to make something public!"""
[[exercises]]
name = "modules2"
-path = "exercises/10_modules/modules2.rs"
-mode = "compile"
+dir = "10_modules"
+test = false
hint = """
-The delicious_snacks module is trying to present an external interface that is
-different than its internal structure (the `fruits` and `veggies` modules and
-associated constants). Complete the `use` statements to fit the uses in main and
-find the one keyword missing for both constants.
+The `delicious_snacks` module is trying to present an external interface that
+is different than its internal structure (the `fruits` and `veggies` modules
+and associated constants). Complete the `use` statements to fit the uses in
+`main` and find the one keyword missing for both constants.
-Learn more at https://doc.rust-lang.org/book/ch07-04-bringing-paths-into-scope-with-the-use-keyword.html#re-exporting-names-with-pub-use"""
+Learn more in The Book:
+https://doc.rust-lang.org/book/ch07-04-bringing-paths-into-scope-with-the-use-keyword.html#re-exporting-names-with-pub-use"""
[[exercises]]
name = "modules3"
-path = "exercises/10_modules/modules3.rs"
-mode = "compile"
+dir = "10_modules"
+test = false
hint = """
`UNIX_EPOCH` and `SystemTime` are declared in the `std::time` module. Add a
`use` statement for these two to bring them into scope. You can use nested
-paths or the glob operator to bring these two in using only one line."""
+paths to bring these two in using only one line."""
# HASHMAPS
[[exercises]]
name = "hashmaps1"
-path = "exercises/11_hashmaps/hashmaps1.rs"
-mode = "test"
+dir = "11_hashmaps"
hint = """
-Hint 1: Take a look at the return type of the function to figure out
- the type for the `basket`.
-
-Hint 2: Number of fruits should be at least 5. And you have to put
- at least three different types of fruits.
-"""
+The number of fruits should be at least 5 and you have to put at least 3
+different types of fruits."""
[[exercises]]
name = "hashmaps2"
-path = "exercises/11_hashmaps/hashmaps2.rs"
-mode = "test"
+dir = "11_hashmaps"
hint = """
Use the `entry()` and `or_insert()` methods of `HashMap` to achieve this.
-Learn more at https://doc.rust-lang.org/stable/book/ch08-03-hash-maps.html#only-inserting-a-value-if-the-key-has-no-value
-"""
+
+Learn more in The Book:
+https://doc.rust-lang.org/stable/book/ch08-03-hash-maps.html#only-inserting-a-value-if-the-key-has-no-value"""
[[exercises]]
name = "hashmaps3"
-path = "exercises/11_hashmaps/hashmaps3.rs"
-mode = "test"
+dir = "11_hashmaps"
hint = """
-Hint 1: Use the `entry()` and `or_insert()` methods of `HashMap` to insert
- entries corresponding to each team in the scores table.
+Hint 1: Use the `entry()` and `or_insert()` (or `or_insert_with()`) methods of
+ `HashMap` to insert the default value of `Team` if a team doesn't
+ exist in the table yet.
-Learn more at https://doc.rust-lang.org/stable/book/ch08-03-hash-maps.html#only-inserting-a-value-if-the-key-has-no-value
+Learn more in The Book:
+https://doc.rust-lang.org/stable/book/ch08-03-hash-maps.html#only-inserting-a-value-if-the-key-has-no-value
Hint 2: If there is already an entry for a given key, the value returned by
`entry()` can be updated based on the existing value.
-Learn more at https://doc.rust-lang.org/book/ch08-03-hash-maps.html#updating-a-value-based-on-the-old-value
-"""
+Learn more in The Book:
+https://doc.rust-lang.org/book/ch08-03-hash-maps.html#updating-a-value-based-on-the-old-value"""
# QUIZ 2
[[exercises]]
name = "quiz2"
-path = "exercises/quiz2.rs"
-mode = "test"
+dir = "quizzes"
hint = "No hints this time ;)"
# OPTIONS
[[exercises]]
name = "options1"
-path = "exercises/12_options/options1.rs"
-mode = "test"
+dir = "12_options"
hint = """
Options can have a `Some` value, with an inner value, or a `None` value,
without an inner value.
-There's multiple ways to get at the inner value, you can use `unwrap`, or
+There are multiple ways to get at the inner value, you can use `unwrap`, or
pattern match. Unwrapping is the easiest, but how do you do it safely so that
it doesn't panic in your face later?"""
[[exercises]]
name = "options2"
-path = "exercises/12_options/options2.rs"
-mode = "test"
+dir = "12_options"
hint = """
Check out:
- https://doc.rust-lang.org/rust-by-example/flow_control/if_let.html
- https://doc.rust-lang.org/rust-by-example/flow_control/while_let.html
-Remember that `Option`s can be stacked in `if let` and `while let`.
+Remember that `Option`s can be nested in if-let and while-let statements.
-For example: `Some(Some(variable)) = variable2`
+For example: `if let Some(Some(x)) = y`
-Also see `Option::flatten`
-"""
+Also see `Option::flatten`"""
[[exercises]]
name = "options3"
-path = "exercises/12_options/options3.rs"
-mode = "compile"
+dir = "12_options"
+test = false
hint = """
The compiler says a partial move happened in the `match` statement. How can
this be avoided? The compiler shows the correction needed.
-After making the correction as suggested by the compiler, do read:
+After making the correction as suggested by the compiler, read the related docs
+page:
https://doc.rust-lang.org/std/keyword.ref.html"""
# ERROR HANDLING
[[exercises]]
name = "errors1"
-path = "exercises/13_error_handling/errors1.rs"
-mode = "test"
+dir = "13_error_handling"
hint = """
`Ok` and `Err` are the two variants of `Result`, so what the tests are saying
is that `generate_nametag_text` should return a `Result` instead of an `Option`.
@@ -664,91 +639,80 @@ is that `generate_nametag_text` should return a `Result` instead of an `Option`.
To make this change, you'll need to:
- update the return type in the function signature to be a `Result` that could be the variants `Ok(String)` and `Err(String)`
- - change the body of the function to return `Ok(stuff)` where it currently
- returns `Some(stuff)`
+ - change the body of the function to return `Ok(…)` where it currently
+ returns `Some(…)`
- change the body of the function to return `Err(error message)` where it
currently returns `None`"""
[[exercises]]
name = "errors2"
-path = "exercises/13_error_handling/errors2.rs"
-mode = "test"
+dir = "13_error_handling"
hint = """
One way to handle this is using a `match` statement on
`item_quantity.parse::()` where the cases are `Ok(something)` and
`Err(something)`.
-This pattern is very common in Rust, though, so there's a `?` operator that
+This pattern is very common in Rust, though, so there's the `?` operator that
does pretty much what you would make that match statement do for you!
-Take a look at this section of the 'Error Handling' chapter:
-https://doc.rust-lang.org/book/ch09-02-recoverable-errors-with-result.html#a-shortcut-for-propagating-errors-the--operator
-and give it a try!"""
+Take a look at this section of the "Error Handling" chapter:
+https://doc.rust-lang.org/book/ch09-02-recoverable-errors-with-result.html#a-shortcut-for-propagating-errors-the--operator"""
[[exercises]]
name = "errors3"
-path = "exercises/13_error_handling/errors3.rs"
-mode = "compile"
+dir = "13_error_handling"
+test = false
hint = """
If other functions can return a `Result`, why shouldn't `main`? It's a fairly
common convention to return something like `Result<(), ErrorType>` from your
-main function.
+`main` function.
-The unit (`()`) type is there because nothing is really needed in terms of
-positive results."""
+The unit type `()` is there because nothing is really needed in terms of a
+positive result."""
[[exercises]]
name = "errors4"
-path = "exercises/13_error_handling/errors4.rs"
-mode = "test"
+dir = "13_error_handling"
hint = """
`PositiveNonzeroInteger::new` is always creating a new instance and returning
-an `Ok` result.
-
-It should be doing some checking, returning an `Err` result if those checks
-fail, and only returning an `Ok` result if those checks determine that
-everything is... okay :)"""
+an `Ok` result. But it should be doing some checking, returning an `Err` if
+those checks fail, and only returning an `Ok` if those checks determine that
+everything is… okay :)"""
[[exercises]]
name = "errors5"
-path = "exercises/13_error_handling/errors5.rs"
-mode = "compile"
+dir = "13_error_handling"
+test = false
hint = """
-There are two different possible `Result` types produced within `main()`, which
-are propagated using `?` operators. How do we declare a return type from
-`main()` that allows both?
+There are two different possible `Result` types produced within the `main`
+function, which are propagated using the `?` operators. How do we declare a
+return type for the `main` function that allows both?
Under the hood, the `?` operator calls `From::from` on the error value to
-convert it to a boxed trait object, a `Box`. This boxed trait
-object is polymorphic, and since all errors implement the `error::Error` trait,
-we can capture lots of different errors in one "Box" object.
+convert it to a boxed trait object, a `Box`. This boxed trait object
+is polymorphic, and since all errors implement the `Error` trait, we can capture
+lots of different errors in one `Box` object.
-Check out this section of the book:
+Check out this section of The Book:
https://doc.rust-lang.org/book/ch09-02-recoverable-errors-with-result.html#a-shortcut-for-propagating-errors-the--operator
Read more about boxing errors:
https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/boxing_errors.html
Read more about using the `?` operator with boxed errors:
-https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/reenter_question_mark.html
-"""
+https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/reenter_question_mark.html"""
[[exercises]]
name = "errors6"
-path = "exercises/13_error_handling/errors6.rs"
-mode = "test"
+dir = "13_error_handling"
hint = """
-This exercise uses a completed version of `PositiveNonzeroInteger` from
-errors4.
+This exercise uses a completed version of `PositiveNonzeroInteger` from the
+previous exercises.
Below the line that `TODO` asks you to change, there is an example of using
the `map_err()` method on a `Result` to transform one type of error into
another. Try using something similar on the `Result` from `parse()`. You
-might use the `?` operator to return early from the function, or you might
-use a `match` expression, or maybe there's another way!
-
-You can create another function inside `impl ParsePosNonzeroError` to use
-with `map_err()`.
+can then use the `?` operator to return early.
Read more about `map_err()` in the `std::result` documentation:
https://doc.rust-lang.org/std/result/enum.Result.html#method.map_err"""
@@ -757,110 +721,105 @@ https://doc.rust-lang.org/std/result/enum.Result.html#method.map_err"""
[[exercises]]
name = "generics1"
-path = "exercises/14_generics/generics1.rs"
-mode = "compile"
+dir = "14_generics"
+test = false
hint = """
Vectors in Rust make use of generics to create dynamically sized arrays of any
type.
+If the vector `numbers` has the type `Vec`, then we can only push values of
+type `T` to it. By using `into()` before pushing, we ask the compiler to convert
+`n1` and `n2` to `T`. But the compiler doesn't know what `T` is yet and needs a
+type annotation.
-You need to tell the compiler what type we are pushing onto this vector."""
+`u8` and `i8` can both be converted to `i16`, `i32` and `i64`. Choose one for
+the generic of the vector."""
[[exercises]]
name = "generics2"
-path = "exercises/14_generics/generics2.rs"
-mode = "test"
+dir = "14_generics"
hint = """
-Currently we are wrapping only values of type `u32`.
-
-Maybe we could update the explicit references to this data type somehow?
-
-If you are still stuck https://doc.rust-lang.org/stable/book/ch10-01-syntax.html#in-method-definitions
-"""
+Related section in The Book:
+https://doc.rust-lang.org/stable/book/ch10-01-syntax.html#in-method-definitions"""
# TRAITS
[[exercises]]
name = "traits1"
-path = "exercises/15_traits/traits1.rs"
-mode = "test"
+dir = "15_traits"
hint = """
-A discussion about Traits in Rust can be found at:
-https://doc.rust-lang.org/book/ch10-02-traits.html
-"""
+More about traits in The Book:
+https://doc.rust-lang.org/book/ch10-02-traits.html"""
[[exercises]]
name = "traits2"
-path = "exercises/15_traits/traits2.rs"
-mode = "test"
+dir = "15_traits"
hint = """
-Notice how the trait takes ownership of `self`, and returns `Self`.
+Notice how the trait takes ownership of `self` and returns `Self`.
-Try mutating the incoming string vector. Have a look at the tests to see
-what the result should look like!
-
-Vectors provide suitable methods for adding an element at the end. See
-the documentation at: https://doc.rust-lang.org/std/vec/struct.Vec.html"""
+Although the signature of `append_bar` in the trait takes `self` as argument,
+the implementation can take `mut self` instead. This is possible because the
+the value is owned anyway."""
[[exercises]]
name = "traits3"
-path = "exercises/15_traits/traits3.rs"
-mode = "test"
+dir = "15_traits"
hint = """
-Traits can have a default implementation for functions. Structs that implement
-the trait can then use the default version of these functions if they choose not
-to implement the function themselves.
+Traits can have a default implementation for functions. Data types that
+implement the trait can then use the default version of these functions
+if they choose not to implement the function themselves.
-See the documentation at: https://doc.rust-lang.org/book/ch10-02-traits.html#default-implementations
-"""
+Related section in The Book:
+https://doc.rust-lang.org/book/ch10-02-traits.html#default-implementations"""
[[exercises]]
name = "traits4"
-path = "exercises/15_traits/traits4.rs"
-mode = "test"
+dir = "15_traits"
hint = """
Instead of using concrete types as parameters you can use traits. Try replacing
-the '??' with 'impl '
+`???` with `impl [what goes here?]`.
-See the documentation at: https://doc.rust-lang.org/book/ch10-02-traits.html#traits-as-parameters
-"""
+Related section in The Book:
+https://doc.rust-lang.org/book/ch10-02-traits.html#traits-as-parameters"""
[[exercises]]
name = "traits5"
-path = "exercises/15_traits/traits5.rs"
-mode = "compile"
+dir = "15_traits"
hint = """
To ensure a parameter implements multiple traits use the '+ syntax'. Try
-replacing the '??' with 'impl <> + <>'.
+replacing `???` with 'impl [what goes here?] + [what goes here?]'.
-See the documentation at: https://doc.rust-lang.org/book/ch10-02-traits.html#specifying-multiple-trait-bounds-with-the--syntax
-"""
+Related section in The Book:
+https://doc.rust-lang.org/book/ch10-02-traits.html#specifying-multiple-trait-bounds-with-the--syntax"""
# QUIZ 3
[[exercises]]
name = "quiz3"
-path = "exercises/quiz3.rs"
-mode = "test"
+dir = "quizzes"
hint = """
-To find the best solution to this challenge you're going to need to think back
-to your knowledge of traits, specifically 'Trait Bound Syntax'
+To find the best solution to this challenge, you need to recall your knowledge
+of traits, specifically "Trait Bound Syntax":
+https://doc.rust-lang.org/book/ch10-02-traits.html#trait-bound-syntax
-You may also need this: `use std::fmt::Display;`."""
+Here is how to specify a trait bound for an implementation block:
+`impl for Foo { … }`
+
+You may need this:
+`use std::fmt::Display;`"""
# LIFETIMES
[[exercises]]
name = "lifetimes1"
-path = "exercises/16_lifetimes/lifetimes1.rs"
-mode = "compile"
+dir = "16_lifetimes"
hint = """
-Let the compiler guide you. Also take a look at the book if you need help:
+Let the compiler guide you. Also take a look at The Book if you need help:
https://doc.rust-lang.org/book/ch10-03-lifetime-syntax.html"""
[[exercises]]
name = "lifetimes2"
-path = "exercises/16_lifetimes/lifetimes2.rs"
-mode = "compile"
+dir = "16_lifetimes"
+test = false
hint = """
Remember that the generic lifetime `'a` will get the concrete lifetime that is
equal to the smaller of the lifetimes of `x` and `y`.
@@ -873,61 +832,41 @@ inner block:
[[exercises]]
name = "lifetimes3"
-path = "exercises/16_lifetimes/lifetimes3.rs"
-mode = "compile"
-hint = """
-If you use a lifetime annotation in a struct's fields, where else does it need
-to be added?"""
+dir = "16_lifetimes"
+test = false
+hint = """Let the compiler guide you :)"""
# TESTS
[[exercises]]
name = "tests1"
-path = "exercises/17_tests/tests1.rs"
-mode = "test"
+dir = "17_tests"
hint = """
-You don't even need to write any code to test -- you can just test values and
-run that, even though you wouldn't do that in real life. :)
-
`assert!` is a macro that needs an argument. Depending on the value of the
argument, `assert!` will do nothing (in which case the test will pass) or
`assert!` will panic (in which case the test will fail).
So try giving different values to `assert!` and see which ones compile, which
-ones pass, and which ones fail :)"""
+ones pass, and which ones fail :)
+
+If you want to check for `false`, you can negate the result of what you're
+checking using `!`, like `assert!(!…)`."""
[[exercises]]
name = "tests2"
-path = "exercises/17_tests/tests2.rs"
-mode = "test"
+dir = "17_tests"
hint = """
-Like the previous exercise, you don't need to write any code to get this test
-to compile and run.
-
`assert_eq!` is a macro that takes two arguments and compares them. Try giving
it two values that are equal! Try giving it two arguments that are different!
-Try giving it two values that are of different types! Try switching which
-argument comes first and which comes second!"""
+Try switching which argument comes first and which comes second!"""
[[exercises]]
name = "tests3"
-path = "exercises/17_tests/tests3.rs"
-mode = "test"
+dir = "17_tests"
hint = """
-You can call a function right where you're passing arguments to `assert!`. So
-you could do something like `assert!(having_fun())`.
+We expect the method `Rectangle::new` to panic for negative values.
-If you want to check that you indeed get `false`, you can negate the result of
-what you're doing using `!`, like `assert!(!having_fun())`."""
-
-[[exercises]]
-name = "tests4"
-path = "exercises/17_tests/tests4.rs"
-mode = "test"
-hint = """
-We expect method `Rectangle::new()` to panic for negative values.
-
-To handle that you need to add a special attribute to the test function.
+To handle that, you need to add a special attribute to the test function.
You can refer to the docs:
https://doc.rust-lang.org/stable/book/ch11-01-writing-tests.html#checking-for-panics-with-should_panic"""
@@ -936,33 +875,17 @@ https://doc.rust-lang.org/stable/book/ch11-01-writing-tests.html#checking-for-pa
[[exercises]]
name = "iterators1"
-path = "exercises/18_iterators/iterators1.rs"
-mode = "test"
+dir = "18_iterators"
hint = """
-Step 1:
-
-We need to apply something to the collection `my_fav_fruits` before we start to
-go through it. What could that be? Take a look at the struct definition for a
-vector for inspiration:
-https://doc.rust-lang.org/std/vec/struct.Vec.html
-
-Step 2 & step 3:
-
-Very similar to the lines above and below. You've got this!
-
-Step 4:
-
An iterator goes through all elements in a collection, but what if we've run
out of elements? What should we expect here? If you're stuck, take a look at
-https://doc.rust-lang.org/std/iter/trait.Iterator.html for some ideas.
-"""
+https://doc.rust-lang.org/std/iter/trait.Iterator.html"""
[[exercises]]
name = "iterators2"
-path = "exercises/18_iterators/iterators2.rs"
-mode = "test"
+dir = "18_iterators"
hint = """
-Step 1:
+`capitalize_first`:
The variable `first` is a `char`. It needs to be capitalized and added to the
remaining characters in `c` in order to return the correct `String`.
@@ -973,23 +896,25 @@ The remaining characters in `c` can be viewed as a string slice using the
The documentation for `char` contains many useful methods.
https://doc.rust-lang.org/std/primitive.char.html
-Step 2:
+Use `char::to_uppercase`. It returns an iterator that can be converted to a
+`String`.
+
+`capitalize_words_vector`:
Create an iterator from the slice. Transform the iterated values by applying
the `capitalize_first` function. Remember to `collect` the iterator.
-Step 3:
+`capitalize_words_string`:
This is surprisingly similar to the previous solution. `collect` is very
powerful and very general. Rust just needs to know the desired type."""
[[exercises]]
name = "iterators3"
-path = "exercises/18_iterators/iterators3.rs"
-mode = "test"
+dir = "18_iterators"
hint = """
-The `divide` function needs to return the correct error when even division is
-not possible.
+The `divide` function needs to return the correct error when the divisor is 0 or
+when even division is not possible.
The `division_results` variable needs to be collected into a collection type.
@@ -1000,24 +925,22 @@ The `list_of_results` function needs to return a vector of results.
See https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.collect for
how the `FromIterator` trait is used in `collect()`. This trait is REALLY
-powerful! It can make the solution to this exercise infinitely easier."""
+powerful! It can make the solution to this exercise much easier."""
[[exercises]]
name = "iterators4"
-path = "exercises/18_iterators/iterators4.rs"
-mode = "test"
+dir = "18_iterators"
hint = """
In an imperative language, you might write a `for` loop that updates a mutable
variable. Or, you might write code utilizing recursion and a match clause. In
-Rust you can take another functional approach, computing the factorial
+Rust, you can take another functional approach, computing the factorial
elegantly with ranges and iterators.
-Hint 2: Check out the `fold` and `rfold` methods!"""
+Check out the `fold` and `rfold` methods!"""
[[exercises]]
name = "iterators5"
-path = "exercises/18_iterators/iterators5.rs"
-mode = "test"
+dir = "18_iterators"
hint = """
The documentation for the `std::iter::Iterator` trait contains numerous methods
that would be helpful here.
@@ -1035,32 +958,24 @@ a different method that could make your code more compact than using `fold`."""
[[exercises]]
name = "box1"
-path = "exercises/19_smart_pointers/box1.rs"
-mode = "test"
+dir = "19_smart_pointers"
hint = """
-Step 1:
-
-The compiler's message should help: since we cannot store the value of the
+The compiler's message should help: Since we cannot store the value of the
actual type when working with recursive types, we need to store a reference
(pointer) to its value.
-We should, therefore, place our `List` inside a `Box`. More details in the book
-here: https://doc.rust-lang.org/book/ch15-01-box.html#enabling-recursive-types-with-boxes
+We should, therefore, place our `List` inside a `Box`. More details in The Book:
+https://doc.rust-lang.org/book/ch15-01-box.html#enabling-recursive-types-with-boxes
-Step 2:
+Creating an empty list should be fairly straightforward (Hint: Read the tests).
-Creating an empty list should be fairly straightforward (hint: peek at the
-assertions).
-
-For a non-empty list keep in mind that we want to use our `Cons` "list builder".
+For a non-empty list, keep in mind that we want to use our `Cons` list builder.
Although the current list is one of integers (`i32`), feel free to change the
-definition and try other types!
-"""
+definition and try other types!"""
[[exercises]]
name = "rc1"
-path = "exercises/19_smart_pointers/rc1.rs"
-mode = "test"
+dir = "19_smart_pointers"
hint = """
This is a straightforward exercise to use the `Rc` type. Each `Planet` has
ownership of the `Sun`, and uses `Rc::clone()` to increment the reference count
@@ -1069,19 +984,18 @@ of the `Sun`.
After using `drop()` to move the `Planet`s out of scope individually, the
reference count goes down.
-In the end the `Sun` only has one reference again, to itself.
+In the end, the `Sun` only has one reference again, to itself.
See more at: https://doc.rust-lang.org/book/ch15-04-rc.html
-* Unfortunately Pluto is no longer considered a planet :(
-"""
+Unfortunately, Pluto is no longer considered a planet :("""
[[exercises]]
name = "arc1"
-path = "exercises/19_smart_pointers/arc1.rs"
-mode = "compile"
+dir = "19_smart_pointers"
+test = false
hint = """
-Make `shared_numbers` be an `Arc` from the numbers vector. Then, in order
+Make `shared_numbers` be an `Arc` from the `numbers` vector. Then, in order
to avoid creating a copy of `numbers`, you'll need to create `child_numbers`
inside the loop but still in the main thread.
@@ -1089,77 +1003,63 @@ inside the loop but still in the main thread.
thread-local copy of the numbers.
This is a simple exercise if you understand the underlying concepts, but if this
-is too much of a struggle, consider reading through all of Chapter 16 in the
-book:
-https://doc.rust-lang.org/stable/book/ch16-00-concurrency.html
-"""
+is too much of a struggle, consider reading through all of Chapter 16 in The
+Book:
+https://doc.rust-lang.org/stable/book/ch16-00-concurrency.html"""
[[exercises]]
name = "cow1"
-path = "exercises/19_smart_pointers/cow1.rs"
-mode = "test"
+dir = "19_smart_pointers"
hint = """
-If `Cow` already owns the data it doesn't need to clone it when `to_mut()` is
+If `Cow` already owns the data, it doesn't need to clone it when `to_mut()` is
called.
-Check out https://doc.rust-lang.org/std/borrow/enum.Cow.html for documentation
-on the `Cow` type.
-"""
+Check out the documentation of the `Cow` type:
+https://doc.rust-lang.org/std/borrow/enum.Cow.html"""
# THREADS
[[exercises]]
name = "threads1"
-path = "exercises/20_threads/threads1.rs"
-mode = "compile"
+dir = "20_threads"
+test = false
hint = """
`JoinHandle` is a struct that is returned from a spawned thread:
https://doc.rust-lang.org/std/thread/fn.spawn.html
A challenge with multi-threaded applications is that the main thread can
-finish before the spawned threads are completed.
+finish before the spawned threads are done.
https://doc.rust-lang.org/book/ch16-01-threads.html#waiting-for-all-threads-to-finish-using-join-handles
Use the `JoinHandle`s to wait for each thread to finish and collect their
results.
-https://doc.rust-lang.org/std/thread/struct.JoinHandle.html
-"""
+https://doc.rust-lang.org/std/thread/struct.JoinHandle.html"""
[[exercises]]
name = "threads2"
-path = "exercises/20_threads/threads2.rs"
-mode = "compile"
+dir = "20_threads"
+test = false
hint = """
`Arc` is an Atomic Reference Counted pointer that allows safe, shared access
-to **immutable** data. But we want to *change* the number of `jobs_completed`
-so we'll need to also use another type that will only allow one thread to
-mutate the data at a time. Take a look at this section of the book:
+to **immutable** data. But we want to *change* the number of `jobs_done` so
+we'll need to also use another type that will only allow one thread to mutate
+the data at a time. Take a look at this section of the book:
https://doc.rust-lang.org/book/ch16-03-shared-state.html#atomic-reference-counting-with-arct
-and keep reading if you'd like more hints :)
-Do you now have an `Arc` `Mutex` `JobStatus` at the beginning of main? Like:
+Keep reading if you'd like more hints :)
+
+Do you now have an `Arc>` at the beginning of `main`? Like:
```
-let status = Arc::new(Mutex::new(JobStatus { jobs_completed: 0 }));
+let status = Arc::new(Mutex::new(JobStatus { jobs_done: 0 }));
```
-Similar to the code in the example in the book that happens after the text
-that says 'Sharing a Mutex Between Multiple Threads'. If not, give that a
-try! If you do and would like more hints, keep reading!!
-
-Make sure neither of your threads are holding onto the lock of the mutex
-while they are sleeping, since this will prevent the other thread from
-being allowed to get the lock. Locks are automatically released when
-they go out of scope.
-
-If you've learned from the sample solutions, I encourage you to come
-back to this exercise and try it again in a few days to reinforce
-what you've learned :)"""
+Similar to the code in the following example in The Book:
+https://doc.rust-lang.org/book/ch16-03-shared-state.html#sharing-a-mutext-between-multiple-threads"""
[[exercises]]
name = "threads3"
-path = "exercises/20_threads/threads3.rs"
-mode = "test"
+dir = "20_threads"
hint = """
An alternate way to handle concurrency between threads is to use an `mpsc`
(multiple producer, single consumer) channel to communicate.
@@ -1167,27 +1067,26 @@ An alternate way to handle concurrency between threads is to use an `mpsc`
With both a sending end and a receiving end, it's possible to send values in
one thread and receive them in another.
-Multiple producers are possible by using clone() to create a duplicate of the
+Multiple producers are possible by using `clone()` to create a duplicate of the
original sending end.
-See https://doc.rust-lang.org/book/ch16-02-message-passing.html for more info.
-"""
+Related section in The Book:
+https://doc.rust-lang.org/book/ch16-02-message-passing.html"""
# MACROS
[[exercises]]
name = "macros1"
-path = "exercises/21_macros/macros1.rs"
-mode = "compile"
+dir = "21_macros"
+test = false
hint = """
-When you call a macro, you need to add something special compared to a
-regular function call. If you're stuck, take a look at what's inside
-`my_macro`."""
+When you call a macro, you need to add something special compared to a regular
+function call."""
[[exercises]]
name = "macros2"
-path = "exercises/21_macros/macros2.rs"
-mode = "compile"
+dir = "21_macros"
+test = false
hint = """
Macros don't quite play by the same rules as the rest of Rust, in terms of
what's available where.
@@ -1197,19 +1096,16 @@ Unlike other things in Rust, the order of "where you define a macro" versus
[[exercises]]
name = "macros3"
-path = "exercises/21_macros/macros3.rs"
-mode = "compile"
+dir = "21_macros"
+test = false
hint = """
In order to use a macro outside of its module, you need to do something
-special to the module to lift the macro out into its parent.
-
-The same trick also works on "extern crate" statements for crates that have
-exported macros, if you've seen any of those around."""
+special to the module to lift the macro out into its parent."""
[[exercises]]
name = "macros4"
-path = "exercises/21_macros/macros4.rs"
-mode = "compile"
+dir = "21_macros"
+test = false
hint = """
You only need to add a single character to make this compile.
@@ -1225,10 +1121,11 @@ https://veykril.github.io/tlborm/"""
[[exercises]]
name = "clippy1"
-path = "exercises/22_clippy/clippy1.rs"
-mode = "clippy"
+dir = "22_clippy"
+test = false
+strict_clippy = true
hint = """
-Rust stores the highest precision version of any long or infinite precision
+Rust stores the highest precision version of some long or infinite precision
mathematical constants in the Rust standard library:
https://doc.rust-lang.org/stable/std/f32/consts/index.html
@@ -1236,86 +1133,68 @@ We may be tempted to use our own approximations for certain mathematical
constants, but clippy recognizes those imprecise mathematical constants as a
source of potential error.
-See the suggestions of the clippy warning in compile output and use the
+See the suggestions of the Clippy warning in the compile output and use the
appropriate replacement constant from `std::f32::consts`..."""
[[exercises]]
name = "clippy2"
-path = "exercises/22_clippy/clippy2.rs"
-mode = "clippy"
+dir = "22_clippy"
+test = false
+strict_clippy = true
hint = """
-`for` loops over `Option` values are more clearly expressed as an `if let`"""
+`for` loops over `Option` values are more clearly expressed as an `if-let`
+statement."""
[[exercises]]
name = "clippy3"
-path = "exercises/22_clippy/clippy3.rs"
-mode = "clippy"
+dir = "22_clippy"
+test = false
+strict_clippy = true
hint = "No hints this time!"
# TYPE CONVERSIONS
[[exercises]]
name = "using_as"
-path = "exercises/23_conversions/using_as.rs"
-mode = "test"
+dir = "23_conversions"
hint = """
Use the `as` operator to cast one of the operands in the last line of the
`average` function into the expected return type."""
[[exercises]]
name = "from_into"
-path = "exercises/23_conversions/from_into.rs"
-mode = "test"
+dir = "23_conversions"
hint = """
-Follow the steps provided right before the `From` implementation"""
+Follow the steps provided right before the `From` implementation."""
[[exercises]]
name = "from_str"
-path = "exercises/23_conversions/from_str.rs"
-mode = "test"
+dir = "23_conversions"
hint = """
The implementation of `FromStr` should return an `Ok` with a `Person` object,
or an `Err` with an error if the string is not valid.
-This is almost like the `from_into` exercise, but returning errors instead
-of falling back to a default value.
+This is almost like the previous `from_into` exercise, but returning errors
+instead of falling back to a default value.
-Look at the test cases to see which error variants to return.
-
-Another hint: You can use the `map_err` method of `Result` with a function
-or a closure to wrap the error from `parse::`.
+Another hint: You can use the `map_err` method of `Result` with a function or a
+closure to wrap the error from `parse::`.
Yet another hint: If you would like to propagate errors by using the `?`
operator in your solution, you might want to look at
-https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/reenter_question_mark.html
-"""
+https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/reenter_question_mark.html"""
[[exercises]]
name = "try_from_into"
-path = "exercises/23_conversions/try_from_into.rs"
-mode = "test"
+dir = "23_conversions"
hint = """
-Follow the steps provided right before the `TryFrom` implementation.
-You can also use the example at
-https://doc.rust-lang.org/std/convert/trait.TryFrom.html
-
-Is there an implementation of `TryFrom` in the standard library that
-can both do the required integer conversion and check the range of the input?
-
-Another hint: Look at the test cases to see which error variants to return.
-
-Yet another hint: You can use the `map_err` or `or` methods of `Result` to
-convert errors.
-
-Yet another hint: If you would like to propagate errors by using the `?`
-operator in your solution, you might want to look at
-https://doc.rust-lang.org/stable/rust-by-example/error/multiple_error_types/reenter_question_mark.html
+Is there an implementation of `TryFrom` in the standard library that can both do
+the required integer conversion and check the range of the input?
Challenge: Can you make the `TryFrom` implementations generic over many integer types?"""
[[exercises]]
name = "as_ref_mut"
-path = "exercises/23_conversions/as_ref_mut.rs"
-mode = "test"
+dir = "23_conversions"
hint = """
Add `AsRef` or `AsMut` as a trait bound to the functions."""
diff --git a/rustlings-macros/src/lib.rs b/rustlings-macros/src/lib.rs
new file mode 100644
index 0000000..6c6067b
--- /dev/null
+++ b/rustlings-macros/src/lib.rs
@@ -0,0 +1,56 @@
+use proc_macro::TokenStream;
+use quote::quote;
+use serde::Deserialize;
+
+#[derive(Deserialize)]
+struct ExerciseInfo {
+ name: String,
+ dir: String,
+}
+
+#[derive(Deserialize)]
+struct InfoFile {
+ exercises: Vec,
+}
+
+#[proc_macro]
+pub fn include_files(_: TokenStream) -> TokenStream {
+ let info_file = include_str!("../info.toml");
+ let exercises = toml_edit::de::from_str::(info_file)
+ .expect("Failed to parse `info.toml`")
+ .exercises;
+
+ let exercise_files = exercises
+ .iter()
+ .map(|exercise| format!("../exercises/{}/{}.rs", exercise.dir, exercise.name));
+ let solution_files = exercises
+ .iter()
+ .map(|exercise| format!("../solutions/{}/{}.rs", exercise.dir, exercise.name));
+
+ let mut dirs = Vec::with_capacity(32);
+ let mut dir_inds = vec![0; exercises.len()];
+
+ for (exercise, dir_ind) in exercises.iter().zip(&mut dir_inds) {
+ // The directory is often the last one inserted.
+ if let Some(ind) = dirs.iter().rev().position(|dir| *dir == exercise.dir) {
+ *dir_ind = dirs.len() - 1 - ind;
+ continue;
+ }
+
+ dirs.push(exercise.dir.as_str());
+ *dir_ind = dirs.len() - 1;
+ }
+
+ let readmes = dirs
+ .iter()
+ .map(|dir| format!("../exercises/{dir}/README.md"));
+
+ quote! {
+ EmbeddedFiles {
+ info_file: #info_file,
+ exercise_files: &[#(ExerciseFiles { exercise: include_bytes!(#exercise_files), solution: include_bytes!(#solution_files), dir_ind: #dir_inds }),*],
+ exercise_dirs: &[#(ExerciseDir { name: #dirs, readme: include_bytes!(#readmes) }),*]
+ }
+ }
+ .into()
+}
diff --git a/shell.nix b/shell.nix
deleted file mode 100644
index fa2a56c..0000000
--- a/shell.nix
+++ /dev/null
@@ -1,6 +0,0 @@
-(import (let lock = builtins.fromJSON (builtins.readFile ./flake.lock);
-in fetchTarball {
- url =
- "https://github.com/edolstra/flake-compat/archive/${lock.nodes.flake-compat.locked.rev}.tar.gz";
- sha256 = lock.nodes.flake-compat.locked.narHash;
-}) { src = ./.; }).shellNix
diff --git a/solutions/00_intro/intro1.rs b/solutions/00_intro/intro1.rs
new file mode 100644
index 0000000..4fe8454
--- /dev/null
+++ b/solutions/00_intro/intro1.rs
@@ -0,0 +1,5 @@
+fn main() {
+ // Congratulations, you finished the first exercise 🎉
+ // As an introduction to Rustlings, the first exercise only required
+ // entering `n` in the terminal to go to the next exercise.
+}
diff --git a/solutions/00_intro/intro2.rs b/solutions/00_intro/intro2.rs
new file mode 100644
index 0000000..b8e031a
--- /dev/null
+++ b/solutions/00_intro/intro2.rs
@@ -0,0 +1,4 @@
+fn main() {
+ // `println!` instead of `printline!`.
+ println!("Hello world!");
+}
diff --git a/solutions/01_variables/variables1.rs b/solutions/01_variables/variables1.rs
new file mode 100644
index 0000000..58d046b
--- /dev/null
+++ b/solutions/01_variables/variables1.rs
@@ -0,0 +1,6 @@
+fn main() {
+ // Declaring variables requires the `let` keyword.
+ let x = 5;
+
+ println!("x has the value {x}");
+}
diff --git a/solutions/01_variables/variables2.rs b/solutions/01_variables/variables2.rs
new file mode 100644
index 0000000..50b8d1b
--- /dev/null
+++ b/solutions/01_variables/variables2.rs
@@ -0,0 +1,16 @@
+fn main() {
+ // The easiest way to fix the compiler error is to initialize the
+ // variable `x`. By setting its value to an integer, Rust infers its type
+ // as `i32` which is the default type for integers.
+ let x = 42;
+
+ // But we can enforce a type different from the default `i32` by adding
+ // a type annotation:
+ // let x: u8 = 42;
+
+ if x == 10 {
+ println!("x is ten!");
+ } else {
+ println!("x is not ten!");
+ }
+}
diff --git a/solutions/01_variables/variables3.rs b/solutions/01_variables/variables3.rs
new file mode 100644
index 0000000..15f6557
--- /dev/null
+++ b/solutions/01_variables/variables3.rs
@@ -0,0 +1,15 @@
+#![allow(clippy::needless_late_init)]
+
+fn main() {
+ // Reading uninitialized variables isn't allowed in Rust!
+ // Therefore, we need to assign a value first.
+ let x: i32 = 42;
+
+ println!("Number {x}");
+
+ // It is possible to declare a variable and initialize it later.
+ // But it can't be used before initialization.
+ let y: i32;
+ y = 42;
+ println!("Number {y}");
+}
diff --git a/solutions/01_variables/variables4.rs b/solutions/01_variables/variables4.rs
new file mode 100644
index 0000000..7de6bcb
--- /dev/null
+++ b/solutions/01_variables/variables4.rs
@@ -0,0 +1,9 @@
+fn main() {
+ // In Rust, variables are immutable by default.
+ // Adding the `mut` keyword after `let` makes the declared variable mutable.
+ let mut x = 3;
+ println!("Number {x}");
+
+ x = 5;
+ println!("Number {x}");
+}
diff --git a/solutions/01_variables/variables5.rs b/solutions/01_variables/variables5.rs
new file mode 100644
index 0000000..9057754
--- /dev/null
+++ b/solutions/01_variables/variables5.rs
@@ -0,0 +1,9 @@
+fn main() {
+ let number = "T-H-R-E-E";
+ println!("Spell a number: {}", number);
+
+ // Using variable shadowing
+ // https://doc.rust-lang.org/book/ch03-01-variables-and-mutability.html#shadowing
+ let number = 3;
+ println!("Number plus two is: {}", number + 2);
+}
diff --git a/solutions/01_variables/variables6.rs b/solutions/01_variables/variables6.rs
new file mode 100644
index 0000000..25b7a1e
--- /dev/null
+++ b/solutions/01_variables/variables6.rs
@@ -0,0 +1,6 @@
+// The type of constants must always be annotated.
+const NUMBER: u64 = 3;
+
+fn main() {
+ println!("Number: {NUMBER}");
+}
diff --git a/solutions/02_functions/functions1.rs b/solutions/02_functions/functions1.rs
new file mode 100644
index 0000000..dc52744
--- /dev/null
+++ b/solutions/02_functions/functions1.rs
@@ -0,0 +1,8 @@
+// Some function with the name `call_me` without arguments or a return value.
+fn call_me() {
+ println!("Hello world!");
+}
+
+fn main() {
+ call_me();
+}
diff --git a/solutions/02_functions/functions2.rs b/solutions/02_functions/functions2.rs
new file mode 100644
index 0000000..f14ffa3
--- /dev/null
+++ b/solutions/02_functions/functions2.rs
@@ -0,0 +1,11 @@
+// The type of function arguments must be annotated.
+// Added the type annotation `u64`.
+fn call_me(num: u64) {
+ for i in 0..num {
+ println!("Ring! Call number {}", i + 1);
+ }
+}
+
+fn main() {
+ call_me(3);
+}
diff --git a/solutions/02_functions/functions3.rs b/solutions/02_functions/functions3.rs
new file mode 100644
index 0000000..c581c42
--- /dev/null
+++ b/solutions/02_functions/functions3.rs
@@ -0,0 +1,10 @@
+fn call_me(num: u32) {
+ for i in 0..num {
+ println!("Ring! Call number {}", i + 1);
+ }
+}
+
+fn main() {
+ // `call_me` expects an argument.
+ call_me(5);
+}
diff --git a/solutions/02_functions/functions4.rs b/solutions/02_functions/functions4.rs
new file mode 100644
index 0000000..f823de2
--- /dev/null
+++ b/solutions/02_functions/functions4.rs
@@ -0,0 +1,17 @@
+fn is_even(num: i64) -> bool {
+ num % 2 == 0
+}
+
+// The return type must always be annotated.
+fn sale_price(price: i64) -> i64 {
+ if is_even(price) {
+ price - 10
+ } else {
+ price - 3
+ }
+}
+
+fn main() {
+ let original_price = 51;
+ println!("Your sale price is {}", sale_price(original_price));
+}
diff --git a/solutions/02_functions/functions5.rs b/solutions/02_functions/functions5.rs
new file mode 100644
index 0000000..677f327
--- /dev/null
+++ b/solutions/02_functions/functions5.rs
@@ -0,0 +1,9 @@
+fn square(num: i32) -> i32 {
+ // Removed the semicolon `;` at the end of the line below to implicitly return the result.
+ num * num
+}
+
+fn main() {
+ let answer = square(3);
+ println!("The square of 3 is {answer}");
+}
diff --git a/solutions/03_if/if1.rs b/solutions/03_if/if1.rs
new file mode 100644
index 0000000..079c671
--- /dev/null
+++ b/solutions/03_if/if1.rs
@@ -0,0 +1,32 @@
+fn bigger(a: i32, b: i32) -> i32 {
+ if a > b {
+ a
+ } else {
+ b
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+// Don't mind this for now :)
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn ten_is_bigger_than_eight() {
+ assert_eq!(10, bigger(10, 8));
+ }
+
+ #[test]
+ fn fortytwo_is_bigger_than_thirtytwo() {
+ assert_eq!(42, bigger(32, 42));
+ }
+
+ #[test]
+ fn equal_numbers() {
+ assert_eq!(42, bigger(42, 42));
+ }
+}
diff --git a/solutions/03_if/if2.rs b/solutions/03_if/if2.rs
new file mode 100644
index 0000000..440bba0
--- /dev/null
+++ b/solutions/03_if/if2.rs
@@ -0,0 +1,33 @@
+fn foo_if_fizz(fizzish: &str) -> &str {
+ if fizzish == "fizz" {
+ "foo"
+ } else if fizzish == "fuzz" {
+ "bar"
+ } else {
+ "baz"
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn foo_for_fizz() {
+ assert_eq!(foo_if_fizz("fizz"), "foo");
+ }
+
+ #[test]
+ fn bar_for_fuzz() {
+ assert_eq!(foo_if_fizz("fuzz"), "bar");
+ }
+
+ #[test]
+ fn default_to_baz() {
+ assert_eq!(foo_if_fizz("literally anything"), "baz");
+ }
+}
diff --git a/solutions/03_if/if3.rs b/solutions/03_if/if3.rs
new file mode 100644
index 0000000..571644d
--- /dev/null
+++ b/solutions/03_if/if3.rs
@@ -0,0 +1,53 @@
+fn animal_habitat(animal: &str) -> &str {
+ let identifier = if animal == "crab" {
+ 1
+ } else if animal == "gopher" {
+ 2
+ } else if animal == "snake" {
+ 3
+ } else {
+ // Any unused identifier.
+ 4
+ };
+
+ // Instead of such an identifier, you would use an enum in Rust.
+ // But we didn't get into enums yet.
+ if identifier == 1 {
+ "Beach"
+ } else if identifier == 2 {
+ "Burrow"
+ } else if identifier == 3 {
+ "Desert"
+ } else {
+ "Unknown"
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn gopher_lives_in_burrow() {
+ assert_eq!(animal_habitat("gopher"), "Burrow")
+ }
+
+ #[test]
+ fn snake_lives_in_desert() {
+ assert_eq!(animal_habitat("snake"), "Desert")
+ }
+
+ #[test]
+ fn crab_lives_on_beach() {
+ assert_eq!(animal_habitat("crab"), "Beach")
+ }
+
+ #[test]
+ fn unknown_animal() {
+ assert_eq!(animal_habitat("dinosaur"), "Unknown")
+ }
+}
diff --git a/solutions/04_primitive_types/primitive_types1.rs b/solutions/04_primitive_types/primitive_types1.rs
new file mode 100644
index 0000000..fac6ec0
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types1.rs
@@ -0,0 +1,11 @@
+fn main() {
+ let is_morning = true;
+ if is_morning {
+ println!("Good morning!");
+ }
+
+ let is_evening = !is_morning;
+ if is_evening {
+ println!("Good evening!");
+ }
+}
diff --git a/solutions/04_primitive_types/primitive_types2.rs b/solutions/04_primitive_types/primitive_types2.rs
new file mode 100644
index 0000000..eecc680
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types2.rs
@@ -0,0 +1,21 @@
+fn main() {
+ let my_first_initial = 'C';
+ if my_first_initial.is_alphabetic() {
+ println!("Alphabetical!");
+ } else if my_first_initial.is_numeric() {
+ println!("Numerical!");
+ } else {
+ println!("Neither alphabetic nor numeric!");
+ }
+
+ // Example with an emoji.
+ let your_character = '🦀';
+
+ if your_character.is_alphabetic() {
+ println!("Alphabetical!");
+ } else if your_character.is_numeric() {
+ println!("Numerical!");
+ } else {
+ println!("Neither alphabetic nor numeric!");
+ }
+}
diff --git a/solutions/04_primitive_types/primitive_types3.rs b/solutions/04_primitive_types/primitive_types3.rs
new file mode 100644
index 0000000..8dd109f
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types3.rs
@@ -0,0 +1,11 @@
+fn main() {
+ // An array with 100 elements of the value 42.
+ let a = [42; 100];
+
+ if a.len() >= 100 {
+ println!("Wow, that's a big array!");
+ } else {
+ println!("Meh, I eat arrays like that for breakfast.");
+ panic!("Array not big enough, more elements needed");
+ }
+}
diff --git a/solutions/04_primitive_types/primitive_types4.rs b/solutions/04_primitive_types/primitive_types4.rs
new file mode 100644
index 0000000..4807e66
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types4.rs
@@ -0,0 +1,23 @@
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn slice_out_of_array() {
+ let a = [1, 2, 3, 4, 5];
+ // 0 1 2 3 4 <- indices
+ // -------
+ // |
+ // +--- slice
+
+ // Note that the upper index 4 is excluded.
+ let nice_slice = &a[1..4];
+ assert_eq!([2, 3, 4], nice_slice);
+
+ // The upper index can be included by using the syntax `..=` (with `=` sign)
+ let nice_slice = &a[1..=3];
+ assert_eq!([2, 3, 4], nice_slice);
+ }
+}
diff --git a/solutions/04_primitive_types/primitive_types5.rs b/solutions/04_primitive_types/primitive_types5.rs
new file mode 100644
index 0000000..46d7ae8
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types5.rs
@@ -0,0 +1,8 @@
+fn main() {
+ let cat = ("Furry McFurson", 3.5);
+
+ // Destructuring the tuple.
+ let (name, age) = cat;
+
+ println!("{name} is {age} years old");
+}
diff --git a/solutions/04_primitive_types/primitive_types6.rs b/solutions/04_primitive_types/primitive_types6.rs
new file mode 100644
index 0000000..9b7c277
--- /dev/null
+++ b/solutions/04_primitive_types/primitive_types6.rs
@@ -0,0 +1,16 @@
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn indexing_tuple() {
+ let numbers = (1, 2, 3);
+
+ // Tuple indexing syntax.
+ let second = numbers.1;
+
+ assert_eq!(second, 2, "This is not the 2nd number in the tuple!");
+ }
+}
diff --git a/solutions/05_vecs/vecs1.rs b/solutions/05_vecs/vecs1.rs
new file mode 100644
index 0000000..55b5676
--- /dev/null
+++ b/solutions/05_vecs/vecs1.rs
@@ -0,0 +1,23 @@
+fn array_and_vec() -> ([i32; 4], Vec) {
+ let a = [10, 20, 30, 40]; // Array
+
+ // Used the `vec!` macro.
+ let v = vec![10, 20, 30, 40];
+
+ (a, v)
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_array_and_vec_similarity() {
+ let (a, v) = array_and_vec();
+ assert_eq!(a, *v);
+ }
+}
diff --git a/solutions/05_vecs/vecs2.rs b/solutions/05_vecs/vecs2.rs
new file mode 100644
index 0000000..87f7625
--- /dev/null
+++ b/solutions/05_vecs/vecs2.rs
@@ -0,0 +1,55 @@
+fn vec_loop(input: &[i32]) -> Vec {
+ let mut output = Vec::new();
+
+ for element in input {
+ output.push(2 * element);
+ }
+
+ output
+}
+
+fn vec_map_example(input: &[i32]) -> Vec {
+ // An example of collecting a vector after mapping.
+ // We map each element of the `input` slice to its value plus 1.
+ // If the input is `[1, 2, 3]`, the output is `[2, 3, 4]`.
+ input.iter().map(|element| element + 1).collect()
+}
+
+fn vec_map(input: &[i32]) -> Vec {
+ // We will dive deeper into iterators, but for now, this is all what you
+ // had to do!
+ // Advanced note: This method is more efficient because it automatically
+ // preallocates enough capacity. This can be done manually in `vec_loop`
+ // using `Vec::with_capacity(input.len())` instead of `Vec::new()`.
+ input.iter().map(|element| 2 * element).collect()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_vec_loop() {
+ let input = [2, 4, 6, 8, 10];
+ let ans = vec_loop(&input);
+ assert_eq!(ans, [4, 8, 12, 16, 20]);
+ }
+
+ #[test]
+ fn test_vec_map_example() {
+ let input = [1, 2, 3];
+ let ans = vec_map_example(&input);
+ assert_eq!(ans, [2, 3, 4]);
+ }
+
+ #[test]
+ fn test_vec_map() {
+ let input = [2, 4, 6, 8, 10];
+ let ans = vec_map(&input);
+ assert_eq!(ans, [4, 8, 12, 16, 20]);
+ }
+}
diff --git a/solutions/06_move_semantics/move_semantics1.rs b/solutions/06_move_semantics/move_semantics1.rs
new file mode 100644
index 0000000..ac34e7a
--- /dev/null
+++ b/solutions/06_move_semantics/move_semantics1.rs
@@ -0,0 +1,25 @@
+fn fill_vec(vec: Vec) -> Vec {
+ let mut vec = vec;
+ // ^^^ added
+
+ vec.push(88);
+
+ vec
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn move_semantics1() {
+ let vec0 = vec![22, 44, 66];
+ let vec1 = fill_vec(vec0);
+ // `vec0` can't be accessed anymore because it is moved to `fill_vec`.
+ assert_eq!(vec1, vec![22, 44, 66, 88]);
+ }
+}
diff --git a/solutions/06_move_semantics/move_semantics2.rs b/solutions/06_move_semantics/move_semantics2.rs
new file mode 100644
index 0000000..7bcd33a
--- /dev/null
+++ b/solutions/06_move_semantics/move_semantics2.rs
@@ -0,0 +1,28 @@
+fn fill_vec(vec: Vec) -> Vec {
+ let mut vec = vec;
+
+ vec.push(88);
+
+ vec
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn move_semantics2() {
+ let vec0 = vec![22, 44, 66];
+
+ // Cloning `vec0` so that the clone is moved into `fill_vec`, not `vec0`
+ // itself.
+ let vec1 = fill_vec(vec0.clone());
+
+ assert_eq!(vec0, [22, 44, 66]);
+ assert_eq!(vec1, [22, 44, 66, 88]);
+ }
+}
diff --git a/solutions/06_move_semantics/move_semantics3.rs b/solutions/06_move_semantics/move_semantics3.rs
new file mode 100644
index 0000000..7ba4006
--- /dev/null
+++ b/solutions/06_move_semantics/move_semantics3.rs
@@ -0,0 +1,22 @@
+fn fill_vec(mut vec: Vec) -> Vec {
+ // ^^^ added
+ vec.push(88);
+
+ vec
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn move_semantics3() {
+ let vec0 = vec![22, 44, 66];
+ let vec1 = fill_vec(vec0);
+ assert_eq!(vec1, [22, 44, 66, 88]);
+ }
+}
diff --git a/solutions/06_move_semantics/move_semantics4.rs b/solutions/06_move_semantics/move_semantics4.rs
new file mode 100644
index 0000000..b7919ac
--- /dev/null
+++ b/solutions/06_move_semantics/move_semantics4.rs
@@ -0,0 +1,21 @@
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ // TODO: Fix the compiler errors only by reordering the lines in the test.
+ // Don't add, change or remove any line.
+ #[test]
+ fn move_semantics5() {
+ let mut x = 100;
+ let y = &mut x;
+ // `y` used here.
+ *y += 100;
+ // The mutable reference `y` is not used anymore,
+ // therefore a new reference can be created.
+ let z = &mut x;
+ *z += 1000;
+ assert_eq!(x, 1200);
+ }
+}
diff --git a/solutions/06_move_semantics/move_semantics5.rs b/solutions/06_move_semantics/move_semantics5.rs
new file mode 100644
index 0000000..678ec97
--- /dev/null
+++ b/solutions/06_move_semantics/move_semantics5.rs
@@ -0,0 +1,23 @@
+#![allow(clippy::ptr_arg)]
+
+fn main() {
+ let data = "Rust is great!".to_string();
+
+ get_char(&data);
+
+ string_uppercase(data);
+}
+
+// Borrows instead of taking ownership.
+// It is recommended to use `&str` instead of `&String` here. But this is
+// enough for now because we didn't handle strings yet.
+fn get_char(data: &String) -> char {
+ data.chars().last().unwrap()
+}
+
+// Takes ownership instead of borrowing.
+fn string_uppercase(mut data: String) {
+ data = data.to_uppercase();
+
+ println!("{data}");
+}
diff --git a/solutions/07_structs/structs1.rs b/solutions/07_structs/structs1.rs
new file mode 100644
index 0000000..98fafcc
--- /dev/null
+++ b/solutions/07_structs/structs1.rs
@@ -0,0 +1,49 @@
+struct ColorRegularStruct {
+ red: u8,
+ green: u8,
+ blue: u8,
+}
+
+struct ColorTupleStruct(u8, u8, u8);
+
+#[derive(Debug)]
+struct UnitStruct;
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn regular_structs() {
+ let green = ColorRegularStruct {
+ red: 0,
+ green: 255,
+ blue: 0,
+ };
+
+ assert_eq!(green.red, 0);
+ assert_eq!(green.green, 255);
+ assert_eq!(green.blue, 0);
+ }
+
+ #[test]
+ fn tuple_structs() {
+ let green = ColorTupleStruct(0, 255, 0);
+
+ assert_eq!(green.0, 0);
+ assert_eq!(green.1, 255);
+ assert_eq!(green.2, 0);
+ }
+
+ #[test]
+ fn unit_structs() {
+ let unit_struct = UnitStruct;
+ let message = format!("{unit_struct:?}s are fun!");
+
+ assert_eq!(message, "UnitStructs are fun!");
+ }
+}
diff --git a/solutions/07_structs/structs2.rs b/solutions/07_structs/structs2.rs
new file mode 100644
index 0000000..589dd93
--- /dev/null
+++ b/solutions/07_structs/structs2.rs
@@ -0,0 +1,51 @@
+#[derive(Debug)]
+struct Order {
+ name: String,
+ year: u32,
+ made_by_phone: bool,
+ made_by_mobile: bool,
+ made_by_email: bool,
+ item_number: u32,
+ count: u32,
+}
+
+fn create_order_template() -> Order {
+ Order {
+ name: String::from("Bob"),
+ year: 2019,
+ made_by_phone: false,
+ made_by_mobile: false,
+ made_by_email: true,
+ item_number: 123,
+ count: 0,
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn your_order() {
+ let order_template = create_order_template();
+
+ let your_order = Order {
+ name: String::from("Hacker in Rust"),
+ count: 1,
+ // Struct update syntax
+ ..order_template
+ };
+
+ assert_eq!(your_order.name, "Hacker in Rust");
+ assert_eq!(your_order.year, order_template.year);
+ assert_eq!(your_order.made_by_phone, order_template.made_by_phone);
+ assert_eq!(your_order.made_by_mobile, order_template.made_by_mobile);
+ assert_eq!(your_order.made_by_email, order_template.made_by_email);
+ assert_eq!(your_order.item_number, order_template.item_number);
+ assert_eq!(your_order.count, 1);
+ }
+}
diff --git a/solutions/07_structs/structs3.rs b/solutions/07_structs/structs3.rs
new file mode 100644
index 0000000..3f878cc
--- /dev/null
+++ b/solutions/07_structs/structs3.rs
@@ -0,0 +1,83 @@
+#[derive(Debug)]
+struct Package {
+ sender_country: String,
+ recipient_country: String,
+ weight_in_grams: u32,
+}
+
+impl Package {
+ fn new(sender_country: String, recipient_country: String, weight_in_grams: u32) -> Self {
+ if weight_in_grams < 10 {
+ // This isn't how you should handle errors in Rust, but we will
+ // learn about error handling later.
+ panic!("Can't ship a package with weight below 10 grams");
+ }
+
+ Self {
+ sender_country,
+ recipient_country,
+ weight_in_grams,
+ }
+ }
+
+ fn is_international(&self) -> bool {
+ // ^^^^^^^ added
+ self.sender_country != self.recipient_country
+ }
+
+ fn get_fees(&self, cents_per_gram: u32) -> u32 {
+ // ^^^^^^ added
+ self.weight_in_grams * cents_per_gram
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ #[should_panic]
+ fn fail_creating_weightless_package() {
+ let sender_country = String::from("Spain");
+ let recipient_country = String::from("Austria");
+
+ Package::new(sender_country, recipient_country, 5);
+ }
+
+ #[test]
+ fn create_international_package() {
+ let sender_country = String::from("Spain");
+ let recipient_country = String::from("Russia");
+
+ let package = Package::new(sender_country, recipient_country, 1200);
+
+ assert!(package.is_international());
+ }
+
+ #[test]
+ fn create_local_package() {
+ let sender_country = String::from("Canada");
+ let recipient_country = sender_country.clone();
+
+ let package = Package::new(sender_country, recipient_country, 1200);
+
+ assert!(!package.is_international());
+ }
+
+ #[test]
+ fn calculate_transport_fees() {
+ let sender_country = String::from("Spain");
+ let recipient_country = String::from("Spain");
+
+ let cents_per_gram = 3;
+
+ let package = Package::new(sender_country, recipient_country, 1500);
+
+ assert_eq!(package.get_fees(cents_per_gram), 4500);
+ assert_eq!(package.get_fees(cents_per_gram * 2), 9000);
+ }
+}
diff --git a/solutions/08_enums/enums1.rs b/solutions/08_enums/enums1.rs
new file mode 100644
index 0000000..9724883
--- /dev/null
+++ b/solutions/08_enums/enums1.rs
@@ -0,0 +1,14 @@
+#[derive(Debug)]
+enum Message {
+ Quit,
+ Echo,
+ Move,
+ ChangeColor,
+}
+
+fn main() {
+ println!("{:?}", Message::Quit);
+ println!("{:?}", Message::Echo);
+ println!("{:?}", Message::Move);
+ println!("{:?}", Message::ChangeColor);
+}
diff --git a/solutions/08_enums/enums2.rs b/solutions/08_enums/enums2.rs
new file mode 100644
index 0000000..b19394c
--- /dev/null
+++ b/solutions/08_enums/enums2.rs
@@ -0,0 +1,27 @@
+#[allow(dead_code)]
+#[derive(Debug)]
+enum Message {
+ Move { x: i64, y: i64 },
+ Echo(String),
+ ChangeColor(u8, u8, u8),
+ Quit,
+}
+
+impl Message {
+ fn call(&self) {
+ println!("{self:?}");
+ }
+}
+
+fn main() {
+ let messages = [
+ Message::Move { x: 10, y: 30 },
+ Message::Echo(String::from("hello world")),
+ Message::ChangeColor(200, 255, 255),
+ Message::Quit,
+ ];
+
+ for message in &messages {
+ message.call();
+ }
+}
diff --git a/solutions/08_enums/enums3.rs b/solutions/08_enums/enums3.rs
new file mode 100644
index 0000000..8baa25c
--- /dev/null
+++ b/solutions/08_enums/enums3.rs
@@ -0,0 +1,75 @@
+enum Message {
+ ChangeColor(u8, u8, u8),
+ Echo(String),
+ Move(Point),
+ Quit,
+}
+
+struct Point {
+ x: u8,
+ y: u8,
+}
+
+struct State {
+ color: (u8, u8, u8),
+ position: Point,
+ quit: bool,
+ message: String,
+}
+
+impl State {
+ fn change_color(&mut self, color: (u8, u8, u8)) {
+ self.color = color;
+ }
+
+ fn quit(&mut self) {
+ self.quit = true;
+ }
+
+ fn echo(&mut self, s: String) {
+ self.message = s;
+ }
+
+ fn move_position(&mut self, point: Point) {
+ self.position = point;
+ }
+
+ fn process(&mut self, message: Message) {
+ match message {
+ Message::ChangeColor(r, g, b) => self.change_color((r, g, b)),
+ Message::Echo(s) => self.echo(s),
+ Message::Move(point) => self.move_position(point),
+ Message::Quit => self.quit(),
+ }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_match_message_call() {
+ let mut state = State {
+ quit: false,
+ position: Point { x: 0, y: 0 },
+ color: (0, 0, 0),
+ message: String::from("hello world"),
+ };
+
+ state.process(Message::ChangeColor(255, 0, 255));
+ state.process(Message::Echo(String::from("Hello world!")));
+ state.process(Message::Move(Point { x: 10, y: 15 }));
+ state.process(Message::Quit);
+
+ assert_eq!(state.color, (255, 0, 255));
+ assert_eq!(state.position.x, 10);
+ assert_eq!(state.position.y, 15);
+ assert!(state.quit);
+ assert_eq!(state.message, "Hello world!");
+ }
+}
diff --git a/solutions/09_strings/strings1.rs b/solutions/09_strings/strings1.rs
new file mode 100644
index 0000000..f7ba811
--- /dev/null
+++ b/solutions/09_strings/strings1.rs
@@ -0,0 +1,9 @@
+fn current_favorite_color() -> String {
+ // Equivalent to `String::from("blue")`
+ "blue".to_string()
+}
+
+fn main() {
+ let answer = current_favorite_color();
+ println!("My current favorite color is {answer}");
+}
diff --git a/solutions/09_strings/strings2.rs b/solutions/09_strings/strings2.rs
new file mode 100644
index 0000000..7de311f
--- /dev/null
+++ b/solutions/09_strings/strings2.rs
@@ -0,0 +1,15 @@
+fn is_a_color_word(attempt: &str) -> bool {
+ attempt == "green" || attempt == "blue" || attempt == "red"
+}
+
+fn main() {
+ let word = String::from("green");
+
+ if is_a_color_word(&word) {
+ // ^ added to have `&String` which is automatically
+ // coerced to `&str` by the compiler.
+ println!("That is a color word I know!");
+ } else {
+ println!("That is not a color word I know.");
+ }
+}
diff --git a/solutions/09_strings/strings3.rs b/solutions/09_strings/strings3.rs
new file mode 100644
index 0000000..a478e62
--- /dev/null
+++ b/solutions/09_strings/strings3.rs
@@ -0,0 +1,48 @@
+fn trim_me(input: &str) -> &str {
+ input.trim()
+}
+
+fn compose_me(input: &str) -> String {
+ // The macro `format!` has the same syntax as `println!`, but it returns a
+ // string instead of printing it to the terminal.
+ // Equivalent to `input.to_string() + " world!"`
+ format!("{input} world!")
+}
+
+fn replace_me(input: &str) -> String {
+ input.replace("cars", "balloons")
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn trim_a_string() {
+ assert_eq!(trim_me("Hello! "), "Hello!");
+ assert_eq!(trim_me(" What's up!"), "What's up!");
+ assert_eq!(trim_me(" Hola! "), "Hola!");
+ }
+
+ #[test]
+ fn compose_a_string() {
+ assert_eq!(compose_me("Hello"), "Hello world!");
+ assert_eq!(compose_me("Goodbye"), "Goodbye world!");
+ }
+
+ #[test]
+ fn replace_a_string() {
+ assert_eq!(
+ replace_me("I think cars are cool"),
+ "I think balloons are cool",
+ );
+ assert_eq!(
+ replace_me("I love to look at cars"),
+ "I love to look at balloons",
+ );
+ }
+}
diff --git a/solutions/09_strings/strings4.rs b/solutions/09_strings/strings4.rs
new file mode 100644
index 0000000..9dc6917
--- /dev/null
+++ b/solutions/09_strings/strings4.rs
@@ -0,0 +1,38 @@
+fn string_slice(arg: &str) {
+ println!("{arg}");
+}
+fn string(arg: String) {
+ println!("{arg}");
+}
+
+fn main() {
+ string_slice("blue");
+
+ string("red".to_string());
+
+ string(String::from("hi"));
+
+ string("rust is fun!".to_owned());
+
+ // Here, both answers work.
+ // `.into()` converts a type into an expected type.
+ // If it is called where `String` is expected, it will convert `&str` to `String`.
+ // But if is called where `&str` is expected, then `&str` is kept `&str` since no
+ // conversion is needed.
+ string("nice weather".into());
+ string_slice("nice weather".into());
+ // ^^^^^^^ the compiler recommends removing the `.into()`
+ // call because it is a useless conversion.
+
+ string(format!("Interpolation {}", "Station"));
+
+ // WARNING: This is byte indexing, not character indexing.
+ // Character indexing can be done using `s.chars().nth(INDEX)`.
+ string_slice(&String::from("abc")[0..1]);
+
+ string_slice(" hello there ".trim());
+
+ string("Happy Monday!".replace("Mon", "Tues"));
+
+ string("mY sHiFt KeY iS sTiCkY".to_lowercase());
+}
diff --git a/solutions/10_modules/modules1.rs b/solutions/10_modules/modules1.rs
new file mode 100644
index 0000000..873b412
--- /dev/null
+++ b/solutions/10_modules/modules1.rs
@@ -0,0 +1,15 @@
+mod sausage_factory {
+ fn get_secret_recipe() -> String {
+ String::from("Ginger")
+ }
+
+ // Added `pub` before `fn` to make the function accessible outside the module.
+ pub fn make_sausage() {
+ get_secret_recipe();
+ println!("sausage!");
+ }
+}
+
+fn main() {
+ sausage_factory::make_sausage();
+}
diff --git a/solutions/10_modules/modules2.rs b/solutions/10_modules/modules2.rs
new file mode 100644
index 0000000..298d76e
--- /dev/null
+++ b/solutions/10_modules/modules2.rs
@@ -0,0 +1,24 @@
+#[allow(dead_code)]
+mod delicious_snacks {
+ // Added `pub` and used the expected alias after `as`.
+ pub use self::fruits::PEAR as fruit;
+ pub use self::veggies::CUCUMBER as veggie;
+
+ mod fruits {
+ pub const PEAR: &str = "Pear";
+ pub const APPLE: &str = "Apple";
+ }
+
+ mod veggies {
+ pub const CUCUMBER: &str = "Cucumber";
+ pub const CARROT: &str = "Carrot";
+ }
+}
+
+fn main() {
+ println!(
+ "favorite snacks: {} and {}",
+ delicious_snacks::fruit,
+ delicious_snacks::veggie,
+ );
+}
diff --git a/solutions/10_modules/modules3.rs b/solutions/10_modules/modules3.rs
new file mode 100644
index 0000000..99ff5a7
--- /dev/null
+++ b/solutions/10_modules/modules3.rs
@@ -0,0 +1,8 @@
+use std::time::{SystemTime, UNIX_EPOCH};
+
+fn main() {
+ match SystemTime::now().duration_since(UNIX_EPOCH) {
+ Ok(n) => println!("1970-01-01 00:00:00 UTC was {} seconds ago!", n.as_secs()),
+ Err(_) => panic!("SystemTime before UNIX EPOCH!"),
+ }
+}
diff --git a/solutions/11_hashmaps/hashmaps1.rs b/solutions/11_hashmaps/hashmaps1.rs
new file mode 100644
index 0000000..3a787c4
--- /dev/null
+++ b/solutions/11_hashmaps/hashmaps1.rs
@@ -0,0 +1,42 @@
+// A basket of fruits in the form of a hash map needs to be defined. The key
+// represents the name of the fruit and the value represents how many of that
+// particular fruit is in the basket. You have to put at least 3 different
+// types of fruits (e.g apple, banana, mango) in the basket and the total count
+// of all the fruits should be at least 5.
+
+use std::collections::HashMap;
+
+fn fruit_basket() -> HashMap {
+ // Declare the hash map.
+ let mut basket = HashMap::new();
+
+ // Two bananas are already given for you :)
+ basket.insert(String::from("banana"), 2);
+
+ // Put more fruits in your basket.
+ basket.insert(String::from("apple"), 3);
+ basket.insert(String::from("mango"), 1);
+
+ basket
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn at_least_three_types_of_fruits() {
+ let basket = fruit_basket();
+ assert!(basket.len() >= 3);
+ }
+
+ #[test]
+ fn at_least_five_fruits() {
+ let basket = fruit_basket();
+ assert!(basket.values().sum::() >= 5);
+ }
+}
diff --git a/solutions/11_hashmaps/hashmaps2.rs b/solutions/11_hashmaps/hashmaps2.rs
new file mode 100644
index 0000000..a5e6ef9
--- /dev/null
+++ b/solutions/11_hashmaps/hashmaps2.rs
@@ -0,0 +1,95 @@
+// We're collecting different fruits to bake a delicious fruit cake. For this,
+// we have a basket, which we'll represent in the form of a hash map. The key
+// represents the name of each fruit we collect and the value represents how
+// many of that particular fruit we have collected. Three types of fruits -
+// Apple (4), Mango (2) and Lychee (5) are already in the basket hash map. You
+// must add fruit to the basket so that there is at least one of each kind and
+// more than 11 in total - we have a lot of mouths to feed. You are not allowed
+// to insert any more of these fruits!
+
+use std::collections::HashMap;
+
+#[derive(Hash, PartialEq, Eq, Debug)]
+enum Fruit {
+ Apple,
+ Banana,
+ Mango,
+ Lychee,
+ Pineapple,
+}
+
+fn fruit_basket(basket: &mut HashMap) {
+ let fruit_kinds = [
+ Fruit::Apple,
+ Fruit::Banana,
+ Fruit::Mango,
+ Fruit::Lychee,
+ Fruit::Pineapple,
+ ];
+
+ for fruit in fruit_kinds {
+ // If fruit doesn't exist, insert it with some value.
+ basket.entry(fruit).or_insert(5);
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ // Don't modify this function!
+ fn get_fruit_basket() -> HashMap {
+ let content = [(Fruit::Apple, 4), (Fruit::Mango, 2), (Fruit::Lychee, 5)];
+ HashMap::from_iter(content)
+ }
+
+ #[test]
+ fn test_given_fruits_are_not_modified() {
+ let mut basket = get_fruit_basket();
+ fruit_basket(&mut basket);
+ assert_eq!(*basket.get(&Fruit::Apple).unwrap(), 4);
+ assert_eq!(*basket.get(&Fruit::Mango).unwrap(), 2);
+ assert_eq!(*basket.get(&Fruit::Lychee).unwrap(), 5);
+ }
+
+ #[test]
+ fn at_least_five_types_of_fruits() {
+ let mut basket = get_fruit_basket();
+ fruit_basket(&mut basket);
+ let count_fruit_kinds = basket.len();
+ assert!(count_fruit_kinds >= 5);
+ }
+
+ #[test]
+ fn greater_than_eleven_fruits() {
+ let mut basket = get_fruit_basket();
+ fruit_basket(&mut basket);
+ let count = basket.values().sum::();
+ assert!(count > 11);
+ }
+
+ #[test]
+ fn all_fruit_types_in_basket() {
+ let fruit_kinds = [
+ Fruit::Apple,
+ Fruit::Banana,
+ Fruit::Mango,
+ Fruit::Lychee,
+ Fruit::Pineapple,
+ ];
+
+ let mut basket = get_fruit_basket();
+ fruit_basket(&mut basket);
+
+ for fruit_kind in fruit_kinds {
+ let Some(amount) = basket.get(&fruit_kind) else {
+ panic!("Fruit kind {fruit_kind:?} was not found in basket");
+ };
+ assert!(*amount > 0);
+ }
+ }
+}
diff --git a/solutions/11_hashmaps/hashmaps3.rs b/solutions/11_hashmaps/hashmaps3.rs
new file mode 100644
index 0000000..54f480b
--- /dev/null
+++ b/solutions/11_hashmaps/hashmaps3.rs
@@ -0,0 +1,83 @@
+// A list of scores (one per line) of a soccer match is given. Each line is of
+// the form ",,,"
+// Example: "England,France,4,2" (England scored 4 goals, France 2).
+//
+// You have to build a scores table containing the name of the team, the total
+// number of goals the team scored, and the total number of goals the team
+// conceded.
+
+use std::collections::HashMap;
+
+// A structure to store the goal details of a team.
+#[derive(Default)]
+struct Team {
+ goals_scored: u8,
+ goals_conceded: u8,
+}
+
+fn build_scores_table(results: &str) -> HashMap<&str, Team> {
+ // The name of the team is the key and its associated struct is the value.
+ let mut scores = HashMap::new();
+
+ for line in results.lines() {
+ let mut split_iterator = line.split(',');
+ // NOTE: We use `unwrap` because we didn't deal with error handling yet.
+ let team_1_name = split_iterator.next().unwrap();
+ let team_2_name = split_iterator.next().unwrap();
+ let team_1_score: u8 = split_iterator.next().unwrap().parse().unwrap();
+ let team_2_score: u8 = split_iterator.next().unwrap().parse().unwrap();
+
+ // Insert the default with zeros if a team doesn't exist yet.
+ let team_1 = scores.entry(team_1_name).or_insert_with(Team::default);
+ // Update the values.
+ team_1.goals_scored += team_1_score;
+ team_1.goals_conceded += team_2_score;
+
+ // Similarely for the second team.
+ let team_2 = scores.entry(team_2_name).or_insert_with(Team::default);
+ team_2.goals_scored += team_2_score;
+ team_2.goals_conceded += team_1_score;
+ }
+
+ scores
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ const RESULTS: &str = "England,France,4,2
+France,Italy,3,1
+Poland,Spain,2,0
+Germany,England,2,1
+England,Spain,1,0";
+
+ #[test]
+ fn build_scores() {
+ let scores = build_scores_table(RESULTS);
+
+ assert!(["England", "France", "Germany", "Italy", "Poland", "Spain"]
+ .into_iter()
+ .all(|team_name| scores.contains_key(team_name)));
+ }
+
+ #[test]
+ fn validate_team_score_1() {
+ let scores = build_scores_table(RESULTS);
+ let team = scores.get("England").unwrap();
+ assert_eq!(team.goals_scored, 6);
+ assert_eq!(team.goals_conceded, 4);
+ }
+
+ #[test]
+ fn validate_team_score_2() {
+ let scores = build_scores_table(RESULTS);
+ let team = scores.get("Spain").unwrap();
+ assert_eq!(team.goals_scored, 0);
+ assert_eq!(team.goals_conceded, 3);
+ }
+}
diff --git a/solutions/12_options/options1.rs b/solutions/12_options/options1.rs
new file mode 100644
index 0000000..4d615dd
--- /dev/null
+++ b/solutions/12_options/options1.rs
@@ -0,0 +1,39 @@
+// This function returns how much icecream there is left in the fridge.
+// If it's before 22:00 (24-hour system), then 5 scoops are left. At 22:00,
+// someone eats it all, so no icecream is left (value 0). Return `None` if
+// `hour_of_day` is higher than 23.
+fn maybe_icecream(hour_of_day: u16) -> Option {
+ match hour_of_day {
+ 0..=21 => Some(5),
+ 22..=23 => Some(0),
+ _ => None,
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn raw_value() {
+ // Using `unwrap` is fine in a test.
+ let icecreams = maybe_icecream(12).unwrap();
+
+ assert_eq!(icecreams, 5);
+ }
+
+ #[test]
+ fn check_icecream() {
+ assert_eq!(maybe_icecream(0), Some(5));
+ assert_eq!(maybe_icecream(9), Some(5));
+ assert_eq!(maybe_icecream(18), Some(5));
+ assert_eq!(maybe_icecream(22), Some(0));
+ assert_eq!(maybe_icecream(23), Some(0));
+ assert_eq!(maybe_icecream(24), None);
+ assert_eq!(maybe_icecream(25), None);
+ }
+}
diff --git a/solutions/12_options/options2.rs b/solutions/12_options/options2.rs
new file mode 100644
index 0000000..0f24665
--- /dev/null
+++ b/solutions/12_options/options2.rs
@@ -0,0 +1,37 @@
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn simple_option() {
+ let target = "rustlings";
+ let optional_target = Some(target);
+
+ // if-let
+ if let Some(word) = optional_target {
+ assert_eq!(word, target);
+ }
+ }
+
+ #[test]
+ fn layered_option() {
+ let range = 10;
+ let mut optional_integers: Vec> = vec![None];
+
+ for i in 1..=range {
+ optional_integers.push(Some(i));
+ }
+
+ let mut cursor = range;
+
+ // while-let with nested pattern matching
+ while let Some(Some(integer)) = optional_integers.pop() {
+ assert_eq!(integer, cursor);
+ cursor -= 1;
+ }
+
+ assert_eq!(cursor, 0);
+ }
+}
diff --git a/solutions/12_options/options3.rs b/solutions/12_options/options3.rs
new file mode 100644
index 0000000..0081eeb
--- /dev/null
+++ b/solutions/12_options/options3.rs
@@ -0,0 +1,26 @@
+#[derive(Debug)]
+struct Point {
+ x: i32,
+ y: i32,
+}
+
+fn main() {
+ let optional_point = Some(Point { x: 100, y: 200 });
+
+ // Solution 1: Matching over the `Option` (not `&Option`) but without moving
+ // out of the `Some` variant.
+ match optional_point {
+ Some(ref p) => println!("Co-ordinates are {},{}", p.x, p.y),
+ // ^^^ added
+ _ => panic!("No match!"),
+ }
+
+ // Solution 2: Matching over a reference (`&Option`) by added `&` before
+ // `optional_point`.
+ match &optional_point {
+ Some(p) => println!("Co-ordinates are {},{}", p.x, p.y),
+ _ => panic!("No match!"),
+ }
+
+ println!("{optional_point:?}");
+}
diff --git a/solutions/13_error_handling/errors1.rs b/solutions/13_error_handling/errors1.rs
new file mode 100644
index 0000000..f552ca7
--- /dev/null
+++ b/solutions/13_error_handling/errors1.rs
@@ -0,0 +1,37 @@
+fn generate_nametag_text(name: String) -> Result {
+ // ^^^^^^ ^^^^^^
+ if name.is_empty() {
+ // `Err(String)` instead of `None`.
+ Err("Empty names aren't allowed".to_string())
+ } else {
+ // `Ok` instead of `Some`.
+ Ok(format!("Hi! My name is {name}"))
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn generates_nametag_text_for_a_nonempty_name() {
+ assert_eq!(
+ generate_nametag_text("Beyoncé".to_string()).as_deref(),
+ Ok("Hi! My name is Beyoncé"),
+ );
+ }
+
+ #[test]
+ fn explains_why_generating_nametag_text_fails() {
+ assert_eq!(
+ generate_nametag_text(String::new())
+ .as_ref()
+ .map_err(|e| e.as_str()),
+ Err("Empty names aren't allowed"),
+ );
+ }
+}
diff --git a/solutions/13_error_handling/errors2.rs b/solutions/13_error_handling/errors2.rs
new file mode 100644
index 0000000..0597c8c
--- /dev/null
+++ b/solutions/13_error_handling/errors2.rs
@@ -0,0 +1,58 @@
+// Say we're writing a game where you can buy items with tokens. All items cost
+// 5 tokens, and whenever you purchase items there is a processing fee of 1
+// token. A player of the game will type in how many items they want to buy, and
+// the `total_cost` function will calculate the total cost of the items. Since
+// the player typed in the quantity, we get it as a string. They might have
+// typed anything, not just numbers!
+//
+// Right now, this function isn't handling the error case at all. What we want
+// to do is: If we call the `total_cost` function on a string that is not a
+// number, that function will return a `ParseIntError`. In that case, we want to
+// immediately return that error from our function and not try to multiply and
+// add.
+//
+// There are at least two ways to implement this that are both correct. But one
+// is a lot shorter!
+
+use std::num::ParseIntError;
+
+#[allow(unused_variables)]
+fn total_cost(item_quantity: &str) -> Result {
+ let processing_fee = 1;
+ let cost_per_item = 5;
+
+ // Added `?` to propagate the error.
+ let qty = item_quantity.parse::()?;
+ // ^ added
+
+ // Equivalent to this verbose version:
+ let qty = match item_quantity.parse::() {
+ Ok(v) => v,
+ Err(e) => return Err(e),
+ };
+
+ Ok(qty * cost_per_item + processing_fee)
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+ use std::num::IntErrorKind;
+
+ #[test]
+ fn item_quantity_is_a_valid_number() {
+ assert_eq!(total_cost("34"), Ok(171));
+ }
+
+ #[test]
+ fn item_quantity_is_an_invalid_number() {
+ assert_eq!(
+ total_cost("beep boop").unwrap_err().kind(),
+ &IntErrorKind::InvalidDigit,
+ );
+ }
+}
diff --git a/solutions/13_error_handling/errors3.rs b/solutions/13_error_handling/errors3.rs
new file mode 100644
index 0000000..63f4aba
--- /dev/null
+++ b/solutions/13_error_handling/errors3.rs
@@ -0,0 +1,32 @@
+// This is a program that is trying to use a completed version of the
+// `total_cost` function from the previous exercise. It's not working though!
+// Why not? What should we do to fix it?
+
+use std::num::ParseIntError;
+
+// Don't change this function.
+fn total_cost(item_quantity: &str) -> Result {
+ let processing_fee = 1;
+ let cost_per_item = 5;
+ let qty = item_quantity.parse::()?;
+
+ Ok(qty * cost_per_item + processing_fee)
+}
+
+fn main() -> Result<(), ParseIntError> {
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ added
+ let mut tokens = 100;
+ let pretend_user_input = "8";
+
+ let cost = total_cost(pretend_user_input)?;
+
+ if cost > tokens {
+ println!("You can't afford that many!");
+ } else {
+ tokens -= cost;
+ println!("You now have {tokens} tokens.");
+ }
+
+ // Added this line to return the `Ok` variant of the expected `Result`.
+ Ok(())
+}
diff --git a/solutions/13_error_handling/errors4.rs b/solutions/13_error_handling/errors4.rs
new file mode 100644
index 0000000..f4d39bf
--- /dev/null
+++ b/solutions/13_error_handling/errors4.rs
@@ -0,0 +1,44 @@
+#![allow(clippy::comparison_chain)]
+
+#[derive(PartialEq, Debug)]
+enum CreationError {
+ Negative,
+ Zero,
+}
+
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
+impl PositiveNonzeroInteger {
+ fn new(value: i64) -> Result {
+ if value == 0 {
+ Err(CreationError::Zero)
+ } else if value < 0 {
+ Err(CreationError::Negative)
+ } else {
+ Ok(Self(value as u64))
+ }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_creation() {
+ assert_eq!(
+ PositiveNonzeroInteger::new(10),
+ Ok(PositiveNonzeroInteger(10)),
+ );
+ assert_eq!(
+ PositiveNonzeroInteger::new(-10),
+ Err(CreationError::Negative),
+ );
+ assert_eq!(PositiveNonzeroInteger::new(0), Err(CreationError::Zero));
+ }
+}
diff --git a/solutions/13_error_handling/errors5.rs b/solutions/13_error_handling/errors5.rs
new file mode 100644
index 0000000..c1424ee
--- /dev/null
+++ b/solutions/13_error_handling/errors5.rs
@@ -0,0 +1,54 @@
+// This exercise is an altered version of the `errors4` exercise. It uses some
+// concepts that we won't get to until later in the course, like `Box` and the
+// `From` trait. It's not important to understand them in detail right now, but
+// you can read ahead if you like. For now, think of the `Box` type as
+// an "I want anything that does ???" type.
+//
+// In short, this particular use case for boxes is for when you want to own a
+// value and you care only that it is a type which implements a particular
+// trait. To do so, The `Box` is declared as of type `Box` where
+// `Trait` is the trait the compiler looks for on any value used in that
+// context. For this exercise, that context is the potential errors which
+// can be returned in a `Result`.
+
+use std::error::Error;
+use std::fmt;
+
+#[derive(PartialEq, Debug)]
+enum CreationError {
+ Negative,
+ Zero,
+}
+
+// This is required so that `CreationError` can implement `Error`.
+impl fmt::Display for CreationError {
+ fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+ let description = match *self {
+ CreationError::Negative => "number is negative",
+ CreationError::Zero => "number is zero",
+ };
+ f.write_str(description)
+ }
+}
+
+impl Error for CreationError {}
+
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
+impl PositiveNonzeroInteger {
+ fn new(value: i64) -> Result {
+ match value {
+ x if x < 0 => Err(CreationError::Negative),
+ 0 => Err(CreationError::Zero),
+ x => Ok(PositiveNonzeroInteger(x as u64)),
+ }
+ }
+}
+
+fn main() -> Result<(), Box> {
+ let pretend_user_input = "42";
+ let x: i64 = pretend_user_input.parse()?;
+ println!("output={:?}", PositiveNonzeroInteger::new(x)?);
+ Ok(())
+}
diff --git a/solutions/13_error_handling/errors6.rs b/solutions/13_error_handling/errors6.rs
new file mode 100644
index 0000000..429d3ea
--- /dev/null
+++ b/solutions/13_error_handling/errors6.rs
@@ -0,0 +1,91 @@
+// Using catch-all error types like `Box` isn't recommended for
+// library code where callers might want to make decisions based on the error
+// content instead of printing it out or propagating it further. Here, we define
+// a custom error type to make it possible for callers to decide what to do next
+// when our function returns an error.
+
+use std::num::ParseIntError;
+
+#[derive(PartialEq, Debug)]
+enum CreationError {
+ Negative,
+ Zero,
+}
+
+// A custom error type that we will be using in `PositiveNonzeroInteger::parse`.
+#[derive(PartialEq, Debug)]
+enum ParsePosNonzeroError {
+ Creation(CreationError),
+ ParseInt(ParseIntError),
+}
+
+impl ParsePosNonzeroError {
+ fn from_creation(err: CreationError) -> Self {
+ Self::Creation(err)
+ }
+
+ fn from_parseint(err: ParseIntError) -> Self {
+ Self::ParseInt(err)
+ }
+}
+
+#[derive(PartialEq, Debug)]
+struct PositiveNonzeroInteger(u64);
+
+impl PositiveNonzeroInteger {
+ fn new(value: i64) -> Result {
+ match value {
+ x if x < 0 => Err(CreationError::Negative),
+ 0 => Err(CreationError::Zero),
+ x => Ok(Self(x as u64)),
+ }
+ }
+
+ fn parse(s: &str) -> Result {
+ // Return an appropriate error instead of panicking when `parse()`
+ // returns an error.
+ let x: i64 = s.parse().map_err(ParsePosNonzeroError::from_parseint)?;
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ Self::new(x).map_err(ParsePosNonzeroError::from_creation)
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod test {
+ use super::*;
+
+ #[test]
+ fn test_parse_error() {
+ assert!(matches!(
+ PositiveNonzeroInteger::parse("not a number"),
+ Err(ParsePosNonzeroError::ParseInt(_)),
+ ));
+ }
+
+ #[test]
+ fn test_negative() {
+ assert_eq!(
+ PositiveNonzeroInteger::parse("-555"),
+ Err(ParsePosNonzeroError::Creation(CreationError::Negative)),
+ );
+ }
+
+ #[test]
+ fn test_zero() {
+ assert_eq!(
+ PositiveNonzeroInteger::parse("0"),
+ Err(ParsePosNonzeroError::Creation(CreationError::Zero)),
+ );
+ }
+
+ #[test]
+ fn test_positive() {
+ let x = PositiveNonzeroInteger::new(42).unwrap();
+ assert_eq!(x.0, 42);
+ assert_eq!(PositiveNonzeroInteger::parse("42"), Ok(x));
+ }
+}
diff --git a/solutions/14_generics/generics1.rs b/solutions/14_generics/generics1.rs
new file mode 100644
index 0000000..e2195fd
--- /dev/null
+++ b/solutions/14_generics/generics1.rs
@@ -0,0 +1,17 @@
+// `Vec` is generic over the type `T`. In most cases, the compiler is able to
+// infer `T`, for example after pushing a value with a concrete type to the vector.
+// But in this exercise, the compiler needs some help through a type annotation.
+
+fn main() {
+ // `u8` and `i8` can both be converted to `i16`.
+ let mut numbers: Vec = Vec::new();
+ // ^^^^^^^^^^ added
+
+ // Don't change the lines below.
+ let n1: u8 = 42;
+ numbers.push(n1.into());
+ let n2: i8 = -1;
+ numbers.push(n2.into());
+
+ println!("{numbers:?}");
+}
diff --git a/solutions/14_generics/generics2.rs b/solutions/14_generics/generics2.rs
new file mode 100644
index 0000000..14f3f7a
--- /dev/null
+++ b/solutions/14_generics/generics2.rs
@@ -0,0 +1,28 @@
+struct Wrapper {
+ value: T,
+}
+
+impl Wrapper {
+ fn new(value: T) -> Self {
+ Wrapper { value }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn store_u32_in_wrapper() {
+ assert_eq!(Wrapper::new(42).value, 42);
+ }
+
+ #[test]
+ fn store_str_in_wrapper() {
+ assert_eq!(Wrapper::new("Foo").value, "Foo");
+ }
+}
diff --git a/solutions/15_traits/traits1.rs b/solutions/15_traits/traits1.rs
new file mode 100644
index 0000000..790873f
--- /dev/null
+++ b/solutions/15_traits/traits1.rs
@@ -0,0 +1,32 @@
+// The trait `AppendBar` has only one function which appends "Bar" to any object
+// implementing this trait.
+trait AppendBar {
+ fn append_bar(self) -> Self;
+}
+
+impl AppendBar for String {
+ fn append_bar(self) -> Self {
+ self + "Bar"
+ }
+}
+
+fn main() {
+ let s = String::from("Foo");
+ let s = s.append_bar();
+ println!("s: {s}");
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn is_foo_bar() {
+ assert_eq!(String::from("Foo").append_bar(), "FooBar");
+ }
+
+ #[test]
+ fn is_bar_bar() {
+ assert_eq!(String::from("").append_bar().append_bar(), "BarBar");
+ }
+}
diff --git a/solutions/15_traits/traits2.rs b/solutions/15_traits/traits2.rs
new file mode 100644
index 0000000..0db93e0
--- /dev/null
+++ b/solutions/15_traits/traits2.rs
@@ -0,0 +1,27 @@
+trait AppendBar {
+ fn append_bar(self) -> Self;
+}
+
+impl AppendBar for Vec {
+ fn append_bar(mut self) -> Self {
+ // ^^^ this is important
+ self.push(String::from("Bar"));
+ self
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn is_vec_pop_eq_bar() {
+ let mut foo = vec![String::from("Foo")].append_bar();
+ assert_eq!(foo.pop().unwrap(), "Bar");
+ assert_eq!(foo.pop().unwrap(), "Foo");
+ }
+}
diff --git a/solutions/15_traits/traits3.rs b/solutions/15_traits/traits3.rs
new file mode 100644
index 0000000..747d919
--- /dev/null
+++ b/solutions/15_traits/traits3.rs
@@ -0,0 +1,38 @@
+#![allow(dead_code)]
+
+trait Licensed {
+ fn licensing_info(&self) -> String {
+ "Default license".to_string()
+ }
+}
+
+struct SomeSoftware {
+ version_number: i32,
+}
+
+struct OtherSoftware {
+ version_number: String,
+}
+
+impl Licensed for SomeSoftware {}
+impl Licensed for OtherSoftware {}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn is_licensing_info_the_same() {
+ let licensing_info = "Default license";
+ let some_software = SomeSoftware { version_number: 1 };
+ let other_software = OtherSoftware {
+ version_number: "v2.0.0".to_string(),
+ };
+ assert_eq!(some_software.licensing_info(), licensing_info);
+ assert_eq!(other_software.licensing_info(), licensing_info);
+ }
+}
diff --git a/solutions/15_traits/traits4.rs b/solutions/15_traits/traits4.rs
new file mode 100644
index 0000000..3675b8d
--- /dev/null
+++ b/solutions/15_traits/traits4.rs
@@ -0,0 +1,35 @@
+trait Licensed {
+ fn licensing_info(&self) -> String {
+ "Default license".to_string()
+ }
+}
+
+struct SomeSoftware;
+struct OtherSoftware;
+
+impl Licensed for SomeSoftware {}
+impl Licensed for OtherSoftware {}
+
+fn compare_license_types(software1: impl Licensed, software2: impl Licensed) -> bool {
+ // ^^^^^^^^^^^^^ ^^^^^^^^^^^^^
+ software1.licensing_info() == software2.licensing_info()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn compare_license_information() {
+ assert!(compare_license_types(SomeSoftware, OtherSoftware));
+ }
+
+ #[test]
+ fn compare_license_information_backwards() {
+ assert!(compare_license_types(OtherSoftware, SomeSoftware));
+ }
+}
diff --git a/solutions/15_traits/traits5.rs b/solutions/15_traits/traits5.rs
new file mode 100644
index 0000000..1fb426a
--- /dev/null
+++ b/solutions/15_traits/traits5.rs
@@ -0,0 +1,39 @@
+trait SomeTrait {
+ fn some_function(&self) -> bool {
+ true
+ }
+}
+
+trait OtherTrait {
+ fn other_function(&self) -> bool {
+ true
+ }
+}
+
+struct SomeStruct;
+impl SomeTrait for SomeStruct {}
+impl OtherTrait for SomeStruct {}
+
+struct OtherStruct;
+impl SomeTrait for OtherStruct {}
+impl OtherTrait for OtherStruct {}
+
+fn some_func(item: impl SomeTrait + OtherTrait) -> bool {
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ item.some_function() && item.other_function()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_some_func() {
+ assert!(some_func(SomeStruct));
+ assert!(some_func(OtherStruct));
+ }
+}
diff --git a/solutions/16_lifetimes/lifetimes1.rs b/solutions/16_lifetimes/lifetimes1.rs
new file mode 100644
index 0000000..ca7b688
--- /dev/null
+++ b/solutions/16_lifetimes/lifetimes1.rs
@@ -0,0 +1,28 @@
+// The Rust compiler needs to know how to check whether supplied references are
+// valid, so that it can let the programmer know if a reference is at risk of
+// going out of scope before it is used. Remember, references are borrows and do
+// not own their own data. What if their owner goes out of scope?
+
+fn longest<'a>(x: &'a str, y: &'a str) -> &'a str {
+ // ^^^^ ^^ ^^ ^^
+ if x.len() > y.len() {
+ x
+ } else {
+ y
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_longest() {
+ assert_eq!(longest("abcd", "123"), "abcd");
+ assert_eq!(longest("abc", "1234"), "1234");
+ }
+}
diff --git a/solutions/16_lifetimes/lifetimes2.rs b/solutions/16_lifetimes/lifetimes2.rs
new file mode 100644
index 0000000..b0f2ef1
--- /dev/null
+++ b/solutions/16_lifetimes/lifetimes2.rs
@@ -0,0 +1,33 @@
+fn longest<'a>(x: &'a str, y: &'a str) -> &'a str {
+ if x.len() > y.len() {
+ x
+ } else {
+ y
+ }
+}
+
+fn main() {
+ let string1 = String::from("long string is long");
+ // Solution1: You can move `strings2` out of the inner block so that it is
+ // not dropped before the print statement.
+ let string2 = String::from("xyz");
+ let result;
+ {
+ result = longest(&string1, &string2);
+ }
+ println!("The longest string is '{result}'");
+ // `string2` dropped at the end of the function.
+
+ // =========================================================================
+
+ let string1 = String::from("long string is long");
+ let result;
+ {
+ let string2 = String::from("xyz");
+ result = longest(&string1, &string2);
+ // Solution2: You can move the print statement into the inner block so
+ // that it is executed before `string2` is dropped.
+ println!("The longest string is '{result}'");
+ // `string2` dropped here (end of the inner scope).
+ }
+}
diff --git a/solutions/16_lifetimes/lifetimes3.rs b/solutions/16_lifetimes/lifetimes3.rs
new file mode 100644
index 0000000..16a5a68
--- /dev/null
+++ b/solutions/16_lifetimes/lifetimes3.rs
@@ -0,0 +1,18 @@
+// Lifetimes are also needed when structs hold references.
+
+struct Book<'a> {
+ // ^^^^ added a lifetime annotation
+ author: &'a str,
+ // ^^
+ title: &'a str,
+ // ^^
+}
+
+fn main() {
+ let book = Book {
+ author: "George Orwell",
+ title: "1984",
+ };
+
+ println!("{} by {}", book.title, book.author);
+}
diff --git a/solutions/17_tests/tests1.rs b/solutions/17_tests/tests1.rs
new file mode 100644
index 0000000..c52b8b1
--- /dev/null
+++ b/solutions/17_tests/tests1.rs
@@ -0,0 +1,24 @@
+// Tests are important to ensure that your code does what you think it should
+// do.
+
+fn is_even(n: i64) -> bool {
+ n % 2 == 0
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ // When writing unit tests, it is common to import everything from the outer
+ // module (`super`) using a wildcard.
+ use super::*;
+
+ #[test]
+ fn you_can_assert() {
+ assert!(is_even(0));
+ assert!(!is_even(-1));
+ // ^ You can assert `false` using the negation operator `!`.
+ }
+}
diff --git a/solutions/17_tests/tests2.rs b/solutions/17_tests/tests2.rs
new file mode 100644
index 0000000..39a0005
--- /dev/null
+++ b/solutions/17_tests/tests2.rs
@@ -0,0 +1,22 @@
+// Calculates the power of 2 using a bit shift.
+// `1 << n` is equivalent to "2 to the power of n".
+fn power_of_2(n: u8) -> u64 {
+ 1 << n
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn you_can_assert_eq() {
+ assert_eq!(power_of_2(0), 1);
+ assert_eq!(power_of_2(1), 2);
+ assert_eq!(power_of_2(2), 4);
+ assert_eq!(power_of_2(3), 8);
+ }
+}
diff --git a/solutions/17_tests/tests3.rs b/solutions/17_tests/tests3.rs
new file mode 100644
index 0000000..503f9bc
--- /dev/null
+++ b/solutions/17_tests/tests3.rs
@@ -0,0 +1,45 @@
+struct Rectangle {
+ width: i32,
+ height: i32,
+}
+
+impl Rectangle {
+ // Don't change this function.
+ fn new(width: i32, height: i32) -> Self {
+ if width <= 0 || height <= 0 {
+ // Returning a `Result` would be better here. But we want to learn
+ // how to test functions that can panic.
+ panic!("Rectangle width and height can't be negative");
+ }
+
+ Rectangle { width, height }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn correct_width_and_height() {
+ let rect = Rectangle::new(10, 20);
+ assert_eq!(rect.width, 10); // Check width
+ assert_eq!(rect.height, 20); // Check height
+ }
+
+ #[test]
+ #[should_panic] // Added this attribute to check that the test panics.
+ fn negative_width() {
+ let _rect = Rectangle::new(-10, 10);
+ }
+
+ #[test]
+ #[should_panic] // Added this attribute to check that the test panics.
+ fn negative_height() {
+ let _rect = Rectangle::new(10, -10);
+ }
+}
diff --git a/solutions/18_iterators/iterators1.rs b/solutions/18_iterators/iterators1.rs
new file mode 100644
index 0000000..93a6008
--- /dev/null
+++ b/solutions/18_iterators/iterators1.rs
@@ -0,0 +1,26 @@
+// 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.
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ #[test]
+ fn iterators() {
+ let my_fav_fruits = ["banana", "custard apple", "avocado", "peach", "raspberry"];
+
+ // Create an iterator over the array.
+ let mut fav_fruits_iterator = my_fav_fruits.iter();
+
+ assert_eq!(fav_fruits_iterator.next(), Some(&"banana"));
+ assert_eq!(fav_fruits_iterator.next(), Some(&"custard apple"));
+ assert_eq!(fav_fruits_iterator.next(), Some(&"avocado"));
+ assert_eq!(fav_fruits_iterator.next(), Some(&"peach"));
+ assert_eq!(fav_fruits_iterator.next(), Some(&"raspberry"));
+ assert_eq!(fav_fruits_iterator.next(), None);
+ // ^^^^ reached the end
+ }
+}
diff --git a/solutions/18_iterators/iterators2.rs b/solutions/18_iterators/iterators2.rs
new file mode 100644
index 0000000..db05f29
--- /dev/null
+++ b/solutions/18_iterators/iterators2.rs
@@ -0,0 +1,56 @@
+// In this exercise, you'll learn some of the unique advantages that iterators
+// can offer.
+
+// "hello" -> "Hello"
+fn capitalize_first(input: &str) -> String {
+ let mut chars = input.chars();
+ match chars.next() {
+ None => String::new(),
+ Some(first) => first.to_uppercase().to_string() + chars.as_str(),
+ }
+}
+
+// Apply the `capitalize_first` function to a slice of string slices.
+// Return a vector of strings.
+// ["hello", "world"] -> ["Hello", "World"]
+fn capitalize_words_vector(words: &[&str]) -> Vec {
+ words.iter().map(|word| capitalize_first(word)).collect()
+}
+
+// Apply the `capitalize_first` function again to a slice of string
+// slices. Return a single string.
+// ["hello", " ", "world"] -> "Hello World"
+fn capitalize_words_string(words: &[&str]) -> String {
+ words.iter().map(|word| capitalize_first(word)).collect()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[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/solutions/18_iterators/iterators3.rs b/solutions/18_iterators/iterators3.rs
new file mode 100644
index 0000000..d66d1ef
--- /dev/null
+++ b/solutions/18_iterators/iterators3.rs
@@ -0,0 +1,73 @@
+#[derive(Debug, PartialEq, Eq)]
+enum DivisionError {
+ DivideByZero,
+ NotDivisible,
+}
+
+fn divide(a: i64, b: i64) -> Result {
+ if b == 0 {
+ return Err(DivisionError::DivideByZero);
+ }
+
+ if a % b != 0 {
+ return Err(DivisionError::NotDivisible);
+ }
+
+ Ok(a / b)
+}
+
+fn result_with_list() -> Result, DivisionError> {
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ let numbers = [27, 297, 38502, 81];
+ let division_results = numbers.into_iter().map(|n| divide(n, 27));
+ // Collects to the expected return type. Returns the first error in the
+ // division results (if one exists).
+ division_results.collect()
+}
+
+fn list_of_results() -> Vec> {
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ let numbers = [27, 297, 38502, 81];
+ let division_results = numbers.into_iter().map(|n| divide(n, 27));
+ // Collects to the expected return type.
+ division_results.collect()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_success() {
+ assert_eq!(divide(81, 9), Ok(9));
+ }
+
+ #[test]
+ fn test_divide_by_0() {
+ assert_eq!(divide(81, 0), Err(DivisionError::DivideByZero));
+ }
+
+ #[test]
+ fn test_not_divisible() {
+ assert_eq!(divide(81, 6), Err(DivisionError::NotDivisible));
+ }
+
+ #[test]
+ fn test_divide_0_by_something() {
+ assert_eq!(divide(0, 81), Ok(0));
+ }
+
+ #[test]
+ fn test_result_with_list() {
+ assert_eq!(result_with_list().unwrap(), [1, 11, 1426, 3]);
+ }
+
+ #[test]
+ fn test_list_of_results() {
+ assert_eq!(list_of_results(), [Ok(1), Ok(11), Ok(1426), Ok(3)]);
+ }
+}
diff --git a/solutions/18_iterators/iterators4.rs b/solutions/18_iterators/iterators4.rs
new file mode 100644
index 0000000..4c3c49d
--- /dev/null
+++ b/solutions/18_iterators/iterators4.rs
@@ -0,0 +1,71 @@
+// 3 possible solutions are presented.
+
+// With `for` loop and a mutable variable.
+fn factorial_for(num: u64) -> u64 {
+ let mut result = 1;
+
+ for x in 2..=num {
+ result *= x;
+ }
+
+ result
+}
+
+// Equivalent to `factorial_for` but shorter and without a `for` loop and
+// mutable variables.
+fn factorial_fold(num: u64) -> u64 {
+ // Case num==0: The iterator 2..=0 is empty
+ // -> The initial value of `fold` is returned which is 1.
+ // Case num==1: The iterator 2..=1 is also empty
+ // -> The initial value 1 is returned.
+ // Case num==2: The iterator 2..=2 contains one element
+ // -> The initial value 1 is multiplied by 2 and the result
+ // is returned.
+ // Case num==3: The iterator 2..=3 contains 2 elements
+ // -> 1 * 2 is calculated, then the result 2 is multiplied by
+ // the second element 3 so the result 6 is returned.
+ // And so on…
+ (2..=num).fold(1, |acc, x| acc * x)
+}
+
+// Equivalent to `factorial_fold` but with a built-in method that is suggested
+// by Clippy.
+fn factorial_product(num: u64) -> u64 {
+ (2..=num).product()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn factorial_of_0() {
+ assert_eq!(factorial_for(0), 1);
+ assert_eq!(factorial_fold(0), 1);
+ assert_eq!(factorial_product(0), 1);
+ }
+
+ #[test]
+ fn factorial_of_1() {
+ assert_eq!(factorial_for(1), 1);
+ assert_eq!(factorial_fold(1), 1);
+ assert_eq!(factorial_product(1), 1);
+ }
+ #[test]
+ fn factorial_of_2() {
+ assert_eq!(factorial_for(2), 2);
+ assert_eq!(factorial_fold(2), 2);
+ assert_eq!(factorial_product(2), 2);
+ }
+
+ #[test]
+ fn factorial_of_4() {
+ assert_eq!(factorial_for(4), 24);
+ assert_eq!(factorial_fold(4), 24);
+ assert_eq!(factorial_product(4), 24);
+ }
+}
diff --git a/solutions/18_iterators/iterators5.rs b/solutions/18_iterators/iterators5.rs
new file mode 100644
index 0000000..85d9a4f
--- /dev/null
+++ b/solutions/18_iterators/iterators5.rs
@@ -0,0 +1,183 @@
+// 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. Recreate this counting
+// functionality using iterators. Try to not use imperative loops (for/while).
+
+use std::collections::HashMap;
+
+#[derive(Clone, Copy, PartialEq, Eq)]
+enum Progress {
+ None,
+ Some,
+ Complete,
+}
+
+fn count_for(map: &HashMap, value: Progress) -> usize {
+ let mut count = 0;
+ for val in map.values() {
+ if *val == value {
+ count += 1;
+ }
+ }
+ count
+}
+
+fn count_iterator(map: &HashMap, value: Progress) -> usize {
+ // `map` is a hash map with `String` keys and `Progress` values.
+ // map = { "variables1": Complete, "from_str": None, … }
+ map.values().filter(|val| **val == value).count()
+}
+
+fn count_collection_for(collection: &[HashMap], value: Progress) -> usize {
+ let mut count = 0;
+ for map in collection {
+ count += count_for(map, value);
+ }
+ count
+}
+
+fn count_collection_iterator(collection: &[HashMap], value: Progress) -> usize {
+ // `collection` is a slice of hash maps.
+ // collection = [{ "variables1": Complete, "from_str": None, … },
+ // { "variables2": Complete, … }, … ]
+ collection
+ .iter()
+ .map(|map| count_iterator(map, value))
+ .sum()
+}
+
+// Equivalent to `count_collection_iterator`+`count_iterator`, iterating as if
+// the collection was a single container instead of a container of containers
+// (and more accurately, a single iterator instead of an iterator of iterators).
+fn count_collection_iterator_flat(
+ collection: &[HashMap],
+ value: Progress,
+) -> usize {
+ // `collection` is a slice of hash maps.
+ // collection = [{ "variables1": Complete, "from_str": None, … },
+ // { "variables2": Complete, … }, … ]
+ collection
+ .iter()
+ .flat_map(HashMap::values) // or just `.flatten()` when wanting the default iterator (`HashMap::iter`)
+ .filter(|val| **val == value)
+ .count()
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ fn get_map() -> HashMap {
+ 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> {
+ 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]
+ }
+
+ #[test]
+ fn count_complete() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::Complete), 3);
+ }
+
+ #[test]
+ fn count_some() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::Some), 1);
+ }
+
+ #[test]
+ fn count_none() {
+ let map = get_map();
+ assert_eq!(count_iterator(&map, Progress::None), 2);
+ }
+
+ #[test]
+ fn count_complete_equals_for() {
+ let map = get_map();
+ let progress_states = [Progress::Complete, Progress::Some, Progress::None];
+ for progress_state in progress_states {
+ assert_eq!(
+ count_for(&map, progress_state),
+ count_iterator(&map, progress_state),
+ );
+ }
+ }
+
+ #[test]
+ fn count_collection_complete() {
+ let collection = get_vec_map();
+ assert_eq!(
+ count_collection_iterator(&collection, Progress::Complete),
+ 6,
+ );
+ assert_eq!(
+ count_collection_iterator_flat(&collection, Progress::Complete),
+ 6,
+ );
+ }
+
+ #[test]
+ fn count_collection_some() {
+ let collection = get_vec_map();
+ assert_eq!(count_collection_iterator(&collection, Progress::Some), 1);
+ assert_eq!(
+ count_collection_iterator_flat(&collection, Progress::Some),
+ 1
+ );
+ }
+
+ #[test]
+ fn count_collection_none() {
+ let collection = get_vec_map();
+ assert_eq!(count_collection_iterator(&collection, Progress::None), 4);
+ assert_eq!(
+ count_collection_iterator_flat(&collection, Progress::None),
+ 4
+ );
+ }
+
+ #[test]
+ fn count_collection_equals_for() {
+ let collection = get_vec_map();
+ let progress_states = [Progress::Complete, Progress::Some, Progress::None];
+
+ for progress_state in progress_states {
+ assert_eq!(
+ count_collection_for(&collection, progress_state),
+ count_collection_iterator(&collection, progress_state),
+ );
+ assert_eq!(
+ count_collection_for(&collection, progress_state),
+ count_collection_iterator_flat(&collection, progress_state),
+ );
+ }
+ }
+}
diff --git a/solutions/19_smart_pointers/arc1.rs b/solutions/19_smart_pointers/arc1.rs
new file mode 100644
index 0000000..bd76189
--- /dev/null
+++ b/solutions/19_smart_pointers/arc1.rs
@@ -0,0 +1,45 @@
+// In this exercise, we are given a `Vec` of `u32` called `numbers` with values
+// ranging from 0 to 99. We would like to use this set of numbers within 8
+// different threads simultaneously. Each thread is going to get the sum of
+// every eighth value with an offset.
+//
+// The first thread (offset 0), will sum 0, 8, 16, …
+// The second thread (offset 1), will sum 1, 9, 17, …
+// The third thread (offset 2), will sum 2, 10, 18, …
+// …
+// The eighth thread (offset 7), will sum 7, 15, 23, …
+//
+// Each thread should own a reference-counting pointer to the vector of
+// numbers. But `Rc` isn't thread-safe. Therefore, we need to use `Arc`.
+//
+// Don't get distracted by how threads are spawned and joined. We will practice
+// that later in the exercises about threads.
+
+// Don't change the lines below.
+#![forbid(unused_imports)]
+use std::{sync::Arc, thread};
+
+fn main() {
+ let numbers: Vec<_> = (0..100u32).collect();
+
+ let shared_numbers = Arc::new(numbers);
+ // ^^^^^^^^^^^^^^^^^
+
+ let mut join_handles = Vec::new();
+
+ for offset in 0..8 {
+ let child_numbers = Arc::clone(&shared_numbers);
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+ let handle = thread::spawn(move || {
+ let sum: u32 = child_numbers.iter().filter(|&&n| n % 8 == offset).sum();
+ println!("Sum of offset {offset} is {sum}");
+ });
+
+ join_handles.push(handle);
+ }
+
+ for handle in join_handles.into_iter() {
+ handle.join().unwrap();
+ }
+}
diff --git a/solutions/19_smart_pointers/box1.rs b/solutions/19_smart_pointers/box1.rs
new file mode 100644
index 0000000..189cc56
--- /dev/null
+++ b/solutions/19_smart_pointers/box1.rs
@@ -0,0 +1,47 @@
+// At compile time, Rust needs to know how much space a type takes up. This
+// becomes problematic for recursive types, where a value can have as part of
+// itself another value of the same type. To get around the issue, we can use a
+// `Box` - a smart pointer used to store data on the heap, which also allows us
+// to wrap a recursive type.
+//
+// The recursive type we're implementing in this exercise is the "cons list", a
+// data structure frequently found in functional programming languages. Each
+// item in a cons list contains two elements: The value of the current item and
+// the next item. The last item is a value called `Nil`.
+
+#[derive(PartialEq, Debug)]
+enum List {
+ Cons(i32, Box),
+ Nil,
+}
+
+fn create_empty_list() -> List {
+ List::Nil
+}
+
+fn create_non_empty_list() -> List {
+ List::Cons(42, Box::new(List::Nil))
+}
+
+fn main() {
+ println!("This is an empty cons list: {:?}", create_empty_list());
+ println!(
+ "This is a non-empty cons list: {:?}",
+ create_non_empty_list(),
+ );
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_create_empty_list() {
+ assert_eq!(create_empty_list(), List::Nil);
+ }
+
+ #[test]
+ fn test_create_non_empty_list() {
+ assert_ne!(create_empty_list(), create_non_empty_list());
+ }
+}
diff --git a/solutions/19_smart_pointers/cow1.rs b/solutions/19_smart_pointers/cow1.rs
new file mode 100644
index 0000000..0a21a91
--- /dev/null
+++ b/solutions/19_smart_pointers/cow1.rs
@@ -0,0 +1,68 @@
+// This exercise explores the `Cow` (Clone-On-Write) smart pointer. It can
+// enclose and provide immutable access to borrowed data and clone the data
+// lazily when mutation or ownership is required. The type is designed to work
+// with general borrowed data via the `Borrow` trait.
+
+use std::borrow::Cow;
+
+fn abs_all(input: &mut Cow<[i32]>) {
+ for ind in 0..input.len() {
+ let value = input[ind];
+ if value < 0 {
+ // Clones into a vector if not already owned.
+ input.to_mut()[ind] = -value;
+ }
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn reference_mutation() {
+ // Clone occurs because `input` needs to be mutated.
+ let vec = vec![-1, 0, 1];
+ let mut input = Cow::from(&vec);
+ abs_all(&mut input);
+ assert!(matches!(input, Cow::Owned(_)));
+ }
+
+ #[test]
+ fn reference_no_mutation() {
+ // No clone occurs because `input` doesn't need to be mutated.
+ let vec = vec![0, 1, 2];
+ let mut input = Cow::from(&vec);
+ abs_all(&mut input);
+ assert!(matches!(input, Cow::Borrowed(_)));
+ // ^^^^^^^^^^^^^^^^
+ }
+
+ #[test]
+ fn owned_no_mutation() {
+ // We can also pass `vec` without `&` so `Cow` owns it directly. In this
+ // case, no mutation occurs and thus also no clone. But the result is
+ // still owned because it was never borrowed or mutated.
+ let vec = vec![0, 1, 2];
+ let mut input = Cow::from(vec);
+ abs_all(&mut input);
+ assert!(matches!(input, Cow::Owned(_)));
+ // ^^^^^^^^^^^^^
+ }
+
+ #[test]
+ fn owned_mutation() {
+ // Of course this is also the case if a mutation does occur. In this
+ // case, the call to `to_mut()` in the `abs_all` function returns a
+ // reference to the same data as before.
+ let vec = vec![-1, 0, 1];
+ let mut input = Cow::from(vec);
+ abs_all(&mut input);
+ assert!(matches!(input, Cow::Owned(_)));
+ // ^^^^^^^^^^^^^
+ }
+}
diff --git a/solutions/19_smart_pointers/rc1.rs b/solutions/19_smart_pointers/rc1.rs
new file mode 100644
index 0000000..512eb9c
--- /dev/null
+++ b/solutions/19_smart_pointers/rc1.rs
@@ -0,0 +1,105 @@
+// In this exercise, we want to express the concept of multiple owners via the
+// `Rc` type. This is a model of our solar system - there is a `Sun` type and
+// multiple `Planet`s. The planets take ownership of the sun, indicating that
+// they revolve around the sun.
+
+use std::rc::Rc;
+
+#[derive(Debug)]
+struct Sun;
+
+#[allow(dead_code)]
+#[derive(Debug)]
+enum Planet {
+ Mercury(Rc),
+ Venus(Rc),
+ Earth(Rc),
+ Mars(Rc),
+ Jupiter(Rc),
+ Saturn(Rc),
+ Uranus(Rc),
+ Neptune(Rc),
+}
+
+impl Planet {
+ fn details(&self) {
+ println!("Hi from {self:?}!");
+ }
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn rc1() {
+ let sun = Rc::new(Sun);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
+
+ let mercury = Planet::Mercury(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
+ mercury.details();
+
+ let venus = Planet::Venus(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
+ venus.details();
+
+ let earth = Planet::Earth(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
+ earth.details();
+
+ let mars = Planet::Mars(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
+ mars.details();
+
+ let jupiter = Planet::Jupiter(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
+ jupiter.details();
+
+ let saturn = Planet::Saturn(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
+ saturn.details();
+
+ // TODO
+ let uranus = Planet::Uranus(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
+ uranus.details();
+
+ // TODO
+ let neptune = Planet::Neptune(Rc::clone(&sun));
+ println!("reference count = {}", Rc::strong_count(&sun)); // 9 references
+ neptune.details();
+
+ assert_eq!(Rc::strong_count(&sun), 9);
+
+ drop(neptune);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 8 references
+
+ drop(uranus);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 7 references
+
+ drop(saturn);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 6 references
+
+ drop(jupiter);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 5 references
+
+ drop(mars);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 4 references
+
+ drop(earth);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 3 references
+
+ drop(venus);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 2 references
+
+ drop(mercury);
+ println!("reference count = {}", Rc::strong_count(&sun)); // 1 reference
+
+ assert_eq!(Rc::strong_count(&sun), 1);
+ }
+}
diff --git a/solutions/20_threads/threads1.rs b/solutions/20_threads/threads1.rs
new file mode 100644
index 0000000..7f3dd29
--- /dev/null
+++ b/solutions/20_threads/threads1.rs
@@ -0,0 +1,37 @@
+// This program spawns multiple threads that each run for at least 250ms, and
+// each thread returns how much time they took to complete. The program should
+// wait until all the spawned threads have finished and should collect their
+// return values into a vector.
+
+use std::{
+ thread,
+ time::{Duration, Instant},
+};
+
+fn main() {
+ let mut handles = Vec::new();
+ for i in 0..10 {
+ let handle = thread::spawn(move || {
+ let start = Instant::now();
+ thread::sleep(Duration::from_millis(250));
+ println!("Thread {i} done");
+ start.elapsed().as_millis()
+ });
+ handles.push(handle);
+ }
+
+ let mut results = Vec::new();
+ for handle in handles {
+ // Collect the results of all threads into the `results` vector.
+ results.push(handle.join().unwrap());
+ }
+
+ if results.len() != 10 {
+ panic!("Oh no! Some thread isn't done yet!");
+ }
+
+ println!();
+ for (i, result) in results.into_iter().enumerate() {
+ println!("Thread {i} took {result}ms");
+ }
+}
diff --git a/solutions/20_threads/threads2.rs b/solutions/20_threads/threads2.rs
new file mode 100644
index 0000000..bc268d6
--- /dev/null
+++ b/solutions/20_threads/threads2.rs
@@ -0,0 +1,41 @@
+// Building on the last exercise, we want all of the threads to complete their
+// work. But this time, the spawned threads need to be in charge of updating a
+// shared value: `JobStatus.jobs_done`
+
+use std::{
+ sync::{Arc, Mutex},
+ thread,
+ time::Duration,
+};
+
+struct JobStatus {
+ jobs_done: u32,
+}
+
+fn main() {
+ // `Arc` isn't enough if you want a **mutable** shared state.
+ // We need to wrap the value with a `Mutex`.
+ let status = Arc::new(Mutex::new(JobStatus { jobs_done: 0 }));
+ // ^^^^^^^^^^^ ^
+
+ let mut handles = Vec::new();
+ for _ in 0..10 {
+ let status_shared = Arc::clone(&status);
+ let handle = thread::spawn(move || {
+ thread::sleep(Duration::from_millis(250));
+
+ // Lock before you update a shared value.
+ status_shared.lock().unwrap().jobs_done += 1;
+ // ^^^^^^^^^^^^^^^^
+ });
+ handles.push(handle);
+ }
+
+ // Waiting for all jobs to complete.
+ for handle in handles {
+ handle.join().unwrap();
+ }
+
+ println!("Jobs done: {}", status.lock().unwrap().jobs_done);
+ // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+}
diff --git a/solutions/20_threads/threads3.rs b/solutions/20_threads/threads3.rs
new file mode 100644
index 0000000..cd2dfbe
--- /dev/null
+++ b/solutions/20_threads/threads3.rs
@@ -0,0 +1,66 @@
+use std::{sync::mpsc, thread, time::Duration};
+
+struct Queue {
+ length: u32,
+ first_half: Vec,
+ second_half: Vec,
+}
+
+impl Queue {
+ fn new() -> Self {
+ Self {
+ length: 10,
+ first_half: vec![1, 2, 3, 4, 5],
+ second_half: vec![6, 7, 8, 9, 10],
+ }
+ }
+}
+
+fn send_tx(q: Queue, tx: mpsc::Sender) {
+ // Clone the sender `tx` first.
+ let tx_clone = tx.clone();
+ thread::spawn(move || {
+ for val in q.first_half {
+ println!("Sending {val:?}");
+ // Then use the clone in the first thread. This means that
+ // `tx_clone` is moved to the first thread and `tx` to the second.
+ tx_clone.send(val).unwrap();
+ thread::sleep(Duration::from_millis(250));
+ }
+ });
+
+ thread::spawn(move || {
+ for val in q.second_half {
+ println!("Sending {val:?}");
+ tx.send(val).unwrap();
+ thread::sleep(Duration::from_millis(250));
+ }
+ });
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn threads3() {
+ let (tx, rx) = mpsc::channel();
+ let queue = Queue::new();
+ let queue_length = queue.length;
+
+ send_tx(queue, tx);
+
+ let mut total_received: u32 = 0;
+ for received in rx {
+ println!("Got: {received}");
+ total_received += 1;
+ }
+
+ println!("Number of received values: {total_received}");
+ assert_eq!(total_received, queue_length);
+ }
+}
diff --git a/solutions/21_macros/macros1.rs b/solutions/21_macros/macros1.rs
new file mode 100644
index 0000000..1b86156
--- /dev/null
+++ b/solutions/21_macros/macros1.rs
@@ -0,0 +1,10 @@
+macro_rules! my_macro {
+ () => {
+ println!("Check out my macro!");
+ };
+}
+
+fn main() {
+ my_macro!();
+ // ^
+}
diff --git a/solutions/21_macros/macros2.rs b/solutions/21_macros/macros2.rs
new file mode 100644
index 0000000..b6fd5d2
--- /dev/null
+++ b/solutions/21_macros/macros2.rs
@@ -0,0 +1,10 @@
+// Moved the macro definition to be before its call.
+macro_rules! my_macro {
+ () => {
+ println!("Check out my macro!");
+ };
+}
+
+fn main() {
+ my_macro!();
+}
diff --git a/solutions/21_macros/macros3.rs b/solutions/21_macros/macros3.rs
new file mode 100644
index 0000000..df35be4
--- /dev/null
+++ b/solutions/21_macros/macros3.rs
@@ -0,0 +1,13 @@
+// Added the attribute `macro_use` attribute.
+#[macro_use]
+mod macros {
+ macro_rules! my_macro {
+ () => {
+ println!("Check out my macro!");
+ };
+ }
+}
+
+fn main() {
+ my_macro!();
+}
diff --git a/solutions/21_macros/macros4.rs b/solutions/21_macros/macros4.rs
new file mode 100644
index 0000000..41bcad1
--- /dev/null
+++ b/solutions/21_macros/macros4.rs
@@ -0,0 +1,15 @@
+// Added semicolons to separate the macro arms.
+#[rustfmt::skip]
+macro_rules! my_macro {
+ () => {
+ println!("Check out my macro!");
+ };
+ ($val:expr) => {
+ println!("Look at this other macro: {}", $val);
+ };
+}
+
+fn main() {
+ my_macro!();
+ my_macro!(7777);
+}
diff --git a/solutions/22_clippy/clippy1.rs b/solutions/22_clippy/clippy1.rs
new file mode 100644
index 0000000..b9d1ec1
--- /dev/null
+++ b/solutions/22_clippy/clippy1.rs
@@ -0,0 +1,17 @@
+// The Clippy tool is a collection of lints to analyze your code so you can
+// catch common mistakes and improve your Rust code.
+//
+// For these exercises, the code will fail to compile when there are Clippy
+// warnings. Check Clippy's suggestions from the output to solve the exercise.
+
+use std::f32::consts::PI;
+
+fn main() {
+ // Use the more accurate `PI` constant.
+ let pi = PI;
+ let radius: f32 = 5.0;
+
+ let area = pi * radius.powi(2);
+
+ println!("The area of a circle with radius {radius:.2} is {area:.5}");
+}
diff --git a/solutions/22_clippy/clippy2.rs b/solutions/22_clippy/clippy2.rs
new file mode 100644
index 0000000..7f63562
--- /dev/null
+++ b/solutions/22_clippy/clippy2.rs
@@ -0,0 +1,10 @@
+fn main() {
+ let mut res = 42;
+ let option = Some(12);
+ // Use `if-let` instead of iteration.
+ if let Some(x) = option {
+ res += x;
+ }
+
+ println!("{res}");
+}
diff --git a/solutions/22_clippy/clippy3.rs b/solutions/22_clippy/clippy3.rs
new file mode 100644
index 0000000..811d184
--- /dev/null
+++ b/solutions/22_clippy/clippy3.rs
@@ -0,0 +1,31 @@
+use std::mem;
+
+#[rustfmt::skip]
+#[allow(unused_variables, unused_assignments)]
+fn main() {
+ let my_option: Option<()> = None;
+ // `unwrap` of an `Option` after checking if it is `None` will panic.
+ // Use `if-let` instead.
+ if let Some(value) = my_option {
+ println!("{value:?}");
+ }
+
+ // A comma was missing.
+ let my_arr = &[
+ -1, -2, -3,
+ -4, -5, -6,
+ ];
+ println!("My array! Here it is: {:?}", my_arr);
+
+ let mut my_empty_vec = vec![1, 2, 3, 4, 5];
+ // `resize` mutates a vector instead of returning a new one.
+ // `resize(0, …)` clears a vector, so it is better to use `clear`.
+ my_empty_vec.clear();
+ println!("This Vec is empty, see? {my_empty_vec:?}");
+
+ let mut value_a = 45;
+ let mut value_b = 66;
+ // Use `mem::swap` to correctly swap two values.
+ mem::swap(&mut value_a, &mut value_b);
+ println!("value a: {}; value b: {}", value_a, value_b);
+}
diff --git a/solutions/23_conversions/as_ref_mut.rs b/solutions/23_conversions/as_ref_mut.rs
new file mode 100644
index 0000000..91b12ba
--- /dev/null
+++ b/solutions/23_conversions/as_ref_mut.rs
@@ -0,0 +1,59 @@
+// AsRef and AsMut allow for cheap reference-to-reference conversions. Read more
+// about them at https://doc.rust-lang.org/std/convert/trait.AsRef.html and
+// https://doc.rust-lang.org/std/convert/trait.AsMut.html, respectively.
+
+// Obtain the number of bytes (not characters) in the given argument.
+fn byte_counter>(arg: T) -> usize {
+ arg.as_ref().as_bytes().len()
+}
+
+// Obtain the number of characters (not bytes) in the given argument.
+fn char_counter>(arg: T) -> usize {
+ arg.as_ref().chars().count()
+}
+
+// Squares a number using `as_mut()`.
+fn num_sq>(arg: &mut T) {
+ let arg = arg.as_mut();
+ *arg = *arg * *arg;
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn different_counts() {
+ let s = "Café au lait";
+ assert_ne!(char_counter(s), byte_counter(s));
+ }
+
+ #[test]
+ fn same_counts() {
+ let s = "Cafe au lait";
+ assert_eq!(char_counter(s), byte_counter(s));
+ }
+
+ #[test]
+ fn different_counts_using_string() {
+ let s = String::from("Café au lait");
+ assert_ne!(char_counter(s.clone()), byte_counter(s));
+ }
+
+ #[test]
+ fn same_counts_using_string() {
+ let s = String::from("Cafe au lait");
+ assert_eq!(char_counter(s.clone()), byte_counter(s));
+ }
+
+ #[test]
+ fn mut_box() {
+ let mut num: Box = Box::new(3);
+ num_sq(&mut num);
+ assert_eq!(*num, 9);
+ }
+}
diff --git a/solutions/23_conversions/from_into.rs b/solutions/23_conversions/from_into.rs
new file mode 100644
index 0000000..cec23cb
--- /dev/null
+++ b/solutions/23_conversions/from_into.rs
@@ -0,0 +1,136 @@
+// The `From` trait is used for value-to-value conversions. If `From` is
+// implemented, an implementation of `Into` is automatically provided.
+// You can read more about it in the documentation:
+// https://doc.rust-lang.org/std/convert/trait.From.html
+
+#[derive(Debug)]
+struct Person {
+ name: String,
+ age: u8,
+}
+
+// We implement the Default trait to use it as a fallback when the provided
+// string is not convertible into a `Person` object.
+impl Default for Person {
+ fn default() -> Self {
+ Self {
+ name: String::from("John"),
+ age: 30,
+ }
+ }
+}
+
+impl From<&str> for Person {
+ fn from(s: &str) -> Self {
+ let mut split = s.split(',');
+ let (Some(name), Some(age), None) = (split.next(), split.next(), split.next()) else {
+ // ^^^^ there should be no third element
+ return Self::default();
+ };
+
+ if name.is_empty() {
+ return Self::default();
+ }
+
+ let Ok(age) = age.parse() else {
+ return Self::default();
+ };
+
+ Self {
+ name: name.into(),
+ age,
+ }
+ }
+}
+
+fn main() {
+ // Use the `from` function.
+ let p1 = Person::from("Mark,20");
+ println!("{p1:?}");
+
+ // Since `From` is implemented for Person, we are able to use `Into`.
+ let p2: Person = "Gerald,70".into();
+ println!("{p2:?}");
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn test_default() {
+ let dp = Person::default();
+ assert_eq!(dp.name, "John");
+ assert_eq!(dp.age, 30);
+ }
+
+ #[test]
+ fn test_bad_convert() {
+ let p = Person::from("");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_good_convert() {
+ let p = Person::from("Mark,20");
+ assert_eq!(p.name, "Mark");
+ assert_eq!(p.age, 20);
+ }
+
+ #[test]
+ fn test_bad_age() {
+ let p = Person::from("Mark,twenty");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_missing_comma_and_age() {
+ let p: Person = Person::from("Mark");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_missing_age() {
+ let p: Person = Person::from("Mark,");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_missing_name() {
+ let p: Person = Person::from(",1");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_missing_name_and_age() {
+ let p: Person = Person::from(",");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_missing_name_and_invalid_age() {
+ let p: Person = Person::from(",one");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_trailing_comma() {
+ let p: Person = Person::from("Mike,32,");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+
+ #[test]
+ fn test_trailing_comma_and_some_string() {
+ let p: Person = Person::from("Mike,32,dog");
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 30);
+ }
+}
diff --git a/solutions/23_conversions/from_str.rs b/solutions/23_conversions/from_str.rs
new file mode 100644
index 0000000..005b501
--- /dev/null
+++ b/solutions/23_conversions/from_str.rs
@@ -0,0 +1,117 @@
+// This is similar to the previous `from_into` exercise. But this time, we'll
+// implement `FromStr` and return errors instead of falling back to a default
+// value. Additionally, upon implementing `FromStr`, you can use the `parse`
+// method on strings to generate an object of the implementor type. You can read
+// more about it in the documentation:
+// https://doc.rust-lang.org/std/str/trait.FromStr.html
+
+use std::num::ParseIntError;
+use std::str::FromStr;
+
+#[derive(Debug, PartialEq)]
+struct Person {
+ name: String,
+ age: u8,
+}
+
+// We will use this error type for the `FromStr` implementation.
+#[derive(Debug, PartialEq)]
+enum ParsePersonError {
+ // Incorrect number of fields
+ BadLen,
+ // Empty name field
+ NoName,
+ // Wrapped error from parse::()
+ ParseInt(ParseIntError),
+}
+
+impl FromStr for Person {
+ type Err = ParsePersonError;
+
+ fn from_str(s: &str) -> Result {
+ let mut split = s.split(',');
+ let (Some(name), Some(age), None) = (split.next(), split.next(), split.next()) else {
+ // ^^^^ there should be no third element
+ return Err(ParsePersonError::BadLen);
+ };
+
+ if name.is_empty() {
+ return Err(ParsePersonError::NoName);
+ }
+
+ let age = age.parse().map_err(ParsePersonError::ParseInt)?;
+
+ Ok(Self {
+ name: name.into(),
+ age,
+ })
+ }
+}
+
+fn main() {
+ let p = "Mark,20".parse::();
+ println!("{p:?}");
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+ use ParsePersonError::*;
+
+ #[test]
+ fn empty_input() {
+ assert_eq!("".parse::(), Err(BadLen));
+ }
+
+ #[test]
+ fn good_input() {
+ let p = "John,32".parse::();
+ assert!(p.is_ok());
+ let p = p.unwrap();
+ assert_eq!(p.name, "John");
+ assert_eq!(p.age, 32);
+ }
+
+ #[test]
+ fn missing_age() {
+ assert!(matches!("John,".parse::(), Err(ParseInt(_))));
+ }
+
+ #[test]
+ fn invalid_age() {
+ assert!(matches!("John,twenty".parse::(), Err(ParseInt(_))));
+ }
+
+ #[test]
+ fn missing_comma_and_age() {
+ assert_eq!("John".parse::(), Err(BadLen));
+ }
+
+ #[test]
+ fn missing_name() {
+ assert_eq!(",1".parse::(), Err(NoName));
+ }
+
+ #[test]
+ fn missing_name_and_age() {
+ assert!(matches!(",".parse::(), Err(NoName | ParseInt(_))));
+ }
+
+ #[test]
+ fn missing_name_and_invalid_age() {
+ assert!(matches!(
+ ",one".parse::(),
+ Err(NoName | ParseInt(_)),
+ ));
+ }
+
+ #[test]
+ fn trailing_comma() {
+ assert_eq!("John,32,".parse::(), Err(BadLen));
+ }
+
+ #[test]
+ fn trailing_comma_and_some_string() {
+ assert_eq!("John,32,man".parse::(), Err(BadLen));
+ }
+}
diff --git a/solutions/23_conversions/try_from_into.rs b/solutions/23_conversions/try_from_into.rs
new file mode 100644
index 0000000..ee802eb
--- /dev/null
+++ b/solutions/23_conversions/try_from_into.rs
@@ -0,0 +1,193 @@
+// `TryFrom` is a simple and safe type conversion that may fail in a controlled
+// way under some circumstances. Basically, this is the same as `From`. The main
+// difference is that this should return a `Result` type instead of the target
+// type itself. You can read more about it in the documentation:
+// https://doc.rust-lang.org/std/convert/trait.TryFrom.html
+
+#![allow(clippy::useless_vec)]
+use std::convert::{TryFrom, TryInto};
+
+#[derive(Debug, PartialEq)]
+struct Color {
+ red: u8,
+ green: u8,
+ blue: u8,
+}
+
+// We will use this error type for the `TryFrom` conversions.
+#[derive(Debug, PartialEq)]
+enum IntoColorError {
+ // Incorrect length of slice
+ BadLen,
+ // Integer conversion error
+ IntConversion,
+}
+
+impl TryFrom<(i16, i16, i16)> for Color {
+ type Error = IntoColorError;
+
+ fn try_from(tuple: (i16, i16, i16)) -> Result {
+ let (Ok(red), Ok(green), Ok(blue)) = (
+ u8::try_from(tuple.0),
+ u8::try_from(tuple.1),
+ u8::try_from(tuple.2),
+ ) else {
+ return Err(IntoColorError::IntConversion);
+ };
+
+ Ok(Self { red, green, blue })
+ }
+}
+
+impl TryFrom<[i16; 3]> for Color {
+ type Error = IntoColorError;
+
+ fn try_from(arr: [i16; 3]) -> Result {
+ // Reuse the implementation for a tuple.
+ Self::try_from((arr[0], arr[1], arr[2]))
+ }
+}
+
+impl TryFrom<&[i16]> for Color {
+ type Error = IntoColorError;
+
+ fn try_from(slice: &[i16]) -> Result {
+ // Check the length.
+ if slice.len() != 3 {
+ return Err(IntoColorError::BadLen);
+ }
+
+ // Reuse the implementation for a tuple.
+ Self::try_from((slice[0], slice[1], slice[2]))
+ }
+}
+
+fn main() {
+ // Using the `try_from` function.
+ let c1 = Color::try_from((183, 65, 14));
+ println!("{c1:?}");
+
+ // Since `TryFrom` is implemented for `Color`, we can use `TryInto`.
+ let c2: Result = [183, 65, 14].try_into();
+ println!("{c2:?}");
+
+ let v = vec![183, 65, 14];
+ // With slice we should use the `try_from` function
+ let c3 = Color::try_from(&v[..]);
+ println!("{c3:?}");
+ // or put the slice within round brackets and use `try_into`.
+ let c4: Result = (&v[..]).try_into();
+ println!("{c4:?}");
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+ use IntoColorError::*;
+
+ #[test]
+ fn test_tuple_out_of_range_positive() {
+ assert_eq!(Color::try_from((256, 1000, 10000)), Err(IntConversion));
+ }
+
+ #[test]
+ fn test_tuple_out_of_range_negative() {
+ assert_eq!(Color::try_from((-1, -10, -256)), Err(IntConversion));
+ }
+
+ #[test]
+ fn test_tuple_sum() {
+ assert_eq!(Color::try_from((-1, 255, 255)), Err(IntConversion));
+ }
+
+ #[test]
+ fn test_tuple_correct() {
+ let c: Result = (183, 65, 14).try_into();
+ assert!(c.is_ok());
+ assert_eq!(
+ c.unwrap(),
+ Color {
+ red: 183,
+ green: 65,
+ blue: 14,
+ }
+ );
+ }
+
+ #[test]
+ fn test_array_out_of_range_positive() {
+ let c: Result = [1000, 10000, 256].try_into();
+ assert_eq!(c, Err(IntConversion));
+ }
+
+ #[test]
+ fn test_array_out_of_range_negative() {
+ let c: Result = [-10, -256, -1].try_into();
+ assert_eq!(c, Err(IntConversion));
+ }
+
+ #[test]
+ fn test_array_sum() {
+ let c: Result = [-1, 255, 255].try_into();
+ assert_eq!(c, Err(IntConversion));
+ }
+
+ #[test]
+ fn test_array_correct() {
+ let c: Result
