Top.Implementation.TypeGraph.Heuristic

Documentation

type PathHeuristics info = Path (EdgeId, info) -> [Heuristic info]

newtype Heuristic info

Constructors

Heuristic (forall m. HasTypeGraph m info => HComponent m info)

data Selector m info

Constructors

Selector (String, (EdgeId, info) -> m (Maybe (Int, String, [EdgeId], info)))

SelectorList (String, [(EdgeId, info)] -> m (Maybe (Int, String, [EdgeId], info)))

data HComponent m info

Constructors

Filter String ([(EdgeId, info)] -> m [(EdgeId, info)])

Voting [Selector m info]

getSelectorName :: (MonadWriter LogEntries m, HasTypeGraph m info) => Selector m info -> String

resultsEdgeFilter :: (Eq a, Monad m) => ([a] -> a) -> String -> ((EdgeId, info) -> m a) -> HComponent m info

maximalEdgeFilter :: (Ord a, Monad m) => String -> ((EdgeId, info) -> m a) -> HComponent m info

minimalEdgeFilter :: (Ord a, Monad m) => String -> ((EdgeId, info) -> m a) -> HComponent m info

edgeFilter :: Monad m => String -> ((EdgeId, info) -> m Bool) -> HComponent m info

doWithoutEdges :: HasTypeGraph m info => [(EdgeId, info)] -> m result -> m result

doWithoutEdge :: HasTypeGraph m info => (EdgeId, info) -> m result -> m result

eqInfo2 :: (EdgeId, info) -> (EdgeId, info) -> Bool

info2ToEdgeNr :: (EdgeId, info) -> EdgeNr

class HasTwoTypes a where

Methods

getTwoTypes :: a -> (Tp, Tp)

getSubstitutedTypes :: (HasTypeGraph m info, HasTwoTypes info) => info -> m (Maybe Tp, Maybe Tp)