Struct Entry 

#[non_exhaustive]
pub struct Entry {
    pub table: u16,
    pub form: u16,
}

Analysis of a word form in the dictionary: a form of an inflection table. The numbers are valid only for the dictionary that gave them: with another one they give other forms

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

table: u16

Number of the table

form: u16

Number of the form in the paradigm of the table

Implementations

impl Entry

pub fn new(table: u16, form: u16) -> Self

A form of a table by the numbers that an analysis of the same dictionary had

Trait Implementations

impl Clone for Entry

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Entry

impl Debug for Entry

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

Formats the value using the given formatter.

impl Eq for Entry

impl Hash for Entry

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Entry

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Entry