summaryrefslogtreecommitdiff
path: root/exercises/05_vecs
diff options
context:
space:
mode:
authormo8it <mo8it@proton.me>2024-06-20 01:00:06 +0200
committermo8it <mo8it@proton.me>2024-06-20 01:00:06 +0200
commita9f0c7bf1f00ab19733953d3121d462eede34466 (patch)
treeb3530b0852f509b866cb9a4f8fbdc2bd3b2bff58 /exercises/05_vecs
parent0abcdeed42957ca805a3a7475fb3f14085af346e (diff)
vecs1 solution
Diffstat (limited to 'exercises/05_vecs')
-rw-r--r--exercises/05_vecs/vecs1.rs14
1 files changed, 6 insertions, 8 deletions
diff --git a/exercises/05_vecs/vecs1.rs b/exercises/05_vecs/vecs1.rs
index ddcad84..68e1aff 100644
--- a/exercises/05_vecs/vecs1.rs
+++ b/exercises/05_vecs/vecs1.rs
@@ -1,11 +1,9 @@
-// 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!
-
fn array_and_vec() -> ([i32; 4], Vec<i32>) {
- 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)
}
@@ -21,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);
}
}