The streaming-concurrency package

[ Tags: data, library, mit, streaming ] [ Propose Tags ]

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

  1. Merge multiple Streams together.

  2. A conceptual Stream-based equivalent to parMap (albeit utilising concurrency rather than true parallelism).

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).


[Skip to Readme]

Properties

Versions 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.3.0.1 (info)
Change log ChangeLog.md
Dependencies base (==4.*), exceptions (>=0.6 && <0.9), lifted-async (>=0.9.3 && <0.10), monad-control (==1.*), stm (>=2.4 && <3), streaming (>=0.1.4.0 && <0.2), streaming-with (>=0.1.0.0 && <0.3), transformers-base [details]
License MIT
Copyright Ivan Lazar Miljenovic
Author Ivan Lazar Miljenovic
Maintainer Ivan.Miljenovic@gmail.com
Category Data, Streaming
Source repository head: git clone https://github.com/ivan-m/streaming-concurrency.git
Uploaded Fri Jul 7 06:12:30 UTC 2017 by IvanMiljenovic
Distributions NixOS:0.3.0.1
Downloads 181 total (10 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-07 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for streaming-concurrency-0.3.0.1

[back to package description]

streaming-concurrency

Hackage Build Status

Concurrency for the streaming ecosystem

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

  1. Merge multiple Streams together.

  2. A conceptual Stream-based equivalent to parMap (albeit utilising concurrency rather than true parallelism).

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.