Swish.RDF.RDFGraph

This module defines a memory-based RDF graph instance.

Documentation

data RDFLabel

RDF graph node values

cf. http://www.w3.org/TR/rdf-concepts/#section-Graph-syntax

This is extended from the RDF abstract graph syntax in the following ways:

(a) a graph can be part of a resource node or blank node (cf. Notation3 formulae)

(b) a "variable" node option is distinguished from a blank node. I have found this useful for encoding and handling queries, even though query variables can be expressed as blank nodes.

(c) a "NoNode" option is defined. This might otherwise be handled by Maybe (RDFLabel g).

Constructors

Res ScopedName

resource

Lit String (Maybe ScopedName)

literal [type/language]

Blank String

blank node

Var String

variable (not used in ordinary graphs)

NoNode

no node (not used in ordinary graphs)

Instances

Eq RDFLabel

Ord RDFLabel

Show RDFLabel

ShowM RDFGraph

Label RDFLabel

LookupEntryClass NamedGraph ScopedName [RDFGraph]

isLiteral :: RDFLabel -> Bool

Test if supplied labal is a literal node

isUntypedLiteral :: RDFLabel -> Bool

Test if supplied labal is an untyped literal node

isTypedLiteral :: RDFLabel -> Bool

Test if supplied labal is an untyped literal node

isXMLLiteral :: RDFLabel -> Bool

Test if supplied labal is an XML literal node

isDatatyped :: ScopedName -> RDFLabel -> Bool

Test if supplied label is an typed literal node of a given datatype

isMemberProp :: RDFLabel -> Bool

Test if supplied label is a container membership property

Check for namespace is RDF namespace and first character of local name is '_' and remaining characters of local name are all digits

isUri :: RDFLabel -> Bool

Test if supplied labal is a URI resource node

isBlank :: RDFLabel -> Bool

Test if supplied labal is a blank node

isQueryVar :: RDFLabel -> Bool

Test if supplied labal is a query variable

getLiteralText :: RDFLabel -> String

Extract text value from a literal node

getScopedName :: RDFLabel -> ScopedName

Extract ScopedName value from a resource node

makeBlank :: RDFLabel -> RDFLabel

Make a blank node from a supplied query variable, or return the supplied label unchanged. (Use this in when substituting an existential for an unsubstituted query variable.)

type RDFTriple = Arc RDFLabel

RDF Triple (statement)

data NSGraph lb

Memory-based graph with namespaces and subgraphs

Constructors

NSGraph

Fields

namespaces :: NamespaceMap

formulae :: FormulaMap lb

statements :: [Arc lb]

Instances

Functor NSGraph

Foldable NSGraph

Traversable NSGraph

ShowM RDFGraph

Label lb => LDGraph NSGraph lb

LookupEntryClass NamedGraph ScopedName [RDFGraph]

Label lb => Eq (NSGraph lb)

Label lb => Show (NSGraph lb)

Label lb => Show (LookupFormula lb (NSGraph lb))

Label lb => LookupEntryClass (LookupFormula lb (NSGraph lb)) lb (NSGraph lb)

type RDFGraph = NSGraph RDFLabel

Memory-based RDF graph type

type NamespaceMap = LookupMap Namespace

Namespace prefix list entry

type RevNamespaceMap = LookupMap RevNamespace

data RevNamespace

Instances

LookupEntryClass RevNamespace String String

emptyNamespaceMap :: NamespaceMap

data LookupFormula lb gr

Graph formula entry

Constructors

Formula

Fields

formLabel :: lb

formGraph :: gr

Instances

(Eq lb, Eq gr) => Eq (LookupFormula lb gr)

Label lb => Show (LookupFormula lb (NSGraph lb))

Label lb => LookupEntryClass (LookupFormula lb (NSGraph lb)) lb (NSGraph lb)

type Formula lb = LookupFormula lb (NSGraph lb)

type FormulaMap lb = LookupMap (LookupFormula lb (NSGraph lb))

emptyFormulaMap :: FormulaMap RDFLabel

addArc :: Label lb => Arc lb -> NSGraph lb -> NSGraph lb

merge :: Label lb => NSGraph lb -> NSGraph lb -> NSGraph lb

Merge RDF graphs, renaming blank and query variable nodes as needed to neep variable nodes from the two graphs distinct in the resulting graph.

allLabels :: Label lb => (lb -> Bool) -> NSGraph lb -> [lb]

Return list of all labels (including properties) in the graph satisfying a supplied filter predicate.

allNodes :: Label lb => (lb -> Bool) -> NSGraph lb -> [lb]

Return list of all subjects and objects in the graph satisfying a supplied filter predicate.

remapLabels

Arguments

:: Label lb

=> [lb]

