Safe Haskell | Safe-Infered |
---|
Documentation
type PathHeuristics info = Path (EdgeId, info) -> [Heuristic info]Source
Heuristic (forall m. HasTypeGraph m info => HComponent m info) |
data HComponent m info Source
getSelectorName :: (MonadWriter LogEntries m, HasTypeGraph m info) => Selector m info -> StringSource
resultsEdgeFilter :: (Eq a, Monad m) => ([a] -> a) -> String -> ((EdgeId, info) -> m a) -> HComponent m infoSource
maximalEdgeFilter :: (Ord a, Monad m) => String -> ((EdgeId, info) -> m a) -> HComponent m infoSource
minimalEdgeFilter :: (Ord a, Monad m) => String -> ((EdgeId, info) -> m a) -> HComponent m infoSource
edgeFilter :: Monad m => String -> ((EdgeId, info) -> m Bool) -> HComponent m infoSource
doWithoutEdges :: HasTypeGraph m info => [(EdgeId, info)] -> m result -> m resultSource
doWithoutEdge :: HasTypeGraph m info => (EdgeId, info) -> m result -> m resultSource
info2ToEdgeNr :: (EdgeId, info) -> EdgeNrSource
class HasTwoTypes a whereSource
getTwoTypes :: a -> (Tp, Tp)Source
getSubstitutedTypes :: (HasTypeGraph m info, HasTwoTypes info) => info -> m (Maybe Tp, Maybe Tp)Source