Math.Combinat.Classes

Type classes for some common properties shared by different objects

Documentation

class CanBeEmpty a where

Emptyness

Methods

isEmpty :: a -> Bool

empty :: a

Instances

CanBeEmpty Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

isEmpty :: Partition -> Bool

empty :: Partition

CanBeEmpty PlanePart

Defined in Math.Combinat.Partitions.Plane

Methods

isEmpty :: PlanePart -> Bool

empty :: PlanePart

CanBeEmpty (Tableau a)

Defined in Math.Combinat.Tableaux

Methods

isEmpty :: Tableau a -> Bool

empty :: Tableau a

Partitions

class HasNumberOfParts a where

Number of parts

Methods

numberOfParts :: a -> Int

Instances

HasNumberOfParts Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

numberOfParts :: Partition -> Int

HasNumberOfParts SetPartition

Defined in Math.Combinat.Partitions.Set

Methods

numberOfParts :: SetPartition -> Int

HasNumberOfParts NonCrossing

Defined in Math.Combinat.Partitions.NonCrossing

Methods

numberOfParts :: NonCrossing -> Int

class HasWidth a where

Methods

width :: a -> Int

Instances

HasWidth TDiag

Defined in Math.Combinat.Groups.Thompson.F

Methods

width :: TDiag -> Int

HasWidth Permutation

Defined in Math.Combinat.Permutations

Methods

width :: Permutation -> Int

HasWidth Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

width :: Partition -> Int

HasWidth LatticePath

Defined in Math.Combinat.LatticePaths

Methods

width :: LatticePath -> Int

HasWidth (Tree a)

Defined in Math.Combinat.Groups.Thompson.F

Methods

width :: Tree a -> Int

class HasHeight a where

Methods

height :: a -> Int

Instances

HasHeight Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

height :: Partition -> Int

HasHeight LatticePath

Defined in Math.Combinat.LatticePaths

Methods

height :: LatticePath -> Int

class HasWeight a where

Weight (of partitions, tableaux, etc)

Methods

weight :: a -> Int

Instances

HasWeight Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

weight :: Partition -> Int

HasWeight SkewPartition

Defined in Math.Combinat.Partitions.Skew

Methods

weight :: SkewPartition -> Int

HasWeight PlanePart

Defined in Math.Combinat.Partitions.Plane

Methods

weight :: PlanePart -> Int

HasWeight (Tableau a)

Defined in Math.Combinat.Tableaux

Methods

weight :: Tableau a -> Int

HasWeight (SkewTableau a)

Defined in Math.Combinat.Tableaux.Skew

Methods

weight :: SkewTableau a -> Int

class HasDuality a where

Duality (of partitions, tableaux, etc)

Methods

dual :: a -> a

Instances

HasDuality Partition

Defined in Math.Combinat.Partitions.Integer.Naive

Methods

dual :: Partition -> Partition

HasDuality SkewPartition

Defined in Math.Combinat.Partitions.Skew

Methods

dual :: SkewPartition -> SkewPartition

HasDuality (Tableau a)

Defined in Math.Combinat.Tableaux

Methods

dual :: Tableau a -> Tableau a

HasDuality (SkewTableau a)

Defined in Math.Combinat.Tableaux.Skew

Methods

dual :: SkewTableau a -> SkewTableau a

Tableau

class HasShape a s | a -> s where

Shape (of tableaux, skew tableaux)

Methods

shape :: a -> s

Instances

HasShape (Tableau a) Partition

Defined in Math.Combinat.Tableaux

Methods

shape :: Tableau a -> Partition

HasShape (SkewTableau a) SkewPartition

Defined in Math.Combinat.Tableaux.Skew

Methods

shape :: SkewTableau a -> SkewPartition

Trees

class HasNumberOfNodes t where

Number of nodes (of trees)

Methods

numberOfNodes :: t -> Int

Instances

HasNumberOfNodes (Tree a)

Defined in Math.Combinat.Trees.Nary

Methods

numberOfNodes :: Tree a -> Int

HasNumberOfNodes (BinTree a)

Defined in Math.Combinat.Trees.Binary

Methods

numberOfNodes :: BinTree a -> Int

HasNumberOfNodes (BinTree' a b)

Defined in Math.Combinat.Trees.Binary

Methods

numberOfNodes :: BinTree' a b -> Int

class HasNumberOfLeaves t where

Number of leaves (of trees)

Methods

numberOfLeaves :: t -> Int

Instances

HasNumberOfLeaves (Tree a)

Defined in Math.Combinat.Trees.Nary

Methods

numberOfLeaves :: Tree a -> Int

HasNumberOfLeaves (BinTree a)

Defined in Math.Combinat.Trees.Binary

Methods

numberOfLeaves :: BinTree a -> Int

HasNumberOfLeaves (Tree a)

Defined in Math.Combinat.Groups.Thompson.F

Methods

numberOfLeaves :: Tree a -> Int

HasNumberOfLeaves (BinTree' a b)

Defined in Math.Combinat.Trees.Binary

Methods

numberOfLeaves :: BinTree' a b -> Int

Permutations

class HasNumberOfCycles p where

Number of cycles (of partitions)

Methods

numberOfCycles :: p -> Int

Instances

HasNumberOfCycles DisjointCycles

Defined in Math.Combinat.Permutations

Methods

numberOfCycles :: DisjointCycles -> Int

HasNumberOfCycles Permutation

Defined in Math.Combinat.Permutations

Methods

numberOfCycles :: Permutation -> Int