concurrent
Version, currently 0.5.03 versions
- 0.5.0latestMar 20, 2022
- 0.1.2not indexedMay 14, 2022
- 0.1.1not indexedMay 14, 2022
github.com/didactic-drunk/concurrent.cr
Modern concurrency tools for Crystal
50 stars
0 dependents
License: MIT
Installation
# Add this to your shard.yml
dependencies:
concurrent:
github: didactic-drunk/concurrent.cr
version: ~> 0.5.0Then run:
shards installshard.yml
- Crystal
>= 1.1.0- License
- MIT
- Author
- Didactic Drunk <1479616+didactic-drunk@users.noreply.github.com>
Dependencies
This version declares no dependencies.
README
# concurrent.cr
[](https://github.com/didactic-drunk/concurrent.cr/actions/workflows/crystal.yml)
[](https://github.com/didactic-drunk/concurrent.cr/releases)
[](https://didactic-drunk.github.io/concurrent.cr/main)
<strike>Modern</strike> <strike>Adequate</strike> <strike>Any</strike>
**New opportunities for** concurrency tools in Crystal.
Large <strike>empty lots</strike> spacious directories available to build your dream <strike>home</strike> algorithm!
Space is filling up at (24k code bytes / 2 months) 0.004 bytes per second. Register your PR today!
<strike>©️ Real estate marketing association</strike>
Inspired by Erlang, Clojure, Scala, Haskell, F#, C#, Java, and classic concurrency patterns which inspired
[Ruby](https://github.com/ruby-concurrency/concurrent-ruby),
which inspired [this library](https://github.com/didactic-drunk/concurrent.cr).
Available classes:
* [Concurrent::Enumerable](https://didactic-drunk.github.io/concurrent.cr/Concurrent/Stream.html)
* [Concurrent::Channel](https://didactic-drunk.github.io/concurrent.cr/Concurrent/Stream.html)
* [Concurrent::CountDownLatch](https://didactic-drunk.github.io/concurrent.cr/Concurrent/CountDownLatch.html)
* [Concurrent::CyclicBarrier](https://didactic-drunk.github.io/concurrent.cr/Concurrent/CyclicBarrier.html)
* [Concurrent::Semaphore](https://didactic-drunk.github.io/concurrent.cr/Concurrent/Semaphore.html)
TODO:
* [ ] Change Enumerable/Channel in to generic stream processing.
* [ ] Enumerable/Channel custom error handling.
More algorithms are coming. Contributions welcome.
## Installation
1. Add the dependency to your `shard.yml`:
```yaml
dependencies:
concurrent:
github: didactic-drunk/concurrent.cr
```
2. Run `shards install`
## Usage
### Parallel map (experimental)
```crystal
require "concurrent/enumerable"
(1..50).parallel.select(&.even?).map { |n| n + 1 }.serial.sum
^ ^ ^ Results joined.
| | Spawns separate fiber pool
| Spawns fiber pool
```
### Batches
```crystal
(1..50).parallel.map { |n|
# Parallel processing in a fiber pool
Choose::A::ORM.new(id: n)
}.batch(10).run { |array_of_records|
# Run 10 Inserts inside a transaction for faster db writes
# Real applications should choose ~~~100-100000 depending on the database, schema, data & hardware
ORM.transaction { array_of_records.each &.save! }
}.wait
```
### Stream processing from a `Channel` (experimental).
```crystal
require "concurrent/channel"
# Same interface and restrictions as concurrent/enumerable.
ch = Channel(Int32).new
spawn do
10.times { |i| ch.send 1 }
ch.close
end
# map is processed in a Fiber pool.
# All other fibers will shut down after all messages are processed.
# Any errors in processing are raised here.
ch.parallel.map { |n| n + 1 }.serial.sum
```
### Open ended stream processing aka simplified fiber pools (experimental)
```crystal
require "concurrent/channel"
# Same interface and restrictions as concurrent/enumerable.
ch = Channel(Int32).new
# Messages may be processed in parallel within each `tee` and `run`.
# Make sure to use immutable objects or concurrency safe data structures.
run = ch.parallel.tee { |n| Log.info { "n=#{n}" } }.batch(2).run { |n| p n }
10.times { |i| ch.send 1 }
ch.close
# Wait until all messages/errors are processed.
run.wait
```
### Stream error handling
```crystal
ary = (1..10).to_a.parallel.select { |i|
raise "select error" if i == 2
true
}.parallel.map { |i|
raise "map error" if i.even?
i.to_s
# All errors in prior blocks handled here
}.errors { |ex, obj|
puts "#{obj} #{ex}"
}.map { |s|
s.to_i
}.to_a
p ary => [1, 3, 5, 7]
```
### CountDownLatch
```crystal
require "concurrent/count_down_latch"
fiber_count = 10
latch = Concurrent::CountDownLatch.new
10.times do
spawn do
# Do work
latch.count_down
end
end
latch.wait_count = fiber_count
latch.wait
```
### Semaphore
```crystal
require "concurrent/semaphore"
sem = Concurrent::Semaphore.new n
# spawn a lot of fibers
2000.times do
spawn do
sem.acquire do
...
end
end
end
```
## Development
TODO: Write development instructions here
## Contributing
1. Fork it (<https://github.com/didactic-drunk/concurrent.cr/fork>)
2. **Install a formatting check git hook (ln -sf ../../scripts/git/pre-commit .git/hooks)**
3. Create your feature branch (`git checkout -b my-new-feature`)
4. Commit your changes (`git commit -am 'Add some feature'`)
5. Push to the branch (`git push origin my-new-feature`)
6. Create a new Pull Request
## Contributors
- [Click](https://github.com/didactic-drunk/concurrent.cr/graphs/contributors) or Run `git shortlog --summary --numbered --email`
Documentation
Built from the current release. The first visit to a release nobody has asked for starts its build.
Links
This release
- Version
0.5.0- Tagged
- Mar 20, 2022
- Commit
7637dbde187c- Crystal
>= 1.1.0- Indexed
- yes
Dependents
No indexed shard depends on this one yet.
Repository
github.com/didactic-drunk/concurrent.cr
Metadata
- Created
- Aug 12, 2026
- Updated
- Aug 12, 2026
- Synced
- Aug 12, 2026
- Versions
- 3