From 05256f1e75f8583829bbaa7cdf1fb1518b93332a Mon Sep 17 00:00:00 2001
From: Benoit Germain
Date: Mon, 18 Apr 2011 08:25:23 +0200
Subject: * linda uses a fast FIFO implementation to speed up data exchanges *
new linda:count() method * new linda batched data read mode * proper key type
check in all linda methods * fix setup-vc.cmd to support Visual Studio 2010
and Windows 7 64 bits * bugfix: release keeper state mutex at desinit
---
docs/index.html | 14 ++++++++++----
1 file changed, 10 insertions(+), 4 deletions(-)
(limited to 'docs')
diff --git a/docs/index.html b/docs/index.html
index 7d61d96..3c4fe59 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -483,7 +483,7 @@ level locking is required; each Linda operation is atomic.
Characteristics of the Lanes implementation of Lindas are:
- - keys can be of number, string or boolean type
+
- keys can be of boolean, number, string or light userdata type
- values can be any type supported by inter-state copying (same limits
as for function parameters and upvalues)
@@ -560,17 +560,23 @@ They can be used for making shared tables of storage among the lanes.
Writing to a slot overwrites existing value, and clears any possible queued
entries. Table access and send/receive can be used together;
reading a slot essentially peeks the next outcoming value of a queue.
-
+
+
- [val]= linda_h:keys()
+ [val]= linda_h:count( [key[,...]])
|
- A way to examine the slots in which a linda contains some pending data to be read.
+ Returns some information about the contents of the linda.
+
If no key is specified, and the linda is empty, returns nothing.
+
If no key is specified, and the linda is not empty, returns a table of key/count pairs that counts the number of items in each
+ of the exiting keys of the linda. This count can be 0 if the key has been used but is empty.
+
If a single key is specified, returns the number of pending items, or nothing if the key is unknown.
+
If more than one key is specified, return a table of key/count pairs for the known keys.