Copyright	Anders Claesson 2013
Maintainer	Anders Claesson <anders.claesson@gmail.com>
Safe Haskell	None
Language	Haskell98

Sym.Permgram

Contents

Description

Permutation diagrams, or permutations as monads.

Synopsis

Data types

The purpose of this data type is to assign labels to the indices of a given permutation.

A permgram consists of a permutation together with a label for each index of the permutation.

Instances

Monad Permgram Source #
Methods (>>=) :: Permgram a -> (a -> Permgram b) -> Permgram b # (>>) :: Permgram a -> Permgram b -> Permgram b # return :: a -> Permgram a # fail :: String -> Permgram a #
Functor Permgram Source #
Methods fmap :: (a -> b) -> Permgram a -> Permgram b # (<$) :: a -> Permgram b -> Permgram a #
Applicative Permgram Source #
Methods pure :: a -> Permgram a # (<>) :: Permgram (a -> b) -> Permgram a -> Permgram b # (>) :: Permgram a -> Permgram b -> Permgram b # (<*) :: Permgram a -> Permgram b -> Permgram a #
Eq a => Eq (Permgram a) Source #
Methods (==) :: Permgram a -> Permgram a -> Bool # (/=) :: Permgram a -> Permgram a -> Bool #
Ord a => Ord (Permgram a) Source #
Methods compare :: Permgram a -> Permgram a -> Ordering # (<) :: Permgram a -> Permgram a -> Bool # (<=) :: Permgram a -> Permgram a -> Bool # (>) :: Permgram a -> Permgram a -> Bool # (>=) :: Permgram a -> Permgram a -> Bool # max :: Permgram a -> Permgram a -> Permgram a # min :: Permgram a -> Permgram a -> Permgram a #
Show a => Show (Permgram a) Source #
Methods showsPrec :: Int -> Permgram a -> ShowS # show :: Permgram a -> String # showList :: [Permgram a] -> ShowS #

Accessors

The underlying permutation.

The assignment of labels to indices.

The size of a permgram is the size of the underlying permutation.

Construct a permgram from an underlying permutation and a list of labels.

The inverse permgram. It's obtained by mirroring the permgram in the x=y diagonal.