bud 0.0.4 → 0.0.5

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: bud
 version: !ruby/object:Gem::Version 
-  hash: 23
+  hash: 21
   prerelease: 
   segments: 
   - 0
   - 0
-  - 4
-  version: 0.0.4
+  - 5
+  version: 0.0.5
 platform: ruby
 authors: 
 - Peter Alvaro
@@ -18,8 +18,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-06-01 00:00:00 -07:00
-default_executable: rebl
+date: 2011-06-01 00:00:00 Z
 dependencies: 
 - !ruby/object:Gem::Dependency 
   name: backports
@@ -50,7 +49,7 @@ dependencies:
   type: :runtime
   version_requirements: *id002
 - !ruby/object:Gem::Dependency 
-  name: gchart
+  name: fastercsv
   prerelease: false
   requirement: &id003 !ruby/object:Gem::Requirement 
     none: false
@@ -64,7 +63,7 @@ dependencies:
   type: :runtime
   version_requirements: *id003
 - !ruby/object:Gem::Dependency 
-  name: getopt
+  name: gchart
   prerelease: false
   requirement: &id004 !ruby/object:Gem::Requirement 
     none: false
@@ -78,7 +77,7 @@ dependencies:
   type: :runtime
   version_requirements: *id004
 - !ruby/object:Gem::Dependency 
-  name: i18n
+  name: getopt
   prerelease: false
   requirement: &id005 !ruby/object:Gem::Requirement 
     none: false
@@ -92,7 +91,7 @@ dependencies:
   type: :runtime
   version_requirements: *id005
 - !ruby/object:Gem::Dependency 
-  name: json
+  name: i18n
   prerelease: false
   requirement: &id006 !ruby/object:Gem::Requirement 
     none: false
@@ -106,7 +105,7 @@ dependencies:
   type: :runtime
   version_requirements: *id006
 - !ruby/object:Gem::Dependency 
-  name: msgpack
+  name: json
   prerelease: false
   requirement: &id007 !ruby/object:Gem::Requirement 
     none: false
@@ -120,7 +119,7 @@ dependencies:
   type: :runtime
   version_requirements: *id007
 - !ruby/object:Gem::Dependency 
-  name: nestful
+  name: msgpack
   prerelease: false
   requirement: &id008 !ruby/object:Gem::Requirement 
     none: false
@@ -134,7 +133,7 @@ dependencies:
   type: :runtime
   version_requirements: *id008
 - !ruby/object:Gem::Dependency 
-  name: ParseTree
+  name: nestful
   prerelease: false
   requirement: &id009 !ruby/object:Gem::Requirement 
     none: false
@@ -148,7 +147,7 @@ dependencies:
   type: :runtime
   version_requirements: *id009
 - !ruby/object:Gem::Dependency 
-  name: ruby-graphviz
+  name: ParseTree
   prerelease: false
   requirement: &id010 !ruby/object:Gem::Requirement 
     none: false
@@ -162,7 +161,7 @@ dependencies:
   type: :runtime
   version_requirements: *id010
 - !ruby/object:Gem::Dependency 
-  name: ruby2ruby
+  name: ruby-graphviz
   prerelease: false
   requirement: &id011 !ruby/object:Gem::Requirement 
     none: false
@@ -176,7 +175,7 @@ dependencies:
   type: :runtime
   version_requirements: *id011
 - !ruby/object:Gem::Dependency 
-  name: sexp_path
+  name: ruby2ruby
   prerelease: false
   requirement: &id012 !ruby/object:Gem::Requirement 
     none: false
@@ -190,7 +189,7 @@ dependencies:
   type: :runtime
   version_requirements: *id012
 - !ruby/object:Gem::Dependency 
-  name: superators
+  name: sexp_path
   prerelease: false
   requirement: &id013 !ruby/object:Gem::Requirement 
     none: false
@@ -204,7 +203,7 @@ dependencies:
   type: :runtime
   version_requirements: *id013
 - !ruby/object:Gem::Dependency 
-  name: syntax
+  name: superators
   prerelease: false
   requirement: &id014 !ruby/object:Gem::Requirement 
     none: false
@@ -218,7 +217,7 @@ dependencies:
   type: :runtime
   version_requirements: *id014
 - !ruby/object:Gem::Dependency 
