1 //! Shareable mutable containers.
3 //! Rust memory safety is based on this rule: Given an object `T`, it is only possible to
4 //! have one of the following:
6 //! - Having several immutable references (`&T`) to the object (also known as **aliasing**).
7 //! - Having one mutable reference (`&mut T`) to the object (also known as **mutability**).
9 //! This is enforced by the Rust compiler. However, there are situations where this rule is not
10 //! flexible enough. Sometimes it is required to have multiple references to an object and yet
13 //! Shareable mutable containers exist to permit mutability in a controlled manner, even in the
14 //! presence of aliasing. Both `Cell<T>` and `RefCell<T>` allow doing this in a single-threaded
15 //! way. However, neither `Cell<T>` nor `RefCell<T>` are thread safe (they do not implement
16 //! `Sync`). If you need to do aliasing and mutation between multiple threads it is possible to
17 //! use [`Mutex`](../../std/sync/struct.Mutex.html),
18 //! [`RwLock`](../../std/sync/struct.RwLock.html) or
19 //! [`atomic`](../../core/sync/atomic/index.html) types.
21 //! Values of the `Cell<T>` and `RefCell<T>` types may be mutated through shared references (i.e.
22 //! the common `&T` type), whereas most Rust types can only be mutated through unique (`&mut T`)
23 //! references. We say that `Cell<T>` and `RefCell<T>` provide 'interior mutability', in contrast
24 //! with typical Rust types that exhibit 'inherited mutability'.
26 //! Cell types come in two flavors: `Cell<T>` and `RefCell<T>`. `Cell<T>` implements interior
27 //! mutability by moving values in and out of the `Cell<T>`. To use references instead of values,
28 //! one must use the `RefCell<T>` type, acquiring a write lock before mutating. `Cell<T>` provides
29 //! methods to retrieve and change the current interior value:
31 //! - For types that implement `Copy`, the `get` method retrieves the current interior value.
32 //! - For types that implement `Default`, the `take` method replaces the current interior value
33 //! with `Default::default()` and returns the replaced value.
34 //! - For all types, the `replace` method replaces the current interior value and returns the
35 //! replaced value and the `into_inner` method consumes the `Cell<T>` and returns the interior
36 //! value. Additionally, the `set` method replaces the interior value, dropping the replaced
39 //! `RefCell<T>` uses Rust's lifetimes to implement 'dynamic borrowing', a process whereby one can
40 //! claim temporary, exclusive, mutable access to the inner value. Borrows for `RefCell<T>`s are
41 //! tracked 'at runtime', unlike Rust's native reference types which are entirely tracked
42 //! statically, at compile time. Because `RefCell<T>` borrows are dynamic it is possible to attempt
43 //! to borrow a value that is already mutably borrowed; when this happens it results in thread
46 //! # When to choose interior mutability
48 //! The more common inherited mutability, where one must have unique access to mutate a value, is
49 //! one of the key language elements that enables Rust to reason strongly about pointer aliasing,
50 //! statically preventing crash bugs. Because of that, inherited mutability is preferred, and
51 //! interior mutability is something of a last resort. Since cell types enable mutation where it
52 //! would otherwise be disallowed though, there are occasions when interior mutability might be
53 //! appropriate, or even *must* be used, e.g.
55 //! * Introducing mutability 'inside' of something immutable
56 //! * Implementation details of logically-immutable methods.
57 //! * Mutating implementations of `Clone`.
59 //! ## Introducing mutability 'inside' of something immutable
61 //! Many shared smart pointer types, including `Rc<T>` and `Arc<T>`, provide containers that can be
62 //! cloned and shared between multiple parties. Because the contained values may be
63 //! multiply-aliased, they can only be borrowed with `&`, not `&mut`. Without cells it would be
64 //! impossible to mutate data inside of these smart pointers at all.
66 //! It's very common then to put a `RefCell<T>` inside shared pointer types to reintroduce
70 //! use std::cell::{RefCell, RefMut};
71 //! use std::collections::HashMap;
75 //! let shared_map: Rc<RefCell<_>> = Rc::new(RefCell::new(HashMap::new()));
76 //! // Create a new block to limit the scope of the dynamic borrow
78 //! let mut map: RefMut<_> = shared_map.borrow_mut();
79 //! map.insert("africa", 92388);
80 //! map.insert("kyoto", 11837);
81 //! map.insert("piccadilly", 11826);
82 //! map.insert("marbles", 38);
85 //! // Note that if we had not let the previous borrow of the cache fall out
86 //! // of scope then the subsequent borrow would cause a dynamic thread panic.
87 //! // This is the major hazard of using `RefCell`.
88 //! let total: i32 = shared_map.borrow().values().sum();
89 //! println!("{}", total);
93 //! Note that this example uses `Rc<T>` and not `Arc<T>`. `RefCell<T>`s are for single-threaded
94 //! scenarios. Consider using `RwLock<T>` or `Mutex<T>` if you need shared mutability in a
95 //! multi-threaded situation.
97 //! ## Implementation details of logically-immutable methods
99 //! Occasionally it may be desirable not to expose in an API that there is mutation happening
100 //! "under the hood". This may be because logically the operation is immutable, but e.g., caching
101 //! forces the implementation to perform mutation; or because you must employ mutation to implement
102 //! a trait method that was originally defined to take `&self`.
105 //! # #![allow(dead_code)]
106 //! use std::cell::RefCell;
109 //! edges: Vec<(i32, i32)>,
110 //! span_tree_cache: RefCell<Option<Vec<(i32, i32)>>>
114 //! fn minimum_spanning_tree(&self) -> Vec<(i32, i32)> {
115 //! self.span_tree_cache.borrow_mut()
116 //! .get_or_insert_with(|| self.calc_span_tree())
120 //! fn calc_span_tree(&self) -> Vec<(i32, i32)> {
121 //! // Expensive computation goes here
127 //! ## Mutating implementations of `Clone`
129 //! This is simply a special - but common - case of the previous: hiding mutability for operations
130 //! that appear to be immutable. The `clone` method is expected to not change the source value, and
131 //! is declared to take `&self`, not `&mut self`. Therefore, any mutation that happens in the
132 //! `clone` method must use cell types. For example, `Rc<T>` maintains its reference counts within a
136 //! #![feature(core_intrinsics)]
137 //! use std::cell::Cell;
138 //! use std::ptr::NonNull;
139 //! use std::intrinsics::abort;
140 //! use std::marker::PhantomData;
142 //! struct Rc<T: ?Sized> {
143 //! ptr: NonNull<RcBox<T>>,
144 //! phantom: PhantomData<RcBox<T>>,
147 //! struct RcBox<T: ?Sized> {
148 //! strong: Cell<usize>,
149 //! refcount: Cell<usize>,
153 //! impl<T: ?Sized> Clone for Rc<T> {
154 //! fn clone(&self) -> Rc<T> {
155 //! self.inc_strong();
158 //! phantom: PhantomData,
163 //! trait RcBoxPtr<T: ?Sized> {
165 //! fn inner(&self) -> &RcBox<T>;
167 //! fn strong(&self) -> usize {
168 //! self.inner().strong.get()
171 //! fn inc_strong(&self) {
174 //! .set(self.strong()
176 //! .unwrap_or_else(|| unsafe { abort() }));
180 //! impl<T: ?Sized> RcBoxPtr<T> for Rc<T> {
181 //! fn inner(&self) -> &RcBox<T> {
183 //! self.ptr.as_ref()
190 // ignore-tidy-undocumented-unsafe
192 #![stable(feature = "rust1", since = "1.0.0")]
194 use crate::cmp::Ordering;
195 use crate::fmt::{self, Debug, Display};
196 use crate::marker::Unsize;
198 use crate::ops::{CoerceUnsized, Deref, DerefMut};
201 /// A mutable memory location.
205 /// In this example, you can see that `Cell<T>` enables mutation inside an
206 /// immutable struct. In other words, it enables "interior mutability".
209 /// use std::cell::Cell;
211 /// struct SomeStruct {
212 /// regular_field: u8,
213 /// special_field: Cell<u8>,
216 /// let my_struct = SomeStruct {
217 /// regular_field: 0,
218 /// special_field: Cell::new(1),
221 /// let new_value = 100;
223 /// // ERROR: `my_struct` is immutable
224 /// // my_struct.regular_field = new_value;
226 /// // WORKS: although `my_struct` is immutable, `special_field` is a `Cell`,
227 /// // which can always be mutated
228 /// my_struct.special_field.set(new_value);
229 /// assert_eq!(my_struct.special_field.get(), new_value);
232 /// See the [module-level documentation](index.html) for more.
233 #[stable(feature = "rust1", since = "1.0.0")]
235 pub struct Cell<T: ?Sized> {
236 value: UnsafeCell<T>,
239 #[stable(feature = "rust1", since = "1.0.0")]
240 unsafe impl<T: ?Sized> Send for Cell<T> where T: Send {}
242 #[stable(feature = "rust1", since = "1.0.0")]
243 impl<T: ?Sized> !Sync for Cell<T> {}
245 #[stable(feature = "rust1", since = "1.0.0")]
246 impl<T: Copy> Clone for Cell<T> {
248 fn clone(&self) -> Cell<T> {
249 Cell::new(self.get())
253 #[stable(feature = "rust1", since = "1.0.0")]
254 impl<T: Default> Default for Cell<T> {
255 /// Creates a `Cell<T>`, with the `Default` value for T.
257 fn default() -> Cell<T> {
258 Cell::new(Default::default())
262 #[stable(feature = "rust1", since = "1.0.0")]
263 impl<T: PartialEq + Copy> PartialEq for Cell<T> {
265 fn eq(&self, other: &Cell<T>) -> bool {
266 self.get() == other.get()
270 #[stable(feature = "cell_eq", since = "1.2.0")]
271 impl<T: Eq + Copy> Eq for Cell<T> {}
273 #[stable(feature = "cell_ord", since = "1.10.0")]
274 impl<T: PartialOrd + Copy> PartialOrd for Cell<T> {
276 fn partial_cmp(&self, other: &Cell<T>) -> Option<Ordering> {
277 self.get().partial_cmp(&other.get())
281 fn lt(&self, other: &Cell<T>) -> bool {
282 self.get() < other.get()
286 fn le(&self, other: &Cell<T>) -> bool {
287 self.get() <= other.get()
291 fn gt(&self, other: &Cell<T>) -> bool {
292 self.get() > other.get()
296 fn ge(&self, other: &Cell<T>) -> bool {
297 self.get() >= other.get()
301 #[stable(feature = "cell_ord", since = "1.10.0")]
302 impl<T: Ord + Copy> Ord for Cell<T> {
304 fn cmp(&self, other: &Cell<T>) -> Ordering {
305 self.get().cmp(&other.get())
309 #[stable(feature = "cell_from", since = "1.12.0")]
310 impl<T> From<T> for Cell<T> {
311 fn from(t: T) -> Cell<T> {
317 /// Creates a new `Cell` containing the given value.
322 /// use std::cell::Cell;
324 /// let c = Cell::new(5);
326 #[stable(feature = "rust1", since = "1.0.0")]
327 #[rustc_const_stable(feature = "const_cell_new", since = "1.32.0")]
329 pub const fn new(value: T) -> Cell<T> {
330 Cell { value: UnsafeCell::new(value) }
333 /// Sets the contained value.
338 /// use std::cell::Cell;
340 /// let c = Cell::new(5);
345 #[stable(feature = "rust1", since = "1.0.0")]
346 pub fn set(&self, val: T) {
347 let old = self.replace(val);
351 /// Swaps the values of two Cells.
352 /// Difference with `std::mem::swap` is that this function doesn't require `&mut` reference.
357 /// use std::cell::Cell;
359 /// let c1 = Cell::new(5i32);
360 /// let c2 = Cell::new(10i32);
362 /// assert_eq!(10, c1.get());
363 /// assert_eq!(5, c2.get());
366 #[stable(feature = "move_cell", since = "1.17.0")]
367 pub fn swap(&self, other: &Self) {
368 if ptr::eq(self, other) {
372 ptr::swap(self.value.get(), other.value.get());
376 /// Replaces the contained value, and returns it.
381 /// use std::cell::Cell;
383 /// let cell = Cell::new(5);
384 /// assert_eq!(cell.get(), 5);
385 /// assert_eq!(cell.replace(10), 5);
386 /// assert_eq!(cell.get(), 10);
388 #[stable(feature = "move_cell", since = "1.17.0")]
389 pub fn replace(&self, val: T) -> T {
390 mem::replace(unsafe { &mut *self.value.get() }, val)
393 /// Unwraps the value.
398 /// use std::cell::Cell;
400 /// let c = Cell::new(5);
401 /// let five = c.into_inner();
403 /// assert_eq!(five, 5);
405 #[stable(feature = "move_cell", since = "1.17.0")]
406 pub fn into_inner(self) -> T {
407 self.value.into_inner()
411 impl<T: Copy> Cell<T> {
412 /// Returns a copy of the contained value.
417 /// use std::cell::Cell;
419 /// let c = Cell::new(5);
421 /// let five = c.get();
424 #[stable(feature = "rust1", since = "1.0.0")]
425 pub fn get(&self) -> T {
426 unsafe { *self.value.get() }
429 /// Updates the contained value using a function and returns the new value.
434 /// #![feature(cell_update)]
436 /// use std::cell::Cell;
438 /// let c = Cell::new(5);
439 /// let new = c.update(|x| x + 1);
441 /// assert_eq!(new, 6);
442 /// assert_eq!(c.get(), 6);
445 #[unstable(feature = "cell_update", issue = "50186")]
446 pub fn update<F>(&self, f: F) -> T
450 let old = self.get();
457 impl<T: ?Sized> Cell<T> {
458 /// Returns a raw pointer to the underlying data in this cell.
463 /// use std::cell::Cell;
465 /// let c = Cell::new(5);
467 /// let ptr = c.as_ptr();
470 #[stable(feature = "cell_as_ptr", since = "1.12.0")]
471 #[rustc_const_stable(feature = "const_cell_as_ptr", since = "1.32.0")]
472 pub const fn as_ptr(&self) -> *mut T {
476 /// Returns a mutable reference to the underlying data.
478 /// This call borrows `Cell` mutably (at compile-time) which guarantees
479 /// that we possess the only reference.
484 /// use std::cell::Cell;
486 /// let mut c = Cell::new(5);
487 /// *c.get_mut() += 1;
489 /// assert_eq!(c.get(), 6);
492 #[stable(feature = "cell_get_mut", since = "1.11.0")]
493 pub fn get_mut(&mut self) -> &mut T {
494 unsafe { &mut *self.value.get() }
497 /// Returns a `&Cell<T>` from a `&mut T`
502 /// use std::cell::Cell;
504 /// let slice: &mut [i32] = &mut [1, 2, 3];
505 /// let cell_slice: &Cell<[i32]> = Cell::from_mut(slice);
506 /// let slice_cell: &[Cell<i32>] = cell_slice.as_slice_of_cells();
508 /// assert_eq!(slice_cell.len(), 3);
511 #[stable(feature = "as_cell", since = "1.37.0")]
512 pub fn from_mut(t: &mut T) -> &Cell<T> {
513 unsafe { &*(t as *mut T as *const Cell<T>) }
517 impl<T: Default> Cell<T> {
518 /// Takes the value of the cell, leaving `Default::default()` in its place.
523 /// use std::cell::Cell;
525 /// let c = Cell::new(5);
526 /// let five = c.take();
528 /// assert_eq!(five, 5);
529 /// assert_eq!(c.into_inner(), 0);
531 #[stable(feature = "move_cell", since = "1.17.0")]
532 pub fn take(&self) -> T {
533 self.replace(Default::default())
537 #[unstable(feature = "coerce_unsized", issue = "27732")]
538 impl<T: CoerceUnsized<U>, U> CoerceUnsized<Cell<U>> for Cell<T> {}
541 /// Returns a `&[Cell<T>]` from a `&Cell<[T]>`
546 /// use std::cell::Cell;
548 /// let slice: &mut [i32] = &mut [1, 2, 3];
549 /// let cell_slice: &Cell<[i32]> = Cell::from_mut(slice);
550 /// let slice_cell: &[Cell<i32>] = cell_slice.as_slice_of_cells();
552 /// assert_eq!(slice_cell.len(), 3);
554 #[stable(feature = "as_cell", since = "1.37.0")]
555 pub fn as_slice_of_cells(&self) -> &[Cell<T>] {
556 unsafe { &*(self as *const Cell<[T]> as *const [Cell<T>]) }
560 /// A mutable memory location with dynamically checked borrow rules
562 /// See the [module-level documentation](index.html) for more.
563 #[stable(feature = "rust1", since = "1.0.0")]
564 pub struct RefCell<T: ?Sized> {
565 borrow: Cell<BorrowFlag>,
566 value: UnsafeCell<T>,
569 /// An error returned by [`RefCell::try_borrow`](struct.RefCell.html#method.try_borrow).
570 #[stable(feature = "try_borrow", since = "1.13.0")]
571 pub struct BorrowError {
575 #[stable(feature = "try_borrow", since = "1.13.0")]
576 impl Debug for BorrowError {
577 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
578 f.debug_struct("BorrowError").finish()
582 #[stable(feature = "try_borrow", since = "1.13.0")]
583 impl Display for BorrowError {
584 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
585 Display::fmt("already mutably borrowed", f)
589 /// An error returned by [`RefCell::try_borrow_mut`](struct.RefCell.html#method.try_borrow_mut).
590 #[stable(feature = "try_borrow", since = "1.13.0")]
591 pub struct BorrowMutError {
595 #[stable(feature = "try_borrow", since = "1.13.0")]
596 impl Debug for BorrowMutError {
597 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
598 f.debug_struct("BorrowMutError").finish()
602 #[stable(feature = "try_borrow", since = "1.13.0")]
603 impl Display for BorrowMutError {
604 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
605 Display::fmt("already borrowed", f)
609 // Positive values represent the number of `Ref` active. Negative values
610 // represent the number of `RefMut` active. Multiple `RefMut`s can only be
611 // active at a time if they refer to distinct, nonoverlapping components of a
612 // `RefCell` (e.g., different ranges of a slice).
614 // `Ref` and `RefMut` are both two words in size, and so there will likely never
615 // be enough `Ref`s or `RefMut`s in existence to overflow half of the `usize`
616 // range. Thus, a `BorrowFlag` will probably never overflow or underflow.
617 // However, this is not a guarantee, as a pathological program could repeatedly
618 // create and then mem::forget `Ref`s or `RefMut`s. Thus, all code must
619 // explicitly check for overflow and underflow in order to avoid unsafety, or at
620 // least behave correctly in the event that overflow or underflow happens (e.g.,
621 // see BorrowRef::new).
622 type BorrowFlag = isize;
623 const UNUSED: BorrowFlag = 0;
626 fn is_writing(x: BorrowFlag) -> bool {
631 fn is_reading(x: BorrowFlag) -> bool {
636 /// Creates a new `RefCell` containing `value`.
641 /// use std::cell::RefCell;
643 /// let c = RefCell::new(5);
645 #[stable(feature = "rust1", since = "1.0.0")]
646 #[rustc_const_stable(feature = "const_refcell_new", since = "1.32.0")]
648 pub const fn new(value: T) -> RefCell<T> {
649 RefCell { value: UnsafeCell::new(value), borrow: Cell::new(UNUSED) }
652 /// Consumes the `RefCell`, returning the wrapped value.
657 /// use std::cell::RefCell;
659 /// let c = RefCell::new(5);
661 /// let five = c.into_inner();
663 #[stable(feature = "rust1", since = "1.0.0")]
665 pub fn into_inner(self) -> T {
666 // Since this function takes `self` (the `RefCell`) by value, the
667 // compiler statically verifies that it is not currently borrowed.
668 // Therefore the following assertion is just a `debug_assert!`.
669 debug_assert!(self.borrow.get() == UNUSED);
670 self.value.into_inner()
673 /// Replaces the wrapped value with a new one, returning the old value,
674 /// without deinitializing either one.
676 /// This function corresponds to [`std::mem::replace`](../mem/fn.replace.html).
680 /// Panics if the value is currently borrowed.
685 /// use std::cell::RefCell;
686 /// let cell = RefCell::new(5);
687 /// let old_value = cell.replace(6);
688 /// assert_eq!(old_value, 5);
689 /// assert_eq!(cell, RefCell::new(6));
692 #[stable(feature = "refcell_replace", since = "1.24.0")]
693 pub fn replace(&self, t: T) -> T {
694 mem::replace(&mut *self.borrow_mut(), t)
697 /// Replaces the wrapped value with a new one computed from `f`, returning
698 /// the old value, without deinitializing either one.
702 /// Panics if the value is currently borrowed.
707 /// use std::cell::RefCell;
708 /// let cell = RefCell::new(5);
709 /// let old_value = cell.replace_with(|&mut old| old + 1);
710 /// assert_eq!(old_value, 5);
711 /// assert_eq!(cell, RefCell::new(6));
714 #[stable(feature = "refcell_replace_swap", since = "1.35.0")]
715 pub fn replace_with<F: FnOnce(&mut T) -> T>(&self, f: F) -> T {
716 let mut_borrow = &mut *self.borrow_mut();
717 let replacement = f(mut_borrow);
718 mem::replace(mut_borrow, replacement)
721 /// Swaps the wrapped value of `self` with the wrapped value of `other`,
722 /// without deinitializing either one.
724 /// This function corresponds to [`std::mem::swap`](../mem/fn.swap.html).
728 /// Panics if the value in either `RefCell` is currently borrowed.
733 /// use std::cell::RefCell;
734 /// let c = RefCell::new(5);
735 /// let d = RefCell::new(6);
737 /// assert_eq!(c, RefCell::new(6));
738 /// assert_eq!(d, RefCell::new(5));
741 #[stable(feature = "refcell_swap", since = "1.24.0")]
742 pub fn swap(&self, other: &Self) {
743 mem::swap(&mut *self.borrow_mut(), &mut *other.borrow_mut())
747 impl<T: ?Sized> RefCell<T> {
748 /// Immutably borrows the wrapped value.
750 /// The borrow lasts until the returned `Ref` exits scope. Multiple
751 /// immutable borrows can be taken out at the same time.
755 /// Panics if the value is currently mutably borrowed. For a non-panicking variant, use
756 /// [`try_borrow`](#method.try_borrow).
761 /// use std::cell::RefCell;
763 /// let c = RefCell::new(5);
765 /// let borrowed_five = c.borrow();
766 /// let borrowed_five2 = c.borrow();
769 /// An example of panic:
772 /// use std::cell::RefCell;
775 /// let result = thread::spawn(move || {
776 /// let c = RefCell::new(5);
777 /// let m = c.borrow_mut();
779 /// let b = c.borrow(); // this causes a panic
782 /// assert!(result.is_err());
784 #[stable(feature = "rust1", since = "1.0.0")]
786 pub fn borrow(&self) -> Ref<'_, T> {
787 self.try_borrow().expect("already mutably borrowed")
790 /// Immutably borrows the wrapped value, returning an error if the value is currently mutably
793 /// The borrow lasts until the returned `Ref` exits scope. Multiple immutable borrows can be
794 /// taken out at the same time.
796 /// This is the non-panicking variant of [`borrow`](#method.borrow).
801 /// use std::cell::RefCell;
803 /// let c = RefCell::new(5);
806 /// let m = c.borrow_mut();
807 /// assert!(c.try_borrow().is_err());
811 /// let m = c.borrow();
812 /// assert!(c.try_borrow().is_ok());
815 #[stable(feature = "try_borrow", since = "1.13.0")]
817 pub fn try_borrow(&self) -> Result<Ref<'_, T>, BorrowError> {
818 match BorrowRef::new(&self.borrow) {
819 Some(b) => Ok(Ref { value: unsafe { &*self.value.get() }, borrow: b }),
820 None => Err(BorrowError { _private: () }),
824 /// Mutably borrows the wrapped value.
826 /// The borrow lasts until the returned `RefMut` or all `RefMut`s derived
827 /// from it exit scope. The value cannot be borrowed while this borrow is
832 /// Panics if the value is currently borrowed. For a non-panicking variant, use
833 /// [`try_borrow_mut`](#method.try_borrow_mut).
838 /// use std::cell::RefCell;
840 /// let c = RefCell::new(5);
842 /// *c.borrow_mut() = 7;
844 /// assert_eq!(*c.borrow(), 7);
847 /// An example of panic:
850 /// use std::cell::RefCell;
853 /// let result = thread::spawn(move || {
854 /// let c = RefCell::new(5);
855 /// let m = c.borrow();
857 /// let b = c.borrow_mut(); // this causes a panic
860 /// assert!(result.is_err());
862 #[stable(feature = "rust1", since = "1.0.0")]
864 pub fn borrow_mut(&self) -> RefMut<'_, T> {
865 self.try_borrow_mut().expect("already borrowed")
868 /// Mutably borrows the wrapped value, returning an error if the value is currently borrowed.
870 /// The borrow lasts until the returned `RefMut` or all `RefMut`s derived
871 /// from it exit scope. The value cannot be borrowed while this borrow is
874 /// This is the non-panicking variant of [`borrow_mut`](#method.borrow_mut).
879 /// use std::cell::RefCell;
881 /// let c = RefCell::new(5);
884 /// let m = c.borrow();
885 /// assert!(c.try_borrow_mut().is_err());
888 /// assert!(c.try_borrow_mut().is_ok());
890 #[stable(feature = "try_borrow", since = "1.13.0")]
892 pub fn try_borrow_mut(&self) -> Result<RefMut<'_, T>, BorrowMutError> {
893 match BorrowRefMut::new(&self.borrow) {
894 Some(b) => Ok(RefMut { value: unsafe { &mut *self.value.get() }, borrow: b }),
895 None => Err(BorrowMutError { _private: () }),
899 /// Returns a raw pointer to the underlying data in this cell.
904 /// use std::cell::RefCell;
906 /// let c = RefCell::new(5);
908 /// let ptr = c.as_ptr();
911 #[stable(feature = "cell_as_ptr", since = "1.12.0")]
912 pub fn as_ptr(&self) -> *mut T {
916 /// Returns a mutable reference to the underlying data.
918 /// This call borrows `RefCell` mutably (at compile-time) so there is no
919 /// need for dynamic checks.
921 /// However be cautious: this method expects `self` to be mutable, which is
922 /// generally not the case when using a `RefCell`. Take a look at the
923 /// [`borrow_mut`] method instead if `self` isn't mutable.
925 /// Also, please be aware that this method is only for special circumstances and is usually
926 /// not what you want. In case of doubt, use [`borrow_mut`] instead.
928 /// [`borrow_mut`]: #method.borrow_mut
933 /// use std::cell::RefCell;
935 /// let mut c = RefCell::new(5);
936 /// *c.get_mut() += 1;
938 /// assert_eq!(c, RefCell::new(6));
941 #[stable(feature = "cell_get_mut", since = "1.11.0")]
942 pub fn get_mut(&mut self) -> &mut T {
943 unsafe { &mut *self.value.get() }
946 /// Immutably borrows the wrapped value, returning an error if the value is
947 /// currently mutably borrowed.
951 /// Unlike `RefCell::borrow`, this method is unsafe because it does not
952 /// return a `Ref`, thus leaving the borrow flag untouched. Mutably
953 /// borrowing the `RefCell` while the reference returned by this method
954 /// is alive is undefined behaviour.
959 /// use std::cell::RefCell;
961 /// let c = RefCell::new(5);
964 /// let m = c.borrow_mut();
965 /// assert!(unsafe { c.try_borrow_unguarded() }.is_err());
969 /// let m = c.borrow();
970 /// assert!(unsafe { c.try_borrow_unguarded() }.is_ok());
973 #[stable(feature = "borrow_state", since = "1.37.0")]
975 pub unsafe fn try_borrow_unguarded(&self) -> Result<&T, BorrowError> {
976 if !is_writing(self.borrow.get()) {
977 Ok(&*self.value.get())
979 Err(BorrowError { _private: () })
984 #[stable(feature = "rust1", since = "1.0.0")]
985 unsafe impl<T: ?Sized> Send for RefCell<T> where T: Send {}
987 #[stable(feature = "rust1", since = "1.0.0")]
988 impl<T: ?Sized> !Sync for RefCell<T> {}
990 #[stable(feature = "rust1", since = "1.0.0")]
991 impl<T: Clone> Clone for RefCell<T> {
994 /// Panics if the value is currently mutably borrowed.
996 fn clone(&self) -> RefCell<T> {
997 RefCell::new(self.borrow().clone())
1001 #[stable(feature = "rust1", since = "1.0.0")]
1002 impl<T: Default> Default for RefCell<T> {
1003 /// Creates a `RefCell<T>`, with the `Default` value for T.
1005 fn default() -> RefCell<T> {
1006 RefCell::new(Default::default())
1010 #[stable(feature = "rust1", since = "1.0.0")]
1011 impl<T: ?Sized + PartialEq> PartialEq for RefCell<T> {
1014 /// Panics if the value in either `RefCell` is currently borrowed.
1016 fn eq(&self, other: &RefCell<T>) -> bool {
1017 *self.borrow() == *other.borrow()
1021 #[stable(feature = "cell_eq", since = "1.2.0")]
1022 impl<T: ?Sized + Eq> Eq for RefCell<T> {}
1024 #[stable(feature = "cell_ord", since = "1.10.0")]
1025 impl<T: ?Sized + PartialOrd> PartialOrd for RefCell<T> {
1028 /// Panics if the value in either `RefCell` is currently borrowed.
1030 fn partial_cmp(&self, other: &RefCell<T>) -> Option<Ordering> {
1031 self.borrow().partial_cmp(&*other.borrow())
1036 /// Panics if the value in either `RefCell` is currently borrowed.
1038 fn lt(&self, other: &RefCell<T>) -> bool {
1039 *self.borrow() < *other.borrow()
1044 /// Panics if the value in either `RefCell` is currently borrowed.
1046 fn le(&self, other: &RefCell<T>) -> bool {
1047 *self.borrow() <= *other.borrow()
1052 /// Panics if the value in either `RefCell` is currently borrowed.
1054 fn gt(&self, other: &RefCell<T>) -> bool {
1055 *self.borrow() > *other.borrow()
1060 /// Panics if the value in either `RefCell` is currently borrowed.
1062 fn ge(&self, other: &RefCell<T>) -> bool {
1063 *self.borrow() >= *other.borrow()
1067 #[stable(feature = "cell_ord", since = "1.10.0")]
1068 impl<T: ?Sized + Ord> Ord for RefCell<T> {
1071 /// Panics if the value in either `RefCell` is currently borrowed.
1073 fn cmp(&self, other: &RefCell<T>) -> Ordering {
1074 self.borrow().cmp(&*other.borrow())
1078 #[stable(feature = "cell_from", since = "1.12.0")]
1079 impl<T> From<T> for RefCell<T> {
1080 fn from(t: T) -> RefCell<T> {
1085 #[unstable(feature = "coerce_unsized", issue = "27732")]
1086 impl<T: CoerceUnsized<U>, U> CoerceUnsized<RefCell<U>> for RefCell<T> {}
1088 struct BorrowRef<'b> {
1089 borrow: &'b Cell<BorrowFlag>,
1092 impl<'b> BorrowRef<'b> {
1094 fn new(borrow: &'b Cell<BorrowFlag>) -> Option<BorrowRef<'b>> {
1095 let b = borrow.get().wrapping_add(1);
1097 // Incrementing borrow can result in a non-reading value (<= 0) in these cases:
1098 // 1. It was < 0, i.e. there are writing borrows, so we can't allow a read borrow
1099 // due to Rust's reference aliasing rules
1100 // 2. It was isize::max_value() (the max amount of reading borrows) and it overflowed
1101 // into isize::min_value() (the max amount of writing borrows) so we can't allow
1102 // an additional read borrow because isize can't represent so many read borrows
1103 // (this can only happen if you mem::forget more than a small constant amount of
1104 // `Ref`s, which is not good practice)
1107 // Incrementing borrow can result in a reading value (> 0) in these cases:
1108 // 1. It was = 0, i.e. it wasn't borrowed, and we are taking the first read borrow
1109 // 2. It was > 0 and < isize::max_value(), i.e. there were read borrows, and isize
1110 // is large enough to represent having one more read borrow
1112 Some(BorrowRef { borrow })
1117 impl Drop for BorrowRef<'_> {
1119 fn drop(&mut self) {
1120 let borrow = self.borrow.get();
1121 debug_assert!(is_reading(borrow));
1122 self.borrow.set(borrow - 1);
1126 impl Clone for BorrowRef<'_> {
1128 fn clone(&self) -> Self {
1129 // Since this Ref exists, we know the borrow flag
1130 // is a reading borrow.
1131 let borrow = self.borrow.get();
1132 debug_assert!(is_reading(borrow));
1133 // Prevent the borrow counter from overflowing into
1134 // a writing borrow.
1135 assert!(borrow != isize::max_value());
1136 self.borrow.set(borrow + 1);
1137 BorrowRef { borrow: self.borrow }
1141 /// Wraps a borrowed reference to a value in a `RefCell` box.
1142 /// A wrapper type for an immutably borrowed value from a `RefCell<T>`.
1144 /// See the [module-level documentation](index.html) for more.
1145 #[stable(feature = "rust1", since = "1.0.0")]
1146 pub struct Ref<'b, T: ?Sized + 'b> {
1148 borrow: BorrowRef<'b>,
1151 #[stable(feature = "rust1", since = "1.0.0")]
1152 impl<T: ?Sized> Deref for Ref<'_, T> {
1156 fn deref(&self) -> &T {
1161 impl<'b, T: ?Sized> Ref<'b, T> {
1164 /// The `RefCell` is already immutably borrowed, so this cannot fail.
1166 /// This is an associated function that needs to be used as
1167 /// `Ref::clone(...)`. A `Clone` implementation or a method would interfere
1168 /// with the widespread use of `r.borrow().clone()` to clone the contents of
1170 #[stable(feature = "cell_extras", since = "1.15.0")]
1172 pub fn clone(orig: &Ref<'b, T>) -> Ref<'b, T> {
1173 Ref { value: orig.value, borrow: orig.borrow.clone() }
1176 /// Makes a new `Ref` for a component of the borrowed data.
1178 /// The `RefCell` is already immutably borrowed, so this cannot fail.
1180 /// This is an associated function that needs to be used as `Ref::map(...)`.
1181 /// A method would interfere with methods of the same name on the contents
1182 /// of a `RefCell` used through `Deref`.
1187 /// use std::cell::{RefCell, Ref};
1189 /// let c = RefCell::new((5, 'b'));
1190 /// let b1: Ref<(u32, char)> = c.borrow();
1191 /// let b2: Ref<u32> = Ref::map(b1, |t| &t.0);
1192 /// assert_eq!(*b2, 5)
1194 #[stable(feature = "cell_map", since = "1.8.0")]
1196 pub fn map<U: ?Sized, F>(orig: Ref<'b, T>, f: F) -> Ref<'b, U>
1198 F: FnOnce(&T) -> &U,
1200 Ref { value: f(orig.value), borrow: orig.borrow }
1203 /// Splits a `Ref` into multiple `Ref`s for different components of the
1206 /// The `RefCell` is already immutably borrowed, so this cannot fail.
1208 /// This is an associated function that needs to be used as
1209 /// `Ref::map_split(...)`. A method would interfere with methods of the same
1210 /// name on the contents of a `RefCell` used through `Deref`.
1215 /// use std::cell::{Ref, RefCell};
1217 /// let cell = RefCell::new([1, 2, 3, 4]);
1218 /// let borrow = cell.borrow();
1219 /// let (begin, end) = Ref::map_split(borrow, |slice| slice.split_at(2));
1220 /// assert_eq!(*begin, [1, 2]);
1221 /// assert_eq!(*end, [3, 4]);
1223 #[stable(feature = "refcell_map_split", since = "1.35.0")]
1225 pub fn map_split<U: ?Sized, V: ?Sized, F>(orig: Ref<'b, T>, f: F) -> (Ref<'b, U>, Ref<'b, V>)
1227 F: FnOnce(&T) -> (&U, &V),
1229 let (a, b) = f(orig.value);
1230 let borrow = orig.borrow.clone();
1231 (Ref { value: a, borrow }, Ref { value: b, borrow: orig.borrow })
1235 #[unstable(feature = "coerce_unsized", issue = "27732")]
1236 impl<'b, T: ?Sized + Unsize<U>, U: ?Sized> CoerceUnsized<Ref<'b, U>> for Ref<'b, T> {}
1238 #[stable(feature = "std_guard_impls", since = "1.20.0")]
1239 impl<T: ?Sized + fmt::Display> fmt::Display for Ref<'_, T> {
1240 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1245 impl<'b, T: ?Sized> RefMut<'b, T> {
1246 /// Makes a new `RefMut` for a component of the borrowed data, e.g., an enum
1249 /// The `RefCell` is already mutably borrowed, so this cannot fail.
1251 /// This is an associated function that needs to be used as
1252 /// `RefMut::map(...)`. A method would interfere with methods of the same
1253 /// name on the contents of a `RefCell` used through `Deref`.
1258 /// use std::cell::{RefCell, RefMut};
1260 /// let c = RefCell::new((5, 'b'));
1262 /// let b1: RefMut<(u32, char)> = c.borrow_mut();
1263 /// let mut b2: RefMut<u32> = RefMut::map(b1, |t| &mut t.0);
1264 /// assert_eq!(*b2, 5);
1267 /// assert_eq!(*c.borrow(), (42, 'b'));
1269 #[stable(feature = "cell_map", since = "1.8.0")]
1271 pub fn map<U: ?Sized, F>(orig: RefMut<'b, T>, f: F) -> RefMut<'b, U>
1273 F: FnOnce(&mut T) -> &mut U,
1275 // FIXME(nll-rfc#40): fix borrow-check
1276 let RefMut { value, borrow } = orig;
1277 RefMut { value: f(value), borrow }
1280 /// Splits a `RefMut` into multiple `RefMut`s for different components of the
1283 /// The underlying `RefCell` will remain mutably borrowed until both
1284 /// returned `RefMut`s go out of scope.
1286 /// The `RefCell` is already mutably borrowed, so this cannot fail.
1288 /// This is an associated function that needs to be used as
1289 /// `RefMut::map_split(...)`. A method would interfere with methods of the
1290 /// same name on the contents of a `RefCell` used through `Deref`.
1295 /// use std::cell::{RefCell, RefMut};
1297 /// let cell = RefCell::new([1, 2, 3, 4]);
1298 /// let borrow = cell.borrow_mut();
1299 /// let (mut begin, mut end) = RefMut::map_split(borrow, |slice| slice.split_at_mut(2));
1300 /// assert_eq!(*begin, [1, 2]);
1301 /// assert_eq!(*end, [3, 4]);
1302 /// begin.copy_from_slice(&[4, 3]);
1303 /// end.copy_from_slice(&[2, 1]);
1305 #[stable(feature = "refcell_map_split", since = "1.35.0")]
1307 pub fn map_split<U: ?Sized, V: ?Sized, F>(
1308 orig: RefMut<'b, T>,
1310 ) -> (RefMut<'b, U>, RefMut<'b, V>)
1312 F: FnOnce(&mut T) -> (&mut U, &mut V),
1314 let (a, b) = f(orig.value);
1315 let borrow = orig.borrow.clone();
1316 (RefMut { value: a, borrow }, RefMut { value: b, borrow: orig.borrow })
1320 struct BorrowRefMut<'b> {
1321 borrow: &'b Cell<BorrowFlag>,
1324 impl Drop for BorrowRefMut<'_> {
1326 fn drop(&mut self) {
1327 let borrow = self.borrow.get();
1328 debug_assert!(is_writing(borrow));
1329 self.borrow.set(borrow + 1);
1333 impl<'b> BorrowRefMut<'b> {
1335 fn new(borrow: &'b Cell<BorrowFlag>) -> Option<BorrowRefMut<'b>> {
1336 // NOTE: Unlike BorrowRefMut::clone, new is called to create the initial
1337 // mutable reference, and so there must currently be no existing
1338 // references. Thus, while clone increments the mutable refcount, here
1339 // we explicitly only allow going from UNUSED to UNUSED - 1.
1340 match borrow.get() {
1342 borrow.set(UNUSED - 1);
1343 Some(BorrowRefMut { borrow })
1349 // Clones a `BorrowRefMut`.
1351 // This is only valid if each `BorrowRefMut` is used to track a mutable
1352 // reference to a distinct, nonoverlapping range of the original object.
1353 // This isn't in a Clone impl so that code doesn't call this implicitly.
1355 fn clone(&self) -> BorrowRefMut<'b> {
1356 let borrow = self.borrow.get();
1357 debug_assert!(is_writing(borrow));
1358 // Prevent the borrow counter from underflowing.
1359 assert!(borrow != isize::min_value());
1360 self.borrow.set(borrow - 1);
1361 BorrowRefMut { borrow: self.borrow }
1365 /// A wrapper type for a mutably borrowed value from a `RefCell<T>`.
1367 /// See the [module-level documentation](index.html) for more.
1368 #[stable(feature = "rust1", since = "1.0.0")]
1369 pub struct RefMut<'b, T: ?Sized + 'b> {
1371 borrow: BorrowRefMut<'b>,
1374 #[stable(feature = "rust1", since = "1.0.0")]
1375 impl<T: ?Sized> Deref for RefMut<'_, T> {
1379 fn deref(&self) -> &T {
1384 #[stable(feature = "rust1", since = "1.0.0")]
1385 impl<T: ?Sized> DerefMut for RefMut<'_, T> {
1387 fn deref_mut(&mut self) -> &mut T {
1392 #[unstable(feature = "coerce_unsized", issue = "27732")]
1393 impl<'b, T: ?Sized + Unsize<U>, U: ?Sized> CoerceUnsized<RefMut<'b, U>> for RefMut<'b, T> {}
1395 #[stable(feature = "std_guard_impls", since = "1.20.0")]
1396 impl<T: ?Sized + fmt::Display> fmt::Display for RefMut<'_, T> {
1397 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1402 /// The core primitive for interior mutability in Rust.
1404 /// `UnsafeCell<T>` is a type that wraps some `T` and indicates unsafe interior operations on the
1405 /// wrapped type. Types with an `UnsafeCell<T>` field are considered to have an 'unsafe interior'.
1406 /// The `UnsafeCell<T>` type is the only legal way to obtain aliasable data that is considered
1407 /// mutable. In general, transmuting an `&T` type into an `&mut T` is considered undefined behavior.
1409 /// If you have a reference `&SomeStruct`, then normally in Rust all fields of `SomeStruct` are
1410 /// immutable. The compiler makes optimizations based on the knowledge that `&T` is not mutably
1411 /// aliased or mutated, and that `&mut T` is unique. `UnsafeCell<T>` is the only core language
1412 /// feature to work around the restriction that `&T` may not be mutated. All other types that
1413 /// allow internal mutability, such as `Cell<T>` and `RefCell<T>`, use `UnsafeCell` to wrap their
1414 /// internal data. There is *no* legal way to obtain aliasing `&mut`, not even with `UnsafeCell<T>`.
1416 /// The `UnsafeCell` API itself is technically very simple: it gives you a raw pointer `*mut T` to
1417 /// its contents. It is up to _you_ as the abstraction designer to use that raw pointer correctly.
1419 /// The precise Rust aliasing rules are somewhat in flux, but the main points are not contentious:
1421 /// - If you create a safe reference with lifetime `'a` (either a `&T` or `&mut T`
1422 /// reference) that is accessible by safe code (for example, because you returned it),
1423 /// then you must not access the data in any way that contradicts that reference for the
1424 /// remainder of `'a`. For example, this means that if you take the `*mut T` from an
1425 /// `UnsafeCell<T>` and cast it to an `&T`, then the data in `T` must remain immutable
1426 /// (modulo any `UnsafeCell` data found within `T`, of course) until that reference's
1427 /// lifetime expires. Similarly, if you create a `&mut T` reference that is released to
1428 /// safe code, then you must not access the data within the `UnsafeCell` until that
1429 /// reference expires.
1431 /// - At all times, you must avoid data races. If multiple threads have access to
1432 /// the same `UnsafeCell`, then any writes must have a proper happens-before relation to all other
1433 /// accesses (or use atomics).
1435 /// To assist with proper design, the following scenarios are explicitly declared legal
1436 /// for single-threaded code:
1438 /// 1. A `&T` reference can be released to safe code and there it can co-exist with other `&T`
1439 /// references, but not with a `&mut T`
1441 /// 2. A `&mut T` reference may be released to safe code provided neither other `&mut T` nor `&T`
1442 /// co-exist with it. A `&mut T` must always be unique.
1444 /// Note that while mutating or mutably aliasing the contents of an `&UnsafeCell<T>` is
1445 /// ok (provided you enforce the invariants some other way), it is still undefined behavior
1446 /// to have multiple `&mut UnsafeCell<T>` aliases.
1451 /// use std::cell::UnsafeCell;
1453 /// # #[allow(dead_code)]
1454 /// struct NotThreadSafe<T> {
1455 /// value: UnsafeCell<T>,
1458 /// unsafe impl<T> Sync for NotThreadSafe<T> {}
1460 #[lang = "unsafe_cell"]
1461 #[stable(feature = "rust1", since = "1.0.0")]
1462 #[repr(transparent)]
1463 pub struct UnsafeCell<T: ?Sized> {
1467 #[stable(feature = "rust1", since = "1.0.0")]
1468 impl<T: ?Sized> !Sync for UnsafeCell<T> {}
1470 impl<T> UnsafeCell<T> {
1471 /// Constructs a new instance of `UnsafeCell` which will wrap the specified
1474 /// All access to the inner value through methods is `unsafe`.
1479 /// use std::cell::UnsafeCell;
1481 /// let uc = UnsafeCell::new(5);
1483 #[stable(feature = "rust1", since = "1.0.0")]
1484 #[rustc_const_stable(feature = "const_unsafe_cell_new", since = "1.32.0")]
1486 pub const fn new(value: T) -> UnsafeCell<T> {
1487 UnsafeCell { value }
1490 /// Unwraps the value.
1495 /// use std::cell::UnsafeCell;
1497 /// let uc = UnsafeCell::new(5);
1499 /// let five = uc.into_inner();
1502 #[stable(feature = "rust1", since = "1.0.0")]
1503 pub fn into_inner(self) -> T {
1508 impl<T: ?Sized> UnsafeCell<T> {
1509 /// Gets a mutable pointer to the wrapped value.
1511 /// This can be cast to a pointer of any kind.
1512 /// Ensure that the access is unique (no active references, mutable or not)
1513 /// when casting to `&mut T`, and ensure that there are no mutations
1514 /// or mutable aliases going on when casting to `&T`
1519 /// use std::cell::UnsafeCell;
1521 /// let uc = UnsafeCell::new(5);
1523 /// let five = uc.get();
1526 #[stable(feature = "rust1", since = "1.0.0")]
1527 #[rustc_const_stable(feature = "const_unsafecell_get", since = "1.32.0")]
1528 pub const fn get(&self) -> *mut T {
1529 // We can just cast the pointer from `UnsafeCell<T>` to `T` because of
1530 // #[repr(transparent)]. This exploits libstd's special status, there is
1531 // no guarantee for user code that this will work in future versions of the compiler!
1532 self as *const UnsafeCell<T> as *const T as *mut T
1535 /// Gets a mutable pointer to the wrapped value.
1536 /// The difference to [`get`] is that this function accepts a raw pointer,
1537 /// which is useful to avoid the creation of temporary references.
1539 /// The result can be cast to a pointer of any kind.
1540 /// Ensure that the access is unique (no active references, mutable or not)
1541 /// when casting to `&mut T`, and ensure that there are no mutations
1542 /// or mutable aliases going on when casting to `&T`.
1544 /// [`get`]: #method.get
1548 /// Gradual initialization of an `UnsafeCell` requires `raw_get`, as
1549 /// calling `get` would require creating a reference to uninitialized data:
1552 /// #![feature(unsafe_cell_raw_get)]
1553 /// use std::cell::UnsafeCell;
1554 /// use std::mem::MaybeUninit;
1556 /// let m = MaybeUninit::<UnsafeCell<i32>>::uninit();
1557 /// unsafe { UnsafeCell::raw_get(m.as_ptr()).write(5); }
1558 /// let uc = unsafe { m.assume_init() };
1560 /// assert_eq!(uc.into_inner(), 5);
1563 #[unstable(feature = "unsafe_cell_raw_get", issue = "66358")]
1564 pub const fn raw_get(this: *const Self) -> *mut T {
1565 // We can just cast the pointer from `UnsafeCell<T>` to `T` because of
1566 // #[repr(transparent)]. This exploits libstd's special status, there is
1567 // no guarantee for user code that this will work in future versions of the compiler!
1568 this as *const T as *mut T
1572 #[stable(feature = "unsafe_cell_default", since = "1.10.0")]
1573 impl<T: Default> Default for UnsafeCell<T> {
1574 /// Creates an `UnsafeCell`, with the `Default` value for T.
1575 fn default() -> UnsafeCell<T> {
1576 UnsafeCell::new(Default::default())
1580 #[stable(feature = "cell_from", since = "1.12.0")]
1581 impl<T> From<T> for UnsafeCell<T> {
1582 fn from(t: T) -> UnsafeCell<T> {
1587 #[unstable(feature = "coerce_unsized", issue = "27732")]
1588 impl<T: CoerceUnsized<U>, U> CoerceUnsized<UnsafeCell<U>> for UnsafeCell<T> {}
1591 fn assert_coerce_unsized(a: UnsafeCell<&i32>, b: Cell<&i32>, c: RefCell<&i32>) {
1592 let _: UnsafeCell<&dyn Send> = a;
1593 let _: Cell<&dyn Send> = b;
1594 let _: RefCell<&dyn Send> = c;