dxruby_rp5 0.0.1

data/spec/vendor/diff-lcs-1.2.5/spec/traverse_balanced_spec.rb

@@ -0,0 +1,310 @@
+# -*- 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 "identical string sequences ('abc')" do
+    s1 = s2 = "abc"
+
+    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 "identical array sequences %w(a b c)" do
+    s1 = s2 = %w(a b 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 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

data/spec/vendor/diff-lcs-1.2.5/spec/traverse_sequences_spec.rb

@@ -0,0 +1,139 @@
+# -*- ruby encoding: utf-8 -*-
+
+require 'spec_helper'
+
+describe "Diff::LCS.traverse_sequences" do
+  describe "callback with no finishers" do
+    describe "over (seq1, seq2)" 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 with 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 with 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 "over (hello, hello)" do
+      before(:each) do
+        @callback = simple_callback_no_finishers
+        Diff::LCS.traverse_sequences(hello, hello, @callback)
+      end
+
+      it "should have the correct LCS result on left-matches" do
+        @callback.matched_a.should == hello.split(//)
+      end
+
+      it "should have the correct LCS result on right-matches" do
+        @callback.matched_b.should == hello.split(//)
+      end
+
+      it "should have the correct skipped sequences with the left sequence", :only => true do
+        @callback.discards_a.should be_empty
+      end
+
+      it "should have the correct skipped sequences with the right sequence" do
+        @callback.discards_b.should be_empty
+      end
+
+      it "should not have anything done markers from the left or right sequences" do
+        @callback.done_a.should be_empty
+        @callback.done_b.should be_empty
+      end
+    end
+
+    describe "over (hello_ary, hello_ary)" do
+      before(:each) do
+        @callback = simple_callback_no_finishers
+        Diff::LCS.traverse_sequences(hello_ary, hello_ary, @callback)
+      end
+
+      it "should have the correct LCS result on left-matches" do
+        @callback.matched_a.should == hello_ary
+      end
+
+      it "should have the correct LCS result on right-matches" do
+        @callback.matched_b.should == hello_ary
+      end
+
+      it "should have the correct skipped sequences with the left sequence" do
+        @callback.discards_a.should be_empty
+      end
+
+      it "should have the correct skipped sequences with the right sequence" do
+        @callback.discards_b.should be_empty
+      end
+
+      it "should not have anything done markers from the left or right sequences" do
+        @callback.done_a.should be_empty
+        @callback.done_b.should be_empty
+      end
+    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

data/spec/vendor/rspec-2.14.1/License.txt

@@ -0,0 +1,24 @@
+(The MIT License)
+
+Copyright (c) 2009 Chad Humphries, David Chelimsky
+Copyright (c) 2006 David Chelimsky, The RSpec Development Team
+Copyright (c) 2005 Steven Baker
+
+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/spec/vendor/rspec-2.14.1/README.md

@@ -0,0 +1,47 @@
+# RSpec-2
+
+Behaviour Driven Development for Ruby
+
+# Description
+
+rspec-2.x is a meta-gem, which depends on the rspec-core, rspec-expectations
+and rspec-mocks gems. Each of these can be installed separately and actived in
+isolation with the `gem` command. Among other benefits, this allows you to use
+rspec-expectations, for example, in Test::Unit::TestCase if you happen to
+prefer that style.
+
+Conversely, if you like RSpec's approach to declaring example groups and
+examples (`describe` and `it`) but prefer Test::Unit assertions and mocha, rr
+or flexmock for mocking, you'll be able to do that without having to load the
+components of rspec that you're not using.
+
+## Documentation
+
+### rspec-core
+
+* [Cucumber features](http://relishapp.com/rspec/rspec-core)
+* [RDoc](http://rubydoc.info/gems/rspec-core/frames)
+
+### rspec-expectations
+
+* [Cucumber features](http://relishapp.com/rspec/rspec-expectations)
+* [RDoc](http://rubydoc.info/gems/rspec-expectations/frames)
+
+### rspec-mocks
+
+* [Cucumber features](http://relishapp.com/rspec/rspec-mocks)
+* [RDoc](http://rubydoc.info/gems/rspec-mocks/frames)
+
+## Install
+
+    gem install rspec
+
+## Contribute
+
+* [http://github.com/rspec/rspec-dev](http://github.com/rspec/rspec-dev)
+
+## Also see
+
+* [http://github.com/rspec/rspec-core](http://github.com/rspec/rspec-core)
+* [http://github.com/rspec/rspec-expectations](http://github.com/rspec/rspec-expectations)
+* [http://github.com/rspec/rspec-mocks](http://github.com/rspec/rspec-mocks)

data/spec/vendor/rspec-2.14.1/lib/rspec/version.rb

@@ -0,0 +1,5 @@
+module RSpec # :nodoc:
+  module Version # :nodoc:
+    STRING = '2.14.1'
+  end
+end

data/spec/vendor/rspec-2.14.1/lib/rspec.rb

@@ -0,0 +1,3 @@
+require 'rspec/core'
+require 'rspec/version'
+

data/spec/vendor/rspec-core-2.14.7/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+-
+README.md
+License.txt
+Changelog.md

data/spec/vendor/rspec-core-2.14.7/.yardopts

@@ -0,0 +1,6 @@
+--exclude features
+--no-private
+--markup markdown
+-
+Changelog.md
+License.txt