remq 0.0.1a → 0.0.3

data/vendor/bundle/gems/diff-lcs-1.1.3/spec/spec_helper.rb

@@ -0,0 +1,284 @@
+# -*- ruby encoding: utf-8 -*-
+
+require 'rubygems'
+require 'pathname'
+
+file   = Pathname.new(__FILE__).expand_path
+path   = file.parent
+parent = path.parent
+
+$:.unshift parent.join('lib')
+
+require 'diff-lcs'
+
+module Diff::LCS::SpecHelper
+  def seq1
+    %w(a b c e h j l m n p)
+  end
+
+  def skipped_seq1
+    %w(a h n p)
+  end
+
+  def seq2
+    %w(b c d e f j k l m r s t)
+  end
+
+  def skipped_seq2
+    %w(d f k r s t)
+  end
+
+  def word_sequence
+    %w(abcd efgh ijkl mnopqrstuvwxyz)
+  end
+
+  def correct_lcs
+    %w(b c e j l m)
+  end
+
+  def correct_forward_diff
+    [
+      [ [ '-',  0, 'a' ] ],
+      [ [ '+',  2, 'd' ] ],
+      [ [ '-',  4, 'h' ],
+        [ '+',  4, 'f' ] ],
+      [ [ '+',  6, 'k' ] ],
+      [ [ '-',  8, 'n' ],
+        [ '-',  9, 'p' ],
+        [ '+',  9, 'r' ],
+        [ '+', 10, 's' ],
+        [ '+', 11, 't' ] ]
+    ]
+  end
+
+  def correct_backward_diff
+    [
+      [ [ '+',  0, 'a' ] ],
+      [ [ '-',  2, 'd' ] ],
+      [ [ '-',  4, 'f' ],
+        [ '+',  4, 'h' ] ],
+      [ [ '-',  6, 'k' ] ],
+      [
+        [ '-',  9, 'r' ],
+        [ '-', 10, 's' ],
+        [ '+',  8, 'n' ],
+        [ '-', 11, 't' ],
+        [ '+',  9, 'p' ] ]
+    ]
+  end
+
+  def correct_forward_sdiff
+    [
+      [ '-', [  0, 'a' ], [  0, nil ] ],
+      [ '=', [  1, 'b' ], [  0, 'b' ] ],
+      [ '=', [  2, 'c' ], [  1, 'c' ] ],
+      [ '+', [  3, nil ], [  2, 'd' ] ],
+      [ '=', [  3, 'e' ], [  3, 'e' ] ],
+      [ '!', [  4, 'h' ], [  4, 'f' ] ],
+      [ '=', [  5, 'j' ], [  5, 'j' ] ],
+      [ '+', [  6, nil ], [  6, 'k' ] ],
+      [ '=', [  6, 'l' ], [  7, 'l' ] ],
+      [ '=', [  7, 'm' ], [  8, 'm' ] ],
+      [ '!', [  8, 'n' ], [  9, 'r' ] ],
+      [ '!', [  9, 'p' ], [ 10, 's' ] ],
+      [ '+', [ 10, nil ], [ 11, 't' ] ]
+    ]
+  end
+
+  def reverse_sdiff(forward_sdiff)
+    forward_sdiff.map { |line|
+      line[1], line[2] = line[2], line[1]
+      case line[0]
+      when '-' then line[0] = '+'
+      when '+' then line[0] = '-'
+      end
+      line
+    }
+  end
+
+  def change_diff(diff)
+    map_diffs(diff, Diff::LCS::Change)
+  end
+
+  def context_diff(diff)
+    map_diffs(diff, Diff::LCS::ContextChange)
+  end
+
+  def format_diffs(diffs)
+    diffs.map do |e|
+      if e.kind_of?(Array)
+        e.map { |f| f.to_a.join }.join(", ")
+      else
+        e.to_a.join
+      end
+    end.join("\n")
+  end
+
+  def map_diffs(diffs, klass = Diff::LCS::ContextChange)
+    diffs.map do |chunks|
+      if klass == Diff::LCS::ContextChange
+        klass.from_a(chunks)
+      else
+        chunks.map { |changes| klass.from_a(changes) }
+      end
+    end
+  end
+
+  def balanced_traversal(s1, s2, callback_type)
+    callback = __send__(callback_type)
+    Diff::LCS.traverse_balanced(s1, s2, callback)
+    callback
+  end
+
+  def balanced_reverse(change_result)
+    new_result = []
+    change_result.each { |line|
+      line = [ line[0], line[2], line[1] ]
+      case line[0]
+      when '<'
+        line[0] = '>'
+      when '>'
+        line[0] = '<'
+      end
+      new_result << line
+    }
+    new_result.sort_by { |line| [ line[1], line[2] ] }
+  end
+
+  def map_to_no_change(change_result)
+    new_result = []
+    change_result.each { |line|
+      case line[0]
+      when '!'
+        new_result << [ '<', line[1], line[2] ]
+        new_result << [ '>', line[1] + 1, line[2] ]
+      else
+        new_result << line
+      end
+    }
+    new_result
+  end
+
+
+  def simple_callback
+    callbacks = Object.new
+    class << callbacks
+      attr_reader :matched_a
+      attr_reader :matched_b
+      attr_reader :discards_a
+      attr_reader :discards_b
+      attr_reader :done_a
+      attr_reader :done_b
+
+      def reset
+        @matched_a = []
+        @matched_b = []
+        @discards_a = []
+        @discards_b = []
+        @done_a = []
+        @done_b = []
+      end
+
+      def match(event)
+        @matched_a << event.old_element
+        @matched_b << event.new_element
+      end
+
+      def discard_b(event)
+        @discards_b << event.new_element
+      end
+
+      def discard_a(event)
+        @discards_a << event.old_element
+      end
+
+      def finished_a(event)
+        @done_a << [event.old_element, event.old_position,
+          event.new_element, event.new_position]
+      end
+
+      def finished_b(event)
+        p "called #finished_b"
+        @done_b << [event.old_element, event.old_position,
+          event.new_element, event.new_position]
+      end
+    end
+    callbacks.reset
+    callbacks
+  end
+
+  def simple_callback_no_finishers
+    simple = simple_callback
+    class << simple
+      undef :finished_a
+      undef :finished_b
+    end
+    simple
+  end
+
+  def balanced_callback
+    cb = Object.new
+    class << cb
+      attr_reader :result
+
+      def reset
+        @result = []
+      end
+
+      def match(event)
+        @result << [ "=", event.old_position, event.new_position ]
+      end
+
+      def discard_a(event)
+        @result << [ "<", event.old_position, event.new_position ]
+      end
+
+      def discard_b(event)
+        @result << [ ">", event.old_position, event.new_position ]
+      end
+
+      def change(event)
+        @result << [ "!", event.old_position, event.new_position ]
+      end
+    end
+    cb.reset
+    cb
+  end
+
+  def balanced_callback_no_change
+    balanced = balanced_callback
+    class << balanced
+      undef :change
+    end
+    balanced
+  end
+
+  module Matchers
+    extend RSpec::Matchers::DSL
+
+    matcher :be_nil_or_match_values do |ii, s1, s2|
+      match do |ee|
+        ee.should satisfy { |vee| vee.nil? || s1[ii] == s2[ee] }
+      end
+    end
+
+    matcher :correctly_map_sequence do |s1|
+      match do |actual|
+        actual.each_with_index { |ee, ii|
+          ee.should be_nil_or_match_values(ii, s1, @s2)
+        }
+      end
+
+      chain :to_other_sequence do |s2|
+        @s2 = s2
+      end
+    end
+  end
+end
+
+RSpec.configure do |conf|
+  conf.include Diff::LCS::SpecHelper
+  conf.alias_it_should_behave_like_to :it_has_behavior, 'has behavior:'
+end
+
+# vim: ft=ruby

