hiccup 0.4.3 → 0.4.4

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: e36feec08a5a3bec9f239244d7da51952930cae4
+  data.tar.gz: f9a5e21e9a5e4ef0f38b0ce49f138ad8bea0963d
+SHA512:
+  metadata.gz: 068192d3b01e740acb6b356a9e4dadeb980c6f1c22bc68406d3480441f54f8a0239d942fa617c8e7e02032be81b74d921f1c3c0b99181687f6f9be310ee414df
+  data.tar.gz: 4433629beecf17aa82e1355413bce1546c2d4fcb0febd481e8689337131492fc702d0bd2b017b32fff744308a87c1e3c571d83402463875eaf7c3d4e887efd46

data/lib/hiccup/enumerable.rb

@@ -84,5 +84,26 @@ module Hiccup
     
     
     
+    def first_n_occurrences(limit)
+      n_occurrences_on_or_after(limit, start_date)
+    end
+    
+    def n_occurrences_after(limit, date)
+      n_occurrences_on_or_after(limit, date.to_date + 1)
+    end
+    
+    def n_occurrences_on_or_after(limit, date)
+      return [] if ends? and date > end_date
+      
+      occurrences = []
+      enum = enumerator.new(self, date)
+      while (occurrence = enum.next) && occurrences.length < limit
+        occurrences << occurrence
+      end
+      occurrences
+    end
+    
+    
+    
   end
 end

data/lib/hiccup/inferable.rb

@@ -3,6 +3,9 @@ require 'active_support/core_ext/date/conversions'
 require 'hiccup/core_ext/enumerable'
 require 'hiccup/core_ext/hash'
 require "hiccup/core_ext/date"
+require 'hiccup/inferable/dates_enumerator'
+require 'hiccup/inferable/guesser'
+require 'hiccup/inferable/score'
 
 
 module Hiccup
@@ -17,7 +20,7 @@ module Hiccup
         
         dates = extract_array_of_dates!(dates)
         enumerator = DatesEnumerator.new(dates)
-        guesser = Guesser.new(self, {verbose: verbosity >= 2})
+        guesser = options.fetch :guesser, Guesser.new(self, options.merge(verbose: verbosity >= 2))
         schedules = []
         
         confidences = []
@@ -116,288 +119,5 @@ module Hiccup
       
       
     end
