rdf4h 1.0.0 → 1.0.1

raw patch · 5 files changed

+8/−16 lines, 5 filesdep ~MissingH

Dependency ranges changed: MissingH

Files

• rdf4h.cabal +4/−4
• src/Data/RDF.hs +1/−1
• src/Text/RDF/RDF4H/TurtleParser.hs +1/−6
• src/Text/RDF/RDF4H/TurtleSerializer.hs +0/−4
• testsuite/tests/Test.hs +2/−1

@@ -1,5 +1,5 @@ name:            rdf4h-version:         1.0.0+version:         1.0.1 synopsis:        A library for RDF processing in Haskell description:        'RDF for Haskell' is a library for working with RDF in Haskell.@@ -52,7 +52,7 @@                  , network >= 2.2.0.0                  , HTTP >= 4000.0.0                  , hxt >= 9.0.0-                 , MissingH >= 1.0.0+                 , MissingH >= 1.2.0.0                  , text   other-modules:   Data.RDF.Utils                  , Text.RDF.RDF4H.ParserUtils@@ -72,7 +72,7 @@                  , network >= 2.2.0.0                  , HTTP >= 4000.0.0                  , hxt >= 9.0.0-                 , MissingH >= 1.0.0+                 , MissingH >= 1.2.0.0                  , containers                  , text   hs-source-dirs:  src@@ -94,7 +94,7 @@                , network >= 2.2.0.0                , QuickCheck >= 1.2.0.0                , HUnit >= 1.2.2.1-               , MissingH >= 1.0.0+               , MissingH >= 1.2.0.0                , bytestring                , hxt                , containers

@@ -524,7 +524,7 @@ removeDupes =  map head . group . sort  -- |This determines if two RDF representations are equal regardless of blank--- nodc names, triple order and prefixes.  In math terms, this is the \simeq+-- node names, triple order and prefixes.  In math terms, this is the \simeq -- latex operator, or ~= isIsomorphic :: forall rdf1 rdf2. (RDF rdf1, RDF rdf2) => rdf1 -> rdf2 -> Bool isIsomorphic g1 g2 = normalize g1 == normalize g2

@@ -21,11 +21,7 @@ import Data.Char (isDigit) import Control.Monad import Data.Maybe (fromMaybe)-import Debug.Trace(trace) --- To avoid compiler warnings when not being used.-_trace = trace- -- |An 'RdfParser' implementation for parsing RDF in the  -- Turtle format. It takes optional arguments representing the base URL to use -- for resolving relative URLs in the document (may be overridden in the document@@ -469,7 +465,6 @@ popPred = getState >>= \(bUrl, dUrl, i, pms, ss, ps, cs, ts) ->                 setState (bUrl, dUrl, i, pms, ss, tail ps, cs, ts) >>                   when (null ps) (error "Cannot pop predicate off empty stack.") >>-                  -- _trace (show ps) (return ()) >>                   return (head ps)  isInColl :: GenParser ParseState Bool@@ -581,7 +576,7 @@  -- |Parse the given string as a Turtle document. The arguments and return type have the same semantics  -- as <parseURL>, except that the last @String@ argument corresponds to the Turtle document itself as--- a a string rather than a location URI.+-- a string rather than a location URI. parseString' :: forall rdf. (RDF rdf) => Maybe BaseUrl -> Maybe T.Text -> T.Text -> Either ParseFailure rdf parseString' bUrl docUrl ttlStr = handleResult bUrl (runParser t_turtleDoc initialState "" ttlStr)   where initialState = (bUrl, docUrl, 1, PrefixMappings Map.empty, [], [], [], Seq.empty)

@@ -18,10 +18,6 @@ import Data.List import Control.Monad import System.IO-import Debug.Trace(trace)---- Defined so that there are no compiler warnings when trace is not used.-_debug = trace  data TurtleSerializer = TurtleSerializer (Maybe T.Text) PrefixMappings 

@@ -1,10 +1,11 @@ module Main where  import Test.Framework (defaultMain)-import Text.RDF.RDF4H.TurtleParser_ConformanceTest as TurtleParser+ import qualified Data.RDF.TriplesGraph_Test as TriplesGraph import qualified Data.RDF.MGraph_Test as MGraph import qualified Text.RDF.RDF4H.XmlParser_Test as XmlParser+import qualified Text.RDF.RDF4H.TurtleParser_ConformanceTest as TurtleParser  main :: IO ()  main = defaultMain (  TriplesGraph.tests