gravtastic 3.1.0 → 3.2.0

data/README.md

@@ -20,7 +20,7 @@ The best way to learn more about Gravtastic is to [look through the annotated so
 
 ## Usage
 
-For this example I'm going to assume you are using Rails. Don't worry if you arn't, the concepts are still the same.
+For this example I'm going to assume you are using Rails. Don't worry if you aren't, the concepts are still the same.
 
 First off, add this to your `Gemfile`:
 
@@ -73,7 +73,7 @@ The best way to do this is to set the `:default` option when using `#gravatr_url
   <tr>
     <td><b>secure</b></td>
     <td>Gravatar transmitted with SSL</td>
-    <td>false</td>
+    <td>true</td>
     <td>true/false</td>
   </tr>
   <tr>
@@ -90,7 +90,7 @@ The best way to do this is to set the `:default` option when using `#gravatr_url
   </tr>
   <tr>
     <td><b>rating</b></td>
-    <td>The lowest level of ratings you want to allow</td>
+    <td>The highest level of ratings you want to allow</td>
     <td>G</td>
     <td>G, PG, R or X</td>
   </tr>
@@ -129,6 +129,24 @@ And wallah! It's exactly the same as with ActiveRecord! Now all instances of the
 _Note: the `#gravatar_url` methods don't get included until you specify the class `is_gravtastic!`_
 
 
+## Javascript
+
+_Note: this feature requires Rails 3.1 & CoffeeScript._
+
+Web applications are increasingly performing client side rendering in Javascript. It's not always practical or clean to calculate the `gravatar_url` on the server. As of version 3.2, Gravtastic comes bundled with Javascript helpers.
+
+If you are using Rails 3.1 you can simple require Gravtastic in your `Gemfile` and add
+
+    //= require gravtastic
+
+in your `application.js` file. This will include a function, `Gravtastic` which performs similarly to `gravtastic_url`.
+
+    > Gravtastic('christopher.lloyd@gmail.com')
+      "https://secure.gravatar.com/avatar/08f077ea061585744ee080824f5a8e65.png?r=PG"
+    > Gravtastic('christopher.lloyd@gmail.com', {default: 'identicon', size: 64})
+      "https://secure.gravatar.com/avatar/08f077ea061585744ee080824f5a8e65.png?r=PG&d=identicon&s=64"
+
+
 ## Making Changes Yourself
 
 Gravtastic is a mature project. There isn't any active work which needs to be done on it, but I do continue to maintain it. Just don't expect same day fixes. If you find something that needs fixing, the best way to contribute is to fork the repo and submit a pull request.
@@ -146,6 +164,7 @@ Gravtastic is a mature project. There isn't any active work which needs to be do
 * [Jeff Kreeftmeijer](http://github.com/jeffkreeftmeijer)
 * [Ryan Lewis](http://github.com/c00lryguy)
 * [Arthur Chiu](http://github.com/achiu)
+* [Paul Johnston](http://pajhome.org.uk/crypt/md5/) for his awesome MD5.js implementation.
 
 
 ## License
@@ -157,3 +176,16 @@ Permission is hereby granted, free of charge, to any person obtaining a copy of
 The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 
 THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+--
+
+md5.js Copyright (c) 1998 - 2009, Paul Johnston & Contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+Neither the name of the author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/Rakefile

@@ -1,4 +1,4 @@
-require 'rake/gempackagetask'
+require 'rubygems/package_task'
 require 'rake/clean'
 require 'rspec/core/rake_task'
 
@@ -12,7 +12,7 @@ end
 
 load(gemspec_file)
 
-Rake::GemPackageTask.new(@spec) do |t|
+Gem::PackageTask.new(@spec) do |t|
   t.need_tar = true
   t.need_zip = true
 end
@@ -21,11 +21,4 @@ CLEAN.add 'pkg'
 require 'spec/rake/spectask'
 RSpec::Core::RakeTask.new do |t|
   t.rspec_opts = ['--color', '--require ./spec/helper']
-  # t.files = FileList['spec/*.rb']
 end
-
-desc 'Build documentation'
-task :doc do
-  sh 'docco lib/gravtastic.rb'
-end
-CLEAN.add 'docs'

data/lib/gravtastic.rb

@@ -5,33 +5,39 @@
 require 'digest/md5'
 require 'gravtastic/version'
 
+begin
+  require 'rails'
+  require 'gravtastic/engine'
+rescue LoadError
+end
+
 module Gravtastic
-  
+
   # When you `include Gravtastic`, Ruby automatically calls this method
   # with the class you called it in. It allows us extend the class with the
   # `#gravtastic` method.
   def self.included(model)
     model.extend StageOne
   end
-  
-  # Sets the model's default attributes. It is called when you use 
+
+  # Sets the model's default attributes. It is called when you use
   # `#gravtastic` in your model.
   def self.configure(model, *args, &blk)
     options = args.last.is_a?(Hash) ? args.pop : {}
 
     model.gravatar_defaults = {
-      :rating => 'PG',
-      :secure => false,
+      :rating =>   'PG',
+      :secure =>   true,
       :filetype => :png
     }.merge(options)
-    
+
     # The method where Gravtastic get the users' email from defaults to `#email`.
     model.gravatar_source = args.first || :email
   end
 
-  # We include Gravtastic in multiple stages. This is mainly so that if you 
-  # include Gravastic in a superclass (something like `ActiveRecord::Base`) 
-  # then it only adds the relevant methods to the classes which _actually_ use 
+  # We include Gravtastic in multiple stages. This is mainly so that if you
+  # include Gravastic in a superclass (something like `ActiveRecord::Base`)
+  # then it only adds the relevant methods to the classes which _actually_ use
   # it.
   module StageOne
     def gravtastic(*args, &blk)
@@ -40,9 +46,9 @@ module Gravtastic
       Gravtastic.configure(self, *args, &blk)
       self
     end
-    
-    # All these aliases deal with pervious bad design decisions. Let that be a 
-    # lesson, name things simply, try not to follow fads and try not to break 
+
+    # All these aliases deal with previous bad design decisions. Let that be a
+    # lesson, name things simply, try not to follow fads and try not to break
     # backwards compatibility.
     alias_method :gravtastic!,    :gravtastic
     alias_method :has_gravatar,   :gravtastic
@@ -52,7 +58,7 @@ module Gravtastic
 
   module ClassMethods
     attr_accessor :gravatar_source, :gravatar_defaults
-    
+
     # Gravtastic abbreviates certain params so that it produces the smallest
     # possible URL. Every byte counts.
     def gravatar_abbreviations
@@ -64,14 +70,14 @@ module Gravtastic
   end
 
   module InstanceMethods
-    
+
     # The raw MD5 hash of the users' email. Gravatar is particularly tricky as
-    # it downcases all emails. This is really the guts of the module, 
+    # it downcases all emails. This is really the guts of the module,
     # everything else is just convenience.
     def gravatar_id
       Digest::MD5.hexdigest(send(self.class.gravatar_source).to_s.downcase)
     end
-    
+
     # Constructs the full Gravatar url.
     def gravatar_url(options={})
       options = self.class.gravatar_defaults.merge(options)
@@ -81,9 +87,9 @@ module Gravtastic
     end
 
   private
-    
+
     # Creates a params hash like "?foo=bar" from a hash like {'foo' => 'bar'}.
-    # The values are sorted so it produces deterministic output (and can 
+    # The values are sorted so it produces deterministic output (and can
     # therefore be tested easily).
     def url_params_from_hash(hash)
       '?' + hash.map do |key, val|
@@ -95,7 +101,7 @@ module Gravtastic
     def gravatar_hostname(secure)
       'http' + (secure ? 's://secure.' : '://') + 'gravatar.com/avatar/'
     end
-    
+
     # Munges the ID and the filetype into one. Like "abc123.png"
     def gravatar_filename(filetype)
       "#{gravatar_id}.#{filetype}"

data/lib/gravtastic/engine.rb

@@ -0,0 +1,4 @@
+module Gravtastic
+  class Engine < ::Rails::Engine
+  end
+end

data/lib/gravtastic/version.rb

@@ -1,6 +1,6 @@
 module Gravtastic
 
-  VERSION = '3.1.0'
+  VERSION = '3.2.0'
 
   # Returns the version of Gravtastic
   def self.version

data/vendor/assets/javascripts/gravtastic.coffee

@@ -0,0 +1,37 @@
+#= require md5
+
+# Private abbreviations
+abbreviations =
+  size:    's'
+  default: 'd'
+  rating:  'r'
+
+window.Gravtastic = (email, options={}) ->
+  id = MD5(email.toString().toLowerCase())
+
+  # Initialize options
+  opts = {}
+  opts[key] = val for key, val of Gravtastic.defaults
+  opts[key] = val for key, val of options
+
+  host = if opts.secure
+           "https://secure.gravatar.com/avatar"
+         else
+           "http://gravatar.com/avatar"
+
+  path = "/#{id}.#{opts.filetype || 'png'}"
+
+  params = "?" + (
+    for key, val of opts when key isnt "secure" and key isnt "filetype"
+      "#{abbreviations[key] || key}=#{val}"
+  ).join('&')
+
+  host + path + params
+
+
+# These are easily overridden in your own application
+window.Gravtastic.defaults =
+  rating:   'PG'
+  secure:   true
+  filetype: 'png'
+

data/vendor/assets/javascripts/md5.js

@@ -0,0 +1,383 @@
+;(function(export) {
+  /*
+   * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
+   * Digest Algorithm, as defined in RFC 1321.
+   * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009
+   * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+   * Distributed under the BSD License
+   * See http://pajhome.org.uk/crypt/md5 for more info.
+   */
+
+  /*
+   * Configurable variables. You may need to tweak these to be compatible with
+   * the server-side, but the defaults work in most cases.
+   */
+  var hexcase = 0;   /* hex output format. 0 - lowercase; 1 - uppercase        */
+  var b64pad  = "";  /* base-64 pad character. "=" for strict RFC compliance   */
+
+  /*
+   * These are the functions you'll usually want to call
+   * They take string arguments and return either hex or base-64 encoded strings
+   */
+  function hex_md5(s)    { return rstr2hex(rstr_md5(str2rstr_utf8(s))); }
+  function b64_md5(s)    { return rstr2b64(rstr_md5(str2rstr_utf8(s))); }
+  function any_md5(s, e) { return rstr2any(rstr_md5(str2rstr_utf8(s)), e); }
+  function hex_hmac_md5(k, d)
+    { return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
+  function b64_hmac_md5(k, d)
+    { return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
+  function any_hmac_md5(k, d, e)
+    { return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e); }
+
+  /*
+   * Perform a simple self-test to see if the VM is working
+   */
+  function md5_vm_test()
+  {
+    return hex_md5("abc").toLowerCase() == "900150983cd24fb0d6963f7d28e17f72";
+  }
+
+  /*
+   * Calculate the MD5 of a raw string
+   */
+  function rstr_md5(s)
+  {
+    return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));
+  }
+
+  /*
+   * Calculate the HMAC-MD5, of a key and some data (raw strings)
+   */
+  function rstr_hmac_md5(key, data)
+  {
+    var bkey = rstr2binl(key);
+    if(bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);
+
+    var ipad = Array(16), opad = Array(16);
+    for(var i = 0; i < 16; i++)
+    {
+      ipad[i] = bkey[i] ^ 0x36363636;
+      opad[i] = bkey[i] ^ 0x5C5C5C5C;
+    }
+
+    var hash = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);
+    return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));
+  }
+
+  /*
+   * Convert a raw string to a hex string
+   */
+  function rstr2hex(input)
+  {
+    try { hexcase } catch(e) { hexcase=0; }
+    var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
+    var output = "";
+    var x;
+    for(var i = 0; i < input.length; i++)
+    {
+      x = input.charCodeAt(i);
+      output += hex_tab.charAt((x >>> 4) & 0x0F)
+             +  hex_tab.charAt( x        & 0x0F);
+    }
+    return output;
+  }
+
+  /*
+   * Convert a raw string to a base-64 string
+   */
+  function rstr2b64(input)
+  {
+    try { b64pad } catch(e) { b64pad=''; }
+    var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+    var output = "";
+    var len = input.length;
+    for(var i = 0; i < len; i += 3)
+    {
+      var triplet = (input.charCodeAt(i) << 16)
+                  | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
+                  | (i + 2 < len ? input.charCodeAt(i+2)      : 0);
+      for(var j = 0; j < 4; j++)
+      {
+        if(i * 8 + j * 6 > input.length * 8) output += b64pad;
+        else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
+      }
+    }
+    return output;
+  }
+
+  /*
+   * Convert a raw string to an arbitrary string encoding
+   */
+  function rstr2any(input, encoding)
+  {
+    var divisor = encoding.length;
+    var i, j, q, x, quotient;
+
+    /* Convert to an array of 16-bit big-endian values, forming the dividend */
+    var dividend = Array(Math.ceil(input.length / 2));
+    for(i = 0; i < dividend.length; i++)
+    {
+      dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
+    }
+
+    /*
+     * Repeatedly perform a long division. The binary array forms the dividend,
+     * the length of the encoding is the divisor. Once computed, the quotient
+     * forms the dividend for the next step. All remainders are stored for later
+     * use.
+     */
+    var full_length = Math.ceil(input.length * 8 /
+                                      (Math.log(encoding.length) / Math.log(2)));
+    var remainders = Array(full_length);
+    for(j = 0; j < full_length; j++)
+    {
+      quotient = Array();
+      x = 0;
+      for(i = 0; i < dividend.length; i++)
+      {
+        x = (x << 16) + dividend[i];
+        q = Math.floor(x / divisor);
+        x -= q * divisor;
+        if(quotient.length > 0 || q > 0)
+          quotient[quotient.length] = q;
+      }
+      remainders[j] = x;
+      dividend = quotient;
+    }
+
+    /* Convert the remainders to the output string */
+    var output = "";
+    for(i = remainders.length - 1; i >= 0; i--)
+      output += encoding.charAt(remainders[i]);
+
+    return output;
+  }
+
+  /*
+   * Encode a string as utf-8.
+   * For efficiency, this assumes the input is valid utf-16.
+   */
+  function str2rstr_utf8(input)
+  {
+    var output = "";
+    var i = -1;
+    var x, y;
+
+    while(++i < input.length)
+    {
+      /* Decode utf-16 surrogate pairs */
+      x = input.charCodeAt(i);
+      y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
+      if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
+      {
+        x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
+        i++;
+      }
+
+      /* Encode output as utf-8 */
+      if(x <= 0x7F)
+        output += String.fromCharCode(x);
+      else if(x <= 0x7FF)
+        output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
+                                      0x80 | ( x         & 0x3F));
+      else if(x <= 0xFFFF)
+        output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
+                                      0x80 | ((x >>> 6 ) & 0x3F),
+                                      0x80 | ( x         & 0x3F));
+      else if(x <= 0x1FFFFF)
+        output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
+                                      0x80 | ((x >>> 12) & 0x3F),
+                                      0x80 | ((x >>> 6 ) & 0x3F),
+                                      0x80 | ( x         & 0x3F));
+    }
+    return output;
+  }
+
+  /*
+   * Encode a string as utf-16
+   */
+  function str2rstr_utf16le(input)
+  {
+    var output = "";
+    for(var i = 0; i < input.length; i++)
+      output += String.fromCharCode( input.charCodeAt(i)        & 0xFF,
+                                    (input.charCodeAt(i) >>> 8) & 0xFF);
+    return output;
+  }
+
+  function str2rstr_utf16be(input)
+  {
+    var output = "";
+    for(var i = 0; i < input.length; i++)
+      output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
+                                     input.charCodeAt(i)        & 0xFF);
+    return output;
+  }
+
+  /*
+   * Convert a raw string to an array of little-endian words
+   * Characters >255 have their high-byte silently ignored.
+   */
+  function rstr2binl(input)
+  {
+    var output = Array(input.length >> 2);
+    for(var i = 0; i < output.length; i++)
+      output[i] = 0;
+    for(var i = 0; i < input.length * 8; i += 8)
+      output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);
+    return output;
+  }
+
+  /*
+   * Convert an array of little-endian words to a string
+   */
+  function binl2rstr(input)
+  {
+    var output = "";
+    for(var i = 0; i < input.length * 32; i += 8)
+      output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);
+    return output;
+  }
+
+  /*
+   * Calculate the MD5 of an array of little-endian words, and a bit length.
+   */
+  function binl_md5(x, len)
+  {
+    /* append padding */
+    x[len >> 5] |= 0x80 << ((len) % 32);
+    x[(((len + 64) >>> 9) << 4) + 14] = len;
+
+    var a =  1732584193;
+    var b = -271733879;
+    var c = -1732584194;
+    var d =  271733878;
+
+    for(var i = 0; i < x.length; i += 16)
+    {
+      var olda = a;
+      var oldb = b;
+      var oldc = c;
+      var oldd = d;
+
+      a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
+      d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
+      c = md5_ff(c, d, a, b, x[i+ 2], 17,  606105819);
+      b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
+      a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
+      d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426);
+      c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
+      b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
+      a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);
+      d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
+      c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
+      b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
+      a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682);
+      d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
+      c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
+      b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);
+
+      a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
+      d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
+      c = md5_gg(c, d, a, b, x[i+11], 14,  643717713);
+      b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
+      a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
+      d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083);
+      c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
+      b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
+      a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438);
+      d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
+      c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
+      b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501);
+      a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
+      d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
+      c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473);
+      b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
+
+      a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
+      d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
+      c = md5_hh(c, d, a, b, x[i+11], 16,  1839030562);
+      b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
+      a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
+      d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353);
+      c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
+      b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
+      a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174);
+      d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
+      c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
+      b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189);
+      a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
+      d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
+      c = md5_hh(c, d, a, b, x[i+15], 16,  530742520);
+      b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
+
+      a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
+      d = md5_ii(d, a, b, c, x[i+ 7], 10,  1126891415);
+      c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
+      b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
+      a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571);
+      d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
+      c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
+      b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
+      a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);
+      d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
+      c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
+      b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649);
+      a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
+      d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
+      c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259);
+      b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
+
+      a = safe_add(a, olda);
+      b = safe_add(b, oldb);
+      c = safe_add(c, oldc);
+      d = safe_add(d, oldd);
+    }
+    return Array(a, b, c, d);
+  }
+
+  /*
+   * These functions implement the four basic operations the algorithm uses.
+   */
+  function md5_cmn(q, a, b, x, s, t)
+  {
+    return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
+  }
+  function md5_ff(a, b, c, d, x, s, t)
+  {
+    return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
+  }
+  function md5_gg(a, b, c, d, x, s, t)
+  {
+    return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
+  }
+  function md5_hh(a, b, c, d, x, s, t)
+  {
+    return md5_cmn(b ^ c ^ d, a, b, x, s, t);
+  }
+  function md5_ii(a, b, c, d, x, s, t)
+  {
+    return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
+  }
+
+  /*
+   * Add integers, wrapping at 2^32. This uses 16-bit operations internally
+   * to work around bugs in some JS interpreters.
+   */
+  function safe_add(x, y)
+  {
+    var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+    return (msw << 16) | (lsw & 0xFFFF);
+  }
+
+  /*
+   * Bitwise rotate a 32-bit number to the left.
+   */
+  function bit_rol(num, cnt)
+  {
+    return (num << cnt) | (num >>> (32 - cnt));
+  }
+
+  export.MD5 = hex_md5;
+})(window);

