From bf66df1a16461ef1ee50510803a3097914ffcb82 Mon Sep 17 00:00:00 2001 From: Hunter Kvalevog Date: Mon, 14 Sep 2026 17:15:13 -0500 Subject: Add rustlings --- rustlings/exercises/19_smart_pointers/box1.rs | 50 +++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 rustlings/exercises/19_smart_pointers/box1.rs (limited to 'rustlings/exercises/19_smart_pointers/box1.rs') diff --git a/rustlings/exercises/19_smart_pointers/box1.rs b/rustlings/exercises/19_smart_pointers/box1.rs new file mode 100644 index 0000000..d70e1c3 --- /dev/null +++ b/rustlings/exercises/19_smart_pointers/box1.rs @@ -0,0 +1,50 @@ +// 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`. + +// TODO: Use a `Box` in the enum definition to make the code compile. +#[derive(PartialEq, Debug)] +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(), + ); +} + +#[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()); + } +} -- cgit v1.2.3