tupelo 0.12 → 0.13

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: dc4bce707ea05097c67e685d20435968d326daaf
-  data.tar.gz: 02a62f5ed3513d411b0e3bbd4b6d21af08b06c58
+  metadata.gz: 8a657d2c56962432faa339d693f6856f409249f6
+  data.tar.gz: 64a58b3ab627151aeb2fc8965de21a39c1ebf3f6
 SHA512:
-  metadata.gz: 843a155e6e411c6ff9da110b83cfae4c69fa53b06abd0b34b0aa4f469bd97447e58e08091a3009b49d914615547dee9c5f3f3a84e1e0c89481b6184c8f429581
-  data.tar.gz: 74fd680cd05b27977afc4958eeea19311dcf11120e1d3c2232371e8abda0f275ffc3f9204cb3197412cbb08664c9fc37a789b43c7341a716b00a1f0fc8261fe3
+  metadata.gz: 7ea7042705c178a855d4d9ad621c2b65433d0adb4ff7dd75ee855f75d4b53d2bc4301ea91f3491bfaf2847294076a9edffa176290192d004488bdf87caa0b016
+  data.tar.gz: 7e371d515db7f86bd95c353fcd5153efd5d1f34ba6edb0c75b7602994309509615f602ba7463729326f3c8d3aa55ba290e67c0e24fac07e917d61e72d668b886

data/README.md

