competitive::data_structure

Struct IntersectionTransducer

Source 
pub struct IntersectionTransducer<Tuple>(pub Tuple);

Tuple Fields§

§0: Tuple

Trait Implementations§

Source§

impl<Tuple: Clone> Clone for IntersectionTransducer<Tuple>

Source§

fn clone(&self) -> IntersectionTransducer<Tuple>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<Tuple: Debug> Debug for IntersectionTransducer<Tuple>

Source§

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

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

impl<A, T0> Transducer for IntersectionTransducer<(T0,)>
where T0: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output,)

Source§

type State = (<T0 as Transducer>::State,)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1> Transducer for IntersectionTransducer<(T0, T1)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2> Transducer for IntersectionTransducer<(T0, T1, T2)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3> Transducer for IntersectionTransducer<(T0, T1, T2, T3)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4, T5> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4, T5)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>, T5: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output, <T5 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State, <T5 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4, T5, T6> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4, T5, T6)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>, T5: Transducer<Input = A>, T6: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output, <T5 as Transducer>::Output, <T6 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State, <T5 as Transducer>::State, <T6 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4, T5, T6, T7> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4, T5, T6, T7)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>, T5: Transducer<Input = A>, T6: Transducer<Input = A>, T7: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output, <T5 as Transducer>::Output, <T6 as Transducer>::Output, <T7 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State, <T5 as Transducer>::State, <T6 as Transducer>::State, <T7 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4, T5, T6, T7, T8> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4, T5, T6, T7, T8)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>, T5: Transducer<Input = A>, T6: Transducer<Input = A>, T7: Transducer<Input = A>, T8: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output, <T5 as Transducer>::Output, <T6 as Transducer>::Output, <T7 as Transducer>::Output, <T8 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State, <T5 as Transducer>::State, <T6 as Transducer>::State, <T7 as Transducer>::State, <T8 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Source§

impl<A, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Transducer for IntersectionTransducer<(T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)>
where T0: Transducer<Input = A>, T1: Transducer<Input = A>, T2: Transducer<Input = A>, T3: Transducer<Input = A>, T4: Transducer<Input = A>, T5: Transducer<Input = A>, T6: Transducer<Input = A>, T7: Transducer<Input = A>, T8: Transducer<Input = A>, T9: Transducer<Input = A>,

Source§

type Input = A

Source§

type Output = (<T0 as Transducer>::Output, <T1 as Transducer>::Output, <T2 as Transducer>::Output, <T3 as Transducer>::Output, <T4 as Transducer>::Output, <T5 as Transducer>::Output, <T6 as Transducer>::Output, <T7 as Transducer>::Output, <T8 as Transducer>::Output, <T9 as Transducer>::Output)

Source§

type State = (<T0 as Transducer>::State, <T1 as Transducer>::State, <T2 as Transducer>::State, <T3 as Transducer>::State, <T4 as Transducer>::State, <T5 as Transducer>::State, <T6 as Transducer>::State, <T7 as Transducer>::State, <T8 as Transducer>::State, <T9 as Transducer>::State)

Source§

fn start(&self) -> Self::State

Source§

fn relation( &self, state: &Self::State, input: &Self::Input, ) -> Option<(Self::State, Self::Output)>

Source§

fn accept(&self, state: &Self::State) -> bool

Source§

fn stepout(&mut self)

Source§

fn dp<M>(self, init: M::T) -> InitTransducerDp<M, Self>
where Self: Sized, M: Monoid,

Source§

fn intersection<U>(self, other: U) -> IntersectionTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Input>,

Source§

fn product<U>(self, other: U) -> ProductTransducer<(Self, U)>
where Self: Sized, U: Transducer,

Source§

fn chain<U>(self, other: U) -> ChainTransducer<(Self, U)>
where Self: Sized, U: Transducer<Input = Self::Output>,

Source§

fn with_input( self, ) -> IntersectionTransducer<(Self, IdentityTransducer<Self::Input>)>
where Self: Sized,

Source§

fn map<U, F>( self, f: F, ) -> ChainTransducer<(Self, MapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> U,

Source§

fn filter_map<U, F>( self, f: F, ) -> ChainTransducer<(Self, FilterMapTransducer<Self::Output, U, F>)>
where Self: Sized, F: Fn(&Self::Output) -> Option<U>,

Auto Trait Implementations§

§

impl<Tuple> Freeze for IntersectionTransducer<Tuple>
where Tuple: Freeze,

§

impl<Tuple> RefUnwindSafe for IntersectionTransducer<Tuple>
where Tuple: RefUnwindSafe,

§

impl<Tuple> Send for IntersectionTransducer<Tuple>
where Tuple: Send,

§

impl<Tuple> Sync for IntersectionTransducer<Tuple>
where Tuple: Sync,

§

impl<Tuple> Unpin for IntersectionTransducer<Tuple>
where Tuple: Unpin,

§

impl<Tuple> UnwindSafe for IntersectionTransducer<Tuple>
where Tuple: 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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

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>,

Source§

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.