-    
-    
-    
-    class Guesser
-      
-      def initialize(klass, options={})
-        @klass = klass
-        @verbose = options.fetch(:verbose, false)
-        start!
-      end
-      
-      attr_reader :confidence, :schedule, :dates
-      
-      def start!
-        @dates = []
-        @schedule = nil
-        @confidence = 0
-      end
-      alias :restart! :start!
-      
-      
-      
-      
-      def <<(date)
-        @dates << date
-        @schedule, @confidence = best_schedule_for(@dates)
-        date
-      end
-      
-      def count
-        @dates.length
-      end
-      
-      def predicted?(date)
-        @schedule && @schedule.contains?(date)
-      end
-      
-      
-      
-      def best_schedule_for(dates)
-        guesses = generate_guesses(dates)
-        pick_best_guess(guesses, dates)
-      end
-      
-      def generate_guesses(dates)
-        @start_date = dates.first
-        @end_date = dates.last
-        [].tap do |guesses|
-          guesses.concat generate_yearly_guesses(dates)
-          guesses.concat generate_monthly_guesses(dates)
-          guesses.concat generate_weekly_guesses(dates)
-        end
-      end
-      
-      def generate_yearly_guesses(dates)
-        histogram_of_patterns = dates.to_histogram do |date|
-          [date.month, date.day]
-        end
-        patterns_by_popularity = histogram_of_patterns.flip # => {1 => [...], 2 => [...], 5 => [a, b]}
-        highest_popularity = patterns_by_popularity.keys.max # => 5
-        most_popular = patterns_by_popularity[highest_popularity].first # => a
-        start_date = Date.new(@start_date.year, *most_popular)
-        
-        [].tap do |guesses|
-          (1...5).each do |skip|
-            guesses << @klass.new.tap do |schedule|
-              schedule.kind = :annually
-              schedule.start_date = start_date
-              schedule.end_date = @end_date
-              schedule.skip = skip
-            end
-          end
-        end
-      end
-      
-      def generate_monthly_guesses(dates)
-        histogram_of_patterns = dates.to_histogram do |date|
-          [date.get_nth_wday_of_month, Date::DAYNAMES[date.wday]]
-        end
-        patterns_by_popularity = histogram_of_patterns.flip
-        
-        histogram_of_days = dates.to_histogram(&:day)
-        days_by_popularity = histogram_of_days.flip
-        
-        if @verbose
-          puts "",
-               "  monthly analysis:",
-               "    input: #{dates.inspect}",
-               "    histogram (weekday): #{histogram_of_patterns.inspect}",
-               "    by_popularity (weekday): #{patterns_by_popularity.inspect}",
-               "    histogram (day): #{histogram_of_days.inspect}",
-               "    by_popularity (day): #{days_by_popularity.inspect}"
-        end
-        
-        [].tap do |guesses|
-          (1...5).each do |skip|
-            enumerate_by_popularity(days_by_popularity) do |days|
-              guesses << @klass.new.tap do |schedule|
-                schedule.kind = :monthly
-                schedule.start_date = @start_date
-                schedule.end_date = @end_date
-                schedule.skip = skip
-                schedule.monthly_pattern = days
-              end
-            end
-            
-            enumerate_by_popularity(patterns_by_popularity) do |patterns|
-              guesses << @klass.new.tap do |schedule|
-                schedule.kind = :monthly
-                schedule.start_date = @start_date
-                schedule.end_date = @end_date
-                schedule.skip = skip
-                schedule.monthly_pattern = patterns
-              end
-            end
-          end
-        end
-      end
-      
-      def generate_weekly_guesses(dates)
-        [].tap do |guesses|
-          histogram_of_wdays = dates.to_histogram do |date|
-            Date::DAYNAMES[date.wday]
-          end
-          wdays_by_popularity = histogram_of_wdays.flip
-          
-          if @verbose
-            puts "",
-                 "  weekly analysis:",
-                 "    input: #{dates.inspect}",
-                 "    histogram: #{histogram_of_wdays.inspect}",
-                 "    by_popularity: #{wdays_by_popularity.inspect}"
-          end
-          
-          (1...5).each do |skip|
-            enumerate_by_popularity(wdays_by_popularity) do |wdays|
-              guesses << @klass.new.tap do |schedule|
-                schedule.kind = :weekly
-                schedule.start_date = @start_date
-                schedule.end_date = @end_date
-                schedule.skip = skip
-                schedule.weekly_pattern = wdays
-              end
-            end
-          end
-        end
-      end
-      
-      
-      
-      # Expects a hash of values grouped by popularity
-      # Yields the most popular values first, and then
-      # increasingly less popular values
-      def enumerate_by_popularity(values_by_popularity)
-        popularities = values_by_popularity.keys.sort.reverse
-        popularities.length.times do |i|
-          at_popularities = popularities.take(i + 1)
-          yield values_by_popularity.values_at(*at_popularities).flatten(1)
-        end
-      end
-      
-      
-      
-      def pick_best_guess(guesses, dates)
-        scored_guesses = guesses \
-          .map { |guess| [guess, score_guess(guess, dates)] } \
-          .sort_by { |(guess, score)| -score.to_f }
-        
-        if @verbose
-          puts "\nGUESSES FOR #{dates}:"
-          scored_guesses.each do |(guess, score)|
-            puts "  (%.3f p/%.3f b/%.3f c/%.3f) #{guess.humanize}" % [
-              score.to_f,
-              score.prediction_rate,
-              score.brick_penalty,
-              score.complexity_penalty]
-          end
-          puts ""
-        end
-        
-        scored_guesses.first
-      end
-      
-      def score_guess(guess, input_dates)
-        predicted_dates = guess.occurrences_between(guess.start_date, guess.end_date)
-        
-        # prediction_rate is the percent of input dates predicted
-        predictions = (predicted_dates & input_dates).length
-        prediction_rate = Float(predictions) / Float(input_dates.length)
-        
-        # bricks are dates predicted by this guess but not in the input
-        bricks = (predicted_dates - input_dates).length
-        
-        # brick_rate is the percent of bricks to predictions
-        # A brick_rate >= 1 means that this guess bricks more than it predicts
-        brick_rate = Float(bricks) / Float(input_dates.length)
-        
-        # complexity measures how many rules are necesary
-        # to describe the pattern
-        complexity = complexity_of(guess)
-        
-        # complexity_rate is the number of rules per inputs
-        complexity_rate = Float(complexity) / Float(input_dates.length)
-        
-        Score.new(prediction_rate, brick_rate, complexity_rate)
-      end
-      
-      def complexity_of(schedule)
-        return schedule.weekly_pattern.length if schedule.weekly?
-        return schedule.monthly_pattern.length if schedule.monthly?
-        1
-      end
-      
-      
-      
-      class Score < Struct.new(:prediction_rate, :brick_rate, :complexity_rate)
-        
-        # as brick rate rises, our confidence in this guess drops
-        def brick_penalty
-          brick_penalty = brick_rate * 0.33
-          brick_penalty = 1 if brick_penalty > 1
-          brick_penalty
-        end
-        
-        # as the complexity rises, our confidence in this guess drops
-        # this hash table is a stand-in for a proper formala
-        #
-        # A complexity of 1 means that 1 rule is required per input
-        # date. This means we haven't really discovered a pattern.
-        def complexity_penalty
-          complexity_rate
-        end
-        
-        # our confidence is weakened by bricks and complexity
-        def confidence
-          confidence = 1.0
-          confidence *= (1 - brick_penalty)
-          confidence *= (1 - complexity_penalty)
-          confidence
-        end
-        
-        # a number between 0 and 1
-        def to_f
-          prediction_rate * confidence
-        end
-        
-      end
-      
-      
-      
-    end
-    
-    
-    
-    class DatesEnumerator
-      
-      def initialize(dates)
-        @dates = dates
-        @last_index = @dates.length - 1
-        @index = -1
-      end
-      
-      attr_reader :index
-      
-      def done?
-        @index == @last_index
-      end
-      
-      def next
-        @index += 1
-        raise OutOfRangeException if @index > @last_index
-        @dates[@index]
-      end
-      
-      def rewind_by(n)
-        @index -= n
-        @index = -1 if @index < -1
-      end
-      
-    end
-    
-    
-    
   end
 end

