Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Math.Combinat.Classes
Description
Type classes for some common properties shared by different objects
Synopsis
- class CanBeEmpty a where
- class HasNumberOfParts a where
- numberOfParts :: a -> Int
- class HasWidth a where
- class HasHeight a where
- class HasWeight a where
- class HasDuality a where
- dual :: a -> a
- class HasShape a s | a -> s where
- shape :: a -> s
- class HasNumberOfNodes t where
- numberOfNodes :: t -> Int
- class HasNumberOfLeaves t where
- numberOfLeaves :: t -> Int
- class HasNumberOfCycles p where
- numberOfCycles :: p -> Int
Documentation
class CanBeEmpty a where Source #
Emptyness
Instances
Partitions
class HasNumberOfParts a where Source #
Number of parts
Methods
numberOfParts :: a -> Int Source #
Instances
HasNumberOfParts Partition Source # | |
Defined in Math.Combinat.Partitions.Integer.Naive Methods numberOfParts :: Partition -> Int Source # | |
HasNumberOfParts NonCrossing Source # | |
Defined in Math.Combinat.Partitions.NonCrossing Methods numberOfParts :: NonCrossing -> Int Source # | |
HasNumberOfParts SetPartition Source # | |
Defined in Math.Combinat.Partitions.Set Methods numberOfParts :: SetPartition -> Int Source # |
class HasWidth a where Source #
Instances
HasWidth TDiag Source # | |
HasWidth LatticePath Source # | |
Defined in Math.Combinat.LatticePaths Methods width :: LatticePath -> Int Source # | |
HasWidth Partition Source # | |
HasWidth Permutation Source # | |
Defined in Math.Combinat.Permutations Methods width :: Permutation -> Int Source # | |
HasWidth (Tree a) Source # | |
class HasHeight a where Source #
Instances
HasHeight LatticePath Source # | |
Defined in Math.Combinat.LatticePaths Methods height :: LatticePath -> Int Source # | |
HasHeight Partition Source # | |
class HasWeight a where Source #
Weight (of partitions, tableaux, etc)
Instances
HasWeight Partition Source # | |
HasWeight PlanePart Source # | |
HasWeight SkewPartition Source # | |
Defined in Math.Combinat.Partitions.Skew Methods weight :: SkewPartition -> Int Source # | |
HasWeight (Tableau a) Source # | |
HasWeight (SkewTableau a) Source # | |
Defined in Math.Combinat.Tableaux.Skew Methods weight :: SkewTableau a -> Int Source # |
class HasDuality a where Source #
Duality (of partitions, tableaux, etc)
Instances
HasDuality Partition Source # | |
HasDuality SkewPartition Source # | |
Defined in Math.Combinat.Partitions.Skew Methods dual :: SkewPartition -> SkewPartition Source # | |
HasDuality (Tableau a) Source # | |
HasDuality (SkewTableau a) Source # | |
Defined in Math.Combinat.Tableaux.Skew Methods dual :: SkewTableau a -> SkewTableau a Source # |
Tableau
class HasShape a s | a -> s where Source #
Shape (of tableaux, skew tableaux)
Instances
HasShape (Tableau a) Partition Source # | |
HasShape (SkewTableau a) SkewPartition Source # | |
Defined in Math.Combinat.Tableaux.Skew Methods shape :: SkewTableau a -> SkewPartition Source # |
Trees
class HasNumberOfNodes t where Source #
Number of nodes (of trees)
Methods
numberOfNodes :: t -> Int Source #
Instances
HasNumberOfNodes (BinTree a) Source # | |
Defined in Math.Combinat.Trees.Binary Methods numberOfNodes :: BinTree a -> Int Source # | |
HasNumberOfNodes (Tree a) Source # | |
Defined in Math.Combinat.Trees.Nary Methods numberOfNodes :: Tree a -> Int Source # | |
HasNumberOfNodes (BinTree' a b) Source # | |
Defined in Math.Combinat.Trees.Binary Methods numberOfNodes :: BinTree' a b -> Int Source # |
class HasNumberOfLeaves t where Source #
Number of leaves (of trees)
Methods
numberOfLeaves :: t -> Int Source #
Instances
HasNumberOfLeaves (Tree a) Source # | |
Defined in Math.Combinat.Groups.Thompson.F Methods numberOfLeaves :: Tree a -> Int Source # | |
HasNumberOfLeaves (BinTree a) Source # | |
Defined in Math.Combinat.Trees.Binary Methods numberOfLeaves :: BinTree a -> Int Source # | |
HasNumberOfLeaves (Tree a) Source # | |
Defined in Math.Combinat.Trees.Nary Methods numberOfLeaves :: Tree a -> Int Source # | |
HasNumberOfLeaves (BinTree' a b) Source # | |
Defined in Math.Combinat.Trees.Binary Methods numberOfLeaves :: BinTree' a b -> Int Source # |
Permutations
class HasNumberOfCycles p where Source #
Number of cycles (of partitions)
Methods
numberOfCycles :: p -> Int Source #
Instances
HasNumberOfCycles DisjointCycles Source # | |
Defined in Math.Combinat.Permutations Methods numberOfCycles :: DisjointCycles -> Int Source # | |
HasNumberOfCycles Permutation Source # | |
Defined in Math.Combinat.Permutations Methods numberOfCycles :: Permutation -> Int Source # |