immutable-ruby 0.0.4 → 0.2.0

data/spec/lib/immutable/sorted_set/select_spec.rb

@@ -1,61 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  [:select, :find_all].each do |method|
-    describe "##{method}" do
-      let(:sorted_set) { SS["A", "B", "C"] }
-
-      context "when everything matches" do
-        it "preserves the original" do
-          sorted_set.send(method) { true }
-          sorted_set.should eql(SS["A", "B", "C"])
-        end
-
-        it "returns self" do
-          sorted_set.send(method) { |item| true }.should equal(sorted_set)
-        end
-      end
-
-      context "when only some things match" do
-        context "with a block" do
-          it "preserves the original" do
-            sorted_set.send(method) { |item| item == "A" }
-            sorted_set.should eql(SS["A", "B", "C"])
-          end
-
-          it "returns a set with the matching values" do
-            sorted_set.send(method) { |item| item == "A" }.should eql(SS["A"])
-          end
-        end
-
-        context "with no block" do
-          it "returns an Enumerator" do
-            sorted_set.send(method).class.should be(Enumerator)
-            sorted_set.send(method).each { |item| item == "A" }.should eql(SS["A"])
-          end
-        end
-      end
-
-      context "when nothing matches" do
-        it "preserves the original" do
-          sorted_set.send(method) { |item| false }
-          sorted_set.should eql(SS["A", "B", "C"])
-        end
-
-        it "returns the canonical empty set" do
-          sorted_set.send(method) { |item| false }.should equal(Immutable::EmptySortedSet)
-        end
-      end
-
-      context "from a subclass" do
-        it "returns an instance of the same class" do
-          subclass = Class.new(Immutable::SortedSet)
-          instance = subclass.new(['A', 'B', 'C'])
-          instance.send(method) { true }.class.should be(subclass)
-          instance.send(method) { false }.class.should be(subclass)
-          instance.send(method) { rand(2) == 0 }.class.should be(subclass)
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/size_spec.rb

@@ -1,17 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  [:size, :length].each do |method|
-    describe "##{method}" do
-      [
-        [[], 0],
-        [["A"], 1],
-        [%w[A B C], 3],
-      ].each do |values, result|
-        it "returns #{result} for #{values.inspect}" do
-          SS[*values].send(method).should == result
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/slice_spec.rb

