engineyard-serverside 2.0.4 → 2.0.5.pre

data/lib/vendor/celluloid/lib/celluloid/timers.rb

@@ -1,109 +0,0 @@
-module Celluloid
-  # Low precision timers implemented in pure Ruby
-  class Timers
-    def initialize
-      @timers = []
-    end
-
-    # Call the given block after the given interval
-    def add(interval, &block)
-      Timer.new(self, interval, block)
-    end
-
-    # Wait for the next timer and fire it
-    def wait
-      return if @timers.empty?
-
-      interval = wait_interval
-      sleep interval if interval >= Timer::QUANTUM
-      fire
-    end
-
-    # Interval to wait until when the next timer will fire
-    def wait_interval
-      @timers.first.time - Time.now unless empty?
-    end
-
-    # Fire all timers that are ready
-    def fire
-      return if @timers.empty?
-
-      time = Time.now + Timer::QUANTUM
-      while not empty? and time > @timers.first.time
-        timer = @timers.shift
-        timer.call
-      end
-    end
-
-    # Insert a timer into the active timers
-    def insert(timer)
-      @timers.insert(index(timer), timer)
-    end
-
-    # Remove a given timer from the set we're monitoring
-    def cancel(timer)
-      @timers.delete timer
-    end
-
-    # Are there any timers pending?
-    def empty?
-      @timers.empty?
-    end
-
-    # Index where a timer would be located in the sorted timers array
-    def index(timer)
-      l, r = 0, @timers.size - 1
-
-      while l <= r
-        m = (r + l) / 2
-        if timer < @timers.at(m)
-          r = m - 1
-        else
-          l = m + 1
-        end
-      end
-      l
-    end
-  end
-
-  # An individual timer set to fire a given proc at a given time
-  class Timer
-    include Comparable
-
-    # The timer system is guaranteed (at least by the specs) to be this precise
-    # during normal operation. Long blocking calls within actors will delay the
-    # firing of timers
-    QUANTUM = 0.02
-
-    attr_reader :interval, :time
-
-    def initialize(timers, interval, block)
-      @timers, @interval = timers, interval
-      @block = block
-
-      reset
-    end
-
-    def <=>(other)
-      @time <=> other.time
-    end
-
-    # Cancel this timer
-    def cancel
-      @timers.cancel self
-    end
-
-    # Reset this timer
-    def reset
-      @timers.cancel self if defined?(@time)
-      @time = Time.now + @interval
-      @timers.insert self
-    end
-
-    # Fire the block
-    def fire
-      @block.call
-    end
-    alias_method :call, :fire
-  end
-end

data/lib/vendor/celluloid/lib/celluloid/version.rb

@@ -1,4 +0,0 @@
-module Celluloid
-  VERSION = '0.7.1'
-  def self.version; VERSION; end
-end

data/lib/vendor/dataflow/HISTORY

@@ -1,52 +0,0 @@
-== 0.3.0 / 2009-08-29
-
-* Major enhancements
- 
-  * "flow" abstraction for threading (use it to create threads and optionally 
-    pass it a variable to be bound output, or override it to modify need_later
-    for other threading strategies such as thread pools)
-
-  * Dataflow::FutureQueue
-
-  * Nested binding through variables possible
- 
-* Minor enhancements
-  
-  * Better #inspect and UnificationError debugging output
- 
-  * "barrier" abstraction for manually preventing execution until variable
-    arguments have been bound
-
-  * Use mixin methods as class/module methods optionally
-    e.g. Dataflow.local {|v| v }
-
-== 0.2.1 / 2009-07-29
-
- * Minor enhancements
-   
-   * Leave __send__ and __id__ alone when acting as a proxy
-
-== 0.2.0 / 2009-07-09
-
-* Major enhancements
- 
-  * Made equality between objects and dataflow variables more transparent
-    (load equality changes with: require 'dataflow/equality')
- 
-* Minor enhancements
-  
-  * Made #inspect work with unbound variables to not crash deubggers/repls/etc
- 
-  * Made relationship between lazy and dataflow behavior more strict
-
-== 0.1.1 / 2009-06-13
- 
-* Minor enhancements
- 
-  * Got the "require_path" set correctly so rubygems can be used =) 
-
-== 0.1.0 / 2009-06-13
- 
-* 1 major enhancement
- 
-  * Birthday!

