Data.BTree.Class

Documentation

class (Functor m, MonadIO m) => Tree m k v | m -> v, m -> k where

Methods

modify :: (v -> v -> v) -> k -> v -> m (Maybe v)

modify_ :: (v -> v -> v) -> k -> v -> m ()

modifyMany :: [(v -> v -> v, k, v)] -> m ()

delete :: k -> m (Maybe v)

delete_ :: k -> m ()

lookup :: k -> m (Maybe v)

member :: k -> m Bool

search :: ((k, k) -> Bool) -> m [(k, v)]

foldli :: (a -> k -> v -> a) -> a -> m a

toList :: m [(k, v)]

type N k v = Node k v

type R k v = Ref (N k v)

type Cp m k v = Param m (R k v) (N k v)

type S m k v = Param m (R k v) (N k v)