davidrichards-just_enumerable_stats 0.0.3 → 0.0.4

data/VERSION.yml

@@ -1,4 +1,4 @@
 --- 
 :major: 0
 :minor: 0
-:patch: 3
+:patch: 4

data/lib/just_enumerable_stats.rb

@@ -2,6 +2,12 @@
 $:.unshift File.dirname(__FILE__)
 require 'fixed_range'
 
+begin
+  require 'facets/dictionary'
+rescue LoadError => e
+  # Do nothing
+end
+
 # Borrowed this from my own gem, sirb
 
 class Object
@@ -215,7 +221,9 @@ module Enumerable
   # For non-numeric values, returns a unique set, 
   # ordered if possible.
   def categories
-    if self.is_numeric?
+    if @categories
+      @categories
+    elsif self.is_numeric?
       self.range_instance.map
     else
       self.uniq.sort rescue self.uniq
@@ -239,8 +247,61 @@ module Enumerable
     self.range_class
   end
   
+  # Takes a hash of arrays for categories
+  # If Facets happens to be loaded on the computer, this keeps the order
+  # of the categories straight. 
+  def set_range(hash)
+    if defined?(Dictionary)
+      @range_hash = Dictionary.new
+      @range_hash.merge!(hash)
+      @categories = @range_hash.keys
+    else
+      @categories = hash.keys
+      @range_hash = hash
+    end
+    @categories
+  end
+  
+  # The hash of lambdas that are used to categorize the enumerable.
+  attr_reader :range_hash
+  
+  # The arguments needed to instantiate the custom-defined range class.
   attr_reader :range_class_args
 
+  # Counts each element where the block evaluates to true
+  # Example:
+  # a = [1,2,3]
+  # a.count_if {|e| e % 2 == 0}
+  def count_if(&block)
+    self.inject(0) do |s, e|
+      s += 1 if block.call(e)
+      s
+    end
+  end
+  
+  # Returns a Hash or Dictionary (if available) for each category with a
+  # value as the set of matching values as an array. 
+  # Because this is supposed to be lean (just enumerables), but this is an
+  # expensive call, I'm going to cache it and offer a parameter to reset
+  # the cache.  So, call category_values(true) if you need to reset the
+  # cache. 
+  def category_values(reset=false)
+    @category_values = nil if reset
+    return @category_values if @category_values
+    container = defined?(Dictionary) ? Dictionary.new : Hash.new
+    if self.range_hash
+      @category_values = self.categories.inject(container) do |cont, cat|
+        cont[cat] = self.find_all &self.range_hash[cat]
+        cont
+      end
+    else
+      @category_values = self.categories.inject(container) do |cont, cat|
+        cont[cat] = self.find_all {|e| e == cat}
+        cont
+      end
+    end
+  end
+
   # When creating a range, what class will it be?  Defaults to Range, but
   # other classes are sometimes useful. 
   def range_class

data/lib/just_enumerable_stats/stats.rb

@@ -210,7 +210,9 @@ module JustEnumerableStats #:nodoc:
     # For non-numeric values, returns a unique set, 
     # ordered if possible.
     def categories
-      if self.is_numeric?
+      if @categories
+        @categories
+      elsif self.is_numeric?
         self.range_instance.map
       else
         self.uniq.sort rescue self.uniq
@@ -234,8 +236,61 @@ module JustEnumerableStats #:nodoc:
       self.range_class
     end
 
+    # Takes a hash of arrays for categories
+    # If Facets happens to be loaded on the computer, this keeps the order
+    # of the categories straight. 
+    def set_range(hash)
+      if defined?(Dictionary)
+        @range_hash = Dictionary.new
+        @range_hash.merge!(hash)
+        @categories = @range_hash.keys
+      else
+        @categories = hash.keys
+        @range_hash = hash
+      end
+      @categories
+    end
+
+    # The hash of lambdas that are used to categorize the enumerable.
+    attr_reader :range_hash
+
+    # The arguments needed to instantiate the custom-defined range class.
     attr_reader :range_class_args
 