@@ -1,256 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  let(:sorted_set) { SS[1,2,3,4] }
-  let(:big) { SS.new(1..10000) }
-
-  [:slice, :[]].each do |method|
-    describe "##{method}" do
-      context "when passed a positive integral index" do
-        it "returns the element at that index" do
-          sorted_set.send(method, 0).should be(1)
-          sorted_set.send(method, 1).should be(2)
-          sorted_set.send(method, 2).should be(3)
-          sorted_set.send(method, 3).should be(4)
-          sorted_set.send(method, 4).should be(nil)
-          sorted_set.send(method, 10).should be(nil)
-
-          big.send(method, 0).should be(1)
-          big.send(method, 9999).should be(10000)
-        end
-
-        it "leaves the original unchanged" do
-          sorted_set.should eql(SS[1,2,3,4])
-        end
-      end
-
-      context "when passed a negative integral index" do
-        it "returns the element which is number (index.abs) counting from the end of the sorted_set" do
-          sorted_set.send(method, -1).should be(4)
-          sorted_set.send(method, -2).should be(3)
-          sorted_set.send(method, -3).should be(2)
-          sorted_set.send(method, -4).should be(1)
-          sorted_set.send(method, -5).should be(nil)
-          sorted_set.send(method, -10).should be(nil)
-
-          big.send(method, -1).should be(10000)
-          big.send(method, -10000).should be(1)
-        end
-      end
-
-      context "when passed a positive integral index and count" do
-        it "returns 'count' elements starting from 'index'" do
-          sorted_set.send(method, 0, 0).should  eql(SS.empty)
-          sorted_set.send(method, 0, 1).should  eql(SS[1])
-          sorted_set.send(method, 0, 2).should  eql(SS[1,2])
-          sorted_set.send(method, 0, 4).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, 0, 6).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, 0, -1).should be_nil
-          sorted_set.send(method, 0, -2).should be_nil
-          sorted_set.send(method, 0, -4).should be_nil
-          sorted_set.send(method, 2, 0).should  eql(SS.empty)
-          sorted_set.send(method, 2, 1).should  eql(SS[3])
-          sorted_set.send(method, 2, 2).should  eql(SS[3,4])
-          sorted_set.send(method, 2, 4).should  eql(SS[3,4])
-          sorted_set.send(method, 2, -1).should be_nil
-          sorted_set.send(method, 4, 0).should  eql(SS.empty)
-          sorted_set.send(method, 4, 2).should  eql(SS.empty)
-          sorted_set.send(method, 4, -1).should be_nil
-          sorted_set.send(method, 5, 0).should  be_nil
-          sorted_set.send(method, 5, 2).should  be_nil
-          sorted_set.send(method, 5, -1).should be_nil
-          sorted_set.send(method, 6, 0).should  be_nil
-          sorted_set.send(method, 6, 2).should  be_nil
-          sorted_set.send(method, 6, -1).should be_nil
-
-          big.send(method, 0, 3).should    eql(SS[1,2,3])
-          big.send(method, 1023, 4).should eql(SS[1024,1025,1026,1027])
-          big.send(method, 1024, 4).should eql(SS[1025,1026,1027,1028])
-        end
-
-        it "leaves the original unchanged" do
-          sorted_set.should eql(SS[1,2,3,4])
-        end
-      end
-
-      context "when passed a negative integral index and count" do
-        it "returns 'count' elements, starting from index which is number 'index.abs' counting from the end of the array" do
-          sorted_set.send(method, -1, 0).should  eql(SS.empty)
-          sorted_set.send(method, -1, 1).should  eql(SS[4])
-          sorted_set.send(method, -1, 2).should  eql(SS[4])
-          sorted_set.send(method, -1, -1).should be_nil
-          sorted_set.send(method, -2, 0).should  eql(SS.empty)
-          sorted_set.send(method, -2, 1).should  eql(SS[3])
-          sorted_set.send(method, -2, 2).should  eql(SS[3,4])
-          sorted_set.send(method, -2, 4).should  eql(SS[3,4])
-          sorted_set.send(method, -2, -1).should be_nil
-          sorted_set.send(method, -4, 0).should  eql(SS.empty)
-          sorted_set.send(method, -4, 1).should  eql(SS[1])
-          sorted_set.send(method, -4, 2).should  eql(SS[1,2])
-          sorted_set.send(method, -4, 4).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, -4, 6).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, -4, -1).should be_nil
-          sorted_set.send(method, -5, 0).should  be_nil
-          sorted_set.send(method, -5, 1).should  be_nil
-          sorted_set.send(method, -5, 10).should be_nil
-          sorted_set.send(method, -5, -1).should be_nil
-
-          big.send(method, -1, 1).should eql(SS[10000])
-          big.send(method, -1, 2).should eql(SS[10000])
-          big.send(method, -6, 2).should eql(SS[9995,9996])
-        end
-      end
-
-      context "when passed a Range" do
-        it "returns the elements whose indexes are within the given Range" do
-          sorted_set.send(method, 0..-1).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, 0..-10).should eql(SS.empty)
-          sorted_set.send(method, 0..0).should   eql(SS[1])
-          sorted_set.send(method, 0..1).should   eql(SS[1,2])
-          sorted_set.send(method, 0..2).should   eql(SS[1,2,3])
-          sorted_set.send(method, 0..3).should   eql(SS[1,2,3,4])
-          sorted_set.send(method, 0..4).should   eql(SS[1,2,3,4])
-          sorted_set.send(method, 0..10).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, 2..-10).should eql(SS.empty)
-          sorted_set.send(method, 2..0).should   eql(SS.empty)
-          sorted_set.send(method, 2..2).should   eql(SS[3])
-          sorted_set.send(method, 2..3).should   eql(SS[3,4])
-          sorted_set.send(method, 2..4).should   eql(SS[3,4])
-          sorted_set.send(method, 3..0).should   eql(SS.empty)
-          sorted_set.send(method, 3..3).should   eql(SS[4])
-          sorted_set.send(method, 3..4).should   eql(SS[4])
-          sorted_set.send(method, 4..0).should   eql(SS.empty)
-          sorted_set.send(method, 4..4).should   eql(SS.empty)
-          sorted_set.send(method, 4..5).should   eql(SS.empty)
-          sorted_set.send(method, 5..0).should   be_nil
-          sorted_set.send(method, 5..5).should   be_nil
-          sorted_set.send(method, 5..6).should   be_nil
-
-          big.send(method, 159..162).should     eql(SS[160,161,162,163])
-          big.send(method, 160..162).should     eql(SS[161,162,163])
-          big.send(method, 161..162).should     eql(SS[162,163])
-          big.send(method, 9999..10100).should  eql(SS[10000])
-          big.send(method, 10000..10100).should eql(SS.empty)
-          big.send(method, 10001..10100).should be_nil
-
-          sorted_set.send(method, 0...-1).should  eql(SS[1,2,3])
-          sorted_set.send(method, 0...-10).should eql(SS.empty)
-          sorted_set.send(method, 0...0).should   eql(SS.empty)
-          sorted_set.send(method, 0...1).should   eql(SS[1])
-          sorted_set.send(method, 0...2).should   eql(SS[1,2])
-          sorted_set.send(method, 0...3).should   eql(SS[1,2,3])
-          sorted_set.send(method, 0...4).should   eql(SS[1,2,3,4])
-          sorted_set.send(method, 0...10).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, 2...-10).should eql(SS.empty)
-          sorted_set.send(method, 2...0).should   eql(SS.empty)
-          sorted_set.send(method, 2...2).should   eql(SS.empty)
-          sorted_set.send(method, 2...3).should   eql(SS[3])
-          sorted_set.send(method, 2...4).should   eql(SS[3,4])
-          sorted_set.send(method, 3...0).should   eql(SS.empty)
-          sorted_set.send(method, 3...3).should   eql(SS.empty)
-          sorted_set.send(method, 3...4).should   eql(SS[4])
-          sorted_set.send(method, 4...0).should   eql(SS.empty)
-          sorted_set.send(method, 4...4).should   eql(SS.empty)
-          sorted_set.send(method, 4...5).should   eql(SS.empty)
-          sorted_set.send(method, 5...0).should   be_nil
-          sorted_set.send(method, 5...5).should   be_nil
-          sorted_set.send(method, 5...6).should   be_nil
-
-          big.send(method, 159...162).should     eql(SS[160,161,162])
-          big.send(method, 160...162).should     eql(SS[161,162])
-          big.send(method, 161...162).should     eql(SS[162])
-          big.send(method, 9999...10100).should  eql(SS[10000])
-          big.send(method, 10000...10100).should eql(SS.empty)
-          big.send(method, 10001...10100).should be_nil
-
-          sorted_set.send(method, -1..-1).should  eql(SS[4])
-          sorted_set.send(method, -1...-1).should eql(SS.empty)
-          sorted_set.send(method, -1..3).should   eql(SS[4])
-          sorted_set.send(method, -1...3).should  eql(SS.empty)
-          sorted_set.send(method, -1..4).should   eql(SS[4])
-          sorted_set.send(method, -1...4).should  eql(SS[4])
-          sorted_set.send(method, -1..10).should  eql(SS[4])
-          sorted_set.send(method, -1...10).should eql(SS[4])
-          sorted_set.send(method, -1..0).should   eql(SS.empty)
-          sorted_set.send(method, -1..-4).should  eql(SS.empty)
-          sorted_set.send(method, -1...-4).should eql(SS.empty)
-          sorted_set.send(method, -1..-6).should  eql(SS.empty)
-          sorted_set.send(method, -1...-6).should eql(SS.empty)
-          sorted_set.send(method, -2..-2).should  eql(SS[3])
-          sorted_set.send(method, -2...-2).should eql(SS.empty)
-          sorted_set.send(method, -2..-1).should  eql(SS[3,4])
-          sorted_set.send(method, -2...-1).should eql(SS[3])
-          sorted_set.send(method, -2..10).should  eql(SS[3,4])
-          sorted_set.send(method, -2...10).should eql(SS[3,4])
-
-          big.send(method, -1..-1).should    eql(SS[10000])
-          big.send(method, -1..9999).should  eql(SS[10000])
-          big.send(method, -1...9999).should eql(SS.empty)
-          big.send(method, -2...9999).should eql(SS[9999])
-          big.send(method, -2..-1).should    eql(SS[9999,10000])
-
-          sorted_set.send(method, -4..-4).should  eql(SS[1])
-          sorted_set.send(method, -4..-2).should  eql(SS[1,2,3])
-          sorted_set.send(method, -4...-2).should eql(SS[1,2])
-          sorted_set.send(method, -4..-1).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, -4...-1).should eql(SS[1,2,3])
-          sorted_set.send(method, -4..3).should   eql(SS[1,2,3,4])
-          sorted_set.send(method, -4...3).should  eql(SS[1,2,3])
-          sorted_set.send(method, -4..4).should   eql(SS[1,2,3,4])
-          sorted_set.send(method, -4...4).should  eql(SS[1,2,3,4])
-          sorted_set.send(method, -4..0).should   eql(SS[1])
-          sorted_set.send(method, -4...0).should  eql(SS.empty)
-          sorted_set.send(method, -4..1).should   eql(SS[1,2])
-          sorted_set.send(method, -4...1).should  eql(SS[1])
-
-          sorted_set.send(method, -5..-5).should  be_nil
-          sorted_set.send(method, -5...-5).should be_nil
-          sorted_set.send(method, -5..-4).should  be_nil
-          sorted_set.send(method, -5..-1).should  be_nil
-          sorted_set.send(method, -5..10).should  be_nil
-
-          big.send(method, -10001..-1).should be_nil
-        end
-
-        it "leaves the original unchanged" do
-          sorted_set.should eql(SS[1,2,3,4])
-        end
-      end
-    end
-
-    context "when passed an empty Range" do
-      it "does not lose custom sort order" do
-        ss = SS.new(["yogurt", "cake", "pistachios"]) { |word| word.length }
-        ss = ss.send(method, 1...1).add("tea").add("fruitcake").add("toast")
-        ss.to_a.should == ["tea", "toast", "fruitcake"]
-      end
-    end
-
-    context "when passed a length of zero" do
-      it "does not lose custom sort order" do
-        ss = SS.new(["yogurt", "cake", "pistachios"]) { |word| word.length }
-        ss = ss.send(method, 0, 0).add("tea").add("fruitcake").add("toast")
-        ss.to_a.should == ["tea", "toast", "fruitcake"]
-      end
-    end
-
-    context "when passed a subclass of Range" do
-      it "works the same as with a Range" do
-        subclass = Class.new(Range)
-        sorted_set.send(method, subclass.new(1,2)).should eql(SS[2,3])
-        sorted_set.send(method, subclass.new(-3,-1,true)).should eql(SS[2,3])
-      end
-    end
-
-    context "on a subclass of SortedSet" do
-      it "with index and count or a range, returns an instance of the subclass" do
-        subclass = Class.new(Immutable::SortedSet)
-        instance = subclass.new([1,2,3])
-        instance.send(method, 0, 0).class.should be(subclass)
-        instance.send(method, 0, 2).class.should be(subclass)
-        instance.send(method, 0..0).class.should be(subclass)
-        instance.send(method, 1..-1).class.should be(subclass)
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/sorting_spec.rb

