402 lines
36 KiB
HTML
402 lines
36 KiB
HTML
|
<!DOCTYPE HTML>
|
|||
|
<html lang="en" class="sidebar-visible no-js light">
|
|||
|
<head>
|
|||
|
<!-- Book generated using mdBook -->
|
|||
|
<meta charset="UTF-8">
|
|||
|
<title>Rc<T>, the Reference Counted Smart Pointer - The Rust Programming Language</title>
|
|||
|
|
|||
|
|
|||
|
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
|
|||
|
<meta name="description" content="">
|
|||
|
<meta name="viewport" content="width=device-width, initial-scale=1">
|
|||
|
<meta name="theme-color" content="#ffffff" />
|
|||
|
|
|||
|
<link rel="shortcut icon" href="favicon.png">
|
|||
|
<link rel="stylesheet" href="css/variables.css">
|
|||
|
<link rel="stylesheet" href="css/general.css">
|
|||
|
<link rel="stylesheet" href="css/chrome.css">
|
|||
|
<link rel="stylesheet" href="css/print.css" media="print">
|
|||
|
|
|||
|
<!-- Fonts -->
|
|||
|
<link rel="stylesheet" href="FontAwesome/css/font-awesome.css">
|
|||
|
<link href="googleFonts/css.css" rel="stylesheet" type="text/css">
|
|||
|
|
|||
|
<!-- Highlight.js Stylesheets -->
|
|||
|
<link rel="stylesheet" href="highlight.css">
|
|||
|
<link rel="stylesheet" href="tomorrow-night.css">
|
|||
|
<link rel="stylesheet" href="ayu-highlight.css">
|
|||
|
|
|||
|
<!-- Custom theme stylesheets -->
|
|||
|
|
|||
|
<link rel="stylesheet" href="ferris.css">
|
|||
|
|
|||
|
<link rel="stylesheet" href="theme/2018-edition.css">
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</head>
|
|||
|
<body>
|
|||
|
<!-- Provide site root to javascript -->
|
|||
|
<script type="text/javascript">
|
|||
|
var path_to_root = "";
|
|||
|
var default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? "light" : "light";
|
|||
|
</script>
|
|||
|
|
|||
|
<!-- Work around some values being stored in localStorage wrapped in quotes -->
|
|||
|
<script type="text/javascript">
|
|||
|
try {
|
|||
|
var theme = localStorage.getItem('mdbook-theme');
|
|||
|
var sidebar = localStorage.getItem('mdbook-sidebar');
|
|||
|
|
|||
|
if (theme.startsWith('"') && theme.endsWith('"')) {
|
|||
|
localStorage.setItem('mdbook-theme', theme.slice(1, theme.length - 1));
|
|||
|
}
|
|||
|
|
|||
|
if (sidebar.startsWith('"') && sidebar.endsWith('"')) {
|
|||
|
localStorage.setItem('mdbook-sidebar', sidebar.slice(1, sidebar.length - 1));
|
|||
|
}
|
|||
|
} catch (e) { }
|
|||
|
</script>
|
|||
|
|
|||
|
<!-- Set the theme before any content is loaded, prevents flash -->
|
|||
|
<script type="text/javascript">
|
|||
|
var theme;
|
|||
|
try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
|
|||
|
if (theme === null || theme === undefined) { theme = default_theme; }
|
|||
|
var html = document.querySelector('html');
|
|||
|
html.classList.remove('no-js')
|
|||
|
html.classList.remove('light')
|
|||
|
html.classList.add(theme);
|
|||
|
html.classList.add('js');
|
|||
|
</script>
|
|||
|
|
|||
|
<!-- Hide / unhide sidebar before it is displayed -->
|
|||
|
<script type="text/javascript">
|
|||
|
var html = document.querySelector('html');
|
|||
|
var sidebar = 'hidden';
|
|||
|
if (document.body.clientWidth >= 1080) {
|
|||
|
try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
|
|||
|
sidebar = sidebar || 'visible';
|
|||
|
}
|
|||
|
html.classList.remove('sidebar-visible');
|
|||
|
html.classList.add("sidebar-" + sidebar);
|
|||
|
</script>
|
|||
|
|
|||
|
<nav id="sidebar" class="sidebar" aria-label="Table of contents">
|
|||
|
<div id="sidebar-scrollbox" class="sidebar-scrollbox">
|
|||
|
<ol class="chapter"><li class="expanded affix "><a href="title-page.html">The Rust Programming Language</a></li><li class="expanded affix "><a href="foreword.html">Foreword</a></li><li class="expanded affix "><a href="ch00-00-introduction.html">Introduction</a></li><li class="expanded "><a href="ch01-00-getting-started.html"><strong aria-hidden="true">1.</strong> Getting Started</a></li><li><ol class="section"><li class="expanded "><a href="ch01-01-installation.html"><strong aria-hidden="true">1.1.</strong> Installation</a></li><li class="expanded "><a href="ch01-02-hello-world.html"><strong aria-hidden="true">1.2.</strong> Hello, World!</a></li><li class="expanded "><a href="ch01-03-hello-cargo.html"><strong aria-hidden="true">1.3.</strong> Hello, Cargo!</a></li></ol></li><li class="expanded "><a href="ch02-00-guessing-game-tutorial.html"><strong aria-hidden="true">2.</strong> Programming a Guessing Game</a></li><li class="expanded "><a href="ch03-00-common-programming-concepts.html"><strong aria-hidden="true">3.</strong> Common Programming Concepts</a></li><li><ol class="section"><li class="expanded "><a href="ch03-01-variables-and-mutability.html"><strong aria-hidden="true">3.1.</strong> Variables and Mutability</a></li><li class="expanded "><a href="ch03-02-data-types.html"><strong aria-hidden="true">3.2.</strong> Data Types</a></li><li class="expanded "><a href="ch03-03-how-functions-work.html"><strong aria-hidden="true">3.3.</strong> Functions</a></li><li class="expanded "><a href="ch03-04-comments.html"><strong aria-hidden="true">3.4.</strong> Comments</a></li><li class="expanded "><a href="ch03-05-control-flow.html"><strong aria-hidden="true">3.5.</strong> Control Flow</a></li></ol></li><li class="expanded "><a href="ch04-00-understanding-ownership.html"><strong aria-hidden="true">4.</strong> Understanding Ownership</a></li><li><ol class="section"><li class="expanded "><a href="ch04-01-what-is-ownership.html"><strong aria-hidden="true">4.1.</strong> What is Ownership?</a></li><li class="expanded "><a href="ch04-02-references-and-borrowing.html"><strong aria-hidden="true">4.2.</strong> References and Borrowing</a></li><li class="expanded "><a href="ch04-03-slices.html"><strong aria-hidden="true">4.3.</strong> The Slice Type</a></li></ol></li><li class="expanded "><a href="ch05-00-structs.html"><strong aria-hidden="true">5.</strong> Using Structs to Structure Related Data</a></li><li><ol class="section"><li class="expanded "><a href="ch05-01-defining-structs.html"><strong aria-hidden="true">5.1.</strong> Defining and Instantiating Structs</a></li><li class="expanded "><a href="ch05-02-example-structs.html"><strong aria-hidden="true">5.2.</strong> An Example Program Using Structs</a></li><li class="expanded "><a href="ch05-03-method-syntax.html"><strong aria-hidden="true">5.3.</strong> Method Syntax</a></li></ol></li><li class="expanded "><a href="ch06-00-enums.html"><strong aria-hidden="true">6.</strong> Enums and Pattern Matching</a></li><li><ol class="section"><li class="expanded "><a href="ch06-01-defining-an-enum.html"><strong aria-hidden="true">6.1.</strong> Defining an Enum</a></li><li class="expanded "><a href="ch06-02-match.html"><strong aria-hidden="true">6.2.</strong> The match Control Flow Operator</a></li><li class="expanded "><a href="ch06-03-if-let.html"><strong aria-hidden="true">6.3.</strong> Concise Control Flow with if let</a></li></ol></li><li class="expanded "><a href="ch07-00-managing-growing-projects-with-packages-crates-and-modules.html"><strong aria-hidden="true">7.</strong> Managing Growing Projects with Packages, Crates, and Modules</a></li><li><ol class="section"><li class="expanded "><a href="ch07-01-packages-and-crates.html"><strong aria-hidden="true">7.1.</strong> Packages and Crates</a></li><li class="expanded "><a href="ch07-02-defining-modules-to-control-scope-and-privacy.html"><strong aria-hidden="true">7.2.</strong> Defining Modules to Control Scope and Privacy</a></li><li class="expanded "><a href="ch07-03-paths-for-referring-to-an-item-in-the-module-tree.html"><
|
|||
|
</div>
|
|||
|
<div id="sidebar-resize-handle" class="sidebar-resize-handle"></div>
|
|||
|
</nav>
|
|||
|
|
|||
|
<div id="page-wrapper" class="page-wrapper">
|
|||
|
|
|||
|
<div class="page">
|
|||
|
|
|||
|
<div id="menu-bar" class="menu-bar">
|
|||
|
<div id="menu-bar-sticky-container">
|
|||
|
<div class="left-buttons">
|
|||
|
<button id="sidebar-toggle" class="icon-button" type="button" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="sidebar">
|
|||
|
<i class="fa fa-bars"></i>
|
|||
|
</button>
|
|||
|
<button id="theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="theme-list">
|
|||
|
<i class="fa fa-paint-brush"></i>
|
|||
|
</button>
|
|||
|
<ul id="theme-list" class="theme-popup" aria-label="Themes" role="menu">
|
|||
|
<li role="none"><button role="menuitem" class="theme" id="light">Light (default)</button></li>
|
|||
|
<li role="none"><button role="menuitem" class="theme" id="rust">Rust</button></li>
|
|||
|
<li role="none"><button role="menuitem" class="theme" id="coal">Coal</button></li>
|
|||
|
<li role="none"><button role="menuitem" class="theme" id="navy">Navy</button></li>
|
|||
|
<li role="none"><button role="menuitem" class="theme" id="ayu">Ayu</button></li>
|
|||
|
</ul>
|
|||
|
|
|||
|
<button id="search-toggle" class="icon-button" type="button" title="Search. (Shortkey: s)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="S" aria-controls="searchbar">
|
|||
|
<i class="fa fa-search"></i>
|
|||
|
</button>
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
<h1 class="menu-title">The Rust Programming Language</h1>
|
|||
|
|
|||
|
<div class="right-buttons">
|
|||
|
<a href="print.html" title="Print this book" aria-label="Print this book">
|
|||
|
<i id="print-button" class="fa fa-print"></i>
|
|||
|
</a>
|
|||
|
|
|||
|
</div>
|
|||
|
</div>
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
<div id="search-wrapper" class="hidden">
|
|||
|
<form id="searchbar-outer" class="searchbar-outer">
|
|||
|
<input type="search" name="search" id="searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="searchresults-outer" aria-describedby="searchresults-header">
|
|||
|
</form>
|
|||
|
<div id="searchresults-outer" class="searchresults-outer hidden">
|
|||
|
<div id="searchresults-header" class="searchresults-header"></div>
|
|||
|
<ul id="searchresults">
|
|||
|
</ul>
|
|||
|
</div>
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
<!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
|
|||
|
<script type="text/javascript">
|
|||
|
document.getElementById('sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
|||
|
document.getElementById('sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
|||
|
Array.from(document.querySelectorAll('#sidebar a')).forEach(function(link) {
|
|||
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
|||
|
});
|
|||
|
</script>
|
|||
|
|
|||
|
<div id="content" class="content">
|
|||
|
<main>
|
|||
|
<h2><a class="header" href="#rct-the-reference-counted-smart-pointer" id="rct-the-reference-counted-smart-pointer"><code>Rc<T></code>, the Reference Counted Smart Pointer</a></h2>
|
|||
|
<p>In the majority of cases, ownership is clear: you know exactly which variable
|
|||
|
owns a given value. However, there are cases when a single value might have
|
|||
|
multiple owners. For example, in graph data structures, multiple edges might
|
|||
|
point to the same node, and that node is conceptually owned by all of the edges
|
|||
|
that point to it. A node shouldn’t be cleaned up unless it doesn’t have any
|
|||
|
edges pointing to it.</p>
|
|||
|
<p>To enable multiple ownership, Rust has a type called <code>Rc<T></code>, which is an
|
|||
|
abbreviation for <em>reference counting</em>. The <code>Rc<T></code> type keeps track of the
|
|||
|
number of references to a value which determines whether or not a value is
|
|||
|
still in use. If there are zero references to a value, the value can be cleaned
|
|||
|
up without any references becoming invalid.</p>
|
|||
|
<p>Imagine <code>Rc<T></code> as a TV in a family room. When one person enters to watch TV,
|
|||
|
they turn it on. Others can come into the room and watch the TV. When the last
|
|||
|
person leaves the room, they turn off the TV because it’s no longer being used.
|
|||
|
If someone turns off the TV while others are still watching it, there would be
|
|||
|
uproar from the remaining TV watchers!</p>
|
|||
|
<p>We use the <code>Rc<T></code> type when we want to allocate some data on the heap for
|
|||
|
multiple parts of our program to read and we can’t determine at compile time
|
|||
|
which part will finish using the data last. If we knew which part would finish
|
|||
|
last, we could just make that part the data’s owner, and the normal ownership
|
|||
|
rules enforced at compile time would take effect.</p>
|
|||
|
<p>Note that <code>Rc<T></code> is only for use in single-threaded scenarios. When we discuss
|
|||
|
concurrency in Chapter 16, we’ll cover how to do reference counting in
|
|||
|
multithreaded programs.</p>
|
|||
|
<h3><a class="header" href="#using-rct-to-share-data" id="using-rct-to-share-data">Using <code>Rc<T></code> to Share Data</a></h3>
|
|||
|
<p>Let’s return to our cons list example in Listing 15-5. Recall that we defined
|
|||
|
it using <code>Box<T></code>. This time, we’ll create two lists that both share ownership
|
|||
|
of a third list. Conceptually, this looks similar to Figure 15-3:</p>
|
|||
|
<img alt="Two lists that share ownership of a third list" src="img/trpl15-03.svg" class="center" />
|
|||
|
<p><span class="caption">Figure 15-3: Two lists, <code>b</code> and <code>c</code>, sharing ownership of
|
|||
|
a third list, <code>a</code></span></p>
|
|||
|
<p>We’ll create list <code>a</code> that contains 5 and then 10. Then we’ll make two more
|
|||
|
lists: <code>b</code> that starts with 3 and <code>c</code> that starts with 4. Both <code>b</code> and <code>c</code>
|
|||
|
lists will then continue on to the first <code>a</code> list containing 5 and 10. In other
|
|||
|
words, both lists will share the first list containing 5 and 10.</p>
|
|||
|
<p>Trying to implement this scenario using our definition of <code>List</code> with <code>Box<T></code>
|
|||
|
won’t work, as shown in Listing 15-17:</p>
|
|||
|
<p><span class="filename">Filename: src/main.rs</span></p>
|
|||
|
<pre><code class="language-rust ignore does_not_compile">enum List {
|
|||
|
Cons(i32, Box<List>),
|
|||
|
Nil,
|
|||
|
}
|
|||
|
|
|||
|
use crate::List::{Cons, Nil};
|
|||
|
|
|||
|
fn main() {
|
|||
|
let a = Cons(5,
|
|||
|
Box::new(Cons(10,
|
|||
|
Box::new(Nil))));
|
|||
|
let b = Cons(3, Box::new(a));
|
|||
|
let c = Cons(4, Box::new(a));
|
|||
|
}
|
|||
|
</code></pre>
|
|||
|
<p><span class="caption">Listing 15-17: Demonstrating we’re not allowed to have
|
|||
|
two lists using <code>Box<T></code> that try to share ownership of a third list</span></p>
|
|||
|
<p>When we compile this code, we get this error:</p>
|
|||
|
<pre><code class="language-text">error[E0382]: use of moved value: `a`
|
|||
|
--> src/main.rs:13:30
|
|||
|
|
|
|||
|
12 | let b = Cons(3, Box::new(a));
|
|||
|
| - value moved here
|
|||
|
13 | let c = Cons(4, Box::new(a));
|
|||
|
| ^ value used here after move
|
|||
|
|
|
|||
|
= note: move occurs because `a` has type `List`, which does not implement
|
|||
|
the `Copy` trait
|
|||
|
</code></pre>
|
|||
|
<p>The <code>Cons</code> variants own the data they hold, so when we create the <code>b</code> list, <code>a</code>
|
|||
|
is moved into <code>b</code> and <code>b</code> owns <code>a</code>. Then, when we try to use <code>a</code> again when
|
|||
|
creating <code>c</code>, we’re not allowed to because <code>a</code> has been moved.</p>
|
|||
|
<p>We could change the definition of <code>Cons</code> to hold references instead, but then
|
|||
|
we would have to specify lifetime parameters. By specifying lifetime
|
|||
|
parameters, we would be specifying that every element in the list will live at
|
|||
|
least as long as the entire list. The borrow checker wouldn’t let us compile
|
|||
|
<code>let a = Cons(10, &Nil);</code> for example, because the temporary <code>Nil</code> value would
|
|||
|
be dropped before <code>a</code> could take a reference to it.</p>
|
|||
|
<p>Instead, we’ll change our definition of <code>List</code> to use <code>Rc<T></code> in place of
|
|||
|
<code>Box<T></code>, as shown in Listing 15-18. Each <code>Cons</code> variant will now hold a value
|
|||
|
and an <code>Rc<T></code> pointing to a <code>List</code>. When we create <code>b</code>, instead of taking
|
|||
|
ownership of <code>a</code>, we’ll clone the <code>Rc<List></code> that <code>a</code> is holding, thereby
|
|||
|
increasing the number of references from one to two and letting <code>a</code> and <code>b</code>
|
|||
|
share ownership of the data in that <code>Rc<List></code>. We’ll also clone <code>a</code> when
|
|||
|
creating <code>c</code>, increasing the number of references from two to three. Every time
|
|||
|
we call <code>Rc::clone</code>, the reference count to the data within the <code>Rc<List></code> will
|
|||
|
increase, and the data won’t be cleaned up unless there are zero references to
|
|||
|
it.</p>
|
|||
|
<p><span class="filename">Filename: src/main.rs</span></p>
|
|||
|
<pre><pre class="playpen"><code class="language-rust">enum List {
|
|||
|
Cons(i32, Rc<List>),
|
|||
|
Nil,
|
|||
|
}
|
|||
|
|
|||
|
use crate::List::{Cons, Nil};
|
|||
|
use std::rc::Rc;
|
|||
|
|
|||
|
fn main() {
|
|||
|
let a = Rc::new(Cons(5, Rc::new(Cons(10, Rc::new(Nil)))));
|
|||
|
let b = Cons(3, Rc::clone(&a));
|
|||
|
let c = Cons(4, Rc::clone(&a));
|
|||
|
}
|
|||
|
</code></pre></pre>
|
|||
|
<p><span class="caption">Listing 15-18: A definition of <code>List</code> that uses
|
|||
|
<code>Rc<T></code></span></p>
|
|||
|
<p>We need to add a <code>use</code> statement to bring <code>Rc<T></code> into scope because it’s not
|
|||
|
in the prelude. In <code>main</code>, we create the list holding 5 and 10 and store it in
|
|||
|
a new <code>Rc<List></code> in <code>a</code>. Then when we create <code>b</code> and <code>c</code>, we call the
|
|||
|
<code>Rc::clone</code> function and pass a reference to the <code>Rc<List></code> in <code>a</code> as an
|
|||
|
argument.</p>
|
|||
|
<p>We could have called <code>a.clone()</code> rather than <code>Rc::clone(&a)</code>, but Rust’s
|
|||
|
convention is to use <code>Rc::clone</code> in this case. The implementation of
|
|||
|
<code>Rc::clone</code> doesn’t make a deep copy of all the data like most types’
|
|||
|
implementations of <code>clone</code> do. The call to <code>Rc::clone</code> only increments the
|
|||
|
reference count, which doesn’t take much time. Deep copies of data can take a
|
|||
|
lot of time. By using <code>Rc::clone</code> for reference counting, we can visually
|
|||
|
distinguish between the deep-copy kinds of clones and the kinds of clones that
|
|||
|
increase the reference count. When looking for performance problems in the
|
|||
|
code, we only need to consider the deep-copy clones and can disregard calls to
|
|||
|
<code>Rc::clone</code>.</p>
|
|||
|
<h3><a class="header" href="#cloning-an-rct-increases-the-reference-count" id="cloning-an-rct-increases-the-reference-count">Cloning an <code>Rc<T></code> Increases the Reference Count</a></h3>
|
|||
|
<p>Let’s change our working example in Listing 15-18 so we can see the reference
|
|||
|
counts changing as we create and drop references to the <code>Rc<List></code> in <code>a</code>.</p>
|
|||
|
<p>In Listing 15-19, we’ll change <code>main</code> so it has an inner scope around list <code>c</code>;
|
|||
|
then we can see how the reference count changes when <code>c</code> goes out of scope.</p>
|
|||
|
<p><span class="filename">Filename: src/main.rs</span></p>
|
|||
|
<pre><pre class="playpen"><code class="language-rust"><span class="boring">enum List {
|
|||
|
</span><span class="boring"> Cons(i32, Rc<List>),
|
|||
|
</span><span class="boring"> Nil,
|
|||
|
</span><span class="boring">}
|
|||
|
</span><span class="boring">
|
|||
|
</span><span class="boring">use crate::List::{Cons, Nil};
|
|||
|
</span><span class="boring">use std::rc::Rc;
|
|||
|
</span><span class="boring">
|
|||
|
</span>fn main() {
|
|||
|
let a = Rc::new(Cons(5, Rc::new(Cons(10, Rc::new(Nil)))));
|
|||
|
println!("count after creating a = {}", Rc::strong_count(&a));
|
|||
|
let b = Cons(3, Rc::clone(&a));
|
|||
|
println!("count after creating b = {}", Rc::strong_count(&a));
|
|||
|
{
|
|||
|
let c = Cons(4, Rc::clone(&a));
|
|||
|
println!("count after creating c = {}", Rc::strong_count(&a));
|
|||
|
}
|
|||
|
println!("count after c goes out of scope = {}", Rc::strong_count(&a));
|
|||
|
}
|
|||
|
</code></pre></pre>
|
|||
|
<p><span class="caption">Listing 15-19: Printing the reference count</span></p>
|
|||
|
<p>At each point in the program where the reference count changes, we print the
|
|||
|
reference count, which we can get by calling the <code>Rc::strong_count</code> function.
|
|||
|
This function is named <code>strong_count</code> rather than <code>count</code> because the <code>Rc<T></code>
|
|||
|
type also has a <code>weak_count</code>; we’ll see what <code>weak_count</code> is used for in the
|
|||
|
<a href="ch15-06-reference-cycles.html#preventing-reference-cycles-turning-an-rct-into-a-weakt">“Preventing Reference Cycles: Turning an <code>Rc<T></code> into a
|
|||
|
<code>Weak<T></code>”</a><!-- ignore --> section.</p>
|
|||
|
<p>This code prints the following:</p>
|
|||
|
<pre><code class="language-text">count after creating a = 1
|
|||
|
count after creating b = 2
|
|||
|
count after creating c = 3
|
|||
|
count after c goes out of scope = 2
|
|||
|
</code></pre>
|
|||
|
<p>We can see that the <code>Rc<List></code> in <code>a</code> has an initial reference count of 1; then
|
|||
|
each time we call <code>clone</code>, the count goes up by 1. When <code>c</code> goes out of scope,
|
|||
|
the count goes down by 1. We don’t have to call a function to decrease the
|
|||
|
reference count like we have to call <code>Rc::clone</code> to increase the reference
|
|||
|
count: the implementation of the <code>Drop</code> trait decreases the reference count
|
|||
|
automatically when an <code>Rc<T></code> value goes out of scope.</p>
|
|||
|
<p>What we can’t see in this example is that when <code>b</code> and then <code>a</code> go out of scope
|
|||
|
at the end of <code>main</code>, the count is then 0, and the <code>Rc<List></code> is cleaned up
|
|||
|
completely at that point. Using <code>Rc<T></code> allows a single value to have
|
|||
|
multiple owners, and the count ensures that the value remains valid as long as
|
|||
|
any of the owners still exist.</p>
|
|||
|
<p>Via immutable references, <code>Rc<T></code> allows you to share data between multiple
|
|||
|
parts of your program for reading only. If <code>Rc<T></code> allowed you to have multiple
|
|||
|
mutable references too, you might violate one of the borrowing rules discussed
|
|||
|
in Chapter 4: multiple mutable borrows to the same place can cause data races
|
|||
|
and inconsistencies. But being able to mutate data is very useful! In the next
|
|||
|
section, we’ll discuss the interior mutability pattern and the <code>RefCell<T></code>
|
|||
|
type that you can use in conjunction with an <code>Rc<T></code> to work with this
|
|||
|
immutability restriction.</p>
|
|||
|
|
|||
|
</main>
|
|||
|
|
|||
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
|||
|
<!-- Mobile navigation buttons -->
|
|||
|
|
|||
|
<a rel="prev" href="ch15-03-drop.html" class="mobile-nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|||
|
<i class="fa fa-angle-left"></i>
|
|||
|
</a>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
<a rel="next" href="ch15-05-interior-mutability.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|||
|
<i class="fa fa-angle-right"></i>
|
|||
|
</a>
|
|||
|
|
|||
|
|
|||
|
<div style="clear: both"></div>
|
|||
|
</nav>
|
|||
|
</div>
|
|||
|
</div>
|
|||
|
|
|||
|
<nav class="nav-wide-wrapper" aria-label="Page navigation">
|
|||
|
|
|||
|
<a href="ch15-03-drop.html" class="nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|||
|
<i class="fa fa-angle-left"></i>
|
|||
|
</a>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
<a href="ch15-05-interior-mutability.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|||
|
<i class="fa fa-angle-right"></i>
|
|||
|
</a>
|
|||
|
|
|||
|
</nav>
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
<script type="text/javascript">
|
|||
|
window.playpen_copyable = true;
|
|||
|
</script>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
<script src="elasticlunr.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
<script src="mark.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
<script src="searcher.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
|||
|
|
|||
|
<script src="clipboard.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
<script src="highlight.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
<script src="book.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
|||
|
<!-- Custom JS scripts -->
|
|||
|
|
|||
|
<script type="text/javascript" src="ferris.js"></script>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</body>
|
|||
|
</html>
|