data/lib/vendor/dataflow/LICENSE

@@ -1,19 +0,0 @@
-Copyright (c) 2009 Larry Diehl
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.

data/lib/vendor/dataflow/README.textile

@@ -1,290 +0,0 @@
-h1. What's this?
-
-A Ruby library that adds Dataflow variables (inspired by the Oz
-language). Dataflow variables have the property that they can only
-be bound/assigned to once, or have an equivalent value as an existing
-assignment (see "unification").
-
-Dataflow variables must be declared before they are used, and can be
-passed around as data without actually being bound. If the variable
-gets used (in this library this means a method call) while being
-unbound then the currently executing thread will suspend.
-
-h1. What's the point?
-
-Ruby is Object Oriented (with the ability to mutate local, instance,
-class, and global variables, and even constants), and on top of that
-it has powerful reflection and meta-programming abilities. While these
-features are useful for certain problems, they are not within the
-declarative model. Staying in the declarative model gives one 2 advantages:
-# It is easy to reason about what the program does
-# Simple but powerful concurrency is possible
-
-Ruby, like many other OO languages, is facing the hurdles of taking
-advantage of the increase of processor cores within a simple parallel
-programming model. This library lets you program Ruby in the
-declarative concurrent model when you need to take advantage of multiple cores
-(assuming a Ruby implementation that uses native threads in one way or
-another).
-
-The trick to this kind of programming is binding variables from other
-threads. The nice thing is that many existing
-libraries/classes/methods can still be used, just avoid
-side-effects. Use regular Ruby threading to create threads, use
-"local" or "declare" to create new variables, and use "unify" to bind
-variables.
-
-h1. Install
-
-To install the latest release as a gem:
-<pre>sudo gem install dataflow</pre>
-
-h1. IRC
-
-<pre>#dataflow-gem @ freenode.net</pre>
-
-h1. Examples
-
-<pre>
-# Local variables
-include Dataflow
- 
-local do |x, y, z|
-  # notice how the order automatically gets resolved
-  Thread.new { unify y, x + 2 }
-  Thread.new { unify z, y + 3 }
-  Thread.new { unify x, 1 }
-  z #=> 6
-end
-</pre>
-
-<pre>
-# Module methods version
- 
-Dataflow.local do |x, y, z|
-  # notice how the order automatically gets resolved
-  Thread.new { Dataflow.unify y, x + 2 }
-  Thread.new { Dataflow.unify z, y + 3 }
-  Thread.new { Dataflow.unify x, 1 }
-  z #=> 6
-end
-
-# Note that a gobal Dataflow.declare is not supported
-</pre>
-
-<pre>
-# Instance variables
-class AnimalHouse
-  include Dataflow
-  declare :small_cat, :big_cat
-
-  def fetch_big_cat
-    Thread.new { unify big_cat, small_cat.upcase }
-    unify small_cat, 'cat'
-    big_cat
-  end
-end
-
-AnimalHouse.new.fetch_big_cat #=> 'CAT'
-</pre>
-
-<pre>
-# Data-driven concurrency
-include Dataflow
-
-local do |stream, doubles, triples, squares|
-  unify stream, Array.new(5) { Dataflow::Variable.new }
-
-  Thread.new { unify doubles, stream.map {|n| n*2 } }
-  Thread.new { unify triples, stream.map {|n| n*3 } }
-  Thread.new { unify squares, stream.map {|n| n**2 } }  
-
-  Thread.new { stream.each {|x| unify x, rand(100) } }
-
-  puts "original: #{stream.inspect}"
-  puts "doubles:  #{doubles.inspect}"
-  puts "triples:  #{triples.inspect}"
-  puts "squares:  #{squares.inspect}"  
-end
-</pre>
-
-<pre>
-# By-need trigger laziness
-include Dataflow
-
-local do |x, y, z|
-  Thread.new { unify y, by_need { 4 } }
-  Thread.new { unify z, x + y }
-  Thread.new { unify x, by_need { 3 } }
-  z #=> 7
-end
-</pre>
-
-<pre>
-# Need-later future expressions
-include Dataflow
-
-local do |x, y, z|
-  unify y, need_later { 4 }
-  unify z, need_later { x + y }
-  unify x, need_later { 3 }
-  z #=> 7
-end        
-</pre>
-
-<pre>
-include Dataflow
-
-# flow without parameters
-local do |x|
-  flow do 
-    # other stuff
-    unify x, 1337
-  end
-  x #=> 1337
-end
-
-# flow with an output parameter
-local do |x|
-  flow(x) do
-    # other stuff
-    1337
-  end
-  x #=> 1337
-end
-</pre>
-
-<pre>
-# barrier
-include Dataflow
-
-local do |lock1, lock2|
-  flow { unify lock1, :unlocked }
-  flow { unify lock2, :unlocked }
-  barrier lock1, lock2
-  puts "Barrier broken!"  
-end
-</pre>
-
-<pre>
-# FutureQueue
-include Dataflow
-
-local do |queue, first, second|
-  unify queue, Dataflow::FutureQueue.new
-  queue.pop first
-  queue.push 1
-  queue.push 2
-  queue.pop second
-  first #=> 1
-  second #=> 2
-end
-</pre>
-
-h1. Anonymous variables
-
-Sometimes you may want to pack a data structure with variables that do not need to be referenced with labels. For those cases anonymous variables are a good choice, here are some options:
-
-<pre>
-include Dataflow
-Array.new(3) { Dataflow::Variable.new }
-Array.new(3) { Dataflow.local }
-Array.new(3) { local }
-# and technically not anonymous
-Array.new(3) { local {|v| v } }
-</pre>
-
-h1. Debugging
-
-If you are having trouble and need to debug dataflow variables, simply call #inspect.
-
-If the variable has already been bound, it call inspect on its bound value like normal.However, if the variable is not bound yet then you will get a special string that contains the proxies #__id__ that you can use to track down which proxy objects are being passed around to which parts of your program:
-<pre>
-include Dataflow
-local do |my_var| 
-  my_var.inspect # => #<Dataflow::Variable:2637860 unbound> 
-end
-</pre>
-
-h1. Fork method customization
-
-By default both #flow and #need_later use Thread.fork as their fork method. Youc an access the fork method via Dataflow.forker.
-
-If you would like to use a custom forker, simple set it to an object that responds to #call and internally calls a block passed to it (for an example of a synchronous forker, see spec/forker_spec.rb):
-<pre>
-Dataflow.forker = MyClass.method(:fork_with_threadpool)
-</pre>
-
-Also note that #flow is used interally by #need_later, in case you want to override that specifically.
-
-h1. Ports using Dataflow
-
-Ports are an extension of the declarative concurrent model to support nondeterministic behavior. They accomplish this through the use of a single state variable. Ports are also inspired by the Oz language.
-
-An Actor class in the style of Erlang message-passing processes is also provided. It makes use of the asynchronous behavior of ports, but otherwise uses no state variables.
-
-h1. Examples using Ports
-
-<pre>
-include Dataflow
-
-local do |port, stream|
-  unify port, Dataflow::Port.new(stream)
-  Thread.new {port.send 2}
-  Thread.new {port.send 8}
-  Thread.new {port.send 1024}
-  stream.take(3).sort #=> [2, 8, 1024]
-end
-</pre>
-
-h1. Examples using Actors
-
-<pre>
-include Dataflow
-
-Ping = Actor.new {
-  3.times {
-    case receive
-    when "Ping"
-      puts "Ping"
-      Pong.send "Pong"
-    end
-  }
-}
-
-Pong = Actor.new {
-  3.times {
-    case receive
-    when "Pong"
-      puts "Pong"
-      Ping.send "Ping"
-    end
-  }
-}
-
-Actor.new { Ping.send "Ping" }
-
-Ping.join
-Pong.join
-</pre>
-
-h1. Equality
-
-Most Ruby implmentations will not use method calls for equality
-operations in base types/classes. This means equality between dataflow
-variables and those base types will not behave as expected. Require
-the following to get equality on base types that uses method calls,
-while still passing rubyspec:
-
-<pre>require "dataflow/equality"</pre>
-
-h1. References
-
-The basis of dataflow variables around a language is not common among
-popular languages and may be confusing to some. For an in-depth
-introduction to the Oz language and the techniques used in this
-library (including by_need triggers, port objects, and comparisons to Erlang message passing) see the book "Concepts, Techniques, and Models of Computer Programming":http://en.wikipedia.org/wiki/Concepts,_Techniques,_and_Models_of_Computer_Programming
-
-h1. Contributors
-
-larrytheliquid, amiller