Struct EmptyLookupTable 

pub struct EmptyLookupTable(pub [&'static str; 0]);

A lookup table with zero entries

Tuple Fields

0: [&'static str; 0]

Trait Implementations

impl Clone for EmptyLookupTable

fn clone(&self) -> EmptyLookupTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EmptyLookupTable

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

Formats the value using the given formatter.

impl Default for EmptyLookupTable

fn default() -> EmptyLookupTable

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for EmptyLookupTable

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for EmptyLookupTable

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

Formats the value using the given formatter.

impl From<EmptyLookupTable> for CountryTable

fn from(t: EmptyLookupTable) -> Self

Converts to this type from the input type.

impl LookupTable for EmptyLookupTable

fn contains(&self, _: &str) -> bool

True if this lookup table contains alias

fn len(&self) -> usize

The number of elements in this lookup table

fn iter(&self) -> Iter<'_, &'static str>

An iterator over this lookup table

fn is_empty(&self) -> bool

True if there are no elements

impl Ord for EmptyLookupTable

fn cmp(&self, other: &EmptyLookupTable) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<L: LookupTable> PartialEq<L> for EmptyLookupTable

fn eq(&self, other: &L) -> 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.

impl<L: LookupTable> PartialOrd<L> for EmptyLookupTable

fn partial_cmp(&self, other: &L) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for EmptyLookupTable

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for EmptyLookupTable

impl Eq for EmptyLookupTable