Issue #8128 has been updated by hsbt (Hiroshi SHIBATA).

Assignee set to seki (Masatoshi Seki)


----------------------------------------
Feature #8128: New primitives for Rinda::TupleSpace
https://bugs.ruby-lang.org/issues/8128#change-37745

Author: vjoel (Joel VanderWerf)
Status: Open
Priority: Low
Assignee: seki (Masatoshi Seki)
Category: lib
Target version: 


=begin

= New primitives for Rinda::TupleSpace

This issue proposes adding two new primitives to TupleSpace for atomic bulk operations:

== 1. TupleSpace#replace_all

=== What it does

Calling

  replace_all(tuple, new_tuple, sec=nil)

atomically removes all tuples matching ((|tuple|)) and writes ((|new_tuple|)). It does not block waiting for tuples. The return value is a pair:

  [ matching_tuples, entry ]

where ((|matching_tuples|)) is like the return value of (({read_all(tuple)})) and
((|entry|)) is like the return value of (({write(new_tuple)})).


=== Why it is needed

It is not possible to do this atomically with existing primitives. As noted in ((*The dRuby Book*)), p. 176, "It isn't easy to represent a dictionary using TupleSpace." Essentially, the #[]= and #[] operations must take/write a global lock tuple.

Using #replace_all, it is easy to implement a key-value store without lock tuples. See key-value-store.rb for an example.


=== Modularity

The new code is entirely contained in two modules in a single separate file. These modules are included/extended to TupleSpace and TupleSpaceProxy as desired to add the replace_all functionality.


=== Examples

See key-value-store.rb and example-replace-all.rb.


== 2. TupleSpace#take_all

=== What it does

Calling

  take_all(tuple)

atomically removes all matching tuples. It does not block waiting for tuples. The return value is the array of tuples, like the return value of (({read_all(tuple)})).


=== Why it is needed

It is not possible to do this atomically with existing primitives, though in this case atomicity may not be important. More importantly, it is not possible to do this efficiently with existing primitives. The best approximation would be an unbounded sequence of #take calls.


=== Modularity

The new code is entirely contained in two modules in a single separate file. These modules are included/extended to TupleSpace and TupleSpaceProxy as desired to add the take_all functionality.


=== Examples

See example-take-all.rb.

=end



-- 
http://bugs.ruby-lang.org/