Work on vendor API abstraction, and near complete Safari support

3 files changed, 0 insertions, 376 deletions

diff --git a/lib/publicsuffixlist.min.js b/lib/publicsuffixlist.min.js
deleted file mode 100644
index e114a8e..0000000
--- a/lib/publicsuffixlist.min.js
+++ /dev/null
@@ -1,17 +0,0 @@
-/*! Home: https://github.com/gorhill/publicsuffixlist.js */
-/* Minified using http://refresh-sf.com/yui/ */
-;(function(i){var d={};var k={};var g="iscjsfsaolnm";var b=480;
-var j=/[^a-z0-9.-]/;function l(n){if(!n||n.charAt(0)==="."){return""}n=n.toLowerCase();var o=e(n);if(o===n){return""}var p=n.lastIndexOf(".",n.lastIndexOf(".",n.length-o.length)-1);
-if(p<=0){return n}return n.slice(p+1)}function e(n){if(!n){return""}var o;while(true){o=n.indexOf(".");if(o<0){return n}if(m(d,n)){return n.slice(o+1)
-}if(m(k,n)){return n}if(m(k,"*"+n.slice(o))){return n}n=n.slice(o+1)}}function m(v,t){var s=t.lastIndexOf(".");var o,x;if(s<0){o=t;
-x=t}else{o=t.slice(s+1);x=t.slice(0,s)}var u=v[o];if(!u){return false}if(typeof u==="string"){return u.indexOf(" "+x+" ")>=0
-}var p=x.length;var y=u[p];if(!y){return false}var n=0;var w=Math.floor(y.length/p+0.5);var r,q;while(n<w){r=n+w>>1;q=y.substr(p*r,p);
-if(x<q){w=r}else{if(x>q){n=r+1}else{return true}}}return false}function f(u,s){d={};k={};u=u.toLowerCase();var r=0,o;var p=u.length;
-var v,t,q,n;while(r<p){o=u.indexOf("\n",r);if(o<0){o=u.indexOf("\r",r);if(o<0){o=p}}v=u.slice(r,o).trim();r=o+1;if(v.length===0){continue
-}q=v.indexOf("//");if(q>=0){v=v.slice(0,q)}v=v.trim();if(!v){continue}if(j.test(v)){v=s(v)}if(v.charAt(0)==="!"){t=d;v=v.slice(1)
-}else{t=k}q=v.lastIndexOf(".");if(q<0){n=v}else{n=v.slice(q+1);v=v.slice(0,q)}if(!t.hasOwnProperty(n)){t[n]=[]}if(v){t[n].push(v)
-}}h(d);h(k)}function h(o){var q,s,r,n;for(var p in o){if(!o.hasOwnProperty(p)){continue}q=o[p].join(" ");if(!q){o[p]="";continue
-}if(q.length<b){o[p]=" "+q+" ";continue}r=o[p].length;q=[];while(r--){s=o[p][r];n=s.length;if(!q[n]){q[n]=[]}q[n].push(s)
-}n=q.length;while(n--){if(q[n]){q[n]=q[n].sort().join("")}}o[p]=q}return o}function c(){return{magic:g,rules:k,exceptions:d}
-}function a(n){if(typeof n!=="object"||typeof n.magic!=="string"||n.magic!==g){return false}k=n.rules;d=n.exceptions;return true
-}i=i||window;i.publicSuffixList={version:"1.0",parse:f,getDomain:l,getPublicSuffix:e,toSelfie:c,fromSelfie:a}})(this);
\ No newline at end of file
diff --git a/lib/punycode.min.js b/lib/punycode.min.js
deleted file mode 100644
index 4016a00..0000000
--- a/lib/punycode.min.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/*! http://mths.be/punycode v1.2.4 by @mathias */
-!function(a){function b(a){throw RangeError(E[a])}function c(a,b){for(var c=a.length;c--;)a[c]=b(a[c]);return a}function d(a,b){return c(a.split(D),b).join(".")}function e(a){for(var b,c,d=[],e=0,f=a.length;f>e;)b=a.charCodeAt(e++),b>=55296&&56319>=b&&f>e?(c=a.charCodeAt(e++),56320==(64512&c)?d.push(((1023&b)<<10)+(1023&c)+65536):(d.push(b),e--)):d.push(b);return d}function f(a){return c(a,function(a){var b="";return a>65535&&(a-=65536,b+=H(a>>>10&1023|55296),a=56320|1023&a),b+=H(a)}).join("")}function g(a){return 10>a-48?a-22:26>a-65?a-65:26>a-97?a-97:t}function h(a,b){return a+22+75*(26>a)-((0!=b)<<5)}function i(a,b,c){var d=0;for(a=c?G(a/x):a>>1,a+=G(a/b);a>F*v>>1;d+=t)a=G(a/F);return G(d+(F+1)*a/(a+w))}function j(a){var c,d,e,h,j,k,l,m,n,o,p=[],q=a.length,r=0,w=z,x=y;for(d=a.lastIndexOf(A),0>d&&(d=0),e=0;d>e;++e)a.charCodeAt(e)>=128&&b("not-basic"),p.push(a.charCodeAt(e));for(h=d>0?d+1:0;q>h;){for(j=r,k=1,l=t;h>=q&&b("invalid-input"),m=g(a.charCodeAt(h++)),(m>=t||m>G((s-r)/k))&&b("overflow"),r+=m*k,n=x>=l?u:l>=x+v?v:l-x,!(n>m);l+=t)o=t-n,k>G(s/o)&&b("overflow"),k*=o;c=p.length+1,x=i(r-j,c,0==j),G(r/c)>s-w&&b("overflow"),w+=G(r/c),r%=c,p.splice(r++,0,w)}return f(p)}function k(a){var c,d,f,g,j,k,l,m,n,o,p,q,r,w,x,B=[];for(a=e(a),q=a.length,c=z,d=0,j=y,k=0;q>k;++k)p=a[k],128>p&&B.push(H(p));for(f=g=B.length,g&&B.push(A);q>f;){for(l=s,k=0;q>k;++k)p=a[k],p>=c&&l>p&&(l=p);for(r=f+1,l-c>G((s-d)/r)&&b("overflow"),d+=(l-c)*r,c=l,k=0;q>k;++k)if(p=a[k],c>p&&++d>s&&b("overflow"),p==c){for(m=d,n=t;o=j>=n?u:n>=j+v?v:n-j,!(o>m);n+=t)x=m-o,w=t-o,B.push(H(h(o+x%w,0))),m=G(x/w);B.push(H(h(m,0))),j=i(d,r,f==g),d=0,++f}++d,++c}return B.join("")}function l(a){return d(a,function(a){return B.test(a)?j(a.slice(4).toLowerCase()):a})}function m(a){return d(a,function(a){return C.test(a)?"xn--"+k(a):a})}var n="object"==typeof exports&&exports,o="object"==typeof module&&module&&module.exports==n&&module,p="object"==typeof global&&global;(p.global===p||p.window===p)&&(a=p);var q,r,s=2147483647,t=36,u=1,v=26,w=38,x=700,y=72,z=128,A="-",B=/^xn--/,C=/[^ -~]/,D=/\x2E|\u3002|\uFF0E|\uFF61/g,E={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},F=t-u,G=Math.floor,H=String.fromCharCode;if(q={version:"1.2.4",ucs2:{decode:e,encode:f},decode:j,encode:k,toASCII:m,toUnicode:l},"function"==typeof define&&"object"==typeof define.amd&&define.amd)define("punycode",function(){return q});else if(n&&!n.nodeType)if(o)o.exports=q;else for(r in q)q.hasOwnProperty(r)&&(n[r]=q[r]);else a.punycode=q}(this);
diff --git a/lib/yamd5.js b/lib/yamd5.js
deleted file mode 100644
index d4b747a..0000000
--- a/lib/yamd5.js
+++ /dev/null
@@ -1,357 +0,0 @@
-/*******************************************************************************
-
-YaMD5 - Yet another MD5 hasher.
-home: https://github.com/gorhill/yamd5.js
-
-I needed an MD5 hasher, and as usual I want small code base, and fast.
-
-Originally found md5-o-matic [1]. It was fast but did not work with Unicode
-strings. Also, eventually realized it was really based on code from
-Joseph Myers [2] with no proper credits given (not nice).
-
-Then I found SparkMD5 [3], which works with Unicode strings, but at a steep
-cost to performance. Also, glancing at the code I saw avoidable redundancies
-causing the code base to be much larger than needed.
-
-So from this point I set out to write my own version, YaMD5 (sorry, I am
-not good with naming projects), of course heavily relying on the original
-code from Joseph Myers [2], and bits from SparkMD5 -- I started to work from
-SparkMD5 implementation, so there might be bits of code original to SparkMD5
-code left in a few places (like say, MD5.end()).
-
-Advantages of YaMD5:
-
-- Can handle Unicode strings
-- Natively incremental
-- Small code base
-- Fastest MD5 hasher out there so far for large input [4]
-- Even faster than versions supporting only simpler ascii strings
-
-
- [1] https://github.com/trentmillar/md5-o-matic
- [2] http://www.myersdaily.org/joseph/javascript/md5-text.html
- [3] https://github.com/satazor/SparkMD5
- [4] http://jsperf.com/md5-shootout/48
-
-So with that said, I don't know what license covers Joseph Myers' code (need
-to find out). In any case, concerning whatever original code I contributed in
-there:
-
-The MIT License (MIT)
-
-Copyright (C) 2014 Raymond Hill
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-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.
-
-**/
-
-/* jshint bitwise: false */
-
-(function(root) {
-
-    'use strict';
-
-    /*
-     * Fastest md5 implementation around (JKM md5)
-     * Credits: Joseph Myers
-     *
-     * @see http://www.myersdaily.org/joseph/javascript/md5-text.html
-     * @see http://jsperf.com/md5-shootout/7
-     */
-
-    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_Precedence
-    var ff = function(a, b, c, d, x, s, t) {
-        a += (b & c | ~b & d) + x + t;
-        return ((a << s | a >>> (32 - s)) + b) | 0;
-    };
-
-    var gg = function(a, b, c, d, x, s, t) {
-        a += (b & d | c & ~d) + x + t;
-        return ((a << s | a >>> (32 - s)) + b) | 0;
-    };
-
-    var hh = function(a, b, c, d, x, s, t) {
-        a += (b ^ c ^ d) + x + t;
-        return ((a << s | a >>> (32 - s)) + b) | 0;
-    };
-
-    var ii = function(a, b, c, d, x, s, t) {
-        a += (c ^ (b | ~d)) + x + t;
-        return ((a << s | a >>> (32 - s)) + b) | 0;
-    };
-
-    var md5cycle = function(x, k) {
-        var a = x[0],
-            b = x[1],
-            c = x[2],
-            d = x[3];
-
-        a = ff(a, b, c, d, k[0], 7, -680876936);
-        d = ff(d, a, b, c, k[1], 12, -389564586);
-        c = ff(c, d, a, b, k[2], 17, 606105819);
-        b = ff(b, c, d, a, k[3], 22, -1044525330);
-        a = ff(a, b, c, d, k[4], 7, -176418897);
-        d = ff(d, a, b, c, k[5], 12, 1200080426);
-        c = ff(c, d, a, b, k[6], 17, -1473231341);
-        b = ff(b, c, d, a, k[7], 22, -45705983);
-        a = ff(a, b, c, d, k[8], 7, 1770035416);
-        d = ff(d, a, b, c, k[9], 12, -1958414417);
-        c = ff(c, d, a, b, k[10], 17, -42063);
-        b = ff(b, c, d, a, k[11], 22, -1990404162);
-        a = ff(a, b, c, d, k[12], 7, 1804603682);
-        d = ff(d, a, b, c, k[13], 12, -40341101);
-        c = ff(c, d, a, b, k[14], 17, -1502002290);
-        b = ff(b, c, d, a, k[15], 22, 1236535329);
-
-        a = gg(a, b, c, d, k[1], 5, -165796510);
-        d = gg(d, a, b, c, k[6], 9, -1069501632);
-        c = gg(c, d, a, b, k[11], 14, 643717713);
-        b = gg(b, c, d, a, k[0], 20, -373897302);
-        a = gg(a, b, c, d, k[5], 5, -701558691);
-        d = gg(d, a, b, c, k[10], 9, 38016083);
-        c = gg(c, d, a, b, k[15], 14, -660478335);
-        b = gg(b, c, d, a, k[4], 20, -405537848);
-        a = gg(a, b, c, d, k[9], 5, 568446438);
-        d = gg(d, a, b, c, k[14], 9, -1019803690);
-        c = gg(c, d, a, b, k[3], 14, -187363961);
-        b = gg(b, c, d, a, k[8], 20, 1163531501);
-        a = gg(a, b, c, d, k[13], 5, -1444681467);
-        d = gg(d, a, b, c, k[2], 9, -51403784);
-        c = gg(c, d, a, b, k[7], 14, 1735328473);
-        b = gg(b, c, d, a, k[12], 20, -1926607734);
-
-        a = hh(a, b, c, d, k[5], 4, -378558);
-        d = hh(d, a, b, c, k[8], 11, -2022574463);
-        c = hh(c, d, a, b, k[11], 16, 1839030562);
-        b = hh(b, c, d, a, k[14], 23, -35309556);
-        a = hh(a, b, c, d, k[1], 4, -1530992060);
-        d = hh(d, a, b, c, k[4], 11, 1272893353);
-        c = hh(c, d, a, b, k[7], 16, -155497632);
-        b = hh(b, c, d, a, k[10], 23, -1094730640);
-        a = hh(a, b, c, d, k[13], 4, 681279174);
-        d = hh(d, a, b, c, k[0], 11, -358537222);
-        c = hh(c, d, a, b, k[3], 16, -722521979);
-        b = hh(b, c, d, a, k[6], 23, 76029189);
-        a = hh(a, b, c, d, k[9], 4, -640364487);
-        d = hh(d, a, b, c, k[12], 11, -421815835);
-        c = hh(c, d, a, b, k[15], 16, 530742520);
-        b = hh(b, c, d, a, k[2], 23, -995338651);
-
-        a = ii(a, b, c, d, k[0], 6, -198630844);
-        d = ii(d, a, b, c, k[7], 10, 1126891415);
-        c = ii(c, d, a, b, k[14], 15, -1416354905);
-        b = ii(b, c, d, a, k[5], 21, -57434055);
-        a = ii(a, b, c, d, k[12], 6, 1700485571);
-        d = ii(d, a, b, c, k[3], 10, -1894986606);
-        c = ii(c, d, a, b, k[10], 15, -1051523);
-        b = ii(b, c, d, a, k[1], 21, -2054922799);
-        a = ii(a, b, c, d, k[8], 6, 1873313359);
-        d = ii(d, a, b, c, k[15], 10, -30611744);
-        c = ii(c, d, a, b, k[6], 15, -1560198380);
-        b = ii(b, c, d, a, k[13], 21, 1309151649);
-        a = ii(a, b, c, d, k[4], 6, -145523070);
-        d = ii(d, a, b, c, k[11], 10, -1120210379);
-        c = ii(c, d, a, b, k[2], 15, 718787259);
-        b = ii(b, c, d, a, k[9], 21, -343485551);
-
-        x[0] = (a + x[0]) | 0;
-        x[1] = (b + x[1]) | 0;
-        x[2] = (c + x[2]) | 0;
-        x[3] = (d + x[3]) | 0;
-    };
-
-    var hexChars = '0123456789abcdef';
-    var hexOut = [];
-
-    var hex = function(x) {
-        var hc = hexChars;
-        var ho = hexOut;
-        var n, offset, j;
-        for (var i = 0; i < 4; i++) {
-            offset = i * 8;
-            n = x[i];
-            for ( j = 0; j < 8; j += 2 ) {
-                ho[offset+1+j] = hc.charAt(n & 0x0F);
-                n >>>= 4;
-                ho[offset+0+j] = hc.charAt(n & 0x0F);
-                n >>>= 4;
-            }
-        }
-        return ho.join('');
-    };
-
-    var MD5 = function() {
-        this._dataLength = 0;
-        this._state = new Int32Array(4);
-        this._buffer = new ArrayBuffer(68);
-        this._bufferLength = 0;
-        this._buffer8 = new Uint8Array(this._buffer, 0, 68);
-        this._buffer32 = new Uint32Array(this._buffer, 0, 17);
-        this.start();
-    };
-
-    var stateIdentity = new Int32Array([1732584193, -271733879, -1732584194, 271733878]);
-    var buffer32Identity = new Int32Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]);
-
-    // Char to code point to to array conversion:
-    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/charCodeAt#Example.3A_Fixing_charCodeAt_to_handle_non-Basic-Multilingual-Plane_characters_if_their_presence_earlier_in_the_string_is_unknown
-    MD5.prototype.appendStr = function(str) {
-        var buf8 = this._buffer8;
-        var buf32 = this._buffer32;
-        var bufLen = this._bufferLength;
-        var code;
-        for ( var i = 0; i < str.length; i++ ) {
-            code = str.charCodeAt(i);
-            if ( code < 128 ) {
-                buf8[bufLen++] = code;
-            } else if ( code < 0x800 ) {
-                buf8[bufLen++] = (code >>> 6) + 0xC0;
-                buf8[bufLen++] = code & 0x3F | 0x80;
-            } else if ( code < 0xD800 || code > 0xDBFF ) {
-                buf8[bufLen++] = (code >>> 12) + 0xE0;
-                buf8[bufLen++] = (code >>> 6 & 0x3F) | 0x80;
-                buf8[bufLen++] = (code & 0x3F) | 0x80;
-            } else {
-                code = ((code - 0xD800) * 0x400) + (str.charCodeAt(++i) - 0xDC00) + 0x10000;
-                if ( code > 0x10FFFF ) {
-                    throw 'Unicode standard supports code points up to U+10FFFF';
-                }
-                buf8[bufLen++] = (code >>> 18) + 0xF0;
-                buf8[bufLen++] = (code >>> 12 & 0x3F) | 0x80;
-                buf8[bufLen++] = (code >>> 6 & 0x3F) | 0x80;
-                buf8[bufLen++] = (code & 0x3F) | 0x80;
-            }
-            if ( bufLen >= 64 ) {
-                this._dataLength += 64;
-                md5cycle(this._state, buf32);
-                bufLen -= 64;
-                buf32[0] = buf32[16];
-            }
-        }
-        this._bufferLength = bufLen;
-        return this;
-    };
-
-    MD5.prototype.appendAsciiStr = function(str) {
-        var buf8 = this._buffer8;
-        var buf32 = this._buffer32;
-        var bufLen = this._bufferLength;
-        var i, j = 0;
-        for (;;) {
-            i = Math.min(str.length-j, 64-bufLen);
-            while ( i-- ) {
-                buf8[bufLen++] = str.charCodeAt(j++);
-            }
-            if ( bufLen < 64 ) {
-                break;
-            }
-            this._dataLength += 64;
-            md5cycle(this._state, buf32);
-            bufLen = 0;
-        }
-        this._bufferLength = bufLen;
-        return this;
-    };
-
-    MD5.prototype.appendByteArray = function(input) {
-        var buf8 = this._buffer8;
-        var buf32 = this._buffer32;
-        var bufLen = this._bufferLength;
-        var i, j = 0;
-        for (;;) {
-            i = Math.min(input.length-j, 64-bufLen);
-            while ( i-- ) {
-                buf8[bufLen++] = input[j++];
-            }
-            if ( bufLen < 64 ) {
-                break;
-            }
-            this._dataLength += 64;
-            md5cycle(this._state, buf32);
-            bufLen = 0;
-        }
-        this._bufferLength = bufLen;
-        return this;
-    };
-
-    MD5.prototype.start = function() {
-        this._dataLength = 0;
-        this._bufferLength = 0;
-        this._state.set(stateIdentity);
-        return this;
-    };
-
-    MD5.prototype.end = function(raw) {
-        var bufLen = this._bufferLength;
-        this._dataLength += bufLen;
-        var buf8 = this._buffer8;
-        buf8[bufLen] = 0x80;
-        buf8[bufLen+1] =  buf8[bufLen+2] =  buf8[bufLen+3] = 0;
-        var buf32 = this._buffer32;
-        var i = (bufLen >> 2) + 1;
-        buf32.set(buffer32Identity.subarray(i), i);
-        if (bufLen > 55) {
-            md5cycle(this._state, buf32);
-            buf32.set(buffer32Identity);
-        }
-        // Do the final computation based on the tail and length
-        // Beware that the final length may not fit in 32 bits so we take care of that
-        var dataBitsLen = this._dataLength * 8;
-        if ( dataBitsLen <= 0xFFFFFFFF ) {
-            buf32[14] = dataBitsLen;
-        } else {
-            var matches = dataBitsLen.toString(16).match(/(.*?)(.{0,8})$/);
-            var lo = parseInt(matches[2], 16);
-            var hi = parseInt(matches[1], 16) || 0;
-            buf32[14] = lo;
-            buf32[15] = hi;
-        }
-        md5cycle(this._state, buf32);
-
-        return !!raw ? this._state : hex(this._state);
-    };
-
-    // This permanent instance is to use for one-call hashing
-    var onePassHasher = new MD5();
-
-    MD5.hashStr = function(str, raw) {
-        return onePassHasher
-            .start()
-            .appendStr(str)
-            .end(raw);
-    };
-
-    MD5.hashAsciiStr = function(str, raw) {
-        return onePassHasher
-            .start()
-            .appendAsciiStr(str)
-            .end(raw);
-    };
-
-    // Self-test
-    // In some cases the fast add32 function cannot be used..
-    if ( MD5.hashStr('hello') !== '5d41402abc4b2a76b9719d911017c592' ) {
-        console.error('YaMD5> this javascript engine does not support YaMD5. Sorry.');
-    }
-
-    if ( typeof root === 'object' ) {
-        root.YaMD5 = MD5;
-    }
-    return MD5;
-})(this);