Safe Haskell	Safe
Language	Haskell2010

Math.Combinat.Classes

Contents

Partitions
Tableau
Trees
Permutations

Description

Type classes for some common properties shared by different objects

Synopsis

class CanBeEmpty a where
class HasNumberOfParts a where
class HasWidth a where
class HasHeight a where
class HasWeight a where
class HasDuality a where
class HasShape a s | a -> s where
class HasNumberOfNodes t where
class HasNumberOfLeaves t where
class HasNumberOfCycles p where

Documentation

class CanBeEmpty a where Source #

Emptyness

Minimal complete definition

isEmpty, empty

Methods

isEmpty :: a -> Bool Source #

empty :: a Source #

Instances

CanBeEmpty Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods isEmpty :: Partition -> Bool Source # empty :: Partition Source #
CanBeEmpty PlanePart Source #
Instance details Defined in Math.Combinat.Partitions.Plane Methods isEmpty :: PlanePart -> Bool Source # empty :: PlanePart Source #
CanBeEmpty (Tableau a) Source #
Instance details Defined in Math.Combinat.Tableaux Methods isEmpty :: Tableau a -> Bool Source # empty :: Tableau a Source #

Partitions

class HasNumberOfParts a where Source #

Number of parts

Minimal complete definition

numberOfParts

Methods

numberOfParts :: a -> Int Source #

Instances

HasNumberOfParts Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods numberOfParts :: Partition -> Int Source #
HasNumberOfParts SetPartition Source #
Instance details Defined in Math.Combinat.Partitions.Set Methods numberOfParts :: SetPartition -> Int Source #
HasNumberOfParts NonCrossing Source #
Instance details Defined in Math.Combinat.Partitions.NonCrossing Methods numberOfParts :: NonCrossing -> Int Source #

class HasWidth a where Source #

Minimal complete definition

width

Methods

width :: a -> Int Source #

Instances

HasWidth Permutation Source #
Instance details Defined in Math.Combinat.Permutations Methods width :: Permutation -> Int Source #
HasWidth Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods width :: Partition -> Int Source #
HasWidth LatticePath Source #
Instance details Defined in Math.Combinat.LatticePaths Methods width :: LatticePath -> Int Source #
HasWidth TDiag Source #
Instance details Defined in Math.Combinat.Groups.Thompson.F Methods width :: TDiag -> Int Source #
HasWidth (Tree a) Source #
Instance details Defined in Math.Combinat.Groups.Thompson.F Methods width :: Tree a -> Int Source #

class HasHeight a where Source #

Minimal complete definition

height

Methods

height :: a -> Int Source #

Instances

HasHeight Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods height :: Partition -> Int Source #
HasHeight LatticePath Source #
Instance details Defined in Math.Combinat.LatticePaths Methods height :: LatticePath -> Int Source #

class HasWeight a where Source #

Weight (of partitions, tableaux, etc)

Minimal complete definition

weight

Methods

weight :: a -> Int Source #

Instances

HasWeight Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods weight :: Partition -> Int Source #
HasWeight SkewPartition Source #
Instance details Defined in Math.Combinat.Partitions.Skew Methods weight :: SkewPartition -> Int Source #
HasWeight PlanePart Source #
Instance details Defined in Math.Combinat.Partitions.Plane Methods weight :: PlanePart -> Int Source #
HasWeight (Tableau a) Source #
Instance details Defined in Math.Combinat.Tableaux Methods weight :: Tableau a -> Int Source #
HasWeight (SkewTableau a) Source #
Instance details Defined in Math.Combinat.Tableaux.Skew Methods weight :: SkewTableau a -> Int Source #

class HasDuality a where Source #

Duality (of partitions, tableaux, etc)

Minimal complete definition

dual

Methods

dual :: a -> a Source #

Instances

HasDuality Partition Source #
Instance details Defined in Math.Combinat.Partitions.Integer.Naive Methods dual :: Partition -> Partition Source #
HasDuality SkewPartition Source #
Instance details Defined in Math.Combinat.Partitions.Skew Methods dual :: SkewPartition -> SkewPartition Source #
HasDuality (Tableau a) Source #
Instance details Defined in Math.Combinat.Tableaux Methods dual :: Tableau a -> Tableau a Source #
HasDuality (SkewTableau a) Source #
Instance details 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)

Minimal complete definition

shape

Methods

shape :: a -> s Source #

Instances

HasShape (Tableau a) Partition Source #
Instance details Defined in Math.Combinat.Tableaux Methods shape :: Tableau a -> Partition Source #
HasShape (SkewTableau a) SkewPartition Source #
Instance details Defined in Math.Combinat.Tableaux.Skew Methods shape :: SkewTableau a -> SkewPartition Source #

Trees

class HasNumberOfNodes t where Source #

Number of nodes (of trees)

Minimal complete definition

numberOfNodes

Methods

numberOfNodes :: t -> Int Source #

Instances

HasNumberOfNodes (Tree a) Source #
Instance details Defined in Math.Combinat.Trees.Nary Methods numberOfNodes :: Tree a -> Int Source #
HasNumberOfNodes (BinTree a) Source #
Instance details Defined in Math.Combinat.Trees.Binary Methods numberOfNodes :: BinTree a -> Int Source #
HasNumberOfNodes (BinTree' a b) Source #
Instance details Defined in Math.Combinat.Trees.Binary Methods numberOfNodes :: BinTree' a b -> Int Source #

class HasNumberOfLeaves t where Source #

Number of leaves (of trees)

Minimal complete definition

numberOfLeaves

Methods

numberOfLeaves :: t -> Int Source #

Instances

HasNumberOfLeaves (Tree a) Source #
Instance details Defined in Math.Combinat.Trees.Nary Methods numberOfLeaves :: Tree a -> Int Source #
HasNumberOfLeaves (BinTree a) Source #
Instance details Defined in Math.Combinat.Trees.Binary Methods numberOfLeaves :: BinTree a -> Int Source #
HasNumberOfLeaves (Tree a) Source #
Instance details Defined in Math.Combinat.Groups.Thompson.F Methods numberOfLeaves :: Tree a -> Int Source #
HasNumberOfLeaves (BinTree' a b) Source #
Instance details Defined in Math.Combinat.Trees.Binary Methods numberOfLeaves :: BinTree' a b -> Int Source #

Permutations

class HasNumberOfCycles p where Source #

Number of cycles (of partitions)

Minimal complete definition

numberOfCycles

Methods

numberOfCycles :: p -> Int Source #

Instances

HasNumberOfCycles DisjointCycles Source #
Instance details Defined in Math.Combinat.Permutations Methods numberOfCycles :: DisjointCycles -> Int Source #
HasNumberOfCycles Permutation Source #
Instance details Defined in Math.Combinat.Permutations Methods numberOfCycles :: Permutation -> Int Source #