summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCal Jacobson <cj81499@users.noreply.github.com>2022-09-25 15:22:15 -0500
committerGitHub <noreply@github.com>2022-09-25 15:22:15 -0500
commitefdebd48b6239b29d69d684fae575ca738cacf41 (patch)
tree8576a35e75dccdf479f91a3be45c216be6e4d7cf
parent2398f378b06fbb547cf3a3b292554a756d806c5e (diff)
improve hint for iterators1
-rw-r--r--info.toml4
1 files changed, 2 insertions, 2 deletions
diff --git a/info.toml b/info.toml
index e80d8a9..acc9fc3 100644
--- a/info.toml
+++ b/info.toml
@@ -818,9 +818,9 @@ 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 2.1:
+Step 2 & step 3:
Very similar to the lines above and below. You've got this!
-Step 3:
+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.