streaming-concurrency alternatives and similar packages

Based on the "streaming" category.
Alternatively, view streaming-concurrency alternatives based on common mentions on social networks and blogs.

streaming

9.1 0.0 streaming-concurrency VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
streaming-commons

8.9 4.6 streaming-concurrency VS streaming-commons

Common lower-level functions needed by various streaming data libraries

AppSignal knows why the f*#k it crashed.

Stop vibe-debugging. Every exception, every backtrace, grouped so you see patterns, not noise.

Promo www.appsignal.com

streaming-bytestring

7.1 0.0 streaming-concurrency VS streaming-bytestring

effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy
streaming-cassava

6.5 1.8 streaming-concurrency VS streaming-cassava

Cassava support for the streaming library
streaming-conduit

6.1 2.8 streaming-concurrency VS streaming-conduit

Bidirectional support between the streaming and conduit libraries
streaming-with

5.6 0.0 streaming-concurrency VS streaming-with

with/bracket-style idioms for use with streaming
streaming-utils

5.5 0.0 streaming-concurrency VS streaming-utils

experimental http, attoparsec and pipes material for `streaming` and `streaming-bytestring`
streaming-fft

5.5 0.0 streaming-concurrency VS streaming-fft

sliding fast fourier transform using haskell streaming

Do you think we are missing an alternative of streaming-concurrency or a related project?

Add another 'streaming' Package

Popular Comparisons

README

streaming-concurrency

Concurrency for the streaming ecosystem

There are two primary higher-level use-cases for this library:

Merge multiple Streams together.
A conceptual Stream-based equivalent to [parMap] (albeit utilising concurrency rather than true parallelism).

[parMap]: http://hackage.haskell.org/package/parallel/docs/Control-Parallel-Strategies.html#v:parMap

However, low-level functions are also exposed so you can construct your own methods of concurrently using Streams (and there are also non-Stream-specific functions if you wish to use it with other data types).

Conceptually, the approach taken is to consider a typical correspondence system with an in-basket/tray for receiving messages for others, and an out-basket/tray to be later dealt with. Inputs are thus provided into the InBasket and removed once available from the OutBasket.

Thanks and recognition

The code here is heavily based upon -- and borrows the underlying Buffer code from -- Gabriel Gonzalez's pipes-concurrency. It differs from it primarily in being more bracket-oriented rather than providing a spawn primitive, thus not requiring explicit garbage collection.

Another main difference is that the naming of the input and output types has been switched around: pipes-concurrency seems to consider them from the point of view of the supplying/consuming Pipes, whereas here they are considered from the point of view of the Buffer itself.