Struct Head 

#[repr(C)]
pub struct Head<Q, S> {
    pub state: State<Q>,
    pub symbol: S,
}

The Head of a Turing machine is defined to be a two-tuple consisting of a state and a symbol. Our implementation is generic over both the state and symbol types, allowing for flexibility in their representation(s).

Fields

state: State<Q>

symbol: S

Implementations

impl<Q, A> Head<Q, A>

where Q: RawState,

The base implementation of the Head type focusing on providing constructors and basic methods for manipulating its components.

pub const fn new(state: Q, symbol: A) -> Self

initialize a new instance of the Head given some state and symbol

pub fn from_state(state: Q) -> Self

where A: Default,

returns a new instance of the head using the given state and a default symbol

pub fn from_symbol(symbol: A) -> Self

where Q: Default,

returns a new instance of the head using the given symbol and a default state

pub fn from_tuple((state, symbol): (State<Q>, A)) -> Self

Create a new instance from a 2-tuple: (state, symbol)

pub fn with_state(self, state: Q) -> Self

consumes the current instance to create another instance with the given state

pub fn with_symbol(self, symbol: A) -> Self

consumes the current instance to create another instance with the given symbol

pub const fn state(&self) -> &State<Q>

returns a reference to the current state

pub const fn state_mut(&mut self) -> &mut State<Q>

returns a mutable reference to the current State

pub const fn symbol(&self) -> &A

returns a reference to the current symbol

pub const fn symbol_mut(&mut self) -> &mut A

returns a mutable reference to the current symbol

pub fn set_state(&mut self, state: Q)

updates the current state

pub fn set_symbol(&mut self, symbol: A)

updates the current symbol

pub const fn replace(&mut self, state: State<Q>, symbol: A) -> Self

replaces the current values with the given state and symbol, returning the previous instance of the Head

pub const fn replace_state(&mut self, state: State<Q>) -> State<Q>

replace the current state with the given state, returning the previous state

pub const fn replace_symbol(&mut self, symbol: A) -> A

replace the current symbol with the given symbol, returning the previous symbol

pub const fn swap(&mut self, other: &mut Self)

swap the current state and symbol with those of the given head

pub fn update(&mut self, state: Option<State<Q>>, symbol: Option<A>)

updates the current State and symbol

pub const fn as_tuple(&self) -> (&State<Q>, &A)

returns a reference to the current state and symbol returing a 2-tuple

pub const fn as_mut_tuple(&mut self) -> (&mut State<Q>, &mut A)

returns a mutable reference to the current state and symbol as a 2-tuple

pub fn into_tuple(self) -> (State<Q>, A)

Consumes the head and returns the current state and symbol as a 2-tuple

impl<Q, A> Head<Q, A>

where Q: RawState,

pub fn append(self, tail: Tail<Q, A>) -> Rule<Q, A>

associates the given tail with the current head, returning a new Rule

pub fn read<T>(self, tape: &[T]) -> Option<&A::Output>

where A: SliceIndex<[T]>,

tries reading the given tape using the head as its coordinates.

pub const fn view(&self) -> HeadRef<'_, Q, A>

returns a new head with immutable references to the current state and symbol

pub const fn view_mut(&mut self) -> HeadMut<'_, Q, A>

returns a new head with mutable references to the current state and symbol

impl<'a, Q, S> Head<&'a Q, &'a S>

where Q: RawState,

pub fn cloned(&self) -> Head<Q, S>

where Q: Clone, S: Clone,

returns a new Head with cloned elements

pub fn copied(&self) -> Head<Q, S>

where Q: Copy, S: Copy,

returns a new Head with copied elements

impl<'a, Q, S> Head<&'a mut Q, &'a mut S>

where Q: RawState,

pub fn cloned(&self) -> Head<Q, S>

where Q: Clone, S: Clone,

returns a new Head with cloned elements

pub fn copied(&self) -> Head<Q, S>

where Q: Copy, S: Copy,

returns a new Head with copied elements

impl<Q> Head<Q, usize>

where Q: RawState,

pub fn shift(self, direction: Direction) -> Self

pub fn shift_inplace(&mut self, direction: Direction)

Trait Implementations

impl<Q, A> Add<Tail<Q, A>> for Head<Q, A>

where Q: RawState,

type Output = Rule<Q, A>

