mirror of
https://github.com/notohh/rustlings.git
synced 2024-11-22 14:02:22 -05:00
feat: move box/arc behind iterators
This commit is contained in:
parent
016d718a28
commit
cf9629cb0e
3 changed files with 37 additions and 37 deletions
|
@ -16,7 +16,7 @@
|
||||||
// Make this code compile by filling in a value for `shared_numbers` where the
|
// 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`
|
// 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!
|
// where the second TODO comment is. Try not to create any copies of the `numbers` Vec!
|
||||||
// Execute `rustlings hint arc1` for hints :)
|
// Execute `rustlings hint arc1` or use the `hint` watch subcommand for a hint.
|
||||||
|
|
||||||
// I AM NOT DONE
|
// I AM NOT DONE
|
||||||
|
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
//
|
//
|
||||||
// Note: the tests should not be changed
|
// Note: the tests should not be changed
|
||||||
//
|
//
|
||||||
// Execute `rustlings hint box1` for hints :)
|
// Execute `rustlings hint box1` or use the `hint` watch subcommand for a hint.
|
||||||
|
|
||||||
// I AM NOT DONE
|
// I AM NOT DONE
|
||||||
|
|
||||||
|
|
70
info.toml
70
info.toml
|
@ -748,41 +748,6 @@ can negate the result of what you're doing using `!`, like `assert!(!having_fun(
|
||||||
|
|
||||||
# STANDARD LIBRARY TYPES
|
# STANDARD LIBRARY TYPES
|
||||||
|
|
||||||
[[exercises]]
|
|
||||||
name = "box1"
|
|
||||||
path = "exercises/standard_library_types/box1.rs"
|
|
||||||
mode = "test"
|
|
||||||
hint = """
|
|
||||||
Step 1
|
|
||||||
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
|
|
||||||
|
|
||||||
Step 2
|
|
||||||
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".
|
|
||||||
Although the current list is one of integers (i32), feel free to change the definition
|
|
||||||
and try other types!
|
|
||||||
"""
|
|
||||||
|
|
||||||
[[exercises]]
|
|
||||||
name = "arc1"
|
|
||||||
path = "exercises/standard_library_types/arc1.rs"
|
|
||||||
mode = "compile"
|
|
||||||
hint = """
|
|
||||||
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.
|
|
||||||
|
|
||||||
`child_numbers` should be a clone of the Arc of the numbers instead of a
|
|
||||||
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
|
|
||||||
"""
|
|
||||||
|
|
||||||
[[exercises]]
|
[[exercises]]
|
||||||
name = "iterators1"
|
name = "iterators1"
|
||||||
path = "exercises/standard_library_types/iterators1.rs"
|
path = "exercises/standard_library_types/iterators1.rs"
|
||||||
|
@ -868,6 +833,41 @@ The fold method can be useful in the count_collection_iterator function.
|
||||||
For a further challenge, consult the documentation for Iterator to find
|
For a further challenge, consult the documentation for Iterator to find
|
||||||
a different method that could make your code more compact than using fold."""
|
a different method that could make your code more compact than using fold."""
|
||||||
|
|
||||||
|
[[exercises]]
|
||||||
|
name = "box1"
|
||||||
|
path = "exercises/standard_library_types/box1.rs"
|
||||||
|
mode = "test"
|
||||||
|
hint = """
|
||||||
|
Step 1
|
||||||
|
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
|
||||||
|
|
||||||
|
Step 2
|
||||||
|
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".
|
||||||
|
Although the current list is one of integers (i32), feel free to change the definition
|
||||||
|
and try other types!
|
||||||
|
"""
|
||||||
|
|
||||||
|
[[exercises]]
|
||||||
|
name = "arc1"
|
||||||
|
path = "exercises/standard_library_types/arc1.rs"
|
||||||
|
mode = "compile"
|
||||||
|
hint = """
|
||||||
|
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.
|
||||||
|
|
||||||
|
`child_numbers` should be a clone of the Arc of the numbers instead of a
|
||||||
|
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
|
||||||
|
"""
|
||||||
|
|
||||||
# THREADS
|
# THREADS
|
||||||
|
|
||||||
[[exercises]]
|
[[exercises]]
|
||||||
|
|
Loading…
Reference in a new issue