Fin-0.2.6.0: Finite totally-ordered sets
Data.Fin.Permutation
data Permutation n Source #
Defined in Data.Fin.Permutation
Methods
(==) :: Permutation n -> Permutation n -> Bool #
(/=) :: Permutation n -> Permutation n -> Bool #
showsPrec :: Int -> Permutation n -> ShowS #
show :: Permutation n -> String #
showList :: [Permutation n] -> ShowS #
(<>) :: Permutation n -> Permutation n -> Permutation n #
sconcat :: NonEmpty (Permutation n) -> Permutation n #
stimes :: Integral b => b -> Permutation n -> Permutation n #
mempty :: Permutation n #
mappend :: Permutation n -> Permutation n -> Permutation n #
mconcat :: [Permutation n] -> Permutation n #
invert :: Permutation n -> Permutation n #
universe :: [Permutation n] #
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 #
orbit :: Natural n => Permutation n -> Fin n -> NonEmpty (Fin n) Source #
cycles :: forall n. Natural n => Permutation (Succ n) -> NonEmpty (NonEmpty (Fin (Succ n))) Source #