webget_ramp 1.7.1.1

data/lib/webget_ramp/csv.rb

@@ -0,0 +1,52 @@
+
+class CSV
+
+  # Return HTTP headers for a typical CSV file download without caching.
+  #
+  # ==Options
+  #   - filename: defaults to "data.csv"
+  #   - request: the incoming http request, which is used to return MSIE-specific headers
+  #
+  # ==Example
+  #   headers = CSV.http_headers("myfile.csv")
+  #
+  # ==Example for Rails
+  #   response.headers.merge CSV.http_headers("myfile.csv")
+  # 
+  # Ideas from http://stackoverflow.com/questions/94502/in-rails-how-to-return-records-as-a-csv-file/94520
+  
+  def self.http_headers(options={})
+    filename = options[:filename] || 'data.csv'
+    options=self.http_headers_adjust_for_broken_msie(options)
+    content_type = options[:content_type] || 'text/csv'
+    return options[:cache] \
+    ? {
+       'Content-Type' => content_type,
+       'Content-Disposition' => "attachment; filename=\"#{filename}\"",
+      } \
+    : {
+       'Content-Type' => content_type,
+       'Cache-Control' => 'no-cache, must-revalidate, post-check=0, pre-check=0',
+       'Expires' => "0",
+       'Pragma' => 'no-cache',
+       'Content-Disposition' => "attachment; filename=\"#{filename}\"",
+      }
+    end
+
+  # Helper to try to "do the right thing" for the common case of Rails & MS IE.
+  #
+  # Rails automatically defines a _request_ object,
+  # that has an env HTTP_USER_AGENT.
+  
+  def self.http_headers_adjust_for_broken_msie(options={})
+    request = options[:request] || request 
+    msie = (request and request.env['HTTP_USER_AGENT'] =~ /msie/i)
+    if msie
+      options[:content_type]||='text/plain''})'
+      options[:cache]||=false
+    end
+    options
+  end
+
+end
+

data/lib/webget_ramp/date.rb

@@ -0,0 +1,87 @@
+require 'date'
+
+class Date
+
+
+  # Return date in a sql format: YYYY-MM-DD
+  #
+  # ==Example
+  #   d=Date.today
+  #   d.to_sql => "2007-12-31"
+
+  def to_sql
+    return to_time.strftime("%Y-%m-%d")
+  end
+
+
+  # Return true if the date is a weekday: Mon, Tue, Wed, Thu, Fri
+  #
+  # ==Example
+  #   d = Date.parse('2008-01-01')
+  #   d.wday => 2
+  #   d.weekday? => true
+  
+  def weekday?
+    wday>0 and wday<6
+  end
+
+
+  # Return true if the date is a weekend: Sat, Sun
+  #
+  # ==Example
+  #   d = Date.parse('2008-01-05')
+  #   d.wday => 6
+  #   d.weekend? => true
+
+  def weekend?
+    wday==0 or wday==6
+  end
+
+
+  # Return a random date between min & max
+  #
+  # ==Example
+  #   d1= Date.parse('2008-01-01')
+  #   d2= Date.parse('2009-01-01')
+  #   Date.between(d1,d3) => Date 2008-11-22
+
+  def self.between(min,max)
+    min+rand(max-min)
+  end
+
+
+  # Return the age in years for a given date.
+  #
+  # ==Example
+  #
+  #   birthdate=Date.new(1980,10,31)
+  #   birthdate.age_years => 28 (where 28 is the correct age for today)
+  #
+  # ==Example of custom dates
+  #
+  #   birthdate=Date.new(1980,10,31)
+  #
+  #   valentines = Date.new(2008,02,14)
+  #   birthdate.age_years(valentines) => 27  # before the birthday
+  #
+  #   halloween = Date.new(2008,10,31)
+  #   birthdate.age_years(halloween) => 28   # on the birthday
+  #
+  #   new_years_eve = Date.new(2008,12,31)
+  #   birthdate.age_years(new_years_eve) => 28  # after the birthday
+
+  def age_years(compare_date=Date.today)
+    age=compare_date.year-year
+    age-=1 if compare_date.month < month or (compare_date.month==month and compare_date.day < day)
+    age
+  end
+
+
+  # Return the age in days for a given date.
+
+  def age_days(compare_to_date=Date.today)
+    (compare_to_date-self).to_i
+  end
+
+
+end

data/lib/webget_ramp/enumerable.rb

