Swish.RDF.GraphMem

This module defines a simple memory-based graph instance.

Documentation

data GraphMem lb

Memory-based graph type

Constructors

GraphMem

Fields

arcs :: [Arc lb]

Instances

Functor GraphMem

Foldable GraphMem

Traversable GraphMem

Label lb => LDGraph GraphMem lb

Label lb => Eq (GraphMem lb)

Label lb => Show (GraphMem lb)

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

Minimal graph label value - for testing

Constructors

LF String

LV String

Instances

Eq LabelMem

Ord LabelMem

Show LabelMem

Label LabelMem

labelIsVar :: Label lb => lb -> Bool

labelHash :: Label lb => Int -> lb -> Int

matchGraphMem

Arguments

:: Label lb

=> GraphMem lb

-> GraphMem lb

-> (Bool, LabelMap (ScopedLabel lb))

if the first element is True then the second value is a label map that maps each label to an equivalence-class identifier, otherwise emptyMap.

GraphMem matching function accepting GraphMem value and returning node map if successful