[Haskell-cafe] Ideas on a fast and tidy CSV library
johan.tibell at gmail.com
Thu Jul 25 17:53:18 CEST 2013
You can use the Incremental or Streaming modules to get more fine
grained control over when new parsed records are produced.
On Thu, Jul 25, 2013 at 11:02 AM, Justin Paston-Cooper
<paston.cooper at gmail.com> wrote:
> I hadn't yet tried profiling the programme. I actually deleted it a few days
> ago. I'm going to try to get something new running, and I will report back.
> On a slightly less related track: Is there any way to use cassava so that I
> can have pure state and also yield CSV lines while my computation is running
> instead of everything at the end as would be with the State monad?
> On 23 July 2013 22:13, Johan Tibell <johan.tibell at gmail.com> wrote:
>> On Tue, Jul 23, 2013 at 5:45 PM, Ben Gamari <bgamari.foss at gmail.com>
>> > Justin Paston-Cooper <paston.cooper at gmail.com> writes:
>> >> Dear All,
>> >> Recently I have been doing a lot of CSV processing. I initially tried
>> >> to
>> >> use the Data.Csv (cassava) library provided on Hackage, but I found
>> >> this to
>> >> still be too slow for my needs. In the meantime I have reverted to
>> >> hacking
>> >> something together in C, but I have been left wondering whether a tidy
>> >> solution might be possible to implement in Haskell.
>> > Have you tried profiling your cassava implementation? In my experience
>> > I've found it's quite quick. If you have an example of a slow path I'm
>> > sure Johan (cc'd) would like to know about it.
>> I'm always interested in examples of code that is not running fast
>> enough. Send me a reproducible example (preferably as a bug on the
>> GitHub bug tracker) and I'll take a look.
More information about the Haskell-Cafe