StrategyLibContentsIndex
ContainerTheme
Synopsis
modify :: Eq x => (x -> y) -> x -> y -> x -> y
modifyTP :: (MonadPlus m, Eq t, Term t) => TP m -> t -> m t -> TP m
modifyTU :: (MonadPlus m, Eq t, Term t) => TU a m -> t -> m a -> TU a m
type GSet = TU () Maybe
emptyGSet :: GSet
fullGSet :: GSet
addGSet :: (Eq t, Term t) => t -> GSet -> GSet
removeGSet :: (Eq t, Term t) => t -> GSet -> GSet
containsGSet :: (Eq t, Term t) => t -> GSet -> Bool
type GMap value = TU value Maybe
emptyGMap :: GMap v
removeGMap :: (Eq t, Term t) => t -> GMap v -> GMap v
containsGMap :: (Eq t, Term t) => t -> GMap v -> Bool
putGMap :: (Eq t, Term t) => t -> v -> GMap v -> GMap v
getGMap :: (Eq t, Term t) => t -> GMap v -> Maybe v
type GList = (Integer -> TP Maybe, Integer)
emptyGList :: GList
addGList :: Term t => t -> GList -> GList
putGList :: Term t => Integer -> t -> GList -> GList
getGList :: Term t => Integer -> GList -> Maybe t
mapGListTP :: TP Maybe -> GList -> GList
mapGListTU :: Term t => (t -> ()) -> TU a Maybe -> GList -> [Maybe a]
elemsGList :: Term t => (t -> ()) -> GList -> [t]
nth :: [a] -> Integer -> a
type Coder = (Int, TU Int Maybe)
noCode :: Coder
getCode :: Term x => Coder -> x -> Maybe Int
setCode :: (Term x, Eq x) => Coder -> x -> Int -> Coder
nextCode :: Coder -> (Int, Coder)
enCode :: (Term x, Eq x) => Coder -> x -> Coder
Produced by Haddock version 0.6