I just released a small library to create P2P networks using `pipes`
and `pipes-concurrency`.

http://hackage.haskell.org/package/pipes-p2p

I also provide a dummy example in a separate package.

http://hackage.haskell.org/package/pipes-p2p-examples

For now this is highly experimental, the API will probably change
drastically once I start getting feedback from upstream programs.

Notice I didn't use `pipes-parse` or `pipes-binary`. In the beginning
I considered them, but I realized I don't need leftovers or
connect-resume when I can use bidirectional pipes to ask for the exact
number of expected bytes. In the case of exceptions I let the
connection terminate discarding the leftovers. I probably will change
this in the future to restart the connection depending on some
conditions.

There are many improvements that can be made now, but I would
appreciate any kind of feedback.

-- 
You received this message because you are subscribed to the Google Groups 
"Haskell Pipes" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].

Reply via email to