goldmine 0.9.1 → 0.9.2

data/Gemfile

@@ -1,7 +1,3 @@
-source :rubygems
+source "https://rubygems.org"
+gemspec
 
-gem "minitest", :group => :test
-gem "turn", :group => :test
-gem "simplecov", :require => false, :group => :test
-gem "debugger", :group => :development
-gem "pry", :group => [:development, :test]

data/Gemfile.lock

@@ -1,37 +1,30 @@
+PATH
+  remote: .
+  specs:
+    goldmine (0.9.2)
+
 GEM
-  remote: http://rubygems.org/
+  remote: https://rubygems.org/
   specs:
-    ansi (1.4.2)
-    coderay (1.0.6)
-    columnize (0.3.6)
-    debugger (1.1.4)
-      columnize (>= 0.3.1)
-      debugger-linecache (~> 1.1.1)
-      debugger-ruby_core_source (~> 1.1.3)
-    debugger-linecache (1.1.1)
-      debugger-ruby_core_source (>= 1.1.1)
-    debugger-ruby_core_source (1.1.3)
-    method_source (0.7.1)
-    minitest (3.1.0)
-    multi_json (1.3.6)
-    pry (0.9.9.6)
+    ansi (1.4.3)
+    coderay (1.0.9)
+    method_source (0.8.1)
+    minitest (4.7.2)
+    pry (0.9.12)
       coderay (~> 1.0.5)
-      method_source (~> 0.7.1)
-      slop (>= 2.4.4, < 3)
-    simplecov (0.6.4)
-      multi_json (~> 1.0)
-      simplecov-html (~> 0.5.3)
-    simplecov-html (0.5.3)
-    slop (2.4.4)
-    turn (0.9.5)
+      method_source (~> 0.8)
+      slop (~> 3.4)
+    rake (10.0.4)
+    slop (3.4.4)
+    turn (0.9.6)
       ansi
 
 PLATFORMS
   ruby
 
 DEPENDENCIES
-  debugger
+  goldmine!
   minitest
   pry
-  simplecov
+  rake
   turn

data/README.md

@@ -1,8 +1,14 @@
 # Goldmine
 
