Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data RuleIndex f a = RuleIndex {
- index_oriented :: !(Index f a)
- index_weak :: !(Index f a)
- index_all :: !(Index f a)
- empty :: RuleIndex f a
- insert :: forall f a. Has a (Rule f) => Term f -> a -> RuleIndex f a -> RuleIndex f a
- delete :: forall f a. (Eq a, Has a (Rule f)) => Term f -> a -> RuleIndex f a -> RuleIndex f a
- approxMatches :: Term f -> Index f a -> [a]
- matches :: Has a (Term f) => Term f -> Index f a -> [(Subst f, a)]
- lookup :: (Has a b, Symbolic b, Has b (TermOf b)) => TermOf b -> Index (ConstantOf b) a -> [b]
Documentation
RuleIndex | |
|
delete :: forall f a. (Eq a, Has a (Rule f)) => Term f -> a -> RuleIndex f a -> RuleIndex f a Source #
approxMatches :: Term f -> Index f a -> [a] Source #
Look up a term in the index, possibly returning spurious extra results.