summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorliv <mokou@fastmail.com>2022-09-29 10:44:57 +0200
committerGitHub <noreply@github.com>2022-09-29 10:44:57 +0200
commit6174b5caf0282ae0581f53befbbaeda632f0e02a (patch)
tree26b7d8e3efc171d4c6c5f004d6c96324e21084f1
parent2e33d422a52424740ad76309231cce429112a9ba (diff)
parentefdebd48b6239b29d69d684fae575ca738cacf41 (diff)
Merge pull request #1210 from cj81499/iterators1-hint
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 ecf307d..e8ba1c3 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.