Top.Implementation.TypeGraph.Path

Description

Synopsis

• data Path a
  • = (Path a) :|: (Path a)
  • | (Path a) :+: (Path a)
  • | Step a
  • | Fail
  • | Empty
• 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