From c360af2df3e0904c7338cc1f32fcb270b7e34092 Mon Sep 17 00:00:00 2001 From: Benoit Germain Date: Tue, 4 Jun 2024 16:19:47 +0200 Subject: Refactored keeper implementation of linda:receive() --- docs/index.html | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) (limited to 'docs') diff --git a/docs/index.html b/docs/index.html index 0cad4a0..1b24422 100644 --- a/docs/index.html +++ b/docs/index.html @@ -1224,7 +1224,8 @@ The send() and receive() methods use Linda keys as FIFO stacks (first in, first out).
By default, stack sizes are unlimited but limits can be enforced using the limit() method. This can be useful to balance execution speeds in a producer/consumer scenario. nil removes the limit.
A limit of 0 is allowed to block everything.
- If the key was full but the limit change added some room, limit() returns true and the linda is signalled so that send()-blocked threads are awakened. + If the key was full but the limit change added some room, limit() returns true and the linda is signalled so that send()-blocked threads are awakened.
+ In batched mode, linda:receive() will raise an error if min_count < 1 or max_count < min_count.

-- cgit v1.2.3-55-g6feb