Box pointer in Rust - Mini Project: Build & Apply

Understanding Box Pointer in Rust

📖 Scenario: Imagine you want to store a number on the heap instead of the stack in Rust. This is useful when you want to manage memory manually or work with data that needs to live beyond the current scope.

🎯 Goal: You will create a Box pointer to store an integer on the heap, then access and print its value.

📋 What You'll Learn

Create a variable called num that stores the integer 10 on the heap using Box::new.

Create a variable called num_ref that borrows the value inside the box.

Print the value inside the box using println!.

💡 Why This Matters

🌍 Real World

Box pointers are used in Rust to store data on the heap, which is useful for large data or when you want ownership and control over memory.

💼 Career

Understanding Box pointers is important for Rust developers working on systems programming, embedded devices, or performance-critical applications.

1

Create a Box pointer with an integer

Create a variable called num that stores the integer 10 on the heap using Box::new(10).

Rust

# Create a Box pointer called num that stores 10 on the heap
# Your code here

Hint

Use Box::new(10) to create a box pointer holding the value 10.

2

Create a reference to the boxed value

Create a variable called num_ref that borrows the value inside the box num using &*num.

Rust

fn main() {
    let num = Box::new(10);
    // Create a reference called num_ref to the value inside num
    # Your code here
}

Hint

Use let num_ref = &*num; to borrow the value inside the box.

3

Print the value inside the Box

Use println! to print the value inside the box by dereferencing num_ref with *num_ref.

Rust

fn main() {
    let num = Box::new(10);
    let num_ref = &*num;
    // Print the value inside the box
    # Your code here
}

Hint

Use *num_ref to get the value inside the box for printing.

4

Run the program to see the output

Run the program and observe the printed output showing the value inside the box.

Rust

fn main() {
    let num = Box::new(10);
    let num_ref = &*num;
    println!("The value inside the box is: {}", *num_ref);
    // Program output
    # Your code here
}

Hint

The program should print: The value inside the box is: 10

Practice

1. What is the main purpose of a Box pointer in Rust?

easy

A. To create multiple mutable references to the same data

B. To automatically clone data when assigned

C. To store data on the heap and keep a pointer on the stack

D. To replace all references with raw pointers

Solution

1. Step 1: Understand what Box does

   A Box stores data on the heap, while the pointer itself lives on the stack.

2. Step 2: Compare options with Box behavior

   Only To store data on the heap and keep a pointer on the stack correctly describes this behavior. Other options describe different concepts like cloning or raw pointers.

3. Final Answer:

   To store data on the heap and keep a pointer on the stack -> Option C

4. Quick Check:

   Box = heap data + stack pointer [OK]

Hint: Box always stores data on heap, pointer on stack [OK]

Common Mistakes:

• Thinking Box allows multiple mutable references
• Confusing Box with cloning or copying
• Assuming Box replaces raw pointers

2. Which of the following is the correct syntax to create a Box containing the integer 10 in Rust?

easy

A. let b = Box::new(10);

B. let b = box 10;

C. let b = Box(10);

D. let b = new Box(10);

Solution

1. Step 1: Recall Box creation syntax

   In Rust, Box::new(value) is the correct way to create a Box pointer.

2. Step 2: Check each option

   let b = Box::new(10); uses Box::new(10), which is correct. let b = box 10; uses deprecated syntax. let b = Box(10); and let b = new Box(10); are invalid.

3. Final Answer:

   let b = Box::new(10); -> Option A

4. Quick Check:

   Box::new(value) creates a Box [OK]

Hint: Use Box::new(value) to create a Box pointer [OK]

Common Mistakes:

• Using deprecated 'box' keyword
• Trying to call Box like a function
• Using 'new Box' which is invalid

3. What will be the output of this Rust code?

let b = Box::new(5);
println!("{}", *b + 3);

medium

A. Compilation error

B. 53

C. 5

D. 8

Solution

1. Step 1: Understand dereferencing Box

   The *b dereferences the Box to get the value 5 stored on the heap.

2. Step 2: Calculate the expression

   Adding 3 to 5 gives 8, so the printed output is 8.

3. Final Answer:

   8 -> Option D

4. Quick Check:

   *b + 3 = 8 [OK]

Hint: Dereference Box with * to access value [OK]

Common Mistakes:

• Printing Box pointer without dereference
• Concatenating instead of adding
• Expecting compilation error due to Box

4. Identify the error in this Rust code using Box:

let b = Box::new(10);
let r1 = &b;
let r2 = &mut b;
println!("{} {}", r1, r2);

medium

A. Box::new requires a mutable variable

B. Cannot borrow `b` as mutable because it is already borrowed as immutable

C. Box cannot be printed with println!

D. No error, code runs fine

Solution

1. Step 1: Analyze borrowing rules

   Rust does not allow mutable and immutable borrows at the same time. Here, r1 is an immutable borrow, and r2 is a mutable borrow of b.

2. Step 2: Identify the error

   This causes a compile-time error: cannot borrow as mutable because already borrowed as immutable.

3. Final Answer:

   Cannot borrow `b` as mutable because it is already borrowed as immutable -> Option B

4. Quick Check:

   Mutable + immutable borrow conflict = error [OK]

Hint: Cannot mix mutable and immutable borrows simultaneously [OK]

Common Mistakes:

• Thinking Box cannot be printed
• Assuming Box::new needs mut
• Ignoring Rust's borrowing rules

5. Given this recursive enum using Box:

enum List {
    Cons(i32, Box<List>),
    Nil,
}

fn main() {
    let list = List::Cons(1, Box::new(List::Cons(2, Box::new(List::Nil))));
}

Why is Box necessary in this definition?

hard

A. To allocate recursive data on the heap and avoid infinite size

B. To allow multiple ownership of the list elements

C. To automatically clone the list elements

D. To make the enum implement Copy trait

Solution

1. Step 1: Understand recursive enum size problem

   Recursive enums like List have infinite size if they directly contain themselves.

2. Step 2: Role of Box in recursion

   Using Box stores the recursive part on the heap, giving a fixed pointer size on the stack, avoiding infinite size.

3. Final Answer:

   To allocate recursive data on the heap and avoid infinite size -> Option A

4. Quick Check:

   Box breaks infinite size recursion by heap allocation [OK]

Hint: Use Box to break infinite size in recursive types [OK]

Common Mistakes:

• Thinking Box allows multiple ownership
• Assuming Box clones data automatically
• Believing Box makes enum Copy