variable nodes to be renamed (dupbn)

-> [lb]

variable nodes used that must be avoided (allbn)

-> (lb -> lb)

node conversion function that is applied to nodes from dupbn in the graph that are to be replaced by new blank nodes. If no such conversion is required, supply id. The function makeBlank can be used to convert RDF query nodes into RDF blank nodes.

-> NSGraph lb

graph in which nodes are to be renamed

-> NSGraph lb

Remap selected nodes in graph:

This is the node renaming operation that prevents graph-scoped variable nodes from being merged when two graphs are merged.

remapLabelList

Arguments

:: Label lb

=> [lb]

labels to be remaped

-> [lb]

labels to be avoided by the remapping

-> [(lb, lb)]

Externally callable function to construct a list of (old,new) values to be used for graph label remapping.

newNode :: Label lb => lb -> [lb] -> lb

Given a node and a list of existing nodes, find a new node for the supplied node that does not clash with any existing node. (Generates an non-terminating list of possible replacements, and picks the first one that isn't already in use.)

TODO: optimize this for common case nnn and _nnn: always generate _nnn and keep track of last allocated

newNodes :: Label lb => lb -> [lb] -> [lb]

Given a node and a list of existing nodes, generate a list of new nodes for the supplied node that do not clash with any existing node.

setNamespaces :: NamespaceMap -> NSGraph lb -> NSGraph lb

getNamespaces :: NSGraph lb -> NamespaceMap

setFormulae :: FormulaMap lb -> NSGraph lb -> NSGraph lb

getFormulae :: NSGraph lb -> FormulaMap lb

setFormula :: Label lb => Formula lb -> NSGraph lb -> NSGraph lb

getFormula :: Label lb => NSGraph lb -> lb -> Maybe (NSGraph lb)

toRDFGraph :: [Arc RDFLabel] -> RDFGraph

Create a new RDF graph from a supplied list of arcs

emptyRDFGraph :: RDFGraph

Create a new, empty RDF graph.

class (Eq (lg lb), Eq lb) => LDGraph lg lb where

Methods

setArcs :: [Arc lb] -> lg lb -> lg lb

getArcs :: lg lb -> [Arc lb]

extract :: Selector lb -> lg lb -> lg lb

add :: lg lb -> lg lb -> lg lb

delete :: lg lb -> lg lb -> lg lb

labels :: lg lb -> [lb]

nodes :: lg lb -> [lb]

containedIn :: lg lb -> lg lb -> Bool

update :: ([Arc lb] -> [Arc lb]) -> lg lb -> lg lb

Instances

Label lb => LDGraph NSGraph lb

Label lb => LDGraph GraphMem lb

class (Eq lb, Show lb, Ord lb) => Label lb where

Methods

labelIsVar :: lb -> Bool

labelHash :: Int -> lb -> Int

getLocal :: lb -> String

makeLabel :: String -> lb

Instances

Label RDFLabel

Label LabelMem

Label lb => Label (ScopedLabel lb)

data Arc lb

Constructors

Arc

Fields

asubj :: lb

apred :: lb

aobj :: lb

Instances

Functor Arc

Foldable Arc

Traversable Arc

Eq lb => Eq (Arc lb)

Ord lb => Ord (Arc lb)

Show lb => Show (Arc lb)

arc :: lb -> lb -> lb -> Arc lb

arcSubj :: Arc lb -> lb

arcPred :: Arc lb -> lb

arcObj :: Arc lb -> lb

type Selector lb = Arc lb -> Bool

res_rdf_type :: RDFLabel

res_rdf_first :: RDFLabel

res_rdf_rest :: RDFLabel

res_rdf_nil :: RDFLabel

res_rdfs_member :: RDFLabel

res_rdfd_GeneralRestriction :: RDFLabel

res_rdfd_onProperties :: RDFLabel

res_rdfd_constraint :: RDFLabel

res_rdfd_maxCardinality :: RDFLabel

res_owl_sameAs :: RDFLabel

res_log_implies :: RDFLabel

grMatchMap :: Label lb => NSGraph lb -> NSGraph lb -> (Bool, LabelMap (ScopedLabel lb))

grEq :: Label lb => NSGraph lb -> NSGraph lb -> Bool

mapnode :: Label lb => [lb] -> [lb] -> (lb -> lb) -> lb -> lb

Remap a single graph node.

If the node is not one of those to be remapped, the supplied value is returned unchanged.

maplist :: Label lb => [lb] -> [lb] -> (lb -> lb) -> [(lb, lb)] -> [(lb, lb)]

Construct a list of (oldnode,newnode) values to be used for graph label remapping. The function operates recursiovely, adding new nodes generated to the mapping list (mapbn') and also to the list of nodes to be avoided (allbn').