-  name: uuid
+  name: syntax
   prerelease: false
   requirement: &id015 !ruby/object:Gem::Requirement 
     none: false
@@ -231,6 +230,20 @@ dependencies:
         version: "0"
   type: :runtime
   version_requirements: *id015
+- !ruby/object:Gem::Dependency 
+  name: uuid
+  prerelease: false
+  requirement: &id016 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id016
 description: A prototype of the Bloom distributed programming language, as a Ruby DSL.
 email: 
 - bloomdevs@gmail.com
@@ -259,6 +272,7 @@ files:
 - lib/bud/errors.rb
 - lib/bud/graphs.rb
 - lib/bud/joins.rb
+- lib/bud/metrics.rb
 - lib/bud/monkeypatch.rb
 - lib/bud/rebl.rb
 - lib/bud/rewrite.rb
@@ -272,7 +286,6 @@ files:
 - lib/bud/viz.rb
 - lib/bud/viz_util.rb
 - lib/bud.rb
-- lib/bud.rb.orig
 - bin/budplot
 - bin/budtimelines
 - bin/budvis
@@ -281,7 +294,6 @@ files:
 - docs/bfs_arch.png
 - docs/bloom-loop.png
 - docs/bust.md
-- docs/c.html
 - docs/cheat.md
 - docs/deploy.md
 - docs/getstarted.md
@@ -302,8 +314,6 @@ files:
 - examples/chat/chat_protocol.rb
 - examples/chat/chat_server.rb
 - examples/chat/README.md
-- examples/deploy/deploy_ip_port
-- examples/deploy/keys.rb
 - examples/deploy/tokenring-ec2.rb
 - examples/deploy/tokenring-fork.rb
 - examples/deploy/tokenring-thread.rb
@@ -311,7 +321,6 @@ files:
 - examples/README
 - README
 - LICENSE
-has_rdoc: true
 homepage: http://www.bloom-lang.org
 licenses: 
 - BSD
@@ -343,7 +352,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
 requirements: []
 
 rubyforge_project: bloom-lang
-rubygems_version: 1.6.2
+rubygems_version: 1.8.6
 signing_key: 
 specification_version: 3
 summary: A prototype Bloom DSL for distributed programming.

data/docs/c.html

