Auto merge of #24053 - kvark:get_mut, r=alexcrichton

As requested by @kballard in #23844
This commit is contained in:
bors 2015-04-05 16:14:11 +00:00
commit de6742bb1c
2 changed files with 22 additions and 22 deletions

View File

@ -243,10 +243,9 @@ pub fn weak_count<T>(this: &Arc<T>) -> usize { this.inner().weak.load(SeqCst) -
pub fn strong_count<T>(this: &Arc<T>) -> usize { this.inner().strong.load(SeqCst) } pub fn strong_count<T>(this: &Arc<T>) -> usize { this.inner().strong.load(SeqCst) }
/// Try accessing a mutable reference to the contents behind an unique `Arc<T>`. /// Returns a mutable reference to the contained value if the `Arc<T>` is unique.
/// ///
/// The access is granted only if this is the only reference to the object. /// Returns `None` if the `Arc<T>` is not unique.
/// Otherwise, `None` is returned.
/// ///
/// # Examples /// # Examples
/// ///
@ -254,16 +253,19 @@ pub fn strong_count<T>(this: &Arc<T>) -> usize { this.inner().strong.load(SeqCst
/// # #![feature(alloc)] /// # #![feature(alloc)]
/// extern crate alloc; /// extern crate alloc;
/// # fn main() { /// # fn main() {
/// use alloc::arc; /// use alloc::arc::{Arc, get_mut};
/// ///
/// let mut four = arc::Arc::new(4); /// let mut x = Arc::new(3);
/// *get_mut(&mut x).unwrap() = 4;
/// assert_eq!(*x, 4);
/// ///
/// arc::unique(&mut four).map(|num| *num = 5); /// let _y = x.clone();
/// assert!(get_mut(&mut x).is_none());
/// # } /// # }
/// ``` /// ```
#[inline] #[inline]
#[unstable(feature = "alloc")] #[unstable(feature = "alloc")]
pub fn unique<T>(this: &mut Arc<T>) -> Option<&mut T> { pub fn get_mut<T>(this: &mut Arc<T>) -> Option<&mut T> {
if strong_count(this) == 1 && weak_count(this) == 0 { if strong_count(this) == 1 && weak_count(this) == 0 {
// This unsafety is ok because we're guaranteed that the pointer // This unsafety is ok because we're guaranteed that the pointer
// returned is the *only* pointer that will ever be returned to T. Our // returned is the *only* pointer that will ever be returned to T. Our
@ -347,7 +349,7 @@ impl<T: Clone> Arc<T> {
self.inner().weak.load(SeqCst) != 1 { self.inner().weak.load(SeqCst) != 1 {
*self = Arc::new((**self).clone()) *self = Arc::new((**self).clone())
} }
// As with `unique()`, the unsafety is ok because our reference was // As with `get_mut()`, the unsafety is ok because our reference was
// either unique to begin with, or became one upon cloning the contents. // either unique to begin with, or became one upon cloning the contents.
let inner = unsafe { &mut **self._ptr }; let inner = unsafe { &mut **self._ptr };
&mut inner.data &mut inner.data
@ -691,7 +693,7 @@ mod tests {
use std::sync::atomic::Ordering::{Acquire, SeqCst}; use std::sync::atomic::Ordering::{Acquire, SeqCst};
use std::thread; use std::thread;
use std::vec::Vec; use std::vec::Vec;
use super::{Arc, Weak, weak_count, strong_count, unique}; use super::{Arc, Weak, get_mut, weak_count, strong_count};
use std::sync::Mutex; use std::sync::Mutex;
struct Canary(*mut atomic::AtomicUsize); struct Canary(*mut atomic::AtomicUsize);
@ -728,18 +730,16 @@ mod tests {
} }
#[test] #[test]
fn test_arc_unique() { fn test_arc_get_mut() {
let mut x = Arc::new(10); let mut x = Arc::new(3);
assert!(unique(&mut x).is_some()); *get_mut(&mut x).unwrap() = 4;
{ assert_eq!(*x, 4);
let y = x.clone(); let y = x.clone();
assert!(unique(&mut x).is_none()); assert!(get_mut(&mut x).is_none());
} drop(y);
{ assert!(get_mut(&mut x).is_some());
let z = x.downgrade(); let _w = x.downgrade();
assert!(unique(&mut x).is_none()); assert!(get_mut(&mut x).is_none());
}
assert!(unique(&mut x).is_some());
} }
#[test] #[test]

View File

@ -324,7 +324,7 @@ pub fn try_unwrap<T>(rc: Rc<T>) -> Result<T, Rc<T>> {
/// ``` /// ```
#[inline] #[inline]
#[unstable(feature = "alloc")] #[unstable(feature = "alloc")]
pub fn get_mut<'a, T>(rc: &'a mut Rc<T>) -> Option<&'a mut T> { pub fn get_mut<T>(rc: &mut Rc<T>) -> Option<&mut T> {
if is_unique(rc) { if is_unique(rc) {
let inner = unsafe { &mut **rc._ptr }; let inner = unsafe { &mut **rc._ptr };
Some(&mut inner.value) Some(&mut inner.value)