@@ -1,56 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  [
-    [:sort, ->(left, right) { left.length <=> right.length }],
-    [:sort_by, ->(item) { item.length }],
-  ].each do |method, comparator|
-    describe "##{method}" do
-      [
-        [[], []],
-        [["A"], ["A"]],
-        [%w[Ichi Ni San], %w[Ni San Ichi]],
-      ].each do |values, expected|
-        describe "on #{values.inspect}" do
-          let(:sorted_set) { SS.new(values) { |item| item.reverse }}
-
-          context "with a block" do
-            it "preserves the original" do
-              sorted_set.send(method, &comparator)
-              sorted_set.to_a.should == SS.new(values) { |item| item.reverse }
-            end
-
-            it "returns #{expected.inspect}" do
-              sorted_set.send(method, &comparator).class.should be(Immutable::SortedSet)
-              sorted_set.send(method, &comparator).to_a.should == expected
-            end
-          end
-
-          context "without a block" do
-            it "preserves the original" do
-              sorted_set.send(method)
-              sorted_set.to_a.should == SS.new(values) { |item| item.reverse }
-            end
-
-            it "returns #{expected.sort.inspect}" do
-              sorted_set.send(method).class.should be(Immutable::SortedSet)
-              sorted_set.send(method).to_a.should == expected.sort
-            end
-          end
-        end
-      end
-    end
-  end
-
-  describe :sort do
-    context "on a SortedSet with custom sort order" do
-      let(:sorted_set) { SS.new([1,2,3,4]) { |x,y| y <=> x }}
-
-      it "returns a SortedSet with the natural sort order" do
-        result = sorted_set.sort
-        expect(sorted_set.to_a).to eq([4,3,2,1])
-        expect(result.to_a).to eq([1,2,3,4])
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/subset_spec.rb