@@ -1,251 +0,0 @@
-<h1>Bud Cheat Sheet</h1>
-<h2>General Bloom Syntax Rules</h2>
-<p>Bloom programs are unordered sets of statements.<br>
-Statements are delimited by semicolons (;) or newlines. <br>
-As in Ruby, backslash is used to escape a newline.<br></p>
-<h2>Simple embedding of Bud in a Ruby Class</h2>
-<pre><code>require 'bud'
-
-class Foo
-    include Bud
-
-    state do
-      ...
-    end
-
-    bloom do
-      ...
-    end
-end
-</code></pre>
-<h2>State Declarations</h2>
-<p>A <code>state</code> block contains Bud collection definitions. A Bud collection is a <em>set</em>
-of <em>facts</em>; each fact is an array of Ruby values. Note that collections do not
-contain duplicates (inserting a duplicate fact into a collection is ignored).</p>
-<p>Like tables in a relational database, zero or more columns in a collection make
-up the collection's <em>key</em>. Attempting to insert two facts that agree on the key
-columns but are not duplicates results in a primary key violation (runtime
-exception).</p>
-<h3>Default Declaration Syntax</h3>
-<p><em>BudCollection :name, [keys] =&gt; [values]</em></p>
-<h3>table</h3>
-<p>Contents persist in memory until explicitly deleted.<br>
-Default attributes: <code>[:key] =&gt; [:val]</code></p>
-<pre><code>table :keyvalue
-table :composite, [:keyfield1, :keyfield2] =&gt; [:values]
-table :noDups, [:field1, field2]
-</code></pre>
-<h3>scratch</h3>
-<p>Contents emptied at start of each timestep.<br>
-Default attributes: <code>[:key] =&gt; [:val]</code></p>
-<pre><code>scratch :stats
-</code></pre>
-<h3>interface</h3>
-<p>Scratch collections, used as connection points between modules.<br>
-Default attributes: <code>[:key] =&gt; [:val]</code></p>
-<pre><code>interface input, :request
-interface output, :response
-</code></pre>
-<h3>channel</h3>
-<p>Network channel manifested as a scratch collection.<br>
-Facts that are inserted into a channel are sent to a remote host; the address of the remote host is specified in an attribute of the channel that is denoted with <code>@</code>.<br>
-Default attributes: <code>[:@address, :val] =&gt; []</code></p>
-<p>(Bloom statements with channel on lhs must use async merge (<code>&lt;~</code>).)</p>
-<pre><code>channel :msgs
-channel :req_chan, [:cartnum, :storenum, :@server] =&gt; [:command, :params]
-</code></pre>
-<h3>periodic</h3>
-<p>System timer manifested as a scratch collection.<br>
-System-provided attributes: <code>[:key] =&gt; [:val]</code><br>
-&nbsp;&nbsp;&nbsp;&nbsp; (<code>key</code> is a unique ID, <code>val</code> is a Ruby Time converted to a string.)<br>
-State declaration includes interval (in seconds).</p>
-<p>(periodic can only be used on rhs of a Bloom statement.)</p>
-<pre><code>periodic :timer, 0.1
-</code></pre>
-<h3>stdio</h3>
-<p>Built-in scratch collection mapped to Ruby's <code>$stdin</code> and <code>$stdout</code><br>
-System-provided attributes: <code>[:line] =&gt; []</code></p>
-<p>Statements with stdio on lhs must use async merge (<code>&lt;~</code>).<br>
-To capture <code>$stdin</code> on rhs, instantiate Bud with <code>:read_stdin</code> option.<br></p>
-<h3>tctable</h3>
-<p>Table collection mapped to a <a href="http://fallabs.com/tokyocabinet/">Tokyo Cabinet</a> store.<br>
-Default attributes: <code>[:key] =&gt; [:val]</code></p>
-<pre><code>tctable :t1
-tctable :t2, [:k1, :k2] =&gt; [:v1, :v2]
-</code></pre>
-<h3>zktable</h3>
-<p>Table collection mapped to an <a href="http://hadoop.apache.org/zookeeper/">Apache Zookeeper</a> store.<br>
-System-provided attributes: <code>[:key] =&gt; [:val]</code><br>
-State declaration includes Zookeeper path and optional TCP string (default: "localhost:2181")<br></p>
-<pre><code>zktable :foo, "/bat"
-zktable :bar, "/dat", "localhost:2182"
-</code></pre>
-<h2>Bloom Statements</h2>
-<p><em>lhs BloomOp rhs</em></p>
-<p>Left-hand-side (lhs) is a named <code>BudCollection</code> object.<br>
-Right-hand-side (rhs) is a Ruby expression producing a <code>BudCollection</code> or <code>Array</code> of <code>Arrays</code>.<br>
-BloomOp is one of the 4 operators listed below.</p>
-<h3>Bloom Operators</h3>
-<p>merges:</p>
-<ul>
-<li><code>left &lt;= right</code> &nbsp;&nbsp;&nbsp;&nbsp; (<em>instantaneous</em>)</li>
-<li><code>left &lt;+ right</code> &nbsp;&nbsp;&nbsp;&nbsp; (<em>deferred</em>)</li>
-<li><code>left &lt;~ right</code> &nbsp;&nbsp;&nbsp;&nbsp; (<em>asynchronous</em>)</li>
-</ul>
-<p>delete:</p>
-<ul>
-<li><code>left &lt;- right</code> &nbsp;&nbsp;&nbsp;&nbsp; (<em>deferred</em>)</li>
-</ul>
-<h3>Collection Methods</h3>
-<p>Standard Ruby methods used on a BudCollection <code>bc</code>:</p>
-<p>implicit map:</p>
-<pre><code>t1 &lt;= bc {|t| [t.col1 + 4, t.col2.chomp]} # formatting/projection
-t2 &lt;= bc {|t| t if t.col = 5}             # selection
-</code></pre>
-<p><code>flat_map</code>:</p>
-<pre><code>require 'backports' # flat_map not included in Ruby 1.8 by default
-
-t3 &lt;= bc.flat_map do |t| # unnest a collection-valued attribute
-  bc.col4.map { |sub| [t.col1, t.col2, t.col3, sub] }
-end
-</code></pre>
-<p><code>bc.reduce</code>, <code>bc.inject</code>:</p>
-<pre><code>t4 &lt;= bc.reduce({}) do |memo, t|  # example: groupby col1 and count
-  memo[t.col1] ||= 0
-  memo[t.col1] += 1
-  memo
-end
-</code></pre>
-<p><code>bc.include?</code>:</p>
-<pre><code>t5 &lt;= bc do |t| # like SQL's NOT IN
-    t unless t2.include?([t.col1, t.col2])
-end
-</code></pre>
-<h2>BudCollection-Specific Methods</h2>
-<p><code>bc.keys</code>: projects <code>bc</code> to key columns<br></p>
-<p><code>bc.values</code>: projects <code>bc</code> to non-key columns<br></p>
-<p><code>bc.inspected</code>: shorthand for <code>bc {|t| [t.inspect]}</code></p>
-<pre><code>stdio &lt;~ bc.inspected
-</code></pre>
-<p><code>chan.payloads</code>: projects <code>chan</code> to non-address columns. Only defined for channels.</p>
-<pre><code># at sender
-msgs &lt;~ requests {|r| "127.0.0.1:12345", r}
-# at receiver
-requests &lt;= msgs.payloads
-</code></pre>
-<p><code>bc.exists?</code>: test for non-empty collection.  Can optionally pass in a block.</p>
-<pre><code>stdio &lt;~ [["Wake Up!"] if timer.exists?]
-stdio &lt;~ requests do |r|
-  [r.inspect] if msgs.exists?{|m| r.ident == m.ident}
-end
-</code></pre>
-<h2>SQL-style grouping/aggregation (and then some)</h2>
-<ul>
-<li><code>bc.group([:col1, :col2], min(:col3))</code>.  <em>akin to min(col3) GROUP BY (col1,col2)</em></li>
-<li>exemplary aggs: <code>min</code>, <code>max</code>, <code>choose</code></li>
-<li>summary aggs: <code>sum</code>, <code>avg</code>, <code>count</code></li>
-<li>structural aggs: <code>accum</code></li>
-<li><code>bc.argmax([:col1], :col2)</code> &nbsp;&nbsp;&nbsp;&nbsp; <em>returns the bc tuple per col1 that has highest col2</em></li>
-<li><code>bc.argmin([:col1], :col2)</code></li>
-</ul>
-<h3>Built-in Aggregates:</h3>
-<ul>
-<li>Exemplary aggs: <code>min</code>, <code>max</code>, <code>choose</code></li>
-<li>Summary aggs: <code>count</code>, <code>sum</code>, <code>avg</code></li>
-<li>Structural aggs: <code>accum</code></li>
-</ul>
-<p>Note that custom aggregation can be written using <code>reduce</code>.</p>
-<h2>Collection Combination (Join)</h2>
-<p>To match items across two (or more) collections, use the <code>*</code> operator, followed by methods to filter/format the result (<code>pairs</code>, <code>matches</code>, <code>combos</code>, <code>lefts</code>, <code>rights</code>).</p>
-<h3>Methods on Combinations (Joins)</h3>
-<p><code>pairs(</code><em>hash pairs</em><code>)</code>: <br>
-Given a <code>*</code> expression, form all pairs of items with value matches in the hash-pairs attributes.  Hash pairs can be fully qualified (<code>coll1.attr1 =&gt; coll2.attr2</code>) or shorthand (<code>:attr1 =&gt; :attr2</code>).</p>
-<pre><code># for each inbound msg, find match in a persistent buffer
-result &lt;= (msg * buffer).pairs(:val =&gt; :key) {|m, b| [m.address, m.val, b.val] }
-</code></pre>
-<p><code>combos(</code><em>hash pairs</em><code>)</code>: <br>
-Alias for <code>pairs</code>, more readable for multi-collection <code>*</code> expressions.  Must use fully-qualified hash pairs.</p>
-<pre><code># the following 2 Bloom statements are equivalent to this SQL
-# SELECT r.a, s_tab.b, t.c
-#   FROM r, s_tab, t
-#  WHERE r.x = s_tab.x
-#    AND s_tab.x = t.x;
-
-# multiple column matches
-out &lt;= (r * s_tab * t).combos(r.x =&gt; s_tab.x, s_tab.x =&gt; t.x) do |t1, t2, t3|
-         [t1.a, t2.b, t3.c]
-       end
-
-# column matching done per pair: this will be very slow
-out &lt;= (r * s_tab * t).combos do |t1, t2, t3|
-         [t1.a, t2.b, t3.c] if r.x == s_tab.x and s_tab.x == t.x
-       end
-</code></pre>
-<p><code>matches</code>:<br>
-Shorthand for <code>combos</code> with hash pairs for all attributes with matching names.</p>
-<pre><code># Equivalent to the above statements if x is the only attribute name in common:
-out &lt;= (r * s_tab * t).matches do {|t1, t2, t3| [t1.a, t2.b, t3.c]}
-</code></pre>
-<p><code>lefts(</code><em>hash pairs</em><code>)</code>: <br>
-Like <code>pairs</code>, but implicitly includes a block that projects down to the left item in each pair.</p>
-<p><code>rights(</code><em>hash pairs</em><code>)</code>: 
-Like <code>pairs</code>, but implicitly includes a block that projects down to the right item in each pair.</p>
-<p><code>flatten</code>:<br>
-<code>flatten</code> is a bit like SQL's <code>SELECT *</code>: it produces a collection of concatenated objects, with a schema that is the concatenation of the schemas in tablelist (with duplicate names disambiguated.) Useful for chaining to operators that expect input collections with schemas, e.g. group:</p>
-<pre><code>out &lt;= (r * s).matches.flatten.group([:a], max(:b))
-</code></pre>
-<p><code>outer(</code><em>hash pairs</em><code>)</code>:<br>
-Left Outer Join.  Like <code>pairs</code>, but objects in the first collection will be produced nil-padded if they have no match in the second collection.</p>
-<h2>Temp Collections</h2>
-<p><code>temp</code><br>
-Temp collections are scratches defined within a <code>bloom</code> block:</p>
-<pre><code>temp :my_scratch1 &lt;= foo
-</code></pre>
-<p>The schema of a temp collection in inherited from the rhs; if the rhs has no
-schema, a simple one is manufactured to suit the data found in the rhs at
-runtime: <code>[c0, c1, ...]</code>.</p>
-<h2>Bud Modules</h2>
-<p>A Bud module combines state (collections) and logic (Bloom rules). Using modules allows your program to be decomposed into a collection of smaller units.</p>
-<p>Definining a Bud module is identical to defining a Ruby module, except that the module can use the <code>bloom</code>, <code>bootstrap</code>, and <code>state</code> blocks described above.</p>
-<p>There are two ways to use a module <em>B</em> in another Bloom module <em>A</em>:</p>
-<ol>
-<li>
-<p><code>include B</code>: This "inlines" the definitions (state and logic) from <em>B</em> into
-     <em>A</em>. Hence, collections defined in <em>B</em> can be accessed from <em>A</em> (via the
-     same syntax as <em>A</em>'s own collections). In fact, since Ruby is
-     dynamically-typed, Bloom statements in <em>B</em> can access collections
-     in <em>A</em>!</p>
-</li>
-<li>
-<p><code>import B =&gt; :b</code>: The <code>import</code> statement provides a more structured way to
-     access another module. Module <em>A</em> can now access state defined in <em>B</em> by
-     using the qualifier <code>b</code>. <em>A</em> can also import two different copies of <em>B</em>,
-     and give them local names <code>b1</code> and <code>b2</code>; these copies will be independent
-     (facts inserted into a collection defined in <code>b1</code> won't also be inserted
-     into <code>b2</code>'s copy of the collection).</p>
-</li>
-</ol>
-<h2>Skeleton of a Bud Module</h2>
-<pre><code>require 'rubygems'
-require 'bud'
-
-module YourModule
-  include Bud
-
-  state do
-    ...
-  end
-
-  bootstrap do
-    ...
-  end
-
-  bloom :some_stmts do
-    ...
-  end
-
-  bloom :more_stmts do
-    ...
-  end
-end
-</code></pre>

data/examples/deploy/deploy_ip_port

@@ -1 +0,0 @@
-67.188.223.50:5555

data/examples/deploy/keys.rb

@@ -1,5 +0,0 @@
-access_key_id <= [["AKIAJZHUX3MXJLQULOLQ"]]
-secret_access_key <= [['8Udv0/qqHIri7A8HxaIJB0E9h89gu+NsgKMHf/5i']]
-key_name <= [["nrc"]]
-ec2_key_location <= [["/Users/neilc/.ssh/nrc.pem"]]
-