Copyright | (c) Lars Petersen 2016 |
---|---|
License | MIT |
Maintainer | info@lars-petersen.net |
Stability | experimental |
Safe Haskell | None |
Language | Haskell2010 |
- newtype RetainedStore = RetainedStore {}
- newtype RetainedTree = RetainedTree {}
- data RetainedNode = RetainedNode !RetainedTree !(Maybe Message)
- new :: IO RetainedStore
- store :: Message -> RetainedStore -> IO ()
- retrieve :: Filter -> RetainedStore -> IO (Set Message)
- empty :: RetainedTree
- null :: RetainedTree -> Bool
- insert :: Message -> RetainedTree -> RetainedTree
- delete :: Message -> RetainedTree -> RetainedTree
- singleton :: Message -> RetainedTree
- union :: RetainedTree -> RetainedTree -> RetainedTree
- difference :: RetainedTree -> RetainedTree -> RetainedTree
- lookupFilter :: Filter -> RetainedTree -> Set Message
Documentation
newtype RetainedStore Source #
newtype RetainedTree Source #
data RetainedNode Source #
new :: IO RetainedStore Source #
empty :: RetainedTree Source #
null :: RetainedTree -> Bool Source #
insert :: Message -> RetainedTree -> RetainedTree Source #
delete :: Message -> RetainedTree -> RetainedTree Source #
singleton :: Message -> RetainedTree Source #
union :: RetainedTree -> RetainedTree -> RetainedTree Source #
The expression `union t1 t2` takes the left-biased union of t1
and t2
.
difference :: RetainedTree -> RetainedTree -> RetainedTree Source #
lookupFilter :: Filter -> RetainedTree -> Set Message Source #