@@ -1,47 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  describe "#subset?" do
-    [
-      [[], [], true],
-      [["A"], [], false],
-      [[], ["A"], true],
-      [["A"], ["A"], true],
-      [%w[A B C], ["B"], false],
-      [["B"], %w[A B C], true],
-      [%w[A B C], %w[A C], false],
-      [%w[A C], %w[A B C], true],
-      [%w[A B C], %w[A B C], true],
-      [%w[A B C], %w[A B C D], true],
-      [%w[A B C D], %w[A B C], false],
-    ].each do |a, b, expected|
-      context "for #{a.inspect} and #{b.inspect}" do
-        it "returns #{expected}"  do
-          SS[*a].subset?(SS[*b]).should == expected
-        end
-      end
-    end
-  end
-
-  describe "#proper_subset?" do
-    [
-      [[], [], false],
-      [["A"], [], false],
-      [[], ["A"], true],
-      [["A"], ["A"], false],
-      [%w[A B C], ["B"], false],
-      [["B"], %w[A B C], true],
-      [%w[A B C], %w[A C], false],
-      [%w[A C], %w[A B C], true],
-      [%w[A B C], %w[A B C], false],
-      [%w[A B C], %w[A B C D], true],
-      [%w[A B C D], %w[A B C], false],
-    ].each do |a, b, expected|
-      context "for #{a.inspect} and #{b.inspect}" do
-        it "returns #{expected}"  do
-          SS[*a].proper_subset?(SS[*b]).should == expected
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/superset_spec.rb