data/vendor/bundle/gems/diff-lcs-1.1.3/spec/traverse_balanced_spec.rb

@@ -0,0 +1,286 @@
+# -*- ruby encoding: utf-8 -*-
+
+require 'spec_helper'
+
+describe "Diff::LCS.traverse_balanced" do
+  include Diff::LCS::SpecHelper::Matchers
+
+  shared_examples "with a #change callback" do |s1, s2, result|
+    it "should traverse s1 -> s2 correctly" do
+      traversal = balanced_traversal(s1, s2, :balanced_callback)
+      traversal.result.should == result
+    end
+
+    it "should traverse s2 -> s1 correctly" do
+      traversal = balanced_traversal(s2, s1, :balanced_callback)
+      traversal.result.should == balanced_reverse(result)
+    end
+  end
+
+  shared_examples "without a #change callback" do |s1, s2, result|
+    it "should traverse s1 -> s2 correctly" do
+      traversal = balanced_traversal(s1, s2, :balanced_callback_no_change)
+      traversal.result.should == map_to_no_change(result)
+    end
+
+    it "should traverse s2 -> s1 correctly" do
+      traversal = balanced_traversal(s2, s1, :balanced_callback_no_change)
+      traversal.result.should == map_to_no_change(balanced_reverse(result))
+    end
+  end
+
+  describe "sequences %w(a b c) & %w(a x c)" do
+    s1 = %w(a b c)
+    s2 = %w(a x c)
+
+    result = [
+      [ '=', 0, 0 ],
+      [ '!', 1, 1 ],
+      [ '=', 2, 2 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(a x y c) & %w(a v w c)" do
+    s1 = %w(a x y c)
+    s2 = %w(a v w c)
+
+    result = [
+      [ '=', 0, 0 ],
+      [ '!', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(x y c) & %w(v w c)" do
+    s1 = %w(x y c)
+    s2 = %w(v w c)
+    result = [
+      [ '!', 0, 0 ],
+      [ '!', 1, 1 ],
+      [ '=', 2, 2 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(a x y z) & %w(b v w)" do
+    s1 = %w(a x y z)
+    s2 = %w(b v w)
+    result = [
+      [ '!', 0, 0 ],
+      [ '!', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '<', 3, 3 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(a z) & %w(a)" do
+    s1 = %w(a z)
+    s2 = %w(a)
+    result = [
+      [ '=', 0, 0 ],
+      [ '<', 1, 1 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(z a) & %w(a)" do
+    s1 = %w(z a)
+    s2 = %w(a)
+    result = [
+      [ '<', 0, 0 ],
+      [ '=', 1, 0 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(a b c) & %w(x y z)" do
+    s1 = %w(a b c)
+    s2 = %w(x y z)
+    result = [
+      [ '!', 0, 0 ],
+      [ '!', 1, 1 ],
+      [ '!', 2, 2 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "sequences %w(abcd efgh ijkl mnoopqrstuvwxyz) & []" do
+    s1 = %w(abcd efgh ijkl mnopqrstuvwxyz)
+    s2 = []
+    result = [
+      [ '<', 0, 0 ],
+      [ '<', 1, 0 ],
+      [ '<', 2, 0 ],
+      [ '<', 3, 0 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(a b c) & %Q(a x c)" do
+    s1 = %Q(a b c)
+    s2 = %Q(a x c)
+
+    result = [
+      [ '=', 0, 0 ],
+      [ '=', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ],
+      [ '=', 4, 4 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(a x y c) & %Q(a v w c)" do
+    s1 = %Q(a x y c)
+    s2 = %Q(a v w c)
+
+    result = [
+      [ '=', 0, 0 ],
+      [ '=', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ],
+      [ '!', 4, 4 ],
+      [ '=', 5, 5 ],
+      [ '=', 6, 6 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(x y c) & %Q(v w c)" do
+    s1 = %Q(x y c)
+    s2 = %Q(v w c)
+    result = [
+      [ '!', 0, 0 ],
+      [ '=', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ],
+      [ '=', 4, 4 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(a x y z) & %Q(b v w)" do
+    s1 = %Q(a x y z)
+    s2 = %Q(b v w)
+    result = [
+      [ '!', 0, 0 ],
+      [ '=', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ],
+      [ '!', 4, 4 ],
+      [ '<', 5, 5 ],
+      [ '<', 6, 5 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(a z) & %Q(a)" do
+    s1 = %Q(a z)
+    s2 = %Q(a)
+    result = [
+      [ '=', 0, 0 ],
+      [ '<', 1, 1 ],
+      [ '<', 2, 1 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(z a) & %Q(a)" do
+    s1 = %Q(z a)
+    s2 = %Q(a)
+    result = [
+      [ '<', 0, 0 ],
+      [ '<', 1, 0 ],
+      [ '=', 2, 0 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(a b c) & %Q(x y z)" do
+    s1 = %Q(a b c)
+    s2 = %Q(x y z)
+    result = [
+      [ '!', 0, 0 ],
+      [ '=', 1, 1 ],
+      [ '!', 2, 2 ],
+      [ '=', 3, 3 ],
+      [ '!', 4, 4 ]
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+
+  describe "strings %Q(abcd efgh ijkl mnopqrstuvwxyz) & %Q()" do
+    s1 = %Q(abcd efgh ijkl mnopqrstuvwxyz)
+    s2 = ""
+    result = [
+      [ '<',  0, 0 ],
+      [ '<',  1, 0 ],
+      [ '<',  2, 0 ],
+      [ '<',  3, 0 ],
+      [ '<',  4, 0 ],
+      [ '<',  5, 0 ],
+      [ '<',  6, 0 ],
+      [ '<',  7, 0 ],
+      [ '<',  8, 0 ],
+      [ '<',  9, 0 ],
+      [ '<', 10, 0 ],
+      [ '<', 11, 0 ],
+      [ '<', 12, 0 ],
+      [ '<', 13, 0 ],
+      [ '<', 14, 0 ],
+      [ '<', 15, 0 ],
+      [ '<', 16, 0 ],
+      [ '<', 17, 0 ],
+      [ '<', 18, 0 ],
+      [ '<', 19, 0 ],
+      [ '<', 20, 0 ],
+      [ '<', 21, 0 ],
+      [ '<', 22, 0 ],
+      [ '<', 23, 0 ],
+      [ '<', 24, 0 ],
+      [ '<', 25, 0 ],
+      [ '<', 26, 0 ],
+      [ '<', 27, 0 ],
+      [ '<', 28, 0 ],
+    ]
+
+    it_has_behavior "with a #change callback", s1, s2, result
+    it_has_behavior "without a #change callback", s1, s2, result
+  end
+end
+
+# vim: ft=ruby

data/vendor/bundle/gems/diff-lcs-1.1.3/spec/traverse_sequences_spec.rb

@@ -0,0 +1,83 @@
+# -*- ruby encoding: utf-8 -*-
+
+require 'spec_helper'
+
+describe "Diff::LCS.traverse_sequences" do
+  describe "callback with no finishers" do
+    before(:each) do
+      @callback_s1_s2 = simple_callback_no_finishers
+      Diff::LCS.traverse_sequences(seq1, seq2, @callback_s1_s2)
+
+      @callback_s2_s1 = simple_callback_no_finishers
+      Diff::LCS.traverse_sequences(seq2, seq1, @callback_s2_s1)
+    end
+
+    it "should have the correct LCS result on left-matches" do
+      @callback_s1_s2.matched_a.should == correct_lcs
+      @callback_s2_s1.matched_a.should == correct_lcs
+    end
+
+    it "should have the correct LCS result on right-matches" do
+      @callback_s1_s2.matched_b.should == correct_lcs
+      @callback_s2_s1.matched_b.should == correct_lcs
+    end
+
+    it "should have the correct skipped sequences for the left sequence" do
+      @callback_s1_s2.discards_a.should == skipped_seq1
+      @callback_s2_s1.discards_a.should == skipped_seq2
+    end
+
+    it "should have the correct skipped sequences for the right sequence" do
+      @callback_s1_s2.discards_b.should == skipped_seq2
+      @callback_s2_s1.discards_b.should == skipped_seq1
+    end
+
+    it "should not have anything done markers from the left or right sequences" do
+      @callback_s1_s2.done_a.should be_empty
+      @callback_s1_s2.done_b.should be_empty
+      @callback_s2_s1.done_a.should be_empty
+      @callback_s2_s1.done_b.should be_empty
+    end
+  end
+
+  describe "callback with finisher" do
+    before(:each) do
+      @callback_s1_s2 = simple_callback
+      Diff::LCS.traverse_sequences(seq1, seq2, @callback_s1_s2)
+      @callback_s2_s1 = simple_callback
+      Diff::LCS.traverse_sequences(seq2, seq1, @callback_s2_s1)
+    end
+
+    it "should have the correct LCS result on left-matches" do
+      @callback_s1_s2.matched_a.should == correct_lcs
+      @callback_s2_s1.matched_a.should == correct_lcs
+    end
+
+    it "should have the correct LCS result on right-matches" do
+      @callback_s1_s2.matched_b.should == correct_lcs
+      @callback_s2_s1.matched_b.should == correct_lcs
+    end
+
+    it "should have the correct skipped sequences for the left sequence" do
+      @callback_s1_s2.discards_a.should == skipped_seq1
+      @callback_s2_s1.discards_a.should == skipped_seq2
+    end
+
+    it "should have the correct skipped sequences for the right sequence" do
+      @callback_s1_s2.discards_b.should == skipped_seq2
+      @callback_s2_s1.discards_b.should == skipped_seq1
+    end
+
+    it "should have done markers differently-sized sequences" do
+      @callback_s1_s2.done_a.should == [[ "p", 9, "s", 10 ]]
+      @callback_s1_s2.done_b.should be_empty
+
+      # 20110731 I don't yet understand why this particular behaviour
+      # isn't transitive.
+      @callback_s2_s1.done_a.should be_empty
+      @callback_s2_s1.done_b.should be_empty
+    end
+  end
+end
+
+# vim: ft=ruby

data/vendor/bundle/gems/hiredis-0.4.5/COPYING

@@ -0,0 +1,28 @@
+Copyright (c) 2010-2012, Pieter Noordhuis
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of Redis nor the names of its contributors may be used to
+  endorse or promote products derived from this software without specific prior
+  written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.