Swish.GraphMem

This module defines a simple memory-based graph instance.

Documentation

data GraphMem lb

Simple memory-based graph type.

Constructors

GraphMem

Fields

• arcs :: ArcSet lb

Instances

LDGraph GraphMem lb

Methods

emptyGraph :: GraphMem lb

setArcs :: GraphMem lb -> ArcSet lb -> GraphMem lb

getArcs :: GraphMem lb -> ArcSet lb

extract :: Selector lb -> GraphMem lb -> GraphMem lb

addGraphs :: GraphMem lb -> GraphMem lb -> GraphMem lb

delete :: GraphMem lb -> GraphMem lb -> GraphMem lb

labels :: GraphMem lb -> Set lb

nodes :: GraphMem lb -> Set lb

update :: (ArcSet lb -> ArcSet lb) -> GraphMem lb -> GraphMem lb

Label lb => Eq (GraphMem lb)

Methods

(==) :: GraphMem lb -> GraphMem lb -> Bool

(/=) :: GraphMem lb -> GraphMem lb -> Bool

Label lb => Ord (GraphMem lb)

Methods

compare :: GraphMem lb -> GraphMem lb -> Ordering

(<) :: GraphMem lb -> GraphMem lb -> Bool

(<=) :: GraphMem lb -> GraphMem lb -> Bool

(>) :: GraphMem lb -> GraphMem lb -> Bool

(>=) :: GraphMem lb -> GraphMem lb -> Bool

max :: GraphMem lb -> GraphMem lb -> GraphMem lb

min :: GraphMem lb -> GraphMem lb -> GraphMem lb

Label lb => Show (GraphMem lb)

Methods

showsPrec :: Int -> GraphMem lb -> ShowS

show :: GraphMem lb -> String

showList :: [GraphMem lb] -> ShowS

Label lb => Monoid (GraphMem lb)

Methods

mempty :: GraphMem lb

mappend :: GraphMem lb -> GraphMem lb -> GraphMem lb

mconcat :: [GraphMem lb] -> GraphMem lb

data LabelMem

Minimal graph label value - for testing

Constructors

LF String

LV String

Instances

Eq LabelMem

Methods

(==) :: LabelMem -> LabelMem -> Bool

(/=) :: LabelMem -> LabelMem -> Bool

Ord LabelMem

Methods

compare :: LabelMem -> LabelMem -> Ordering

(<) :: LabelMem -> LabelMem -> Bool

(<=) :: LabelMem -> LabelMem -> Bool

(>) :: LabelMem -> LabelMem -> Bool

(>=) :: LabelMem -> LabelMem -> Bool

max :: LabelMem -> LabelMem -> LabelMem

min :: LabelMem -> LabelMem -> LabelMem

Show LabelMem

Methods

showsPrec :: Int -> LabelMem -> ShowS

show :: LabelMem -> String

showList :: [LabelMem] -> ShowS

Hashable LabelMem

Methods

hashWithSalt :: Int -> LabelMem -> Int

hash :: LabelMem -> Int

Label LabelMem

Methods

labelIsVar :: LabelMem -> Bool

labelHash :: Int -> LabelMem -> Int

getLocal :: LabelMem -> String

makeLabel :: String -> LabelMem

setArcs :: LDGraph lg lb => lg lb -> ArcSet lb -> lg lb

Replace the existing arcs in the graph.

getArcs :: LDGraph lg lb => lg lb -> ArcSet lb

Extract all the arcs from a graph

addGraphs :: (LDGraph lg lb, Ord lb) => lg lb -> lg lb -> lg lb

Add the two graphs

delete :: (LDGraph lg lb, Ord lb) => lg lb -> lg lb -> lg lb

Remove those arcs in the first graph from the second graph

extract :: (LDGraph lg lb, Ord lb) => Selector lb -> lg lb -> lg lb

Extract those arcs that match the given Selector.

labels :: (LDGraph lg lb, Ord lb) => lg lb -> Set lb

Enumerate the distinct labels contained in a graph; that is, any label that appears in the subject, predicate or object position of an Arc.

labelIsVar :: Label lb => lb -> Bool

Does this node have a variable binding?

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

Calculate the hash of the label using the supplied seed.

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