Enum Kind 

#[repr(u8)]
pub enum Kind {
    Games = 0,
    Index = 1,
    Players = 2,
    Tournaments = 3,
    Annotations = 4,
    Annotators = 5,
    Sources = 6,
    Teams = 7,
}

A recognized ChessBase archive member.

Variants

Games = 0

Index = 1

Players = 2

Tournaments = 3

Annotations = 4

Annotators = 5

Sources = 6

Teams = 7

Implementations

impl Kind

Kind Finite Set API.

pub const LEN: usize

pub const ALL: [Self; 8]

pub const fn name(self) -> &'static str

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

pub const fn index(self) -> usize

pub const fn from_index(index: u8) -> Option<Self>

pub fn iter() -> impl Iterator<Item = Self>

pub fn iter_rev() -> impl Iterator<Item = Self>

Trait Implementations

impl Clone for Kind

fn clone(&self) -> Kind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Kind

impl Debug for Kind

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

Formats the value using the given formatter.

impl Display for Kind

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

Formats the value using the given formatter.

impl Eq for Kind

impl FiniteSet<{ $crate::finite_set!(@count $($variant),+) }> for Kind

const ALL: [Self; 8]

const LEN: usize = N

fn iter() -> impl Iterator<Item = Self>

fn iter_rev() -> impl Iterator<Item = Self>

impl<T> Index<Kind> for Table<Kind, T, { _ }>

type Output = T

The returned type after indexing.

fn index(&self, key: Kind) -> &T

Performs the indexing (container[index]) operation.

impl<T> IndexMut<Kind> for Table<Kind, T, { _ }>

fn index_mut(&mut self, key: Kind) -> &mut T

Performs the mutable indexing (container[index]) operation.

impl Ord for Kind

fn cmp(&self, other: &Kind) -> 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 PartialEq for Kind

fn eq(&self, other: &Kind) -> 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 PartialOrd for Kind

fn partial_cmp(&self, other: &Kind) -> 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 StructuralPartialEq for Kind