@@ -1,47 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  describe "#superset?" do
-    [
-      [[], [], true],
-      [["A"], [], true],
-      [[], ["A"], false],
-      [["A"], ["A"], true],
-      [%w[A B C], ["B"], true],
-      [["B"], %w[A B C], false],
-      [%w[A B C], %w[A C], true],
-      [%w[A C], %w[A B C], false],
-      [%w[A B C], %w[A B C], true],
-      [%w[A B C], %w[A B C D], false],
-      [%w[A B C D], %w[A B C], true],
-    ].each do |a, b, expected|
-      context "for #{a.inspect} and #{b.inspect}" do
-        it "returns #{expected}"  do
-          SS[*a].superset?(SS[*b]).should == expected
-        end
-      end
-    end
-  end
-
-  describe "#proper_superset?" do
-    [
-      [[], [], false],
-      [["A"], [], true],
-      [[], ["A"], false],
-      [["A"], ["A"], false],
-      [%w[A B C], ["B"], true],
-      [["B"], %w[A B C], false],
-      [%w[A B C], %w[A C], true],
-      [%w[A C], %w[A B C], false],
-      [%w[A B C], %w[A B C], false],
-      [%w[A B C], %w[A B C D], false],
-      [%w[A B C D], %w[A B C], true],
-    ].each do |a, b, expected|
-      context "for #{a.inspect} and #{b.inspect}" do
-        it "returns #{expected}"  do
-          SS[*a].proper_superset?(SS[*b]).should == expected
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/take_spec.rb

@@ -1,54 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  describe "#take" do
-    [
-      [[], 10, []],
-      [["A"], 10, ["A"]],
-      [%w[A B C], 0, []],
-      [%w[A B C], 2, %w[A B]],
-    ].each do |values, number, expected|
-      context "#{number} from #{values.inspect}" do
-        let(:sorted_set) { SS[*values] }
-
-        it "preserves the original" do
-          sorted_set.take(number)
-          sorted_set.should eql(SS[*values])
-        end
-
-        it "returns #{expected.inspect}" do
-          sorted_set.take(number).should eql(SS[*expected])
-        end
-      end
-    end
-
-    context "when argument is at least size of receiver" do
-      let(:sorted_set) { SS[6, 7, 8, 9] }
-      it "returns self" do
-        sorted_set.take(sorted_set.size).should be(sorted_set)
-        sorted_set.take(sorted_set.size + 1).should be(sorted_set)
-      end
-    end
-
-    context "when the set has a custom order" do
-      let(:sorted_set) { SS.new([1, 2, 3]) { |x| -x }}
-      it "maintains the custom order" do
-        sorted_set.take(1).to_a.should == [3]
-        sorted_set.take(2).to_a.should == [3, 2]
-        sorted_set.take(3).to_a.should == [3, 2, 1]
-      end
-
-      it "keeps the comparator even when set is cleared" do
-        s = sorted_set.take(0)
-        s.add(4).add(5).add(6).to_a.should == [6, 5, 4]
-      end
-    end
-
-    context "when called on a subclass" do
-      it "should return an instance of the subclass" do
-        subclass = Class.new(Immutable::SortedSet)
-        subclass.new([1,2,3]).take(1).class.should be(subclass)
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/take_while_spec.rb