data/lib/hiccup/inferable/dates_enumerator.rb

@@ -0,0 +1,30 @@
+module Hiccup
+  module Inferable
+    class DatesEnumerator
+      
+      def initialize(dates)
+        @dates = dates
+        @last_index = @dates.length - 1
+        @index = -1
+      end
+      
+      attr_reader :index
+      
+      def done?
+        @index == @last_index
+      end
+      
+      def next
+        @index += 1
+        raise OutOfRangeException if @index > @last_index
+        @dates[@index]
+      end
+      
+      def rewind_by(n)
+        @index -= n
+        @index = -1 if @index < -1
+      end
+      
+    end
+  end
+end

data/lib/hiccup/inferable/guesser.rb

@@ -0,0 +1,180 @@
+require 'hiccup/inferable/scorer'
+
+module Hiccup
+  module Inferable
+    class Guesser
+      
+      def initialize(klass, options={})
+        @klass = klass
+        @verbose = options.fetch(:verbose, false)
+        @allow_skips = options.fetch(:allow_skips, true)
+        @max_complexity = options.fetch(:max_complexity, 3)
+        @scorer = options.fetch(:scorer, Scorer.new(options))
+        start!
+      end
+      
+      attr_reader :confidence, :schedule, :dates, :scorer, :max_complexity
+      
+      def allow_skips?
+        @allow_skips
+      end
+      
+      def start!
+        @dates = []
+        @schedule = nil
+        @confidence = 0
+      end
+      alias :restart! :start!
+      
+      
+      
+      
+      def <<(date)
+        @dates << date
+        @schedule, @confidence = best_schedule_for(@dates)
+        date
+      end
+      
+      def count
+        @dates.length
+      end
+      
+      def predicted?(date)
+        @schedule && @schedule.contains?(date)
+      end
+      
+      
+      
+      def best_schedule_for(dates)
+        guesses = generate_guesses(dates)
+        scorer.pick_best_guess(guesses, dates)
+      end
+      
+      def generate_guesses(dates)
+        @start_date = dates.first
+        @end_date = dates.last
+        [].tap do |guesses|
+          guesses.concat generate_yearly_guesses(dates)
+          guesses.concat generate_monthly_guesses(dates)
+          guesses.concat generate_weekly_guesses(dates)
+        end
+      end
+      
+      def generate_yearly_guesses(dates)
+        histogram_of_patterns = dates.to_histogram do |date|
+          [date.month, date.day]
+        end
+        patterns_by_popularity = histogram_of_patterns.flip # => {1 => [...], 2 => [...], 5 => [a, b]}
+        highest_popularity = patterns_by_popularity.keys.max # => 5
+        most_popular = patterns_by_popularity[highest_popularity].first # => a
+        start_date = Date.new(@start_date.year, *most_popular)
+        
+        [].tap do |guesses|
+          skip_range.each do |skip|
+            guesses << @klass.new.tap do |schedule|
+              schedule.kind = :annually
+              schedule.start_date = start_date
+              schedule.end_date = @end_date
+              schedule.skip = skip
+            end
+          end
+        end
+      end
+      
+      def generate_monthly_guesses(dates)
+        histogram_of_patterns = dates.to_histogram do |date|
+          [date.get_nth_wday_of_month, Date::DAYNAMES[date.wday]]
+        end
+        patterns_by_popularity = histogram_of_patterns.flip
+        
+        histogram_of_days = dates.to_histogram(&:day)
+        days_by_popularity = histogram_of_days.flip
+        
+        if @verbose
+          puts "",
+               "  monthly analysis:",
+               "    input: #{dates.inspect}",
+               "    histogram (weekday): #{histogram_of_patterns.inspect}",
+               "    by_popularity (weekday): #{patterns_by_popularity.inspect}",
+               "    histogram (day): #{histogram_of_days.inspect}",
+               "    by_popularity (day): #{days_by_popularity.inspect}"
+        end
+        
+        [].tap do |guesses|
+          skip_range.each do |skip|
+            enumerate_by_popularity(days_by_popularity) do |days|
+              next if days.length > max_complexity
+              guesses << @klass.new.tap do |schedule|
+                schedule.kind = :monthly
+                schedule.start_date = @start_date
+                schedule.end_date = @end_date
+                schedule.skip = skip
+                schedule.monthly_pattern = days
+              end
+            end
+            
+            enumerate_by_popularity(patterns_by_popularity) do |patterns|
+              next if patterns.length > max_complexity
+              guesses << @klass.new.tap do |schedule|
+                schedule.kind = :monthly
+                schedule.start_date = @start_date
+                schedule.end_date = @end_date
+                schedule.skip = skip
+                schedule.monthly_pattern = patterns
+              end
+            end
+          end
+        end
+      end
+      
+      def generate_weekly_guesses(dates)
+        [].tap do |guesses|
+          histogram_of_wdays = dates.to_histogram do |date|
+            Date::DAYNAMES[date.wday]
+          end
+          wdays_by_popularity = histogram_of_wdays.flip
+          
+          if @verbose
+            puts "",
+                 "  weekly analysis:",
+                 "    input: #{dates.inspect}",
+                 "    histogram: #{histogram_of_wdays.inspect}",
+                 "    by_popularity: #{wdays_by_popularity.inspect}"
+          end
+          
+          skip_range.each do |skip|
+            enumerate_by_popularity(wdays_by_popularity) do |wdays|
+              next if wdays.length > max_complexity
+              guesses << @klass.new.tap do |schedule|
+                schedule.kind = :weekly
+                schedule.start_date = @start_date
+                schedule.end_date = @end_date
+                schedule.skip = skip
+                schedule.weekly_pattern = wdays
+              end
+            end
+          end
+        end
+      end
+      
+      def skip_range
+        return 1..1 unless allow_skips?
+        1...5
+      end
+      
+      
+      
+      # Expects a hash of values grouped by popularity
+      # Yields the most popular values first, and then
+      # increasingly less popular values
+      def enumerate_by_popularity(values_by_popularity)
+        popularities = values_by_popularity.keys.sort.reverse
+        popularities.length.times do |i|
+          at_popularities = popularities.take(i + 1)
+          yield values_by_popularity.values_at(*at_popularities).flatten(1)
+        end
+      end
+      
+    end
+  end
+end

