Safe Haskell	None
Language	Haskell98

Data.RDF.Graph.HashMapSP

Description

A graph implementation mapping (S,P) pairs to O, backed by Map.

Documentation

Instances

Generic HashSP Source #
Associated Types type Rep HashSP :: * -> * # Methods from :: HashSP -> Rep HashSP x # to :: Rep HashSP x -> HashSP #
Binary HashSP Source #
Methods put :: HashSP -> Put # get :: Get HashSP # putList :: [HashSP] -> Put #
NFData HashSP Source #
Methods rnf :: HashSP -> () #
Rdf HashSP Source #
Methods baseUrl :: RDF HashSP -> Maybe BaseUrl Source # prefixMappings :: RDF HashSP -> PrefixMappings Source # addPrefixMappings :: RDF HashSP -> PrefixMappings -> Bool -> RDF HashSP Source # empty :: RDF HashSP Source # mkRdf :: Triples -> Maybe BaseUrl -> PrefixMappings -> RDF HashSP Source # triplesOf :: RDF HashSP -> Triples Source # uniqTriplesOf :: RDF HashSP -> Triples Source # select :: RDF HashSP -> NodeSelector -> NodeSelector -> NodeSelector -> Triples Source # query :: RDF HashSP -> Maybe Node -> Maybe Node -> Maybe Node -> Triples Source # showGraph :: RDF HashSP -> String Source #
Generic (RDF HashSP) Source #
Associated Types type Rep (RDF HashSP) :: * -> * # Methods from :: RDF HashSP -> Rep (RDF HashSP) x # to :: Rep (RDF HashSP) x -> RDF HashSP #
NFData (RDF HashSP) Source #
Methods rnf :: RDF HashSP -> () #
type Rep HashSP Source #
type Rep HashSP = D1 (MetaData "HashSP" "Data.RDF.Graph.HashMapSP" "rdf4h-3.0.0-2ntD2jwEZEwPz1DcgwjHG" False) V1
data RDF HashSP Source #	A map-based graph implementation.
data RDF HashSP = HashSP (SPMap, Maybe BaseUrl, PrefixMappings)
type Rep (RDF HashSP) Source #
type Rep (RDF HashSP)