Produced by Araxis Merge on 2/1/2017 2:58:00 PM Eastern Standard Time. See www.araxis.com for information about Merge. This report uses XHTML and CSS2, and is best viewed with a modern standards-compliant browser. For optimum results when printing this report, use landscape orientation and enable printing of background images and colours in your browser.
| # | Location | File | Last Modified |
|---|---|---|---|
| 1 | C:\Araxis_Merge_Comprasion\Pub_un\BTSSS_CIF_122016.zip\BTSSS_CIF_12_20_16\clean\CRM Portal\trunk\BTSSSPortal\js | underscore-min.js | Tue Dec 20 19:50:52 2016 UTC |
| 2 | Wed Feb 1 19:58:00 2017 UTC |
| Description | Between Files 1 and 2 |
|
|---|---|---|
| Text Blocks | Lines | |
| Unchanged | 0 | 0 |
| Changed | 0 | 0 |
| Inserted | 0 | 0 |
| Removed | 1 | 12 |
| Whitespace | |
|---|---|
| Character case | Differences in character case are significant |
| Line endings | Differences in line endings (CR and LF characters) are ignored |
| CR/LF characters | Not shown in the comparison detail |
No regular expressions were active.
| 1 | /* | |||||
| 2 | Underscore .js 1.8.2 | |||||
| 3 | Copyright (c) 2009-2 015 Jeremy Ashkenas, DocumentC loud and I nvestigati ve Reporte rs & Edito rs | |||||
| 4 | ||||||
| 5 | Permission is hereby granted, free of ch arge, to a ny person obtaining a copy of this softw are and as sociated d ocumentati on files ( the "Softw are"), to deal in th e Software without r estriction , includin g without limitation the right s to use, copy, modi fy, merge, publish, distribute , sublicen se, and/or sell copi es of the Software, and to per mit person s to whom the Softwa re is furn ished to d o so, subj ect to the following condition s: | |||||
| 6 | ||||||
| 7 | The above copyright notice and this perm ission not ice shall be include d in all c opies or s ubstantial portions of the Sof tware. | |||||
| 8 | ||||||
| 9 | THE SOFTWA RE IS PROV IDED "AS I S", WITHOU T WARRANTY OF ANY KI ND, EXPRES S OR IMPLI ED, INCLUD ING BUT NO T LIMITED TO THE WAR RANTIES OF MERCHANTA BILITY, FI TNESS FOR A PARTICUL AR PURPOSE AND NONIN FRINGEMENT . IN NO EV ENT SHALL THE AUTHOR S OR COPYR IGHT HOLDE RS BE LIAB LE FOR ANY CLAIM, DA MAGES OR O THER LIABI LITY, WHET HER IN AN ACTION OF CONTRACT, TORT OR OT HERWISE, A RISING FRO M, OUT OF OR IN CONN ECTION WIT H THE SOFT WARE OR TH E USE OR O THER DEALI NGS IN THE SOFTWARE. | |||||
| 10 | */ | |||||
| 11 | (function( ){function n(n){func tion t(t,r ,e,u,i,o){ for(;i>=0& &o>i;i+=n) {var a=u?u [i]:i;e=r( e,t[a],a,t )}return e }return fu nction(r,e ,u,i){e=d( e,i,4);var o=!w(r)&& m.keys(r), a=(o||r).l ength,c=n> 0?0:a-1;re turn argum ents.lengt h<3&&(u=r[ o?o[c]:c], c+=n),t(r, e,u,o,c,a) }}function t(n){retu rn functio n(t,r,e){r =b(r,e);fo r(var u=nu ll!=t&&t.l ength,i=n> 0?0:u-1;i> =0&&u>i;i+ =n)if(r(t[ i],i,t))re turn i;ret urn-1}}fun ction r(n, t){var r=S .length,e= n.construc tor,u=m.is Function(e )&&e.proto type||o,i= "construct or";for(m. has(n,i)&& !m.contain s(t,i)&&t. push(i);r- -;)i=S[r], i in n&&n[ i]!==u[i]& &!m.contai ns(t,i)&&t .push(i)}v ar e=this, u=e._,i=Ar ray.protot ype,o=Obje ct.prototy pe,a=Funct ion.protot ype,c=i.pu sh,l=i.sli ce,f=o.toS tring,s=o. hasOwnProp erty,p=Arr ay.isArray ,h=Object. keys,v=a.b ind,g=Obje ct.create, y=function (){},m=fun ction(n){r eturn n in stanceof m ?n:this in stanceof m ?void(this ._wrapped= n):new m(n )};"undefi ned"!=type of exports ?("undefin ed"!=typeo f module&& module.exp orts&&(exp orts=modul e.exports= m),exports ._=m):e._= m,m.VERSIO N="1.8.2"; var d=func tion(n,t,r ){if(t===v oid 0)retu rn n;switc h(null==r? 3:r){case 1:return f unction(r) {return n. call(t,r)} ;case 2:re turn funct ion(r,e){r eturn n.ca ll(t,r,e)} ;case 3:re turn funct ion(r,e,u) {return n. call(t,r,e ,u)};case 4:return f unction(r, e,u,i){ret urn n.call (t,r,e,u,i )}}return function() {return n. apply(t,ar guments)}} ,b=functio n(n,t,r){r eturn null ==n?m.iden tity:m.isF unction(n) ?d(n,t,r): m.isObject (n)?m.matc her(n):m.p roperty(n) };m.iterat ee=functio n(n,t){ret urn b(n,t, 1/0)};var x=function (n,t){retu rn functio n(r){var e =arguments .length;if (2>e||null ==r)return r;for(var u=1;e>u;u ++)for(var i=argumen ts[u],o=n( i),a=o.len gth,c=0;a> c;c++){var l=o[c];t& &r[l]!==vo id 0||(r[l ]=i[l])}re turn r}},_ =function( n){if(!m.i sObject(n) )return{}; if(g)retur n g(n);y.p rototype=n ;var t=new y;return y.prototyp e=null,t}, j=Math.pow (2,53)-1,w =function( n){var t=n &&n.length ;return"nu mber"==typ eof t&&t>= 0&&j>=t};m .each=m.fo rEach=func tion(n,t,r ){t=d(t,r) ;var e,u;i f(w(n))for (e=0,u=n.l ength;u>e; e++)t(n[e] ,e,n);else {var i=m.k eys(n);for (e=0,u=i.l ength;u>e; e++)t(n[i[ e]],i[e],n )}return n },m.map=m. collect=fu nction(n,t ,r){t=b(t, r);for(var e=!w(n)&& m.keys(n), u=(e||n).l ength,i=Ar ray(u),o=0 ;u>o;o++){ var a=e?e[ o]:o;i[o]= t(n[a],a,n )}return i },m.reduce =m.foldl=m .inject=n( 1),m.reduc eRight=m.f oldr=n(-1) ,m.find=m. detect=fun ction(n,t, r){var e;r eturn e=w( n)?m.findI ndex(n,t,r ):m.findKe y(n,t,r),e !==void 0& &e!==-1?n[ e]:void 0} ,m.filter= m.select=f unction(n, t,r){var e =[];return t=b(t,r), m.each(n,f unction(n, r,u){t(n,r ,u)&&e.pus h(n)}),e}, m.reject=f unction(n, t,r){retur n m.filter (n,m.negat e(b(t)),r) },m.every= m.all=func tion(n,t,r ){t=b(t,r) ;for(var e =!w(n)&&m. keys(n),u= (e||n).len gth,i=0;u> i;i++){var o=e?e[i]: i;if(!t(n[ o],o,n))re turn!1}ret urn!0},m.s ome=m.any= function(n ,t,r){t=b( t,r);for(v ar e=!w(n) &&m.keys(n ),u=(e||n) .length,i= 0;u>i;i++) {var o=e?e [i]:i;if(t (n[o],o,n) )return!0} return!1}, m.contains =m.include s=m.includ e=function (n,t,r){re turn w(n)| |(n=m.valu es(n)),m.i ndexOf(n,t ,"number"= =typeof r& &r)>=0},m. invoke=fun ction(n,t) {var r=l.c all(argume nts,2),e=m .isFunctio n(t);retur n m.map(n, function(n ){var u=e? t:n[t];ret urn null== u?u:u.appl y(n,r)})}, m.pluck=fu nction(n,t ){return m .map(n,m.p roperty(t) )},m.where =function( n,t){retur n m.filter (n,m.match er(t))},m. findWhere= function(n ,t){return m.find(n, m.matcher( t))},m.max =function( n,t,r){var e,u,i=-1/ 0,o=-1/0;i f(null==t& &null!=n){ n=w(n)?n:m .values(n) ;for(var a =0,c=n.len gth;c>a;a+ +)e=n[a],e >i&&(i=e)} else t=b(t ,r),m.each (n,functio n(n,r,e){u =t(n,r,e), (u>o||u=== -1/0&&i=== -1/0)&&(i= n,o=u)});r eturn i},m .min=funct ion(n,t,r) {var e,u,i =1/0,o=1/0 ;if(null== t&&null!=n ){n=w(n)?n :m.values( n);for(var a=0,c=n.l ength;c>a; a++)e=n[a] ,i>e&&(i=e )}else t=b (t,r),m.ea ch(n,funct ion(n,r,e) {u=t(n,r,e ),(o>u||1/ 0===u&&1/0 ===i)&&(i= n,o=u)});r eturn i},m .shuffle=f unction(n) {for(var t ,r=w(n)?n: m.values(n ),e=r.leng th,u=Array (e),i=0;e> i;i++)t=m. random(0,i ),t!==i&&( u[i]=u[t]) ,u[t]=r[i] ;return u} ,m.sample= function(n ,t,r){retu rn null==t ||r?(w(n)| |(n=m.valu es(n)),n[m .random(n. length-1)] ):m.shuffl e(n).slice (0,Math.ma x(0,t))},m .sortBy=fu nction(n,t ,r){return t=b(t,r), m.pluck(m. map(n,func tion(n,r,e ){return{v alue:n,ind ex:r,crite ria:t(n,r, e)}}).sort (function( n,t){var r =n.criteri a,e=t.crit eria;if(r! ==e){if(r> e||r===voi d 0)return 1;if(e>r| |e===void 0)return-1 }return n. index-t.in dex}),"val ue")};var A=function (n){return function( t,r,e){var u={};retu rn r=b(r,e ),m.each(t ,function( e,i){var o =r(e,i,t); n(u,e,o)}) ,u}};m.gro upBy=A(fun ction(n,t, r){m.has(n ,r)?n[r].p ush(t):n[r ]=[t]}),m. indexBy=A( function(n ,t,r){n[r] =t}),m.cou ntBy=A(fun ction(n,t, r){m.has(n ,r)?n[r]++ :n[r]=1}), m.toArray= function(n ){return n ?m.isArray (n)?l.call (n):w(n)?m .map(n,m.i dentity):m .values(n) :[]},m.siz e=function (n){return null==n?0 :w(n)?n.le ngth:m.key s(n).lengt h},m.parti tion=funct ion(n,t,r) {t=b(t,r); var e=[],u =[];return m.each(n, function(n ,r,i){(t(n ,r,i)?e:u) .push(n)}) ,[e,u]},m. first=m.he ad=m.take= function(n ,t,r){retu rn null==n ?void 0:nu ll==t||r?n [0]:m.init ial(n,n.le ngth-t)},m .initial=f unction(n, t,r){retur n l.call(n ,0,Math.ma x(0,n.leng th-(null== t||r?1:t)) )},m.last= function(n ,t,r){retu rn null==n ?void 0:nu ll==t||r?n [n.length- 1]:m.rest( n,Math.max (0,n.lengt h-t))},m.r est=m.tail =m.drop=fu nction(n,t ,r){return l.call(n, null==t||r ?1:t)},m.c ompact=fun ction(n){r eturn m.fi lter(n,m.i dentity)}; var k=func tion(n,t,r ,e){for(va r u=[],i=0 ,o=e||0,a= n&&n.lengt h;a>o;o++) {var c=n[o ];if(w(c)& &(m.isArra y(c)||m.is Arguments( c))){t||(c =k(c,t,r)) ;var l=0,f =c.length; for(u.leng th+=f;f>l; )u[i++]=c[ l++]}else r||(u[i++] =c)}return u};m.flat ten=functi on(n,t){re turn k(n,t ,!1)},m.wi thout=func tion(n){re turn m.dif ference(n, l.call(arg uments,1)) },m.uniq=m .unique=fu nction(n,t ,r,e){if(n ull==n)ret urn[];m.is Boolean(t) ||(e=r,r=t ,t=!1),nul l!=r&&(r=b (r,e));for (var u=[], i=[],o=0,a =n.length; a>o;o++){v ar c=n[o], l=r?r(c,o, n):c;t?(o& &i===l||u. push(c),i= l):r?m.con tains(i,l) ||(i.push( l),u.push( c)):m.cont ains(u,c)| |u.push(c) }return u} ,m.union=f unction(){ return m.u niq(k(argu ments,!0,! 0))},m.int ersection= function(n ){if(null= =n)return[ ];for(var t=[],r=arg uments.len gth,e=0,u= n.length;u >e;e++){va r i=n[e];i f(!m.conta ins(t,i)){ for(var o= 1;r>o&&m.c ontains(ar guments[o] ,i);o++);o ===r&&t.pu sh(i)}}ret urn t},m.d ifference= function(n ){var t=k( arguments, !0,!0,1);r eturn m.fi lter(n,fun ction(n){r eturn!m.co ntains(t,n )})},m.zip =function( ){return m .unzip(arg uments)},m .unzip=fun ction(n){f or(var t=n &&m.max(n, "length"). length||0, r=Array(t) ,e=0;t>e;e ++)r[e]=m. pluck(n,e) ;return r} ,m.object= function(n ,t){for(va r r={},e=0 ,u=n&&n.le ngth;u>e;e ++)t?r[n[e ]]=t[e]:r[ n[e][0]]=n [e][1];ret urn r},m.i ndexOf=fun ction(n,t, r){var e=0 ,u=n&&n.le ngth;if("n umber"==ty peof r)e=0 >r?Math.ma x(0,u+r):r ;else if(r &&u)return e=m.sorte dIndex(n,t ),n[e]===t ?e:-1;if(t !==t)retur n m.findIn dex(l.call (n,e),m.is NaN);for(; u>e;e++)if (n[e]===t) return e;r eturn-1},m .lastIndex Of=functio n(n,t,r){v ar e=n?n.l ength:0;if ("number"= =typeof r& &(e=0>r?e+ r+1:Math.m in(e,r+1)) ,t!==t)ret urn m.find LastIndex( l.call(n,0 ,e),m.isNa N);for(;-- e>=0;)if(n [e]===t)re turn e;ret urn-1},m.f indIndex=t (1),m.find LastIndex= t(-1),m.so rtedIndex= function(n ,t,r,e){r= b(r,e,1);f or(var u=r (t),i=0,o= n.length;o >i;){var a =Math.floo r((i+o)/2) ;r(n[a])<u ?i=a+1:o=a }return i} ,m.range=f unction(n, t,r){argum ents.lengt h<=1&&(t=n ||0,n=0),r =r||1;for( var e=Math .max(Math. ceil((t-n) /r),0),u=A rray(e),i= 0;e>i;i++, n+=r)u[i]= n;return u };var O=fu nction(n,t ,r,e,u){if (!(e insta nceof t))r eturn n.ap ply(r,u);v ar i=_(n.p rototype), o=n.apply( i,u);retur n m.isObje ct(o)?o:i} ;m.bind=fu nction(n,t ){if(v&&n. bind===v)r eturn v.ap ply(n,l.ca ll(argumen ts,1));if( !m.isFunct ion(n))thr ow new Typ eError("Bi nd must be called on a functio n");var r= l.call(arg uments,2), e=function (){return O(n,e,t,th is,r.conca t(l.call(a rguments)) )};return e},m.parti al=functio n(n){var t =l.call(ar guments,1) ,r=functio n(){for(va r e=0,u=t. length,i=A rray(u),o= 0;u>o;o++) i[o]=t[o]= ==m?argume nts[e++]:t [o];for(;e <arguments .length;)i .push(argu ments[e++] );return O (n,r,this, this,i)};r eturn r},m .bindAll=f unction(n) {var t,r,e =arguments .length;if (1>=e)thro w new Erro r("bindAll must be p assed func tion names ");for(t=1 ;e>t;t++)r =arguments [t],n[r]=m .bind(n[r] ,n);return n},m.memo ize=functi on(n,t){va r r=functi on(e){var u=r.cache, i=""+(t?t. apply(this ,arguments ):e);retur n m.has(u, i)||(u[i]= n.apply(th is,argumen ts)),u[i]} ;return r. cache={},r },m.delay= function(n ,t){var r= l.call(arg uments,2); return set Timeout(fu nction(){r eturn n.ap ply(null,r )},t)},m.d efer=m.par tial(m.del ay,m,1),m. throttle=f unction(n, t,r){var e ,u,i,o=nul l,a=0;r||( r={});var c=function (){a=r.lea ding===!1? 0:m.now(), o=null,i=n .apply(e,u ),o||(e=u= null)};ret urn functi on(){var l =m.now();a ||r.leadin g!==!1||(a =l);var f= t-(l-a);re turn e=thi s,u=argume nts,0>=f|| f>t?(o&&(c learTimeou t(o),o=nul l),a=l,i=n .apply(e,u ),o||(e=u= null)):o|| r.trailing ===!1||(o= setTimeout (c,f)),i}} ,m.debounc e=function (n,t,r){va r e,u,i,o, a,c=functi on(){var l =m.now()-o ;t>l&&l>=0 ?e=setTime out(c,t-l) :(e=null,r ||(a=n.app ly(i,u),e| |(i=u=null )))};retur n function (){i=this, u=argument s,o=m.now( );var l=r& &!e;return e||(e=set Timeout(c, t)),l&&(a= n.apply(i, u),i=u=nul l),a}},m.w rap=functi on(n,t){re turn m.par tial(t,n)} ,m.negate= function(n ){return f unction(){ return!n.a pply(this, arguments) }},m.compo se=functio n(){var n= arguments, t=n.length -1;return function() {for(var r =t,e=n[t]. apply(this ,arguments );r--;)e=n [r].call(t his,e);ret urn e}},m. after=func tion(n,t){ return fun ction(){re turn--n<1? t.apply(th is,argumen ts):void 0 }},m.befor e=function (n,t){var r;return f unction(){ return--n> 0&&(r=t.ap ply(this,a rguments)) ,1>=n&&(t= null),r}}, m.once=m.p artial(m.b efore,2);v ar F=!{toS tring:null }.property IsEnumerab le("toStri ng"),S=["v alueOf","i sPrototype Of","toStr ing","prop ertyIsEnum erable","h asOwnPrope rty","toLo caleString "];m.keys= function(n ){if(!m.is Object(n)) return[];i f(h)return h(n);var t=[];for(v ar e in n) m.has(n,e) &&t.push(e );return F &&r(n,t),t },m.allKey s=function (n){if(!m. isObject(n ))return[] ;var t=[]; for(var e in n)t.pus h(e);retur n F&&r(n,t ),t},m.val ues=functi on(n){for( var t=m.ke ys(n),r=t. length,e=A rray(r),u= 0;r>u;u++) e[u]=n[t[u ]];return e},m.mapOb ject=funct ion(n,t,r) {t=b(t,r); for(var e, u=m.keys(n ),i=u.leng th,o={},a= 0;i>a;a++) e=u[a],o[e ]=t(n[e],e ,n);return o},m.pair s=function (n){for(va r t=m.keys (n),r=t.le ngth,e=Arr ay(r),u=0; r>u;u++)e[ u]=[t[u],n [t[u]]];re turn e},m. invert=fun ction(n){f or(var t={ },r=m.keys (n),e=0,u= r.length;u >e;e++)t[n [r[e]]]=r[ e];return t},m.funct ions=m.met hods=funct ion(n){var t=[];for( var r in n )m.isFunct ion(n[r])& &t.push(r) ;return t. sort()},m. extend=x(m .allKeys), m.extendOw n=m.assign =x(m.keys) ,m.findKey =function( n,t,r){t=b (t,r);for( var e,u=m. keys(n),i= 0,o=u.leng th;o>i;i++ )if(e=u[i] ,t(n[e],e, n))return e},m.pick= function(n ,t,r){var e,u,i={},o =n;if(null ==o)return i;m.isFun ction(t)?( u=m.allKey s(o),e=d(t ,r)):(u=k( arguments, !1,!1,1),e =function( n,t,r){ret urn t in r },o=Object (o));for(v ar a=0,c=u .length;c> a;a++){var l=u[a],f= o[l];e(f,l ,o)&&(i[l] =f)}return i},m.omit =function( n,t,r){if( m.isFuncti on(t))t=m. negate(t); else{var e =m.map(k(a rguments,! 1,!1,1),St ring);t=fu nction(n,t ){return!m .contains( e,t)}}retu rn m.pick( n,t,r)},m. defaults=x (m.allKeys ,!0),m.clo ne=functio n(n){retur n m.isObje ct(n)?m.is Array(n)?n .slice():m .extend({} ,n):n},m.t ap=functio n(n,t){ret urn t(n),n },m.isMatc h=function (n,t){var r=m.keys(t ),e=r.leng th;if(null ==n)return !e;for(var u=Object( n),i=0;e>i ;i++){var o=r[i];if( t[o]!==u[o ]||!(o in u))return! 1}return!0 };var E=fu nction(n,t ,r,e){if(n ===t)retur n 0!==n||1 /n===1/t;i f(null==n| |null==t)r eturn n=== t;n instan ceof m&&(n =n._wrappe d),t insta nceof m&&( t=t._wrapp ed);var u= f.call(n); if(u!==f.c all(t))ret urn!1;swit ch(u){case "[object R egExp]":ca se"[object String]": return""+n ==""+t;cas e"[object Number]":r eturn+n!== +n?+t!==+t :0===+n?1/ +n===1/t:+ n===+t;cas e"[object Date]":cas e"[object Boolean]": return+n== =+t}var i= "[object A rray]"===u ;if(!i){if ("object"! =typeof n| |"object"! =typeof t) return!1;v ar o=n.con structor,a =t.constru ctor;if(o! ==a&&!(m.i sFunction( o)&&o inst anceof o&& m.isFuncti on(a)&&a i nstanceof a)&&"const ructor"in n&&"constr uctor"in t )return!1} r=r||[],e= e||[];for( var c=r.le ngth;c--;) if(r[c]=== n)return e [c]===t;if (r.push(n) ,e.push(t) ,i){if(c=n .length,c! ==t.length )return!1; for(;c--;) if(!E(n[c] ,t[c],r,e) )return!1} else{var l ,s=m.keys( n);if(c=s. length,m.k eys(t).len gth!==c)re turn!1;for (;c--;)if( l=s[c],!m. has(t,l)|| !E(n[l],t[ l],r,e))re turn!1}ret urn r.pop( ),e.pop(), !0};m.isEq ual=functi on(n,t){re turn E(n,t )},m.isEmp ty=functio n(n){retur n null==n? !0:w(n)&&( m.isArray( n)||m.isSt ring(n)||m .isArgumen ts(n))?0== =n.length: 0===m.keys (n).length },m.isElem ent=functi on(n){retu rn!(!n||1! ==n.nodeTy pe)},m.isA rray=p||fu nction(n){ return"[ob ject Array ]"===f.cal l(n)},m.is Object=fun ction(n){v ar t=typeo f n;return "function" ===t||"obj ect"===t&& !!n},m.eac h(["Argume nts","Func tion","Str ing","Numb er","Date" ,"RegExp", "Error"],f unction(n) {m["is"+n] =function( t){return f.call(t)= =="[object "+n+"]"}} ),m.isArgu ments(argu ments)||(m .isArgumen ts=functio n(n){retur n m.has(n, "callee")} ),"functio n"!=typeof /./&&"obje ct"!=typeo f Int8Arra y&&(m.isFu nction=fun ction(n){r eturn"func tion"==typ eof n||!1} ),m.isFini te=functio n(n){retur n isFinite (n)&&!isNa N(parseFlo at(n))},m. isNaN=func tion(n){re turn m.isN umber(n)&& n!==+n},m. isBoolean= function(n ){return n ===!0||n== =!1||"[obj ect Boolea n]"===f.ca ll(n)},m.i sNull=func tion(n){re turn null= ==n},m.isU ndefined=f unction(n) {return n= ==void 0}, m.has=func tion(n,t){ return nul l!=n&&s.ca ll(n,t)},m .noConflic t=function (){return e._=u,this },m.identi ty=functio n(n){retur n n},m.con stant=func tion(n){re turn funct ion(){retu rn n}},m.n oop=functi on(){},m.p roperty=fu nction(n){ return fun ction(t){r eturn null ==t?void 0 :t[n]}},m. propertyOf =function( n){return null==n?fu nction(){} :function( t){return n[t]}},m.m atcher=m.m atches=fun ction(n){r eturn n=m. extendOwn( {},n),func tion(t){re turn m.isM atch(t,n)} },m.times= function(n ,t,r){var e=Array(Ma th.max(0,n ));t=d(t,r ,1);for(va r u=0;n>u; u++)e[u]=t (u);return e},m.rand om=functio n(n,t){ret urn null== t&&(t=n,n= 0),n+Math. floor(Math .random()* (t-n+1))}, m.now=Date .now||func tion(){ret urn(new Da te).getTim e()};var M ={"&":"&am p;","<":"& lt;",">":" >",'"': """," '":"' ","`":"&#x 60;"},N=m. invert(M), I=function (n){var t= function(t ){return n [t]},r="(? :"+m.keys( n).join("| ")+")",e=R egExp(r),u =RegExp(r, "g");retur n function (n){return n=null==n ?"":""+n,e .test(n)?n .replace(u ,t):n}};m. escape=I(M ),m.unesca pe=I(N),m. result=fun ction(n,t, r){var e=n ull==n?voi d 0:n[t];r eturn e=== void 0&&(e =r),m.isFu nction(e)? e.call(n): e};var B=0 ;m.uniqueI d=function (n){var t= ++B+"";ret urn n?n+t: t},m.templ ateSetting s={evaluat e:/<%([\s\ S]+?)%>/g, interpolat e:/<%=([\s \S]+?)%>/g ,escape:/< %-([\s\S]+ ?)%>/g};va r T=/(.)^/ ,R={"'":"' ","\\":"\\ ","\r":"r" ,"\n":"n", "\u2028":" u2028","\u 2029":"u20 29"},q=/\\ |'|\r|\n|\ u2028|\u20 29/g,K=fun ction(n){r eturn"\\"+ R[n]};m.te mplate=fun ction(n,t, r){!t&&r&& (t=r),t=m. defaults({ },t,m.temp lateSettin gs);var e= RegExp([(t .escape||T ).source,( t.interpol ate||T).so urce,(t.ev aluate||T) .source].j oin("|")+" |$","g"),u =0,i="__p+ ='";n.repl ace(e,func tion(t,r,e ,o,a){retu rn i+=n.sl ice(u,a).r eplace(q,K ),u=a+t.le ngth,r?i+= "'+\n((__t =("+r+"))= =null?'':_ .escape(__ t))+\n'":e ?i+="'+\n( (__t=("+e+ "))==null? '':__t)+\n '":o&&(i+= "';\n"+o+" \n__p+='") ,t}),i+="' ;\n",t.var iable||(i= "with(obj| |{}){\n"+i +"}\n"),i= "var __t,_ _p='',__j= Array.prot otype.join ,"+"print= function() {__p+=__j. call(argum ents,'');} ;\n"+i+"re turn __p;\ n";try{var o=new Fun ction(t.va riable||"o bj","_",i) }catch(a){ throw a.so urce=i,a}v ar c=funct ion(n){ret urn o.call (this,n,m) },l=t.vari able||"obj ";return c .source="f unction("+ l+"){\n"+i +"}",c},m. chain=func tion(n){va r t=m(n);r eturn t._c hain=!0,t} ;var z=fun ction(n,t) {return n. _chain?m(t ).chain(): t};m.mixin =function( n){m.each( m.function s(n),funct ion(t){var r=m[t]=n[ t];m.proto type[t]=fu nction(){v ar n=[this ._wrapped] ;return c. apply(n,ar guments),z (this,r.ap ply(m,n))} })},m.mixi n(m),m.eac h(["pop"," push","rev erse","shi ft","sort" ,"splice", "unshift"] ,function( n){var t=i [n];m.prot otype[n]=f unction(){ var r=this ._wrapped; return t.a pply(r,arg uments),"s hift"!==n& &"splice"! ==n||0!==r .length||d elete r[0] ,z(this,r) }}),m.each (["concat" ,"join","s lice"],fun ction(n){v ar t=i[n]; m.prototyp e[n]=funct ion(){retu rn z(this, t.apply(th is._wrappe d,argument s))}}),m.p rototype.v alue=funct ion(){retu rn this._w rapped},m. prototype. valueOf=m. prototype. toJSON=m.p rototype.v alue,m.pro totype.toS tring=func tion(){ret urn""+this ._wrapped} ,"function "==typeof define&&de fine.amd&& define("un derscore", [],functio n(){return m})}).cal l(this); | |||||
| 12 | //# source MappingURL =underscor e-min.map |
Araxis Merge (but not the data content of this report) is Copyright © 1993-2016 Araxis Ltd (www.araxis.com). All rights reserved.