Repository navigation
Conversation
Current coverage is 87.21% (diff: 82.89%)@@ master #301 diff @@
==========================================
Files 265 268 +3
Lines 7883 7960 +77
Methods 6301 6361 +60
Messages 0 0
Branches 1580 1596 +16
==========================================
+ Hits 6868 6942 +74
- Misses 1015 1018 +3
Partials 0 0
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Inspired by
Control.Concurrent.MVarfrom Haskell and byscalaz.concurrent.MVar.An
MVaris mutable location, that is either empty or contains a value of typeAwith these operations:The
putandtakeoperations are atomic and their behavior is similar to usage of aBlockingQueue(capacity = 1). Or in other wordstakeblocks (asynchronously, with no threads getting abused) until there is a value available andputblocks (asynchronously) until the var is empty.The
readoperation is provided for convenience and is equivalent with:It's not atomic, so in case atomicity is needed, it can be combined with extra synchronization primitives, like
TaskSemaphore.Given its non-blocking nature, this implementation is cross-compiled and works on top of Javascript.
Work in progress: must add tests !!!