underscore
Advanced tools
Comparing version 1.3.3 to 1.4.0
| { | ||
| "name" : "underscore", | ||
| "description" : "JavaScript's functional programming helper library.", | ||
| "homepage" : "http://documentcloud.github.com/underscore/", | ||
| "homepage" : "http://underscorejs.org", | ||
| "keywords" : ["util", "functional", "server", "client", "browser"], | ||
@@ -9,3 +9,3 @@ "author" : "Jeremy Ashkenas <jeremy@documentcloud.org>", | ||
| "main" : "underscore.js", | ||
| "version" : "1.3.3" | ||
| "version" : "1.4.0" | ||
| } |
@@ -1,19 +0,19 @@ | ||
| __ | ||
| /\ \ __ | ||
| __ __ ___ \_\ \ __ _ __ ____ ___ ___ _ __ __ /\_\ ____ | ||
| /\ \/\ \ /' _ `\ /'_ \ /'__`\/\ __\/ ,__\ / ___\ / __`\/\ __\/'__`\ \/\ \ /',__\ | ||
| __ | ||
| /\ \ __ | ||
| __ __ ___ \_\ \ __ _ __ ____ ___ ___ _ __ __ /\_\ ____ | ||
| /\ \/\ \ /' _ `\ /'_ \ /'__`\/\ __\/ ,__\ / ___\ / __`\/\ __\/'__`\ \/\ \ /',__\ | ||
| \ \ \_\ \/\ \/\ \/\ \ \ \/\ __/\ \ \//\__, `\/\ \__//\ \ \ \ \ \//\ __/ __ \ \ \/\__, `\ | ||
| \ \____/\ \_\ \_\ \___,_\ \____\\ \_\\/\____/\ \____\ \____/\ \_\\ \____\/\_\ _\ \ \/\____/ | ||
| \/___/ \/_/\/_/\/__,_ /\/____/ \/_/ \/___/ \/____/\/___/ \/_/ \/____/\/_//\ \_\ \/___/ | ||
| \ \____/ | ||
| \/___/ \/_/\/_/\/__,_ /\/____/ \/_/ \/___/ \/____/\/___/ \/_/ \/____/\/_//\ \_\ \/___/ | ||
| \ \____/ | ||
| \/___/ | ||
| Underscore.js is a utility-belt library for JavaScript that provides | ||
| support for the usual functional suspects (each, map, reduce, filter...) | ||
| Underscore.js is a utility-belt library for JavaScript that provides | ||
| support for the usual functional suspects (each, map, reduce, filter...) | ||
| without extending any core JavaScript objects. | ||
| For Docs, License, Tests, and pre-packed downloads, see: | ||
| http://documentcloud.github.com/underscore/ | ||
| http://underscorejs.org | ||
| Many thanks to our contributors: | ||
| https://github.com/documentcloud/underscore/contributors |
@@ -1,32 +0,5 @@ | ||
| // Underscore.js 1.3.3 | ||
| // (c) 2009-2012 Jeremy Ashkenas, DocumentCloud Inc. | ||
| // Underscore is freely distributable under the MIT license. | ||
| // Portions of Underscore are inspired or borrowed from Prototype, | ||
| // Oliver Steele's Functional, and John Resig's Micro-Templating. | ||
| // For all details and documentation: | ||
| // http://documentcloud.github.com/underscore | ||
| (function(){function r(a,c,d){if(a===c)return 0!==a||1/a==1/c;if(null==a||null==c)return a===c;a._chain&&(a=a._wrapped);c._chain&&(c=c._wrapped);if(a.isEqual&&b.isFunction(a.isEqual))return a.isEqual(c);if(c.isEqual&&b.isFunction(c.isEqual))return c.isEqual(a);var e=l.call(a);if(e!=l.call(c))return!1;switch(e){case "[object String]":return a==""+c;case "[object Number]":return a!=+a?c!=+c:0==a?1/a==1/c:a==+c;case "[object Date]":case "[object Boolean]":return+a==+c;case "[object RegExp]":return a.source== | ||
| c.source&&a.global==c.global&&a.multiline==c.multiline&&a.ignoreCase==c.ignoreCase}if("object"!=typeof a||"object"!=typeof c)return!1;for(var f=d.length;f--;)if(d[f]==a)return!0;d.push(a);var f=0,g=!0;if("[object Array]"==e){if(f=a.length,g=f==c.length)for(;f--&&(g=f in a==f in c&&r(a[f],c[f],d)););}else{if("constructor"in a!="constructor"in c||a.constructor!=c.constructor)return!1;for(var h in a)if(b.has(a,h)&&(f++,!(g=b.has(c,h)&&r(a[h],c[h],d))))break;if(g){for(h in c)if(b.has(c,h)&&!f--)break; | ||
| g=!f}}d.pop();return g}var s=this,I=s._,o={},k=Array.prototype,p=Object.prototype,i=k.slice,J=k.unshift,l=p.toString,K=p.hasOwnProperty,y=k.forEach,z=k.map,A=k.reduce,B=k.reduceRight,C=k.filter,D=k.every,E=k.some,q=k.indexOf,F=k.lastIndexOf,p=Array.isArray,L=Object.keys,t=Function.prototype.bind,b=function(a){return new m(a)};"undefined"!==typeof exports?("undefined"!==typeof module&&module.exports&&(exports=module.exports=b),exports._=b):s._=b;b.VERSION="1.3.3";var j=b.each=b.forEach=function(a, | ||
| c,d){if(a!=null)if(y&&a.forEach===y)a.forEach(c,d);else if(a.length===+a.length)for(var e=0,f=a.length;e<f;e++){if(e in a&&c.call(d,a[e],e,a)===o)break}else for(e in a)if(b.has(a,e)&&c.call(d,a[e],e,a)===o)break};b.map=b.collect=function(a,c,b){var e=[];if(a==null)return e;if(z&&a.map===z)return a.map(c,b);j(a,function(a,g,h){e[e.length]=c.call(b,a,g,h)});if(a.length===+a.length)e.length=a.length;return e};b.reduce=b.foldl=b.inject=function(a,c,d,e){var f=arguments.length>2;a==null&&(a=[]);if(A&& | ||
| a.reduce===A){e&&(c=b.bind(c,e));return f?a.reduce(c,d):a.reduce(c)}j(a,function(a,b,i){if(f)d=c.call(e,d,a,b,i);else{d=a;f=true}});if(!f)throw new TypeError("Reduce of empty array with no initial value");return d};b.reduceRight=b.foldr=function(a,c,d,e){var f=arguments.length>2;a==null&&(a=[]);if(B&&a.reduceRight===B){e&&(c=b.bind(c,e));return f?a.reduceRight(c,d):a.reduceRight(c)}var g=b.toArray(a).reverse();e&&!f&&(c=b.bind(c,e));return f?b.reduce(g,c,d,e):b.reduce(g,c)};b.find=b.detect=function(a, | ||
| c,b){var e;G(a,function(a,g,h){if(c.call(b,a,g,h)){e=a;return true}});return e};b.filter=b.select=function(a,c,b){var e=[];if(a==null)return e;if(C&&a.filter===C)return a.filter(c,b);j(a,function(a,g,h){c.call(b,a,g,h)&&(e[e.length]=a)});return e};b.reject=function(a,c,b){var e=[];if(a==null)return e;j(a,function(a,g,h){c.call(b,a,g,h)||(e[e.length]=a)});return e};b.every=b.all=function(a,c,b){var e=true;if(a==null)return e;if(D&&a.every===D)return a.every(c,b);j(a,function(a,g,h){if(!(e=e&&c.call(b, | ||
| a,g,h)))return o});return!!e};var G=b.some=b.any=function(a,c,d){c||(c=b.identity);var e=false;if(a==null)return e;if(E&&a.some===E)return a.some(c,d);j(a,function(a,b,h){if(e||(e=c.call(d,a,b,h)))return o});return!!e};b.include=b.contains=function(a,c){var b=false;if(a==null)return b;if(q&&a.indexOf===q)return a.indexOf(c)!=-1;return b=G(a,function(a){return a===c})};b.invoke=function(a,c){var d=i.call(arguments,2);return b.map(a,function(a){return(b.isFunction(c)?c||a:a[c]).apply(a,d)})};b.pluck= | ||
| function(a,c){return b.map(a,function(a){return a[c]})};b.max=function(a,c,d){if(!c&&b.isArray(a)&&a[0]===+a[0])return Math.max.apply(Math,a);if(!c&&b.isEmpty(a))return-Infinity;var e={computed:-Infinity};j(a,function(a,b,h){b=c?c.call(d,a,b,h):a;b>=e.computed&&(e={value:a,computed:b})});return e.value};b.min=function(a,c,d){if(!c&&b.isArray(a)&&a[0]===+a[0])return Math.min.apply(Math,a);if(!c&&b.isEmpty(a))return Infinity;var e={computed:Infinity};j(a,function(a,b,h){b=c?c.call(d,a,b,h):a;b<e.computed&& | ||
| (e={value:a,computed:b})});return e.value};b.shuffle=function(a){var b=[],d;j(a,function(a,f){d=Math.floor(Math.random()*(f+1));b[f]=b[d];b[d]=a});return b};b.sortBy=function(a,c,d){var e=b.isFunction(c)?c:function(a){return a[c]};return b.pluck(b.map(a,function(a,b,c){return{value:a,criteria:e.call(d,a,b,c)}}).sort(function(a,b){var c=a.criteria,d=b.criteria;return c===void 0?1:d===void 0?-1:c<d?-1:c>d?1:0}),"value")};b.groupBy=function(a,c){var d={},e=b.isFunction(c)?c:function(a){return a[c]}; | ||
| j(a,function(a,b){var c=e(a,b);(d[c]||(d[c]=[])).push(a)});return d};b.sortedIndex=function(a,c,d){d||(d=b.identity);for(var e=0,f=a.length;e<f;){var g=e+f>>1;d(a[g])<d(c)?e=g+1:f=g}return e};b.toArray=function(a){return!a?[]:b.isArray(a)||b.isArguments(a)?i.call(a):a.toArray&&b.isFunction(a.toArray)?a.toArray():b.values(a)};b.size=function(a){return b.isArray(a)?a.length:b.keys(a).length};b.first=b.head=b.take=function(a,b,d){return b!=null&&!d?i.call(a,0,b):a[0]};b.initial=function(a,b,d){return i.call(a, | ||
| 0,a.length-(b==null||d?1:b))};b.last=function(a,b,d){return b!=null&&!d?i.call(a,Math.max(a.length-b,0)):a[a.length-1]};b.rest=b.tail=function(a,b,d){return i.call(a,b==null||d?1:b)};b.compact=function(a){return b.filter(a,function(a){return!!a})};b.flatten=function(a,c){return b.reduce(a,function(a,e){if(b.isArray(e))return a.concat(c?e:b.flatten(e));a[a.length]=e;return a},[])};b.without=function(a){return b.difference(a,i.call(arguments,1))};b.uniq=b.unique=function(a,c,d){var d=d?b.map(a,d):a, | ||
| e=[];a.length<3&&(c=true);b.reduce(d,function(d,g,h){if(c?b.last(d)!==g||!d.length:!b.include(d,g)){d.push(g);e.push(a[h])}return d},[]);return e};b.union=function(){return b.uniq(b.flatten(arguments,true))};b.intersection=b.intersect=function(a){var c=i.call(arguments,1);return b.filter(b.uniq(a),function(a){return b.every(c,function(c){return b.indexOf(c,a)>=0})})};b.difference=function(a){var c=b.flatten(i.call(arguments,1),true);return b.filter(a,function(a){return!b.include(c,a)})};b.zip=function(){for(var a= | ||
| i.call(arguments),c=b.max(b.pluck(a,"length")),d=Array(c),e=0;e<c;e++)d[e]=b.pluck(a,""+e);return d};b.indexOf=function(a,c,d){if(a==null)return-1;var e;if(d){d=b.sortedIndex(a,c);return a[d]===c?d:-1}if(q&&a.indexOf===q)return a.indexOf(c);d=0;for(e=a.length;d<e;d++)if(d in a&&a[d]===c)return d;return-1};b.lastIndexOf=function(a,b){if(a==null)return-1;if(F&&a.lastIndexOf===F)return a.lastIndexOf(b);for(var d=a.length;d--;)if(d in a&&a[d]===b)return d;return-1};b.range=function(a,b,d){if(arguments.length<= | ||
| 1){b=a||0;a=0}for(var d=arguments[2]||1,e=Math.max(Math.ceil((b-a)/d),0),f=0,g=Array(e);f<e;){g[f++]=a;a=a+d}return g};var H=function(){};b.bind=function(a,c){var d,e;if(a.bind===t&&t)return t.apply(a,i.call(arguments,1));if(!b.isFunction(a))throw new TypeError;e=i.call(arguments,2);return d=function(){if(!(this instanceof d))return a.apply(c,e.concat(i.call(arguments)));H.prototype=a.prototype;var b=new H,g=a.apply(b,e.concat(i.call(arguments)));return Object(g)===g?g:b}};b.bindAll=function(a){var c= | ||
| i.call(arguments,1);c.length==0&&(c=b.functions(a));j(c,function(c){a[c]=b.bind(a[c],a)});return a};b.memoize=function(a,c){var d={};c||(c=b.identity);return function(){var e=c.apply(this,arguments);return b.has(d,e)?d[e]:d[e]=a.apply(this,arguments)}};b.delay=function(a,b){var d=i.call(arguments,2);return setTimeout(function(){return a.apply(null,d)},b)};b.defer=function(a){return b.delay.apply(b,[a,1].concat(i.call(arguments,1)))};b.throttle=function(a,c){var d,e,f,g,h,i,j=b.debounce(function(){h= | ||
| g=false},c);return function(){d=this;e=arguments;f||(f=setTimeout(function(){f=null;h&&a.apply(d,e);j()},c));g?h=true:i=a.apply(d,e);j();g=true;return i}};b.debounce=function(a,b,d){var e;return function(){var f=this,g=arguments;d&&!e&&a.apply(f,g);clearTimeout(e);e=setTimeout(function(){e=null;d||a.apply(f,g)},b)}};b.once=function(a){var b=false,d;return function(){if(b)return d;b=true;return d=a.apply(this,arguments)}};b.wrap=function(a,b){return function(){var d=[a].concat(i.call(arguments,0)); | ||
| return b.apply(this,d)}};b.compose=function(){var a=arguments;return function(){for(var b=arguments,d=a.length-1;d>=0;d--)b=[a[d].apply(this,b)];return b[0]}};b.after=function(a,b){return a<=0?b():function(){if(--a<1)return b.apply(this,arguments)}};b.keys=L||function(a){if(a!==Object(a))throw new TypeError("Invalid object");var c=[],d;for(d in a)b.has(a,d)&&(c[c.length]=d);return c};b.values=function(a){return b.map(a,b.identity)};b.functions=b.methods=function(a){var c=[],d;for(d in a)b.isFunction(a[d])&& | ||
| c.push(d);return c.sort()};b.extend=function(a){j(i.call(arguments,1),function(b){for(var d in b)a[d]=b[d]});return a};b.pick=function(a){var c={};j(b.flatten(i.call(arguments,1)),function(b){b in a&&(c[b]=a[b])});return c};b.defaults=function(a){j(i.call(arguments,1),function(b){for(var d in b)a[d]==null&&(a[d]=b[d])});return a};b.clone=function(a){return!b.isObject(a)?a:b.isArray(a)?a.slice():b.extend({},a)};b.tap=function(a,b){b(a);return a};b.isEqual=function(a,b){return r(a,b,[])};b.isEmpty= | ||
| function(a){if(a==null)return true;if(b.isArray(a)||b.isString(a))return a.length===0;for(var c in a)if(b.has(a,c))return false;return true};b.isElement=function(a){return!!(a&&a.nodeType==1)};b.isArray=p||function(a){return l.call(a)=="[object Array]"};b.isObject=function(a){return a===Object(a)};b.isArguments=function(a){return l.call(a)=="[object Arguments]"};b.isArguments(arguments)||(b.isArguments=function(a){return!(!a||!b.has(a,"callee"))});b.isFunction=function(a){return l.call(a)=="[object Function]"}; | ||
| b.isString=function(a){return l.call(a)=="[object String]"};b.isNumber=function(a){return l.call(a)=="[object Number]"};b.isFinite=function(a){return b.isNumber(a)&&isFinite(a)};b.isNaN=function(a){return a!==a};b.isBoolean=function(a){return a===true||a===false||l.call(a)=="[object Boolean]"};b.isDate=function(a){return l.call(a)=="[object Date]"};b.isRegExp=function(a){return l.call(a)=="[object RegExp]"};b.isNull=function(a){return a===null};b.isUndefined=function(a){return a===void 0};b.has=function(a, | ||
| b){return K.call(a,b)};b.noConflict=function(){s._=I;return this};b.identity=function(a){return a};b.times=function(a,b,d){for(var e=0;e<a;e++)b.call(d,e)};b.escape=function(a){return(""+a).replace(/&/g,"&").replace(/</g,"<").replace(/>/g,">").replace(/"/g,""").replace(/'/g,"'").replace(/\//g,"/")};b.result=function(a,c){if(a==null)return null;var d=a[c];return b.isFunction(d)?d.call(a):d};b.mixin=function(a){j(b.functions(a),function(c){M(c,b[c]=a[c])})};var N=0;b.uniqueId= | ||
| function(a){var b=N++;return a?a+b:b};b.templateSettings={evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,escape:/<%-([\s\S]+?)%>/g};var u=/.^/,n={"\\":"\\","'":"'",r:"\r",n:"\n",t:"\t",u2028:"\u2028",u2029:"\u2029"},v;for(v in n)n[n[v]]=v;var O=/\\|'|\r|\n|\t|\u2028|\u2029/g,P=/\\(\\|'|r|n|t|u2028|u2029)/g,w=function(a){return a.replace(P,function(a,b){return n[b]})};b.template=function(a,c,d){d=b.defaults(d||{},b.templateSettings);a="__p+='"+a.replace(O,function(a){return"\\"+n[a]}).replace(d.escape|| | ||
| u,function(a,b){return"'+\n_.escape("+w(b)+")+\n'"}).replace(d.interpolate||u,function(a,b){return"'+\n("+w(b)+")+\n'"}).replace(d.evaluate||u,function(a,b){return"';\n"+w(b)+"\n;__p+='"})+"';\n";d.variable||(a="with(obj||{}){\n"+a+"}\n");var a="var __p='';var print=function(){__p+=Array.prototype.join.call(arguments, '')};\n"+a+"return __p;\n",e=new Function(d.variable||"obj","_",a);if(c)return e(c,b);c=function(a){return e.call(this,a,b)};c.source="function("+(d.variable||"obj")+"){\n"+a+"}";return c}; | ||
| b.chain=function(a){return b(a).chain()};var m=function(a){this._wrapped=a};b.prototype=m.prototype;var x=function(a,c){return c?b(a).chain():a},M=function(a,c){m.prototype[a]=function(){var a=i.call(arguments);J.call(a,this._wrapped);return x(c.apply(b,a),this._chain)}};b.mixin(b);j("pop,push,reverse,shift,sort,splice,unshift".split(","),function(a){var b=k[a];m.prototype[a]=function(){var d=this._wrapped;b.apply(d,arguments);var e=d.length;(a=="shift"||a=="splice")&&e===0&&delete d[0];return x(d, | ||
| this._chain)}});j(["concat","join","slice"],function(a){var b=k[a];m.prototype[a]=function(){return x(b.apply(this._wrapped,arguments),this._chain)}});m.prototype.chain=function(){this._chain=true;return this};m.prototype.value=function(){return this._wrapped}}).call(this); | ||
| // Underscore.js 1.4.0 | ||
| // http://underscorejs.org | ||
| // (c) 2009-2012 Jeremy Ashkenas, DocumentCloud Inc. | ||
| // Underscore may be freely distributed under the MIT license. | ||
| (function(){var e=this,t=e._,n={},r=Array.prototype,i=Object.prototype,s=Function.prototype,o=r.push,u=r.slice,a=r.concat,f=r.unshift,l=i.toString,c=i.hasOwnProperty,h=r.forEach,p=r.map,d=r.reduce,v=r.reduceRight,m=r.filter,g=r.every,y=r.some,b=r.indexOf,w=r.lastIndexOf,E=Array.isArray,S=Object.keys,x=s.bind,T=function(e){if(e instanceof T)return e;if(!(this instanceof T))return new T(e);this._wrapped=e};typeof exports!="undefined"?(typeof module!="undefined"&&module.exports&&(exports=module.exports=T),exports._=T):e._=T,T.VERSION="1.4.0";var N=T.each=T.forEach=function(e,t,r){if(h&&e.forEach===h)e.forEach(t,r);else if(e.length===+e.length){for(var i=0,s=e.length;i<s;i++)if(t.call(r,e[i],i,e)===n)return}else for(var o in e)if(T.has(e,o)&&t.call(r,e[o],o,e)===n)return};T.map=T.collect=function(e,t,n){var r=[];return p&&e.map===p?e.map(t,n):(N(e,function(e,i,s){r[r.length]=t.call(n,e,i,s)}),r)},T.reduce=T.foldl=T.inject=function(e,t,n,r){var i=arguments.length>2;if(d&&e.reduce===d)return r&&(t=T.bind(t,r)),i?e.reduce(t,n):e.reduce(t);N(e,function(e,s,o){i?n=t.call(r,n,e,s,o):(n=e,i=!0)});if(!i)throw new TypeError("Reduce of empty array with no initial value");return n},T.reduceRight=T.foldr=function(e,t,n,r){var i=arguments.length>2;if(v&&e.reduceRight===v)return r&&(t=T.bind(t,r)),arguments.length>2?e.reduceRight(t,n):e.reduceRight(t);var s=e.length;if(s!==+s){var o=T.keys(e);s=o.length}N(e,function(u,a,f){a=o?o[--s]:--s,i?n=t.call(r,n,e[a],a,f):(n=e[a],i=!0)});if(!i)throw new TypeError("Reduce of empty array with no initial value");return n},T.find=T.detect=function(e,t,n){var r;return C(e,function(e,i,s){if(t.call(n,e,i,s))return r=e,!0}),r},T.filter=T.select=function(e,t,n){var r=[];return m&&e.filter===m?e.filter(t,n):(N(e,function(e,i,s){t.call(n,e,i,s)&&(r[r.length]=e)}),r)},T.reject=function(e,t,n){var r=[];return N(e,function(e,i,s){t.call(n,e,i,s)||(r[r.length]=e)}),r},T.every=T.all=function(e,t,r){t||(t=T.identity);var i=!0;return g&&e.every===g?e.every(t,r):(N(e,function(e,s,o){if(!(i=i&&t.call(r,e,s,o)))return n}),!!i)};var C=T.some=T.any=function(e,t,r){t||(t=T.identity);var i=!1;return y&&e.some===y?e.some(t,r):(N(e,function(e,s,o){if(i||(i=t.call(r,e,s,o)))return n}),!!i)};T.contains=T.include=function(e,t){var n=!1;return b&&e.indexOf===b?e.indexOf(t)!=-1:(n=C(e,function(e){return e===t}),n)},T.invoke=function(e,t){var n=u.call(arguments,2);return T.map(e,function(e){return(T.isFunction(t)?t:e[t]).apply(e,n)})},T.pluck=function(e,t){return T.map(e,function(e){return e[t]})},T.where=function(e,t){return T.isEmpty(t)?[]:T.filter(e,function(e){for(var n in t)if(t[n]!==e[n])return!1;return!0})},T.max=function(e,t,n){if(!t&&T.isArray(e)&&e[0]===+e[0]&&e.length<65535)return Math.max.apply(Math,e);if(!t&&T.isEmpty(e))return-Infinity;var r={computed:-Infinity};return N(e,function(e,i,s){var o=t?t.call(n,e,i,s):e;o>=r.computed&&(r={value:e,computed:o})}),r.value},T.min=function(e,t,n){if(!t&&T.isArray(e)&&e[0]===+e[0]&&e.length<65535)return Math.min.apply(Math,e);if(!t&&T.isEmpty(e))return Infinity;var r={computed:Infinity};return N(e,function(e,i,s){var o=t?t.call(n,e,i,s):e;o<r.computed&&(r={value:e,computed:o})}),r.value},T.shuffle=function(e){var t,n=0,r=[];return N(e,function(e){t=T.random(n++),r[n-1]=r[t],r[t]=e}),r};var k=function(e){return T.isFunction(e)?e:function(t){return t[e]}};T.sortBy=function(e,t,n){var r=k(t);return T.pluck(T.map(e,function(e,t,i){return{value:e,index:t,criteria:r.call(n,e,t,i)}}).sort(function(e,t){var n=e.criteria,r=t.criteria;if(n!==r){if(n>r||n===void 0)return 1;if(n<r||r===void 0)return-1}return e.index<t.index?-1:1}),"value")};var L=function(e,t,n,r){var i={},s=k(t);return N(e,function(t,o){var u=s.call(n,t,o,e);r(i,u,t)}),i};T.groupBy=function(e,t,n){return L(e,t,n,function(e,t,n){(T.has(e,t)?e[t]:e[t]=[]).push(n)})},T.countBy=function(e,t,n){return L(e,t,n,function(e,t,n){T.has(e,t)||(e[t]=0),e[t]++})},T.sortedIndex=function(e,t,n,r){n=n==null?T.identity:k(n);var i=n.call(r,t),s=0,o=e.length;while(s<o){var u=s+o>>>1;n.call(r,e[u])<i?s=u+1:o=u}return s},T.toArray=function(e){return e?e.length===+e.length?u.call(e):T.values(e):[]},T.size=function(e){return e.length===+e.length?e.length:T.keys(e).length},T.first=T.head=T.take=function(e,t,n){return t!=null&&!n?u.call(e,0,t):e[0]},T.initial=function(e,t,n){return u.call(e,0,e.length-(t==null||n?1:t))},T.last=function(e,t,n){return t!=null&&!n?u.call(e,Math.max(e.length-t,0)):e[e.length-1]},T.rest=T.tail=T.drop=function(e,t,n){return u.call(e,t==null||n?1:t)},T.compact=function(e){return T.filter(e,function(e){return!!e})};var A=function(e,t,n){return N(e,function(e){T.isArray(e)?t?o.apply(n,e):A(e,t,n):n.push(e)}),n};T.flatten=function(e,t){return A(e,t,[])},T.without=function(e){return T.difference(e,u.call(arguments,1))},T.uniq=T.unique=function(e,t,n,r){var i=n?T.map(e,n,r):e,s=[],o=[];return N(i,function(n,r){if(t?!r||o[o.length-1]!==n:!T.contains(o,n))o.push(n),s.push(e[r])}),s},T.union=function(){return T.uniq(a.apply(r,arguments))},T.intersection=function(e){var t=u.call(arguments,1);return T.filter(T.uniq(e),function(e){return T.every(t,function(t){return T.indexOf(t,e)>=0})})},T.difference=function(e){var t=a.apply(r,u.call(arguments,1));return T.filter(e,function(e){return!T.contains(t,e)})},T.zip=function(){var e=u.call(arguments),t=T.max(T.pluck(e,"length")),n=new Array(t);for(var r=0;r<t;r++)n[r]=T.pluck(e,""+r);return n},T.object=function(e,t){var n={};for(var r=0,i=e.length;r<i;r++)t?n[e[r]]=t[r]:n[e[r][0]]=e[r][1];return n},T.indexOf=function(e,t,n){var r=0,i=e.length;if(n){if(typeof n!="number")return r=T.sortedIndex(e,t),e[r]===t?r:-1;r=n<0?Math.max(0,i+n):n}if(b&&e.indexOf===b)return e.indexOf(t,n);for(;r<i;r++)if(e[r]===t)return r;return-1},T.lastIndexOf=function(e,t,n){if(w&&e.lastIndexOf===w)return e.lastIndexOf(t,n);var r=n!=null?n:e.length;while(r--)if(e[r]===t)return r;return-1},T.range=function(e,t,n){arguments.length<=1&&(t=e||0,e=0),n=arguments[2]||1;var r=Math.max(Math.ceil((t-e)/n),0),i=0,s=new Array(r);while(i<r)s[i++]=e,e+=n;return s};var O=function(){};T.bind=function(t,n){var r,i;if(t.bind===x&&x)return x.apply(t,u.call(arguments,1));if(!T.isFunction(t))throw new TypeError;return i=u.call(arguments,2),r=function(){if(this instanceof r){O.prototype=t.prototype;var e=new O,s=t.apply(e,i.concat(u.call(arguments)));return Object(s)===s?s:e}return t.apply(n,i.concat(u.call(arguments)))}},T.bindAll=function(e){var t=u.call(arguments,1);return t.length==0&&(t=T.functions(e)),N(t,function(t){e[t]=T.bind(e[t],e)}),e},T.memoize=function(e,t){var n={};return t||(t=T.identity),function(){var r=t.apply(this,arguments);return T.has(n,r)?n[r]:n[r]=e.apply(this,arguments)}},T.delay=function(e,t){var n=u.call(arguments,2);return setTimeout(function(){return e.apply(null,n)},t)},T.defer=function(e){return T.delay.apply(T,[e,1].concat(u.call(arguments,1)))},T.throttle=function(e,t){var n,r,i,s,o,u,a=T.debounce(function(){o=s=!1},t);return function(){n=this,r=arguments;var f=function(){i=null,o&&(u=e.apply(n,r)),a()};return i||(i=setTimeout(f,t)),s?o=!0:(s=!0,u=e.apply(n,r)),a(),u}},T.debounce=function(e,t,n){var r,i;return function(){var s=this,o=arguments,u=function(){r=null,n||(i=e.apply(s,o))},a=n&&!r;return clearTimeout(r),r=setTimeout(u,t),a&&(i=e.apply(s,o)),i}},T.once=function(e){var t=!1,n;return function(){return t?n:(t=!0,n=e.apply(this,arguments),e=null,n)}},T.wrap=function(e,t){return function(){var n=[e];return o.apply(n,arguments),t.apply(this,n)}},T.compose=function(){var e=arguments;return function(){var t=arguments;for(var n=e.length-1;n>=0;n--)t=[e[n].apply(this,t)];return t[0]}},T.after=function(e,t){return e<=0?t():function(){if(--e<1)return t.apply(this,arguments)}},T.keys=S||function(e){if(e!==Object(e))throw new TypeError("Invalid object");var t=[];for(var n in e)T.has(e,n)&&(t[t.length]=n);return t},T.values=function(e){var t=[];for(var n in e)T.has(e,n)&&t.push(e[n]);return t},T.pairs=function(e){var t=[];for(var n in e)T.has(e,n)&&t.push([n,e[n]]);return t},T.invert=function(e){var t={};for(var n in e)T.has(e,n)&&(t[e[n]]=n);return t},T.functions=T.methods=function(e){var t=[];for(var n in e)T.isFunction(e[n])&&t.push(n);return t.sort()},T.extend=function(e){return N(u.call(arguments,1),function(t){for(var n in t)e[n]=t[n]}),e},T.pick=function(e){var t={},n=a.apply(r,u.call(arguments,1));return N(n,function(n){n in e&&(t[n]=e[n])}),t},T.omit=function(e){var t={},n=a.apply(r,u.call(arguments,1));for(var i in e)T.contains(n,i)||(t[i]=e[i]);return t},T.defaults=function(e){return N(u.call(arguments,1),function(t){for(var n in t)e[n]==null&&(e[n]=t[n])}),e},T.clone=function(e){return T.isObject(e)?T.isArray(e)?e.slice():T.extend({},e):e},T.tap=function(e,t){return t(e),e};var M=function(e,t,n,r){if(e===t)return e!==0||1/e==1/t;if(e==null||t==null)return e===t;e instanceof T&&(e=e._wrapped),t instanceof T&&(t=t._wrapped);var i=l.call(e);if(i!=l.call(t))return!1;switch(i){case"[object String]":return e==String(t);case"[object Number]":return e!=+e?t!=+t:e==0?1/e==1/t:e==+t;case"[object Date]":case"[object Boolean]":return+e==+t;case"[object RegExp]":return e.source==t.source&&e.global==t.global&&e.multiline==t.multiline&&e.ignoreCase==t.ignoreCase}if(typeof e!="object"||typeof t!="object")return!1;var s=n.length;while(s--)if(n[s]==e)return r[s]==t;n.push(e),r.push(t);var o=0,u=!0;if(i=="[object Array]"){o=e.length,u=o==t.length;if(u)while(o--)if(!(u=M(e[o],t[o],n,r)))break}else{var a=e.constructor,f=t.constructor;if(a!==f&&!(T.isFunction(a)&&a instanceof a&&T.isFunction(f)&&f instanceof f))return!1;for(var c in e)if(T.has(e,c)){o++;if(!(u=T.has(t,c)&&M(e[c],t[c],n,r)))break}if(u){for(c in t)if(T.has(t,c)&&!(o--))break;u=!o}}return n.pop(),r.pop(),u};T.isEqual=function(e,t){return M(e,t,[],[])},T.isEmpty=function(e){if(e==null)return!0;if(T.isArray(e)||T.isString(e))return e.length===0;for(var t in e)if(T.has(e,t))return!1;return!0},T.isElement=function(e){return!!e&&e.nodeType===1},T.isArray=E||function(e){return l.call(e)=="[object Array]"},T.isObject=function(e){return e===Object(e)},N(["Arguments","Function","String","Number","Date","RegExp"],function(e){T["is"+e]=function(t){return l.call(t)=="[object "+e+"]"}}),T.isArguments(arguments)||(T.isArguments=function(e){return!!e&&!!T.has(e,"callee")}),typeof /./!="function"&&(T.isFunction=function(e){return typeof e=="function"}),T.isFinite=function(e){return T.isNumber(e)&&isFinite(e)},T.isNaN=function(e){return T.isNumber(e)&&e!=+e},T.isBoolean=function(e){return e===!0||e===!1||l.call(e)=="[object Boolean]"},T.isNull=function(e){return e===null},T.isUndefined=function(e){return e===void 0},T.has=function(e,t){return c.call(e,t)},T.noConflict=function(){return e._=t,this},T.identity=function(e){return e},T.times=function(e,t,n){for(var r=0;r<e;r++)t.call(n,r)},T.random=function(e,t){return t==null&&(t=e,e=0),e+(0|Math.random()*(t-e+1))};var _={escape:{"&":"&","<":"<",">":">",'"':""","'":"'","/":"/"}};_.unescape=T.invert(_.escape);var D={escape:new RegExp("["+T.keys(_.escape).join("")+"]","g"),unescape:new RegExp("("+T.keys(_.unescape).join("|")+")","g")};T.each(["escape","unescape"],function(e){T[e]=function(t){return t==null?"":(""+t).replace(D[e],function(t){return _[e][t]})}}),T.result=function(e,t){if(e==null)return null;var n=e[t];return T.isFunction(n)?n.call(e):n},T.mixin=function(e){N(T.functions(e),function(t){var n=T[t]=e[t];T.prototype[t]=function(){var e=[this._wrapped];return o.apply(e,arguments),F.call(this,n.apply(T,e))}})};var P=0;T.uniqueId=function(e){var t=P++;return e?e+t:t},T.templateSettings={evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,escape:/<%-([\s\S]+?)%>/g};var H=/(.)^/,B={"'":"'","\\":"\\","\r":"r","\n":"n"," ":"t","\u2028":"u2028","\u2029":"u2029"},j=/\\|'|\r|\n|\t|\u2028|\u2029/g;T.template=function(e,t,n){n=T.defaults({},n,T.templateSettings);var r=new RegExp([(n.escape||H).source,(n.interpolate||H).source,(n.evaluate||H).source].join("|")+"|$","g"),i=0,s="__p+='";e.replace(r,function(t,n,r,o,u){s+=e.slice(i,u).replace(j,function(e){return"\\"+B[e]}),s+=n?"'+\n((__t=("+n+"))==null?'':_.escape(__t))+\n'":r?"'+\n((__t=("+r+"))==null?'':__t)+\n'":o?"';\n"+o+"\n__p+='":"",i=u+t.length}),s+="';\n",n.variable||(s="with(obj||{}){\n"+s+"}\n"),s="var __t,__p='',__j=Array.prototype.join,print=function(){__p+=__j.call(arguments,'');};\n"+s+"return __p;\n";try{var o=new Function(n.variable||"obj","_",s)}catch(u){throw u.source=s,u}if(t)return o(t,T);var a=function(e){return o.call(this,e,T)};return a.source="function("+(n.variable||"obj")+"){\n"+s+"}",a},T.chain=function(e){return T(e).chain()};var F=function(e){return this._chain?T(e).chain():e};T.mixin(T),N(["pop","push","reverse","shift","sort","splice","unshift"],function(e){var t=r[e];T.prototype[e]=function(){var n=this._wrapped;return t.apply(n,arguments),(e=="shift"||e=="splice")&&n.length===0&&delete n[0],F.call(this,n)}}),N(["concat","join","slice"],function(e){var t=r[e];T.prototype[e]=function(){return F.call(this,t.apply(this._wrapped,arguments))}}),T.extend(T.prototype,{chain:function(){return this._chain=!0,this},value:function(){return this._wrapped}})}).call(this); |
@@ -1,8 +0,5 @@ | ||
| // Underscore.js 1.3.3 | ||
| // Underscore.js 1.4.0 | ||
| // http://underscorejs.org | ||
| // (c) 2009-2012 Jeremy Ashkenas, DocumentCloud Inc. | ||
| // Underscore is freely distributable under the MIT license. | ||
| // Portions of Underscore are inspired or borrowed from Prototype, | ||
| // Oliver Steele's Functional, and John Resig's Micro-Templating. | ||
| // For all details and documentation: | ||
| // http://documentcloud.github.com/underscore | ||
| // Underscore may be freely distributed under the MIT license. | ||
@@ -27,3 +24,5 @@ (function() { | ||
| // Create quick reference variables for speed access to core prototypes. | ||
| var slice = ArrayProto.slice, | ||
| var push = ArrayProto.push, | ||
| slice = ArrayProto.slice, | ||
| concat = ArrayProto.concat, | ||
| unshift = ArrayProto.unshift, | ||
@@ -50,3 +49,7 @@ toString = ObjProto.toString, | ||
| // Create a safe reference to the Underscore object for use below. | ||
| var _ = function(obj) { return new wrapper(obj); }; | ||
| var _ = function(obj) { | ||
| if (obj instanceof _) return obj; | ||
| if (!(this instanceof _)) return new _(obj); | ||
| this._wrapped = obj; | ||
| }; | ||
@@ -67,3 +70,3 @@ // Export the Underscore object for **Node.js**, with | ||
| // Current version. | ||
| _.VERSION = '1.3.3'; | ||
| _.VERSION = '1.4.0'; | ||
@@ -77,3 +80,2 @@ // Collection Functions | ||
| var each = _.each = _.forEach = function(obj, iterator, context) { | ||
| if (obj == null) return; | ||
| if (nativeForEach && obj.forEach === nativeForEach) { | ||
@@ -83,3 +85,3 @@ obj.forEach(iterator, context); | ||
| for (var i = 0, l = obj.length; i < l; i++) { | ||
| if (i in obj && iterator.call(context, obj[i], i, obj) === breaker) return; | ||
| if (iterator.call(context, obj[i], i, obj) === breaker) return; | ||
| } | ||
@@ -99,3 +101,2 @@ } else { | ||
| var results = []; | ||
| if (obj == null) return results; | ||
| if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context); | ||
@@ -105,3 +106,2 @@ each(obj, function(value, index, list) { | ||
| }); | ||
| if (obj.length === +obj.length) results.length = obj.length; | ||
| return results; | ||
@@ -114,3 +114,2 @@ }; | ||
| var initial = arguments.length > 2; | ||
| if (obj == null) obj = []; | ||
| if (nativeReduce && obj.reduce === nativeReduce) { | ||
@@ -136,10 +135,22 @@ if (context) iterator = _.bind(iterator, context); | ||
| var initial = arguments.length > 2; | ||
| if (obj == null) obj = []; | ||
| if (nativeReduceRight && obj.reduceRight === nativeReduceRight) { | ||
| if (context) iterator = _.bind(iterator, context); | ||
| return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); | ||
| return arguments.length > 2 ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); | ||
| } | ||
| var reversed = _.toArray(obj).reverse(); | ||
| if (context && !initial) iterator = _.bind(iterator, context); | ||
| return initial ? _.reduce(reversed, iterator, memo, context) : _.reduce(reversed, iterator); | ||
| var length = obj.length; | ||
| if (length !== +length) { | ||
| var keys = _.keys(obj); | ||
| length = keys.length; | ||
| } | ||
| each(obj, function(value, index, list) { | ||
| index = keys ? keys[--length] : --length; | ||
| if (!initial) { | ||
| memo = obj[index]; | ||
| initial = true; | ||
| } else { | ||
| memo = iterator.call(context, memo, obj[index], index, list); | ||
| } | ||
| }); | ||
| if (!initial) throw new TypeError('Reduce of empty array with no initial value'); | ||
| return memo; | ||
| }; | ||
@@ -164,3 +175,2 @@ | ||
| var results = []; | ||
| if (obj == null) return results; | ||
| if (nativeFilter && obj.filter === nativeFilter) return obj.filter(iterator, context); | ||
@@ -176,3 +186,2 @@ each(obj, function(value, index, list) { | ||
| var results = []; | ||
| if (obj == null) return results; | ||
| each(obj, function(value, index, list) { | ||
@@ -188,4 +197,4 @@ if (!iterator.call(context, value, index, list)) results[results.length] = value; | ||
| _.every = _.all = function(obj, iterator, context) { | ||
| iterator || (iterator = _.identity); | ||
| var result = true; | ||
| if (obj == null) return result; | ||
| if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context); | ||
@@ -204,3 +213,2 @@ each(obj, function(value, index, list) { | ||
| var result = false; | ||
| if (obj == null) return result; | ||
| if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context); | ||
@@ -213,7 +221,6 @@ each(obj, function(value, index, list) { | ||
| // Determine if a given value is included in the array or object using `===`. | ||
| // Aliased as `contains`. | ||
| _.include = _.contains = function(obj, target) { | ||
| // Determine if the array or object contains a given value (using `===`). | ||
| // Aliased as `include`. | ||
| _.contains = _.include = function(obj, target) { | ||
| var found = false; | ||
| if (obj == null) return found; | ||
| if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1; | ||
@@ -230,3 +237,3 @@ found = any(obj, function(value) { | ||
| return _.map(obj, function(value) { | ||
| return (_.isFunction(method) ? method || value : value[method]).apply(value, args); | ||
| return (_.isFunction(method) ? method : value[method]).apply(value, args); | ||
| }); | ||
@@ -240,5 +247,21 @@ }; | ||
| // Convenience version of a common use case of `filter`: selecting only objects | ||
| // with specific `key:value` pairs. | ||
| _.where = function(obj, attrs) { | ||
| if (_.isEmpty(attrs)) return []; | ||
| return _.filter(obj, function(value) { | ||
| for (var key in attrs) { | ||
| if (attrs[key] !== value[key]) return false; | ||
| } | ||
| return true; | ||
| }); | ||
| }; | ||
| // Return the maximum element or (element-based computation). | ||
| // Can't optimize arrays of integers longer than 65,535 elements. | ||
| // See: https://bugs.webkit.org/show_bug.cgi?id=80797 | ||
| _.max = function(obj, iterator, context) { | ||
| if (!iterator && _.isArray(obj) && obj[0] === +obj[0]) return Math.max.apply(Math, obj); | ||
| if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) { | ||
| return Math.max.apply(Math, obj); | ||
| } | ||
| if (!iterator && _.isEmpty(obj)) return -Infinity; | ||
@@ -255,3 +278,5 @@ var result = {computed : -Infinity}; | ||
| _.min = function(obj, iterator, context) { | ||
| if (!iterator && _.isArray(obj) && obj[0] === +obj[0]) return Math.min.apply(Math, obj); | ||
| if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) { | ||
| return Math.min.apply(Math, obj); | ||
| } | ||
| if (!iterator && _.isEmpty(obj)) return Infinity; | ||
@@ -268,6 +293,8 @@ var result = {computed : Infinity}; | ||
| _.shuffle = function(obj) { | ||
| var shuffled = [], rand; | ||
| each(obj, function(value, index, list) { | ||
| rand = Math.floor(Math.random() * (index + 1)); | ||
| shuffled[index] = shuffled[rand]; | ||
| var rand; | ||
| var index = 0; | ||
| var shuffled = []; | ||
| each(obj, function(value) { | ||
| rand = _.random(index++); | ||
| shuffled[index - 1] = shuffled[rand]; | ||
| shuffled[rand] = value; | ||
@@ -278,26 +305,34 @@ }); | ||
| // An internal function to generate lookup iterators. | ||
| var lookupIterator = function(value) { | ||
| return _.isFunction(value) ? value : function(obj){ return obj[value]; }; | ||
| }; | ||
| // Sort the object's values by a criterion produced by an iterator. | ||
| _.sortBy = function(obj, val, context) { | ||
| var iterator = _.isFunction(val) ? val : function(obj) { return obj[val]; }; | ||
| _.sortBy = function(obj, value, context) { | ||
| var iterator = lookupIterator(value); | ||
| return _.pluck(_.map(obj, function(value, index, list) { | ||
| return { | ||
| value : value, | ||
| index : index, | ||
| criteria : iterator.call(context, value, index, list) | ||
| }; | ||
| }).sort(function(left, right) { | ||
| var a = left.criteria, b = right.criteria; | ||
| if (a === void 0) return 1; | ||
| if (b === void 0) return -1; | ||
| return a < b ? -1 : a > b ? 1 : 0; | ||
| var a = left.criteria; | ||
| var b = right.criteria; | ||
| if (a !== b) { | ||
| if (a > b || a === void 0) return 1; | ||
| if (a < b || b === void 0) return -1; | ||
| } | ||
| return left.index < right.index ? -1 : 1; | ||
| }), 'value'); | ||
| }; | ||
| // Groups the object's values by a criterion. Pass either a string attribute | ||
| // to group by, or a function that returns the criterion. | ||
| _.groupBy = function(obj, val) { | ||
| // An internal function used for aggregate "group by" operations. | ||
| var group = function(obj, value, context, behavior) { | ||
| var result = {}; | ||
| var iterator = _.isFunction(val) ? val : function(obj) { return obj[val]; }; | ||
| var iterator = lookupIterator(value); | ||
| each(obj, function(value, index) { | ||
| var key = iterator(value, index); | ||
| (result[key] || (result[key] = [])).push(value); | ||
| var key = iterator.call(context, value, index, obj); | ||
| behavior(result, key, value); | ||
| }); | ||
@@ -307,10 +342,29 @@ return result; | ||
| // Use a comparator function to figure out at what index an object should | ||
| // be inserted so as to maintain order. Uses binary search. | ||
| _.sortedIndex = function(array, obj, iterator) { | ||
| iterator || (iterator = _.identity); | ||
| // Groups the object's values by a criterion. Pass either a string attribute | ||
| // to group by, or a function that returns the criterion. | ||
| _.groupBy = function(obj, value, context) { | ||
| return group(obj, value, context, function(result, key, value) { | ||
| (_.has(result, key) ? result[key] : (result[key] = [])).push(value); | ||
| }); | ||
| }; | ||
| // Counts instances of an object that group by a certain criterion. Pass | ||
| // either a string attribute to count by, or a function that returns the | ||
| // criterion. | ||
| _.countBy = function(obj, value, context) { | ||
| return group(obj, value, context, function(result, key, value) { | ||
| if (!_.has(result, key)) result[key] = 0; | ||
| result[key]++; | ||
| }); | ||
| }; | ||
| // Use a comparator function to figure out the smallest index at which | ||
| // an object should be inserted so as to maintain order. Uses binary search. | ||
| _.sortedIndex = function(array, obj, iterator, context) { | ||
| iterator = iterator == null ? _.identity : lookupIterator(iterator); | ||
| var value = iterator.call(context, obj); | ||
| var low = 0, high = array.length; | ||
| while (low < high) { | ||
| var mid = (low + high) >> 1; | ||
| iterator(array[mid]) < iterator(obj) ? low = mid + 1 : high = mid; | ||
| var mid = (low + high) >>> 1; | ||
| iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid; | ||
| } | ||
@@ -322,6 +376,4 @@ return low; | ||
| _.toArray = function(obj) { | ||
| if (!obj) return []; | ||
| if (_.isArray(obj)) return slice.call(obj); | ||
| if (_.isArguments(obj)) return slice.call(obj); | ||
| if (obj.toArray && _.isFunction(obj.toArray)) return obj.toArray(); | ||
| if (!obj) return []; | ||
| if (obj.length === +obj.length) return slice.call(obj); | ||
| return _.values(obj); | ||
@@ -332,3 +384,3 @@ }; | ||
| _.size = function(obj) { | ||
| return _.isArray(obj) ? obj.length : _.keys(obj).length; | ||
| return (obj.length === +obj.length) ? obj.length : _.keys(obj).length; | ||
| }; | ||
@@ -346,3 +398,3 @@ | ||
| // Returns everything but the last entry of the array. Especcialy useful on | ||
| // Returns everything but the last entry of the array. Especially useful on | ||
| // the arguments object. Passing **n** will return all the values in | ||
@@ -365,8 +417,8 @@ // the array, excluding the last N. The **guard** check allows it to work with | ||
| // Returns everything but the first entry of the array. Aliased as `tail`. | ||
| // Especially useful on the arguments object. Passing an **index** will return | ||
| // the rest of the values in the array from that index onward. The **guard** | ||
| // Returns everything but the first entry of the array. Aliased as `tail` and `drop`. | ||
| // Especially useful on the arguments object. Passing an **n** will return | ||
| // the rest N values in the array. The **guard** | ||
| // check allows it to work with `_.map`. | ||
| _.rest = _.tail = function(array, index, guard) { | ||
| return slice.call(array, (index == null) || guard ? 1 : index); | ||
| _.rest = _.tail = _.drop = function(array, n, guard) { | ||
| return slice.call(array, (n == null) || guard ? 1 : n); | ||
| }; | ||
@@ -379,9 +431,17 @@ | ||
| // Internal implementation of a recursive `flatten` function. | ||
| var flatten = function(input, shallow, output) { | ||
| each(input, function(value) { | ||
| if (_.isArray(value)) { | ||
| shallow ? push.apply(output, value) : flatten(value, shallow, output); | ||
| } else { | ||
| output.push(value); | ||
| } | ||
| }); | ||
| return output; | ||
| }; | ||
| // Return a completely flattened version of an array. | ||
| _.flatten = function(array, shallow) { | ||
| return _.reduce(array, function(memo, value) { | ||
| if (_.isArray(value)) return memo.concat(shallow ? value : _.flatten(value)); | ||
| memo[memo.length] = value; | ||
| return memo; | ||
| }, []); | ||
| return flatten(array, shallow, []); | ||
| }; | ||
@@ -397,14 +457,12 @@ | ||
| // Aliased as `unique`. | ||
| _.uniq = _.unique = function(array, isSorted, iterator) { | ||
| var initial = iterator ? _.map(array, iterator) : array; | ||
| _.uniq = _.unique = function(array, isSorted, iterator, context) { | ||
| var initial = iterator ? _.map(array, iterator, context) : array; | ||
| var results = []; | ||
| // The `isSorted` flag is irrelevant if the array only contains two elements. | ||
| if (array.length < 3) isSorted = true; | ||
| _.reduce(initial, function (memo, value, index) { | ||
| if (isSorted ? _.last(memo) !== value || !memo.length : !_.include(memo, value)) { | ||
| memo.push(value); | ||
| var seen = []; | ||
| each(initial, function(value, index) { | ||
| if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) { | ||
| seen.push(value); | ||
| results.push(array[index]); | ||
| } | ||
| return memo; | ||
| }, []); | ||
| }); | ||
| return results; | ||
@@ -416,8 +474,8 @@ }; | ||
| _.union = function() { | ||
| return _.uniq(_.flatten(arguments, true)); | ||
| return _.uniq(concat.apply(ArrayProto, arguments)); | ||
| }; | ||
| // Produce an array that contains every item shared between all the | ||
| // passed-in arrays. (Aliased as "intersect" for back-compat.) | ||
| _.intersection = _.intersect = function(array) { | ||
| // passed-in arrays. | ||
| _.intersection = function(array) { | ||
| var rest = slice.call(arguments, 1); | ||
@@ -434,4 +492,4 @@ return _.filter(_.uniq(array), function(item) { | ||
| _.difference = function(array) { | ||
| var rest = _.flatten(slice.call(arguments, 1), true); | ||
| return _.filter(array, function(value){ return !_.include(rest, value); }); | ||
| var rest = concat.apply(ArrayProto, slice.call(arguments, 1)); | ||
| return _.filter(array, function(value){ return !_.contains(rest, value); }); | ||
| }; | ||
@@ -445,6 +503,23 @@ | ||
| var results = new Array(length); | ||
| for (var i = 0; i < length; i++) results[i] = _.pluck(args, "" + i); | ||
| for (var i = 0; i < length; i++) { | ||
| results[i] = _.pluck(args, "" + i); | ||
| } | ||
| return results; | ||
| }; | ||
| // Converts lists into objects. Pass either a single array of `[key, value]` | ||
| // pairs, or two parallel arrays of the same length -- one of keys, and one of | ||
| // the corresponding values. | ||
| _.object = function(list, values) { | ||
| var result = {}; | ||
| for (var i = 0, l = list.length; i < l; i++) { | ||
| if (values) { | ||
| result[list[i]] = values[i]; | ||
| } else { | ||
| result[list[i][0]] = list[i][1]; | ||
| } | ||
| } | ||
| return result; | ||
| }; | ||
| // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**), | ||
@@ -457,10 +532,13 @@ // we need this function. Return the position of the first occurrence of an | ||
| _.indexOf = function(array, item, isSorted) { | ||
| if (array == null) return -1; | ||
| var i, l; | ||
| var i = 0, l = array.length; | ||
| if (isSorted) { | ||
| i = _.sortedIndex(array, item); | ||
| return array[i] === item ? i : -1; | ||
| if (typeof isSorted == 'number') { | ||
| i = (isSorted < 0 ? Math.max(0, l + isSorted) : isSorted); | ||
| } else { | ||
| i = _.sortedIndex(array, item); | ||
| return array[i] === item ? i : -1; | ||
| } | ||
| } | ||
| if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item); | ||
| for (i = 0, l = array.length; i < l; i++) if (i in array && array[i] === item) return i; | ||
| if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted); | ||
| for (; i < l; i++) if (array[i] === item) return i; | ||
| return -1; | ||
@@ -470,7 +548,6 @@ }; | ||
| // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available. | ||
| _.lastIndexOf = function(array, item) { | ||
| if (array == null) return -1; | ||
| if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) return array.lastIndexOf(item); | ||
| var i = array.length; | ||
| while (i--) if (i in array && array[i] === item) return i; | ||
| _.lastIndexOf = function(array, item, fromIndex) { | ||
| if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) return array.lastIndexOf(item, fromIndex); | ||
| var i = (fromIndex != null ? fromIndex : array.length); | ||
| while (i--) if (array[i] === item) return i; | ||
| return -1; | ||
@@ -567,3 +644,5 @@ }; | ||
| timeout = null; | ||
| if (more) func.apply(context, args); | ||
| if (more) { | ||
| result = func.apply(context, args); | ||
| } | ||
| whenDone(); | ||
@@ -575,6 +654,6 @@ }; | ||
| } else { | ||
| throttling = true; | ||
| result = func.apply(context, args); | ||
| } | ||
| whenDone(); | ||
| throttling = true; | ||
| return result; | ||
@@ -589,3 +668,3 @@ }; | ||
| _.debounce = function(func, wait, immediate) { | ||
| var timeout; | ||
| var timeout, result; | ||
| return function() { | ||
@@ -595,7 +674,9 @@ var context = this, args = arguments; | ||
| timeout = null; | ||
| if (!immediate) func.apply(context, args); | ||
| if (!immediate) result = func.apply(context, args); | ||
| }; | ||
| if (immediate && !timeout) func.apply(context, args); | ||
| var callNow = immediate && !timeout; | ||
| clearTimeout(timeout); | ||
| timeout = setTimeout(later, wait); | ||
| if (callNow) result = func.apply(context, args); | ||
| return result; | ||
| }; | ||
@@ -611,3 +692,5 @@ }; | ||
| ran = true; | ||
| return memo = func.apply(this, arguments); | ||
| memo = func.apply(this, arguments); | ||
| func = null; | ||
| return memo; | ||
| }; | ||
@@ -621,3 +704,4 @@ }; | ||
| return function() { | ||
| var args = [func].concat(slice.call(arguments, 0)); | ||
| var args = [func]; | ||
| push.apply(args, arguments); | ||
| return wrapper.apply(this, args); | ||
@@ -644,3 +728,5 @@ }; | ||
| return function() { | ||
| if (--times < 1) { return func.apply(this, arguments); } | ||
| if (--times < 1) { | ||
| return func.apply(this, arguments); | ||
| } | ||
| }; | ||
@@ -663,5 +749,21 @@ }; | ||
| _.values = function(obj) { | ||
| return _.map(obj, _.identity); | ||
| var values = []; | ||
| for (var key in obj) if (_.has(obj, key)) values.push(obj[key]); | ||
| return values; | ||
| }; | ||
| // Convert an object into a list of `[key, value]` pairs. | ||
| _.pairs = function(obj) { | ||
| var pairs = []; | ||
| for (var key in obj) if (_.has(obj, key)) pairs.push([key, obj[key]]); | ||
| return pairs; | ||
| }; | ||
| // Invert the keys and values of an object. The values must be serializable. | ||
| _.invert = function(obj) { | ||
| var result = {}; | ||
| for (var key in obj) if (_.has(obj, key)) result[obj[key]] = key; | ||
| return result; | ||
| }; | ||
| // Return a sorted list of the function names available on the object. | ||
@@ -689,9 +791,20 @@ // Aliased as `methods` | ||
| _.pick = function(obj) { | ||
| var result = {}; | ||
| each(_.flatten(slice.call(arguments, 1)), function(key) { | ||
| if (key in obj) result[key] = obj[key]; | ||
| var copy = {}; | ||
| var keys = concat.apply(ArrayProto, slice.call(arguments, 1)); | ||
| each(keys, function(key) { | ||
| if (key in obj) copy[key] = obj[key]; | ||
| }); | ||
| return result; | ||
| return copy; | ||
| }; | ||
| // Return a copy of the object without the blacklisted properties. | ||
| _.omit = function(obj) { | ||
| var copy = {}; | ||
| var keys = concat.apply(ArrayProto, slice.call(arguments, 1)); | ||
| for (var key in obj) { | ||
| if (!_.contains(keys, key)) copy[key] = obj[key]; | ||
| } | ||
| return copy; | ||
| }; | ||
| // Fill in a given object with default properties. | ||
@@ -721,4 +834,4 @@ _.defaults = function(obj) { | ||
| // Internal recursive comparison function. | ||
| function eq(a, b, stack) { | ||
| // Internal recursive comparison function for `isEqual`. | ||
| var eq = function(a, b, aStack, bStack) { | ||
| // Identical objects are equal. `0 === -0`, but they aren't identical. | ||
@@ -730,7 +843,4 @@ // See the Harmony `egal` proposal: http://wiki.ecmascript.org/doku.php?id=harmony:egal. | ||
| // Unwrap any wrapped objects. | ||
| if (a._chain) a = a._wrapped; | ||
| if (b._chain) b = b._wrapped; | ||
| // Invoke a custom `isEqual` method if one is provided. | ||
| if (a.isEqual && _.isFunction(a.isEqual)) return a.isEqual(b); | ||
| if (b.isEqual && _.isFunction(b.isEqual)) return b.isEqual(a); | ||
| if (a instanceof _) a = a._wrapped; | ||
| if (b instanceof _) b = b._wrapped; | ||
| // Compare `[[Class]]` names. | ||
@@ -765,10 +875,11 @@ var className = toString.call(a); | ||
| // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`. | ||
| var length = stack.length; | ||
| var length = aStack.length; | ||
| while (length--) { | ||
| // Linear search. Performance is inversely proportional to the number of | ||
| // unique nested structures. | ||
| if (stack[length] == a) return true; | ||
| if (aStack[length] == a) return bStack[length] == b; | ||
| } | ||
| // Add the first object to the stack of traversed objects. | ||
| stack.push(a); | ||
| aStack.push(a); | ||
| bStack.push(b); | ||
| var size = 0, result = true; | ||
@@ -783,9 +894,13 @@ // Recursively compare objects and arrays. | ||
| while (size--) { | ||
| // Ensure commutative equality for sparse arrays. | ||
| if (!(result = size in a == size in b && eq(a[size], b[size], stack))) break; | ||
| if (!(result = eq(a[size], b[size], aStack, bStack))) break; | ||
| } | ||
| } | ||
| } else { | ||
| // Objects with different constructors are not equivalent. | ||
| if ('constructor' in a != 'constructor' in b || a.constructor != b.constructor) return false; | ||
| // Objects with different constructors are not equivalent, but `Object`s | ||
| // from different frames are. | ||
| var aCtor = a.constructor, bCtor = b.constructor; | ||
| if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) && | ||
| _.isFunction(bCtor) && (bCtor instanceof bCtor))) { | ||
| return false; | ||
| } | ||
| // Deep compare objects. | ||
@@ -797,3 +912,3 @@ for (var key in a) { | ||
| // Deep compare each member. | ||
| if (!(result = _.has(b, key) && eq(a[key], b[key], stack))) break; | ||
| if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break; | ||
| } | ||
@@ -810,9 +925,10 @@ } | ||
| // Remove the first object from the stack of traversed objects. | ||
| stack.pop(); | ||
| aStack.pop(); | ||
| bStack.pop(); | ||
| return result; | ||
| } | ||
| }; | ||
| // Perform a deep comparison to check if two objects are equal. | ||
| _.isEqual = function(a, b) { | ||
| return eq(a, b, []); | ||
| return eq(a, b, [], []); | ||
| }; | ||
@@ -831,3 +947,3 @@ | ||
| _.isElement = function(obj) { | ||
| return !!(obj && obj.nodeType == 1); | ||
| return !!(obj && obj.nodeType === 1); | ||
| }; | ||
@@ -846,6 +962,11 @@ | ||
| // Is a given variable an arguments object? | ||
| _.isArguments = function(obj) { | ||
| return toString.call(obj) == '[object Arguments]'; | ||
| }; | ||
| // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp. | ||
| each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) { | ||
| _['is' + name] = function(obj) { | ||
| return toString.call(obj) == '[object ' + name + ']'; | ||
| }; | ||
| }); | ||
| // Define a fallback version of the method in browsers (ahem, IE), where | ||
| // there isn't any inspectable "Arguments" type. | ||
| if (!_.isArguments(arguments)) { | ||
@@ -857,17 +978,9 @@ _.isArguments = function(obj) { | ||
| // Is a given value a function? | ||
| _.isFunction = function(obj) { | ||
| return toString.call(obj) == '[object Function]'; | ||
| }; | ||
| // Optimize `isFunction` if appropriate. | ||
| if (typeof (/./) !== 'function') { | ||
| _.isFunction = function(obj) { | ||
| return typeof obj === 'function'; | ||
| }; | ||
| } | ||
| // Is a given value a string? | ||
| _.isString = function(obj) { | ||
| return toString.call(obj) == '[object String]'; | ||
| }; | ||
| // Is a given value a number? | ||
| _.isNumber = function(obj) { | ||
| return toString.call(obj) == '[object Number]'; | ||
| }; | ||
| // Is a given object a finite number? | ||
@@ -878,6 +991,5 @@ _.isFinite = function(obj) { | ||
| // Is the given value `NaN`? | ||
| // Is the given value `NaN`? (NaN is the only number which does not equal itself). | ||
| _.isNaN = function(obj) { | ||
| // `NaN` is the only value for which `===` is not reflexive. | ||
| return obj !== obj; | ||
| return _.isNumber(obj) && obj != +obj; | ||
| }; | ||
@@ -890,12 +1002,2 @@ | ||
| // Is a given value a date? | ||
| _.isDate = function(obj) { | ||
| return toString.call(obj) == '[object Date]'; | ||
| }; | ||
| // Is the given value a regular expression? | ||
| _.isRegExp = function(obj) { | ||
| return toString.call(obj) == '[object RegExp]'; | ||
| }; | ||
| // Is a given value equal to null? | ||
@@ -911,3 +1013,4 @@ _.isNull = function(obj) { | ||
| // Has own property? | ||
| // Shortcut function for checking if an object has a given property directly | ||
| // on itself (in other words, not on a prototype). | ||
| _.has = function(obj, key) { | ||
@@ -933,11 +1036,44 @@ return hasOwnProperty.call(obj, key); | ||
| // Run a function **n** times. | ||
| _.times = function (n, iterator, context) { | ||
| _.times = function(n, iterator, context) { | ||
| for (var i = 0; i < n; i++) iterator.call(context, i); | ||
| }; | ||
| // Escape a string for HTML interpolation. | ||
| _.escape = function(string) { | ||
| return (''+string).replace(/&/g, '&').replace(/</g, '<').replace(/>/g, '>').replace(/"/g, '"').replace(/'/g, ''').replace(/\//g,'/'); | ||
| // Return a random integer between min and max (inclusive). | ||
| _.random = function(min, max) { | ||
| if (max == null) { | ||
| max = min; | ||
| min = 0; | ||
| } | ||
| return min + (0 | Math.random() * (max - min + 1)); | ||
| }; | ||
| // List of HTML entities for escaping. | ||
| var entityMap = { | ||
| escape: { | ||
| '&': '&', | ||
| '<': '<', | ||
| '>': '>', | ||
| '"': '"', | ||
| "'": ''', | ||
| '/': '/' | ||
| } | ||
| }; | ||
| entityMap.unescape = _.invert(entityMap.escape); | ||
| // Regexes containing the keys and values listed immediately above. | ||
| var entityRegexes = { | ||
| escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'), | ||
| unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g') | ||
| }; | ||
| // Functions for escaping and unescaping strings to/from HTML interpolation. | ||
| _.each(['escape', 'unescape'], function(method) { | ||
| _[method] = function(string) { | ||
| if (string == null) return ''; | ||
| return ('' + string).replace(entityRegexes[method], function(match) { | ||
| return entityMap[method][match]; | ||
| }); | ||
| }; | ||
| }); | ||
| // If the value of the named property is a function then invoke it; | ||
@@ -951,7 +1087,11 @@ // otherwise, return it. | ||
| // Add your own custom functions to the Underscore object, ensuring that | ||
| // they're correctly added to the OOP wrapper as well. | ||
| // Add your own custom functions to the Underscore object. | ||
| _.mixin = function(obj) { | ||
| each(_.functions(obj), function(name){ | ||
| addToWrapper(name, _[name] = obj[name]); | ||
| var func = _[name] = obj[name]; | ||
| _.prototype[name] = function() { | ||
| var args = [this._wrapped]; | ||
| push.apply(args, arguments); | ||
| return result.call(this, func.apply(_, args)); | ||
| }; | ||
| }); | ||
@@ -979,3 +1119,3 @@ }; | ||
| // guaranteed not to match. | ||
| var noMatch = /.^/; | ||
| var noMatch = /(.)^/; | ||
@@ -985,23 +1125,13 @@ // Certain characters need to be escaped so that they can be put into a | ||
| var escapes = { | ||
| '\\': '\\', | ||
| "'": "'", | ||
| 'r': '\r', | ||
| 'n': '\n', | ||
| 't': '\t', | ||
| 'u2028': '\u2028', | ||
| 'u2029': '\u2029' | ||
| "'": "'", | ||
| '\\': '\\', | ||
| '\r': 'r', | ||
| '\n': 'n', | ||
| '\t': 't', | ||
| '\u2028': 'u2028', | ||
| '\u2029': 'u2029' | ||
| }; | ||
| for (var p in escapes) escapes[escapes[p]] = p; | ||
| var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g; | ||
| var unescaper = /\\(\\|'|r|n|t|u2028|u2029)/g; | ||
| // Within an interpolation, evaluation, or escaping, remove HTML escaping | ||
| // that had been previously added. | ||
| var unescape = function(code) { | ||
| return code.replace(unescaper, function(match, escape) { | ||
| return escapes[escape]; | ||
| }); | ||
| }; | ||
| // JavaScript micro-templating, similar to John Resig's implementation. | ||
@@ -1011,29 +1141,39 @@ // Underscore templating handles arbitrary delimiters, preserves whitespace, | ||
| _.template = function(text, data, settings) { | ||
| settings = _.defaults(settings || {}, _.templateSettings); | ||
| settings = _.defaults({}, settings, _.templateSettings); | ||
| // Compile the template source, taking care to escape characters that | ||
| // cannot be included in a string literal and then unescape them in code | ||
| // blocks. | ||
| var source = "__p+='" + text | ||
| .replace(escaper, function(match) { | ||
| return '\\' + escapes[match]; | ||
| }) | ||
| .replace(settings.escape || noMatch, function(match, code) { | ||
| return "'+\n_.escape(" + unescape(code) + ")+\n'"; | ||
| }) | ||
| .replace(settings.interpolate || noMatch, function(match, code) { | ||
| return "'+\n(" + unescape(code) + ")+\n'"; | ||
| }) | ||
| .replace(settings.evaluate || noMatch, function(match, code) { | ||
| return "';\n" + unescape(code) + "\n;__p+='"; | ||
| }) + "';\n"; | ||
| // Combine delimiters into one regular expression via alternation. | ||
| var matcher = new RegExp([ | ||
| (settings.escape || noMatch).source, | ||
| (settings.interpolate || noMatch).source, | ||
| (settings.evaluate || noMatch).source | ||
| ].join('|') + '|$', 'g'); | ||
| // Compile the template source, escaping string literals appropriately. | ||
| var index = 0; | ||
| var source = "__p+='"; | ||
| text.replace(matcher, function(match, escape, interpolate, evaluate, offset) { | ||
| source += text.slice(index, offset) | ||
| .replace(escaper, function(match) { return '\\' + escapes[match]; }); | ||
| source += | ||
| escape ? "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'" : | ||
| interpolate ? "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'" : | ||
| evaluate ? "';\n" + evaluate + "\n__p+='" : ''; | ||
| index = offset + match.length; | ||
| }); | ||
| source += "';\n"; | ||
| // If a variable is not specified, place data values in local scope. | ||
| if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n'; | ||
| source = "var __p='';" + | ||
| "var print=function(){__p+=Array.prototype.join.call(arguments, '')};\n" + | ||
| source = "var __t,__p='',__j=Array.prototype.join," + | ||
| "print=function(){__p+=__j.call(arguments,'');};\n" + | ||
| source + "return __p;\n"; | ||
| var render = new Function(settings.variable || 'obj', '_', source); | ||
| try { | ||
| var render = new Function(settings.variable || 'obj', '_', source); | ||
| } catch (e) { | ||
| e.source = source; | ||
| throw e; | ||
| } | ||
| if (data) return render(data, _); | ||
@@ -1044,6 +1184,4 @@ var template = function(data) { | ||
| // Provide the compiled function source as a convenience for build time | ||
| // precompilation. | ||
| template.source = 'function(' + (settings.variable || 'obj') + '){\n' + | ||
| source + '}'; | ||
| // Provide the compiled function source as a convenience for precompilation. | ||
| template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}'; | ||
@@ -1058,27 +1196,13 @@ return template; | ||
| // The OOP Wrapper | ||
| // OOP | ||
| // --------------- | ||
| // If Underscore is called as a function, it returns a wrapped object that | ||
| // can be used OO-style. This wrapper holds altered versions of all the | ||
| // underscore functions. Wrapped objects may be chained. | ||
| var wrapper = function(obj) { this._wrapped = obj; }; | ||
| // Expose `wrapper.prototype` as `_.prototype` | ||
| _.prototype = wrapper.prototype; | ||
| // Helper function to continue chaining intermediate results. | ||
| var result = function(obj, chain) { | ||
| return chain ? _(obj).chain() : obj; | ||
| var result = function(obj) { | ||
| return this._chain ? _(obj).chain() : obj; | ||
| }; | ||
| // A method to easily add functions to the OOP wrapper. | ||
| var addToWrapper = function(name, func) { | ||
| wrapper.prototype[name] = function() { | ||
| var args = slice.call(arguments); | ||
| unshift.call(args, this._wrapped); | ||
| return result(func.apply(_, args), this._chain); | ||
| }; | ||
| }; | ||
| // Add all of the Underscore functions to the wrapper object. | ||
@@ -1090,8 +1214,7 @@ _.mixin(_); | ||
| var method = ArrayProto[name]; | ||
| wrapper.prototype[name] = function() { | ||
| var wrapped = this._wrapped; | ||
| method.apply(wrapped, arguments); | ||
| var length = wrapped.length; | ||
| if ((name == 'shift' || name == 'splice') && length === 0) delete wrapped[0]; | ||
| return result(wrapped, this._chain); | ||
| _.prototype[name] = function() { | ||
| var obj = this._wrapped; | ||
| method.apply(obj, arguments); | ||
| if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0]; | ||
| return result.call(this, obj); | ||
| }; | ||
@@ -1103,18 +1226,22 @@ }); | ||
| var method = ArrayProto[name]; | ||
| wrapper.prototype[name] = function() { | ||
| return result(method.apply(this._wrapped, arguments), this._chain); | ||
| _.prototype[name] = function() { | ||
| return result.call(this, method.apply(this._wrapped, arguments)); | ||
| }; | ||
| }); | ||
| // Start chaining a wrapped Underscore object. | ||
| wrapper.prototype.chain = function() { | ||
| this._chain = true; | ||
| return this; | ||
| }; | ||
| _.extend(_.prototype, { | ||
| // Extracts the result from a wrapped and chained object. | ||
| wrapper.prototype.value = function() { | ||
| return this._wrapped; | ||
| }; | ||
| // Start chaining a wrapped Underscore object. | ||
| chain: function() { | ||
| this._chain = true; | ||
| return this; | ||
| }, | ||
| // Extracts the result from a wrapped and chained object. | ||
| value: function() { | ||
| return this._wrapped; | ||
| } | ||
| }); | ||
| }).call(this); |
Sorry, the diff of this file is not supported yet
Fixed alerts
No website
QualityPackage does not have a website.
Found 1 instance in 1 package
Improved metrics
- Total package byte prevSize
- increased by3.71%
359444
- Number of package files
- increased by9.09%
12
- Lines of code
- increased by6.54%
1059
- Number of low quality alerts
- decreased by-50%
1
No dependency changes