Struct bitflags::__core::nonzero::NonZero

pub struct NonZero<T> where T: Zeroable(_);

Unstable (nonzero)

: needs an RFC to flesh out the design

A wrapper type for raw pointers and integers that will never be NULL or 0 that might allow certain optimizations.

Methods

impl<T> NonZero<T> where T: Zeroable

unsafe fn new(inner: T) -> NonZero<T>

Unstable (nonzero)

: needs an RFC to flesh out the design

Creates an instance of NonZero with the provided value. You must indeed ensure that the value is actually "non-zero".

Trait Implementations

impl<T> Deref for NonZero<T> where T: Zeroable

type Target = T

fn deref(&self) -> &T

impl<T, U> CoerceUnsized<NonZero<U>> for NonZero<T> where U: Zeroable, T: Zeroable + CoerceUnsized<U>

Derived Implementations

impl<T> Hash for NonZero<T> where T: Zeroable + Hash

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

impl<T> Debug for NonZero<T> where T: Zeroable + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

impl<T> PartialOrd<NonZero<T>> for NonZero<T> where T: Zeroable + PartialOrd<T>

fn partial_cmp(&self, __arg_0: &NonZero<T>) -> Option<Ordering>

fn lt(&self, __arg_0: &NonZero<T>) -> bool

fn le(&self, __arg_0: &NonZero<T>) -> bool

fn gt(&self, __arg_0: &NonZero<T>) -> bool

fn ge(&self, __arg_0: &NonZero<T>) -> bool

impl<T> Ord for NonZero<T> where T: Zeroable + Ord

fn cmp(&self, __arg_0: &NonZero<T>) -> Ordering

impl<T> PartialEq<NonZero<T>> for NonZero<T> where T: Zeroable + PartialEq<T>

fn eq(&self, __arg_0: &NonZero<T>) -> bool

fn ne(&self, __arg_0: &NonZero<T>) -> bool

impl<T> Eq for NonZero<T> where T: Zeroable + Eq

impl<T> Clone for NonZero<T> where T: Zeroable + Clone

fn clone(&self) -> NonZero<T>

fn clone_from(&mut self, source: &Self)

impl<T> Copy for NonZero<T> where T: Copy + Zeroable