MultisetOrdering

Documentation

data Replace a

Constructors

ReplaceOne a a

Replace a [a]

Instances

Show a => Show (Replace a)

Defined in MultisetOrdering

Methods

showsPrec :: Int -> Replace a -> ShowS

show :: Replace a -> String

showList :: [Replace a] -> ShowS

newtype MultisetGE a

Constructors

MultisetGE [Replace a]

Instances

Show a => Show (MultisetGE a)

Defined in MultisetOrdering

Methods

showsPrec :: Int -> MultisetGE a -> ShowS

show :: MultisetGE a -> String

showList :: [MultisetGE a] -> ShowS

type GTE a = a -> a -> Bool

type Indexed a = (a, Int)

type IndexedMultisetPair a = (Indexed (MultiSet (Indexed a)), Indexed (MultiSet (Indexed a)))

multisetGE :: forall a. Eq a => GTE a -> MultiSet a -> MultiSet a -> Maybe (MultisetGE a)

multisetOrd :: (Eq a, Hashable a, Ord a) => [a] -> [a] -> Maybe (MultisetGE a)

zindex :: [a] -> [(a, Int)]

indexMS :: (Eq a, Hashable a) => MultiSet a -> MultiSet (a, Int)

mkEdge :: NodeID -> NodeID -> Edge

botNodeName :: Int -> Int -> String

botNode :: Int -> Int -> Node

toGraph' :: forall a. (Eq a, Hashable a, Show a) => GTE a -> [MultiSet a] -> DiGraph

toGraph :: (Ord a, Eq a, Hashable a, Show a) => [[a]] -> DiGraph

mkMSOGraph :: (Ord a, Eq a, Hashable a, Show a) => String -> [[a]] -> IO ()

mkMSOGraphs :: (Ord a, Eq a, Hashable a, Show a) => String -> [[a]] -> IO ()

multisetGE' :: (Ord a, Hashable a) => [a] -> [a] -> Maybe (MultisetGE a)