Struct K1 

pub struct K1<Me: ?Sized, T> { /* private fields */ }

An instance of a type produced by a unary type constructor.

You can freely convert between the wrapper and implementation types with new and the inner_* methods:

use lifted::types::OptionC;

let something: Option<i32> = Some(42);
let mut wrapped: K1<OptionC, i32> = K1::new(something);

assert!(wrapped.inner().is_some());

wrapped.inner_mut().take();

assert!(wrapped.into_inner().is_none());

Implementations

impl<Me: ?Sized + Kind1<T>, T> K1<Me, T>

pub fn new(t: <Me as Kind1<T>>::Inner) -> Self

Wrap an instance in the higher-kinded wrapper.

use lifted::types::OptionC;
let wrapped: K1<OptionC, i32> = K1::new(None);

There is also an alias in the Kind1 trait which you can use to produce a wrapped type.

let wrapped: K1<OptionC, i32> = OptionC::new(Some(42));

pub fn inner(&self) -> &<Me as Kind1<T>>::Inner

Get a shared reference to the implementation type.

use lifted::types::OptionC;

let nothing: K1<OptionC, i32> = OptionC::new(None);
assert!(nothing.inner().is_none());

pub fn inner_mut(&mut self) -> &mut <Me as Kind1<T>>::Inner

Get an exclusive reference to the implementation type.

use lifted::types::OptionC;

let mut nothing: K1<OptionC, i32> = OptionC::new(None);
*nothing.inner_mut() = Some(42);
assert!(nothing.inner().is_some());

pub fn into_inner(self) -> <Me as Kind1<T>>::Inner

Extract the implementation type from the wrapper.

use lifted::types::OptionC;

let wrapped: K1<OptionC, i32> = OptionC::new(Some(42));
let unwrapped = wrapped.into_inner();
assert_eq!(Some(42), unwrapped);

Trait Implementations

impl<Me: ?Sized + Kind1<T>, T> Clone for K1<Me, T>

where <Me as Kind1<T>>::Inner: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Me: ?Sized + Kind1<T>, T> Debug for K1<Me, T>

where <Me as Kind1<T>>::Inner: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<C: Kind2<A, B>, A, B> From<K1<K2P1_1<C, A>, B>> for K2<C, A, B>

fn from(curried: K1<K2P1_1<C, A>, B>) -> Self

Converts to this type from the input type.

impl<C: Kind2<A, B>, A, B> From<K1<K2P1_2<C, B>, A>> for K2<C, A, B>

fn from(curried: K1<K2P1_2<C, B>, A>) -> Self

Converts to this type from the input type.

impl<C: Kind2<A, B>, A, B> From<K2<C, A, B>> for K1<K2P1_1<C, A>, B>

fn from(uncurried: K2<C, A, B>) -> Self

Converts to this type from the input type.

impl<C: Kind2<A, B>, A, B> From<K2<C, A, B>> for K1<K2P1_2<C, B>, A>

fn from(uncurried: K2<C, A, B>) -> Self

Converts to this type from the input type.

impl<Me: ?Sized + Kind1<T>, T> PartialEq for K1<Me, T>

where <Me as Kind1<T>>::Inner: PartialEq,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.