Struct GapGuardRaw
pub(in ::slice::sort::unstable::quicksort) struct GapGuardRaw<T> { pub(in ::slice::sort::unstable::quicksort) pos: *mut T, pub(in ::slice::sort::unstable::quicksort) value: *mut T }Ideally this wouldn't be needed and we could just use the regular GapGuard.
See comment in partition_lomuto_branchless_cyclic.
Fields
pos: *mut Tvalue: *mut T
Trait Implementations
impl<T> Drop for GapGuardRaw<T>
fn drop(&mut self)
Auto Trait Implementations
impl<T> !Send for GapGuardRaw<T>
impl<T> !Sync for GapGuardRaw<T>
impl<T> Freeze for GapGuardRaw<T>
where
*mut T: Freeze + Freeze,
impl<T> RefUnwindSafe for GapGuardRaw<T>
where
*mut T: RefUnwindSafe + RefUnwindSafe,
impl<T> Unpin for GapGuardRaw<T>
where
*mut T: Unpin + Unpin,
impl<T> UnsafeUnpin for GapGuardRaw<T>
where
*mut T: UnsafeUnpin + UnsafeUnpin,
impl<T> UnwindSafe for GapGuardRaw<T>
where
*mut T: UnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for GapGuardRaw<T>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for GapGuardRaw<T>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for GapGuardRaw<T>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> From<T> for GapGuardRaw<T>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> SizeHint for GapGuardRaw<T>
where
T: ?Sized,
fn lower_bound(&self) -> usizefn upper_bound(&self) -> Option<usize>
impl<T> SizedTypeProperties for GapGuardRaw<T>
impl<T, U> Into<U> for GapGuardRaw<T>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for GapGuardRaw<T>
where
U: Into<T>,
type Error = Infallible;fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for GapGuardRaw<T>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>