# Struct rustc_transmute::layout::nfa::Nfa

source ·

    pub(crate) struct Nfa<R>where
        R: Ref,{
        pub(crate) transitions: FxIndexMap<State, FxIndexMap<Transition<R>, FxIndexSet<State>>>,
        pub(crate) start: State,
        pub(crate) accepting: State,
    }

Expand description

A non-deterministic finite automaton (NFA) that represents the layout of a type. The transmutability of two given types is computed by comparing their `Nfa`s.

## Fields§

§`transitions: FxIndexMap<State, FxIndexMap<Transition<R>, FxIndexSet<State>>>`§`start: State`§`accepting: State`

## Implementations§

source§

### impl<R> Nfa<R>
where R: Ref,

source

#### pub(crate) fn unit() -> Self

source

#### pub(crate) fn from_byte(byte: Byte) -> Self

source

#### pub(crate) fn from_ref(r: R) -> Self

source

#### pub(crate) fn from_tree(tree: Tree<!, R>) -> Result<Self, Uninhabited>

source

#### pub(crate) fn concat(self, other: Self) -> Self

Concatenate two `Nfa`s.

source

#### pub(crate) fn union(self, other: Self) -> Self

Compute the union of two `Nfa`s.

source

#### pub(crate) fn edges_from( &self, start: State ) -> Option<&Map<Transition<R>, Set<State>>>

## Trait Implementations§

source§

### impl<R> Debug for Nfa<R>
where R: Ref + Debug,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<R> PartialEq for Nfa<R>
where R: Ref + PartialEq,

source§

#### fn eq(&self, other: &Nfa<R>) -> bool

This method tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 · source§

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

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<R> StructuralPartialEq for Nfa<R>
where R: Ref,

## Auto Trait Implementations§

§

### impl<R> RefUnwindSafe for Nfa<R>
where R: RefUnwindSafe,

§

### impl<R> Send for Nfa<R>
where R: Send,

§

### impl<R> Sync for Nfa<R>
where R: Sync,

§

### impl<R> Unpin for Nfa<R>
where R: Unpin,

§

### impl<R> UnwindSafe for Nfa<R>
where R: UnwindSafe,

## Blanket Implementations§

source§

### impl<T> Any for T
where T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for T
where T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for T
where U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

## Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain `repr(...)` attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 64 bytes