The resulting type after applying the + operator.

fn add(self, rhs: Tail<Q, A>) -> Self::Output

Performs the + operation.

impl<Q, S> AsMut<Head<Q, S>> for Rule<Q, S>

where Q: RawState,

fn as_mut(&mut self) -> &mut Head<Q, S>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<Q, S> AsRef<Head<Q, S>> for Rule<Q, S>

where Q: RawState,

fn as_ref(&self) -> &Head<Q, S>

Converts this type into a shared reference of the (usually inferred) input type.

impl<Q, S> Borrow<Head<Q, S>> for Rule<Q, S>

where Q: RawState,

fn borrow(&self) -> &Head<Q, S>

Immutably borrows from an owned value.

impl<Q, S> BorrowMut<Head<Q, S>> for Rule<Q, S>

where Q: RawState,

fn borrow_mut(&mut self) -> &mut Head<Q, S>

Mutably borrows from an owned value.

impl<Q: Clone, S: Clone> Clone for Head<Q, S>

fn clone(&self) -> Head<Q, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Q, S> Debug for Head<Q, S>

where Q: Debug, S: Debug,

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

Formats the value using the given formatter.

impl<Q: Default, S: Default> Default for Head<Q, S>

fn default() -> Head<Q, S>

Returns the “default value” for a type.

impl<'de, Q, S> Deserialize<'de> for Head<Q, S>

where Q: Deserialize<'de>, S: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Q, S> Display for Head<Q, S>

where Q: Display, S: Display,

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

Formats the value using the given formatter.

impl<Q, S> From<(Q, S)> for Head<Q, S>

where Q: RawState,

fn from((state, symbol): (Q, S)) -> Self

Converts to this type from the input type.

impl<Q, S> From<(State<Q>, S)> for Head<Q, S>

where Q: RawState,

fn from((state, symbol): (State<Q>, S)) -> Self

Converts to this type from the input type.

impl<Q, S> From<Head<Q, S>> for (State<Q>, S)

where Q: RawState,

fn from(_: Head<Q, S>) -> Self

Converts to this type from the input type.

impl<Q: Hash, S: Hash> Hash for Head<Q, S>

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<Q: Ord, S: Ord> Ord for Head<Q, S>

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

where State<Q>: PartialEq, Q: RawState + PartialEq, S: PartialEq,

fn eq(&self, (state, symbol): &(Q, S)) -> 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<Q, S> PartialEq<(State<Q>, S)> for Head<Q, S>

where Q: RawState + PartialEq, S: PartialEq,

fn eq(&self, (state, symbol): &(State<Q>, S)) -> 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<Q, S> PartialEq<Head<Q, S>> for (State<Q>, S)

where Q: RawState + PartialEq, S: PartialEq,

fn eq(&self, head: &Head<Q, S>) -> 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<Q, S> PartialEq<Head<Q, S>> for Rule<Q, S>

where Q: RawState + PartialEq, S: PartialEq,

fn eq(&self, other: &Head<Q, S>) -> 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<Q, S> PartialEq<Head<Q, S>> for State<&Q>

where Q: RawState + PartialEq,

fn eq(&self, head: &Head<Q, S>) -> 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<Q, S> PartialEq<Head<Q, S>> for State<Q>

where Q: RawState + PartialEq,

fn eq(&self, head: &Head<Q, S>) -> 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<'a, Q, S> PartialEq<State<&'a Q>> for Head<Q, S>

where Q: RawState + PartialEq,

fn eq(&self, state: &State<&'a Q>) -> 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<Q, S> PartialEq<State<Q>> for Head<Q, S>

where Q: RawState + PartialEq,

fn eq(&self, state: &State<Q>) -> 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<Q: PartialEq, S: PartialEq> PartialEq for Head<Q, S>

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

fn partial_cmp(&self, other: &Head<Q, S>) -> 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<Q, S> Scope<Q, S> for Head<Q, S>

where Q: RawState,

fn current_state(&self) -> &State<Q>

returns an immutable reference to the current state

fn current_symbol(&self) -> &S

impl<Q, S> Serialize for Head<Q, S>

where Q: Serialize, S: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<Q: Copy, S: Copy> Copy for Head<Q, S>

impl<Q: Eq, S: Eq> Eq for Head<Q, S>

impl<Q, S> StructuralPartialEq for Head<Q, S>