[][src]Struct free_algebra::FreePow

pub struct FreePow<C: Eq, P>(pub C, pub P);

Represents a free symbol raised to some power

This is used in FreePowMonoid mainly as a way to compress the size-footprint of a FreeMonoid by combining repeated elements under an integral exponent, but the option for more exotic exponents is also available

Trait Implementations

impl<C: Eq, P: Add<Output = P>> MonoidRule<FreePow<C, P>> for PowRule[src]

impl<C: Eq, P: Add<Output = P> + Neg<Output = P> + Zero> InvMonoidRule<FreePow<C, P>> for PowRule[src]

impl<C: Eq, P: Add<Output = P> + AddAssociative> AssociativeMonoidRule<FreePow<C, P>> for PowRule[src]

impl<C: Eq, P: One + Neg<Output = P>> From<FreeInv<C>> for FreePow<C, P>[src]

impl<C: Eq, P: One> From<C> for FreePow<C, P>[src]

impl<C: Eq, P> From<(C, P)> for FreePow<C, P>[src]

impl<C: Eq, P> Clone for FreePow<C, P> where
    C: Clone,
    P: Clone
[src]

impl<C: Eq, P> Copy for FreePow<C, P> where
    C: Copy,
    P: Copy
[src]

impl<C: Eq, P> Eq for FreePow<C, P> where
    C: Eq,
    P: Eq
[src]

impl<C: Eq, P> PartialEq<FreePow<C, P>> for FreePow<C, P> where
    C: PartialEq,
    P: PartialEq
[src]

impl<C: Eq + Display, P: Display> Display for FreePow<C, P>[src]

impl<C: Eq, P> Debug for FreePow<C, P> where
    C: Debug,
    P: Debug
[src]

impl<C: Eq, P: Add<Output = P> + Neg<Output = P> + Zero> Div<FreePow<C, P>> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the / operator.

impl<C: Eq, P: Add<Output = P> + One + Neg<Output = P> + Zero> Div<C> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the / operator.

impl<C: Eq, P: Add<Output = P> + Neg<Output = P> + Zero> Div<MonoidalString<FreePow<C, P>, PowRule>> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the / operator.

impl<C: Eq, P: Add<Output = P>> Mul<FreePow<C, P>> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the * operator.

impl<C: Eq, P: Add<Output = P> + One> Mul<C> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the * operator.

impl<C: Eq, P: Add<Output = P>> Mul<MonoidalString<FreePow<C, P>, PowRule>> for FreePow<C, P>[src]

type Output = FreePowMonoid<C, P>

The resulting type after applying the * operator.

impl<C: Eq, P> Hash for FreePow<C, P> where
    C: Hash,
    P: Hash
[src]

impl<C: Eq, P: Neg<Output = P>> Inv for FreePow<C, P>[src]

type Output = Self

The result after applying the operator.

impl<C: Eq, P: Mul<Output = P>> Pow<P> for FreePow<C, P>[src]

type Output = FreePow<C, P>

The result after applying the operator.

Auto Trait Implementations

impl<C, P> Send for FreePow<C, P> where
    C: Send,
    P: Send

impl<C, P> Sync for FreePow<C, P> where
    C: Sync,
    P: Sync

impl<C, P> Unpin for FreePow<C, P> where
    C: Unpin,
    P: Unpin

impl<C, P> UnwindSafe for FreePow<C, P> where
    C: UnwindSafe,
    P: UnwindSafe

impl<C, P> RefUnwindSafe for FreePow<C, P> where
    C: RefUnwindSafe,
    P: RefUnwindSafe

Blanket Implementations

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> From<T> for T[src]

impl<T> From<!> for T[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T> ToString for T where
    T: Display + ?Sized
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]