Safe Haskell | Safe-Infered |
---|

- data Path a
- seqList, seqList1 :: [Path a] -> Path a
- altList, altList1 :: [Path a] -> Path a
- mCombine :: Monad m => (a -> b -> c) -> m a -> m b -> m c
- (<+>), (<|>) :: Monad m => m (Path a) -> m (Path a) -> m (Path a)
- (<++>) :: Monad m => m [Path a] -> m [Path a] -> m [Path a]
- steps :: Path a -> [a]
- mapPath :: (a -> b) -> Path a -> Path b
- changeStep :: (a -> Path b) -> Path a -> Path b
- changeStepM :: Monad m => (a -> m (Path b)) -> Path a -> m (Path b)
- minCompleteInPath :: (a -> a -> Ordering) -> Path a -> Maybe a
- simplifyPath :: Path a -> Path a
- tailSharingBy :: (a -> a -> Ordering) -> Path a -> Path a
- flattenPath :: Path a -> [[a]]
- minimalSets :: (a -> a -> Bool) -> Path a -> [[a]]
- removeSomeDuplicates :: Ord b => (a -> b) -> Path a -> Path a
- participationMap :: Ord a => Path a -> (Integer, Map a Integer)
- pathSize :: Path a -> Int
- maxNumberOfEqualPaths :: Maybe Int
- reduceNumberOfPaths :: Path a -> Path a
- limitNumberOfPaths :: Int -> Path a -> Path a

# Documentation

changeStep :: (a -> Path b) -> Path a -> Path bSource

minCompleteInPath :: (a -> a -> Ordering) -> Path a -> Maybe aSource

simplifyPath :: Path a -> Path aSource

tailSharingBy :: (a -> a -> Ordering) -> Path a -> Path aSource

flattenPath :: Path a -> [[a]]Source

minimalSets :: (a -> a -> Bool) -> Path a -> [[a]]Source

removeSomeDuplicates :: Ord b => (a -> b) -> Path a -> Path aSource

maxNumberOfEqualPaths :: Maybe IntSource

The maximal number of equality paths that is returned by equalPaths (although this number can be exceeded...it is more or less used as approximation) Nothing indicates that there is no limit

reduceNumberOfPaths :: Path a -> Path aSource

limitNumberOfPaths :: Int -> Path a -> Path aSource