@@ -1,4 +1,4 @@
-**NEWS**: Come hear a talk on Tupelo on December 11 in San Francisco at the [SF Distributed Computing meetup](http://www.meetup.com/San-Francisco-Distributed-Computing). Location is TBD. Abstract: [doc/sfdc.txt](doc/sfdc.txt).
+**NEWS**: Come hear a talk on Tupelo on December 11 in San Francisco at the [SF Distributed Computing meetup](http://www.meetup.com/San-Francisco-Distributed-Computing/events/153886592/). Abstract: [doc/sfdc.txt](doc/sfdc.md).
 
 tupelo
 ==
@@ -93,6 +93,11 @@ Getting started
 
   reads all 2-tuples.
 
+  Read tuples in a stream, both existing and as they arrive:
+
+        read <template> do |tuple| ... end
+        read do |tuple| ... end             # match any tuple
+
   Take a tuple matching a template:
 
         t <template>

data/example/broker-queue.rb

@@ -0,0 +1,35 @@
+# more like how you would do it in redis, except that the queue is not stored in
+# the central server, so operations on it are not a bottleneck, FWIW
+
+require 'tupelo/app'
+
+N_PLAYERS = 10
+
+Tupelo.application do
+  N_PLAYERS.times do
+    # sleep rand / 10 # reduce contention -- could also randomize inserts
+    child do
+      me = client_id
+      write name: me
+      
+      you = transaction do
+        game = read_nowait(
+          player1: nil,
+          player2: me)
+        break game["player1"] if game
+      
+        unless take_nowait name: me
+          raise Tupelo::Client::TransactionFailure
+        end
+
+        you = take(name: nil)["name"]
+        write(
+          player1: me,
+          player2: you)
+        you
+      end
+
+      log "now playing with #{you}"
+    end
+  end
+end

data/example/chat/chat-nohistory.rb

@@ -0,0 +1,33 @@
+# Same as chat.rb, but no messages are stored.
+
+require 'tupelo/app'
+
+svr = "chat-nohistory.yaml"
+
+Thread.abort_on_exception = true
+
+def display_message msg
+  from, time, line = msg.values_at(*%w{from time line})
+  time_str = Time.at(time).strftime("%I:%M:%S")
+  print "\r\033[2K" # Esc[2K is "Clear entire line"
+  puts "#{from}@#{time_str}> #{line}"
+end
+
+Tupelo.tcp_application servers_file: svr do
+  me = argv.shift
+
+  local do
+    require 'readline'
+
+    Thread.new do
+      read from: nil, line: nil, time: nil do |msg|
+        display_message msg
+        Readline.refresh_line
+      end
+    end
+    
+    while line = Readline.readline("#{me}> ", true)
+      pulse from: me, line: line, time: Time.now.to_f
+    end
+  end
+end

data/example/chat/chat.rb

@@ -22,7 +22,8 @@ Thread.abort_on_exception = true
 
 def display_message msg
   from, time, line = msg.values_at(*%w{from time line})
-  time_str = Time.at(time).strftime("%I:%M.%S")
+  time_str = Time.at(time).strftime("%I:%M:%S")
+  print "\r\033[2K" # Esc[2K is "Clear entire line"
   puts "#{from}@#{time_str}> #{line}"
 end
 
@@ -33,15 +34,9 @@ Tupelo.tcp_application servers_file: svr do
     require 'readline'
 
     Thread.new do
-      seen_at_start = {}
-      read_all(from: nil, line: nil, time: nil).
-        sort_by {|msg| msg["time"]}.
-        each {|msg| display_message msg; seen_at_start[msg] = true}
-      
       read from: nil, line: nil, time: nil do |msg|
-        next if msg["from"] == me or seen_at_start[msg]
-        print "\r"; display_message msg
-        Readline.redisplay ### why not u work?
+        display_message msg
+        Readline.refresh_line
       end
     end
     

data/example/child-of-child.rb

@@ -0,0 +1,34 @@
+require 'tupelo/app'
+
+### need a programmatic way to start up clients
+
+Tupelo.application do |app|
+
+  app.child do ## local still hangs
+    3.times do |i|
+      app.child do
+        write [i]
+        log "wrote #{i}"
+      end
+    end
+
+    3.times do
+      log take [nil]
+    end
+  end
+end
+
+__END__
+
+this hangs sometimes but not always:
+
+  tick    cid status operation
+A: client 3: wrote 0
+A: client 4: wrote 1
+     1      3        batch write [0]
+     2      4        batch write [1]
+A: client 2: [0]
+     3      2        atomic take [0]
+     4      2        atomic take [1]
+A: client 2: [1]
+A: client 5: wrote 2

data/example/fish01.rb

@@ -0,0 +1,48 @@
+# This works, but requires a fix-up step.
+
+require 'tupelo/app'
+
+Tupelo.application do
+  2.times do
+    child passive: true do
+      loop do
+        fish = nil
+
+        transaction do
+          fish, _ = take([String])
+          n, _ = take_nowait([Integer, fish])
+          if n
+            write [n + 1, fish]
+          else
+            write [1, fish] # another process might also write this, so ...
+          end
+        end
+        ### what if both processes die here?
+        transaction do # ... fix up the two tuples.
+          n1, _ = take_nowait [Integer, fish]; abort unless n1
+          n2, _ = take_nowait [Integer, fish]; abort unless n2
+          #log "fixing: #{[n1 + n2, fish]}"
+          write [n1 + n2, fish]
+        end
+      end
+    end
+  end
+
+  local do
+    seed = 3
+    srand seed
+    log "seed = #{seed}"
+    
+    fishes = %w{ trout marlin char salmon }
+
+    a = fishes * 10
+    a.shuffle!
+    a.each do |fish|
+      write [fish]
+    end
+
+    fishes.each do |fish|
+      log take [10, fish]
+    end
+  end
+end

data/example/pregel/dist-opt.rb

@@ -0,0 +1,15 @@
+#
+# Minor optimization:
+
+class KeyMatcher
+  def initialize i, n
+    @i = i
+    @n = n
+  end
+
+  def === id
+    id % @n == @i
+  end
+end
+
+vertex = take id: v_id_matcher, step: step, rank: nil, active: true

data/example/subspaces/addr-book-v1.rb

@@ -0,0 +1,106 @@
+## TODO
+##
+## scaling params
+
+require 'tupelo/app'
+
+ab_tag = "my address book"
+ab_sort_field = 1
+ab_val_field = 2
+cmd_tag = "#{ab_tag} commands"
+resp_tag = "#{ab_tag} responses"
+
+Tupelo.application do
+  local do
+    use_subspaces!
+
+    # Subspace for tuples belonging to the addr book.
+    define_subspace(
+      tag:          ab_tag,
+      template:     [
+        {value: ab_tag},
+        {type:  "string"},  # name <-- ab_sort_field references this field
+        nil                 # address; can be any object <-- ab_val_field
+      ]
+    )
+    
+    # Subspace for commands for fetch and delete.
+    # We can't use #read and #take because then the requesting client
+    # would have to subscribe to the ab_tag subspace.
+    define_subspace(
+      tag:          cmd_tag,
+      template:     [
+        {value: cmd_tag},
+        {type:  "string"},  # cmd name
+        {type:  "list"}     # arguments
+      ]
+    )
+
+    # Subspace for responses to commands. Identify the command this is in
+    # response to by copying it (alternately, could use ids).
+    define_subspace(
+      tag:          resp_tag,
+      template:     [
+        {value: resp_tag},
+        {type:  "string"},  # cmd name
+        {type:  "list"},    # arguments
+        nil                 # result of query -- type depends on command
+      ]
+    )
+  end
+
+  ## Could set N_SORTED_SET_SPACE > 1, but lookups are so fast it would
+  ## just lead to contention and redundant computation. Redundancy is useful
+  ## though.
+
+  # Inserts are just writes, which are handled by Worker and SortedSetSpace,
+  # so this child's app loop only needs to handle special commands: fetch and
+  # delete, which are delegated to the SortedSetSpace.
+  child tuplespace: [SortedSetSpace, ab_tag, ab_sort_field, ab_val_field],
+        subscribe: [ab_tag, cmd_tag], passive: true do
+    loop do
+      transaction do
+        _, cmd, args = take(subspace cmd_tag)
+
+        case cmd
+        when "delete"
+          args.each do |name|
+            take [ab_tag, name, nil]
+          end
+
+        when "fetch"
+          name = args[0]
+          _, _, addr = read [ab_tag, name, nil]
+          write [resp_tag, name, args, addr]
+
+        when "next", "prev"
+          name = args[0]
+          _, name2, addr = read SortedSetTemplate[ab_tag, cmd, name]
+          write [resp_tag, name, args, name2, addr]
+
+        when "first", "last"
+          _, name, addr = read SortedSetTemplate[ab_tag, cmd]
+          write [resp_tag, name, args, name, addr]
+
+        else # maybe write an error message in a tuple
+          log.error "bad command: #{cmd}"
+        end
+      end
+    end
+  end
+  
+  child subscribe: resp_tag do
+    # write some ab entries
+    write [ab_tag, "McFirst, Firsty", "123 W. Crescent Terrace"]
+    write [ab_tag, "Secondismus, Deuce", "456 S. West Way"]
+
+    # make some queries
+    write [cmd_tag, "first", []]
+    *, name, addr = take [resp_tag, "first", [], nil, nil]
+    log "first entry: #{name} => #{addr}"
+    
+    write [cmd_tag, "next", [name]]
+    *, name, addr = take [resp_tag, "next", [name], nil, nil]
+    log "next entry: #{name} => #{addr}"
+  end
+end

data/example/subspaces/addr-book-v2.rb

@@ -0,0 +1,18 @@
+require 'tupelo/app'
+
+Tupelo.application do
+  local do
+    use_subspaces!
+
+    define_subspace(
+      tag:          "address books",
+      template:     {
+        book:       {type: "string"},
+        name:       {type: "string"},
+        address:    nil
+      }
+    )
+
+    define_subspace
+  end
+end

data/example/subspaces/sorted-set-space.rb

@@ -0,0 +1,130 @@
+require 'rbtree'
+
+class SortedSetTemplate
+  class << self
+    alias [] new
+  end
+  
+  # cmd can be "next", "prev", "first", "last"
+  # for next/prev, args is ["name"]
+  # for first/last, args is empty
+  def initialize tag, cmd, *args
+    @tag = tag
+    @cmd = cmd
+    @args = args
+  end
+  
+  def === other
+    raise ### should not need this?
+  end
+  
+  def find_in rbtree
+    case @cmd
+    when "first"
+      rbtree.first
+    ###
+  end
+end
+
+# A tuple store (in-memory) that is optimized for (key_string, object) pairs.
+# The object may be any serializable object (built up from numbers, booleans,
+# nil, strings, hashes and arrays).
+#
+# Unlike in a key-value store, a given key_string may occur more than once.
+# It is up to the application to decide whether to enforce key uniqueness or
+# not (for example, by taking (k,...) before writing (k,v).
+#
+# This store should be used only by clients that subscribe to a subspace
+# that can be represented as pairs. (See memo2.rb.)
+#
+# This store also manages meta tuples, which it keeps in an array, just like
+# the default Tuplespace class does.
+class SortedSetSpace
+  include Enumerable
+
+  attr_reader :tag, :hash, :metas
+
+  def initialize tag
+    @tag = tag
+    clear
+  end
+
+  def clear
+    @hash = Hash.new {|h,k| h[k] = []}
+      # It's up to the application to enforce that these arrays have size <=1.
+    @metas = []
+      # We are automatically subscribed to tupelo metadata (subspace defs), so
+      # we need to keep them somewhere.
+  end
+
+  def each
+    hash.each do |k, vs|
+      vs.each do |v|
+        yield tag, k, v
+      end
+    end
+    metas.each do |tuple|
+      yield tuple
+    end
+  end
+
+  def insert tuple
+    if tuple.kind_of? Array
+        # and tuple.size == 3 and tuple[0] == tag and tuple[1].kind_of? String
+        # This is redundant, because of subscribe.
+      t, k, v = tuple
+      hash[k] << v
+
+    else
+      metas << tuple
+    end
+  end
+
+  def delete_once tuple
+    if tuple.kind_of? Array
+        # and tuple.size == 3 and tuple[0] == tag and tuple[1].kind_of? String
+        # This is redundant, because of subscribe.
+      t, k, v = tuple
+      if hash.key?(k) and hash[k].include? v
+        hash[k].delete v
+        hash.delete k if hash[k].empty?
+        true
+      else
+        false
+      end
+
+    else
+      if i=metas.index(tuple)
+        delete_at i
+      end
+    end
+  end
+
+  def transaction inserts: [], deletes: [], tick: nil
+    deletes.each do |tuple|
+      delete_once tuple or raise "bug"
+    end
+
+    inserts.each do |tuple|
+      insert tuple.freeze ## should be deep_freeze
+    end
+  end
+
+  def find_distinct_matches_for templates
+    templates.inject([]) do |tuples, template|
+      tuples << find_match_for(template, distinct_from: tuples)
+    end
+  end
+
+  def find_match_for template, distinct_from: []
+    case template
+    when SortedSetTemplate
+      template.find_in rbtree, distinct_from: distinct_from ###
+    else
+      # fall back to linear search
+      find do |tuple|
+        template === tuple and not distinct_from.any? {|t| t.equal? tuple}
+      end
+    end
+  end
+end

data/lib/tupelo/client/reader.rb

@@ -3,10 +3,14 @@ require 'tupelo/client/common'
 class Tupelo::Client
   # Include into class that defines #worker and #log.
   module Api
-    # If block given, yield matching tuple to the block if one is found
-    # locally and then yield each new tuple as it arrives.
-    # Otherwise, return one matching tuple, blocking if necessary.
-    def read_wait template
+    # If no block given, return one matching tuple, blocking if necessary.
+    # If block given, yield each matching tuple that is found
+    # locally and then yield each new match as it is written to the space.
+    # Guaranteed not to miss tuples, even if they arrive and are immediately
+    # taken. (Note that simply doing read(template) in a loop would not
+    # have this guarantee.)
+    # The template defaults to Object, which matches any tuple.
+    def read_wait template = Object
       waiter = Waiter.new(worker.make_template(template), self, !block_given?)
       worker << waiter
       if block_given?
@@ -23,13 +27,16 @@ class Tupelo::Client
     end
     alias read read_wait
 
-    def read_nowait template
+    # The template defaults to Object, which matches any tuple.
+    def read_nowait template = Object
       matcher = Matcher.new(worker.make_template(template), self)
       worker << matcher
       matcher.wait
     end
 
-    # By default, reads *everything*.
+    # Returns all matching tuples currently in the space. The template defaults
+    # to Object, which matches any tuple. Does not wait for more tuples to
+    # arrive.
     def read_all template = Object
       matcher = Matcher.new(worker.make_template(template), self, :all => true)
       worker << matcher

data/lib/tupelo/client/worker.rb

@@ -507,13 +507,15 @@ class Tupelo::Client
     end
 
     def handle_waiter waiter
-      tuple = tuplespace.find_match_for waiter.template
-      if tuple
-        once = waiter.peek tuple
-        unless once
+      if waiter.once
+        tuple = tuplespace.find_match_for waiter.template
+        if tuple
+          waiter.peek tuple
+        else
           read_waiters << waiter
         end
       else
+        tuplespace.each {|tuple| waiter.gloms tuple}
         read_waiters << waiter
       end
     end

data/lib/tupelo/version.rb

@@ -1,3 +1,3 @@
 module Tupelo
-  VERSION = "0.12"
+  VERSION = "0.13"
 end

data/test/unit/test-ops.rb

@@ -86,6 +86,30 @@ class TestOps < Minitest::Test
     end
   end
 
+  def test_read_stream
+    writer, reader = make_clients(2)
+    a = []
+    n = 10; k = 3
+
+    (0...k).each do |i|
+      writer.now {write [i]}
+    end
+
+    reader.will {read([nil]){|t| a << t}}
+
+    (0...k).each do |i|
+      reader.run_until_blocked
+      assert_equal [i], a[i]
+    end
+
+    assert_equal [0], a[0]
+    (k...n).each do |i|
+      writer.now {write [i]}
+      reader.run_until_blocked
+      assert_equal [i], a[i]
+    end
+  end
+
   def test_take_existing
     t = ["foo"]
     cl = make_clients(2)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: tupelo
 version: !ruby/object:Gem::Version
-  version: '0.12'
+  version: '0.13'
 platform: ruby
 authors:
 - Joel VanderWerf
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-12-03 00:00:00.000000000 Z
+date: 2013-12-04 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: atdo
@@ -84,111 +84,119 @@ files:
 - lib/tupelo/app/trace.rb
 - lib/tupelo/app/builder.rb
 - lib/tupelo/client.rb
-- lib/tupelo/tuplets/persistent-archiver.rb
-- lib/tupelo/tuplets/persistent-archiver/worker.rb
-- lib/tupelo/tuplets/persistent-archiver/tuplespace.rb
-- lib/tupelo/util/boolean.rb
 - lib/tupelo/app.rb
 - lib/tupelo/archiver.rb
+- lib/tupelo/client/worker.rb
+- lib/tupelo/client/common.rb
+- lib/tupelo/client/tuplespace.rb
+- lib/tupelo/client/transaction.rb
+- lib/tupelo/client/atdo.rb
+- lib/tupelo/client/reader.rb
+- lib/tupelo/tuplets/persistent-archiver/worker.rb
+- lib/tupelo/tuplets/persistent-archiver/tuplespace.rb
+- lib/tupelo/tuplets/persistent-archiver.rb
 - lib/tupelo/archiver/persister.rb
 - lib/tupelo/archiver/worker.rb
 - lib/tupelo/archiver/tuplespace.rb
 - lib/tupelo/archiver/persistent-tuplespace.rb
-- lib/tupelo/client/transaction.rb
-- lib/tupelo/client/worker.rb
-- lib/tupelo/client/reader.rb
-- lib/tupelo/client/tuplespace.rb
-- lib/tupelo/client/atdo.rb
-- lib/tupelo/client/common.rb
+- lib/tupelo/util/boolean.rb
 - lib/tupelo/version.rb
 - bench/pipeline.rb
 - bugs/read-take.rb
 - bugs/take-write.rb
+- example/pubsub.rb
+- example/timeout-trans.rb
+- example/fish01.rb
+- example/tiny-client.rb
+- example/add.rb
+- example/parallel.rb
+- example/socket-broker.rb
+- example/multi-tier/memo2.rb
+- example/multi-tier/drb.rb
+- example/multi-tier/memo.rb
+- example/multi-tier/kvspace.rb
+- example/multi-tier/http.rb
+- example/multi-tier/multi-sinatras.rb
+- example/app-and-tup.rb
+- example/small.rb
+- example/bounded-retry.rb
+- example/fish.rb
+- example/zk/lock.rb
+- example/concurrent-transactions.rb
+- example/cancel.rb
+- example/map-reduce/map-reduce-v2.rb
+- example/map-reduce/remote-map-reduce.rb
+- example/map-reduce/map-reduce.rb
+- example/tiny-server.rb
+- example/write-wait.rb
+- example/tcp.rb
 - example/timeout.rb
+- example/read-in-trans.rb
+- example/subspaces/simple.rb
+- example/subspaces/pubsub.rb
+- example/subspaces/addr-book-v1.rb
+- example/subspaces/addr-book-v2.rb
+- example/subspaces/shop/shop-v2.rb
+- example/subspaces/shop/shop-v1.rb
+- example/subspaces/sorted-set-space.rb
+- example/balance-xfer-retry.rb
+- example/take-nowait-caution.rb
+- example/lock-mgr-with-queue.rb
+- example/hash-tuples.rb
+- example/pulse.rb
+- example/transaction-logic.rb
+- example/lease.rb
+- example/chat/chat.rb
+- example/chat/chat-nohistory.rb
+- example/balance-xfer.rb
 - example/add-dsl.rb
-- example/remote.rb
-- example/increment.rb
-- example/matching.rb
-- example/dphil.rb
-- example/broker-optimistic.rb
+- example/lock-mgr.rb
+- example/broker-locking.rb
+- example/dphil-optimistic.rb
 - example/fail-and-retry.rb
-- example/load-balancer.rb
-- example/read-in-trans.rb
-- example/bounded-retry.rb
-- example/pregel/remote.rb
-- example/pregel/pagerank.rb
+- example/fish0.rb
 - example/pregel/pregel.rb
 - example/pregel/distributed.rb
+- example/pregel/pagerank.rb
 - example/pregel/update.rb
+- example/pregel/remote.rb
+- example/pregel/dist-opt.rb
+- example/dphil-optimistic-v2.rb
+- example/broker-optimistic-v2.rb
+- example/remote.rb
 - example/take-nowait.rb
-- example/boolean-match.rb
-- example/lease.rb
-- example/broker-locking.rb
-- example/transaction-logic.rb
+- example/wait-interrupt.rb
+- example/optimist.rb
 - example/message-bus.rb
-- example/small-simplified.rb
-- example/small.rb
-- example/lock-mgr.rb
-- example/take-nowait-caution.rb
-- example/concurrent-transactions.rb
-- example/tcp.rb
-- example/notify.rb
-- example/pulse.rb
-- example/chat/chat.rb
-- example/hash-tuples.rb
 - example/balance-xfer-locking.rb
-- example/balance-xfer-retry.rb
+- example/increment.rb
+- example/child-of-child.rb
+- example/custom-class.rb
+- example/matching.rb
 - example/custom-search.rb
-- example/app-and-tup.rb
-- example/multi-tier/memo2.rb
-- example/multi-tier/http.rb
-- example/multi-tier/multi-sinatras.rb
-- example/multi-tier/kvspace.rb
-- example/multi-tier/memo.rb
-- example/multi-tier/drb.rb
-- example/take-many.rb
-- example/subspaces/simple.rb
-- example/subspaces/shop/shop-v2.rb
-- example/subspaces/shop/shop-v1.rb
-- example/subspaces/pubsub.rb
-- example/dphil-optimistic.rb
+- example/broker-optimistic.rb
+- example/notify.rb
+- example/small-simplified.rb
+- example/broker-queue.rb
 - example/async-transaction.rb
-- example/wait-interrupt.rb
-- example/fish0.rb
-- example/zk/lock.rb
+- example/boolean-match.rb
+- example/load-balancer.rb
+- example/take-many.rb
 - example/deadlock.rb
-- example/fish.rb
-- example/add.rb
-- example/dphil-optimistic-v2.rb
-- example/parallel.rb
-- example/tiny-client.rb
-- example/map-reduce/map-reduce.rb
-- example/map-reduce/remote-map-reduce.rb
-- example/map-reduce/map-reduce-v2.rb
-- example/lock-mgr-with-queue.rb
-- example/balance-xfer.rb
-- example/cancel.rb
-- example/socket-broker.rb
-- example/timeout-trans.rb
-- example/optimist.rb
-- example/tiny-server.rb
-- example/pubsub.rb
-- example/broker-optimistic-v2.rb
-- example/write-wait.rb
-- example/custom-class.rb
-- test/stress/archiver-load.rb
-- test/stress/concurrent-transactions.rb
-- test/system/test-archiver.rb
-- test/lib/mock-client.rb
-- test/lib/time-fuzz.rb
-- test/lib/mock-queue.rb
-- test/lib/mock-seq.rb
+- example/dphil.rb
 - test/lib/testable-worker.rb
+- test/lib/mock-seq.rb
 - test/lib/mock-msg.rb
-- test/unit/test-mock-seq.rb
-- test/unit/test-mock-queue.rb
+- test/lib/mock-queue.rb
+- test/lib/time-fuzz.rb
+- test/lib/mock-client.rb
+- test/system/test-archiver.rb
 - test/unit/test-ops.rb
 - test/unit/test-mock-client.rb
+- test/unit/test-mock-seq.rb
+- test/unit/test-mock-queue.rb
+- test/stress/concurrent-transactions.rb
+- test/stress/archiver-load.rb
 - bin/tup
 - bin/tspy
 homepage: https://github.com/vjoel/tupelo
@@ -223,8 +231,8 @@ signing_key:
 specification_version: 4
 summary: Distributed tuplespace
 test_files:
-- test/unit/test-mock-seq.rb
-- test/unit/test-mock-queue.rb
 - test/unit/test-ops.rb
 - test/unit/test-mock-client.rb
+- test/unit/test-mock-seq.rb
+- test/unit/test-mock-queue.rb
 has_rdoc: