| Portability | DeriveFunctor, DeriveFoldable, DeriveTraversable, FlexibleInstances, MultiParamTypeClasses |
|---|---|
| Stability | experimental |
| Maintainer | Douglas Burke |
Swish.RDF.GraphMem
Description
This module defines a simple memory-based graph instance.
- data GraphMem lb = GraphMem {}
- setArcs :: LDGraph lg lb => [Arc lb] -> lg lb -> lg lb
- getArcs :: LDGraph lg lb => lg lb -> [Arc lb]
- add :: LDGraph lg lb => lg lb -> lg lb -> lg lb
- delete :: LDGraph lg lb => lg lb -> lg lb -> lg lb
- extract :: LDGraph lg lb => Selector lb -> lg lb -> lg lb
- labels :: LDGraph lg lb => lg lb -> [lb]
- data LabelMem
- labelIsVar :: Label lb => lb -> Bool
- labelHash :: Label lb => Int -> lb -> Int
- matchGraphMem :: Label lb => GraphMem lb -> GraphMem lb -> (Bool, LabelMap (ScopedLabel lb))
Documentation
Memory-based graph type
Minimal graph label value - for testing
labelIsVar :: Label lb => lb -> BoolSource
Arguments
| :: Label lb | |
| => GraphMem lb | |
| -> GraphMem lb | |
| -> (Bool, LabelMap (ScopedLabel lb)) | if the first element is |
GraphMem matching function accepting GraphMem value and returning node map if successful