bud 0.9.1 → 0.9.2

data/History.txt

@@ -1,3 +1,14 @@
+== 0.9.2 / ???
+
+* Add new aggregate functions: bool_and() and bool_or()
+* Fix bugs in notin() stratification and implementation (#271)
+* Fix a bug in processing multi-way joins defined inside modules
+* Fix two bugs in reduce() operator
+  * Incorrect default value was sometimes returned
+  * Didn't handle reduce() outputs that aren't tuples with two fields
+* Improve reduce() operator error reporting
+* Improve MRI 1.9 compatibility
+
 == 0.9.1 / 2012-04-10
 
 * Reject attempts to insert a tuple into a collection with more fields than are

data/docs/cheat.md

@@ -237,7 +237,7 @@ Finally, we output every tuple of `bc` that does *not* appear in `t`.
 ## SQL-style grouping/aggregation (and then some) ##
 
 * `bc.group([:col1, :col2], min(:col3))`.  *akin to min(col3) GROUP BY col1,col2*
-  * exemplary aggs: `min`, `max`, `choose`
+  * exemplary aggs: `min`, `max`, `bool_and`, `bool_or`, `choose`
   * summary aggs: `sum`, `avg`, `count`
   * structural aggs: `accum`
 * `bc.argmax([:attr1], :attr2)`      *returns the bc items per attr1 that have highest attr2*

data/lib/bud/aggs.rb

@@ -70,6 +70,34 @@ module Bud
     [Max.new, x]
   end
 
+  class BooleanAnd < ArgExemplary #:nodoc: all
+    def trans(the_state, val)
+      if val == false
+        return val, :replace
+      else
+        return the_state, :ignore
+      end
+    end
+  end
+
+  def bool_and(x)
+    [BooleanAnd.new, x]
+  end
+
+  class BooleanOr < ArgExemplary #:nodoc: all
+    def trans(the_state, val)
+      if val == true
+        return val, :replace
+      else
+        return the_state, :ignore
+      end
+    end
+  end
+
+  def bool_or(x)
+    [BooleanOr.new, x]
+  end
+
   class Choose < ArgExemplary #:nodoc: all
     def trans(the_state, val)
       if the_state.nil?

data/lib/bud/collections.rb

@@ -680,16 +680,14 @@ module Bud
     public
     def *(collection)
       elem1 = to_push_elem
-      j = elem1.join(collection)
-      return j
+      return elem1.join(collection)
     end
 
     def group(key_cols, *aggpairs, &blk)
       elem = to_push_elem
       key_cols = key_cols.map{|k| canonicalize_col(k)} unless key_cols.nil?
       aggpairs = aggpairs.map{|ap| [ap[0], canonicalize_col(ap[1])].compact} unless aggpairs.nil?
-      g = elem.group(key_cols, *aggpairs, &blk)
-      return g
+      return elem.group(key_cols, *aggpairs, &blk)
     end
 
     def notin(collection, *preds, &blk)

data/lib/bud/executor/elements.rb

@@ -1,8 +1,6 @@
 require 'set'
 require 'bud/collections'
 
-ELEMENT_BUFSIZE = 1
-
 module Bud
   # Usage example:
   # p = PushElement.new(:r) do |inp|
@@ -520,8 +518,9 @@ module Bud
   class PushReduce < PushStatefulElement
     def initialize(elem_name, bud_instance, collection_name,
                    schema_in, initial, &blk)
-      @memo = initial
+      @initial = initial
       @blk = blk
+      reset_memo
       super(elem_name, bud_instance, collection_name, schema)
     end
 
@@ -530,13 +529,21 @@ module Bud
     end
 
     def invalidate_cache
-      @memo.clear
+      puts "#{self.class}/#{self.tabname} invalidated" if $BUD_DEBUG
+      reset_memo
+    end
+
+    def reset_memo
+      @memo = Marshal.load(Marshal.dump(@initial))
     end
 
     public
     def flush
-      @memo.each do |k,v|
-        push_out([k,v], false)
+      unless @memo.kind_of? Enumerable
+        raise Bud::TypeError, "output of reduce must be Enumerable: #{@memo.inspect}"
+      end
+      @memo.each do |t|
+        push_out(t, false)
       end
     end
   end

data/lib/bud/executor/group.rb

@@ -21,7 +21,6 @@ module Bud
         agg = (@groups[key].nil? or @groups[key][agg_ix].nil?) ? ap[0].send(:init, agg_input) : ap[0].send(:trans, @groups[key][agg_ix], agg_input)[0]
         @groups[key] ||= Array.new(@aggpairs.length)
         @groups[key][agg_ix] = agg
-        push_out(nil)
       end
     end
 
@@ -40,7 +39,6 @@ module Bud
         (1..grp.length-1).each {|i| outval << grp[i]}
         push_out(outval)
       end
-      #@groups = {}
     end
   end
 
@@ -82,23 +80,20 @@ module Bud
               @winners[key].delete t unless @winners[key].empty?
             end
           else
-            raise "strange result from argagg finalizer"
+            raise Bud::Error, "strange result from argagg finalizer"
           end
         end
         @groups[key] ||= Array.new(@aggpairs.length)
         @groups[key][agg_ix] = agg
-        #push_out(nil)
       end
     end
 
     def flush
-      @groups.keys.each {|g|
-        @winners[g].each{|t|
+      @groups.each_key do |g|
+        @winners[g].each do |t|
           push_out(t, false)
-        }
-      }
-      #@groups = {}
-      #@winners = {}
+        end
+      end
     end
   end
 end

data/lib/bud/executor/join.rb

@@ -14,7 +14,6 @@ module Bud
       @origpreds = preds
       @localpreds = nil
       @selfjoins = []
-      @input_bufs = [[],[]]
       @missing_keys = Set.new
 
       # if any elements on rellist are PushSHJoins, suck up their contents
@@ -265,20 +264,6 @@ module Bud
       return retval
     end
 
-    # given a * expression over 2 collections, form all combos of items that
-    # satisfy +preds+, and for any item from the 1st collection that has no
-    # matches in the 2nd, nil-pad it and include it in the output.
-    public
-    def join(elem2, &blk)
-      elem2 = elem2.to_push_elem unless elem2.class <= PushElement
-      # This constructs a left-deep tree!
-      join = Bud::PushSHJoin.new([self,elem2], @bud_instance, [])
-      @bud_instance.push_joins[@bud_instance.this_stratum] << join
-      elem2.wire_to(join)
-      self.wire_to(join)
-      return join
-    end
-
     undef do_insert
 
     public
@@ -296,11 +281,7 @@ module Bud
       end
       raise Bud::Error, "item #{item.inspect} inserted into join from unknown source #{source.elem_name}" if offsets == $EMPTY
       offsets.each do |offset|
-        buf = @input_bufs[offset]
-        buf << item
-        if buf.length >= ELEMENT_BUFSIZE
-          flush_buf(buf, offset)
-        end
+        insert_item(item, offset)
       end
     end
 
@@ -395,25 +376,6 @@ module Bud
       end
     end
 
-    def flush_buf(buf, offset)
-      buf.each do |item|
-        insert_item(item, offset)
-      end
-      @input_bufs[offset] = []
-    end
-
-    public
-    def flush
-      @input_bufs.each_with_index do |buf, offset|
-        flush_buf(buf, offset) if buf.length > 0
-      end
-    end
-
-    public
-    def stratum_end
-      flush
-    end
-
     ####
     # and now, the Bloom-facing methods
     # given a * expression over n collections, form all combinations of items
@@ -573,23 +535,66 @@ module Bud
     end
   end
 
-  class PushNotIn < PushSHJoin
+
+  # Consider "u <= s.notin(t, s.a => t.b)". notin is a non-monotonic operator, where u depends positively on s,
+  # but negatively on t. Stratification ensures that t is fully computed in a lower stratum, which means that we
+  # can expect multiple iterators on s's side only. If t's scanner were to push its elemends down first, every
+  # insert of s merely needs to be cross checked with the cached elements of 't', and pushed down to the next
+  # element if s notin t. However, if s's scanner were to fire first, we have to wait until the first flush, at which
+  # point we are sure to have seen all the t-side tuples in this tick.
+  class PushNotIn < PushStatefulElement
     def initialize(rellist, bud_instance, preds=nil, &blk) # :nodoc: all
-      if preds.nil? or preds.empty?
-        preds = positionwise_preds(bud_instance, rellist)
+      @lhs, @rhs = rellist
+      @lhs_keycols = nil
+      @rhs_keycols = nil
+      name_in = "#{@lhs.tabname}_notin_#{@rhs.tabname}"
+      super(name_in, bud_instance)
+      setup_preds(preds) unless preds.empty?
+      @rhs_rcvd = false
+      @hash_tables = [{},{}]
+      @rhs_rcvd = false
+      if @lhs_keycols.nil? and blk.nil?
+        # pointwise comparison. Could use zip, but it creates an array for each field pair
+        blk = lambda {|lhs, rhs|
+          lhs.to_a == rhs.to_a
+        }
       end
-      super(rellist, bud_instance, preds)
       set_block(&blk)
-      @cols = rellist[0].cols
-      @exclude = Set.new
     end
 
-    def positionwise_preds(bud_instance, rels)
-      # pairwise colnames, for the minimum number of columns from either
-      return [] if rels[0].cols.length != rels[1].cols.length
-      pairs = rels[0].cols.zip(rels[1].cols)
-      # make a hash of each pair, and return an array of hashes as expected by setup_pred
-      [pairs.reduce(Hash.new) {|h, it| h[it[0]]=it[1]; h}]
+    def setup_preds(preds)
+      # This is simpler than PushSHJoin's setup_preds, because notin is a binary operator where both lhs and rhs are
+      # collections.
+      # preds an array of hash_pairs. For now assume that the attributes are in the same order as the tables.
+      @lhs_keycols, @rhs_keycols = preds.reduce([[], []]) do |memo, item|
+        # each item is a hash
+        l = item.keys[0]
+        r = item.values[0]
+        memo[0] << find_col(l, @lhs)
+        memo[1] << find_col(r, @rhs)
+        memo
+      end
+    end
+    def find_col(colspec, rel)
+      if colspec.is_a? Symbol
+        col_desc = rel.send(colspec)
+        raise "Unknown column #{rel} in #{@rel.tabname}" if col_desc.nil?
+      elsif colspec.is_a? Array
+        col_desc = colspec
+      else
+        raise "Symbol or column spec expected. Got #{colspec}"
+      end
+      col_desc[1] # col_desc is of the form [tabname, colnum, colname]
+    end
+
+    def get_key(item, offset)
+      keycols = offset == 0 ? @lhs_keycols : @rhs_keycols
+      keycols.nil? ? $EMPTY : keycols.map{|col| item[col]}
+    end
+
+    public
+    def invalidate_at_tick
+      true
     end
 
     public
@@ -597,40 +602,68 @@ module Bud
       true
     end
 
-    def push_out(item) # item is a two element array, a tuple from rels[0] and rels[1]
-      # called from PushSHJoin::process_matches, but we don't push the item downstream until stratum end
-      do_exclude = @blk.nil? ? true : @blk.call(item)
-      #puts "#{item} ===>  #{do_exclude}"
-      @exclude << item[0] if do_exclude
+    def insert(item, source)
+      offset = source == @lhs ? 0 : 1
+      key = get_key(item, offset)
+      #puts "#{key}, #{item}, #{offset}"
+      (@hash_tables[offset][key] ||= Set.new).add item
+      if @rhs_rcvd and offset == 0
+        push_lhs(key, item)
+      end
     end
 
-    public
-    def invalidate_cache
-      @exclude.clear
+    def flush
+      # When flush is called the first time, both lhs and rhs scanners have been invoked, and because of stratification
+      # we know that the rhs is not growing any more, until the next tick.
+      unless @rhs_rcvd
+        @rhs_rcvd = true
+        @hash_tables[0].map{|key,values|
+          values.each{|item|
+            push_lhs(key, item)
+          }
+        }
+      end
     end
 
-    def stratum_end
-      flush
-      # Scan through all the cached left rel values, and push out those that are
-      # not in exclude
-      @hash_tables[0].each_value do |s|
-        s.each do |item|
-          next if @exclude.member? item
-          @outputs.each do |ou|
-            if ou.class <= Bud::PushElement
-              ou.insert(item, self)
-            elsif ou.class <= Bud::BudCollection
-              ou.do_insert(item, ou.new_delta)
-            else
-              raise Bud::Error, "expected either a PushElement or a BudCollection"
-            end
-          end
-          # for all the following, o is a BudCollection
-          @deletes.each{|o| o.pending_delete([item])}
-          @delete_keys.each{|o| o.pending_delete_keys([item])}
-          @pendings.each{|o| o.pending_merge([item])}
+    def push_lhs(key, lhs_item)
+      rhs_values = @hash_tables[1][key]
+      process_match(lhs_item, rhs_values)
+    end
+
+    def process_match(lhs_item, rhs_values)
+      exclude = true
+      if rhs_values.nil?
+        # no corresponding rhs. Include in output
+        exclude = false
+      elsif not @blk.nil?
+        # for any lhs * rhs pair, if block returns true, do not push lhs. lhs is pushed
+        # only if there is no match (anti-join)
+        exclude = rhs_values.any?{|rhs_item| @blk.call(lhs_item, rhs_item)}
+      end
+      unless exclude
+        push_out(lhs_item)
+      end
+    end
+
+    public
+    def push_out(item)
+      @outputs.each do |ou|
+        if ou.class <= Bud::PushElement
+          ou.insert(item, self)
+        elsif ou.class <= Bud::BudCollection
+          ou.do_insert(item, ou.new_delta)
+        else
+          raise Bud::Error, "expected either a PushElement or a BudCollection"
         end
       end
+      # for all the following, o is a BudCollection
+      @deletes.each{|o| o.pending_delete([item])}
+      @delete_keys.each{|o| o.pending_delete_keys([item])}
+      @pendings.each{|o| o.pending_merge([item])}
     end
   end
+  def stratum_end
+    @hash_tables = [{},{}]
+    @rhs_rcvd = false
+  end
 end

data/lib/bud/graphs.rb

@@ -74,8 +74,10 @@ class GraphGen #:nodoc: all
     # bottom if the predicate is not in a NEG/+ cycle.  otherwise,
     # its name is "CYC" + concat(sort(predicate names))
     depends.each do |d|
-      head = d.lhs
-      body = d.body
+      # b/c bud_obj was pruned before serialization...
+      (bud_obj, rule_id, lhs, op, body, nm) = d.to_a
+      head = lhs
+      body = body
 
       if @builtin_tables.has_key?(head.to_sym) or @builtin_tables.has_key?(body.to_sym)
         next
@@ -83,9 +85,9 @@ class GraphGen #:nodoc: all
 
       head = name_of(head)
       body = name_of(body)
-      addonce(head, (head != d.lhs), true)
-      addonce(body, (body != d.body))
-      addedge(body, head, d.op, d.nm, (head != d.lhs), d.rule_id)
+      addonce(head, (head != lhs), true)
+      addonce(body, (body != body))
+      addedge(body, head, op, nm, (head != lhs), rule_id)
     end
   end
 

data/lib/bud/rebl.rb

@@ -175,7 +175,7 @@ class ReblShell
   def self.do_exit
     begin
       lines = Readline::HISTORY.to_a.reverse.uniq.reverse
-      lines = lines[-@@maxhistsize, @@maxhistsize] if lines.nitems>@@maxhistsize
+      lines = lines[-@@maxhistsize, @@maxhistsize] if lines.size > @@maxhistsize
       File::open(@@histfile, File::WRONLY|File::CREAT|File::TRUNC) do |io|
         io.puts lines.join("\n")
       end

data/lib/bud/rewrite.rb

@@ -53,16 +53,40 @@ class RuleRewriter < Ruby2Ruby # :nodoc: all
     ty
   end
 
+  def call_to_id(exp)
+    # convert a series of nested calls, a sexp of the form
+    #   s(:call,
+    #       s(:call, s(:call, nil, :a, s(:arglist)), :b, s(:arglist)),
+    #         :bar ,
+    #         s(:arglist)))
+    # to the string "a.b.bar"
+    raise "Malformed exp: #{exp}" unless (exp[0] == :call)
+    _, recv, op, args = exp
+    return recv.nil? ? op.to_s : call_to_id(recv) + "." + op.to_s
+  end
+
   def process_call(exp)
     recv, op, args = exp
     if OP_LIST.include?(op) and @context[1] == :block and @context.length == 4
       # NB: context.length is 4 when see a method call at the top-level of a
       # :defn block -- this is where we expect Bloom statements to appear
       do_rule(exp)
+    elsif op == :notin
+      # special case. In the rule  "z <= x.notin(y)", z depends positively on x, but negatively on y
+      # See further explanation in the "else" section for why this is a special case.
+      notintab = call_to_id(args[1])   # args expected to be of the form (:arglist (:call nil :y ...))
+      @tables[notintab.to_s] = true # "true" denotes non-monotonic dependency.
+      super
     else
+      # Parse a call of the form  a.b.c.foo.
+      # In the most general case, a.b is a nested module, a.b.c is a collection in that module, and
+      # a.b.c.foo is either a method or a field. If it is a method, and non-monotonic at that, we
+      # register a dependency between lhs and the table a.b.c.
+      # Note that notin is treated differently because in  a.b.c.notin(d.e.f), we register a non-monotonic
+      # dependency of lhs on "d.e.f", not with "a.b.c"
       ty, qn, _ = exp_id_type(recv, op, args) # qn = qualified name
       if ty == :collection
-        @tables[qn] = @nm if @collect
+        (@tables[qn] = @nm if @collect) unless @tables[qn]
       #elsif ty == :import .. do nothing
       elsif ty == :not_coll_id
         # check if receiver is a collection, and further if the current exp

data/lib/bud/viz.rb

@@ -4,6 +4,7 @@ require 'gchart'
 require 'bud/state'
 
 class VizOnline #:nodoc: all
+  attr_reader :logtab
   def initialize(bud_instance)
     @bud_instance = bud_instance
     @meta_tables = {'t_rules' => 1, 't_depends' => 1, 't_table_info' => 1, 't_cycle' => 1, 't_stratum' => 1, 't_depends_tc' => 1, 't_table_schema' => 1, 't_provides' => 1}
@@ -62,7 +63,7 @@ class VizOnline #:nodoc: all
       # bud instances cannot/must not be serialized.
       if row[0].class <= Bud
         row = row.to_a if row.class != Array
-        row = row[1..-1] if row[0].class <= Bud
+        row = [row[0].class.to_s] + row[1..-1] if row[0].class <= Bud
       end
       newrow = [tab, @bud_instance.budtime, row]
       begin

data/lib/bud/viz_util.rb

@@ -31,7 +31,7 @@ class VizHelper
 
   def summarize(dir, schema)
     table_io = {}
-    cardinalities.sort{|a, b| a[0] <=> b[0]}.each do |card|
+    cardinalities.to_a.sort{|a, b| a[0] <=> b[0]}.each do |card|
       table_io["#{card.table}_#{card.bud_time}"] = start_table(dir, card.table, card.bud_time, schema[card.table])
     end
 
@@ -44,7 +44,7 @@ class VizHelper
     end
 
     # fix: nested loops
-    times.sort.each do |time|
+    times.to_a.sort.each do |time|
       card_info = {}
       cardinalities.each do |card|
         if card.bud_time == time.bud_time
@@ -178,14 +178,16 @@ module VizUtil #:nodoc: all
     rules = {}
     convertor = Syntax::Convertors::HTML.for_syntax "ruby"
     shredded_rules.each do |s|
-      fout = File.new("#{output_base}/#{s.rule_id}.html", "w+")
+      # b/c accessors don't make it through serialization anymore
+      bud_obj, rule_id, lhs, op, src, orig_src, nm_funcs_called = s.to_a
+      fout = File.new("#{output_base}/#{rule_id}.html", "w+")
       fout.puts header
-      fout.puts "<h1>Rule #{s.rule_id}</h1><br>"
+      fout.puts "<h1>Rule #{rule_id}</h1><br>"
 
-      c = convertor.convert(s.orig_src)
+      c = convertor.convert(orig_src)
       c.sub!(/^<pre>/, "<pre class=\"code\" style='font-size:20px'>\n")
       fout.puts c
-      rules[s.rule_id] = [s.lhs, s.orig_src]
+      rules[rule_id] = [lhs, orig_src]
       fout.close
     end
 
@@ -299,14 +301,13 @@ END_JS
       key = MessagePack.unpack(k)
       tab = key.shift
       time = key.shift
-      # paa
+      # paa: after switch to 1.9, v appears to always be empty
       tup = key[0]
       MessagePack.unpack(v).each {|val| tup << val}
       if meta_tabs[tab]
         raise "non-zero budtime.(tab=#{tab}, time=#{time})  sure this is metadata?" if time != 0 #and strict
         meta[meta_tabs[tab]] ||= []
         meta[meta_tabs[tab]] << tup
-        #ret << tup
       else
         data << [time, tab, tup]
       end
@@ -322,11 +323,15 @@ END_JS
       unless meta[:schminf][tab]
         meta[:schminf][tab] = []
       end
-      meta[:schminf][tab][ts[2]] = ts[1]
+      meta[:schminf][tab][ts[2]] = ts[1] if ts[2]
     end
     return meta, data
   end
 
+  def mapstr(list)
+    list.map{|s| "<th> #{s} </th>"}.join(" ")
+  end
+
   def start_table(dir, tab, time, schema)
     str = "#{dir}/#{tab}_#{time}.html"
     fout = File.new(str, "w")
@@ -334,12 +339,14 @@ END_JS
     fout.puts "<table border=1>"
     # issue with _snd schemas
     if !schema.nil? and schema[0] == "c_bud_time"
-      fout.puts "<tr>" 
+      fout.puts "<tr>"
       if schema[1].length == 2 and schema[1][0].class == Array and schema[1][1].class == Array
-        fout.puts schema[1][0].map{|s| "<th> #{s} </th>"}.join(" ")
-        fout.puts schema[1][1].map{|s| "<th> #{s} </th>"}.join(" ")
+        fout.puts mapstr(schema[1][0])
+        fout.puts mapstr(schema[1][1])
+      elsif schema[1].class == String
+        fout.puts mapstr(schema[1..-1])
       else
-        fout.puts schema[1].map{|s| "<th> #{s} </th>"}.join(" ")
+        fout.puts mapstr(schema[1])
       end
       fout.puts "<tr>"
     end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: bud
 version: !ruby/object:Gem::Version
-  version: 0.9.1
+  version: 0.9.2
   prerelease: 
 platform: ruby
 authors:
@@ -13,11 +13,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-04-10 00:00:00.000000000 Z
+date: 2012-05-20 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: eventmachine
-  requirement: &70136220748940 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -25,10 +25,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220748940
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: fastercsv
-  requirement: &70136220747220 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -36,10 +41,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220747220
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: gchart
-  requirement: &70136220763100 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -47,10 +57,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220763100
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: getopt
-  requirement: &70136220762540 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -58,10 +73,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220762540
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: msgpack
-  requirement: &70136220761500 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -69,10 +89,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220761500
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: ruby-graphviz
-  requirement: &70136220760140 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -80,10 +105,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220760140
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: ruby2ruby
-  requirement: &70136220759200 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - <
@@ -91,10 +121,15 @@ dependencies:
         version: 1.3.1
   type: :runtime
   prerelease: false
-  version_requirements: *70136220759200
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - <
+      - !ruby/object:Gem::Version
+        version: 1.3.1
 - !ruby/object:Gem::Dependency
   name: ruby_parser
-  requirement: &70136220758700 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -102,10 +137,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220758700
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: superators19
-  requirement: &70136220758040 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -113,10 +153,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220758040
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: syntax
-  requirement: &70136220757320 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -124,10 +169,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220757320
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: uuid
-  requirement: &70136220756700 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -135,10 +185,15 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70136220756700
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: minitest
-  requirement: &70136220756180 !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -146,7 +201,12 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *70136220756180
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 description: A prototype of the Bloom distributed programming language as a Ruby DSL.
 email:
 - bloomdevs@gmail.com
@@ -228,7 +288,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: bloom-lang
-rubygems_version: 1.8.17
+rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
 summary: A prototype Bloom DSL for distributed programming.