+[![Build Status](https://travis-ci.org/hopsoft/goldmine.png)](https://travis-ci.org/hopsoft/goldmine)
+[![Dependency Status](https://gemnasium.com/hopsoft/goldmine.png)](https://gemnasium.com/hopsoft/goldmine)
+[![Code Climate](https://codeclimate.com/github/hopsoft/goldmine.png)](https://codeclimate.com/github/hopsoft/goldmine)
+
 ## Pivot tables for the Rubyist
 
-### Pivot any list into a wealth of information.
+![Goldmine GEM](http://hopsoft.github.com/goldmine/images/gold.jpg)
+
+### Pivot any list into a wealth of information
 
 Goldmine allows you to apply pivot table logic to any list for powerful data mining capabilities.
 
@@ -19,7 +25,7 @@ Goldmine allows you to apply pivot table logic to any list for powerful data min
 
 Install
 
-```
+```bash
 $gem install goldmine
 ```
 
@@ -36,7 +42,6 @@ require "goldmine"
 * [Create a named pivot](#explicitly-name-a-pivot)
 * [Pivot values that are lists themselves](#pivot-values-that-are-lists-themselves)
 * [Chain pivots](#chain-pivots-together)
-* [Chain pivots conditionally](#conditionally-chain-pivots-together)
 * [Dig deep and extract meaningful data](#deep-cuts)
 
 ## The Basics
@@ -114,23 +119,6 @@ data = list.pivot { |i| i < 5 }.pivot { |i| i % 2 == 0 }
 }
 ```
 
-### Conditionally chain pivots together
-
-```ruby
-# operation
-params = { :divisible_by_two => false, :next_greater_than_five => true }
-list = [1,2,3,4,5,6,7,8,9]
-data = list.pivot("less than 5") { |i| i < 5 }
-data = data.pivot("divisible by 2") { |i| i % 2 == 0 } if params[:divisible_by_two]
-data = data.pivot("next greater than 5") { |i| i.next > 5 } if params[:next_greater_than_five]
-
-# resulting data
-{
-  { "less than 5" => true,  "next greater than 5" => false } => [1, 2, 3, 4],
-  { "less than 5" => false, "next greater than 5" => true } => [5, 6, 7, 8, 9]
-}
-```
-
 ## Deep Cuts
 
 ### Build a moderately complex dataset of Cities
@@ -208,7 +196,7 @@ data = cities
 
 Here is a table view of the pivoted city data from above.
 
-<table>
+<table class="table table-bordered table-striped">
   <thead>
     <tr>
       <th>state</th>
@@ -301,7 +289,7 @@ data = cities
 
 Here is the corresponding table view for the above dataset.
 
-<table>
+<table class="table table-bordered table-striped">
   <thead>
     <tr>
       <th>airline</th>
@@ -384,6 +372,8 @@ Hopefully you can see the potential even though the above examples are somewhat
 
 * [One on One Marketing](http://www.1on1.com/) - for sponsoring the development of Goldmine
 * [Eric Berry](https://github.com/cavneb/) - for constructive feedback
+* [Spencer Roan](https://github.com/spencerroan) - for constructive feedback
 * [Brian Johnson](https://github.com/whap/) - for bringing some sanity to the recursion
 * [Josh Bowles](https://github.com/jbowles/) - for early adoption and feedback
 * [Brett Beers](https://github.com/beersbr/) - for early adoption and feedback
+

data/Rakefile

@@ -1,12 +1,10 @@
-require 'rake'
-require 'rake/testtask'
-require 'rdoc/task'
-require 'bundler'
-Bundler.require :development, :test
+require "rake"
+require "rake/testtask"
+require "bundler/gem_tasks"
+
+task :default => [:test]
 
 Rake::TestTask.new(:test) do |t|
-  t.test_files = FileList['test/test_*.rb']
+  t.test_files = Dir["test/test_*.rb"]
 end
 
-task 'test:units' => ['test'] do
-end

data/lib/goldmine.rb

@@ -1,136 +1,6 @@
-require "rubygems"
-
-# Goldmine brings pivot table behavior to Arrays.
-module Goldmine
-
-  # Extends Array with a pivot method.
-  module ArrayMiner
-
-    # Pivots the Array into a Hash of mined data.
-    # Think of it as creating a pivot table or perhaps an OLAP cube.
-    #
-    # @example Simple pivot
-    #   list = [1,2,3,4,5,6,7,8,9]
-    #   data = list.pivot { |i| i < 5 }
-    #
-    #   # resulting data
-    #   # {
-    #   #   true  => [1, 2, 3, 4],
-    #   #   false => [5, 6, 7, 8, 9]
-    #   # }
-    #
-    # @example Named pivot
-    #   list = [1,2,3,4,5,6,7,8,9]
-    #   data = list.pivot("less than 5") { |i| i < 5 }
-    #
-    #   # resulting data
-    #   # {
-    #   #   { "less than 5" => true } => [1, 2, 3, 4],
-    #   #   { "less than 5" => false } => [5, 6, 7, 8, 9]
-    #   # }
-    #
-    # @example Chained pivot
-    #   list = [1,2,3,4,5,6,7,8,9]
-    #   data = list.pivot { |i| i < 5 }.pivot { |i| i % 2 == 0 }
-    #
-    #   # resulting data
-    #   {
-    #     [true, false]  => [1, 3],
-    #     [true, true]   => [2, 4],
-    #     [false, false] => [5, 7, 9],
-    #     [false, true]  => [6, 8]
-    #   }
-    #
-    # @param [String] name The named of the pivot.
-    # @yield [Object] Yields once for each item in the Array
-    # @return [Hash] The pivoted Hash of data.
-    def pivot(name=nil, &block)
-      reduce({}) do |memo, item|
-        value = yield(item)
-
-        if value.is_a?(Array)
-          if value.empty?
-            memo.assign_mined(name, nil, item)
-          else
-            value.each { |v| memo.assign_mined(name, v, item) }
-          end
-        else
-          memo.assign_mined(name, value, item)
-        end
-
-        memo.goldmine = true
-        memo
-      end
-    end
-  end
-
-  # Extends Hash with a pivot method.
-  module HashMiner
-
-    attr_accessor :goldmine
-
-    # Further pivots the Hash into mined data.
-    # This method is what enables the pivot method chaining.
-    #
-    # @example Chained pivot
-    #   list = [1,2,3,4,5,6,7,8,9]
-    #   data = list.pivot { |i| i < 5 }.pivot { |i| i % 2 == 0 }
-    #
-    #   # resulting data
-    #   {
-    #     [true, false]  => [1, 3],
-    #     [true, true]   => [2, 4],
-    #     [false, false] => [5, 7, 9],
-    #     [false, true]  => [6, 8]
-    #   }
-    #
-    # @note This method should not be called directly. Call Array#pivot instead.
-    #
-    # @param [String] name The named of the pivot.
-    # @yield [Object] Yields once for each item in the Array
-    # @return [Hash] The pivoted Hash of data.
-    def pivot(name=nil, &block)
-      return self unless goldmine
-
-      reduce({}) do |memo, item|
-        key = item.first
-        value = item.last
-        value.pivot(name, &block).each do |k, v|
-          if key.is_a? Hash
-            k = { block.to_s => k } unless k.is_a?(Hash)
-            new_key = key.merge(k)
-          else
-            new_key = [key, k].flatten
-          end
-          memo[new_key] = v
-        end
-        memo.goldmine = true
-        memo
-      end
-    end
-
-    # Assigns a key/value pair to the Hash.
-    # @param [String] name The name of a pivot (can be null).
-    # @param [Object] key The key to use.
-    # @param [Object] value The value to assign
-    # @return [Object] The result of the assignment.
-    def assign_mined(name, key, value)
-      goldmine_key = goldmine_key(name, key)
-      self[goldmine_key] ||= []
-      self[goldmine_key] << value
-    end
-
-    # Creates a key for a pivot-name/key combo.
-    # @param [String] name The name of a pivot (can be null).
-    # @param [Object] key The key to use.
-    # @return [Object] The constructed key.
-    def goldmine_key(name, key)
-      goldmine_key = { name => key } if name
-      goldmine_key ||= key
-    end
-
-  end
-end
+$:.unshift File.join(File.dirname(__FILE__), "goldmine")
+require "array_miner"
+require "hash_miner"
 
 ::Array.send(:include, Goldmine::ArrayMiner)
 ::Hash.send(:include, Goldmine::HashMiner)

data/lib/goldmine/array_miner.rb

@@ -0,0 +1,64 @@
+module Goldmine
+
+  # Extends Array with a pivot method.
+  module ArrayMiner
+
+    # Pivots the Array into a Hash of mined data.
+    # Think of it as creating a pivot table or perhaps an OLAP cube.
+    #
+    # @example Simple pivot
+    #   list = [1,2,3,4,5,6,7,8,9]
+    #   data = list.pivot { |i| i < 5 }
+    #
+    #   # resulting data
+    #   # {
+    #   #   true  => [1, 2, 3, 4],
+    #   #   false => [5, 6, 7, 8, 9]
+    #   # }
+    #
+    # @example Named pivot
+    #   list = [1,2,3,4,5,6,7,8,9]
+    #   data = list.pivot("less than 5") { |i| i < 5 }
+    #
+    #   # resulting data
+    #   # {
+    #   #   { "less than 5" => true } => [1, 2, 3, 4],
+    #   #   { "less than 5" => false } => [5, 6, 7, 8, 9]
+    #   # }
+    #
+    # @example Chained pivot
+    #   list = [1,2,3,4,5,6,7,8,9]
+    #   data = list.pivot { |i| i < 5 }.pivot { |i| i % 2 == 0 }
+    #
+    #   # resulting data
+    #   {
+    #     [true, false]  => [1, 3],
+    #     [true, true]   => [2, 4],
+    #     [false, false] => [5, 7, 9],
+    #     [false, true]  => [6, 8]
+    #   }
+    #
+    # @param [String] name The named of the pivot.
+    # @yield [Object] Yields once for each item in the Array
+    # @return [Hash] The pivoted Hash of data.
+    def pivot(name=nil, &block)
+      reduce({}) do |memo, item|
+        value = yield(item)
+
+        if value.is_a?(Array)
+          if value.empty?
+            memo.assign_mined(name, nil, item)
+          else
+            value.each { |v| memo.assign_mined(name, v, item) }
+          end
+        else
+          memo.assign_mined(name, value, item)
+        end
+
+        memo.goldmine = true
+        memo
+      end
+    end
+
+  end
+end

data/lib/goldmine/hash_miner.rb

@@ -0,0 +1,69 @@
+module Goldmine
+
+  # Extends Hash with a pivot method.
+  module HashMiner
+
+    attr_accessor :goldmine
+
+    # Further pivots the Hash into mined data.
+    # This method is what enables the pivot method chaining.
+    #
+    # @example Chained pivot
+    #   list = [1,2,3,4,5,6,7,8,9]
+    #   data = list.pivot { |i| i < 5 }.pivot { |i| i % 2 == 0 }
+    #
+    #   # resulting data
+    #   {
+    #     [true, false]  => [1, 3],
+    #     [true, true]   => [2, 4],
+    #     [false, false] => [5, 7, 9],
+    #     [false, true]  => [6, 8]
+    #   }
+    #
+    # @note This method should not be called directly. Call Array#pivot instead.
+    #
+    # @param [String] name The named of the pivot.
+    # @yield [Object] Yields once for each item in the Array
+    # @return [Hash] The pivoted Hash of data.
+    def pivot(name=nil, &block)
+      return self unless goldmine
+
+      reduce({}) do |memo, item|
+        key = item.first
+        value = item.last
+        value.pivot(name, &block).each do |k, v|
+          if key.is_a? Hash
+            k = { block.to_s => k } unless k.is_a?(Hash)
+            new_key = key.merge(k)
+          else
+            new_key = [key, k].flatten
+          end
+          memo[new_key] = v
+        end
+        memo.goldmine = true
+        memo
+      end
+    end
+
+    # Assigns a key/value pair to the Hash.
+    # @param [String] name The name of a pivot (can be null).
+    # @param [Object] key The key to use.
+    # @param [Object] value The value to assign
+    # @return [Object] The result of the assignment.
+    def assign_mined(name, key, value)
+      goldmine_key = goldmine_key(name, key)
+      self[goldmine_key] ||= []
+      self[goldmine_key] << value
+    end
+
+    # Creates a key for a pivot-name/key combo.
+    # @param [String] name The name of a pivot (can be null).
+    # @param [Object] key The key to use.
+    # @return [Object] The constructed key.
+    def goldmine_key(name, key)
+      goldmine_key = { name => key } if name
+      goldmine_key ||= key
+    end
+
+  end
+end

data/lib/goldmine/version.rb

@@ -0,0 +1,3 @@
+module Goldmine
+  VERSION = "0.9.2"
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: goldmine
 version: !ruby/object:Gem::Version
-  version: 0.9.1
+  version: 0.9.2
   prerelease: 
 platform: ruby
 authors:
@@ -9,25 +9,105 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-06-20 00:00:00.000000000 Z
-dependencies: []
-description: ! '    Goldmine allows you to apply pivot table logic to any list for
-  powerful data mining capabilities.
-
-'
+date: 2013-04-19 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: turn
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Pivot tables for the Rubyist.
 email:
 - natehop@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- lib/goldmine/array_miner.rb
+- lib/goldmine/hash_miner.rb
+- lib/goldmine/version.rb
 - lib/goldmine.rb
 - Gemfile
 - Gemfile.lock
 - Rakefile
 - README.md
 - test/test_goldmine.rb
-homepage: http://hopsoft.github.com/goldmine/
+homepage: https://github.com/hopsoft/goldmine
 licenses:
 - MIT
 post_install_message: 
@@ -48,8 +128,10 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.10
+rubygems_version: 1.8.23
 signing_key: 
 specification_version: 3
-summary: Pivot tables for the Rubyist
-test_files: []
+summary: Pivot tables for the Rubyist.
+test_files:
+- test/test_goldmine.rb
+has_rdoc: