Copyright	Travis Whitaker 2016
License	MIT
Maintainer	pi.boy.travis@gmail.com
Stability	Provisional
Portability	Portable
Safe Haskell	Safe
Language	Haskell2010

Data.RDF.Graph

Contents

Conversion to FGL Graphs
Conversion from FGL Graphs

Description

This module provides conversion between RDF triples and fgl graphs. Naturally these functions will force the entire graph into memory.

Synopsis

Documentation

data GNode Source #

An RDF Subject or Object as a Graph node. This common representation is necessary because the Object of one Triple might be the Subject of another.

Constructors

IRIGNode !IRI
BlankGNode !BlankNode
LiteralGNode !Literal

Instances

Eq GNode Source #
Methods (==) :: GNode -> GNode -> Bool # (/=) :: GNode -> GNode -> Bool #
Ord GNode Source #
Methods compare :: GNode -> GNode -> Ordering # (<) :: GNode -> GNode -> Bool # (<=) :: GNode -> GNode -> Bool # (>) :: GNode -> GNode -> Bool # (>=) :: GNode -> GNode -> Bool # max :: GNode -> GNode -> GNode # min :: GNode -> GNode -> GNode #
Read GNode Source #
Methods readsPrec :: Int -> ReadS GNode # readList :: ReadS [GNode] # readPrec :: ReadPrec GNode # readListPrec :: ReadPrec [GNode] #
Show GNode Source #
Methods showsPrec :: Int -> GNode -> ShowS # show :: GNode -> String # showList :: [GNode] -> ShowS #
Generic GNode Source #
Associated Types type Rep GNode :: * -> * # Methods from :: GNode -> Rep GNode x # to :: Rep GNode x -> GNode #
NFData GNode Source #
Methods rnf :: GNode -> () #
type Rep GNode Source #
type Rep GNode = D1 (MetaData "GNode" "Data.RDF.Graph" "rdf-0.1.0.0-EOOtsRwMO8t5gDZa48Ysfk" False) ((:+:) (C1 (MetaCons "IRIGNode" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 IRI))) ((:+:) (C1 (MetaCons "BlankGNode" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 BlankNode))) (C1 (MetaCons "LiteralGNode" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Literal)))))

type GEdge = Predicate Source #

A Graph edge is an RDF Predicate.

Conversion to FGL Graphs

rdfGraph :: DynGraph g => RDFGraph -> (g GNode GEdge, NodeMap GNode) Source #

Convert an RDFGraph into a DynGraph and NodeMap. The graphLabel is discarded.

triplesGraph :: DynGraph g => [Triple] -> (g GNode GEdge, NodeMap GNode) Source #

Convert a list of Triples into a DynGraph and a NodeMap.

Conversion from FGL Graphs

graphRDF :: Graph g => Maybe IRI -> g GNode GEdge -> Either String RDFGraph Source #

Convert a Graph into an RDFGraph. This will fail if the graph contains any LiteralGNodes with an outward degree greater than zero, since such a graph is illegal in RDF.

graphTriples :: Graph g => g GNode GEdge -> Either String [Triple] Source #

Convert a Graph into a list of Triples. This will fail if the graph contains any LiteralGNodes with an outward degree greater than zero, since such a graph is illegal in RDF.