@@ -0,0 +1,369 @@
+# -*- coding: utf-8 -*-
+module Enumerable
+
+
+  ########################################################################
+  #
+  #  typecast
+  #  
+  ########################################################################
+
+  # Convert an enumerable to a hash.
+  #
+  # ==Example
+  #   array=[[:a, :b],[:c, :d],[:e, :f]]
+  #   array.to_h => {:a=>:b, :c=>:d, :e=>:f}
+  #
+  # If a key occurs more than once, then this will automatically 
+  # convert the value to an array of the keys' values.
+  #
+  # ==Example
+  #   array=[[:a,:b],[:a,:c],[:a,:d]]
+  #   array.to_h => {:a=>[:b, :c, :d]}
+
+  def to_h
+    h={}
+    dupe={}
+    each{|k,v|
+      if h.key? k
+        if dupe.key? k
+          h[k] << v
+        else
+          h[k]=[h[k]]
+          h[k] << v          
+          dupe[k]=true
+        end
+      else
+        h[k]=v
+      end
+    }
+    return h
+  end
+
+
+  # Convert the enumerable to a hash by mapping each item to a key,item pair.
+  #
+  # ==Example
+  #   strings = ["red","blue","green"]
+  #   strings.index_by{|a| a.size]}
+  #   => {3 => "red", 4 => "blue", 5 => "green"}
+  #
+  # Rails has this method.
+  #
+  # From http://stackoverflow.com/questions/412771/cleanest-way-to-create-a-hash-from-an-array
+  #
+  # Compare #hash_by
+
+  def index_by
+    inject({}) {|hash, elem| hash.merge!(yield(elem) => elem) }
+  end
+
+
+  # Convert the enumerable to a hash by mapping each item to a key,value pair.
+  #
+  # ==Example
+  #   strings = ["red","blue","green"]
+  #   strings.hash_by{|a| [a.size, a.titlecase]}
+  #   => {3 => "red", 4 => "blue", 5 => "green"}
+  #
+  # Compare #index_by
+
+  def hash_by
+    map{|x| yield(x)}.to_h
+  end
+
+
+
+  ########################################################################
+  #
+  #  map_to_xxx
+  #  
+  ########################################################################
+
+
+  # Map each item => item.id
+  #
+  # ==Example
+  #   users = User.find(:all)
+  #   users.map_id => [1,2,3,4,...]
+  #
+  # A typical use is to convert a list of ActiveRecord items to a list of id items.
+  #
+  # This method is a fast way to get the same results as items.map(&:id)
+
+  def map_id
+    map{|x| x.id}
+  end
+
+
+  # Map each item => item.to_a
+  #
+  # ==Example
+  #   set1 = Set.new([:a,:b,:c])
+  #   set2 = Set.new([:d,:e,:f])
+  #   set3 = Set.new([:g,:h,:i])
+  #   sets = [set1, set2, set3]
+  #   sets.map_to_a => [[:a, :b, :c], [:d, :e, :f], [:g, :h, :i]]
+  #
+  # A typical use is to convert a list with Set items to a list of Array items,
+  # so you can more easily iterate over the the Array items.
+  #
+  # See http://www.ruby-doc.org/core/classes/Enumerable.html#M003148
+
+  def map_to_a
+    map{|x| [x]}
+  end
+
+
+  # Map each item => item.to_f
+  #
+  # ==Example
+  #   strings = ["1","2","3"]
+  #   strings.map_to_f => [1.0, 2.0, 3.0]
+  #
+  # A typical use is to convert a list of String items to a list of float items.
+  #
+  # This method is a fast way to get the same results as items.map(&:to_f)
+
+  def map_to_f
+    map{|x| x.to_f}
+  end
+
+
+  # Map each item => item.to_i
+  #
+  # ==Example
+  #   strings = ["1","2","3"]
+  #   strings.map_to_i => [1, 2, 3]  
+  #
+  # A typical use is to convert a list of String items to a list of integer items.
+  #
+  # This method is a fast way to get the same results as items.map(&:to_i)
+
+  def map_to_i
+    map{|x| x.to_i}
+  end
+
+
+  # Map each item => item.to_s
+  #
+  # ==Example
+  #   numbers = [1, 2, 3]
+  #   numbers.map_to_s => ["1", "2", "3"]  
+  #
+  # A typical use is to convert a list of Numeric items to a list of String items.
+  #
+  # This method is a fast way to get the same results as items.map(&:to_s)
+ 
+  def map_to_s
+    map{|x| x.to_s}
+  end
+
+
+  # Map each item => item.to_sym
+  #
+  # ==Example
+  #   strings = ["foo", "goo", "hoo"]
+  #   strings.map_to_sym => [:foo, :goo, :hoo]
+  #
+  # A typical use is to convert a list of Object items to a list of Symbol items.
+  #
+  # This method is a fast way to get the same results as items.map(&:to_sym)
+
+  def map_to_sym
+    map{|x| x.to_sym}
+  end
+
+
+  ########################################################################
+  #
+  #  select
+  #  
+  ########################################################################
+  
+  
+  # enum.select_while {|obj| block } => array
+  # Returns an array containing the leading elements for which block is not false or nil.
+
+  def select_while
+    a = []
+    each{|x| yield(x) ? (a << x) : break}
+    return a
+  end
+
+
+  # enum.select_until {|obj| block } => array
+  # Returns an array containing the leading elements for which block is false or nil.
+
+  def select_until
+    a = []
+    each{|x| yield(x) ? break : (a << x)}
+    return a
+  end
+
+
+  # enum.select_with_index {|obj,i| block } => array
+  # Calls block with two arguments, the item and its index, for each item in enum.
+  # Returns an array containing the leading elements for which block is not false or nil.
+
+  def select_with_index
+    i = 0
+    a = []
+    each{|x| 
+      if yield(x,i)
+        a << x
+        i+=1
+      else
+        break
+      end
+    }
+    return a
+  end
+
+
+  ########################################################################
+  #
+  #  bisect
+  #  
+  ########################################################################
+
+  # enum.bisect {|obj| block} => array of positives, array of negatives
+  # Returns two arrays: the first contains the elements for which block is
+  # true, the second contains the elements for which block is false or nil.
+
+  def bisect
+    a=[]
+    b=[]
+    each{|x| 
+     if yield(x)
+      a << x
+     else
+      b << x
+     end
+    }
+    return a,b
+  end
+
+
+  ########################################################################
+  #
+  #  nitems
+  #  
+  ########################################################################
+  
+  
+  # enum.nitems_while {| obj | block } => number of items
+  # Returns the number of leading elements for which block is not false or nil.
+
+  def nitems_while
+    n = 0
+    each{|x| yield(x) ? (n+=1) : break}
+    return n
+  end
+
+
+  # enum.nitems_until {| obj | block } => number of items
+  # Returns the number of leading elements for which block is false.
+
+  def nitems_until
+    n = 0
+    each{|x|
+      if yield(x) 
+        break
+      else
+        n+=1
+      end
+    }
+    return n
+    irb
+  end
+
+
+  # enum.nitems_with_index {|obj,i| block } => number of items
+  # Calls block with two arguments, the item and its index, for each item in enum.
+  # Returns the number of leading elements for which block is true.
+
+  def nitems_with_index
+    i = 0
+    each{|x| yield(x,i) ? (i+=1) : break}
+    return i
+  end
+
+
+  # Shortcut to Array#join to concatenate the items into a string
+
+  def join(prefix=nil,suffix=nil)
+   to_a.join(prefix,suffix)
+  end
+
+
+  ########################################################################
+  #
+  #  set math
+  #  
+  ########################################################################
+
+
+  # Returns true if this  _enum_ intersects another _enum_.
+  #
+  # @nb This implementation uses #to_a and array intersection.
+  # A developer may want to optimize this implementation for
+  # other classes, such as detecting whether a range intersects
+  # another range simply by comparing the ranges' min/max values.
+  #
+  # ==Examples
+  #   ['a','b','c'].intersect?(['c','d','e'] => true
+  #   ['a','b','c'].intersect?(['d','e','f'] => false
+
+  def intersect?(enum)
+    return ((self===enum and self.to_a.size>0) or ((self.to_a & enum.to_a).size>0))
+  end
+
+
+  # Return the cartesian product of the enumerations.
+  # http://en.wikipedia.org/wiki/Cartesian_product
+  #
+  # This is the fastest implementation we have found.
+  # It returns results in typical order.
+  #
+  # By Thomas Hafner
+  # See http://www.ruby-forum.com/topic/95519
+  #
+  # For our benchmarks, we also compared thesk:
+  # - By William James, http://www.ruby-forum.com/topic/95519
+  # - By Brian Schröäer, http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/151857
+
+  def self.cartesian_product(*enums)
+    result = [[]]
+    while [] != enums
+      t, result = result, []
+      b, *enums = enums
+      t.each do |a|
+        b.each do |n|
+          result << a + [n]
+        end
+      end
+    end
+    result
+  end
+
+  def cartesian_product(*enums)
+    Enumerable.cartesian_product(self,*enums)
+  end
+
+
+  # Return the power set: an array with all subsets of the enum's elements.
+  # http://en.wikipedia.org/wiki/Power_set
+  #
+  # This implementation is from
+  # http://johncarrino.net/blog/2006/08/11/powerset-in-ruby/
+  #
+  # ==Example
+  #   [1,2,3].power_set.sort
+  #   =>  [[], [1], [1, 2], [1, 2, 3], [1, 3], [2], [2, 3], [3]]
+
+  def power_set
+    inject([[]]){|c,y|r=[];c.each{|i|r<<i;r<<i+[y]};r}
+  end
+
+end