Struct Token

#[repr(transparent)]
pub struct Token(pub u32);

Available on crate feature blob only.

A token represented as an interned integer.

A token represents the smallest possible unit of change during a diff. For text this is usually a line, a word or a single character. All algorithms operate on interned tokens instead of using the token data directly. This allows for much better performance by amortizing the cost hashing/equality.

While you can intern tokens yourself it is strongly recommended to use InternedInput module.

Tuple Fields

0: u32

Trait Implementations

impl Clone for Token

fn clone(&self) -> Token

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Token

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

Formats the value using the given formatter.

impl From<u32> for Token

fn from(token: u32) -> Token

Converts to this type from the input type.

impl Hash for Token

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

where __H: Hasher,

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<T> Index<Token> for Interner<T>

where T: Hash + Eq,

type Output = T

The returned type after indexing.

fn index(&self, index: Token) -> &<Interner<T> as Index<Token>>::Output

Performs the indexing (container[index]) operation.

impl PartialEq for Token

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

impl Eq for Token

impl StructuralPartialEq for Token