[][src]Struct dependent_ghost::proof::TRUE

pub struct TRUE;

Proposition constructors

The following logical combinators exist to encode a basic propositional logic (specifically, the rules of intuitionistic natural deduction) into Rust's typesystem. As usual, all of these types are zero-sized and will have no runtime impact.

With these combinators, users can construct their own proofs of properties that a library author may want to ensure (such as ensuring that a list is non-empty, a key exists in a map, and so on). The trivial true proposition.

Auto Trait Implementations

impl RefUnwindSafe for TRUE

impl Send for TRUE

impl Sync for TRUE

impl Unpin for TRUE

impl UnwindSafe for TRUE

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.