metadata

@@ -1,70 +1,56 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: gravtastic
-version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 3
-  - 1
-  - 0
-  version: 3.1.0
+version: !ruby/object:Gem::Version
+  version: 3.2.0
+  prerelease: !!null 
 platform: ruby
-authors: 
+authors:
 - Chris Lloyd
-autorequire: 
+autorequire: !!null 
 bindir: bin
 cert_chain: []
-
-date: 2010-10-18 00:00:00 +02:00
-default_executable: 
+date: 2011-08-03 00:00:00.000000000 +10:00
+default_executable: !!null 
 dependencies: []
-
 description: A Ruby wrapper for Gravatar URLs
 email: christopher.lloyd@gmail.com
 executables: []
-
 extensions: []
-
 extra_rdoc_files: []
-
-files: 
+files:
 - README.md
 - Rakefile
 - Gemfile
+- lib/gravtastic/engine.rb
 - lib/gravtastic/version.rb
 - lib/gravtastic.rb
 - spec/gravtastic_spec.rb
 - spec/helper.rb
-has_rdoc: false
+- vendor/assets/javascripts/gravtastic.coffee
+- vendor/assets/javascripts/md5.js
+has_rdoc: true
 homepage: http://github.com/chrislloyd/gravtastic
 licenses: []
-
-post_install_message: 
+post_install_message: !!null 
 rdoc_options: []
-
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
+required_ruby_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
 rubyforge_project: gravtastic
-rubygems_version: 1.3.7
-signing_key: 
+rubygems_version: 1.5.0
+signing_key: !!null 
 specification_version: 3
 summary: A Ruby wrapper for Gravatar URLs
 test_files: []
-