pub struct BoxRcu<T> { /* private fields */ }
Expand description
An owned pointer that allows interior mutability
An BoxRcu is currently the size of two pointers (plus the
allocated data). So one pointer of overhead versus a plain old
Box
. You will probably want to to occasionally call [clean]
to free up copies made when you call update
. Or you could just
leak memory, that’s cool too.
Our benchmark oddly shows BoxRcu reads as being faster than reads using Box. I don’t understand this, or particularly believe it.
let x = rcu_clean::BoxRcu::new(3);
let y: &usize = &(*x);
*x.update() = 7; // Wow, we are mutating something we have borrowed!
assert_eq!(*y, 3); // the old reference is still valid.
assert_eq!(*x, 7); // but the pointer now points to the new value.
Implementations§
Trait Implementations§
source§impl<T: Ord> Ord for BoxRcu<T>
impl<T: Ord> Ord for BoxRcu<T>
source§impl<T: PartialEq> PartialEq<BoxRcu<T>> for BoxRcu<T>
impl<T: PartialEq> PartialEq<BoxRcu<T>> for BoxRcu<T>
source§impl<T: PartialOrd> PartialOrd<BoxRcu<T>> for BoxRcu<T>
impl<T: PartialOrd> PartialOrd<BoxRcu<T>> for BoxRcu<T>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read more