data/lib/hiccup/inferable/score.rb

@@ -0,0 +1,38 @@
+module Hiccup
+  module Inferable
+    
+    class Score < Struct.new(:prediction_rate, :brick_rate, :complexity_rate)
+      
+      # as brick rate rises, our confidence in this guess drops
+      def brick_penalty
+        brick_penalty = brick_rate * 0.33
+        brick_penalty = 1 if brick_penalty > 1
+        brick_penalty
+      end
+      
+      # as the complexity rises, our confidence in this guess drops
+      # this hash table is a stand-in for a proper formala
+      #
+      # A complexity of 1 means that 1 rule is required per input
+      # date. This means we haven't really discovered a pattern.
+      def complexity_penalty
+        complexity_rate
+      end
+      
+      # our confidence is weakened by bricks and complexity
+      def confidence
+        confidence = 1.0
+        confidence *= (1 - brick_penalty)
+        confidence *= (1 - complexity_penalty)
+        confidence
+      end
+      
+      # a number between 0 and 1
+      def to_f
+        prediction_rate * confidence
+      end
+      
+    end
+    
+  end
+end

data/lib/hiccup/inferable/scorer.rb

@@ -0,0 +1,67 @@
+module Hiccup
+  module Inferable
+    class Scorer
+      
+      def initialize(options={})
+        @verbose = options.fetch(:verbose, false)
+      end
+      
+      
+      
+      def pick_best_guess(guesses, dates)
+        scored_guesses = guesses \
+          .map { |guess| [guess, score_guess(guess, dates)] } \
+          .sort_by { |(guess, score)| -score.to_f }
+        
+        if @verbose
+          puts "\nGUESSES FOR #{dates}:"
+          scored_guesses.each do |(guess, score)|
+            puts "  (%.3f p/%.3f b/%.3f c/%.3f) #{guess.humanize}" % [
+              score.to_f,
+              score.prediction_rate,
+              score.brick_penalty,
+              score.complexity_penalty]
+          end
+          puts ""
+        end
+        
+        scored_guesses.first
+      end
+      
+      
+      
+      def score_guess(guess, input_dates)
+        predicted_dates = guess.occurrences_between(guess.start_date, guess.end_date)
+        
+        # prediction_rate is the percent of input dates predicted
+        predictions = (predicted_dates & input_dates).length
+        prediction_rate = Float(predictions) / Float(input_dates.length)
+        
+        # bricks are dates predicted by this guess but not in the input
+        bricks = (predicted_dates - input_dates).length
+        
+        # brick_rate is the percent of bricks to predictions
+        # A brick_rate >= 1 means that this guess bricks more than it predicts
+        brick_rate = Float(bricks) / Float(input_dates.length)
+        
+        # complexity measures how many rules are necesary
+        # to describe the pattern
+        complexity = complexity_of(guess)
+        
+        # complexity_rate is the number of rules per inputs
+        complexity_rate = Float(complexity) / Float(input_dates.length)
+        
+        Score.new(prediction_rate, brick_rate, complexity_rate)
+      end
+      
+      
+      
+      def complexity_of(schedule)
+        return schedule.weekly_pattern.length if schedule.weekly?
+        return schedule.monthly_pattern.length if schedule.monthly?
+        1
+      end
+      
+    end
+  end
+end

