splitmut/lib.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357
//! SplitMut - a crate for safely retrieving multiple mutable values within the same collection.
//!
//! `get2_mut`, `get3_mut` and `get4_mut` return a tuple or 2, 3 or 4 values, each one of them being
//! one of `Ok(&mut V)`, `Err(SplitMutError::NoValue)` in case there was no value for the key (i e, when
//! your usual `get_mut` would have returned `None`), or `Err(SplitMutError::SameValue)` in case the same
//! value has already been returned earlier in the tuple.
//!
//! If you need more than four values, you can use `get_muts` or `get_mut_iter` to get as many mutable
//! values as you like.
//!
//! # Example
//! ```
//! use std::collections::HashMap;
//! use splitmut::{SplitMut, SplitMutError};
//!
//! // Create a hashmap
//! let mut h = HashMap::new();
//! h.insert(1, "Hello");
//! h.insert(2, "world");
//!
//! // Swap two values easily
//! {
//! let (m1, m2) = h.get2_mut(&1, &2);
//! std::mem::swap(m1.unwrap(), m2.unwrap());
//! }
//! assert_eq!(h.get(&1), Some(&"world"));
//! assert_eq!(h.get(&2), Some(&"Hello"));
//!
//! // Show error handling
//! let (m0, m1a, m1b) = h.get3_mut(&0, &1, &1);
//! // No value for the key "0"
//! assert_eq!(m0, Err(SplitMutError::NoValue));
//! // First value for the key "1" is returned successfully
//! assert_eq!(m1a, Ok(&mut "world"));
//! // Second value for the key "1" returns an error
//! assert_eq!(m1b, Err(SplitMutError::SameValue));
//! ```
//!
#![warn(missing_docs)]
use std::collections::{HashMap, BTreeMap, HashSet, VecDeque};
use std::marker::PhantomData;
use std::{hash, borrow};
/// Error returned from get*_mut functions.
#[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Debug)]
pub enum SplitMutError {
/// No value was found for the specified key (like when get_mut would return None)
NoValue,
/// The same value has already been returned (earlier in the same tuple)
SameValue,
}
impl std::error::Error for SplitMutError {
fn description(&self) -> &'static str {
match self {
&SplitMutError::NoValue => "No value",
&SplitMutError::SameValue => "Duplicate values",
}
}
}
impl std::fmt::Display for SplitMutError {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
use std::error::Error;
f.write_str(self.description())
}
}
// Used internally.
type R<V> = Result<*mut V, SplitMutError>;
#[inline]
fn to_r<V>(s: Option<&mut V>) -> R<V> {
s.map(|s| s as *mut V).ok_or(SplitMutError::NoValue)
}
#[inline]
fn check_r<V>(a: &R<V>, b: R<V>) -> R<V> {
match (a, &b) {
(&Ok(ref aa), &Ok(ref bb)) => if aa == bb { return Err(SplitMutError::SameValue) },
_ => {},
}
b
}
#[inline]
unsafe fn from_r<'a, V>(a: R<V>) -> Result<&'a mut V, SplitMutError> { a.map(|aa| &mut *aa) }
/// Just add `use splitmut::SplitMut;` to have these methods working on
/// mutable slices, Vec, VecDeque, HashMap and BTreeMap.
///
/// In case you want to implement `SplitMut` for your own collection, just
/// implement `get1_mut` and `get1_unchecked_mut` and the other methods will
/// be provided for you. If you do so, you must make sure that these functions
/// do not mutate your collection in ways that would invalidate previously returned
/// values from `get1_mut` and `get1_unchecked_mut`.
pub unsafe trait SplitMut<K, V> {
/// Wrapper for get_mut, used internally.
fn get1_mut(&mut self, k1: K) -> Option<&mut V>;
/// Wrapper for get_unchecked_mut, used internally.
///
/// # Undefined behaviour
/// It is undefined behaviour to call this with a key that does not correspond to a value.
/// You have been warned.
unsafe fn get1_unchecked_mut(&mut self, k1: K) -> &mut V;
/// Returns two mutable references to two distinct values within
/// the same collection.
fn get2_mut(&mut self, k1: K, k2: K) -> (Result<&mut V, SplitMutError>, Result<&mut V, SplitMutError>) {
let p1 = to_r(self.get1_mut(k1));
let p2 = to_r(self.get1_mut(k2));
let p2 = check_r(&p1, p2);
unsafe { (from_r(p1), from_r(p2)) }
}
/// Returns three mutable references to three distinct values within
/// the same collection.
fn get3_mut(&mut self, k1: K, k2: K, k3: K) -> (Result<&mut V, SplitMutError>,
Result<&mut V, SplitMutError>, Result<&mut V, SplitMutError>) {
let p1 = to_r(self.get1_mut(k1));
let p2 = to_r(self.get1_mut(k2));
let p3 = to_r(self.get1_mut(k3));
let p2 = check_r(&p1, p2);
let p3 = check_r(&p1, p3);
let p3 = check_r(&p2, p3);
unsafe { (from_r(p1), from_r(p2), from_r(p3)) }
}
/// Returns four mutable references to four distinct values within
/// the same collection.
fn get4_mut(&mut self, k1: K, k2: K, k3: K, k4: K) -> (Result<&mut V, SplitMutError>,
Result<&mut V, SplitMutError>, Result<&mut V, SplitMutError>, Result<&mut V, SplitMutError>) {
let p1 = to_r(self.get1_mut(k1));
let p2 = to_r(self.get1_mut(k2));
let p3 = to_r(self.get1_mut(k3));
let p4 = to_r(self.get1_mut(k4));
let p2 = check_r(&p1, p2);
let p3 = check_r(&p1, p3);
let p3 = check_r(&p2, p3);
let p4 = check_r(&p1, p4);
let p4 = check_r(&p2, p4);
let p4 = check_r(&p3, p4);
unsafe { (from_r(p1), from_r(p2), from_r(p3), from_r(p4)) }
}
/// Returns any number mutable references to distinct values within
/// the same collection. A HashSet is used internally to keep track
/// of values already returned.
///
/// # Example
/// ```
/// use splitmut::SplitMut;
///
/// let mut h = vec!["Hello", "world", "!"];
/// let mut z = h.get_muts();
/// let a = z.at(0);
/// let b = z.at(1);
/// assert_eq!(a, Ok(&mut "Hello"));
/// assert_eq!(b, Ok(&mut "world"));
/// ```
fn get_muts(&mut self) -> GetMuts<K, V, Self> { GetMuts(self, HashSet::new(), PhantomData) }
/// Returns an iterator adapter that maps from a K to a Result<V, SplitMutError>.
/// A HashSet is used internally to keep track of values already returned.
///
/// # Example
/// ```
/// use std::collections::BTreeMap;
/// use splitmut::{SplitMut, SplitMutError};
///
/// let mut h = BTreeMap::new();
/// h.insert(String::from("borrow"), 1);
/// h.insert(String::from("me"), 2);
/// let slice = ["me", "borrow", "me"];
/// let z: Vec<_> = h.get_mut_iter(slice.into_iter().map(|&k| k)).collect();
/// assert_eq!(&*z, [Ok(&mut 2), Ok(&mut 1), Err(SplitMutError::SameValue)]);
/// ```
fn get_mut_iter<I: Iterator<Item=K>>(&mut self, i: I) -> GetMutIter<K, V, Self, I> { GetMutIter(self.get_muts(), i) }
/// Returns two mutable references to two distinct values within
/// the same collection.
///
/// # Undefined behaviour
/// It is undefined behaviour to call this with a key that does not
/// correspond to a value, or with keys pointing to the same value.
/// You have been warned.
unsafe fn get2_unchecked_mut(&mut self, k1: K, k2: K) -> (&mut V, &mut V) {
let p2 = self.get1_unchecked_mut(k2) as *mut V;
(self.get1_unchecked_mut(k1), &mut *p2)
}
/// Returns three mutable references to three distinct values within
/// the same collection.
///
/// # Undefined behaviour
/// It is undefined behaviour to call this with a key that does not
/// correspond to a value, or with any two keys pointing to the same value.
/// You have been warned.
unsafe fn get3_unchecked_mut(&mut self, k1: K, k2: K, k3: K) -> (&mut V, &mut V, &mut V) {
let p2 = self.get1_unchecked_mut(k2) as *mut V;
let p3 = self.get1_unchecked_mut(k3) as *mut V;
(self.get1_unchecked_mut(k1), &mut *p2, &mut *p3)
}
/// Returns four mutable references to four distinct values within
/// the same collection.
///
/// # Undefined behaviour
/// It is undefined behaviour to call this with a key that does not
/// correspond to a value, or with any two keys pointing to the same value.
/// You have been warned.
unsafe fn get4_unchecked_mut(&mut self, k1: K, k2: K, k3: K, k4: K) -> (&mut V, &mut V, &mut V, &mut V) {
let p2 = self.get1_unchecked_mut(k2) as *mut V;
let p3 = self.get1_unchecked_mut(k3) as *mut V;
let p4 = self.get1_unchecked_mut(k4) as *mut V;
(self.get1_unchecked_mut(k1), &mut *p2, &mut *p3, &mut *p4)
}
}
/// Wrapper struct for the get_muts function.
pub struct GetMuts<'a, K, V, A: 'a + SplitMut<K, V> + ?Sized>(&'a mut A, HashSet<*mut V>, PhantomData<*const K>);
impl<'a, K, V, A: 'a + SplitMut<K, V> + ?Sized> GetMuts<'a, K, V, A> {
/// Returns a mutable reference with the same lifetime as the
/// original collection, i e, it allows several distinct mutable references to
/// be alive simultaneously.
///
/// It returnes an error if the value does not exist or has already been returned.
pub fn at(&mut self, k: K) -> Result<&'a mut V, SplitMutError> {
let p = try!(to_r(self.0.get1_mut(k)));
if !self.1.insert(p) { return Err(SplitMutError::SameValue) };
Ok(unsafe { &mut *p })
}
}
/// Wrapper struct for the get_mut_iter function.
pub struct GetMutIter<'a, K, V, A: 'a + SplitMut<K, V> + ?Sized, I>(GetMuts<'a, K, V, A>, I);
impl<'a, K, V: 'a, A: 'a + SplitMut<K, V> + ?Sized, I: Iterator<Item=K>> Iterator for GetMutIter<'a, K, V, A, I> {
type Item = Result<&'a mut V, SplitMutError>;
fn next(&mut self) -> Option<Self::Item> {
self.1.next().map(|k| self.0.at(k))
}
}
unsafe impl<'a, V> SplitMut<usize, V> for &'a mut [V] {
#[inline]
fn get1_mut(&mut self, k: usize) -> Option<&mut V> { self.get_mut(k) }
#[inline]
unsafe fn get1_unchecked_mut(&mut self, k: usize) -> &mut V { self.get_unchecked_mut(k) }
}
unsafe impl<'a, V> SplitMut<usize, V> for Vec<V> {
#[inline]
fn get1_mut(&mut self, k: usize) -> Option<&mut V> { self.get_mut(k) }
#[inline]
unsafe fn get1_unchecked_mut(&mut self, k: usize) -> &mut V { self.get_unchecked_mut(k) }
}
unsafe impl<'a, V> SplitMut<usize, V> for VecDeque<V> {
#[inline]
fn get1_mut(&mut self, k: usize) -> Option<&mut V> { self.get_mut(k) }
#[inline]
unsafe fn get1_unchecked_mut(&mut self, k: usize) -> &mut V { std::mem::transmute(self.get_mut(k)) }
}
unsafe impl<'a, K: hash::Hash + Eq + borrow::Borrow<Q>, Q: hash::Hash + Eq + ?Sized, V, S: hash::BuildHasher> SplitMut<&'a Q, V> for HashMap<K, V, S> {
#[inline]
fn get1_mut(&mut self, k: &'a Q) -> Option<&mut V> { self.get_mut(k) }
#[inline]
unsafe fn get1_unchecked_mut(&mut self, k: &'a Q) -> &mut V { std::mem::transmute(self.get_mut(k)) }
}
unsafe impl<'a, K: Ord + borrow::Borrow<Q>, Q: Ord + ?Sized, V> SplitMut<&'a Q, V> for BTreeMap<K, V> {
#[inline]
fn get1_mut(&mut self, k: &'a Q) -> Option<&mut V> { self.get_mut(k) }
#[inline]
unsafe fn get1_unchecked_mut(&mut self, k: &'a Q) -> &mut V { std::mem::transmute(self.get_mut(k)) }
}
#[test]
fn hash_same() {
let mut h = HashMap::new();
h.insert(3u8, 5u16);
assert_eq!(h.get2_mut(&3, &3), (Ok(&mut 5u16), Err(SplitMutError::SameValue)));
}
#[test]
fn hash_reg() {
let mut h = HashMap::new();
h.insert(3u8, 5u16);
h.insert(4u8, 9u16);
{ let (a, b) = h.get2_mut(&3, &4);
std::mem::swap(a.unwrap(), b.unwrap());
}
assert_eq!(h.get2_mut(&2, &2), (Err(SplitMutError::NoValue), Err(SplitMutError::NoValue)));
assert_eq!(unsafe { h.get2_unchecked_mut(&3, &4) }, (&mut 9u16, &mut 5u16));
assert_eq!(h.get2_mut(&2, &3), (Err(SplitMutError::NoValue), Ok(&mut 9u16)));
}
#[test]
fn tree_borrow() {
let mut h = BTreeMap::new();
h.insert(String::from("borrow"), 1);
h.insert(String::from("me"), 2);
let slice = ["me", "borrow", "me"];
let z: Vec<_> = h.get_mut_iter(slice.into_iter().map(|&k| k)).collect();
assert_eq!(&*z, [Ok(&mut 2), Ok(&mut 1), Err(SplitMutError::SameValue)]);
}
#[test]
fn deque_same() {
let mut h = VecDeque::new();
h.push_front(5u16);
assert_eq!(h.get2_mut(0, 0), (Ok(&mut 5u16), Err(SplitMutError::SameValue)));
}
#[test]
fn deque_reg() {
let mut h = VecDeque::new();
h.push_back(5u16);
h.push_back(9u16);
{ let (a, b) = h.get2_mut(0, 1);
std::mem::swap(a.unwrap(), b.unwrap());
}
assert_eq!(h.get2_mut(2, 2), (Err(SplitMutError::NoValue), Err(SplitMutError::NoValue)));
assert_eq!(unsafe { h.get2_unchecked_mut(0, 1) }, (&mut 9u16, &mut 5u16));
assert_eq!(h.get2_mut(2, 0), (Err(SplitMutError::NoValue), Ok(&mut 9u16)));
}
#[test]
fn vec() {
let mut h = vec!["Hello", "world", "!"];
{ let (a, b, c) = h.get3_mut(0, 1, 2);
*c.unwrap() = "universe";
std::mem::swap(a.unwrap(), b.unwrap());
}
assert_eq!(&*h, &["world", "Hello", "universe"]);
{
let mut z = h.get_muts();
let a = z.at(0);
let b = z.at(1);
assert_eq!(a, Ok(&mut "world"));
assert_eq!(b, Ok(&mut "Hello"));
std::mem::swap(a.unwrap(), b.unwrap());
assert_eq!(z.at(0), Err(SplitMutError::SameValue));
assert_eq!(z.at(3), Err(SplitMutError::NoValue));
}
assert_eq!(&*h, &["Hello", "world", "universe"]);
}