@@ -1,33 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  describe "#take_while" do
-    [
-      [[], []],
-      [["A"], ["A"]],
-      [%w[A B C], %w[A B]],
-    ].each do |values, expected|
-      context "on #{values.inspect}" do
-        let(:sorted_set) { SS[*values] }
-
-        context "with a block" do
-          it "returns #{expected.inspect}" do
-            sorted_set.take_while { |item| item < "C" }.should eql(SS[*expected])
-          end
-
-          it "preserves the original" do
-            sorted_set.take_while { |item| item < "C" }
-            sorted_set.should eql(SS[*values])
-          end
-        end
-
-        context "without a block" do
-          it "returns an Enumerator" do
-            sorted_set.take_while.class.should be(Enumerator)
-            sorted_set.take_while.each { |item| item < "C" }.should eql(SS[*expected])
-          end
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/to_set_spec.rb

@@ -1,17 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  describe "#to_set" do
-    [
-      [],
-      ["A"],
-      %w[A B C],
-    ].each do |values|
-      context "on #{values.inspect}" do
-        it "returns a set with the same values" do
-          SS[*values].to_set.should eql(S[*values])
-        end
-      end
-    end
-  end
-end

data/spec/lib/immutable/sorted_set/union_spec.rb

@@ -1,58 +0,0 @@
-require "spec_helper"
-
-describe Immutable::SortedSet do
-  [:union, :|, :+, :merge].each do |method|
-    describe "##{method}" do
-      [
-        [[], [], []],
-        [["A"], [], ["A"]],
-        [["A"], ["A"], ["A"]],
-        [%w[A B C], [], %w[A B C]],
-        [%w[A C E G X], %w[B C D E H M], %w[A B C D E G H M X]]
-      ].each do |a, b, expected|
-        context "for #{a.inspect} and #{b.inspect}" do
-          it "returns #{expected.inspect}" do
-            SS[*a].send(method, SS[*b]).should eql(SS[*expected])
-          end
-        end
-
-        context "for #{b.inspect} and #{a.inspect}" do
-          it "returns #{expected.inspect}" do
-            SS[*b].send(method, SS[*a]).should eql(SS[*expected])
-          end
-        end
-      end
-    end
-  end
-
-  describe :union do
-    it "filters out duplicates when passed an Array" do
-      sorted_set = SS['A', 'B', 'C', 'D'].union(['A', 'A', 'A', 'C', 'A', 'B', 'E'])
-      expect(sorted_set.to_a).to eq(['A', 'B', 'C', 'D', 'E'])
-    end
-
-    it "doesn't mutate an Array which is passed in" do
-      array = [3,2,1,3]
-      sorted_set = SS[1,2,5].union(array)
-      expect(array).to eq([3,2,1,3])
-    end
-
-    context "on a set ordered by a comparator" do
-      # Completely different code is executed when #union is called on a SS
-      #   with a comparator block, so we should repeat all the same tests
-
-      it "still filters out duplicates when passed an Array" do
-        sorted_set = SS.new([1,2,3]) { |x,y| (x%7) <=> (y%7) }
-        sorted_set = sorted_set.union([7,8,9])
-        expect(sorted_set.to_a).to eq([7,1,2,3])
-      end
-
-      it "still doesn't mutate an Array which is passed in" do
-        array = [3,2,1,3]
-        sorted_set = SS.new([1,2,5]) { |x,y| y <=> x }
-        sorted_set = sorted_set.union(array)
-        expect(array).to eq([3,2,1,3])
-      end
-    end
-  end
-end