Fin-0.2.7.0: Finite totally-ordered sets

Safe HaskellNone
LanguageHaskell2010

Data.Fin.Permutation

Documentation

data Permutation n Source #

Instances
Eq (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Show (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Natural n => Semigroup (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Natural n => Monoid (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Natural n => Group (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Methods

invert :: Permutation n -> Permutation n #

Natural n => Universe (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Methods

universe :: [Permutation n] #

Natural n => Finite (Permutation n) Source # 
Instance details

Defined in Data.Fin.Permutation

Methods

universeF :: [Permutation n] #

apply :: Permutation n -> List n a -> List n a Source #

unapply :: Permutation n -> List n a -> List n a Source #

swap :: Natural n => Fin n -> Fin n -> Permutation n Source #

cycles :: forall n. Natural n => Permutation (Succ n) -> NonEmpty (NonEmpty (Fin (Succ n))) Source #