Trait leer::Empty

pub trait Empty {
    // Required method
    fn empty() -> Self;
}

Types that have a notion of “being empty” and can create such an empty instance.

This is very similar to Default from the standard library, but makes it explicit that the returned instance is empty and not just any default instance. This trait is implemented for several standard types.

Required Methods

fn empty() -> Self

Returns an empty value of this type.

Implementations on Foreign Types

impl<T: Empty> Empty for Box<T>

fn empty() -> Self

impl Empty for String

fn empty() -> Self

impl<A: Empty, B: Empty> Empty for (A, B)

fn empty() -> Self

impl<T: ?Sized> Empty for PhantomData<T>

fn empty() -> Self

impl<A: Empty, B: Empty, C: Empty, D: Empty> Empty for (A, B, C, D)

fn empty() -> Self

impl<A: Empty, B: Empty, C: Empty> Empty for (A, B, C)

fn empty() -> Self

impl<T> Empty for LinkedList<T>

fn empty() -> Self

impl<T> Empty for Option<T>

fn empty() -> Self

impl<T: Eq + Hash> Empty for HashSet<T>

fn empty() -> Self

impl Empty for ()

fn empty() -> Self

impl<T: Ord> Empty for BTreeSet<T>

fn empty() -> Self

impl<T: Empty, const N: usize> Empty for [T; N]

fn empty() -> Self

impl<K: Eq + Hash, V> Empty for HashMap<K, V>

fn empty() -> Self

impl<T> Empty for VecDeque<T>

fn empty() -> Self

impl<T> Empty for Vec<T>

fn empty() -> Self

impl<A: Empty> Empty for (A,)

fn empty() -> Self

impl<K: Ord, V> Empty for BTreeMap<K, V>

fn empty() -> Self

Implementors