immutable-ruby 0.0.1

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

@@ -0,0 +1,28 @@
+require "spec_helper"
+
+describe Immutable::SortedSet do
+  describe "#reverse_each" do
+    context "with no block" do
+      let(:sorted_set) { SS["A", "B", "C"] }
+
+      it "returns an Enumerator" do
+        sorted_set.reverse_each.class.should be(Enumerator)
+        sorted_set.reverse_each.to_a.should eql(sorted_set.to_a.reverse)
+      end
+    end
+
+    context "with a block" do
+      let(:sorted_set) { SS.new(1..1025) }
+
+      it "returns self" do
+        sorted_set.reverse_each {}.should be(sorted_set)
+      end
+
+      it "iterates over the items in order" do
+        items = []
+        sorted_set.reverse_each { |item| items << item }
+        items.should == (1..1025).to_a.reverse
+      end
+    end
+  end
+end

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

@@ -0,0 +1,13 @@
+require "spec_helper"
+
+describe Immutable::SortedSet do
+  describe "#sample" do
+    let(:sorted_set) { Immutable::SortedSet.new(1..10) }
+
+    it "returns a randomly chosen item" do
+      chosen = 100.times.map { sorted_set.sample }
+      chosen.each { |item| sorted_set.include?(item).should == true }
+      sorted_set.each { |item| chosen.include?(item).should == true }
+    end
+  end
+end

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

@@ -0,0 +1,61 @@
+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

@@ -0,0 +1,17 @@
+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

@@ -0,0 +1,256 @@
+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

@@ -0,0 +1,44 @@
+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
+end

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

@@ -0,0 +1,47 @@
+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