| Safe Haskell | None |
|---|
Helium.StaticAnalysis.Heuristics.RepairHeuristics
Description
Documentation
siblingFunctions :: (MaybeImported info, HasTwoTypes info, WithHints info, HasTypeGraph m info) => Siblings -> Selector m infoSource
siblingLiterals :: (HasTypeGraph m info, MaybeLiteral info, HasTwoTypes info, WithHints info) => Selector m infoSource
similarNegation :: (HasTypeGraph m info, MaybeNegation info, HasTwoTypes info, WithHints info) => Selector m infoSource
applicationHeuristic :: (HasTypeGraph m info, MaybeApplication info, IsPattern info, HasTwoTypes info, WithHints info) => Selector m infoSource
tupleHeuristic :: (HasTypeGraph m info, IsTupleEdge info, HasTwoTypes info, WithHints info) => Selector m infoSource
class IsFunctionBinding a whereSource
Instances
fbHasTooManyArguments :: (HasTypeGraph m info, IsFunctionBinding info, HasTwoTypes info, WithHints info) => Selector m infoSource
class IsExprVariable a whereSource
Instances
variableFunction :: (HasTypeGraph m info, IsExprVariable info, MaybeApplication info, HasTwoTypes info, WithHints info) => Selector m infoSource
class MaybeUnaryMinus a whereSource
Instances
unaryMinus :: (HasTypeGraph m info, MaybeApplication info, MaybeUnaryMinus info, HasTwoTypes info, WithHints info) => Bool -> Selector m infoSource
zipWithHoles :: [a] -> [b] -> [([Int], [(a, b)])]Source
type Permutation = [Int]Source
deleteIndex :: Int -> [a] -> [a]Source
permute :: Permutation -> [a] -> [a]Source
Methods
addHint :: String -> String -> a -> aSource
typeErrorForTerm :: (Bool, Bool) -> Int -> OneLineTree -> (Tp, Tp) -> Range -> a -> aSource
Instances
possibleHint :: WithHints a => String -> a -> aSource
becauseHint :: WithHints a => String -> a -> aSource
unifiableInContext :: ClassEnvironment -> OrderedTypeSynonyms -> [Maybe Predicate] -> Tp -> Tp -> BoolSource
allSubstPredicates :: HasTypeGraph m info => m [Maybe Predicate]Source
predicatesFit :: HasTypeGraph m info => Predicates -> m BoolSource
predicateFits :: HasTypeGraph m info => Predicate -> m BoolSource