data/lib/hiccup/schedule.rb

@@ -42,4 +42,4 @@ module Hiccup
     
     
   end
-end
+end

data/lib/hiccup/version.rb

@@ -1,3 +1,3 @@
 module Hiccup
-  VERSION = "0.4.3"
+  VERSION = "0.4.4"
 end

data/test/enumerable_test.rb

@@ -3,7 +3,6 @@ require "test_helper"
 
 class EnumerableTest < ActiveSupport::TestCase
   include Hiccup
-  PERFORMANCE_TEST = false
   
   
   
@@ -347,7 +346,7 @@ class EnumerableTest < ActiveSupport::TestCase
   
   
   
-  if PERFORMANCE_TEST
+  if ENV['PERFORMANCE_TEST']
     test "performance test" do
       n = 100
       

data/test/inferrable_test.rb

@@ -248,9 +248,15 @@ class InferableTest < ActiveSupport::TestCase
   
   
   
-  test "should diabolically complex schedules" do
+  test "should reject diabolically complex schedules by default" do
     dates = %w{2012-11-06 2012-11-08 2012-11-15 2012-11-20 2012-11-27 2012-11-29 2013-02-05 2013-02-14 2013-02-21 2013-02-19 2013-02-26 2013-05-07 2013-05-09 2013-05-16 2013-05-28 2013-05-21 2013-05-30}
     schedules = Schedule.infer(dates)
