blob: 352cc73cdf69c8a4fdb8058a2ab87343d4def778 [file] [log] [blame] [view] [edit]
## `RefCell<T>` and the Interior Mutability Pattern
_Interior mutability_ is a design pattern in Rust that allows you to mutate data
even when there are immutable references to that data; normally, this action is
disallowed by the borrowing rules. To mutate data, the pattern uses `unsafe`
code inside a data structure to bend Rusts usual rules that govern mutation and
borrowing. Unsafe code indicates to the compiler that were checking the rules
manually instead of relying on the compiler to check them for us; we will
discuss unsafe code more in Chapter 20.
We can use types that use the interior mutability pattern only when we can
ensure that the borrowing rules will be followed at runtime, even though the
compiler cant guarantee that. The `unsafe` code involved is then wrapped in a
safe API, and the outer type is still immutable.
Lets explore this concept by looking at the `RefCell<T>` type that follows the
interior mutability pattern.
### Enforcing Borrowing Rules at Runtime with `RefCell<T>`
Unlike `Rc<T>`, the `RefCell<T>` type represents single ownership over the data
it holds. So, what makes `RefCell<T>` different from a type like `Box<T>`?
Recall the borrowing rules you learned in Chapter 4:
* At any given time, you can have _either_ (but not both) one mutable reference
or any number of immutable references.
* References must always be valid.
With references and `Box<T>`, the borrowing rules invariants are enforced at
compile time. With `RefCell<T>`, these invariants are enforced _at runtime_.
With references, if you break these rules, youll get a compiler error. With
`RefCell<T>`, if you break these rules, your program will panic and exit.
The advantages of checking the borrowing rules at compile time are that errors
will be caught sooner in the development process, and there is no impact on
runtime performance because all the analysis is completed beforehand. For those
reasons, checking the borrowing rules at compile time is the best choice in the
majority of cases, which is why this is Rusts default.
The advantage of checking the borrowing rules at runtime instead is that certain
memory-safe scenarios are then allowed, where they wouldve been disallowed by
the compile-time checks. Static analysis, like the Rust compiler, is inherently
conservative. Some properties of code are impossible to detect by analyzing the
code: the most famous example is the Halting Problem, which is beyond the scope
of this book but is an interesting topic to research.
Because some analysis is impossible, if the Rust compiler cant be sure the code
complies with the ownership rules, it might reject a correct program; in this
way, its conservative. If Rust accepted an incorrect program, users wouldnt be
able to trust in the guarantees Rust makes. However, if Rust rejects a correct
program, the programmer will be inconvenienced, but nothing catastrophic can
occur. The `RefCell<T>` type is useful when youre sure your code follows the
borrowing rules but the compiler is unable to understand and guarantee that.
Similar to `Rc<T>`, `RefCell<T>` is only for use in single-threaded scenarios
and will give you a compile-time error if you try using it in a multithreaded
context. Well talk about how to get the functionality of `RefCell<T>` in a
multithreaded program in Chapter 16.
Here is a recap of the reasons to choose `Box<T>`, `Rc<T>`, or `RefCell<T>`:
* `Rc<T>` enables multiple owners of the same data; `Box<T>` and `RefCell<T>`
have single owners.
* `Box<T>` allows immutable or mutable borrows checked at compile time; `Rc<T>`
allows only immutable borrows checked at compile time; `RefCell<T>` allows
immutable or mutable borrows checked at runtime.
* Because `RefCell<T>` allows mutable borrows checked at runtime, you can mutate
the value inside the `RefCell<T>` even when the `RefCell<T>` is immutable.
Mutating the value inside an immutable value is the _interior mutability_
pattern. Lets look at a situation in which interior mutability is useful and
examine how its possible.
### Interior Mutability: A Mutable Borrow to an Immutable Value
A consequence of the borrowing rules is that when you have an immutable value,
you cant borrow it mutably. For example, this code wont compile:
```rust,ignore,does_not_compile
{{#rustdoc_include ../listings/ch15-smart-pointers/no-listing-01-cant-borrow-immutable-as-mutable/src/main.rs}}
```
If you tried to compile this code, youd get the following error:
```console
{{#include ../listings/ch15-smart-pointers/no-listing-01-cant-borrow-immutable-as-mutable/output.txt}}
```
However, there are situations in which it would be useful for a value to mutate
itself in its methods but appear immutable to other code. Code outside the
values methods would not be able to mutate the value. Using `RefCell<T>` is one
way to get the ability to have interior mutability, but `RefCell<T>` doesnt get
around the borrowing rules completely: the borrow checker in the compiler allows
this interior mutability, and the borrowing rules are checked at runtime
instead. If you violate the rules, youll get a `panic!` instead of a compiler
error.
Lets work through a practical example where we can use `RefCell<T>` to mutate
an immutable value and see why that is useful.
#### A Use Case for Interior Mutability: Mock Objects
Sometimes during testing a programmer will use a type in place of another type,
in order to observe particular behavior and assert its implemented correctly.
This placeholder type is called a _test double_. Think of it in the sense of a
stunt double in filmmaking, where a person steps in and substitutes for an
actor to do a particular tricky scene. Test doubles stand in for other types
when were running tests. _Mock objects_ are specific types of test doubles that
record what happens during a test so you can assert that the correct actions
took place.
Rust doesnt have objects in the same sense as other languages have objects, and
Rust doesnt have mock object functionality built into the standard library as
some other languages do. However, you can definitely create a struct that will
serve the same purposes as a mock object.
Heres the scenario well test: well create a library that tracks a value
against a maximum value and sends messages based on how close to the maximum
value the current value is. This library could be used to keep track of a users
quota for the number of API calls theyre allowed to make, for example.
Our library will only provide the functionality of tracking how close to the
maximum a value is and what the messages should be at what times. Applications
that use our library will be expected to provide the mechanism for sending the
messages: the application could put a message in the application, send an email,
send a text message, or something else. The library doesnt need to know that
detail. All it needs is something that implements a trait well provide called
`Messenger`. Listing 15-20 shows the library code:
<Listing number="15-20" file-name="src/lib.rs" caption="A library to keep track of how close a value is to a maximum value and warn when the value is at certain levels">
```rust,noplayground
{{#rustdoc_include ../listings/ch15-smart-pointers/listing-15-20/src/lib.rs}}
```
</Listing>
One important part of this code is that the `Messenger` trait has one method
called `send` that takes an immutable reference to `self` and the text of the
message. This trait is the interface our mock object needs to implement so that
the mock can be used in the same way a real object is. The other important part
is that we want to test the behavior of the `set_value` method on the
`LimitTracker`. We can change what we pass in for the `value` parameter, but
`set_value` doesnt return anything for us to make assertions on. We want to be
able to say that if we create a `LimitTracker` with something that implements
the `Messenger` trait and a particular value for `max`, when we pass different
numbers for `value`, the messenger is told to send the appropriate messages.
We need a mock object that, instead of sending an email or text message when we
call `send`, will only keep track of the messages its told to send. We can
create a new instance of the mock object, create a `LimitTracker` that uses the
mock object, call the `set_value` method on `LimitTracker`, and then check that
the mock object has the messages we expect. Listing 15-21 shows an attempt to
implement a mock object to do just that, but the borrow checker wont allow it:
<Listing number="15-21" file-name="src/lib.rs" caption="An attempt to implement a `MockMessenger` that isn’t allowed by the borrow checker">
```rust,ignore,does_not_compile
{{#rustdoc_include ../listings/ch15-smart-pointers/listing-15-21/src/lib.rs:here}}
```
</Listing>
This test code defines a `MockMessenger` struct that has a `sent_messages` field
with a `Vec` of `String` values to keep track of the messages its told to send.
We also define an associated function `new` to make it convenient to create new
`MockMessenger` values that start with an empty list of messages. We then
implement the `Messenger` trait for `MockMessenger` so we can give a
`MockMessenger` to a `LimitTracker`. In the definition of the `send` method, we
take the message passed in as a parameter and store it in the `MockMessenger`
list of `sent_messages`.
In the test, were testing what happens when the `LimitTracker` is told to set
`value` to something that is more than 75 percent of the `max` value. First, we
create a new `MockMessenger`, which will start with an empty list of messages.
Then we create a new `LimitTracker` and give it a reference to the new
`MockMessenger` and a `max` value of 100. We call the `set_value` method on the
`LimitTracker` with a value of 80, which is more than 75 percent of 100. Then we
assert that the list of messages that the `MockMessenger` is keeping track of
should now have one message in it.
However, theres one problem with this test, as shown here:
```console
{{#include ../listings/ch15-smart-pointers/listing-15-21/output.txt}}
```
We cant modify the `MockMessenger` to keep track of the messages, because the
`send` method takes an immutable reference to `self`. We also cant take the
suggestion from the error text to use `&mut self` instead, because then the
signature of `send` wouldnt match the signature in the `Messenger` trait
definition (feel free to try and see what error message you get).
This is a situation in which interior mutability can help! Well store the
`sent_messages` within a `RefCell<T>`, and then the `send` method will be able
to modify `sent_messages` to store the messages weve seen. Listing 15-22 shows
what that looks like:
<Listing number="15-22" file-name="src/lib.rs" caption="Using `RefCell<T>` to mutate an inner value while the outer value is considered immutable">
```rust,noplayground
{{#rustdoc_include ../listings/ch15-smart-pointers/listing-15-22/src/lib.rs:here}}
```
</Listing>
The `sent_messages` field is now of type `RefCell<Vec<String>>` instead of
`Vec<String>`. In the `new` function, we create a new `RefCell<Vec<String>>`
instance around the empty vector.
For the implementation of the `send` method, the first parameter is still an
immutable borrow of `self`, which matches the trait definition. We call
`borrow_mut` on the `RefCell<Vec<String>>` in `self.sent_messages` to get a
mutable reference to the value inside the `RefCell<Vec<String>>`, which is the
vector. Then we can call `push` on the mutable reference to the vector to keep
track of the messages sent during the test.
The last change we have to make is in the assertion: to see how many items are
in the inner vector, we call `borrow` on the `RefCell<Vec<String>>` to get an
immutable reference to the vector.
Now that youve seen how to use `RefCell<T>`, lets dig into how it works!
#### Keeping Track of Borrows at Runtime with `RefCell<T>`
When creating immutable and mutable references, we use the `&` and `&mut`
syntax, respectively. With `RefCell<T>`, we use the `borrow` and `borrow_mut`
methods, which are part of the safe API that belongs to `RefCell<T>`. The
`borrow` method returns the smart pointer type `Ref<T>`, and `borrow_mut`
returns the smart pointer type `RefMut<T>`. Both types implement `Deref`, so we
can treat them like regular references.
The `RefCell<T>` keeps track of how many `Ref<T>` and `RefMut<T>` smart pointers
are currently active. Every time we call `borrow`, the `RefCell<T>` increases
its count of how many immutable borrows are active. When a `Ref<T>` value goes
out of scope, the count of immutable borrows goes down by one. Just like the
compile-time borrowing rules, `RefCell<T>` lets us have many immutable borrows
or one mutable borrow at any point in time.
If we try to violate these rules, rather than getting a compiler error as we
would with references, the implementation of `RefCell<T>` will panic at runtime.
Listing 15-23 shows a modification of the implementation of `send` in Listing
15-22. Were deliberately trying to create two mutable borrows active for the
same scope to illustrate that `RefCell<T>` prevents us from doing this at
runtime.
<Listing number="15-23" file-name="src/lib.rs" caption="Creating two mutable references in the same scope to see that `RefCell<T>` will panic">
```rust,ignore,panics
{{#rustdoc_include ../listings/ch15-smart-pointers/listing-15-23/src/lib.rs:here}}
```
</Listing>
We create a variable `one_borrow` for the `RefMut<T>` smart pointer returned
from `borrow_mut`. Then we create another mutable borrow in the same way in the
variable `two_borrow`. This makes two mutable references in the same scope,
which isnt allowed. When we run the tests for our library, the code in Listing
15-23 will compile without any errors, but the test will fail:
```console
{{#include ../listings/ch15-smart-pointers/listing-15-23/output.txt}}
```
Notice that the code panicked with the message
`already borrowed:
BorrowMutError`. This is how `RefCell<T>` handles violations
of the borrowing rules at runtime.
Choosing to catch borrowing errors at runtime rather than compile time, as weve
done here, means youd potentially be finding mistakes in your code later in the
development process: possibly not until your code was deployed to production.
Also, your code would incur a small runtime performance penalty as a result of
keeping track of the borrows at runtime rather than compile time. However, using
`RefCell<T>` makes it possible to write a mock object that can modify itself to
keep track of the messages it has seen while youre using it in a context where
only immutable values are allowed. You can use `RefCell<T>` despite its
trade-offs to get more functionality than regular references provide.
### Having Multiple Owners of Mutable Data by Combining `Rc<T>` and `RefCell<T>`
A common way to use `RefCell<T>` is in combination with `Rc<T>`. Recall that
`Rc<T>` lets you have multiple owners of some data, but it only gives immutable
access to that data. If you have an `Rc<T>` that holds a `RefCell<T>`, you can
get a value that can have multiple owners _and_ that you can mutate!
For example, recall the cons list example in Listing 15-18 where we used `Rc<T>`
to allow multiple lists to share ownership of another list. Because `Rc<T>`
holds only immutable values, we cant change any of the values in the list once
weve created them. Lets add in `RefCell<T>` to gain the ability to change the
values in the lists. Listing 15-24 shows that by using a `RefCell<T>` in the
`Cons` definition, we can modify the value stored in all the lists:
<Listing number="15-24" file-name="src/main.rs" caption="Using `Rc<RefCell<i32>>` to create a `List` that we can mutate">
```rust
{{#rustdoc_include ../listings/ch15-smart-pointers/listing-15-24/src/main.rs}}
```
</Listing>
We create a value that is an instance of `Rc<RefCell<i32>>` and store it in a
variable named `value` so we can access it directly later. Then we create a
`List` in `a` with a `Cons` variant that holds `value`. We need to clone `value`
so both `a` and `value` have ownership of the inner `5` value rather than
transferring ownership from `value` to `a` or having `a` borrow from `value`.
We wrap the list `a` in an `Rc<T>` so when we create lists `b` and `c`, they can
both refer to `a`, which is what we did in Listing 15-18.
After weve created the lists in `a`, `b`, and `c`, we want to add 10 to the
value in `value`. We do this by calling `borrow_mut` on `value`, which uses the
automatic dereferencing feature we discussed in Chapter 5 (see the section
[“Wheres the `->` Operator?”][wheres-the---operator]<!-- ignore -->) to
dereference the `Rc<T>` to the inner `RefCell<T>` value. The `borrow_mut` method
returns a `RefMut<T>` smart pointer, and we use the dereference operator on it
and change the inner value.
When we print `a`, `b`, and `c`, we can see that they all have the modified
value of 15 rather than 5:
```console
{{#include ../listings/ch15-smart-pointers/listing-15-24/output.txt}}
```
This technique is pretty neat! By using `RefCell<T>`, we have an outwardly
immutable `List` value. But we can use the methods on `RefCell<T>` that provide
access to its interior mutability so we can modify our data when we need to. The
runtime checks of the borrowing rules protect us from data races, and its
sometimes worth trading a bit of speed for this flexibility in our data
structures. Note that `RefCell<T>` does not work for multithreaded code!
`Mutex<T>` is the thread-safe version of `RefCell<T>` and well discuss
`Mutex<T>` in Chapter 16.
[wheres-the---operator]: ch05-03-method-syntax.html#wheres-the---operator