use rustc_index::vec::{Idx, IndexVec}; use std::mem; pub trait IdFunctor: Sized { type Inner; fn try_map_id(self, f: F) -> Result where F: FnMut(Self::Inner) -> Result; } impl IdFunctor for Box { type Inner = T; #[inline] fn try_map_id(self, mut f: F) -> Result where F: FnMut(Self::Inner) -> Result, { let raw = Box::into_raw(self); Ok(unsafe { // SAFETY: The raw pointer points to a valid value of type `T`. let value = raw.read(); // SAFETY: Converts `Box` to `Box>` which is the // inverse of `Box::assume_init()` and should be safe. let raw: Box> = Box::from_raw(raw.cast()); // SAFETY: Write the mapped value back into the `Box`. Box::write(raw, f(value)?) }) } } impl IdFunctor for Vec { type Inner = T; #[inline] fn try_map_id(mut self, mut f: F) -> Result where F: FnMut(Self::Inner) -> Result, { // FIXME: We don't really care about panics here and leak // far more than we should, but that should be fine for now. let len = self.len(); unsafe { self.set_len(0); let start = self.as_mut_ptr(); for i in 0..len { let p = start.add(i); match f(p.read()) { Ok(val) => p.write(val), Err(err) => { // drop all other elements in self // (current element was "moved" into the call to f) for j in (0..i).chain(i + 1..len) { start.add(j).drop_in_place(); } // returning will drop self, releasing the allocation // (len is 0 so elements will not be re-dropped) return Err(err); } } } // Even if we encountered an error, set the len back // so we don't leak memory. self.set_len(len); } Ok(self) } } impl IdFunctor for Box<[T]> { type Inner = T; #[inline] fn try_map_id(self, f: F) -> Result where F: FnMut(Self::Inner) -> Result, { Vec::from(self).try_map_id(f).map(Into::into) } } impl IdFunctor for IndexVec { type Inner = T; #[inline] fn try_map_id(self, f: F) -> Result where F: FnMut(Self::Inner) -> Result, { self.raw.try_map_id(f).map(IndexVec::from_raw) } }