+    refute_equal ["The first Tuesday, second Thursday, third Thursday, third Tuesday, fourth Tuesday, and fifth Thursday of every third month"], schedules.map(&:humanize)
+  end
+  
+  test "should infer diabolically complex schedules on demand" do
+    dates = %w{2012-11-06 2012-11-08 2012-11-15 2012-11-20 2012-11-27 2012-11-29 2013-02-05 2013-02-14 2013-02-21 2013-02-19 2013-02-26 2013-05-07 2013-05-09 2013-05-16 2013-05-28 2013-05-21 2013-05-30}
+    schedules = Schedule.infer(dates, max_complexity: 99)
     assert_equal ["The first Tuesday, second Thursday, third Thursday, third Tuesday, fourth Tuesday, and fifth Thursday of every third month"], schedules.map(&:humanize)
   end
   

data/test/performance_test.rb

@@ -0,0 +1,35 @@
+require "test_helper"
+require "benchmark"
+
+class PerformanceTest < ActiveSupport::TestCase
+  include Hiccup
+  
+  
+  { 100 => 50,
+    500 => 50,
+   1000 => 50 }.each do |number, expected_duration|
+    test "should generated guesses from #{number} dates in under #{expected_duration}ms" do
+      guesser = Hiccup::Inferable::Guesser.new(Hiccup::Schedule)
+      dates = (0...number).map { |i| Date.new(2010, 1, 1) + i.week }
+      duration = Benchmark.ms { guesser.generate_guesses(dates) }
+      # puts "\e[33m\e[1m#{number}\e[0m\e[33m dates took \e[1m%.2fms\e[0m" % duration
+      assert duration <= expected_duration, "It took %.2fms" % duration
+    end
+  end
+  
+  
+  # Inferring 500 dates still takes 10 seconds.
+  # It spends 7.3 of those seconds predicting dates,
+  # 6.9 of those predicting monthly or weekly dates. 
+  { 10 =>  0.1.seconds,
+    50 =>  0.5.seconds,
+   100 =>  1.0.seconds }.each do |number, expected_duration|
+    test "should infer a schedule from #{number} dates in under #{expected_duration} second(s)" do
+      dates = (0...number).map { |i| Date.new(2010, 1, 1) + i.week }
+      duration = Benchmark.ms { Schedule.infer(dates, verbosity: 0) } / 1000
+      assert duration <= expected_duration, "It took %.2f seconds" % duration
+    end
+  end
+  
+  
+end

metadata

@@ -1,20 +1,18 @@
 --- !ruby/object:Gem::Specification
 name: hiccup
 version: !ruby/object:Gem::Version
-  version: 0.4.3
-  prerelease: 
+  version: 0.4.4
 platform: ruby
 authors:
 - Bob Lail
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-01-03 00:00:00.000000000 Z
+date: 2013-09-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activesupport
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
@@ -22,7 +20,6 @@ dependencies:
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
@@ -30,39 +27,34 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: builder
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: ri_cal
   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: rails
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
@@ -70,7 +62,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
@@ -78,49 +69,43 @@ dependencies:
 - !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: 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: 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: Hiccup mixes a-la-cart recurrence features into your data structure.
@@ -152,6 +137,10 @@ files:
 - lib/hiccup/enumerable/weekly_enumerator.rb
 - lib/hiccup/humanizable.rb
 - lib/hiccup/inferable.rb
+- lib/hiccup/inferable/dates_enumerator.rb
+- lib/hiccup/inferable/guesser.rb
+- lib/hiccup/inferable/score.rb
+- lib/hiccup/inferable/scorer.rb
 - lib/hiccup/schedule.rb
 - lib/hiccup/serializable/ical.rb
 - lib/hiccup/serializers/ical.rb
@@ -163,37 +152,31 @@ files:
 - test/humanizable_test.rb
 - test/ical_serializable_test.rb
 - test/inferrable_test.rb
+- test/performance_test.rb
 - test/test_helper.rb
 - test/validatable_test.rb
 homepage: http://boblail.github.com/hiccup/
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: -936135857702157052
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: -936135857702157052
 requirements: []
 rubyforge_project: hiccup
-rubygems_version: 1.8.24
+rubygems_version: 2.0.2
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: A library for working with things that recur
 test_files:
 - test/core_ext_date_test.rb
@@ -202,5 +185,6 @@ test_files:
 - test/humanizable_test.rb
 - test/ical_serializable_test.rb
 - test/inferrable_test.rb
+- test/performance_test.rb
 - test/test_helper.rb
 - test/validatable_test.rb