Safe Haskell  SafeInferred 

Language  Haskell2010 
Synopsis
 data RuleIndex f a = RuleIndex {
 index_oriented :: !(Index f a)
 index_all :: !(Index f a)
 empty :: RuleIndex f a
 insert :: forall f a. (Symbolic a, ConstantOf a ~ f, Has a (Rule f)) => Term f > a > RuleIndex f a > RuleIndex f a
 delete :: forall f a. (Symbolic a, ConstantOf a ~ f, Eq a, Has a (Rule f)) => Term f > a > RuleIndex f a > RuleIndex f a
 matches :: 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  

insert :: forall f a. (Symbolic a, ConstantOf a ~ f, Has a (Rule f)) => Term f > a > RuleIndex f a > RuleIndex f a Source #
delete :: forall f a. (Symbolic a, ConstantOf a ~ f, Eq a, Has a (Rule f)) => Term f > a > RuleIndex f a > RuleIndex f a Source #