Wismill
Wismill
I tested on a different machine: Results with GHC 9.4.1 on 4 × Intel® Core™ i5-3340M CPU @ 2.70GHz All unicode-transforms-text NFD/AllChars: OK (2.83s) 11.0 ms ± 62 μs, 5%...
@harendra-kumar done
@robstewart57 I would like to create a function `addRdfList :: (Rdf r) => RDF r -> [Node] -> (RDF r, Node)` but I would need to be able to create...
That's a pity it requires IO. Could we do the following: - Move every type definitions from `Data.RDF.Types` to `Data.RDF.Internal.Types` and export all the types and their constructors. Being "internal",...
The issue is to avoid identifier collisions while not changing performance. In my example with the RDF list, I would like a _pure_ function `addRdfList :: (Rdf r) => RDF...
I think it is best to let each application decide how to implement its node factory. This PR is ready for review.
I've added documentation. The idea was to have: ```haskell l :: [Node] (g', n) = addRdfList g l getRdfList g' n == l ```
Not going to work further on this
@robstewart57 what do you think about this proposal? I would like to keep only Megaparsec for the parsing, as it is now very fast and robust.
Ok, but at least we could drop `parsec` and keep only `attoparsec` and `megaparsec`. Then we could use [`parser-combinators`](https://hackage.haskell.org/package/parser-combinators). I think we should also provide a way to stream parsing...