+    # Counts each element where the block evaluates to true
+    # Example:
+    # a = [1,2,3]
+    # a.count_if {|e| e % 2 == 0}
+    def count_if(&block)
+      self.inject(0) do |s, e|
+        s += 1 if block.call(e)
+        s
+      end
+    end
+
+    # Returns a Hash or Dictionary (if available) for each category with a
+    # value as the set of matching values as an array. 
+    # Because this is supposed to be lean (just enumerables), but this is an
+    # expensive call, I'm going to cache it and offer a parameter to reset
+    # the cache.  So, call category_values(true) if you need to reset the
+    # cache. 
+    def category_values(reset=false)
+      @category_values = nil if reset
+      return @category_values if @category_values
+      container = defined?(Dictionary) ? Dictionary.new : Hash.new
+      if self.range_hash
+        @category_values = self.categories.inject(container) do |cont, cat|
+          cont[cat] = self.find_all &self.range_hash[cat]
+          cont
+        end
+      else
+        @category_values = self.categories.inject(container) do |cont, cat|
+          cont[cat] = self.find_all {|e| e == cat}
+          cont
+        end
+      end
+    end
+
     # When creating a range, what class will it be?  Defaults to Range, but
     # other classes are sometimes useful. 
     def range_class

data/spec/just_enumerable_stats/stats_spec.rb

@@ -243,6 +243,42 @@ describe JustEnumerableStats::Stats do
     a.categories.should eql(a)
   end
   
+  it "should be able to set a range with a hash of lambdas" do
+    @a.set_range({
+      "<= 2" => lambda{ |e| e <= 2 },
+      "> 2" => lambda{ |e| e > 2 }
+    })
+    @a.categories.sort.should eql(["<= 2", "> 2"].sort)
+  end
+  
+  it "should be able to get a hash of category values" do
+    @a.set_range({
+      "<= 2" => lambda{ |e| e <= 2 },
+      "> 2" => lambda{ |e| e > 2 }
+    })
+    @a.category_values["<= 2"].should eql([1,2])
+    @a.category_values["> 2"].should eql([3])
+  end
+  
+  it "should be able to get category values with a regular range" do
+    @a.category_values[1].should eql([1])
+    @a.category_values[2].should eql([2])
+    @a.category_values[3].should eql([3])
+  end
+  
+  it "should be able to get category values with a custom range" do
+    @a.set_range_class(FixedRange, 1, 3, 0.5)
+    @a.category_values[1.0].should eql([1])
+    @a.category_values[1.5].should eql([])
+    @a.category_values[2.0].should eql([2])
+    @a.category_values[2.5].should eql([])
+    @a.category_values[3.0].should eql([3])
+  end
+  
+  it "should be able to count conditionally" do
+    @a.count_if {|e| e == 2}.should eql(1)
+  end
+  
   it "should be able to instantiate a range" do
     @a.range_as_range.should eql(Range.new(1, 3))
   end

data/spec/just_enumerable_stats_spec.rb

@@ -233,6 +233,42 @@ describe "JustEnumerableStats" do
     a.categories.should eql(a)
   end
   
+  it "should be able to set a range with a hash of lambdas" do
+    @a.set_range({
+      "<= 2" => lambda{ |e| e <= 2 },
+      "> 2" => lambda{ |e| e > 2 }
+    })
+    @a.categories.sort.should eql(["<= 2", "> 2"].sort)
+  end
+  
+  it "should be able to get a hash of category values" do
+    @a.set_range({
+      "<= 2" => lambda{ |e| e <= 2 },
+      "> 2" => lambda{ |e| e > 2 }
+    })
+    @a.category_values["<= 2"].should eql([1,2])
+    @a.category_values["> 2"].should eql([3])
+  end
+  
+  it "should be able to get category values with a regular range" do
+    @a.category_values[1].should eql([1])
+    @a.category_values[2].should eql([2])
+    @a.category_values[3].should eql([3])
+  end
+  
+  it "should be able to get category values with a custom range" do
+    @a.set_range_class(FixedRange, 1, 3, 0.5)
+    @a.category_values[1.0].should eql([1])
+    @a.category_values[1.5].should eql([])
+    @a.category_values[2.0].should eql([2])
+    @a.category_values[2.5].should eql([])
+    @a.category_values[3.0].should eql([3])
+  end
+    
+  it "should be able to count conditionally" do
+    @a.count_if {|e| e == 2}.should eql(1)
+  end
+  
   it "should be able to instantiate a range with a block" do
     @a.range_as_range(&@inverse_matcher).should eql(Range.new(3, 1))
   end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: davidrichards-just_enumerable_stats
 version: !ruby/object:Gem::Version 
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors: 
 - David Richards