From 539b35af00a9f561bfe75cc5969e3dbaef0bbc44 Mon Sep 17 00:00:00 2001 From: Ger Hobbelt Date: Mon, 3 Dec 2012 01:09:22 +0100 Subject: [PATCH 01/48] include Brent's method - taken from https://gist.github.com/3317728 --- src/uniroot.js | 114 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 114 insertions(+) create mode 100644 src/uniroot.js diff --git a/src/uniroot.js b/src/uniroot.js new file mode 100644 index 0000000..7aeaee9 --- /dev/null +++ b/src/uniroot.js @@ -0,0 +1,114 @@ +/** + * Searches the interval from lowerLimit to upperLimit + * for a root (i.e., zero) of the function func with respect to + * its first argument using Brent's method root-finding algorithm. + * + * @param {function} function for which the root is sought. + * @param {number} the lower point of the interval to be searched. + * @param {number} the upper point of the interval to be searched. + * @param {number} the desired accuracy (convergence tolerance). + * @param {number} the maximum number of iterations. + * @returns an estimate for the root within accuracy. + */ +// Translated from zeroin.c in http://www.netlib.org/c/brent.shar. +function uniroot ( func, lowerLimit, upperLimit, errorTol, maxIter ) { + var a = lowerLimit + , b = upperLimit + , c = a + , fa = func(a) + , fb = func(b) + , fc = fa + , s = 0 + , fs = 0 + , tol_act // Actual tolerance + , new_step // Step at this iteration + , prev_step // Distance from the last but one to the last approximation + , p // Interpolation step is calculated in the form p/q; division is delayed until the last moment + , q + ; + + errorTol = errorTol || 0; + maxIter = maxIter || 1000; + + while ( maxIter-- > 0 ) { + + prev_step = b - a; + + if ( Math.abs(fc) < Math.abs(fb) ) { + // Swap data for b to be the best approximation + a = b, b = c, c = a; + fa = fb, fb = fc, fc = fa; + } + + tol_act = 1e-15 * Math.abs(b) + errorTol / 2; + new_step = ( c - b ) / 2; + + if ( Math.abs(new_step) <= tol_act || fb === 0 ) { + return b; // Acceptable approx. is found + } + + // Decide if the interpolation can be tried + if ( Math.abs(prev_step) >= tol_act && Math.abs(fa) > Math.abs(fb) ) { + // If prev_step was large enough and was in true direction, Interpolatiom may be tried + var t1, cb, t2; + cb = c - b; + if ( a === c ) { // If we have only two distinct points linear interpolation can only be applied + t1 = fb / fa; + p = cb * t1; + q = 1.0 - t1; + } + else { // Quadric inverse interpolation + q = fa / fc, t1 = fb / fc, t2 = fb / fa; + p = t2 * (cb * q * (q - t1) - (b - a) * (t1 - 1)); + q = (q - 1) * (t1 - 1) * (t2 - 1); + } + + if ( p > 0 ) { + q = -q; // p was calculated with the opposite sign; make p positive + } + else { + p = -p; // and assign possible minus to q + } + + if ( p < ( 0.75 * cb * q - Math.abs( tol_act * q ) / 2 ) && + p < Math.abs( prev_step * q / 2 ) ) { + // If (b + p / q) falls in [b,c] and isn't too large it is accepted + new_step = p / q; + } + + // If p/q is too large then the bissection procedure can reduce [b,c] range to more extent + } + + if ( Math.abs( new_step ) < tol_act ) { // Adjust the step to be not less than tolerance + new_step = ( new_step > 0 ) ? tol_act : -tol_act; + } + + a = b, fa = fb; // Save the previous approx. + b += new_step, fb = func(b); // Do step to a new approxim. + + if ( (fb > 0 && fc > 0) || (fb < 0 && fc < 0) ) { + c = a, fc = fa; // Adjust c for it to have a sign opposite to that of b + } + } + +} + + +/* +var test_counter; +function f1 (x) { test_counter++; return (Math.pow(x,2)-1)*x - 5; } +function f2 (x) { test_counter++; return Math.cos(x)-x; } +function f3 (x) { test_counter++; return Math.sin(x)-x; } +function f4 (x) { test_counter++; return (x + 3) * Math.pow(x - 1, 2); } +[ + [f1, 2, 3], + [f2, 2, 3], + [f2, -1, 3], + [f3, -1, 3], + [f4, -4, 4/3] +].forEach(function (args) { + test_counter = 0; + var root = uniroot.apply( pv, args ); + ;;;console.log( 'uniroot:', args.slice(1), root, test_counter ); +}) +*/ From 562d3fbac950e546c61f9c0d943d6e84b127252f Mon Sep 17 00:00:00 2001 From: Ger Hobbelt Date: Sun, 16 Dec 2012 14:27:43 +0100 Subject: [PATCH 02/48] tweaked the build process to fit my needs. --- favicon.ico | Bin tools/build.sh | 1 + 2 files changed, 1 insertion(+) mode change 100755 => 100644 favicon.ico diff --git a/favicon.ico b/favicon.ico old mode 100755 new mode 100644 diff --git a/tools/build.sh b/tools/build.sh index fe3be4b..cb677b8 100755 --- a/tools/build.sh +++ b/tools/build.sh @@ -15,6 +15,7 @@ fi ver=`grep 'numeric.version.*=.*"' ../src/numeric.js | sed 's/numeric.version[ =]*"\([0-9.]*\)".*/\1/'` echo "Version is $ver" cat ../src/numeric.js ../src/seedrandom.js ../src/quadprog.js ../src/svd.js > ../lib/numeric-$ver.js +cp ../lib/numeric-$ver.js ../lib/numeric.latest.js uglifyjs ../lib/numeric-$ver.js > ../lib/numeric-$ver.min.js cat jquery-1.7.1.min.js jquery.flot.min.js 'Crypto-JS v2.4.0/crypto/crypto-min.js' 'Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js' json2.js > megalib.js echo "" | cat closurelib.js sylvester.js - ../lib/numeric-$ver.min.js jquery-1.7.1.min.js jquery.flot.min.js > benchlib.js From 35b67b6897acab6b49cb00fa17bdf0c36cfb837a Mon Sep 17 00:00:00 2001 From: Ger Hobbelt Date: Sun, 16 Dec 2012 14:40:44 +0100 Subject: [PATCH 03/48] gitattributes --- .gitattributes | 12 ++++++++++++ tools/megalib.js | 24 ++++++++++++------------ 2 files changed, 24 insertions(+), 12 deletions(-) create mode 100644 .gitattributes diff --git a/.gitattributes b/.gitattributes new file mode 100644 index 0000000..4872ee1 --- /dev/null +++ b/.gitattributes @@ -0,0 +1,12 @@ +*.sh text eol=lf +*.php text eol=lf +*.inc text eol=lf +*.html text eol=lf +*.js text eol=lf +*.css text eol=lf +*.ini text eol=lf +*.txt text eol=lf +*.xml text eol=lf +*.md text eol=lf +*.markdown text eol=lf + diff --git a/tools/megalib.js b/tools/megalib.js index f10f307..799e9fd 100644 --- a/tools/megalib.js +++ b/tools/megalib.js @@ -6,22 +6,22 @@ f.event={add:function(a,c,d,e,g){var h,i,j,k,l,m,n,o,p,q,r,s;if(!(a.nodeType===3 * Released under the MIT license by IOLA, December 2007. * */ -(function(b){b.color={};b.color.make=function(d,e,g,f){var c={};c.r=d||0;c.g=e||0;c.b=g||0;c.a=f!=null?f:1;c.add=function(h,j){for(var k=0;k=1){return"rgb("+[c.r,c.g,c.b].join(",")+")"}else{return"rgba("+[c.r,c.g,c.b,c.a].join(",")+")"}};c.normalize=function(){function h(k,j,l){return jl?l:j)}c.r=h(0,parseInt(c.r),255);c.g=h(0,parseInt(c.g),255);c.b=h(0,parseInt(c.b),255);c.a=h(0,c.a,1);return c};c.clone=function(){return b.color.make(c.r,c.b,c.g,c.a)};return c.normalize()};b.color.extract=function(d,e){var c;do{c=d.css(e).toLowerCase();if(c!=""&&c!="transparent"){break}d=d.parent()}while(!b.nodeName(d.get(0),"body"));if(c=="rgba(0, 0, 0, 0)"){c="transparent"}return b.color.parse(c)};b.color.parse=function(c){var d,f=b.color.make;if(d=/rgb\(\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*\)/.exec(c)){return f(parseInt(d[1],10),parseInt(d[2],10),parseInt(d[3],10))}if(d=/rgba\(\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]+(?:\.[0-9]+)?)\s*\)/.exec(c)){return f(parseInt(d[1],10),parseInt(d[2],10),parseInt(d[3],10),parseFloat(d[4]))}if(d=/rgb\(\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*\)/.exec(c)){return f(parseFloat(d[1])*2.55,parseFloat(d[2])*2.55,parseFloat(d[3])*2.55)}if(d=/rgba\(\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\s*\)/.exec(c)){return f(parseFloat(d[1])*2.55,parseFloat(d[2])*2.55,parseFloat(d[3])*2.55,parseFloat(d[4]))}if(d=/#([a-fA-F0-9]{2})([a-fA-F0-9]{2})([a-fA-F0-9]{2})/.exec(c)){return f(parseInt(d[1],16),parseInt(d[2],16),parseInt(d[3],16))}if(d=/#([a-fA-F0-9])([a-fA-F0-9])([a-fA-F0-9])/.exec(c)){return f(parseInt(d[1]+d[1],16),parseInt(d[2]+d[2],16),parseInt(d[3]+d[3],16))}var e=b.trim(c).toLowerCase();if(e=="transparent"){return f(255,255,255,0)}else{d=a[e]||[0,0,0];return f(d[0],d[1],d[2])}};var a={aqua:[0,255,255],azure:[240,255,255],beige:[245,245,220],black:[0,0,0],blue:[0,0,255],brown:[165,42,42],cyan:[0,255,255],darkblue:[0,0,139],darkcyan:[0,139,139],darkgrey:[169,169,169],darkgreen:[0,100,0],darkkhaki:[189,183,107],darkmagenta:[139,0,139],darkolivegreen:[85,107,47],darkorange:[255,140,0],darkorchid:[153,50,204],darkred:[139,0,0],darksalmon:[233,150,122],darkviolet:[148,0,211],fuchsia:[255,0,255],gold:[255,215,0],green:[0,128,0],indigo:[75,0,130],khaki:[240,230,140],lightblue:[173,216,230],lightcyan:[224,255,255],lightgreen:[144,238,144],lightgrey:[211,211,211],lightpink:[255,182,193],lightyellow:[255,255,224],lime:[0,255,0],magenta:[255,0,255],maroon:[128,0,0],navy:[0,0,128],olive:[128,128,0],orange:[255,165,0],pink:[255,192,203],purple:[128,0,128],violet:[128,0,128],red:[255,0,0],silver:[192,192,192],white:[255,255,255],yellow:[255,255,0]}})(jQuery);(function(c){function b(av,ai,J,af){var Q=[],O={colors:["#edc240","#afd8f8","#cb4b4b","#4da74d","#9440ed"],legend:{show:true,noColumns:1,labelFormatter:null,labelBoxBorderColor:"#ccc",container:null,position:"ne",margin:5,backgroundColor:null,backgroundOpacity:0.85},xaxis:{show:null,position:"bottom",mode:null,color:null,tickColor:null,transform:null,inverseTransform:null,min:null,max:null,autoscaleMargin:null,ticks:null,tickFormatter:null,labelWidth:null,labelHeight:null,reserveSpace:null,tickLength:null,alignTicksWithAxis:null,tickDecimals:null,tickSize:null,minTickSize:null,monthNames:null,timeformat:null,twelveHourClock:false},yaxis:{autoscaleMargin:0.02,position:"left"},xaxes:[],yaxes:[],series:{points:{show:false,radius:3,lineWidth:2,fill:true,fillColor:"#ffffff",symbol:"circle"},lines:{lineWidth:2,fill:false,fillColor:null,steps:false},bars:{show:false,lineWidth:2,barWidth:1,fill:true,fillColor:null,align:"left",horizontal:false},shadowSize:3},grid:{show:true,aboveData:false,color:"#545454",backgroundColor:null,borderColor:null,tickColor:null,labelMargin:5,axisMargin:8,borderWidth:2,minBorderMargin:null,markings:null,markingsColor:"#f4f4f4",markingsLineWidth:2,clickable:false,hoverable:false,autoHighlight:true,mouseActiveRadius:10},hooks:{}},az=null,ad=null,y=null,H=null,A=null,p=[],aw=[],q={left:0,right:0,top:0,bottom:0},G=0,I=0,h=0,w=0,ak={processOptions:[],processRawData:[],processDatapoints:[],drawSeries:[],draw:[],bindEvents:[],drawOverlay:[],shutdown:[]},aq=this;aq.setData=aj;aq.setupGrid=t;aq.draw=W;aq.getPlaceholder=function(){return av};aq.getCanvas=function(){return az};aq.getPlotOffset=function(){return q};aq.width=function(){return h};aq.height=function(){return w};aq.offset=function(){var aB=y.offset();aB.left+=q.left;aB.top+=q.top;return aB};aq.getData=function(){return Q};aq.getAxes=function(){var aC={},aB;c.each(p.concat(aw),function(aD,aE){if(aE){aC[aE.direction+(aE.n!=1?aE.n:"")+"axis"]=aE}});return aC};aq.getXAxes=function(){return p};aq.getYAxes=function(){return aw};aq.c2p=C;aq.p2c=ar;aq.getOptions=function(){return O};aq.highlight=x;aq.unhighlight=T;aq.triggerRedrawOverlay=f;aq.pointOffset=function(aB){return{left:parseInt(p[aA(aB,"x")-1].p2c(+aB.x)+q.left),top:parseInt(aw[aA(aB,"y")-1].p2c(+aB.y)+q.top)}};aq.shutdown=ag;aq.resize=function(){B();g(az);g(ad)};aq.hooks=ak;F(aq);Z(J);X();aj(ai);t();W();ah();function an(aD,aB){aB=[aq].concat(aB);for(var aC=0;aC=O.colors.length){aG=0;++aF}}var aH=0,aN;for(aG=0;aGa3.datamax&&a1!=aB){a3.datamax=a1}}c.each(m(),function(a1,a2){a2.datamin=aO;a2.datamax=aI;a2.used=false});for(aU=0;aU0&&aT[aR-aP]!=null&&aT[aR-aP]!=aT[aR]&&aT[aR-aP+1]!=aT[aR+1]){for(aN=0;aNaM){aM=a0}}if(aX.y){if(a0aV){aV=a0}}}}if(aJ.bars.show){var aY=aJ.bars.align=="left"?0:-aJ.bars.barWidth/2;if(aJ.bars.horizontal){aQ+=aY;aV+=aY+aJ.bars.barWidth}else{aK+=aY;aM+=aY+aJ.bars.barWidth}}aF(aJ.xaxis,aK,aM);aF(aJ.yaxis,aQ,aV)}c.each(m(),function(a1,a2){if(a2.datamin==aO){a2.datamin=null}if(a2.datamax==aI){a2.datamax=null}})}function j(aB,aC){var aD=document.createElement("canvas");aD.className=aC;aD.width=G;aD.height=I;if(!aB){c(aD).css({position:"absolute",left:0,top:0})}c(aD).appendTo(av);if(!aD.getContext){aD=window.G_vmlCanvasManager.initElement(aD)}aD.getContext("2d").save();return aD}function B(){G=av.width();I=av.height();if(G<=0||I<=0){throw"Invalid dimensions for plot, width = "+G+", height = "+I}}function g(aC){if(aC.width!=G){aC.width=G}if(aC.height!=I){aC.height=I}var aB=aC.getContext("2d");aB.restore();aB.save()}function X(){var aC,aB=av.children("canvas.base"),aD=av.children("canvas.overlay");if(aB.length==0||aD==0){av.html("");av.css({padding:0});if(av.css("position")=="static"){av.css("position","relative")}B();az=j(true,"base");ad=j(false,"overlay");aC=false}else{az=aB.get(0);ad=aD.get(0);aC=true}H=az.getContext("2d");A=ad.getContext("2d");y=c([ad,az]);if(aC){av.data("plot").shutdown();aq.resize();A.clearRect(0,0,G,I);y.unbind();av.children().not([az,ad]).remove()}av.data("plot",aq)}function ah(){if(O.grid.hoverable){y.mousemove(aa);y.mouseleave(l)}if(O.grid.clickable){y.click(R)}an(ak.bindEvents,[y])}function ag(){if(M){clearTimeout(M)}y.unbind("mousemove",aa);y.unbind("mouseleave",l);y.unbind("click",R);an(ak.shutdown,[y])}function r(aG){function aC(aH){return aH}var aF,aB,aD=aG.options.transform||aC,aE=aG.options.inverseTransform;if(aG.direction=="x"){aF=aG.scale=h/Math.abs(aD(aG.max)-aD(aG.min));aB=Math.min(aD(aG.max),aD(aG.min))}else{aF=aG.scale=w/Math.abs(aD(aG.max)-aD(aG.min));aF=-aF;aB=Math.max(aD(aG.max),aD(aG.min))}if(aD==aC){aG.p2c=function(aH){return(aH-aB)*aF}}else{aG.p2c=function(aH){return(aD(aH)-aB)*aF}}if(!aE){aG.c2p=function(aH){return aB+aH/aF}}else{aG.c2p=function(aH){return aE(aB+aH/aF)}}}function L(aD){var aB=aD.options,aF,aJ=aD.ticks||[],aI=[],aE,aK=aB.labelWidth,aG=aB.labelHeight,aC;function aH(aM,aL){return c('
'+aM.join("")+"
").appendTo(av)}if(aD.direction=="x"){if(aK==null){aK=Math.floor(G/(aJ.length>0?aJ.length:1))}if(aG==null){aI=[];for(aF=0;aF'+aE+"")}}if(aI.length>0){aI.push('
');aC=aH(aI,"width:10000px;");aG=aC.height();aC.remove()}}}else{if(aK==null||aG==null){for(aF=0;aF'+aE+"")}}if(aI.length>0){aC=aH(aI,"");if(aK==null){aK=aC.children().width()}if(aG==null){aG=aC.find("div.tickLabel").height()}aC.remove()}}}if(aK==null){aK=0}if(aG==null){aG=0}aD.labelWidth=aK;aD.labelHeight=aG}function au(aD){var aC=aD.labelWidth,aL=aD.labelHeight,aH=aD.options.position,aF=aD.options.tickLength,aG=O.grid.axisMargin,aJ=O.grid.labelMargin,aK=aD.direction=="x"?p:aw,aE;var aB=c.grep(aK,function(aN){return aN&&aN.options.position==aH&&aN.reserveSpace});if(c.inArray(aD,aB)==aB.length-1){aG=0}if(aF==null){aF="full"}var aI=c.grep(aK,function(aN){return aN&&aN.reserveSpace});var aM=c.inArray(aD,aI)==0;if(!aM&&aF=="full"){aF=5}if(!isNaN(+aF)){aJ+=+aF}if(aD.direction=="x"){aL+=aJ;if(aH=="bottom"){q.bottom+=aL+aG;aD.box={top:I-q.bottom,height:aL}}else{aD.box={top:q.top+aG,height:aL};q.top+=aL+aG}}else{aC+=aJ;if(aH=="left"){aD.box={left:q.left+aG,width:aC};q.left+=aC+aG}else{q.right+=aC+aG;aD.box={left:G-q.right,width:aC}}}aD.position=aH;aD.tickLength=aF;aD.box.padding=aJ;aD.innermost=aM}function U(aB){if(aB.direction=="x"){aB.box.left=q.left;aB.box.width=h}else{aB.box.top=q.top;aB.box.height=w}}function t(){var aC,aE=m();c.each(aE,function(aF,aG){aG.show=aG.options.show;if(aG.show==null){aG.show=aG.used}aG.reserveSpace=aG.show||aG.options.reserveSpace;n(aG)});allocatedAxes=c.grep(aE,function(aF){return aF.reserveSpace});q.left=q.right=q.top=q.bottom=0;if(O.grid.show){c.each(allocatedAxes,function(aF,aG){S(aG);P(aG);ap(aG,aG.ticks);L(aG)});for(aC=allocatedAxes.length-1;aC>=0;--aC){au(allocatedAxes[aC])}var aD=O.grid.minBorderMargin;if(aD==null){aD=0;for(aC=0;aC=0){aD=0}}if(aF.max==null){aB+=aH*aG;if(aB>0&&aE.datamax!=null&&aE.datamax<=0){aB=0}}}}aE.min=aD;aE.max=aB}function S(aG){var aM=aG.options;var aH;if(typeof aM.ticks=="number"&&aM.ticks>0){aH=aM.ticks}else{aH=0.3*Math.sqrt(aG.direction=="x"?G:I)}var aT=(aG.max-aG.min)/aH,aO,aB,aN,aR,aS,aQ,aI;if(aM.mode=="time"){var aJ={second:1000,minute:60*1000,hour:60*60*1000,day:24*60*60*1000,month:30*24*60*60*1000,year:365.2425*24*60*60*1000};var aK=[[1,"second"],[2,"second"],[5,"second"],[10,"second"],[30,"second"],[1,"minute"],[2,"minute"],[5,"minute"],[10,"minute"],[30,"minute"],[1,"hour"],[2,"hour"],[4,"hour"],[8,"hour"],[12,"hour"],[1,"day"],[2,"day"],[3,"day"],[0.25,"month"],[0.5,"month"],[1,"month"],[2,"month"],[3,"month"],[6,"month"],[1,"year"]];var aC=0;if(aM.minTickSize!=null){if(typeof aM.tickSize=="number"){aC=aM.tickSize}else{aC=aM.minTickSize[0]*aJ[aM.minTickSize[1]]}}for(var aS=0;aS=aC){break}}aO=aK[aS][0];aN=aK[aS][1];if(aN=="year"){aQ=Math.pow(10,Math.floor(Math.log(aT/aJ.year)/Math.LN10));aI=(aT/aJ.year)/aQ;if(aI<1.5){aO=1}else{if(aI<3){aO=2}else{if(aI<7.5){aO=5}else{aO=10}}}aO*=aQ}aG.tickSize=aM.tickSize||[aO,aN];aB=function(aX){var a2=[],a0=aX.tickSize[0],a3=aX.tickSize[1],a1=new Date(aX.min);var aW=a0*aJ[a3];if(a3=="second"){a1.setUTCSeconds(a(a1.getUTCSeconds(),a0))}if(a3=="minute"){a1.setUTCMinutes(a(a1.getUTCMinutes(),a0))}if(a3=="hour"){a1.setUTCHours(a(a1.getUTCHours(),a0))}if(a3=="month"){a1.setUTCMonth(a(a1.getUTCMonth(),a0))}if(a3=="year"){a1.setUTCFullYear(a(a1.getUTCFullYear(),a0))}a1.setUTCMilliseconds(0);if(aW>=aJ.minute){a1.setUTCSeconds(0)}if(aW>=aJ.hour){a1.setUTCMinutes(0)}if(aW>=aJ.day){a1.setUTCHours(0)}if(aW>=aJ.day*4){a1.setUTCDate(1)}if(aW>=aJ.year){a1.setUTCMonth(0)}var a5=0,a4=Number.NaN,aY;do{aY=a4;a4=a1.getTime();a2.push(a4);if(a3=="month"){if(a0<1){a1.setUTCDate(1);var aV=a1.getTime();a1.setUTCMonth(a1.getUTCMonth()+1);var aZ=a1.getTime();a1.setTime(a4+a5*aJ.hour+(aZ-aV)*a0);a5=a1.getUTCHours();a1.setUTCHours(0)}else{a1.setUTCMonth(a1.getUTCMonth()+a0)}}else{if(a3=="year"){a1.setUTCFullYear(a1.getUTCFullYear()+a0)}else{a1.setTime(a4+aW)}}}while(a4aU){aP=aU}aQ=Math.pow(10,-aP);aI=aT/aQ;if(aI<1.5){aO=1}else{if(aI<3){aO=2;if(aI>2.25&&(aU==null||aP+1<=aU)){aO=2.5;++aP}}else{if(aI<7.5){aO=5}else{aO=10}}}aO*=aQ;if(aM.minTickSize!=null&&aO0){if(aM.min==null){aG.min=Math.min(aG.min,aL[0])}if(aM.max==null&&aL.length>1){aG.max=Math.max(aG.max,aL[aL.length-1])}}aB=function(aX){var aY=[],aV,aW;for(aW=0;aW1&&/\..*0$/.test((aD[1]-aD[0]).toFixed(aE)))){aG.tickDecimals=aE}}}}aG.tickGenerator=aB;if(c.isFunction(aM.tickFormatter)){aG.tickFormatter=function(aV,aW){return""+aM.tickFormatter(aV,aW)}}else{aG.tickFormatter=aR}}function P(aF){var aH=aF.options.ticks,aG=[];if(aH==null||(typeof aH=="number"&&aH>0)){aG=aF.tickGenerator(aF)}else{if(aH){if(c.isFunction(aH)){aG=aH({min:aF.min,max:aF.max})}else{aG=aH}}}var aE,aB;aF.ticks=[];for(aE=0;aE1){aC=aD[1]}}else{aB=+aD}if(aC==null){aC=aF.tickFormatter(aB,aF)}if(!isNaN(aB)){aF.ticks.push({v:aB,label:aC})}}}function ap(aB,aC){if(aB.options.autoscaleMargin&&aC.length>0){if(aB.options.min==null){aB.min=Math.min(aB.min,aC[0].v)}if(aB.options.max==null&&aC.length>1){aB.max=Math.max(aB.max,aC[aC.length-1].v)}}}function W(){H.clearRect(0,0,G,I);var aC=O.grid;if(aC.show&&aC.backgroundColor){N()}if(aC.show&&!aC.aboveData){ac()}for(var aB=0;aBaG){var aC=aH;aH=aG;aG=aC}return{from:aH,to:aG,axis:aE}}function N(){H.save();H.translate(q.left,q.top);H.fillStyle=am(O.grid.backgroundColor,w,0,"rgba(255, 255, 255, 0)");H.fillRect(0,0,h,w);H.restore()}function ac(){var aF;H.save();H.translate(q.left,q.top);var aH=O.grid.markings;if(aH){if(c.isFunction(aH)){var aK=aq.getAxes();aK.xmin=aK.xaxis.min;aK.xmax=aK.xaxis.max;aK.ymin=aK.yaxis.min;aK.ymax=aK.yaxis.max;aH=aH(aK)}for(aF=0;aFaC.axis.max||aI.toaI.axis.max){continue}aC.from=Math.max(aC.from,aC.axis.min);aC.to=Math.min(aC.to,aC.axis.max);aI.from=Math.max(aI.from,aI.axis.min);aI.to=Math.min(aI.to,aI.axis.max);if(aC.from==aC.to&&aI.from==aI.to){continue}aC.from=aC.axis.p2c(aC.from);aC.to=aC.axis.p2c(aC.to);aI.from=aI.axis.p2c(aI.from);aI.to=aI.axis.p2c(aI.to);if(aC.from==aC.to||aI.from==aI.to){H.beginPath();H.strokeStyle=aD.color||O.grid.markingsColor;H.lineWidth=aD.lineWidth||O.grid.markingsLineWidth;H.moveTo(aC.from,aI.from);H.lineTo(aC.to,aI.to);H.stroke()}else{H.fillStyle=aD.color||O.grid.markingsColor;H.fillRect(aC.from,aI.to,aC.to-aC.from,aI.from-aI.to)}}}var aK=m(),aM=O.grid.borderWidth;for(var aE=0;aEaB.max||(aQ=="full"&&aM>0&&(aO==aB.min||aO==aB.max))){continue}if(aB.direction=="x"){aN=aB.p2c(aO);aJ=aQ=="full"?-w:aQ;if(aB.position=="top"){aJ=-aJ}}else{aL=aB.p2c(aO);aP=aQ=="full"?-h:aQ;if(aB.position=="left"){aP=-aP}}if(H.lineWidth==1){if(aB.direction=="x"){aN=Math.floor(aN)+0.5}else{aL=Math.floor(aL)+0.5}}H.moveTo(aN,aL);H.lineTo(aN+aP,aL+aJ)}H.stroke()}if(aM){H.lineWidth=aM;H.strokeStyle=O.grid.borderColor;H.strokeRect(-aM/2,-aM/2,h+aM,w+aM)}H.restore()}function k(){av.find(".tickLabels").remove();var aG=['
'];var aJ=m();for(var aD=0;aD');for(var aE=0;aEaC.max){continue}var aK={},aI;if(aC.direction=="x"){aI="center";aK.left=Math.round(q.left+aC.p2c(aH.v)-aC.labelWidth/2);if(aC.position=="bottom"){aK.top=aF.top+aF.padding}else{aK.bottom=I-(aF.top+aF.height-aF.padding)}}else{aK.top=Math.round(q.top+aC.p2c(aH.v)-aC.labelHeight/2);if(aC.position=="left"){aK.right=G-(aF.left+aF.width-aF.padding);aI="right"}else{aK.left=aF.left+aF.padding;aI="left"}}aK.width=aC.labelWidth;var aB=["position:absolute","text-align:"+aI];for(var aL in aK){aB.push(aL+":"+aK[aL]+"px")}aG.push('
'+aH.label+"
")}aG.push("
")}aG.push("");av.append(aG.join(""))}function d(aB){if(aB.lines.show){at(aB)}if(aB.bars.show){e(aB)}if(aB.points.show){ao(aB)}}function at(aE){function aD(aP,aQ,aI,aU,aT){var aV=aP.points,aJ=aP.pointsize,aN=null,aM=null;H.beginPath();for(var aO=aJ;aO=aR&&aS>aT.max){if(aR>aT.max){continue}aL=(aT.max-aS)/(aR-aS)*(aK-aL)+aL;aS=aT.max}else{if(aR>=aS&&aR>aT.max){if(aS>aT.max){continue}aK=(aT.max-aS)/(aR-aS)*(aK-aL)+aL;aR=aT.max}}if(aL<=aK&&aL=aK&&aL>aU.max){if(aK>aU.max){continue}aS=(aU.max-aL)/(aK-aL)*(aR-aS)+aS;aL=aU.max}else{if(aK>=aL&&aK>aU.max){if(aL>aU.max){continue}aR=(aU.max-aL)/(aK-aL)*(aR-aS)+aS;aK=aU.max}}if(aL!=aN||aS!=aM){H.moveTo(aU.p2c(aL)+aQ,aT.p2c(aS)+aI)}aN=aK;aM=aR;H.lineTo(aU.p2c(aK)+aQ,aT.p2c(aR)+aI)}H.stroke()}function aF(aI,aQ,aP){var aW=aI.points,aV=aI.pointsize,aN=Math.min(Math.max(0,aP.min),aP.max),aX=0,aU,aT=false,aM=1,aL=0,aR=0;while(true){if(aV>0&&aX>aW.length+aV){break}aX+=aV;var aZ=aW[aX-aV],aK=aW[aX-aV+aM],aY=aW[aX],aJ=aW[aX+aM];if(aT){if(aV>0&&aZ!=null&&aY==null){aR=aX;aV=-aV;aM=2;continue}if(aV<0&&aX==aL+aV){H.fill();aT=false;aV=-aV;aM=1;aX=aL=aR+aV;continue}}if(aZ==null||aY==null){continue}if(aZ<=aY&&aZ=aY&&aZ>aQ.max){if(aY>aQ.max){continue}aK=(aQ.max-aZ)/(aY-aZ)*(aJ-aK)+aK;aZ=aQ.max}else{if(aY>=aZ&&aY>aQ.max){if(aZ>aQ.max){continue}aJ=(aQ.max-aZ)/(aY-aZ)*(aJ-aK)+aK;aY=aQ.max}}if(!aT){H.beginPath();H.moveTo(aQ.p2c(aZ),aP.p2c(aN));aT=true}if(aK>=aP.max&&aJ>=aP.max){H.lineTo(aQ.p2c(aZ),aP.p2c(aP.max));H.lineTo(aQ.p2c(aY),aP.p2c(aP.max));continue}else{if(aK<=aP.min&&aJ<=aP.min){H.lineTo(aQ.p2c(aZ),aP.p2c(aP.min));H.lineTo(aQ.p2c(aY),aP.p2c(aP.min));continue}}var aO=aZ,aS=aY;if(aK<=aJ&&aK=aP.min){aZ=(aP.min-aK)/(aJ-aK)*(aY-aZ)+aZ;aK=aP.min}else{if(aJ<=aK&&aJ=aP.min){aY=(aP.min-aK)/(aJ-aK)*(aY-aZ)+aZ;aJ=aP.min}}if(aK>=aJ&&aK>aP.max&&aJ<=aP.max){aZ=(aP.max-aK)/(aJ-aK)*(aY-aZ)+aZ;aK=aP.max}else{if(aJ>=aK&&aJ>aP.max&&aK<=aP.max){aY=(aP.max-aK)/(aJ-aK)*(aY-aZ)+aZ;aJ=aP.max}}if(aZ!=aO){H.lineTo(aQ.p2c(aO),aP.p2c(aK))}H.lineTo(aQ.p2c(aZ),aP.p2c(aK));H.lineTo(aQ.p2c(aY),aP.p2c(aJ));if(aY!=aS){H.lineTo(aQ.p2c(aY),aP.p2c(aJ));H.lineTo(aQ.p2c(aS),aP.p2c(aJ))}}}H.save();H.translate(q.left,q.top);H.lineJoin="round";var aG=aE.lines.lineWidth,aB=aE.shadowSize;if(aG>0&&aB>0){H.lineWidth=aB;H.strokeStyle="rgba(0,0,0,0.1)";var aH=Math.PI/18;aD(aE.datapoints,Math.sin(aH)*(aG/2+aB/2),Math.cos(aH)*(aG/2+aB/2),aE.xaxis,aE.yaxis);H.lineWidth=aB/2;aD(aE.datapoints,Math.sin(aH)*(aG/2+aB/4),Math.cos(aH)*(aG/2+aB/4),aE.xaxis,aE.yaxis)}H.lineWidth=aG;H.strokeStyle=aE.color;var aC=ae(aE.lines,aE.color,0,w);if(aC){H.fillStyle=aC;aF(aE.datapoints,aE.xaxis,aE.yaxis)}if(aG>0){aD(aE.datapoints,0,0,aE.xaxis,aE.yaxis)}H.restore()}function ao(aE){function aH(aN,aM,aU,aK,aS,aT,aQ,aJ){var aR=aN.points,aI=aN.pointsize;for(var aL=0;aLaT.max||aOaQ.max){continue}H.beginPath();aP=aT.p2c(aP);aO=aQ.p2c(aO)+aK;if(aJ=="circle"){H.arc(aP,aO,aM,0,aS?Math.PI:Math.PI*2,false)}else{aJ(H,aP,aO,aM,aS)}H.closePath();if(aU){H.fillStyle=aU;H.fill()}H.stroke()}}H.save();H.translate(q.left,q.top);var aG=aE.points.lineWidth,aC=aE.shadowSize,aB=aE.points.radius,aF=aE.points.symbol;if(aG>0&&aC>0){var aD=aC/2;H.lineWidth=aD;H.strokeStyle="rgba(0,0,0,0.1)";aH(aE.datapoints,aB,null,aD+aD/2,true,aE.xaxis,aE.yaxis,aF);H.strokeStyle="rgba(0,0,0,0.2)";aH(aE.datapoints,aB,null,aD/2,true,aE.xaxis,aE.yaxis,aF)}H.lineWidth=aG;H.strokeStyle=aE.color;aH(aE.datapoints,aB,ae(aE.points,aE.color),0,false,aE.xaxis,aE.yaxis,aF);H.restore()}function E(aN,aM,aV,aI,aQ,aF,aD,aL,aK,aU,aR,aC){var aE,aT,aJ,aP,aG,aB,aO,aH,aS;if(aR){aH=aB=aO=true;aG=false;aE=aV;aT=aN;aP=aM+aI;aJ=aM+aQ;if(aTaL.max||aPaK.max){return}if(aEaL.max){aT=aL.max;aB=false}if(aJaK.max){aP=aK.max;aO=false}aE=aL.p2c(aE);aJ=aK.p2c(aJ);aT=aL.p2c(aT);aP=aK.p2c(aP);if(aD){aU.beginPath();aU.moveTo(aE,aJ);aU.lineTo(aE,aP);aU.lineTo(aT,aP);aU.lineTo(aT,aJ);aU.fillStyle=aD(aJ,aP);aU.fill()}if(aC>0&&(aG||aB||aO||aH)){aU.beginPath();aU.moveTo(aE,aJ+aF);if(aG){aU.lineTo(aE,aP+aF)}else{aU.moveTo(aE,aP+aF)}if(aO){aU.lineTo(aT,aP+aF)}else{aU.moveTo(aT,aP+aF)}if(aB){aU.lineTo(aT,aJ+aF)}else{aU.moveTo(aT,aJ+aF)}if(aH){aU.lineTo(aE,aJ+aF)}else{aU.moveTo(aE,aJ+aF)}aU.stroke()}}function e(aD){function aC(aJ,aI,aL,aG,aK,aN,aM){var aO=aJ.points,aF=aJ.pointsize;for(var aH=0;aH")}aH.push("");aF=true}if(aN){aJ=aN(aJ,aM)}aH.push('
'+aJ+"")}if(aF){aH.push("")}if(aH.length==0){return}var aL=''+aH.join("")+"
";if(O.legend.container!=null){c(O.legend.container).html(aL)}else{var aI="",aC=O.legend.position,aD=O.legend.margin;if(aD[0]==null){aD=[aD,aD]}if(aC.charAt(0)=="n"){aI+="top:"+(aD[1]+q.top)+"px;"}else{if(aC.charAt(0)=="s"){aI+="bottom:"+(aD[1]+q.bottom)+"px;"}}if(aC.charAt(1)=="e"){aI+="right:"+(aD[0]+q.right)+"px;"}else{if(aC.charAt(1)=="w"){aI+="left:"+(aD[0]+q.left)+"px;"}}var aK=c('
'+aL.replace('style="','style="position:absolute;'+aI+";")+"
").appendTo(av);if(O.legend.backgroundOpacity!=0){var aG=O.legend.backgroundColor;if(aG==null){aG=O.grid.backgroundColor;if(aG&&typeof aG=="string"){aG=c.color.parse(aG)}else{aG=c.color.extract(aK,"background-color")}aG.a=1;aG=aG.toString()}var aB=aK.children();c('
').prependTo(aK).css("opacity",O.legend.backgroundOpacity)}}}var ab=[],M=null;function K(aI,aG,aD){var aO=O.grid.mouseActiveRadius,a0=aO*aO+1,aY=null,aR=false,aW,aU;for(aW=Q.length-1;aW>=0;--aW){if(!aD(Q[aW])){continue}var aP=Q[aW],aH=aP.xaxis,aF=aP.yaxis,aV=aP.datapoints.points,aT=aP.datapoints.pointsize,aQ=aH.c2p(aI),aN=aF.c2p(aG),aC=aO/aH.scale,aB=aO/aF.scale;if(aH.options.inverseTransform){aC=Number.MAX_VALUE}if(aF.options.inverseTransform){aB=Number.MAX_VALUE}if(aP.lines.show||aP.points.show){for(aU=0;aUaC||aK-aQ<-aC||aJ-aN>aB||aJ-aN<-aB){continue}var aM=Math.abs(aH.p2c(aK)-aI),aL=Math.abs(aF.p2c(aJ)-aG),aS=aM*aM+aL*aL;if(aS=Math.min(aZ,aK)&&aN>=aJ+aE&&aN<=aJ+aX):(aQ>=aK+aE&&aQ<=aK+aX&&aN>=Math.min(aZ,aJ)&&aN<=Math.max(aZ,aJ))){aY=[aW,aU/aT]}}}}if(aY){aW=aY[0];aU=aY[1];aT=Q[aW].datapoints.pointsize;return{datapoint:Q[aW].datapoints.points.slice(aU*aT,(aU+1)*aT),dataIndex:aU,series:Q[aW],seriesIndex:aW}}return null}function aa(aB){if(O.grid.hoverable){u("plothover",aB,function(aC){return aC.hoverable!=false})}}function l(aB){if(O.grid.hoverable){u("plothover",aB,function(aC){return false})}}function R(aB){u("plotclick",aB,function(aC){return aC.clickable!=false})}function u(aC,aB,aD){var aE=y.offset(),aH=aB.pageX-aE.left-q.left,aF=aB.pageY-aE.top-q.top,aJ=C({left:aH,top:aF});aJ.pageX=aB.pageX;aJ.pageY=aB.pageY;var aK=K(aH,aF,aD);if(aK){aK.pageX=parseInt(aK.series.xaxis.p2c(aK.datapoint[0])+aE.left+q.left);aK.pageY=parseInt(aK.series.yaxis.p2c(aK.datapoint[1])+aE.top+q.top)}if(O.grid.autoHighlight){for(var aG=0;aGaH.max||aIaG.max){return}var aF=aE.points.radius+aE.points.lineWidth/2;A.lineWidth=aF;A.strokeStyle=c.color.parse(aE.color).scale("a",0.5).toString();var aB=1.5*aF,aC=aH.p2c(aC),aI=aG.p2c(aI);A.beginPath();if(aE.points.symbol=="circle"){A.arc(aC,aI,aB,0,2*Math.PI,false)}else{aE.points.symbol(A,aC,aI,aB,false)}A.closePath();A.stroke()}function v(aE,aB){A.lineWidth=aE.bars.lineWidth;A.strokeStyle=c.color.parse(aE.color).scale("a",0.5).toString();var aD=c.color.parse(aE.color).scale("a",0.5).toString();var aC=aE.bars.align=="left"?0:-aE.bars.barWidth/2;E(aB[0],aB[1],aB[2]||0,aC,aC+aE.bars.barWidth,0,function(){return aD},aE.xaxis,aE.yaxis,A,aE.bars.horizontal,aE.bars.lineWidth)}function am(aJ,aB,aH,aC){if(typeof aJ=="string"){return aJ}else{var aI=H.createLinearGradient(0,aH,0,aB);for(var aE=0,aD=aJ.colors.length;aE12){n=n-12}else{if(n==0){n=12}}}for(var g=0;g=1){return"rgb("+[c.r,c.g,c.b].join(",")+")"}else{return"rgba("+[c.r,c.g,c.b,c.a].join(",")+")"}};c.normalize=function(){function h(k,j,l){return jl?l:j)}c.r=h(0,parseInt(c.r),255);c.g=h(0,parseInt(c.g),255);c.b=h(0,parseInt(c.b),255);c.a=h(0,c.a,1);return c};c.clone=function(){return b.color.make(c.r,c.b,c.g,c.a)};return c.normalize()};b.color.extract=function(d,e){var c;do{c=d.css(e).toLowerCase();if(c!=""&&c!="transparent"){break}d=d.parent()}while(!b.nodeName(d.get(0),"body"));if(c=="rgba(0, 0, 0, 0)"){c="transparent"}return b.color.parse(c)};b.color.parse=function(c){var d,f=b.color.make;if(d=/rgb\(\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*\)/.exec(c)){return f(parseInt(d[1],10),parseInt(d[2],10),parseInt(d[3],10))}if(d=/rgba\(\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]{1,3})\s*,\s*([0-9]+(?:\.[0-9]+)?)\s*\)/.exec(c)){return f(parseInt(d[1],10),parseInt(d[2],10),parseInt(d[3],10),parseFloat(d[4]))}if(d=/rgb\(\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*\)/.exec(c)){return f(parseFloat(d[1])*2.55,parseFloat(d[2])*2.55,parseFloat(d[3])*2.55)}if(d=/rgba\(\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\%\s*,\s*([0-9]+(?:\.[0-9]+)?)\s*\)/.exec(c)){return f(parseFloat(d[1])*2.55,parseFloat(d[2])*2.55,parseFloat(d[3])*2.55,parseFloat(d[4]))}if(d=/#([a-fA-F0-9]{2})([a-fA-F0-9]{2})([a-fA-F0-9]{2})/.exec(c)){return f(parseInt(d[1],16),parseInt(d[2],16),parseInt(d[3],16))}if(d=/#([a-fA-F0-9])([a-fA-F0-9])([a-fA-F0-9])/.exec(c)){return f(parseInt(d[1]+d[1],16),parseInt(d[2]+d[2],16),parseInt(d[3]+d[3],16))}var e=b.trim(c).toLowerCase();if(e=="transparent"){return f(255,255,255,0)}else{d=a[e]||[0,0,0];return f(d[0],d[1],d[2])}};var a={aqua:[0,255,255],azure:[240,255,255],beige:[245,245,220],black:[0,0,0],blue:[0,0,255],brown:[165,42,42],cyan:[0,255,255],darkblue:[0,0,139],darkcyan:[0,139,139],darkgrey:[169,169,169],darkgreen:[0,100,0],darkkhaki:[189,183,107],darkmagenta:[139,0,139],darkolivegreen:[85,107,47],darkorange:[255,140,0],darkorchid:[153,50,204],darkred:[139,0,0],darksalmon:[233,150,122],darkviolet:[148,0,211],fuchsia:[255,0,255],gold:[255,215,0],green:[0,128,0],indigo:[75,0,130],khaki:[240,230,140],lightblue:[173,216,230],lightcyan:[224,255,255],lightgreen:[144,238,144],lightgrey:[211,211,211],lightpink:[255,182,193],lightyellow:[255,255,224],lime:[0,255,0],magenta:[255,0,255],maroon:[128,0,0],navy:[0,0,128],olive:[128,128,0],orange:[255,165,0],pink:[255,192,203],purple:[128,0,128],violet:[128,0,128],red:[255,0,0],silver:[192,192,192],white:[255,255,255],yellow:[255,255,0]}})(jQuery);(function(c){function b(av,ai,J,af){var Q=[],O={colors:["#edc240","#afd8f8","#cb4b4b","#4da74d","#9440ed"],legend:{show:true,noColumns:1,labelFormatter:null,labelBoxBorderColor:"#ccc",container:null,position:"ne",margin:5,backgroundColor:null,backgroundOpacity:0.85},xaxis:{show:null,position:"bottom",mode:null,color:null,tickColor:null,transform:null,inverseTransform:null,min:null,max:null,autoscaleMargin:null,ticks:null,tickFormatter:null,labelWidth:null,labelHeight:null,reserveSpace:null,tickLength:null,alignTicksWithAxis:null,tickDecimals:null,tickSize:null,minTickSize:null,monthNames:null,timeformat:null,twelveHourClock:false},yaxis:{autoscaleMargin:0.02,position:"left"},xaxes:[],yaxes:[],series:{points:{show:false,radius:3,lineWidth:2,fill:true,fillColor:"#ffffff",symbol:"circle"},lines:{lineWidth:2,fill:false,fillColor:null,steps:false},bars:{show:false,lineWidth:2,barWidth:1,fill:true,fillColor:null,align:"left",horizontal:false},shadowSize:3},grid:{show:true,aboveData:false,color:"#545454",backgroundColor:null,borderColor:null,tickColor:null,labelMargin:5,axisMargin:8,borderWidth:2,minBorderMargin:null,markings:null,markingsColor:"#f4f4f4",markingsLineWidth:2,clickable:false,hoverable:false,autoHighlight:true,mouseActiveRadius:10},hooks:{}},az=null,ad=null,y=null,H=null,A=null,p=[],aw=[],q={left:0,right:0,top:0,bottom:0},G=0,I=0,h=0,w=0,ak={processOptions:[],processRawData:[],processDatapoints:[],drawSeries:[],draw:[],bindEvents:[],drawOverlay:[],shutdown:[]},aq=this;aq.setData=aj;aq.setupGrid=t;aq.draw=W;aq.getPlaceholder=function(){return av};aq.getCanvas=function(){return az};aq.getPlotOffset=function(){return q};aq.width=function(){return h};aq.height=function(){return w};aq.offset=function(){var aB=y.offset();aB.left+=q.left;aB.top+=q.top;return aB};aq.getData=function(){return Q};aq.getAxes=function(){var aC={},aB;c.each(p.concat(aw),function(aD,aE){if(aE){aC[aE.direction+(aE.n!=1?aE.n:"")+"axis"]=aE}});return aC};aq.getXAxes=function(){return p};aq.getYAxes=function(){return aw};aq.c2p=C;aq.p2c=ar;aq.getOptions=function(){return O};aq.highlight=x;aq.unhighlight=T;aq.triggerRedrawOverlay=f;aq.pointOffset=function(aB){return{left:parseInt(p[aA(aB,"x")-1].p2c(+aB.x)+q.left),top:parseInt(aw[aA(aB,"y")-1].p2c(+aB.y)+q.top)}};aq.shutdown=ag;aq.resize=function(){B();g(az);g(ad)};aq.hooks=ak;F(aq);Z(J);X();aj(ai);t();W();ah();function an(aD,aB){aB=[aq].concat(aB);for(var aC=0;aC=O.colors.length){aG=0;++aF}}var aH=0,aN;for(aG=0;aGa3.datamax&&a1!=aB){a3.datamax=a1}}c.each(m(),function(a1,a2){a2.datamin=aO;a2.datamax=aI;a2.used=false});for(aU=0;aU0&&aT[aR-aP]!=null&&aT[aR-aP]!=aT[aR]&&aT[aR-aP+1]!=aT[aR+1]){for(aN=0;aNaM){aM=a0}}if(aX.y){if(a0aV){aV=a0}}}}if(aJ.bars.show){var aY=aJ.bars.align=="left"?0:-aJ.bars.barWidth/2;if(aJ.bars.horizontal){aQ+=aY;aV+=aY+aJ.bars.barWidth}else{aK+=aY;aM+=aY+aJ.bars.barWidth}}aF(aJ.xaxis,aK,aM);aF(aJ.yaxis,aQ,aV)}c.each(m(),function(a1,a2){if(a2.datamin==aO){a2.datamin=null}if(a2.datamax==aI){a2.datamax=null}})}function j(aB,aC){var aD=document.createElement("canvas");aD.className=aC;aD.width=G;aD.height=I;if(!aB){c(aD).css({position:"absolute",left:0,top:0})}c(aD).appendTo(av);if(!aD.getContext){aD=window.G_vmlCanvasManager.initElement(aD)}aD.getContext("2d").save();return aD}function B(){G=av.width();I=av.height();if(G<=0||I<=0){throw"Invalid dimensions for plot, width = "+G+", height = "+I}}function g(aC){if(aC.width!=G){aC.width=G}if(aC.height!=I){aC.height=I}var aB=aC.getContext("2d");aB.restore();aB.save()}function X(){var aC,aB=av.children("canvas.base"),aD=av.children("canvas.overlay");if(aB.length==0||aD==0){av.html("");av.css({padding:0});if(av.css("position")=="static"){av.css("position","relative")}B();az=j(true,"base");ad=j(false,"overlay");aC=false}else{az=aB.get(0);ad=aD.get(0);aC=true}H=az.getContext("2d");A=ad.getContext("2d");y=c([ad,az]);if(aC){av.data("plot").shutdown();aq.resize();A.clearRect(0,0,G,I);y.unbind();av.children().not([az,ad]).remove()}av.data("plot",aq)}function ah(){if(O.grid.hoverable){y.mousemove(aa);y.mouseleave(l)}if(O.grid.clickable){y.click(R)}an(ak.bindEvents,[y])}function ag(){if(M){clearTimeout(M)}y.unbind("mousemove",aa);y.unbind("mouseleave",l);y.unbind("click",R);an(ak.shutdown,[y])}function r(aG){function aC(aH){return aH}var aF,aB,aD=aG.options.transform||aC,aE=aG.options.inverseTransform;if(aG.direction=="x"){aF=aG.scale=h/Math.abs(aD(aG.max)-aD(aG.min));aB=Math.min(aD(aG.max),aD(aG.min))}else{aF=aG.scale=w/Math.abs(aD(aG.max)-aD(aG.min));aF=-aF;aB=Math.max(aD(aG.max),aD(aG.min))}if(aD==aC){aG.p2c=function(aH){return(aH-aB)*aF}}else{aG.p2c=function(aH){return(aD(aH)-aB)*aF}}if(!aE){aG.c2p=function(aH){return aB+aH/aF}}else{aG.c2p=function(aH){return aE(aB+aH/aF)}}}function L(aD){var aB=aD.options,aF,aJ=aD.ticks||[],aI=[],aE,aK=aB.labelWidth,aG=aB.labelHeight,aC;function aH(aM,aL){return c('
'+aM.join("")+"
").appendTo(av)}if(aD.direction=="x"){if(aK==null){aK=Math.floor(G/(aJ.length>0?aJ.length:1))}if(aG==null){aI=[];for(aF=0;aF'+aE+"")}}if(aI.length>0){aI.push('
');aC=aH(aI,"width:10000px;");aG=aC.height();aC.remove()}}}else{if(aK==null||aG==null){for(aF=0;aF'+aE+"")}}if(aI.length>0){aC=aH(aI,"");if(aK==null){aK=aC.children().width()}if(aG==null){aG=aC.find("div.tickLabel").height()}aC.remove()}}}if(aK==null){aK=0}if(aG==null){aG=0}aD.labelWidth=aK;aD.labelHeight=aG}function au(aD){var aC=aD.labelWidth,aL=aD.labelHeight,aH=aD.options.position,aF=aD.options.tickLength,aG=O.grid.axisMargin,aJ=O.grid.labelMargin,aK=aD.direction=="x"?p:aw,aE;var aB=c.grep(aK,function(aN){return aN&&aN.options.position==aH&&aN.reserveSpace});if(c.inArray(aD,aB)==aB.length-1){aG=0}if(aF==null){aF="full"}var aI=c.grep(aK,function(aN){return aN&&aN.reserveSpace});var aM=c.inArray(aD,aI)==0;if(!aM&&aF=="full"){aF=5}if(!isNaN(+aF)){aJ+=+aF}if(aD.direction=="x"){aL+=aJ;if(aH=="bottom"){q.bottom+=aL+aG;aD.box={top:I-q.bottom,height:aL}}else{aD.box={top:q.top+aG,height:aL};q.top+=aL+aG}}else{aC+=aJ;if(aH=="left"){aD.box={left:q.left+aG,width:aC};q.left+=aC+aG}else{q.right+=aC+aG;aD.box={left:G-q.right,width:aC}}}aD.position=aH;aD.tickLength=aF;aD.box.padding=aJ;aD.innermost=aM}function U(aB){if(aB.direction=="x"){aB.box.left=q.left;aB.box.width=h}else{aB.box.top=q.top;aB.box.height=w}}function t(){var aC,aE=m();c.each(aE,function(aF,aG){aG.show=aG.options.show;if(aG.show==null){aG.show=aG.used}aG.reserveSpace=aG.show||aG.options.reserveSpace;n(aG)});allocatedAxes=c.grep(aE,function(aF){return aF.reserveSpace});q.left=q.right=q.top=q.bottom=0;if(O.grid.show){c.each(allocatedAxes,function(aF,aG){S(aG);P(aG);ap(aG,aG.ticks);L(aG)});for(aC=allocatedAxes.length-1;aC>=0;--aC){au(allocatedAxes[aC])}var aD=O.grid.minBorderMargin;if(aD==null){aD=0;for(aC=0;aC=0){aD=0}}if(aF.max==null){aB+=aH*aG;if(aB>0&&aE.datamax!=null&&aE.datamax<=0){aB=0}}}}aE.min=aD;aE.max=aB}function S(aG){var aM=aG.options;var aH;if(typeof aM.ticks=="number"&&aM.ticks>0){aH=aM.ticks}else{aH=0.3*Math.sqrt(aG.direction=="x"?G:I)}var aT=(aG.max-aG.min)/aH,aO,aB,aN,aR,aS,aQ,aI;if(aM.mode=="time"){var aJ={second:1000,minute:60*1000,hour:60*60*1000,day:24*60*60*1000,month:30*24*60*60*1000,year:365.2425*24*60*60*1000};var aK=[[1,"second"],[2,"second"],[5,"second"],[10,"second"],[30,"second"],[1,"minute"],[2,"minute"],[5,"minute"],[10,"minute"],[30,"minute"],[1,"hour"],[2,"hour"],[4,"hour"],[8,"hour"],[12,"hour"],[1,"day"],[2,"day"],[3,"day"],[0.25,"month"],[0.5,"month"],[1,"month"],[2,"month"],[3,"month"],[6,"month"],[1,"year"]];var aC=0;if(aM.minTickSize!=null){if(typeof aM.tickSize=="number"){aC=aM.tickSize}else{aC=aM.minTickSize[0]*aJ[aM.minTickSize[1]]}}for(var aS=0;aS=aC){break}}aO=aK[aS][0];aN=aK[aS][1];if(aN=="year"){aQ=Math.pow(10,Math.floor(Math.log(aT/aJ.year)/Math.LN10));aI=(aT/aJ.year)/aQ;if(aI<1.5){aO=1}else{if(aI<3){aO=2}else{if(aI<7.5){aO=5}else{aO=10}}}aO*=aQ}aG.tickSize=aM.tickSize||[aO,aN];aB=function(aX){var a2=[],a0=aX.tickSize[0],a3=aX.tickSize[1],a1=new Date(aX.min);var aW=a0*aJ[a3];if(a3=="second"){a1.setUTCSeconds(a(a1.getUTCSeconds(),a0))}if(a3=="minute"){a1.setUTCMinutes(a(a1.getUTCMinutes(),a0))}if(a3=="hour"){a1.setUTCHours(a(a1.getUTCHours(),a0))}if(a3=="month"){a1.setUTCMonth(a(a1.getUTCMonth(),a0))}if(a3=="year"){a1.setUTCFullYear(a(a1.getUTCFullYear(),a0))}a1.setUTCMilliseconds(0);if(aW>=aJ.minute){a1.setUTCSeconds(0)}if(aW>=aJ.hour){a1.setUTCMinutes(0)}if(aW>=aJ.day){a1.setUTCHours(0)}if(aW>=aJ.day*4){a1.setUTCDate(1)}if(aW>=aJ.year){a1.setUTCMonth(0)}var a5=0,a4=Number.NaN,aY;do{aY=a4;a4=a1.getTime();a2.push(a4);if(a3=="month"){if(a0<1){a1.setUTCDate(1);var aV=a1.getTime();a1.setUTCMonth(a1.getUTCMonth()+1);var aZ=a1.getTime();a1.setTime(a4+a5*aJ.hour+(aZ-aV)*a0);a5=a1.getUTCHours();a1.setUTCHours(0)}else{a1.setUTCMonth(a1.getUTCMonth()+a0)}}else{if(a3=="year"){a1.setUTCFullYear(a1.getUTCFullYear()+a0)}else{a1.setTime(a4+aW)}}}while(a4aU){aP=aU}aQ=Math.pow(10,-aP);aI=aT/aQ;if(aI<1.5){aO=1}else{if(aI<3){aO=2;if(aI>2.25&&(aU==null||aP+1<=aU)){aO=2.5;++aP}}else{if(aI<7.5){aO=5}else{aO=10}}}aO*=aQ;if(aM.minTickSize!=null&&aO0){if(aM.min==null){aG.min=Math.min(aG.min,aL[0])}if(aM.max==null&&aL.length>1){aG.max=Math.max(aG.max,aL[aL.length-1])}}aB=function(aX){var aY=[],aV,aW;for(aW=0;aW1&&/\..*0$/.test((aD[1]-aD[0]).toFixed(aE)))){aG.tickDecimals=aE}}}}aG.tickGenerator=aB;if(c.isFunction(aM.tickFormatter)){aG.tickFormatter=function(aV,aW){return""+aM.tickFormatter(aV,aW)}}else{aG.tickFormatter=aR}}function P(aF){var aH=aF.options.ticks,aG=[];if(aH==null||(typeof aH=="number"&&aH>0)){aG=aF.tickGenerator(aF)}else{if(aH){if(c.isFunction(aH)){aG=aH({min:aF.min,max:aF.max})}else{aG=aH}}}var aE,aB;aF.ticks=[];for(aE=0;aE1){aC=aD[1]}}else{aB=+aD}if(aC==null){aC=aF.tickFormatter(aB,aF)}if(!isNaN(aB)){aF.ticks.push({v:aB,label:aC})}}}function ap(aB,aC){if(aB.options.autoscaleMargin&&aC.length>0){if(aB.options.min==null){aB.min=Math.min(aB.min,aC[0].v)}if(aB.options.max==null&&aC.length>1){aB.max=Math.max(aB.max,aC[aC.length-1].v)}}}function W(){H.clearRect(0,0,G,I);var aC=O.grid;if(aC.show&&aC.backgroundColor){N()}if(aC.show&&!aC.aboveData){ac()}for(var aB=0;aBaG){var aC=aH;aH=aG;aG=aC}return{from:aH,to:aG,axis:aE}}function N(){H.save();H.translate(q.left,q.top);H.fillStyle=am(O.grid.backgroundColor,w,0,"rgba(255, 255, 255, 0)");H.fillRect(0,0,h,w);H.restore()}function ac(){var aF;H.save();H.translate(q.left,q.top);var aH=O.grid.markings;if(aH){if(c.isFunction(aH)){var aK=aq.getAxes();aK.xmin=aK.xaxis.min;aK.xmax=aK.xaxis.max;aK.ymin=aK.yaxis.min;aK.ymax=aK.yaxis.max;aH=aH(aK)}for(aF=0;aFaC.axis.max||aI.toaI.axis.max){continue}aC.from=Math.max(aC.from,aC.axis.min);aC.to=Math.min(aC.to,aC.axis.max);aI.from=Math.max(aI.from,aI.axis.min);aI.to=Math.min(aI.to,aI.axis.max);if(aC.from==aC.to&&aI.from==aI.to){continue}aC.from=aC.axis.p2c(aC.from);aC.to=aC.axis.p2c(aC.to);aI.from=aI.axis.p2c(aI.from);aI.to=aI.axis.p2c(aI.to);if(aC.from==aC.to||aI.from==aI.to){H.beginPath();H.strokeStyle=aD.color||O.grid.markingsColor;H.lineWidth=aD.lineWidth||O.grid.markingsLineWidth;H.moveTo(aC.from,aI.from);H.lineTo(aC.to,aI.to);H.stroke()}else{H.fillStyle=aD.color||O.grid.markingsColor;H.fillRect(aC.from,aI.to,aC.to-aC.from,aI.from-aI.to)}}}var aK=m(),aM=O.grid.borderWidth;for(var aE=0;aEaB.max||(aQ=="full"&&aM>0&&(aO==aB.min||aO==aB.max))){continue}if(aB.direction=="x"){aN=aB.p2c(aO);aJ=aQ=="full"?-w:aQ;if(aB.position=="top"){aJ=-aJ}}else{aL=aB.p2c(aO);aP=aQ=="full"?-h:aQ;if(aB.position=="left"){aP=-aP}}if(H.lineWidth==1){if(aB.direction=="x"){aN=Math.floor(aN)+0.5}else{aL=Math.floor(aL)+0.5}}H.moveTo(aN,aL);H.lineTo(aN+aP,aL+aJ)}H.stroke()}if(aM){H.lineWidth=aM;H.strokeStyle=O.grid.borderColor;H.strokeRect(-aM/2,-aM/2,h+aM,w+aM)}H.restore()}function k(){av.find(".tickLabels").remove();var aG=['
'];var aJ=m();for(var aD=0;aD');for(var aE=0;aEaC.max){continue}var aK={},aI;if(aC.direction=="x"){aI="center";aK.left=Math.round(q.left+aC.p2c(aH.v)-aC.labelWidth/2);if(aC.position=="bottom"){aK.top=aF.top+aF.padding}else{aK.bottom=I-(aF.top+aF.height-aF.padding)}}else{aK.top=Math.round(q.top+aC.p2c(aH.v)-aC.labelHeight/2);if(aC.position=="left"){aK.right=G-(aF.left+aF.width-aF.padding);aI="right"}else{aK.left=aF.left+aF.padding;aI="left"}}aK.width=aC.labelWidth;var aB=["position:absolute","text-align:"+aI];for(var aL in aK){aB.push(aL+":"+aK[aL]+"px")}aG.push('
'+aH.label+"
")}aG.push("
")}aG.push("");av.append(aG.join(""))}function d(aB){if(aB.lines.show){at(aB)}if(aB.bars.show){e(aB)}if(aB.points.show){ao(aB)}}function at(aE){function aD(aP,aQ,aI,aU,aT){var aV=aP.points,aJ=aP.pointsize,aN=null,aM=null;H.beginPath();for(var aO=aJ;aO=aR&&aS>aT.max){if(aR>aT.max){continue}aL=(aT.max-aS)/(aR-aS)*(aK-aL)+aL;aS=aT.max}else{if(aR>=aS&&aR>aT.max){if(aS>aT.max){continue}aK=(aT.max-aS)/(aR-aS)*(aK-aL)+aL;aR=aT.max}}if(aL<=aK&&aL=aK&&aL>aU.max){if(aK>aU.max){continue}aS=(aU.max-aL)/(aK-aL)*(aR-aS)+aS;aL=aU.max}else{if(aK>=aL&&aK>aU.max){if(aL>aU.max){continue}aR=(aU.max-aL)/(aK-aL)*(aR-aS)+aS;aK=aU.max}}if(aL!=aN||aS!=aM){H.moveTo(aU.p2c(aL)+aQ,aT.p2c(aS)+aI)}aN=aK;aM=aR;H.lineTo(aU.p2c(aK)+aQ,aT.p2c(aR)+aI)}H.stroke()}function aF(aI,aQ,aP){var aW=aI.points,aV=aI.pointsize,aN=Math.min(Math.max(0,aP.min),aP.max),aX=0,aU,aT=false,aM=1,aL=0,aR=0;while(true){if(aV>0&&aX>aW.length+aV){break}aX+=aV;var aZ=aW[aX-aV],aK=aW[aX-aV+aM],aY=aW[aX],aJ=aW[aX+aM];if(aT){if(aV>0&&aZ!=null&&aY==null){aR=aX;aV=-aV;aM=2;continue}if(aV<0&&aX==aL+aV){H.fill();aT=false;aV=-aV;aM=1;aX=aL=aR+aV;continue}}if(aZ==null||aY==null){continue}if(aZ<=aY&&aZ=aY&&aZ>aQ.max){if(aY>aQ.max){continue}aK=(aQ.max-aZ)/(aY-aZ)*(aJ-aK)+aK;aZ=aQ.max}else{if(aY>=aZ&&aY>aQ.max){if(aZ>aQ.max){continue}aJ=(aQ.max-aZ)/(aY-aZ)*(aJ-aK)+aK;aY=aQ.max}}if(!aT){H.beginPath();H.moveTo(aQ.p2c(aZ),aP.p2c(aN));aT=true}if(aK>=aP.max&&aJ>=aP.max){H.lineTo(aQ.p2c(aZ),aP.p2c(aP.max));H.lineTo(aQ.p2c(aY),aP.p2c(aP.max));continue}else{if(aK<=aP.min&&aJ<=aP.min){H.lineTo(aQ.p2c(aZ),aP.p2c(aP.min));H.lineTo(aQ.p2c(aY),aP.p2c(aP.min));continue}}var aO=aZ,aS=aY;if(aK<=aJ&&aK=aP.min){aZ=(aP.min-aK)/(aJ-aK)*(aY-aZ)+aZ;aK=aP.min}else{if(aJ<=aK&&aJ=aP.min){aY=(aP.min-aK)/(aJ-aK)*(aY-aZ)+aZ;aJ=aP.min}}if(aK>=aJ&&aK>aP.max&&aJ<=aP.max){aZ=(aP.max-aK)/(aJ-aK)*(aY-aZ)+aZ;aK=aP.max}else{if(aJ>=aK&&aJ>aP.max&&aK<=aP.max){aY=(aP.max-aK)/(aJ-aK)*(aY-aZ)+aZ;aJ=aP.max}}if(aZ!=aO){H.lineTo(aQ.p2c(aO),aP.p2c(aK))}H.lineTo(aQ.p2c(aZ),aP.p2c(aK));H.lineTo(aQ.p2c(aY),aP.p2c(aJ));if(aY!=aS){H.lineTo(aQ.p2c(aY),aP.p2c(aJ));H.lineTo(aQ.p2c(aS),aP.p2c(aJ))}}}H.save();H.translate(q.left,q.top);H.lineJoin="round";var aG=aE.lines.lineWidth,aB=aE.shadowSize;if(aG>0&&aB>0){H.lineWidth=aB;H.strokeStyle="rgba(0,0,0,0.1)";var aH=Math.PI/18;aD(aE.datapoints,Math.sin(aH)*(aG/2+aB/2),Math.cos(aH)*(aG/2+aB/2),aE.xaxis,aE.yaxis);H.lineWidth=aB/2;aD(aE.datapoints,Math.sin(aH)*(aG/2+aB/4),Math.cos(aH)*(aG/2+aB/4),aE.xaxis,aE.yaxis)}H.lineWidth=aG;H.strokeStyle=aE.color;var aC=ae(aE.lines,aE.color,0,w);if(aC){H.fillStyle=aC;aF(aE.datapoints,aE.xaxis,aE.yaxis)}if(aG>0){aD(aE.datapoints,0,0,aE.xaxis,aE.yaxis)}H.restore()}function ao(aE){function aH(aN,aM,aU,aK,aS,aT,aQ,aJ){var aR=aN.points,aI=aN.pointsize;for(var aL=0;aLaT.max||aOaQ.max){continue}H.beginPath();aP=aT.p2c(aP);aO=aQ.p2c(aO)+aK;if(aJ=="circle"){H.arc(aP,aO,aM,0,aS?Math.PI:Math.PI*2,false)}else{aJ(H,aP,aO,aM,aS)}H.closePath();if(aU){H.fillStyle=aU;H.fill()}H.stroke()}}H.save();H.translate(q.left,q.top);var aG=aE.points.lineWidth,aC=aE.shadowSize,aB=aE.points.radius,aF=aE.points.symbol;if(aG>0&&aC>0){var aD=aC/2;H.lineWidth=aD;H.strokeStyle="rgba(0,0,0,0.1)";aH(aE.datapoints,aB,null,aD+aD/2,true,aE.xaxis,aE.yaxis,aF);H.strokeStyle="rgba(0,0,0,0.2)";aH(aE.datapoints,aB,null,aD/2,true,aE.xaxis,aE.yaxis,aF)}H.lineWidth=aG;H.strokeStyle=aE.color;aH(aE.datapoints,aB,ae(aE.points,aE.color),0,false,aE.xaxis,aE.yaxis,aF);H.restore()}function E(aN,aM,aV,aI,aQ,aF,aD,aL,aK,aU,aR,aC){var aE,aT,aJ,aP,aG,aB,aO,aH,aS;if(aR){aH=aB=aO=true;aG=false;aE=aV;aT=aN;aP=aM+aI;aJ=aM+aQ;if(aTaL.max||aPaK.max){return}if(aEaL.max){aT=aL.max;aB=false}if(aJaK.max){aP=aK.max;aO=false}aE=aL.p2c(aE);aJ=aK.p2c(aJ);aT=aL.p2c(aT);aP=aK.p2c(aP);if(aD){aU.beginPath();aU.moveTo(aE,aJ);aU.lineTo(aE,aP);aU.lineTo(aT,aP);aU.lineTo(aT,aJ);aU.fillStyle=aD(aJ,aP);aU.fill()}if(aC>0&&(aG||aB||aO||aH)){aU.beginPath();aU.moveTo(aE,aJ+aF);if(aG){aU.lineTo(aE,aP+aF)}else{aU.moveTo(aE,aP+aF)}if(aO){aU.lineTo(aT,aP+aF)}else{aU.moveTo(aT,aP+aF)}if(aB){aU.lineTo(aT,aJ+aF)}else{aU.moveTo(aT,aJ+aF)}if(aH){aU.lineTo(aE,aJ+aF)}else{aU.moveTo(aE,aJ+aF)}aU.stroke()}}function e(aD){function aC(aJ,aI,aL,aG,aK,aN,aM){var aO=aJ.points,aF=aJ.pointsize;for(var aH=0;aH")}aH.push("");aF=true}if(aN){aJ=aN(aJ,aM)}aH.push('
'+aJ+"")}if(aF){aH.push("")}if(aH.length==0){return}var aL=''+aH.join("")+"
";if(O.legend.container!=null){c(O.legend.container).html(aL)}else{var aI="",aC=O.legend.position,aD=O.legend.margin;if(aD[0]==null){aD=[aD,aD]}if(aC.charAt(0)=="n"){aI+="top:"+(aD[1]+q.top)+"px;"}else{if(aC.charAt(0)=="s"){aI+="bottom:"+(aD[1]+q.bottom)+"px;"}}if(aC.charAt(1)=="e"){aI+="right:"+(aD[0]+q.right)+"px;"}else{if(aC.charAt(1)=="w"){aI+="left:"+(aD[0]+q.left)+"px;"}}var aK=c('
'+aL.replace('style="','style="position:absolute;'+aI+";")+"
").appendTo(av);if(O.legend.backgroundOpacity!=0){var aG=O.legend.backgroundColor;if(aG==null){aG=O.grid.backgroundColor;if(aG&&typeof aG=="string"){aG=c.color.parse(aG)}else{aG=c.color.extract(aK,"background-color")}aG.a=1;aG=aG.toString()}var aB=aK.children();c('
').prependTo(aK).css("opacity",O.legend.backgroundOpacity)}}}var ab=[],M=null;function K(aI,aG,aD){var aO=O.grid.mouseActiveRadius,a0=aO*aO+1,aY=null,aR=false,aW,aU;for(aW=Q.length-1;aW>=0;--aW){if(!aD(Q[aW])){continue}var aP=Q[aW],aH=aP.xaxis,aF=aP.yaxis,aV=aP.datapoints.points,aT=aP.datapoints.pointsize,aQ=aH.c2p(aI),aN=aF.c2p(aG),aC=aO/aH.scale,aB=aO/aF.scale;if(aH.options.inverseTransform){aC=Number.MAX_VALUE}if(aF.options.inverseTransform){aB=Number.MAX_VALUE}if(aP.lines.show||aP.points.show){for(aU=0;aUaC||aK-aQ<-aC||aJ-aN>aB||aJ-aN<-aB){continue}var aM=Math.abs(aH.p2c(aK)-aI),aL=Math.abs(aF.p2c(aJ)-aG),aS=aM*aM+aL*aL;if(aS=Math.min(aZ,aK)&&aN>=aJ+aE&&aN<=aJ+aX):(aQ>=aK+aE&&aQ<=aK+aX&&aN>=Math.min(aZ,aJ)&&aN<=Math.max(aZ,aJ))){aY=[aW,aU/aT]}}}}if(aY){aW=aY[0];aU=aY[1];aT=Q[aW].datapoints.pointsize;return{datapoint:Q[aW].datapoints.points.slice(aU*aT,(aU+1)*aT),dataIndex:aU,series:Q[aW],seriesIndex:aW}}return null}function aa(aB){if(O.grid.hoverable){u("plothover",aB,function(aC){return aC.hoverable!=false})}}function l(aB){if(O.grid.hoverable){u("plothover",aB,function(aC){return false})}}function R(aB){u("plotclick",aB,function(aC){return aC.clickable!=false})}function u(aC,aB,aD){var aE=y.offset(),aH=aB.pageX-aE.left-q.left,aF=aB.pageY-aE.top-q.top,aJ=C({left:aH,top:aF});aJ.pageX=aB.pageX;aJ.pageY=aB.pageY;var aK=K(aH,aF,aD);if(aK){aK.pageX=parseInt(aK.series.xaxis.p2c(aK.datapoint[0])+aE.left+q.left);aK.pageY=parseInt(aK.series.yaxis.p2c(aK.datapoint[1])+aE.top+q.top)}if(O.grid.autoHighlight){for(var aG=0;aGaH.max||aIaG.max){return}var aF=aE.points.radius+aE.points.lineWidth/2;A.lineWidth=aF;A.strokeStyle=c.color.parse(aE.color).scale("a",0.5).toString();var aB=1.5*aF,aC=aH.p2c(aC),aI=aG.p2c(aI);A.beginPath();if(aE.points.symbol=="circle"){A.arc(aC,aI,aB,0,2*Math.PI,false)}else{aE.points.symbol(A,aC,aI,aB,false)}A.closePath();A.stroke()}function v(aE,aB){A.lineWidth=aE.bars.lineWidth;A.strokeStyle=c.color.parse(aE.color).scale("a",0.5).toString();var aD=c.color.parse(aE.color).scale("a",0.5).toString();var aC=aE.bars.align=="left"?0:-aE.bars.barWidth/2;E(aB[0],aB[1],aB[2]||0,aC,aC+aE.bars.barWidth,0,function(){return aD},aE.xaxis,aE.yaxis,A,aE.bars.horizontal,aE.bars.lineWidth)}function am(aJ,aB,aH,aC){if(typeof aJ=="string"){return aJ}else{var aI=H.createLinearGradient(0,aH,0,aB);for(var aE=0,aD=aJ.colors.length;aE12){n=n-12}else{if(n==0){n=12}}}for(var g=0;g>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return h.rotl(a,8)&16711935|h.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,d=0;c>>5]|=a[c]<<24- d%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-g)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return f.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,d=0;c>> 6-d*2);return b}};e=e.charenc={};e.UTF8={stringToBytes:function(a){return f.stringToBytes(unescape(encodeURIComponent(a)))},bytesToString:function(a){return decodeURIComponent(escape(f.bytesToString(a)))}};var f=e.Binary={stringToBytes:function(a){for(var b=[],c=0;c>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return m.rotl(a,8)&16711935|m.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,f=0;c>>5]|=a[c]<<24- f%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-d)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return n.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,f=0;c>> From 79403adfa041853ed24c0d6aeb3edc0ad9962b5e Mon Sep 17 00:00:00 2001 From: Ger Hobbelt Date: Tue, 25 Dec 2012 00:57:01 +0100 Subject: [PATCH 04/48] whitespace police raid: CRLF/TAB=4/DETAB --- benchmark.html | 252 +- benchmark2.html | 28 +- demo.html | 10 +- documentation.html | 140 +- index.php | 4 +- resources/style-ie.css | 158 +- resources/style.css | 64 +- src/documentation.html | 140 +- src/numeric.js | 86 +- src/seedrandom.js | 12 +- src/svd.js | 592 +- src/uniroot.js | 12 +- tools/README.md | 2 +- tools/XMLHttpRequest.js | 364 +- tools/build.sh | 12 +- tools/deploy/clean.sh | 2 +- tools/deploy/deploy.sh | 2 +- tools/jquery-1.7.1.js | 16912 +++++++++++++++++------------------ tools/jquery.flot.image.js | 32 +- tools/jquery.flot.js | 324 +- tools/mytest.html | 2 +- tools/unit2.js | 12 +- tools/workshop.html | 370 +- tools/workshop_in.php | 50 +- workshop.php | 420 +- 25 files changed, 10001 insertions(+), 10001 deletions(-) diff --git a/benchmark.html b/benchmark.html index 324f3bf..1cf6523 100644 --- a/benchmark.html +++ b/benchmark.html @@ -48,59 +48,59 @@ var mkA = function(n) { return numeric.random([n,n]); }; var mkV = function(n) { return numeric.random([n]); }; var benchmarks = [ - [ - 'abs(vector)', [3,10,30,100,300,1000,3000], - function(n) { var V = mkV(n); return bench(function() { numeric.abs(V); }); }, - function(n) { var V = new goog.math.Matrix([mkV(n)]); return bench(function() { V.toArray().map(Math.abs); }); }, - function(n) { var V = $V(mkV(n)); return bench(function() { V.map(Math.abs); }); } - ], - [ - 'Create identity', [3,10,30,100,300,1000], - function(n) { return bench(function() { numeric.identity(n); }); }, - function(n) { return bench(function() { goog.math.Matrix.createIdentityMatrix(n); }); }, - function(n) { return bench(function() { Matrix.I(n); }); } - ], - [ - 'Matrix transpose', [3,10,30,100,300,1000], - function(n) { var A = mkA(n); return bench(function() { numeric.transpose(A); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.getTranspose(); }); }, - function(n) { var A = $M(mkA(n)); return bench(function() { A.transpose(); }); } - ], - [ - 'Matrix-Vector product', [3,10,30,100,300,1000], - function(n) { var A = mkA(n), V = mkV(n); return bench(function() { numeric.dot(A,V); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)), V = new goog.math.Matrix([mkV(n)]).getTranspose(); return bench(function() { A.multiply(V); }); }, - function(n) { var A = $M(mkA(n)), V = $V(mkV(n)); return bench(function() { A.multiply(V); }); } - ], - [ - 'Vector-Matrix product', [3,10,30,100,300,1000], - function(n) { var A = mkA(n), V = mkV(n); return bench(function() { numeric.dot(V,A); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)), V = new goog.math.Matrix([mkV(n)]); return bench(function() { V.multiply(A); }); }, - function(n) { var A = $M(mkA(n)), V = $V(mkV(n)); return bench(function() { A.transpose().multiply(V); }); } - ], - ['Ax+b', [3,10,30,100,300,1000], - function(n) { var A = mkA(n), x = mkV(n), b = mkV(n); return bench(function() { numeric.addeq(numeric.dot(A,x),b); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)), x = new goog.math.Matrix([mkV(n)]).getTranspose(), b = new goog.math.Matrix([mkV(n)]).getTranspose(); return bench(function() { A.multiply(x).add(b); }); }, - function(n) { var A = $M(mkA(n)), x = $V(mkV(n)), b = $V(mkV(n)); return bench(function() { A.multiply(x).add(b); }); } - ], - [ - 'Matrix-Matrix product', [3,5,10,20,30,50,75,100], - function(n) { var A = mkA(n), B = mkA(n); return bench(function() { numeric.dot(A,B); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)), B = new goog.math.Matrix(mkA(n)); return bench(function() { A.multiply(B); }); }, - function(n) { var A = $M(mkA(n)), B = $M(mkA(n)); return bench(function() { A.multiply(B); }); } - ], - [ - 'Matrix-Matrix sum', [3,5,10,20,30,50,75,100], - function(n) { var A = mkA(n); return bench(function() { numeric.add(A,A); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.add(A); }); }, - function(n) { var A = $M(mkA(n)); return bench(function() { A.add(A); }); } - ], - [ - 'Matrix inverse', [3,5,10,20,30,50,75,100], - function(n) { var A = mkA(n); return bench(function() { numeric.inv(A); }); }, - function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.getInverse(); }); }, - function(n) { var A = $M(mkA(n)); return bench(function() { A.inv(); }); } - ], + [ + 'abs(vector)', [3,10,30,100,300,1000,3000], + function(n) { var V = mkV(n); return bench(function() { numeric.abs(V); }); }, + function(n) { var V = new goog.math.Matrix([mkV(n)]); return bench(function() { V.toArray().map(Math.abs); }); }, + function(n) { var V = $V(mkV(n)); return bench(function() { V.map(Math.abs); }); } + ], + [ + 'Create identity', [3,10,30,100,300,1000], + function(n) { return bench(function() { numeric.identity(n); }); }, + function(n) { return bench(function() { goog.math.Matrix.createIdentityMatrix(n); }); }, + function(n) { return bench(function() { Matrix.I(n); }); } + ], + [ + 'Matrix transpose', [3,10,30,100,300,1000], + function(n) { var A = mkA(n); return bench(function() { numeric.transpose(A); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.getTranspose(); }); }, + function(n) { var A = $M(mkA(n)); return bench(function() { A.transpose(); }); } + ], + [ + 'Matrix-Vector product', [3,10,30,100,300,1000], + function(n) { var A = mkA(n), V = mkV(n); return bench(function() { numeric.dot(A,V); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)), V = new goog.math.Matrix([mkV(n)]).getTranspose(); return bench(function() { A.multiply(V); }); }, + function(n) { var A = $M(mkA(n)), V = $V(mkV(n)); return bench(function() { A.multiply(V); }); } + ], + [ + 'Vector-Matrix product', [3,10,30,100,300,1000], + function(n) { var A = mkA(n), V = mkV(n); return bench(function() { numeric.dot(V,A); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)), V = new goog.math.Matrix([mkV(n)]); return bench(function() { V.multiply(A); }); }, + function(n) { var A = $M(mkA(n)), V = $V(mkV(n)); return bench(function() { A.transpose().multiply(V); }); } + ], + ['Ax+b', [3,10,30,100,300,1000], + function(n) { var A = mkA(n), x = mkV(n), b = mkV(n); return bench(function() { numeric.addeq(numeric.dot(A,x),b); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)), x = new goog.math.Matrix([mkV(n)]).getTranspose(), b = new goog.math.Matrix([mkV(n)]).getTranspose(); return bench(function() { A.multiply(x).add(b); }); }, + function(n) { var A = $M(mkA(n)), x = $V(mkV(n)), b = $V(mkV(n)); return bench(function() { A.multiply(x).add(b); }); } + ], + [ + 'Matrix-Matrix product', [3,5,10,20,30,50,75,100], + function(n) { var A = mkA(n), B = mkA(n); return bench(function() { numeric.dot(A,B); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)), B = new goog.math.Matrix(mkA(n)); return bench(function() { A.multiply(B); }); }, + function(n) { var A = $M(mkA(n)), B = $M(mkA(n)); return bench(function() { A.multiply(B); }); } + ], + [ + 'Matrix-Matrix sum', [3,5,10,20,30,50,75,100], + function(n) { var A = mkA(n); return bench(function() { numeric.add(A,A); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.add(A); }); }, + function(n) { var A = $M(mkA(n)); return bench(function() { A.add(A); }); } + ], + [ + 'Matrix inverse', [3,5,10,20,30,50,75,100], + function(n) { var A = mkA(n); return bench(function() { numeric.inv(A); }); }, + function(n) { var A = new goog.math.Matrix(mkA(n)); return bench(function() { A.getInverse(); }); }, + function(n) { var A = $M(mkA(n)); return bench(function() { A.inv(); }); } + ], [ 'Sparse Laplacian LU', [5,10,20,30], function(n) { var A = numeric.ccsScatter(numeric.cdelsq(numeric.cgrid(n))); return bench(function() { numeric.ccsLUP(A); }); }, @@ -122,23 +122,23 @@ var datasets = []; var l; var colors = ["#000","#00f","#0f0","#f80","#f0f","#0ff"]; -for(l=0;l0 && c0[lib][rep-1] < 10) { c0[lib][rep] = c0[lib][rep-1]; } - else { foo = benchmarks[b][lib+2]; if(k===0) foo(sz); c0[lib][rep] = foo(sz); } - rep++; - if(rep === 1) { rep = 0; lib++; } - if(lib+2 === benchmarks[b].length) { - k++; - lib=0; - var cps = []; - var mi = 1e6/Math.pow(benchmarks[b][1][k-1],pwr[b]); - for(i=0;i'; - var color = '', uncolor=''; - for(i=0;i'; - } - if(!MSIE) { - var t = document.getElementById('bench'); - var r = t.insertRow(-1); - if(k === 1) { - r.innerHTML = (''+benchmarks[b][0]+'' - +'Numeric' - +'Google Closure' - +'Sylvester'); - r = t.insertRow(-1); - } - r.innerHTML = foo; - } - $.plot($("#placeholder"), datasets, - { - legend: {container: '#legend'}, - xaxis: {ticks:xticks, tickLength:0, min:1, max: l-1}, - yaxis: {ticks:20} - }); - c0 = [[],[],[]]; - count++; - } - if(k === benchmarks[b][1].length) { - for(i=0;i0 && c0[lib][rep-1] < 10) { c0[lib][rep] = c0[lib][rep-1]; } + else { foo = benchmarks[b][lib+2]; if(k===0) foo(sz); c0[lib][rep] = foo(sz); } + rep++; + if(rep === 1) { rep = 0; lib++; } + if(lib+2 === benchmarks[b].length) { + k++; + lib=0; + var cps = []; + var mi = 1e6/Math.pow(benchmarks[b][1][k-1],pwr[b]); + for(i=0;i'; + var color = '', uncolor=''; + for(i=0;i'; + } + if(!MSIE) { + var t = document.getElementById('bench'); + var r = t.insertRow(-1); + if(k === 1) { + r.innerHTML = (''+benchmarks[b][0]+'' + +'Numeric' + +'Google Closure' + +'Sylvester'); + r = t.insertRow(-1); + } + r.innerHTML = foo; + } + $.plot($("#placeholder"), datasets, + { + legend: {container: '#legend'}, + xaxis: {ticks:xticks, tickLength:0, min:1, max: l-1}, + yaxis: {ticks:20} + }); + c0 = [[],[],[]]; + count++; + } + if(k === benchmarks[b][1].length) { + for(i=0;i'+benchmarks[b][0]+'' +'Numeric' +'Google Closure' +'Sylvester'); - r = t.insertRow(-1); + r = t.insertRow(-1); } r.innerHTML = foo; } - $.plot($("#placeholder"), datasets, - { - legend: {container: '#legend'}, + $.plot($("#placeholder"), datasets, + { + legend: {container: '#legend'}, xaxis: {ticks:xticks, tickLength:0, min:1, max: l-1}, yaxis: {ticks:20} }); @@ -171,12 +171,12 @@ for(i=0;i Numeric Javascript
  • DOWNLOADS:
    • @@ -60,7 +60,7 @@

    Performance

    Although Javascript does not reach the same performance as native programs, the Numeric Javascript library is carefully tuned to obtain the best possible performance for a Javascript program. You can compare the performance of Numeric, Sylvester and -Google Closure's +Google Closure's Matrix object using our Benchmark. diff --git a/documentation.html b/documentation.html index e943dc5..35f2bce 100644 --- a/documentation.html +++ b/documentation.html @@ -244,7 +244,7 @@

    Numerical analysis in Javascript

     IN> numeric.identity(100)
 OUT> ...Large Array...
-
    + By default, this happens with the Array's length is more than 50. This can be controlled by setting the variable numeric.largeArray to an appropriate value: 
    @@ -739,7 +739,7 @@ 
    Singular value decomposition (Shanti Rao)
    
        [  2, -6,  6,  5,  1],
        [  4,  5,  0, -2,  2]];
     numeric.svd(A);
-OUT> {U: 
+OUT> {U:
 [[    -0.7071,    -0.1581,     0.1768,     0.2494,     0.4625],
  [    -0.5303,    -0.1581,    -0.3536,     0.1556,    -0.4984],
  [    -0.1768,     0.7906,    -0.1768,    -0.1546,     0.3967],
@@ -748,9 +748,9 @@ 
    Singular value decomposition (Shanti Rao)
    
  [    -0.1768,    -0.1581,     0.5303,    -0.5726,   -0.05555],
  [ -7.109e-18,    -0.4743,    -0.1768,    -0.3142,     0.4959],
  [    -0.1768,     0.1581,  1.915e-15,     -0.592,    -0.2791]],
-S: 
+S:
 [      35.33,         20,       19.6,          0,          0],
-V: 
+V:
 [[    -0.8006,    -0.3162,     0.2887,    -0.4191,          0],
  [    -0.4804,     0.6325,  7.768e-15,     0.4405,     0.4185],
  [    -0.1601,    -0.3162,     -0.866,     -0.052,     0.3488],
@@ -780,17 +780,17 @@ 
    Singular value decomposition (Shanti Rao)
    
 IN> m = 59; n = 42; A = numeric.random([m,n]); B = numeric.svd(A); U = new numeric.T(B.U); V = new numeric.T(B.V); !(U.dot(numeric.T.diag(B.S)).dot(V.transpose()).sub(A).norm2()>1e-12)
 OUT> true
 IN> numeric.eig([[1, 0, 0], [0, 0.7181, -0.6960], [0, 0.6960, 0.7181]]) // This was a bug found by bdmartin
-OUT> {lambda: 
-{x: 
+OUT> {lambda:
+{x:
 [          1,     0.7181,     0.7181],
-y: 
+y:
 [          0,      0.696,     -0.696]},
-E: 
-{x: 
+E:
+{x:
 [[          1,          0,          0],
  [          0,          0,     0.7071],
  [          0,    -0.7071,          0]],
-y: 
+y:
 [[          0,          0,          0],
  [          0,    -0.7071,          0],
  [          0,          0,     0.7071]]}}
@@ -887,8 +887,8 @@ 
    Sparse linear algebra
    
       foo = numeric.ccsFull(numeric.ccsDot(LUP.L,LUP.U));
       PA = numeric.ccsFull(numeric.ccsGetBlock(A,LUP.P));
       res = numeric.norminf(numeric.sub(foo,PA));
-      if(!isFinite(res) || res>1e-6) { 
-        result = { 
+      if(!isFinite(res) || res>1e-6) {
+        result = {
           code: "Failed during 1000 sparse LUP",
           k:k,A:A,LUP:LUP,res:res
         };
@@ -948,19 +948,19 @@ 
    Solving PDEs
    
 
 
     IN> g = numeric.cgrid(5)
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1],
  [-1, 0, 1, 2,-1],
  [-1, 3, 4, 5,-1],
  [-1, 6, 7, 8,-1],
  [-1,-1,-1,-1,-1]]
 IN> coordL = numeric.cdelsq(g)
-OUT> 
+OUT>
 [[ 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8],
  [ 1, 3, 0, 0, 2, 4, 1, 1, 5, 2, 0, 4, 6, 3, 1, 3, 5, 7, 4, 2, 4, 8, 5, 3, 7, 6, 4, 6, 8, 7, 5, 7, 8],
  [-1,-1, 4,-1,-1,-1, 4,-1,-1, 4,-1,-1,-1, 4,-1,-1,-1,-1, 4,-1,-1,-1, 4,-1,-1, 4,-1,-1,-1, 4,-1,-1, 4]]
 IN> L = numeric.sscatter(coordL); // Just to see what it looks like
-OUT> 
+OUT>
 [[          4,         -1,           ,         -1],
  [         -1,          4,         -1,           ,         -1],
  [           ,         -1,          4,           ,           ,         -1],
@@ -975,21 +975,21 @@ 
    Solving PDEs
    
 IN> numeric.cdotMV(coordL,x)
 OUT> [1,1,1,1,1,1,1,1,1]
 IN> G = numeric.rep([5,5],0); for(i=0;i<5;i++) for(j=0;j<5;j++) if(g[i][j]>=0) G[i][j] = x[g[i][j]]; G
-OUT> 
+OUT>
 [[ 0     , 0     , 0     , 0     , 0     ],
  [ 0     , 0.6875, 0.875 , 0.6875, 0     ],
  [ 0     , 0.875 , 1.125 , 0.875 , 0     ],
  [ 0     , 0.6875, 0.875 , 0.6875, 0     ],
  [ 0     , 0     , 0     , 0     , 0     ]]
 IN> workshop.html('<img src="'+numeric.imageURL(numeric.mul([G,G,G],200))+'" width=100 />');
-OUT> 
+OUT>
 
 
    
 
 You can also work on an L-shaped or arbitrary-shape domain:
 
     IN> numeric.cgrid(6,'L')
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1,-1],
  [-1, 0, 1,-1,-1,-1],
  [-1, 2, 3,-1,-1,-1],
@@ -997,7 +997,7 @@ 
    Solving PDEs
    
  [-1, 8, 9,10,11,-1],
  [-1,-1,-1,-1,-1,-1]]
 IN> numeric.cgrid(5,function(i,j) { return i!==2 || j!==2; })
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1],
  [-1, 0, 1, 2,-1],
  [-1, 3,-1, 4,-1],
@@ -1079,84 +1079,84 @@ 
    Unconstrained optimization
    
 Here are some demos from from Moré et al., 1981:
 
 
    -IN> sqr = function(x) { return x*x; }; 
+IN> sqr = function(x) { return x*x; };
     numeric.uncmin(function(x) { return sqr(10*(x[1]-x[0]*x[0])) + sqr(1-x[0]); },[-1.2,1]).solution
 OUT> [1,1]
-IN> f = function(x) { return sqr(-13+x[0]+((5-x[1])*x[1]-2)*x[1])+sqr(-29+x[0]+((x[1]+1)*x[1]-14)*x[1]); }; 
+IN> f = function(x) { return sqr(-13+x[0]+((5-x[1])*x[1]-2)*x[1])+sqr(-29+x[0]+((x[1]+1)*x[1]-14)*x[1]); };
     x0 = numeric.uncmin(f,[0.5,-2]).solution
 OUT> [11.41,-0.8968]
-IN> f = function(x) { return sqr(1e4*x[0]*x[1]-1)+sqr(Math.exp(-x[0])+Math.exp(-x[1])-1.0001); }; 
+IN> f = function(x) { return sqr(1e4*x[0]*x[1]-1)+sqr(Math.exp(-x[0])+Math.exp(-x[1])-1.0001); };
     x0 = numeric.uncmin(f,[0,1]).solution
 OUT> [1.098e-5,9.106]
-IN> f = function(x) { return sqr(x[0]-1e6)+sqr(x[1]-2e-6)+sqr(x[0]*x[1]-2)}; 
+IN> f = function(x) { return sqr(x[0]-1e6)+sqr(x[1]-2e-6)+sqr(x[0]*x[1]-2)};
     x0 = numeric.uncmin(f,[0,1]).solution
 OUT> [1e6,2e-6]
-IN> f = function(x) { 
+IN> f = function(x) {
        return sqr(1.5-x[0]*(1-x[1]))+sqr(2.25-x[0]*(1-x[1]*x[1]))+sqr(2.625-x[0]*(1-x[1]*x[1]*x[1]));
-    }; 
+    };
     x0 = numeric.uncmin(f,[1,1]).solution
 OUT> [3,0.5]
-IN> f = function(x) { 
-        var ret = 0,i; 
+IN> f = function(x) {
+        var ret = 0,i;
         for(i=1;i<=10;i++) ret+=sqr(2+2*i-Math.exp(i*x[0])-Math.exp(i*x[1]));
-         return ret; 
+         return ret;
     };
     x0 = numeric.uncmin(f,[0.3,0.4]).solution
 OUT> [0.2578,0.2578]
-IN> y = [0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39]; 
-    f = function(x) { 
-        var ret = 0,i; 
-        for(i=1;i<=15;i++) ret+=sqr(y[i-1]-(x[0]+i/((16-i)*x[1]+Math.min(i,16-i)*x[2]))); 
-        return ret; 
-    }; 
+IN> y = [0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39];
+    f = function(x) {
+        var ret = 0,i;
+        for(i=1;i<=15;i++) ret+=sqr(y[i-1]-(x[0]+i/((16-i)*x[1]+Math.min(i,16-i)*x[2])));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[1,1,1]).solution
 OUT> [0.08241,1.133,2.344]
-IN> y = [0.0009,0.0044,0.0175,0.0540,0.1295,0.2420,0.3521,0.3989,0.3521,0.2420,0.1295,0.0540,0.0175,0.0044,0.0009]; 
-    f = function(x) { 
-        var ret = 0,i; 
-        for(i=1;i<=15;i++) 
-        ret+=sqr(x[0]*Math.exp(-x[1]*sqr((8-i)/2-x[2])/2)-y[i-1]); 
-        return ret; 
-    }; 
+IN> y = [0.0009,0.0044,0.0175,0.0540,0.1295,0.2420,0.3521,0.3989,0.3521,0.2420,0.1295,0.0540,0.0175,0.0044,0.0009];
+    f = function(x) {
+        var ret = 0,i;
+        for(i=1;i<=15;i++)
+        ret+=sqr(x[0]*Math.exp(-x[1]*sqr((8-i)/2-x[2])/2)-y[i-1]);
+        return ret;
+    };
     x0 = numeric.div(numeric.round(numeric.mul(numeric.uncmin(f,[1,1,1]).solution,1000)),1000)
 OUT> [0.399,1,0]
-IN> f = function(x) { return sqr(x[0]+10*x[1])+5*sqr(x[2]-x[3])+sqr(sqr(x[1]-2*x[2]))+10*sqr(x[0]-x[3]); }; 
+IN> f = function(x) { return sqr(x[0]+10*x[1])+5*sqr(x[2]-x[3])+sqr(sqr(x[1]-2*x[2]))+10*sqr(x[0]-x[3]); };
     x0 = numeric.div(numeric.round(numeric.mul(numeric.uncmin(f,[3,-1,0,1]).solution,1e5)),1e5)
 OUT> [0,0,0,0]
-IN> f = function(x) { 
+IN> f = function(x) {
         return (sqr(10*(x[1]-x[0]*x[0]))+sqr(1-x[0])+
                 90*sqr(x[3]-x[2]*x[2])+sqr(1-x[2])+
-                10*sqr(x[1]+x[3]-2)+0.1*sqr(x[1]-x[3])); }; 
+                10*sqr(x[1]+x[3]-2)+0.1*sqr(x[1]-x[3])); };
     x0 = numeric.uncmin(f,[-3,-1,-3,-1]).solution
 OUT> [1,1,1,1]
-IN> y = [0.1957,0.1947,0.1735,0.1600,0.0844,0.0627,0.0456,0.0342,0.0323,0.0235,0.0246]; 
-    u = [4,2,1,0.5,0.25,0.167,0.125,0.1,0.0833,0.0714,0.0625]; 
-    f = function(x) { 
-        var ret=0, i; 
-        for(i=0;i<11;++i) ret += sqr(y[i]-x[0]*(u[i]*u[i]+u[i]*x[1])/(u[i]*u[i]+u[i]*x[2]+x[3])); 
-        return ret; 
-    }; 
+IN> y = [0.1957,0.1947,0.1735,0.1600,0.0844,0.0627,0.0456,0.0342,0.0323,0.0235,0.0246];
+    u = [4,2,1,0.5,0.25,0.167,0.125,0.1,0.0833,0.0714,0.0625];
+    f = function(x) {
+        var ret=0, i;
+        for(i=0;i<11;++i) ret += sqr(y[i]-x[0]*(u[i]*u[i]+u[i]*x[1])/(u[i]*u[i]+u[i]*x[2]+x[3]));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[0.25,0.39,0.415,0.39]).solution
 OUT> [     0.1928,     0.1913,     0.1231,     0.1361]
 IN> y = [0.844,0.908,0.932,0.936,0.925,0.908,0.881,0.850,0.818,0.784,0.751,0.718,
          0.685,0.658,0.628,0.603,0.580,0.558,0.538,0.522,0.506,0.490,0.478,0.467,
-         0.457,0.448,0.438,0.431,0.424,0.420,0.414,0.411,0.406]; 
-    f = function(x) { 
-        var ret=0, i; 
-        for(i=0;i<33;++i) ret += sqr(y[i]-(x[0]+x[1]*Math.exp(-10*i*x[3])+x[2]*Math.exp(-10*i*x[4]))); 
-        return ret; 
-    }; 
+         0.457,0.448,0.438,0.431,0.424,0.420,0.414,0.411,0.406];
+    f = function(x) {
+        var ret=0, i;
+        for(i=0;i<33;++i) ret += sqr(y[i]-(x[0]+x[1]*Math.exp(-10*i*x[3])+x[2]*Math.exp(-10*i*x[4])));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[0.5,1.5,-1,0.01,0.02]).solution
 OUT> [     0.3754,      1.936,     -1.465,    0.01287,    0.02212]
-IN> f = function(x) { 
-        var ret=0, i,ti,yi,exp=Math.exp; 
-        for(i=1;i<=13;++i) { 
-            ti = 0.1*i; 
-            yi = exp(-ti)-5*exp(-10*ti)+3*exp(-4*ti); 
-            ret += sqr(x[2]*exp(-ti*x[0])-x[3]*exp(-ti*x[1])+x[5]*exp(-ti*x[4])-yi); 
-        } 
-        return ret; 
-    }; 
+IN> f = function(x) {
+        var ret=0, i,ti,yi,exp=Math.exp;
+        for(i=1;i<=13;++i) {
+            ti = 0.1*i;
+            yi = exp(-ti)-5*exp(-10*ti)+3*exp(-4*ti);
+            ret += sqr(x[2]*exp(-ti*x[0])-x[3]*exp(-ti*x[1])+x[5]*exp(-ti*x[4])-yi);
+        }
+        return ret;
+    };
     x0 = numeric.uncmin(f,[1,2,1,1,1,1],1e-14).solution;
     f(x0)<1e-20;
 OUT> true
@@ -1166,8 +1166,8 @@ 
    Unconstrained optimization
    
 gradient of f(). If it is not provided, a numerical gradient is used. The iteration stops when
 maxit iterations have been performed. The optional callback() parameter, if provided, is called at each step:
 
    -IN> z = []; 
-    cb = function(i,x,f,g,H) { z.push({i:i, x:x, f:f, g:g, H:H }); }; 
+IN> z = [];
+    cb = function(i,x,f,g,H) { z.push({i:i, x:x, f:f, g:g, H:H }); };
     x0 = numeric.uncmin(function(x) { return Math.cos(2*x[0]); },
                         [1],1e-10,
                         function(x) { return [-2*Math.sin(2*x[0])]; },
@@ -1196,7 +1196,7 @@ 
    Linear programming
    
 IN> x = numeric.solveLP([1,1],                   /* minimize [1,1]*x                */
                         [[-1,0],[0,-1],[-1,-2]], /* matrix of inequalities          */
                         [0,0,-3]                 /* right-hand-side of inequalities */
-                        );       
+                        );
     numeric.trunc(x.solution,1e-12);
 OUT> [0,1.5]
 
    
@@ -1342,7 +1342,7 @@ 
    Solving ODEs
    
 
 
    Seedrandom (David Bau)
    
 
-The object numeric.seedrandom is based on 
+The object numeric.seedrandom is based on
 David Bau's seedrandom.js.
 This small library can be used to create better pseudorandom numbers than Math.random() which can
 furthermore be "seeded".
diff --git a/index.php b/index.php
index 5cd029a..18ed3da 100644
--- a/index.php
+++ b/index.php
@@ -6,7 +6,7 @@
 Numeric Javascript
 
 
@@ -57,7 +57,7 @@
 Although Javascript does not reach the same performance as native programs, the Numeric Javascript
 library is carefully tuned to obtain the best possible performance for a Javascript program. You
 can compare the performance of Numeric, Sylvester and
-Google Closure's 
+Google Closure's
 Matrix
 object using our Benchmark.
 
diff --git a/resources/style-ie.css b/resources/style-ie.css
index 53e0562..8bdcc9f 100644
--- a/resources/style-ie.css
+++ b/resources/style-ie.css
@@ -1,14 +1,14 @@
 body {
-	font-family: 'Lato', sans-serif;
-	margin-top: 20px;
-	margin-left: 50px;
-	margin-right: 50px;
-	margin-bottom: 50px;
-	font-size: 16px;
-	height: 100%;
-	line-height: 150%;
-}
-pre { 
+    font-family: 'Lato', sans-serif;
+    margin-top: 20px;
+    margin-left: 50px;
+    margin-right: 50px;
+    margin-bottom: 50px;
+    font-size: 16px;
+    height: 100%;
+    line-height: 150%;
+}
+pre {
     font-size:15px;
     line-height: 100%;
     margin-left: 10px;
@@ -19,7 +19,7 @@ pre {
     white-space: pre-wrap;
 }
 h1 {
-	font-size: 22px;
+    font-size: 22px;
     margin-top: 20px;
     margin-bottom: 20px;
     border-bottom: solid 1px #000000;
@@ -29,29 +29,29 @@ hr {
     margin-top: 0px;
 }
 div.nav {
-	min-width: 900px;
-	height: 150px;
-	padding-left: 10px;
+    min-width: 900px;
+    height: 150px;
+    padding-left: 10px;
 }
 div.nav {
-	min-width: 900px;
-	padding-right: 50px;
-	vertical-align: top;
-	font-size: 34px;
+    min-width: 900px;
+    padding-right: 50px;
+    vertical-align: top;
+    font-size: 34px;
 }
 tr.nav {
-	height:150px;
+    height:150px;
 }
 td.nav {
-	padding-left: 10px;
-	padding-right: 10px;
-	vertical-align: top;
+    padding-left: 10px;
+    padding-right: 10px;
+    vertical-align: top;
 }
 td.navmain {
-	padding-left: 10px;
-	padding-right: 50px;
-	vertical-align: top;
-	font-size:34px;
+    padding-left: 10px;
+    padding-right: 50px;
+    vertical-align: top;
+    font-size:34px;
 }
 ul.nav
 {
@@ -116,20 +116,20 @@ text-decoration:underline;
 
 
 div.notsaved {
-	font-weight:bold;
-	text-align:center;
-	color: #ff0000;
+    font-weight:bold;
+    text-align:center;
+    color: #ff0000;
 }
 
 div.col1 {
-	float: left;
+    float: left;
 }
 div.button {
     float:right;
-	font-size: 12px;
-	width: 15px;
-	font-weight: bold;
-	vertical-align: top;
+    font-size: 12px;
+    width: 15px;
+    font-weight: bold;
+    vertical-align: top;
     -webkit-user-select: none;
     -khtml-user-select: none;
     -moz-user-select: none;
@@ -138,10 +138,10 @@ div.button {
 }
 div.button2 {
     float:right;
-	width: 15px;
-	font-size: 10px;
-	font-weight: bold;
-	vertical-align: bottom;
+    width: 15px;
+    font-size: 10px;
+    font-weight: bold;
+    vertical-align: bottom;
     -webkit-user-select: none;
     -khtml-user-select: none;
     -moz-user-select: none;
@@ -152,27 +152,27 @@ div.interactions { width:1000px; clear:both; }
 div.spacer { width:5px; }
 div.inner { width:1000px; clear: both; }
 div.input {
-	width:950px;
+    width:950px;
 }
 div.output {
-	width:950px;
-	font-family: monospace;
-	font-size: 14px;
-	color: #000000;
-	vertical-align: top;
-	white-space: pre-wrap;
-	padding-bottom:5px;
-	line-height: 100%;
+    width:950px;
+    font-family: monospace;
+    font-size: 14px;
+    color: #000000;
+    vertical-align: top;
+    white-space: pre-wrap;
+    padding-bottom:5px;
+    line-height: 100%;
 }
 div.caret {
-	float:left;
-	padding-top: 8px;
-	width: 30px;
-	font-family: sans-serif;
-	color: #0000ff;
-	vertical-align:top;
-	text-align: right;
-	font-size: 8px;
+    float:left;
+    padding-top: 8px;
+    width: 30px;
+    font-family: sans-serif;
+    color: #0000ff;
+    vertical-align:top;
+    text-align: right;
+    font-size: 8px;
     -webkit-user-select: none;
     -khtml-user-select: none;
     -moz-user-select: none;
@@ -181,14 +181,14 @@ div.caret {
 }
 div.out {
     float:left;
-	width: 30px;
-	padding-top: 4px;
-	padding-bottom: 4px;
-	font-family: sans-serif;
-	color: #000000;
-	vertical-align:top;
-	text-align: right;
-	font-size: 8px;
+    width: 30px;
+    padding-top: 4px;
+    padding-bottom: 4px;
+    font-family: sans-serif;
+    color: #000000;
+    vertical-align:top;
+    text-align: right;
+    font-size: 8px;
     -webkit-user-select: none;
     -khtml-user-select: none;
     -moz-user-select: none;
@@ -197,12 +197,12 @@ div.out {
 }
 
 div.plot {
-	font-family: sans-serif;
-	font-size: 14px;
-	margin:10px;
-	width:600px;
-	height:400px;
-	line-height: 100%;
+    font-family: sans-serif;
+    font-size: 14px;
+    margin:10px;
+    width:600px;
+    height:400px;
+    line-height: 100%;
 }
 
 textarea.input {
@@ -216,11 +216,11 @@ textarea.input {
         padding:1px;
         border:2px solid #0000ff;
         background-color: #d0d0ff;
-		box-sizing: border-box;
-		width: 100%;
-		-webkit-box-sizing:border-box;
-		-moz-box-sizing: border-box;
-		-ms-box-sizing: border-box;
+        box-sizing: border-box;
+        width: 100%;
+        -webkit-box-sizing:border-box;
+        -moz-box-sizing: border-box;
+        -ms-box-sizing: border-box;
 }
 textarea.runned {
         resize:none;
@@ -232,11 +232,11 @@ textarea.runned {
         margin-bottom:1px;
         padding:1px;
         border:2px solid #0000ff;
-		box-sizing: border-box;
-		width:100%;
-		-webkit-box-sizing:border-box;
-		-moz-box-sizing: border-box;
-		-ms-box-sizing: border-box;
+        box-sizing: border-box;
+        width:100%;
+        -webkit-box-sizing:border-box;
+        -moz-box-sizing: border-box;
+        -ms-box-sizing: border-box;
 }
 a.button:link { text-decoration: none; color: #0000ff; }
 a.button:visited { text-decoration: none; color: #0000ff; }
diff --git a/resources/style.css b/resources/style.css
index d6ac5d2..26b81b6 100644
--- a/resources/style.css
+++ b/resources/style.css
@@ -1,14 +1,14 @@
 body {
-	font-family: 'Lato', sans-serif;
-	margin-top: 20px;
-	margin-left: 50px;
-	margin-right: 50px;
-	margin-bottom: 50px;
-	font-size: 16px;
-	height: 100%;
-	line-height: 150%;
-}
-pre { 
+    font-family: 'Lato', sans-serif;
+    margin-top: 20px;
+    margin-left: 50px;
+    margin-right: 50px;
+    margin-bottom: 50px;
+    font-size: 16px;
+    height: 100%;
+    line-height: 150%;
+}
+pre {
     font-size:15px;
     line-height: 100%;
     margin-left: 10px;
@@ -19,7 +19,7 @@ pre {
     white-space: pre-wrap;
 }
 h1 {
-	font-size: 22px;
+    font-size: 22px;
     margin-top: 20px;
     margin-bottom: 20px;
     border-bottom: solid 1px #000000;
@@ -29,29 +29,29 @@ hr {
     margin-top: 0px;
 }
 div.nav {
-	min-width: 900px;
-	height: 150px;
-	padding-left: 10px;
+    min-width: 900px;
+    height: 150px;
+    padding-left: 10px;
 }
 div.nav {
-	min-width: 900px;
-	padding-right: 50px;
-	vertical-align: top;
-	font-size: 34px;
+    min-width: 900px;
+    padding-right: 50px;
+    vertical-align: top;
+    font-size: 34px;
 }
 tr.nav {
-	height:150px;
+    height:150px;
 }
 td.nav {
-	padding-left: 10px;
-	padding-right: 10px;
-	vertical-align: top;
+    padding-left: 10px;
+    padding-right: 10px;
+    vertical-align: top;
 }
 td.navmain {
-	padding-left: 10px;
-	padding-right: 50px;
-	vertical-align: top;
-	font-size:34px;
+    padding-left: 10px;
+    padding-right: 50px;
+    vertical-align: top;
+    font-size:34px;
 }
 ul.nav
 {
@@ -115,12 +115,12 @@ text-decoration:underline;
 }
 
 div.plot {
-	font-family: sans-serif;
-	font-size: 14px;
-	margin:10px;
-	width:600px;
-	height:400px;
-	line-height: 100%;
+    font-family: sans-serif;
+    font-size: 14px;
+    margin:10px;
+    width:600px;
+    height:400px;
+    line-height: 100%;
 }
 
 a.button:link { text-decoration: none; color: #0000ff; }
diff --git a/src/documentation.html b/src/documentation.html
index e943dc5..35f2bce 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -244,7 +244,7 @@ 
    Numerical analysis in Javascript
    
 
     IN> numeric.identity(100)
 OUT> ...Large Array...
-
     
+
    
 By default, this happens with the Array's length is more than 50. This can be controlled by setting the
 variable numeric.largeArray to an appropriate value:
 
    @@ -739,7 +739,7 @@ 
    Singular value decomposition (Shanti Rao)
    
        [  2, -6,  6,  5,  1],
        [  4,  5,  0, -2,  2]];
     numeric.svd(A);
-OUT> {U: 
+OUT> {U:
 [[    -0.7071,    -0.1581,     0.1768,     0.2494,     0.4625],
  [    -0.5303,    -0.1581,    -0.3536,     0.1556,    -0.4984],
  [    -0.1768,     0.7906,    -0.1768,    -0.1546,     0.3967],
@@ -748,9 +748,9 @@ 
    Singular value decomposition (Shanti Rao)
    
  [    -0.1768,    -0.1581,     0.5303,    -0.5726,   -0.05555],
  [ -7.109e-18,    -0.4743,    -0.1768,    -0.3142,     0.4959],
  [    -0.1768,     0.1581,  1.915e-15,     -0.592,    -0.2791]],
-S: 
+S:
 [      35.33,         20,       19.6,          0,          0],
-V: 
+V:
 [[    -0.8006,    -0.3162,     0.2887,    -0.4191,          0],
  [    -0.4804,     0.6325,  7.768e-15,     0.4405,     0.4185],
  [    -0.1601,    -0.3162,     -0.866,     -0.052,     0.3488],
@@ -780,17 +780,17 @@ 
    Singular value decomposition (Shanti Rao)
    
 IN> m = 59; n = 42; A = numeric.random([m,n]); B = numeric.svd(A); U = new numeric.T(B.U); V = new numeric.T(B.V); !(U.dot(numeric.T.diag(B.S)).dot(V.transpose()).sub(A).norm2()>1e-12)
 OUT> true
 IN> numeric.eig([[1, 0, 0], [0, 0.7181, -0.6960], [0, 0.6960, 0.7181]]) // This was a bug found by bdmartin
-OUT> {lambda: 
-{x: 
+OUT> {lambda:
+{x:
 [          1,     0.7181,     0.7181],
-y: 
+y:
 [          0,      0.696,     -0.696]},
-E: 
-{x: 
+E:
+{x:
 [[          1,          0,          0],
  [          0,          0,     0.7071],
  [          0,    -0.7071,          0]],
-y: 
+y:
 [[          0,          0,          0],
  [          0,    -0.7071,          0],
  [          0,          0,     0.7071]]}}
@@ -887,8 +887,8 @@ 
    Sparse linear algebra
    
       foo = numeric.ccsFull(numeric.ccsDot(LUP.L,LUP.U));
       PA = numeric.ccsFull(numeric.ccsGetBlock(A,LUP.P));
       res = numeric.norminf(numeric.sub(foo,PA));
-      if(!isFinite(res) || res>1e-6) { 
-        result = { 
+      if(!isFinite(res) || res>1e-6) {
+        result = {
           code: "Failed during 1000 sparse LUP",
           k:k,A:A,LUP:LUP,res:res
         };
@@ -948,19 +948,19 @@ 
    Solving PDEs
    
 
 
     IN> g = numeric.cgrid(5)
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1],
  [-1, 0, 1, 2,-1],
  [-1, 3, 4, 5,-1],
  [-1, 6, 7, 8,-1],
  [-1,-1,-1,-1,-1]]
 IN> coordL = numeric.cdelsq(g)
-OUT> 
+OUT>
 [[ 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8],
  [ 1, 3, 0, 0, 2, 4, 1, 1, 5, 2, 0, 4, 6, 3, 1, 3, 5, 7, 4, 2, 4, 8, 5, 3, 7, 6, 4, 6, 8, 7, 5, 7, 8],
  [-1,-1, 4,-1,-1,-1, 4,-1,-1, 4,-1,-1,-1, 4,-1,-1,-1,-1, 4,-1,-1,-1, 4,-1,-1, 4,-1,-1,-1, 4,-1,-1, 4]]
 IN> L = numeric.sscatter(coordL); // Just to see what it looks like
-OUT> 
+OUT>
 [[          4,         -1,           ,         -1],
  [         -1,          4,         -1,           ,         -1],
  [           ,         -1,          4,           ,           ,         -1],
@@ -975,21 +975,21 @@ 
    Solving PDEs
    
 IN> numeric.cdotMV(coordL,x)
 OUT> [1,1,1,1,1,1,1,1,1]
 IN> G = numeric.rep([5,5],0); for(i=0;i<5;i++) for(j=0;j<5;j++) if(g[i][j]>=0) G[i][j] = x[g[i][j]]; G
-OUT> 
+OUT>
 [[ 0     , 0     , 0     , 0     , 0     ],
  [ 0     , 0.6875, 0.875 , 0.6875, 0     ],
  [ 0     , 0.875 , 1.125 , 0.875 , 0     ],
  [ 0     , 0.6875, 0.875 , 0.6875, 0     ],
  [ 0     , 0     , 0     , 0     , 0     ]]
 IN> workshop.html('<img src="'+numeric.imageURL(numeric.mul([G,G,G],200))+'" width=100 />');
-OUT> 
+OUT>
 
 
    
 
 You can also work on an L-shaped or arbitrary-shape domain:
 
     IN> numeric.cgrid(6,'L')
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1,-1],
  [-1, 0, 1,-1,-1,-1],
  [-1, 2, 3,-1,-1,-1],
@@ -997,7 +997,7 @@ 
    Solving PDEs
    
  [-1, 8, 9,10,11,-1],
  [-1,-1,-1,-1,-1,-1]]
 IN> numeric.cgrid(5,function(i,j) { return i!==2 || j!==2; })
-OUT> 
+OUT>
 [[-1,-1,-1,-1,-1],
  [-1, 0, 1, 2,-1],
  [-1, 3,-1, 4,-1],
@@ -1079,84 +1079,84 @@ 
    Unconstrained optimization
    
 Here are some demos from from Moré et al., 1981:
 
 
    -IN> sqr = function(x) { return x*x; }; 
+IN> sqr = function(x) { return x*x; };
     numeric.uncmin(function(x) { return sqr(10*(x[1]-x[0]*x[0])) + sqr(1-x[0]); },[-1.2,1]).solution
 OUT> [1,1]
-IN> f = function(x) { return sqr(-13+x[0]+((5-x[1])*x[1]-2)*x[1])+sqr(-29+x[0]+((x[1]+1)*x[1]-14)*x[1]); }; 
+IN> f = function(x) { return sqr(-13+x[0]+((5-x[1])*x[1]-2)*x[1])+sqr(-29+x[0]+((x[1]+1)*x[1]-14)*x[1]); };
     x0 = numeric.uncmin(f,[0.5,-2]).solution
 OUT> [11.41,-0.8968]
-IN> f = function(x) { return sqr(1e4*x[0]*x[1]-1)+sqr(Math.exp(-x[0])+Math.exp(-x[1])-1.0001); }; 
+IN> f = function(x) { return sqr(1e4*x[0]*x[1]-1)+sqr(Math.exp(-x[0])+Math.exp(-x[1])-1.0001); };
     x0 = numeric.uncmin(f,[0,1]).solution
 OUT> [1.098e-5,9.106]
-IN> f = function(x) { return sqr(x[0]-1e6)+sqr(x[1]-2e-6)+sqr(x[0]*x[1]-2)}; 
+IN> f = function(x) { return sqr(x[0]-1e6)+sqr(x[1]-2e-6)+sqr(x[0]*x[1]-2)};
     x0 = numeric.uncmin(f,[0,1]).solution
 OUT> [1e6,2e-6]
-IN> f = function(x) { 
+IN> f = function(x) {
        return sqr(1.5-x[0]*(1-x[1]))+sqr(2.25-x[0]*(1-x[1]*x[1]))+sqr(2.625-x[0]*(1-x[1]*x[1]*x[1]));
-    }; 
+    };
     x0 = numeric.uncmin(f,[1,1]).solution
 OUT> [3,0.5]
-IN> f = function(x) { 
-        var ret = 0,i; 
+IN> f = function(x) {
+        var ret = 0,i;
         for(i=1;i<=10;i++) ret+=sqr(2+2*i-Math.exp(i*x[0])-Math.exp(i*x[1]));
-         return ret; 
+         return ret;
     };
     x0 = numeric.uncmin(f,[0.3,0.4]).solution
 OUT> [0.2578,0.2578]
-IN> y = [0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39]; 
-    f = function(x) { 
-        var ret = 0,i; 
-        for(i=1;i<=15;i++) ret+=sqr(y[i-1]-(x[0]+i/((16-i)*x[1]+Math.min(i,16-i)*x[2]))); 
-        return ret; 
-    }; 
+IN> y = [0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39];
+    f = function(x) {
+        var ret = 0,i;
+        for(i=1;i<=15;i++) ret+=sqr(y[i-1]-(x[0]+i/((16-i)*x[1]+Math.min(i,16-i)*x[2])));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[1,1,1]).solution
 OUT> [0.08241,1.133,2.344]
-IN> y = [0.0009,0.0044,0.0175,0.0540,0.1295,0.2420,0.3521,0.3989,0.3521,0.2420,0.1295,0.0540,0.0175,0.0044,0.0009]; 
-    f = function(x) { 
-        var ret = 0,i; 
-        for(i=1;i<=15;i++) 
-        ret+=sqr(x[0]*Math.exp(-x[1]*sqr((8-i)/2-x[2])/2)-y[i-1]); 
-        return ret; 
-    }; 
+IN> y = [0.0009,0.0044,0.0175,0.0540,0.1295,0.2420,0.3521,0.3989,0.3521,0.2420,0.1295,0.0540,0.0175,0.0044,0.0009];
+    f = function(x) {
+        var ret = 0,i;
+        for(i=1;i<=15;i++)
+        ret+=sqr(x[0]*Math.exp(-x[1]*sqr((8-i)/2-x[2])/2)-y[i-1]);
+        return ret;
+    };
     x0 = numeric.div(numeric.round(numeric.mul(numeric.uncmin(f,[1,1,1]).solution,1000)),1000)
 OUT> [0.399,1,0]
-IN> f = function(x) { return sqr(x[0]+10*x[1])+5*sqr(x[2]-x[3])+sqr(sqr(x[1]-2*x[2]))+10*sqr(x[0]-x[3]); }; 
+IN> f = function(x) { return sqr(x[0]+10*x[1])+5*sqr(x[2]-x[3])+sqr(sqr(x[1]-2*x[2]))+10*sqr(x[0]-x[3]); };
     x0 = numeric.div(numeric.round(numeric.mul(numeric.uncmin(f,[3,-1,0,1]).solution,1e5)),1e5)
 OUT> [0,0,0,0]
-IN> f = function(x) { 
+IN> f = function(x) {
         return (sqr(10*(x[1]-x[0]*x[0]))+sqr(1-x[0])+
                 90*sqr(x[3]-x[2]*x[2])+sqr(1-x[2])+
-                10*sqr(x[1]+x[3]-2)+0.1*sqr(x[1]-x[3])); }; 
+                10*sqr(x[1]+x[3]-2)+0.1*sqr(x[1]-x[3])); };
     x0 = numeric.uncmin(f,[-3,-1,-3,-1]).solution
 OUT> [1,1,1,1]
-IN> y = [0.1957,0.1947,0.1735,0.1600,0.0844,0.0627,0.0456,0.0342,0.0323,0.0235,0.0246]; 
-    u = [4,2,1,0.5,0.25,0.167,0.125,0.1,0.0833,0.0714,0.0625]; 
-    f = function(x) { 
-        var ret=0, i; 
-        for(i=0;i<11;++i) ret += sqr(y[i]-x[0]*(u[i]*u[i]+u[i]*x[1])/(u[i]*u[i]+u[i]*x[2]+x[3])); 
-        return ret; 
-    }; 
+IN> y = [0.1957,0.1947,0.1735,0.1600,0.0844,0.0627,0.0456,0.0342,0.0323,0.0235,0.0246];
+    u = [4,2,1,0.5,0.25,0.167,0.125,0.1,0.0833,0.0714,0.0625];
+    f = function(x) {
+        var ret=0, i;
+        for(i=0;i<11;++i) ret += sqr(y[i]-x[0]*(u[i]*u[i]+u[i]*x[1])/(u[i]*u[i]+u[i]*x[2]+x[3]));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[0.25,0.39,0.415,0.39]).solution
 OUT> [     0.1928,     0.1913,     0.1231,     0.1361]
 IN> y = [0.844,0.908,0.932,0.936,0.925,0.908,0.881,0.850,0.818,0.784,0.751,0.718,
          0.685,0.658,0.628,0.603,0.580,0.558,0.538,0.522,0.506,0.490,0.478,0.467,
-         0.457,0.448,0.438,0.431,0.424,0.420,0.414,0.411,0.406]; 
-    f = function(x) { 
-        var ret=0, i; 
-        for(i=0;i<33;++i) ret += sqr(y[i]-(x[0]+x[1]*Math.exp(-10*i*x[3])+x[2]*Math.exp(-10*i*x[4]))); 
-        return ret; 
-    }; 
+         0.457,0.448,0.438,0.431,0.424,0.420,0.414,0.411,0.406];
+    f = function(x) {
+        var ret=0, i;
+        for(i=0;i<33;++i) ret += sqr(y[i]-(x[0]+x[1]*Math.exp(-10*i*x[3])+x[2]*Math.exp(-10*i*x[4])));
+        return ret;
+    };
     x0 = numeric.uncmin(f,[0.5,1.5,-1,0.01,0.02]).solution
 OUT> [     0.3754,      1.936,     -1.465,    0.01287,    0.02212]
-IN> f = function(x) { 
-        var ret=0, i,ti,yi,exp=Math.exp; 
-        for(i=1;i<=13;++i) { 
-            ti = 0.1*i; 
-            yi = exp(-ti)-5*exp(-10*ti)+3*exp(-4*ti); 
-            ret += sqr(x[2]*exp(-ti*x[0])-x[3]*exp(-ti*x[1])+x[5]*exp(-ti*x[4])-yi); 
-        } 
-        return ret; 
-    }; 
+IN> f = function(x) {
+        var ret=0, i,ti,yi,exp=Math.exp;
+        for(i=1;i<=13;++i) {
+            ti = 0.1*i;
+            yi = exp(-ti)-5*exp(-10*ti)+3*exp(-4*ti);
+            ret += sqr(x[2]*exp(-ti*x[0])-x[3]*exp(-ti*x[1])+x[5]*exp(-ti*x[4])-yi);
+        }
+        return ret;
+    };
     x0 = numeric.uncmin(f,[1,2,1,1,1,1],1e-14).solution;
     f(x0)<1e-20;
 OUT> true
@@ -1166,8 +1166,8 @@ 
    Unconstrained optimization
    
 gradient of f(). If it is not provided, a numerical gradient is used. The iteration stops when
 maxit iterations have been performed. The optional callback() parameter, if provided, is called at each step:
 
    -IN> z = []; 
-    cb = function(i,x,f,g,H) { z.push({i:i, x:x, f:f, g:g, H:H }); }; 
+IN> z = [];
+    cb = function(i,x,f,g,H) { z.push({i:i, x:x, f:f, g:g, H:H }); };
     x0 = numeric.uncmin(function(x) { return Math.cos(2*x[0]); },
                         [1],1e-10,
                         function(x) { return [-2*Math.sin(2*x[0])]; },
@@ -1196,7 +1196,7 @@ 
    Linear programming
    
 IN> x = numeric.solveLP([1,1],                   /* minimize [1,1]*x                */
                         [[-1,0],[0,-1],[-1,-2]], /* matrix of inequalities          */
                         [0,0,-3]                 /* right-hand-side of inequalities */
-                        );       
+                        );
     numeric.trunc(x.solution,1e-12);
 OUT> [0,1.5]
 
    
@@ -1342,7 +1342,7 @@ 
    Solving ODEs
    
 
 
    Seedrandom (David Bau)
    
 
-The object numeric.seedrandom is based on 
+The object numeric.seedrandom is based on
 David Bau's seedrandom.js.
 This small library can be used to create better pseudorandom numbers than Math.random() which can
 furthermore be "seeded".
diff --git a/src/numeric.js b/src/numeric.js
index 9f67244..9fbdd4d 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -58,16 +58,16 @@ numeric.prettyPrint = function prettyPrint(x) {
             return false;
         }
         if(x === null) { ret.push("null"); return false; }
-        if(typeof x === "function") { 
+        if(typeof x === "function") {
             ret.push(x.toString());
             var flag = false;
-            for(k in x) { if(x.hasOwnProperty(k)) { 
+            for(k in x) { if(x.hasOwnProperty(k)) {
                 if(flag) ret.push(',\n');
                 else ret.push('\n{');
-                flag = true; 
-                ret.push(k); 
-                ret.push(': \n'); 
-                foo(x[k]); 
+                flag = true;
+                ret.push(k);
+                ret.push(': \n');
+                foo(x[k]);
             } }
             if(flag) ret.push('}\n');
             return true;
@@ -179,45 +179,45 @@ numeric.imageURL = function imageURL(img) {
         if(typeof from === "undefined") { from = 0; }
         if(typeof to === "undefined") { to = a.length; }
         var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
-                     0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 
+                     0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
                      0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
-                     0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 
-                     0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 
-                     0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 
+                     0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
+                     0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
+                     0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
                      0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
                      0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
                      0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
-                     0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 
-                     0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 
-                     0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 
-                     0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 
-                     0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 
-                     0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 
-                     0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 
-                     0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 
-                     0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 
-                     0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 
-                     0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 
-                     0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 
-                     0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 
-                     0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 
-                     0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 
-                     0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 
-                     0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 
-                     0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 
-                     0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 
-                     0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 
-                     0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 
-                     0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 
+                     0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
+                     0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
+                     0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+                     0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
+                     0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+                     0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+                     0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
+                     0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
+                     0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+                     0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
+                     0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
+                     0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+                     0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
+                     0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
+                     0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+                     0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
+                     0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
+                     0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+                     0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+                     0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
+                     0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+                     0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
                      0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
-     
+
         var crc = -1, y = 0, n = a.length,i;
 
         for (i = from; i < to; i++) {
             y = (crc ^ a[i]) & 0xFF;
             crc = (crc >>> 8) ^ table[y];
         }
-     
+
         return crc ^ (-1);
     }
 
@@ -225,7 +225,7 @@ numeric.imageURL = function imageURL(img) {
     var stream = [
                   137, 80, 78, 71, 13, 10, 26, 10,                           //  0: PNG signature
                   0,0,0,13,                                                  //  8: IHDR Chunk length
-                  73, 72, 68, 82,                                            // 12: "IHDR" 
+                  73, 72, 68, 82,                                            // 12: "IHDR"
                   (w >> 24) & 255, (w >> 16) & 255, (w >> 8) & 255, w&255,   // 16: Width
                   (h >> 24) & 255, (h >> 16) & 255, (h >> 8) & 255, h&255,   // 20: Height
                   8,                                                         // 24: bit depth
@@ -732,7 +732,7 @@ numeric.inv = function inv(x) {
         Aj = A[i0]; A[i0] = A[j]; A[j] = Aj;
         Ij = I[i0]; I[i0] = I[j]; I[j] = Ij;
         x = Aj[j];
-        for(k=j;k!==n;++k)    Aj[k] /= x; 
+        for(k=j;k!==n;++k)    Aj[k] /= x;
         for(k=n-1;k!==-1;--k) Ij[k] /= x;
         for(i=m-1;i!==-1;--i) {
             if(i!==j) {
@@ -1603,7 +1603,7 @@ numeric.ccsDFS.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv) {
 numeric.ccsLPSolve = function ccsLPSolve(A,B,x,xj,I,Pinv,dfs) {
     var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
     var Bi = B[0], Bj = B[1], Bv = B[2];
-    
+
     var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
     i0 = Bi[I];
     i1 = Bi[I+1];
@@ -1710,7 +1710,7 @@ numeric.ccsDFS0.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv,P) {
 numeric.ccsLPSolve0 = function ccsLPSolve0(A,B,y,xj,I,Pinv,P,dfs) {
     var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
     var Bi = B[0], Bj = B[1], Bv = B[2];
-    
+
     var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
     i0 = Bi[I];
     i1 = Bi[I+1];
@@ -1873,7 +1873,7 @@ numeric.ccsLUPSolve = function ccsLUPSolve(LUP,B) {
         k = 0;
         j0 = Bi[i];
         j1 = Bi[i+1];
-        for(j=j0;j=0;i--) { dx[i] = x[i+1]-x[i]; dy[i] = sub(y[i+1],y[i]); }
-    if(typeof k1 === "string" || typeof kn === "string") { 
+    if(typeof k1 === "string" || typeof kn === "string") {
         k1 = kn = "periodic";
     }
     // Build sparse tridiagonal system
@@ -3167,7 +3167,7 @@ numeric.MPStoLP = function MPStoLP(MPS) {
         }
         switch(state) {
         case 0: case 1: err('Unexpected line');
-        case 2: 
+        case 2:
             switch(w[0]) {
             case 'N': if(N===0) N = w[1]; else err('Two or more N rows'); break;
             case 'L': rows[w[1]] = rl; sign[rl] = 1; b[rl] = 0; ++rl; break;
diff --git a/src/seedrandom.js b/src/seedrandom.js
index dbffc75..aa4e836 100644
--- a/src/seedrandom.js
+++ b/src/seedrandom.js
@@ -68,18 +68,18 @@
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are met:
-// 
+//
 //   1. Redistributions of source code must retain the above copyright
 //      notice, this list of conditions and the following disclaimer.
 //
 //   2. Redistributions in binary form must reproduce the above copyright
 //      notice, this list of conditions and the following disclaimer in the
 //      documentation and/or other materials provided with the distribution.
-// 
+//
 //   3. Neither the name of this module nor the names of its contributors may
 //      be used to endorse or promote products derived from this software
 //      without specific prior written permission.
-// 
+//
 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
@@ -95,7 +95,7 @@
 /**
  * All code is in an anonymous closure to keep the global namespace clean.
  *
- * @param {number=} overflow 
+ * @param {number=} overflow
  * @param {number=} startdenom
  */
 
@@ -211,7 +211,7 @@ function ARC4(key) {
 // flatten()
 // Converts an object tree to nested arrays of strings.
 //
-/** @param {Object=} result 
+/** @param {Object=} result
   * @param {string=} prop
   * @param {string=} typ */
 function flatten(obj, depth, result, prop, typ) {
@@ -232,7 +232,7 @@ function flatten(obj, depth, result, prop, typ) {
 // Mixes a string seed into a key that is an array of integers, and
 // returns a shortened string seed that is equivalent to the result key.
 //
-/** @param {number=} smear 
+/** @param {number=} smear
   * @param {number=} j */
 function mixkey(seed, key, smear, j) {
   seed += '';                         // Ensure the seed is a string
diff --git a/src/svd.js b/src/svd.js
index 24a07d3..f9fe277 100644
--- a/src/svd.js
+++ b/src/svd.js
@@ -1,296 +1,296 @@
-/*
-Shanti Rao sent me this routine by private email. I had to modify it
-slightly to work on Arrays instead of using a Matrix object.
-It is apparently translated from http://stitchpanorama.sourceforge.net/Python/svd.py
-*/
-
-numeric.svd= function svd(A) {
-    var temp;
-//Compute the thin SVD from G. H. Golub and C. Reinsch, Numer. Math. 14, 403-420 (1970)
-	var prec= numeric.epsilon; //Math.pow(2,-52) // assumes double prec
-	var tolerance= 1.e-64/prec;
-	var itmax= 50;
-	var c=0;
-	var i=0;
-	var j=0;
-	var k=0;
-	var l=0;
-	
-	var u= numeric.clone(A);
-	var m= u.length;
-	
-	var n= u[0].length;
-	
-	if (m < n) throw "Need more rows than columns"
-	
-	var e = new Array(n);
-	var q = new Array(n);
-	for (i=0; i b)
-			return a*Math.sqrt(1.0+(b*b/a/a))
-		else if (b == 0.0) 
-			return a
-		return b*Math.sqrt(1.0+(a*a/b/b))
-	}
-
-	//Householder's reduction to bidiagonal form
-
-	var f= 0.0;
-	var g= 0.0;
-	var h= 0.0;
-	var x= 0.0;
-	var y= 0.0;
-	var z= 0.0;
-	var s= 0.0;
-	
-	for (i=0; i < n; i++)
-	{	
-		e[i]= g;
-		s= 0.0;
-		l= i+1;
-		for (j=i; j < m; j++) 
-			s += (u[j][i]*u[j][i]);
-		if (s <= tolerance)
-			g= 0.0;
-		else
-		{	
-			f= u[i][i];
-			g= Math.sqrt(s);
-			if (f >= 0.0) g= -g;
-			h= f*g-s
-			u[i][i]=f-g;
-			for (j=l; j < n; j++)
-			{
-				s= 0.0
-				for (k=i; k < m; k++) 
-					s += u[k][i]*u[k][j]
-				f= s/h
-				for (k=i; k < m; k++) 
-					u[k][j]+=f*u[k][i]
-			}
-		}
-		q[i]= g
-		s= 0.0
-		for (j=l; j < n; j++) 
-			s= s + u[i][j]*u[i][j]
-		if (s <= tolerance)
-			g= 0.0
-		else
-		{	
-			f= u[i][i+1]
-			g= Math.sqrt(s)
-			if (f >= 0.0) g= -g
-			h= f*g - s
-			u[i][i+1] = f-g;
-			for (j=l; j < n; j++) e[j]= u[i][j]/h
-			for (j=l; j < m; j++)
-			{	
-				s=0.0
-				for (k=l; k < n; k++) 
-					s += (u[j][k]*u[i][k])
-				for (k=l; k < n; k++) 
-					u[j][k]+=s*e[k]
-			}	
-		}
-		y= Math.abs(q[i])+Math.abs(e[i])
-		if (y>x) 
-			x=y
-	}
-	
-	// accumulation of right hand gtransformations
-	for (i=n-1; i != -1; i+= -1)
-	{	
-		if (g != 0.0)
-		{
-		 	h= g*u[i][i+1]
-			for (j=l; j < n; j++) 
-				v[j][i]=u[i][j]/h
-			for (j=l; j < n; j++)
-			{	
-				s=0.0
-				for (k=l; k < n; k++) 
-					s += u[i][k]*v[k][j]
-				for (k=l; k < n; k++) 
-					v[k][j]+=(s*v[k][i])
-			}	
-		}
-		for (j=l; j < n; j++)
-		{
-			v[i][j] = 0;
-			v[j][i] = 0;
-		}
-		v[i][i] = 1;
-		g= e[i]
-		l= i
-	}
-	
-	// accumulation of left hand transformations
-	for (i=n-1; i != -1; i+= -1)
-	{	
-		l= i+1
-		g= q[i]
-		for (j=l; j < n; j++) 
-			u[i][j] = 0;
-		if (g != 0.0)
-		{
-			h= u[i][i]*g
-			for (j=l; j < n; j++)
-			{
-				s=0.0
-				for (k=l; k < m; k++) s += u[k][i]*u[k][j];
-				f= s/h
-				for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
-			}
-			for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
-		}
-		else
-			for (j=i; j < m; j++) u[j][i] = 0;
-		u[i][i] += 1;
-	}
-	
-	// diagonalization of the bidiagonal form
-	prec= prec*x
-	for (k=n-1; k != -1; k+= -1)
-	{
-		for (var iteration=0; iteration < itmax; iteration++)
-		{	// test f splitting
-			var test_convergence = false
-			for (l=k; l != -1; l+= -1)
-			{	
-				if (Math.abs(e[l]) <= prec)
-				{	test_convergence= true
-					break 
-				}
-				if (Math.abs(q[l-1]) <= prec)
-					break 
-			}
-			if (!test_convergence)
-			{	// cancellation of e[l] if l>0
-				c= 0.0
-				s= 1.0
-				var l1= l-1
-				for (i =l; i= itmax-1)
-				throw 'Error: no convergence.'
-			// shift from bottom 2x2 minor
-			x= q[l]
-			y= q[k-1]
-			g= e[k-1]
-			h= e[k]
-			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y)
-			g= pythag(f,1.0)
-			if (f < 0.0)
-				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x
-			else
-				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x
-			// next QR transformation
-			c= 1.0
-			s= 1.0
-			for (i=l+1; i< k+1; i++)
-			{	
-				g= e[i]
-				y= q[i]
-				h= s*g
-				g= c*g
-				z= pythag(f,h)
-				e[i-1]= z
-				c= f/z
-				s= h/z
-				f= x*c+g*s
-				g= -x*s+g*c
-				h= y*s
-				y= y*c
-				for (j=0; j < n; j++)
-				{	
-					x= v[j][i-1]
-					z= v[j][i]
-					v[j][i-1] = x*c+z*s
-					v[j][i] = -x*s+z*c
-				}
-				z= pythag(f,h)
-				q[i-1]= z
-				c= f/z
-				s= h/z
-				f= c*g+s*y
-				x= -s*g+c*y
-				for (j=0; j < m; j++)
-				{
-					y= u[j][i-1]
-					z= u[j][i]
-					u[j][i-1] = y*c+z*s
-					u[j][i] = -y*s+z*c
-				}
-			}
-			e[l]= 0.0
-			e[k]= f
-			q[k]= x
-		} 
-	}
-		
-	//vt= transpose(v)
-	//return (u,q,vt)
-	for (i=0;i= 0; j--)
-	 {
-	  if (q[j] < q[i])
-	  {
-	//  writeln(i,'-',j)
-	   c = q[j]
-	   q[j] = q[i]
-	   q[i] = c
-	   for(k=0;k b)
+            return a*Math.sqrt(1.0+(b*b/a/a))
+        else if (b == 0.0)
+            return a
+        return b*Math.sqrt(1.0+(a*a/b/b))
+    }
+
+    //Householder's reduction to bidiagonal form
+
+    var f= 0.0;
+    var g= 0.0;
+    var h= 0.0;
+    var x= 0.0;
+    var y= 0.0;
+    var z= 0.0;
+    var s= 0.0;
+
+    for (i=0; i < n; i++)
+    {
+        e[i]= g;
+        s= 0.0;
+        l= i+1;
+        for (j=i; j < m; j++)
+            s += (u[j][i]*u[j][i]);
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g-s
+            u[i][i]=f-g;
+            for (j=l; j < n; j++)
+            {
+                s= 0.0
+                for (k=i; k < m; k++)
+                    s += u[k][i]*u[k][j]
+                f= s/h
+                for (k=i; k < m; k++)
+                    u[k][j]+=f*u[k][i]
+            }
+        }
+        q[i]= g
+        s= 0.0
+        for (j=l; j < n; j++)
+            s= s + u[i][j]*u[i][j]
+        if (s <= tolerance)
+            g= 0.0
+        else
+        {
+            f= u[i][i+1]
+            g= Math.sqrt(s)
+            if (f >= 0.0) g= -g
+            h= f*g - s
+            u[i][i+1] = f-g;
+            for (j=l; j < n; j++) e[j]= u[i][j]/h
+            for (j=l; j < m; j++)
+            {
+                s=0.0
+                for (k=l; k < n; k++)
+                    s += (u[j][k]*u[i][k])
+                for (k=l; k < n; k++)
+                    u[j][k]+=s*e[k]
+            }
+        }
+        y= Math.abs(q[i])+Math.abs(e[i])
+        if (y>x)
+            x=y
+    }
+
+    // accumulation of right hand gtransformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        if (g != 0.0)
+        {
+            h= g*u[i][i+1]
+            for (j=l; j < n; j++)
+                v[j][i]=u[i][j]/h
+            for (j=l; j < n; j++)
+            {
+                s=0.0
+                for (k=l; k < n; k++)
+                    s += u[i][k]*v[k][j]
+                for (k=l; k < n; k++)
+                    v[k][j]+=(s*v[k][i])
+            }
+        }
+        for (j=l; j < n; j++)
+        {
+            v[i][j] = 0;
+            v[j][i] = 0;
+        }
+        v[i][i] = 1;
+        g= e[i]
+        l= i
+    }
+
+    // accumulation of left hand transformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        l= i+1
+        g= q[i]
+        for (j=l; j < n; j++)
+            u[i][j] = 0;
+        if (g != 0.0)
+        {
+            h= u[i][i]*g
+            for (j=l; j < n; j++)
+            {
+                s=0.0
+                for (k=l; k < m; k++) s += u[k][i]*u[k][j];
+                f= s/h
+                for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
+            }
+            for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
+        }
+        else
+            for (j=i; j < m; j++) u[j][i] = 0;
+        u[i][i] += 1;
+    }
+
+    // diagonalization of the bidiagonal form
+    prec= prec*x
+    for (k=n-1; k != -1; k+= -1)
+    {
+        for (var iteration=0; iteration < itmax; iteration++)
+        {   // test f splitting
+            var test_convergence = false
+            for (l=k; l != -1; l+= -1)
+            {
+                if (Math.abs(e[l]) <= prec)
+                {   test_convergence= true
+                    break
+                }
+                if (Math.abs(q[l-1]) <= prec)
+                    break
+            }
+            if (!test_convergence)
+            {   // cancellation of e[l] if l>0
+                c= 0.0
+                s= 1.0
+                var l1= l-1
+                for (i =l; i= itmax-1)
+                throw 'Error: no convergence.'
+            // shift from bottom 2x2 minor
+            x= q[l]
+            y= q[k-1]
+            g= e[k-1]
+            h= e[k]
+            f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y)
+            g= pythag(f,1.0)
+            if (f < 0.0)
+                f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x
+            else
+                f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x
+            // next QR transformation
+            c= 1.0
+            s= 1.0
+            for (i=l+1; i< k+1; i++)
+            {
+                g= e[i]
+                y= q[i]
+                h= s*g
+                g= c*g
+                z= pythag(f,h)
+                e[i-1]= z
+                c= f/z
+                s= h/z
+                f= x*c+g*s
+                g= -x*s+g*c
+                h= y*s
+                y= y*c
+                for (j=0; j < n; j++)
+                {
+                    x= v[j][i-1]
+                    z= v[j][i]
+                    v[j][i-1] = x*c+z*s
+                    v[j][i] = -x*s+z*c
+                }
+                z= pythag(f,h)
+                q[i-1]= z
+                c= f/z
+                s= h/z
+                f= c*g+s*y
+                x= -s*g+c*y
+                for (j=0; j < m; j++)
+                {
+                    y= u[j][i-1]
+                    z= u[j][i]
+                    u[j][i-1] = y*c+z*s
+                    u[j][i] = -y*s+z*c
+                }
+            }
+            e[l]= 0.0
+            e[k]= f
+            q[k]= x
+        }
+    }
+
+    //vt= transpose(v)
+    //return (u,q,vt)
+    for (i=0;i= 0; j--)
+     {
+      if (q[j] < q[i])
+      {
+    //  writeln(i,'-',j)
+       c = q[j]
+       q[j] = q[i]
+       q[i] = c
+       for(k=0;klowerLimit to upperLimit
- * for a root (i.e., zero) of the function func with respect to 
+ * for a root (i.e., zero) of the function func with respect to
  * its first argument using Brent's method root-finding algorithm.
  *
  * @param {function} function for which the root is sought.
@@ -31,9 +31,9 @@ function uniroot ( func, lowerLimit, upperLimit, errorTol, maxIter ) {
   maxIter  = maxIter  || 1000;
 
   while ( maxIter-- > 0 ) {
-  
+
     prev_step = b - a;
-   
+
     if ( Math.abs(fc) < Math.abs(fb) ) {
       // Swap data for b to be the best approximation
       a = b, b = c, c = a;
@@ -71,11 +71,11 @@ function uniroot ( func, lowerLimit, upperLimit, errorTol, maxIter ) {
       }
 
       if ( p < ( 0.75 * cb * q - Math.abs( tol_act * q ) / 2 ) &&
-           p < Math.abs( prev_step * q / 2 ) ) { 
+           p < Math.abs( prev_step * q / 2 ) ) {
         // If (b + p / q) falls in [b,c] and isn't too large it is accepted
         new_step = p / q;
       }
- 
+
       // If p/q is too large then the bissection procedure can reduce [b,c] range to more extent
     }
 
@@ -104,7 +104,7 @@ function f4 (x) { test_counter++; return (x + 3) * Math.pow(x - 1, 2); }
   [f1, 2, 3],
   [f2, 2, 3],
   [f2, -1, 3],
-  [f3, -1, 3], 
+  [f3, -1, 3],
   [f4, -4, 4/3]
 ].forEach(function (args) {
   test_counter = 0;
diff --git a/tools/README.md b/tools/README.md
index cb50f36..7729d1c 100644
--- a/tools/README.md
+++ b/tools/README.md
@@ -1,7 +1,7 @@
 The /tools directory
 ====================
 
-This directory contains build/test scripts for numeric.js as well as 
+This directory contains build/test scripts for numeric.js as well as
 js libraries needed by the Workshop.
 
 Building
diff --git a/tools/XMLHttpRequest.js b/tools/XMLHttpRequest.js
index 54a3875..6ecaf68 100644
--- a/tools/XMLHttpRequest.js
+++ b/tools/XMLHttpRequest.js
@@ -15,200 +15,200 @@ var sys = require('sys');
  */
 
 exports.XMLHttpRequest = function() {
-	/**
-	 * Private variables
-	 */
-	var self = this;
-	var http = require('http');
-
-	// Holds http.js objects
-	var client;
-	var request;
-	var response;
-	
-	var settings = {}; // Request settings
-	
-	var defaultHeaders = {
-		"User-Agent": "node.js",
-		"Accept": "*/*",
-	};
-	
-	var headers = defaultHeaders;
-	
-	this.UNSENT = 0;
-	this.OPENED = 1;
-	this.HEADERS_RECEIVED = 2;
-	this.LOADING = 3;
-	this.DONE = 4;
-
-	this.readyState = this.UNSENT; // Current state
-
-	// Result & response
-	this.responseText = "";
-	this.responseXML = "";
-	this.status = null;
-	this.statusText = null;
-		
-	/**
-	 * Open the connection. Currently supports local server requests.
-	 *
-	 * @param string method Connection method (eg GET, POST)
-	 * @param string url URL for the connection.
-	 * @param boolean async Asynchronous connection. Default is true.
-	 * @param string user Username for basic authentication (optional)
-	 * @param string password Password for basic authentication (optional)
-	 */
-	this.open = function(method, url, async, user, password) {
-		settings = {
-			"method": method,
-			"url": url,
-			"async": async,
-			"user": user,
-			"password": password
-		};
-		
-		this.abort();
-
-		setState(this.OPENED);
-	};
-	
-	/**
-	 * Sets a header for the request.
-	 *
-	 * @param string header Header name
-	 * @param string value Header value
-	 */
-	this.setRequestHeader = function(header, value) {
-		headers[header] = value;
-	};
-	
-	/**
-	 * Gets a header from the server response.
-	 *
-	 * @param string header Name of header to get.
-	 * @return string Text of the header or null if it doesn't exist.
-	 */
-	this.getResponseHeader = function(header) {
-		if (this.readyState > this.OPENED && response.headers.header) {
-			return header + ": " + response.headers.header;
-		}
-		
-		return null;
-	};
-	
-	/**
-	 * Gets all the response headers.
-	 *
-	 * @return string 
-	 */
-	this.getAllResponseHeaders = function() {
-		if (this.readyState < this.HEADERS_RECEIVED) {
-			throw "INVALID_STATE_ERR: Headers have not been received.";
-		}
-		var result = "";
-		
-		for (var i in response.headers) {
-			result += i + ": " + response.headers[i] + "\r\n";
-		}
-		return result.substr(0, result.length - 2);
-	};
-
-	/**
-	 * Sends the request to the server.
-	 *
-	 * @param string data Optional data to send as request body.
-	 */
+    /**
+     * Private variables
+     */
+    var self = this;
+    var http = require('http');
+
+    // Holds http.js objects
+    var client;
+    var request;
+    var response;
+
+    var settings = {}; // Request settings
+
+    var defaultHeaders = {
+        "User-Agent": "node.js",
+        "Accept": "*/*",
+    };
+
+    var headers = defaultHeaders;
+
+    this.UNSENT = 0;
+    this.OPENED = 1;
+    this.HEADERS_RECEIVED = 2;
+    this.LOADING = 3;
+    this.DONE = 4;
+
+    this.readyState = this.UNSENT; // Current state
+
+    // Result & response
+    this.responseText = "";
+    this.responseXML = "";
+    this.status = null;
+    this.statusText = null;
+
+    /**
+     * Open the connection. Currently supports local server requests.
+     *
+     * @param string method Connection method (eg GET, POST)
+     * @param string url URL for the connection.
+     * @param boolean async Asynchronous connection. Default is true.
+     * @param string user Username for basic authentication (optional)
+     * @param string password Password for basic authentication (optional)
+     */
+    this.open = function(method, url, async, user, password) {
+        settings = {
+            "method": method,
+            "url": url,
+            "async": async,
+            "user": user,
+            "password": password
+        };
+
+        this.abort();
+
+        setState(this.OPENED);
+    };
+
+    /**
+     * Sets a header for the request.
+     *
+     * @param string header Header name
+     * @param string value Header value
+     */
+    this.setRequestHeader = function(header, value) {
+        headers[header] = value;
+    };
+
+    /**
+     * Gets a header from the server response.
+     *
+     * @param string header Name of header to get.
+     * @return string Text of the header or null if it doesn't exist.
+     */
+    this.getResponseHeader = function(header) {
+        if (this.readyState > this.OPENED && response.headers.header) {
+            return header + ": " + response.headers.header;
+        }
+
+        return null;
+    };
+
+    /**
+     * Gets all the response headers.
+     *
+     * @return string
+     */
+    this.getAllResponseHeaders = function() {
+        if (this.readyState < this.HEADERS_RECEIVED) {
+            throw "INVALID_STATE_ERR: Headers have not been received.";
+        }
+        var result = "";
+
+        for (var i in response.headers) {
+            result += i + ": " + response.headers[i] + "\r\n";
+        }
+        return result.substr(0, result.length - 2);
+    };
+
+    /**
+     * Sends the request to the server.
+     *
+     * @param string data Optional data to send as request body.
+     */
     this.send = function(data) {
         if (this.readyState != this.OPENED) {
             throw "INVALID_STATE_ERR: connection must be opened before send() is called";
-		}
-		
-		/**
+        }
+
+        /**
          * Figure out if a host and/or port were specified.  Regex borrowed
-         * from parseUri and modified. Needs additional optimization.  
+         * from parseUri and modified. Needs additional optimization.
          * @see http://blog.stevenlevithan.com/archives/parseuri
-		 */
-		var loc = /^(?:([^:\/?#]+):)?(?:\/\/((?:(([^:@]*)(?::([^:@]*))?)?@)?([^:\/?#]*)(?::(\d*))?))?([^?#]*)/.exec(settings.url);
-		
-		// Determine the server
-		switch (loc[1]) {
-			case 'http':
-				var host = loc[6];
-				break;
-			
-			case undefined:
-			case '':
-				var host = "localhost";
-				break;
-			
-			case 'https':
-				throw "SSL is not implemented.";
-				break;
-			
-			default:
-				throw "Protocol not supported.";
-		}
-		
+         */
+        var loc = /^(?:([^:\/?#]+):)?(?:\/\/((?:(([^:@]*)(?::([^:@]*))?)?@)?([^:\/?#]*)(?::(\d*))?))?([^?#]*)/.exec(settings.url);
+
+        // Determine the server
+        switch (loc[1]) {
+            case 'http':
+                var host = loc[6];
+                break;
+
+            case undefined:
+            case '':
+                var host = "localhost";
+                break;
+
+            case 'https':
+                throw "SSL is not implemented.";
+                break;
+
+            default:
+                throw "Protocol not supported.";
+        }
+
         // Default to port 80. If accessing localhost on another port be sure
         // to use http://localhost:port/path
-		var port = loc[7] || 80;
-		
-		var uri = loc[8] || "/";
-		
-		// Set the Host header or the server may reject the request
-		headers["Host"] = host;
-		
-		client = http.createClient(port, host);
-
-		if (settings.method == "GET" || settings.method == "HEAD") {
-			data = null;
-		} else if (data) {
-			headers["Content-Length"] = data.length;
-			
-			if (!headers["Content-Type"]) {
-				headers["Content-Type"] = "text/plain;charset=UTF-8";
-			}
-		}
-		
-		// Use the correct request method
+        var port = loc[7] || 80;
+
+        var uri = loc[8] || "/";
+
+        // Set the Host header or the server may reject the request
+        headers["Host"] = host;
+
+        client = http.createClient(port, host);
+
+        if (settings.method == "GET" || settings.method == "HEAD") {
+            data = null;
+        } else if (data) {
+            headers["Content-Length"] = data.length;
+
+            if (!headers["Content-Type"]) {
+                headers["Content-Type"] = "text/plain;charset=UTF-8";
+            }
+        }
+
+        // Use the correct request method
         request = client.request(settings.method, uri, headers);
 
-		if (data) request.write(data);
+        if (data) request.write(data);
 
         request.addListener("response", function(resp) {
             response = resp;
-			response.setEncoding("utf8");
-			
-			setState(self.HEADERS_RECEIVED);
-			self.status = response.statusCode;
-
-			response.addListener("data", function(chunk) {
-				// Make sure there's some data
-				if (chunk) {
-					self.responseText += chunk;
-				}
-				setState(self.LOADING);
-			});
-	
-			response.addListener("end", function() {
-				setState(self.DONE);
-			});
+            response.setEncoding("utf8");
+
+            setState(self.HEADERS_RECEIVED);
+            self.status = response.statusCode;
+
+            response.addListener("data", function(chunk) {
+                // Make sure there's some data
+                if (chunk) {
+                    self.responseText += chunk;
+                }
+                setState(self.LOADING);
+            });
+
+            response.addListener("end", function() {
+                setState(self.DONE);
+            });
         });
         request.end();
-	};
-
-	/**
-	 * Aborts a request.
-	 */
-	this.abort = function() {
-		headers = defaultHeaders;
-		this.readyState = this.UNSENT;
-		this.responseText = "";
-		this.responseXML = "";
-	};
-	
-	var setState = function(state) {
-		self.readyState = state;
-		self.onreadystatechange();
-	}
+    };
+
+    /**
+     * Aborts a request.
+     */
+    this.abort = function() {
+        headers = defaultHeaders;
+        this.readyState = this.UNSENT;
+        this.responseText = "";
+        this.responseXML = "";
+    };
+
+    var setState = function(state) {
+        self.readyState = state;
+        self.onreadystatechange();
+    }
 };
diff --git a/tools/build.sh b/tools/build.sh
index cb677b8..5d7ad90 100755
--- a/tools/build.sh
+++ b/tools/build.sh
@@ -2,15 +2,15 @@
 home=`dirname $0`
 cd $home
 if [ -f buildpid.log ]; then
-	buildpid=`cat buildpid.log`
-	kill -9 $buildpid || true
-	rm -f buildpid.log
+    buildpid=`cat buildpid.log`
+    kill -9 $buildpid || true
+    rm -f buildpid.log
 fi
 echo $$ > buildpid.log
 if [ -f nodepid.log ]; then
-	nodepid=`cat nodepid.log`
-	kill -9 $nodepid || true
-	rm -f nodepid.log
+    nodepid=`cat nodepid.log`
+    kill -9 $nodepid || true
+    rm -f nodepid.log
 fi
 ver=`grep 'numeric.version.*=.*"' ../src/numeric.js | sed 's/numeric.version[ =]*"\([0-9.]*\)".*/\1/'`
 echo "Version is $ver"
diff --git a/tools/deploy/clean.sh b/tools/deploy/clean.sh
index f8e3db2..5753343 100755
--- a/tools/deploy/clean.sh
+++ b/tools/deploy/clean.sh
@@ -6,6 +6,6 @@ numeric=`readlink numeric || echo ""`
 staging=`readlink staging || echo ""`
 for x in v*; do
     if [ "z$x" != "z$numeric" -a "z$x" != "z$staging" ]; then
-	rm -rf $x
+    rm -rf $x
     fi
 done
diff --git a/tools/deploy/deploy.sh b/tools/deploy/deploy.sh
index e4c5c10..796a534 100755
--- a/tools/deploy/deploy.sh
+++ b/tools/deploy/deploy.sh
@@ -2,7 +2,7 @@
 set -e
 cd `dirname $0`
 cd ../..
-foo=`git status --porcelain` && 
+foo=`git status --porcelain` &&
 if [ "x" != "x$foo" ]; then
     echo "Cannot deploy while there are uncommited changes."
     exit
diff --git a/tools/jquery-1.7.1.js b/tools/jquery-1.7.1.js
index 8ccd0ea..1d79f2b 100644
--- a/tools/jquery-1.7.1.js
+++ b/tools/jquery-1.7.1.js
@@ -17,900 +17,900 @@
 
 // Use the correct document accordingly with window argument (sandbox)
 var document = window.document,
-	navigator = window.navigator,
-	location = window.location;
+    navigator = window.navigator,
+    location = window.location;
 var jQuery = (function() {
 
 // Define a local copy of jQuery
 var jQuery = function( selector, context ) {
-		// The jQuery object is actually just the init constructor 'enhanced'
-		return new jQuery.fn.init( selector, context, rootjQuery );
-	},
+        // The jQuery object is actually just the init constructor 'enhanced'
+        return new jQuery.fn.init( selector, context, rootjQuery );
+    },
 
-	// Map over jQuery in case of overwrite
-	_jQuery = window.jQuery,
+    // Map over jQuery in case of overwrite
+    _jQuery = window.jQuery,
 
-	// Map over the $ in case of overwrite
-	_$ = window.$,
+    // Map over the $ in case of overwrite
+    _$ = window.$,
 
-	// A central reference to the root jQuery(document)
-	rootjQuery,
+    // A central reference to the root jQuery(document)
+    rootjQuery,
 
-	// A simple way to check for HTML strings or ID strings
-	// Prioritize #id over  to avoid XSS via location.hash (#9521)
-	quickExpr = /^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/,
+    // A simple way to check for HTML strings or ID strings
+    // Prioritize #id over  to avoid XSS via location.hash (#9521)
+    quickExpr = /^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/,
 
-	// Check if a string has a non-whitespace character in it
-	rnotwhite = /\S/,
+    // Check if a string has a non-whitespace character in it
+    rnotwhite = /\S/,
 
-	// Used for trimming whitespace
-	trimLeft = /^\s+/,
-	trimRight = /\s+$/,
+    // Used for trimming whitespace
+    trimLeft = /^\s+/,
+    trimRight = /\s+$/,
 
-	// Match a standalone tag
-	rsingleTag = /^<(\w+)\s*\/?>(?:<\/\1>)?$/,
+    // Match a standalone tag
+    rsingleTag = /^<(\w+)\s*\/?>(?:<\/\1>)?$/,
 
-	// JSON RegExp
-	rvalidchars = /^[\],:{}\s]*$/,
-	rvalidescape = /\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,
-	rvalidtokens = /"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,
-	rvalidbraces = /(?:^|:|,)(?:\s*\[)+/g,
+    // JSON RegExp
+    rvalidchars = /^[\],:{}\s]*$/,
+    rvalidescape = /\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,
+    rvalidtokens = /"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,
+    rvalidbraces = /(?:^|:|,)(?:\s*\[)+/g,
 
-	// Useragent RegExp
-	rwebkit = /(webkit)[ \/]([\w.]+)/,
-	ropera = /(opera)(?:.*version)?[ \/]([\w.]+)/,
-	rmsie = /(msie) ([\w.]+)/,
-	rmozilla = /(mozilla)(?:.*? rv:([\w.]+))?/,
+    // Useragent RegExp
+    rwebkit = /(webkit)[ \/]([\w.]+)/,
+    ropera = /(opera)(?:.*version)?[ \/]([\w.]+)/,
+    rmsie = /(msie) ([\w.]+)/,
+    rmozilla = /(mozilla)(?:.*? rv:([\w.]+))?/,
 
-	// Matches dashed string for camelizing
-	rdashAlpha = /-([a-z]|[0-9])/ig,
-	rmsPrefix = /^-ms-/,
+    // Matches dashed string for camelizing
+    rdashAlpha = /-([a-z]|[0-9])/ig,
+    rmsPrefix = /^-ms-/,
 
-	// Used by jQuery.camelCase as callback to replace()
-	fcamelCase = function( all, letter ) {
-		return ( letter + "" ).toUpperCase();
-	},
+    // Used by jQuery.camelCase as callback to replace()
+    fcamelCase = function( all, letter ) {
+        return ( letter + "" ).toUpperCase();
+    },
 
-	// Keep a UserAgent string for use with jQuery.browser
-	userAgent = navigator.userAgent,
+    // Keep a UserAgent string for use with jQuery.browser
+    userAgent = navigator.userAgent,
 
-	// For matching the engine and version of the browser
-	browserMatch,
+    // For matching the engine and version of the browser
+    browserMatch,
 
-	// The deferred used on DOM ready
-	readyList,
+    // The deferred used on DOM ready
+    readyList,
 
-	// The ready event handler
-	DOMContentLoaded,
+    // The ready event handler
+    DOMContentLoaded,
 
-	// Save a reference to some core methods
-	toString = Object.prototype.toString,
-	hasOwn = Object.prototype.hasOwnProperty,
-	push = Array.prototype.push,
-	slice = Array.prototype.slice,
-	trim = String.prototype.trim,
-	indexOf = Array.prototype.indexOf,
+    // Save a reference to some core methods
+    toString = Object.prototype.toString,
+    hasOwn = Object.prototype.hasOwnProperty,
+    push = Array.prototype.push,
+    slice = Array.prototype.slice,
+    trim = String.prototype.trim,
+    indexOf = Array.prototype.indexOf,
 
-	// [[Class]] -> type pairs
-	class2type = {};
+    // [[Class]] -> type pairs
+    class2type = {};
 
 jQuery.fn = jQuery.prototype = {
-	constructor: jQuery,
-	init: function( selector, context, rootjQuery ) {
-		var match, elem, ret, doc;
-
-		// Handle $(""), $(null), or $(undefined)
-		if ( !selector ) {
-			return this;
-		}
-
-		// Handle $(DOMElement)
-		if ( selector.nodeType ) {
-			this.context = this[0] = selector;
-			this.length = 1;
-			return this;
-		}
-
-		// The body element only exists once, optimize finding it
-		if ( selector === "body" && !context && document.body ) {
-			this.context = document;
-			this[0] = document.body;
-			this.selector = selector;
-			this.length = 1;
-			return this;
-		}
-
-		// Handle HTML strings
-		if ( typeof selector === "string" ) {
-			// Are we dealing with HTML string or an ID?
-			if ( selector.charAt(0) === "<" && selector.charAt( selector.length - 1 ) === ">" && selector.length >= 3 ) {
-				// Assume that strings that start and end with <> are HTML and skip the regex check
-				match = [ null, selector, null ];
-
-			} else {
-				match = quickExpr.exec( selector );
-			}
-
-			// Verify a match, and that no context was specified for #id
-			if ( match && (match[1] || !context) ) {
-
-				// HANDLE: $(html) -> $(array)
-				if ( match[1] ) {
-					context = context instanceof jQuery ? context[0] : context;
-					doc = ( context ? context.ownerDocument || context : document );
-
-					// If a single string is passed in and it's a single tag
-					// just do a createElement and skip the rest
-					ret = rsingleTag.exec( selector );
-
-					if ( ret ) {
-						if ( jQuery.isPlainObject( context ) ) {
-							selector = [ document.createElement( ret[1] ) ];
-							jQuery.fn.attr.call( selector, context, true );
-
-						} else {
-							selector = [ doc.createElement( ret[1] ) ];
-						}
-
-					} else {
-						ret = jQuery.buildFragment( [ match[1] ], [ doc ] );
-						selector = ( ret.cacheable ? jQuery.clone(ret.fragment) : ret.fragment ).childNodes;
-					}
-
-					return jQuery.merge( this, selector );
-
-				// HANDLE: $("#id")
-				} else {
-					elem = document.getElementById( match[2] );
-
-					// Check parentNode to catch when Blackberry 4.6 returns
-					// nodes that are no longer in the document #6963
-					if ( elem && elem.parentNode ) {
-						// Handle the case where IE and Opera return items
-						// by name instead of ID
-						if ( elem.id !== match[2] ) {
-							return rootjQuery.find( selector );
-						}
-
-						// Otherwise, we inject the element directly into the jQuery object
-						this.length = 1;
-						this[0] = elem;
-					}
-
-					this.context = document;
-					this.selector = selector;
-					return this;
-				}
-
-			// HANDLE: $(expr, $(...))
-			} else if ( !context || context.jquery ) {
-				return ( context || rootjQuery ).find( selector );
-
-			// HANDLE: $(expr, context)
-			// (which is just equivalent to: $(context).find(expr)
-			} else {
-				return this.constructor( context ).find( selector );
-			}
-
-		// HANDLE: $(function)
-		// Shortcut for document ready
-		} else if ( jQuery.isFunction( selector ) ) {
-			return rootjQuery.ready( selector );
-		}
-
-		if ( selector.selector !== undefined ) {
-			this.selector = selector.selector;
-			this.context = selector.context;
-		}
-
-		return jQuery.makeArray( selector, this );
-	},
-
-	// Start with an empty selector
-	selector: "",
-
-	// The current version of jQuery being used
-	jquery: "1.7.1",
-
-	// The default length of a jQuery object is 0
-	length: 0,
-
-	// The number of elements contained in the matched element set
-	size: function() {
-		return this.length;
-	},
-
-	toArray: function() {
-		return slice.call( this, 0 );
-	},
-
-	// Get the Nth element in the matched element set OR
-	// Get the whole matched element set as a clean array
-	get: function( num ) {
-		return num == null ?
-
-			// Return a 'clean' array
-			this.toArray() :
-
-			// Return just the object
-			( num < 0 ? this[ this.length + num ] : this[ num ] );
-	},
-
-	// Take an array of elements and push it onto the stack
-	// (returning the new matched element set)
-	pushStack: function( elems, name, selector ) {
-		// Build a new jQuery matched element set
-		var ret = this.constructor();
-
-		if ( jQuery.isArray( elems ) ) {
-			push.apply( ret, elems );
-
-		} else {
-			jQuery.merge( ret, elems );
-		}
-
-		// Add the old object onto the stack (as a reference)
-		ret.prevObject = this;
-
-		ret.context = this.context;
-
-		if ( name === "find" ) {
-			ret.selector = this.selector + ( this.selector ? " " : "" ) + selector;
-		} else if ( name ) {
-			ret.selector = this.selector + "." + name + "(" + selector + ")";
-		}
-
-		// Return the newly-formed element set
-		return ret;
-	},
-
-	// Execute a callback for every element in the matched set.
-	// (You can seed the arguments with an array of args, but this is
-	// only used internally.)
-	each: function( callback, args ) {
-		return jQuery.each( this, callback, args );
-	},
-
-	ready: function( fn ) {
-		// Attach the listeners
-		jQuery.bindReady();
-
-		// Add the callback
-		readyList.add( fn );
-
-		return this;
-	},
-
-	eq: function( i ) {
-		i = +i;
-		return i === -1 ?
-			this.slice( i ) :
-			this.slice( i, i + 1 );
-	},
-
-	first: function() {
-		return this.eq( 0 );
-	},
-
-	last: function() {
-		return this.eq( -1 );
-	},
-
-	slice: function() {
-		return this.pushStack( slice.apply( this, arguments ),
-			"slice", slice.call(arguments).join(",") );
-	},
-
-	map: function( callback ) {
-		return this.pushStack( jQuery.map(this, function( elem, i ) {
-			return callback.call( elem, i, elem );
-		}));
-	},
-
-	end: function() {
-		return this.prevObject || this.constructor(null);
-	},
-
-	// For internal use only.
-	// Behaves like an Array's method, not like a jQuery method.
-	push: push,
-	sort: [].sort,
-	splice: [].splice
+    constructor: jQuery,
+    init: function( selector, context, rootjQuery ) {
+        var match, elem, ret, doc;
+
+        // Handle $(""), $(null), or $(undefined)
+        if ( !selector ) {
+            return this;
+        }
+
+        // Handle $(DOMElement)
+        if ( selector.nodeType ) {
+            this.context = this[0] = selector;
+            this.length = 1;
+            return this;
+        }
+
+        // The body element only exists once, optimize finding it
+        if ( selector === "body" && !context && document.body ) {
+            this.context = document;
+            this[0] = document.body;
+            this.selector = selector;
+            this.length = 1;
+            return this;
+        }
+
+        // Handle HTML strings
+        if ( typeof selector === "string" ) {
+            // Are we dealing with HTML string or an ID?
+            if ( selector.charAt(0) === "<" && selector.charAt( selector.length - 1 ) === ">" && selector.length >= 3 ) {
+                // Assume that strings that start and end with <> are HTML and skip the regex check
+                match = [ null, selector, null ];
+
+            } else {
+                match = quickExpr.exec( selector );
+            }
+
+            // Verify a match, and that no context was specified for #id
+            if ( match && (match[1] || !context) ) {
+
+                // HANDLE: $(html) -> $(array)
+                if ( match[1] ) {
+                    context = context instanceof jQuery ? context[0] : context;
+                    doc = ( context ? context.ownerDocument || context : document );
+
+                    // If a single string is passed in and it's a single tag
+                    // just do a createElement and skip the rest
+                    ret = rsingleTag.exec( selector );
+
+                    if ( ret ) {
+                        if ( jQuery.isPlainObject( context ) ) {
+                            selector = [ document.createElement( ret[1] ) ];
+                            jQuery.fn.attr.call( selector, context, true );
+
+                        } else {
+                            selector = [ doc.createElement( ret[1] ) ];
+                        }
+
+                    } else {
+                        ret = jQuery.buildFragment( [ match[1] ], [ doc ] );
+                        selector = ( ret.cacheable ? jQuery.clone(ret.fragment) : ret.fragment ).childNodes;
+                    }
+
+                    return jQuery.merge( this, selector );
+
+                // HANDLE: $("#id")
+                } else {
+                    elem = document.getElementById( match[2] );
+
+                    // Check parentNode to catch when Blackberry 4.6 returns
+                    // nodes that are no longer in the document #6963
+                    if ( elem && elem.parentNode ) {
+                        // Handle the case where IE and Opera return items
+                        // by name instead of ID
+                        if ( elem.id !== match[2] ) {
+                            return rootjQuery.find( selector );
+                        }
+
+                        // Otherwise, we inject the element directly into the jQuery object
+                        this.length = 1;
+                        this[0] = elem;
+                    }
+
+                    this.context = document;
+                    this.selector = selector;
+                    return this;
+                }
+
+            // HANDLE: $(expr, $(...))
+            } else if ( !context || context.jquery ) {
+                return ( context || rootjQuery ).find( selector );
+
+            // HANDLE: $(expr, context)
+            // (which is just equivalent to: $(context).find(expr)
+            } else {
+                return this.constructor( context ).find( selector );
+            }
+
+        // HANDLE: $(function)
+        // Shortcut for document ready
+        } else if ( jQuery.isFunction( selector ) ) {
+            return rootjQuery.ready( selector );
+        }
+
+        if ( selector.selector !== undefined ) {
+            this.selector = selector.selector;
+            this.context = selector.context;
+        }
+
+        return jQuery.makeArray( selector, this );
+    },
+
+    // Start with an empty selector
+    selector: "",
+
+    // The current version of jQuery being used
+    jquery: "1.7.1",
+
+    // The default length of a jQuery object is 0
+    length: 0,
+
+    // The number of elements contained in the matched element set
+    size: function() {
+        return this.length;
+    },
+
+    toArray: function() {
+        return slice.call( this, 0 );
+    },
+
+    // Get the Nth element in the matched element set OR
+    // Get the whole matched element set as a clean array
+    get: function( num ) {
+        return num == null ?
+
+            // Return a 'clean' array
+            this.toArray() :
+
+            // Return just the object
+            ( num < 0 ? this[ this.length + num ] : this[ num ] );
+    },
+
+    // Take an array of elements and push it onto the stack
+    // (returning the new matched element set)
+    pushStack: function( elems, name, selector ) {
+        // Build a new jQuery matched element set
+        var ret = this.constructor();
+
+        if ( jQuery.isArray( elems ) ) {
+            push.apply( ret, elems );
+
+        } else {
+            jQuery.merge( ret, elems );
+        }
+
+        // Add the old object onto the stack (as a reference)
+        ret.prevObject = this;
+
+        ret.context = this.context;
+
+        if ( name === "find" ) {
+            ret.selector = this.selector + ( this.selector ? " " : "" ) + selector;
+        } else if ( name ) {
+            ret.selector = this.selector + "." + name + "(" + selector + ")";
+        }
+
+        // Return the newly-formed element set
+        return ret;
+    },
+
+    // Execute a callback for every element in the matched set.
+    // (You can seed the arguments with an array of args, but this is
+    // only used internally.)
+    each: function( callback, args ) {
+        return jQuery.each( this, callback, args );
+    },
+
+    ready: function( fn ) {
+        // Attach the listeners
+        jQuery.bindReady();
+
+        // Add the callback
+        readyList.add( fn );
+
+        return this;
+    },
+
+    eq: function( i ) {
+        i = +i;
+        return i === -1 ?
+            this.slice( i ) :
+            this.slice( i, i + 1 );
+    },
+
+    first: function() {
+        return this.eq( 0 );
+    },
+
+    last: function() {
+        return this.eq( -1 );
+    },
+
+    slice: function() {
+        return this.pushStack( slice.apply( this, arguments ),
+            "slice", slice.call(arguments).join(",") );
+    },
+
+    map: function( callback ) {
+        return this.pushStack( jQuery.map(this, function( elem, i ) {
+            return callback.call( elem, i, elem );
+        }));
+    },
+
+    end: function() {
+        return this.prevObject || this.constructor(null);
+    },
+
+    // For internal use only.
+    // Behaves like an Array's method, not like a jQuery method.
+    push: push,
+    sort: [].sort,
+    splice: [].splice
 };
 
 // Give the init function the jQuery prototype for later instantiation
 jQuery.fn.init.prototype = jQuery.fn;
 
 jQuery.extend = jQuery.fn.extend = function() {
-	var options, name, src, copy, copyIsArray, clone,
-		target = arguments[0] || {},
-		i = 1,
-		length = arguments.length,
-		deep = false;
-
-	// Handle a deep copy situation
-	if ( typeof target === "boolean" ) {
-		deep = target;
-		target = arguments[1] || {};
-		// skip the boolean and the target
-		i = 2;
-	}
-
-	// Handle case when target is a string or something (possible in deep copy)
-	if ( typeof target !== "object" && !jQuery.isFunction(target) ) {
-		target = {};
-	}
-
-	// extend jQuery itself if only one argument is passed
-	if ( length === i ) {
-		target = this;
-		--i;
-	}
-
-	for ( ; i < length; i++ ) {
-		// Only deal with non-null/undefined values
-		if ( (options = arguments[ i ]) != null ) {
-			// Extend the base object
-			for ( name in options ) {
-				src = target[ name ];
-				copy = options[ name ];
-
-				// Prevent never-ending loop
-				if ( target === copy ) {
-					continue;
-				}
-
-				// Recurse if we're merging plain objects or arrays
-				if ( deep && copy && ( jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)) ) ) {
-					if ( copyIsArray ) {
-						copyIsArray = false;
-						clone = src && jQuery.isArray(src) ? src : [];
-
-					} else {
-						clone = src && jQuery.isPlainObject(src) ? src : {};
-					}
-
-					// Never move original objects, clone them
-					target[ name ] = jQuery.extend( deep, clone, copy );
-
-				// Don't bring in undefined values
-				} else if ( copy !== undefined ) {
-					target[ name ] = copy;
-				}
-			}
-		}
-	}
-
-	// Return the modified object
-	return target;
+    var options, name, src, copy, copyIsArray, clone,
+        target = arguments[0] || {},
+        i = 1,
+        length = arguments.length,
+        deep = false;
+
+    // Handle a deep copy situation
+    if ( typeof target === "boolean" ) {
+        deep = target;
+        target = arguments[1] || {};
+        // skip the boolean and the target
+        i = 2;
+    }
+
+    // Handle case when target is a string or something (possible in deep copy)
+    if ( typeof target !== "object" && !jQuery.isFunction(target) ) {
+        target = {};
+    }
+
+    // extend jQuery itself if only one argument is passed
+    if ( length === i ) {
+        target = this;
+        --i;
+    }
+
+    for ( ; i < length; i++ ) {
+        // Only deal with non-null/undefined values
+        if ( (options = arguments[ i ]) != null ) {
+            // Extend the base object
+            for ( name in options ) {
+                src = target[ name ];
+                copy = options[ name ];
+
+                // Prevent never-ending loop
+                if ( target === copy ) {
+                    continue;
+                }
+
+                // Recurse if we're merging plain objects or arrays
+                if ( deep && copy && ( jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)) ) ) {
+                    if ( copyIsArray ) {
+                        copyIsArray = false;
+                        clone = src && jQuery.isArray(src) ? src : [];
+
+                    } else {
+                        clone = src && jQuery.isPlainObject(src) ? src : {};
+                    }
+
+                    // Never move original objects, clone them
+                    target[ name ] = jQuery.extend( deep, clone, copy );
+
+                // Don't bring in undefined values
+                } else if ( copy !== undefined ) {
+                    target[ name ] = copy;
+                }
+            }
+        }
+    }
+
+    // Return the modified object
+    return target;
 };
 
 jQuery.extend({
-	noConflict: function( deep ) {
-		if ( window.$ === jQuery ) {
-			window.$ = _$;
-		}
-
-		if ( deep && window.jQuery === jQuery ) {
-			window.jQuery = _jQuery;
-		}
-
-		return jQuery;
-	},
-
-	// Is the DOM ready to be used? Set to true once it occurs.
-	isReady: false,
-
-	// A counter to track how many items to wait for before
-	// the ready event fires. See #6781
-	readyWait: 1,
-
-	// Hold (or release) the ready event
-	holdReady: function( hold ) {
-		if ( hold ) {
-			jQuery.readyWait++;
-		} else {
-			jQuery.ready( true );
-		}
-	},
-
-	// Handle when the DOM is ready
-	ready: function( wait ) {
-		// Either a released hold or an DOMready/load event and not yet ready
-		if ( (wait === true && !--jQuery.readyWait) || (wait !== true && !jQuery.isReady) ) {
-			// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
-			if ( !document.body ) {
-				return setTimeout( jQuery.ready, 1 );
-			}
-
-			// Remember that the DOM is ready
-			jQuery.isReady = true;
-
-			// If a normal DOM Ready event fired, decrement, and wait if need be
-			if ( wait !== true && --jQuery.readyWait > 0 ) {
-				return;
-			}
-
-			// If there are functions bound, to execute
-			readyList.fireWith( document, [ jQuery ] );
-
-			// Trigger any bound ready events
-			if ( jQuery.fn.trigger ) {
-				jQuery( document ).trigger( "ready" ).off( "ready" );
-			}
-		}
-	},
-
-	bindReady: function() {
-		if ( readyList ) {
-			return;
-		}
-
-		readyList = jQuery.Callbacks( "once memory" );
-
-		// Catch cases where $(document).ready() is called after the
-		// browser event has already occurred.
-		if ( document.readyState === "complete" ) {
-			// Handle it asynchronously to allow scripts the opportunity to delay ready
-			return setTimeout( jQuery.ready, 1 );
-		}
-
-		// Mozilla, Opera and webkit nightlies currently support this event
-		if ( document.addEventListener ) {
-			// Use the handy event callback
-			document.addEventListener( "DOMContentLoaded", DOMContentLoaded, false );
-
-			// A fallback to window.onload, that will always work
-			window.addEventListener( "load", jQuery.ready, false );
-
-		// If IE event model is used
-		} else if ( document.attachEvent ) {
-			// ensure firing before onload,
-			// maybe late but safe also for iframes
-			document.attachEvent( "onreadystatechange", DOMContentLoaded );
-
-			// A fallback to window.onload, that will always work
-			window.attachEvent( "onload", jQuery.ready );
-
-			// If IE and not a frame
-			// continually check to see if the document is ready
-			var toplevel = false;
-
-			try {
-				toplevel = window.frameElement == null;
-			} catch(e) {}
-
-			if ( document.documentElement.doScroll && toplevel ) {
-				doScrollCheck();
-			}
-		}
-	},
-
-	// See test/unit/core.js for details concerning isFunction.
-	// Since version 1.3, DOM methods and functions like alert
-	// aren't supported. They return false on IE (#2968).
-	isFunction: function( obj ) {
-		return jQuery.type(obj) === "function";
-	},
-
-	isArray: Array.isArray || function( obj ) {
-		return jQuery.type(obj) === "array";
-	},
-
-	// A crude way of determining if an object is a window
-	isWindow: function( obj ) {
-		return obj && typeof obj === "object" && "setInterval" in obj;
-	},
-
-	isNumeric: function( obj ) {
-		return !isNaN( parseFloat(obj) ) && isFinite( obj );
-	},
-
-	type: function( obj ) {
-		return obj == null ?
-			String( obj ) :
-			class2type[ toString.call(obj) ] || "object";
-	},
-
-	isPlainObject: function( obj ) {
-		// Must be an Object.
-		// Because of IE, we also have to check the presence of the constructor property.
-		// Make sure that DOM nodes and window objects don't pass through, as well
-		if ( !obj || jQuery.type(obj) !== "object" || obj.nodeType || jQuery.isWindow( obj ) ) {
-			return false;
-		}
-
-		try {
-			// Not own constructor property must be Object
-			if ( obj.constructor &&
-				!hasOwn.call(obj, "constructor") &&
-				!hasOwn.call(obj.constructor.prototype, "isPrototypeOf") ) {
-				return false;
-			}
-		} catch ( e ) {
-			// IE8,9 Will throw exceptions on certain host objects #9897
-			return false;
-		}
-
-		// Own properties are enumerated firstly, so to speed up,
-		// if last one is own, then all properties are own.
-
-		var key;
-		for ( key in obj ) {}
-
-		return key === undefined || hasOwn.call( obj, key );
-	},
-
-	isEmptyObject: function( obj ) {
-		for ( var name in obj ) {
-			return false;
-		}
-		return true;
-	},
-
-	error: function( msg ) {
-		throw new Error( msg );
-	},
-
-	parseJSON: function( data ) {
-		if ( typeof data !== "string" || !data ) {
-			return null;
-		}
-
-		// Make sure leading/trailing whitespace is removed (IE can't handle it)
-		data = jQuery.trim( data );
-
-		// Attempt to parse using the native JSON parser first
-		if ( window.JSON && window.JSON.parse ) {
-			return window.JSON.parse( data );
-		}
-
-		// Make sure the incoming data is actual JSON
-		// Logic borrowed from http://json.org/json2.js
-		if ( rvalidchars.test( data.replace( rvalidescape, "@" )
-			.replace( rvalidtokens, "]" )
-			.replace( rvalidbraces, "")) ) {
-
-			return ( new Function( "return " + data ) )();
-
-		}
-		jQuery.error( "Invalid JSON: " + data );
-	},
-
-	// Cross-browser xml parsing
-	parseXML: function( data ) {
-		var xml, tmp;
-		try {
-			if ( window.DOMParser ) { // Standard
-				tmp = new DOMParser();
-				xml = tmp.parseFromString( data , "text/xml" );
-			} else { // IE
-				xml = new ActiveXObject( "Microsoft.XMLDOM" );
-				xml.async = "false";
-				xml.loadXML( data );
-			}
-		} catch( e ) {
-			xml = undefined;
-		}
-		if ( !xml || !xml.documentElement || xml.getElementsByTagName( "parsererror" ).length ) {
-			jQuery.error( "Invalid XML: " + data );
-		}
-		return xml;
-	},
-
-	noop: function() {},
-
-	// Evaluates a script in a global context
-	// Workarounds based on findings by Jim Driscoll
-	// http://weblogs.java.net/blog/driscoll/archive/2009/09/08/eval-javascript-global-context
-	globalEval: function( data ) {
-		if ( data && rnotwhite.test( data ) ) {
-			// We use execScript on Internet Explorer
-			// We use an anonymous function so that context is window
-			// rather than jQuery in Firefox
-			( window.execScript || function( data ) {
-				window[ "eval" ].call( window, data );
-			} )( data );
-		}
-	},
-
-	// Convert dashed to camelCase; used by the css and data modules
-	// Microsoft forgot to hump their vendor prefix (#9572)
-	camelCase: function( string ) {
-		return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
-	},
-
-	nodeName: function( elem, name ) {
-		return elem.nodeName && elem.nodeName.toUpperCase() === name.toUpperCase();
-	},
-
-	// args is for internal usage only
-	each: function( object, callback, args ) {
-		var name, i = 0,
-			length = object.length,
-			isObj = length === undefined || jQuery.isFunction( object );
-
-		if ( args ) {
-			if ( isObj ) {
-				for ( name in object ) {
-					if ( callback.apply( object[ name ], args ) === false ) {
-						break;
-					}
-				}
-			} else {
-				for ( ; i < length; ) {
-					if ( callback.apply( object[ i++ ], args ) === false ) {
-						break;
-					}
-				}
-			}
-
-		// A special, fast, case for the most common use of each
-		} else {
-			if ( isObj ) {
-				for ( name in object ) {
-					if ( callback.call( object[ name ], name, object[ name ] ) === false ) {
-						break;
-					}
-				}
-			} else {
-				for ( ; i < length; ) {
-					if ( callback.call( object[ i ], i, object[ i++ ] ) === false ) {
-						break;
-					}
-				}
-			}
-		}
-
-		return object;
-	},
-
-	// Use native String.trim function wherever possible
-	trim: trim ?
-		function( text ) {
-			return text == null ?
-				"" :
-				trim.call( text );
-		} :
-
-		// Otherwise use our own trimming functionality
-		function( text ) {
-			return text == null ?
-				"" :
-				text.toString().replace( trimLeft, "" ).replace( trimRight, "" );
-		},
-
-	// results is for internal usage only
-	makeArray: function( array, results ) {
-		var ret = results || [];
-
-		if ( array != null ) {
-			// The window, strings (and functions) also have 'length'
-			// Tweaked logic slightly to handle Blackberry 4.7 RegExp issues #6930
-			var type = jQuery.type( array );
-
-			if ( array.length == null || type === "string" || type === "function" || type === "regexp" || jQuery.isWindow( array ) ) {
-				push.call( ret, array );
-			} else {
-				jQuery.merge( ret, array );
-			}
-		}
-
-		return ret;
-	},
-
-	inArray: function( elem, array, i ) {
-		var len;
-
-		if ( array ) {
-			if ( indexOf ) {
-				return indexOf.call( array, elem, i );
-			}
-
-			len = array.length;
-			i = i ? i < 0 ? Math.max( 0, len + i ) : i : 0;
-
-			for ( ; i < len; i++ ) {
-				// Skip accessing in sparse arrays
-				if ( i in array && array[ i ] === elem ) {
-					return i;
-				}
-			}
-		}
-
-		return -1;
-	},
-
-	merge: function( first, second ) {
-		var i = first.length,
-			j = 0;
-
-		if ( typeof second.length === "number" ) {
-			for ( var l = second.length; j < l; j++ ) {
-				first[ i++ ] = second[ j ];
-			}
-
-		} else {
-			while ( second[j] !== undefined ) {
-				first[ i++ ] = second[ j++ ];
-			}
-		}
-
-		first.length = i;
-
-		return first;
-	},
-
-	grep: function( elems, callback, inv ) {
-		var ret = [], retVal;
-		inv = !!inv;
-
-		// Go through the array, only saving the items
-		// that pass the validator function
-		for ( var i = 0, length = elems.length; i < length; i++ ) {
-			retVal = !!callback( elems[ i ], i );
-			if ( inv !== retVal ) {
-				ret.push( elems[ i ] );
-			}
-		}
-
-		return ret;
-	},
-
-	// arg is for internal usage only
-	map: function( elems, callback, arg ) {
-		var value, key, ret = [],
-			i = 0,
-			length = elems.length,
-			// jquery objects are treated as arrays
-			isArray = elems instanceof jQuery || length !== undefined && typeof length === "number" && ( ( length > 0 && elems[ 0 ] && elems[ length -1 ] ) || length === 0 || jQuery.isArray( elems ) ) ;
-
-		// Go through the array, translating each of the items to their
-		if ( isArray ) {
-			for ( ; i < length; i++ ) {
-				value = callback( elems[ i ], i, arg );
-
-				if ( value != null ) {
-					ret[ ret.length ] = value;
-				}
-			}
-
-		// Go through every key on the object,
-		} else {
-			for ( key in elems ) {
-				value = callback( elems[ key ], key, arg );
-
-				if ( value != null ) {
-					ret[ ret.length ] = value;
-				}
-			}
-		}
-
-		// Flatten any nested arrays
-		return ret.concat.apply( [], ret );
-	},
-
-	// A global GUID counter for objects
-	guid: 1,
-
-	// Bind a function to a context, optionally partially applying any
-	// arguments.
-	proxy: function( fn, context ) {
-		if ( typeof context === "string" ) {
-			var tmp = fn[ context ];
-			context = fn;
-			fn = tmp;
-		}
-
-		// Quick check to determine if target is callable, in the spec
-		// this throws a TypeError, but we will just return undefined.
-		if ( !jQuery.isFunction( fn ) ) {
-			return undefined;
-		}
-
-		// Simulated bind
-		var args = slice.call( arguments, 2 ),
-			proxy = function() {
-				return fn.apply( context, args.concat( slice.call( arguments ) ) );
-			};
-
-		// Set the guid of unique handler to the same of original handler, so it can be removed
-		proxy.guid = fn.guid = fn.guid || proxy.guid || jQuery.guid++;
-
-		return proxy;
-	},
-
-	// Mutifunctional method to get and set values to a collection
-	// The value/s can optionally be executed if it's a function
-	access: function( elems, key, value, exec, fn, pass ) {
-		var length = elems.length;
-
-		// Setting many attributes
-		if ( typeof key === "object" ) {
-			for ( var k in key ) {
-				jQuery.access( elems, k, key[k], exec, fn, value );
-			}
-			return elems;
-		}
-
-		// Setting one attribute
-		if ( value !== undefined ) {
-			// Optionally, function values get executed if exec is true
-			exec = !pass && exec && jQuery.isFunction(value);
-
-			for ( var i = 0; i < length; i++ ) {
-				fn( elems[i], key, exec ? value.call( elems[i], i, fn( elems[i], key ) ) : value, pass );
-			}
-
-			return elems;
-		}
-
-		// Getting an attribute
-		return length ? fn( elems[0], key ) : undefined;
-	},
-
-	now: function() {
-		return ( new Date() ).getTime();
-	},
-
-	// Use of jQuery.browser is frowned upon.
-	// More details: http://docs.jquery.com/Utilities/jQuery.browser
-	uaMatch: function( ua ) {
-		ua = ua.toLowerCase();
-
-		var match = rwebkit.exec( ua ) ||
-			ropera.exec( ua ) ||
-			rmsie.exec( ua ) ||
-			ua.indexOf("compatible") < 0 && rmozilla.exec( ua ) ||
-			[];
-
-		return { browser: match[1] || "", version: match[2] || "0" };
-	},
-
-	sub: function() {
-		function jQuerySub( selector, context ) {
-			return new jQuerySub.fn.init( selector, context );
-		}
-		jQuery.extend( true, jQuerySub, this );
-		jQuerySub.superclass = this;
-		jQuerySub.fn = jQuerySub.prototype = this();
-		jQuerySub.fn.constructor = jQuerySub;
-		jQuerySub.sub = this.sub;
-		jQuerySub.fn.init = function init( selector, context ) {
-			if ( context && context instanceof jQuery && !(context instanceof jQuerySub) ) {
-				context = jQuerySub( context );
-			}
-
-			return jQuery.fn.init.call( this, selector, context, rootjQuerySub );
-		};
-		jQuerySub.fn.init.prototype = jQuerySub.fn;
-		var rootjQuerySub = jQuerySub(document);
-		return jQuerySub;
-	},
-
-	browser: {}
+    noConflict: function( deep ) {
+        if ( window.$ === jQuery ) {
+            window.$ = _$;
+        }
+
+        if ( deep && window.jQuery === jQuery ) {
+            window.jQuery = _jQuery;
+        }
+
+        return jQuery;
+    },
+
+    // Is the DOM ready to be used? Set to true once it occurs.
+    isReady: false,
+
+    // A counter to track how many items to wait for before
+    // the ready event fires. See #6781
+    readyWait: 1,
+
+    // Hold (or release) the ready event
+    holdReady: function( hold ) {
+        if ( hold ) {
+            jQuery.readyWait++;
+        } else {
+            jQuery.ready( true );
+        }
+    },
+
+    // Handle when the DOM is ready
+    ready: function( wait ) {
+        // Either a released hold or an DOMready/load event and not yet ready
+        if ( (wait === true && !--jQuery.readyWait) || (wait !== true && !jQuery.isReady) ) {
+            // Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
+            if ( !document.body ) {
+                return setTimeout( jQuery.ready, 1 );
+            }
+
+            // Remember that the DOM is ready
+            jQuery.isReady = true;
+
+            // If a normal DOM Ready event fired, decrement, and wait if need be
+            if ( wait !== true && --jQuery.readyWait > 0 ) {
+                return;
+            }
+
+            // If there are functions bound, to execute
+            readyList.fireWith( document, [ jQuery ] );
+
+            // Trigger any bound ready events
+            if ( jQuery.fn.trigger ) {
+                jQuery( document ).trigger( "ready" ).off( "ready" );
+            }
+        }
+    },
+
+    bindReady: function() {
+        if ( readyList ) {
+            return;
+        }
+
+        readyList = jQuery.Callbacks( "once memory" );
+
+        // Catch cases where $(document).ready() is called after the
+        // browser event has already occurred.
+        if ( document.readyState === "complete" ) {
+            // Handle it asynchronously to allow scripts the opportunity to delay ready
+            return setTimeout( jQuery.ready, 1 );
+        }
+
+        // Mozilla, Opera and webkit nightlies currently support this event
+        if ( document.addEventListener ) {
+            // Use the handy event callback
+            document.addEventListener( "DOMContentLoaded", DOMContentLoaded, false );
+
+            // A fallback to window.onload, that will always work
+            window.addEventListener( "load", jQuery.ready, false );
+
+        // If IE event model is used
+        } else if ( document.attachEvent ) {
+            // ensure firing before onload,
+            // maybe late but safe also for iframes
+            document.attachEvent( "onreadystatechange", DOMContentLoaded );
+
+            // A fallback to window.onload, that will always work
+            window.attachEvent( "onload", jQuery.ready );
+
+            // If IE and not a frame
+            // continually check to see if the document is ready
+            var toplevel = false;
+
+            try {
+                toplevel = window.frameElement == null;
+            } catch(e) {}
+
+            if ( document.documentElement.doScroll && toplevel ) {
+                doScrollCheck();
+            }
+        }
+    },
+
+    // See test/unit/core.js for details concerning isFunction.
+    // Since version 1.3, DOM methods and functions like alert
+    // aren't supported. They return false on IE (#2968).
+    isFunction: function( obj ) {
+        return jQuery.type(obj) === "function";
+    },
+
+    isArray: Array.isArray || function( obj ) {
+        return jQuery.type(obj) === "array";
+    },
+
+    // A crude way of determining if an object is a window
+    isWindow: function( obj ) {
+        return obj && typeof obj === "object" && "setInterval" in obj;
+    },
+
+    isNumeric: function( obj ) {
+        return !isNaN( parseFloat(obj) ) && isFinite( obj );
+    },
+
+    type: function( obj ) {
+        return obj == null ?
+            String( obj ) :
+            class2type[ toString.call(obj) ] || "object";
+    },
+
+    isPlainObject: function( obj ) {
+        // Must be an Object.
+        // Because of IE, we also have to check the presence of the constructor property.
+        // Make sure that DOM nodes and window objects don't pass through, as well
+        if ( !obj || jQuery.type(obj) !== "object" || obj.nodeType || jQuery.isWindow( obj ) ) {
+            return false;
+        }
+
+        try {
+            // Not own constructor property must be Object
+            if ( obj.constructor &&
+                !hasOwn.call(obj, "constructor") &&
+                !hasOwn.call(obj.constructor.prototype, "isPrototypeOf") ) {
+                return false;
+            }
+        } catch ( e ) {
+            // IE8,9 Will throw exceptions on certain host objects #9897
+            return false;
+        }
+
+        // Own properties are enumerated firstly, so to speed up,
+        // if last one is own, then all properties are own.
+
+        var key;
+        for ( key in obj ) {}
+
+        return key === undefined || hasOwn.call( obj, key );
+    },
+
+    isEmptyObject: function( obj ) {
+        for ( var name in obj ) {
+            return false;
+        }
+        return true;
+    },
+
+    error: function( msg ) {
+        throw new Error( msg );
+    },
+
+    parseJSON: function( data ) {
+        if ( typeof data !== "string" || !data ) {
+            return null;
+        }
+
+        // Make sure leading/trailing whitespace is removed (IE can't handle it)
+        data = jQuery.trim( data );
+
+        // Attempt to parse using the native JSON parser first
+        if ( window.JSON && window.JSON.parse ) {
+            return window.JSON.parse( data );
+        }
+
+        // Make sure the incoming data is actual JSON
+        // Logic borrowed from http://json.org/json2.js
+        if ( rvalidchars.test( data.replace( rvalidescape, "@" )
+            .replace( rvalidtokens, "]" )
+            .replace( rvalidbraces, "")) ) {
+
+            return ( new Function( "return " + data ) )();
+
+        }
+        jQuery.error( "Invalid JSON: " + data );
+    },
+
+    // Cross-browser xml parsing
+    parseXML: function( data ) {
+        var xml, tmp;
+        try {
+            if ( window.DOMParser ) { // Standard
+                tmp = new DOMParser();
+                xml = tmp.parseFromString( data , "text/xml" );
+            } else { // IE
+                xml = new ActiveXObject( "Microsoft.XMLDOM" );
+                xml.async = "false";
+                xml.loadXML( data );
+            }
+        } catch( e ) {
+            xml = undefined;
+        }
+        if ( !xml || !xml.documentElement || xml.getElementsByTagName( "parsererror" ).length ) {
+            jQuery.error( "Invalid XML: " + data );
+        }
+        return xml;
+    },
+
+    noop: function() {},
+
+    // Evaluates a script in a global context
+    // Workarounds based on findings by Jim Driscoll
+    // http://weblogs.java.net/blog/driscoll/archive/2009/09/08/eval-javascript-global-context
+    globalEval: function( data ) {
+        if ( data && rnotwhite.test( data ) ) {
+            // We use execScript on Internet Explorer
+            // We use an anonymous function so that context is window
+            // rather than jQuery in Firefox
+            ( window.execScript || function( data ) {
+                window[ "eval" ].call( window, data );
+            } )( data );
+        }
+    },
+
+    // Convert dashed to camelCase; used by the css and data modules
+    // Microsoft forgot to hump their vendor prefix (#9572)
+    camelCase: function( string ) {
+        return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
+    },
+
+    nodeName: function( elem, name ) {
+        return elem.nodeName && elem.nodeName.toUpperCase() === name.toUpperCase();
+    },
+
+    // args is for internal usage only
+    each: function( object, callback, args ) {
+        var name, i = 0,
+            length = object.length,
+            isObj = length === undefined || jQuery.isFunction( object );
+
+        if ( args ) {
+            if ( isObj ) {
+                for ( name in object ) {
+                    if ( callback.apply( object[ name ], args ) === false ) {
+                        break;
+                    }
+                }
+            } else {
+                for ( ; i < length; ) {
+                    if ( callback.apply( object[ i++ ], args ) === false ) {
+                        break;
+                    }
+                }
+            }
+
+        // A special, fast, case for the most common use of each
+        } else {
+            if ( isObj ) {
+                for ( name in object ) {
+                    if ( callback.call( object[ name ], name, object[ name ] ) === false ) {
+                        break;
+                    }
+                }
+            } else {
+                for ( ; i < length; ) {
+                    if ( callback.call( object[ i ], i, object[ i++ ] ) === false ) {
+                        break;
+                    }
+                }
+            }
+        }
+
+        return object;
+    },
+
+    // Use native String.trim function wherever possible
+    trim: trim ?
+        function( text ) {
+            return text == null ?
+                "" :
+                trim.call( text );
+        } :
+
+        // Otherwise use our own trimming functionality
+        function( text ) {
+            return text == null ?
+                "" :
+                text.toString().replace( trimLeft, "" ).replace( trimRight, "" );
+        },
+
+    // results is for internal usage only
+    makeArray: function( array, results ) {
+        var ret = results || [];
+
+        if ( array != null ) {
+            // The window, strings (and functions) also have 'length'
+            // Tweaked logic slightly to handle Blackberry 4.7 RegExp issues #6930
+            var type = jQuery.type( array );
+
+            if ( array.length == null || type === "string" || type === "function" || type === "regexp" || jQuery.isWindow( array ) ) {
+                push.call( ret, array );
+            } else {
+                jQuery.merge( ret, array );
+            }
+        }
+
+        return ret;
+    },
+
+    inArray: function( elem, array, i ) {
+        var len;
+
+        if ( array ) {
+            if ( indexOf ) {
+                return indexOf.call( array, elem, i );
+            }
+
+            len = array.length;
+            i = i ? i < 0 ? Math.max( 0, len + i ) : i : 0;
+
+            for ( ; i < len; i++ ) {
+                // Skip accessing in sparse arrays
+                if ( i in array && array[ i ] === elem ) {
+                    return i;
+                }
+            }
+        }
+
+        return -1;
+    },
+
+    merge: function( first, second ) {
+        var i = first.length,
+            j = 0;
+
+        if ( typeof second.length === "number" ) {
+            for ( var l = second.length; j < l; j++ ) {
+                first[ i++ ] = second[ j ];
+            }
+
+        } else {
+            while ( second[j] !== undefined ) {
+                first[ i++ ] = second[ j++ ];
+            }
+        }
+
+        first.length = i;
+
+        return first;
+    },
+
+    grep: function( elems, callback, inv ) {
+        var ret = [], retVal;
+        inv = !!inv;
+
+        // Go through the array, only saving the items
+        // that pass the validator function
+        for ( var i = 0, length = elems.length; i < length; i++ ) {
+            retVal = !!callback( elems[ i ], i );
+            if ( inv !== retVal ) {
+                ret.push( elems[ i ] );
+            }
+        }
+
+        return ret;
+    },
+
+    // arg is for internal usage only
+    map: function( elems, callback, arg ) {
+        var value, key, ret = [],
+            i = 0,
+            length = elems.length,
+            // jquery objects are treated as arrays
+            isArray = elems instanceof jQuery || length !== undefined && typeof length === "number" && ( ( length > 0 && elems[ 0 ] && elems[ length -1 ] ) || length === 0 || jQuery.isArray( elems ) ) ;
+
+        // Go through the array, translating each of the items to their
+        if ( isArray ) {
+            for ( ; i < length; i++ ) {
+                value = callback( elems[ i ], i, arg );
+
+                if ( value != null ) {
+                    ret[ ret.length ] = value;
+                }
+            }
+
+        // Go through every key on the object,
+        } else {
+            for ( key in elems ) {
+                value = callback( elems[ key ], key, arg );
+
+                if ( value != null ) {
+                    ret[ ret.length ] = value;
+                }
+            }
+        }
+
+        // Flatten any nested arrays
+        return ret.concat.apply( [], ret );
+    },
+
+    // A global GUID counter for objects
+    guid: 1,
+
+    // Bind a function to a context, optionally partially applying any
+    // arguments.
+    proxy: function( fn, context ) {
+        if ( typeof context === "string" ) {
+            var tmp = fn[ context ];
+            context = fn;
+            fn = tmp;
+        }
+
+        // Quick check to determine if target is callable, in the spec
+        // this throws a TypeError, but we will just return undefined.
+        if ( !jQuery.isFunction( fn ) ) {
+            return undefined;
+        }
+
+        // Simulated bind
+        var args = slice.call( arguments, 2 ),
+            proxy = function() {
+                return fn.apply( context, args.concat( slice.call( arguments ) ) );
+            };
+
+        // Set the guid of unique handler to the same of original handler, so it can be removed
+        proxy.guid = fn.guid = fn.guid || proxy.guid || jQuery.guid++;
+
+        return proxy;
+    },
+
+    // Mutifunctional method to get and set values to a collection
+    // The value/s can optionally be executed if it's a function
+    access: function( elems, key, value, exec, fn, pass ) {
+        var length = elems.length;
+
+        // Setting many attributes
+        if ( typeof key === "object" ) {
+            for ( var k in key ) {
+                jQuery.access( elems, k, key[k], exec, fn, value );
+            }
+            return elems;
+        }
+
+        // Setting one attribute
+        if ( value !== undefined ) {
+            // Optionally, function values get executed if exec is true
+            exec = !pass && exec && jQuery.isFunction(value);
+
+            for ( var i = 0; i < length; i++ ) {
+                fn( elems[i], key, exec ? value.call( elems[i], i, fn( elems[i], key ) ) : value, pass );
+            }
+
+            return elems;
+        }
+
+        // Getting an attribute
+        return length ? fn( elems[0], key ) : undefined;
+    },
+
+    now: function() {
+        return ( new Date() ).getTime();
+    },
+
+    // Use of jQuery.browser is frowned upon.
+    // More details: http://docs.jquery.com/Utilities/jQuery.browser
+    uaMatch: function( ua ) {
+        ua = ua.toLowerCase();
+
+        var match = rwebkit.exec( ua ) ||
+            ropera.exec( ua ) ||
+            rmsie.exec( ua ) ||
+            ua.indexOf("compatible") < 0 && rmozilla.exec( ua ) ||
+            [];
+
+        return { browser: match[1] || "", version: match[2] || "0" };
+    },
+
+    sub: function() {
+        function jQuerySub( selector, context ) {
+            return new jQuerySub.fn.init( selector, context );
+        }
+        jQuery.extend( true, jQuerySub, this );
+        jQuerySub.superclass = this;
+        jQuerySub.fn = jQuerySub.prototype = this();
+        jQuerySub.fn.constructor = jQuerySub;
+        jQuerySub.sub = this.sub;
+        jQuerySub.fn.init = function init( selector, context ) {
+            if ( context && context instanceof jQuery && !(context instanceof jQuerySub) ) {
+                context = jQuerySub( context );
+            }
+
+            return jQuery.fn.init.call( this, selector, context, rootjQuerySub );
+        };
+        jQuerySub.fn.init.prototype = jQuerySub.fn;
+        var rootjQuerySub = jQuerySub(document);
+        return jQuerySub;
+    },
+
+    browser: {}
 });
 
 // Populate the class2type map
 jQuery.each("Boolean Number String Function Array Date RegExp Object".split(" "), function(i, name) {
-	class2type[ "[object " + name + "]" ] = name.toLowerCase();
+    class2type[ "[object " + name + "]" ] = name.toLowerCase();
 });
 
 browserMatch = jQuery.uaMatch( userAgent );
 if ( browserMatch.browser ) {
-	jQuery.browser[ browserMatch.browser ] = true;
-	jQuery.browser.version = browserMatch.version;
+    jQuery.browser[ browserMatch.browser ] = true;
+    jQuery.browser.version = browserMatch.version;
 }
 
 // Deprecated, use jQuery.browser.webkit instead
 if ( jQuery.browser.webkit ) {
-	jQuery.browser.safari = true;
+    jQuery.browser.safari = true;
 }
 
 // IE doesn't match non-breaking spaces with \s
 if ( rnotwhite.test( "\xA0" ) ) {
-	trimLeft = /^[\s\xA0]+/;
-	trimRight = /[\s\xA0]+$/;
+    trimLeft = /^[\s\xA0]+/;
+    trimRight = /[\s\xA0]+$/;
 }
 
 // All jQuery objects should point back to these
@@ -918,38 +918,38 @@ rootjQuery = jQuery(document);
 
 // Cleanup functions for the document ready method
 if ( document.addEventListener ) {
-	DOMContentLoaded = function() {
-		document.removeEventListener( "DOMContentLoaded", DOMContentLoaded, false );
-		jQuery.ready();
-	};
+    DOMContentLoaded = function() {
+        document.removeEventListener( "DOMContentLoaded", DOMContentLoaded, false );
+        jQuery.ready();
+    };
 
 } else if ( document.attachEvent ) {
-	DOMContentLoaded = function() {
-		// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
-		if ( document.readyState === "complete" ) {
-			document.detachEvent( "onreadystatechange", DOMContentLoaded );
-			jQuery.ready();
-		}
-	};
+    DOMContentLoaded = function() {
+        // Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
+        if ( document.readyState === "complete" ) {
+            document.detachEvent( "onreadystatechange", DOMContentLoaded );
+            jQuery.ready();
+        }
+    };
 }
 
 // The DOM ready check for Internet Explorer
 function doScrollCheck() {
-	if ( jQuery.isReady ) {
-		return;
-	}
-
-	try {
-		// If IE is used, use the trick by Diego Perini
-		// http://javascript.nwbox.com/IEContentLoaded/
-		document.documentElement.doScroll("left");
-	} catch(e) {
-		setTimeout( doScrollCheck, 1 );
-		return;
-	}
-
-	// and execute any waiting functions
-	jQuery.ready();
+    if ( jQuery.isReady ) {
+        return;
+    }
+
+    try {
+        // If IE is used, use the trick by Diego Perini
+        // http://javascript.nwbox.com/IEContentLoaded/
+        document.documentElement.doScroll("left");
+    } catch(e) {
+        setTimeout( doScrollCheck, 1 );
+        return;
+    }
+
+    // and execute any waiting functions
+    jQuery.ready();
 }
 
 return jQuery;
@@ -962,367 +962,367 @@ var flagsCache = {};
 
 // Convert String-formatted flags into Object-formatted ones and store in cache
 function createFlags( flags ) {
-	var object = flagsCache[ flags ] = {},
-		i, length;
-	flags = flags.split( /\s+/ );
-	for ( i = 0, length = flags.length; i < length; i++ ) {
-		object[ flags[i] ] = true;
-	}
-	return object;
+    var object = flagsCache[ flags ] = {},
+        i, length;
+    flags = flags.split( /\s+/ );
+    for ( i = 0, length = flags.length; i < length; i++ ) {
+        object[ flags[i] ] = true;
+    }
+    return object;
 }
 
 /*
  * Create a callback list using the following parameters:
  *
- *	flags:	an optional list of space-separated flags that will change how
- *			the callback list behaves
+ *  flags:  an optional list of space-separated flags that will change how
+ *          the callback list behaves
  *
  * By default a callback list will act like an event callback list and can be
  * "fired" multiple times.
  *
  * Possible flags:
  *
- *	once:			will ensure the callback list can only be fired once (like a Deferred)
+ *  once:           will ensure the callback list can only be fired once (like a Deferred)
  *
- *	memory:			will keep track of previous values and will call any callback added
- *					after the list has been fired right away with the latest "memorized"
- *					values (like a Deferred)
+ *  memory:         will keep track of previous values and will call any callback added
+ *                  after the list has been fired right away with the latest "memorized"
+ *                  values (like a Deferred)
  *
- *	unique:			will ensure a callback can only be added once (no duplicate in the list)
+ *  unique:         will ensure a callback can only be added once (no duplicate in the list)
  *
- *	stopOnFalse:	interrupt callings when a callback returns false
+ *  stopOnFalse:    interrupt callings when a callback returns false
  *
  */
 jQuery.Callbacks = function( flags ) {
 
-	// Convert flags from String-formatted to Object-formatted
-	// (we check in cache first)
-	flags = flags ? ( flagsCache[ flags ] || createFlags( flags ) ) : {};
-
-	var // Actual callback list
-		list = [],
-		// Stack of fire calls for repeatable lists
-		stack = [],
-		// Last fire value (for non-forgettable lists)
-		memory,
-		// Flag to know if list is currently firing
-		firing,
-		// First callback to fire (used internally by add and fireWith)
-		firingStart,
-		// End of the loop when firing
-		firingLength,
-		// Index of currently firing callback (modified by remove if needed)
-		firingIndex,
-		// Add one or several callbacks to the list
-		add = function( args ) {
-			var i,
-				length,
-				elem,
-				type,
-				actual;
-			for ( i = 0, length = args.length; i < length; i++ ) {
-				elem = args[ i ];
-				type = jQuery.type( elem );
-				if ( type === "array" ) {
-					// Inspect recursively
-					add( elem );
-				} else if ( type === "function" ) {
-					// Add if not in unique mode and callback is not in
-					if ( !flags.unique || !self.has( elem ) ) {
-						list.push( elem );
-					}
-				}
-			}
-		},
-		// Fire callbacks
-		fire = function( context, args ) {
-			args = args || [];
-			memory = !flags.memory || [ context, args ];
-			firing = true;
-			firingIndex = firingStart || 0;
-			firingStart = 0;
-			firingLength = list.length;
-			for ( ; list && firingIndex < firingLength; firingIndex++ ) {
-				if ( list[ firingIndex ].apply( context, args ) === false && flags.stopOnFalse ) {
-					memory = true; // Mark as halted
-					break;
-				}
-			}
-			firing = false;
-			if ( list ) {
-				if ( !flags.once ) {
-					if ( stack && stack.length ) {
-						memory = stack.shift();
-						self.fireWith( memory[ 0 ], memory[ 1 ] );
-					}
-				} else if ( memory === true ) {
-					self.disable();
-				} else {
-					list = [];
-				}
-			}
-		},
-		// Actual Callbacks object
-		self = {
-			// Add a callback or a collection of callbacks to the list
-			add: function() {
-				if ( list ) {
-					var length = list.length;
-					add( arguments );
-					// Do we need to add the callbacks to the
-					// current firing batch?
-					if ( firing ) {
-						firingLength = list.length;
-					// With memory, if we're not firing then
-					// we should call right away, unless previous
-					// firing was halted (stopOnFalse)
-					} else if ( memory && memory !== true ) {
-						firingStart = length;
-						fire( memory[ 0 ], memory[ 1 ] );
-					}
-				}
-				return this;
-			},
-			// Remove a callback from the list
-			remove: function() {
-				if ( list ) {
-					var args = arguments,
-						argIndex = 0,
-						argLength = args.length;
-					for ( ; argIndex < argLength ; argIndex++ ) {
-						for ( var i = 0; i < list.length; i++ ) {
-							if ( args[ argIndex ] === list[ i ] ) {
-								// Handle firingIndex and firingLength
-								if ( firing ) {
-									if ( i <= firingLength ) {
-										firingLength--;
-										if ( i <= firingIndex ) {
-											firingIndex--;
-										}
-									}
-								}
-								// Remove the element
-								list.splice( i--, 1 );
-								// If we have some unicity property then
-								// we only need to do this once
-								if ( flags.unique ) {
-									break;
-								}
-							}
-						}
-					}
-				}
-				return this;
-			},
-			// Control if a given callback is in the list
-			has: function( fn ) {
-				if ( list ) {
-					var i = 0,
-						length = list.length;
-					for ( ; i < length; i++ ) {
-						if ( fn === list[ i ] ) {
-							return true;
-						}
-					}
-				}
-				return false;
-			},
-			// Remove all callbacks from the list
-			empty: function() {
-				list = [];
-				return this;
-			},
-			// Have the list do nothing anymore
-			disable: function() {
-				list = stack = memory = undefined;
-				return this;
-			},
-			// Is it disabled?
-			disabled: function() {
-				return !list;
-			},
-			// Lock the list in its current state
-			lock: function() {
-				stack = undefined;
-				if ( !memory || memory === true ) {
-					self.disable();
-				}
-				return this;
-			},
-			// Is it locked?
-			locked: function() {
-				return !stack;
-			},
-			// Call all callbacks with the given context and arguments
-			fireWith: function( context, args ) {
-				if ( stack ) {
-					if ( firing ) {
-						if ( !flags.once ) {
-							stack.push( [ context, args ] );
-						}
-					} else if ( !( flags.once && memory ) ) {
-						fire( context, args );
-					}
-				}
-				return this;
-			},
-			// Call all the callbacks with the given arguments
-			fire: function() {
-				self.fireWith( this, arguments );
-				return this;
-			},
-			// To know if the callbacks have already been called at least once
-			fired: function() {
-				return !!memory;
-			}
-		};
-
-	return self;
+    // Convert flags from String-formatted to Object-formatted
+    // (we check in cache first)
+    flags = flags ? ( flagsCache[ flags ] || createFlags( flags ) ) : {};
+
+    var // Actual callback list
+        list = [],
+        // Stack of fire calls for repeatable lists
+        stack = [],
+        // Last fire value (for non-forgettable lists)
+        memory,
+        // Flag to know if list is currently firing
+        firing,
+        // First callback to fire (used internally by add and fireWith)
+        firingStart,
+        // End of the loop when firing
+        firingLength,
+        // Index of currently firing callback (modified by remove if needed)
+        firingIndex,
+        // Add one or several callbacks to the list
+        add = function( args ) {
+            var i,
+                length,
+                elem,
+                type,
+                actual;
+            for ( i = 0, length = args.length; i < length; i++ ) {
+                elem = args[ i ];
+                type = jQuery.type( elem );
+                if ( type === "array" ) {
+                    // Inspect recursively
+                    add( elem );
+                } else if ( type === "function" ) {
+                    // Add if not in unique mode and callback is not in
+                    if ( !flags.unique || !self.has( elem ) ) {
+                        list.push( elem );
+                    }
+                }
+            }
+        },
+        // Fire callbacks
+        fire = function( context, args ) {
+            args = args || [];
+            memory = !flags.memory || [ context, args ];
+            firing = true;
+            firingIndex = firingStart || 0;
+            firingStart = 0;
+            firingLength = list.length;
+            for ( ; list && firingIndex < firingLength; firingIndex++ ) {
+                if ( list[ firingIndex ].apply( context, args ) === false && flags.stopOnFalse ) {
+                    memory = true; // Mark as halted
+                    break;
+                }
+            }
+            firing = false;
+            if ( list ) {
+                if ( !flags.once ) {
+                    if ( stack && stack.length ) {
+                        memory = stack.shift();
+                        self.fireWith( memory[ 0 ], memory[ 1 ] );
+                    }
+                } else if ( memory === true ) {
+                    self.disable();
+                } else {
+                    list = [];
+                }
+            }
+        },
+        // Actual Callbacks object
+        self = {
+            // Add a callback or a collection of callbacks to the list
+            add: function() {
+                if ( list ) {
+                    var length = list.length;
+                    add( arguments );
+                    // Do we need to add the callbacks to the
+                    // current firing batch?
+                    if ( firing ) {
+                        firingLength = list.length;
+                    // With memory, if we're not firing then
+                    // we should call right away, unless previous
+                    // firing was halted (stopOnFalse)
+                    } else if ( memory && memory !== true ) {
+                        firingStart = length;
+                        fire( memory[ 0 ], memory[ 1 ] );
+                    }
+                }
+                return this;
+            },
+            // Remove a callback from the list
+            remove: function() {
+                if ( list ) {
+                    var args = arguments,
+                        argIndex = 0,
+                        argLength = args.length;
+                    for ( ; argIndex < argLength ; argIndex++ ) {
+                        for ( var i = 0; i < list.length; i++ ) {
+                            if ( args[ argIndex ] === list[ i ] ) {
+                                // Handle firingIndex and firingLength
+                                if ( firing ) {
+                                    if ( i <= firingLength ) {
+                                        firingLength--;
+                                        if ( i <= firingIndex ) {
+                                            firingIndex--;
+                                        }
+                                    }
+                                }
+                                // Remove the element
+                                list.splice( i--, 1 );
+                                // If we have some unicity property then
+                                // we only need to do this once
+                                if ( flags.unique ) {
+                                    break;
+                                }
+                            }
+                        }
+                    }
+                }
+                return this;
+            },
+            // Control if a given callback is in the list
+            has: function( fn ) {
+                if ( list ) {
+                    var i = 0,
+                        length = list.length;
+                    for ( ; i < length; i++ ) {
+                        if ( fn === list[ i ] ) {
+                            return true;
+                        }
+                    }
+                }
+                return false;
+            },
+            // Remove all callbacks from the list
+            empty: function() {
+                list = [];
+                return this;
+            },
+            // Have the list do nothing anymore
+            disable: function() {
+                list = stack = memory = undefined;
+                return this;
+            },
+            // Is it disabled?
+            disabled: function() {
+                return !list;
+            },
+            // Lock the list in its current state
+            lock: function() {
+                stack = undefined;
+                if ( !memory || memory === true ) {
+                    self.disable();
+                }
+                return this;
+            },
+            // Is it locked?
+            locked: function() {
+                return !stack;
+            },
+            // Call all callbacks with the given context and arguments
+            fireWith: function( context, args ) {
+                if ( stack ) {
+                    if ( firing ) {
+                        if ( !flags.once ) {
+                            stack.push( [ context, args ] );
+                        }
+                    } else if ( !( flags.once && memory ) ) {
+                        fire( context, args );
+                    }
+                }
+                return this;
+            },
+            // Call all the callbacks with the given arguments
+            fire: function() {
+                self.fireWith( this, arguments );
+                return this;
+            },
+            // To know if the callbacks have already been called at least once
+            fired: function() {
+                return !!memory;
+            }
+        };
+
+    return self;
 };
 
 
 
 
 var // Static reference to slice
-	sliceDeferred = [].slice;
+    sliceDeferred = [].slice;
 
 jQuery.extend({
 
-	Deferred: function( func ) {
-		var doneList = jQuery.Callbacks( "once memory" ),
-			failList = jQuery.Callbacks( "once memory" ),
-			progressList = jQuery.Callbacks( "memory" ),
-			state = "pending",
-			lists = {
-				resolve: doneList,
-				reject: failList,
-				notify: progressList
-			},
-			promise = {
-				done: doneList.add,
-				fail: failList.add,
-				progress: progressList.add,
-
-				state: function() {
-					return state;
-				},
-
-				// Deprecated
-				isResolved: doneList.fired,
-				isRejected: failList.fired,
-
-				then: function( doneCallbacks, failCallbacks, progressCallbacks ) {
-					deferred.done( doneCallbacks ).fail( failCallbacks ).progress( progressCallbacks );
-					return this;
-				},
-				always: function() {
-					deferred.done.apply( deferred, arguments ).fail.apply( deferred, arguments );
-					return this;
-				},
-				pipe: function( fnDone, fnFail, fnProgress ) {
-					return jQuery.Deferred(function( newDefer ) {
-						jQuery.each( {
-							done: [ fnDone, "resolve" ],
-							fail: [ fnFail, "reject" ],
-							progress: [ fnProgress, "notify" ]
-						}, function( handler, data ) {
-							var fn = data[ 0 ],
-								action = data[ 1 ],
-								returned;
-							if ( jQuery.isFunction( fn ) ) {
-								deferred[ handler ](function() {
-									returned = fn.apply( this, arguments );
-									if ( returned && jQuery.isFunction( returned.promise ) ) {
-										returned.promise().then( newDefer.resolve, newDefer.reject, newDefer.notify );
-									} else {
-										newDefer[ action + "With" ]( this === deferred ? newDefer : this, [ returned ] );
-									}
-								});
-							} else {
-								deferred[ handler ]( newDefer[ action ] );
-							}
-						});
-					}).promise();
-				},
-				// Get a promise for this deferred
-				// If obj is provided, the promise aspect is added to the object
-				promise: function( obj ) {
-					if ( obj == null ) {
-						obj = promise;
-					} else {
-						for ( var key in promise ) {
-							obj[ key ] = promise[ key ];
-						}
-					}
-					return obj;
-				}
-			},
-			deferred = promise.promise({}),
-			key;
-
-		for ( key in lists ) {
-			deferred[ key ] = lists[ key ].fire;
-			deferred[ key + "With" ] = lists[ key ].fireWith;
-		}
-
-		// Handle state
-		deferred.done( function() {
-			state = "resolved";
-		}, failList.disable, progressList.lock ).fail( function() {
-			state = "rejected";
-		}, doneList.disable, progressList.lock );
-
-		// Call given func if any
-		if ( func ) {
-			func.call( deferred, deferred );
-		}
-
-		// All done!
-		return deferred;
-	},
-
-	// Deferred helper
-	when: function( firstParam ) {
-		var args = sliceDeferred.call( arguments, 0 ),
-			i = 0,
-			length = args.length,
-			pValues = new Array( length ),
-			count = length,
-			pCount = length,
-			deferred = length <= 1 && firstParam && jQuery.isFunction( firstParam.promise ) ?
-				firstParam :
-				jQuery.Deferred(),
-			promise = deferred.promise();
-		function resolveFunc( i ) {
-			return function( value ) {
-				args[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
-				if ( !( --count ) ) {
-					deferred.resolveWith( deferred, args );
-				}
-			};
-		}
-		function progressFunc( i ) {
-			return function( value ) {
-				pValues[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
-				deferred.notifyWith( promise, pValues );
-			};
-		}
-		if ( length > 1 ) {
-			for ( ; i < length; i++ ) {
-				if ( args[ i ] && args[ i ].promise && jQuery.isFunction( args[ i ].promise ) ) {
-					args[ i ].promise().then( resolveFunc(i), deferred.reject, progressFunc(i) );
-				} else {
-					--count;
-				}
-			}
-			if ( !count ) {
-				deferred.resolveWith( deferred, args );
-			}
-		} else if ( deferred !== firstParam ) {
-			deferred.resolveWith( deferred, length ? [ firstParam ] : [] );
-		}
-		return promise;
-	}
+    Deferred: function( func ) {
+        var doneList = jQuery.Callbacks( "once memory" ),
+            failList = jQuery.Callbacks( "once memory" ),
+            progressList = jQuery.Callbacks( "memory" ),
+            state = "pending",
+            lists = {
+                resolve: doneList,
+                reject: failList,
+                notify: progressList
+            },
+            promise = {
+                done: doneList.add,
+                fail: failList.add,
+                progress: progressList.add,
+
+                state: function() {
+                    return state;
+                },
+
+                // Deprecated
+                isResolved: doneList.fired,
+                isRejected: failList.fired,
+
+                then: function( doneCallbacks, failCallbacks, progressCallbacks ) {
+                    deferred.done( doneCallbacks ).fail( failCallbacks ).progress( progressCallbacks );
+                    return this;
+                },
+                always: function() {
+                    deferred.done.apply( deferred, arguments ).fail.apply( deferred, arguments );
+                    return this;
+                },
+                pipe: function( fnDone, fnFail, fnProgress ) {
+                    return jQuery.Deferred(function( newDefer ) {
+                        jQuery.each( {
+                            done: [ fnDone, "resolve" ],
+                            fail: [ fnFail, "reject" ],
+                            progress: [ fnProgress, "notify" ]
+                        }, function( handler, data ) {
+                            var fn = data[ 0 ],
+                                action = data[ 1 ],
+                                returned;
+                            if ( jQuery.isFunction( fn ) ) {
+                                deferred[ handler ](function() {
+                                    returned = fn.apply( this, arguments );
+                                    if ( returned && jQuery.isFunction( returned.promise ) ) {
+                                        returned.promise().then( newDefer.resolve, newDefer.reject, newDefer.notify );
+                                    } else {
+                                        newDefer[ action + "With" ]( this === deferred ? newDefer : this, [ returned ] );
+                                    }
+                                });
+                            } else {
+                                deferred[ handler ]( newDefer[ action ] );
+                            }
+                        });
+                    }).promise();
+                },
+                // Get a promise for this deferred
+                // If obj is provided, the promise aspect is added to the object
+                promise: function( obj ) {
+                    if ( obj == null ) {
+                        obj = promise;
+                    } else {
+                        for ( var key in promise ) {
+                            obj[ key ] = promise[ key ];
+                        }
+                    }
+                    return obj;
+                }
+            },
+            deferred = promise.promise({}),
+            key;
+
+        for ( key in lists ) {
+            deferred[ key ] = lists[ key ].fire;
+            deferred[ key + "With" ] = lists[ key ].fireWith;
+        }
+
+        // Handle state
+        deferred.done( function() {
+            state = "resolved";
+        }, failList.disable, progressList.lock ).fail( function() {
+            state = "rejected";
+        }, doneList.disable, progressList.lock );
+
+        // Call given func if any
+        if ( func ) {
+            func.call( deferred, deferred );
+        }
+
+        // All done!
+        return deferred;
+    },
+
+    // Deferred helper
+    when: function( firstParam ) {
+        var args = sliceDeferred.call( arguments, 0 ),
+            i = 0,
+            length = args.length,
+            pValues = new Array( length ),
+            count = length,
+            pCount = length,
+            deferred = length <= 1 && firstParam && jQuery.isFunction( firstParam.promise ) ?
+                firstParam :
+                jQuery.Deferred(),
+            promise = deferred.promise();
+        function resolveFunc( i ) {
+            return function( value ) {
+                args[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
+                if ( !( --count ) ) {
+                    deferred.resolveWith( deferred, args );
+                }
+            };
+        }
+        function progressFunc( i ) {
+            return function( value ) {
+                pValues[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
+                deferred.notifyWith( promise, pValues );
+            };
+        }
+        if ( length > 1 ) {
+            for ( ; i < length; i++ ) {
+                if ( args[ i ] && args[ i ].promise && jQuery.isFunction( args[ i ].promise ) ) {
+                    args[ i ].promise().then( resolveFunc(i), deferred.reject, progressFunc(i) );
+                } else {
+                    --count;
+                }
+            }
+            if ( !count ) {
+                deferred.resolveWith( deferred, args );
+            }
+        } else if ( deferred !== firstParam ) {
+            deferred.resolveWith( deferred, length ? [ firstParam ] : [] );
+        }
+        return promise;
+    }
 });
 
 
@@ -1330,1311 +1330,1311 @@ jQuery.extend({
 
 jQuery.support = (function() {
 
-	var support,
-		all,
-		a,
-		select,
-		opt,
-		input,
-		marginDiv,
-		fragment,
-		tds,
-		events,
-		eventName,
-		i,
-		isSupported,
-		div = document.createElement( "div" ),
-		documentElement = document.documentElement;
-
-	// Preliminary tests
-	div.setAttribute("className", "t");
-	div.innerHTML = "   
    a";
-
-	all = div.getElementsByTagName( "*" );
-	a = div.getElementsByTagName( "a" )[ 0 ];
-
-	// Can't get basic test support
-	if ( !all || !all.length || !a ) {
-		return {};
-	}
-
-	// First batch of supports tests
-	select = document.createElement( "select" );
-	opt = select.appendChild( document.createElement("option") );
-	input = div.getElementsByTagName( "input" )[ 0 ];
-
-	support = {
-		// IE strips leading whitespace when .innerHTML is used
-		leadingWhitespace: ( div.firstChild.nodeType === 3 ),
-
-		// Make sure that tbody elements aren't automatically inserted
-		// IE will insert them into empty tables
-		tbody: !div.getElementsByTagName("tbody").length,
-
-		// Make sure that link elements get serialized correctly by innerHTML
-		// This requires a wrapper element in IE
-		htmlSerialize: !!div.getElementsByTagName("link").length,
-
-		// Get the style information from getAttribute
-		// (IE uses .cssText instead)
-		style: /top/.test( a.getAttribute("style") ),
-
-		// Make sure that URLs aren't manipulated
-		// (IE normalizes it by default)
-		hrefNormalized: ( a.getAttribute("href") === "/a" ),
-
-		// Make sure that element opacity exists
-		// (IE uses filter instead)
-		// Use a regex to work around a WebKit issue. See #5145
-		opacity: /^0.55/.test( a.style.opacity ),
-
-		// Verify style float existence
-		// (IE uses styleFloat instead of cssFloat)
-		cssFloat: !!a.style.cssFloat,
-
-		// Make sure that if no value is specified for a checkbox
-		// that it defaults to "on".
-		// (WebKit defaults to "" instead)
-		checkOn: ( input.value === "on" ),
-
-		// Make sure that a selected-by-default option has a working selected property.
-		// (WebKit defaults to false instead of true, IE too, if it's in an optgroup)
-		optSelected: opt.selected,
-
-		// Test setAttribute on camelCase class. If it works, we need attrFixes when doing get/setAttribute (ie6/7)
-		getSetAttribute: div.className !== "t",
-
-		// Tests for enctype support on a form(#6743)
-		enctype: !!document.createElement("form").enctype,
-
-		// Makes sure cloning an html5 element does not cause problems
-		// Where outerHTML is undefined, this still works
-		html5Clone: document.createElement("nav").cloneNode( true ).outerHTML !== "<:nav>",
-
-		// Will be defined later
-		submitBubbles: true,
-		changeBubbles: true,
-		focusinBubbles: false,
-		deleteExpando: true,
-		noCloneEvent: true,
-		inlineBlockNeedsLayout: false,
-		shrinkWrapBlocks: false,
-		reliableMarginRight: true
-	};
-
-	// Make sure checked status is properly cloned
-	input.checked = true;
-	support.noCloneChecked = input.cloneNode( true ).checked;
-
-	// Make sure that the options inside disabled selects aren't marked as disabled
-	// (WebKit marks them as disabled)
-	select.disabled = true;
-	support.optDisabled = !opt.disabled;
-
-	// Test to see if it's possible to delete an expando from an element
-	// Fails in Internet Explorer
-	try {
-		delete div.test;
-	} catch( e ) {
-		support.deleteExpando = false;
-	}
-
-	if ( !div.addEventListener && div.attachEvent && div.fireEvent ) {
-		div.attachEvent( "onclick", function() {
-			// Cloning a node shouldn't copy over any
-			// bound event handlers (IE does this)
-			support.noCloneEvent = false;
-		});
-		div.cloneNode( true ).fireEvent( "onclick" );
-	}
-
-	// Check if a radio maintains its value
-	// after being appended to the DOM
-	input = document.createElement("input");
-	input.value = "t";
-	input.setAttribute("type", "radio");
-	support.radioValue = input.value === "t";
-
-	input.setAttribute("checked", "checked");
-	div.appendChild( input );
-	fragment = document.createDocumentFragment();
-	fragment.appendChild( div.lastChild );
-
-	// WebKit doesn't clone checked state correctly in fragments
-	support.checkClone = fragment.cloneNode( true ).cloneNode( true ).lastChild.checked;
-
-	// Check if a disconnected checkbox will retain its checked
-	// value of true after appended to the DOM (IE6/7)
-	support.appendChecked = input.checked;
-
-	fragment.removeChild( input );
-	fragment.appendChild( div );
-
-	div.innerHTML = "";
-
-	// Check if div with explicit width and no margin-right incorrectly
-	// gets computed margin-right based on width of container. For more
-	// info see bug #3333
-	// Fails in WebKit before Feb 2011 nightlies
-	// WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right
-	if ( window.getComputedStyle ) {
-		marginDiv = document.createElement( "div" );
-		marginDiv.style.width = "0";
-		marginDiv.style.marginRight = "0";
-		div.style.width = "2px";
-		div.appendChild( marginDiv );
-		support.reliableMarginRight =
-			( parseInt( ( window.getComputedStyle( marginDiv, null ) || { marginRight: 0 } ).marginRight, 10 ) || 0 ) === 0;
-	}
-
-	// Technique from Juriy Zaytsev
-	// http://perfectionkills.com/detecting-event-support-without-browser-sniffing/
-	// We only care about the case where non-standard event systems
-	// are used, namely in IE. Short-circuiting here helps us to
-	// avoid an eval call (in setAttribute) which can cause CSP
-	// to go haywire. See: https://developer.mozilla.org/en/Security/CSP
-	if ( div.attachEvent ) {
-		for( i in {
-			submit: 1,
-			change: 1,
-			focusin: 1
-		}) {
-			eventName = "on" + i;
-			isSupported = ( eventName in div );
-			if ( !isSupported ) {
-				div.setAttribute( eventName, "return;" );
-				isSupported = ( typeof div[ eventName ] === "function" );
-			}
-			support[ i + "Bubbles" ] = isSupported;
-		}
-	}
-
-	fragment.removeChild( div );
-
-	// Null elements to avoid leaks in IE
-	fragment = select = opt = marginDiv = div = input = null;
-
-	// Run tests that need a body at doc ready
-	jQuery(function() {
-		var container, outer, inner, table, td, offsetSupport,
-			conMarginTop, ptlm, vb, style, html,
-			body = document.getElementsByTagName("body")[0];
-
-		if ( !body ) {
-			// Return for frameset docs that don't have a body
-			return;
-		}
-
-		conMarginTop = 1;
-		ptlm = "position:absolute;top:0;left:0;width:1px;height:1px;margin:0;";
-		vb = "visibility:hidden;border:0;";
-		style = "style='" + ptlm + "border:5px solid #000;padding:0;'";
-		html = "
    " +
-			"" +
-			"
    ";
-
-		container = document.createElement("div");
-		container.style.cssText = vb + "width:0;height:0;position:static;top:0;margin-top:" + conMarginTop + "px";
-		body.insertBefore( container, body.firstChild );
-
-		// Construct the test element
-		div = document.createElement("div");
-		container.appendChild( div );
-
-		// Check if table cells still have offsetWidth/Height when they are set
-		// to display:none and there are still other visible table cells in a
-		// table row; if so, offsetWidth/Height are not reliable for use when
-		// determining if an element has been hidden directly using
-		// display:none (it is still safe to use offsets if a parent element is
-		// hidden; don safety goggles and see bug #4512 for more information).
-		// (only IE 8 fails this test)
-		div.innerHTML = "
    t
    ";
-		tds = div.getElementsByTagName( "td" );
-		isSupported = ( tds[ 0 ].offsetHeight === 0 );
-
-		tds[ 0 ].style.display = "";
-		tds[ 1 ].style.display = "none";
-
-		// Check if empty table cells still have offsetWidth/Height
-		// (IE <= 8 fail this test)
-		support.reliableHiddenOffsets = isSupported && ( tds[ 0 ].offsetHeight === 0 );
-
-		// Figure out if the W3C box model works as expected
-		div.innerHTML = "";
-		div.style.width = div.style.paddingLeft = "1px";
-		jQuery.boxModel = support.boxModel = div.offsetWidth === 2;
-
-		if ( typeof div.style.zoom !== "undefined" ) {
-			// Check if natively block-level elements act like inline-block
-			// elements when setting their display to 'inline' and giving
-			// them layout
-			// (IE < 8 does this)
-			div.style.display = "inline";
-			div.style.zoom = 1;
-			support.inlineBlockNeedsLayout = ( div.offsetWidth === 2 );
-
-			// Check if elements with layout shrink-wrap their children
-			// (IE 6 does this)
-			div.style.display = "";
-			div.innerHTML = "
    ";
-			support.shrinkWrapBlocks = ( div.offsetWidth !== 2 );
-		}
-
-		div.style.cssText = ptlm + vb;
-		div.innerHTML = html;
-
-		outer = div.firstChild;
-		inner = outer.firstChild;
-		td = outer.nextSibling.firstChild.firstChild;
-
-		offsetSupport = {
-			doesNotAddBorder: ( inner.offsetTop !== 5 ),
-			doesAddBorderForTableAndCells: ( td.offsetTop === 5 )
-		};
-
-		inner.style.position = "fixed";
-		inner.style.top = "20px";
-
-		// safari subtracts parent border width here which is 5px
-		offsetSupport.fixedPosition = ( inner.offsetTop === 20 || inner.offsetTop === 15 );
-		inner.style.position = inner.style.top = "";
-
-		outer.style.overflow = "hidden";
-		outer.style.position = "relative";
-
-		offsetSupport.subtractsBorderForOverflowNotVisible = ( inner.offsetTop === -5 );
-		offsetSupport.doesNotIncludeMarginInBodyOffset = ( body.offsetTop !== conMarginTop );
-
-		body.removeChild( container );
-		div  = container = null;
-
-		jQuery.extend( support, offsetSupport );
-	});
-
-	return support;
+    var support,
+        all,
+        a,
+        select,
+        opt,
+        input,
+        marginDiv,
+        fragment,
+        tds,
+        events,
+        eventName,
+        i,
+        isSupported,
+        div = document.createElement( "div" ),
+        documentElement = document.documentElement;
+
+    // Preliminary tests
+    div.setAttribute("className", "t");
+    div.innerHTML = "   
    a";
+
+    all = div.getElementsByTagName( "*" );
+    a = div.getElementsByTagName( "a" )[ 0 ];
+
+    // Can't get basic test support
+    if ( !all || !all.length || !a ) {
+        return {};
+    }
+
+    // First batch of supports tests
+    select = document.createElement( "select" );
+    opt = select.appendChild( document.createElement("option") );
+    input = div.getElementsByTagName( "input" )[ 0 ];
+
+    support = {
+        // IE strips leading whitespace when .innerHTML is used
+        leadingWhitespace: ( div.firstChild.nodeType === 3 ),
+
+        // Make sure that tbody elements aren't automatically inserted
+        // IE will insert them into empty tables
+        tbody: !div.getElementsByTagName("tbody").length,
+
+        // Make sure that link elements get serialized correctly by innerHTML
+        // This requires a wrapper element in IE
+        htmlSerialize: !!div.getElementsByTagName("link").length,
+
+        // Get the style information from getAttribute
+        // (IE uses .cssText instead)
+        style: /top/.test( a.getAttribute("style") ),
+
+        // Make sure that URLs aren't manipulated
+        // (IE normalizes it by default)
+        hrefNormalized: ( a.getAttribute("href") === "/a" ),
+
+        // Make sure that element opacity exists
+        // (IE uses filter instead)
+        // Use a regex to work around a WebKit issue. See #5145
+        opacity: /^0.55/.test( a.style.opacity ),
+
+        // Verify style float existence
+        // (IE uses styleFloat instead of cssFloat)
+        cssFloat: !!a.style.cssFloat,
+
+        // Make sure that if no value is specified for a checkbox
+        // that it defaults to "on".
+        // (WebKit defaults to "" instead)
+        checkOn: ( input.value === "on" ),
+
+        // Make sure that a selected-by-default option has a working selected property.
+        // (WebKit defaults to false instead of true, IE too, if it's in an optgroup)
+        optSelected: opt.selected,
+
+        // Test setAttribute on camelCase class. If it works, we need attrFixes when doing get/setAttribute (ie6/7)
+        getSetAttribute: div.className !== "t",
+
+        // Tests for enctype support on a form(#6743)
+        enctype: !!document.createElement("form").enctype,
+
+        // Makes sure cloning an html5 element does not cause problems
+        // Where outerHTML is undefined, this still works
+        html5Clone: document.createElement("nav").cloneNode( true ).outerHTML !== "<:nav>",
+
+        // Will be defined later
+        submitBubbles: true,
+        changeBubbles: true,
+        focusinBubbles: false,
+        deleteExpando: true,
+        noCloneEvent: true,
+        inlineBlockNeedsLayout: false,
+        shrinkWrapBlocks: false,
+        reliableMarginRight: true
+    };
+
+    // Make sure checked status is properly cloned
+    input.checked = true;
+    support.noCloneChecked = input.cloneNode( true ).checked;
+
+    // Make sure that the options inside disabled selects aren't marked as disabled
+    // (WebKit marks them as disabled)
+    select.disabled = true;
+    support.optDisabled = !opt.disabled;
+
+    // Test to see if it's possible to delete an expando from an element
+    // Fails in Internet Explorer
+    try {
+        delete div.test;
+    } catch( e ) {
+        support.deleteExpando = false;
+    }
+
+    if ( !div.addEventListener && div.attachEvent && div.fireEvent ) {
+        div.attachEvent( "onclick", function() {
+            // Cloning a node shouldn't copy over any
+            // bound event handlers (IE does this)
+            support.noCloneEvent = false;
+        });
+        div.cloneNode( true ).fireEvent( "onclick" );
+    }
+
+    // Check if a radio maintains its value
+    // after being appended to the DOM
+    input = document.createElement("input");
+    input.value = "t";
+    input.setAttribute("type", "radio");
+    support.radioValue = input.value === "t";
+
+    input.setAttribute("checked", "checked");
+    div.appendChild( input );
+    fragment = document.createDocumentFragment();
+    fragment.appendChild( div.lastChild );
+
+    // WebKit doesn't clone checked state correctly in fragments
+    support.checkClone = fragment.cloneNode( true ).cloneNode( true ).lastChild.checked;
+
+    // Check if a disconnected checkbox will retain its checked
+    // value of true after appended to the DOM (IE6/7)
+    support.appendChecked = input.checked;
+
+    fragment.removeChild( input );
+    fragment.appendChild( div );
+
+    div.innerHTML = "";
+
+    // Check if div with explicit width and no margin-right incorrectly
+    // gets computed margin-right based on width of container. For more
+    // info see bug #3333
+    // Fails in WebKit before Feb 2011 nightlies
+    // WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right
+    if ( window.getComputedStyle ) {
+        marginDiv = document.createElement( "div" );
+        marginDiv.style.width = "0";
+        marginDiv.style.marginRight = "0";
+        div.style.width = "2px";
+        div.appendChild( marginDiv );
+        support.reliableMarginRight =
+            ( parseInt( ( window.getComputedStyle( marginDiv, null ) || { marginRight: 0 } ).marginRight, 10 ) || 0 ) === 0;
+    }
+
+    // Technique from Juriy Zaytsev
+    // http://perfectionkills.com/detecting-event-support-without-browser-sniffing/
+    // We only care about the case where non-standard event systems
+    // are used, namely in IE. Short-circuiting here helps us to
+    // avoid an eval call (in setAttribute) which can cause CSP
+    // to go haywire. See: https://developer.mozilla.org/en/Security/CSP
+    if ( div.attachEvent ) {
+        for( i in {
+            submit: 1,
+            change: 1,
+            focusin: 1
+        }) {
+            eventName = "on" + i;
+            isSupported = ( eventName in div );
+            if ( !isSupported ) {
+                div.setAttribute( eventName, "return;" );
+                isSupported = ( typeof div[ eventName ] === "function" );
+            }
+            support[ i + "Bubbles" ] = isSupported;
+        }
+    }
+
+    fragment.removeChild( div );
+
+    // Null elements to avoid leaks in IE
+    fragment = select = opt = marginDiv = div = input = null;
+
+    // Run tests that need a body at doc ready
+    jQuery(function() {
+        var container, outer, inner, table, td, offsetSupport,
+            conMarginTop, ptlm, vb, style, html,
+            body = document.getElementsByTagName("body")[0];
+
+        if ( !body ) {
+            // Return for frameset docs that don't have a body
+            return;
+        }
+
+        conMarginTop = 1;
+        ptlm = "position:absolute;top:0;left:0;width:1px;height:1px;margin:0;";
+        vb = "visibility:hidden;border:0;";
+        style = "style='" + ptlm + "border:5px solid #000;padding:0;'";
+        html = "
    " +
+            "" +
+            "
    ";
+
+        container = document.createElement("div");
+        container.style.cssText = vb + "width:0;height:0;position:static;top:0;margin-top:" + conMarginTop + "px";
+        body.insertBefore( container, body.firstChild );
+
+        // Construct the test element
+        div = document.createElement("div");
+        container.appendChild( div );
+
+        // Check if table cells still have offsetWidth/Height when they are set
+        // to display:none and there are still other visible table cells in a
+        // table row; if so, offsetWidth/Height are not reliable for use when
+        // determining if an element has been hidden directly using
+        // display:none (it is still safe to use offsets if a parent element is
+        // hidden; don safety goggles and see bug #4512 for more information).
+        // (only IE 8 fails this test)
+        div.innerHTML = "
    t
    ";
+        tds = div.getElementsByTagName( "td" );
+        isSupported = ( tds[ 0 ].offsetHeight === 0 );
+
+        tds[ 0 ].style.display = "";
+        tds[ 1 ].style.display = "none";
+
+        // Check if empty table cells still have offsetWidth/Height
+        // (IE <= 8 fail this test)
+        support.reliableHiddenOffsets = isSupported && ( tds[ 0 ].offsetHeight === 0 );
+
+        // Figure out if the W3C box model works as expected
+        div.innerHTML = "";
+        div.style.width = div.style.paddingLeft = "1px";
+        jQuery.boxModel = support.boxModel = div.offsetWidth === 2;
+
+        if ( typeof div.style.zoom !== "undefined" ) {
+            // Check if natively block-level elements act like inline-block
+            // elements when setting their display to 'inline' and giving
+            // them layout
+            // (IE < 8 does this)
+            div.style.display = "inline";
+            div.style.zoom = 1;
+            support.inlineBlockNeedsLayout = ( div.offsetWidth === 2 );
+
+            // Check if elements with layout shrink-wrap their children
+            // (IE 6 does this)
+            div.style.display = "";
+            div.innerHTML = "
    ";
+            support.shrinkWrapBlocks = ( div.offsetWidth !== 2 );
+        }
+
+        div.style.cssText = ptlm + vb;
+        div.innerHTML = html;
+
+        outer = div.firstChild;
+        inner = outer.firstChild;
+        td = outer.nextSibling.firstChild.firstChild;
+
+        offsetSupport = {
+            doesNotAddBorder: ( inner.offsetTop !== 5 ),
+            doesAddBorderForTableAndCells: ( td.offsetTop === 5 )
+        };
+
+        inner.style.position = "fixed";
+        inner.style.top = "20px";
+
+        // safari subtracts parent border width here which is 5px
+        offsetSupport.fixedPosition = ( inner.offsetTop === 20 || inner.offsetTop === 15 );
+        inner.style.position = inner.style.top = "";
+
+        outer.style.overflow = "hidden";
+        outer.style.position = "relative";
+
+        offsetSupport.subtractsBorderForOverflowNotVisible = ( inner.offsetTop === -5 );
+        offsetSupport.doesNotIncludeMarginInBodyOffset = ( body.offsetTop !== conMarginTop );
+
+        body.removeChild( container );
+        div  = container = null;
+
+        jQuery.extend( support, offsetSupport );
+    });
+
+    return support;
 })();
 
 
 
 
 var rbrace = /^(?:\{.*\}|\[.*\])$/,
-	rmultiDash = /([A-Z])/g;
+    rmultiDash = /([A-Z])/g;
 
 jQuery.extend({
-	cache: {},
-
-	// Please use with caution
-	uuid: 0,
-
-	// Unique for each copy of jQuery on the page
-	// Non-digits removed to match rinlinejQuery
-	expando: "jQuery" + ( jQuery.fn.jquery + Math.random() ).replace( /\D/g, "" ),
-
-	// The following elements throw uncatchable exceptions if you
-	// attempt to add expando properties to them.
-	noData: {
-		"embed": true,
-		// Ban all objects except for Flash (which handle expandos)
-		"object": "clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",
-		"applet": true
-	},
-
-	hasData: function( elem ) {
-		elem = elem.nodeType ? jQuery.cache[ elem[jQuery.expando] ] : elem[ jQuery.expando ];
-		return !!elem && !isEmptyDataObject( elem );
-	},
-
-	data: function( elem, name, data, pvt /* Internal Use Only */ ) {
-		if ( !jQuery.acceptData( elem ) ) {
-			return;
-		}
-
-		var privateCache, thisCache, ret,
-			internalKey = jQuery.expando,
-			getByName = typeof name === "string",
-
-			// We have to handle DOM nodes and JS objects differently because IE6-7
-			// can't GC object references properly across the DOM-JS boundary
-			isNode = elem.nodeType,
-
-			// Only DOM nodes need the global jQuery cache; JS object data is
-			// attached directly to the object so GC can occur automatically
-			cache = isNode ? jQuery.cache : elem,
-
-			// Only defining an ID for JS objects if its cache already exists allows
-			// the code to shortcut on the same path as a DOM node with no cache
-			id = isNode ? elem[ internalKey ] : elem[ internalKey ] && internalKey,
-			isEvents = name === "events";
-
-		// Avoid doing any more work than we need to when trying to get data on an
-		// object that has no data at all
-		if ( (!id || !cache[id] || (!isEvents && !pvt && !cache[id].data)) && getByName && data === undefined ) {
-			return;
-		}
-
-		if ( !id ) {
-			// Only DOM nodes need a new unique ID for each element since their data
-			// ends up in the global cache
-			if ( isNode ) {
-				elem[ internalKey ] = id = ++jQuery.uuid;
-			} else {
-				id = internalKey;
-			}
-		}
-
-		if ( !cache[ id ] ) {
-			cache[ id ] = {};
-
-			// Avoids exposing jQuery metadata on plain JS objects when the object
-			// is serialized using JSON.stringify
-			if ( !isNode ) {
-				cache[ id ].toJSON = jQuery.noop;
-			}
-		}
-
-		// An object can be passed to jQuery.data instead of a key/value pair; this gets
-		// shallow copied over onto the existing cache
-		if ( typeof name === "object" || typeof name === "function" ) {
-			if ( pvt ) {
-				cache[ id ] = jQuery.extend( cache[ id ], name );
-			} else {
-				cache[ id ].data = jQuery.extend( cache[ id ].data, name );
-			}
-		}
-
-		privateCache = thisCache = cache[ id ];
-
-		// jQuery data() is stored in a separate object inside the object's internal data
-		// cache in order to avoid key collisions between internal data and user-defined
-		// data.
-		if ( !pvt ) {
-			if ( !thisCache.data ) {
-				thisCache.data = {};
-			}
-
-			thisCache = thisCache.data;
-		}
-
-		if ( data !== undefined ) {
-			thisCache[ jQuery.camelCase( name ) ] = data;
-		}
-
-		// Users should not attempt to inspect the internal events object using jQuery.data,
-		// it is undocumented and subject to change. But does anyone listen? No.
-		if ( isEvents && !thisCache[ name ] ) {
-			return privateCache.events;
-		}
-
-		// Check for both converted-to-camel and non-converted data property names
-		// If a data property was specified
-		if ( getByName ) {
-
-			// First Try to find as-is property data
-			ret = thisCache[ name ];
-
-			// Test for null|undefined property data
-			if ( ret == null ) {
-
-				// Try to find the camelCased property
-				ret = thisCache[ jQuery.camelCase( name ) ];
-			}
-		} else {
-			ret = thisCache;
-		}
-
-		return ret;
-	},
-
-	removeData: function( elem, name, pvt /* Internal Use Only */ ) {
-		if ( !jQuery.acceptData( elem ) ) {
-			return;
-		}
-
-		var thisCache, i, l,
-
-			// Reference to internal data cache key
-			internalKey = jQuery.expando,
-
-			isNode = elem.nodeType,
-
-			// See jQuery.data for more information
-			cache = isNode ? jQuery.cache : elem,
-
-			// See jQuery.data for more information
-			id = isNode ? elem[ internalKey ] : internalKey;
-
-		// If there is already no cache entry for this object, there is no
-		// purpose in continuing
-		if ( !cache[ id ] ) {
-			return;
-		}
-
-		if ( name ) {
-
-			thisCache = pvt ? cache[ id ] : cache[ id ].data;
-
-			if ( thisCache ) {
-
-				// Support array or space separated string names for data keys
-				if ( !jQuery.isArray( name ) ) {
-
-					// try the string as a key before any manipulation
-					if ( name in thisCache ) {
-						name = [ name ];
-					} else {
-
-						// split the camel cased version by spaces unless a key with the spaces exists
-						name = jQuery.camelCase( name );
-						if ( name in thisCache ) {
-							name = [ name ];
-						} else {
-							name = name.split( " " );
-						}
-					}
-				}
-
-				for ( i = 0, l = name.length; i < l; i++ ) {
-					delete thisCache[ name[i] ];
-				}
-
-				// If there is no data left in the cache, we want to continue
-				// and let the cache object itself get destroyed
-				if ( !( pvt ? isEmptyDataObject : jQuery.isEmptyObject )( thisCache ) ) {
-					return;
-				}
-			}
-		}
-
-		// See jQuery.data for more information
-		if ( !pvt ) {
-			delete cache[ id ].data;
-
-			// Don't destroy the parent cache unless the internal data object
-			// had been the only thing left in it
-			if ( !isEmptyDataObject(cache[ id ]) ) {
-				return;
-			}
-		}
-
-		// Browsers that fail expando deletion also refuse to delete expandos on
-		// the window, but it will allow it on all other JS objects; other browsers
-		// don't care
-		// Ensure that `cache` is not a window object #10080
-		if ( jQuery.support.deleteExpando || !cache.setInterval ) {
-			delete cache[ id ];
-		} else {
-			cache[ id ] = null;
-		}
-
-		// We destroyed the cache and need to eliminate the expando on the node to avoid
-		// false lookups in the cache for entries that no longer exist
-		if ( isNode ) {
-			// IE does not allow us to delete expando properties from nodes,
-			// nor does it have a removeAttribute function on Document nodes;
-			// we must handle all of these cases
-			if ( jQuery.support.deleteExpando ) {
-				delete elem[ internalKey ];
-			} else if ( elem.removeAttribute ) {
-				elem.removeAttribute( internalKey );
-			} else {
-				elem[ internalKey ] = null;
-			}
-		}
-	},
-
-	// For internal use only.
-	_data: function( elem, name, data ) {
-		return jQuery.data( elem, name, data, true );
-	},
-
-	// A method for determining if a DOM node can handle the data expando
-	acceptData: function( elem ) {
-		if ( elem.nodeName ) {
-			var match = jQuery.noData[ elem.nodeName.toLowerCase() ];
-
-			if ( match ) {
-				return !(match === true || elem.getAttribute("classid") !== match);
-			}
-		}
-
-		return true;
-	}
+    cache: {},
+
+    // Please use with caution
+    uuid: 0,
+
+    // Unique for each copy of jQuery on the page
+    // Non-digits removed to match rinlinejQuery
+    expando: "jQuery" + ( jQuery.fn.jquery + Math.random() ).replace( /\D/g, "" ),
+
+    // The following elements throw uncatchable exceptions if you
+    // attempt to add expando properties to them.
+    noData: {
+        "embed": true,
+        // Ban all objects except for Flash (which handle expandos)
+        "object": "clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",
+        "applet": true
+    },
+
+    hasData: function( elem ) {
+        elem = elem.nodeType ? jQuery.cache[ elem[jQuery.expando] ] : elem[ jQuery.expando ];
+        return !!elem && !isEmptyDataObject( elem );
+    },
+
+    data: function( elem, name, data, pvt /* Internal Use Only */ ) {
+        if ( !jQuery.acceptData( elem ) ) {
+            return;
+        }
+
+        var privateCache, thisCache, ret,
+            internalKey = jQuery.expando,
+            getByName = typeof name === "string",
+
+            // We have to handle DOM nodes and JS objects differently because IE6-7
+            // can't GC object references properly across the DOM-JS boundary
+            isNode = elem.nodeType,
+
+            // Only DOM nodes need the global jQuery cache; JS object data is
+            // attached directly to the object so GC can occur automatically
+            cache = isNode ? jQuery.cache : elem,
+
+            // Only defining an ID for JS objects if its cache already exists allows
+            // the code to shortcut on the same path as a DOM node with no cache
+            id = isNode ? elem[ internalKey ] : elem[ internalKey ] && internalKey,
+            isEvents = name === "events";
+
+        // Avoid doing any more work than we need to when trying to get data on an
+        // object that has no data at all
+        if ( (!id || !cache[id] || (!isEvents && !pvt && !cache[id].data)) && getByName && data === undefined ) {
+            return;
+        }
+
+        if ( !id ) {
+            // Only DOM nodes need a new unique ID for each element since their data
+            // ends up in the global cache
+            if ( isNode ) {
+                elem[ internalKey ] = id = ++jQuery.uuid;
+            } else {
+                id = internalKey;
+            }
+        }
+
+        if ( !cache[ id ] ) {
+            cache[ id ] = {};
+
+            // Avoids exposing jQuery metadata on plain JS objects when the object
+            // is serialized using JSON.stringify
+            if ( !isNode ) {
+                cache[ id ].toJSON = jQuery.noop;
+            }
+        }
+
+        // An object can be passed to jQuery.data instead of a key/value pair; this gets
+        // shallow copied over onto the existing cache
+        if ( typeof name === "object" || typeof name === "function" ) {
+            if ( pvt ) {
+                cache[ id ] = jQuery.extend( cache[ id ], name );
+            } else {
+                cache[ id ].data = jQuery.extend( cache[ id ].data, name );
+            }
+        }
+
+        privateCache = thisCache = cache[ id ];
+
+        // jQuery data() is stored in a separate object inside the object's internal data
+        // cache in order to avoid key collisions between internal data and user-defined
+        // data.
+        if ( !pvt ) {
+            if ( !thisCache.data ) {
+                thisCache.data = {};
+            }
+
+            thisCache = thisCache.data;
+        }
+
+        if ( data !== undefined ) {
+            thisCache[ jQuery.camelCase( name ) ] = data;
+        }
+
+        // Users should not attempt to inspect the internal events object using jQuery.data,
+        // it is undocumented and subject to change. But does anyone listen? No.
+        if ( isEvents && !thisCache[ name ] ) {
+            return privateCache.events;
+        }
+
+        // Check for both converted-to-camel and non-converted data property names
+        // If a data property was specified
+        if ( getByName ) {
+
+            // First Try to find as-is property data
+            ret = thisCache[ name ];
+
+            // Test for null|undefined property data
+            if ( ret == null ) {
+
+                // Try to find the camelCased property
+                ret = thisCache[ jQuery.camelCase( name ) ];
+            }
+        } else {
+            ret = thisCache;
+        }
+
+        return ret;
+    },
+
+    removeData: function( elem, name, pvt /* Internal Use Only */ ) {
+        if ( !jQuery.acceptData( elem ) ) {
+            return;
+        }
+
+        var thisCache, i, l,
+
+            // Reference to internal data cache key
+            internalKey = jQuery.expando,
+
+            isNode = elem.nodeType,
+
+            // See jQuery.data for more information
+            cache = isNode ? jQuery.cache : elem,
+
+            // See jQuery.data for more information
+            id = isNode ? elem[ internalKey ] : internalKey;
+
+        // If there is already no cache entry for this object, there is no
+        // purpose in continuing
+        if ( !cache[ id ] ) {
+            return;
+        }
+
+        if ( name ) {
+
+            thisCache = pvt ? cache[ id ] : cache[ id ].data;
+
+            if ( thisCache ) {
+
+                // Support array or space separated string names for data keys
+                if ( !jQuery.isArray( name ) ) {
+
+                    // try the string as a key before any manipulation
+                    if ( name in thisCache ) {
+                        name = [ name ];
+                    } else {
+
+                        // split the camel cased version by spaces unless a key with the spaces exists
+                        name = jQuery.camelCase( name );
+                        if ( name in thisCache ) {
+                            name = [ name ];
+                        } else {
+                            name = name.split( " " );
+                        }
+                    }
+                }
+
+                for ( i = 0, l = name.length; i < l; i++ ) {
+                    delete thisCache[ name[i] ];
+                }
+
+                // If there is no data left in the cache, we want to continue
+                // and let the cache object itself get destroyed
+                if ( !( pvt ? isEmptyDataObject : jQuery.isEmptyObject )( thisCache ) ) {
+                    return;
+                }
+            }
+        }
+
+        // See jQuery.data for more information
+        if ( !pvt ) {
+            delete cache[ id ].data;
+
+            // Don't destroy the parent cache unless the internal data object
+            // had been the only thing left in it
+            if ( !isEmptyDataObject(cache[ id ]) ) {
+                return;
+            }
+        }
+
+        // Browsers that fail expando deletion also refuse to delete expandos on
+        // the window, but it will allow it on all other JS objects; other browsers
+        // don't care
+        // Ensure that `cache` is not a window object #10080
+        if ( jQuery.support.deleteExpando || !cache.setInterval ) {
+            delete cache[ id ];
+        } else {
+            cache[ id ] = null;
+        }
+
+        // We destroyed the cache and need to eliminate the expando on the node to avoid
+        // false lookups in the cache for entries that no longer exist
+        if ( isNode ) {
+            // IE does not allow us to delete expando properties from nodes,
+            // nor does it have a removeAttribute function on Document nodes;
+            // we must handle all of these cases
+            if ( jQuery.support.deleteExpando ) {
+                delete elem[ internalKey ];
+            } else if ( elem.removeAttribute ) {
+                elem.removeAttribute( internalKey );
+            } else {
+                elem[ internalKey ] = null;
+            }
+        }
+    },
+
+    // For internal use only.
+    _data: function( elem, name, data ) {
+        return jQuery.data( elem, name, data, true );
+    },
+
+    // A method for determining if a DOM node can handle the data expando
+    acceptData: function( elem ) {
+        if ( elem.nodeName ) {
+            var match = jQuery.noData[ elem.nodeName.toLowerCase() ];
+
+            if ( match ) {
+                return !(match === true || elem.getAttribute("classid") !== match);
+            }
+        }
+
+        return true;
+    }
 });
 
 jQuery.fn.extend({
-	data: function( key, value ) {
-		var parts, attr, name,
-			data = null;
-
-		if ( typeof key === "undefined" ) {
-			if ( this.length ) {
-				data = jQuery.data( this[0] );
-
-				if ( this[0].nodeType === 1 && !jQuery._data( this[0], "parsedAttrs" ) ) {
-					attr = this[0].attributes;
-					for ( var i = 0, l = attr.length; i < l; i++ ) {
-						name = attr[i].name;
-
-						if ( name.indexOf( "data-" ) === 0 ) {
-							name = jQuery.camelCase( name.substring(5) );
-
-							dataAttr( this[0], name, data[ name ] );
-						}
-					}
-					jQuery._data( this[0], "parsedAttrs", true );
-				}
-			}
-
-			return data;
-
-		} else if ( typeof key === "object" ) {
-			return this.each(function() {
-				jQuery.data( this, key );
-			});
-		}
-
-		parts = key.split(".");
-		parts[1] = parts[1] ? "." + parts[1] : "";
-
-		if ( value === undefined ) {
-			data = this.triggerHandler("getData" + parts[1] + "!", [parts[0]]);
-
-			// Try to fetch any internally stored data first
-			if ( data === undefined && this.length ) {
-				data = jQuery.data( this[0], key );
-				data = dataAttr( this[0], key, data );
-			}
-
-			return data === undefined && parts[1] ?
-				this.data( parts[0] ) :
-				data;
-
-		} else {
-			return this.each(function() {
-				var self = jQuery( this ),
-					args = [ parts[0], value ];
-
-				self.triggerHandler( "setData" + parts[1] + "!", args );
-				jQuery.data( this, key, value );
-				self.triggerHandler( "changeData" + parts[1] + "!", args );
-			});
-		}
-	},
-
-	removeData: function( key ) {
-		return this.each(function() {
-			jQuery.removeData( this, key );
-		});
-	}
+    data: function( key, value ) {
+        var parts, attr, name,
+            data = null;
+
+        if ( typeof key === "undefined" ) {
+            if ( this.length ) {
+                data = jQuery.data( this[0] );
+
+                if ( this[0].nodeType === 1 && !jQuery._data( this[0], "parsedAttrs" ) ) {
+                    attr = this[0].attributes;
+                    for ( var i = 0, l = attr.length; i < l; i++ ) {
+                        name = attr[i].name;
+
+                        if ( name.indexOf( "data-" ) === 0 ) {
+                            name = jQuery.camelCase( name.substring(5) );
+
+                            dataAttr( this[0], name, data[ name ] );
+                        }
+                    }
+                    jQuery._data( this[0], "parsedAttrs", true );
+                }
+            }
+
+            return data;
+
+        } else if ( typeof key === "object" ) {
+            return this.each(function() {
+                jQuery.data( this, key );
+            });
+        }
+
+        parts = key.split(".");
+        parts[1] = parts[1] ? "." + parts[1] : "";
+
+        if ( value === undefined ) {
+            data = this.triggerHandler("getData" + parts[1] + "!", [parts[0]]);
+
+            // Try to fetch any internally stored data first
+            if ( data === undefined && this.length ) {
+                data = jQuery.data( this[0], key );
+                data = dataAttr( this[0], key, data );
+            }
+
+            return data === undefined && parts[1] ?
+                this.data( parts[0] ) :
+                data;
+
+        } else {
+            return this.each(function() {
+                var self = jQuery( this ),
+                    args = [ parts[0], value ];
+
+                self.triggerHandler( "setData" + parts[1] + "!", args );
+                jQuery.data( this, key, value );
+                self.triggerHandler( "changeData" + parts[1] + "!", args );
+            });
+        }
+    },
+
+    removeData: function( key ) {
+        return this.each(function() {
+            jQuery.removeData( this, key );
+        });
+    }
 });
 
 function dataAttr( elem, key, data ) {
-	// If nothing was found internally, try to fetch any
-	// data from the HTML5 data-* attribute
-	if ( data === undefined && elem.nodeType === 1 ) {
+    // If nothing was found internally, try to fetch any
+    // data from the HTML5 data-* attribute
+    if ( data === undefined && elem.nodeType === 1 ) {
 
-		var name = "data-" + key.replace( rmultiDash, "-$1" ).toLowerCase();
+        var name = "data-" + key.replace( rmultiDash, "-$1" ).toLowerCase();
 
-		data = elem.getAttribute( name );
+        data = elem.getAttribute( name );
 
-		if ( typeof data === "string" ) {
-			try {
-				data = data === "true" ? true :
-				data === "false" ? false :
-				data === "null" ? null :
-				jQuery.isNumeric( data ) ? parseFloat( data ) :
-					rbrace.test( data ) ? jQuery.parseJSON( data ) :
-					data;
-			} catch( e ) {}
+        if ( typeof data === "string" ) {
+            try {
+                data = data === "true" ? true :
+                data === "false" ? false :
+                data === "null" ? null :
+                jQuery.isNumeric( data ) ? parseFloat( data ) :
+                    rbrace.test( data ) ? jQuery.parseJSON( data ) :
+                    data;
+            } catch( e ) {}
 
-			// Make sure we set the data so it isn't changed later
-			jQuery.data( elem, key, data );
+            // Make sure we set the data so it isn't changed later
+            jQuery.data( elem, key, data );
 
-		} else {
-			data = undefined;
-		}
-	}
+        } else {
+            data = undefined;
+        }
+    }
 
-	return data;
+    return data;
 }
 
 // checks a cache object for emptiness
 function isEmptyDataObject( obj ) {
-	for ( var name in obj ) {
-
-		// if the public data object is empty, the private is still empty
-		if ( name === "data" && jQuery.isEmptyObject( obj[name] ) ) {
-			continue;
-		}
-		if ( name !== "toJSON" ) {
-			return false;
-		}
-	}
-
-	return true;
+    for ( var name in obj ) {
+
+        // if the public data object is empty, the private is still empty
+        if ( name === "data" && jQuery.isEmptyObject( obj[name] ) ) {
+            continue;
+        }
+        if ( name !== "toJSON" ) {
+            return false;
+        }
+    }
+
+    return true;
 }
 
 
 
 
 function handleQueueMarkDefer( elem, type, src ) {
-	var deferDataKey = type + "defer",
-		queueDataKey = type + "queue",
-		markDataKey = type + "mark",
-		defer = jQuery._data( elem, deferDataKey );
-	if ( defer &&
-		( src === "queue" || !jQuery._data(elem, queueDataKey) ) &&
-		( src === "mark" || !jQuery._data(elem, markDataKey) ) ) {
-		// Give room for hard-coded callbacks to fire first
-		// and eventually mark/queue something else on the element
-		setTimeout( function() {
-			if ( !jQuery._data( elem, queueDataKey ) &&
-				!jQuery._data( elem, markDataKey ) ) {
-				jQuery.removeData( elem, deferDataKey, true );
-				defer.fire();
-			}
-		}, 0 );
-	}
+    var deferDataKey = type + "defer",
+        queueDataKey = type + "queue",
+        markDataKey = type + "mark",
+        defer = jQuery._data( elem, deferDataKey );
+    if ( defer &&
+        ( src === "queue" || !jQuery._data(elem, queueDataKey) ) &&
+        ( src === "mark" || !jQuery._data(elem, markDataKey) ) ) {
+        // Give room for hard-coded callbacks to fire first
+        // and eventually mark/queue something else on the element
+        setTimeout( function() {
+            if ( !jQuery._data( elem, queueDataKey ) &&
+                !jQuery._data( elem, markDataKey ) ) {
+                jQuery.removeData( elem, deferDataKey, true );
+                defer.fire();
+            }
+        }, 0 );
+    }
 }
 
 jQuery.extend({
 
-	_mark: function( elem, type ) {
-		if ( elem ) {
-			type = ( type || "fx" ) + "mark";
-			jQuery._data( elem, type, (jQuery._data( elem, type ) || 0) + 1 );
-		}
-	},
-
-	_unmark: function( force, elem, type ) {
-		if ( force !== true ) {
-			type = elem;
-			elem = force;
-			force = false;
-		}
-		if ( elem ) {
-			type = type || "fx";
-			var key = type + "mark",
-				count = force ? 0 : ( (jQuery._data( elem, key ) || 1) - 1 );
-			if ( count ) {
-				jQuery._data( elem, key, count );
-			} else {
-				jQuery.removeData( elem, key, true );
-				handleQueueMarkDefer( elem, type, "mark" );
-			}
-		}
-	},
-
-	queue: function( elem, type, data ) {
-		var q;
-		if ( elem ) {
-			type = ( type || "fx" ) + "queue";
-			q = jQuery._data( elem, type );
-
-			// Speed up dequeue by getting out quickly if this is just a lookup
-			if ( data ) {
-				if ( !q || jQuery.isArray(data) ) {
-					q = jQuery._data( elem, type, jQuery.makeArray(data) );
-				} else {
-					q.push( data );
-				}
-			}
-			return q || [];
-		}
-	},
-
-	dequeue: function( elem, type ) {
-		type = type || "fx";
-
-		var queue = jQuery.queue( elem, type ),
-			fn = queue.shift(),
-			hooks = {};
-
-		// If the fx queue is dequeued, always remove the progress sentinel
-		if ( fn === "inprogress" ) {
-			fn = queue.shift();
-		}
-
-		if ( fn ) {
-			// Add a progress sentinel to prevent the fx queue from being
-			// automatically dequeued
-			if ( type === "fx" ) {
-				queue.unshift( "inprogress" );
-			}
-
-			jQuery._data( elem, type + ".run", hooks );
-			fn.call( elem, function() {
-				jQuery.dequeue( elem, type );
-			}, hooks );
-		}
-
-		if ( !queue.length ) {
-			jQuery.removeData( elem, type + "queue " + type + ".run", true );
-			handleQueueMarkDefer( elem, type, "queue" );
-		}
-	}
+    _mark: function( elem, type ) {
+        if ( elem ) {
+            type = ( type || "fx" ) + "mark";
+            jQuery._data( elem, type, (jQuery._data( elem, type ) || 0) + 1 );
+        }
+    },
+
+    _unmark: function( force, elem, type ) {
+        if ( force !== true ) {
+            type = elem;
+            elem = force;
+            force = false;
+        }
+        if ( elem ) {
+            type = type || "fx";
+            var key = type + "mark",
+                count = force ? 0 : ( (jQuery._data( elem, key ) || 1) - 1 );
+            if ( count ) {
+                jQuery._data( elem, key, count );
+            } else {
+                jQuery.removeData( elem, key, true );
+                handleQueueMarkDefer( elem, type, "mark" );
+            }
+        }
+    },
+
+    queue: function( elem, type, data ) {
+        var q;
+        if ( elem ) {
+            type = ( type || "fx" ) + "queue";
+            q = jQuery._data( elem, type );
+
+            // Speed up dequeue by getting out quickly if this is just a lookup
+            if ( data ) {
+                if ( !q || jQuery.isArray(data) ) {
+                    q = jQuery._data( elem, type, jQuery.makeArray(data) );
+                } else {
+                    q.push( data );
+                }
+            }
+            return q || [];
+        }
+    },
+
+    dequeue: function( elem, type ) {
+        type = type || "fx";
+
+        var queue = jQuery.queue( elem, type ),
+            fn = queue.shift(),
+            hooks = {};
+
+        // If the fx queue is dequeued, always remove the progress sentinel
+        if ( fn === "inprogress" ) {
+            fn = queue.shift();
+        }
+
+        if ( fn ) {
+            // Add a progress sentinel to prevent the fx queue from being
+            // automatically dequeued
+            if ( type === "fx" ) {
+                queue.unshift( "inprogress" );
+            }
+
+            jQuery._data( elem, type + ".run", hooks );
+            fn.call( elem, function() {
+                jQuery.dequeue( elem, type );
+            }, hooks );
+        }
+
+        if ( !queue.length ) {
+            jQuery.removeData( elem, type + "queue " + type + ".run", true );
+            handleQueueMarkDefer( elem, type, "queue" );
+        }
+    }
 });
 
 jQuery.fn.extend({
-	queue: function( type, data ) {
-		if ( typeof type !== "string" ) {
-			data = type;
-			type = "fx";
-		}
-
-		if ( data === undefined ) {
-			return jQuery.queue( this[0], type );
-		}
-		return this.each(function() {
-			var queue = jQuery.queue( this, type, data );
-
-			if ( type === "fx" && queue[0] !== "inprogress" ) {
-				jQuery.dequeue( this, type );
-			}
-		});
-	},
-	dequeue: function( type ) {
-		return this.each(function() {
-			jQuery.dequeue( this, type );
-		});
-	},
-	// Based off of the plugin by Clint Helfers, with permission.
-	// http://blindsignals.com/index.php/2009/07/jquery-delay/
-	delay: function( time, type ) {
-		time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
-		type = type || "fx";
-
-		return this.queue( type, function( next, hooks ) {
-			var timeout = setTimeout( next, time );
-			hooks.stop = function() {
-				clearTimeout( timeout );
-			};
-		});
-	},
-	clearQueue: function( type ) {
-		return this.queue( type || "fx", [] );
-	},
-	// Get a promise resolved when queues of a certain type
-	// are emptied (fx is the type by default)
-	promise: function( type, object ) {
-		if ( typeof type !== "string" ) {
-			object = type;
-			type = undefined;
-		}
-		type = type || "fx";
-		var defer = jQuery.Deferred(),
-			elements = this,
-			i = elements.length,
-			count = 1,
-			deferDataKey = type + "defer",
-			queueDataKey = type + "queue",
-			markDataKey = type + "mark",
-			tmp;
-		function resolve() {
-			if ( !( --count ) ) {
-				defer.resolveWith( elements, [ elements ] );
-			}
-		}
-		while( i-- ) {
-			if (( tmp = jQuery.data( elements[ i ], deferDataKey, undefined, true ) ||
-					( jQuery.data( elements[ i ], queueDataKey, undefined, true ) ||
-						jQuery.data( elements[ i ], markDataKey, undefined, true ) ) &&
-					jQuery.data( elements[ i ], deferDataKey, jQuery.Callbacks( "once memory" ), true ) )) {
-				count++;
-				tmp.add( resolve );
-			}
-		}
-		resolve();
-		return defer.promise();
-	}
+    queue: function( type, data ) {
+        if ( typeof type !== "string" ) {
+            data = type;
+            type = "fx";
+        }
+
+        if ( data === undefined ) {
+            return jQuery.queue( this[0], type );
+        }
+        return this.each(function() {
+            var queue = jQuery.queue( this, type, data );
+
+            if ( type === "fx" && queue[0] !== "inprogress" ) {
+                jQuery.dequeue( this, type );
+            }
+        });
+    },
+    dequeue: function( type ) {
+        return this.each(function() {
+            jQuery.dequeue( this, type );
+        });
+    },
+    // Based off of the plugin by Clint Helfers, with permission.
+    // http://blindsignals.com/index.php/2009/07/jquery-delay/
+    delay: function( time, type ) {
+        time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
+        type = type || "fx";
+
+        return this.queue( type, function( next, hooks ) {
+            var timeout = setTimeout( next, time );
+            hooks.stop = function() {
+                clearTimeout( timeout );
+            };
+        });
+    },
+    clearQueue: function( type ) {
+        return this.queue( type || "fx", [] );
+    },
+    // Get a promise resolved when queues of a certain type
+    // are emptied (fx is the type by default)
+    promise: function( type, object ) {
+        if ( typeof type !== "string" ) {
+            object = type;
+            type = undefined;
+        }
+        type = type || "fx";
+        var defer = jQuery.Deferred(),
+            elements = this,
+            i = elements.length,
+            count = 1,
+            deferDataKey = type + "defer",
+            queueDataKey = type + "queue",
+            markDataKey = type + "mark",
+            tmp;
+        function resolve() {
+            if ( !( --count ) ) {
+                defer.resolveWith( elements, [ elements ] );
+            }
+        }
+        while( i-- ) {
+            if (( tmp = jQuery.data( elements[ i ], deferDataKey, undefined, true ) ||
+                    ( jQuery.data( elements[ i ], queueDataKey, undefined, true ) ||
+                        jQuery.data( elements[ i ], markDataKey, undefined, true ) ) &&
+                    jQuery.data( elements[ i ], deferDataKey, jQuery.Callbacks( "once memory" ), true ) )) {
+                count++;
+                tmp.add( resolve );
+            }
+        }
+        resolve();
+        return defer.promise();
+    }
 });
 
 
 
 
 var rclass = /[\n\t\r]/g,
-	rspace = /\s+/,
-	rreturn = /\r/g,
-	rtype = /^(?:button|input)$/i,
-	rfocusable = /^(?:button|input|object|select|textarea)$/i,
-	rclickable = /^a(?:rea)?$/i,
-	rboolean = /^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,
-	getSetAttribute = jQuery.support.getSetAttribute,
-	nodeHook, boolHook, fixSpecified;
+    rspace = /\s+/,
+    rreturn = /\r/g,
+    rtype = /^(?:button|input)$/i,
+    rfocusable = /^(?:button|input|object|select|textarea)$/i,
+    rclickable = /^a(?:rea)?$/i,
+    rboolean = /^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,
+    getSetAttribute = jQuery.support.getSetAttribute,
+    nodeHook, boolHook, fixSpecified;
 
 jQuery.fn.extend({
-	attr: function( name, value ) {
-		return jQuery.access( this, name, value, true, jQuery.attr );
-	},
-
-	removeAttr: function( name ) {
-		return this.each(function() {
-			jQuery.removeAttr( this, name );
-		});
-	},
-
-	prop: function( name, value ) {
-		return jQuery.access( this, name, value, true, jQuery.prop );
-	},
-
-	removeProp: function( name ) {
-		name = jQuery.propFix[ name ] || name;
-		return this.each(function() {
-			// try/catch handles cases where IE balks (such as removing a property on window)
-			try {
-				this[ name ] = undefined;
-				delete this[ name ];
-			} catch( e ) {}
-		});
-	},
-
-	addClass: function( value ) {
-		var classNames, i, l, elem,
-			setClass, c, cl;
-
-		if ( jQuery.isFunction( value ) ) {
-			return this.each(function( j ) {
-				jQuery( this ).addClass( value.call(this, j, this.className) );
-			});
-		}
-
-		if ( value && typeof value === "string" ) {
-			classNames = value.split( rspace );
-
-			for ( i = 0, l = this.length; i < l; i++ ) {
-				elem = this[ i ];
-
-				if ( elem.nodeType === 1 ) {
-					if ( !elem.className && classNames.length === 1 ) {
-						elem.className = value;
-
-					} else {
-						setClass = " " + elem.className + " ";
-
-						for ( c = 0, cl = classNames.length; c < cl; c++ ) {
-							if ( !~setClass.indexOf( " " + classNames[ c ] + " " ) ) {
-								setClass += classNames[ c ] + " ";
-							}
-						}
-						elem.className = jQuery.trim( setClass );
-					}
-				}
-			}
-		}
-
-		return this;
-	},
-
-	removeClass: function( value ) {
-		var classNames, i, l, elem, className, c, cl;
-
-		if ( jQuery.isFunction( value ) ) {
-			return this.each(function( j ) {
-				jQuery( this ).removeClass( value.call(this, j, this.className) );
-			});
-		}
-
-		if ( (value && typeof value === "string") || value === undefined ) {
-			classNames = ( value || "" ).split( rspace );
-
-			for ( i = 0, l = this.length; i < l; i++ ) {
-				elem = this[ i ];
-
-				if ( elem.nodeType === 1 && elem.className ) {
-					if ( value ) {
-						className = (" " + elem.className + " ").replace( rclass, " " );
-						for ( c = 0, cl = classNames.length; c < cl; c++ ) {
-							className = className.replace(" " + classNames[ c ] + " ", " ");
-						}
-						elem.className = jQuery.trim( className );
-
-					} else {
-						elem.className = "";
-					}
-				}
-			}
-		}
-
-		return this;
-	},
-
-	toggleClass: function( value, stateVal ) {
-		var type = typeof value,
-			isBool = typeof stateVal === "boolean";
-
-		if ( jQuery.isFunction( value ) ) {
-			return this.each(function( i ) {
-				jQuery( this ).toggleClass( value.call(this, i, this.className, stateVal), stateVal );
-			});
-		}
-
-		return this.each(function() {
-			if ( type === "string" ) {
-				// toggle individual class names
-				var className,
-					i = 0,
-					self = jQuery( this ),
-					state = stateVal,
-					classNames = value.split( rspace );
-
-				while ( (className = classNames[ i++ ]) ) {
-					// check each className given, space seperated list
-					state = isBool ? state : !self.hasClass( className );
-					self[ state ? "addClass" : "removeClass" ]( className );
-				}
-
-			} else if ( type === "undefined" || type === "boolean" ) {
-				if ( this.className ) {
-					// store className if set
-					jQuery._data( this, "__className__", this.className );
-				}
-
-				// toggle whole className
-				this.className = this.className || value === false ? "" : jQuery._data( this, "__className__" ) || "";
-			}
-		});
-	},
-
-	hasClass: function( selector ) {
-		var className = " " + selector + " ",
-			i = 0,
-			l = this.length;
-		for ( ; i < l; i++ ) {
-			if ( this[i].nodeType === 1 && (" " + this[i].className + " ").replace(rclass, " ").indexOf( className ) > -1 ) {
-				return true;
-			}
-		}
-
-		return false;
-	},
-
-	val: function( value ) {
-		var hooks, ret, isFunction,
-			elem = this[0];
-
-		if ( !arguments.length ) {
-			if ( elem ) {
-				hooks = jQuery.valHooks[ elem.nodeName.toLowerCase() ] || jQuery.valHooks[ elem.type ];
-
-				if ( hooks && "get" in hooks && (ret = hooks.get( elem, "value" )) !== undefined ) {
-					return ret;
-				}
-
-				ret = elem.value;
-
-				return typeof ret === "string" ?
-					// handle most common string cases
-					ret.replace(rreturn, "") :
-					// handle cases where value is null/undef or number
-					ret == null ? "" : ret;
-			}
-
-			return;
-		}
-
-		isFunction = jQuery.isFunction( value );
-
-		return this.each(function( i ) {
-			var self = jQuery(this), val;
-
-			if ( this.nodeType !== 1 ) {
-				return;
-			}
-
-			if ( isFunction ) {
-				val = value.call( this, i, self.val() );
-			} else {
-				val = value;
-			}
-
-			// Treat null/undefined as ""; convert numbers to string
-			if ( val == null ) {
-				val = "";
-			} else if ( typeof val === "number" ) {
-				val += "";
-			} else if ( jQuery.isArray( val ) ) {
-				val = jQuery.map(val, function ( value ) {
-					return value == null ? "" : value + "";
-				});
-			}
-
-			hooks = jQuery.valHooks[ this.nodeName.toLowerCase() ] || jQuery.valHooks[ this.type ];
-
-			// If set returns undefined, fall back to normal setting
-			if ( !hooks || !("set" in hooks) || hooks.set( this, val, "value" ) === undefined ) {
-				this.value = val;
-			}
-		});
-	}
+    attr: function( name, value ) {
+        return jQuery.access( this, name, value, true, jQuery.attr );
+    },
+
+    removeAttr: function( name ) {
+        return this.each(function() {
+            jQuery.removeAttr( this, name );
+        });
+    },
+
+    prop: function( name, value ) {
+        return jQuery.access( this, name, value, true, jQuery.prop );
+    },
+
+    removeProp: function( name ) {
+        name = jQuery.propFix[ name ] || name;
+        return this.each(function() {
+            // try/catch handles cases where IE balks (such as removing a property on window)
+            try {
+                this[ name ] = undefined;
+                delete this[ name ];
+            } catch( e ) {}
+        });
+    },
+
+    addClass: function( value ) {
+        var classNames, i, l, elem,
+            setClass, c, cl;
+
+        if ( jQuery.isFunction( value ) ) {
+            return this.each(function( j ) {
+                jQuery( this ).addClass( value.call(this, j, this.className) );
+            });
+        }
+
+        if ( value && typeof value === "string" ) {
+            classNames = value.split( rspace );
+
+            for ( i = 0, l = this.length; i < l; i++ ) {
+                elem = this[ i ];
+
+                if ( elem.nodeType === 1 ) {
+                    if ( !elem.className && classNames.length === 1 ) {
+                        elem.className = value;
+
+                    } else {
+                        setClass = " " + elem.className + " ";
+
+                        for ( c = 0, cl = classNames.length; c < cl; c++ ) {
+                            if ( !~setClass.indexOf( " " + classNames[ c ] + " " ) ) {
+                                setClass += classNames[ c ] + " ";
+                            }
+                        }
+                        elem.className = jQuery.trim( setClass );
+                    }
+                }
+            }
+        }
+
+        return this;
+    },
+
+    removeClass: function( value ) {
+        var classNames, i, l, elem, className, c, cl;
+
+        if ( jQuery.isFunction( value ) ) {
+            return this.each(function( j ) {
+                jQuery( this ).removeClass( value.call(this, j, this.className) );
+            });
+        }
+
+        if ( (value && typeof value === "string") || value === undefined ) {
+            classNames = ( value || "" ).split( rspace );
+
+            for ( i = 0, l = this.length; i < l; i++ ) {
+                elem = this[ i ];
+
+                if ( elem.nodeType === 1 && elem.className ) {
+                    if ( value ) {
+                        className = (" " + elem.className + " ").replace( rclass, " " );
+                        for ( c = 0, cl = classNames.length; c < cl; c++ ) {
+                            className = className.replace(" " + classNames[ c ] + " ", " ");
+                        }
+                        elem.className = jQuery.trim( className );
+
+                    } else {
+                        elem.className = "";
+                    }
+                }
+            }
+        }
+
+        return this;
+    },
+
+    toggleClass: function( value, stateVal ) {
+        var type = typeof value,
+            isBool = typeof stateVal === "boolean";
+
+        if ( jQuery.isFunction( value ) ) {
+            return this.each(function( i ) {
+                jQuery( this ).toggleClass( value.call(this, i, this.className, stateVal), stateVal );
+            });
+        }
+
+        return this.each(function() {
+            if ( type === "string" ) {
+                // toggle individual class names
+                var className,
+                    i = 0,
+                    self = jQuery( this ),
+                    state = stateVal,
+                    classNames = value.split( rspace );
+
+                while ( (className = classNames[ i++ ]) ) {
+                    // check each className given, space seperated list
+                    state = isBool ? state : !self.hasClass( className );
+                    self[ state ? "addClass" : "removeClass" ]( className );
+                }
+
+            } else if ( type === "undefined" || type === "boolean" ) {
+                if ( this.className ) {
+                    // store className if set
+                    jQuery._data( this, "__className__", this.className );
+                }
+
+                // toggle whole className
+                this.className = this.className || value === false ? "" : jQuery._data( this, "__className__" ) || "";
+            }
+        });
+    },
+
+    hasClass: function( selector ) {
+        var className = " " + selector + " ",
+            i = 0,
+            l = this.length;
+        for ( ; i < l; i++ ) {
+            if ( this[i].nodeType === 1 && (" " + this[i].className + " ").replace(rclass, " ").indexOf( className ) > -1 ) {
+                return true;
+            }
+        }
+
+        return false;
+    },
+
+    val: function( value ) {
+        var hooks, ret, isFunction,
+            elem = this[0];
+
+        if ( !arguments.length ) {
+            if ( elem ) {
+                hooks = jQuery.valHooks[ elem.nodeName.toLowerCase() ] || jQuery.valHooks[ elem.type ];
+
+                if ( hooks && "get" in hooks && (ret = hooks.get( elem, "value" )) !== undefined ) {
+                    return ret;
+                }
+
+                ret = elem.value;
+
+                return typeof ret === "string" ?
+                    // handle most common string cases
+                    ret.replace(rreturn, "") :
+                    // handle cases where value is null/undef or number
+                    ret == null ? "" : ret;
+            }
+
+            return;
+        }
+
+        isFunction = jQuery.isFunction( value );
+
+        return this.each(function( i ) {
+            var self = jQuery(this), val;
+
+            if ( this.nodeType !== 1 ) {
+                return;
+            }
+
+            if ( isFunction ) {
+                val = value.call( this, i, self.val() );
+            } else {
+                val = value;
+            }
+
+            // Treat null/undefined as ""; convert numbers to string
+            if ( val == null ) {
+                val = "";
+            } else if ( typeof val === "number" ) {
+                val += "";
+            } else if ( jQuery.isArray( val ) ) {
+                val = jQuery.map(val, function ( value ) {
+                    return value == null ? "" : value + "";
+                });
+            }
+
+            hooks = jQuery.valHooks[ this.nodeName.toLowerCase() ] || jQuery.valHooks[ this.type ];
+
+            // If set returns undefined, fall back to normal setting
+            if ( !hooks || !("set" in hooks) || hooks.set( this, val, "value" ) === undefined ) {
+                this.value = val;
+            }
+        });
+    }
 });
 
 jQuery.extend({
-	valHooks: {
-		option: {
-			get: function( elem ) {
-				// attributes.value is undefined in Blackberry 4.7 but
-				// uses .value. See #6932
-				var val = elem.attributes.value;
-				return !val || val.specified ? elem.value : elem.text;
-			}
-		},
-		select: {
-			get: function( elem ) {
-				var value, i, max, option,
-					index = elem.selectedIndex,
-					values = [],
-					options = elem.options,
-					one = elem.type === "select-one";
-
-				// Nothing was selected
-				if ( index < 0 ) {
-					return null;
-				}
-
-				// Loop through all the selected options
-				i = one ? index : 0;
-				max = one ? index + 1 : options.length;
-				for ( ; i < max; i++ ) {
-					option = options[ i ];
-
-					// Don't return options that are disabled or in a disabled optgroup
-					if ( option.selected && (jQuery.support.optDisabled ? !option.disabled : option.getAttribute("disabled") === null) &&
-							(!option.parentNode.disabled || !jQuery.nodeName( option.parentNode, "optgroup" )) ) {
-
-						// Get the specific value for the option
-						value = jQuery( option ).val();
-
-						// We don't need an array for one selects
-						if ( one ) {
-							return value;
-						}
-
-						// Multi-Selects return an array
-						values.push( value );
-					}
-				}
-
-				// Fixes Bug #2551 -- select.val() broken in IE after form.reset()
-				if ( one && !values.length && options.length ) {
-					return jQuery( options[ index ] ).val();
-				}
-
-				return values;
-			},
-
-			set: function( elem, value ) {
-				var values = jQuery.makeArray( value );
-
-				jQuery(elem).find("option").each(function() {
-					this.selected = jQuery.inArray( jQuery(this).val(), values ) >= 0;
-				});
-
-				if ( !values.length ) {
-					elem.selectedIndex = -1;
-				}
-				return values;
-			}
-		}
-	},
-
-	attrFn: {
-		val: true,
-		css: true,
-		html: true,
-		text: true,
-		data: true,
-		width: true,
-		height: true,
-		offset: true
-	},
-
-	attr: function( elem, name, value, pass ) {
-		var ret, hooks, notxml,
-			nType = elem.nodeType;
-
-		// don't get/set attributes on text, comment and attribute nodes
-		if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		if ( pass && name in jQuery.attrFn ) {
-			return jQuery( elem )[ name ]( value );
-		}
-
-		// Fallback to prop when attributes are not supported
-		if ( typeof elem.getAttribute === "undefined" ) {
-			return jQuery.prop( elem, name, value );
-		}
-
-		notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
-
-		// All attributes are lowercase
-		// Grab necessary hook if one is defined
-		if ( notxml ) {
-			name = name.toLowerCase();
-			hooks = jQuery.attrHooks[ name ] || ( rboolean.test( name ) ? boolHook : nodeHook );
-		}
-
-		if ( value !== undefined ) {
-
-			if ( value === null ) {
-				jQuery.removeAttr( elem, name );
-				return;
-
-			} else if ( hooks && "set" in hooks && notxml && (ret = hooks.set( elem, value, name )) !== undefined ) {
-				return ret;
-
-			} else {
-				elem.setAttribute( name, "" + value );
-				return value;
-			}
-
-		} else if ( hooks && "get" in hooks && notxml && (ret = hooks.get( elem, name )) !== null ) {
-			return ret;
-
-		} else {
-
-			ret = elem.getAttribute( name );
-
-			// Non-existent attributes return null, we normalize to undefined
-			return ret === null ?
-				undefined :
-				ret;
-		}
-	},
-
-	removeAttr: function( elem, value ) {
-		var propName, attrNames, name, l,
-			i = 0;
-
-		if ( value && elem.nodeType === 1 ) {
-			attrNames = value.toLowerCase().split( rspace );
-			l = attrNames.length;
-
-			for ( ; i < l; i++ ) {
-				name = attrNames[ i ];
-
-				if ( name ) {
-					propName = jQuery.propFix[ name ] || name;
-
-					// See #9699 for explanation of this approach (setting first, then removal)
-					jQuery.attr( elem, name, "" );
-					elem.removeAttribute( getSetAttribute ? name : propName );
-
-					// Set corresponding property to false for boolean attributes
-					if ( rboolean.test( name ) && propName in elem ) {
-						elem[ propName ] = false;
-					}
-				}
-			}
-		}
-	},
-
-	attrHooks: {
-		type: {
-			set: function( elem, value ) {
-				// We can't allow the type property to be changed (since it causes problems in IE)
-				if ( rtype.test( elem.nodeName ) && elem.parentNode ) {
-					jQuery.error( "type property can't be changed" );
-				} else if ( !jQuery.support.radioValue && value === "radio" && jQuery.nodeName(elem, "input") ) {
-					// Setting the type on a radio button after the value resets the value in IE6-9
-					// Reset value to it's default in case type is set after value
-					// This is for element creation
-					var val = elem.value;
-					elem.setAttribute( "type", value );
-					if ( val ) {
-						elem.value = val;
-					}
-					return value;
-				}
-			}
-		},
-		// Use the value property for back compat
-		// Use the nodeHook for button elements in IE6/7 (#1954)
-		value: {
-			get: function( elem, name ) {
-				if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
-					return nodeHook.get( elem, name );
-				}
-				return name in elem ?
-					elem.value :
-					null;
-			},
-			set: function( elem, value, name ) {
-				if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
-					return nodeHook.set( elem, value, name );
-				}
-				// Does not return so that setAttribute is also used
-				elem.value = value;
-			}
-		}
-	},
-
-	propFix: {
-		tabindex: "tabIndex",
-		readonly: "readOnly",
-		"for": "htmlFor",
-		"class": "className",
-		maxlength: "maxLength",
-		cellspacing: "cellSpacing",
-		cellpadding: "cellPadding",
-		rowspan: "rowSpan",
-		colspan: "colSpan",
-		usemap: "useMap",
-		frameborder: "frameBorder",
-		contenteditable: "contentEditable"
-	},
-
-	prop: function( elem, name, value ) {
-		var ret, hooks, notxml,
-			nType = elem.nodeType;
-
-		// don't get/set properties on text, comment and attribute nodes
-		if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
-
-		if ( notxml ) {
-			// Fix name and attach hooks
-			name = jQuery.propFix[ name ] || name;
-			hooks = jQuery.propHooks[ name ];
-		}
-
-		if ( value !== undefined ) {
-			if ( hooks && "set" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ) {
-				return ret;
-
-			} else {
-				return ( elem[ name ] = value );
-			}
-
-		} else {
-			if ( hooks && "get" in hooks && (ret = hooks.get( elem, name )) !== null ) {
-				return ret;
-
-			} else {
-				return elem[ name ];
-			}
-		}
-	},
-
-	propHooks: {
-		tabIndex: {
-			get: function( elem ) {
-				// elem.tabIndex doesn't always return the correct value when it hasn't been explicitly set
-				// http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
-				var attributeNode = elem.getAttributeNode("tabindex");
-
-				return attributeNode && attributeNode.specified ?
-					parseInt( attributeNode.value, 10 ) :
-					rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ?
-						0 :
-						undefined;
-			}
-		}
-	}
+    valHooks: {
+        option: {
+            get: function( elem ) {
+                // attributes.value is undefined in Blackberry 4.7 but
+                // uses .value. See #6932
+                var val = elem.attributes.value;
+                return !val || val.specified ? elem.value : elem.text;
+            }
+        },
+        select: {
+            get: function( elem ) {
+                var value, i, max, option,
+                    index = elem.selectedIndex,
+                    values = [],
+                    options = elem.options,
+                    one = elem.type === "select-one";
+
+                // Nothing was selected
+                if ( index < 0 ) {
+                    return null;
+                }
+
+                // Loop through all the selected options
+                i = one ? index : 0;
+                max = one ? index + 1 : options.length;
+                for ( ; i < max; i++ ) {
+                    option = options[ i ];
+
+                    // Don't return options that are disabled or in a disabled optgroup
+                    if ( option.selected && (jQuery.support.optDisabled ? !option.disabled : option.getAttribute("disabled") === null) &&
+                            (!option.parentNode.disabled || !jQuery.nodeName( option.parentNode, "optgroup" )) ) {
+
+                        // Get the specific value for the option
+                        value = jQuery( option ).val();
+
+                        // We don't need an array for one selects
+                        if ( one ) {
+                            return value;
+                        }
+
+                        // Multi-Selects return an array
+                        values.push( value );
+                    }
+                }
+
+                // Fixes Bug #2551 -- select.val() broken in IE after form.reset()
+                if ( one && !values.length && options.length ) {
+                    return jQuery( options[ index ] ).val();
+                }
+
+                return values;
+            },
+
+            set: function( elem, value ) {
+                var values = jQuery.makeArray( value );
+
+                jQuery(elem).find("option").each(function() {
+                    this.selected = jQuery.inArray( jQuery(this).val(), values ) >= 0;
+                });
+
+                if ( !values.length ) {
+                    elem.selectedIndex = -1;
+                }
+                return values;
+            }
+        }
+    },
+
+    attrFn: {
+        val: true,
+        css: true,
+        html: true,
+        text: true,
+        data: true,
+        width: true,
+        height: true,
+        offset: true
+    },
+
+    attr: function( elem, name, value, pass ) {
+        var ret, hooks, notxml,
+            nType = elem.nodeType;
+
+        // don't get/set attributes on text, comment and attribute nodes
+        if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
+            return;
+        }
+
+        if ( pass && name in jQuery.attrFn ) {
+            return jQuery( elem )[ name ]( value );
+        }
+
+        // Fallback to prop when attributes are not supported
+        if ( typeof elem.getAttribute === "undefined" ) {
+            return jQuery.prop( elem, name, value );
+        }
+
+        notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
+
+        // All attributes are lowercase
+        // Grab necessary hook if one is defined
+        if ( notxml ) {
+            name = name.toLowerCase();
+            hooks = jQuery.attrHooks[ name ] || ( rboolean.test( name ) ? boolHook : nodeHook );
+        }
+
+        if ( value !== undefined ) {
+
+            if ( value === null ) {
+                jQuery.removeAttr( elem, name );
+                return;
+
+            } else if ( hooks && "set" in hooks && notxml && (ret = hooks.set( elem, value, name )) !== undefined ) {
+                return ret;
+
+            } else {
+                elem.setAttribute( name, "" + value );
+                return value;
+            }
+
+        } else if ( hooks && "get" in hooks && notxml && (ret = hooks.get( elem, name )) !== null ) {
+            return ret;
+
+        } else {
+
+            ret = elem.getAttribute( name );
+
+            // Non-existent attributes return null, we normalize to undefined
+            return ret === null ?
+                undefined :
+                ret;
+        }
+    },
+
+    removeAttr: function( elem, value ) {
+        var propName, attrNames, name, l,
+            i = 0;
+
+        if ( value && elem.nodeType === 1 ) {
+            attrNames = value.toLowerCase().split( rspace );
+            l = attrNames.length;
+
+            for ( ; i < l; i++ ) {
+                name = attrNames[ i ];
+
+                if ( name ) {
+                    propName = jQuery.propFix[ name ] || name;
+
+                    // See #9699 for explanation of this approach (setting first, then removal)
+                    jQuery.attr( elem, name, "" );
+                    elem.removeAttribute( getSetAttribute ? name : propName );
+
+                    // Set corresponding property to false for boolean attributes
+                    if ( rboolean.test( name ) && propName in elem ) {
+                        elem[ propName ] = false;
+                    }
+                }
+            }
+        }
+    },
+
+    attrHooks: {
+        type: {
+            set: function( elem, value ) {
+                // We can't allow the type property to be changed (since it causes problems in IE)
+                if ( rtype.test( elem.nodeName ) && elem.parentNode ) {
+                    jQuery.error( "type property can't be changed" );
+                } else if ( !jQuery.support.radioValue && value === "radio" && jQuery.nodeName(elem, "input") ) {
+                    // Setting the type on a radio button after the value resets the value in IE6-9
+                    // Reset value to it's default in case type is set after value
+                    // This is for element creation
+                    var val = elem.value;
+                    elem.setAttribute( "type", value );
+                    if ( val ) {
+                        elem.value = val;
+                    }
+                    return value;
+                }
+            }
+        },
+        // Use the value property for back compat
+        // Use the nodeHook for button elements in IE6/7 (#1954)
+        value: {
+            get: function( elem, name ) {
+                if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
+                    return nodeHook.get( elem, name );
+                }
+                return name in elem ?
+                    elem.value :
+                    null;
+            },
+            set: function( elem, value, name ) {
+                if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
+                    return nodeHook.set( elem, value, name );
+                }
+                // Does not return so that setAttribute is also used
+                elem.value = value;
+            }
+        }
+    },
+
+    propFix: {
+        tabindex: "tabIndex",
+        readonly: "readOnly",
+        "for": "htmlFor",
+        "class": "className",
+        maxlength: "maxLength",
+        cellspacing: "cellSpacing",
+        cellpadding: "cellPadding",
+        rowspan: "rowSpan",
+        colspan: "colSpan",
+        usemap: "useMap",
+        frameborder: "frameBorder",
+        contenteditable: "contentEditable"
+    },
+
+    prop: function( elem, name, value ) {
+        var ret, hooks, notxml,
+            nType = elem.nodeType;
+
+        // don't get/set properties on text, comment and attribute nodes
+        if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
+            return;
+        }
+
+        notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
+
+        if ( notxml ) {
+            // Fix name and attach hooks
+            name = jQuery.propFix[ name ] || name;
+            hooks = jQuery.propHooks[ name ];
+        }
+
+        if ( value !== undefined ) {
+            if ( hooks && "set" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ) {
+                return ret;
+
+            } else {
+                return ( elem[ name ] = value );
+            }
+
+        } else {
+            if ( hooks && "get" in hooks && (ret = hooks.get( elem, name )) !== null ) {
+                return ret;
+
+            } else {
+                return elem[ name ];
+            }
+        }
+    },
+
+    propHooks: {
+        tabIndex: {
+            get: function( elem ) {
+                // elem.tabIndex doesn't always return the correct value when it hasn't been explicitly set
+                // http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
+                var attributeNode = elem.getAttributeNode("tabindex");
+
+                return attributeNode && attributeNode.specified ?
+                    parseInt( attributeNode.value, 10 ) :
+                    rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ?
+                        0 :
+                        undefined;
+            }
+        }
+    }
 });
 
 // Add the tabIndex propHook to attrHooks for back-compat (different case is intentional)
@@ -2642,196 +2642,196 @@ jQuery.attrHooks.tabindex = jQuery.propHooks.tabIndex;
 
 // Hook for boolean attributes
 boolHook = {
-	get: function( elem, name ) {
-		// Align boolean attributes with corresponding properties
-		// Fall back to attribute presence where some booleans are not supported
-		var attrNode,
-			property = jQuery.prop( elem, name );
-		return property === true || typeof property !== "boolean" && ( attrNode = elem.getAttributeNode(name) ) && attrNode.nodeValue !== false ?
-			name.toLowerCase() :
-			undefined;
-	},
-	set: function( elem, value, name ) {
-		var propName;
-		if ( value === false ) {
-			// Remove boolean attributes when set to false
-			jQuery.removeAttr( elem, name );
-		} else {
-			// value is true since we know at this point it's type boolean and not false
-			// Set boolean attributes to the same name and set the DOM property
-			propName = jQuery.propFix[ name ] || name;
-			if ( propName in elem ) {
-				// Only set the IDL specifically if it already exists on the element
-				elem[ propName ] = true;
-			}
-
-			elem.setAttribute( name, name.toLowerCase() );
-		}
-		return name;
-	}
+    get: function( elem, name ) {
+        // Align boolean attributes with corresponding properties
+        // Fall back to attribute presence where some booleans are not supported
+        var attrNode,
+            property = jQuery.prop( elem, name );
+        return property === true || typeof property !== "boolean" && ( attrNode = elem.getAttributeNode(name) ) && attrNode.nodeValue !== false ?
+            name.toLowerCase() :
+            undefined;
+    },
+    set: function( elem, value, name ) {
+        var propName;
+        if ( value === false ) {
+            // Remove boolean attributes when set to false
+            jQuery.removeAttr( elem, name );
+        } else {
+            // value is true since we know at this point it's type boolean and not false
+            // Set boolean attributes to the same name and set the DOM property
+            propName = jQuery.propFix[ name ] || name;
+            if ( propName in elem ) {
+                // Only set the IDL specifically if it already exists on the element
+                elem[ propName ] = true;
+            }
+
+            elem.setAttribute( name, name.toLowerCase() );
+        }
+        return name;
+    }
 };
 
 // IE6/7 do not support getting/setting some attributes with get/setAttribute
 if ( !getSetAttribute ) {
 
-	fixSpecified = {
-		name: true,
-		id: true
-	};
-
-	// Use this for any attribute in IE6/7
-	// This fixes almost every IE6/7 issue
-	nodeHook = jQuery.valHooks.button = {
-		get: function( elem, name ) {
-			var ret;
-			ret = elem.getAttributeNode( name );
-			return ret && ( fixSpecified[ name ] ? ret.nodeValue !== "" : ret.specified ) ?
-				ret.nodeValue :
-				undefined;
-		},
-		set: function( elem, value, name ) {
-			// Set the existing or create a new attribute node
-			var ret = elem.getAttributeNode( name );
-			if ( !ret ) {
-				ret = document.createAttribute( name );
-				elem.setAttributeNode( ret );
-			}
-			return ( ret.nodeValue = value + "" );
-		}
-	};
-
-	// Apply the nodeHook to tabindex
-	jQuery.attrHooks.tabindex.set = nodeHook.set;
-
-	// Set width and height to auto instead of 0 on empty string( Bug #8150 )
-	// This is for removals
-	jQuery.each([ "width", "height" ], function( i, name ) {
-		jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
-			set: function( elem, value ) {
-				if ( value === "" ) {
-					elem.setAttribute( name, "auto" );
-					return value;
-				}
-			}
-		});
-	});
-
-	// Set contenteditable to false on removals(#10429)
-	// Setting to empty string throws an error as an invalid value
-	jQuery.attrHooks.contenteditable = {
-		get: nodeHook.get,
-		set: function( elem, value, name ) {
-			if ( value === "" ) {
-				value = "false";
-			}
-			nodeHook.set( elem, value, name );
-		}
-	};
+    fixSpecified = {
+        name: true,
+        id: true
+    };
+
+    // Use this for any attribute in IE6/7
+    // This fixes almost every IE6/7 issue
+    nodeHook = jQuery.valHooks.button = {
+        get: function( elem, name ) {
+            var ret;
+            ret = elem.getAttributeNode( name );
+            return ret && ( fixSpecified[ name ] ? ret.nodeValue !== "" : ret.specified ) ?
+                ret.nodeValue :
+                undefined;
+        },
+        set: function( elem, value, name ) {
+            // Set the existing or create a new attribute node
+            var ret = elem.getAttributeNode( name );
+            if ( !ret ) {
+                ret = document.createAttribute( name );
+                elem.setAttributeNode( ret );
+            }
+            return ( ret.nodeValue = value + "" );
+        }
+    };
+
+    // Apply the nodeHook to tabindex
+    jQuery.attrHooks.tabindex.set = nodeHook.set;
+
+    // Set width and height to auto instead of 0 on empty string( Bug #8150 )
+    // This is for removals
+    jQuery.each([ "width", "height" ], function( i, name ) {
+        jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
+            set: function( elem, value ) {
+                if ( value === "" ) {
+                    elem.setAttribute( name, "auto" );
+                    return value;
+                }
+            }
+        });
+    });
+
+    // Set contenteditable to false on removals(#10429)
+    // Setting to empty string throws an error as an invalid value
+    jQuery.attrHooks.contenteditable = {
+        get: nodeHook.get,
+        set: function( elem, value, name ) {
+            if ( value === "" ) {
+                value = "false";
+            }
+            nodeHook.set( elem, value, name );
+        }
+    };
 }
 
 
 // Some attributes require a special call on IE
 if ( !jQuery.support.hrefNormalized ) {
-	jQuery.each([ "href", "src", "width", "height" ], function( i, name ) {
-		jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
-			get: function( elem ) {
-				var ret = elem.getAttribute( name, 2 );
-				return ret === null ? undefined : ret;
-			}
-		});
-	});
+    jQuery.each([ "href", "src", "width", "height" ], function( i, name ) {
+        jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
+            get: function( elem ) {
+                var ret = elem.getAttribute( name, 2 );
+                return ret === null ? undefined : ret;
+            }
+        });
+    });
 }
 
 if ( !jQuery.support.style ) {
-	jQuery.attrHooks.style = {
-		get: function( elem ) {
-			// Return undefined in the case of empty string
-			// Normalize to lowercase since IE uppercases css property names
-			return elem.style.cssText.toLowerCase() || undefined;
-		},
-		set: function( elem, value ) {
-			return ( elem.style.cssText = "" + value );
-		}
-	};
+    jQuery.attrHooks.style = {
+        get: function( elem ) {
+            // Return undefined in the case of empty string
+            // Normalize to lowercase since IE uppercases css property names
+            return elem.style.cssText.toLowerCase() || undefined;
+        },
+        set: function( elem, value ) {
+            return ( elem.style.cssText = "" + value );
+        }
+    };
 }
 
 // Safari mis-reports the default selected property of an option
 // Accessing the parent's selectedIndex property fixes it
 if ( !jQuery.support.optSelected ) {
-	jQuery.propHooks.selected = jQuery.extend( jQuery.propHooks.selected, {
-		get: function( elem ) {
-			var parent = elem.parentNode;
-
-			if ( parent ) {
-				parent.selectedIndex;
-
-				// Make sure that it also works with optgroups, see #5701
-				if ( parent.parentNode ) {
-					parent.parentNode.selectedIndex;
-				}
-			}
-			return null;
-		}
-	});
+    jQuery.propHooks.selected = jQuery.extend( jQuery.propHooks.selected, {
+        get: function( elem ) {
+            var parent = elem.parentNode;
+
+            if ( parent ) {
+                parent.selectedIndex;
+
+                // Make sure that it also works with optgroups, see #5701
+                if ( parent.parentNode ) {
+                    parent.parentNode.selectedIndex;
+                }
+            }
+            return null;
+        }
+    });
 }
 
 // IE6/7 call enctype encoding
 if ( !jQuery.support.enctype ) {
-	jQuery.propFix.enctype = "encoding";
+    jQuery.propFix.enctype = "encoding";
 }
 
 // Radios and checkboxes getter/setter
 if ( !jQuery.support.checkOn ) {
-	jQuery.each([ "radio", "checkbox" ], function() {
-		jQuery.valHooks[ this ] = {
-			get: function( elem ) {
-				// Handle the case where in Webkit "" is returned instead of "on" if a value isn't specified
-				return elem.getAttribute("value") === null ? "on" : elem.value;
-			}
-		};
-	});
+    jQuery.each([ "radio", "checkbox" ], function() {
+        jQuery.valHooks[ this ] = {
+            get: function( elem ) {
+                // Handle the case where in Webkit "" is returned instead of "on" if a value isn't specified
+                return elem.getAttribute("value") === null ? "on" : elem.value;
+            }
+        };
+    });
 }
 jQuery.each([ "radio", "checkbox" ], function() {
-	jQuery.valHooks[ this ] = jQuery.extend( jQuery.valHooks[ this ], {
-		set: function( elem, value ) {
-			if ( jQuery.isArray( value ) ) {
-				return ( elem.checked = jQuery.inArray( jQuery(elem).val(), value ) >= 0 );
-			}
-		}
-	});
+    jQuery.valHooks[ this ] = jQuery.extend( jQuery.valHooks[ this ], {
+        set: function( elem, value ) {
+            if ( jQuery.isArray( value ) ) {
+                return ( elem.checked = jQuery.inArray( jQuery(elem).val(), value ) >= 0 );
+            }
+        }
+    });
 });
 
 
 
 
 var rformElems = /^(?:textarea|input|select)$/i,
-	rtypenamespace = /^([^\.]*)?(?:\.(.+))?$/,
-	rhoverHack = /\bhover(\.\S+)?\b/,
-	rkeyEvent = /^key/,
-	rmouseEvent = /^(?:mouse|contextmenu)|click/,
-	rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
-	rquickIs = /^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,
-	quickParse = function( selector ) {
-		var quick = rquickIs.exec( selector );
-		if ( quick ) {
-			//   0  1    2   3
-			// [ _, tag, id, class ]
-			quick[1] = ( quick[1] || "" ).toLowerCase();
-			quick[3] = quick[3] && new RegExp( "(?:^|\\s)" + quick[3] + "(?:\\s|$)" );
-		}
-		return quick;
-	},
-	quickIs = function( elem, m ) {
-		var attrs = elem.attributes || {};
-		return (
-			(!m[1] || elem.nodeName.toLowerCase() === m[1]) &&
-			(!m[2] || (attrs.id || {}).value === m[2]) &&
-			(!m[3] || m[3].test( (attrs[ "class" ] || {}).value ))
-		);
-	},
-	hoverHack = function( events ) {
-		return jQuery.event.special.hover ? events : events.replace( rhoverHack, "mouseenter$1 mouseleave$1" );
-	};
+    rtypenamespace = /^([^\.]*)?(?:\.(.+))?$/,
+    rhoverHack = /\bhover(\.\S+)?\b/,
+    rkeyEvent = /^key/,
+    rmouseEvent = /^(?:mouse|contextmenu)|click/,
+    rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
+    rquickIs = /^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,
+    quickParse = function( selector ) {
+        var quick = rquickIs.exec( selector );
+        if ( quick ) {
+            //   0  1    2   3
+            // [ _, tag, id, class ]
+            quick[1] = ( quick[1] || "" ).toLowerCase();
+            quick[3] = quick[3] && new RegExp( "(?:^|\\s)" + quick[3] + "(?:\\s|$)" );
+        }
+        return quick;
+    },
+    quickIs = function( elem, m ) {
+        var attrs = elem.attributes || {};
+        return (
+            (!m[1] || elem.nodeName.toLowerCase() === m[1]) &&
+            (!m[2] || (attrs.id || {}).value === m[2]) &&
+            (!m[3] || m[3].test( (attrs[ "class" ] || {}).value ))
+        );
+    },
+    hoverHack = function( events ) {
+        return jQuery.event.special.hover ? events : events.replace( rhoverHack, "mouseenter$1 mouseleave$1" );
+    };
 
 /*
  * Helper functions for managing events -- not part of the public interface.
@@ -2839,578 +2839,578 @@ var rformElems = /^(?:textarea|input|select)$/i,
  */
 jQuery.event = {
 
-	add: function( elem, types, handler, data, selector ) {
-
-		var elemData, eventHandle, events,
-			t, tns, type, namespaces, handleObj,
-			handleObjIn, quick, handlers, special;
-
-		// Don't attach events to noData or text/comment nodes (allow plain objects tho)
-		if ( elem.nodeType === 3 || elem.nodeType === 8 || !types || !handler || !(elemData = jQuery._data( elem )) ) {
-			return;
-		}
-
-		// Caller can pass in an object of custom data in lieu of the handler
-		if ( handler.handler ) {
-			handleObjIn = handler;
-			handler = handleObjIn.handler;
-		}
-
-		// Make sure that the handler has a unique ID, used to find/remove it later
-		if ( !handler.guid ) {
-			handler.guid = jQuery.guid++;
-		}
-
-		// Init the element's event structure and main handler, if this is the first
-		events = elemData.events;
-		if ( !events ) {
-			elemData.events = events = {};
-		}
-		eventHandle = elemData.handle;
-		if ( !eventHandle ) {
-			elemData.handle = eventHandle = function( e ) {
-				// Discard the second event of a jQuery.event.trigger() and
-				// when an event is called after a page has unloaded
-				return typeof jQuery !== "undefined" && (!e || jQuery.event.triggered !== e.type) ?
-					jQuery.event.dispatch.apply( eventHandle.elem, arguments ) :
-					undefined;
-			};
-			// Add elem as a property of the handle fn to prevent a memory leak with IE non-native events
-			eventHandle.elem = elem;
-		}
-
-		// Handle multiple events separated by a space
-		// jQuery(...).bind("mouseover mouseout", fn);
-		types = jQuery.trim( hoverHack(types) ).split( " " );
-		for ( t = 0; t < types.length; t++ ) {
-
-			tns = rtypenamespace.exec( types[t] ) || [];
-			type = tns[1];
-			namespaces = ( tns[2] || "" ).split( "." ).sort();
-
-			// If event changes its type, use the special event handlers for the changed type
-			special = jQuery.event.special[ type ] || {};
-
-			// If selector defined, determine special event api type, otherwise given type
-			type = ( selector ? special.delegateType : special.bindType ) || type;
-
-			// Update special based on newly reset type
-			special = jQuery.event.special[ type ] || {};
-
-			// handleObj is passed to all event handlers
-			handleObj = jQuery.extend({
-				type: type,
-				origType: tns[1],
-				data: data,
-				handler: handler,
-				guid: handler.guid,
-				selector: selector,
-				quick: quickParse( selector ),
-				namespace: namespaces.join(".")
-			}, handleObjIn );
-
-			// Init the event handler queue if we're the first
-			handlers = events[ type ];
-			if ( !handlers ) {
-				handlers = events[ type ] = [];
-				handlers.delegateCount = 0;
-
-				// Only use addEventListener/attachEvent if the special events handler returns false
-				if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
-					// Bind the global event handler to the element
-					if ( elem.addEventListener ) {
-						elem.addEventListener( type, eventHandle, false );
-
-					} else if ( elem.attachEvent ) {
-						elem.attachEvent( "on" + type, eventHandle );
-					}
-				}
-			}
-
-			if ( special.add ) {
-				special.add.call( elem, handleObj );
-
-				if ( !handleObj.handler.guid ) {
-					handleObj.handler.guid = handler.guid;
-				}
-			}
-
-			// Add to the element's handler list, delegates in front
-			if ( selector ) {
-				handlers.splice( handlers.delegateCount++, 0, handleObj );
-			} else {
-				handlers.push( handleObj );
-			}
-
-			// Keep track of which events have ever been used, for event optimization
-			jQuery.event.global[ type ] = true;
-		}
-
-		// Nullify elem to prevent memory leaks in IE
-		elem = null;
-	},
-
-	global: {},
-
-	// Detach an event or set of events from an element
-	remove: function( elem, types, handler, selector, mappedTypes ) {
-
-		var elemData = jQuery.hasData( elem ) && jQuery._data( elem ),
-			t, tns, type, origType, namespaces, origCount,
-			j, events, special, handle, eventType, handleObj;
-
-		if ( !elemData || !(events = elemData.events) ) {
-			return;
-		}
-
-		// Once for each type.namespace in types; type may be omitted
-		types = jQuery.trim( hoverHack( types || "" ) ).split(" ");
-		for ( t = 0; t < types.length; t++ ) {
-			tns = rtypenamespace.exec( types[t] ) || [];
-			type = origType = tns[1];
-			namespaces = tns[2];
-
-			// Unbind all events (on this namespace, if provided) for the element
-			if ( !type ) {
-				for ( type in events ) {
-					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
-				}
-				continue;
-			}
-
-			special = jQuery.event.special[ type ] || {};
-			type = ( selector? special.delegateType : special.bindType ) || type;
-			eventType = events[ type ] || [];
-			origCount = eventType.length;
-			namespaces = namespaces ? new RegExp("(^|\\.)" + namespaces.split(".").sort().join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
-
-			// Remove matching events
-			for ( j = 0; j < eventType.length; j++ ) {
-				handleObj = eventType[ j ];
-
-				if ( ( mappedTypes || origType === handleObj.origType ) &&
-					 ( !handler || handler.guid === handleObj.guid ) &&
-					 ( !namespaces || namespaces.test( handleObj.namespace ) ) &&
-					 ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) {
-					eventType.splice( j--, 1 );
-
-					if ( handleObj.selector ) {
-						eventType.delegateCount--;
-					}
-					if ( special.remove ) {
-						special.remove.call( elem, handleObj );
-					}
-				}
-			}
-
-			// Remove generic event handler if we removed something and no more handlers exist
-			// (avoids potential for endless recursion during removal of special event handlers)
-			if ( eventType.length === 0 && origCount !== eventType.length ) {
-				if ( !special.teardown || special.teardown.call( elem, namespaces ) === false ) {
-					jQuery.removeEvent( elem, type, elemData.handle );
-				}
-
-				delete events[ type ];
-			}
-		}
-
-		// Remove the expando if it's no longer used
-		if ( jQuery.isEmptyObject( events ) ) {
-			handle = elemData.handle;
-			if ( handle ) {
-				handle.elem = null;
-			}
-
-			// removeData also checks for emptiness and clears the expando if empty
-			// so use it instead of delete
-			jQuery.removeData( elem, [ "events", "handle" ], true );
-		}
-	},
-
-	// Events that are safe to short-circuit if no handlers are attached.
-	// Native DOM events should not be added, they may have inline handlers.
-	customEvent: {
-		"getData": true,
-		"setData": true,
-		"changeData": true
-	},
-
-	trigger: function( event, data, elem, onlyHandlers ) {
-		// Don't do events on text and comment nodes
-		if ( elem && (elem.nodeType === 3 || elem.nodeType === 8) ) {
-			return;
-		}
-
-		// Event object or event type
-		var type = event.type || event,
-			namespaces = [],
-			cache, exclusive, i, cur, old, ontype, special, handle, eventPath, bubbleType;
-
-		// focus/blur morphs to focusin/out; ensure we're not firing them right now
-		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
-			return;
-		}
-
-		if ( type.indexOf( "!" ) >= 0 ) {
-			// Exclusive events trigger only for the exact event (no namespaces)
-			type = type.slice(0, -1);
-			exclusive = true;
-		}
-
-		if ( type.indexOf( "." ) >= 0 ) {
-			// Namespaced trigger; create a regexp to match event type in handle()
-			namespaces = type.split(".");
-			type = namespaces.shift();
-			namespaces.sort();
-		}
-
-		if ( (!elem || jQuery.event.customEvent[ type ]) && !jQuery.event.global[ type ] ) {
-			// No jQuery handlers for this event type, and it can't have inline handlers
-			return;
-		}
-
-		// Caller can pass in an Event, Object, or just an event type string
-		event = typeof event === "object" ?
-			// jQuery.Event object
-			event[ jQuery.expando ] ? event :
-			// Object literal
-			new jQuery.Event( type, event ) :
-			// Just the event type (string)
-			new jQuery.Event( type );
-
-		event.type = type;
-		event.isTrigger = true;
-		event.exclusive = exclusive;
-		event.namespace = namespaces.join( "." );
-		event.namespace_re = event.namespace? new RegExp("(^|\\.)" + namespaces.join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
-		ontype = type.indexOf( ":" ) < 0 ? "on" + type : "";
-
-		// Handle a global trigger
-		if ( !elem ) {
-
-			// TODO: Stop taunting the data cache; remove global events and always attach to document
-			cache = jQuery.cache;
-			for ( i in cache ) {
-				if ( cache[ i ].events && cache[ i ].events[ type ] ) {
-					jQuery.event.trigger( event, data, cache[ i ].handle.elem, true );
-				}
-			}
-			return;
-		}
-
-		// Clean up the event in case it is being reused
-		event.result = undefined;
-		if ( !event.target ) {
-			event.target = elem;
-		}
-
-		// Clone any incoming data and prepend the event, creating the handler arg list
-		data = data != null ? jQuery.makeArray( data ) : [];
-		data.unshift( event );
-
-		// Allow special events to draw outside the lines
-		special = jQuery.event.special[ type ] || {};
-		if ( special.trigger && special.trigger.apply( elem, data ) === false ) {
-			return;
-		}
-
-		// Determine event propagation path in advance, per W3C events spec (#9951)
-		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
-		eventPath = [[ elem, special.bindType || type ]];
-		if ( !onlyHandlers && !special.noBubble && !jQuery.isWindow( elem ) ) {
-
-			bubbleType = special.delegateType || type;
-			cur = rfocusMorph.test( bubbleType + type ) ? elem : elem.parentNode;
-			old = null;
-			for ( ; cur; cur = cur.parentNode ) {
-				eventPath.push([ cur, bubbleType ]);
-				old = cur;
-			}
-
-			// Only add window if we got to document (e.g., not plain obj or detached DOM)
-			if ( old && old === elem.ownerDocument ) {
-				eventPath.push([ old.defaultView || old.parentWindow || window, bubbleType ]);
-			}
-		}
-
-		// Fire handlers on the event path
-		for ( i = 0; i < eventPath.length && !event.isPropagationStopped(); i++ ) {
-
-			cur = eventPath[i][0];
-			event.type = eventPath[i][1];
-
-			handle = ( jQuery._data( cur, "events" ) || {} )[ event.type ] && jQuery._data( cur, "handle" );
-			if ( handle ) {
-				handle.apply( cur, data );
-			}
-			// Note that this is a bare JS function and not a jQuery handler
-			handle = ontype && cur[ ontype ];
-			if ( handle && jQuery.acceptData( cur ) && handle.apply( cur, data ) === false ) {
-				event.preventDefault();
-			}
-		}
-		event.type = type;
-
-		// If nobody prevented the default action, do it now
-		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
-
-			if ( (!special._default || special._default.apply( elem.ownerDocument, data ) === false) &&
-				!(type === "click" && jQuery.nodeName( elem, "a" )) && jQuery.acceptData( elem ) ) {
-
-				// Call a native DOM method on the target with the same name name as the event.
-				// Can't use an .isFunction() check here because IE6/7 fails that test.
-				// Don't do default actions on window, that's where global variables be (#6170)
-				// IE<9 dies on focus/blur to hidden element (#1486)
-				if ( ontype && elem[ type ] && ((type !== "focus" && type !== "blur") || event.target.offsetWidth !== 0) && !jQuery.isWindow( elem ) ) {
-
-					// Don't re-trigger an onFOO event when we call its FOO() method
-					old = elem[ ontype ];
-
-					if ( old ) {
-						elem[ ontype ] = null;
-					}
-
-					// Prevent re-triggering of the same event, since we already bubbled it above
-					jQuery.event.triggered = type;
-					elem[ type ]();
-					jQuery.event.triggered = undefined;
-
-					if ( old ) {
-						elem[ ontype ] = old;
-					}
-				}
-			}
-		}
-
-		return event.result;
-	},
-
-	dispatch: function( event ) {
-
-		// Make a writable jQuery.Event from the native event object
-		event = jQuery.event.fix( event || window.event );
-
-		var handlers = ( (jQuery._data( this, "events" ) || {} )[ event.type ] || []),
-			delegateCount = handlers.delegateCount,
-			args = [].slice.call( arguments, 0 ),
-			run_all = !event.exclusive && !event.namespace,
-			handlerQueue = [],
-			i, j, cur, jqcur, ret, selMatch, matched, matches, handleObj, sel, related;
-
-		// Use the fix-ed jQuery.Event rather than the (read-only) native event
-		args[0] = event;
-		event.delegateTarget = this;
-
-		// Determine handlers that should run if there are delegated events
-		// Avoid disabled elements in IE (#6911) and non-left-click bubbling in Firefox (#3861)
-		if ( delegateCount && !event.target.disabled && !(event.button && event.type === "click") ) {
-
-			// Pregenerate a single jQuery object for reuse with .is()
-			jqcur = jQuery(this);
-			jqcur.context = this.ownerDocument || this;
-
-			for ( cur = event.target; cur != this; cur = cur.parentNode || this ) {
-				selMatch = {};
-				matches = [];
-				jqcur[0] = cur;
-				for ( i = 0; i < delegateCount; i++ ) {
-					handleObj = handlers[ i ];
-					sel = handleObj.selector;
-
-					if ( selMatch[ sel ] === undefined ) {
-						selMatch[ sel ] = (
-							handleObj.quick ? quickIs( cur, handleObj.quick ) : jqcur.is( sel )
-						);
-					}
-					if ( selMatch[ sel ] ) {
-						matches.push( handleObj );
-					}
-				}
-				if ( matches.length ) {
-					handlerQueue.push({ elem: cur, matches: matches });
-				}
-			}
-		}
-
-		// Add the remaining (directly-bound) handlers
-		if ( handlers.length > delegateCount ) {
-			handlerQueue.push({ elem: this, matches: handlers.slice( delegateCount ) });
-		}
-
-		// Run delegates first; they may want to stop propagation beneath us
-		for ( i = 0; i < handlerQueue.length && !event.isPropagationStopped(); i++ ) {
-			matched = handlerQueue[ i ];
-			event.currentTarget = matched.elem;
-
-			for ( j = 0; j < matched.matches.length && !event.isImmediatePropagationStopped(); j++ ) {
-				handleObj = matched.matches[ j ];
-
-				// Triggered event must either 1) be non-exclusive and have no namespace, or
-				// 2) have namespace(s) a subset or equal to those in the bound event (both can have no namespace).
-				if ( run_all || (!event.namespace && !handleObj.namespace) || event.namespace_re && event.namespace_re.test( handleObj.namespace ) ) {
-
-					event.data = handleObj.data;
-					event.handleObj = handleObj;
-
-					ret = ( (jQuery.event.special[ handleObj.origType ] || {}).handle || handleObj.handler )
-							.apply( matched.elem, args );
-
-					if ( ret !== undefined ) {
-						event.result = ret;
-						if ( ret === false ) {
-							event.preventDefault();
-							event.stopPropagation();
-						}
-					}
-				}
-			}
-		}
-
-		return event.result;
-	},
-
-	// Includes some event props shared by KeyEvent and MouseEvent
-	// *** attrChange attrName relatedNode srcElement  are not normalized, non-W3C, deprecated, will be removed in 1.8 ***
-	props: "attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),
-
-	fixHooks: {},
-
-	keyHooks: {
-		props: "char charCode key keyCode".split(" "),
-		filter: function( event, original ) {
-
-			// Add which for key events
-			if ( event.which == null ) {
-				event.which = original.charCode != null ? original.charCode : original.keyCode;
-			}
-
-			return event;
-		}
-	},
-
-	mouseHooks: {
-		props: "button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "),
-		filter: function( event, original ) {
-			var eventDoc, doc, body,
-				button = original.button,
-				fromElement = original.fromElement;
-
-			// Calculate pageX/Y if missing and clientX/Y available
-			if ( event.pageX == null && original.clientX != null ) {
-				eventDoc = event.target.ownerDocument || document;
-				doc = eventDoc.documentElement;
-				body = eventDoc.body;
-
-				event.pageX = original.clientX + ( doc && doc.scrollLeft || body && body.scrollLeft || 0 ) - ( doc && doc.clientLeft || body && body.clientLeft || 0 );
-				event.pageY = original.clientY + ( doc && doc.scrollTop  || body && body.scrollTop  || 0 ) - ( doc && doc.clientTop  || body && body.clientTop  || 0 );
-			}
-
-			// Add relatedTarget, if necessary
-			if ( !event.relatedTarget && fromElement ) {
-				event.relatedTarget = fromElement === event.target ? original.toElement : fromElement;
-			}
-
-			// Add which for click: 1 === left; 2 === middle; 3 === right
-			// Note: button is not normalized, so don't use it
-			if ( !event.which && button !== undefined ) {
-				event.which = ( button & 1 ? 1 : ( button & 2 ? 3 : ( button & 4 ? 2 : 0 ) ) );
-			}
-
-			return event;
-		}
-	},
-
-	fix: function( event ) {
-		if ( event[ jQuery.expando ] ) {
-			return event;
-		}
-
-		// Create a writable copy of the event object and normalize some properties
-		var i, prop,
-			originalEvent = event,
-			fixHook = jQuery.event.fixHooks[ event.type ] || {},
-			copy = fixHook.props ? this.props.concat( fixHook.props ) : this.props;
-
-		event = jQuery.Event( originalEvent );
-
-		for ( i = copy.length; i; ) {
-			prop = copy[ --i ];
-			event[ prop ] = originalEvent[ prop ];
-		}
-
-		// Fix target property, if necessary (#1925, IE 6/7/8 & Safari2)
-		if ( !event.target ) {
-			event.target = originalEvent.srcElement || document;
-		}
-
-		// Target should not be a text node (#504, Safari)
-		if ( event.target.nodeType === 3 ) {
-			event.target = event.target.parentNode;
-		}
-
-		// For mouse/key events; add metaKey if it's not there (#3368, IE6/7/8)
-		if ( event.metaKey === undefined ) {
-			event.metaKey = event.ctrlKey;
-		}
-
-		return fixHook.filter? fixHook.filter( event, originalEvent ) : event;
-	},
-
-	special: {
-		ready: {
-			// Make sure the ready event is setup
-			setup: jQuery.bindReady
-		},
-
-		load: {
-			// Prevent triggered image.load events from bubbling to window.load
-			noBubble: true
-		},
-
-		focus: {
-			delegateType: "focusin"
-		},
-		blur: {
-			delegateType: "focusout"
-		},
-
-		beforeunload: {
-			setup: function( data, namespaces, eventHandle ) {
-				// We only want to do this special case on windows
-				if ( jQuery.isWindow( this ) ) {
-					this.onbeforeunload = eventHandle;
-				}
-			},
-
-			teardown: function( namespaces, eventHandle ) {
-				if ( this.onbeforeunload === eventHandle ) {
-					this.onbeforeunload = null;
-				}
-			}
-		}
-	},
-
-	simulate: function( type, elem, event, bubble ) {
-		// Piggyback on a donor event to simulate a different one.
-		// Fake originalEvent to avoid donor's stopPropagation, but if the
-		// simulated event prevents default then we do the same on the donor.
-		var e = jQuery.extend(
-			new jQuery.Event(),
-			event,
-			{ type: type,
-				isSimulated: true,
-				originalEvent: {}
-			}
-		);
-		if ( bubble ) {
-			jQuery.event.trigger( e, null, elem );
-		} else {
-			jQuery.event.dispatch.call( elem, e );
-		}
-		if ( e.isDefaultPrevented() ) {
-			event.preventDefault();
-		}
-	}
+    add: function( elem, types, handler, data, selector ) {
+
+        var elemData, eventHandle, events,
+            t, tns, type, namespaces, handleObj,
+            handleObjIn, quick, handlers, special;
+
+        // Don't attach events to noData or text/comment nodes (allow plain objects tho)
+        if ( elem.nodeType === 3 || elem.nodeType === 8 || !types || !handler || !(elemData = jQuery._data( elem )) ) {
+            return;
+        }
+
+        // Caller can pass in an object of custom data in lieu of the handler
+        if ( handler.handler ) {
+            handleObjIn = handler;
+            handler = handleObjIn.handler;
+        }
+
+        // Make sure that the handler has a unique ID, used to find/remove it later
+        if ( !handler.guid ) {
+            handler.guid = jQuery.guid++;
+        }
+
+        // Init the element's event structure and main handler, if this is the first
+        events = elemData.events;
+        if ( !events ) {
+            elemData.events = events = {};
+        }
+        eventHandle = elemData.handle;
+        if ( !eventHandle ) {
+            elemData.handle = eventHandle = function( e ) {
+                // Discard the second event of a jQuery.event.trigger() and
+                // when an event is called after a page has unloaded
+                return typeof jQuery !== "undefined" && (!e || jQuery.event.triggered !== e.type) ?
+                    jQuery.event.dispatch.apply( eventHandle.elem, arguments ) :
+                    undefined;
+            };
+            // Add elem as a property of the handle fn to prevent a memory leak with IE non-native events
+            eventHandle.elem = elem;
+        }
+
+        // Handle multiple events separated by a space
+        // jQuery(...).bind("mouseover mouseout", fn);
+        types = jQuery.trim( hoverHack(types) ).split( " " );
+        for ( t = 0; t < types.length; t++ ) {
+
+            tns = rtypenamespace.exec( types[t] ) || [];
+            type = tns[1];
+            namespaces = ( tns[2] || "" ).split( "." ).sort();
+
+            // If event changes its type, use the special event handlers for the changed type
+            special = jQuery.event.special[ type ] || {};
+
+            // If selector defined, determine special event api type, otherwise given type
+            type = ( selector ? special.delegateType : special.bindType ) || type;
+
+            // Update special based on newly reset type
+            special = jQuery.event.special[ type ] || {};
+
+            // handleObj is passed to all event handlers
+            handleObj = jQuery.extend({
+                type: type,
+                origType: tns[1],
+                data: data,
+                handler: handler,
+                guid: handler.guid,
+                selector: selector,
+                quick: quickParse( selector ),
+                namespace: namespaces.join(".")
+            }, handleObjIn );
+
+            // Init the event handler queue if we're the first
+            handlers = events[ type ];
+            if ( !handlers ) {
+                handlers = events[ type ] = [];
+                handlers.delegateCount = 0;
+
+                // Only use addEventListener/attachEvent if the special events handler returns false
+                if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
+                    // Bind the global event handler to the element
+                    if ( elem.addEventListener ) {
+                        elem.addEventListener( type, eventHandle, false );
+
+                    } else if ( elem.attachEvent ) {
+                        elem.attachEvent( "on" + type, eventHandle );
+                    }
+                }
+            }
+
+            if ( special.add ) {
+                special.add.call( elem, handleObj );
+
+                if ( !handleObj.handler.guid ) {
+                    handleObj.handler.guid = handler.guid;
+                }
+            }
+
+            // Add to the element's handler list, delegates in front
+            if ( selector ) {
+                handlers.splice( handlers.delegateCount++, 0, handleObj );
+            } else {
+                handlers.push( handleObj );
+            }
+
+            // Keep track of which events have ever been used, for event optimization
+            jQuery.event.global[ type ] = true;
+        }
+
+        // Nullify elem to prevent memory leaks in IE
+        elem = null;
+    },
+
+    global: {},
+
+    // Detach an event or set of events from an element
+    remove: function( elem, types, handler, selector, mappedTypes ) {
+
+        var elemData = jQuery.hasData( elem ) && jQuery._data( elem ),
+            t, tns, type, origType, namespaces, origCount,
+            j, events, special, handle, eventType, handleObj;
+
+        if ( !elemData || !(events = elemData.events) ) {
+            return;
+        }
+
+        // Once for each type.namespace in types; type may be omitted
+        types = jQuery.trim( hoverHack( types || "" ) ).split(" ");
+        for ( t = 0; t < types.length; t++ ) {
+            tns = rtypenamespace.exec( types[t] ) || [];
+            type = origType = tns[1];
+            namespaces = tns[2];
+
+            // Unbind all events (on this namespace, if provided) for the element
+            if ( !type ) {
+                for ( type in events ) {
+                    jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
+                }
+                continue;
+            }
+
+            special = jQuery.event.special[ type ] || {};
+            type = ( selector? special.delegateType : special.bindType ) || type;
+            eventType = events[ type ] || [];
+            origCount = eventType.length;
+            namespaces = namespaces ? new RegExp("(^|\\.)" + namespaces.split(".").sort().join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
+
+            // Remove matching events
+            for ( j = 0; j < eventType.length; j++ ) {
+                handleObj = eventType[ j ];
+
+                if ( ( mappedTypes || origType === handleObj.origType ) &&
+                     ( !handler || handler.guid === handleObj.guid ) &&
+                     ( !namespaces || namespaces.test( handleObj.namespace ) ) &&
+                     ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) {
+                    eventType.splice( j--, 1 );
+
+                    if ( handleObj.selector ) {
+                        eventType.delegateCount--;
+                    }
+                    if ( special.remove ) {
+                        special.remove.call( elem, handleObj );
+                    }
+                }
+            }
+
+            // Remove generic event handler if we removed something and no more handlers exist
+            // (avoids potential for endless recursion during removal of special event handlers)
+            if ( eventType.length === 0 && origCount !== eventType.length ) {
+                if ( !special.teardown || special.teardown.call( elem, namespaces ) === false ) {
+                    jQuery.removeEvent( elem, type, elemData.handle );
+                }
+
+                delete events[ type ];
+            }
+        }
+
+        // Remove the expando if it's no longer used
+        if ( jQuery.isEmptyObject( events ) ) {
+            handle = elemData.handle;
+            if ( handle ) {
+                handle.elem = null;
+            }
+
+            // removeData also checks for emptiness and clears the expando if empty
+            // so use it instead of delete
+            jQuery.removeData( elem, [ "events", "handle" ], true );
+        }
+    },
+
+    // Events that are safe to short-circuit if no handlers are attached.
+    // Native DOM events should not be added, they may have inline handlers.
+    customEvent: {
+        "getData": true,
+        "setData": true,
+        "changeData": true
+    },
+
+    trigger: function( event, data, elem, onlyHandlers ) {
+        // Don't do events on text and comment nodes
+        if ( elem && (elem.nodeType === 3 || elem.nodeType === 8) ) {
+            return;
+        }
+
+        // Event object or event type
+        var type = event.type || event,
+            namespaces = [],
+            cache, exclusive, i, cur, old, ontype, special, handle, eventPath, bubbleType;
+
+        // focus/blur morphs to focusin/out; ensure we're not firing them right now
+        if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
+            return;
+        }
+
+        if ( type.indexOf( "!" ) >= 0 ) {
+            // Exclusive events trigger only for the exact event (no namespaces)
+            type = type.slice(0, -1);
+            exclusive = true;
+        }
+
+        if ( type.indexOf( "." ) >= 0 ) {
+            // Namespaced trigger; create a regexp to match event type in handle()
+            namespaces = type.split(".");
+            type = namespaces.shift();
+            namespaces.sort();
+        }
+
+        if ( (!elem || jQuery.event.customEvent[ type ]) && !jQuery.event.global[ type ] ) {
+            // No jQuery handlers for this event type, and it can't have inline handlers
+            return;
+        }
+
+        // Caller can pass in an Event, Object, or just an event type string
+        event = typeof event === "object" ?
+            // jQuery.Event object
+            event[ jQuery.expando ] ? event :
+            // Object literal
+            new jQuery.Event( type, event ) :
+            // Just the event type (string)
+            new jQuery.Event( type );
+
+        event.type = type;
+        event.isTrigger = true;
+        event.exclusive = exclusive;
+        event.namespace = namespaces.join( "." );
+        event.namespace_re = event.namespace? new RegExp("(^|\\.)" + namespaces.join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
+        ontype = type.indexOf( ":" ) < 0 ? "on" + type : "";
+
+        // Handle a global trigger
+        if ( !elem ) {
+
+            // TODO: Stop taunting the data cache; remove global events and always attach to document
+            cache = jQuery.cache;
+            for ( i in cache ) {
+                if ( cache[ i ].events && cache[ i ].events[ type ] ) {
+                    jQuery.event.trigger( event, data, cache[ i ].handle.elem, true );
+                }
+            }
+            return;
+        }
+
+        // Clean up the event in case it is being reused
+        event.result = undefined;
+        if ( !event.target ) {
+            event.target = elem;
+        }
+
+        // Clone any incoming data and prepend the event, creating the handler arg list
+        data = data != null ? jQuery.makeArray( data ) : [];
+        data.unshift( event );
+
+        // Allow special events to draw outside the lines
+        special = jQuery.event.special[ type ] || {};
+        if ( special.trigger && special.trigger.apply( elem, data ) === false ) {
+            return;
+        }
+
+        // Determine event propagation path in advance, per W3C events spec (#9951)
+        // Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
+        eventPath = [[ elem, special.bindType || type ]];
+        if ( !onlyHandlers && !special.noBubble && !jQuery.isWindow( elem ) ) {
+
+            bubbleType = special.delegateType || type;
+            cur = rfocusMorph.test( bubbleType + type ) ? elem : elem.parentNode;
+            old = null;
+            for ( ; cur; cur = cur.parentNode ) {
+                eventPath.push([ cur, bubbleType ]);
+                old = cur;
+            }
+
+            // Only add window if we got to document (e.g., not plain obj or detached DOM)
+            if ( old && old === elem.ownerDocument ) {
+                eventPath.push([ old.defaultView || old.parentWindow || window, bubbleType ]);
+            }
+        }
+
+        // Fire handlers on the event path
+        for ( i = 0; i < eventPath.length && !event.isPropagationStopped(); i++ ) {
+
+            cur = eventPath[i][0];
+            event.type = eventPath[i][1];
+
+            handle = ( jQuery._data( cur, "events" ) || {} )[ event.type ] && jQuery._data( cur, "handle" );
+            if ( handle ) {
+                handle.apply( cur, data );
+            }
+            // Note that this is a bare JS function and not a jQuery handler
+            handle = ontype && cur[ ontype ];
+            if ( handle && jQuery.acceptData( cur ) && handle.apply( cur, data ) === false ) {
+                event.preventDefault();
+            }
+        }
+        event.type = type;
+
+        // If nobody prevented the default action, do it now
+        if ( !onlyHandlers && !event.isDefaultPrevented() ) {
+
+            if ( (!special._default || special._default.apply( elem.ownerDocument, data ) === false) &&
+                !(type === "click" && jQuery.nodeName( elem, "a" )) && jQuery.acceptData( elem ) ) {
+
+                // Call a native DOM method on the target with the same name name as the event.
+                // Can't use an .isFunction() check here because IE6/7 fails that test.
+                // Don't do default actions on window, that's where global variables be (#6170)
+                // IE<9 dies on focus/blur to hidden element (#1486)
+                if ( ontype && elem[ type ] && ((type !== "focus" && type !== "blur") || event.target.offsetWidth !== 0) && !jQuery.isWindow( elem ) ) {
+
+                    // Don't re-trigger an onFOO event when we call its FOO() method
+                    old = elem[ ontype ];
+
+                    if ( old ) {
+                        elem[ ontype ] = null;
+                    }
+
+                    // Prevent re-triggering of the same event, since we already bubbled it above
+                    jQuery.event.triggered = type;
+                    elem[ type ]();
+                    jQuery.event.triggered = undefined;
+
+                    if ( old ) {
+                        elem[ ontype ] = old;
+                    }
+                }
+            }
+        }
+
+        return event.result;
+    },
+
+    dispatch: function( event ) {
+
+        // Make a writable jQuery.Event from the native event object
+        event = jQuery.event.fix( event || window.event );
+
+        var handlers = ( (jQuery._data( this, "events" ) || {} )[ event.type ] || []),
+            delegateCount = handlers.delegateCount,
+            args = [].slice.call( arguments, 0 ),
+            run_all = !event.exclusive && !event.namespace,
+            handlerQueue = [],
+            i, j, cur, jqcur, ret, selMatch, matched, matches, handleObj, sel, related;
+
+        // Use the fix-ed jQuery.Event rather than the (read-only) native event
+        args[0] = event;
+        event.delegateTarget = this;
+
+        // Determine handlers that should run if there are delegated events
+        // Avoid disabled elements in IE (#6911) and non-left-click bubbling in Firefox (#3861)
+        if ( delegateCount && !event.target.disabled && !(event.button && event.type === "click") ) {
+
+            // Pregenerate a single jQuery object for reuse with .is()
+            jqcur = jQuery(this);
+            jqcur.context = this.ownerDocument || this;
+
+            for ( cur = event.target; cur != this; cur = cur.parentNode || this ) {
+                selMatch = {};
+                matches = [];
+                jqcur[0] = cur;
+                for ( i = 0; i < delegateCount; i++ ) {
+                    handleObj = handlers[ i ];
+                    sel = handleObj.selector;
+
+                    if ( selMatch[ sel ] === undefined ) {
+                        selMatch[ sel ] = (
+                            handleObj.quick ? quickIs( cur, handleObj.quick ) : jqcur.is( sel )
+                        );
+                    }
+                    if ( selMatch[ sel ] ) {
+                        matches.push( handleObj );
+                    }
+                }
+                if ( matches.length ) {
+                    handlerQueue.push({ elem: cur, matches: matches });
+                }
+            }
+        }
+
+        // Add the remaining (directly-bound) handlers
+        if ( handlers.length > delegateCount ) {
+            handlerQueue.push({ elem: this, matches: handlers.slice( delegateCount ) });
+        }
+
+        // Run delegates first; they may want to stop propagation beneath us
+        for ( i = 0; i < handlerQueue.length && !event.isPropagationStopped(); i++ ) {
+            matched = handlerQueue[ i ];
+            event.currentTarget = matched.elem;
+
+            for ( j = 0; j < matched.matches.length && !event.isImmediatePropagationStopped(); j++ ) {
+                handleObj = matched.matches[ j ];
+
+                // Triggered event must either 1) be non-exclusive and have no namespace, or
+                // 2) have namespace(s) a subset or equal to those in the bound event (both can have no namespace).
+                if ( run_all || (!event.namespace && !handleObj.namespace) || event.namespace_re && event.namespace_re.test( handleObj.namespace ) ) {
+
+                    event.data = handleObj.data;
+                    event.handleObj = handleObj;
+
+                    ret = ( (jQuery.event.special[ handleObj.origType ] || {}).handle || handleObj.handler )
+                            .apply( matched.elem, args );
+
+                    if ( ret !== undefined ) {
+                        event.result = ret;
+                        if ( ret === false ) {
+                            event.preventDefault();
+                            event.stopPropagation();
+                        }
+                    }
+                }
+            }
+        }
+
+        return event.result;
+    },
+
+    // Includes some event props shared by KeyEvent and MouseEvent
+    // *** attrChange attrName relatedNode srcElement  are not normalized, non-W3C, deprecated, will be removed in 1.8 ***
+    props: "attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),
+
+    fixHooks: {},
+
+    keyHooks: {
+        props: "char charCode key keyCode".split(" "),
+        filter: function( event, original ) {
+
+            // Add which for key events
+            if ( event.which == null ) {
+                event.which = original.charCode != null ? original.charCode : original.keyCode;
+            }
+
+            return event;
+        }
+    },
+
+    mouseHooks: {
+        props: "button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "),
+        filter: function( event, original ) {
+            var eventDoc, doc, body,
+                button = original.button,
+                fromElement = original.fromElement;
+
+            // Calculate pageX/Y if missing and clientX/Y available
+            if ( event.pageX == null && original.clientX != null ) {
+                eventDoc = event.target.ownerDocument || document;
+                doc = eventDoc.documentElement;
+                body = eventDoc.body;
+
+                event.pageX = original.clientX + ( doc && doc.scrollLeft || body && body.scrollLeft || 0 ) - ( doc && doc.clientLeft || body && body.clientLeft || 0 );
+                event.pageY = original.clientY + ( doc && doc.scrollTop  || body && body.scrollTop  || 0 ) - ( doc && doc.clientTop  || body && body.clientTop  || 0 );
+            }
+
+            // Add relatedTarget, if necessary
+            if ( !event.relatedTarget && fromElement ) {
+                event.relatedTarget = fromElement === event.target ? original.toElement : fromElement;
+            }
+
+            // Add which for click: 1 === left; 2 === middle; 3 === right
+            // Note: button is not normalized, so don't use it
+            if ( !event.which && button !== undefined ) {
+                event.which = ( button & 1 ? 1 : ( button & 2 ? 3 : ( button & 4 ? 2 : 0 ) ) );
+            }
+
+            return event;
+        }
+    },
+
+    fix: function( event ) {
+        if ( event[ jQuery.expando ] ) {
+            return event;
+        }
+
+        // Create a writable copy of the event object and normalize some properties
+        var i, prop,
+            originalEvent = event,
+            fixHook = jQuery.event.fixHooks[ event.type ] || {},
+            copy = fixHook.props ? this.props.concat( fixHook.props ) : this.props;
+
+        event = jQuery.Event( originalEvent );
+
+        for ( i = copy.length; i; ) {
+            prop = copy[ --i ];
+            event[ prop ] = originalEvent[ prop ];
+        }
+
+        // Fix target property, if necessary (#1925, IE 6/7/8 & Safari2)
+        if ( !event.target ) {
+            event.target = originalEvent.srcElement || document;
+        }
+
+        // Target should not be a text node (#504, Safari)
+        if ( event.target.nodeType === 3 ) {
+            event.target = event.target.parentNode;
+        }
+
+        // For mouse/key events; add metaKey if it's not there (#3368, IE6/7/8)
+        if ( event.metaKey === undefined ) {
+            event.metaKey = event.ctrlKey;
+        }
+
+        return fixHook.filter? fixHook.filter( event, originalEvent ) : event;
+    },
+
+    special: {
+        ready: {
+            // Make sure the ready event is setup
+            setup: jQuery.bindReady
+        },
+
+        load: {
+            // Prevent triggered image.load events from bubbling to window.load
+            noBubble: true
+        },
+
+        focus: {
+            delegateType: "focusin"
+        },
+        blur: {
+            delegateType: "focusout"
+        },
+
+        beforeunload: {
+            setup: function( data, namespaces, eventHandle ) {
+                // We only want to do this special case on windows
+                if ( jQuery.isWindow( this ) ) {
+                    this.onbeforeunload = eventHandle;
+                }
+            },
+
+            teardown: function( namespaces, eventHandle ) {
+                if ( this.onbeforeunload === eventHandle ) {
+                    this.onbeforeunload = null;
+                }
+            }
+        }
+    },
+
+    simulate: function( type, elem, event, bubble ) {
+        // Piggyback on a donor event to simulate a different one.
+        // Fake originalEvent to avoid donor's stopPropagation, but if the
+        // simulated event prevents default then we do the same on the donor.
+        var e = jQuery.extend(
+            new jQuery.Event(),
+            event,
+            { type: type,
+                isSimulated: true,
+                originalEvent: {}
+            }
+        );
+        if ( bubble ) {
+            jQuery.event.trigger( e, null, elem );
+        } else {
+            jQuery.event.dispatch.call( elem, e );
+        }
+        if ( e.isDefaultPrevented() ) {
+            event.preventDefault();
+        }
+    }
 };
 
 // Some plugins are using, but it's undocumented/deprecated and will be removed.
@@ -3418,433 +3418,433 @@ jQuery.event = {
 jQuery.event.handle = jQuery.event.dispatch;
 
 jQuery.removeEvent = document.removeEventListener ?
-	function( elem, type, handle ) {
-		if ( elem.removeEventListener ) {
-			elem.removeEventListener( type, handle, false );
-		}
-	} :
-	function( elem, type, handle ) {
-		if ( elem.detachEvent ) {
-			elem.detachEvent( "on" + type, handle );
-		}
-	};
+    function( elem, type, handle ) {
+        if ( elem.removeEventListener ) {
+            elem.removeEventListener( type, handle, false );
+        }
+    } :
+    function( elem, type, handle ) {
+        if ( elem.detachEvent ) {
+            elem.detachEvent( "on" + type, handle );
+        }
+    };
 
 jQuery.Event = function( src, props ) {
-	// Allow instantiation without the 'new' keyword
-	if ( !(this instanceof jQuery.Event) ) {
-		return new jQuery.Event( src, props );
-	}
-
-	// Event object
-	if ( src && src.type ) {
-		this.originalEvent = src;
-		this.type = src.type;
-
-		// Events bubbling up the document may have been marked as prevented
-		// by a handler lower down the tree; reflect the correct value.
-		this.isDefaultPrevented = ( src.defaultPrevented || src.returnValue === false ||
-			src.getPreventDefault && src.getPreventDefault() ) ? returnTrue : returnFalse;
-
-	// Event type
-	} else {
-		this.type = src;
-	}
-
-	// Put explicitly provided properties onto the event object
-	if ( props ) {
-		jQuery.extend( this, props );
-	}
-
-	// Create a timestamp if incoming event doesn't have one
-	this.timeStamp = src && src.timeStamp || jQuery.now();
-
-	// Mark it as fixed
-	this[ jQuery.expando ] = true;
+    // Allow instantiation without the 'new' keyword
+    if ( !(this instanceof jQuery.Event) ) {
+        return new jQuery.Event( src, props );
+    }
+
+    // Event object
+    if ( src && src.type ) {
+        this.originalEvent = src;
+        this.type = src.type;
+
+        // Events bubbling up the document may have been marked as prevented
+        // by a handler lower down the tree; reflect the correct value.
+        this.isDefaultPrevented = ( src.defaultPrevented || src.returnValue === false ||
+            src.getPreventDefault && src.getPreventDefault() ) ? returnTrue : returnFalse;
+
+    // Event type
+    } else {
+        this.type = src;
+    }
+
+    // Put explicitly provided properties onto the event object
+    if ( props ) {
+        jQuery.extend( this, props );
+    }
+
+    // Create a timestamp if incoming event doesn't have one
+    this.timeStamp = src && src.timeStamp || jQuery.now();
+
+    // Mark it as fixed
+    this[ jQuery.expando ] = true;
 };
 
 function returnFalse() {
-	return false;
+    return false;
 }
 function returnTrue() {
-	return true;
+    return true;
 }
 
 // jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
 // http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
 jQuery.Event.prototype = {
-	preventDefault: function() {
-		this.isDefaultPrevented = returnTrue;
-
-		var e = this.originalEvent;
-		if ( !e ) {
-			return;
-		}
-
-		// if preventDefault exists run it on the original event
-		if ( e.preventDefault ) {
-			e.preventDefault();
-
-		// otherwise set the returnValue property of the original event to false (IE)
-		} else {
-			e.returnValue = false;
-		}
-	},
-	stopPropagation: function() {
-		this.isPropagationStopped = returnTrue;
-
-		var e = this.originalEvent;
-		if ( !e ) {
-			return;
-		}
-		// if stopPropagation exists run it on the original event
-		if ( e.stopPropagation ) {
-			e.stopPropagation();
-		}
-		// otherwise set the cancelBubble property of the original event to true (IE)
-		e.cancelBubble = true;
-	},
-	stopImmediatePropagation: function() {
-		this.isImmediatePropagationStopped = returnTrue;
-		this.stopPropagation();
-	},
-	isDefaultPrevented: returnFalse,
-	isPropagationStopped: returnFalse,
-	isImmediatePropagationStopped: returnFalse
+    preventDefault: function() {
+        this.isDefaultPrevented = returnTrue;
+
+        var e = this.originalEvent;
+        if ( !e ) {
+            return;
+        }
+
+        // if preventDefault exists run it on the original event
+        if ( e.preventDefault ) {
+            e.preventDefault();
+
+        // otherwise set the returnValue property of the original event to false (IE)
+        } else {
+            e.returnValue = false;
+        }
+    },
+    stopPropagation: function() {
+        this.isPropagationStopped = returnTrue;
+
+        var e = this.originalEvent;
+        if ( !e ) {
+            return;
+        }
+        // if stopPropagation exists run it on the original event
+        if ( e.stopPropagation ) {
+            e.stopPropagation();
+        }
+        // otherwise set the cancelBubble property of the original event to true (IE)
+        e.cancelBubble = true;
+    },
+    stopImmediatePropagation: function() {
+        this.isImmediatePropagationStopped = returnTrue;
+        this.stopPropagation();
+    },
+    isDefaultPrevented: returnFalse,
+    isPropagationStopped: returnFalse,
+    isImmediatePropagationStopped: returnFalse
 };
 
 // Create mouseenter/leave events using mouseover/out and event-time checks
 jQuery.each({
-	mouseenter: "mouseover",
-	mouseleave: "mouseout"
+    mouseenter: "mouseover",
+    mouseleave: "mouseout"
 }, function( orig, fix ) {
-	jQuery.event.special[ orig ] = {
-		delegateType: fix,
-		bindType: fix,
-
-		handle: function( event ) {
-			var target = this,
-				related = event.relatedTarget,
-				handleObj = event.handleObj,
-				selector = handleObj.selector,
-				ret;
-
-			// For mousenter/leave call the handler if related is outside the target.
-			// NB: No relatedTarget if the mouse left/entered the browser window
-			if ( !related || (related !== target && !jQuery.contains( target, related )) ) {
-				event.type = handleObj.origType;
-				ret = handleObj.handler.apply( this, arguments );
-				event.type = fix;
-			}
-			return ret;
-		}
-	};
+    jQuery.event.special[ orig ] = {
+        delegateType: fix,
+        bindType: fix,
+
+        handle: function( event ) {
+            var target = this,
+                related = event.relatedTarget,
+                handleObj = event.handleObj,
+                selector = handleObj.selector,
+                ret;
+
+            // For mousenter/leave call the handler if related is outside the target.
+            // NB: No relatedTarget if the mouse left/entered the browser window
+            if ( !related || (related !== target && !jQuery.contains( target, related )) ) {
+                event.type = handleObj.origType;
+                ret = handleObj.handler.apply( this, arguments );
+                event.type = fix;
+            }
+            return ret;
+        }
+    };
 });
 
 // IE submit delegation
 if ( !jQuery.support.submitBubbles ) {
 
-	jQuery.event.special.submit = {
-		setup: function() {
-			// Only need this for delegated form submit events
-			if ( jQuery.nodeName( this, "form" ) ) {
-				return false;
-			}
-
-			// Lazy-add a submit handler when a descendant form may potentially be submitted
-			jQuery.event.add( this, "click._submit keypress._submit", function( e ) {
-				// Node name check avoids a VML-related crash in IE (#9807)
-				var elem = e.target,
-					form = jQuery.nodeName( elem, "input" ) || jQuery.nodeName( elem, "button" ) ? elem.form : undefined;
-				if ( form && !form._submit_attached ) {
-					jQuery.event.add( form, "submit._submit", function( event ) {
-						// If form was submitted by the user, bubble the event up the tree
-						if ( this.parentNode && !event.isTrigger ) {
-							jQuery.event.simulate( "submit", this.parentNode, event, true );
-						}
-					});
-					form._submit_attached = true;
-				}
-			});
-			// return undefined since we don't need an event listener
-		},
-
-		teardown: function() {
-			// Only need this for delegated form submit events
-			if ( jQuery.nodeName( this, "form" ) ) {
-				return false;
-			}
-
-			// Remove delegated handlers; cleanData eventually reaps submit handlers attached above
-			jQuery.event.remove( this, "._submit" );
-		}
-	};
+    jQuery.event.special.submit = {
+        setup: function() {
+            // Only need this for delegated form submit events
+            if ( jQuery.nodeName( this, "form" ) ) {
+                return false;
+            }
+
+            // Lazy-add a submit handler when a descendant form may potentially be submitted
+            jQuery.event.add( this, "click._submit keypress._submit", function( e ) {
+                // Node name check avoids a VML-related crash in IE (#9807)
+                var elem = e.target,
+                    form = jQuery.nodeName( elem, "input" ) || jQuery.nodeName( elem, "button" ) ? elem.form : undefined;
+                if ( form && !form._submit_attached ) {
+                    jQuery.event.add( form, "submit._submit", function( event ) {
+                        // If form was submitted by the user, bubble the event up the tree
+                        if ( this.parentNode && !event.isTrigger ) {
+                            jQuery.event.simulate( "submit", this.parentNode, event, true );
+                        }
+                    });
+                    form._submit_attached = true;
+                }
+            });
+            // return undefined since we don't need an event listener
+        },
+
+        teardown: function() {
+            // Only need this for delegated form submit events
+            if ( jQuery.nodeName( this, "form" ) ) {
+                return false;
+            }
+
+            // Remove delegated handlers; cleanData eventually reaps submit handlers attached above
+            jQuery.event.remove( this, "._submit" );
+        }
+    };
 }
 
 // IE change delegation and checkbox/radio fix
 if ( !jQuery.support.changeBubbles ) {
 
-	jQuery.event.special.change = {
-
-		setup: function() {
-
-			if ( rformElems.test( this.nodeName ) ) {
-				// IE doesn't fire change on a check/radio until blur; trigger it on click
-				// after a propertychange. Eat the blur-change in special.change.handle.
-				// This still fires onchange a second time for check/radio after blur.
-				if ( this.type === "checkbox" || this.type === "radio" ) {
-					jQuery.event.add( this, "propertychange._change", function( event ) {
-						if ( event.originalEvent.propertyName === "checked" ) {
-							this._just_changed = true;
-						}
-					});
-					jQuery.event.add( this, "click._change", function( event ) {
-						if ( this._just_changed && !event.isTrigger ) {
-							this._just_changed = false;
-							jQuery.event.simulate( "change", this, event, true );
-						}
-					});
-				}
-				return false;
-			}
-			// Delegated event; lazy-add a change handler on descendant inputs
-			jQuery.event.add( this, "beforeactivate._change", function( e ) {
-				var elem = e.target;
-
-				if ( rformElems.test( elem.nodeName ) && !elem._change_attached ) {
-					jQuery.event.add( elem, "change._change", function( event ) {
-						if ( this.parentNode && !event.isSimulated && !event.isTrigger ) {
-							jQuery.event.simulate( "change", this.parentNode, event, true );
-						}
-					});
-					elem._change_attached = true;
-				}
-			});
-		},
-
-		handle: function( event ) {
-			var elem = event.target;
-
-			// Swallow native change events from checkbox/radio, we already triggered them above
-			if ( this !== elem || event.isSimulated || event.isTrigger || (elem.type !== "radio" && elem.type !== "checkbox") ) {
-				return event.handleObj.handler.apply( this, arguments );
-			}
-		},
-
-		teardown: function() {
-			jQuery.event.remove( this, "._change" );
-
-			return rformElems.test( this.nodeName );
-		}
-	};
+    jQuery.event.special.change = {
+
+        setup: function() {
+
+            if ( rformElems.test( this.nodeName ) ) {
+                // IE doesn't fire change on a check/radio until blur; trigger it on click
+                // after a propertychange. Eat the blur-change in special.change.handle.
+                // This still fires onchange a second time for check/radio after blur.
+                if ( this.type === "checkbox" || this.type === "radio" ) {
+                    jQuery.event.add( this, "propertychange._change", function( event ) {
+                        if ( event.originalEvent.propertyName === "checked" ) {
+                            this._just_changed = true;
+                        }
+                    });
+                    jQuery.event.add( this, "click._change", function( event ) {
+                        if ( this._just_changed && !event.isTrigger ) {
+                            this._just_changed = false;
+                            jQuery.event.simulate( "change", this, event, true );
+                        }
+                    });
+                }
+                return false;
+            }
+            // Delegated event; lazy-add a change handler on descendant inputs
+            jQuery.event.add( this, "beforeactivate._change", function( e ) {
+                var elem = e.target;
+
+                if ( rformElems.test( elem.nodeName ) && !elem._change_attached ) {
+                    jQuery.event.add( elem, "change._change", function( event ) {
+                        if ( this.parentNode && !event.isSimulated && !event.isTrigger ) {
+                            jQuery.event.simulate( "change", this.parentNode, event, true );
+                        }
+                    });
+                    elem._change_attached = true;
+                }
+            });
+        },
+
+        handle: function( event ) {
+            var elem = event.target;
+
+            // Swallow native change events from checkbox/radio, we already triggered them above
+            if ( this !== elem || event.isSimulated || event.isTrigger || (elem.type !== "radio" && elem.type !== "checkbox") ) {
+                return event.handleObj.handler.apply( this, arguments );
+            }
+        },
+
+        teardown: function() {
+            jQuery.event.remove( this, "._change" );
+
+            return rformElems.test( this.nodeName );
+        }
+    };
 }
 
 // Create "bubbling" focus and blur events
 if ( !jQuery.support.focusinBubbles ) {
-	jQuery.each({ focus: "focusin", blur: "focusout" }, function( orig, fix ) {
-
-		// Attach a single capturing handler while someone wants focusin/focusout
-		var attaches = 0,
-			handler = function( event ) {
-				jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ), true );
-			};
-
-		jQuery.event.special[ fix ] = {
-			setup: function() {
-				if ( attaches++ === 0 ) {
-					document.addEventListener( orig, handler, true );
-				}
-			},
-			teardown: function() {
-				if ( --attaches === 0 ) {
-					document.removeEventListener( orig, handler, true );
-				}
-			}
-		};
-	});
+    jQuery.each({ focus: "focusin", blur: "focusout" }, function( orig, fix ) {
+
+        // Attach a single capturing handler while someone wants focusin/focusout
+        var attaches = 0,
+            handler = function( event ) {
+                jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ), true );
+            };
+
+        jQuery.event.special[ fix ] = {
+            setup: function() {
+                if ( attaches++ === 0 ) {
+                    document.addEventListener( orig, handler, true );
+                }
+            },
+            teardown: function() {
+                if ( --attaches === 0 ) {
+                    document.removeEventListener( orig, handler, true );
+                }
+            }
+        };
+    });
 }
 
 jQuery.fn.extend({
 
-	on: function( types, selector, data, fn, /*INTERNAL*/ one ) {
-		var origFn, type;
-
-		// Types can be a map of types/handlers
-		if ( typeof types === "object" ) {
-			// ( types-Object, selector, data )
-			if ( typeof selector !== "string" ) {
-				// ( types-Object, data )
-				data = selector;
-				selector = undefined;
-			}
-			for ( type in types ) {
-				this.on( type, selector, data, types[ type ], one );
-			}
-			return this;
-		}
-
-		if ( data == null && fn == null ) {
-			// ( types, fn )
-			fn = selector;
-			data = selector = undefined;
-		} else if ( fn == null ) {
-			if ( typeof selector === "string" ) {
-				// ( types, selector, fn )
-				fn = data;
-				data = undefined;
-			} else {
-				// ( types, data, fn )
-				fn = data;
-				data = selector;
-				selector = undefined;
-			}
-		}
-		if ( fn === false ) {
-			fn = returnFalse;
-		} else if ( !fn ) {
-			return this;
-		}
-
-		if ( one === 1 ) {
-			origFn = fn;
-			fn = function( event ) {
-				// Can use an empty set, since event contains the info
-				jQuery().off( event );
-				return origFn.apply( this, arguments );
-			};
-			// Use same guid so caller can remove using origFn
-			fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
-		}
-		return this.each( function() {
-			jQuery.event.add( this, types, fn, data, selector );
-		});
-	},
-	one: function( types, selector, data, fn ) {
-		return this.on.call( this, types, selector, data, fn, 1 );
-	},
-	off: function( types, selector, fn ) {
-		if ( types && types.preventDefault && types.handleObj ) {
-			// ( event )  dispatched jQuery.Event
-			var handleObj = types.handleObj;
-			jQuery( types.delegateTarget ).off(
-				handleObj.namespace? handleObj.type + "." + handleObj.namespace : handleObj.type,
-				handleObj.selector,
-				handleObj.handler
-			);
-			return this;
-		}
-		if ( typeof types === "object" ) {
-			// ( types-object [, selector] )
-			for ( var type in types ) {
-				this.off( type, selector, types[ type ] );
-			}
-			return this;
-		}
-		if ( selector === false || typeof selector === "function" ) {
-			// ( types [, fn] )
-			fn = selector;
-			selector = undefined;
-		}
-		if ( fn === false ) {
-			fn = returnFalse;
-		}
-		return this.each(function() {
-			jQuery.event.remove( this, types, fn, selector );
-		});
-	},
-
-	bind: function( types, data, fn ) {
-		return this.on( types, null, data, fn );
-	},
-	unbind: function( types, fn ) {
-		return this.off( types, null, fn );
-	},
-
-	live: function( types, data, fn ) {
-		jQuery( this.context ).on( types, this.selector, data, fn );
-		return this;
-	},
-	die: function( types, fn ) {
-		jQuery( this.context ).off( types, this.selector || "**", fn );
-		return this;
-	},
-
-	delegate: function( selector, types, data, fn ) {
-		return this.on( types, selector, data, fn );
-	},
-	undelegate: function( selector, types, fn ) {
-		// ( namespace ) or ( selector, types [, fn] )
-		return arguments.length == 1? this.off( selector, "**" ) : this.off( types, selector, fn );
-	},
-
-	trigger: function( type, data ) {
-		return this.each(function() {
-			jQuery.event.trigger( type, data, this );
-		});
-	},
-	triggerHandler: function( type, data ) {
-		if ( this[0] ) {
-			return jQuery.event.trigger( type, data, this[0], true );
-		}
-	},
-
-	toggle: function( fn ) {
-		// Save reference to arguments for access in closure
-		var args = arguments,
-			guid = fn.guid || jQuery.guid++,
-			i = 0,
-			toggler = function( event ) {
-				// Figure out which function to execute
-				var lastToggle = ( jQuery._data( this, "lastToggle" + fn.guid ) || 0 ) % i;
-				jQuery._data( this, "lastToggle" + fn.guid, lastToggle + 1 );
-
-				// Make sure that clicks stop
-				event.preventDefault();
-
-				// and execute the function
-				return args[ lastToggle ].apply( this, arguments ) || false;
-			};
-
-		// link all the functions, so any of them can unbind this click handler
-		toggler.guid = guid;
-		while ( i < args.length ) {
-			args[ i++ ].guid = guid;
-		}
-
-		return this.click( toggler );
-	},
-
-	hover: function( fnOver, fnOut ) {
-		return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
-	}
+    on: function( types, selector, data, fn, /*INTERNAL*/ one ) {
+        var origFn, type;
+
+        // Types can be a map of types/handlers
+        if ( typeof types === "object" ) {
+            // ( types-Object, selector, data )
+            if ( typeof selector !== "string" ) {
+                // ( types-Object, data )
+                data = selector;
+                selector = undefined;
+            }
+            for ( type in types ) {
+                this.on( type, selector, data, types[ type ], one );
+            }
+            return this;
+        }
+
+        if ( data == null && fn == null ) {
+            // ( types, fn )
+            fn = selector;
+            data = selector = undefined;
+        } else if ( fn == null ) {
+            if ( typeof selector === "string" ) {
+                // ( types, selector, fn )
+                fn = data;
+                data = undefined;
+            } else {
+                // ( types, data, fn )
+                fn = data;
+                data = selector;
+                selector = undefined;
+            }
+        }
+        if ( fn === false ) {
+            fn = returnFalse;
+        } else if ( !fn ) {
+            return this;
+        }
+
+        if ( one === 1 ) {
+            origFn = fn;
+            fn = function( event ) {
+                // Can use an empty set, since event contains the info
+                jQuery().off( event );
+                return origFn.apply( this, arguments );
+            };
+            // Use same guid so caller can remove using origFn
+            fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
+        }
+        return this.each( function() {
+            jQuery.event.add( this, types, fn, data, selector );
+        });
+    },
+    one: function( types, selector, data, fn ) {
+        return this.on.call( this, types, selector, data, fn, 1 );
+    },
+    off: function( types, selector, fn ) {
+        if ( types && types.preventDefault && types.handleObj ) {
+            // ( event )  dispatched jQuery.Event
+            var handleObj = types.handleObj;
+            jQuery( types.delegateTarget ).off(
+                handleObj.namespace? handleObj.type + "." + handleObj.namespace : handleObj.type,
+                handleObj.selector,
+                handleObj.handler
+            );
+            return this;
+        }
+        if ( typeof types === "object" ) {
+            // ( types-object [, selector] )
+            for ( var type in types ) {
+                this.off( type, selector, types[ type ] );
+            }
+            return this;
+        }
+        if ( selector === false || typeof selector === "function" ) {
+            // ( types [, fn] )
+            fn = selector;
+            selector = undefined;
+        }
+        if ( fn === false ) {
+            fn = returnFalse;
+        }
+        return this.each(function() {
+            jQuery.event.remove( this, types, fn, selector );
+        });
+    },
+
+    bind: function( types, data, fn ) {
+        return this.on( types, null, data, fn );
+    },
+    unbind: function( types, fn ) {
+        return this.off( types, null, fn );
+    },
+
+    live: function( types, data, fn ) {
+        jQuery( this.context ).on( types, this.selector, data, fn );
+        return this;
+    },
+    die: function( types, fn ) {
+        jQuery( this.context ).off( types, this.selector || "**", fn );
+        return this;
+    },
+
+    delegate: function( selector, types, data, fn ) {
+        return this.on( types, selector, data, fn );
+    },
+    undelegate: function( selector, types, fn ) {
+        // ( namespace ) or ( selector, types [, fn] )
+        return arguments.length == 1? this.off( selector, "**" ) : this.off( types, selector, fn );
+    },
+
+    trigger: function( type, data ) {
+        return this.each(function() {
+            jQuery.event.trigger( type, data, this );
+        });
+    },
+    triggerHandler: function( type, data ) {
+        if ( this[0] ) {
+            return jQuery.event.trigger( type, data, this[0], true );
+        }
+    },
+
+    toggle: function( fn ) {
+        // Save reference to arguments for access in closure
+        var args = arguments,
+            guid = fn.guid || jQuery.guid++,
+            i = 0,
+            toggler = function( event ) {
+                // Figure out which function to execute
+                var lastToggle = ( jQuery._data( this, "lastToggle" + fn.guid ) || 0 ) % i;
+                jQuery._data( this, "lastToggle" + fn.guid, lastToggle + 1 );
+
+                // Make sure that clicks stop
+                event.preventDefault();
+
+                // and execute the function
+                return args[ lastToggle ].apply( this, arguments ) || false;
+            };
+
+        // link all the functions, so any of them can unbind this click handler
+        toggler.guid = guid;
+        while ( i < args.length ) {
+            args[ i++ ].guid = guid;
+        }
+
+        return this.click( toggler );
+    },
+
+    hover: function( fnOver, fnOut ) {
+        return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
+    }
 });
 
 jQuery.each( ("blur focus focusin focusout load resize scroll unload click dblclick " +
-	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
-	"change select submit keydown keypress keyup error contextmenu").split(" "), function( i, name ) {
-
-	// Handle event binding
-	jQuery.fn[ name ] = function( data, fn ) {
-		if ( fn == null ) {
-			fn = data;
-			data = null;
-		}
-
-		return arguments.length > 0 ?
-			this.on( name, null, data, fn ) :
-			this.trigger( name );
-	};
-
-	if ( jQuery.attrFn ) {
-		jQuery.attrFn[ name ] = true;
-	}
-
-	if ( rkeyEvent.test( name ) ) {
-		jQuery.event.fixHooks[ name ] = jQuery.event.keyHooks;
-	}
-
-	if ( rmouseEvent.test( name ) ) {
-		jQuery.event.fixHooks[ name ] = jQuery.event.mouseHooks;
-	}
+    "mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
+    "change select submit keydown keypress keyup error contextmenu").split(" "), function( i, name ) {
+
+    // Handle event binding
+    jQuery.fn[ name ] = function( data, fn ) {
+        if ( fn == null ) {
+            fn = data;
+            data = null;
+        }
+
+        return arguments.length > 0 ?
+            this.on( name, null, data, fn ) :
+            this.trigger( name );
+    };
+
+    if ( jQuery.attrFn ) {
+        jQuery.attrFn[ name ] = true;
+    }
+
+    if ( rkeyEvent.test( name ) ) {
+        jQuery.event.fixHooks[ name ] = jQuery.event.keyHooks;
+    }
+
+    if ( rmouseEvent.test( name ) ) {
+        jQuery.event.fixHooks[ name ] = jQuery.event.mouseHooks;
+    }
 });
 
 
@@ -3858,325 +3858,325 @@ jQuery.each( ("blur focus focusin focusout load resize scroll unload click dblcl
 (function(){
 
 var chunker = /((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^\[\]]*\]|['"][^'"]*['"]|[^\[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,
-	expando = "sizcache" + (Math.random() + '').replace('.', ''),
-	done = 0,
-	toString = Object.prototype.toString,
-	hasDuplicate = false,
-	baseHasDuplicate = true,
-	rBackslash = /\\/g,
-	rReturn = /\r\n/g,
-	rNonWord = /\W/;
+    expando = "sizcache" + (Math.random() + '').replace('.', ''),
+    done = 0,
+    toString = Object.prototype.toString,
+    hasDuplicate = false,
+    baseHasDuplicate = true,
+    rBackslash = /\\/g,
+    rReturn = /\r\n/g,
+    rNonWord = /\W/;
 
 // Here we check if the JavaScript engine is using some sort of
 // optimization where it does not always call our comparision
 // function. If that is the case, discard the hasDuplicate value.
 //   Thus far that includes Google Chrome.
 [0, 0].sort(function() {
-	baseHasDuplicate = false;
-	return 0;
+    baseHasDuplicate = false;
+    return 0;
 });
 
 var Sizzle = function( selector, context, results, seed ) {
-	results = results || [];
-	context = context || document;
-
-	var origContext = context;
-
-	if ( context.nodeType !== 1 && context.nodeType !== 9 ) {
-		return [];
-	}
-	
-	if ( !selector || typeof selector !== "string" ) {
-		return results;
-	}
-
-	var m, set, checkSet, extra, ret, cur, pop, i,
-		prune = true,
-		contextXML = Sizzle.isXML( context ),
-		parts = [],
-		soFar = selector;
-	
-	// Reset the position of the chunker regexp (start from head)
-	do {
-		chunker.exec( "" );
-		m = chunker.exec( soFar );
-
-		if ( m ) {
-			soFar = m[3];
-		
-			parts.push( m[1] );
-		
-			if ( m[2] ) {
-				extra = m[3];
-				break;
-			}
-		}
-	} while ( m );
-
-	if ( parts.length > 1 && origPOS.exec( selector ) ) {
-
-		if ( parts.length === 2 && Expr.relative[ parts[0] ] ) {
-			set = posProcess( parts[0] + parts[1], context, seed );
-
-		} else {
-			set = Expr.relative[ parts[0] ] ?
-				[ context ] :
-				Sizzle( parts.shift(), context );
-
-			while ( parts.length ) {
-				selector = parts.shift();
-
-				if ( Expr.relative[ selector ] ) {
-					selector += parts.shift();
-				}
-				
-				set = posProcess( selector, set, seed );
-			}
-		}
-
-	} else {
-		// Take a shortcut and set the context if the root selector is an ID
-		// (but not if it'll be faster if the inner selector is an ID)
-		if ( !seed && parts.length > 1 && context.nodeType === 9 && !contextXML &&
-				Expr.match.ID.test(parts[0]) && !Expr.match.ID.test(parts[parts.length - 1]) ) {
-
-			ret = Sizzle.find( parts.shift(), context, contextXML );
-			context = ret.expr ?
-				Sizzle.filter( ret.expr, ret.set )[0] :
-				ret.set[0];
-		}
-
-		if ( context ) {
-			ret = seed ?
-				{ expr: parts.pop(), set: makeArray(seed) } :
-				Sizzle.find( parts.pop(), parts.length === 1 && (parts[0] === "~" || parts[0] === "+") && context.parentNode ? context.parentNode : context, contextXML );
-
-			set = ret.expr ?
-				Sizzle.filter( ret.expr, ret.set ) :
-				ret.set;
-
-			if ( parts.length > 0 ) {
-				checkSet = makeArray( set );
-
-			} else {
-				prune = false;
-			}
-
-			while ( parts.length ) {
-				cur = parts.pop();
-				pop = cur;
-
-				if ( !Expr.relative[ cur ] ) {
-					cur = "";
-				} else {
-					pop = parts.pop();
-				}
-
-				if ( pop == null ) {
-					pop = context;
-				}
-
-				Expr.relative[ cur ]( checkSet, pop, contextXML );
-			}
-
-		} else {
-			checkSet = parts = [];
-		}
-	}
-
-	if ( !checkSet ) {
-		checkSet = set;
-	}
-
-	if ( !checkSet ) {
-		Sizzle.error( cur || selector );
-	}
-
-	if ( toString.call(checkSet) === "[object Array]" ) {
-		if ( !prune ) {
-			results.push.apply( results, checkSet );
-
-		} else if ( context && context.nodeType === 1 ) {
-			for ( i = 0; checkSet[i] != null; i++ ) {
-				if ( checkSet[i] && (checkSet[i] === true || checkSet[i].nodeType === 1 && Sizzle.contains(context, checkSet[i])) ) {
-					results.push( set[i] );
-				}
-			}
-
-		} else {
-			for ( i = 0; checkSet[i] != null; i++ ) {
-				if ( checkSet[i] && checkSet[i].nodeType === 1 ) {
-					results.push( set[i] );
-				}
-			}
-		}
-
-	} else {
-		makeArray( checkSet, results );
-	}
-
-	if ( extra ) {
-		Sizzle( extra, origContext, results, seed );
-		Sizzle.uniqueSort( results );
-	}
-
-	return results;
+    results = results || [];
+    context = context || document;
+
+    var origContext = context;
+
+    if ( context.nodeType !== 1 && context.nodeType !== 9 ) {
+        return [];
+    }
+
+    if ( !selector || typeof selector !== "string" ) {
+        return results;
+    }
+
+    var m, set, checkSet, extra, ret, cur, pop, i,
+        prune = true,
+        contextXML = Sizzle.isXML( context ),
+        parts = [],
+        soFar = selector;
+
+    // Reset the position of the chunker regexp (start from head)
+    do {
+        chunker.exec( "" );
+        m = chunker.exec( soFar );
+
+        if ( m ) {
+            soFar = m[3];
+
+            parts.push( m[1] );
+
+            if ( m[2] ) {
+                extra = m[3];
+                break;
+            }
+        }
+    } while ( m );
+
+    if ( parts.length > 1 && origPOS.exec( selector ) ) {
+
+        if ( parts.length === 2 && Expr.relative[ parts[0] ] ) {
+            set = posProcess( parts[0] + parts[1], context, seed );
+
+        } else {
+            set = Expr.relative[ parts[0] ] ?
+                [ context ] :
+                Sizzle( parts.shift(), context );
+
+            while ( parts.length ) {
+                selector = parts.shift();
+
+                if ( Expr.relative[ selector ] ) {
+                    selector += parts.shift();
+                }
+
+                set = posProcess( selector, set, seed );
+            }
+        }
+
+    } else {
+        // Take a shortcut and set the context if the root selector is an ID
+        // (but not if it'll be faster if the inner selector is an ID)
+        if ( !seed && parts.length > 1 && context.nodeType === 9 && !contextXML &&
+                Expr.match.ID.test(parts[0]) && !Expr.match.ID.test(parts[parts.length - 1]) ) {
+
+            ret = Sizzle.find( parts.shift(), context, contextXML );
+            context = ret.expr ?
+                Sizzle.filter( ret.expr, ret.set )[0] :
+                ret.set[0];
+        }
+
+        if ( context ) {
+            ret = seed ?
+                { expr: parts.pop(), set: makeArray(seed) } :
+                Sizzle.find( parts.pop(), parts.length === 1 && (parts[0] === "~" || parts[0] === "+") && context.parentNode ? context.parentNode : context, contextXML );
+
+            set = ret.expr ?
+                Sizzle.filter( ret.expr, ret.set ) :
+                ret.set;
+
+            if ( parts.length > 0 ) {
+                checkSet = makeArray( set );
+
+            } else {
+                prune = false;
+            }
+
+            while ( parts.length ) {
+                cur = parts.pop();
+                pop = cur;
+
+                if ( !Expr.relative[ cur ] ) {
+                    cur = "";
+                } else {
+                    pop = parts.pop();
+                }
+
+                if ( pop == null ) {
+                    pop = context;
+                }
+
+                Expr.relative[ cur ]( checkSet, pop, contextXML );
+            }
+
+        } else {
+            checkSet = parts = [];
+        }
+    }
+
+    if ( !checkSet ) {
+        checkSet = set;
+    }
+
+    if ( !checkSet ) {
+        Sizzle.error( cur || selector );
+    }
+
+    if ( toString.call(checkSet) === "[object Array]" ) {
+        if ( !prune ) {
+            results.push.apply( results, checkSet );
+
+        } else if ( context && context.nodeType === 1 ) {
+            for ( i = 0; checkSet[i] != null; i++ ) {
+                if ( checkSet[i] && (checkSet[i] === true || checkSet[i].nodeType === 1 && Sizzle.contains(context, checkSet[i])) ) {
+                    results.push( set[i] );
+                }
+            }
+
+        } else {
+            for ( i = 0; checkSet[i] != null; i++ ) {
+                if ( checkSet[i] && checkSet[i].nodeType === 1 ) {
+                    results.push( set[i] );
+                }
+            }
+        }
+
+    } else {
+        makeArray( checkSet, results );
+    }
+
+    if ( extra ) {
+        Sizzle( extra, origContext, results, seed );
+        Sizzle.uniqueSort( results );
+    }
+
+    return results;
 };
 
 Sizzle.uniqueSort = function( results ) {
-	if ( sortOrder ) {
-		hasDuplicate = baseHasDuplicate;
-		results.sort( sortOrder );
-
-		if ( hasDuplicate ) {
-			for ( var i = 1; i < results.length; i++ ) {
-				if ( results[i] === results[ i - 1 ] ) {
-					results.splice( i--, 1 );
-				}
-			}
-		}
-	}
-
-	return results;
+    if ( sortOrder ) {
+        hasDuplicate = baseHasDuplicate;
+        results.sort( sortOrder );
+
+        if ( hasDuplicate ) {
+            for ( var i = 1; i < results.length; i++ ) {
+                if ( results[i] === results[ i - 1 ] ) {
+                    results.splice( i--, 1 );
+                }
+            }
+        }
+    }
+
+    return results;
 };
 
 Sizzle.matches = function( expr, set ) {
-	return Sizzle( expr, null, null, set );
+    return Sizzle( expr, null, null, set );
 };
 
 Sizzle.matchesSelector = function( node, expr ) {
-	return Sizzle( expr, null, null, [node] ).length > 0;
+    return Sizzle( expr, null, null, [node] ).length > 0;
 };
 
 Sizzle.find = function( expr, context, isXML ) {
-	var set, i, len, match, type, left;
-
-	if ( !expr ) {
-		return [];
-	}
-
-	for ( i = 0, len = Expr.order.length; i < len; i++ ) {
-		type = Expr.order[i];
-		
-		if ( (match = Expr.leftMatch[ type ].exec( expr )) ) {
-			left = match[1];
-			match.splice( 1, 1 );
-
-			if ( left.substr( left.length - 1 ) !== "\\" ) {
-				match[1] = (match[1] || "").replace( rBackslash, "" );
-				set = Expr.find[ type ]( match, context, isXML );
-
-				if ( set != null ) {
-					expr = expr.replace( Expr.match[ type ], "" );
-					break;
-				}
-			}
-		}
-	}
-
-	if ( !set ) {
-		set = typeof context.getElementsByTagName !== "undefined" ?
-			context.getElementsByTagName( "*" ) :
-			[];
-	}
-
-	return { set: set, expr: expr };
+    var set, i, len, match, type, left;
+
+    if ( !expr ) {
+        return [];
+    }
+
+    for ( i = 0, len = Expr.order.length; i < len; i++ ) {
+        type = Expr.order[i];
+
+        if ( (match = Expr.leftMatch[ type ].exec( expr )) ) {
+            left = match[1];
+            match.splice( 1, 1 );
+
+            if ( left.substr( left.length - 1 ) !== "\\" ) {
+                match[1] = (match[1] || "").replace( rBackslash, "" );
+                set = Expr.find[ type ]( match, context, isXML );
+
+                if ( set != null ) {
+                    expr = expr.replace( Expr.match[ type ], "" );
+                    break;
+                }
+            }
+        }
+    }
+
+    if ( !set ) {
+        set = typeof context.getElementsByTagName !== "undefined" ?
+            context.getElementsByTagName( "*" ) :
+            [];
+    }
+
+    return { set: set, expr: expr };
 };
 
 Sizzle.filter = function( expr, set, inplace, not ) {
-	var match, anyFound,
-		type, found, item, filter, left,
-		i, pass,
-		old = expr,
-		result = [],
-		curLoop = set,
-		isXMLFilter = set && set[0] && Sizzle.isXML( set[0] );
-
-	while ( expr && set.length ) {
-		for ( type in Expr.filter ) {
-			if ( (match = Expr.leftMatch[ type ].exec( expr )) != null && match[2] ) {
-				filter = Expr.filter[ type ];
-				left = match[1];
-
-				anyFound = false;
-
-				match.splice(1,1);
-
-				if ( left.substr( left.length - 1 ) === "\\" ) {
-					continue;
-				}
-
-				if ( curLoop === result ) {
-					result = [];
-				}
-
-				if ( Expr.preFilter[ type ] ) {
-					match = Expr.preFilter[ type ]( match, curLoop, inplace, result, not, isXMLFilter );
-
-					if ( !match ) {
-						anyFound = found = true;
-
-					} else if ( match === true ) {
-						continue;
-					}
-				}
-
-				if ( match ) {
-					for ( i = 0; (item = curLoop[i]) != null; i++ ) {
-						if ( item ) {
-							found = filter( item, match, i, curLoop );
-							pass = not ^ found;
-
-							if ( inplace && found != null ) {
-								if ( pass ) {
-									anyFound = true;
-
-								} else {
-									curLoop[i] = false;
-								}
-
-							} else if ( pass ) {
-								result.push( item );
-								anyFound = true;
-							}
-						}
-					}
-				}
-
-				if ( found !== undefined ) {
-					if ( !inplace ) {
-						curLoop = result;
-					}
-
-					expr = expr.replace( Expr.match[ type ], "" );
-
-					if ( !anyFound ) {
-						return [];
-					}
-
-					break;
-				}
-			}
-		}
-
-		// Improper expression
-		if ( expr === old ) {
-			if ( anyFound == null ) {
-				Sizzle.error( expr );
-
-			} else {
-				break;
-			}
-		}
-
-		old = expr;
-	}
-
-	return curLoop;
+    var match, anyFound,
+        type, found, item, filter, left,
+        i, pass,
+        old = expr,
+        result = [],
+        curLoop = set,
+        isXMLFilter = set && set[0] && Sizzle.isXML( set[0] );
+
+    while ( expr && set.length ) {
+        for ( type in Expr.filter ) {
+            if ( (match = Expr.leftMatch[ type ].exec( expr )) != null && match[2] ) {
+                filter = Expr.filter[ type ];
+                left = match[1];
+
+                anyFound = false;
+
+                match.splice(1,1);
+
+                if ( left.substr( left.length - 1 ) === "\\" ) {
+                    continue;
+                }
+
+                if ( curLoop === result ) {
+                    result = [];
+                }
+
+                if ( Expr.preFilter[ type ] ) {
+                    match = Expr.preFilter[ type ]( match, curLoop, inplace, result, not, isXMLFilter );
+
+                    if ( !match ) {
+                        anyFound = found = true;
+
+                    } else if ( match === true ) {
+                        continue;
+                    }
+                }
+
+                if ( match ) {
+                    for ( i = 0; (item = curLoop[i]) != null; i++ ) {
+                        if ( item ) {
+                            found = filter( item, match, i, curLoop );
+                            pass = not ^ found;
+
+                            if ( inplace && found != null ) {
+                                if ( pass ) {
+                                    anyFound = true;
+
+                                } else {
+                                    curLoop[i] = false;
+                                }
+
+                            } else if ( pass ) {
+                                result.push( item );
+                                anyFound = true;
+                            }
+                        }
+                    }
+                }
+
+                if ( found !== undefined ) {
+                    if ( !inplace ) {
+                        curLoop = result;
+                    }
+
+                    expr = expr.replace( Expr.match[ type ], "" );
+
+                    if ( !anyFound ) {
+                        return [];
+                    }
+
+                    break;
+                }
+            }
+        }
+
+        // Improper expression
+        if ( expr === old ) {
+            if ( anyFound == null ) {
+                Sizzle.error( expr );
+
+            } else {
+                break;
+            }
+        }
+
+        old = expr;
+    }
+
+    return curLoop;
 };
 
 Sizzle.error = function( msg ) {
-	throw new Error( "Syntax error, unrecognized expression: " + msg );
+    throw new Error( "Syntax error, unrecognized expression: " + msg );
 };
 
 /**
@@ -4185,588 +4185,588 @@ Sizzle.error = function( msg ) {
  */
 var getText = Sizzle.getText = function( elem ) {
     var i, node,
-		nodeType = elem.nodeType,
-		ret = "";
-
-	if ( nodeType ) {
-		if ( nodeType === 1 || nodeType === 9 ) {
-			// Use textContent || innerText for elements
-			if ( typeof elem.textContent === 'string' ) {
-				return elem.textContent;
-			} else if ( typeof elem.innerText === 'string' ) {
-				// Replace IE's carriage returns
-				return elem.innerText.replace( rReturn, '' );
-			} else {
-				// Traverse it's children
-				for ( elem = elem.firstChild; elem; elem = elem.nextSibling) {
-					ret += getText( elem );
-				}
-			}
-		} else if ( nodeType === 3 || nodeType === 4 ) {
-			return elem.nodeValue;
-		}
-	} else {
-
-		// If no nodeType, this is expected to be an array
-		for ( i = 0; (node = elem[i]); i++ ) {
-			// Do not traverse comment nodes
-			if ( node.nodeType !== 8 ) {
-				ret += getText( node );
-			}
-		}
-	}
-	return ret;
+        nodeType = elem.nodeType,
+        ret = "";
+
+    if ( nodeType ) {
+        if ( nodeType === 1 || nodeType === 9 ) {
+            // Use textContent || innerText for elements
+            if ( typeof elem.textContent === 'string' ) {
+                return elem.textContent;
+            } else if ( typeof elem.innerText === 'string' ) {
+                // Replace IE's carriage returns
+                return elem.innerText.replace( rReturn, '' );
+            } else {
+                // Traverse it's children
+                for ( elem = elem.firstChild; elem; elem = elem.nextSibling) {
+                    ret += getText( elem );
+                }
+            }
+        } else if ( nodeType === 3 || nodeType === 4 ) {
+            return elem.nodeValue;
+        }
+    } else {
+
+        // If no nodeType, this is expected to be an array
+        for ( i = 0; (node = elem[i]); i++ ) {
+            // Do not traverse comment nodes
+            if ( node.nodeType !== 8 ) {
+                ret += getText( node );
+            }
+        }
+    }
+    return ret;
 };
 
 var Expr = Sizzle.selectors = {
-	order: [ "ID", "NAME", "TAG" ],
-
-	match: {
-		ID: /#((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
-		CLASS: /\.((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
-		NAME: /\[name=['"]*((?:[\w\u00c0-\uFFFF\-]|\\.)+)['"]*\]/,
-		ATTR: /\[\s*((?:[\w\u00c0-\uFFFF\-]|\\.)+)\s*(?:(\S?=)\s*(?:(['"])(.*?)\3|(#?(?:[\w\u00c0-\uFFFF\-]|\\.)*)|)|)\s*\]/,
-		TAG: /^((?:[\w\u00c0-\uFFFF\*\-]|\\.)+)/,
-		CHILD: /:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,
-		POS: /:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,
-		PSEUDO: /:((?:[\w\u00c0-\uFFFF\-]|\\.)+)(?:\((['"]?)((?:\([^\)]+\)|[^\(\)]*)+)\2\))?/
-	},
-
-	leftMatch: {},
-
-	attrMap: {
-		"class": "className",
-		"for": "htmlFor"
-	},
-
-	attrHandle: {
-		href: function( elem ) {
-			return elem.getAttribute( "href" );
-		},
-		type: function( elem ) {
-			return elem.getAttribute( "type" );
-		}
-	},
-
-	relative: {
-		"+": function(checkSet, part){
-			var isPartStr = typeof part === "string",
-				isTag = isPartStr && !rNonWord.test( part ),
-				isPartStrNotTag = isPartStr && !isTag;
-
-			if ( isTag ) {
-				part = part.toLowerCase();
-			}
-
-			for ( var i = 0, l = checkSet.length, elem; i < l; i++ ) {
-				if ( (elem = checkSet[i]) ) {
-					while ( (elem = elem.previousSibling) && elem.nodeType !== 1 ) {}
-
-					checkSet[i] = isPartStrNotTag || elem && elem.nodeName.toLowerCase() === part ?
-						elem || false :
-						elem === part;
-				}
-			}
-
-			if ( isPartStrNotTag ) {
-				Sizzle.filter( part, checkSet, true );
-			}
-		},
-
-		">": function( checkSet, part ) {
-			var elem,
-				isPartStr = typeof part === "string",
-				i = 0,
-				l = checkSet.length;
-
-			if ( isPartStr && !rNonWord.test( part ) ) {
-				part = part.toLowerCase();
-
-				for ( ; i < l; i++ ) {
-					elem = checkSet[i];
-
-					if ( elem ) {
-						var parent = elem.parentNode;
-						checkSet[i] = parent.nodeName.toLowerCase() === part ? parent : false;
-					}
-				}
-
-			} else {
-				for ( ; i < l; i++ ) {
-					elem = checkSet[i];
-
-					if ( elem ) {
-						checkSet[i] = isPartStr ?
-							elem.parentNode :
-							elem.parentNode === part;
-					}
-				}
-
-				if ( isPartStr ) {
-					Sizzle.filter( part, checkSet, true );
-				}
-			}
-		},
-
-		"": function(checkSet, part, isXML){
-			var nodeCheck,
-				doneName = done++,
-				checkFn = dirCheck;
-
-			if ( typeof part === "string" && !rNonWord.test( part ) ) {
-				part = part.toLowerCase();
-				nodeCheck = part;
-				checkFn = dirNodeCheck;
-			}
-
-			checkFn( "parentNode", part, doneName, checkSet, nodeCheck, isXML );
-		},
-
-		"~": function( checkSet, part, isXML ) {
-			var nodeCheck,
-				doneName = done++,
-				checkFn = dirCheck;
-
-			if ( typeof part === "string" && !rNonWord.test( part ) ) {
-				part = part.toLowerCase();
-				nodeCheck = part;
-				checkFn = dirNodeCheck;
-			}
-
-			checkFn( "previousSibling", part, doneName, checkSet, nodeCheck, isXML );
-		}
-	},
-
-	find: {
-		ID: function( match, context, isXML ) {
-			if ( typeof context.getElementById !== "undefined" && !isXML ) {
-				var m = context.getElementById(match[1]);
-				// Check parentNode to catch when Blackberry 4.6 returns
-				// nodes that are no longer in the document #6963
-				return m && m.parentNode ? [m] : [];
-			}
-		},
-
-		NAME: function( match, context ) {
-			if ( typeof context.getElementsByName !== "undefined" ) {
-				var ret = [],
-					results = context.getElementsByName( match[1] );
-
-				for ( var i = 0, l = results.length; i < l; i++ ) {
-					if ( results[i].getAttribute("name") === match[1] ) {
-						ret.push( results[i] );
-					}
-				}
-
-				return ret.length === 0 ? null : ret;
-			}
-		},
-
-		TAG: function( match, context ) {
-			if ( typeof context.getElementsByTagName !== "undefined" ) {
-				return context.getElementsByTagName( match[1] );
-			}
-		}
-	},
-	preFilter: {
-		CLASS: function( match, curLoop, inplace, result, not, isXML ) {
-			match = " " + match[1].replace( rBackslash, "" ) + " ";
-
-			if ( isXML ) {
-				return match;
-			}
-
-			for ( var i = 0, elem; (elem = curLoop[i]) != null; i++ ) {
-				if ( elem ) {
-					if ( not ^ (elem.className && (" " + elem.className + " ").replace(/[\t\n\r]/g, " ").indexOf(match) >= 0) ) {
-						if ( !inplace ) {
-							result.push( elem );
-						}
-
-					} else if ( inplace ) {
-						curLoop[i] = false;
-					}
-				}
-			}
-
-			return false;
-		},
-
-		ID: function( match ) {
-			return match[1].replace( rBackslash, "" );
-		},
-
-		TAG: function( match, curLoop ) {
-			return match[1].replace( rBackslash, "" ).toLowerCase();
-		},
-
-		CHILD: function( match ) {
-			if ( match[1] === "nth" ) {
-				if ( !match[2] ) {
-					Sizzle.error( match[0] );
-				}
-
-				match[2] = match[2].replace(/^\+|\s*/g, '');
-
-				// parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'
-				var test = /(-?)(\d*)(?:n([+\-]?\d*))?/.exec(
-					match[2] === "even" && "2n" || match[2] === "odd" && "2n+1" ||
-					!/\D/.test( match[2] ) && "0n+" + match[2] || match[2]);
-
-				// calculate the numbers (first)n+(last) including if they are negative
-				match[2] = (test[1] + (test[2] || 1)) - 0;
-				match[3] = test[3] - 0;
-			}
-			else if ( match[2] ) {
-				Sizzle.error( match[0] );
-			}
-
-			// TODO: Move to normal caching system
-			match[0] = done++;
-
-			return match;
-		},
-
-		ATTR: function( match, curLoop, inplace, result, not, isXML ) {
-			var name = match[1] = match[1].replace( rBackslash, "" );
-			
-			if ( !isXML && Expr.attrMap[name] ) {
-				match[1] = Expr.attrMap[name];
-			}
-
-			// Handle if an un-quoted value was used
-			match[4] = ( match[4] || match[5] || "" ).replace( rBackslash, "" );
-
-			if ( match[2] === "~=" ) {
-				match[4] = " " + match[4] + " ";
-			}
-
-			return match;
-		},
-
-		PSEUDO: function( match, curLoop, inplace, result, not ) {
-			if ( match[1] === "not" ) {
-				// If we're dealing with a complex expression, or a simple one
-				if ( ( chunker.exec(match[3]) || "" ).length > 1 || /^\w/.test(match[3]) ) {
-					match[3] = Sizzle(match[3], null, null, curLoop);
-
-				} else {
-					var ret = Sizzle.filter(match[3], curLoop, inplace, true ^ not);
-
-					if ( !inplace ) {
-						result.push.apply( result, ret );
-					}
-
-					return false;
-				}
-
-			} else if ( Expr.match.POS.test( match[0] ) || Expr.match.CHILD.test( match[0] ) ) {
-				return true;
-			}
-			
-			return match;
-		},
-
-		POS: function( match ) {
-			match.unshift( true );
-
-			return match;
-		}
-	},
-	
-	filters: {
-		enabled: function( elem ) {
-			return elem.disabled === false && elem.type !== "hidden";
-		},
-
-		disabled: function( elem ) {
-			return elem.disabled === true;
-		},
-
-		checked: function( elem ) {
-			return elem.checked === true;
-		},
-		
-		selected: function( elem ) {
-			// Accessing this property makes selected-by-default
-			// options in Safari work properly
-			if ( elem.parentNode ) {
-				elem.parentNode.selectedIndex;
-			}
-			
-			return elem.selected === true;
-		},
-
-		parent: function( elem ) {
-			return !!elem.firstChild;
-		},
-
-		empty: function( elem ) {
-			return !elem.firstChild;
-		},
-
-		has: function( elem, i, match ) {
-			return !!Sizzle( match[3], elem ).length;
-		},
-
-		header: function( elem ) {
-			return (/h\d/i).test( elem.nodeName );
-		},
-
-		text: function( elem ) {
-			var attr = elem.getAttribute( "type" ), type = elem.type;
-			// IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc) 
-			// use getAttribute instead to test this case
-			return elem.nodeName.toLowerCase() === "input" && "text" === type && ( attr === type || attr === null );
-		},
-
-		radio: function( elem ) {
-			return elem.nodeName.toLowerCase() === "input" && "radio" === elem.type;
-		},
-
-		checkbox: function( elem ) {
-			return elem.nodeName.toLowerCase() === "input" && "checkbox" === elem.type;
-		},
-
-		file: function( elem ) {
-			return elem.nodeName.toLowerCase() === "input" && "file" === elem.type;
-		},
-
-		password: function( elem ) {
-			return elem.nodeName.toLowerCase() === "input" && "password" === elem.type;
-		},
-
-		submit: function( elem ) {
-			var name = elem.nodeName.toLowerCase();
-			return (name === "input" || name === "button") && "submit" === elem.type;
-		},
-
-		image: function( elem ) {
-			return elem.nodeName.toLowerCase() === "input" && "image" === elem.type;
-		},
-
-		reset: function( elem ) {
-			var name = elem.nodeName.toLowerCase();
-			return (name === "input" || name === "button") && "reset" === elem.type;
-		},
-
-		button: function( elem ) {
-			var name = elem.nodeName.toLowerCase();
-			return name === "input" && "button" === elem.type || name === "button";
-		},
-
-		input: function( elem ) {
-			return (/input|select|textarea|button/i).test( elem.nodeName );
-		},
-
-		focus: function( elem ) {
-			return elem === elem.ownerDocument.activeElement;
-		}
-	},
-	setFilters: {
-		first: function( elem, i ) {
-			return i === 0;
-		},
-
-		last: function( elem, i, match, array ) {
-			return i === array.length - 1;
-		},
-
-		even: function( elem, i ) {
-			return i % 2 === 0;
-		},
-
-		odd: function( elem, i ) {
-			return i % 2 === 1;
-		},
-
-		lt: function( elem, i, match ) {
-			return i < match[3] - 0;
-		},
-
-		gt: function( elem, i, match ) {
-			return i > match[3] - 0;
-		},
-
-		nth: function( elem, i, match ) {
-			return match[3] - 0 === i;
-		},
-
-		eq: function( elem, i, match ) {
-			return match[3] - 0 === i;
-		}
-	},
-	filter: {
-		PSEUDO: function( elem, match, i, array ) {
-			var name = match[1],
-				filter = Expr.filters[ name ];
-
-			if ( filter ) {
-				return filter( elem, i, match, array );
-
-			} else if ( name === "contains" ) {
-				return (elem.textContent || elem.innerText || getText([ elem ]) || "").indexOf(match[3]) >= 0;
-
-			} else if ( name === "not" ) {
-				var not = match[3];
-
-				for ( var j = 0, l = not.length; j < l; j++ ) {
-					if ( not[j] === elem ) {
-						return false;
-					}
-				}
-
-				return true;
-
-			} else {
-				Sizzle.error( name );
-			}
-		},
-
-		CHILD: function( elem, match ) {
-			var first, last,
-				doneName, parent, cache,
-				count, diff,
-				type = match[1],
-				node = elem;
-
-			switch ( type ) {
-				case "only":
-				case "first":
-					while ( (node = node.previousSibling) )	 {
-						if ( node.nodeType === 1 ) { 
-							return false; 
-						}
-					}
-
-					if ( type === "first" ) { 
-						return true; 
-					}
-
-					node = elem;
-
-				case "last":
-					while ( (node = node.nextSibling) )	 {
-						if ( node.nodeType === 1 ) { 
-							return false; 
-						}
-					}
-
-					return true;
-
-				case "nth":
-					first = match[2];
-					last = match[3];
-
-					if ( first === 1 && last === 0 ) {
-						return true;
-					}
-					
-					doneName = match[0];
-					parent = elem.parentNode;
-	
-					if ( parent && (parent[ expando ] !== doneName || !elem.nodeIndex) ) {
-						count = 0;
-						
-						for ( node = parent.firstChild; node; node = node.nextSibling ) {
-							if ( node.nodeType === 1 ) {
-								node.nodeIndex = ++count;
-							}
-						} 
-
-						parent[ expando ] = doneName;
-					}
-					
-					diff = elem.nodeIndex - last;
-
-					if ( first === 0 ) {
-						return diff === 0;
-
-					} else {
-						return ( diff % first === 0 && diff / first >= 0 );
-					}
-			}
-		},
-
-		ID: function( elem, match ) {
-			return elem.nodeType === 1 && elem.getAttribute("id") === match;
-		},
-
-		TAG: function( elem, match ) {
-			return (match === "*" && elem.nodeType === 1) || !!elem.nodeName && elem.nodeName.toLowerCase() === match;
-		},
-		
-		CLASS: function( elem, match ) {
-			return (" " + (elem.className || elem.getAttribute("class")) + " ")
-				.indexOf( match ) > -1;
-		},
-
-		ATTR: function( elem, match ) {
-			var name = match[1],
-				result = Sizzle.attr ?
-					Sizzle.attr( elem, name ) :
-					Expr.attrHandle[ name ] ?
-					Expr.attrHandle[ name ]( elem ) :
-					elem[ name ] != null ?
-						elem[ name ] :
-						elem.getAttribute( name ),
-				value = result + "",
-				type = match[2],
-				check = match[4];
-
-			return result == null ?
-				type === "!=" :
-				!type && Sizzle.attr ?
-				result != null :
-				type === "=" ?
-				value === check :
-				type === "*=" ?
-				value.indexOf(check) >= 0 :
-				type === "~=" ?
-				(" " + value + " ").indexOf(check) >= 0 :
-				!check ?
-				value && result !== false :
-				type === "!=" ?
-				value !== check :
-				type === "^=" ?
-				value.indexOf(check) === 0 :
-				type === "$=" ?
-				value.substr(value.length - check.length) === check :
-				type === "|=" ?
-				value === check || value.substr(0, check.length + 1) === check + "-" :
-				false;
-		},
-
-		POS: function( elem, match, i, array ) {
-			var name = match[2],
-				filter = Expr.setFilters[ name ];
-
-			if ( filter ) {
-				return filter( elem, i, match, array );
-			}
-		}
-	}
+    order: [ "ID", "NAME", "TAG" ],
+
+    match: {
+        ID: /#((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
+        CLASS: /\.((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
+        NAME: /\[name=['"]*((?:[\w\u00c0-\uFFFF\-]|\\.)+)['"]*\]/,
+        ATTR: /\[\s*((?:[\w\u00c0-\uFFFF\-]|\\.)+)\s*(?:(\S?=)\s*(?:(['"])(.*?)\3|(#?(?:[\w\u00c0-\uFFFF\-]|\\.)*)|)|)\s*\]/,
+        TAG: /^((?:[\w\u00c0-\uFFFF\*\-]|\\.)+)/,
+        CHILD: /:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,
+        POS: /:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,
+        PSEUDO: /:((?:[\w\u00c0-\uFFFF\-]|\\.)+)(?:\((['"]?)((?:\([^\)]+\)|[^\(\)]*)+)\2\))?/
+    },
+
+    leftMatch: {},
+
+    attrMap: {
+        "class": "className",
+        "for": "htmlFor"
+    },
+
+    attrHandle: {
+        href: function( elem ) {
+            return elem.getAttribute( "href" );
+        },
+        type: function( elem ) {
+            return elem.getAttribute( "type" );
+        }
+    },
+
+    relative: {
+        "+": function(checkSet, part){
+            var isPartStr = typeof part === "string",
+                isTag = isPartStr && !rNonWord.test( part ),
+                isPartStrNotTag = isPartStr && !isTag;
+
+            if ( isTag ) {
+                part = part.toLowerCase();
+            }
+
+            for ( var i = 0, l = checkSet.length, elem; i < l; i++ ) {
+                if ( (elem = checkSet[i]) ) {
+                    while ( (elem = elem.previousSibling) && elem.nodeType !== 1 ) {}
+
+                    checkSet[i] = isPartStrNotTag || elem && elem.nodeName.toLowerCase() === part ?
+                        elem || false :
+                        elem === part;
+                }
+            }
+
+            if ( isPartStrNotTag ) {
+                Sizzle.filter( part, checkSet, true );
+            }
+        },
+
+        ">": function( checkSet, part ) {
+            var elem,
+                isPartStr = typeof part === "string",
+                i = 0,
+                l = checkSet.length;
+
+            if ( isPartStr && !rNonWord.test( part ) ) {
+                part = part.toLowerCase();
+
+                for ( ; i < l; i++ ) {
+                    elem = checkSet[i];
+
+                    if ( elem ) {
+                        var parent = elem.parentNode;
+                        checkSet[i] = parent.nodeName.toLowerCase() === part ? parent : false;
+                    }
+                }
+
+            } else {
+                for ( ; i < l; i++ ) {
+                    elem = checkSet[i];
+
+                    if ( elem ) {
+                        checkSet[i] = isPartStr ?
+                            elem.parentNode :
+                            elem.parentNode === part;
+                    }
+                }
+
+                if ( isPartStr ) {
+                    Sizzle.filter( part, checkSet, true );
+                }
+            }
+        },
+
+        "": function(checkSet, part, isXML){
+            var nodeCheck,
+                doneName = done++,
+                checkFn = dirCheck;
+
+            if ( typeof part === "string" && !rNonWord.test( part ) ) {
+                part = part.toLowerCase();
+                nodeCheck = part;
+                checkFn = dirNodeCheck;
+            }
+
+            checkFn( "parentNode", part, doneName, checkSet, nodeCheck, isXML );
+        },
+
+        "~": function( checkSet, part, isXML ) {
+            var nodeCheck,
+                doneName = done++,
+                checkFn = dirCheck;
+
+            if ( typeof part === "string" && !rNonWord.test( part ) ) {
+                part = part.toLowerCase();
+                nodeCheck = part;
+                checkFn = dirNodeCheck;
+            }
+
+            checkFn( "previousSibling", part, doneName, checkSet, nodeCheck, isXML );
+        }
+    },
+
+    find: {
+        ID: function( match, context, isXML ) {
+            if ( typeof context.getElementById !== "undefined" && !isXML ) {
+                var m = context.getElementById(match[1]);
+                // Check parentNode to catch when Blackberry 4.6 returns
+                // nodes that are no longer in the document #6963
+                return m && m.parentNode ? [m] : [];
+            }
+        },
+
+        NAME: function( match, context ) {
+            if ( typeof context.getElementsByName !== "undefined" ) {
+                var ret = [],
+                    results = context.getElementsByName( match[1] );
+
+                for ( var i = 0, l = results.length; i < l; i++ ) {
+                    if ( results[i].getAttribute("name") === match[1] ) {
+                        ret.push( results[i] );
+                    }
+                }
+
+                return ret.length === 0 ? null : ret;
+            }
+        },
+
+        TAG: function( match, context ) {
+            if ( typeof context.getElementsByTagName !== "undefined" ) {
+                return context.getElementsByTagName( match[1] );
+            }
+        }
+    },
+    preFilter: {
+        CLASS: function( match, curLoop, inplace, result, not, isXML ) {
+            match = " " + match[1].replace( rBackslash, "" ) + " ";
+
+            if ( isXML ) {
+                return match;
+            }
+
+            for ( var i = 0, elem; (elem = curLoop[i]) != null; i++ ) {
+                if ( elem ) {
+                    if ( not ^ (elem.className && (" " + elem.className + " ").replace(/[\t\n\r]/g, " ").indexOf(match) >= 0) ) {
+                        if ( !inplace ) {
+                            result.push( elem );
+                        }
+
+                    } else if ( inplace ) {
+                        curLoop[i] = false;
+                    }
+                }
+            }
+
+            return false;
+        },
+
+        ID: function( match ) {
+            return match[1].replace( rBackslash, "" );
+        },
+
+        TAG: function( match, curLoop ) {
+            return match[1].replace( rBackslash, "" ).toLowerCase();
+        },
+
+        CHILD: function( match ) {
+            if ( match[1] === "nth" ) {
+                if ( !match[2] ) {
+                    Sizzle.error( match[0] );
+                }
+
+                match[2] = match[2].replace(/^\+|\s*/g, '');
+
+                // parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'
+                var test = /(-?)(\d*)(?:n([+\-]?\d*))?/.exec(
+                    match[2] === "even" && "2n" || match[2] === "odd" && "2n+1" ||
+                    !/\D/.test( match[2] ) && "0n+" + match[2] || match[2]);
+
+                // calculate the numbers (first)n+(last) including if they are negative
+                match[2] = (test[1] + (test[2] || 1)) - 0;
+                match[3] = test[3] - 0;
+            }
+            else if ( match[2] ) {
+                Sizzle.error( match[0] );
+            }
+
+            // TODO: Move to normal caching system
+            match[0] = done++;
+
+            return match;
+        },
+
+        ATTR: function( match, curLoop, inplace, result, not, isXML ) {
+            var name = match[1] = match[1].replace( rBackslash, "" );
+
+            if ( !isXML && Expr.attrMap[name] ) {
+                match[1] = Expr.attrMap[name];
+            }
+
+            // Handle if an un-quoted value was used
+            match[4] = ( match[4] || match[5] || "" ).replace( rBackslash, "" );
+
+            if ( match[2] === "~=" ) {
+                match[4] = " " + match[4] + " ";
+            }
+
+            return match;
+        },
+
+        PSEUDO: function( match, curLoop, inplace, result, not ) {
+            if ( match[1] === "not" ) {
+                // If we're dealing with a complex expression, or a simple one
+                if ( ( chunker.exec(match[3]) || "" ).length > 1 || /^\w/.test(match[3]) ) {
+                    match[3] = Sizzle(match[3], null, null, curLoop);
+
+                } else {
+                    var ret = Sizzle.filter(match[3], curLoop, inplace, true ^ not);
+
+                    if ( !inplace ) {
+                        result.push.apply( result, ret );
+                    }
+
+                    return false;
+                }
+
+            } else if ( Expr.match.POS.test( match[0] ) || Expr.match.CHILD.test( match[0] ) ) {
+                return true;
+            }
+
+            return match;
+        },
+
+        POS: function( match ) {
+            match.unshift( true );
+
+            return match;
+        }
+    },
+
+    filters: {
+        enabled: function( elem ) {
+            return elem.disabled === false && elem.type !== "hidden";
+        },
+
+        disabled: function( elem ) {
+            return elem.disabled === true;
+        },
+
+        checked: function( elem ) {
+            return elem.checked === true;
+        },
+
+        selected: function( elem ) {
+            // Accessing this property makes selected-by-default
+            // options in Safari work properly
+            if ( elem.parentNode ) {
+                elem.parentNode.selectedIndex;
+            }
+
+            return elem.selected === true;
+        },
+
+        parent: function( elem ) {
+            return !!elem.firstChild;
+        },
+
+        empty: function( elem ) {
+            return !elem.firstChild;
+        },
+
+        has: function( elem, i, match ) {
+            return !!Sizzle( match[3], elem ).length;
+        },
+
+        header: function( elem ) {
+            return (/h\d/i).test( elem.nodeName );
+        },
+
+        text: function( elem ) {
+            var attr = elem.getAttribute( "type" ), type = elem.type;
+            // IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc)
+            // use getAttribute instead to test this case
+            return elem.nodeName.toLowerCase() === "input" && "text" === type && ( attr === type || attr === null );
+        },
+
+        radio: function( elem ) {
+            return elem.nodeName.toLowerCase() === "input" && "radio" === elem.type;
+        },
+
+        checkbox: function( elem ) {
+            return elem.nodeName.toLowerCase() === "input" && "checkbox" === elem.type;
+        },
+
+        file: function( elem ) {
+            return elem.nodeName.toLowerCase() === "input" && "file" === elem.type;
+        },
+
+        password: function( elem ) {
+            return elem.nodeName.toLowerCase() === "input" && "password" === elem.type;
+        },
+
+        submit: function( elem ) {
+            var name = elem.nodeName.toLowerCase();
+            return (name === "input" || name === "button") && "submit" === elem.type;
+        },
+
+        image: function( elem ) {
+            return elem.nodeName.toLowerCase() === "input" && "image" === elem.type;
+        },
+
+        reset: function( elem ) {
+            var name = elem.nodeName.toLowerCase();
+            return (name === "input" || name === "button") && "reset" === elem.type;
+        },
+
+        button: function( elem ) {
+            var name = elem.nodeName.toLowerCase();
+            return name === "input" && "button" === elem.type || name === "button";
+        },
+
+        input: function( elem ) {
+            return (/input|select|textarea|button/i).test( elem.nodeName );
+        },
+
+        focus: function( elem ) {
+            return elem === elem.ownerDocument.activeElement;
+        }
+    },
+    setFilters: {
+        first: function( elem, i ) {
+            return i === 0;
+        },
+
+        last: function( elem, i, match, array ) {
+            return i === array.length - 1;
+        },
+
+        even: function( elem, i ) {
+            return i % 2 === 0;
+        },
+
+        odd: function( elem, i ) {
+            return i % 2 === 1;
+        },
+
+        lt: function( elem, i, match ) {
+            return i < match[3] - 0;
+        },
+
+        gt: function( elem, i, match ) {
+            return i > match[3] - 0;
+        },
+
+        nth: function( elem, i, match ) {
+            return match[3] - 0 === i;
+        },
+
+        eq: function( elem, i, match ) {
+            return match[3] - 0 === i;
+        }
+    },
+    filter: {
+        PSEUDO: function( elem, match, i, array ) {
+            var name = match[1],
+                filter = Expr.filters[ name ];
+
+            if ( filter ) {
+                return filter( elem, i, match, array );
+
+            } else if ( name === "contains" ) {
+                return (elem.textContent || elem.innerText || getText([ elem ]) || "").indexOf(match[3]) >= 0;
+
+            } else if ( name === "not" ) {
+                var not = match[3];
+
+                for ( var j = 0, l = not.length; j < l; j++ ) {
+                    if ( not[j] === elem ) {
+                        return false;
+                    }
+                }
+
+                return true;
+
+            } else {
+                Sizzle.error( name );
+            }
+        },
+
+        CHILD: function( elem, match ) {
+            var first, last,
+                doneName, parent, cache,
+                count, diff,
+                type = match[1],
+                node = elem;
+
+            switch ( type ) {
+                case "only":
+                case "first":
+                    while ( (node = node.previousSibling) )  {
+                        if ( node.nodeType === 1 ) {
+                            return false;
+                        }
+                    }
+
+                    if ( type === "first" ) {
+                        return true;
+                    }
+
+                    node = elem;
+
+                case "last":
+                    while ( (node = node.nextSibling) )  {
+                        if ( node.nodeType === 1 ) {
+                            return false;
+                        }
+                    }
+
+                    return true;
+
+                case "nth":
+                    first = match[2];
+                    last = match[3];
+
+                    if ( first === 1 && last === 0 ) {
+                        return true;
+                    }
+
+                    doneName = match[0];
+                    parent = elem.parentNode;
+
+                    if ( parent && (parent[ expando ] !== doneName || !elem.nodeIndex) ) {
+                        count = 0;
+
+                        for ( node = parent.firstChild; node; node = node.nextSibling ) {
+                            if ( node.nodeType === 1 ) {
+                                node.nodeIndex = ++count;
+                            }
+                        }
+
+                        parent[ expando ] = doneName;
+                    }
+
+                    diff = elem.nodeIndex - last;
+
+                    if ( first === 0 ) {
+                        return diff === 0;
+
+                    } else {
+                        return ( diff % first === 0 && diff / first >= 0 );
+                    }
+            }
+        },
+
+        ID: function( elem, match ) {
+            return elem.nodeType === 1 && elem.getAttribute("id") === match;
+        },
+
+        TAG: function( elem, match ) {
+            return (match === "*" && elem.nodeType === 1) || !!elem.nodeName && elem.nodeName.toLowerCase() === match;
+        },
+
+        CLASS: function( elem, match ) {
+            return (" " + (elem.className || elem.getAttribute("class")) + " ")
+                .indexOf( match ) > -1;
+        },
+
+        ATTR: function( elem, match ) {
+            var name = match[1],
+                result = Sizzle.attr ?
+                    Sizzle.attr( elem, name ) :
+                    Expr.attrHandle[ name ] ?
+                    Expr.attrHandle[ name ]( elem ) :
+                    elem[ name ] != null ?
+                        elem[ name ] :
+                        elem.getAttribute( name ),
+                value = result + "",
+                type = match[2],
+                check = match[4];
+
+            return result == null ?
+                type === "!=" :
+                !type && Sizzle.attr ?
+                result != null :
+                type === "=" ?
+                value === check :
+                type === "*=" ?
+                value.indexOf(check) >= 0 :
+                type === "~=" ?
+                (" " + value + " ").indexOf(check) >= 0 :
+                !check ?
+                value && result !== false :
+                type === "!=" ?
+                value !== check :
+                type === "^=" ?
+                value.indexOf(check) === 0 :
+                type === "$=" ?
+                value.substr(value.length - check.length) === check :
+                type === "|=" ?
+                value === check || value.substr(0, check.length + 1) === check + "-" :
+                false;
+        },
+
+        POS: function( elem, match, i, array ) {
+            var name = match[2],
+                filter = Expr.setFilters[ name ];
+
+            if ( filter ) {
+                return filter( elem, i, match, array );
+            }
+        }
+    }
 };
 
 var origPOS = Expr.match.POS,
-	fescape = function(all, num){
-		return "\\" + (num - 0 + 1);
-	};
+    fescape = function(all, num){
+        return "\\" + (num - 0 + 1);
+    };
 
 for ( var type in Expr.match ) {
-	Expr.match[ type ] = new RegExp( Expr.match[ type ].source + (/(?![^\[]*\])(?![^\(]*\))/.source) );
-	Expr.leftMatch[ type ] = new RegExp( /(^(?:.|\r|\n)*?)/.source + Expr.match[ type ].source.replace(/\\(\d+)/g, fescape) );
+    Expr.match[ type ] = new RegExp( Expr.match[ type ].source + (/(?![^\[]*\])(?![^\(]*\))/.source) );
+    Expr.leftMatch[ type ] = new RegExp( /(^(?:.|\r|\n)*?)/.source + Expr.match[ type ].source.replace(/\\(\d+)/g, fescape) );
 }
 
 var makeArray = function( array, results ) {
-	array = Array.prototype.slice.call( array, 0 );
-
-	if ( results ) {
-		results.push.apply( results, array );
-		return results;
-	}
-	
-	return array;
+    array = Array.prototype.slice.call( array, 0 );
+
+    if ( results ) {
+        results.push.apply( results, array );
+        return results;
+    }
+
+    return array;
 };
 
 // Perform a simple check to determine if the browser is capable of
@@ -4774,515 +4774,515 @@ var makeArray = function( array, results ) {
 // Also verifies that the returned array holds DOM nodes
 // (which is not the case in the Blackberry browser)
 try {
-	Array.prototype.slice.call( document.documentElement.childNodes, 0 )[0].nodeType;
+    Array.prototype.slice.call( document.documentElement.childNodes, 0 )[0].nodeType;
 
 // Provide a fallback method if it does not work
 } catch( e ) {
-	makeArray = function( array, results ) {
-		var i = 0,
-			ret = results || [];
-
-		if ( toString.call(array) === "[object Array]" ) {
-			Array.prototype.push.apply( ret, array );
-
-		} else {
-			if ( typeof array.length === "number" ) {
-				for ( var l = array.length; i < l; i++ ) {
-					ret.push( array[i] );
-				}
-
-			} else {
-				for ( ; array[i]; i++ ) {
-					ret.push( array[i] );
-				}
-			}
-		}
-
-		return ret;
-	};
+    makeArray = function( array, results ) {
+        var i = 0,
+            ret = results || [];
+
+        if ( toString.call(array) === "[object Array]" ) {
+            Array.prototype.push.apply( ret, array );
+
+        } else {
+            if ( typeof array.length === "number" ) {
+                for ( var l = array.length; i < l; i++ ) {
+                    ret.push( array[i] );
+                }
+
+            } else {
+                for ( ; array[i]; i++ ) {
+                    ret.push( array[i] );
+                }
+            }
+        }
+
+        return ret;
+    };
 }
 
 var sortOrder, siblingCheck;
 
 if ( document.documentElement.compareDocumentPosition ) {
-	sortOrder = function( a, b ) {
-		if ( a === b ) {
-			hasDuplicate = true;
-			return 0;
-		}
+    sortOrder = function( a, b ) {
+        if ( a === b ) {
+            hasDuplicate = true;
+            return 0;
+        }
 
-		if ( !a.compareDocumentPosition || !b.compareDocumentPosition ) {
-			return a.compareDocumentPosition ? -1 : 1;
-		}
+        if ( !a.compareDocumentPosition || !b.compareDocumentPosition ) {
+            return a.compareDocumentPosition ? -1 : 1;
+        }
 
-		return a.compareDocumentPosition(b) & 4 ? -1 : 1;
-	};
+        return a.compareDocumentPosition(b) & 4 ? -1 : 1;
+    };
 
 } else {
-	sortOrder = function( a, b ) {
-		// The nodes are identical, we can exit early
-		if ( a === b ) {
-			hasDuplicate = true;
-			return 0;
-
-		// Fallback to using sourceIndex (in IE) if it's available on both nodes
-		} else if ( a.sourceIndex && b.sourceIndex ) {
-			return a.sourceIndex - b.sourceIndex;
-		}
-
-		var al, bl,
-			ap = [],
-			bp = [],
-			aup = a.parentNode,
-			bup = b.parentNode,
-			cur = aup;
-
-		// If the nodes are siblings (or identical) we can do a quick check
-		if ( aup === bup ) {
-			return siblingCheck( a, b );
-
-		// If no parents were found then the nodes are disconnected
-		} else if ( !aup ) {
-			return -1;
-
-		} else if ( !bup ) {
-			return 1;
-		}
-
-		// Otherwise they're somewhere else in the tree so we need
-		// to build up a full list of the parentNodes for comparison
-		while ( cur ) {
-			ap.unshift( cur );
-			cur = cur.parentNode;
-		}
-
-		cur = bup;
-
-		while ( cur ) {
-			bp.unshift( cur );
-			cur = cur.parentNode;
-		}
-
-		al = ap.length;
-		bl = bp.length;
-
-		// Start walking down the tree looking for a discrepancy
-		for ( var i = 0; i < al && i < bl; i++ ) {
-			if ( ap[i] !== bp[i] ) {
-				return siblingCheck( ap[i], bp[i] );
-			}
-		}
-
-		// We ended someplace up the tree so do a sibling check
-		return i === al ?
-			siblingCheck( a, bp[i], -1 ) :
-			siblingCheck( ap[i], b, 1 );
-	};
-
-	siblingCheck = function( a, b, ret ) {
-		if ( a === b ) {
-			return ret;
-		}
-
-		var cur = a.nextSibling;
-
-		while ( cur ) {
-			if ( cur === b ) {
-				return -1;
-			}
-
-			cur = cur.nextSibling;
-		}
-
-		return 1;
-	};
+    sortOrder = function( a, b ) {
+        // The nodes are identical, we can exit early
+        if ( a === b ) {
+            hasDuplicate = true;
+            return 0;
+
+        // Fallback to using sourceIndex (in IE) if it's available on both nodes
+        } else if ( a.sourceIndex && b.sourceIndex ) {
+            return a.sourceIndex - b.sourceIndex;
+        }
+
+        var al, bl,
+            ap = [],
+            bp = [],
+            aup = a.parentNode,
+            bup = b.parentNode,
+            cur = aup;
+
+        // If the nodes are siblings (or identical) we can do a quick check
+        if ( aup === bup ) {
+            return siblingCheck( a, b );
+
+        // If no parents were found then the nodes are disconnected
+        } else if ( !aup ) {
+            return -1;
+
+        } else if ( !bup ) {
+            return 1;
+        }
+
+        // Otherwise they're somewhere else in the tree so we need
+        // to build up a full list of the parentNodes for comparison
+        while ( cur ) {
+            ap.unshift( cur );
+            cur = cur.parentNode;
+        }
+
+        cur = bup;
+
+        while ( cur ) {
+            bp.unshift( cur );
+            cur = cur.parentNode;
+        }
+
+        al = ap.length;
+        bl = bp.length;
+
+        // Start walking down the tree looking for a discrepancy
+        for ( var i = 0; i < al && i < bl; i++ ) {
+            if ( ap[i] !== bp[i] ) {
+                return siblingCheck( ap[i], bp[i] );
+            }
+        }
+
+        // We ended someplace up the tree so do a sibling check
+        return i === al ?
+            siblingCheck( a, bp[i], -1 ) :
+            siblingCheck( ap[i], b, 1 );
+    };
+
+    siblingCheck = function( a, b, ret ) {
+        if ( a === b ) {
+            return ret;
+        }
+
+        var cur = a.nextSibling;
+
+        while ( cur ) {
+            if ( cur === b ) {
+                return -1;
+            }
+
+            cur = cur.nextSibling;
+        }
+
+        return 1;
+    };
 }
 
 // Check to see if the browser returns elements by name when
 // querying by getElementById (and provide a workaround)
 (function(){
-	// We're going to inject a fake input element with a specified name
-	var form = document.createElement("div"),
-		id = "script" + (new Date()).getTime(),
-		root = document.documentElement;
-
-	form.innerHTML = "";
-
-	// Inject it into the root element, check its status, and remove it quickly
-	root.insertBefore( form, root.firstChild );
-
-	// The workaround has to do additional checks after a getElementById
-	// Which slows things down for other browsers (hence the branching)
-	if ( document.getElementById( id ) ) {
-		Expr.find.ID = function( match, context, isXML ) {
-			if ( typeof context.getElementById !== "undefined" && !isXML ) {
-				var m = context.getElementById(match[1]);
-
-				return m ?
-					m.id === match[1] || typeof m.getAttributeNode !== "undefined" && m.getAttributeNode("id").nodeValue === match[1] ?
-						[m] :
-						undefined :
-					[];
-			}
-		};
-
-		Expr.filter.ID = function( elem, match ) {
-			var node = typeof elem.getAttributeNode !== "undefined" && elem.getAttributeNode("id");
-
-			return elem.nodeType === 1 && node && node.nodeValue === match;
-		};
-	}
-
-	root.removeChild( form );
-
-	// release memory in IE
-	root = form = null;
+    // We're going to inject a fake input element with a specified name
+    var form = document.createElement("div"),
+        id = "script" + (new Date()).getTime(),
+        root = document.documentElement;
+
+    form.innerHTML = "";
+
+    // Inject it into the root element, check its status, and remove it quickly
+    root.insertBefore( form, root.firstChild );
+
+    // The workaround has to do additional checks after a getElementById
+    // Which slows things down for other browsers (hence the branching)
+    if ( document.getElementById( id ) ) {
+        Expr.find.ID = function( match, context, isXML ) {
+            if ( typeof context.getElementById !== "undefined" && !isXML ) {
+                var m = context.getElementById(match[1]);
+
+                return m ?
+                    m.id === match[1] || typeof m.getAttributeNode !== "undefined" && m.getAttributeNode("id").nodeValue === match[1] ?
+                        [m] :
+                        undefined :
+                    [];
+            }
+        };
+
+        Expr.filter.ID = function( elem, match ) {
+            var node = typeof elem.getAttributeNode !== "undefined" && elem.getAttributeNode("id");
+
+            return elem.nodeType === 1 && node && node.nodeValue === match;
+        };
+    }
+
+    root.removeChild( form );
+
+    // release memory in IE
+    root = form = null;
 })();
 
 (function(){
-	// Check to see if the browser returns only elements
-	// when doing getElementsByTagName("*")
+    // Check to see if the browser returns only elements
+    // when doing getElementsByTagName("*")
 
-	// Create a fake element
-	var div = document.createElement("div");
-	div.appendChild( document.createComment("") );
+    // Create a fake element
+    var div = document.createElement("div");
+    div.appendChild( document.createComment("") );
 
-	// Make sure no comments are found
-	if ( div.getElementsByTagName("*").length > 0 ) {
-		Expr.find.TAG = function( match, context ) {
-			var results = context.getElementsByTagName( match[1] );
+    // Make sure no comments are found
+    if ( div.getElementsByTagName("*").length > 0 ) {
+        Expr.find.TAG = function( match, context ) {
+            var results = context.getElementsByTagName( match[1] );
 
-			// Filter out possible comments
-			if ( match[1] === "*" ) {
-				var tmp = [];
+            // Filter out possible comments
+            if ( match[1] === "*" ) {
+                var tmp = [];
 
-				for ( var i = 0; results[i]; i++ ) {
-					if ( results[i].nodeType === 1 ) {
-						tmp.push( results[i] );
-					}
-				}
+                for ( var i = 0; results[i]; i++ ) {
+                    if ( results[i].nodeType === 1 ) {
+                        tmp.push( results[i] );
+                    }
+                }
 
-				results = tmp;
-			}
+                results = tmp;
+            }
 
-			return results;
-		};
-	}
+            return results;
+        };
+    }
 
-	// Check to see if an attribute returns normalized href attributes
-	div.innerHTML = "";
+    // Check to see if an attribute returns normalized href attributes
+    div.innerHTML = "";
 
-	if ( div.firstChild && typeof div.firstChild.getAttribute !== "undefined" &&
-			div.firstChild.getAttribute("href") !== "#" ) {
+    if ( div.firstChild && typeof div.firstChild.getAttribute !== "undefined" &&
+            div.firstChild.getAttribute("href") !== "#" ) {
 
-		Expr.attrHandle.href = function( elem ) {
-			return elem.getAttribute( "href", 2 );
-		};
-	}
+        Expr.attrHandle.href = function( elem ) {
+            return elem.getAttribute( "href", 2 );
+        };
+    }
 
-	// release memory in IE
-	div = null;
+    // release memory in IE
+    div = null;
 })();
 
 if ( document.querySelectorAll ) {
-	(function(){
-		var oldSizzle = Sizzle,
-			div = document.createElement("div"),
-			id = "__sizzle__";
-
-		div.innerHTML = "
    ";
-
-		// Safari can't handle uppercase or unicode characters when
-		// in quirks mode.
-		if ( div.querySelectorAll && div.querySelectorAll(".TEST").length === 0 ) {
-			return;
-		}
-	
-		Sizzle = function( query, context, extra, seed ) {
-			context = context || document;
-
-			// Only use querySelectorAll on non-XML documents
-			// (ID selectors don't work in non-HTML documents)
-			if ( !seed && !Sizzle.isXML(context) ) {
-				// See if we find a selector to speed up
-				var match = /^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec( query );
-				
-				if ( match && (context.nodeType === 1 || context.nodeType === 9) ) {
-					// Speed-up: Sizzle("TAG")
-					if ( match[1] ) {
-						return makeArray( context.getElementsByTagName( query ), extra );
-					
-					// Speed-up: Sizzle(".CLASS")
-					} else if ( match[2] && Expr.find.CLASS && context.getElementsByClassName ) {
-						return makeArray( context.getElementsByClassName( match[2] ), extra );
-					}
-				}
-				
-				if ( context.nodeType === 9 ) {
-					// Speed-up: Sizzle("body")
-					// The body element only exists once, optimize finding it
-					if ( query === "body" && context.body ) {
-						return makeArray( [ context.body ], extra );
-						
-					// Speed-up: Sizzle("#ID")
-					} else if ( match && match[3] ) {
-						var elem = context.getElementById( match[3] );
-
-						// Check parentNode to catch when Blackberry 4.6 returns
-						// nodes that are no longer in the document #6963
-						if ( elem && elem.parentNode ) {
-							// Handle the case where IE and Opera return items
-							// by name instead of ID
-							if ( elem.id === match[3] ) {
-								return makeArray( [ elem ], extra );
-							}
-							
-						} else {
-							return makeArray( [], extra );
-						}
-					}
-					
-					try {
-						return makeArray( context.querySelectorAll(query), extra );
-					} catch(qsaError) {}
-
-				// qSA works strangely on Element-rooted queries
-				// We can work around this by specifying an extra ID on the root
-				// and working up from there (Thanks to Andrew Dupont for the technique)
-				// IE 8 doesn't work on object elements
-				} else if ( context.nodeType === 1 && context.nodeName.toLowerCase() !== "object" ) {
-					var oldContext = context,
-						old = context.getAttribute( "id" ),
-						nid = old || id,
-						hasParent = context.parentNode,
-						relativeHierarchySelector = /^\s*[+~]/.test( query );
-
-					if ( !old ) {
-						context.setAttribute( "id", nid );
-					} else {
-						nid = nid.replace( /'/g, "\\$&" );
-					}
-					if ( relativeHierarchySelector && hasParent ) {
-						context = context.parentNode;
-					}
-
-					try {
-						if ( !relativeHierarchySelector || hasParent ) {
-							return makeArray( context.querySelectorAll( "[id='" + nid + "'] " + query ), extra );
-						}
-
-					} catch(pseudoError) {
-					} finally {
-						if ( !old ) {
-							oldContext.removeAttribute( "id" );
-						}
-					}
-				}
-			}
-		
-			return oldSizzle(query, context, extra, seed);
-		};
-
-		for ( var prop in oldSizzle ) {
-			Sizzle[ prop ] = oldSizzle[ prop ];
-		}
-
-		// release memory in IE
-		div = null;
-	})();
+    (function(){
+        var oldSizzle = Sizzle,
+            div = document.createElement("div"),
+            id = "__sizzle__";
+
+        div.innerHTML = "
    ";
+
+        // Safari can't handle uppercase or unicode characters when
+        // in quirks mode.
+        if ( div.querySelectorAll && div.querySelectorAll(".TEST").length === 0 ) {
+            return;
+        }
+
+        Sizzle = function( query, context, extra, seed ) {
+            context = context || document;
+
+            // Only use querySelectorAll on non-XML documents
+            // (ID selectors don't work in non-HTML documents)
+            if ( !seed && !Sizzle.isXML(context) ) {
+                // See if we find a selector to speed up
+                var match = /^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec( query );
+
+                if ( match && (context.nodeType === 1 || context.nodeType === 9) ) {
+                    // Speed-up: Sizzle("TAG")
+                    if ( match[1] ) {
+                        return makeArray( context.getElementsByTagName( query ), extra );
+
+                    // Speed-up: Sizzle(".CLASS")
+                    } else if ( match[2] && Expr.find.CLASS && context.getElementsByClassName ) {
+                        return makeArray( context.getElementsByClassName( match[2] ), extra );
+                    }
+                }
+
+                if ( context.nodeType === 9 ) {
+                    // Speed-up: Sizzle("body")
+                    // The body element only exists once, optimize finding it
+                    if ( query === "body" && context.body ) {
+                        return makeArray( [ context.body ], extra );
+
+                    // Speed-up: Sizzle("#ID")
+                    } else if ( match && match[3] ) {
+                        var elem = context.getElementById( match[3] );
+
+                        // Check parentNode to catch when Blackberry 4.6 returns
+                        // nodes that are no longer in the document #6963
+                        if ( elem && elem.parentNode ) {
+                            // Handle the case where IE and Opera return items
+                            // by name instead of ID
+                            if ( elem.id === match[3] ) {
+                                return makeArray( [ elem ], extra );
+                            }
+
+                        } else {
+                            return makeArray( [], extra );
+                        }
+                    }
+
+                    try {
+                        return makeArray( context.querySelectorAll(query), extra );
+                    } catch(qsaError) {}
+
+                // qSA works strangely on Element-rooted queries
+                // We can work around this by specifying an extra ID on the root
+                // and working up from there (Thanks to Andrew Dupont for the technique)
+                // IE 8 doesn't work on object elements
+                } else if ( context.nodeType === 1 && context.nodeName.toLowerCase() !== "object" ) {
+                    var oldContext = context,
+                        old = context.getAttribute( "id" ),
+                        nid = old || id,
+                        hasParent = context.parentNode,
+                        relativeHierarchySelector = /^\s*[+~]/.test( query );
+
+                    if ( !old ) {
+                        context.setAttribute( "id", nid );
+                    } else {
+                        nid = nid.replace( /'/g, "\\$&" );
+                    }
+                    if ( relativeHierarchySelector && hasParent ) {
+                        context = context.parentNode;
+                    }
+
+                    try {
+                        if ( !relativeHierarchySelector || hasParent ) {
+                            return makeArray( context.querySelectorAll( "[id='" + nid + "'] " + query ), extra );
+                        }
+
+                    } catch(pseudoError) {
+                    } finally {
+                        if ( !old ) {
+                            oldContext.removeAttribute( "id" );
+                        }
+                    }
+                }
+            }
+
+            return oldSizzle(query, context, extra, seed);
+        };
+
+        for ( var prop in oldSizzle ) {
+            Sizzle[ prop ] = oldSizzle[ prop ];
+        }
+
+        // release memory in IE
+        div = null;
+    })();
 }
 
 (function(){
-	var html = document.documentElement,
-		matches = html.matchesSelector || html.mozMatchesSelector || html.webkitMatchesSelector || html.msMatchesSelector;
-
-	if ( matches ) {
-		// Check to see if it's possible to do matchesSelector
-		// on a disconnected node (IE 9 fails this)
-		var disconnectedMatch = !matches.call( document.createElement( "div" ), "div" ),
-			pseudoWorks = false;
-
-		try {
-			// This should fail with an exception
-			// Gecko does not error, returns false instead
-			matches.call( document.documentElement, "[test!='']:sizzle" );
-	
-		} catch( pseudoError ) {
-			pseudoWorks = true;
-		}
-
-		Sizzle.matchesSelector = function( node, expr ) {
-			// Make sure that attribute selectors are quoted
-			expr = expr.replace(/\=\s*([^'"\]]*)\s*\]/g, "='$1']");
-
-			if ( !Sizzle.isXML( node ) ) {
-				try { 
-					if ( pseudoWorks || !Expr.match.PSEUDO.test( expr ) && !/!=/.test( expr ) ) {
-						var ret = matches.call( node, expr );
-
-						// IE 9's matchesSelector returns false on disconnected nodes
-						if ( ret || !disconnectedMatch ||
-								// As well, disconnected nodes are said to be in a document
-								// fragment in IE 9, so check for that
-								node.document && node.document.nodeType !== 11 ) {
-							return ret;
-						}
-					}
-				} catch(e) {}
-			}
-
-			return Sizzle(expr, null, null, [node]).length > 0;
-		};
-	}
+    var html = document.documentElement,
+        matches = html.matchesSelector || html.mozMatchesSelector || html.webkitMatchesSelector || html.msMatchesSelector;
+
+    if ( matches ) {
+        // Check to see if it's possible to do matchesSelector
+        // on a disconnected node (IE 9 fails this)
+        var disconnectedMatch = !matches.call( document.createElement( "div" ), "div" ),
+            pseudoWorks = false;
+
+        try {
+            // This should fail with an exception
+            // Gecko does not error, returns false instead
+            matches.call( document.documentElement, "[test!='']:sizzle" );
+
+        } catch( pseudoError ) {
+            pseudoWorks = true;
+        }
+
+        Sizzle.matchesSelector = function( node, expr ) {
+            // Make sure that attribute selectors are quoted
+            expr = expr.replace(/\=\s*([^'"\]]*)\s*\]/g, "='$1']");
+
+            if ( !Sizzle.isXML( node ) ) {
+                try {
+                    if ( pseudoWorks || !Expr.match.PSEUDO.test( expr ) && !/!=/.test( expr ) ) {
+                        var ret = matches.call( node, expr );
+
+                        // IE 9's matchesSelector returns false on disconnected nodes
+                        if ( ret || !disconnectedMatch ||
+                                // As well, disconnected nodes are said to be in a document
+                                // fragment in IE 9, so check for that
+                                node.document && node.document.nodeType !== 11 ) {
+                            return ret;
+                        }
+                    }
+                } catch(e) {}
+            }
+
+            return Sizzle(expr, null, null, [node]).length > 0;
+        };
+    }
 })();
 
 (function(){
-	var div = document.createElement("div");
-
-	div.innerHTML = "
    ";
-
-	// Opera can't find a second classname (in 9.6)
-	// Also, make sure that getElementsByClassName actually exists
-	if ( !div.getElementsByClassName || div.getElementsByClassName("e").length === 0 ) {
-		return;
-	}
-
-	// Safari caches class attributes, doesn't catch changes (in 3.2)
-	div.lastChild.className = "e";
-
-	if ( div.getElementsByClassName("e").length === 1 ) {
-		return;
-	}
-	
-	Expr.order.splice(1, 0, "CLASS");
-	Expr.find.CLASS = function( match, context, isXML ) {
-		if ( typeof context.getElementsByClassName !== "undefined" && !isXML ) {
-			return context.getElementsByClassName(match[1]);
-		}
-	};
-
-	// release memory in IE
-	div = null;
+    var div = document.createElement("div");
+
+    div.innerHTML = "
    ";
+
+    // Opera can't find a second classname (in 9.6)
+    // Also, make sure that getElementsByClassName actually exists
+    if ( !div.getElementsByClassName || div.getElementsByClassName("e").length === 0 ) {
+        return;
+    }
+
+    // Safari caches class attributes, doesn't catch changes (in 3.2)
+    div.lastChild.className = "e";
+
+    if ( div.getElementsByClassName("e").length === 1 ) {
+        return;
+    }
+
+    Expr.order.splice(1, 0, "CLASS");
+    Expr.find.CLASS = function( match, context, isXML ) {
+        if ( typeof context.getElementsByClassName !== "undefined" && !isXML ) {
+            return context.getElementsByClassName(match[1]);
+        }
+    };
+
+    // release memory in IE
+    div = null;
 })();
 
 function dirNodeCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {
-	for ( var i = 0, l = checkSet.length; i < l; i++ ) {
-		var elem = checkSet[i];
+    for ( var i = 0, l = checkSet.length; i < l; i++ ) {
+        var elem = checkSet[i];
 
-		if ( elem ) {
-			var match = false;
+        if ( elem ) {
+            var match = false;
 
-			elem = elem[dir];
+            elem = elem[dir];
 
-			while ( elem ) {
-				if ( elem[ expando ] === doneName ) {
-					match = checkSet[elem.sizset];
-					break;
-				}
+            while ( elem ) {
+                if ( elem[ expando ] === doneName ) {
+                    match = checkSet[elem.sizset];
+                    break;
+                }
 
-				if ( elem.nodeType === 1 && !isXML ){
-					elem[ expando ] = doneName;
-					elem.sizset = i;
-				}
+                if ( elem.nodeType === 1 && !isXML ){
+                    elem[ expando ] = doneName;
+                    elem.sizset = i;
+                }
 
-				if ( elem.nodeName.toLowerCase() === cur ) {
-					match = elem;
-					break;
-				}
+                if ( elem.nodeName.toLowerCase() === cur ) {
+                    match = elem;
+                    break;
+                }
 
-				elem = elem[dir];
-			}
+                elem = elem[dir];
+            }
 
-			checkSet[i] = match;
-		}
-	}
+            checkSet[i] = match;
+        }
+    }
 }
 
 function dirCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {
-	for ( var i = 0, l = checkSet.length; i < l; i++ ) {
-		var elem = checkSet[i];
-
-		if ( elem ) {
-			var match = false;
-			
-			elem = elem[dir];
-
-			while ( elem ) {
-				if ( elem[ expando ] === doneName ) {
-					match = checkSet[elem.sizset];
-					break;
-				}
-
-				if ( elem.nodeType === 1 ) {
-					if ( !isXML ) {
-						elem[ expando ] = doneName;
-						elem.sizset = i;
-					}
-
-					if ( typeof cur !== "string" ) {
-						if ( elem === cur ) {
-							match = true;
-							break;
-						}
-
-					} else if ( Sizzle.filter( cur, [elem] ).length > 0 ) {
-						match = elem;
-						break;
-					}
-				}
-
-				elem = elem[dir];
-			}
-
-			checkSet[i] = match;
-		}
-	}
+    for ( var i = 0, l = checkSet.length; i < l; i++ ) {
+        var elem = checkSet[i];
+
+        if ( elem ) {
+            var match = false;
+
+            elem = elem[dir];
+
+            while ( elem ) {
+                if ( elem[ expando ] === doneName ) {
+                    match = checkSet[elem.sizset];
+                    break;
+                }
+
+                if ( elem.nodeType === 1 ) {
+                    if ( !isXML ) {
+                        elem[ expando ] = doneName;
+                        elem.sizset = i;
+                    }
+
+                    if ( typeof cur !== "string" ) {
+                        if ( elem === cur ) {
+                            match = true;
+                            break;
+                        }
+
+                    } else if ( Sizzle.filter( cur, [elem] ).length > 0 ) {
+                        match = elem;
+                        break;
+                    }
+                }
+
+                elem = elem[dir];
+            }
+
+            checkSet[i] = match;
+        }
+    }
 }
 
 if ( document.documentElement.contains ) {
-	Sizzle.contains = function( a, b ) {
-		return a !== b && (a.contains ? a.contains(b) : true);
-	};
+    Sizzle.contains = function( a, b ) {
+        return a !== b && (a.contains ? a.contains(b) : true);
+    };
 
 } else if ( document.documentElement.compareDocumentPosition ) {
-	Sizzle.contains = function( a, b ) {
-		return !!(a.compareDocumentPosition(b) & 16);
-	};
+    Sizzle.contains = function( a, b ) {
+        return !!(a.compareDocumentPosition(b) & 16);
+    };
 
 } else {
-	Sizzle.contains = function() {
-		return false;
-	};
+    Sizzle.contains = function() {
+        return false;
+    };
 }
 
 Sizzle.isXML = function( elem ) {
-	// documentElement is verified for cases where it doesn't yet exist
-	// (such as loading iframes in IE - #4833) 
-	var documentElement = (elem ? elem.ownerDocument || elem : 0).documentElement;
+    // documentElement is verified for cases where it doesn't yet exist
+    // (such as loading iframes in IE - #4833)
+    var documentElement = (elem ? elem.ownerDocument || elem : 0).documentElement;
 
-	return documentElement ? documentElement.nodeName !== "HTML" : false;
+    return documentElement ? documentElement.nodeName !== "HTML" : false;
 };
 
 var posProcess = function( selector, context, seed ) {
-	var match,
-		tmpSet = [],
-		later = "",
-		root = context.nodeType ? [context] : context;
+    var match,
+        tmpSet = [],
+        later = "",
+        root = context.nodeType ? [context] : context;
 
-	// Position selectors must be done after the filter
-	// And so must :not(positional) so we move all PSEUDOs to the end
-	while ( (match = Expr.match.PSEUDO.exec( selector )) ) {
-		later += match[0];
-		selector = selector.replace( Expr.match.PSEUDO, "" );
-	}
+    // Position selectors must be done after the filter
+    // And so must :not(positional) so we move all PSEUDOs to the end
+    while ( (match = Expr.match.PSEUDO.exec( selector )) ) {
+        later += match[0];
+        selector = selector.replace( Expr.match.PSEUDO, "" );
+    }
 
-	selector = Expr.relative[selector] ? selector + "*" : selector;
+    selector = Expr.relative[selector] ? selector + "*" : selector;
 
-	for ( var i = 0, l = root.length; i < l; i++ ) {
-		Sizzle( selector, root[i], tmpSet, seed );
-	}
+    for ( var i = 0, l = root.length; i < l; i++ ) {
+        Sizzle( selector, root[i], tmpSet, seed );
+    }
 
-	return Sizzle.filter( later, tmpSet );
+    return Sizzle.filter( later, tmpSet );
 };
 
 // EXPOSE
@@ -5302,369 +5302,369 @@ jQuery.contains = Sizzle.contains;
 
 
 var runtil = /Until$/,
-	rparentsprev = /^(?:parents|prevUntil|prevAll)/,
-	// Note: This RegExp should be improved, or likely pulled from Sizzle
-	rmultiselector = /,/,
-	isSimple = /^.[^:#\[\.,]*$/,
-	slice = Array.prototype.slice,
-	POS = jQuery.expr.match.POS,
-	// methods guaranteed to produce a unique set when starting from a unique set
-	guaranteedUnique = {
-		children: true,
-		contents: true,
-		next: true,
-		prev: true
-	};
+    rparentsprev = /^(?:parents|prevUntil|prevAll)/,
+    // Note: This RegExp should be improved, or likely pulled from Sizzle
+    rmultiselector = /,/,
+    isSimple = /^.[^:#\[\.,]*$/,
+    slice = Array.prototype.slice,
+    POS = jQuery.expr.match.POS,
+    // methods guaranteed to produce a unique set when starting from a unique set
+    guaranteedUnique = {
+        children: true,
+        contents: true,
+        next: true,
+        prev: true
+    };
 
 jQuery.fn.extend({
-	find: function( selector ) {
-		var self = this,
-			i, l;
-
-		if ( typeof selector !== "string" ) {
-			return jQuery( selector ).filter(function() {
-				for ( i = 0, l = self.length; i < l; i++ ) {
-					if ( jQuery.contains( self[ i ], this ) ) {
-						return true;
-					}
-				}
-			});
-		}
-
-		var ret = this.pushStack( "", "find", selector ),
-			length, n, r;
-
-		for ( i = 0, l = this.length; i < l; i++ ) {
-			length = ret.length;
-			jQuery.find( selector, this[i], ret );
-
-			if ( i > 0 ) {
-				// Make sure that the results are unique
-				for ( n = length; n < ret.length; n++ ) {
-					for ( r = 0; r < length; r++ ) {
-						if ( ret[r] === ret[n] ) {
-							ret.splice(n--, 1);
-							break;
-						}
-					}
-				}
-			}
-		}
-
-		return ret;
-	},
-
-	has: function( target ) {
-		var targets = jQuery( target );
-		return this.filter(function() {
-			for ( var i = 0, l = targets.length; i < l; i++ ) {
-				if ( jQuery.contains( this, targets[i] ) ) {
-					return true;
-				}
-			}
-		});
-	},
-
-	not: function( selector ) {
-		return this.pushStack( winnow(this, selector, false), "not", selector);
-	},
-
-	filter: function( selector ) {
-		return this.pushStack( winnow(this, selector, true), "filter", selector );
-	},
-
-	is: function( selector ) {
-		return !!selector && ( 
-			typeof selector === "string" ?
-				// If this is a positional selector, check membership in the returned set
-				// so $("p:first").is("p:last") won't return true for a doc with two "p".
-				POS.test( selector ) ? 
-					jQuery( selector, this.context ).index( this[0] ) >= 0 :
-					jQuery.filter( selector, this ).length > 0 :
-				this.filter( selector ).length > 0 );
-	},
-
-	closest: function( selectors, context ) {
-		var ret = [], i, l, cur = this[0];
-		
-		// Array (deprecated as of jQuery 1.7)
-		if ( jQuery.isArray( selectors ) ) {
-			var level = 1;
-
-			while ( cur && cur.ownerDocument && cur !== context ) {
-				for ( i = 0; i < selectors.length; i++ ) {
-
-					if ( jQuery( cur ).is( selectors[ i ] ) ) {
-						ret.push({ selector: selectors[ i ], elem: cur, level: level });
-					}
-				}
-
-				cur = cur.parentNode;
-				level++;
-			}
-
-			return ret;
-		}
-
-		// String
-		var pos = POS.test( selectors ) || typeof selectors !== "string" ?
-				jQuery( selectors, context || this.context ) :
-				0;
-
-		for ( i = 0, l = this.length; i < l; i++ ) {
-			cur = this[i];
-
-			while ( cur ) {
-				if ( pos ? pos.index(cur) > -1 : jQuery.find.matchesSelector(cur, selectors) ) {
-					ret.push( cur );
-					break;
-
-				} else {
-					cur = cur.parentNode;
-					if ( !cur || !cur.ownerDocument || cur === context || cur.nodeType === 11 ) {
-						break;
-					}
-				}
-			}
-		}
-
-		ret = ret.length > 1 ? jQuery.unique( ret ) : ret;
-
-		return this.pushStack( ret, "closest", selectors );
-	},
-
-	// Determine the position of an element within
-	// the matched set of elements
-	index: function( elem ) {
-
-		// No argument, return index in parent
-		if ( !elem ) {
-			return ( this[0] && this[0].parentNode ) ? this.prevAll().length : -1;
-		}
-
-		// index in selector
-		if ( typeof elem === "string" ) {
-			return jQuery.inArray( this[0], jQuery( elem ) );
-		}
-
-		// Locate the position of the desired element
-		return jQuery.inArray(
-			// If it receives a jQuery object, the first element is used
-			elem.jquery ? elem[0] : elem, this );
-	},
-
-	add: function( selector, context ) {
-		var set = typeof selector === "string" ?
-				jQuery( selector, context ) :
-				jQuery.makeArray( selector && selector.nodeType ? [ selector ] : selector ),
-			all = jQuery.merge( this.get(), set );
-
-		return this.pushStack( isDisconnected( set[0] ) || isDisconnected( all[0] ) ?
-			all :
-			jQuery.unique( all ) );
-	},
-
-	andSelf: function() {
-		return this.add( this.prevObject );
-	}
+    find: function( selector ) {
+        var self = this,
+            i, l;
+
+        if ( typeof selector !== "string" ) {
+            return jQuery( selector ).filter(function() {
+                for ( i = 0, l = self.length; i < l; i++ ) {
+                    if ( jQuery.contains( self[ i ], this ) ) {
+                        return true;
+                    }
+                }
+            });
+        }
+
+        var ret = this.pushStack( "", "find", selector ),
+            length, n, r;
+
+        for ( i = 0, l = this.length; i < l; i++ ) {
+            length = ret.length;
+            jQuery.find( selector, this[i], ret );
+
+            if ( i > 0 ) {
+                // Make sure that the results are unique
+                for ( n = length; n < ret.length; n++ ) {
+                    for ( r = 0; r < length; r++ ) {
+                        if ( ret[r] === ret[n] ) {
+                            ret.splice(n--, 1);
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+
+        return ret;
+    },
+
+    has: function( target ) {
+        var targets = jQuery( target );
+        return this.filter(function() {
+            for ( var i = 0, l = targets.length; i < l; i++ ) {
+                if ( jQuery.contains( this, targets[i] ) ) {
+                    return true;
+                }
+            }
+        });
+    },
+
+    not: function( selector ) {
+        return this.pushStack( winnow(this, selector, false), "not", selector);
+    },
+
+    filter: function( selector ) {
+        return this.pushStack( winnow(this, selector, true), "filter", selector );
+    },
+
+    is: function( selector ) {
+        return !!selector && (
+            typeof selector === "string" ?
+                // If this is a positional selector, check membership in the returned set
+                // so $("p:first").is("p:last") won't return true for a doc with two "p".
+                POS.test( selector ) ?
+                    jQuery( selector, this.context ).index( this[0] ) >= 0 :
+                    jQuery.filter( selector, this ).length > 0 :
+                this.filter( selector ).length > 0 );
+    },
+
+    closest: function( selectors, context ) {
+        var ret = [], i, l, cur = this[0];
+
+        // Array (deprecated as of jQuery 1.7)
+        if ( jQuery.isArray( selectors ) ) {
+            var level = 1;
+
+            while ( cur && cur.ownerDocument && cur !== context ) {
+                for ( i = 0; i < selectors.length; i++ ) {
+
+                    if ( jQuery( cur ).is( selectors[ i ] ) ) {
+                        ret.push({ selector: selectors[ i ], elem: cur, level: level });
+                    }
+                }
+
+                cur = cur.parentNode;
+                level++;
+            }
+
+            return ret;
+        }
+
+        // String
+        var pos = POS.test( selectors ) || typeof selectors !== "string" ?
+                jQuery( selectors, context || this.context ) :
+                0;
+
+        for ( i = 0, l = this.length; i < l; i++ ) {
+            cur = this[i];
+
+            while ( cur ) {
+                if ( pos ? pos.index(cur) > -1 : jQuery.find.matchesSelector(cur, selectors) ) {
+                    ret.push( cur );
+                    break;
+
+                } else {
+                    cur = cur.parentNode;
+                    if ( !cur || !cur.ownerDocument || cur === context || cur.nodeType === 11 ) {
+                        break;
+                    }
+                }
+            }
+        }
+
+        ret = ret.length > 1 ? jQuery.unique( ret ) : ret;
+
+        return this.pushStack( ret, "closest", selectors );
+    },
+
+    // Determine the position of an element within
+    // the matched set of elements
+    index: function( elem ) {
+
+        // No argument, return index in parent
+        if ( !elem ) {
+            return ( this[0] && this[0].parentNode ) ? this.prevAll().length : -1;
+        }
+
+        // index in selector
+        if ( typeof elem === "string" ) {
+            return jQuery.inArray( this[0], jQuery( elem ) );
+        }
+
+        // Locate the position of the desired element
+        return jQuery.inArray(
+            // If it receives a jQuery object, the first element is used
+            elem.jquery ? elem[0] : elem, this );
+    },
+
+    add: function( selector, context ) {
+        var set = typeof selector === "string" ?
+                jQuery( selector, context ) :
+                jQuery.makeArray( selector && selector.nodeType ? [ selector ] : selector ),
+            all = jQuery.merge( this.get(), set );
+
+        return this.pushStack( isDisconnected( set[0] ) || isDisconnected( all[0] ) ?
+            all :
+            jQuery.unique( all ) );
+    },
+
+    andSelf: function() {
+        return this.add( this.prevObject );
+    }
 });
 
 // A painfully simple check to see if an element is disconnected
 // from a document (should be improved, where feasible).
 function isDisconnected( node ) {
-	return !node || !node.parentNode || node.parentNode.nodeType === 11;
+    return !node || !node.parentNode || node.parentNode.nodeType === 11;
 }
 
 jQuery.each({
-	parent: function( elem ) {
-		var parent = elem.parentNode;
-		return parent && parent.nodeType !== 11 ? parent : null;
-	},
-	parents: function( elem ) {
-		return jQuery.dir( elem, "parentNode" );
-	},
-	parentsUntil: function( elem, i, until ) {
-		return jQuery.dir( elem, "parentNode", until );
-	},
-	next: function( elem ) {
-		return jQuery.nth( elem, 2, "nextSibling" );
-	},
-	prev: function( elem ) {
-		return jQuery.nth( elem, 2, "previousSibling" );
-	},
-	nextAll: function( elem ) {
-		return jQuery.dir( elem, "nextSibling" );
-	},
-	prevAll: function( elem ) {
-		return jQuery.dir( elem, "previousSibling" );
-	},
-	nextUntil: function( elem, i, until ) {
-		return jQuery.dir( elem, "nextSibling", until );
-	},
-	prevUntil: function( elem, i, until ) {
-		return jQuery.dir( elem, "previousSibling", until );
-	},
-	siblings: function( elem ) {
-		return jQuery.sibling( elem.parentNode.firstChild, elem );
-	},
-	children: function( elem ) {
-		return jQuery.sibling( elem.firstChild );
-	},
-	contents: function( elem ) {
-		return jQuery.nodeName( elem, "iframe" ) ?
-			elem.contentDocument || elem.contentWindow.document :
-			jQuery.makeArray( elem.childNodes );
-	}
+    parent: function( elem ) {
+        var parent = elem.parentNode;
+        return parent && parent.nodeType !== 11 ? parent : null;
+    },
+    parents: function( elem ) {
+        return jQuery.dir( elem, "parentNode" );
+    },
+    parentsUntil: function( elem, i, until ) {
+        return jQuery.dir( elem, "parentNode", until );
+    },
+    next: function( elem ) {
+        return jQuery.nth( elem, 2, "nextSibling" );
+    },
+    prev: function( elem ) {
+        return jQuery.nth( elem, 2, "previousSibling" );
+    },
+    nextAll: function( elem ) {
+        return jQuery.dir( elem, "nextSibling" );
+    },
+    prevAll: function( elem ) {
+        return jQuery.dir( elem, "previousSibling" );
+    },
+    nextUntil: function( elem, i, until ) {
+        return jQuery.dir( elem, "nextSibling", until );
+    },
+    prevUntil: function( elem, i, until ) {
+        return jQuery.dir( elem, "previousSibling", until );
+    },
+    siblings: function( elem ) {
+        return jQuery.sibling( elem.parentNode.firstChild, elem );
+    },
+    children: function( elem ) {
+        return jQuery.sibling( elem.firstChild );
+    },
+    contents: function( elem ) {
+        return jQuery.nodeName( elem, "iframe" ) ?
+            elem.contentDocument || elem.contentWindow.document :
+            jQuery.makeArray( elem.childNodes );
+    }
 }, function( name, fn ) {
-	jQuery.fn[ name ] = function( until, selector ) {
-		var ret = jQuery.map( this, fn, until );
+    jQuery.fn[ name ] = function( until, selector ) {
+        var ret = jQuery.map( this, fn, until );
 
-		if ( !runtil.test( name ) ) {
-			selector = until;
-		}
+        if ( !runtil.test( name ) ) {
+            selector = until;
+        }
 
-		if ( selector && typeof selector === "string" ) {
-			ret = jQuery.filter( selector, ret );
-		}
+        if ( selector && typeof selector === "string" ) {
+            ret = jQuery.filter( selector, ret );
+        }
 
-		ret = this.length > 1 && !guaranteedUnique[ name ] ? jQuery.unique( ret ) : ret;
+        ret = this.length > 1 && !guaranteedUnique[ name ] ? jQuery.unique( ret ) : ret;
 
-		if ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {
-			ret = ret.reverse();
-		}
+        if ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {
+            ret = ret.reverse();
+        }
 
-		return this.pushStack( ret, name, slice.call( arguments ).join(",") );
-	};
+        return this.pushStack( ret, name, slice.call( arguments ).join(",") );
+    };
 });
 
 jQuery.extend({
-	filter: function( expr, elems, not ) {
-		if ( not ) {
-			expr = ":not(" + expr + ")";
-		}
-
-		return elems.length === 1 ?
-			jQuery.find.matchesSelector(elems[0], expr) ? [ elems[0] ] : [] :
-			jQuery.find.matches(expr, elems);
-	},
-
-	dir: function( elem, dir, until ) {
-		var matched = [],
-			cur = elem[ dir ];
-
-		while ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) {
-			if ( cur.nodeType === 1 ) {
-				matched.push( cur );
-			}
-			cur = cur[dir];
-		}
-		return matched;
-	},
-
-	nth: function( cur, result, dir, elem ) {
-		result = result || 1;
-		var num = 0;
-
-		for ( ; cur; cur = cur[dir] ) {
-			if ( cur.nodeType === 1 && ++num === result ) {
-				break;
-			}
-		}
-
-		return cur;
-	},
-
-	sibling: function( n, elem ) {
-		var r = [];
-
-		for ( ; n; n = n.nextSibling ) {
-			if ( n.nodeType === 1 && n !== elem ) {
-				r.push( n );
-			}
-		}
-
-		return r;
-	}
+    filter: function( expr, elems, not ) {
+        if ( not ) {
+            expr = ":not(" + expr + ")";
+        }
+
+        return elems.length === 1 ?
+            jQuery.find.matchesSelector(elems[0], expr) ? [ elems[0] ] : [] :
+            jQuery.find.matches(expr, elems);
+    },
+
+    dir: function( elem, dir, until ) {
+        var matched = [],
+            cur = elem[ dir ];
+
+        while ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) {
+            if ( cur.nodeType === 1 ) {
+                matched.push( cur );
+            }
+            cur = cur[dir];
+        }
+        return matched;
+    },
+
+    nth: function( cur, result, dir, elem ) {
+        result = result || 1;
+        var num = 0;
+
+        for ( ; cur; cur = cur[dir] ) {
+            if ( cur.nodeType === 1 && ++num === result ) {
+                break;
+            }
+        }
+
+        return cur;
+    },
+
+    sibling: function( n, elem ) {
+        var r = [];
+
+        for ( ; n; n = n.nextSibling ) {
+            if ( n.nodeType === 1 && n !== elem ) {
+                r.push( n );
+            }
+        }
+
+        return r;
+    }
 });
 
 // Implement the identical functionality for filter and not
 function winnow( elements, qualifier, keep ) {
 
-	// Can't pass null or undefined to indexOf in Firefox 4
-	// Set to 0 to skip string check
-	qualifier = qualifier || 0;
-
-	if ( jQuery.isFunction( qualifier ) ) {
-		return jQuery.grep(elements, function( elem, i ) {
-			var retVal = !!qualifier.call( elem, i, elem );
-			return retVal === keep;
-		});
-
-	} else if ( qualifier.nodeType ) {
-		return jQuery.grep(elements, function( elem, i ) {
-			return ( elem === qualifier ) === keep;
-		});
-
-	} else if ( typeof qualifier === "string" ) {
-		var filtered = jQuery.grep(elements, function( elem ) {
-			return elem.nodeType === 1;
-		});
-
-		if ( isSimple.test( qualifier ) ) {
-			return jQuery.filter(qualifier, filtered, !keep);
-		} else {
-			qualifier = jQuery.filter( qualifier, filtered );
-		}
-	}
-
-	return jQuery.grep(elements, function( elem, i ) {
-		return ( jQuery.inArray( elem, qualifier ) >= 0 ) === keep;
-	});
+    // Can't pass null or undefined to indexOf in Firefox 4
+    // Set to 0 to skip string check
+    qualifier = qualifier || 0;
+
+    if ( jQuery.isFunction( qualifier ) ) {
+        return jQuery.grep(elements, function( elem, i ) {
+            var retVal = !!qualifier.call( elem, i, elem );
+            return retVal === keep;
+        });
+
+    } else if ( qualifier.nodeType ) {
+        return jQuery.grep(elements, function( elem, i ) {
+            return ( elem === qualifier ) === keep;
+        });
+
+    } else if ( typeof qualifier === "string" ) {
+        var filtered = jQuery.grep(elements, function( elem ) {
+            return elem.nodeType === 1;
+        });
+
+        if ( isSimple.test( qualifier ) ) {
+            return jQuery.filter(qualifier, filtered, !keep);
+        } else {
+            qualifier = jQuery.filter( qualifier, filtered );
+        }
+    }
+
+    return jQuery.grep(elements, function( elem, i ) {
+        return ( jQuery.inArray( elem, qualifier ) >= 0 ) === keep;
+    });
 }
 
 
 
 
 function createSafeFragment( document ) {
-	var list = nodeNames.split( "|" ),
-	safeFrag = document.createDocumentFragment();
-
-	if ( safeFrag.createElement ) {
-		while ( list.length ) {
-			safeFrag.createElement(
-				list.pop()
-			);
-		}
-	}
-	return safeFrag;
+    var list = nodeNames.split( "|" ),
+    safeFrag = document.createDocumentFragment();
+
+    if ( safeFrag.createElement ) {
+        while ( list.length ) {
+            safeFrag.createElement(
+                list.pop()
+            );
+        }
+    }
+    return safeFrag;
 }
 
 var nodeNames = "abbr|article|aside|audio|canvas|datalist|details|figcaption|figure|footer|" +
-		"header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",
-	rinlinejQuery = / jQuery\d+="(?:\d+|null)"/g,
-	rleadingWhitespace = /^\s+/,
-	rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,
-	rtagName = /<([\w:]+)/,
-	rtbody = /", "" ],
-		legend: [ 1, "
    ", "
    " ],
-		thead: [ 1, "", "
    " ],
-		tr: [ 2, "", "
    " ],
-		td: [ 3, "", "
    " ],
-		col: [ 2, "", "
    " ],
-		area: [ 1, "", "" ],
-		_default: [ 0, "", "" ]
-	},
-	safeFragment = createSafeFragment( document );
+        "header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",
+    rinlinejQuery = / jQuery\d+="(?:\d+|null)"/g,
+    rleadingWhitespace = /^\s+/,
+    rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,
+    rtagName = /<([\w:]+)/,
+    rtbody = /", "" ],
+        legend: [ 1, "
    ", "
    " ],
+        thead: [ 1, "", "
    " ],
+        tr: [ 2, "", "
    " ],
+        td: [ 3, "", "
    " ],
+        col: [ 2, "", "
    " ],
+        area: [ 1, "", "" ],
+        _default: [ 0, "", "" ]
+    },
+    safeFragment = createSafeFragment( document );
 
 wrapMap.optgroup = wrapMap.option;
 wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
@@ -5672,1220 +5672,1220 @@ wrapMap.th = wrapMap.td;
 
 // IE can't serialize  and 
diff --git a/tools/unit2.js b/tools/unit2.js
index b2704f5..c8bdd4a 100644
--- a/tools/unit2.js
+++ b/tools/unit2.js
@@ -1,9 +1,9 @@
-if(typeof console === "undefined") console = { 
-    log: function() { 
-        var k; 
-        for(k=0;k0) { write(' '); } 
-            write(arguments[k]); } 
+if(typeof console === "undefined") console = {
+    log: function() {
+        var k;
+        for(k=0;k0) { write(' '); }
+            write(arguments[k]); }
         write('\n');
         if(typeof system !== "undefined") { system.stdout.flush(); }
     }
diff --git a/tools/workshop.html b/tools/workshop.html
index 93075cd..68027b7 100644
--- a/tools/workshop.html
+++ b/tools/workshop.html
@@ -32,11 +32,11 @@
             user-select: none;
         }
         div.input,div.output {
-            margin-left: 30px; 
+            margin-left: 30px;
             margin-right: 15px;
             margin-top: 0px;
             margin-bottom: 0px;
-            position: relative;            
+            position: relative;
             margin: 0px;
             padding: 0px;
             border: 0px;
@@ -91,8 +91,8 @@
 
    
 
    
 
 
 
@@ -105,7 +105,7 @@
     
    
         
    
         
    
-        
+
         
    
         ↩
         
    
@@ -131,61 +131,61 @@
 
 if(_retarded) {
     _queue = [];
-	_onmessage = function(ev) { _queue.push(ev); }
-	_loaded = 0;
-	window.Worker = function(f) {
-		var worker = this;
-		worker.queue = [];
-		worker.onmessage = function(ev) {};
-		worker.postMessage = function(ev) { _onmessage({data: ev}); };
-		var scr = document.createElement('script');
-		scr.src = f;
-		scr.type = 'text/javascript';
+    _onmessage = function(ev) { _queue.push(ev); }
+    _loaded = 0;
+    window.Worker = function(f) {
+        var worker = this;
+        worker.queue = [];
+        worker.onmessage = function(ev) {};
+        worker.postMessage = function(ev) { _onmessage({data: ev}); };
+        var scr = document.createElement('script');
+        scr.src = f;
+        scr.type = 'text/javascript';
         scr.onreadystatechange = function () {
             var k;
             if (scr.readyState == 'loaded' || scr.readyState == 'complete') {
                 for(k=0;k<_queue.length;k++) { _onmessage(_queue[k]); }
             }
         }
-		document.getElementsByTagName('head')[0].appendChild(scr);
-		workerPostMessage = function(ev) { worker.onmessage({data: ev}); }
-	}
-	importScripts = function(z) {
-	    var scr = document.createElement('script');
+        document.getElementsByTagName('head')[0].appendChild(scr);
+        workerPostMessage = function(ev) { worker.onmessage({data: ev}); }
+    }
+    importScripts = function(z) {
+        var scr = document.createElement('script');
         scr.src = z;
         scr.type = 'text/javascript';
         document.getElementsByTagName('head')[0].appendChild(scr);
-	};
+    };
 }
 var workshop = (function () {
 
 function resize(input) {
-	if(input.scrollHeight > input.clientHeight) {
-		input.style.height = (input.scrollHeight+10)+"px";
-	}
+    if(input.scrollHeight > input.clientHeight) {
+        input.style.height = (input.scrollHeight+10)+"px";
+    }
 }
 
 function elementPos(e){
-	var x = 0, y = 0, dx = e.offsetWidth, dy = e.offsetHeight;
+    var x = 0, y = 0, dx = e.offsetWidth, dy = e.offsetHeight;
     while(e !== null){
-    	x += e.offsetLeft;
-    	y += e.offsetTop;
-    	e = e.offsetParent;
-  	}
-  	return {x:x, y:y, dx:dx, dy:dy};
+        x += e.offsetLeft;
+        y += e.offsetTop;
+        e = e.offsetParent;
+    }
+    return {x:x, y:y, dx:dx, dy:dy};
 }
 
 function checkpos(e) {
-	var foo = elementPos(e);
-	var y = window.pageYOffset, dy = window.innerHeight;
-	if(foo.y < y+10 || foo.y+foo.dy > y+dy-10) {
-		window.scrollTo(window.pageXOffset,Math.max(0,Math.round(foo.y-0.5*dy)));
-	}	
+    var foo = elementPos(e);
+    var y = window.pageYOffset, dy = window.innerHeight;
+    if(foo.y < y+10 || foo.y+foo.dy > y+dy-10) {
+        window.scrollTo(window.pageXOffset,Math.max(0,Math.round(foo.y-0.5*dy)));
+    }
 }
 
 function myfocus(e) {
-	checkpos(e);
-	e.focus();
+    checkpos(e);
+    e.focus();
 }
 
 var savedata;
@@ -199,76 +199,76 @@
 var plotcount = 0;
 
 function plotit(plotid,x) {
-	var k;
+    var k;
     try {
-		if(typeof x.s === "object") $('#'+plotid).css(x.s);
-		$.plot($("#"+plotid), x.p, x.o);
+        if(typeof x.s === "object") $('#'+plotid).css(x.s);
+        $.plot($("#"+plotid), x.p, x.o);
     } catch(e) {
-		var _foo = e.toString();
-       	if(typeof e.stack !== "undefined" && typeof e.stack.toString !== "undefined") {
-       		_foo += "\n\n"+e.stack.toString();
-       	}
-       	_foo = _foo.replace(/&/g,'&').replace(/>/g,'>').replace(//g,'>').replace(/
    ';
-		(function () { 
-			setTimeout(function () { 
-				plotit(plotid,x); 
-				setTimeout(function () { 
-					outputChanged(x.k,x); 
-				},0); 
-			},0); 
-		}());
-		clear[x.k] = false;
-		return;
-	} 
-	else { 
-		y.innerHTML += x.o;
-		(function () {
-			setTimeout(function() { 
-				outputChanged(x.k,x.o); },0) 
-			}());
-		clear[x.k] = false;
-	}
-	if(y.innerHTML === '') { y.innerHTML = ' '; clear[x.k] = true; }
+    var x = JSON.parse(ev.data);
+    var y = $('#out_'+x.k.toString())[0];
+    if(clear[x.k]) { y.innerHTML = ''; savedata.outputs[_indexOf(divorder,x.k)] = []; }
+    if(typeof x.p !== "undefined") {
+        var plotid = "plot_"+plotcount.toString();
+        plotcount++;
+        y.innerHTML += '
    ';
+        (function () {
+            setTimeout(function () {
+                plotit(plotid,x);
+                setTimeout(function () {
+                    outputChanged(x.k,x);
+                },0);
+            },0);
+        }());
+        clear[x.k] = false;
+        return;
+    }
+    else {
+        y.innerHTML += x.o;
+        (function () {
+            setTimeout(function() {
+                outputChanged(x.k,x.o); },0)
+            }());
+        clear[x.k] = false;
+    }
+    if(y.innerHTML === '') { y.innerHTML = ' '; clear[x.k] = true; }
 }
 function mkdiv(i) {
-	divcount++;
-	var foo = _indexOf(divorder,i);
-	divorder.splice(foo+1,0,divcount);
-	savedata.inputs.splice(foo+1,0,'');
-	savedata.outputs.splice(foo+1,0,[]);
-	$('#master_'+i.toString()).after(
-	    '
    '+
-	    '
    '+
+    divcount++;
+    var foo = _indexOf(divorder,i);
+    divorder.splice(foo+1,0,divcount);
+    savedata.inputs.splice(foo+1,0,'');
+    savedata.outputs.splice(foo+1,0,[]);
+    $('#master_'+i.toString()).after(
+        '
    '+
+        '
    '+
         '
    '+
         'IN>'+
         '
    '+
@@ -285,39 +285,39 @@
     );
 }
 function rmdiv(i) {
-	var foo = _indexOf(divorder,i);
-	divorder.splice(foo,1);
-	$('#master_'+i.toString()).remove();
-	savedata.inputs.splice(foo,1);
-	savedata.outputs.splice(foo,1);
+    var foo = _indexOf(divorder,i);
+    divorder.splice(foo,1);
+    $('#master_'+i.toString()).remove();
+    savedata.inputs.splice(foo,1);
+    savedata.outputs.splice(foo,1);
 }
 
 function go(k) {
-	var input = $('#text_'+k.toString())[0];
+    var input = $('#text_'+k.toString())[0];
     var n = _indexOf(divorder,k);
     var foo = divorder[n+1];
     if(typeof foo === "number") {
-       	myfocus($('#text_'+foo.toString())[0]);
+        myfocus($('#text_'+foo.toString())[0]);
     } else {
-    	mkdiv(k);
-    	foo = divorder[n+1];
+        mkdiv(k);
+        foo = divorder[n+1];
     }
     input.className = "in1";
     cache[k] = input.value;
-	myfocus($('#text_'+foo.toString())[0]);
-	clear[k] = true;
-	$('#out_'+k.toString())[0].innerHTML = "";
+    myfocus($('#text_'+foo.toString())[0]);
+    clear[k] = true;
+    $('#out_'+k.toString())[0].innerHTML = "";
     var runit = function() { w.postMessage(JSON.stringify({k:k,n:n,e:input.value})); }
-	setTimeout(runit,0);
+    setTimeout(runit,0);
 }
 
 function inputChanged(k){
-	var i = _indexOf(divorder,k);
-	var input = $('#text_'+k.toString())[0];
-	if(input.value === cache[k]) input.className = "in1";
-	else { input.className = "in0"; cache[k] = null; }
-	savedata.inputs[i] = input.value;
-	saveit();
+    var i = _indexOf(divorder,k);
+    var input = $('#text_'+k.toString())[0];
+    if(input.value === cache[k]) input.className = "in1";
+    else { input.className = "in0"; cache[k] = null; }
+    savedata.inputs[i] = input.value;
+    saveit();
 }
 
 var _foo;
@@ -327,46 +327,46 @@
     rc++;
     if(rc<2) return;
     foo = _foo;
-	savedata = { inputs: [], outputs: [], scripts: foo.scripts };
-	var baz = 'Version: '+foo.scripts[0]+'';
-	if(_indexOf(foo.scripts,workshop.updateVersion)<0) {
-	    baz = baz + ' (Update to '+workshop.updateVersion+')';
-	}
-	$('#divupdate')[0].innerHTML = baz;
-	if(foo.inputs.length === 0) { mkdiv(0); return; }
-	var input,output,i,j,f0;
-	for(i=1;i
    ';
-					setTimeout(function () { 
-						plotit(plotid,{k:i, o:foo.outputs[i][j].o, p:foo.outputs[i][j].p});
-					},0);
-				}(i,j));
-			}
-		}
-		if(output.innerHTML === '') { output.innerHTML = ' '; clear[i] = true; }
-	}
-	savedata = foo;
-	workshop.savedata = savedata;
+    savedata = { inputs: [], outputs: [], scripts: foo.scripts };
+    var baz = 'Version: '+foo.scripts[0]+'';
+    if(_indexOf(foo.scripts,workshop.updateVersion)<0) {
+        baz = baz + ' (Update to '+workshop.updateVersion+')';
+    }
+    $('#divupdate')[0].innerHTML = baz;
+    if(foo.inputs.length === 0) { mkdiv(0); return; }
+    var input,output,i,j,f0;
+    for(i=1;i
    ';
+                    setTimeout(function () {
+                        plotit(plotid,{k:i, o:foo.outputs[i][j].o, p:foo.outputs[i][j].p});
+                    },0);
+                }(i,j));
+            }
+        }
+        if(output.innerHTML === '') { output.innerHTML = ' '; clear[i] = true; }
+    }
+    savedata = foo;
+    workshop.savedata = savedata;
 }
 
 function restore(savedata) {
     w.postMessage(JSON.stringify({imports:savedata.scripts}));
-	restore2(savedata);
+    restore2(savedata);
 }
 
 function preload(savedata) {
@@ -381,55 +381,55 @@
 }
 
 function mykeydown(e,i) {
-	var input = $('#text_'+i.toString())[0];
-	checkpos(input);
-	resize(input);
-	setTimeout(function () { resize(input); },0);
-	var e = window.event?window.event:e;
+    var input = $('#text_'+i.toString())[0];
+    checkpos(input);
+    resize(input);
+    setTimeout(function () { resize(input); },0);
+    var e = window.event?window.event:e;
     if(e.keyCode === 13 && e.shiftKey === false) {
-		setTimeout(function () { inputChanged(i); go(i); },0);
-		if(window.event) e.returnValue = false;
-		else e.preventDefault();
-	} else {
-		setTimeout(function () { inputChanged(i); },0)
-	};
+        setTimeout(function () { inputChanged(i); go(i); },0);
+        if(window.event) e.returnValue = false;
+        else e.preventDefault();
+    } else {
+        setTimeout(function () { inputChanged(i); },0)
+    };
 }
 function reset() {
-	localStorage.clear();
-	window.location.replace('workshop.php');
+    localStorage.clear();
+    window.location.replace('workshop.php');
 }
 function update() {
-	savedata.scripts = [workshop.updateVersion];
-	localStorage.savedata = JSON.stringify(savedata);
-	window.location.replace('workshop.php');
+    savedata.scripts = [workshop.updateVersion];
+    localStorage.savedata = JSON.stringify(savedata);
+    window.location.replace('workshop.php');
 }
 
 function submit() {
-	var f = document.myform;
-	var foo = JSON.stringify(savedata);
-	var digest = Crypto.SHA256(foo, { asBytes: true });
-	var s = document.myform.savedata;
-	s.value = foo;
-	digest = Crypto.util.bytesToHex(digest);
-	f.action = "workshop.php?link="+digest;
-	f.submit();
+    var f = document.myform;
+    var foo = JSON.stringify(savedata);
+    var digest = Crypto.SHA256(foo, { asBytes: true });
+    var s = document.myform.savedata;
+    s.value = foo;
+    digest = Crypto.util.bytesToHex(digest);
+    f.action = "workshop.php?link="+digest;
+    f.submit();
 }
 
 return {
-	    print:print,
-	    mkdiv:mkdiv,
-	    rmdiv:rmdiv,
-	    mykeydown:mykeydown,
-	    w:w,
-	    savedata:savedata,
-	    restore:restore,
-	    restore2:restore2,
-	    reset:reset,
-	    resize:resize,
-	    submit:submit,
-	    update:update,
-	    preload:preload
-	    }
+        print:print,
+        mkdiv:mkdiv,
+        rmdiv:rmdiv,
+        mykeydown:mykeydown,
+        w:w,
+        savedata:savedata,
+        restore:restore,
+        restore2:restore2,
+        reset:reset,
+        resize:resize,
+        submit:submit,
+        update:update,
+        preload:preload
+        }
 }());
 
 
diff --git a/tools/workshop_in.php b/tools/workshop_in.php
index fbf2ffe..fdc9e27 100644
--- a/tools/workshop_in.php
+++ b/tools/workshop_in.php
@@ -7,17 +7,17 @@ function con() {
 con();
 
 if(isset($_POST['savedata'])) {
-	$data = $_POST['savedata'];
-	if (get_magic_quotes_gpc())  
- 		$data = stripslashes($data);
-	json_decode($data) or die("json error");
-	$f = hash('sha256',$data);
-	if($f === "") { exit; }
-	$d = mysql_real_escape_string($data);
-	$q = "insert ignore into blobs value ('$f','$d')";
-	$result = mysql_query($q) or die('Could not save script: ' . mysql_error());
-	header('Location: workshop.php?link=' . $_GET['link']);
-	exit;
+    $data = $_POST['savedata'];
+    if (get_magic_quotes_gpc())
+        $data = stripslashes($data);
+    json_decode($data) or die("json error");
+    $f = hash('sha256',$data);
+    if($f === "") { exit; }
+    $d = mysql_real_escape_string($data);
+    $q = "insert ignore into blobs value ('$f','$d')";
+    $result = mysql_query($q) or die('Could not save script: ' . mysql_error());
+    header('Location: workshop.php?link=' . $_GET['link']);
+    exit;
 }
 ?>
 
@@ -28,25 +28,25 @@ function con() {
 $incs = NULL;
 
 if(isset($_GET['link'])) {
-	$f = $_GET['link'];
-	if(!preg_match('/^[0-9a-fA-F]*$/',$f)) { exit; }
-	$q = "select v from blobs where k = '".$f."'";
-	$result = mysql_query($q) or die('Could not fetch script: ' . mysql_error());
-	$s = mysql_fetch_row($result) or die ('Could not fetch field: ' . mysql_error());
-	$restore = $s[0];
-	$foo = json_decode($restore,true) or die("json error");
-	$incs = $foo['scripts'];
-	if(is_null($incs)) {
-		$incs = array(1 => 'lib/numeric-VERSIONSTRING.js');
-	}
-	echo << 'lib/numeric-VERSIONSTRING.js');
+    }
+    echo <<
 
@@ -56,11 +56,11 @@ function con() {
             user-select: none;
         }
         div.input,div.output {
-            margin-left: 30px; 
+            margin-left: 30px;
             margin-right: 15px;
             margin-top: 0px;
             margin-bottom: 0px;
-            position: relative;            
+            position: relative;
             margin: 0px;
             padding: 0px;
             border: 0px;
@@ -115,8 +115,8 @@ function con() {
 
    
 
    
 
 
 
@@ -129,7 +129,7 @@ function con() {
     
    
         
    
         
    
-        
+
         
    
         ↩
         
    
@@ -155,61 +155,61 @@ function con() {
 
 if(_retarded) {
     _queue = [];
-	_onmessage = function(ev) { _queue.push(ev); }
-	_loaded = 0;
-	window.Worker = function(f) {
-		var worker = this;
-		worker.queue = [];
-		worker.onmessage = function(ev) {};
-		worker.postMessage = function(ev) { _onmessage({data: ev}); };
-		var scr = document.createElement('script');
-		scr.src = f;
-		scr.type = 'text/javascript';
+    _onmessage = function(ev) { _queue.push(ev); }
+    _loaded = 0;
+    window.Worker = function(f) {
+        var worker = this;
+        worker.queue = [];
+        worker.onmessage = function(ev) {};
+        worker.postMessage = function(ev) { _onmessage({data: ev}); };
+        var scr = document.createElement('script');
+        scr.src = f;
+        scr.type = 'text/javascript';
         scr.onreadystatechange = function () {
             var k;
             if (scr.readyState == 'loaded' || scr.readyState == 'complete') {
                 for(k=0;k<_queue.length;k++) { _onmessage(_queue[k]); }
             }
         }
-		document.getElementsByTagName('head')[0].appendChild(scr);
-		workerPostMessage = function(ev) { worker.onmessage({data: ev}); }
-	}
-	importScripts = function(z) {
-	    var scr = document.createElement('script');
+        document.getElementsByTagName('head')[0].appendChild(scr);
+        workerPostMessage = function(ev) { worker.onmessage({data: ev}); }
+    }
+    importScripts = function(z) {
+        var scr = document.createElement('script');
         scr.src = z;
         scr.type = 'text/javascript';
         document.getElementsByTagName('head')[0].appendChild(scr);
-	};
+    };
 }
 var workshop = (function () {
 
 function resize(input) {
-	if(input.scrollHeight > input.clientHeight) {
-		input.style.height = (input.scrollHeight+10)+"px";
-	}
+    if(input.scrollHeight > input.clientHeight) {
+        input.style.height = (input.scrollHeight+10)+"px";
+    }
 }
 
 function elementPos(e){
-	var x = 0, y = 0, dx = e.offsetWidth, dy = e.offsetHeight;
+    var x = 0, y = 0, dx = e.offsetWidth, dy = e.offsetHeight;
     while(e !== null){
-    	x += e.offsetLeft;
-    	y += e.offsetTop;
-    	e = e.offsetParent;
-  	}
-  	return {x:x, y:y, dx:dx, dy:dy};
+        x += e.offsetLeft;
+        y += e.offsetTop;
+        e = e.offsetParent;
+    }
+    return {x:x, y:y, dx:dx, dy:dy};
 }
 
 function checkpos(e) {
-	var foo = elementPos(e);
-	var y = window.pageYOffset, dy = window.innerHeight;
-	if(foo.y < y+10 || foo.y+foo.dy > y+dy-10) {
-		window.scrollTo(window.pageXOffset,Math.max(0,Math.round(foo.y-0.5*dy)));
-	}	
+    var foo = elementPos(e);
+    var y = window.pageYOffset, dy = window.innerHeight;
+    if(foo.y < y+10 || foo.y+foo.dy > y+dy-10) {
+        window.scrollTo(window.pageXOffset,Math.max(0,Math.round(foo.y-0.5*dy)));
+    }
 }
 
 function myfocus(e) {
-	checkpos(e);
-	e.focus();
+    checkpos(e);
+    e.focus();
 }
 
 var savedata;
@@ -223,76 +223,76 @@ function myfocus(e) {
 var plotcount = 0;
 
 function plotit(plotid,x) {
-	var k;
+    var k;
     try {
-		if(typeof x.s === "object") $('#'+plotid).css(x.s);
-		$.plot($("#"+plotid), x.p, x.o);
+        if(typeof x.s === "object") $('#'+plotid).css(x.s);
+        $.plot($("#"+plotid), x.p, x.o);
     } catch(e) {
-		var _foo = e.toString();
-       	if(typeof e.stack !== "undefined" && typeof e.stack.toString !== "undefined") {
-       		_foo += "\n\n"+e.stack.toString();
-       	}
-       	_foo = _foo.replace(/&/g,'&').replace(/>/g,'>').replace(//g,'>').replace(/
    ';
-		(function () { 
-			setTimeout(function () { 
-				plotit(plotid,x); 
-				setTimeout(function () { 
-					outputChanged(x.k,x); 
-				},0); 
-			},0); 
-		}());
-		clear[x.k] = false;
-		return;
-	} 
-	else { 
-		y.innerHTML += x.o;
-		(function () {
-			setTimeout(function() { 
-				outputChanged(x.k,x.o); },0) 
-			}());
-		clear[x.k] = false;
-	}
-	if(y.innerHTML === '') { y.innerHTML = ' '; clear[x.k] = true; }
+    var x = JSON.parse(ev.data);
+    var y = $('#out_'+x.k.toString())[0];
+    if(clear[x.k]) { y.innerHTML = ''; savedata.outputs[_indexOf(divorder,x.k)] = []; }
+    if(typeof x.p !== "undefined") {
+        var plotid = "plot_"+plotcount.toString();
+        plotcount++;
+        y.innerHTML += '
    ';
+        (function () {
+            setTimeout(function () {
+                plotit(plotid,x);
+                setTimeout(function () {
+                    outputChanged(x.k,x);
+                },0);
+            },0);
+        }());
+        clear[x.k] = false;
+        return;
+    }
+    else {
+        y.innerHTML += x.o;
+        (function () {
+            setTimeout(function() {
+                outputChanged(x.k,x.o); },0)
+            }());
+        clear[x.k] = false;
+    }
+    if(y.innerHTML === '') { y.innerHTML = ' '; clear[x.k] = true; }
 }
 function mkdiv(i) {
-	divcount++;
-	var foo = _indexOf(divorder,i);
-	divorder.splice(foo+1,0,divcount);
-	savedata.inputs.splice(foo+1,0,'');
-	savedata.outputs.splice(foo+1,0,[]);
-	$('#master_'+i.toString()).after(
-	    '
    '+
-	    '
    '+
+    divcount++;
+    var foo = _indexOf(divorder,i);
+    divorder.splice(foo+1,0,divcount);
+    savedata.inputs.splice(foo+1,0,'');
+    savedata.outputs.splice(foo+1,0,[]);
+    $('#master_'+i.toString()).after(
+        '
    '+
+        '
    '+
         '
    '+
         'IN>'+
         '
    '+
@@ -309,39 +309,39 @@ function mkdiv(i) {
     );
 }
 function rmdiv(i) {
-	var foo = _indexOf(divorder,i);
-	divorder.splice(foo,1);
-	$('#master_'+i.toString()).remove();
-	savedata.inputs.splice(foo,1);
-	savedata.outputs.splice(foo,1);
+    var foo = _indexOf(divorder,i);
+    divorder.splice(foo,1);
+    $('#master_'+i.toString()).remove();
+    savedata.inputs.splice(foo,1);
+    savedata.outputs.splice(foo,1);
 }
 
 function go(k) {
-	var input = $('#text_'+k.toString())[0];
+    var input = $('#text_'+k.toString())[0];
     var n = _indexOf(divorder,k);
     var foo = divorder[n+1];
     if(typeof foo === "number") {
-       	myfocus($('#text_'+foo.toString())[0]);
+        myfocus($('#text_'+foo.toString())[0]);
     } else {
-    	mkdiv(k);
-    	foo = divorder[n+1];
+        mkdiv(k);
+        foo = divorder[n+1];
     }
     input.className = "in1";
     cache[k] = input.value;
-	myfocus($('#text_'+foo.toString())[0]);
-	clear[k] = true;
-	$('#out_'+k.toString())[0].innerHTML = "";
+    myfocus($('#text_'+foo.toString())[0]);
+    clear[k] = true;
+    $('#out_'+k.toString())[0].innerHTML = "";
     var runit = function() { w.postMessage(JSON.stringify({k:k,n:n,e:input.value})); }
-	setTimeout(runit,0);
+    setTimeout(runit,0);
 }
 
 function inputChanged(k){
-	var i = _indexOf(divorder,k);
-	var input = $('#text_'+k.toString())[0];
-	if(input.value === cache[k]) input.className = "in1";
-	else { input.className = "in0"; cache[k] = null; }
-	savedata.inputs[i] = input.value;
-	saveit();
+    var i = _indexOf(divorder,k);
+    var input = $('#text_'+k.toString())[0];
+    if(input.value === cache[k]) input.className = "in1";
+    else { input.className = "in0"; cache[k] = null; }
+    savedata.inputs[i] = input.value;
+    saveit();
 }
 
 var _foo;
@@ -351,46 +351,46 @@ function restore2(foo) {
     rc++;
     if(rc<2) return;
     foo = _foo;
-	savedata = { inputs: [], outputs: [], scripts: foo.scripts };
-	var baz = 'Version: '+foo.scripts[0]+'';
-	if(_indexOf(foo.scripts,workshop.updateVersion)<0) {
-	    baz = baz + ' (Update to '+workshop.updateVersion+')';
-	}
-	$('#divupdate')[0].innerHTML = baz;
-	if(foo.inputs.length === 0) { mkdiv(0); return; }
-	var input,output,i,j,f0;
-	for(i=1;i
    ';
-					setTimeout(function () { 
-						plotit(plotid,{k:i, o:foo.outputs[i][j].o, p:foo.outputs[i][j].p});
-					},0);
-				}(i,j));
-			}
-		}
-		if(output.innerHTML === '') { output.innerHTML = ' '; clear[i] = true; }
-	}
-	savedata = foo;
-	workshop.savedata = savedata;
+    savedata = { inputs: [], outputs: [], scripts: foo.scripts };
+    var baz = 'Version: '+foo.scripts[0]+'';
+    if(_indexOf(foo.scripts,workshop.updateVersion)<0) {
+        baz = baz + ' (Update to '+workshop.updateVersion+')';
+    }
+    $('#divupdate')[0].innerHTML = baz;
+    if(foo.inputs.length === 0) { mkdiv(0); return; }
+    var input,output,i,j,f0;
+    for(i=1;i
    ';
+                    setTimeout(function () {
+                        plotit(plotid,{k:i, o:foo.outputs[i][j].o, p:foo.outputs[i][j].p});
+                    },0);
+                }(i,j));
+            }
+        }
+        if(output.innerHTML === '') { output.innerHTML = ' '; clear[i] = true; }
+    }
+    savedata = foo;
+    workshop.savedata = savedata;
 }
 
 function restore(savedata) {
     w.postMessage(JSON.stringify({imports:savedata.scripts}));
-	restore2(savedata);
+    restore2(savedata);
 }
 
 function preload(savedata) {
@@ -405,55 +405,55 @@ function preload(savedata) {
 }
 
 function mykeydown(e,i) {
-	var input = $('#text_'+i.toString())[0];
-	checkpos(input);
-	resize(input);
-	setTimeout(function () { resize(input); },0);
-	var e = window.event?window.event:e;
+    var input = $('#text_'+i.toString())[0];
+    checkpos(input);
+    resize(input);
+    setTimeout(function () { resize(input); },0);
+    var e = window.event?window.event:e;
     if(e.keyCode === 13 && e.shiftKey === false) {
-		setTimeout(function () { inputChanged(i); go(i); },0);
-		if(window.event) e.returnValue = false;
-		else e.preventDefault();
-	} else {
-		setTimeout(function () { inputChanged(i); },0)
-	};
+        setTimeout(function () { inputChanged(i); go(i); },0);
+        if(window.event) e.returnValue = false;
+        else e.preventDefault();
+    } else {
+        setTimeout(function () { inputChanged(i); },0)
+    };
 }
 function reset() {
-	localStorage.clear();
-	window.location.replace('workshop.php');
+    localStorage.clear();
+    window.location.replace('workshop.php');
 }
 function update() {
-	savedata.scripts = [workshop.updateVersion];
-	localStorage.savedata = JSON.stringify(savedata);
-	window.location.replace('workshop.php');
+    savedata.scripts = [workshop.updateVersion];
+    localStorage.savedata = JSON.stringify(savedata);
+    window.location.replace('workshop.php');
 }
 
 function submit() {
-	var f = document.myform;
-	var foo = JSON.stringify(savedata);
-	var digest = Crypto.SHA256(foo, { asBytes: true });
-	var s = document.myform.savedata;
-	s.value = foo;
-	digest = Crypto.util.bytesToHex(digest);
-	f.action = "workshop.php?link="+digest;
-	f.submit();
+    var f = document.myform;
+    var foo = JSON.stringify(savedata);
+    var digest = Crypto.SHA256(foo, { asBytes: true });
+    var s = document.myform.savedata;
+    s.value = foo;
+    digest = Crypto.util.bytesToHex(digest);
+    f.action = "workshop.php?link="+digest;
+    f.submit();
 }
 
 return {
-	    print:print,
-	    mkdiv:mkdiv,
-	    rmdiv:rmdiv,
-	    mykeydown:mykeydown,
-	    w:w,
-	    savedata:savedata,
-	    restore:restore,
-	    restore2:restore2,
-	    reset:reset,
-	    resize:resize,
-	    submit:submit,
-	    update:update,
-	    preload:preload
-	    }
+        print:print,
+        mkdiv:mkdiv,
+        rmdiv:rmdiv,
+        mykeydown:mykeydown,
+        w:w,
+        savedata:savedata,
+        restore:restore,
+        restore2:restore2,
+        reset:reset,
+        resize:resize,
+        submit:submit,
+        update:update,
+        preload:preload
+        }
 }());
 
 
@@ -465,25 +465,25 @@ function submit() {
 $incs = NULL;
 
 if(isset($_GET['link'])) {
-	$f = $_GET['link'];
-	if(!preg_match('/^[0-9a-fA-F]*$/',$f)) { exit; }
-	$q = "select v from blobs where k = '".$f."'";
-	$result = mysql_query($q) or die('Could not fetch script: ' . mysql_error());
-	$s = mysql_fetch_row($result) or die ('Could not fetch field: ' . mysql_error());
-	$restore = $s[0];
-	$foo = json_decode($restore,true) or die("json error");
-	$incs = $foo['scripts'];
-	if(is_null($incs)) {
-		$incs = array(1 => 'lib/numeric-1.2.4.js');
-	}
-	echo << 'lib/numeric-1.2.4.js');
+    }
+    echo <<
Date: Tue, 5 Feb 2013 17:39:29 +0100
Subject: [PATCH 05/48] CRLF --> LF thanks to .gitattributes

---
 tools/Crypto-JS v2.4.0/aes/aes-min.js         |  12 +-
 tools/Crypto-JS v2.4.0/aes/aes.js             | 814 +++++++++---------
 .../blockmodes/blockmodes-min.js              |  12 +-
 .../Crypto-JS v2.4.0/blockmodes/blockmodes.js | 762 ++++++++--------
 .../crypto-md5-hmac/crypto-md5-hmac.js        |  12 +-
 .../Crypto-JS v2.4.0/crypto-md5/crypto-md5.js |  12 +-
 .../crypto-sha1-hmac-pbkdf2-blockmodes-aes.js |  12 +-
 .../crypto-sha1-hmac-pbkdf2-marc4.js          |  12 +-
 .../crypto-sha1-hmac-pbkdf2-rabbit.js         |  12 +-
 .../crypto-sha1-hmac-pbkdf2.js                |  12 +-
 .../crypto-sha1-hmac-pbkdf2async.js           |  12 +-
 .../crypto-sha1-hmac/crypto-sha1-hmac.js      |  12 +-
 .../crypto-sha1/crypto-sha1.js                |  12 +-
 .../crypto-sha256-hmac/crypto-sha256-hmac.js  |  12 +-
 .../crypto-sha256/crypto-sha256.js            |  12 +-
 tools/Crypto-JS v2.4.0/crypto/crypto-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/crypto/crypto.js       | 320 +++----
 tools/Crypto-JS v2.4.0/hmac/hmac-min.js       |  12 +-
 tools/Crypto-JS v2.4.0/hmac/hmac.js           |  86 +-
 tools/Crypto-JS v2.4.0/marc4/marc4-min.js     |  12 +-
 tools/Crypto-JS v2.4.0/marc4/marc4.js         | 244 +++---
 tools/Crypto-JS v2.4.0/md5/md5-min.js         |  12 +-
 tools/Crypto-JS v2.4.0/md5/md5.js             | 326 +++----
 tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2.js       | 108 +--
 .../pbkdf2async/pbkdf2async-min.js            |  12 +-
 .../pbkdf2async/pbkdf2async.js                | 186 ++--
 tools/Crypto-JS v2.4.0/rabbit/rabbit-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/rabbit/rabbit.js       | 452 +++++-----
 tools/Crypto-JS v2.4.0/sha1/sha1-min.js       |  12 +-
 tools/Crypto-JS v2.4.0/sha1/sha1.js           | 182 ++--
 tools/Crypto-JS v2.4.0/sha256/sha256-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/sha256/sha256.js       | 270 +++---
 33 files changed, 2007 insertions(+), 2007 deletions(-)

diff --git a/tools/Crypto-JS v2.4.0/aes/aes-min.js b/tools/Crypto-JS v2.4.0/aes/aes-min.js
index b96adf4..7109d37 100755
--- a/tools/Crypto-JS v2.4.0/aes/aes-min.js	
+++ b/tools/Crypto-JS v2.4.0/aes/aes-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){function q(d,e){for(var b=0,a=0;a<8;a++){if(e&1)b^=d;var h=d&128;d=d<<1&255;if(h)d^=27;e>>>=1}return b}for(var o=Crypto,x=o.util,z=o.charenc.UTF8,k=[99,124,119,123,242,107,111,197,48,1,103,43,254,215,171,118,202,130,201,125,250,89,71,240,173,212,162,175,156,164,114,192,183,253,147,38,54,63,247,204,52,165,229,241,113,216,49,21,4,199,35,195,24,150,5,154,7,18,128,226,235,39,178,117,9,131,44,26,27,110,90,160,82,59,214,179,41,227,47,132,83,209,0,237,32,252,177,91,106,203,190,57,74,76,88,207,
 208,239,170,251,67,77,51,133,69,249,2,127,80,60,159,168,81,163,64,143,146,157,56,245,188,182,218,33,16,255,243,210,205,12,19,236,95,151,68,23,196,167,126,61,100,93,25,115,96,129,79,220,34,42,144,136,70,238,184,20,222,94,11,219,224,50,58,10,73,6,36,92,194,211,172,98,145,149,228,121,231,200,55,109,141,213,78,169,108,86,244,234,101,122,174,8,186,120,37,46,28,166,180,198,232,221,116,31,75,189,139,138,112,62,181,102,72,3,246,14,97,53,87,185,134,193,29,158,225,248,152,17,105,217,142,148,155,30,135,233,
 206,85,40,223,140,161,137,13,191,230,66,104,65,153,45,15,176,84,187,22],y=[],f=0;f<256;f++)y[k[f]]=f;var r=[],s=[],t=[],u=[],v=[],w=[];for(f=0;f<256;f++){r[f]=q(f,2);s[f]=q(f,3);t[f]=q(f,9);u[f]=q(f,11);v[f]=q(f,13);w[f]=q(f,14)}var A=[0,1,2,4,8,16,32,64,128,27,54],c=[[],[],[],[]],i,p,g,j=o.AES={encrypt:function(d,e,b){b=b||{};var a=b.mode||new o.mode.OFB;a.fixOptions&&a.fixOptions(b);d=d.constructor==String?z.stringToBytes(d):d;var h=b.iv||x.randomBytes(j._blocksize*4);e=e.constructor==String?o.PBKDF2(e,
diff --git a/tools/Crypto-JS v2.4.0/aes/aes.js b/tools/Crypto-JS v2.4.0/aes/aes.js
index bca0e13..d565a14 100755
--- a/tools/Crypto-JS v2.4.0/aes/aes.js	
+++ b/tools/Crypto-JS v2.4.0/aes/aes.js	
@@ -1,407 +1,407 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8;
-
-// Precomputed SBOX
-var SBOX = [ 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
-             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
-             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
-             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
-             0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
-             0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
-             0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
-             0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
-             0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
-             0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
-             0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
-             0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
-             0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
-             0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
-             0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
-             0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
-             0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
-             0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
-             0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
-             0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
-             0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
-             0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
-             0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
-             0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
-             0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
-             0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
-             0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
-             0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
-             0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
-             0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
-             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
-             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 ];
-
-// Compute inverse SBOX lookup table
-for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
-
-// Compute mulitplication in GF(2^8) lookup tables
-var MULT2 = [],
-    MULT3 = [],
-    MULT9 = [],
-    MULTB = [],
-    MULTD = [],
-    MULTE = [];
-
-function xtime(a, b) {
-	for (var result = 0, i = 0; i < 8; i++) {
-		if (b & 1) result ^= a;
-		var hiBitSet = a & 0x80;
-		a = (a << 1) & 0xFF;
-		if (hiBitSet) a ^= 0x1b;
-		b >>>= 1;
-	}
-	return result;
-}
-
-for (var i = 0; i < 256; i++) {
-	MULT2[i] = xtime(i,2);
-	MULT3[i] = xtime(i,3);
-	MULT9[i] = xtime(i,9);
-	MULTB[i] = xtime(i,0xB);
-	MULTD[i] = xtime(i,0xD);
-	MULTE[i] = xtime(i,0xE);
-}
-
-// Precomputed RCon lookup
-var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
-
-// Inner state
-var state = [[], [], [], []],
-    keylength,
-    nrounds,
-    keyschedule;
-
-var AES = C.AES = {
-
-	/**
-	 * Public API
-	 */
-
-	encrypt: function (message, password, options) {
-
-		options = options || {};
-
-		// Determine mode
-		var mode = options.mode || new C.mode.OFB;
-
-		// Allow mode to override options
-		if (mode.fixOptions) mode.fixOptions(options);
-
-		var
-
-			// Convert to bytes if message is a string
-			m = (
-				message.constructor == String ?
-				UTF8.stringToBytes(message) :
-				message
-			),
-
-			// Generate random IV
-			iv = options.iv || util.randomBytes(AES._blocksize * 4),
-
-			// Generate key
-			k = (
-				password.constructor == String ?
-				// Derive key from passphrase
-				C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
-				password
-			);
-
-		// Encrypt
-		AES._init(k);
-		mode.encrypt(AES, m, iv);
-
-		// Return ciphertext
-		m = options.iv ? m : iv.concat(m);
-		return (options && options.asBytes) ? m : util.bytesToBase64(m);
-
-	},
-
-	decrypt: function (ciphertext, password, options) {
-
-		options = options || {};
-
-		// Determine mode
-		var mode = options.mode || new C.mode.OFB;
-
-		// Allow mode to override options
-		if (mode.fixOptions) mode.fixOptions(options);
-
-		var
-
-			// Convert to bytes if ciphertext is a string
-			c = (
-				ciphertext.constructor == String ?
-				util.base64ToBytes(ciphertext):
-			    ciphertext
-			),
-
-			// Separate IV and message
-			iv = options.iv || c.splice(0, AES._blocksize * 4),
-
-			// Generate key
-			k = (
-				password.constructor == String ?
-				// Derive key from passphrase
-				C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
-				password
-			);
-
-		// Decrypt
-		AES._init(k);
-		mode.decrypt(AES, c, iv);
-
-		// Return plaintext
-		return (options && options.asBytes) ? c : UTF8.bytesToString(c);
-
-	},
-
-
-	/**
-	 * Package private methods and properties
-	 */
-
-	_blocksize: 4,
-
-	_encryptblock: function (m, offset) {
-
-		// Set input
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = m[offset + col * 4 + row];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[col][row];
-		}
-
-		for (var round = 1; round < nrounds; round++) {
-
-			// Sub bytes
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] = SBOX[state[row][col]];
-			}
-
-			// Shift rows
-			state[1].push(state[1].shift());
-			state[2].push(state[2].shift());
-			state[2].push(state[2].shift());
-			state[3].unshift(state[3].pop());
-
-			// Mix columns
-			for (var col = 0; col < 4; col++) {
-
-				var s0 = state[0][col],
-				    s1 = state[1][col],
-				    s2 = state[2][col],
-				    s3 = state[3][col];
-
-				state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
-				state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
-				state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
-				state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
-
-			}
-
-			// Add round key
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] ^= keyschedule[round * 4 + col][row];
-			}
-
-		}
-
-		// Sub bytes
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = SBOX[state[row][col]];
-		}
-
-		// Shift rows
-		state[1].push(state[1].shift());
-		state[2].push(state[2].shift());
-		state[2].push(state[2].shift());
-		state[3].unshift(state[3].pop());
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-		}
-
-		// Set output
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				m[offset + col * 4 + row] = state[row][col];
-		}
-
-	},
-
-	_decryptblock: function (c, offset) {
-
-		// Set input
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = c[offset + col * 4 + row];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-		}
-
-		for (var round = 1; round < nrounds; round++) {
-
-			// Inv shift rows
-			state[1].unshift(state[1].pop());
-			state[2].push(state[2].shift());
-			state[2].push(state[2].shift());
-			state[3].push(state[3].shift());
-
-			// Inv sub bytes
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] = INVSBOX[state[row][col]];
-			}
-
-			// Add round key
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
-			}
-
-			// Inv mix columns
-			for (var col = 0; col < 4; col++) {
-
-				var s0 = state[0][col],
-				    s1 = state[1][col],
-				    s2 = state[2][col],
-				    s3 = state[3][col];
-
-				state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
-				state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
-				state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
-				state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
-
-			}
-
-		}
-
-		// Inv shift rows
-		state[1].unshift(state[1].pop());
-		state[2].push(state[2].shift());
-		state[2].push(state[2].shift());
-		state[3].push(state[3].shift());
-
-		// Inv sub bytes
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = INVSBOX[state[row][col]];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[col][row];
-		}
-
-		// Set output
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				c[offset + col * 4 + row] = state[row][col];
-		}
-
-	},
-
-
-	/**
-	 * Private methods
-	 */
-
-	_init: function (k) {
-		keylength = k.length / 4;
-		nrounds = keylength + 6;
-		AES._keyexpansion(k);
-	},
-
-	// Generate a key schedule
-	_keyexpansion: function (k) {
-
-		keyschedule = [];
-
-		for (var row = 0; row < keylength; row++) {
-			keyschedule[row] = [
-				k[row * 4],
-				k[row * 4 + 1],
-				k[row * 4 + 2],
-				k[row * 4 + 3]
-			];
-		}
-
-		for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
-
-			var temp = [
-				keyschedule[row - 1][0],
-				keyschedule[row - 1][1],
-				keyschedule[row - 1][2],
-				keyschedule[row - 1][3]
-			];
-
-			if (row % keylength == 0) {
-
-				// Rot word
-				temp.push(temp.shift());
-
-				// Sub word
-				temp[0] = SBOX[temp[0]];
-				temp[1] = SBOX[temp[1]];
-				temp[2] = SBOX[temp[2]];
-				temp[3] = SBOX[temp[3]];
-
-				temp[0] ^= RCON[row / keylength];
-
-			} else if (keylength > 6 && row % keylength == 4) {
-
-				// Sub word
-				temp[0] = SBOX[temp[0]];
-				temp[1] = SBOX[temp[1]];
-				temp[2] = SBOX[temp[2]];
-				temp[3] = SBOX[temp[3]];
-
-			}
-
-			keyschedule[row] = [
-				keyschedule[row - keylength][0] ^ temp[0],
-				keyschedule[row - keylength][1] ^ temp[1],
-				keyschedule[row - keylength][2] ^ temp[2],
-				keyschedule[row - keylength][3] ^ temp[3]
-			];
-
-		}
-
-	}
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8;
+
+// Precomputed SBOX
+var SBOX = [ 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
+             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
+             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
+             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
+             0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
+             0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
+             0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
+             0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
+             0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
+             0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
+             0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
+             0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
+             0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
+             0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
+             0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
+             0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
+             0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
+             0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
+             0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
+             0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
+             0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
+             0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
+             0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
+             0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
+             0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
+             0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
+             0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
+             0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
+             0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
+             0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
+             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
+             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 ];
+
+// Compute inverse SBOX lookup table
+for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
+
+// Compute mulitplication in GF(2^8) lookup tables
+var MULT2 = [],
+    MULT3 = [],
+    MULT9 = [],
+    MULTB = [],
+    MULTD = [],
+    MULTE = [];
+
+function xtime(a, b) {
+	for (var result = 0, i = 0; i < 8; i++) {
+		if (b & 1) result ^= a;
+		var hiBitSet = a & 0x80;
+		a = (a << 1) & 0xFF;
+		if (hiBitSet) a ^= 0x1b;
+		b >>>= 1;
+	}
+	return result;
+}
+
+for (var i = 0; i < 256; i++) {
+	MULT2[i] = xtime(i,2);
+	MULT3[i] = xtime(i,3);
+	MULT9[i] = xtime(i,9);
+	MULTB[i] = xtime(i,0xB);
+	MULTD[i] = xtime(i,0xD);
+	MULTE[i] = xtime(i,0xE);
+}
+
+// Precomputed RCon lookup
+var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
+
+// Inner state
+var state = [[], [], [], []],
+    keylength,
+    nrounds,
+    keyschedule;
+
+var AES = C.AES = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password, options) {
+
+		options = options || {};
+
+		// Determine mode
+		var mode = options.mode || new C.mode.OFB;
+
+		// Allow mode to override options
+		if (mode.fixOptions) mode.fixOptions(options);
+
+		var
+
+			// Convert to bytes if message is a string
+			m = (
+				message.constructor == String ?
+				UTF8.stringToBytes(message) :
+				message
+			),
+
+			// Generate random IV
+			iv = options.iv || util.randomBytes(AES._blocksize * 4),
+
+			// Generate key
+			k = (
+				password.constructor == String ?
+				// Derive key from passphrase
+				C.PBKDF2(password, iv, 32, { asBytes: true }) :
+				// else, assume byte array representing cryptographic key
+				password
+			);
+
+		// Encrypt
+		AES._init(k);
+		mode.encrypt(AES, m, iv);
+
+		// Return ciphertext
+		m = options.iv ? m : iv.concat(m);
+		return (options && options.asBytes) ? m : util.bytesToBase64(m);
+
+	},
+
+	decrypt: function (ciphertext, password, options) {
+
+		options = options || {};
+
+		// Determine mode
+		var mode = options.mode || new C.mode.OFB;
+
+		// Allow mode to override options
+		if (mode.fixOptions) mode.fixOptions(options);
+
+		var
+
+			// Convert to bytes if ciphertext is a string
+			c = (
+				ciphertext.constructor == String ?
+				util.base64ToBytes(ciphertext):
+			    ciphertext
+			),
+
+			// Separate IV and message
+			iv = options.iv || c.splice(0, AES._blocksize * 4),
+
+			// Generate key
+			k = (
+				password.constructor == String ?
+				// Derive key from passphrase
+				C.PBKDF2(password, iv, 32, { asBytes: true }) :
+				// else, assume byte array representing cryptographic key
+				password
+			);
+
+		// Decrypt
+		AES._init(k);
+		mode.decrypt(AES, c, iv);
+
+		// Return plaintext
+		return (options && options.asBytes) ? c : UTF8.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Package private methods and properties
+	 */
+
+	_blocksize: 4,
+
+	_encryptblock: function (m, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = m[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = SBOX[state[row][col]];
+			}
+
+			// Shift rows
+			state[1].push(state[1].shift());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].unshift(state[3].pop());
+
+			// Mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
+				state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
+				state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
+				state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
+
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[round * 4 + col][row];
+			}
+
+		}
+
+		// Sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = SBOX[state[row][col]];
+		}
+
+		// Shift rows
+		state[1].push(state[1].shift());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].unshift(state[3].pop());
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				m[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+	_decryptblock: function (c, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = c[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Inv shift rows
+			state[1].unshift(state[1].pop());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].push(state[3].shift());
+
+			// Inv sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = INVSBOX[state[row][col]];
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
+			}
+
+			// Inv mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
+				state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
+				state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
+				state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
+
+			}
+
+		}
+
+		// Inv shift rows
+		state[1].unshift(state[1].pop());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].push(state[3].shift());
+
+		// Inv sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = INVSBOX[state[row][col]];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				c[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+
+	/**
+	 * Private methods
+	 */
+
+	_init: function (k) {
+		keylength = k.length / 4;
+		nrounds = keylength + 6;
+		AES._keyexpansion(k);
+	},
+
+	// Generate a key schedule
+	_keyexpansion: function (k) {
+
+		keyschedule = [];
+
+		for (var row = 0; row < keylength; row++) {
+			keyschedule[row] = [
+				k[row * 4],
+				k[row * 4 + 1],
+				k[row * 4 + 2],
+				k[row * 4 + 3]
+			];
+		}
+
+		for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
+
+			var temp = [
+				keyschedule[row - 1][0],
+				keyschedule[row - 1][1],
+				keyschedule[row - 1][2],
+				keyschedule[row - 1][3]
+			];
+
+			if (row % keylength == 0) {
+
+				// Rot word
+				temp.push(temp.shift());
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+				temp[0] ^= RCON[row / keylength];
+
+			} else if (keylength > 6 && row % keylength == 4) {
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+			}
+
+			keyschedule[row] = [
+				keyschedule[row - keylength][0] ^ temp[0],
+				keyschedule[row - keylength][1] ^ temp[1],
+				keyschedule[row - keylength][2] ^ temp[2],
+				keyschedule[row - keylength][3] ^ temp[3]
+			];
+
+		}
+
+	}
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js b/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js
index 1866d2e..1150c20 100755
--- a/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js	
+++ b/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(h){function l(c,a){var b=c._blocksize*4;return b-a.length%b}var j=h.pad={},g=function(c){for(var a=c.pop(),b=1;b0;d--)a.push(0)},unpad:function(){}};j.iso7816={pad:function(c,a){var b=l(c,a);for(a.push(128);b>1;b--)a.push(0)},unpad:function(c){for(;c.pop()!=128;);}};j.ansix923={pad:function(c,a){for(var b=l(c,a),d=1;d0; reqd--) {
-                message.push(0x00);
-            }
-        }
-    },
-
-    unpad : function (message) {}
-};
-
-// ISO/IEC 7816-4 padding.
-//
-// Pads the plain text with an 0x80 byte followed by as many 0x00
-// bytes are required to complete the block.
-C_pad.iso7816 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        message.push(0x80);
-        for (; reqd > 1; reqd--) {
-            message.push(0x00);
-        }
-    },
-
-    unpad : function (message) {
-        while (message.pop() != 0x80) {}
-    }
-};
-
-// ANSI X.923 padding
-//
-// The final block is padded with zeros except for the last byte of the
-// last block which contains the number of padding bytes.
-C_pad.ansix923 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 1; i < reqd; i++) {
-            message.push(0x00);
-        }
-        message.push(reqd);
-    },
-
-    unpad : _unpadLength
-};
-
-// ISO 10126
-//
-// The final block is padded with random bytes except for the last
-// byte of the last block which contains the number of padding bytes.
-C_pad.iso10126 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 1; i < reqd; i++) {
-            message.push(Math.floor(Math.random() * 256));
-        }
-        message.push(reqd);
-    },
-
-    unpad : _unpadLength
-};
-
-// PKCS7 padding
-//
-// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
-// value of each added byte is the number of bytes that are added,
-// i.e. N bytes, each of value N are added.
-C_pad.pkcs7 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 0; i < reqd; i++) {
-            message.push(reqd);
-        }
-    },
-
-    unpad : _unpadLength
-};
-
-// Create mode namespace
-var C_mode = C.mode = {};
-
-/**
- * Mode base "class".
- */
-var Mode = C_mode.Mode = function (padding) {
-    if (padding) {
-        this._padding = padding;
-    }
-};
-
-Mode.prototype = {
-    encrypt: function (cipher, m, iv) {
-        this._padding.pad(cipher, m);
-        this._doEncrypt(cipher, m, iv);
-    },
-
-    decrypt: function (cipher, m, iv) {
-        this._doDecrypt(cipher, m, iv);
-        this._padding.unpad(m);
-    },
-
-    // Default padding
-    _padding: C_pad.iso7816
-};
-
-
-/**
- * Electronic Code Book mode.
- * 
- * ECB applies the cipher directly against each block of the input.
- * 
- * ECB does not require an initialization vector.
- */
-var ECB = C_mode.ECB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var ECB_prototype = ECB.prototype = new Mode;
-
-// Concrete steps for Mode template
-ECB_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-    // Encrypt each block
-    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-        cipher._encryptblock(m, offset);
-    }
-};
-ECB_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-    // Decrypt each block
-    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-        cipher._decryptblock(c, offset);
-    }
-};
-
-// ECB never uses an IV
-ECB_prototype.fixOptions = function (options) {
-    options.iv = [];
-};
-
-
-/**
- * Cipher block chaining
- * 
- * The first block is XORed with the IV. Subsequent blocks are XOR with the
- * previous cipher output.
- */
-var CBC = C_mode.CBC = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CBC_prototype = CBC.prototype = new Mode;
-
-// Concrete steps for Mode template
-CBC_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    // Encrypt each block
-    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-        if (offset == 0) {
-            // XOR first block using IV
-            for (var i = 0; i < blockSizeInBytes; i++)
-            m[i] ^= iv[i];
-        } else {
-            // XOR this block using previous crypted block
-            for (var i = 0; i < blockSizeInBytes; i++)
-            m[offset + i] ^= m[offset + i - blockSizeInBytes];
-        }
-        // Encrypt block
-        cipher._encryptblock(m, offset);
-    }
-};
-CBC_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    // At the start, the previously crypted block is the IV
-    var prevCryptedBlock = iv;
-
-    // Decrypt each block
-    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-        // Save this crypted block
-        var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
-        // Decrypt block
-        cipher._decryptblock(c, offset);
-        // XOR decrypted block using previous crypted block
-        for (var i = 0; i < blockSizeInBytes; i++) {
-            c[offset + i] ^= prevCryptedBlock[i];
-        }
-        prevCryptedBlock = thisCryptedBlock;
-    }
-};
-
-
-/**
- * Cipher feed back
- * 
- * The cipher output is XORed with the plain text to produce the cipher output,
- * which is then fed back into the cipher to produce a bit pattern to XOR the
- * next block with.
- * 
- * This is a stream cipher mode and does not require padding.
- */
-var CFB = C_mode.CFB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CFB_prototype = CFB.prototype = new Mode;
-
-// Override padding
-CFB_prototype._padding = C_pad.NoPadding;
-
-// Concrete steps for Mode template
-CFB_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < m.length; i++) {
-
-        var j = i % blockSizeInBytes;
-        if (j == 0) cipher._encryptblock(keystream, 0);
-
-        m[i] ^= keystream[j];
-        keystream[j] = m[i];
-    }
-};
-CFB_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < c.length; i++) {
-
-        var j = i % blockSizeInBytes;
-        if (j == 0) cipher._encryptblock(keystream, 0);
-
-        var b = c[i];
-        c[i] ^= keystream[j];
-        keystream[j] = b;
-    }
-};
-
-
-/**
- * Output feed back
- * 
- * The cipher repeatedly encrypts its own output. The output is XORed with the
- * plain text to produce the cipher text.
- * 
- * This is a stream cipher mode and does not require padding.
- */
-var OFB = C_mode.OFB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var OFB_prototype = OFB.prototype = new Mode;
-
-// Override padding
-OFB_prototype._padding = C_pad.NoPadding;
-
-// Concrete steps for Mode template
-OFB_prototype._doEncrypt = function (cipher, m, iv) {
-
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < m.length; i++) {
-
-        // Generate keystream
-        if (i % blockSizeInBytes == 0)
-            cipher._encryptblock(keystream, 0);
-
-        // Encrypt byte
-        m[i] ^= keystream[i % blockSizeInBytes];
-
-    }
-};
-OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
-
-/**
- * Counter
- * @author Gergely Risko
- *
- * After every block the last 4 bytes of the IV is increased by one
- * with carry and that IV is used for the next block.
- *
- * This is a stream cipher mode and does not require padding.
- */
-var CTR = C_mode.CTR = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CTR_prototype = CTR.prototype = new Mode;
-
-// Override padding
-CTR_prototype._padding = C_pad.NoPadding;
-
-CTR_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    for (var i = 0; i < m.length;) {
-        // do not lose iv
-        var keystream = iv.slice(0);
-
-        // Generate keystream for next block
-        cipher._encryptblock(keystream, 0);
-
-        // XOR keystream with block
-        for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
-            m[i] ^= keystream[j];
-        }
-
-        // Increase IV
-        if(++(iv[blockSizeInBytes-1]) == 256) {
-            iv[blockSizeInBytes-1] = 0;
-            if(++(iv[blockSizeInBytes-2]) == 256) {
-                iv[blockSizeInBytes-2] = 0;
-                if(++(iv[blockSizeInBytes-3]) == 256) {
-                    iv[blockSizeInBytes-3] = 0;
-                    ++(iv[blockSizeInBytes-4]);
-                }
-            }
-        }
-    }
-};
-CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
-
-})(Crypto);
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+/*!
+ * Crypto-JS contribution from Simon Greatrix
+ */
+
+(function(C){
+
+// Create pad namespace
+var C_pad = C.pad = {};
+
+// Calculate the number of padding bytes required.
+function _requiredPadding(cipher, message) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    var reqd = blockSizeInBytes - message.length % blockSizeInBytes;
+    return reqd;
+};
+
+// Remove padding when the final byte gives the number of padding bytes.
+var _unpadLength = function (message) {
+        var pad = message.pop();
+        for (var i = 1; i < pad; i++) {
+            message.pop();
+        }
+    };
+
+// No-operation padding, used for stream ciphers
+C_pad.NoPadding = {
+        pad : function (cipher,message) {},
+        unpad : function (message) {}
+    };
+
+// Zero Padding.
+//
+// If the message is not an exact number of blocks, the final block is
+// completed with 0x00 bytes. There is no unpadding.
+C_pad.ZeroPadding = {
+    pad : function (cipher, message) {
+        var blockSizeInBytes = cipher._blocksize * 4;
+        var reqd = message.length % blockSizeInBytes;
+        if( reqd!=0 ) {
+            for(reqd = blockSizeInBytes - reqd; reqd>0; reqd--) {
+                message.push(0x00);
+            }
+        }
+    },
+
+    unpad : function (message) {}
+};
+
+// ISO/IEC 7816-4 padding.
+//
+// Pads the plain text with an 0x80 byte followed by as many 0x00
+// bytes are required to complete the block.
+C_pad.iso7816 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        message.push(0x80);
+        for (; reqd > 1; reqd--) {
+            message.push(0x00);
+        }
+    },
+
+    unpad : function (message) {
+        while (message.pop() != 0x80) {}
+    }
+};
+
+// ANSI X.923 padding
+//
+// The final block is padded with zeros except for the last byte of the
+// last block which contains the number of padding bytes.
+C_pad.ansix923 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 1; i < reqd; i++) {
+            message.push(0x00);
+        }
+        message.push(reqd);
+    },
+
+    unpad : _unpadLength
+};
+
+// ISO 10126
+//
+// The final block is padded with random bytes except for the last
+// byte of the last block which contains the number of padding bytes.
+C_pad.iso10126 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 1; i < reqd; i++) {
+            message.push(Math.floor(Math.random() * 256));
+        }
+        message.push(reqd);
+    },
+
+    unpad : _unpadLength
+};
+
+// PKCS7 padding
+//
+// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
+// value of each added byte is the number of bytes that are added,
+// i.e. N bytes, each of value N are added.
+C_pad.pkcs7 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 0; i < reqd; i++) {
+            message.push(reqd);
+        }
+    },
+
+    unpad : _unpadLength
+};
+
+// Create mode namespace
+var C_mode = C.mode = {};
+
+/**
+ * Mode base "class".
+ */
+var Mode = C_mode.Mode = function (padding) {
+    if (padding) {
+        this._padding = padding;
+    }
+};
+
+Mode.prototype = {
+    encrypt: function (cipher, m, iv) {
+        this._padding.pad(cipher, m);
+        this._doEncrypt(cipher, m, iv);
+    },
+
+    decrypt: function (cipher, m, iv) {
+        this._doDecrypt(cipher, m, iv);
+        this._padding.unpad(m);
+    },
+
+    // Default padding
+    _padding: C_pad.iso7816
+};
+
+
+/**
+ * Electronic Code Book mode.
+ * 
+ * ECB applies the cipher directly against each block of the input.
+ * 
+ * ECB does not require an initialization vector.
+ */
+var ECB = C_mode.ECB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var ECB_prototype = ECB.prototype = new Mode;
+
+// Concrete steps for Mode template
+ECB_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    // Encrypt each block
+    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+        cipher._encryptblock(m, offset);
+    }
+};
+ECB_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    // Decrypt each block
+    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+        cipher._decryptblock(c, offset);
+    }
+};
+
+// ECB never uses an IV
+ECB_prototype.fixOptions = function (options) {
+    options.iv = [];
+};
+
+
+/**
+ * Cipher block chaining
+ * 
+ * The first block is XORed with the IV. Subsequent blocks are XOR with the
+ * previous cipher output.
+ */
+var CBC = C_mode.CBC = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CBC_prototype = CBC.prototype = new Mode;
+
+// Concrete steps for Mode template
+CBC_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    // Encrypt each block
+    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+        if (offset == 0) {
+            // XOR first block using IV
+            for (var i = 0; i < blockSizeInBytes; i++)
+            m[i] ^= iv[i];
+        } else {
+            // XOR this block using previous crypted block
+            for (var i = 0; i < blockSizeInBytes; i++)
+            m[offset + i] ^= m[offset + i - blockSizeInBytes];
+        }
+        // Encrypt block
+        cipher._encryptblock(m, offset);
+    }
+};
+CBC_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    // At the start, the previously crypted block is the IV
+    var prevCryptedBlock = iv;
+
+    // Decrypt each block
+    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+        // Save this crypted block
+        var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
+        // Decrypt block
+        cipher._decryptblock(c, offset);
+        // XOR decrypted block using previous crypted block
+        for (var i = 0; i < blockSizeInBytes; i++) {
+            c[offset + i] ^= prevCryptedBlock[i];
+        }
+        prevCryptedBlock = thisCryptedBlock;
+    }
+};
+
+
+/**
+ * Cipher feed back
+ * 
+ * The cipher output is XORed with the plain text to produce the cipher output,
+ * which is then fed back into the cipher to produce a bit pattern to XOR the
+ * next block with.
+ * 
+ * This is a stream cipher mode and does not require padding.
+ */
+var CFB = C_mode.CFB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CFB_prototype = CFB.prototype = new Mode;
+
+// Override padding
+CFB_prototype._padding = C_pad.NoPadding;
+
+// Concrete steps for Mode template
+CFB_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < m.length; i++) {
+
+        var j = i % blockSizeInBytes;
+        if (j == 0) cipher._encryptblock(keystream, 0);
+
+        m[i] ^= keystream[j];
+        keystream[j] = m[i];
+    }
+};
+CFB_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < c.length; i++) {
+
+        var j = i % blockSizeInBytes;
+        if (j == 0) cipher._encryptblock(keystream, 0);
+
+        var b = c[i];
+        c[i] ^= keystream[j];
+        keystream[j] = b;
+    }
+};
+
+
+/**
+ * Output feed back
+ * 
+ * The cipher repeatedly encrypts its own output. The output is XORed with the
+ * plain text to produce the cipher text.
+ * 
+ * This is a stream cipher mode and does not require padding.
+ */
+var OFB = C_mode.OFB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var OFB_prototype = OFB.prototype = new Mode;
+
+// Override padding
+OFB_prototype._padding = C_pad.NoPadding;
+
+// Concrete steps for Mode template
+OFB_prototype._doEncrypt = function (cipher, m, iv) {
+
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < m.length; i++) {
+
+        // Generate keystream
+        if (i % blockSizeInBytes == 0)
+            cipher._encryptblock(keystream, 0);
+
+        // Encrypt byte
+        m[i] ^= keystream[i % blockSizeInBytes];
+
+    }
+};
+OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
+
+/**
+ * Counter
+ * @author Gergely Risko
+ *
+ * After every block the last 4 bytes of the IV is increased by one
+ * with carry and that IV is used for the next block.
+ *
+ * This is a stream cipher mode and does not require padding.
+ */
+var CTR = C_mode.CTR = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CTR_prototype = CTR.prototype = new Mode;
+
+// Override padding
+CTR_prototype._padding = C_pad.NoPadding;
+
+CTR_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    for (var i = 0; i < m.length;) {
+        // do not lose iv
+        var keystream = iv.slice(0);
+
+        // Generate keystream for next block
+        cipher._encryptblock(keystream, 0);
+
+        // XOR keystream with block
+        for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
+            m[i] ^= keystream[j];
+        }
+
+        // Increase IV
+        if(++(iv[blockSizeInBytes-1]) == 256) {
+            iv[blockSizeInBytes-1] = 0;
+            if(++(iv[blockSizeInBytes-2]) == 256) {
+                iv[blockSizeInBytes-2] = 0;
+                if(++(iv[blockSizeInBytes-3]) == 256) {
+                    iv[blockSizeInBytes-3] = 0;
+                    ++(iv[blockSizeInBytes-4]);
+                }
+            }
+        }
+    }
+};
+CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
+
+})(Crypto);
diff --git a/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js b/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js
index 71ebcf2..c87094f 100755
--- a/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},o=n.util={rotl:function(h,i){return h<>>32-i},rotr:function(h,i){return h<<32-i|h>>>i},endian:function(h){if(h.constructor==Number)return o.rotl(h,8)&16711935|o.rotl(h,24)&4278255360;for(var i=0;i0;h--)i.push(Math.floor(Math.random()*256));return i},bytesToWords:function(h){for(var i=[],g=0,a=0;g>>5]|=h[g]<<24-
 a%32;return i},wordsToBytes:function(h){for(var i=[],g=0;g>>5]>>>24-g%32&255);return i},bytesToHex:function(h){for(var i=[],g=0;g>>4).toString(16));i.push((h[g]&15).toString(16))}return i.join("")},hexToBytes:function(h){for(var i=[],g=0;g>>6*(3-b)&63)):i.push("=");return i.join("")},base64ToBytes:function(h){if(typeof atob=="function")return p.stringToBytes(atob(h));h=h.replace(/[^A-Z0-9+\/]/ig,"");for(var i=[],g=0,a=0;g>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js b/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js
index f964a50..1d00820 100755
--- a/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},o=n.util={rotl:function(g,i){return g<>>32-i},rotr:function(g,i){return g<<32-i|g>>>i},endian:function(g){if(g.constructor==Number)return o.rotl(g,8)&16711935|o.rotl(g,24)&4278255360;for(var i=0;i0;g--)i.push(Math.floor(Math.random()*256));return i},bytesToWords:function(g){for(var i=[],h=0,a=0;h>>5]|=g[h]<<24-
 a%32;return i},wordsToBytes:function(g){for(var i=[],h=0;h>>5]>>>24-h%32&255);return i},bytesToHex:function(g){for(var i=[],h=0;h>>4).toString(16));i.push((g[h]&15).toString(16))}return i.join("")},hexToBytes:function(g){for(var i=[],h=0;h>>6*(3-b)&63)):i.push("=");return i.join("")},base64ToBytes:function(g){if(typeof atob=="function")return p.stringToBytes(atob(g));g=g.replace(/[^A-Z0-9+\/]/ig,"");for(var i=[],h=0,a=0;h>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js
index 608a7ad..4287cea 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},q=n.util={rotl:function(f,j){return f<>>32-j},rotr:function(f,j){return f<<32-j|f>>>j},endian:function(f){if(f.constructor==Number)return q.rotl(f,8)&16711935|q.rotl(f,24)&4278255360;for(var j=0;j0;f--)j.push(Math.floor(Math.random()*256));return j},bytesToWords:function(f){for(var j=[],b=0,a=0;b>>5]|=f[b]<<24-
 a%32;return j},wordsToBytes:function(f){for(var j=[],b=0;b>>5]>>>24-b%32&255);return j},bytesToHex:function(f){for(var j=[],b=0;b>>4).toString(16));j.push((f[b]&15).toString(16))}return j.join("")},hexToBytes:function(f){for(var j=[],b=0;b>>6*(3-e)&63)):j.push("=");return j.join("")},base64ToBytes:function(f){if(typeof atob=="function")return p.stringToBytes(atob(f));f=f.replace(/[^A-Z0-9+\/]/ig,"");for(var j=[],b=0,a=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js
index 650d03f..7006067 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var h=window.Crypto={},k=h.util={rotl:function(b,d){return b<>>32-d},rotr:function(b,d){return b<<32-d|b>>>d},endian:function(b){if(b.constructor==Number)return k.rotl(b,8)&16711935|k.rotl(b,24)&4278255360;for(var d=0;d0;b--)d.push(Math.floor(Math.random()*256));return d},bytesToWords:function(b){for(var d=[],a=0,e=0;a>>5]|=b[a]<<24-
 e%32;return d},wordsToBytes:function(b){for(var d=[],a=0;a>>5]>>>24-a%32&255);return d},bytesToHex:function(b){for(var d=[],a=0;a>>4).toString(16));d.push((b[a]&15).toString(16))}return d.join("")},hexToBytes:function(b){for(var d=[],a=0;a>>6*(3-c)&63)):d.push("=");return d.join("")},base64ToBytes:function(b){if(typeof atob=="function")return l.stringToBytes(atob(b));b=b.replace(/[^A-Z0-9+\/]/ig,"");for(var d=[],a=0,e=0;a>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js
index 88d5aae..651dc5e 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var i=window.Crypto={},j=i.util={rotl:function(b,c){return b<>>32-c},rotr:function(b,c){return b<<32-c|b>>>c},endian:function(b){if(b.constructor==Number)return j.rotl(b,8)&16711935|j.rotl(b,24)&4278255360;for(var c=0;c0;b--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(b){for(var c=[],e=0,g=0;e>>5]|=b[e]<<24-
 g%32;return c},wordsToBytes:function(b){for(var c=[],e=0;e>>5]>>>24-e%32&255);return c},bytesToHex:function(b){for(var c=[],e=0;e>>4).toString(16));c.push((b[e]&15).toString(16))}return c.join("")},hexToBytes:function(b){for(var c=[],e=0;e>>6*(3-a)&63)):c.push("=");return c.join("")},base64ToBytes:function(b){if(typeof atob=="function")return m.stringToBytes(atob(b));b=b.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],e=0,g=0;e>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js
index 58c00ec..dcc018b 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var g=window.Crypto={},m=g.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return m.rotl(a,8)&16711935|m.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return k.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js
index 8d416b0..397a848 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var f=window.Crypto={},n=f.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return l.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js
index 6a5a49c..094a430 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var i=window.Crypto={},n=i.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return j.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js b/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js
index 7a99356..52ed1c1 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var k=window.Crypto={},l=k.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return l.rotl(a,8)&16711935|l.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return m.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js b/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js
index fefdcfb..73aaa61 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var h=window.Crypto={},n=h.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,f=0;b>>5]|=a[b]<<24-
 f%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-d)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return l.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,f=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js b/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js
index 64dc0d8..873a1bb 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var j=window.Crypto={},m=j.util={rotl:function(a,b){return a<>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return m.rotl(a,8)&16711935|m.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,f=0;c>>5]|=a[c]<<24-
 f%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-d)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return n.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,f=0;c>>
diff --git a/tools/Crypto-JS v2.4.0/crypto/crypto-min.js b/tools/Crypto-JS v2.4.0/crypto/crypto-min.js
index a9a70f0..e194fb3 100755
--- a/tools/Crypto-JS v2.4.0/crypto/crypto-min.js	
+++ b/tools/Crypto-JS v2.4.0/crypto/crypto-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var e=window.Crypto={},h=e.util={rotl:function(a,b){return a<>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return h.rotl(a,8)&16711935|h.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,d=0;c>>5]|=a[c]<<24-
 d%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-g)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return f.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,d=0;c>>
diff --git a/tools/Crypto-JS v2.4.0/crypto/crypto.js b/tools/Crypto-JS v2.4.0/crypto/crypto.js
index e8090fe..35d5216 100755
--- a/tools/Crypto-JS v2.4.0/crypto/crypto.js	
+++ b/tools/Crypto-JS v2.4.0/crypto/crypto.js	
@@ -1,160 +1,160 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-if (typeof Crypto == "undefined" || ! Crypto.util)
-{
-(function(){
-
-var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-
-// Global Crypto object
-var Crypto = window.Crypto = {};
-
-// Crypto utilities
-var util = Crypto.util = {
-
-	// Bit-wise rotate left
-	rotl: function (n, b) {
-		return (n << b) | (n >>> (32 - b));
-	},
-
-	// Bit-wise rotate right
-	rotr: function (n, b) {
-		return (n << (32 - b)) | (n >>> b);
-	},
-
-	// Swap big-endian to little-endian and vice versa
-	endian: function (n) {
-
-		// If number given, swap endian
-		if (n.constructor == Number) {
-			return util.rotl(n,  8) & 0x00FF00FF |
-			       util.rotl(n, 24) & 0xFF00FF00;
-		}
-
-		// Else, assume array and swap all items
-		for (var i = 0; i < n.length; i++)
-			n[i] = util.endian(n[i]);
-		return n;
-
-	},
-
-	// Generate an array of any length of random bytes
-	randomBytes: function (n) {
-		for (var bytes = []; n > 0; n--)
-			bytes.push(Math.floor(Math.random() * 256));
-		return bytes;
-	},
-
-	// Convert a byte array to big-endian 32-bit words
-	bytesToWords: function (bytes) {
-		for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
-			words[b >>> 5] |= bytes[i] << (24 - b % 32);
-		return words;
-	},
-
-	// Convert big-endian 32-bit words to a byte array
-	wordsToBytes: function (words) {
-		for (var bytes = [], b = 0; b < words.length * 32; b += 8)
-			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
-		return bytes;
-	},
-
-	// Convert a byte array to a hex string
-	bytesToHex: function (bytes) {
-		for (var hex = [], i = 0; i < bytes.length; i++) {
-			hex.push((bytes[i] >>> 4).toString(16));
-			hex.push((bytes[i] & 0xF).toString(16));
-		}
-		return hex.join("");
-	},
-
-	// Convert a hex string to a byte array
-	hexToBytes: function (hex) {
-		for (var bytes = [], c = 0; c < hex.length; c += 2)
-			bytes.push(parseInt(hex.substr(c, 2), 16));
-		return bytes;
-	},
-
-	// Convert a byte array to a base-64 string
-	bytesToBase64: function (bytes) {
-
-		// Use browser-native function if it exists
-		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
-
-		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
-			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
-			for (var j = 0; j < 4; j++) {
-				if (i * 8 + j * 6 <= bytes.length * 8)
-					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
-				else base64.push("=");
-			}
-		}
-
-		return base64.join("");
-
-	},
-
-	// Convert a base-64 string to a byte array
-	base64ToBytes: function (base64) {
-
-		// Use browser-native function if it exists
-		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
-
-		// Remove non-base-64 characters
-		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
-
-		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
-			if (imod4 == 0) continue;
-			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
-			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
-		}
-
-		return bytes;
-
-	}
-
-};
-
-// Crypto character encodings
-var charenc = Crypto.charenc = {};
-
-// UTF-8 encoding
-var UTF8 = charenc.UTF8 = {
-
-	// Convert a string to a byte array
-	stringToBytes: function (str) {
-		return Binary.stringToBytes(unescape(encodeURIComponent(str)));
-	},
-
-	// Convert a byte array to a string
-	bytesToString: function (bytes) {
-		return decodeURIComponent(escape(Binary.bytesToString(bytes)));
-	}
-
-};
-
-// Binary encoding
-var Binary = charenc.Binary = {
-
-	// Convert a string to a byte array
-	stringToBytes: function (str) {
-		for (var bytes = [], i = 0; i < str.length; i++)
-			bytes.push(str.charCodeAt(i) & 0xFF);
-		return bytes;
-	},
-
-	// Convert a byte array to a string
-	bytesToString: function (bytes) {
-		for (var str = [], i = 0; i < bytes.length; i++)
-			str.push(String.fromCharCode(bytes[i]));
-		return str.join("");
-	}
-
-};
-
-})();
-}
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+if (typeof Crypto == "undefined" || ! Crypto.util)
+{
+(function(){
+
+var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+// Global Crypto object
+var Crypto = window.Crypto = {};
+
+// Crypto utilities
+var util = Crypto.util = {
+
+	// Bit-wise rotate left
+	rotl: function (n, b) {
+		return (n << b) | (n >>> (32 - b));
+	},
+
+	// Bit-wise rotate right
+	rotr: function (n, b) {
+		return (n << (32 - b)) | (n >>> b);
+	},
+
+	// Swap big-endian to little-endian and vice versa
+	endian: function (n) {
+
+		// If number given, swap endian
+		if (n.constructor == Number) {
+			return util.rotl(n,  8) & 0x00FF00FF |
+			       util.rotl(n, 24) & 0xFF00FF00;
+		}
+
+		// Else, assume array and swap all items
+		for (var i = 0; i < n.length; i++)
+			n[i] = util.endian(n[i]);
+		return n;
+
+	},
+
+	// Generate an array of any length of random bytes
+	randomBytes: function (n) {
+		for (var bytes = []; n > 0; n--)
+			bytes.push(Math.floor(Math.random() * 256));
+		return bytes;
+	},
+
+	// Convert a byte array to big-endian 32-bit words
+	bytesToWords: function (bytes) {
+		for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
+			words[b >>> 5] |= bytes[i] << (24 - b % 32);
+		return words;
+	},
+
+	// Convert big-endian 32-bit words to a byte array
+	wordsToBytes: function (words) {
+		for (var bytes = [], b = 0; b < words.length * 32; b += 8)
+			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+		return bytes;
+	},
+
+	// Convert a byte array to a hex string
+	bytesToHex: function (bytes) {
+		for (var hex = [], i = 0; i < bytes.length; i++) {
+			hex.push((bytes[i] >>> 4).toString(16));
+			hex.push((bytes[i] & 0xF).toString(16));
+		}
+		return hex.join("");
+	},
+
+	// Convert a hex string to a byte array
+	hexToBytes: function (hex) {
+		for (var bytes = [], c = 0; c < hex.length; c += 2)
+			bytes.push(parseInt(hex.substr(c, 2), 16));
+		return bytes;
+	},
+
+	// Convert a byte array to a base-64 string
+	bytesToBase64: function (bytes) {
+
+		// Use browser-native function if it exists
+		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
+
+		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
+			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
+			for (var j = 0; j < 4; j++) {
+				if (i * 8 + j * 6 <= bytes.length * 8)
+					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
+				else base64.push("=");
+			}
+		}
+
+		return base64.join("");
+
+	},
+
+	// Convert a base-64 string to a byte array
+	base64ToBytes: function (base64) {
+
+		// Use browser-native function if it exists
+		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
+
+		// Remove non-base-64 characters
+		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
+
+		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
+			if (imod4 == 0) continue;
+			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
+			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
+		}
+
+		return bytes;
+
+	}
+
+};
+
+// Crypto character encodings
+var charenc = Crypto.charenc = {};
+
+// UTF-8 encoding
+var UTF8 = charenc.UTF8 = {
+
+	// Convert a string to a byte array
+	stringToBytes: function (str) {
+		return Binary.stringToBytes(unescape(encodeURIComponent(str)));
+	},
+
+	// Convert a byte array to a string
+	bytesToString: function (bytes) {
+		return decodeURIComponent(escape(Binary.bytesToString(bytes)));
+	}
+
+};
+
+// Binary encoding
+var Binary = charenc.Binary = {
+
+	// Convert a string to a byte array
+	stringToBytes: function (str) {
+		for (var bytes = [], i = 0; i < str.length; i++)
+			bytes.push(str.charCodeAt(i) & 0xFF);
+		return bytes;
+	},
+
+	// Convert a byte array to a string
+	bytesToString: function (bytes) {
+		for (var str = [], i = 0; i < bytes.length; i++)
+			str.push(String.fromCharCode(bytes[i]));
+		return str.join("");
+	}
+
+};
+
+})();
+}
diff --git a/tools/Crypto-JS v2.4.0/hmac/hmac-min.js b/tools/Crypto-JS v2.4.0/hmac/hmac-min.js
index 0becfbc..da13e60 100755
--- a/tools/Crypto-JS v2.4.0/hmac/hmac-min.js	
+++ b/tools/Crypto-JS v2.4.0/hmac/hmac-min.js	
@@ -1,7 +1,7 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var f=Crypto,j=f.util,g=f.charenc,h=g.UTF8,k=g.Binary;f.HMAC=function(b,c,a,d){if(c.constructor==String)c=h.stringToBytes(c);if(a.constructor==String)a=h.stringToBytes(a);if(a.length>b._blocksize*4)a=b(a,{asBytes:true});var i=a.slice(0);a=a.slice(0);for(var e=0;e hasher._blocksize * 4)
-		key = hasher(key, { asBytes: true });
-
-	// XOR keys with pad constants
-	var okey = key.slice(0),
-	    ikey = key.slice(0);
-	for (var i = 0; i < hasher._blocksize * 4; i++) {
-		okey[i] ^= 0x5C;
-		ikey[i] ^= 0x36;
-	}
-
-	var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
-
-	return options && options.asBytes ? hmacbytes :
-	       options && options.asString ? Binary.bytesToString(hmacbytes) :
-	       util.bytesToHex(hmacbytes);
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+C.HMAC = function (hasher, message, key, options) {
+
+	// Convert to byte arrays
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	if (key.constructor == String) key = UTF8.stringToBytes(key);
+	/* else, assume byte arrays already */
+
+	// Allow arbitrary length keys
+	if (key.length > hasher._blocksize * 4)
+		key = hasher(key, { asBytes: true });
+
+	// XOR keys with pad constants
+	var okey = key.slice(0),
+	    ikey = key.slice(0);
+	for (var i = 0; i < hasher._blocksize * 4; i++) {
+		okey[i] ^= 0x5C;
+		ikey[i] ^= 0x36;
+	}
+
+	var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
+
+	return options && options.asBytes ? hmacbytes :
+	       options && options.asString ? Binary.bytesToString(hmacbytes) :
+	       util.bytesToHex(hmacbytes);
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/marc4/marc4-min.js b/tools/Crypto-JS v2.4.0/marc4/marc4-min.js
index dfcff6a..96d1066 100755
--- a/tools/Crypto-JS v2.4.0/marc4/marc4-min.js	
+++ b/tools/Crypto-JS v2.4.0/marc4/marc4-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var g=Crypto,i=g.util,j=g.charenc.UTF8,k=g.MARC4={encrypt:function(f,b){var e=j.stringToBytes(f),a=i.randomBytes(16),d=b.constructor==String?g.PBKDF2(b,a,32,{asBytes:true}):b;k._marc4(e,d,1536);return i.bytesToBase64(a.concat(e))},decrypt:function(f,b){var e=i.base64ToBytes(f),a=e.splice(0,16);a=b.constructor==String?g.PBKDF2(b,a,32,{asBytes:true}):b;k._marc4(e,a,1536);return j.bytesToString(e)},_marc4:function(f,b,e){var a,d,c,h;a=0;for(c=[];a<256;a++)c[a]=a;for(d=a=0;a<256;a++){d=(d+
 c[a]+b[a%b.length])%256;h=c[a];c[a]=c[d];c[d]=h}a=d=0;for(b=-e;b>>24)&16711935|(e[f]<<24|e[f]>>>8)&4278255360;e[g>>>5]|=128<>>9<<4)+14]=g;g=k._ff;var h=k._gg,i=
 k._hh,j=k._ii;for(f=0;f>> 24)) & 0x00FF00FF |
-		       ((m[i] << 24) | (m[i] >>>  8)) & 0xFF00FF00;
-	}
-
-	// Padding
-	m[l >>> 5] |= 0x80 << (l % 32);
-	m[(((l + 64) >>> 9) << 4) + 14] = l;
-
-	// Method shortcuts
-	var FF = MD5._ff,
-	    GG = MD5._gg,
-	    HH = MD5._hh,
-	    II = MD5._ii;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		var aa = a,
-		    bb = b,
-		    cc = c,
-		    dd = d;
-
-		a = FF(a, b, c, d, m[i+ 0],  7, -680876936);
-		d = FF(d, a, b, c, m[i+ 1], 12, -389564586);
-		c = FF(c, d, a, b, m[i+ 2], 17,  606105819);
-		b = FF(b, c, d, a, m[i+ 3], 22, -1044525330);
-		a = FF(a, b, c, d, m[i+ 4],  7, -176418897);
-		d = FF(d, a, b, c, m[i+ 5], 12,  1200080426);
-		c = FF(c, d, a, b, m[i+ 6], 17, -1473231341);
-		b = FF(b, c, d, a, m[i+ 7], 22, -45705983);
-		a = FF(a, b, c, d, m[i+ 8],  7,  1770035416);
-		d = FF(d, a, b, c, m[i+ 9], 12, -1958414417);
-		c = FF(c, d, a, b, m[i+10], 17, -42063);
-		b = FF(b, c, d, a, m[i+11], 22, -1990404162);
-		a = FF(a, b, c, d, m[i+12],  7,  1804603682);
-		d = FF(d, a, b, c, m[i+13], 12, -40341101);
-		c = FF(c, d, a, b, m[i+14], 17, -1502002290);
-		b = FF(b, c, d, a, m[i+15], 22,  1236535329);
-
-		a = GG(a, b, c, d, m[i+ 1],  5, -165796510);
-		d = GG(d, a, b, c, m[i+ 6],  9, -1069501632);
-		c = GG(c, d, a, b, m[i+11], 14,  643717713);
-		b = GG(b, c, d, a, m[i+ 0], 20, -373897302);
-		a = GG(a, b, c, d, m[i+ 5],  5, -701558691);
-		d = GG(d, a, b, c, m[i+10],  9,  38016083);
-		c = GG(c, d, a, b, m[i+15], 14, -660478335);
-		b = GG(b, c, d, a, m[i+ 4], 20, -405537848);
-		a = GG(a, b, c, d, m[i+ 9],  5,  568446438);
-		d = GG(d, a, b, c, m[i+14],  9, -1019803690);
-		c = GG(c, d, a, b, m[i+ 3], 14, -187363961);
-		b = GG(b, c, d, a, m[i+ 8], 20,  1163531501);
-		a = GG(a, b, c, d, m[i+13],  5, -1444681467);
-		d = GG(d, a, b, c, m[i+ 2],  9, -51403784);
-		c = GG(c, d, a, b, m[i+ 7], 14,  1735328473);
-		b = GG(b, c, d, a, m[i+12], 20, -1926607734);
-
-		a = HH(a, b, c, d, m[i+ 5],  4, -378558);
-		d = HH(d, a, b, c, m[i+ 8], 11, -2022574463);
-		c = HH(c, d, a, b, m[i+11], 16,  1839030562);
-		b = HH(b, c, d, a, m[i+14], 23, -35309556);
-		a = HH(a, b, c, d, m[i+ 1],  4, -1530992060);
-		d = HH(d, a, b, c, m[i+ 4], 11,  1272893353);
-		c = HH(c, d, a, b, m[i+ 7], 16, -155497632);
-		b = HH(b, c, d, a, m[i+10], 23, -1094730640);
-		a = HH(a, b, c, d, m[i+13],  4,  681279174);
-		d = HH(d, a, b, c, m[i+ 0], 11, -358537222);
-		c = HH(c, d, a, b, m[i+ 3], 16, -722521979);
-		b = HH(b, c, d, a, m[i+ 6], 23,  76029189);
-		a = HH(a, b, c, d, m[i+ 9],  4, -640364487);
-		d = HH(d, a, b, c, m[i+12], 11, -421815835);
-		c = HH(c, d, a, b, m[i+15], 16,  530742520);
-		b = HH(b, c, d, a, m[i+ 2], 23, -995338651);
-
-		a = II(a, b, c, d, m[i+ 0],  6, -198630844);
-		d = II(d, a, b, c, m[i+ 7], 10,  1126891415);
-		c = II(c, d, a, b, m[i+14], 15, -1416354905);
-		b = II(b, c, d, a, m[i+ 5], 21, -57434055);
-		a = II(a, b, c, d, m[i+12],  6,  1700485571);
-		d = II(d, a, b, c, m[i+ 3], 10, -1894986606);
-		c = II(c, d, a, b, m[i+10], 15, -1051523);
-		b = II(b, c, d, a, m[i+ 1], 21, -2054922799);
-		a = II(a, b, c, d, m[i+ 8],  6,  1873313359);
-		d = II(d, a, b, c, m[i+15], 10, -30611744);
-		c = II(c, d, a, b, m[i+ 6], 15, -1560198380);
-		b = II(b, c, d, a, m[i+13], 21,  1309151649);
-		a = II(a, b, c, d, m[i+ 4],  6, -145523070);
-		d = II(d, a, b, c, m[i+11], 10, -1120210379);
-		c = II(c, d, a, b, m[i+ 2], 15,  718787259);
-		b = II(b, c, d, a, m[i+ 9], 21, -343485551);
-
-		a = (a + aa) >>> 0;
-		b = (b + bb) >>> 0;
-		c = (c + cc) >>> 0;
-		d = (d + dd) >>> 0;
-
-	}
-
-	return util.endian([a, b, c, d]);
-
-};
-
-// Auxiliary functions
-MD5._ff  = function (a, b, c, d, x, s, t) {
-	var n = a + (b & c | ~b & d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._gg  = function (a, b, c, d, x, s, t) {
-	var n = a + (b & d | c & ~d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._hh  = function (a, b, c, d, x, s, t) {
-	var n = a + (b ^ c ^ d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._ii  = function (a, b, c, d, x, s, t) {
-	var n = a + (c ^ (b | ~d)) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-
-// Package private blocksize
-MD5._blocksize = 16;
-
-MD5._digestsize = 16;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Public API
+var MD5 = C.MD5 = function (message, options) {
+	var digestbytes = util.wordsToBytes(MD5._md5(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+MD5._md5 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m = util.bytesToWords(message),
+	    l = message.length * 8,
+	    a =  1732584193,
+	    b = -271733879,
+	    c = -1732584194,
+	    d =  271733878;
+
+	// Swap endian
+	for (var i = 0; i < m.length; i++) {
+		m[i] = ((m[i] <<  8) | (m[i] >>> 24)) & 0x00FF00FF |
+		       ((m[i] << 24) | (m[i] >>>  8)) & 0xFF00FF00;
+	}
+
+	// Padding
+	m[l >>> 5] |= 0x80 << (l % 32);
+	m[(((l + 64) >>> 9) << 4) + 14] = l;
+
+	// Method shortcuts
+	var FF = MD5._ff,
+	    GG = MD5._gg,
+	    HH = MD5._hh,
+	    II = MD5._ii;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var aa = a,
+		    bb = b,
+		    cc = c,
+		    dd = d;
+
+		a = FF(a, b, c, d, m[i+ 0],  7, -680876936);
+		d = FF(d, a, b, c, m[i+ 1], 12, -389564586);
+		c = FF(c, d, a, b, m[i+ 2], 17,  606105819);
+		b = FF(b, c, d, a, m[i+ 3], 22, -1044525330);
+		a = FF(a, b, c, d, m[i+ 4],  7, -176418897);
+		d = FF(d, a, b, c, m[i+ 5], 12,  1200080426);
+		c = FF(c, d, a, b, m[i+ 6], 17, -1473231341);
+		b = FF(b, c, d, a, m[i+ 7], 22, -45705983);
+		a = FF(a, b, c, d, m[i+ 8],  7,  1770035416);
+		d = FF(d, a, b, c, m[i+ 9], 12, -1958414417);
+		c = FF(c, d, a, b, m[i+10], 17, -42063);
+		b = FF(b, c, d, a, m[i+11], 22, -1990404162);
+		a = FF(a, b, c, d, m[i+12],  7,  1804603682);
+		d = FF(d, a, b, c, m[i+13], 12, -40341101);
+		c = FF(c, d, a, b, m[i+14], 17, -1502002290);
+		b = FF(b, c, d, a, m[i+15], 22,  1236535329);
+
+		a = GG(a, b, c, d, m[i+ 1],  5, -165796510);
+		d = GG(d, a, b, c, m[i+ 6],  9, -1069501632);
+		c = GG(c, d, a, b, m[i+11], 14,  643717713);
+		b = GG(b, c, d, a, m[i+ 0], 20, -373897302);
+		a = GG(a, b, c, d, m[i+ 5],  5, -701558691);
+		d = GG(d, a, b, c, m[i+10],  9,  38016083);
+		c = GG(c, d, a, b, m[i+15], 14, -660478335);
+		b = GG(b, c, d, a, m[i+ 4], 20, -405537848);
+		a = GG(a, b, c, d, m[i+ 9],  5,  568446438);
+		d = GG(d, a, b, c, m[i+14],  9, -1019803690);
+		c = GG(c, d, a, b, m[i+ 3], 14, -187363961);
+		b = GG(b, c, d, a, m[i+ 8], 20,  1163531501);
+		a = GG(a, b, c, d, m[i+13],  5, -1444681467);
+		d = GG(d, a, b, c, m[i+ 2],  9, -51403784);
+		c = GG(c, d, a, b, m[i+ 7], 14,  1735328473);
+		b = GG(b, c, d, a, m[i+12], 20, -1926607734);
+
+		a = HH(a, b, c, d, m[i+ 5],  4, -378558);
+		d = HH(d, a, b, c, m[i+ 8], 11, -2022574463);
+		c = HH(c, d, a, b, m[i+11], 16,  1839030562);
+		b = HH(b, c, d, a, m[i+14], 23, -35309556);
+		a = HH(a, b, c, d, m[i+ 1],  4, -1530992060);
+		d = HH(d, a, b, c, m[i+ 4], 11,  1272893353);
+		c = HH(c, d, a, b, m[i+ 7], 16, -155497632);
+		b = HH(b, c, d, a, m[i+10], 23, -1094730640);
+		a = HH(a, b, c, d, m[i+13],  4,  681279174);
+		d = HH(d, a, b, c, m[i+ 0], 11, -358537222);
+		c = HH(c, d, a, b, m[i+ 3], 16, -722521979);
+		b = HH(b, c, d, a, m[i+ 6], 23,  76029189);
+		a = HH(a, b, c, d, m[i+ 9],  4, -640364487);
+		d = HH(d, a, b, c, m[i+12], 11, -421815835);
+		c = HH(c, d, a, b, m[i+15], 16,  530742520);
+		b = HH(b, c, d, a, m[i+ 2], 23, -995338651);
+
+		a = II(a, b, c, d, m[i+ 0],  6, -198630844);
+		d = II(d, a, b, c, m[i+ 7], 10,  1126891415);
+		c = II(c, d, a, b, m[i+14], 15, -1416354905);
+		b = II(b, c, d, a, m[i+ 5], 21, -57434055);
+		a = II(a, b, c, d, m[i+12],  6,  1700485571);
+		d = II(d, a, b, c, m[i+ 3], 10, -1894986606);
+		c = II(c, d, a, b, m[i+10], 15, -1051523);
+		b = II(b, c, d, a, m[i+ 1], 21, -2054922799);
+		a = II(a, b, c, d, m[i+ 8],  6,  1873313359);
+		d = II(d, a, b, c, m[i+15], 10, -30611744);
+		c = II(c, d, a, b, m[i+ 6], 15, -1560198380);
+		b = II(b, c, d, a, m[i+13], 21,  1309151649);
+		a = II(a, b, c, d, m[i+ 4],  6, -145523070);
+		d = II(d, a, b, c, m[i+11], 10, -1120210379);
+		c = II(c, d, a, b, m[i+ 2], 15,  718787259);
+		b = II(b, c, d, a, m[i+ 9], 21, -343485551);
+
+		a = (a + aa) >>> 0;
+		b = (b + bb) >>> 0;
+		c = (c + cc) >>> 0;
+		d = (d + dd) >>> 0;
+
+	}
+
+	return util.endian([a, b, c, d]);
+
+};
+
+// Auxiliary functions
+MD5._ff  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & c | ~b & d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._gg  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & d | c & ~d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._hh  = function (a, b, c, d, x, s, t) {
+	var n = a + (b ^ c ^ d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._ii  = function (a, b, c, d, x, s, t) {
+	var n = a + (c ^ (b | ~d)) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+
+// Package private blocksize
+MD5._blocksize = 16;
+
+MD5._digestsize = 16;
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js b/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js
index 169659f..c8b20b6 100755
--- a/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js	
+++ b/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var c=Crypto,i=c.util,j=c.charenc,k=j.UTF8,p=j.Binary;c.PBKDF2=function(d,e,l,a){function m(q,r){return c.HMAC(s,r,q,{asBytes:true})}if(d.constructor==String)d=k.stringToBytes(d);if(e.constructor==String)e=k.stringToBytes(e);for(var s=a&&a.hasher||c.SHA1,t=a&&a.iterations||1,b=[],n=1;b.length>>16^d[3]<<16;c[1]=d[2]^d[7]>>>16^d[5]<<16;c[2]=d[4]^d[1]>>>16^d[7]<<16;c[3]=d[6]^d[3]>>>16^d[1]<<16;for(var e=0;e<4;e++)c[e]=(c[e]<<8|c[e]>>>24)&16711935|(c[e]<<24|c[e]>>>8)&4278255360;for(e=120;e>=0;e-=8)c[e/8]=c[e>>>5]>>>24-e%32&255}a[f]^=c[f%16]}},_keysetup:function(a){d[0]=a[0];d[2]=a[1];d[4]=a[2];d[6]=a[3];d[1]=a[3]<<16|a[2]>>>16;d[3]=a[0]<<16|a[3]>>>16;d[5]=a[1]<<16|a[0]>>>16;d[7]=a[2]<<16|a[1]>>>16;b[0]=g.rotl(a[2],16);
 b[2]=g.rotl(a[3],16);b[4]=g.rotl(a[0],16);b[6]=g.rotl(a[1],16);b[1]=a[0]&4294901760|a[1]&65535;b[3]=a[1]&4294901760|a[2]&65535;b[5]=a[2]&4294901760|a[3]&65535;b[7]=a[3]&4294901760|a[0]&65535;for(a=k=0;a<4;a++)i._nextstate();for(a=0;a<8;a++)b[a]^=d[a+4&7]},_ivsetup:function(a){var c=g.endian(a[0]);a=g.endian(a[1]);var f=c>>>16|a&4294901760,e=a<<16|c&65535;b[0]^=c;b[1]^=f;b[2]^=a;b[3]^=e;b[4]^=c;b[5]^=f;b[6]^=a;b[7]^=e;for(c=0;c<4;c++)i._nextstate()},_nextstate:function(){for(var a=[],c=0;c<8;c++)a[c]=
diff --git a/tools/Crypto-JS v2.4.0/rabbit/rabbit.js b/tools/Crypto-JS v2.4.0/rabbit/rabbit.js
index 87bdefc..1dae96b 100755
--- a/tools/Crypto-JS v2.4.0/rabbit/rabbit.js	
+++ b/tools/Crypto-JS v2.4.0/rabbit/rabbit.js	
@@ -1,226 +1,226 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Inner state
-var x = [],
-    c = [],
-    b;
-
-var Rabbit = C.Rabbit = {
-
-	/**
-	 * Public API
-	 */
-
-	encrypt: function (message, password) {
-
-		var
-
-		    // Convert to bytes
-		    m = UTF8.stringToBytes(message),
-
-		    // Generate random IV
-		    iv = util.randomBytes(8),
-
-		    // Generate key
-		    k = password.constructor == String ?
-		        // Derive key from passphrase
-		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
-		        // else, assume byte array representing cryptographic key
-		        password;
-
-		// Encrypt
-		Rabbit._rabbit(m, k, util.bytesToWords(iv));
-
-		// Return ciphertext
-		return util.bytesToBase64(iv.concat(m));
-
-	},
-
-	decrypt: function (ciphertext, password) {
-
-		var
-
-		    // Convert to bytes
-		    c = util.base64ToBytes(ciphertext),
-
-		    // Separate IV and message
-		    iv = c.splice(0, 8),
-
-		    // Generate key
-		    k = password.constructor == String ?
-		        // Derive key from passphrase
-		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
-		        // else, assume byte array representing cryptographic key
-		        password;
-
-		// Decrypt
-		Rabbit._rabbit(c, k, util.bytesToWords(iv));
-
-		// Return plaintext
-		return UTF8.bytesToString(c);
-
-	},
-
-
-	/**
-	 * Internal methods
-	 */
-
-	// Encryption/decryption scheme
-	_rabbit: function (m, k, iv) {
-
-		Rabbit._keysetup(k);
-		if (iv) Rabbit._ivsetup(iv);
-
-		for (var s = [], i = 0; i < m.length; i++) {
-
-			if (i % 16 == 0) {
-
-				// Iterate the system
-				Rabbit._nextstate();
-
-				// Generate 16 bytes of pseudo-random data
-				s[0] = x[0] ^ (x[5] >>> 16) ^ (x[3] << 16);
-				s[1] = x[2] ^ (x[7] >>> 16) ^ (x[5] << 16);
-				s[2] = x[4] ^ (x[1] >>> 16) ^ (x[7] << 16);
-				s[3] = x[6] ^ (x[3] >>> 16) ^ (x[1] << 16);
-
-				// Swap endian
-				for (var j = 0; j < 4; j++) {
-					s[j] = ((s[j] <<  8) | (s[j] >>> 24)) & 0x00FF00FF |
-					       ((s[j] << 24) | (s[j] >>>  8)) & 0xFF00FF00;
-				}
-
-				// Convert words to bytes
-				for (var b = 120; b >= 0; b -= 8)
-					s[b / 8] = (s[b >>> 5] >>> (24 - b % 32)) & 0xFF;
-
-			}
-
-			m[i] ^= s[i % 16];
-
-		}
-
-	},
-
-	// Key setup scheme
-	_keysetup: function (k) {
-
-		// Generate initial state values
-		x[0] = k[0];
-		x[2] = k[1];
-		x[4] = k[2];
-		x[6] = k[3];
-		x[1] = (k[3] << 16) | (k[2] >>> 16);
-		x[3] = (k[0] << 16) | (k[3] >>> 16);
-		x[5] = (k[1] << 16) | (k[0] >>> 16);
-		x[7] = (k[2] << 16) | (k[1] >>> 16);
-
-		// Generate initial counter values
-		c[0] = util.rotl(k[2], 16);
-		c[2] = util.rotl(k[3], 16);
-		c[4] = util.rotl(k[0], 16);
-		c[6] = util.rotl(k[1], 16);
-		c[1] = (k[0] & 0xFFFF0000) | (k[1] & 0xFFFF);
-		c[3] = (k[1] & 0xFFFF0000) | (k[2] & 0xFFFF);
-		c[5] = (k[2] & 0xFFFF0000) | (k[3] & 0xFFFF);
-		c[7] = (k[3] & 0xFFFF0000) | (k[0] & 0xFFFF);
-
-		// Clear carry bit
-		b = 0;
-
-		// Iterate the system four times
-		for (var i = 0; i < 4; i++) Rabbit._nextstate();
-
-		// Modify the counters
-		for (var i = 0; i < 8; i++) c[i] ^= x[(i + 4) & 7];
-
-	},
-
-	// IV setup scheme
-	_ivsetup: function (iv) {
-
-		// Generate four subvectors
-		var i0 = util.endian(iv[0]),
-		    i2 = util.endian(iv[1]),
-		    i1 = (i0 >>> 16) | (i2 & 0xFFFF0000),
-		    i3 = (i2 <<  16) | (i0 & 0x0000FFFF);
-
-		// Modify counter values
-		c[0] ^= i0;
-		c[1] ^= i1;
-		c[2] ^= i2;
-		c[3] ^= i3;
-		c[4] ^= i0;
-		c[5] ^= i1;
-		c[6] ^= i2;
-		c[7] ^= i3;
-
-		// Iterate the system four times
-		for (var i = 0; i < 4; i++) Rabbit._nextstate();
-
-	},
-
-	// Next-state function
-	_nextstate: function () {
-
-		// Save old counter values
-		for (var c_old = [], i = 0; i < 8; i++) c_old[i] = c[i];
-
-		// Calculate new counter values
-		c[0] = (c[0] + 0x4D34D34D + b) >>> 0;
-		c[1] = (c[1] + 0xD34D34D3 + ((c[0] >>> 0) < (c_old[0] >>> 0) ? 1 : 0)) >>> 0;
-		c[2] = (c[2] + 0x34D34D34 + ((c[1] >>> 0) < (c_old[1] >>> 0) ? 1 : 0)) >>> 0;
-		c[3] = (c[3] + 0x4D34D34D + ((c[2] >>> 0) < (c_old[2] >>> 0) ? 1 : 0)) >>> 0;
-		c[4] = (c[4] + 0xD34D34D3 + ((c[3] >>> 0) < (c_old[3] >>> 0) ? 1 : 0)) >>> 0;
-		c[5] = (c[5] + 0x34D34D34 + ((c[4] >>> 0) < (c_old[4] >>> 0) ? 1 : 0)) >>> 0;
-		c[6] = (c[6] + 0x4D34D34D + ((c[5] >>> 0) < (c_old[5] >>> 0) ? 1 : 0)) >>> 0;
-		c[7] = (c[7] + 0xD34D34D3 + ((c[6] >>> 0) < (c_old[6] >>> 0) ? 1 : 0)) >>> 0;
-		b = (c[7] >>> 0) < (c_old[7] >>> 0) ? 1 : 0;
-
-		// Calculate the g-values
-		for (var g = [], i = 0; i < 8; i++) {
-
-			var gx = (x[i] + c[i]) >>> 0;
-
-			// Construct high and low argument for squaring
-			var ga = gx & 0xFFFF,
-			    gb = gx >>> 16;
-
-			// Calculate high and low result of squaring
-			var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb,
-			    gl = (((gx & 0xFFFF0000) * gx) >>> 0) + (((gx & 0x0000FFFF) * gx) >>> 0) >>> 0;
-
-			// High XOR low
-			g[i] = gh ^ gl;
-
-		}
-
-		// Calculate new state values
-		x[0] = g[0] + ((g[7] << 16) | (g[7] >>> 16)) + ((g[6] << 16) | (g[6] >>> 16));
-		x[1] = g[1] + ((g[0] <<  8) | (g[0] >>> 24)) + g[7];
-		x[2] = g[2] + ((g[1] << 16) | (g[1] >>> 16)) + ((g[0] << 16) | (g[0] >>> 16));
-		x[3] = g[3] + ((g[2] <<  8) | (g[2] >>> 24)) + g[1];
-		x[4] = g[4] + ((g[3] << 16) | (g[3] >>> 16)) + ((g[2] << 16) | (g[2] >>> 16));
-		x[5] = g[5] + ((g[4] <<  8) | (g[4] >>> 24)) + g[3];
-		x[6] = g[6] + ((g[5] << 16) | (g[5] >>> 16)) + ((g[4] << 16) | (g[4] >>> 16));
-		x[7] = g[7] + ((g[6] <<  8) | (g[6] >>> 24)) + g[5];
-
-	}
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Inner state
+var x = [],
+    c = [],
+    b;
+
+var Rabbit = C.Rabbit = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password) {
+
+		var
+
+		    // Convert to bytes
+		    m = UTF8.stringToBytes(message),
+
+		    // Generate random IV
+		    iv = util.randomBytes(8),
+
+		    // Generate key
+		    k = password.constructor == String ?
+		        // Derive key from passphrase
+		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
+		        // else, assume byte array representing cryptographic key
+		        password;
+
+		// Encrypt
+		Rabbit._rabbit(m, k, util.bytesToWords(iv));
+
+		// Return ciphertext
+		return util.bytesToBase64(iv.concat(m));
+
+	},
+
+	decrypt: function (ciphertext, password) {
+
+		var
+
+		    // Convert to bytes
+		    c = util.base64ToBytes(ciphertext),
+
+		    // Separate IV and message
+		    iv = c.splice(0, 8),
+
+		    // Generate key
+		    k = password.constructor == String ?
+		        // Derive key from passphrase
+		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
+		        // else, assume byte array representing cryptographic key
+		        password;
+
+		// Decrypt
+		Rabbit._rabbit(c, k, util.bytesToWords(iv));
+
+		// Return plaintext
+		return UTF8.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Internal methods
+	 */
+
+	// Encryption/decryption scheme
+	_rabbit: function (m, k, iv) {
+
+		Rabbit._keysetup(k);
+		if (iv) Rabbit._ivsetup(iv);
+
+		for (var s = [], i = 0; i < m.length; i++) {
+
+			if (i % 16 == 0) {
+
+				// Iterate the system
+				Rabbit._nextstate();
+
+				// Generate 16 bytes of pseudo-random data
+				s[0] = x[0] ^ (x[5] >>> 16) ^ (x[3] << 16);
+				s[1] = x[2] ^ (x[7] >>> 16) ^ (x[5] << 16);
+				s[2] = x[4] ^ (x[1] >>> 16) ^ (x[7] << 16);
+				s[3] = x[6] ^ (x[3] >>> 16) ^ (x[1] << 16);
+
+				// Swap endian
+				for (var j = 0; j < 4; j++) {
+					s[j] = ((s[j] <<  8) | (s[j] >>> 24)) & 0x00FF00FF |
+					       ((s[j] << 24) | (s[j] >>>  8)) & 0xFF00FF00;
+				}
+
+				// Convert words to bytes
+				for (var b = 120; b >= 0; b -= 8)
+					s[b / 8] = (s[b >>> 5] >>> (24 - b % 32)) & 0xFF;
+
+			}
+
+			m[i] ^= s[i % 16];
+
+		}
+
+	},
+
+	// Key setup scheme
+	_keysetup: function (k) {
+
+		// Generate initial state values
+		x[0] = k[0];
+		x[2] = k[1];
+		x[4] = k[2];
+		x[6] = k[3];
+		x[1] = (k[3] << 16) | (k[2] >>> 16);
+		x[3] = (k[0] << 16) | (k[3] >>> 16);
+		x[5] = (k[1] << 16) | (k[0] >>> 16);
+		x[7] = (k[2] << 16) | (k[1] >>> 16);
+
+		// Generate initial counter values
+		c[0] = util.rotl(k[2], 16);
+		c[2] = util.rotl(k[3], 16);
+		c[4] = util.rotl(k[0], 16);
+		c[6] = util.rotl(k[1], 16);
+		c[1] = (k[0] & 0xFFFF0000) | (k[1] & 0xFFFF);
+		c[3] = (k[1] & 0xFFFF0000) | (k[2] & 0xFFFF);
+		c[5] = (k[2] & 0xFFFF0000) | (k[3] & 0xFFFF);
+		c[7] = (k[3] & 0xFFFF0000) | (k[0] & 0xFFFF);
+
+		// Clear carry bit
+		b = 0;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+		// Modify the counters
+		for (var i = 0; i < 8; i++) c[i] ^= x[(i + 4) & 7];
+
+	},
+
+	// IV setup scheme
+	_ivsetup: function (iv) {
+
+		// Generate four subvectors
+		var i0 = util.endian(iv[0]),
+		    i2 = util.endian(iv[1]),
+		    i1 = (i0 >>> 16) | (i2 & 0xFFFF0000),
+		    i3 = (i2 <<  16) | (i0 & 0x0000FFFF);
+
+		// Modify counter values
+		c[0] ^= i0;
+		c[1] ^= i1;
+		c[2] ^= i2;
+		c[3] ^= i3;
+		c[4] ^= i0;
+		c[5] ^= i1;
+		c[6] ^= i2;
+		c[7] ^= i3;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+	},
+
+	// Next-state function
+	_nextstate: function () {
+
+		// Save old counter values
+		for (var c_old = [], i = 0; i < 8; i++) c_old[i] = c[i];
+
+		// Calculate new counter values
+		c[0] = (c[0] + 0x4D34D34D + b) >>> 0;
+		c[1] = (c[1] + 0xD34D34D3 + ((c[0] >>> 0) < (c_old[0] >>> 0) ? 1 : 0)) >>> 0;
+		c[2] = (c[2] + 0x34D34D34 + ((c[1] >>> 0) < (c_old[1] >>> 0) ? 1 : 0)) >>> 0;
+		c[3] = (c[3] + 0x4D34D34D + ((c[2] >>> 0) < (c_old[2] >>> 0) ? 1 : 0)) >>> 0;
+		c[4] = (c[4] + 0xD34D34D3 + ((c[3] >>> 0) < (c_old[3] >>> 0) ? 1 : 0)) >>> 0;
+		c[5] = (c[5] + 0x34D34D34 + ((c[4] >>> 0) < (c_old[4] >>> 0) ? 1 : 0)) >>> 0;
+		c[6] = (c[6] + 0x4D34D34D + ((c[5] >>> 0) < (c_old[5] >>> 0) ? 1 : 0)) >>> 0;
+		c[7] = (c[7] + 0xD34D34D3 + ((c[6] >>> 0) < (c_old[6] >>> 0) ? 1 : 0)) >>> 0;
+		b = (c[7] >>> 0) < (c_old[7] >>> 0) ? 1 : 0;
+
+		// Calculate the g-values
+		for (var g = [], i = 0; i < 8; i++) {
+
+			var gx = (x[i] + c[i]) >>> 0;
+
+			// Construct high and low argument for squaring
+			var ga = gx & 0xFFFF,
+			    gb = gx >>> 16;
+
+			// Calculate high and low result of squaring
+			var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb,
+			    gl = (((gx & 0xFFFF0000) * gx) >>> 0) + (((gx & 0x0000FFFF) * gx) >>> 0) >>> 0;
+
+			// High XOR low
+			g[i] = gh ^ gl;
+
+		}
+
+		// Calculate new state values
+		x[0] = g[0] + ((g[7] << 16) | (g[7] >>> 16)) + ((g[6] << 16) | (g[6] >>> 16));
+		x[1] = g[1] + ((g[0] <<  8) | (g[0] >>> 24)) + g[7];
+		x[2] = g[2] + ((g[1] << 16) | (g[1] >>> 16)) + ((g[0] << 16) | (g[0] >>> 16));
+		x[3] = g[3] + ((g[2] <<  8) | (g[2] >>> 24)) + g[1];
+		x[4] = g[4] + ((g[3] << 16) | (g[3] >>> 16)) + ((g[2] << 16) | (g[2] >>> 16));
+		x[5] = g[5] + ((g[4] <<  8) | (g[4] >>> 24)) + g[3];
+		x[6] = g[6] + ((g[5] << 16) | (g[5] >>> 16)) + ((g[4] << 16) | (g[4] >>> 16));
+		x[7] = g[7] + ((g[6] <<  8) | (g[6] >>> 24)) + g[5];
+
+	}
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/sha1/sha1-min.js b/tools/Crypto-JS v2.4.0/sha1/sha1-min.js
index 199bcdf..438fc27 100755
--- a/tools/Crypto-JS v2.4.0/sha1/sha1-min.js	
+++ b/tools/Crypto-JS v2.4.0/sha1/sha1-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var l=Crypto,m=l.util,n=l.charenc,o=n.UTF8,p=n.Binary,j=l.SHA1=function(a,g){var c=m.wordsToBytes(j._sha1(a));return g&&g.asBytes?c:g&&g.asString?p.bytesToString(c):m.bytesToHex(c)};j._sha1=function(a){if(a.constructor==String)a=o.stringToBytes(a);var g=m.bytesToWords(a),c=a.length*8;a=[];var h=1732584193,d=-271733879,e=-1732584194,f=271733878,i=-1009589776;g[c>>5]|=128<<24-c%32;g[(c+64>>>9<<4)+15]=c;for(c=0;c>>31}k=(h<<5|h>>>27)+i+(a[b]>>>0)+(b<20?(d&e|~d&f)+1518500249:b<40?(d^e^f)+1859775393:b<60?(d&e|d&f|e&f)-1894007588:(d^e^f)-899497514);i=f;f=e;e=d<<30|d>>>2;d=h;h=k}h+=q;d+=r;e+=s;f+=t;i+=u}return[h,d,e,f,i]};j._blocksize=16;j._digestsize=20})();
diff --git a/tools/Crypto-JS v2.4.0/sha1/sha1.js b/tools/Crypto-JS v2.4.0/sha1/sha1.js
index cacb84a..5c5e1eb 100755
--- a/tools/Crypto-JS v2.4.0/sha1/sha1.js	
+++ b/tools/Crypto-JS v2.4.0/sha1/sha1.js	
@@ -1,91 +1,91 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Public API
-var SHA1 = C.SHA1 = function (message, options) {
-	var digestbytes = util.wordsToBytes(SHA1._sha1(message));
-	return options && options.asBytes ? digestbytes :
-	       options && options.asString ? Binary.bytesToString(digestbytes) :
-	       util.bytesToHex(digestbytes);
-};
-
-// The core
-SHA1._sha1 = function (message) {
-
-	// Convert to byte array
-	if (message.constructor == String) message = UTF8.stringToBytes(message);
-	/* else, assume byte array already */
-
-	var m  = util.bytesToWords(message),
-	    l  = message.length * 8,
-	    w  =  [],
-	    H0 =  1732584193,
-	    H1 = -271733879,
-	    H2 = -1732584194,
-	    H3 =  271733878,
-	    H4 = -1009589776;
-
-	// Padding
-	m[l >> 5] |= 0x80 << (24 - l % 32);
-	m[((l + 64 >>> 9) << 4) + 15] = l;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		var a = H0,
-		    b = H1,
-		    c = H2,
-		    d = H3,
-		    e = H4;
-
-		for (var j = 0; j < 80; j++) {
-
-			if (j < 16) w[j] = m[i + j];
-			else {
-				var n = w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16];
-				w[j] = (n << 1) | (n >>> 31);
-			}
-
-			var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
-			         j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
-			         j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
-			         j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
-			                  (H1 ^ H2 ^ H3) - 899497514);
-
-			H4 =  H3;
-			H3 =  H2;
-			H2 = (H1 << 30) | (H1 >>> 2);
-			H1 =  H0;
-			H0 =  t;
-
-		}
-
-		H0 += a;
-		H1 += b;
-		H2 += c;
-		H3 += d;
-		H4 += e;
-
-	}
-
-	return [H0, H1, H2, H3, H4];
-
-};
-
-// Package private blocksize
-SHA1._blocksize = 16;
-
-SHA1._digestsize = 20;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Public API
+var SHA1 = C.SHA1 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA1._sha1(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA1._sha1 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m  = util.bytesToWords(message),
+	    l  = message.length * 8,
+	    w  =  [],
+	    H0 =  1732584193,
+	    H1 = -271733879,
+	    H2 = -1732584194,
+	    H3 =  271733878,
+	    H4 = -1009589776;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >>> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var a = H0,
+		    b = H1,
+		    c = H2,
+		    d = H3,
+		    e = H4;
+
+		for (var j = 0; j < 80; j++) {
+
+			if (j < 16) w[j] = m[i + j];
+			else {
+				var n = w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16];
+				w[j] = (n << 1) | (n >>> 31);
+			}
+
+			var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
+			         j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
+			         j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
+			         j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
+			                  (H1 ^ H2 ^ H3) - 899497514);
+
+			H4 =  H3;
+			H3 =  H2;
+			H2 = (H1 << 30) | (H1 >>> 2);
+			H1 =  H0;
+			H0 =  t;
+
+		}
+
+		H0 += a;
+		H1 += b;
+		H2 += c;
+		H3 += d;
+		H4 += e;
+
+	}
+
+	return [H0, H1, H2, H3, H4];
+
+};
+
+// Package private blocksize
+SHA1._blocksize = 16;
+
+SHA1._digestsize = 20;
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/sha256/sha256-min.js b/tools/Crypto-JS v2.4.0/sha256/sha256-min.js
index 7932704..f4b8cb5 100755
--- a/tools/Crypto-JS v2.4.0/sha256/sha256-min.js	
+++ b/tools/Crypto-JS v2.4.0/sha256/sha256-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var q=Crypto,r=q.util,s=q.charenc,t=s.UTF8,u=s.Binary,v=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,
 2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],m=q.SHA256=function(a,f){var b=r.wordsToBytes(m._sha256(a));return f&&f.asBytes?b:f&&f.asString?u.bytesToString(b):r.bytesToHex(b)};m._sha256=function(a){if(a.constructor==String)a=t.stringToBytes(a);var f=r.bytesToWords(a),b=a.length*8;a=[1779033703,3144134277,
 1013904242,2773480762,1359893119,2600822924,528734635,1541459225];var h=[],i,j,n,d,k,l,o,p,c,g,e;f[b>>5]|=128<<24-b%32;f[(b+64>>9<<4)+15]=b;for(p=0;p>>7)^(g<<14|g>>>18)^g>>>3)+(h[c-7]>>>0)+((e<<15|e>>>17)^(e<<13|e>>>19)^e>>>10)+(h[c-16]>>>0)}e=b&i^b&j^i&j;var w=(b<<30|b>>>2)^(b<<19|b>>>13)^(b<<10|b>>>22);g=(o>>>0)+((d<<26|d>>>6)^(d<<21|d>>>11)^(d<<7|
diff --git a/tools/Crypto-JS v2.4.0/sha256/sha256.js b/tools/Crypto-JS v2.4.0/sha256/sha256.js
index e3e2969..67a5dda 100755
--- a/tools/Crypto-JS v2.4.0/sha256/sha256.js	
+++ b/tools/Crypto-JS v2.4.0/sha256/sha256.js	
@@ -1,135 +1,135 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Constants
-var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
-          0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
-          0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
-          0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
-          0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
-          0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
-          0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
-          0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
-          0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
-          0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
-          0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
-          0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
-          0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
-          0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
-          0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
-          0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 ];
-
-// Public API
-var SHA256 = C.SHA256 = function (message, options) {
-	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
-	return options && options.asBytes ? digestbytes :
-	       options && options.asString ? Binary.bytesToString(digestbytes) :
-	       util.bytesToHex(digestbytes);
-};
-
-// The core
-SHA256._sha256 = function (message) {
-
-	// Convert to byte array
-	if (message.constructor == String) message = UTF8.stringToBytes(message);
-	/* else, assume byte array already */
-
-	var m = util.bytesToWords(message),
-	    l = message.length * 8,
-	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
-	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
-	    w = [],
-	    a, b, c, d, e, f, g, h, i, j,
-	    t1, t2;
-
-	// Padding
-	m[l >> 5] |= 0x80 << (24 - l % 32);
-	m[((l + 64 >> 9) << 4) + 15] = l;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		a = H[0];
-		b = H[1];
-		c = H[2];
-		d = H[3];
-		e = H[4];
-		f = H[5];
-		g = H[6];
-		h = H[7];
-
-		for (var j = 0; j < 64; j++) {
-
-			if (j < 16) w[j] = m[j + i];
-			else {
-
-				var gamma0x = w[j - 15],
-				    gamma1x = w[j - 2],
-				    gamma0  = ((gamma0x << 25) | (gamma0x >>>  7)) ^
-				              ((gamma0x << 14) | (gamma0x >>> 18)) ^
-				               (gamma0x >>> 3),
-				    gamma1  = ((gamma1x <<  15) | (gamma1x >>> 17)) ^
-				              ((gamma1x <<  13) | (gamma1x >>> 19)) ^
-				               (gamma1x >>> 10);
-
-				w[j] = gamma0 + (w[j - 7] >>> 0) +
-				       gamma1 + (w[j - 16] >>> 0);
-
-			}
-
-			var ch  = e & f ^ ~e & g,
-			    maj = a & b ^ a & c ^ b & c,
-			    sigma0 = ((a << 30) | (a >>>  2)) ^
-			             ((a << 19) | (a >>> 13)) ^
-			             ((a << 10) | (a >>> 22)),
-			    sigma1 = ((e << 26) | (e >>>  6)) ^
-			             ((e << 21) | (e >>> 11)) ^
-			             ((e <<  7) | (e >>> 25));
-
-
-			t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
-			t2 = sigma0 + maj;
-
-			h = g;
-			g = f;
-			f = e;
-			e = d + t1;
-			d = c;
-			c = b;
-			b = a;
-			a = t1 + t2;
-
-		}
-
-		H[0] += a;
-		H[1] += b;
-		H[2] += c;
-		H[3] += d;
-		H[4] += e;
-		H[5] += f;
-		H[6] += g;
-		H[7] += h;
-
-	}
-
-	return H;
-
-};
-
-// Package private blocksize
-SHA256._blocksize = 16;
-
-SHA256._digestsize = 32;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Constants
+var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+          0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
+          0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
+          0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
+          0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
+          0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
+          0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
+          0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
+          0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
+          0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
+          0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
+          0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
+          0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
+          0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
+          0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
+          0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 ];
+
+// Public API
+var SHA256 = C.SHA256 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA256._sha256 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m = util.bytesToWords(message),
+	    l = message.length * 8,
+	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
+	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
+	    w = [],
+	    a, b, c, d, e, f, g, h, i, j,
+	    t1, t2;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		a = H[0];
+		b = H[1];
+		c = H[2];
+		d = H[3];
+		e = H[4];
+		f = H[5];
+		g = H[6];
+		h = H[7];
+
+		for (var j = 0; j < 64; j++) {
+
+			if (j < 16) w[j] = m[j + i];
+			else {
+
+				var gamma0x = w[j - 15],
+				    gamma1x = w[j - 2],
+				    gamma0  = ((gamma0x << 25) | (gamma0x >>>  7)) ^
+				              ((gamma0x << 14) | (gamma0x >>> 18)) ^
+				               (gamma0x >>> 3),
+				    gamma1  = ((gamma1x <<  15) | (gamma1x >>> 17)) ^
+				              ((gamma1x <<  13) | (gamma1x >>> 19)) ^
+				               (gamma1x >>> 10);
+
+				w[j] = gamma0 + (w[j - 7] >>> 0) +
+				       gamma1 + (w[j - 16] >>> 0);
+
+			}
+
+			var ch  = e & f ^ ~e & g,
+			    maj = a & b ^ a & c ^ b & c,
+			    sigma0 = ((a << 30) | (a >>>  2)) ^
+			             ((a << 19) | (a >>> 13)) ^
+			             ((a << 10) | (a >>> 22)),
+			    sigma1 = ((e << 26) | (e >>>  6)) ^
+			             ((e << 21) | (e >>> 11)) ^
+			             ((e <<  7) | (e >>> 25));
+
+
+			t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
+			t2 = sigma0 + maj;
+
+			h = g;
+			g = f;
+			f = e;
+			e = d + t1;
+			d = c;
+			c = b;
+			b = a;
+			a = t1 + t2;
+
+		}
+
+		H[0] += a;
+		H[1] += b;
+		H[2] += c;
+		H[3] += d;
+		H[4] += e;
+		H[5] += f;
+		H[6] += g;
+		H[7] += h;
+
+	}
+
+	return H;
+
+};
+
+// Package private blocksize
+SHA256._blocksize = 16;
+
+SHA256._digestsize = 32;
+
+})();

From 27bd27b159e6c735f6461af02c4bd3c3f610b6f5 Mon Sep 17 00:00:00 2001
From: Gianluca Bisceglie 
Date: Wed, 6 Feb 2013 09:21:23 +0400
Subject: [PATCH 06/48] CRLF / LF fixup due to gitattributes

---
 tools/Crypto-JS v2.4.0/aes/aes-min.js         |  12 +-
 tools/Crypto-JS v2.4.0/aes/aes.js             | 814 +++++++++---------
 .../blockmodes/blockmodes-min.js              |  12 +-
 .../Crypto-JS v2.4.0/blockmodes/blockmodes.js | 762 ++++++++--------
 .../crypto-md5-hmac/crypto-md5-hmac.js        |  12 +-
 .../Crypto-JS v2.4.0/crypto-md5/crypto-md5.js |  12 +-
 .../crypto-sha1-hmac-pbkdf2-blockmodes-aes.js |  12 +-
 .../crypto-sha1-hmac-pbkdf2-marc4.js          |  12 +-
 .../crypto-sha1-hmac-pbkdf2-rabbit.js         |  12 +-
 .../crypto-sha1-hmac-pbkdf2.js                |  12 +-
 .../crypto-sha1-hmac-pbkdf2async.js           |  12 +-
 .../crypto-sha1-hmac/crypto-sha1-hmac.js      |  12 +-
 .../crypto-sha1/crypto-sha1.js                |  12 +-
 .../crypto-sha256-hmac/crypto-sha256-hmac.js  |  12 +-
 .../crypto-sha256/crypto-sha256.js            |  12 +-
 tools/Crypto-JS v2.4.0/crypto/crypto-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/crypto/crypto.js       | 320 +++----
 tools/Crypto-JS v2.4.0/hmac/hmac-min.js       |  12 +-
 tools/Crypto-JS v2.4.0/hmac/hmac.js           |  86 +-
 tools/Crypto-JS v2.4.0/marc4/marc4-min.js     |  12 +-
 tools/Crypto-JS v2.4.0/marc4/marc4.js         | 244 +++---
 tools/Crypto-JS v2.4.0/md5/md5-min.js         |  12 +-
 tools/Crypto-JS v2.4.0/md5/md5.js             | 326 +++----
 tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2.js       | 108 +--
 .../pbkdf2async/pbkdf2async-min.js            |  12 +-
 .../pbkdf2async/pbkdf2async.js                | 186 ++--
 tools/Crypto-JS v2.4.0/rabbit/rabbit-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/rabbit/rabbit.js       | 452 +++++-----
 tools/Crypto-JS v2.4.0/sha1/sha1-min.js       |  12 +-
 tools/Crypto-JS v2.4.0/sha1/sha1.js           | 182 ++--
 tools/Crypto-JS v2.4.0/sha256/sha256-min.js   |  12 +-
 tools/Crypto-JS v2.4.0/sha256/sha256.js       | 270 +++---
 33 files changed, 2007 insertions(+), 2007 deletions(-)

diff --git a/tools/Crypto-JS v2.4.0/aes/aes-min.js b/tools/Crypto-JS v2.4.0/aes/aes-min.js
index b96adf4..7109d37 100755
--- a/tools/Crypto-JS v2.4.0/aes/aes-min.js	
+++ b/tools/Crypto-JS v2.4.0/aes/aes-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){function q(d,e){for(var b=0,a=0;a<8;a++){if(e&1)b^=d;var h=d&128;d=d<<1&255;if(h)d^=27;e>>>=1}return b}for(var o=Crypto,x=o.util,z=o.charenc.UTF8,k=[99,124,119,123,242,107,111,197,48,1,103,43,254,215,171,118,202,130,201,125,250,89,71,240,173,212,162,175,156,164,114,192,183,253,147,38,54,63,247,204,52,165,229,241,113,216,49,21,4,199,35,195,24,150,5,154,7,18,128,226,235,39,178,117,9,131,44,26,27,110,90,160,82,59,214,179,41,227,47,132,83,209,0,237,32,252,177,91,106,203,190,57,74,76,88,207,
 208,239,170,251,67,77,51,133,69,249,2,127,80,60,159,168,81,163,64,143,146,157,56,245,188,182,218,33,16,255,243,210,205,12,19,236,95,151,68,23,196,167,126,61,100,93,25,115,96,129,79,220,34,42,144,136,70,238,184,20,222,94,11,219,224,50,58,10,73,6,36,92,194,211,172,98,145,149,228,121,231,200,55,109,141,213,78,169,108,86,244,234,101,122,174,8,186,120,37,46,28,166,180,198,232,221,116,31,75,189,139,138,112,62,181,102,72,3,246,14,97,53,87,185,134,193,29,158,225,248,152,17,105,217,142,148,155,30,135,233,
 206,85,40,223,140,161,137,13,191,230,66,104,65,153,45,15,176,84,187,22],y=[],f=0;f<256;f++)y[k[f]]=f;var r=[],s=[],t=[],u=[],v=[],w=[];for(f=0;f<256;f++){r[f]=q(f,2);s[f]=q(f,3);t[f]=q(f,9);u[f]=q(f,11);v[f]=q(f,13);w[f]=q(f,14)}var A=[0,1,2,4,8,16,32,64,128,27,54],c=[[],[],[],[]],i,p,g,j=o.AES={encrypt:function(d,e,b){b=b||{};var a=b.mode||new o.mode.OFB;a.fixOptions&&a.fixOptions(b);d=d.constructor==String?z.stringToBytes(d):d;var h=b.iv||x.randomBytes(j._blocksize*4);e=e.constructor==String?o.PBKDF2(e,
diff --git a/tools/Crypto-JS v2.4.0/aes/aes.js b/tools/Crypto-JS v2.4.0/aes/aes.js
index bca0e13..d565a14 100755
--- a/tools/Crypto-JS v2.4.0/aes/aes.js	
+++ b/tools/Crypto-JS v2.4.0/aes/aes.js	
@@ -1,407 +1,407 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8;
-
-// Precomputed SBOX
-var SBOX = [ 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
-             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
-             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
-             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
-             0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
-             0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
-             0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
-             0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
-             0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
-             0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
-             0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
-             0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
-             0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
-             0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
-             0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
-             0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
-             0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
-             0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
-             0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
-             0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
-             0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
-             0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
-             0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
-             0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
-             0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
-             0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
-             0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
-             0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
-             0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
-             0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
-             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
-             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 ];
-
-// Compute inverse SBOX lookup table
-for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
-
-// Compute mulitplication in GF(2^8) lookup tables
-var MULT2 = [],
-    MULT3 = [],
-    MULT9 = [],
-    MULTB = [],
-    MULTD = [],
-    MULTE = [];
-
-function xtime(a, b) {
-	for (var result = 0, i = 0; i < 8; i++) {
-		if (b & 1) result ^= a;
-		var hiBitSet = a & 0x80;
-		a = (a << 1) & 0xFF;
-		if (hiBitSet) a ^= 0x1b;
-		b >>>= 1;
-	}
-	return result;
-}
-
-for (var i = 0; i < 256; i++) {
-	MULT2[i] = xtime(i,2);
-	MULT3[i] = xtime(i,3);
-	MULT9[i] = xtime(i,9);
-	MULTB[i] = xtime(i,0xB);
-	MULTD[i] = xtime(i,0xD);
-	MULTE[i] = xtime(i,0xE);
-}
-
-// Precomputed RCon lookup
-var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
-
-// Inner state
-var state = [[], [], [], []],
-    keylength,
-    nrounds,
-    keyschedule;
-
-var AES = C.AES = {
-
-	/**
-	 * Public API
-	 */
-
-	encrypt: function (message, password, options) {
-
-		options = options || {};
-
-		// Determine mode
-		var mode = options.mode || new C.mode.OFB;
-
-		// Allow mode to override options
-		if (mode.fixOptions) mode.fixOptions(options);
-
-		var
-
-			// Convert to bytes if message is a string
-			m = (
-				message.constructor == String ?
-				UTF8.stringToBytes(message) :
-				message
-			),
-
-			// Generate random IV
-			iv = options.iv || util.randomBytes(AES._blocksize * 4),
-
-			// Generate key
-			k = (
-				password.constructor == String ?
-				// Derive key from passphrase
-				C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
-				password
-			);
-
-		// Encrypt
-		AES._init(k);
-		mode.encrypt(AES, m, iv);
-
-		// Return ciphertext
-		m = options.iv ? m : iv.concat(m);
-		return (options && options.asBytes) ? m : util.bytesToBase64(m);
-
-	},
-
-	decrypt: function (ciphertext, password, options) {
-
-		options = options || {};
-
-		// Determine mode
-		var mode = options.mode || new C.mode.OFB;
-
-		// Allow mode to override options
-		if (mode.fixOptions) mode.fixOptions(options);
-
-		var
-
-			// Convert to bytes if ciphertext is a string
-			c = (
-				ciphertext.constructor == String ?
-				util.base64ToBytes(ciphertext):
-			    ciphertext
-			),
-
-			// Separate IV and message
-			iv = options.iv || c.splice(0, AES._blocksize * 4),
-
-			// Generate key
-			k = (
-				password.constructor == String ?
-				// Derive key from passphrase
-				C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
-				password
-			);
-
-		// Decrypt
-		AES._init(k);
-		mode.decrypt(AES, c, iv);
-
-		// Return plaintext
-		return (options && options.asBytes) ? c : UTF8.bytesToString(c);
-
-	},
-
-
-	/**
-	 * Package private methods and properties
-	 */
-
-	_blocksize: 4,
-
-	_encryptblock: function (m, offset) {
-
-		// Set input
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = m[offset + col * 4 + row];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[col][row];
-		}
-
-		for (var round = 1; round < nrounds; round++) {
-
-			// Sub bytes
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] = SBOX[state[row][col]];
-			}
-
-			// Shift rows
-			state[1].push(state[1].shift());
-			state[2].push(state[2].shift());
-			state[2].push(state[2].shift());
-			state[3].unshift(state[3].pop());
-
-			// Mix columns
-			for (var col = 0; col < 4; col++) {
-
-				var s0 = state[0][col],
-				    s1 = state[1][col],
-				    s2 = state[2][col],
-				    s3 = state[3][col];
-
-				state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
-				state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
-				state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
-				state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
-
-			}
-
-			// Add round key
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] ^= keyschedule[round * 4 + col][row];
-			}
-
-		}
-
-		// Sub bytes
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = SBOX[state[row][col]];
-		}
-
-		// Shift rows
-		state[1].push(state[1].shift());
-		state[2].push(state[2].shift());
-		state[2].push(state[2].shift());
-		state[3].unshift(state[3].pop());
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-		}
-
-		// Set output
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				m[offset + col * 4 + row] = state[row][col];
-		}
-
-	},
-
-	_decryptblock: function (c, offset) {
-
-		// Set input
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = c[offset + col * 4 + row];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-		}
-
-		for (var round = 1; round < nrounds; round++) {
-
-			// Inv shift rows
-			state[1].unshift(state[1].pop());
-			state[2].push(state[2].shift());
-			state[2].push(state[2].shift());
-			state[3].push(state[3].shift());
-
-			// Inv sub bytes
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] = INVSBOX[state[row][col]];
-			}
-
-			// Add round key
-			for (var row = 0; row < 4; row++) {
-				for (var col = 0; col < 4; col++)
-					state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
-			}
-
-			// Inv mix columns
-			for (var col = 0; col < 4; col++) {
-
-				var s0 = state[0][col],
-				    s1 = state[1][col],
-				    s2 = state[2][col],
-				    s3 = state[3][col];
-
-				state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
-				state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
-				state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
-				state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
-
-			}
-
-		}
-
-		// Inv shift rows
-		state[1].unshift(state[1].pop());
-		state[2].push(state[2].shift());
-		state[2].push(state[2].shift());
-		state[3].push(state[3].shift());
-
-		// Inv sub bytes
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] = INVSBOX[state[row][col]];
-		}
-
-		// Add round key
-		for (var row = 0; row < 4; row++) {
-			for (var col = 0; col < 4; col++)
-				state[row][col] ^= keyschedule[col][row];
-		}
-
-		// Set output
-		for (var row = 0; row < AES._blocksize; row++) {
-			for (var col = 0; col < 4; col++)
-				c[offset + col * 4 + row] = state[row][col];
-		}
-
-	},
-
-
-	/**
-	 * Private methods
-	 */
-
-	_init: function (k) {
-		keylength = k.length / 4;
-		nrounds = keylength + 6;
-		AES._keyexpansion(k);
-	},
-
-	// Generate a key schedule
-	_keyexpansion: function (k) {
-
-		keyschedule = [];
-
-		for (var row = 0; row < keylength; row++) {
-			keyschedule[row] = [
-				k[row * 4],
-				k[row * 4 + 1],
-				k[row * 4 + 2],
-				k[row * 4 + 3]
-			];
-		}
-
-		for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
-
-			var temp = [
-				keyschedule[row - 1][0],
-				keyschedule[row - 1][1],
-				keyschedule[row - 1][2],
-				keyschedule[row - 1][3]
-			];
-
-			if (row % keylength == 0) {
-
-				// Rot word
-				temp.push(temp.shift());
-
-				// Sub word
-				temp[0] = SBOX[temp[0]];
-				temp[1] = SBOX[temp[1]];
-				temp[2] = SBOX[temp[2]];
-				temp[3] = SBOX[temp[3]];
-
-				temp[0] ^= RCON[row / keylength];
-
-			} else if (keylength > 6 && row % keylength == 4) {
-
-				// Sub word
-				temp[0] = SBOX[temp[0]];
-				temp[1] = SBOX[temp[1]];
-				temp[2] = SBOX[temp[2]];
-				temp[3] = SBOX[temp[3]];
-
-			}
-
-			keyschedule[row] = [
-				keyschedule[row - keylength][0] ^ temp[0],
-				keyschedule[row - keylength][1] ^ temp[1],
-				keyschedule[row - keylength][2] ^ temp[2],
-				keyschedule[row - keylength][3] ^ temp[3]
-			];
-
-		}
-
-	}
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8;
+
+// Precomputed SBOX
+var SBOX = [ 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
+             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
+             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
+             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
+             0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
+             0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
+             0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
+             0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
+             0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
+             0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
+             0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
+             0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
+             0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
+             0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
+             0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
+             0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
+             0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
+             0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
+             0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
+             0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
+             0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
+             0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
+             0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
+             0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
+             0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
+             0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
+             0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
+             0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
+             0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
+             0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
+             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
+             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 ];
+
+// Compute inverse SBOX lookup table
+for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
+
+// Compute mulitplication in GF(2^8) lookup tables
+var MULT2 = [],
+    MULT3 = [],
+    MULT9 = [],
+    MULTB = [],
+    MULTD = [],
+    MULTE = [];
+
+function xtime(a, b) {
+	for (var result = 0, i = 0; i < 8; i++) {
+		if (b & 1) result ^= a;
+		var hiBitSet = a & 0x80;
+		a = (a << 1) & 0xFF;
+		if (hiBitSet) a ^= 0x1b;
+		b >>>= 1;
+	}
+	return result;
+}
+
+for (var i = 0; i < 256; i++) {
+	MULT2[i] = xtime(i,2);
+	MULT3[i] = xtime(i,3);
+	MULT9[i] = xtime(i,9);
+	MULTB[i] = xtime(i,0xB);
+	MULTD[i] = xtime(i,0xD);
+	MULTE[i] = xtime(i,0xE);
+}
+
+// Precomputed RCon lookup
+var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
+
+// Inner state
+var state = [[], [], [], []],
+    keylength,
+    nrounds,
+    keyschedule;
+
+var AES = C.AES = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password, options) {
+
+		options = options || {};
+
+		// Determine mode
+		var mode = options.mode || new C.mode.OFB;
+
+		// Allow mode to override options
+		if (mode.fixOptions) mode.fixOptions(options);
+
+		var
+
+			// Convert to bytes if message is a string
+			m = (
+				message.constructor == String ?
+				UTF8.stringToBytes(message) :
+				message
+			),
+
+			// Generate random IV
+			iv = options.iv || util.randomBytes(AES._blocksize * 4),
+
+			// Generate key
+			k = (
+				password.constructor == String ?
+				// Derive key from passphrase
+				C.PBKDF2(password, iv, 32, { asBytes: true }) :
+				// else, assume byte array representing cryptographic key
+				password
+			);
+
+		// Encrypt
+		AES._init(k);
+		mode.encrypt(AES, m, iv);
+
+		// Return ciphertext
+		m = options.iv ? m : iv.concat(m);
+		return (options && options.asBytes) ? m : util.bytesToBase64(m);
+
+	},
+
+	decrypt: function (ciphertext, password, options) {
+
+		options = options || {};
+
+		// Determine mode
+		var mode = options.mode || new C.mode.OFB;
+
+		// Allow mode to override options
+		if (mode.fixOptions) mode.fixOptions(options);
+
+		var
+
+			// Convert to bytes if ciphertext is a string
+			c = (
+				ciphertext.constructor == String ?
+				util.base64ToBytes(ciphertext):
+			    ciphertext
+			),
+
+			// Separate IV and message
+			iv = options.iv || c.splice(0, AES._blocksize * 4),
+
+			// Generate key
+			k = (
+				password.constructor == String ?
+				// Derive key from passphrase
+				C.PBKDF2(password, iv, 32, { asBytes: true }) :
+				// else, assume byte array representing cryptographic key
+				password
+			);
+
+		// Decrypt
+		AES._init(k);
+		mode.decrypt(AES, c, iv);
+
+		// Return plaintext
+		return (options && options.asBytes) ? c : UTF8.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Package private methods and properties
+	 */
+
+	_blocksize: 4,
+
+	_encryptblock: function (m, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = m[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = SBOX[state[row][col]];
+			}
+
+			// Shift rows
+			state[1].push(state[1].shift());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].unshift(state[3].pop());
+
+			// Mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
+				state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
+				state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
+				state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
+
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[round * 4 + col][row];
+			}
+
+		}
+
+		// Sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = SBOX[state[row][col]];
+		}
+
+		// Shift rows
+		state[1].push(state[1].shift());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].unshift(state[3].pop());
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				m[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+	_decryptblock: function (c, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = c[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Inv shift rows
+			state[1].unshift(state[1].pop());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].push(state[3].shift());
+
+			// Inv sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = INVSBOX[state[row][col]];
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
+			}
+
+			// Inv mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
+				state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
+				state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
+				state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
+
+			}
+
+		}
+
+		// Inv shift rows
+		state[1].unshift(state[1].pop());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].push(state[3].shift());
+
+		// Inv sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = INVSBOX[state[row][col]];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				c[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+
+	/**
+	 * Private methods
+	 */
+
+	_init: function (k) {
+		keylength = k.length / 4;
+		nrounds = keylength + 6;
+		AES._keyexpansion(k);
+	},
+
+	// Generate a key schedule
+	_keyexpansion: function (k) {
+
+		keyschedule = [];
+
+		for (var row = 0; row < keylength; row++) {
+			keyschedule[row] = [
+				k[row * 4],
+				k[row * 4 + 1],
+				k[row * 4 + 2],
+				k[row * 4 + 3]
+			];
+		}
+
+		for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
+
+			var temp = [
+				keyschedule[row - 1][0],
+				keyschedule[row - 1][1],
+				keyschedule[row - 1][2],
+				keyschedule[row - 1][3]
+			];
+
+			if (row % keylength == 0) {
+
+				// Rot word
+				temp.push(temp.shift());
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+				temp[0] ^= RCON[row / keylength];
+
+			} else if (keylength > 6 && row % keylength == 4) {
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+			}
+
+			keyschedule[row] = [
+				keyschedule[row - keylength][0] ^ temp[0],
+				keyschedule[row - keylength][1] ^ temp[1],
+				keyschedule[row - keylength][2] ^ temp[2],
+				keyschedule[row - keylength][3] ^ temp[3]
+			];
+
+		}
+
+	}
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js b/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js
index 1866d2e..1150c20 100755
--- a/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js	
+++ b/tools/Crypto-JS v2.4.0/blockmodes/blockmodes-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(h){function l(c,a){var b=c._blocksize*4;return b-a.length%b}var j=h.pad={},g=function(c){for(var a=c.pop(),b=1;b0;d--)a.push(0)},unpad:function(){}};j.iso7816={pad:function(c,a){var b=l(c,a);for(a.push(128);b>1;b--)a.push(0)},unpad:function(c){for(;c.pop()!=128;);}};j.ansix923={pad:function(c,a){for(var b=l(c,a),d=1;d0; reqd--) {
-                message.push(0x00);
-            }
-        }
-    },
-
-    unpad : function (message) {}
-};
-
-// ISO/IEC 7816-4 padding.
-//
-// Pads the plain text with an 0x80 byte followed by as many 0x00
-// bytes are required to complete the block.
-C_pad.iso7816 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        message.push(0x80);
-        for (; reqd > 1; reqd--) {
-            message.push(0x00);
-        }
-    },
-
-    unpad : function (message) {
-        while (message.pop() != 0x80) {}
-    }
-};
-
-// ANSI X.923 padding
-//
-// The final block is padded with zeros except for the last byte of the
-// last block which contains the number of padding bytes.
-C_pad.ansix923 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 1; i < reqd; i++) {
-            message.push(0x00);
-        }
-        message.push(reqd);
-    },
-
-    unpad : _unpadLength
-};
-
-// ISO 10126
-//
-// The final block is padded with random bytes except for the last
-// byte of the last block which contains the number of padding bytes.
-C_pad.iso10126 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 1; i < reqd; i++) {
-            message.push(Math.floor(Math.random() * 256));
-        }
-        message.push(reqd);
-    },
-
-    unpad : _unpadLength
-};
-
-// PKCS7 padding
-//
-// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
-// value of each added byte is the number of bytes that are added,
-// i.e. N bytes, each of value N are added.
-C_pad.pkcs7 = {
-    pad : function (cipher, message) {
-        var reqd = _requiredPadding(cipher, message);
-        for (var i = 0; i < reqd; i++) {
-            message.push(reqd);
-        }
-    },
-
-    unpad : _unpadLength
-};
-
-// Create mode namespace
-var C_mode = C.mode = {};
-
-/**
- * Mode base "class".
- */
-var Mode = C_mode.Mode = function (padding) {
-    if (padding) {
-        this._padding = padding;
-    }
-};
-
-Mode.prototype = {
-    encrypt: function (cipher, m, iv) {
-        this._padding.pad(cipher, m);
-        this._doEncrypt(cipher, m, iv);
-    },
-
-    decrypt: function (cipher, m, iv) {
-        this._doDecrypt(cipher, m, iv);
-        this._padding.unpad(m);
-    },
-
-    // Default padding
-    _padding: C_pad.iso7816
-};
-
-
-/**
- * Electronic Code Book mode.
- * 
- * ECB applies the cipher directly against each block of the input.
- * 
- * ECB does not require an initialization vector.
- */
-var ECB = C_mode.ECB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var ECB_prototype = ECB.prototype = new Mode;
-
-// Concrete steps for Mode template
-ECB_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-    // Encrypt each block
-    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-        cipher._encryptblock(m, offset);
-    }
-};
-ECB_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-    // Decrypt each block
-    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-        cipher._decryptblock(c, offset);
-    }
-};
-
-// ECB never uses an IV
-ECB_prototype.fixOptions = function (options) {
-    options.iv = [];
-};
-
-
-/**
- * Cipher block chaining
- * 
- * The first block is XORed with the IV. Subsequent blocks are XOR with the
- * previous cipher output.
- */
-var CBC = C_mode.CBC = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CBC_prototype = CBC.prototype = new Mode;
-
-// Concrete steps for Mode template
-CBC_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    // Encrypt each block
-    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-        if (offset == 0) {
-            // XOR first block using IV
-            for (var i = 0; i < blockSizeInBytes; i++)
-            m[i] ^= iv[i];
-        } else {
-            // XOR this block using previous crypted block
-            for (var i = 0; i < blockSizeInBytes; i++)
-            m[offset + i] ^= m[offset + i - blockSizeInBytes];
-        }
-        // Encrypt block
-        cipher._encryptblock(m, offset);
-    }
-};
-CBC_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    // At the start, the previously crypted block is the IV
-    var prevCryptedBlock = iv;
-
-    // Decrypt each block
-    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-        // Save this crypted block
-        var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
-        // Decrypt block
-        cipher._decryptblock(c, offset);
-        // XOR decrypted block using previous crypted block
-        for (var i = 0; i < blockSizeInBytes; i++) {
-            c[offset + i] ^= prevCryptedBlock[i];
-        }
-        prevCryptedBlock = thisCryptedBlock;
-    }
-};
-
-
-/**
- * Cipher feed back
- * 
- * The cipher output is XORed with the plain text to produce the cipher output,
- * which is then fed back into the cipher to produce a bit pattern to XOR the
- * next block with.
- * 
- * This is a stream cipher mode and does not require padding.
- */
-var CFB = C_mode.CFB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CFB_prototype = CFB.prototype = new Mode;
-
-// Override padding
-CFB_prototype._padding = C_pad.NoPadding;
-
-// Concrete steps for Mode template
-CFB_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < m.length; i++) {
-
-        var j = i % blockSizeInBytes;
-        if (j == 0) cipher._encryptblock(keystream, 0);
-
-        m[i] ^= keystream[j];
-        keystream[j] = m[i];
-    }
-};
-CFB_prototype._doDecrypt = function (cipher, c, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < c.length; i++) {
-
-        var j = i % blockSizeInBytes;
-        if (j == 0) cipher._encryptblock(keystream, 0);
-
-        var b = c[i];
-        c[i] ^= keystream[j];
-        keystream[j] = b;
-    }
-};
-
-
-/**
- * Output feed back
- * 
- * The cipher repeatedly encrypts its own output. The output is XORed with the
- * plain text to produce the cipher text.
- * 
- * This is a stream cipher mode and does not require padding.
- */
-var OFB = C_mode.OFB = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var OFB_prototype = OFB.prototype = new Mode;
-
-// Override padding
-OFB_prototype._padding = C_pad.NoPadding;
-
-// Concrete steps for Mode template
-OFB_prototype._doEncrypt = function (cipher, m, iv) {
-
-    var blockSizeInBytes = cipher._blocksize * 4,
-        keystream = iv.slice(0);
-
-    // Encrypt each byte
-    for (var i = 0; i < m.length; i++) {
-
-        // Generate keystream
-        if (i % blockSizeInBytes == 0)
-            cipher._encryptblock(keystream, 0);
-
-        // Encrypt byte
-        m[i] ^= keystream[i % blockSizeInBytes];
-
-    }
-};
-OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
-
-/**
- * Counter
- * @author Gergely Risko
- *
- * After every block the last 4 bytes of the IV is increased by one
- * with carry and that IV is used for the next block.
- *
- * This is a stream cipher mode and does not require padding.
- */
-var CTR = C_mode.CTR = function () {
-    // Call parent constructor
-    Mode.apply(this, arguments);
-};
-
-// Inherit from Mode
-var CTR_prototype = CTR.prototype = new Mode;
-
-// Override padding
-CTR_prototype._padding = C_pad.NoPadding;
-
-CTR_prototype._doEncrypt = function (cipher, m, iv) {
-    var blockSizeInBytes = cipher._blocksize * 4;
-
-    for (var i = 0; i < m.length;) {
-        // do not lose iv
-        var keystream = iv.slice(0);
-
-        // Generate keystream for next block
-        cipher._encryptblock(keystream, 0);
-
-        // XOR keystream with block
-        for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
-            m[i] ^= keystream[j];
-        }
-
-        // Increase IV
-        if(++(iv[blockSizeInBytes-1]) == 256) {
-            iv[blockSizeInBytes-1] = 0;
-            if(++(iv[blockSizeInBytes-2]) == 256) {
-                iv[blockSizeInBytes-2] = 0;
-                if(++(iv[blockSizeInBytes-3]) == 256) {
-                    iv[blockSizeInBytes-3] = 0;
-                    ++(iv[blockSizeInBytes-4]);
-                }
-            }
-        }
-    }
-};
-CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
-
-})(Crypto);
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+/*!
+ * Crypto-JS contribution from Simon Greatrix
+ */
+
+(function(C){
+
+// Create pad namespace
+var C_pad = C.pad = {};
+
+// Calculate the number of padding bytes required.
+function _requiredPadding(cipher, message) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    var reqd = blockSizeInBytes - message.length % blockSizeInBytes;
+    return reqd;
+};
+
+// Remove padding when the final byte gives the number of padding bytes.
+var _unpadLength = function (message) {
+        var pad = message.pop();
+        for (var i = 1; i < pad; i++) {
+            message.pop();
+        }
+    };
+
+// No-operation padding, used for stream ciphers
+C_pad.NoPadding = {
+        pad : function (cipher,message) {},
+        unpad : function (message) {}
+    };
+
+// Zero Padding.
+//
+// If the message is not an exact number of blocks, the final block is
+// completed with 0x00 bytes. There is no unpadding.
+C_pad.ZeroPadding = {
+    pad : function (cipher, message) {
+        var blockSizeInBytes = cipher._blocksize * 4;
+        var reqd = message.length % blockSizeInBytes;
+        if( reqd!=0 ) {
+            for(reqd = blockSizeInBytes - reqd; reqd>0; reqd--) {
+                message.push(0x00);
+            }
+        }
+    },
+
+    unpad : function (message) {}
+};
+
+// ISO/IEC 7816-4 padding.
+//
+// Pads the plain text with an 0x80 byte followed by as many 0x00
+// bytes are required to complete the block.
+C_pad.iso7816 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        message.push(0x80);
+        for (; reqd > 1; reqd--) {
+            message.push(0x00);
+        }
+    },
+
+    unpad : function (message) {
+        while (message.pop() != 0x80) {}
+    }
+};
+
+// ANSI X.923 padding
+//
+// The final block is padded with zeros except for the last byte of the
+// last block which contains the number of padding bytes.
+C_pad.ansix923 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 1; i < reqd; i++) {
+            message.push(0x00);
+        }
+        message.push(reqd);
+    },
+
+    unpad : _unpadLength
+};
+
+// ISO 10126
+//
+// The final block is padded with random bytes except for the last
+// byte of the last block which contains the number of padding bytes.
+C_pad.iso10126 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 1; i < reqd; i++) {
+            message.push(Math.floor(Math.random() * 256));
+        }
+        message.push(reqd);
+    },
+
+    unpad : _unpadLength
+};
+
+// PKCS7 padding
+//
+// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
+// value of each added byte is the number of bytes that are added,
+// i.e. N bytes, each of value N are added.
+C_pad.pkcs7 = {
+    pad : function (cipher, message) {
+        var reqd = _requiredPadding(cipher, message);
+        for (var i = 0; i < reqd; i++) {
+            message.push(reqd);
+        }
+    },
+
+    unpad : _unpadLength
+};
+
+// Create mode namespace
+var C_mode = C.mode = {};
+
+/**
+ * Mode base "class".
+ */
+var Mode = C_mode.Mode = function (padding) {
+    if (padding) {
+        this._padding = padding;
+    }
+};
+
+Mode.prototype = {
+    encrypt: function (cipher, m, iv) {
+        this._padding.pad(cipher, m);
+        this._doEncrypt(cipher, m, iv);
+    },
+
+    decrypt: function (cipher, m, iv) {
+        this._doDecrypt(cipher, m, iv);
+        this._padding.unpad(m);
+    },
+
+    // Default padding
+    _padding: C_pad.iso7816
+};
+
+
+/**
+ * Electronic Code Book mode.
+ * 
+ * ECB applies the cipher directly against each block of the input.
+ * 
+ * ECB does not require an initialization vector.
+ */
+var ECB = C_mode.ECB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var ECB_prototype = ECB.prototype = new Mode;
+
+// Concrete steps for Mode template
+ECB_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    // Encrypt each block
+    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+        cipher._encryptblock(m, offset);
+    }
+};
+ECB_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+    // Decrypt each block
+    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+        cipher._decryptblock(c, offset);
+    }
+};
+
+// ECB never uses an IV
+ECB_prototype.fixOptions = function (options) {
+    options.iv = [];
+};
+
+
+/**
+ * Cipher block chaining
+ * 
+ * The first block is XORed with the IV. Subsequent blocks are XOR with the
+ * previous cipher output.
+ */
+var CBC = C_mode.CBC = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CBC_prototype = CBC.prototype = new Mode;
+
+// Concrete steps for Mode template
+CBC_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    // Encrypt each block
+    for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+        if (offset == 0) {
+            // XOR first block using IV
+            for (var i = 0; i < blockSizeInBytes; i++)
+            m[i] ^= iv[i];
+        } else {
+            // XOR this block using previous crypted block
+            for (var i = 0; i < blockSizeInBytes; i++)
+            m[offset + i] ^= m[offset + i - blockSizeInBytes];
+        }
+        // Encrypt block
+        cipher._encryptblock(m, offset);
+    }
+};
+CBC_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    // At the start, the previously crypted block is the IV
+    var prevCryptedBlock = iv;
+
+    // Decrypt each block
+    for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+        // Save this crypted block
+        var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
+        // Decrypt block
+        cipher._decryptblock(c, offset);
+        // XOR decrypted block using previous crypted block
+        for (var i = 0; i < blockSizeInBytes; i++) {
+            c[offset + i] ^= prevCryptedBlock[i];
+        }
+        prevCryptedBlock = thisCryptedBlock;
+    }
+};
+
+
+/**
+ * Cipher feed back
+ * 
+ * The cipher output is XORed with the plain text to produce the cipher output,
+ * which is then fed back into the cipher to produce a bit pattern to XOR the
+ * next block with.
+ * 
+ * This is a stream cipher mode and does not require padding.
+ */
+var CFB = C_mode.CFB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CFB_prototype = CFB.prototype = new Mode;
+
+// Override padding
+CFB_prototype._padding = C_pad.NoPadding;
+
+// Concrete steps for Mode template
+CFB_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < m.length; i++) {
+
+        var j = i % blockSizeInBytes;
+        if (j == 0) cipher._encryptblock(keystream, 0);
+
+        m[i] ^= keystream[j];
+        keystream[j] = m[i];
+    }
+};
+CFB_prototype._doDecrypt = function (cipher, c, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < c.length; i++) {
+
+        var j = i % blockSizeInBytes;
+        if (j == 0) cipher._encryptblock(keystream, 0);
+
+        var b = c[i];
+        c[i] ^= keystream[j];
+        keystream[j] = b;
+    }
+};
+
+
+/**
+ * Output feed back
+ * 
+ * The cipher repeatedly encrypts its own output. The output is XORed with the
+ * plain text to produce the cipher text.
+ * 
+ * This is a stream cipher mode and does not require padding.
+ */
+var OFB = C_mode.OFB = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var OFB_prototype = OFB.prototype = new Mode;
+
+// Override padding
+OFB_prototype._padding = C_pad.NoPadding;
+
+// Concrete steps for Mode template
+OFB_prototype._doEncrypt = function (cipher, m, iv) {
+
+    var blockSizeInBytes = cipher._blocksize * 4,
+        keystream = iv.slice(0);
+
+    // Encrypt each byte
+    for (var i = 0; i < m.length; i++) {
+
+        // Generate keystream
+        if (i % blockSizeInBytes == 0)
+            cipher._encryptblock(keystream, 0);
+
+        // Encrypt byte
+        m[i] ^= keystream[i % blockSizeInBytes];
+
+    }
+};
+OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
+
+/**
+ * Counter
+ * @author Gergely Risko
+ *
+ * After every block the last 4 bytes of the IV is increased by one
+ * with carry and that IV is used for the next block.
+ *
+ * This is a stream cipher mode and does not require padding.
+ */
+var CTR = C_mode.CTR = function () {
+    // Call parent constructor
+    Mode.apply(this, arguments);
+};
+
+// Inherit from Mode
+var CTR_prototype = CTR.prototype = new Mode;
+
+// Override padding
+CTR_prototype._padding = C_pad.NoPadding;
+
+CTR_prototype._doEncrypt = function (cipher, m, iv) {
+    var blockSizeInBytes = cipher._blocksize * 4;
+
+    for (var i = 0; i < m.length;) {
+        // do not lose iv
+        var keystream = iv.slice(0);
+
+        // Generate keystream for next block
+        cipher._encryptblock(keystream, 0);
+
+        // XOR keystream with block
+        for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
+            m[i] ^= keystream[j];
+        }
+
+        // Increase IV
+        if(++(iv[blockSizeInBytes-1]) == 256) {
+            iv[blockSizeInBytes-1] = 0;
+            if(++(iv[blockSizeInBytes-2]) == 256) {
+                iv[blockSizeInBytes-2] = 0;
+                if(++(iv[blockSizeInBytes-3]) == 256) {
+                    iv[blockSizeInBytes-3] = 0;
+                    ++(iv[blockSizeInBytes-4]);
+                }
+            }
+        }
+    }
+};
+CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
+
+})(Crypto);
diff --git a/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js b/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js
index 71ebcf2..c87094f 100755
--- a/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-md5-hmac/crypto-md5-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},o=n.util={rotl:function(h,i){return h<>>32-i},rotr:function(h,i){return h<<32-i|h>>>i},endian:function(h){if(h.constructor==Number)return o.rotl(h,8)&16711935|o.rotl(h,24)&4278255360;for(var i=0;i0;h--)i.push(Math.floor(Math.random()*256));return i},bytesToWords:function(h){for(var i=[],g=0,a=0;g>>5]|=h[g]<<24-
 a%32;return i},wordsToBytes:function(h){for(var i=[],g=0;g>>5]>>>24-g%32&255);return i},bytesToHex:function(h){for(var i=[],g=0;g>>4).toString(16));i.push((h[g]&15).toString(16))}return i.join("")},hexToBytes:function(h){for(var i=[],g=0;g>>6*(3-b)&63)):i.push("=");return i.join("")},base64ToBytes:function(h){if(typeof atob=="function")return p.stringToBytes(atob(h));h=h.replace(/[^A-Z0-9+\/]/ig,"");for(var i=[],g=0,a=0;g>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js b/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js
index f964a50..1d00820 100755
--- a/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-md5/crypto-md5.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},o=n.util={rotl:function(g,i){return g<>>32-i},rotr:function(g,i){return g<<32-i|g>>>i},endian:function(g){if(g.constructor==Number)return o.rotl(g,8)&16711935|o.rotl(g,24)&4278255360;for(var i=0;i0;g--)i.push(Math.floor(Math.random()*256));return i},bytesToWords:function(g){for(var i=[],h=0,a=0;h>>5]|=g[h]<<24-
 a%32;return i},wordsToBytes:function(g){for(var i=[],h=0;h>>5]>>>24-h%32&255);return i},bytesToHex:function(g){for(var i=[],h=0;h>>4).toString(16));i.push((g[h]&15).toString(16))}return i.join("")},hexToBytes:function(g){for(var i=[],h=0;h>>6*(3-b)&63)):i.push("=");return i.join("")},base64ToBytes:function(g){if(typeof atob=="function")return p.stringToBytes(atob(g));g=g.replace(/[^A-Z0-9+\/]/ig,"");for(var i=[],h=0,a=0;h>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js
index 608a7ad..4287cea 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-blockmodes-aes/crypto-sha1-hmac-pbkdf2-blockmodes-aes.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var n=window.Crypto={},q=n.util={rotl:function(f,j){return f<>>32-j},rotr:function(f,j){return f<<32-j|f>>>j},endian:function(f){if(f.constructor==Number)return q.rotl(f,8)&16711935|q.rotl(f,24)&4278255360;for(var j=0;j0;f--)j.push(Math.floor(Math.random()*256));return j},bytesToWords:function(f){for(var j=[],b=0,a=0;b>>5]|=f[b]<<24-
 a%32;return j},wordsToBytes:function(f){for(var j=[],b=0;b>>5]>>>24-b%32&255);return j},bytesToHex:function(f){for(var j=[],b=0;b>>4).toString(16));j.push((f[b]&15).toString(16))}return j.join("")},hexToBytes:function(f){for(var j=[],b=0;b>>6*(3-e)&63)):j.push("=");return j.join("")},base64ToBytes:function(f){if(typeof atob=="function")return p.stringToBytes(atob(f));f=f.replace(/[^A-Z0-9+\/]/ig,"");for(var j=[],b=0,a=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js
index 650d03f..7006067 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var h=window.Crypto={},k=h.util={rotl:function(b,d){return b<>>32-d},rotr:function(b,d){return b<<32-d|b>>>d},endian:function(b){if(b.constructor==Number)return k.rotl(b,8)&16711935|k.rotl(b,24)&4278255360;for(var d=0;d0;b--)d.push(Math.floor(Math.random()*256));return d},bytesToWords:function(b){for(var d=[],a=0,e=0;a>>5]|=b[a]<<24-
 e%32;return d},wordsToBytes:function(b){for(var d=[],a=0;a>>5]>>>24-a%32&255);return d},bytesToHex:function(b){for(var d=[],a=0;a>>4).toString(16));d.push((b[a]&15).toString(16))}return d.join("")},hexToBytes:function(b){for(var d=[],a=0;a>>6*(3-c)&63)):d.push("=");return d.join("")},base64ToBytes:function(b){if(typeof atob=="function")return l.stringToBytes(atob(b));b=b.replace(/[^A-Z0-9+\/]/ig,"");for(var d=[],a=0,e=0;a>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js
index 88d5aae..651dc5e 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var i=window.Crypto={},j=i.util={rotl:function(b,c){return b<>>32-c},rotr:function(b,c){return b<<32-c|b>>>c},endian:function(b){if(b.constructor==Number)return j.rotl(b,8)&16711935|j.rotl(b,24)&4278255360;for(var c=0;c0;b--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(b){for(var c=[],e=0,g=0;e>>5]|=b[e]<<24-
 g%32;return c},wordsToBytes:function(b){for(var c=[],e=0;e>>5]>>>24-e%32&255);return c},bytesToHex:function(b){for(var c=[],e=0;e>>4).toString(16));c.push((b[e]&15).toString(16))}return c.join("")},hexToBytes:function(b){for(var c=[],e=0;e>>6*(3-a)&63)):c.push("=");return c.join("")},base64ToBytes:function(b){if(typeof atob=="function")return m.stringToBytes(atob(b));b=b.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],e=0,g=0;e>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js
index 58c00ec..dcc018b 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var g=window.Crypto={},m=g.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return m.rotl(a,8)&16711935|m.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return k.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js
index 8d416b0..397a848 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac-pbkdf2async/crypto-sha1-hmac-pbkdf2async.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var f=window.Crypto={},n=f.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return l.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js
index 6a5a49c..094a430 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1-hmac/crypto-sha1-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var i=window.Crypto={},n=i.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return j.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js b/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js
index 7a99356..52ed1c1 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha1/crypto-sha1.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var k=window.Crypto={},l=k.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return l.rotl(a,8)&16711935|l.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,d=0;b>>5]|=a[b]<<24-
 d%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-e)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return m.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,d=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js b/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js
index fefdcfb..73aaa61 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha256-hmac/crypto-sha256-hmac.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var h=window.Crypto={},n=h.util={rotl:function(a,c){return a<>>32-c},rotr:function(a,c){return a<<32-c|a>>>c},endian:function(a){if(a.constructor==Number)return n.rotl(a,8)&16711935|n.rotl(a,24)&4278255360;for(var c=0;c0;a--)c.push(Math.floor(Math.random()*256));return c},bytesToWords:function(a){for(var c=[],b=0,f=0;b>>5]|=a[b]<<24-
 f%32;return c},wordsToBytes:function(a){for(var c=[],b=0;b>>5]>>>24-b%32&255);return c},bytesToHex:function(a){for(var c=[],b=0;b>>4).toString(16));c.push((a[b]&15).toString(16))}return c.join("")},hexToBytes:function(a){for(var c=[],b=0;b>>6*(3-d)&63)):c.push("=");return c.join("")},base64ToBytes:function(a){if(typeof atob=="function")return l.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var c=[],b=0,f=0;b>>
diff --git a/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js b/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js
index 64dc0d8..873a1bb 100755
--- a/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js	
+++ b/tools/Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var j=window.Crypto={},m=j.util={rotl:function(a,b){return a<>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return m.rotl(a,8)&16711935|m.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,f=0;c>>5]|=a[c]<<24-
 f%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-d)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return n.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,f=0;c>>
diff --git a/tools/Crypto-JS v2.4.0/crypto/crypto-min.js b/tools/Crypto-JS v2.4.0/crypto/crypto-min.js
index a9a70f0..e194fb3 100755
--- a/tools/Crypto-JS v2.4.0/crypto/crypto-min.js	
+++ b/tools/Crypto-JS v2.4.0/crypto/crypto-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 if(typeof Crypto=="undefined"||!Crypto.util)(function(){var e=window.Crypto={},h=e.util={rotl:function(a,b){return a<>>32-b},rotr:function(a,b){return a<<32-b|a>>>b},endian:function(a){if(a.constructor==Number)return h.rotl(a,8)&16711935|h.rotl(a,24)&4278255360;for(var b=0;b0;a--)b.push(Math.floor(Math.random()*256));return b},bytesToWords:function(a){for(var b=[],c=0,d=0;c>>5]|=a[c]<<24-
 d%32;return b},wordsToBytes:function(a){for(var b=[],c=0;c>>5]>>>24-c%32&255);return b},bytesToHex:function(a){for(var b=[],c=0;c>>4).toString(16));b.push((a[c]&15).toString(16))}return b.join("")},hexToBytes:function(a){for(var b=[],c=0;c>>6*(3-g)&63)):b.push("=");return b.join("")},base64ToBytes:function(a){if(typeof atob=="function")return f.stringToBytes(atob(a));a=a.replace(/[^A-Z0-9+\/]/ig,"");for(var b=[],c=0,d=0;c>>
diff --git a/tools/Crypto-JS v2.4.0/crypto/crypto.js b/tools/Crypto-JS v2.4.0/crypto/crypto.js
index e8090fe..35d5216 100755
--- a/tools/Crypto-JS v2.4.0/crypto/crypto.js	
+++ b/tools/Crypto-JS v2.4.0/crypto/crypto.js	
@@ -1,160 +1,160 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-if (typeof Crypto == "undefined" || ! Crypto.util)
-{
-(function(){
-
-var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-
-// Global Crypto object
-var Crypto = window.Crypto = {};
-
-// Crypto utilities
-var util = Crypto.util = {
-
-	// Bit-wise rotate left
-	rotl: function (n, b) {
-		return (n << b) | (n >>> (32 - b));
-	},
-
-	// Bit-wise rotate right
-	rotr: function (n, b) {
-		return (n << (32 - b)) | (n >>> b);
-	},
-
-	// Swap big-endian to little-endian and vice versa
-	endian: function (n) {
-
-		// If number given, swap endian
-		if (n.constructor == Number) {
-			return util.rotl(n,  8) & 0x00FF00FF |
-			       util.rotl(n, 24) & 0xFF00FF00;
-		}
-
-		// Else, assume array and swap all items
-		for (var i = 0; i < n.length; i++)
-			n[i] = util.endian(n[i]);
-		return n;
-
-	},
-
-	// Generate an array of any length of random bytes
-	randomBytes: function (n) {
-		for (var bytes = []; n > 0; n--)
-			bytes.push(Math.floor(Math.random() * 256));
-		return bytes;
-	},
-
-	// Convert a byte array to big-endian 32-bit words
-	bytesToWords: function (bytes) {
-		for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
-			words[b >>> 5] |= bytes[i] << (24 - b % 32);
-		return words;
-	},
-
-	// Convert big-endian 32-bit words to a byte array
-	wordsToBytes: function (words) {
-		for (var bytes = [], b = 0; b < words.length * 32; b += 8)
-			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
-		return bytes;
-	},
-
-	// Convert a byte array to a hex string
-	bytesToHex: function (bytes) {
-		for (var hex = [], i = 0; i < bytes.length; i++) {
-			hex.push((bytes[i] >>> 4).toString(16));
-			hex.push((bytes[i] & 0xF).toString(16));
-		}
-		return hex.join("");
-	},
-
-	// Convert a hex string to a byte array
-	hexToBytes: function (hex) {
-		for (var bytes = [], c = 0; c < hex.length; c += 2)
-			bytes.push(parseInt(hex.substr(c, 2), 16));
-		return bytes;
-	},
-
-	// Convert a byte array to a base-64 string
-	bytesToBase64: function (bytes) {
-
-		// Use browser-native function if it exists
-		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
-
-		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
-			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
-			for (var j = 0; j < 4; j++) {
-				if (i * 8 + j * 6 <= bytes.length * 8)
-					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
-				else base64.push("=");
-			}
-		}
-
-		return base64.join("");
-
-	},
-
-	// Convert a base-64 string to a byte array
-	base64ToBytes: function (base64) {
-
-		// Use browser-native function if it exists
-		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
-
-		// Remove non-base-64 characters
-		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
-
-		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
-			if (imod4 == 0) continue;
-			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
-			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
-		}
-
-		return bytes;
-
-	}
-
-};
-
-// Crypto character encodings
-var charenc = Crypto.charenc = {};
-
-// UTF-8 encoding
-var UTF8 = charenc.UTF8 = {
-
-	// Convert a string to a byte array
-	stringToBytes: function (str) {
-		return Binary.stringToBytes(unescape(encodeURIComponent(str)));
-	},
-
-	// Convert a byte array to a string
-	bytesToString: function (bytes) {
-		return decodeURIComponent(escape(Binary.bytesToString(bytes)));
-	}
-
-};
-
-// Binary encoding
-var Binary = charenc.Binary = {
-
-	// Convert a string to a byte array
-	stringToBytes: function (str) {
-		for (var bytes = [], i = 0; i < str.length; i++)
-			bytes.push(str.charCodeAt(i) & 0xFF);
-		return bytes;
-	},
-
-	// Convert a byte array to a string
-	bytesToString: function (bytes) {
-		for (var str = [], i = 0; i < bytes.length; i++)
-			str.push(String.fromCharCode(bytes[i]));
-		return str.join("");
-	}
-
-};
-
-})();
-}
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+if (typeof Crypto == "undefined" || ! Crypto.util)
+{
+(function(){
+
+var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+// Global Crypto object
+var Crypto = window.Crypto = {};
+
+// Crypto utilities
+var util = Crypto.util = {
+
+	// Bit-wise rotate left
+	rotl: function (n, b) {
+		return (n << b) | (n >>> (32 - b));
+	},
+
+	// Bit-wise rotate right
+	rotr: function (n, b) {
+		return (n << (32 - b)) | (n >>> b);
+	},
+
+	// Swap big-endian to little-endian and vice versa
+	endian: function (n) {
+
+		// If number given, swap endian
+		if (n.constructor == Number) {
+			return util.rotl(n,  8) & 0x00FF00FF |
+			       util.rotl(n, 24) & 0xFF00FF00;
+		}
+
+		// Else, assume array and swap all items
+		for (var i = 0; i < n.length; i++)
+			n[i] = util.endian(n[i]);
+		return n;
+
+	},
+
+	// Generate an array of any length of random bytes
+	randomBytes: function (n) {
+		for (var bytes = []; n > 0; n--)
+			bytes.push(Math.floor(Math.random() * 256));
+		return bytes;
+	},
+
+	// Convert a byte array to big-endian 32-bit words
+	bytesToWords: function (bytes) {
+		for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
+			words[b >>> 5] |= bytes[i] << (24 - b % 32);
+		return words;
+	},
+
+	// Convert big-endian 32-bit words to a byte array
+	wordsToBytes: function (words) {
+		for (var bytes = [], b = 0; b < words.length * 32; b += 8)
+			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+		return bytes;
+	},
+
+	// Convert a byte array to a hex string
+	bytesToHex: function (bytes) {
+		for (var hex = [], i = 0; i < bytes.length; i++) {
+			hex.push((bytes[i] >>> 4).toString(16));
+			hex.push((bytes[i] & 0xF).toString(16));
+		}
+		return hex.join("");
+	},
+
+	// Convert a hex string to a byte array
+	hexToBytes: function (hex) {
+		for (var bytes = [], c = 0; c < hex.length; c += 2)
+			bytes.push(parseInt(hex.substr(c, 2), 16));
+		return bytes;
+	},
+
+	// Convert a byte array to a base-64 string
+	bytesToBase64: function (bytes) {
+
+		// Use browser-native function if it exists
+		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
+
+		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
+			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
+			for (var j = 0; j < 4; j++) {
+				if (i * 8 + j * 6 <= bytes.length * 8)
+					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
+				else base64.push("=");
+			}
+		}
+
+		return base64.join("");
+
+	},
+
+	// Convert a base-64 string to a byte array
+	base64ToBytes: function (base64) {
+
+		// Use browser-native function if it exists
+		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
+
+		// Remove non-base-64 characters
+		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
+
+		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
+			if (imod4 == 0) continue;
+			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
+			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
+		}
+
+		return bytes;
+
+	}
+
+};
+
+// Crypto character encodings
+var charenc = Crypto.charenc = {};
+
+// UTF-8 encoding
+var UTF8 = charenc.UTF8 = {
+
+	// Convert a string to a byte array
+	stringToBytes: function (str) {
+		return Binary.stringToBytes(unescape(encodeURIComponent(str)));
+	},
+
+	// Convert a byte array to a string
+	bytesToString: function (bytes) {
+		return decodeURIComponent(escape(Binary.bytesToString(bytes)));
+	}
+
+};
+
+// Binary encoding
+var Binary = charenc.Binary = {
+
+	// Convert a string to a byte array
+	stringToBytes: function (str) {
+		for (var bytes = [], i = 0; i < str.length; i++)
+			bytes.push(str.charCodeAt(i) & 0xFF);
+		return bytes;
+	},
+
+	// Convert a byte array to a string
+	bytesToString: function (bytes) {
+		for (var str = [], i = 0; i < bytes.length; i++)
+			str.push(String.fromCharCode(bytes[i]));
+		return str.join("");
+	}
+
+};
+
+})();
+}
diff --git a/tools/Crypto-JS v2.4.0/hmac/hmac-min.js b/tools/Crypto-JS v2.4.0/hmac/hmac-min.js
index 0becfbc..da13e60 100755
--- a/tools/Crypto-JS v2.4.0/hmac/hmac-min.js	
+++ b/tools/Crypto-JS v2.4.0/hmac/hmac-min.js	
@@ -1,7 +1,7 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var f=Crypto,j=f.util,g=f.charenc,h=g.UTF8,k=g.Binary;f.HMAC=function(b,c,a,d){if(c.constructor==String)c=h.stringToBytes(c);if(a.constructor==String)a=h.stringToBytes(a);if(a.length>b._blocksize*4)a=b(a,{asBytes:true});var i=a.slice(0);a=a.slice(0);for(var e=0;e hasher._blocksize * 4)
-		key = hasher(key, { asBytes: true });
-
-	// XOR keys with pad constants
-	var okey = key.slice(0),
-	    ikey = key.slice(0);
-	for (var i = 0; i < hasher._blocksize * 4; i++) {
-		okey[i] ^= 0x5C;
-		ikey[i] ^= 0x36;
-	}
-
-	var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
-
-	return options && options.asBytes ? hmacbytes :
-	       options && options.asString ? Binary.bytesToString(hmacbytes) :
-	       util.bytesToHex(hmacbytes);
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+C.HMAC = function (hasher, message, key, options) {
+
+	// Convert to byte arrays
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	if (key.constructor == String) key = UTF8.stringToBytes(key);
+	/* else, assume byte arrays already */
+
+	// Allow arbitrary length keys
+	if (key.length > hasher._blocksize * 4)
+		key = hasher(key, { asBytes: true });
+
+	// XOR keys with pad constants
+	var okey = key.slice(0),
+	    ikey = key.slice(0);
+	for (var i = 0; i < hasher._blocksize * 4; i++) {
+		okey[i] ^= 0x5C;
+		ikey[i] ^= 0x36;
+	}
+
+	var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
+
+	return options && options.asBytes ? hmacbytes :
+	       options && options.asString ? Binary.bytesToString(hmacbytes) :
+	       util.bytesToHex(hmacbytes);
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/marc4/marc4-min.js b/tools/Crypto-JS v2.4.0/marc4/marc4-min.js
index dfcff6a..96d1066 100755
--- a/tools/Crypto-JS v2.4.0/marc4/marc4-min.js	
+++ b/tools/Crypto-JS v2.4.0/marc4/marc4-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var g=Crypto,i=g.util,j=g.charenc.UTF8,k=g.MARC4={encrypt:function(f,b){var e=j.stringToBytes(f),a=i.randomBytes(16),d=b.constructor==String?g.PBKDF2(b,a,32,{asBytes:true}):b;k._marc4(e,d,1536);return i.bytesToBase64(a.concat(e))},decrypt:function(f,b){var e=i.base64ToBytes(f),a=e.splice(0,16);a=b.constructor==String?g.PBKDF2(b,a,32,{asBytes:true}):b;k._marc4(e,a,1536);return j.bytesToString(e)},_marc4:function(f,b,e){var a,d,c,h;a=0;for(c=[];a<256;a++)c[a]=a;for(d=a=0;a<256;a++){d=(d+
 c[a]+b[a%b.length])%256;h=c[a];c[a]=c[d];c[d]=h}a=d=0;for(b=-e;b>>24)&16711935|(e[f]<<24|e[f]>>>8)&4278255360;e[g>>>5]|=128<>>9<<4)+14]=g;g=k._ff;var h=k._gg,i=
 k._hh,j=k._ii;for(f=0;f>> 24)) & 0x00FF00FF |
-		       ((m[i] << 24) | (m[i] >>>  8)) & 0xFF00FF00;
-	}
-
-	// Padding
-	m[l >>> 5] |= 0x80 << (l % 32);
-	m[(((l + 64) >>> 9) << 4) + 14] = l;
-
-	// Method shortcuts
-	var FF = MD5._ff,
-	    GG = MD5._gg,
-	    HH = MD5._hh,
-	    II = MD5._ii;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		var aa = a,
-		    bb = b,
-		    cc = c,
-		    dd = d;
-
-		a = FF(a, b, c, d, m[i+ 0],  7, -680876936);
-		d = FF(d, a, b, c, m[i+ 1], 12, -389564586);
-		c = FF(c, d, a, b, m[i+ 2], 17,  606105819);
-		b = FF(b, c, d, a, m[i+ 3], 22, -1044525330);
-		a = FF(a, b, c, d, m[i+ 4],  7, -176418897);
-		d = FF(d, a, b, c, m[i+ 5], 12,  1200080426);
-		c = FF(c, d, a, b, m[i+ 6], 17, -1473231341);
-		b = FF(b, c, d, a, m[i+ 7], 22, -45705983);
-		a = FF(a, b, c, d, m[i+ 8],  7,  1770035416);
-		d = FF(d, a, b, c, m[i+ 9], 12, -1958414417);
-		c = FF(c, d, a, b, m[i+10], 17, -42063);
-		b = FF(b, c, d, a, m[i+11], 22, -1990404162);
-		a = FF(a, b, c, d, m[i+12],  7,  1804603682);
-		d = FF(d, a, b, c, m[i+13], 12, -40341101);
-		c = FF(c, d, a, b, m[i+14], 17, -1502002290);
-		b = FF(b, c, d, a, m[i+15], 22,  1236535329);
-
-		a = GG(a, b, c, d, m[i+ 1],  5, -165796510);
-		d = GG(d, a, b, c, m[i+ 6],  9, -1069501632);
-		c = GG(c, d, a, b, m[i+11], 14,  643717713);
-		b = GG(b, c, d, a, m[i+ 0], 20, -373897302);
-		a = GG(a, b, c, d, m[i+ 5],  5, -701558691);
-		d = GG(d, a, b, c, m[i+10],  9,  38016083);
-		c = GG(c, d, a, b, m[i+15], 14, -660478335);
-		b = GG(b, c, d, a, m[i+ 4], 20, -405537848);
-		a = GG(a, b, c, d, m[i+ 9],  5,  568446438);
-		d = GG(d, a, b, c, m[i+14],  9, -1019803690);
-		c = GG(c, d, a, b, m[i+ 3], 14, -187363961);
-		b = GG(b, c, d, a, m[i+ 8], 20,  1163531501);
-		a = GG(a, b, c, d, m[i+13],  5, -1444681467);
-		d = GG(d, a, b, c, m[i+ 2],  9, -51403784);
-		c = GG(c, d, a, b, m[i+ 7], 14,  1735328473);
-		b = GG(b, c, d, a, m[i+12], 20, -1926607734);
-
-		a = HH(a, b, c, d, m[i+ 5],  4, -378558);
-		d = HH(d, a, b, c, m[i+ 8], 11, -2022574463);
-		c = HH(c, d, a, b, m[i+11], 16,  1839030562);
-		b = HH(b, c, d, a, m[i+14], 23, -35309556);
-		a = HH(a, b, c, d, m[i+ 1],  4, -1530992060);
-		d = HH(d, a, b, c, m[i+ 4], 11,  1272893353);
-		c = HH(c, d, a, b, m[i+ 7], 16, -155497632);
-		b = HH(b, c, d, a, m[i+10], 23, -1094730640);
-		a = HH(a, b, c, d, m[i+13],  4,  681279174);
-		d = HH(d, a, b, c, m[i+ 0], 11, -358537222);
-		c = HH(c, d, a, b, m[i+ 3], 16, -722521979);
-		b = HH(b, c, d, a, m[i+ 6], 23,  76029189);
-		a = HH(a, b, c, d, m[i+ 9],  4, -640364487);
-		d = HH(d, a, b, c, m[i+12], 11, -421815835);
-		c = HH(c, d, a, b, m[i+15], 16,  530742520);
-		b = HH(b, c, d, a, m[i+ 2], 23, -995338651);
-
-		a = II(a, b, c, d, m[i+ 0],  6, -198630844);
-		d = II(d, a, b, c, m[i+ 7], 10,  1126891415);
-		c = II(c, d, a, b, m[i+14], 15, -1416354905);
-		b = II(b, c, d, a, m[i+ 5], 21, -57434055);
-		a = II(a, b, c, d, m[i+12],  6,  1700485571);
-		d = II(d, a, b, c, m[i+ 3], 10, -1894986606);
-		c = II(c, d, a, b, m[i+10], 15, -1051523);
-		b = II(b, c, d, a, m[i+ 1], 21, -2054922799);
-		a = II(a, b, c, d, m[i+ 8],  6,  1873313359);
-		d = II(d, a, b, c, m[i+15], 10, -30611744);
-		c = II(c, d, a, b, m[i+ 6], 15, -1560198380);
-		b = II(b, c, d, a, m[i+13], 21,  1309151649);
-		a = II(a, b, c, d, m[i+ 4],  6, -145523070);
-		d = II(d, a, b, c, m[i+11], 10, -1120210379);
-		c = II(c, d, a, b, m[i+ 2], 15,  718787259);
-		b = II(b, c, d, a, m[i+ 9], 21, -343485551);
-
-		a = (a + aa) >>> 0;
-		b = (b + bb) >>> 0;
-		c = (c + cc) >>> 0;
-		d = (d + dd) >>> 0;
-
-	}
-
-	return util.endian([a, b, c, d]);
-
-};
-
-// Auxiliary functions
-MD5._ff  = function (a, b, c, d, x, s, t) {
-	var n = a + (b & c | ~b & d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._gg  = function (a, b, c, d, x, s, t) {
-	var n = a + (b & d | c & ~d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._hh  = function (a, b, c, d, x, s, t) {
-	var n = a + (b ^ c ^ d) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-MD5._ii  = function (a, b, c, d, x, s, t) {
-	var n = a + (c ^ (b | ~d)) + (x >>> 0) + t;
-	return ((n << s) | (n >>> (32 - s))) + b;
-};
-
-// Package private blocksize
-MD5._blocksize = 16;
-
-MD5._digestsize = 16;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Public API
+var MD5 = C.MD5 = function (message, options) {
+	var digestbytes = util.wordsToBytes(MD5._md5(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+MD5._md5 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m = util.bytesToWords(message),
+	    l = message.length * 8,
+	    a =  1732584193,
+	    b = -271733879,
+	    c = -1732584194,
+	    d =  271733878;
+
+	// Swap endian
+	for (var i = 0; i < m.length; i++) {
+		m[i] = ((m[i] <<  8) | (m[i] >>> 24)) & 0x00FF00FF |
+		       ((m[i] << 24) | (m[i] >>>  8)) & 0xFF00FF00;
+	}
+
+	// Padding
+	m[l >>> 5] |= 0x80 << (l % 32);
+	m[(((l + 64) >>> 9) << 4) + 14] = l;
+
+	// Method shortcuts
+	var FF = MD5._ff,
+	    GG = MD5._gg,
+	    HH = MD5._hh,
+	    II = MD5._ii;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var aa = a,
+		    bb = b,
+		    cc = c,
+		    dd = d;
+
+		a = FF(a, b, c, d, m[i+ 0],  7, -680876936);
+		d = FF(d, a, b, c, m[i+ 1], 12, -389564586);
+		c = FF(c, d, a, b, m[i+ 2], 17,  606105819);
+		b = FF(b, c, d, a, m[i+ 3], 22, -1044525330);
+		a = FF(a, b, c, d, m[i+ 4],  7, -176418897);
+		d = FF(d, a, b, c, m[i+ 5], 12,  1200080426);
+		c = FF(c, d, a, b, m[i+ 6], 17, -1473231341);
+		b = FF(b, c, d, a, m[i+ 7], 22, -45705983);
+		a = FF(a, b, c, d, m[i+ 8],  7,  1770035416);
+		d = FF(d, a, b, c, m[i+ 9], 12, -1958414417);
+		c = FF(c, d, a, b, m[i+10], 17, -42063);
+		b = FF(b, c, d, a, m[i+11], 22, -1990404162);
+		a = FF(a, b, c, d, m[i+12],  7,  1804603682);
+		d = FF(d, a, b, c, m[i+13], 12, -40341101);
+		c = FF(c, d, a, b, m[i+14], 17, -1502002290);
+		b = FF(b, c, d, a, m[i+15], 22,  1236535329);
+
+		a = GG(a, b, c, d, m[i+ 1],  5, -165796510);
+		d = GG(d, a, b, c, m[i+ 6],  9, -1069501632);
+		c = GG(c, d, a, b, m[i+11], 14,  643717713);
+		b = GG(b, c, d, a, m[i+ 0], 20, -373897302);
+		a = GG(a, b, c, d, m[i+ 5],  5, -701558691);
+		d = GG(d, a, b, c, m[i+10],  9,  38016083);
+		c = GG(c, d, a, b, m[i+15], 14, -660478335);
+		b = GG(b, c, d, a, m[i+ 4], 20, -405537848);
+		a = GG(a, b, c, d, m[i+ 9],  5,  568446438);
+		d = GG(d, a, b, c, m[i+14],  9, -1019803690);
+		c = GG(c, d, a, b, m[i+ 3], 14, -187363961);
+		b = GG(b, c, d, a, m[i+ 8], 20,  1163531501);
+		a = GG(a, b, c, d, m[i+13],  5, -1444681467);
+		d = GG(d, a, b, c, m[i+ 2],  9, -51403784);
+		c = GG(c, d, a, b, m[i+ 7], 14,  1735328473);
+		b = GG(b, c, d, a, m[i+12], 20, -1926607734);
+
+		a = HH(a, b, c, d, m[i+ 5],  4, -378558);
+		d = HH(d, a, b, c, m[i+ 8], 11, -2022574463);
+		c = HH(c, d, a, b, m[i+11], 16,  1839030562);
+		b = HH(b, c, d, a, m[i+14], 23, -35309556);
+		a = HH(a, b, c, d, m[i+ 1],  4, -1530992060);
+		d = HH(d, a, b, c, m[i+ 4], 11,  1272893353);
+		c = HH(c, d, a, b, m[i+ 7], 16, -155497632);
+		b = HH(b, c, d, a, m[i+10], 23, -1094730640);
+		a = HH(a, b, c, d, m[i+13],  4,  681279174);
+		d = HH(d, a, b, c, m[i+ 0], 11, -358537222);
+		c = HH(c, d, a, b, m[i+ 3], 16, -722521979);
+		b = HH(b, c, d, a, m[i+ 6], 23,  76029189);
+		a = HH(a, b, c, d, m[i+ 9],  4, -640364487);
+		d = HH(d, a, b, c, m[i+12], 11, -421815835);
+		c = HH(c, d, a, b, m[i+15], 16,  530742520);
+		b = HH(b, c, d, a, m[i+ 2], 23, -995338651);
+
+		a = II(a, b, c, d, m[i+ 0],  6, -198630844);
+		d = II(d, a, b, c, m[i+ 7], 10,  1126891415);
+		c = II(c, d, a, b, m[i+14], 15, -1416354905);
+		b = II(b, c, d, a, m[i+ 5], 21, -57434055);
+		a = II(a, b, c, d, m[i+12],  6,  1700485571);
+		d = II(d, a, b, c, m[i+ 3], 10, -1894986606);
+		c = II(c, d, a, b, m[i+10], 15, -1051523);
+		b = II(b, c, d, a, m[i+ 1], 21, -2054922799);
+		a = II(a, b, c, d, m[i+ 8],  6,  1873313359);
+		d = II(d, a, b, c, m[i+15], 10, -30611744);
+		c = II(c, d, a, b, m[i+ 6], 15, -1560198380);
+		b = II(b, c, d, a, m[i+13], 21,  1309151649);
+		a = II(a, b, c, d, m[i+ 4],  6, -145523070);
+		d = II(d, a, b, c, m[i+11], 10, -1120210379);
+		c = II(c, d, a, b, m[i+ 2], 15,  718787259);
+		b = II(b, c, d, a, m[i+ 9], 21, -343485551);
+
+		a = (a + aa) >>> 0;
+		b = (b + bb) >>> 0;
+		c = (c + cc) >>> 0;
+		d = (d + dd) >>> 0;
+
+	}
+
+	return util.endian([a, b, c, d]);
+
+};
+
+// Auxiliary functions
+MD5._ff  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & c | ~b & d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._gg  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & d | c & ~d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._hh  = function (a, b, c, d, x, s, t) {
+	var n = a + (b ^ c ^ d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._ii  = function (a, b, c, d, x, s, t) {
+	var n = a + (c ^ (b | ~d)) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+
+// Package private blocksize
+MD5._blocksize = 16;
+
+MD5._digestsize = 16;
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js b/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js
index 169659f..c8b20b6 100755
--- a/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js	
+++ b/tools/Crypto-JS v2.4.0/pbkdf2/pbkdf2-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var c=Crypto,i=c.util,j=c.charenc,k=j.UTF8,p=j.Binary;c.PBKDF2=function(d,e,l,a){function m(q,r){return c.HMAC(s,r,q,{asBytes:true})}if(d.constructor==String)d=k.stringToBytes(d);if(e.constructor==String)e=k.stringToBytes(e);for(var s=a&&a.hasher||c.SHA1,t=a&&a.iterations||1,b=[],n=1;b.length>>16^d[3]<<16;c[1]=d[2]^d[7]>>>16^d[5]<<16;c[2]=d[4]^d[1]>>>16^d[7]<<16;c[3]=d[6]^d[3]>>>16^d[1]<<16;for(var e=0;e<4;e++)c[e]=(c[e]<<8|c[e]>>>24)&16711935|(c[e]<<24|c[e]>>>8)&4278255360;for(e=120;e>=0;e-=8)c[e/8]=c[e>>>5]>>>24-e%32&255}a[f]^=c[f%16]}},_keysetup:function(a){d[0]=a[0];d[2]=a[1];d[4]=a[2];d[6]=a[3];d[1]=a[3]<<16|a[2]>>>16;d[3]=a[0]<<16|a[3]>>>16;d[5]=a[1]<<16|a[0]>>>16;d[7]=a[2]<<16|a[1]>>>16;b[0]=g.rotl(a[2],16);
 b[2]=g.rotl(a[3],16);b[4]=g.rotl(a[0],16);b[6]=g.rotl(a[1],16);b[1]=a[0]&4294901760|a[1]&65535;b[3]=a[1]&4294901760|a[2]&65535;b[5]=a[2]&4294901760|a[3]&65535;b[7]=a[3]&4294901760|a[0]&65535;for(a=k=0;a<4;a++)i._nextstate();for(a=0;a<8;a++)b[a]^=d[a+4&7]},_ivsetup:function(a){var c=g.endian(a[0]);a=g.endian(a[1]);var f=c>>>16|a&4294901760,e=a<<16|c&65535;b[0]^=c;b[1]^=f;b[2]^=a;b[3]^=e;b[4]^=c;b[5]^=f;b[6]^=a;b[7]^=e;for(c=0;c<4;c++)i._nextstate()},_nextstate:function(){for(var a=[],c=0;c<8;c++)a[c]=
diff --git a/tools/Crypto-JS v2.4.0/rabbit/rabbit.js b/tools/Crypto-JS v2.4.0/rabbit/rabbit.js
index 87bdefc..1dae96b 100755
--- a/tools/Crypto-JS v2.4.0/rabbit/rabbit.js	
+++ b/tools/Crypto-JS v2.4.0/rabbit/rabbit.js	
@@ -1,226 +1,226 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Inner state
-var x = [],
-    c = [],
-    b;
-
-var Rabbit = C.Rabbit = {
-
-	/**
-	 * Public API
-	 */
-
-	encrypt: function (message, password) {
-
-		var
-
-		    // Convert to bytes
-		    m = UTF8.stringToBytes(message),
-
-		    // Generate random IV
-		    iv = util.randomBytes(8),
-
-		    // Generate key
-		    k = password.constructor == String ?
-		        // Derive key from passphrase
-		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
-		        // else, assume byte array representing cryptographic key
-		        password;
-
-		// Encrypt
-		Rabbit._rabbit(m, k, util.bytesToWords(iv));
-
-		// Return ciphertext
-		return util.bytesToBase64(iv.concat(m));
-
-	},
-
-	decrypt: function (ciphertext, password) {
-
-		var
-
-		    // Convert to bytes
-		    c = util.base64ToBytes(ciphertext),
-
-		    // Separate IV and message
-		    iv = c.splice(0, 8),
-
-		    // Generate key
-		    k = password.constructor == String ?
-		        // Derive key from passphrase
-		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
-		        // else, assume byte array representing cryptographic key
-		        password;
-
-		// Decrypt
-		Rabbit._rabbit(c, k, util.bytesToWords(iv));
-
-		// Return plaintext
-		return UTF8.bytesToString(c);
-
-	},
-
-
-	/**
-	 * Internal methods
-	 */
-
-	// Encryption/decryption scheme
-	_rabbit: function (m, k, iv) {
-
-		Rabbit._keysetup(k);
-		if (iv) Rabbit._ivsetup(iv);
-
-		for (var s = [], i = 0; i < m.length; i++) {
-
-			if (i % 16 == 0) {
-
-				// Iterate the system
-				Rabbit._nextstate();
-
-				// Generate 16 bytes of pseudo-random data
-				s[0] = x[0] ^ (x[5] >>> 16) ^ (x[3] << 16);
-				s[1] = x[2] ^ (x[7] >>> 16) ^ (x[5] << 16);
-				s[2] = x[4] ^ (x[1] >>> 16) ^ (x[7] << 16);
-				s[3] = x[6] ^ (x[3] >>> 16) ^ (x[1] << 16);
-
-				// Swap endian
-				for (var j = 0; j < 4; j++) {
-					s[j] = ((s[j] <<  8) | (s[j] >>> 24)) & 0x00FF00FF |
-					       ((s[j] << 24) | (s[j] >>>  8)) & 0xFF00FF00;
-				}
-
-				// Convert words to bytes
-				for (var b = 120; b >= 0; b -= 8)
-					s[b / 8] = (s[b >>> 5] >>> (24 - b % 32)) & 0xFF;
-
-			}
-
-			m[i] ^= s[i % 16];
-
-		}
-
-	},
-
-	// Key setup scheme
-	_keysetup: function (k) {
-
-		// Generate initial state values
-		x[0] = k[0];
-		x[2] = k[1];
-		x[4] = k[2];
-		x[6] = k[3];
-		x[1] = (k[3] << 16) | (k[2] >>> 16);
-		x[3] = (k[0] << 16) | (k[3] >>> 16);
-		x[5] = (k[1] << 16) | (k[0] >>> 16);
-		x[7] = (k[2] << 16) | (k[1] >>> 16);
-
-		// Generate initial counter values
-		c[0] = util.rotl(k[2], 16);
-		c[2] = util.rotl(k[3], 16);
-		c[4] = util.rotl(k[0], 16);
-		c[6] = util.rotl(k[1], 16);
-		c[1] = (k[0] & 0xFFFF0000) | (k[1] & 0xFFFF);
-		c[3] = (k[1] & 0xFFFF0000) | (k[2] & 0xFFFF);
-		c[5] = (k[2] & 0xFFFF0000) | (k[3] & 0xFFFF);
-		c[7] = (k[3] & 0xFFFF0000) | (k[0] & 0xFFFF);
-
-		// Clear carry bit
-		b = 0;
-
-		// Iterate the system four times
-		for (var i = 0; i < 4; i++) Rabbit._nextstate();
-
-		// Modify the counters
-		for (var i = 0; i < 8; i++) c[i] ^= x[(i + 4) & 7];
-
-	},
-
-	// IV setup scheme
-	_ivsetup: function (iv) {
-
-		// Generate four subvectors
-		var i0 = util.endian(iv[0]),
-		    i2 = util.endian(iv[1]),
-		    i1 = (i0 >>> 16) | (i2 & 0xFFFF0000),
-		    i3 = (i2 <<  16) | (i0 & 0x0000FFFF);
-
-		// Modify counter values
-		c[0] ^= i0;
-		c[1] ^= i1;
-		c[2] ^= i2;
-		c[3] ^= i3;
-		c[4] ^= i0;
-		c[5] ^= i1;
-		c[6] ^= i2;
-		c[7] ^= i3;
-
-		// Iterate the system four times
-		for (var i = 0; i < 4; i++) Rabbit._nextstate();
-
-	},
-
-	// Next-state function
-	_nextstate: function () {
-
-		// Save old counter values
-		for (var c_old = [], i = 0; i < 8; i++) c_old[i] = c[i];
-
-		// Calculate new counter values
-		c[0] = (c[0] + 0x4D34D34D + b) >>> 0;
-		c[1] = (c[1] + 0xD34D34D3 + ((c[0] >>> 0) < (c_old[0] >>> 0) ? 1 : 0)) >>> 0;
-		c[2] = (c[2] + 0x34D34D34 + ((c[1] >>> 0) < (c_old[1] >>> 0) ? 1 : 0)) >>> 0;
-		c[3] = (c[3] + 0x4D34D34D + ((c[2] >>> 0) < (c_old[2] >>> 0) ? 1 : 0)) >>> 0;
-		c[4] = (c[4] + 0xD34D34D3 + ((c[3] >>> 0) < (c_old[3] >>> 0) ? 1 : 0)) >>> 0;
-		c[5] = (c[5] + 0x34D34D34 + ((c[4] >>> 0) < (c_old[4] >>> 0) ? 1 : 0)) >>> 0;
-		c[6] = (c[6] + 0x4D34D34D + ((c[5] >>> 0) < (c_old[5] >>> 0) ? 1 : 0)) >>> 0;
-		c[7] = (c[7] + 0xD34D34D3 + ((c[6] >>> 0) < (c_old[6] >>> 0) ? 1 : 0)) >>> 0;
-		b = (c[7] >>> 0) < (c_old[7] >>> 0) ? 1 : 0;
-
-		// Calculate the g-values
-		for (var g = [], i = 0; i < 8; i++) {
-
-			var gx = (x[i] + c[i]) >>> 0;
-
-			// Construct high and low argument for squaring
-			var ga = gx & 0xFFFF,
-			    gb = gx >>> 16;
-
-			// Calculate high and low result of squaring
-			var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb,
-			    gl = (((gx & 0xFFFF0000) * gx) >>> 0) + (((gx & 0x0000FFFF) * gx) >>> 0) >>> 0;
-
-			// High XOR low
-			g[i] = gh ^ gl;
-
-		}
-
-		// Calculate new state values
-		x[0] = g[0] + ((g[7] << 16) | (g[7] >>> 16)) + ((g[6] << 16) | (g[6] >>> 16));
-		x[1] = g[1] + ((g[0] <<  8) | (g[0] >>> 24)) + g[7];
-		x[2] = g[2] + ((g[1] << 16) | (g[1] >>> 16)) + ((g[0] << 16) | (g[0] >>> 16));
-		x[3] = g[3] + ((g[2] <<  8) | (g[2] >>> 24)) + g[1];
-		x[4] = g[4] + ((g[3] << 16) | (g[3] >>> 16)) + ((g[2] << 16) | (g[2] >>> 16));
-		x[5] = g[5] + ((g[4] <<  8) | (g[4] >>> 24)) + g[3];
-		x[6] = g[6] + ((g[5] << 16) | (g[5] >>> 16)) + ((g[4] << 16) | (g[4] >>> 16));
-		x[7] = g[7] + ((g[6] <<  8) | (g[6] >>> 24)) + g[5];
-
-	}
-
-};
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Inner state
+var x = [],
+    c = [],
+    b;
+
+var Rabbit = C.Rabbit = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password) {
+
+		var
+
+		    // Convert to bytes
+		    m = UTF8.stringToBytes(message),
+
+		    // Generate random IV
+		    iv = util.randomBytes(8),
+
+		    // Generate key
+		    k = password.constructor == String ?
+		        // Derive key from passphrase
+		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
+		        // else, assume byte array representing cryptographic key
+		        password;
+
+		// Encrypt
+		Rabbit._rabbit(m, k, util.bytesToWords(iv));
+
+		// Return ciphertext
+		return util.bytesToBase64(iv.concat(m));
+
+	},
+
+	decrypt: function (ciphertext, password) {
+
+		var
+
+		    // Convert to bytes
+		    c = util.base64ToBytes(ciphertext),
+
+		    // Separate IV and message
+		    iv = c.splice(0, 8),
+
+		    // Generate key
+		    k = password.constructor == String ?
+		        // Derive key from passphrase
+		        C.PBKDF2(password, iv, 32, { asBytes: true }) :
+		        // else, assume byte array representing cryptographic key
+		        password;
+
+		// Decrypt
+		Rabbit._rabbit(c, k, util.bytesToWords(iv));
+
+		// Return plaintext
+		return UTF8.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Internal methods
+	 */
+
+	// Encryption/decryption scheme
+	_rabbit: function (m, k, iv) {
+
+		Rabbit._keysetup(k);
+		if (iv) Rabbit._ivsetup(iv);
+
+		for (var s = [], i = 0; i < m.length; i++) {
+
+			if (i % 16 == 0) {
+
+				// Iterate the system
+				Rabbit._nextstate();
+
+				// Generate 16 bytes of pseudo-random data
+				s[0] = x[0] ^ (x[5] >>> 16) ^ (x[3] << 16);
+				s[1] = x[2] ^ (x[7] >>> 16) ^ (x[5] << 16);
+				s[2] = x[4] ^ (x[1] >>> 16) ^ (x[7] << 16);
+				s[3] = x[6] ^ (x[3] >>> 16) ^ (x[1] << 16);
+
+				// Swap endian
+				for (var j = 0; j < 4; j++) {
+					s[j] = ((s[j] <<  8) | (s[j] >>> 24)) & 0x00FF00FF |
+					       ((s[j] << 24) | (s[j] >>>  8)) & 0xFF00FF00;
+				}
+
+				// Convert words to bytes
+				for (var b = 120; b >= 0; b -= 8)
+					s[b / 8] = (s[b >>> 5] >>> (24 - b % 32)) & 0xFF;
+
+			}
+
+			m[i] ^= s[i % 16];
+
+		}
+
+	},
+
+	// Key setup scheme
+	_keysetup: function (k) {
+
+		// Generate initial state values
+		x[0] = k[0];
+		x[2] = k[1];
+		x[4] = k[2];
+		x[6] = k[3];
+		x[1] = (k[3] << 16) | (k[2] >>> 16);
+		x[3] = (k[0] << 16) | (k[3] >>> 16);
+		x[5] = (k[1] << 16) | (k[0] >>> 16);
+		x[7] = (k[2] << 16) | (k[1] >>> 16);
+
+		// Generate initial counter values
+		c[0] = util.rotl(k[2], 16);
+		c[2] = util.rotl(k[3], 16);
+		c[4] = util.rotl(k[0], 16);
+		c[6] = util.rotl(k[1], 16);
+		c[1] = (k[0] & 0xFFFF0000) | (k[1] & 0xFFFF);
+		c[3] = (k[1] & 0xFFFF0000) | (k[2] & 0xFFFF);
+		c[5] = (k[2] & 0xFFFF0000) | (k[3] & 0xFFFF);
+		c[7] = (k[3] & 0xFFFF0000) | (k[0] & 0xFFFF);
+
+		// Clear carry bit
+		b = 0;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+		// Modify the counters
+		for (var i = 0; i < 8; i++) c[i] ^= x[(i + 4) & 7];
+
+	},
+
+	// IV setup scheme
+	_ivsetup: function (iv) {
+
+		// Generate four subvectors
+		var i0 = util.endian(iv[0]),
+		    i2 = util.endian(iv[1]),
+		    i1 = (i0 >>> 16) | (i2 & 0xFFFF0000),
+		    i3 = (i2 <<  16) | (i0 & 0x0000FFFF);
+
+		// Modify counter values
+		c[0] ^= i0;
+		c[1] ^= i1;
+		c[2] ^= i2;
+		c[3] ^= i3;
+		c[4] ^= i0;
+		c[5] ^= i1;
+		c[6] ^= i2;
+		c[7] ^= i3;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+	},
+
+	// Next-state function
+	_nextstate: function () {
+
+		// Save old counter values
+		for (var c_old = [], i = 0; i < 8; i++) c_old[i] = c[i];
+
+		// Calculate new counter values
+		c[0] = (c[0] + 0x4D34D34D + b) >>> 0;
+		c[1] = (c[1] + 0xD34D34D3 + ((c[0] >>> 0) < (c_old[0] >>> 0) ? 1 : 0)) >>> 0;
+		c[2] = (c[2] + 0x34D34D34 + ((c[1] >>> 0) < (c_old[1] >>> 0) ? 1 : 0)) >>> 0;
+		c[3] = (c[3] + 0x4D34D34D + ((c[2] >>> 0) < (c_old[2] >>> 0) ? 1 : 0)) >>> 0;
+		c[4] = (c[4] + 0xD34D34D3 + ((c[3] >>> 0) < (c_old[3] >>> 0) ? 1 : 0)) >>> 0;
+		c[5] = (c[5] + 0x34D34D34 + ((c[4] >>> 0) < (c_old[4] >>> 0) ? 1 : 0)) >>> 0;
+		c[6] = (c[6] + 0x4D34D34D + ((c[5] >>> 0) < (c_old[5] >>> 0) ? 1 : 0)) >>> 0;
+		c[7] = (c[7] + 0xD34D34D3 + ((c[6] >>> 0) < (c_old[6] >>> 0) ? 1 : 0)) >>> 0;
+		b = (c[7] >>> 0) < (c_old[7] >>> 0) ? 1 : 0;
+
+		// Calculate the g-values
+		for (var g = [], i = 0; i < 8; i++) {
+
+			var gx = (x[i] + c[i]) >>> 0;
+
+			// Construct high and low argument for squaring
+			var ga = gx & 0xFFFF,
+			    gb = gx >>> 16;
+
+			// Calculate high and low result of squaring
+			var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb,
+			    gl = (((gx & 0xFFFF0000) * gx) >>> 0) + (((gx & 0x0000FFFF) * gx) >>> 0) >>> 0;
+
+			// High XOR low
+			g[i] = gh ^ gl;
+
+		}
+
+		// Calculate new state values
+		x[0] = g[0] + ((g[7] << 16) | (g[7] >>> 16)) + ((g[6] << 16) | (g[6] >>> 16));
+		x[1] = g[1] + ((g[0] <<  8) | (g[0] >>> 24)) + g[7];
+		x[2] = g[2] + ((g[1] << 16) | (g[1] >>> 16)) + ((g[0] << 16) | (g[0] >>> 16));
+		x[3] = g[3] + ((g[2] <<  8) | (g[2] >>> 24)) + g[1];
+		x[4] = g[4] + ((g[3] << 16) | (g[3] >>> 16)) + ((g[2] << 16) | (g[2] >>> 16));
+		x[5] = g[5] + ((g[4] <<  8) | (g[4] >>> 24)) + g[3];
+		x[6] = g[6] + ((g[5] << 16) | (g[5] >>> 16)) + ((g[4] << 16) | (g[4] >>> 16));
+		x[7] = g[7] + ((g[6] <<  8) | (g[6] >>> 24)) + g[5];
+
+	}
+
+};
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/sha1/sha1-min.js b/tools/Crypto-JS v2.4.0/sha1/sha1-min.js
index 199bcdf..438fc27 100755
--- a/tools/Crypto-JS v2.4.0/sha1/sha1-min.js	
+++ b/tools/Crypto-JS v2.4.0/sha1/sha1-min.js	
@@ -1,8 +1,8 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var l=Crypto,m=l.util,n=l.charenc,o=n.UTF8,p=n.Binary,j=l.SHA1=function(a,g){var c=m.wordsToBytes(j._sha1(a));return g&&g.asBytes?c:g&&g.asString?p.bytesToString(c):m.bytesToHex(c)};j._sha1=function(a){if(a.constructor==String)a=o.stringToBytes(a);var g=m.bytesToWords(a),c=a.length*8;a=[];var h=1732584193,d=-271733879,e=-1732584194,f=271733878,i=-1009589776;g[c>>5]|=128<<24-c%32;g[(c+64>>>9<<4)+15]=c;for(c=0;c>>31}k=(h<<5|h>>>27)+i+(a[b]>>>0)+(b<20?(d&e|~d&f)+1518500249:b<40?(d^e^f)+1859775393:b<60?(d&e|d&f|e&f)-1894007588:(d^e^f)-899497514);i=f;f=e;e=d<<30|d>>>2;d=h;h=k}h+=q;d+=r;e+=s;f+=t;i+=u}return[h,d,e,f,i]};j._blocksize=16;j._digestsize=20})();
diff --git a/tools/Crypto-JS v2.4.0/sha1/sha1.js b/tools/Crypto-JS v2.4.0/sha1/sha1.js
index cacb84a..5c5e1eb 100755
--- a/tools/Crypto-JS v2.4.0/sha1/sha1.js	
+++ b/tools/Crypto-JS v2.4.0/sha1/sha1.js	
@@ -1,91 +1,91 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Public API
-var SHA1 = C.SHA1 = function (message, options) {
-	var digestbytes = util.wordsToBytes(SHA1._sha1(message));
-	return options && options.asBytes ? digestbytes :
-	       options && options.asString ? Binary.bytesToString(digestbytes) :
-	       util.bytesToHex(digestbytes);
-};
-
-// The core
-SHA1._sha1 = function (message) {
-
-	// Convert to byte array
-	if (message.constructor == String) message = UTF8.stringToBytes(message);
-	/* else, assume byte array already */
-
-	var m  = util.bytesToWords(message),
-	    l  = message.length * 8,
-	    w  =  [],
-	    H0 =  1732584193,
-	    H1 = -271733879,
-	    H2 = -1732584194,
-	    H3 =  271733878,
-	    H4 = -1009589776;
-
-	// Padding
-	m[l >> 5] |= 0x80 << (24 - l % 32);
-	m[((l + 64 >>> 9) << 4) + 15] = l;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		var a = H0,
-		    b = H1,
-		    c = H2,
-		    d = H3,
-		    e = H4;
-
-		for (var j = 0; j < 80; j++) {
-
-			if (j < 16) w[j] = m[i + j];
-			else {
-				var n = w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16];
-				w[j] = (n << 1) | (n >>> 31);
-			}
-
-			var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
-			         j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
-			         j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
-			         j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
-			                  (H1 ^ H2 ^ H3) - 899497514);
-
-			H4 =  H3;
-			H3 =  H2;
-			H2 = (H1 << 30) | (H1 >>> 2);
-			H1 =  H0;
-			H0 =  t;
-
-		}
-
-		H0 += a;
-		H1 += b;
-		H2 += c;
-		H3 += d;
-		H4 += e;
-
-	}
-
-	return [H0, H1, H2, H3, H4];
-
-};
-
-// Package private blocksize
-SHA1._blocksize = 16;
-
-SHA1._digestsize = 20;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Public API
+var SHA1 = C.SHA1 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA1._sha1(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA1._sha1 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m  = util.bytesToWords(message),
+	    l  = message.length * 8,
+	    w  =  [],
+	    H0 =  1732584193,
+	    H1 = -271733879,
+	    H2 = -1732584194,
+	    H3 =  271733878,
+	    H4 = -1009589776;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >>> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var a = H0,
+		    b = H1,
+		    c = H2,
+		    d = H3,
+		    e = H4;
+
+		for (var j = 0; j < 80; j++) {
+
+			if (j < 16) w[j] = m[i + j];
+			else {
+				var n = w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16];
+				w[j] = (n << 1) | (n >>> 31);
+			}
+
+			var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
+			         j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
+			         j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
+			         j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
+			                  (H1 ^ H2 ^ H3) - 899497514);
+
+			H4 =  H3;
+			H3 =  H2;
+			H2 = (H1 << 30) | (H1 >>> 2);
+			H1 =  H0;
+			H0 =  t;
+
+		}
+
+		H0 += a;
+		H1 += b;
+		H2 += c;
+		H3 += d;
+		H4 += e;
+
+	}
+
+	return [H0, H1, H2, H3, H4];
+
+};
+
+// Package private blocksize
+SHA1._blocksize = 16;
+
+SHA1._digestsize = 20;
+
+})();
diff --git a/tools/Crypto-JS v2.4.0/sha256/sha256-min.js b/tools/Crypto-JS v2.4.0/sha256/sha256-min.js
index 7932704..f4b8cb5 100755
--- a/tools/Crypto-JS v2.4.0/sha256/sha256-min.js	
+++ b/tools/Crypto-JS v2.4.0/sha256/sha256-min.js	
@@ -1,9 +1,9 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
 (function(){var q=Crypto,r=q.util,s=q.charenc,t=s.UTF8,u=s.Binary,v=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,
 2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],m=q.SHA256=function(a,f){var b=r.wordsToBytes(m._sha256(a));return f&&f.asBytes?b:f&&f.asString?u.bytesToString(b):r.bytesToHex(b)};m._sha256=function(a){if(a.constructor==String)a=t.stringToBytes(a);var f=r.bytesToWords(a),b=a.length*8;a=[1779033703,3144134277,
 1013904242,2773480762,1359893119,2600822924,528734635,1541459225];var h=[],i,j,n,d,k,l,o,p,c,g,e;f[b>>5]|=128<<24-b%32;f[(b+64>>9<<4)+15]=b;for(p=0;p>>7)^(g<<14|g>>>18)^g>>>3)+(h[c-7]>>>0)+((e<<15|e>>>17)^(e<<13|e>>>19)^e>>>10)+(h[c-16]>>>0)}e=b&i^b&j^i&j;var w=(b<<30|b>>>2)^(b<<19|b>>>13)^(b<<10|b>>>22);g=(o>>>0)+((d<<26|d>>>6)^(d<<21|d>>>11)^(d<<7|
diff --git a/tools/Crypto-JS v2.4.0/sha256/sha256.js b/tools/Crypto-JS v2.4.0/sha256/sha256.js
index e3e2969..67a5dda 100755
--- a/tools/Crypto-JS v2.4.0/sha256/sha256.js	
+++ b/tools/Crypto-JS v2.4.0/sha256/sha256.js	
@@ -1,135 +1,135 @@
-/*
- * Crypto-JS v2.4.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2011, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){
-
-// Shortcuts
-var C = Crypto,
-    util = C.util,
-    charenc = C.charenc,
-    UTF8 = charenc.UTF8,
-    Binary = charenc.Binary;
-
-// Constants
-var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
-          0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
-          0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
-          0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
-          0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
-          0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
-          0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
-          0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
-          0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
-          0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
-          0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
-          0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
-          0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
-          0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
-          0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
-          0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 ];
-
-// Public API
-var SHA256 = C.SHA256 = function (message, options) {
-	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
-	return options && options.asBytes ? digestbytes :
-	       options && options.asString ? Binary.bytesToString(digestbytes) :
-	       util.bytesToHex(digestbytes);
-};
-
-// The core
-SHA256._sha256 = function (message) {
-
-	// Convert to byte array
-	if (message.constructor == String) message = UTF8.stringToBytes(message);
-	/* else, assume byte array already */
-
-	var m = util.bytesToWords(message),
-	    l = message.length * 8,
-	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
-	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
-	    w = [],
-	    a, b, c, d, e, f, g, h, i, j,
-	    t1, t2;
-
-	// Padding
-	m[l >> 5] |= 0x80 << (24 - l % 32);
-	m[((l + 64 >> 9) << 4) + 15] = l;
-
-	for (var i = 0; i < m.length; i += 16) {
-
-		a = H[0];
-		b = H[1];
-		c = H[2];
-		d = H[3];
-		e = H[4];
-		f = H[5];
-		g = H[6];
-		h = H[7];
-
-		for (var j = 0; j < 64; j++) {
-
-			if (j < 16) w[j] = m[j + i];
-			else {
-
-				var gamma0x = w[j - 15],
-				    gamma1x = w[j - 2],
-				    gamma0  = ((gamma0x << 25) | (gamma0x >>>  7)) ^
-				              ((gamma0x << 14) | (gamma0x >>> 18)) ^
-				               (gamma0x >>> 3),
-				    gamma1  = ((gamma1x <<  15) | (gamma1x >>> 17)) ^
-				              ((gamma1x <<  13) | (gamma1x >>> 19)) ^
-				               (gamma1x >>> 10);
-
-				w[j] = gamma0 + (w[j - 7] >>> 0) +
-				       gamma1 + (w[j - 16] >>> 0);
-
-			}
-
-			var ch  = e & f ^ ~e & g,
-			    maj = a & b ^ a & c ^ b & c,
-			    sigma0 = ((a << 30) | (a >>>  2)) ^
-			             ((a << 19) | (a >>> 13)) ^
-			             ((a << 10) | (a >>> 22)),
-			    sigma1 = ((e << 26) | (e >>>  6)) ^
-			             ((e << 21) | (e >>> 11)) ^
-			             ((e <<  7) | (e >>> 25));
-
-
-			t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
-			t2 = sigma0 + maj;
-
-			h = g;
-			g = f;
-			f = e;
-			e = d + t1;
-			d = c;
-			c = b;
-			b = a;
-			a = t1 + t2;
-
-		}
-
-		H[0] += a;
-		H[1] += b;
-		H[2] += c;
-		H[3] += d;
-		H[4] += e;
-		H[5] += f;
-		H[6] += g;
-		H[7] += h;
-
-	}
-
-	return H;
-
-};
-
-// Package private blocksize
-SHA256._blocksize = 16;
-
-SHA256._digestsize = 32;
-
-})();
+/*
+ * Crypto-JS v2.4.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2011, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcuts
+var C = Crypto,
+    util = C.util,
+    charenc = C.charenc,
+    UTF8 = charenc.UTF8,
+    Binary = charenc.Binary;
+
+// Constants
+var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+          0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
+          0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
+          0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
+          0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
+          0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
+          0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
+          0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
+          0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
+          0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
+          0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
+          0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
+          0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
+          0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
+          0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
+          0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 ];
+
+// Public API
+var SHA256 = C.SHA256 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? Binary.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA256._sha256 = function (message) {
+
+	// Convert to byte array
+	if (message.constructor == String) message = UTF8.stringToBytes(message);
+	/* else, assume byte array already */
+
+	var m = util.bytesToWords(message),
+	    l = message.length * 8,
+	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
+	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
+	    w = [],
+	    a, b, c, d, e, f, g, h, i, j,
+	    t1, t2;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		a = H[0];
+		b = H[1];
+		c = H[2];
+		d = H[3];
+		e = H[4];
+		f = H[5];
+		g = H[6];
+		h = H[7];
+
+		for (var j = 0; j < 64; j++) {
+
+			if (j < 16) w[j] = m[j + i];
+			else {
+
+				var gamma0x = w[j - 15],
+				    gamma1x = w[j - 2],
+				    gamma0  = ((gamma0x << 25) | (gamma0x >>>  7)) ^
+				              ((gamma0x << 14) | (gamma0x >>> 18)) ^
+				               (gamma0x >>> 3),
+				    gamma1  = ((gamma1x <<  15) | (gamma1x >>> 17)) ^
+				              ((gamma1x <<  13) | (gamma1x >>> 19)) ^
+				               (gamma1x >>> 10);
+
+				w[j] = gamma0 + (w[j - 7] >>> 0) +
+				       gamma1 + (w[j - 16] >>> 0);
+
+			}
+
+			var ch  = e & f ^ ~e & g,
+			    maj = a & b ^ a & c ^ b & c,
+			    sigma0 = ((a << 30) | (a >>>  2)) ^
+			             ((a << 19) | (a >>> 13)) ^
+			             ((a << 10) | (a >>> 22)),
+			    sigma1 = ((e << 26) | (e >>>  6)) ^
+			             ((e << 21) | (e >>> 11)) ^
+			             ((e <<  7) | (e >>> 25));
+
+
+			t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
+			t2 = sigma0 + maj;
+
+			h = g;
+			g = f;
+			f = e;
+			e = d + t1;
+			d = c;
+			c = b;
+			b = a;
+			a = t1 + t2;
+
+		}
+
+		H[0] += a;
+		H[1] += b;
+		H[2] += c;
+		H[3] += d;
+		H[4] += e;
+		H[5] += f;
+		H[6] += g;
+		H[7] += h;
+
+	}
+
+	return H;
+
+};
+
+// Package private blocksize
+SHA256._blocksize = 16;
+
+SHA256._digestsize = 32;
+
+})();

From a2b0ccded237d8e4f509a611f3cd6f000c475bf9 Mon Sep 17 00:00:00 2001
From: Jasper 
Date: Tue, 30 Apr 2013 16:48:09 -0400
Subject: [PATCH 07/48] added different declaration style to allow AMD syntax

---
 src/intro.js   | 15 +++++++++++++++
 src/numeric.js |  3 ---
 src/outro.js   |  3 +++
 tools/build.sh |  2 +-
 4 files changed, 19 insertions(+), 4 deletions(-)
 create mode 100644 src/intro.js
 create mode 100644 src/outro.js

diff --git a/src/intro.js b/src/intro.js
new file mode 100644
index 0000000..8068dca
--- /dev/null
+++ b/src/intro.js
@@ -0,0 +1,15 @@
+(function (root, factory) {
+    if (typeof exports === 'object') {
+        // Node.
+        module.exports = factory();
+    } else if (typeof define === 'function' && define.amd) {
+        // AMD. Register as an anonymous module.
+        define(factory);
+    } else {
+        // Browser globals (root is window)
+        root.numeric = factory();
+    }
+}(this, function() {
+
+'use strict';
+var numeric = function numeric(){};
diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..ca554a6 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -1,6 +1,3 @@
-"use strict";
-
-var numeric = (typeof exports === "undefined")?(function numeric() {}):(exports);
 if(typeof global !== "undefined") { global.numeric = numeric; }
 
 numeric.version = "1.2.6";
diff --git a/src/outro.js b/src/outro.js
new file mode 100644
index 0000000..80bdda4
--- /dev/null
+++ b/src/outro.js
@@ -0,0 +1,3 @@
+
+return numeric;
+}));
\ No newline at end of file
diff --git a/tools/build.sh b/tools/build.sh
index fe3be4b..bed8850 100755
--- a/tools/build.sh
+++ b/tools/build.sh
@@ -14,7 +14,7 @@ if [ -f nodepid.log ]; then
 fi
 ver=`grep 'numeric.version.*=.*"' ../src/numeric.js | sed 's/numeric.version[ =]*"\([0-9.]*\)".*/\1/'`
 echo "Version is $ver"
-cat ../src/numeric.js ../src/seedrandom.js ../src/quadprog.js ../src/svd.js > ../lib/numeric-$ver.js
+cat ../src/intro.js ../src/numeric.js ../src/seedrandom.js ../src/quadprog.js ../src/svd.js ../src/outro.js > ../lib/numeric-$ver.js
 uglifyjs ../lib/numeric-$ver.js > ../lib/numeric-$ver.min.js
 cat jquery-1.7.1.min.js jquery.flot.min.js 'Crypto-JS v2.4.0/crypto/crypto-min.js' 'Crypto-JS v2.4.0/crypto-sha256/crypto-sha256.js' json2.js > megalib.js
 echo "" | cat closurelib.js sylvester.js - ../lib/numeric-$ver.min.js jquery-1.7.1.min.js jquery.flot.min.js  > benchlib.js

From 395bbb5d44026a2f115443d5f924a60d7559f40e Mon Sep 17 00:00:00 2001
From: Jasper 
Date: Tue, 30 Apr 2013 17:47:33 -0400
Subject: [PATCH 08/48] removed dependencies on global "numeric" variable. unit
 tests pass.

---
 src/numeric.js | 66 +++++++++++++++++++++++++++++++-------------------
 1 file changed, 41 insertions(+), 25 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index ca554a6..257e763 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -1,4 +1,7 @@
-if(typeof global !== "undefined") { global.numeric = numeric; }
+function _fn( fn ){
+    fn.numeric = numeric;
+    return fn;
+}
 
 numeric.version = "1.2.6";
 
@@ -326,7 +329,8 @@ numeric.dim = function dim(x) {
 }
 
 numeric.mapreduce = function mapreduce(body,init) {
-    return Function('x','accum','_s','_k',
+    return _fn(Function('x','accum','_s','_k',
+            'var numeric = arguments.callee.numeric;\n'+
             'if(typeof accum === "undefined") accum = '+init+';\n'+
             'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
             'if(typeof _s === "undefined") _s = numeric.dim(x);\n'+
@@ -350,10 +354,11 @@ numeric.mapreduce = function mapreduce(body,init) {
             '    '+body+'\n'+
             '}\n'+
             'return accum;'
-            );
+            ));
 }
 numeric.mapreduce2 = function mapreduce2(body,setup) {
-    return Function('x',
+    return _fn(Function('x',
+            'var numeric = arguments.callee.numeric;\n'+
             'var n = x.length;\n'+
             'var i,xi;\n'+setup+';\n'+
             'for(i=n-1;i!==-1;--i) { \n'+
@@ -361,7 +366,7 @@ numeric.mapreduce2 = function mapreduce2(body,setup) {
             '    '+body+';\n'+
             '}\n'+
             'return accum;'
-            );
+            ));
 }
 
 
@@ -540,6 +545,7 @@ numeric.pointwise = function pointwise(params,body,setup) {
     fun[params.length] = '_s';
     fun[params.length+1] = '_k';
     fun[params.length+2] = (
+            'var numeric = arguments.callee.numeric;\n'+
             'if(typeof _s === "undefined") _s = numeric.dim('+thevec+');\n'+
             'if(typeof _k === "undefined") _k = 0;\n'+
             'var _n = _s[_k];\n'+
@@ -554,7 +560,7 @@ numeric.pointwise = function pointwise(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return _fn(Function.apply(null,fun));
 }
 numeric.pointwise2 = function pointwise2(params,body,setup) {
     if(typeof setup === "undefined") { setup = ""; }
@@ -571,6 +577,7 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
         fun.push(p);
     }
     fun[params.length] = (
+            'var numeric = arguments.callee.numeric;\n'+
             'var _n = '+thevec+'.length;\n'+
             'var i'+(haveret?'':', ret = Array(_n)')+';\n'+
             setup+'\n'+
@@ -579,7 +586,7 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return _fn(Function.apply(null,fun));
 }
 numeric._biforeach = (function _biforeach(x,y,s,k,f) {
     if(k === s.length-1) { f(x,y); return; }
@@ -690,7 +697,8 @@ numeric.mapreducers = {
             numeric[i+'VV'] = numeric.pointwise2(['x[i]','y[i]'],code('ret[i]','x[i]','y[i]'),setup);
             numeric[i+'SV'] = numeric.pointwise2(['x','y[i]'],code('ret[i]','x','y[i]'),setup);
             numeric[i+'VS'] = numeric.pointwise2(['x[i]','y'],code('ret[i]','x[i]','y'),setup);
-            numeric[i] = Function(
+            numeric[i] = _fn(Function(
+                    'var numeric = arguments.callee.numeric;\n'+
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var VV = numeric.'+i+'VV, VS = numeric.'+i+'VS, SV = numeric.'+i+'SV;\n'+
                     'var dim = numeric.dim;\n'+
@@ -701,11 +709,12 @@ numeric.mapreducers = {
                     '      else x = numeric._biforeach2(x,y,dim(x),0,VS);\n'+
                     '  } else if(typeof y === "object") x = numeric._biforeach2(x,y,dim(y),0,SV);\n'+
                     '  else '+codeeq('x','y')+'\n'+
-                    '}\nreturn x;\n');
+                    '}\nreturn x;\n'));
             numeric[o] = numeric[i];
             numeric[i+'eqV'] = numeric.pointwise2(['ret[i]','x[i]'], codeeq('ret[i]','x[i]'),setup);
             numeric[i+'eqS'] = numeric.pointwise2(['ret[i]','x'], codeeq('ret[i]','x'),setup);
-            numeric[i+'eq'] = Function(
+            numeric[i+'eq'] = _fn(Function(
+                    'var numeric = arguments.callee.numeric;\n'+
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var V = numeric.'+i+'eqV, S = numeric.'+i+'eqS\n'+
                     'var s = numeric.dim(x);\n'+
@@ -713,7 +722,7 @@ numeric.mapreducers = {
                     '  y = arguments[i];\n'+
                     '  if(typeof y === "object") numeric._biforeach(x,y,s,0,V);\n'+
                     '  else numeric._biforeach(x,y,s,0,S);\n'+
-                    '}\nreturn x;\n');
+                    '}\nreturn x;\n'));
         }
     }
     for(i=0;i
Date: Sun, 5 May 2013 10:40:13 +0800
Subject: [PATCH 09/48] add Newton solver

a javascript implementation of Newton solver, which is ported from GSL
(GNU Scientific Library) 's globally convergent Newton method
(gsl-1.15\multiroots\gnewton.c)

This Newton solver has been successfully used to implement a simple
geometric constraint solver in project Rena
(https://github.com/kaige/Rena)
---
 src/newton.js | 151 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 151 insertions(+)
 create mode 100644 src/newton.js

diff --git a/src/newton.js b/src/newton.js
new file mode 100644
index 0000000..d3bc06c
--- /dev/null
+++ b/src/newton.js
@@ -0,0 +1,151 @@
+// newton.js
+// Author: Kai Zhang 5/5/2013
+//
+// a javascript implementation of Newton solver, which is ported from GSL (GNU Scientific Library) 's globally convergent Newton method (gsl-1.15\multiroots\gnewton.c)
+// 
+// input:             F --- the nonlinear equations system. This should be a function that returns an array representing the equations evaluation result for givien (x)
+// input:             A --- the Jacobian matrix. This should be a function that returns a two dimensional array representing the equations system's Jacobian matrix for given (x)
+// input and output:  x --- the equation system's variables array
+//
+
+numeric.newtonSolve = function (F, A, x) {
+
+    // ---- sub functions to support the main iteration algorithm ------
+
+    
+    // do one step of newton iteration
+    //
+    this.newton_iterate = function(F, A, x) {
+        var funcs = F(x);
+        var jacobian = A(x);
+
+        var phi0 = this.evaluate_Euclidean_norm_of_residual(funcs);
+
+        var dx;
+        if (jacobian.length == x.length) {          // square matrix, well constrained system
+            dx = numeric.solve(jacobian, funcs);
+        }
+        else if (jacobian.length < x.length) {      // flat rectangle matrix, under constrained system
+            var jt = numeric.transpose(jacobian);
+            var jjt = numeric.dot(jacobian, jt);
+            var invJJt = numeric.inv(jjt);
+            var pseudoInv = numeric.dot(jt, invJJt);
+            dx = numeric.dot(pseudoInv, funcs);
+        }
+        else {                                      // tall rectangle matrix, over constrained system
+            var jt = numeric.transpose(jacobian);
+            var jtj = numeric.dot(jt, j);
+            var invJtJ = numeric.inv(jtj);
+            var pseudoInv = numeric.dot(invJtJ, jt);
+            dx = numeric.dot(pseudoInv, funcs);
+        }        
+
+        var t = 1;
+
+        // we require this step really reduce the Euclidean norm of the residual
+        //
+        for (; ;) {
+            var x_new = this.getNewVariableValue(x, dx, t);
+            var funcs_new = F(x_new);
+            var phi1 = this.evaluate_Euclidean_norm_of_residual(funcs_new);
+
+            if (phi1 > phi0 && t > epsilon) {
+                var theta = phi1 / phi0;
+                var u = (Math.sqrt(1.0 + 6.0 * theta) - 1.0) / (3.0 * theta);
+                t *= u;
+            }
+            else {
+                this.copyVariables(x, x_new);
+                break;
+            }
+        }
+    }
+
+    // add -dx to x to get the new variables
+    //
+    this.getNewVariableValue = function (x, dx, t) {
+        var x_new = new Array(x.length);
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x_new[i] = x[i] - t*dx[i];
+        }
+        
+        return x_new;
+    }
+
+    // copy x_new to x
+    //
+    this.copyVariables = function (x, x_new) {
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x[i] = x_new[i]
+        }
+    }
+
+    // evaluate the function value's residual
+    //
+    this.evaluate_residual = function (funcsVal) {
+        var i;
+        var residual = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            residual += Math.abs(funcsVal[i]);
+        }
+        return residual;
+    }
+
+    // evaluate the Euclidean_norm_of_residual
+    //
+    this.evaluate_Euclidean_norm_of_residual  = function (funcsVal) {
+        var i;
+        var residual2 = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            var fabs = Math.abs(funcsVal[i]);
+            residual2 += fabs*fabs;
+        }
+        return Math.sqrt(residual2);
+    }
+    
+    // main function start here
+    //    
+    var residual_tol = 1e-7;
+    var max_iteration = 1000;
+    var epsilon = 2.22e-16;
+    var JS_GSL_SUCCESS = 0;
+    var JS_GSL_CONTINUE = 1;
+
+    // evaluate none linear system of equations and its jacobian matrix
+    //
+    var funcs = F(x);
+    var jacobian = A(x);
+
+    // iterate to get the solution
+    //
+    var iter = 0;
+    var status;
+    do {
+        iter++;
+
+        this.newton_iterate(F, A, x);
+
+        if (this.evaluate_residual(F(x)) < residual_tol)
+            status = JS_GSL_SUCCESS;
+        else
+            status = JS_GSL_CONTINUE;
+        
+    } while (status == JS_GSL_CONTINUE && iter < max_iteration)
+
+}
+
+/* unit test
+
+Rosenbrock Function 
+
+  double y0 = 1 - x0;
+  double y1 = 10 * (x1 - x0 * x0);
+
+  x0 = -1.2
+  x1 = 1.0
+
+*/
+
+

From 5db87799330db217b93814c4ebe6cdb512876a22 Mon Sep 17 00:00:00 2001
From: xiphias 
Date: Tue, 14 May 2013 10:59:58 -0500
Subject: [PATCH 10/48] Update numeric.js

---
 src/numeric.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..8b13fc1 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -120,7 +120,7 @@ numeric.parseFloat = function parseFloat_(d) {
 }
 
 numeric.parseCSV = function parseCSV(t) {
-    var foo = t.split('\n');
+    var foo = t.split(/\r?\n');
     var j,k;
     var ret = [];
     var pat = /(([^'",]*)|('[^']*')|("[^"]*")),/g;

From 9dd3c94d2a2d271e73f15ac7d25c58a82a5afe50 Mon Sep 17 00:00:00 2001
From: xiphias 
Date: Tue, 14 May 2013 11:01:14 -0500
Subject: [PATCH 11/48] Allow \r\n as separator for parseCSV

---
 src/numeric.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/numeric.js b/src/numeric.js
index 8b13fc1..6f4248e 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -120,7 +120,7 @@ numeric.parseFloat = function parseFloat_(d) {
 }
 
 numeric.parseCSV = function parseCSV(t) {
-    var foo = t.split(/\r?\n');
+    var foo = t.split(/\r?\n/);
     var j,k;
     var ret = [];
     var pat = /(([^'",]*)|('[^']*')|("[^"]*")),/g;

From 76c7968d6de374c312330a55959bf9a8b965df34 Mon Sep 17 00:00:00 2001
From: Jason Merrill 
Date: Tue, 17 Sep 2013 14:41:26 -0700
Subject: [PATCH 12/48] Avoid reaching out to numeric in global namespace in
 compiled code.

This replaces calls to javascript's Function() with calls to the new numeric.compile(), which is a wrapper that closures in the numeric object so that methods on it can be used inside compiled code. The motivation here is to allow using numeric without globally exporting the `numeric` symbol.
---
 src/numeric.js | 35 +++++++++++++++++++++--------------
 1 file changed, 21 insertions(+), 14 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..d994c56 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -31,10 +31,17 @@ numeric._myIndexOf = (function _myIndexOf(w) {
 });
 numeric.myIndexOf = (Array.prototype.indexOf)?Array.prototype.indexOf:numeric._myIndexOf;
 
-numeric.Function = Function;
 numeric.precision = 4;
 numeric.largeArray = 50;
 
+// Wrapper around `new Function` that closures in the `numeric` object.
+numeric.compile = function () {
+  var args = Array.prototype.slice.call(arguments);
+  var body = args.pop();
+  body = 'return function (' + args.join(',') + ') {' + body + ';}';
+  return (new Function(['numeric'], body))(numeric);
+}
+
 numeric.prettyPrint = function prettyPrint(x) {
     function fmtnum(x) {
         if(x === 0) { return '0'; }
@@ -329,7 +336,7 @@ numeric.dim = function dim(x) {
 }
 
 numeric.mapreduce = function mapreduce(body,init) {
-    return Function('x','accum','_s','_k',
+    return numeric.compile('x','accum','_s','_k',
             'if(typeof accum === "undefined") accum = '+init+';\n'+
             'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
             'if(typeof _s === "undefined") _s = numeric.dim(x);\n'+
@@ -356,7 +363,7 @@ numeric.mapreduce = function mapreduce(body,init) {
             );
 }
 numeric.mapreduce2 = function mapreduce2(body,setup) {
-    return Function('x',
+    return numeric.compile('x',
             'var n = x.length;\n'+
             'var i,xi;\n'+setup+';\n'+
             'for(i=n-1;i!==-1;--i) { \n'+
@@ -557,7 +564,7 @@ numeric.pointwise = function pointwise(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return numeric.compile.apply(null,fun);
 }
 numeric.pointwise2 = function pointwise2(params,body,setup) {
     if(typeof setup === "undefined") { setup = ""; }
@@ -582,7 +589,7 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return numeric.compile.apply(null,fun);
 }
 numeric._biforeach = (function _biforeach(x,y,s,k,f) {
     if(k === s.length-1) { f(x,y); return; }
@@ -693,7 +700,7 @@ numeric.mapreducers = {
             numeric[i+'VV'] = numeric.pointwise2(['x[i]','y[i]'],code('ret[i]','x[i]','y[i]'),setup);
             numeric[i+'SV'] = numeric.pointwise2(['x','y[i]'],code('ret[i]','x','y[i]'),setup);
             numeric[i+'VS'] = numeric.pointwise2(['x[i]','y'],code('ret[i]','x[i]','y'),setup);
-            numeric[i] = Function(
+            numeric[i] = numeric.compile(
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var VV = numeric.'+i+'VV, VS = numeric.'+i+'VS, SV = numeric.'+i+'SV;\n'+
                     'var dim = numeric.dim;\n'+
@@ -708,7 +715,7 @@ numeric.mapreducers = {
             numeric[o] = numeric[i];
             numeric[i+'eqV'] = numeric.pointwise2(['ret[i]','x[i]'], codeeq('ret[i]','x[i]'),setup);
             numeric[i+'eqS'] = numeric.pointwise2(['ret[i]','x'], codeeq('ret[i]','x'),setup);
-            numeric[i+'eq'] = Function(
+            numeric[i+'eq'] = numeric.compile(
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var V = numeric.'+i+'eqV, S = numeric.'+i+'eqS\n'+
                     'var s = numeric.dim(x);\n'+
@@ -735,7 +742,7 @@ numeric.mapreducers = {
                 if(Math.hasOwnProperty(o)) setup = 'var '+o+' = Math.'+o+';\n';
             }
             numeric[i+'eqV'] = numeric.pointwise2(['ret[i]'],'ret[i] = '+o+'(ret[i]);',setup);
-            numeric[i+'eq'] = Function('x',
+            numeric[i+'eq'] = numeric.compile('x',
                     'if(typeof x !== "object") return '+o+'x\n'+
                     'var i;\n'+
                     'var V = numeric.'+i+'eqV;\n'+
@@ -743,7 +750,7 @@ numeric.mapreducers = {
                     'numeric._foreach(x,s,0,V);\n'+
                     'return x;\n');
             numeric[i+'V'] = numeric.pointwise2(['x[i]'],'ret[i] = '+o+'(x[i]);',setup);
-            numeric[i] = Function('x',
+            numeric[i] = numeric.compile('x',
                     'if(typeof x !== "object") return '+o+'(x)\n'+
                     'var i;\n'+
                     'var V = numeric.'+i+'V;\n'+
@@ -759,7 +766,7 @@ numeric.mapreducers = {
         if(numeric.mapreducers.hasOwnProperty(i)) {
             o = numeric.mapreducers[i];
             numeric[i+'V'] = numeric.mapreduce2(o[0],o[1]);
-            numeric[i] = Function('x','s','k',
+            numeric[i] = numeric.compile('x','s','k',
                     o[1]+
                     'if(typeof x !== "object") {'+
                     '    xi = x;\n'+
@@ -1032,7 +1039,7 @@ numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
             }
         }
     }
-    return Function(['y'],
+    return numeric.compile(['y'],
             'var x = this;\n'+
             'if(!(y instanceof numeric.T)) { y = new numeric.T(y); }\n'+
             setup+'\n'+
@@ -1098,7 +1105,7 @@ numeric.T.prototype.transjugate = function transjugate() {
 }
 numeric.Tunop = function Tunop(r,c,s) {
     if(typeof s !== "string") { s = ''; }
-    return Function(
+    return numeric.compile(
             'var x = this;\n'+
             s+'\n'+
             'if(x.y) {'+
@@ -1964,7 +1971,7 @@ numeric.ccsLUPSolve = function ccsLUPSolve(LUP,B) {
 
 numeric.ccsbinop = function ccsbinop(body,setup) {
     if(typeof setup === "undefined") setup='';
-    return Function('X','Y',
+    return numeric.compile('X','Y',
             'var Xi = X[0], Xj = X[1], Xv = X[2];\n'+
             'var Yi = Y[0], Yj = Y[1], Yv = Y[2];\n'+
             'var n = Xi.length-1,m = Math.max(numeric.sup(Xj),numeric.sup(Yj))+1;\n'+
@@ -2020,7 +2027,7 @@ numeric.ccsbinop = function ccsbinop(body,setup) {
         if(isFinite(eval('1'+numeric.ops2[k]+'0')) && isFinite(eval('0'+numeric.ops2[k]+'1'))) C = 'numeric.ccs'+k+'MM(X,Y)';
         else C = 'NaN';
         numeric['ccs'+k+'MM'] = numeric.ccsbinop('zk = xk '+numeric.ops2[k]+'yk;');
-        numeric['ccs'+k] = Function('X','Y',
+        numeric['ccs'+k] = numeric.compile('X','Y',
                 'if(typeof X === "number") return '+A+';\n'+
                 'if(typeof Y === "number") return '+B+';\n'+
                 'return '+C+';\n'

From ee59f1cf093d080570f781b7c32e4bb6db493020 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Wojciech=20Wa=C5=9Bko?= 
Date: Thu, 24 Oct 2013 00:16:05 +0200
Subject: [PATCH 13/48] Added logspace which mimics Matlab/octave's logspace.

---
 src/documentation.html | 8 ++++++++
 src/numeric.js         | 6 ++++++
 2 files changed, 14 insertions(+)

diff --git a/src/documentation.html b/src/documentation.html
index 9767498..97393e6 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -98,6 +98,7 @@
 
    largeArrayDon't prettyPrint Arrays larger than this
 
    leqPointwise x<=y
 
    linspaceGenerate evenly spaced values
+
    logspaceGenerate logarithmically spaced values
 
    logPointwise Math.log(x)
 
    lshiftPointwise x<<y
 
    lshifteqPointwise x<<=y
@@ -397,6 +398,13 @@ 
    Utility functions
    
 OUT> [1,1.5,2,2.5,3]
 
 
+Or a vector of logarithmically spaced values between Math.pow(10,a) and Math.pow(10,b):
+
+
    +IN> numeric.logspace(0,1,5);
+OUT> [1, 1.7782794100389228, 3.1622776601683795, 5.623413251903491, 10]
+
    
+
 
+
+We are now running a linear algebra performance benchmark in your browser! Please ensure that your seatbelt
+is fastened and your tray table is upright while we invert 100x100 matrices.

    
+
+Performance (MFLOPS)
+
    
+
    
+
    
+
    
+
    Geometric mean of scores: 

    
+
+Higher is better: For each benchmark and library, a function is called repeatedly for a certain amount of time.
+The number of function calls per seconds is converted into a FLOP rate. As we move right within each test, the matrix size increases.

    
+
+What tricks are used to increase performance in Numeric?
+
      
+  
    • Replace inner loop for(j=0;j<n;j++) A[i][j] by the equivalent Ai = A[i]; for(j=0;j<n;j++) Ai[j] ("hoisting" the [i] out of the loop).
+  
    • Preallocate Arrays: A = new Array(n) instead of A = [].
+  
    • Use Array objects directly (abstractions slow you down). Getters and setters are bad.
+  
    • Use for(j=n-1;j>=0;j--) if it is faster.
+  
    • Do not put anything in Array.prototype. If you modify Array.prototype, it slows down everything significantly.
+  
    • Big Matrix*Matrix product: transpose the second matrix and rearrange the loops to exploit locality.
+  
    • Unroll loops.
+  
    • Don't nest functions.
+  
    • Don't call functions, inline them manually. Except...
+  
    • ...big functions can confuse the JIT. If a new code path is run in a function, the function can be deoptimized by the JIT.
+  
    • Avoid polymorphism.
+  
    • Localize references. For example: replace for(i=n-1;i>=0;i--) x[i] = Math.random(); by rnd = Math.random; for(i=n-1;i>=0;i--) x[i] = rnd();. (Make sure rnd and x really are local variables!)
+  
    • Deep lexical scopes are bad. You can create a function without much of a lexical scope by using
+    new Function('...');.
+
    
+
    
+
+GC pauses?
+If you reload the page, the benchmark will run again and will give slightly different results.
+This could be due to GC pauses or other background tasks, DOM updates, etc...
+To get an idea of the impact of this, load this page in two or more different tabs (not at the same time,
+one after the other) and switch between the tabs and see the differences in the performance chart.
+


    
+
+
    
+
+
+
+
+
+
+
+
+


    
+
diff --git a/src/iterative.js b/src/iterative.js
index c0ca2b6..12f6939 100644
--- a/src/iterative.js
+++ b/src/iterative.js
@@ -1,3 +1,25 @@
+// CCS matrix mul dense vector
+numeric.ccsMV = numeric.ccsMV || function ccsMV(A, x) {
+	var Ai = A[0], Aj = A[1], Av = A[2];
+	var sA = numeric.ccsDim(A);
+	var m = sA[0], n = sA[1];
+	var L = x.length;
+	var ret = numeric.rep([L],0);
+	if( n !== L ) throw 'Matrix dimension does not match input vector.';
+	var i, j, k, j0, j1;
+	var ri, val;
+	for(k=0;k!==n;k++) {
+		j0 = Ai[k];
+		j1 = Ai[k+1];
+		for(j=j0;j
Date: Thu, 7 Nov 2013 16:38:38 -0600
Subject: [PATCH 17/48] 1. minor change in the solvers 2. bug fixed in the
 benchmark page

---
 benchmark3.html  | 2 +-
 src/iterative.js | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/benchmark3.html b/benchmark3.html
index 2646f01..c0021f6 100644
--- a/benchmark3.html
+++ b/benchmark3.html
@@ -85,7 +85,7 @@
   ],
   [
   'Solve Ax=b, A is Banded Laplacian', [4, 6, 9, 14, 21, 32, 48, 72],
-  function(n) { var A = numeric.cdelsq(numeric.cgrid(n)); A.format = 'crs'; var b = mkV(n); return bench(function() { numeric.ccsLUPSolve(numeric.ccsLUP(A), b); }); },
+  function(n) { var A = numeric.cdelsq(numeric.cgrid(n)); A.format = 'crs'; var b = mkV(n); return bench(function() { numeric.cLUsolve(numeric.cLU(A), b); }); },
   function(n) { var A = numeric.cdelsq(numeric.cgrid(n)); A.format = 'crs'; var b = mkV(n); return bench(function() { numeric.cg(A, b); }); },
   function(n) { var A = numeric.cdelsq(numeric.cgrid(n)); A.format = 'crs'; var b = mkV(n); return bench(function() { numeric.bicgstab(A, b); }); },  
   ],
diff --git a/src/iterative.js b/src/iterative.js
index 12f6939..0223b87 100644
--- a/src/iterative.js
+++ b/src/iterative.js
@@ -61,7 +61,7 @@ numeric.bicgstab = function bicgstab(A, b, maxIters, residue) {
             }
 			
             v = mv(A, p);
-            var alpha = rDotr / dot(rhat, v);
+            alpha = rDotr / dot(rhat, v);
 			s = axpy(-alpha, v, r);
 			
 			t = mv(A, s);	
@@ -70,7 +70,7 @@ numeric.bicgstab = function bicgstab(A, b, maxIters, residue) {
             x = axpy(w, s, axpy(alpha, p, x));
             r = axpy(-w, t, s);
 
-            var beta = dot(rhat, r) / rDotr * (alpha/w);
+            beta = dot(rhat, r) / rDotr * (alpha/w);
             p = axpy(beta, axpy(-w, v, p), r);
 
             iters++;

From b6789e4ecd788caaa60306a8f667a701b072227b Mon Sep 17 00:00:00 2001
From: Peihong Guo 
Date: Fri, 8 Nov 2013 23:25:18 -0600
Subject: [PATCH 18/48] added SOR solver. the performance of SOR solver is not
 as good as CG and BiCGSTAB, but similar to ccsLUPSolve. in practice, CG and
 BiCGSTAB should always be the best options.

---
 src/iterative.js | 207 ++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 206 insertions(+), 1 deletion(-)

diff --git a/src/iterative.js b/src/iterative.js
index 0223b87..5b5f955 100644
--- a/src/iterative.js
+++ b/src/iterative.js
@@ -172,4 +172,209 @@ numeric.cg = function cg(A, b, maxIters, residue) {
 		throw 'Not supported matrix format';
 	}
 	}	
-};
\ No newline at end of file
+};
+
+numeric.sor = function sor(A, b, relax, maxIters, residue) {
+	var maxIters = maxIters || 1024;
+	var residue = residue || 1e-6;
+	var relax = relax || 1.0;		// no relaxation by default, fall back to Gauss-Seidel
+	
+	var sor_full = function(A, b) {
+		// initialization
+        var iters = 0;
+        var converged = false;
+        var rows = b.length;
+		
+		var sA = numeric.dim(A);
+		var n = sA[0], m = sA[1];
+		if( n != rows ) {
+			throw 'Matrix dimension does not match input vector.';
+		}
+		
+		// initialize x
+        var x = numeric.rep([rows], 0);
+		var dot = numeric.dot;
+		var bnorm = dot(b, b);
+		var rowsum = 0;
+		var i, j;
+		var Ai;
+		var rowdiff;
+		var res = numeric.rep([rows], 0), r2;
+		
+		while(!converged && iters < maxIters) {
+			for(i=0;i
Date: Mon, 18 Nov 2013 20:35:54 -0600
Subject: [PATCH 19/48] Add failing test

---
 documentation.html     | 5 +++++
 src/documentation.html | 5 +++++
 2 files changed, 10 insertions(+)

diff --git a/documentation.html b/documentation.html
index 9767498..cfbeddc 100644
--- a/documentation.html
+++ b/documentation.html
@@ -789,7 +789,12 @@ 
    Singular value decomposition (Shanti Rao)
    
 [[          0,          0,          0],
  [          0,    -0.7071,          0],
  [          0,          0,     0.7071]]}}
+IN> numeric.eig([[0, 0, 0], [0, 0, 0], [0, 0, 0]]) 
+OUT> {lambda: {x: [0, 0, 0], y: [0, 0, 0]}, 
+      E: {x: [[1, 0, 0,], [0, 1, 0], [0, 0, 1]],
+          y: [[0, 0, 0], [0, 0, 0], [0, 0, 0]] }}
 
+
 -->
 
 
diff --git a/src/documentation.html b/src/documentation.html
index 9767498..cfbeddc 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -789,7 +789,12 @@ 
    Singular value decomposition (Shanti Rao)
    
 [[          0,          0,          0],
  [          0,    -0.7071,          0],
  [          0,          0,     0.7071]]}}
+IN> numeric.eig([[0, 0, 0], [0, 0, 0], [0, 0, 0]]) 
+OUT> {lambda: {x: [0, 0, 0], y: [0, 0, 0]}, 
+      E: {x: [[1, 0, 0,], [0, 1, 0], [0, 0, 1]],
+          y: [[0, 0, 0], [0, 0, 0], [0, 0, 0]] }}
 
+
 -->
 
 

From 2389056df3ddcd4b1ea909531d42b66ecf82590d Mon Sep 17 00:00:00 2001
From: Matt Lehman 
Date: Mon, 16 Dec 2013 11:23:32 -0500
Subject: [PATCH 20/48] Bugfix for toCSV.

---
 src/numeric.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..5d2c007 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -150,7 +150,7 @@ numeric.toCSV = function toCSV(A) {
     ret = [];
     for(i=0;i
Date: Thu, 23 Oct 2014 14:55:40 -0400
Subject: [PATCH 21/48] fix typo

---
 documentation.html | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/documentation.html b/documentation.html
index 9767498..8d98c40 100644
--- a/documentation.html
+++ b/documentation.html
@@ -85,7 +85,7 @@
 
    epsilon2.220446049250313e-16
 
    eqPointwise comparison x === y
 
    expPointwise Math.exp(x)
-
    floorPoinwise Math.floor(x)
+
    floorPointwise Math.floor(x)
 
    geqPointwise x>=y
 
    getBlockExtract a block from a matrix
 
    getDiagGet the diagonal of a matrix

From a01124e846255853b3a86333cc56e5d6eac69476 Mon Sep 17 00:00:00 2001
From: Zhonghua Xi 
Date: Thu, 23 Oct 2014 15:30:08 -0400
Subject: [PATCH 22/48] 1. implement ccsDiag/ccsTranspose 2. test added, doc
 updated

---
 src/documentation.html | 16 ++++++++++++++++
 src/numeric.js         | 10 ++++++++++
 2 files changed, 26 insertions(+)

diff --git a/src/documentation.html b/src/documentation.html
index 9767498..b1bc095 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -49,6 +49,7 @@
 
    bnotBinary negation ~x
 
    borBinary or x|y
 
    bxorBinary xor x^y
+
    ccsDiagCreate sparse diagonal matrix
 
    ccsDimDimensions of sparse matrix
 
    ccsDotSparse matrix-matrix product
 
    ccsFullConvert sparse to full
@@ -58,6 +59,7 @@
 
    ccsLUPSolveSolve Ax=b using LUP decomp
 
    ccsScatterScatter entries of sparse matrix
 
    ccsSparseConvert from full to sparse
+
    ccsTransposeSparse matrix transpose
 
    ccsTSolveSolve upper/lower triangular system
 
    ccs<op>Supported ops include: add/div/mul/geq/etc...
 
    cLUCoordinate matrix LU decomposition
@@ -838,6 +840,20 @@ 
    Sparse linear algebra
    
 IN> numeric.ccsDot(M,[[0,3],[0,1,2],x])
 OUT> [[0,3],[0,1,2],[9,3,2]]
 
+Create a sparse diangoal matrix
+
    +IN> SA = numeric.ccsDiag([1,2,3]);
+OUT> [[ 0, 1, 2, 3],
+      [ 0, 1, 2],
+      [ 1, 2, 3]]
+
    
+Tranpose a sparse matrix
+
    +IN> numeric.ccsTranspose(numeric.ccsScatter([[0,1,2],[2,1,0],[1,2,4]]));
+OUT> [[ 0, 1, 2, 3],
+      [ 2, 1, 0],
+      [ 1, 2, 4]]  
+
    
 We provide an LU=PA decomposition:
 
     IN> A = [[0,5,10,15,20,25],
diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..7a7b1b2 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -1600,6 +1600,16 @@ numeric.ccsFull = function ccsFull(A) {
     }
     return B;
 }
+numeric.ccsDiag = function ccsDiag(diag) {
+    var ij = [];
+    for( var i = 0; i < diag.length; ++i ) ij.push( i );
+    return numeric.ccsScatter( [ ij, ij, diag ] );
+}
+numeric.ccsTranspose = function ccsTranspose( A )
+{
+    var rows_cols_vals = numeric.ccsGather( A );
+    return numeric.ccsScatter( [ rows_cols_vals[1], rows_cols_vals[0], rows_cols_vals[2] ] );
+}
 numeric.ccsTSolve = function ccsTSolve(A,b,x,bj,xj) {
     var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, max = Math.max,n=0;
     if(typeof bj === "undefined") x = numeric.rep([m],0);

From cc3e0ffe8cca969669a015fefa757187dbe6b534 Mon Sep 17 00:00:00 2001
From: Martin von Gagern 
Date: Tue, 18 Nov 2014 16:36:35 +0100
Subject: [PATCH 23/48] Change CRLF to newlines only.

---
 src/svd.js | 592 ++++++++++++++++++++++++++---------------------------
 1 file changed, 296 insertions(+), 296 deletions(-)

diff --git a/src/svd.js b/src/svd.js
index 24a07d3..1db88e6 100644
--- a/src/svd.js
+++ b/src/svd.js
@@ -1,296 +1,296 @@
-/*
-Shanti Rao sent me this routine by private email. I had to modify it
-slightly to work on Arrays instead of using a Matrix object.
-It is apparently translated from http://stitchpanorama.sourceforge.net/Python/svd.py
-*/
-
-numeric.svd= function svd(A) {
-    var temp;
-//Compute the thin SVD from G. H. Golub and C. Reinsch, Numer. Math. 14, 403-420 (1970)
-	var prec= numeric.epsilon; //Math.pow(2,-52) // assumes double prec
-	var tolerance= 1.e-64/prec;
-	var itmax= 50;
-	var c=0;
-	var i=0;
-	var j=0;
-	var k=0;
-	var l=0;
-	
-	var u= numeric.clone(A);
-	var m= u.length;
-	
-	var n= u[0].length;
-	
-	if (m < n) throw "Need more rows than columns"
-	
-	var e = new Array(n);
-	var q = new Array(n);
-	for (i=0; i b)
-			return a*Math.sqrt(1.0+(b*b/a/a))
-		else if (b == 0.0) 
-			return a
-		return b*Math.sqrt(1.0+(a*a/b/b))
-	}
-
-	//Householder's reduction to bidiagonal form
-
-	var f= 0.0;
-	var g= 0.0;
-	var h= 0.0;
-	var x= 0.0;
-	var y= 0.0;
-	var z= 0.0;
-	var s= 0.0;
-	
-	for (i=0; i < n; i++)
-	{	
-		e[i]= g;
-		s= 0.0;
-		l= i+1;
-		for (j=i; j < m; j++) 
-			s += (u[j][i]*u[j][i]);
-		if (s <= tolerance)
-			g= 0.0;
-		else
-		{	
-			f= u[i][i];
-			g= Math.sqrt(s);
-			if (f >= 0.0) g= -g;
-			h= f*g-s
-			u[i][i]=f-g;
-			for (j=l; j < n; j++)
-			{
-				s= 0.0
-				for (k=i; k < m; k++) 
-					s += u[k][i]*u[k][j]
-				f= s/h
-				for (k=i; k < m; k++) 
-					u[k][j]+=f*u[k][i]
-			}
-		}
-		q[i]= g
-		s= 0.0
-		for (j=l; j < n; j++) 
-			s= s + u[i][j]*u[i][j]
-		if (s <= tolerance)
-			g= 0.0
-		else
-		{	
-			f= u[i][i+1]
-			g= Math.sqrt(s)
-			if (f >= 0.0) g= -g
-			h= f*g - s
-			u[i][i+1] = f-g;
-			for (j=l; j < n; j++) e[j]= u[i][j]/h
-			for (j=l; j < m; j++)
-			{	
-				s=0.0
-				for (k=l; k < n; k++) 
-					s += (u[j][k]*u[i][k])
-				for (k=l; k < n; k++) 
-					u[j][k]+=s*e[k]
-			}	
-		}
-		y= Math.abs(q[i])+Math.abs(e[i])
-		if (y>x) 
-			x=y
-	}
-	
-	// accumulation of right hand gtransformations
-	for (i=n-1; i != -1; i+= -1)
-	{	
-		if (g != 0.0)
-		{
-		 	h= g*u[i][i+1]
-			for (j=l; j < n; j++) 
-				v[j][i]=u[i][j]/h
-			for (j=l; j < n; j++)
-			{	
-				s=0.0
-				for (k=l; k < n; k++) 
-					s += u[i][k]*v[k][j]
-				for (k=l; k < n; k++) 
-					v[k][j]+=(s*v[k][i])
-			}	
-		}
-		for (j=l; j < n; j++)
-		{
-			v[i][j] = 0;
-			v[j][i] = 0;
-		}
-		v[i][i] = 1;
-		g= e[i]
-		l= i
-	}
-	
-	// accumulation of left hand transformations
-	for (i=n-1; i != -1; i+= -1)
-	{	
-		l= i+1
-		g= q[i]
-		for (j=l; j < n; j++) 
-			u[i][j] = 0;
-		if (g != 0.0)
-		{
-			h= u[i][i]*g
-			for (j=l; j < n; j++)
-			{
-				s=0.0
-				for (k=l; k < m; k++) s += u[k][i]*u[k][j];
-				f= s/h
-				for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
-			}
-			for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
-		}
-		else
-			for (j=i; j < m; j++) u[j][i] = 0;
-		u[i][i] += 1;
-	}
-	
-	// diagonalization of the bidiagonal form
-	prec= prec*x
-	for (k=n-1; k != -1; k+= -1)
-	{
-		for (var iteration=0; iteration < itmax; iteration++)
-		{	// test f splitting
-			var test_convergence = false
-			for (l=k; l != -1; l+= -1)
-			{	
-				if (Math.abs(e[l]) <= prec)
-				{	test_convergence= true
-					break 
-				}
-				if (Math.abs(q[l-1]) <= prec)
-					break 
-			}
-			if (!test_convergence)
-			{	// cancellation of e[l] if l>0
-				c= 0.0
-				s= 1.0
-				var l1= l-1
-				for (i =l; i= itmax-1)
-				throw 'Error: no convergence.'
-			// shift from bottom 2x2 minor
-			x= q[l]
-			y= q[k-1]
-			g= e[k-1]
-			h= e[k]
-			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y)
-			g= pythag(f,1.0)
-			if (f < 0.0)
-				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x
-			else
-				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x
-			// next QR transformation
-			c= 1.0
-			s= 1.0
-			for (i=l+1; i< k+1; i++)
-			{	
-				g= e[i]
-				y= q[i]
-				h= s*g
-				g= c*g
-				z= pythag(f,h)
-				e[i-1]= z
-				c= f/z
-				s= h/z
-				f= x*c+g*s
-				g= -x*s+g*c
-				h= y*s
-				y= y*c
-				for (j=0; j < n; j++)
-				{	
-					x= v[j][i-1]
-					z= v[j][i]
-					v[j][i-1] = x*c+z*s
-					v[j][i] = -x*s+z*c
-				}
-				z= pythag(f,h)
-				q[i-1]= z
-				c= f/z
-				s= h/z
-				f= c*g+s*y
-				x= -s*g+c*y
-				for (j=0; j < m; j++)
-				{
-					y= u[j][i-1]
-					z= u[j][i]
-					u[j][i-1] = y*c+z*s
-					u[j][i] = -y*s+z*c
-				}
-			}
-			e[l]= 0.0
-			e[k]= f
-			q[k]= x
-		} 
-	}
-		
-	//vt= transpose(v)
-	//return (u,q,vt)
-	for (i=0;i= 0; j--)
-	 {
-	  if (q[j] < q[i])
-	  {
-	//  writeln(i,'-',j)
-	   c = q[j]
-	   q[j] = q[i]
-	   q[i] = c
-	   for(k=0;k b)
+			return a*Math.sqrt(1.0+(b*b/a/a))
+		else if (b == 0.0) 
+			return a
+		return b*Math.sqrt(1.0+(a*a/b/b))
+	}
+
+	//Householder's reduction to bidiagonal form
+
+	var f= 0.0;
+	var g= 0.0;
+	var h= 0.0;
+	var x= 0.0;
+	var y= 0.0;
+	var z= 0.0;
+	var s= 0.0;
+	
+	for (i=0; i < n; i++)
+	{	
+		e[i]= g;
+		s= 0.0;
+		l= i+1;
+		for (j=i; j < m; j++) 
+			s += (u[j][i]*u[j][i]);
+		if (s <= tolerance)
+			g= 0.0;
+		else
+		{	
+			f= u[i][i];
+			g= Math.sqrt(s);
+			if (f >= 0.0) g= -g;
+			h= f*g-s
+			u[i][i]=f-g;
+			for (j=l; j < n; j++)
+			{
+				s= 0.0
+				for (k=i; k < m; k++) 
+					s += u[k][i]*u[k][j]
+				f= s/h
+				for (k=i; k < m; k++) 
+					u[k][j]+=f*u[k][i]
+			}
+		}
+		q[i]= g
+		s= 0.0
+		for (j=l; j < n; j++) 
+			s= s + u[i][j]*u[i][j]
+		if (s <= tolerance)
+			g= 0.0
+		else
+		{	
+			f= u[i][i+1]
+			g= Math.sqrt(s)
+			if (f >= 0.0) g= -g
+			h= f*g - s
+			u[i][i+1] = f-g;
+			for (j=l; j < n; j++) e[j]= u[i][j]/h
+			for (j=l; j < m; j++)
+			{	
+				s=0.0
+				for (k=l; k < n; k++) 
+					s += (u[j][k]*u[i][k])
+				for (k=l; k < n; k++) 
+					u[j][k]+=s*e[k]
+			}	
+		}
+		y= Math.abs(q[i])+Math.abs(e[i])
+		if (y>x) 
+			x=y
+	}
+	
+	// accumulation of right hand gtransformations
+	for (i=n-1; i != -1; i+= -1)
+	{	
+		if (g != 0.0)
+		{
+		 	h= g*u[i][i+1]
+			for (j=l; j < n; j++) 
+				v[j][i]=u[i][j]/h
+			for (j=l; j < n; j++)
+			{	
+				s=0.0
+				for (k=l; k < n; k++) 
+					s += u[i][k]*v[k][j]
+				for (k=l; k < n; k++) 
+					v[k][j]+=(s*v[k][i])
+			}	
+		}
+		for (j=l; j < n; j++)
+		{
+			v[i][j] = 0;
+			v[j][i] = 0;
+		}
+		v[i][i] = 1;
+		g= e[i]
+		l= i
+	}
+	
+	// accumulation of left hand transformations
+	for (i=n-1; i != -1; i+= -1)
+	{	
+		l= i+1
+		g= q[i]
+		for (j=l; j < n; j++) 
+			u[i][j] = 0;
+		if (g != 0.0)
+		{
+			h= u[i][i]*g
+			for (j=l; j < n; j++)
+			{
+				s=0.0
+				for (k=l; k < m; k++) s += u[k][i]*u[k][j];
+				f= s/h
+				for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
+			}
+			for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
+		}
+		else
+			for (j=i; j < m; j++) u[j][i] = 0;
+		u[i][i] += 1;
+	}
+	
+	// diagonalization of the bidiagonal form
+	prec= prec*x
+	for (k=n-1; k != -1; k+= -1)
+	{
+		for (var iteration=0; iteration < itmax; iteration++)
+		{	// test f splitting
+			var test_convergence = false
+			for (l=k; l != -1; l+= -1)
+			{	
+				if (Math.abs(e[l]) <= prec)
+				{	test_convergence= true
+					break 
+				}
+				if (Math.abs(q[l-1]) <= prec)
+					break 
+			}
+			if (!test_convergence)
+			{	// cancellation of e[l] if l>0
+				c= 0.0
+				s= 1.0
+				var l1= l-1
+				for (i =l; i= itmax-1)
+				throw 'Error: no convergence.'
+			// shift from bottom 2x2 minor
+			x= q[l]
+			y= q[k-1]
+			g= e[k-1]
+			h= e[k]
+			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y)
+			g= pythag(f,1.0)
+			if (f < 0.0)
+				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x
+			else
+				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x
+			// next QR transformation
+			c= 1.0
+			s= 1.0
+			for (i=l+1; i< k+1; i++)
+			{	
+				g= e[i]
+				y= q[i]
+				h= s*g
+				g= c*g
+				z= pythag(f,h)
+				e[i-1]= z
+				c= f/z
+				s= h/z
+				f= x*c+g*s
+				g= -x*s+g*c
+				h= y*s
+				y= y*c
+				for (j=0; j < n; j++)
+				{	
+					x= v[j][i-1]
+					z= v[j][i]
+					v[j][i-1] = x*c+z*s
+					v[j][i] = -x*s+z*c
+				}
+				z= pythag(f,h)
+				q[i-1]= z
+				c= f/z
+				s= h/z
+				f= c*g+s*y
+				x= -s*g+c*y
+				for (j=0; j < m; j++)
+				{
+					y= u[j][i-1]
+					z= u[j][i]
+					u[j][i-1] = y*c+z*s
+					u[j][i] = -y*s+z*c
+				}
+			}
+			e[l]= 0.0
+			e[k]= f
+			q[k]= x
+		} 
+	}
+		
+	//vt= transpose(v)
+	//return (u,q,vt)
+	for (i=0;i= 0; j--)
+	 {
+	  if (q[j] < q[i])
+	  {
+	//  writeln(i,'-',j)
+	   c = q[j]
+	   q[j] = q[i]
+	   q[i] = c
+	   for(k=0;k
Date: Tue, 18 Nov 2014 16:42:46 +0100
Subject: [PATCH 24/48] Explicitely state all semicolons.

This avoids relying on automatic semicolon insertion, to make the code
cleaner and avoid pitfalls.  The svd module in particular had many
unterminated lines, likely due to its Python heritage.  The insertion places
were identified by JSHint.
---
 src/numeric.js | 250 ++++++++++++++++++++++++-------------------------
 src/sparse2.js |  18 ++--
 src/svd.js     | 214 +++++++++++++++++++++---------------------
 3 files changed, 241 insertions(+), 241 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..1a115c6 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -22,7 +22,7 @@ numeric.bench = function bench (f,interval) {
     while(i>0) { f(); i--; }
     t2 = new Date();
     return 1000*(3*n-1)/(t2-t1);
-}
+};
 
 numeric._myIndexOf = (function _myIndexOf(w) {
     var n = this.length,k;
@@ -95,7 +95,7 @@ numeric.prettyPrint = function prettyPrint(x) {
     }
     foo(x);
     return ret.join('');
-}
+};
 
 numeric.parseDate = function parseDate(d) {
     function foo(d) {
@@ -106,7 +106,7 @@ numeric.parseDate = function parseDate(d) {
         return ret;
     }
     return foo(d);
-}
+};
 
 numeric.parseFloat = function parseFloat_(d) {
     function foo(d) {
@@ -117,7 +117,7 @@ numeric.parseFloat = function parseFloat_(d) {
         return ret;
     }
     return foo(d);
-}
+};
 
 numeric.parseCSV = function parseCSV(t) {
     var foo = t.split('\n');
@@ -125,7 +125,7 @@ numeric.parseCSV = function parseCSV(t) {
     var ret = [];
     var pat = /(([^'",]*)|('[^']*')|("[^"]*")),/g;
     var patnum = /^\s*(([+-]?[0-9]+(\.[0-9]*)?(e[+-]?[0-9]+)?)|([+-]?[0-9]*(\.[0-9]+)?(e[+-]?[0-9]+)?))\s*$/;
-    var stripper = function(n) { return n.substr(0,n.length-1); }
+    var stripper = function(n) { return n.substr(0,n.length-1); };
     var count = 0;
     for(k=0;k=0;i--) { ret[i] = numeric.rep(s,v,k+1); }
     return ret;
-}
+};
 
 
 numeric.dotMMsmall = function dotMMsmall(x,y) {
@@ -413,7 +413,7 @@ numeric.dotMMsmall = function dotMMsmall(x,y) {
         ret[i] = foo;
     }
     return ret;
-}
+};
 numeric._getCol = function _getCol(A,j,x) {
     var n = A.length, i;
     for(i=n-1;i>0;--i) {
@@ -422,7 +422,7 @@ numeric._getCol = function _getCol(A,j,x) {
         x[i] = A[i][j];
     }
     if(i===0) x[0] = A[0][j];
-}
+};
 numeric.dotMMbig = function dotMMbig(x,y){
     var gc = numeric._getCol, p = y.length, v = Array(p);
     var m = x.length, n = y[0].length, A = new Array(m), xj;
@@ -441,14 +441,14 @@ numeric.dotMMbig = function dotMMbig(x,y){
         }
     }
     return A;
-}
+};
 
 numeric.dotMV = function dotMV(x,y) {
     var p = x.length, q = y.length,i;
     var ret = Array(p), dotVV = numeric.dotVV;
     for(i=p-1;i>=0;i--) { ret[i] = dotVV(x[i],y); }
     return ret;
-}
+};
 
 numeric.dotVM = function dotVM(x,y) {
     var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0,s1,s2,s3,baz,accum;
@@ -464,7 +464,7 @@ numeric.dotVM = function dotVM(x,y) {
         ret[k] = woo;
     }
     return ret;
-}
+};
 
 numeric.dotVV = function dotVV(x,y) {
     var i,n=x.length,i1,ret = x[n-1]*y[n-1];
@@ -474,7 +474,7 @@ numeric.dotVV = function dotVV(x,y) {
     }
     if(i===0) { ret += x[0]*y[0]; }
     return ret;
-}
+};
 
 numeric.dot = function dot(x,y) {
     var d = numeric.dim;
@@ -490,7 +490,7 @@ numeric.dot = function dot(x,y) {
     case 0: return x*y;
     default: throw new Error('numeric.dot only works on vectors and matrices');
     }
-}
+};
 
 numeric.diag = function diag(d) {
     var i,i1,j,n = d.length, A = Array(n), Ai;
@@ -511,7 +511,7 @@ numeric.diag = function diag(d) {
         A[i] = Ai;
     }
     return A;
-}
+};
 numeric.getDiag = function(A) {
     var n = Math.min(A.length,A[0].length),i,ret = Array(n);
     for(i=n-1;i>=1;--i) {
@@ -523,9 +523,9 @@ numeric.getDiag = function(A) {
         ret[0] = A[0][0];
     }
     return ret;
-}
+};
 
-numeric.identity = function identity(n) { return numeric.diag(numeric.rep([n],1)); }
+numeric.identity = function identity(n) { return numeric.diag(numeric.rep([n],1)); };
 numeric.pointwise = function pointwise(params,body,setup) {
     if(typeof setup === "undefined") { setup = ""; }
     var fun = [];
@@ -558,7 +558,7 @@ numeric.pointwise = function pointwise(params,body,setup) {
             'return ret;'
             );
     return Function.apply(null,fun);
-}
+};
 numeric.pointwise2 = function pointwise2(params,body,setup) {
     if(typeof setup === "undefined") { setup = ""; }
     var fun = [];
@@ -583,7 +583,7 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
             'return ret;'
             );
     return Function.apply(null,fun);
-}
+};
 numeric._biforeach = (function _biforeach(x,y,s,k,f) {
     if(k === s.length-1) { f(x,y); return; }
     var i,n=s[k];
@@ -790,7 +790,7 @@ numeric.trunc = function trunc(x,y) {
     }
     if (typeof y === "object") return numeric.truncSV(x,y);
     return Math.round(x/y)*y;
-}
+};
 
 numeric.inv = function inv(x) {
     var s = numeric.dim(x), abs = Math.abs, m = s[0], n = s[1];
@@ -818,7 +818,7 @@ numeric.inv = function inv(x) {
         }
     }
     return I;
-}
+};
 
 numeric.det = function det(x) {
     var s = numeric.dim(x);
@@ -846,7 +846,7 @@ numeric.det = function det(x) {
         ret *= Aj[j];
     }
     return ret*A[j][j];
-}
+};
 
 numeric.transpose = function transpose(x) {
     var i,j,m = x.length,n = x[0].length, ret=Array(n),A0,A1,Bj;
@@ -873,7 +873,7 @@ numeric.transpose = function transpose(x) {
         if(j===0) { ret[0][0] = A0[0]; }
     }
     return ret;
-}
+};
 numeric.negtranspose = function negtranspose(x) {
     var i,j,m = x.length,n = x[0].length, ret=Array(n),A0,A1,Bj;
     for(j=0;j=0;i--) ret[i] = _random(s,k+1);
     return ret;
-}
-numeric.random = function random(s) { return numeric._random(s,0); }
+};
+numeric.random = function random(s) { return numeric._random(s,0); };
 
-numeric.norm2 = function norm2(x) { return Math.sqrt(numeric.norm2Squared(x)); }
+numeric.norm2 = function norm2(x) { return Math.sqrt(numeric.norm2Squared(x)); };
 
 numeric.linspace = function linspace(a,b,n) {
     if(typeof n === "undefined") n = Math.max(Math.round(b-a)+1,1);
@@ -926,7 +926,7 @@ numeric.linspace = function linspace(a,b,n) {
     n--;
     for(i=n;i>=0;i--) { ret[i] = (i*b+(n-i)*a)/n; }
     return ret;
-}
+};
 
 numeric.getBlock = function getBlock(x,from,to) {
     var s = numeric.dim(x);
@@ -940,7 +940,7 @@ numeric.getBlock = function getBlock(x,from,to) {
         return ret;
     }
     return foo(x,0);
-}
+};
 
 numeric.setBlock = function setBlock(x,from,to,B) {
     var s = numeric.dim(x);
@@ -951,7 +951,7 @@ numeric.setBlock = function setBlock(x,from,to,B) {
     }
     foo(x,B,0);
     return x;
-}
+};
 
 numeric.getRange = function getRange(A,I,J) {
     var m = I.length, n = J.length;
@@ -964,7 +964,7 @@ numeric.getRange = function getRange(A,I,J) {
         for(j=n-1;j!==-1;--j) Bi[j] = AI[J[j]];
     }
     return B;
-}
+};
 
 numeric.blockMatrix = function blockMatrix(X) {
     var s = numeric.dim(X);
@@ -990,7 +990,7 @@ numeric.blockMatrix = function blockMatrix(X) {
         I += X[i][0].length;
     }
     return Z;
-}
+};
 
 numeric.tensor = function tensor(x,y) {
     if(typeof x === "number" || typeof y === "number") return numeric.mul(x,y);
@@ -1015,11 +1015,11 @@ numeric.tensor = function tensor(x,y) {
         A[i] = Ai;
     }
     return A;
-}
+};
 
 // 3. The Tensor type T
-numeric.T = function T(x,y) { this.x = x; this.y = y; }
-numeric.t = function t(x,y) { return new numeric.T(x,y); }
+numeric.T = function T(x,y) { this.x = x; this.y = y; };
+numeric.t = function t(x,y) { return new numeric.T(x,y); };
 
 numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
     var io = numeric.indexOf;
@@ -1047,7 +1047,7 @@ numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
             '}\n'+
             'return new numeric.T('+rr+');\n'
     );
-}
+};
 
 numeric.T.prototype.add = numeric.Tbinop(
         'add(x.x,y.x)',
@@ -1072,14 +1072,14 @@ numeric.T.prototype.reciprocal = function reciprocal() {
         return new numeric.T(div(this.x,d),div(numeric.neg(this.y),d));
     }
     return new T(div(1,this.x));
-}
+};
 numeric.T.prototype.div = function div(y) {
     if(!(y instanceof numeric.T)) y = new numeric.T(y);
     if(y.y) { return this.mul(y.reciprocal()); }
     var div = numeric.div;
     if(this.y) { return new numeric.T(div(this.x,y.x),div(this.y,y.x)); }
     return new numeric.T(div(this.x,y.x));
-}
+};
 numeric.T.prototype.dot = numeric.Tbinop(
         'dot(x.x,y.x)',
         'dot(x.x,y.x),dot(x.x,y.y)',
@@ -1090,12 +1090,12 @@ numeric.T.prototype.transpose = function transpose() {
     var t = numeric.transpose, x = this.x, y = this.y;
     if(y) { return new numeric.T(t(x),t(y)); }
     return new numeric.T(t(x));
-}
+};
 numeric.T.prototype.transjugate = function transjugate() {
     var t = numeric.transpose, x = this.x, y = this.y;
     if(y) { return new numeric.T(t(x),numeric.negtranspose(y)); }
     return new numeric.T(t(x));
-}
+};
 numeric.Tunop = function Tunop(r,c,s) {
     if(typeof s !== "string") { s = ''; }
     return Function(
@@ -1106,7 +1106,7 @@ numeric.Tunop = function Tunop(r,c,s) {
             '}\n'+
             r+';\n'
     );
-}
+};
 
 numeric.T.prototype.exp = numeric.Tunop(
         'return new numeric.T(ex)',
@@ -1202,7 +1202,7 @@ numeric.T.prototype.inv = function inv() {
         }
     }
     return new numeric.T(Rx,Ry);
-}
+};
 numeric.T.prototype.get = function get(i) {
     var x = this.x, y = this.y, k = 0, ik, n = i.length;
     if(y) {
@@ -1220,7 +1220,7 @@ numeric.T.prototype.get = function get(i) {
         k++;
     }
     return new numeric.T(x);
-}
+};
 numeric.T.prototype.set = function set(i,v) {
     var x = this.x, y = this.y, k = 0, ik, n = i.length, vx = v.x, vy = v.y;
     if(n===0) {
@@ -1267,7 +1267,7 @@ numeric.T.prototype.set = function set(i,v) {
     ik = i[k];
     x[ik] = vx;
     return this;
-}
+};
 numeric.T.prototype.getRows = function getRows(i0,i1) {
     var n = i1-i0+1, j;
     var rx = Array(n), ry, x = this.x, y = this.y;
@@ -1278,7 +1278,7 @@ numeric.T.prototype.getRows = function getRows(i0,i1) {
         return new numeric.T(rx,ry);
     }
     return new numeric.T(rx);
-}
+};
 numeric.T.prototype.setRows = function setRows(i0,i1,A) {
     var j;
     var rx = this.x, ry = this.y, x = A.x, y = A.y;
@@ -1290,12 +1290,12 @@ numeric.T.prototype.setRows = function setRows(i0,i1,A) {
         for(j=i0;j<=i1;j++) { ry[j] = numeric.rep([x[j-i0].length],0); }
     }
     return this;
-}
+};
 numeric.T.prototype.getRow = function getRow(k) {
     var x = this.x, y = this.y;
     if(y) { return new numeric.T(x[k],y[k]); }
     return new numeric.T(x[k]);
-}
+};
 numeric.T.prototype.setRow = function setRow(i,v) {
     var rx = this.x, ry = this.y, x = v.x, y = v.y;
     rx[i] = x;
@@ -1306,13 +1306,13 @@ numeric.T.prototype.setRow = function setRow(i,v) {
         ry = numeric.rep([x.length],0);
     }
     return this;
-}
+};
 
 numeric.T.prototype.getBlock = function getBlock(from,to) {
     var x = this.x, y = this.y, b = numeric.getBlock;
     if(y) { return new numeric.T(b(x,from,to),b(y,from,to)); }
     return new numeric.T(b(x,from,to));
-}
+};
 numeric.T.prototype.setBlock = function setBlock(from,to,A) {
     if(!(A instanceof numeric.T)) A = new numeric.T(A);
     var x = this.x, y = this.y, b = numeric.setBlock, Ax = A.x, Ay = A.y;
@@ -1324,31 +1324,31 @@ numeric.T.prototype.setBlock = function setBlock(from,to,A) {
     }
     b(x,from,to,Ax);
     if(y) b(y,from,to,numeric.rep(numeric.dim(Ax),0));
-}
+};
 numeric.T.rep = function rep(s,v) {
     var T = numeric.T;
     if(!(v instanceof T)) v = new T(v);
     var x = v.x, y = v.y, r = numeric.rep;
     if(y) return new T(r(s,x),r(s,y));
     return new T(r(s,x));
-}
+};
 numeric.T.diag = function diag(d) {
     if(!(d instanceof numeric.T)) d = new numeric.T(d);
     var x = d.x, y = d.y, diag = numeric.diag;
     if(y) return new numeric.T(diag(x),diag(y));
     return new numeric.T(diag(x));
-}
+};
 numeric.T.eig = function eig() {
     if(this.y) { throw new Error('eig: not implemented for complex matrices.'); }
     return numeric.eig(this.x);
-}
-numeric.T.identity = function identity(n) { return new numeric.T(numeric.identity(n)); }
+};
+numeric.T.identity = function identity(n) { return new numeric.T(numeric.identity(n)); };
 numeric.T.prototype.getDiag = function getDiag() {
     var n = numeric;
     var x = this.x, y = this.y;
     if(y) { return new n.T(n.getDiag(x),n.getDiag(y)); }
     return new n.T(n.getDiag(x));
-}
+};
 
 // 4. Eigenvalues of real matrices
 
@@ -1360,7 +1360,7 @@ numeric.house = function house(x) {
     var foo = numeric.norm2(v);
     if(foo === 0) { /* this should not happen */ throw new Error('eig: internal error'); }
     return numeric.div(v,foo);
-}
+};
 
 numeric.toUpperHessenberg = function toUpperHessenberg(me) {
     var s = numeric.dim(me);
@@ -1384,7 +1384,7 @@ numeric.toUpperHessenberg = function toUpperHessenberg(me) {
         }
     }
     return {H:A, Q:Q};
-}
+};
 
 numeric.epsilon = 2.220446049250313e-16;
 
@@ -1473,7 +1473,7 @@ numeric.QRFrancis = function(H,maxiter) {
         }
     }
     throw new Error('numeric: eigenvalue iteration does not converge -- increase maxiter?');
-}
+};
 
 numeric.eig = function eig(A,maxiter) {
     var QH = numeric.toUpperHessenberg(A);
@@ -1589,7 +1589,7 @@ numeric.ccsSparse = function ccsSparse(A) {
         }
     }
     return [Ai,Aj,Av];
-}
+};
 numeric.ccsFull = function ccsFull(A) {
     var Ai = A[0], Aj = A[1], Av = A[2], s = numeric.ccsDim(A), m = s[0], n = s[1], i,j,j0,j1,k;
     var B = numeric.rep([m,n],0);
@@ -1599,7 +1599,7 @@ numeric.ccsFull = function ccsFull(A) {
         for(j=j0;jn) k.pop();
     return ret;
-}
+};
 
 // 6. Coordinate matrices
 numeric.cLU = function LU(A) {
@@ -2338,7 +2338,7 @@ numeric.cgrid = function grid(n,shape) {
     if(typeof shape !== "function") {
         switch(shape) {
         case 'L':
-            shape = function(i,j) { return (i>=n[0]/2 || j=n[0]/2 || j b)
-			return a*Math.sqrt(1.0+(b*b/a/a))
+			return a*Math.sqrt(1.0+(b*b/a/a));
 		else if (b == 0.0) 
-			return a
-		return b*Math.sqrt(1.0+(a*a/b/b))
+			return a;
+		return b*Math.sqrt(1.0+(a*a/b/b));
 	}
 
 	//Householder's reduction to bidiagonal form
@@ -64,44 +64,44 @@ numeric.svd= function svd(A) {
 			f= u[i][i];
 			g= Math.sqrt(s);
 			if (f >= 0.0) g= -g;
-			h= f*g-s
+			h= f*g-s;
 			u[i][i]=f-g;
 			for (j=l; j < n; j++)
 			{
-				s= 0.0
+				s= 0.0;
 				for (k=i; k < m; k++) 
-					s += u[k][i]*u[k][j]
-				f= s/h
+					s += u[k][i]*u[k][j];
+				f= s/h;
 				for (k=i; k < m; k++) 
-					u[k][j]+=f*u[k][i]
+					u[k][j]+=f*u[k][i];
 			}
 		}
-		q[i]= g
-		s= 0.0
+		q[i]= g;
+		s= 0.0;
 		for (j=l; j < n; j++) 
-			s= s + u[i][j]*u[i][j]
+			s= s + u[i][j]*u[i][j];
 		if (s <= tolerance)
-			g= 0.0
+			g= 0.0;
 		else
 		{	
-			f= u[i][i+1]
-			g= Math.sqrt(s)
-			if (f >= 0.0) g= -g
-			h= f*g - s
+			f= u[i][i+1];
+			g= Math.sqrt(s);
+			if (f >= 0.0) g= -g;
+			h= f*g - s;
 			u[i][i+1] = f-g;
-			for (j=l; j < n; j++) e[j]= u[i][j]/h
+			for (j=l; j < n; j++) e[j]= u[i][j]/h;
 			for (j=l; j < m; j++)
 			{	
-				s=0.0
+				s=0.0;
 				for (k=l; k < n; k++) 
-					s += (u[j][k]*u[i][k])
+					s += (u[j][k]*u[i][k]);
 				for (k=l; k < n; k++) 
-					u[j][k]+=s*e[k]
+					u[j][k]+=s*e[k];
 			}	
 		}
-		y= Math.abs(q[i])+Math.abs(e[i])
+		y= Math.abs(q[i])+Math.abs(e[i]);
 		if (y>x) 
-			x=y
+			x=y;
 	}
 	
 	// accumulation of right hand gtransformations
@@ -109,16 +109,16 @@ numeric.svd= function svd(A) {
 	{	
 		if (g != 0.0)
 		{
-		 	h= g*u[i][i+1]
+		 	h= g*u[i][i+1];
 			for (j=l; j < n; j++) 
-				v[j][i]=u[i][j]/h
+				v[j][i]=u[i][j]/h;
 			for (j=l; j < n; j++)
 			{	
-				s=0.0
+				s=0.0;
 				for (k=l; k < n; k++) 
-					s += u[i][k]*v[k][j]
+					s += u[i][k]*v[k][j];
 				for (k=l; k < n; k++) 
-					v[k][j]+=(s*v[k][i])
+					v[k][j]+=(s*v[k][i]);
 			}	
 		}
 		for (j=l; j < n; j++)
@@ -127,25 +127,25 @@ numeric.svd= function svd(A) {
 			v[j][i] = 0;
 		}
 		v[i][i] = 1;
-		g= e[i]
-		l= i
+		g= e[i];
+		l= i;
 	}
 	
 	// accumulation of left hand transformations
 	for (i=n-1; i != -1; i+= -1)
 	{	
-		l= i+1
-		g= q[i]
+		l= i+1;
+		g= q[i];
 		for (j=l; j < n; j++) 
 			u[i][j] = 0;
 		if (g != 0.0)
 		{
-			h= u[i][i]*g
+			h= u[i][i]*g;
 			for (j=l; j < n; j++)
 			{
-				s=0.0
+				s=0.0;
 				for (k=l; k < m; k++) s += u[k][i]*u[k][j];
-				f= s/h
+				f= s/h;
 				for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
 			}
 			for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
@@ -156,119 +156,119 @@ numeric.svd= function svd(A) {
 	}
 	
 	// diagonalization of the bidiagonal form
-	prec= prec*x
+	prec= prec*x;
 	for (k=n-1; k != -1; k+= -1)
 	{
 		for (var iteration=0; iteration < itmax; iteration++)
 		{	// test f splitting
-			var test_convergence = false
+			var test_convergence = false;
 			for (l=k; l != -1; l+= -1)
 			{	
 				if (Math.abs(e[l]) <= prec)
-				{	test_convergence= true
-					break 
+				{	test_convergence= true;
+					break;
 				}
 				if (Math.abs(q[l-1]) <= prec)
-					break 
+					break;
 			}
 			if (!test_convergence)
 			{	// cancellation of e[l] if l>0
-				c= 0.0
-				s= 1.0
-				var l1= l-1
+				c= 0.0;
+				s= 1.0;
+				var l1= l-1;
 				for (i =l; i= itmax-1)
-				throw 'Error: no convergence.'
+				throw 'Error: no convergence.';
 			// shift from bottom 2x2 minor
-			x= q[l]
-			y= q[k-1]
-			g= e[k-1]
-			h= e[k]
-			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y)
-			g= pythag(f,1.0)
+			x= q[l];
+			y= q[k-1];
+			g= e[k-1];
+			h= e[k];
+			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y);
+			g= pythag(f,1.0);
 			if (f < 0.0)
-				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x
+				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x;
 			else
-				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x
+				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x;
 			// next QR transformation
-			c= 1.0
-			s= 1.0
+			c= 1.0;
+			s= 1.0;
 			for (i=l+1; i< k+1; i++)
 			{	
-				g= e[i]
-				y= q[i]
-				h= s*g
-				g= c*g
-				z= pythag(f,h)
-				e[i-1]= z
-				c= f/z
-				s= h/z
-				f= x*c+g*s
-				g= -x*s+g*c
-				h= y*s
-				y= y*c
+				g= e[i];
+				y= q[i];
+				h= s*g;
+				g= c*g;
+				z= pythag(f,h);
+				e[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= x*c+g*s;
+				g= -x*s+g*c;
+				h= y*s;
+				y= y*c;
 				for (j=0; j < n; j++)
 				{	
-					x= v[j][i-1]
-					z= v[j][i]
-					v[j][i-1] = x*c+z*s
-					v[j][i] = -x*s+z*c
+					x= v[j][i-1];
+					z= v[j][i];
+					v[j][i-1] = x*c+z*s;
+					v[j][i] = -x*s+z*c;
 				}
-				z= pythag(f,h)
-				q[i-1]= z
-				c= f/z
-				s= h/z
-				f= c*g+s*y
-				x= -s*g+c*y
+				z= pythag(f,h);
+				q[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= c*g+s*y;
+				x= -s*g+c*y;
 				for (j=0; j < m; j++)
 				{
-					y= u[j][i-1]
-					z= u[j][i]
-					u[j][i-1] = y*c+z*s
-					u[j][i] = -y*s+z*c
+					y= u[j][i-1];
+					z= u[j][i];
+					u[j][i-1] = y*c+z*s;
+					u[j][i] = -y*s+z*c;
 				}
 			}
-			e[l]= 0.0
-			e[k]= f
-			q[k]= x
+			e[l]= 0.0;
+			e[k]= f;
+			q[k]= x;
 		} 
 	}
 		
 	//vt= transpose(v)
 	//return (u,q,vt)
 	for (i=0;i
Date: Mon, 16 Feb 2015 04:16:28 +0100
Subject: [PATCH 25/48] Ensure proper binding for dynamically generated
 functions.

Many places in numeric.js create new functions using the Function(...)
constructor.  Such functions do not have access to the local scope.
Therefore they bind to the global "numeric" object, which might not exist,
or might belong to a different version of numeric.js, or might be something
different altogether.  Since we are careful enough to have a local variable
in most places, it appears prudent to make sure that we pass this to
functions created from source strings as well.
---
 src/numeric.js | 35 +++++++++++++++++++++--------------
 1 file changed, 21 insertions(+), 14 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..ee0503b 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -31,7 +31,14 @@ numeric._myIndexOf = (function _myIndexOf(w) {
 });
 numeric.myIndexOf = (Array.prototype.indexOf)?Array.prototype.indexOf:numeric._myIndexOf;
 
-numeric.Function = Function;
+numeric.Function = function() {
+    var code = arguments[arguments.length - 1];
+    var args = arguments.length === 1 ? "" : arguments[0];
+    for (var i = 2; i < arguments.length; ++i)
+        args += ", " + arguments[i - 1];
+    var body = "return function(" + args + ") {" + code + "};"
+    return Function("numeric", body)(numeric); // bind to local instance
+};
 numeric.precision = 4;
 numeric.largeArray = 50;
 
@@ -329,7 +336,7 @@ numeric.dim = function dim(x) {
 }
 
 numeric.mapreduce = function mapreduce(body,init) {
-    return Function('x','accum','_s','_k',
+    return numeric.Function('x','accum','_s','_k',
             'if(typeof accum === "undefined") accum = '+init+';\n'+
             'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
             'if(typeof _s === "undefined") _s = numeric.dim(x);\n'+
@@ -356,7 +363,7 @@ numeric.mapreduce = function mapreduce(body,init) {
             );
 }
 numeric.mapreduce2 = function mapreduce2(body,setup) {
-    return Function('x',
+    return numeric.Function('x',
             'var n = x.length;\n'+
             'var i,xi;\n'+setup+';\n'+
             'for(i=n-1;i!==-1;--i) { \n'+
@@ -557,7 +564,7 @@ numeric.pointwise = function pointwise(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return numeric.Function.apply(null,fun);
 }
 numeric.pointwise2 = function pointwise2(params,body,setup) {
     if(typeof setup === "undefined") { setup = ""; }
@@ -582,7 +589,7 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
             '}\n'+
             'return ret;'
             );
-    return Function.apply(null,fun);
+    return numeric.Function.apply(null,fun);
 }
 numeric._biforeach = (function _biforeach(x,y,s,k,f) {
     if(k === s.length-1) { f(x,y); return; }
@@ -693,7 +700,7 @@ numeric.mapreducers = {
             numeric[i+'VV'] = numeric.pointwise2(['x[i]','y[i]'],code('ret[i]','x[i]','y[i]'),setup);
             numeric[i+'SV'] = numeric.pointwise2(['x','y[i]'],code('ret[i]','x','y[i]'),setup);
             numeric[i+'VS'] = numeric.pointwise2(['x[i]','y'],code('ret[i]','x[i]','y'),setup);
-            numeric[i] = Function(
+            numeric[i] = numeric.Function(
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var VV = numeric.'+i+'VV, VS = numeric.'+i+'VS, SV = numeric.'+i+'SV;\n'+
                     'var dim = numeric.dim;\n'+
@@ -708,7 +715,7 @@ numeric.mapreducers = {
             numeric[o] = numeric[i];
             numeric[i+'eqV'] = numeric.pointwise2(['ret[i]','x[i]'], codeeq('ret[i]','x[i]'),setup);
             numeric[i+'eqS'] = numeric.pointwise2(['ret[i]','x'], codeeq('ret[i]','x'),setup);
-            numeric[i+'eq'] = Function(
+            numeric[i+'eq'] = numeric.Function(
                     'var n = arguments.length, i, x = arguments[0], y;\n'+
                     'var V = numeric.'+i+'eqV, S = numeric.'+i+'eqS\n'+
                     'var s = numeric.dim(x);\n'+
@@ -735,7 +742,7 @@ numeric.mapreducers = {
                 if(Math.hasOwnProperty(o)) setup = 'var '+o+' = Math.'+o+';\n';
             }
             numeric[i+'eqV'] = numeric.pointwise2(['ret[i]'],'ret[i] = '+o+'(ret[i]);',setup);
-            numeric[i+'eq'] = Function('x',
+            numeric[i+'eq'] = numeric.Function('x',
                     'if(typeof x !== "object") return '+o+'x\n'+
                     'var i;\n'+
                     'var V = numeric.'+i+'eqV;\n'+
@@ -743,7 +750,7 @@ numeric.mapreducers = {
                     'numeric._foreach(x,s,0,V);\n'+
                     'return x;\n');
             numeric[i+'V'] = numeric.pointwise2(['x[i]'],'ret[i] = '+o+'(x[i]);',setup);
-            numeric[i] = Function('x',
+            numeric[i] = numeric.Function('x',
                     'if(typeof x !== "object") return '+o+'(x)\n'+
                     'var i;\n'+
                     'var V = numeric.'+i+'V;\n'+
@@ -759,7 +766,7 @@ numeric.mapreducers = {
         if(numeric.mapreducers.hasOwnProperty(i)) {
             o = numeric.mapreducers[i];
             numeric[i+'V'] = numeric.mapreduce2(o[0],o[1]);
-            numeric[i] = Function('x','s','k',
+            numeric[i] = numeric.Function('x','s','k',
                     o[1]+
                     'if(typeof x !== "object") {'+
                     '    xi = x;\n'+
@@ -1032,7 +1039,7 @@ numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
             }
         }
     }
-    return Function(['y'],
+    return numeric.Function(['y'],
             'var x = this;\n'+
             'if(!(y instanceof numeric.T)) { y = new numeric.T(y); }\n'+
             setup+'\n'+
@@ -1098,7 +1105,7 @@ numeric.T.prototype.transjugate = function transjugate() {
 }
 numeric.Tunop = function Tunop(r,c,s) {
     if(typeof s !== "string") { s = ''; }
-    return Function(
+    return numeric.Function(
             'var x = this;\n'+
             s+'\n'+
             'if(x.y) {'+
@@ -1964,7 +1971,7 @@ numeric.ccsLUPSolve = function ccsLUPSolve(LUP,B) {
 
 numeric.ccsbinop = function ccsbinop(body,setup) {
     if(typeof setup === "undefined") setup='';
-    return Function('X','Y',
+    return numeric.Function('X','Y',
             'var Xi = X[0], Xj = X[1], Xv = X[2];\n'+
             'var Yi = Y[0], Yj = Y[1], Yv = Y[2];\n'+
             'var n = Xi.length-1,m = Math.max(numeric.sup(Xj),numeric.sup(Yj))+1;\n'+
@@ -2020,7 +2027,7 @@ numeric.ccsbinop = function ccsbinop(body,setup) {
         if(isFinite(eval('1'+numeric.ops2[k]+'0')) && isFinite(eval('0'+numeric.ops2[k]+'1'))) C = 'numeric.ccs'+k+'MM(X,Y)';
         else C = 'NaN';
         numeric['ccs'+k+'MM'] = numeric.ccsbinop('zk = xk '+numeric.ops2[k]+'yk;');
-        numeric['ccs'+k] = Function('X','Y',
+        numeric['ccs'+k] = numeric.Function('X','Y',
                 'if(typeof X === "number") return '+A+';\n'+
                 'if(typeof Y === "number") return '+B+';\n'+
                 'return '+C+';\n'

From 3a63a929bf337af9ba9de3b2eb4d2ae0c9d880a0 Mon Sep 17 00:00:00 2001
From: Pastafarianist 
Date: Thu, 19 Feb 2015 00:24:10 +0300
Subject: [PATCH 26/48] Fixed 100 rendered as 1e2 by prettyPrint

Due to how prettyPrint was implemented, 100 would always be rendered as 1e2. Fixed that particular error. Still leaves open the issue of rendering 10000 as 1e4, for example.
---
 src/numeric.js | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..04b40ba 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -56,9 +56,9 @@ numeric.prettyPrint = function prettyPrint(x) {
         if(typeof x === "string") { ret.push('"'+x+'"'); return false; }
         if(typeof x === "boolean") { ret.push(x.toString()); return false; }
         if(typeof x === "number") {
-            var a = fmtnum(x);
+            var a = parseFloat(x.toString()).toString();
             var b = x.toPrecision(numeric.precision);
-            var c = parseFloat(x.toString()).toString();
+            var c = fmtnum(x);
             var d = [a,b,c,parseFloat(b).toString(),parseFloat(c).toString()];
             for(k=1;k
Date: Fri, 26 Jun 2015 17:52:29 -0700
Subject: [PATCH 27/48] Fix unreachable code warnings in Firefox 40.

This warning was being logged to the console whenever there was a doubled
semicolon after a return statement, because there is an unreachable (empty)
statement between the semicolons.

Regularize the usage of semicolons in generated code to avoid producing these
warnings.
---
 src/numeric.js | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..dc4a653 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -358,10 +358,10 @@ numeric.mapreduce = function mapreduce(body,init) {
 numeric.mapreduce2 = function mapreduce2(body,setup) {
     return Function('x',
             'var n = x.length;\n'+
-            'var i,xi;\n'+setup+';\n'+
+            'var i,xi;\n'+setup+'\n'+
             'for(i=n-1;i!==-1;--i) { \n'+
             '    xi = x[i];\n'+
-            '    '+body+';\n'+
+            '    '+body+'\n'+
             '}\n'+
             'return accum;'
             );
@@ -663,7 +663,7 @@ numeric.mapreducers = {
         prod: ['accum *= xi;','var accum = 1;'],
         norm2Squared: ['accum += xi*xi;','var accum = 0;'],
         norminf: ['accum = max(accum,abs(xi));','var accum = 0, max = Math.max, abs = Math.abs;'],
-        norm1: ['accum += abs(xi)','var accum = 0, abs = Math.abs;'],
+        norm1: ['accum += abs(xi);','var accum = 0, abs = Math.abs;'],
         sup: ['accum = max(accum,xi);','var accum = -Infinity, max = Math.max;'],
         inf: ['accum = min(accum,xi);','var accum = Infinity, min = Math.min;']
 };
@@ -763,7 +763,7 @@ numeric.mapreducers = {
                     o[1]+
                     'if(typeof x !== "object") {'+
                     '    xi = x;\n'+
-                    o[0]+';\n'+
+                    o[0]+'\n'+
                     '    return accum;\n'+
                     '}'+
                     'if(typeof s === "undefined") s = numeric.dim(x);\n'+
@@ -773,7 +773,7 @@ numeric.mapreducers = {
                     'var n = x.length, i;\n'+
                     'for(i=n-1;i!==-1;--i) {\n'+
                     '   xi = arguments.callee(x[i]);\n'+
-                    o[0]+';\n'+
+                    o[0]+'\n'+
                     '}\n'+
                     'return accum;\n');
         }
@@ -1102,15 +1102,15 @@ numeric.Tunop = function Tunop(r,c,s) {
             'var x = this;\n'+
             s+'\n'+
             'if(x.y) {'+
-            '  '+c+';\n'+
+            '  '+c+'\n'+
             '}\n'+
-            r+';\n'
+            r+'\n'
     );
 }
 
 numeric.T.prototype.exp = numeric.Tunop(
-        'return new numeric.T(ex)',
-        'return new numeric.T(mul(cos(x.y),ex),mul(sin(x.y),ex))',
+        'return new numeric.T(ex);',
+        'return new numeric.T(mul(cos(x.y),ex),mul(sin(x.y),ex));',
         'var ex = numeric.exp(x.x), cos = numeric.cos, sin = numeric.sin, mul = numeric.mul;');
 numeric.T.prototype.conj = numeric.Tunop(
         'return new numeric.T(x.x);',
@@ -1120,10 +1120,10 @@ numeric.T.prototype.neg = numeric.Tunop(
         'return new numeric.T(neg(x.x),neg(x.y));',
         'var neg = numeric.neg;');
 numeric.T.prototype.sin = numeric.Tunop(
-        'return new numeric.T(numeric.sin(x.x))',
+        'return new numeric.T(numeric.sin(x.x));',
         'return x.exp().sub(x.neg().exp()).div(new numeric.T(0,2));');
 numeric.T.prototype.cos = numeric.Tunop(
-        'return new numeric.T(numeric.cos(x.x))',
+        'return new numeric.T(numeric.cos(x.x));',
         'return x.exp().add(x.neg().exp()).div(2);');
 numeric.T.prototype.abs = numeric.Tunop(
         'return new numeric.T(numeric.abs(x.x));',

From 07e4134d3cf5fe3556282fd5fa070ddd5c0ef4a6 Mon Sep 17 00:00:00 2001
From: Jason Merrill 
Date: Fri, 26 Jun 2015 18:26:59 -0700
Subject: [PATCH 28/48] Remove potentially extraneous semicolon.

---
 src/numeric.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/numeric.js b/src/numeric.js
index d994c56..f14cc7e 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -38,7 +38,7 @@ numeric.largeArray = 50;
 numeric.compile = function () {
   var args = Array.prototype.slice.call(arguments);
   var body = args.pop();
-  body = 'return function (' + args.join(',') + ') {' + body + ';}';
+  body = 'return function (' + args.join(',') + ') {' + body + '}';
   return (new Function(['numeric'], body))(numeric);
 }
 

From b3410736fb14f1f328630d09478adce0f40be355 Mon Sep 17 00:00:00 2001
From: Victor Sosa 
Date: Thu, 3 Dec 2015 10:51:59 -0400
Subject: [PATCH 29/48] added bower file for integration

---
 bower.json | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 bower.json

diff --git a/bower.json b/bower.json
new file mode 100644
index 0000000..06ffb53
--- /dev/null
+++ b/bower.json
@@ -0,0 +1,12 @@
+{
+  "name": "numericjs",
+  "version": "1.2.6",
+  "main": "lib/numeric.js",
+  "description": "Numerical analysis in Javascript",
+  "license": "Eclipse",
+  "repo": "sloisel/numeric"
+  "ignore": [
+    ".jshintrc",
+    "**/*.txt"
+  ]
+}

From 5c23748f06a4064fcfa5c4a415ffaa5533b34e64 Mon Sep 17 00:00:00 2001
From: Victor Sosa 
Date: Thu, 3 Dec 2015 11:15:29 -0400
Subject: [PATCH 30/48] fix dependency bower.json file

---
 bower.json | 10 ++++++++--
 1 file changed, 8 insertions(+), 2 deletions(-)

diff --git a/bower.json b/bower.json
index 06ffb53..51d3040 100644
--- a/bower.json
+++ b/bower.json
@@ -3,10 +3,16 @@
   "version": "1.2.6",
   "main": "lib/numeric.js",
   "description": "Numerical analysis in Javascript",
-  "license": "Eclipse",
+  "license": "MIT",
   "repo": "sloisel/numeric"
   "ignore": [
     ".jshintrc",
     "**/*.txt"
-  ]
+  ],
+  "dependencies": {
+    "seedrandom": "latest",
+    "quadprog": "lib/quadprog.js",
+    "sparse2": "lib/sparse2.js",
+    "svd": "lib/svd.js",
+  }
 }

From 434c3c7ac0f3066d21ea33db7cb8e25e2b9a4140 Mon Sep 17 00:00:00 2001
From: Victor Sosa 
Date: Thu, 3 Dec 2015 11:19:46 -0400
Subject: [PATCH 31/48] fix dependency bower.json file

---
 bower.json | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/bower.json b/bower.json
index 51d3040..3113b58 100644
--- a/bower.json
+++ b/bower.json
@@ -9,6 +9,10 @@
     ".jshintrc",
     "**/*.txt"
   ],
+  "keywords": [
+    "numerical",
+    "analysis"
+  ],
   "dependencies": {
     "seedrandom": "latest",
     "quadprog": "lib/quadprog.js",

From 774f7e559bfdd77c9b4fa186f8bb704ed7edd7cb Mon Sep 17 00:00:00 2001
From: Kim Georg Lind Pedersen 
Date: Tue, 5 Apr 2016 16:08:08 +0200
Subject: [PATCH 32/48] added jacobi method

---
 README.md      |  15 ++--
 src/numeric.js | 234 ++++++++++++++++++++++++++++++++++++++++++++-----
 2 files changed, 224 insertions(+), 25 deletions(-)

diff --git a/README.md b/README.md
index 8646b37..8e416e3 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,11 @@
-Numeric Javascript by Sébastien Loisel
-======================================
+This is a fork of Numeric Javascript by Sébastien Loisel.
+
+Notable changes when compared to 
+
+
+
+
+===
 
 Numeric Javascript is a javascript library for doing numerical
 analysis in the browser. Because Numeric Javascript uses only the
@@ -12,7 +18,7 @@ asking a server to compute something. Indeed, you do not need a
 powerful server (or any server at all) since your web app will perform
 all its calculations in the client.
 
-For further information, see http://www.numericjs.com/
+The original website, see http://www.numericjs.com/
 Discussion forum: http://groups.google.com/group/numericjs
 
 License
@@ -47,5 +53,4 @@ the numericjs.com web site, which you probably won't need.
 Building and testing
 --------------------
 
-If you tweak the code, you can build and test the library by running the script /tools/build.sh. If you plan
-to send me patches, please at least run this build script and check that all the tests pass.
+If you tweak the code, you can build and test the library by running the script /tools/build.sh.
diff --git a/src/numeric.js b/src/numeric.js
index 537b68f..6648d31 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -3,7 +3,7 @@
 var numeric = (typeof exports === "undefined")?(function numeric() {}):(exports);
 if(typeof global !== "undefined") { global.numeric = numeric; }
 
-numeric.version = "1.2.6";
+numeric.version = "1.2.7";
 
 // 1. Utility functions
 numeric.bench = function bench (f,interval) {
@@ -328,7 +328,9 @@ numeric.dim = function dim(x) {
     return [];
 }
 
-numeric.mapreduce = function mapreduce(body,init) {
+// mapreduce
+numeric.mapreduce = function mapreduce(body, init)
+{
     return Function('x','accum','_s','_k',
             'if(typeof accum === "undefined") accum = '+init+';\n'+
             'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
@@ -355,7 +357,9 @@ numeric.mapreduce = function mapreduce(body,init) {
             'return accum;'
             );
 }
-numeric.mapreduce2 = function mapreduce2(body,setup) {
+
+// 
+numeric.mapreduce2 = function mapreduce2(body, setup) {
     return Function('x',
             'var n = x.length;\n'+
             'var i,xi;\n'+setup+';\n'+
@@ -367,34 +371,50 @@ numeric.mapreduce2 = function mapreduce2(body,setup) {
             );
 }
 
+// compare arrays/tensors
+numeric.same = function same(x, y)
+{
+    var i, n;
 
-numeric.same = function same(x,y) {
-    var i,n;
     if(!(x instanceof Array) || !(y instanceof Array)) { return false; }
+    
     n = x.length;
+    
     if(n !== y.length) { return false; }
-    for(i=0;i=0;i-=2) { ret[i+1] = v; ret[i] = v; }
-        if(i===-1) { ret[0] = v; }
+    
+    if(k === s.length - 1)
+    {
+        for(i = n - 2; i >= 0; i -= 2) { ret[i+1] = v; ret[i] = v; }
+        if(i === -1) { ret[0] = v; }
         return ret;
     }
-    for(i=n-1;i>=0;i--) { ret[i] = numeric.rep(s,v,k+1); }
+    
+    for(i = n - 1; i >= 0; i--) { ret[i] = numeric.rep(s, v, k+1); }
+    
     return ret;
 }
 
-
-numeric.dotMMsmall = function dotMMsmall(x,y) {
+// dot functions
+numeric.dotMMsmall = function dotMMsmall(x,y)
+{
     var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0;
     p = x.length; q = y.length; r = y[0].length;
     ret = Array(p);
@@ -414,6 +434,7 @@ numeric.dotMMsmall = function dotMMsmall(x,y) {
     }
     return ret;
 }
+
 numeric._getCol = function _getCol(A,j,x) {
     var n = A.length, i;
     for(i=n-1;i>0;--i) {
@@ -423,6 +444,7 @@ numeric._getCol = function _getCol(A,j,x) {
     }
     if(i===0) x[0] = A[0][j];
 }
+
 numeric.dotMMbig = function dotMMbig(x,y){
     var gc = numeric._getCol, p = y.length, v = Array(p);
     var m = x.length, n = y[0].length, A = new Array(m), xj;
@@ -492,6 +514,7 @@ numeric.dot = function dot(x,y) {
     }
 }
 
+// diag function
 numeric.diag = function diag(d) {
     var i,i1,j,n = d.length, A = Array(n), Ai;
     for(i=n-1;i>=0;i--) {
@@ -526,7 +549,9 @@ numeric.getDiag = function(A) {
 }
 
 numeric.identity = function identity(n) { return numeric.diag(numeric.rep([n],1)); }
-numeric.pointwise = function pointwise(params,body,setup) {
+
+numeric.pointwise = function pointwise(params,body,setup) 
+{
     if(typeof setup === "undefined") { setup = ""; }
     var fun = [];
     var k;
@@ -559,7 +584,9 @@ numeric.pointwise = function pointwise(params,body,setup) {
             );
     return Function.apply(null,fun);
 }
-numeric.pointwise2 = function pointwise2(params,body,setup) {
+
+numeric.pointwise2 = function pointwise2(params,body,setup)
+{
     if(typeof setup === "undefined") { setup = ""; }
     var fun = [];
     var k;
@@ -584,22 +611,26 @@ numeric.pointwise2 = function pointwise2(params,body,setup) {
             );
     return Function.apply(null,fun);
 }
+
 numeric._biforeach = (function _biforeach(x,y,s,k,f) {
     if(k === s.length-1) { f(x,y); return; }
     var i,n=s[k];
     for(i=n-1;i>=0;i--) { _biforeach(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
 });
+
 numeric._biforeach2 = (function _biforeach2(x,y,s,k,f) {
     if(k === s.length-1) { return f(x,y); }
     var i,n=s[k],ret = Array(n);
     for(i=n-1;i>=0;--i) { ret[i] = _biforeach2(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
     return ret;
 });
+
 numeric._foreach = (function _foreach(x,s,k,f) {
     if(k === s.length-1) { f(x); return; }
     var i,n=s[k];
     for(i=n-1;i>=0;i--) { _foreach(x[i],s,k+1,f); }
 });
+
 numeric._foreach2 = (function _foreach2(x,s,k,f) {
     if(k === s.length-1) { return f(x); }
     var i,n=s[k], ret = Array(n);
@@ -633,6 +664,7 @@ numeric.ops2 = {
         rshift: '>>',
         rrshift: '>>>'
 };
+
 numeric.opseq = {
         addeq: '+=',
         subeq: '-=',
@@ -646,16 +678,20 @@ numeric.opseq = {
         boreq: '|=',
         bxoreq: '^='
 };
+
 numeric.mathfuns = ['abs','acos','asin','atan','ceil','cos',
                     'exp','floor','log','round','sin','sqrt','tan',
                     'isNaN','isFinite'];
+
 numeric.mathfuns2 = ['atan2','pow','max','min'];
+
 numeric.ops1 = {
         neg: '-',
         not: '!',
         bnot: '~',
         clone: ''
 };
+
 numeric.mapreducers = {
         any: ['if(xi) return true;','var accum = false;'],
         all: ['if(!xi) return false;','var accum = true;'],
@@ -953,7 +989,7 @@ numeric.setBlock = function setBlock(x,from,to,B) {
     return x;
 }
 
-numeric.getRange = function getRange(A,I,J) {
+numeric.getRange = function getRange(A, I,J ) {
     var m = I.length, n = J.length;
     var i,j;
     var B = Array(m), Bi, AI;
@@ -1325,7 +1361,7 @@ numeric.T.prototype.setBlock = function setBlock(from,to,A) {
     b(x,from,to,Ax);
     if(y) b(y,from,to,numeric.rep(numeric.dim(Ax),0));
 }
-numeric.T.rep = function rep(s,v) {
+numeric.T.rep = function rep(s, v) {
     var T = numeric.T;
     if(!(v instanceof T)) v = new T(v);
     var x = v.x, y = v.y, r = numeric.rep;
@@ -1352,6 +1388,7 @@ numeric.T.prototype.getDiag = function getDiag() {
 
 // 4. Eigenvalues of real matrices
 
+// householder transform
 numeric.house = function house(x) {
     var v = numeric.clone(x);
     var s = x[0] >= 0 ? 1 : -1;
@@ -1362,6 +1399,7 @@ numeric.house = function house(x) {
     return numeric.div(v,foo);
 }
 
+// upper hessenberg 
 numeric.toUpperHessenberg = function toUpperHessenberg(me) {
     var s = numeric.dim(me);
     if(s.length !== 2 || s[0] !== s[1]) { throw new Error('numeric: toUpperHessenberg() only works on square matrices'); }
@@ -1386,9 +1424,11 @@ numeric.toUpperHessenberg = function toUpperHessenberg(me) {
     return {H:A, Q:Q};
 }
 
+// precision
 numeric.epsilon = 2.220446049250313e-16;
 
-numeric.QRFrancis = function(H,maxiter) {
+// qr 
+numeric.QRFrancis = function(H, maxiter) {
     if(typeof maxiter === "undefined") { maxiter = 10000; }
     H = numeric.clone(H);
     var H0 = numeric.clone(H);
@@ -1475,6 +1515,160 @@ numeric.QRFrancis = function(H,maxiter) {
     throw new Error('numeric: eigenvalue iteration does not converge -- increase maxiter?');
 }
 
+// extension to real hermitian (symmetric) matrices 
+numeric.eigh = function(A, maxiter) 
+{
+    return numeric.jacobi(A, maxiter)
+}
+
+numeric.jacobi = function(Ain, maxiter) 
+{
+    // jacobi method with rutishauser improvements from 
+    // Rutishauser, H. (1966). The Jacobi method for real symmetric matrices. 
+    // Numerische Mathematik, 9(1), 1–10. doi:10.1007/BF02165223
+
+    // returns object containing
+    // E: {x : v} eigenvalues.
+    // lambda : {x: d} eigenstates.
+    // niter : number of iterations.
+    // iterations : list of convergence factors for each step of the iteration.
+    // nrot : number of rotations performed.
+
+    var size = [Ain.length, Ain[0].length];
+    if (size[0] != size[1])
+    {
+        throw 'jacobi : matrix must be square';
+    }
+    // remember use only symmetric real matrices.
+    var n = size[0];
+    
+    var v = numeric.identity(n);
+    var A = numeric.clone(Ain);
+
+    var iters = numeric.rep([maxiter], 0);
+    var d = numeric.getDiag(A);
+    var bw = numeric.clone(d);
+
+    // zeros    
+    var zw = numeric.rep([n], 0);
+    
+    // iteration parameters
+    var iter = -1;
+    var niter = 0;
+    var nrot = 0;
+    var tresh = 0;
+    
+    //  prealloc
+    var h, g, gapq, term, termp, termq, theta, t, c, s, tau;
+    while (iter < maxiter)
+    {
+        iter++;
+        iters[iter] = numeric.jacobinorm(A)
+        niter = iter;
+        tresh = iters[iter]/(4 * n);
+        
+        if (tresh==0) { return {E: {x: v}, lambda: {x: d}, iterations: iters, niter: niter, nrot: nrot}; }
+        
+        for (var p = 0; p < n; p++)
+        {
+            for (var q = p + 1; q < n; q++)
+            {
+                gapq = 10*Math.abs(A[p][q]);
+                termp = gapq + Math.abs(d[p]);
+                termq = gapq + Math.abs(d[q]);
+                if (iter > 4 && termp == Math.abs(d[p]) && termq == Math.abs(d[q]))
+                {
+                    // remove small elmts
+                    A[p][q] = 0;
+                }
+                else
+                {
+                    if (Math.abs(A[p][q]) >= tresh)
+                    {
+                        // apply rotation
+                        h = d[q] - d[p];
+                        term = Math.abs(h) + gapq;
+                        if (term == Math.abs(h))
+                        {
+                            t = A[p][q]/h;
+                        }
+                        else
+                        {
+                            theta = 0.5 * h / A[p][q];
+                            t = 1/(Math.abs(theta) + Math.sqrt(1 + theta*theta));
+                            if (theta < 0)
+                            {
+                                t = -t;
+                            }
+                        }
+                        c = 1/Math.sqrt(1 + t*t);
+                        s = t * c;
+                        tau = s/(1 + c);
+                        h = t * A[p][q];
+                        zw[p] = zw[p] - h;
+                        zw[q] = zw[q] + h;
+                        d[p] = d[p] - h;
+                        d[q] = d[q] + h;
+                        A[p][q] = 0;
+                        // rotate and use upper tria only
+                        for (var j = 0; j < p; j++)
+                        {
+                            g = A[j][p];
+                            h = A[j][q];
+                            A[j][p] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        }
+                        for (var j = p + 1; j < q; j++)
+                        {
+                            g = A[p][j];
+                            h = A[j][q];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        } 
+                        for (var j = q + 1; j < n; j++)
+                        {
+                            g = A[p][j];
+                            h = A[q][j];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[q][j] = h + s * (g - h * tau);
+                        }
+                        // eigenstates
+                        for (var j = 0; j < n; j++)
+                        {
+                            g = v[j][p];
+                            h = v[j][q];
+                            v[j][p] = g - s * (h + g * tau);
+                            v[j][q] = h + s * (g - h * tau);
+                        }
+                        nrot++;
+                    }
+                }
+            }
+        }
+        bw = numeric.add(bw, zw);
+        d = numeric.clone(bw);
+        zw = numeric.rep([n], 0);
+    }
+
+    return {E: {x: v}, lambda: {x: d}, iterations: iters, niter: niter, nrot: nrot};
+}
+
+numeric.jacobinorm = function(A)
+{
+    // used in numeric.jacobi
+    var n = A.length;
+    var s = 0;
+    for (var i = 0; i < n; i ++)
+    {
+        for (var j = i + 1; j < n; j ++)
+        {
+            s = s + Math.pow(A[i][j], 2)
+        }
+    }
+    return Math.sqrt(s);
+}
+
+// eig function
 numeric.eig = function eig(A,maxiter) {
     var QH = numeric.toUpperHessenberg(A);
     var QB = numeric.QRFrancis(QH.H,maxiter);

From 71851eef81b41fa1c6456166083c2ec010a4e2fa Mon Sep 17 00:00:00 2001
From: Kim Georg Lind Pedersen 
Date: Tue, 5 Apr 2016 16:11:24 +0200
Subject: [PATCH 33/48] updated readme

---
 README.md | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 8e416e3..e7e029d 100644
--- a/README.md
+++ b/README.md
@@ -1,9 +1,10 @@
 This is a fork of Numeric Javascript by Sébastien Loisel.
 
-Notable changes when compared to 
-
-
+Notable changes comapred with numeric-1.2.6.js
 
+- numeric.jacobi(A, maxiter), that diagonalizes symmetric real matrices (real hermitian). No problems with repeated eigenvalues/symmetry.
+- numeric.eigh(A, maxiter), mirrors numeric.jacobi.
+- numeric.jacobinorm(A), helper for numeric.jacobi, computes the weight in the upper triangular part of a square matrix.
 
 ===
 

From b296df28d72edf7fc7ed8b63aa50ec4b5f447ec3 Mon Sep 17 00:00:00 2001
From: Kim Georg Lind Pedersen 
Date: Tue, 5 Apr 2016 16:12:57 +0200
Subject: [PATCH 34/48] updated readme

---
 README.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index e7e029d..4cfdfee 100644
--- a/README.md
+++ b/README.md
@@ -1,12 +1,16 @@
 This is a fork of Numeric Javascript by Sébastien Loisel.
 
+Changes
+------
+
 Notable changes comapred with numeric-1.2.6.js
 
 - numeric.jacobi(A, maxiter), that diagonalizes symmetric real matrices (real hermitian). No problems with repeated eigenvalues/symmetry.
 - numeric.eigh(A, maxiter), mirrors numeric.jacobi.
 - numeric.jacobinorm(A), helper for numeric.jacobi, computes the weight in the upper triangular part of a square matrix.
 
-===
+Introduction
+------
 
 Numeric Javascript is a javascript library for doing numerical
 analysis in the browser. Because Numeric Javascript uses only the

From f8b186b666d833a974e460ef3fc1e0a0a31b5e62 Mon Sep 17 00:00:00 2001
From: Daniel Holden 
Date: Tue, 7 Oct 2014 14:38:12 +0100
Subject: [PATCH 35/48] Added `pi` and `e` constants...

---
 src/documentation.html | 2 ++
 src/numeric.js         | 6 ++++--
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/src/documentation.html b/src/documentation.html
index e622498..30f2585 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -83,6 +83,7 @@
 
    FunctionDescription
 
    
 
    dotMatrix-Matrix, Matrix-Vector and Vector-Matrix product
+
    e2.71828182845904...
 
    eigEigenvalues and eigenvectors
 
    epsilon2.220446049250313e-16
 
    eqPointwise comparison x === y
@@ -122,6 +123,7 @@
 
    parseCSVParse a CSV file into an Array
 
    parseDatePointwise parseDate(x)
 
    parseFloatPointwise parseFloat(x)
+
    pi3.14159265358979...
 
    pointwiseCreate a pointwise function
 
    powPointwise Math.pow(x)
 
    precisionNumber of digits to prettyPrint
diff --git a/src/numeric.js b/src/numeric.js
index 5c53837..cc7f869 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -1460,6 +1460,8 @@ numeric.toUpperHessenberg = function toUpperHessenberg(me) {
 
 // precision
 numeric.epsilon = 2.220446049250313e-16;
+numeric.pi = 3.141592653589793238462643383279502884197169399375105820;
+numeric.e = 2.71828182845904523536028747135266249775724709369995;
 
 // qr 
 numeric.QRFrancis = function(H, maxiter) {
@@ -2963,7 +2965,7 @@ numeric.T.prototype.fft = function fft() {
     var n = x.length, log = Math.log, log2 = log(2),
         p = Math.ceil(log(2*n-1)/log2), m = Math.pow(2,p);
     var cx = numeric.rep([m],0), cy = numeric.rep([m],0), cos = Math.cos, sin = Math.sin;
-    var k, c = (-3.141592653589793238462643383279502884197169399375105820/n),t;
+    var k, c = (-numeric.pi/n),t;
     var a = numeric.rep([m],0), b = numeric.rep([m],0),nhalf = Math.floor(n/2);
     for(k=0;k
Date: Fri, 10 Oct 2014 13:25:14 +0100
Subject: [PATCH 36/48] Fixed bugs in CSV parsing/writing

---
 src/numeric.js | 29 +++++++++++++++--------------
 1 file changed, 15 insertions(+), 14 deletions(-)

diff --git a/src/numeric.js b/src/numeric.js
index cc7f869..7b63351 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -135,26 +135,27 @@ numeric.parseCSV = function parseCSV(t) {
     var stripper = function(n) { return n.substr(0,n.length-1); };
     var count = 0;
     for(k=0;k0) {
-          ret[count] = [];
-          for(j=0;j0) {
+            ret[count] = [];
+            for(j=0;j
Date: Sat, 10 Sep 2016 00:23:29 +0200
Subject: [PATCH 37/48] Removed debug output from csv parser.

---
 src/numeric.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/numeric.js b/src/numeric.js
index 7b63351..81bf2db 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -145,7 +145,7 @@ numeric.parseCSV = function parseCSV(t) {
                     ret[count][j] = parseFloat(baz);
                 }
                 else { ret[count][j] = baz; }
-                if (isNaN(ret[count][j])) { console.log('Warning: "'+baz+'"'); }
+                //if (isNaN(ret[count][j])) { console.log('Warning: "'+baz+'"'); }
             }
             count++;
         }

From f772921e71f41e7679d7a9b6e812c4a992729814 Mon Sep 17 00:00:00 2001
From: Daniel Holden 
Date: Mon, 20 Oct 2014 14:16:45 +0100
Subject: [PATCH 38/48] Added roll flip and kron functions

# Conflicts:
#	documentation.html
#	src/documentation.html
#	src/numeric.js
---
 src/documentation.html | 32 ++++++++++++++++++++++++
 src/numeric.js         | 55 ++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 87 insertions(+)

diff --git a/src/documentation.html b/src/documentation.html
index 30f2585..bfa330e 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -88,6 +88,9 @@
 
    epsilon2.220446049250313e-16
 
    eqPointwise comparison x === y
 
    expPointwise Math.exp(x)
+
    flipFlip an Array on a given axis
+
    fliplrFlip an Array on the innermost axis
+
    flipudFlip an Array on the second innermost axis
 
    floorPoinwise Math.floor(x)
 
    geqPointwise x>=y
 
    getBlockExtract a block from a matrix
@@ -98,6 +101,7 @@
 
    invMatrix inverse
 
    isFinitePointwise isFinite(x)
 
    isNaNPointwise isNaN(x)
+
    kronKronecker product of two matrices
 
    largeArrayDon't prettyPrint Arrays larger than this
 
    leqPointwise x<=y
 
    linspaceGenerate evenly spaced values
@@ -135,6 +139,8 @@
 
    
 
    FunctionDescription
 
    
+
    rollRoll an Array on a given axis
+
    rot90Rotate an Array 90 degrees counter clockwise
 
    roundPointwise Math.round(x)
 
    rrshiftPointwise x>>>y
 
    rrshifteqPointwise x>>>=y
@@ -378,6 +384,23 @@ 
    Utility functions
    
       [0,0,3]]
 
 
+Arrays can be reversed using numeric.flip(), rotated using numeric.rot90(), and rolled using numeric.roll().
+
+
    +IN> numeric.flip([1,2,3,4])
+OUT> [4,3,2,1]
+IN> numeric.flip([[1,2],[3,4]], 0)
+OUT> [[3,4],[1,2]]
+IN> numeric.flip([[1,2],[3,4]], 1)
+OUT> [[2,1],[4,3]]
+IN> numeric.rot90([[1,2],[3,4]])
+OUT> [[2,4],[1,3]]
+IN> numeric.roll([1,2,3,4], 2)
+OUT> [3,4,1,2]
+IN> numeric.roll([[1,2],[3,4],[5,6]], 1, 0)
+OUT> [[5,6],[1,2],[3,4]]
+
    
+
 The function numeric.identity() returns the identity matrix.
 
     IN> numeric.identity(3)
@@ -589,6 +612,15 @@ 
    Linear algebra
    
       [12]]
 
    
 
+Kronecker product:
+
    +IN> numeric.kron([[1,0],[0,1]],[[1,2],[3,4]])
+OUT> [[1,2,0,0],
+      [3,4,0,0],
+      [0,0,1,2],
+      [0,0,3,4]]
+
    
+      
 You can compute the 2-norm of an Array, which is the square root of the sum of the squares of the entries.
 
     IN> numeric.norm2([1,2])
diff --git a/src/numeric.js b/src/numeric.js
index 81bf2db..d98a067 100644
--- a/src/numeric.js
+++ b/src/numeric.js
@@ -522,6 +522,61 @@ numeric.dot = function dot(x,y) {
 };
 
 // diag function
+
+numeric.roll = function roll(x, r, a, s, k) {
+    if(typeof r === 'undefined') { r=1; }
+    if(typeof a === 'undefined') { a=-1; }
+    if(typeof s === 'undefined') { s=numeric.dim(x); }
+    if(typeof k === 'undefined') { k=0; }
+    if(a < 0) { a=s.length+a; }
+    if(k === a) { return x.slice(s[k]-r).concat(x.slice(0,s[k]-r)); }
+    var i,n=s[k],z=Array(n);
+    for(i=0;i=0;i--) {

From ffc0cc65aa08649ff9c1f6057e309a0b58df4eda Mon Sep 17 00:00:00 2001
From: Daniel Holden 
Date: Mon, 20 Oct 2014 17:09:07 +0100
Subject: [PATCH 39/48] Added `zeros`, `ones`, `range` and `empty` functions.
 Updated the `logspace` and `norm2` functions.

---
 src/documentation.html | 39 ++++++++++++++++++++++++++++++++++++---
 src/numeric.js         | 31 ++++++++++++++++++++++++++-----
 tools/deploy/clean.sh  |  2 +-
 3 files changed, 63 insertions(+), 9 deletions(-)

diff --git a/src/documentation.html b/src/documentation.html
index bfa330e..70bb05d 100644
--- a/src/documentation.html
+++ b/src/documentation.html
@@ -85,6 +85,7 @@
 
    dotMatrix-Matrix, Matrix-Vector and Vector-Matrix product
 
    e2.71828182845904...
 
    eigEigenvalues and eigenvectors
+
    emptyCreate an empty Array
 
    epsilon2.220446049250313e-16
 
    eqPointwise comparison x === y
 
    expPointwise Math.exp(x)
@@ -118,10 +119,11 @@
 
    mulPointwise x*y
 
    negPointwise -x
 
    neqPointwise x!==y
-
    norm2Square root of the sum of the square of the entries of x
+
    norm2Square root of the sum of the squares of an Array
 
    norm2SquaredSum of squares of entries of x
 
    norminfLargest modulus entry of x
 
    notPointwise logical negation !x
+
    onesCreate an Array of ones
 
    orPointwise logical or x||y
 
    oreqPointwise x|=y
 
    parseCSVParse a CSV file into an Array
@@ -129,10 +131,11 @@
 
    parseFloatPointwise parseFloat(x)
 
    pi3.14159265358979...
 
    pointwiseCreate a pointwise function
-
    powPointwise Math.pow(x)
+
    powPointwise Math.pow(x,y)
 
    precisionNumber of digits to prettyPrint
 
    prettyPrintPretty-prints x
 
    randomCreate an Array of random numbers
+
    rangeCreate an Array from a range
 
    repCreate an Array by duplicating values
 
    
     		
@@ -183,6 +186,7 @@
 
    versionVersion string for the numeric library
 
    xorPointwise x^y
 
    xoreqPointwise x^=y
+
    zerosCreate an Array of zeros
 
    
 
 
    
@@ -347,6 +351,19 @@ 
    Utility functions
    
       [0,0,0]]
 
    
 
+You can create a multidimensional Array of zeros or ones using the functions numeric.zeros() and 
+numeric.ones(), and empty Arrays using numeric.empty().
+
+
    +IN> numeric.zeros([2,2])
+OUT> [[0,0],
+      [0,0]]
+IN> numeric.ones([5,1])
+OUT> [[1],[1],[1],[1],[1]]
+IN> numeric.empty([2,3])
+OUT> [[,,],[,,]]
+
    
+
 You can loop over Arrays as you normally would. However, in order to quickly generate optimized
 loops, the numeric library provides a few efficient loop-generation mechanisms. For example, the
 numeric.mapreduce() function can be used to make a function that computes the sum of all the
@@ -377,6 +394,7 @@ 
    Utility functions
    
 
    
 
 You can create a diagonal matrix using numeric.diag()
+
 
     IN> numeric.diag([1,2,3])
 OUT> [[1,0,0],
@@ -425,11 +443,26 @@ 
    Utility functions
    
 OUT> [1,1.5,2,2.5,3]
 
    
 
-Or a vector of logarithmically spaced values between Math.pow(10,a) and Math.pow(10,b):
+Or a vector of logarithmically spaced values between Math.pow(exp,a) and Math.pow(exp,b), where the default exp exponent is 10:
 
 
     IN> numeric.logspace(0,1,5);
 OUT> [1, 1.7782794100389228, 3.1622776601683795, 5.623413251903491, 10]
+IN> numeric.logspace(1,3,5,10);
+OUT> [10,31.62,1e2,316.2,1e3]
+
    
+
+Or via some range specifier:
+
+
    +IN> numeric.range(7);
+OUT> [0,1,2,3,4,5,6]
+IN> numeric.range(0, 5);
+OUT> [0,1,2,3,4]
+IN> numeric.range(1, 3);
+OUT> [1,2]
+IN> numeric.range(-1, 6, 2);
+OUT> [-1, 1, 3, 5]
 
    
 
 
+
+-->
 
 
 
+-->
 
 
 
-
+
+-->
+
 
 
+//
+//   Math.seedrandom('yipee'); Sets Math.random to a function that is
+//                             initialized using the given explicit seed.
+//
+//   Math.seedrandom();        Sets Math.random to a function that is
+//                             seeded using the current time, dom state,
+//                             and other accumulated local entropy.
+//                             The generated seed string is returned.
+//
+//   Math.seedrandom('yowza', true);
+//                             Seeds using the given explicit seed mixed
+//                             together with accumulated entropy.
+//
+//   
+//                             Seeds using physical random bits downloaded
+//                             from random.org.
+//
+//                    Seeds using urandom bits from call.jsonlib.com,
+//                             which is faster than random.org.
+//
+// Examples:
+//
+//   Math.seedrandom("hello");            // Use "hello" as the seed.
+//   document.write(Math.random());       // Always 0.5463663768140734
+//   document.write(Math.random());       // Always 0.43973793770592234
+//   var rng1 = Math.random;              // Remember the current prng.
+//
+//   var autoseed = Math.seedrandom();    // New prng with an automatic seed.
+//   document.write(Math.random());       // Pretty much unpredictable.
+//
+//   Math.random = rng1;                  // Continue "hello" prng sequence.
+//   document.write(Math.random());       // Always 0.554769432473455
+//
+//   Math.seedrandom(autoseed);           // Restart at the previous seed.
+//   document.write(Math.random());       // Repeat the 'unpredictable' value.
+//
+// Notes:
+//
+// Each time seedrandom('arg') is called, entropy from the passed seed
+// is accumulated in a pool to help generate future seeds for the
+// zero-argument form of Math.seedrandom, so entropy can be injected over
+// time by calling seedrandom with explicit data repeatedly.
+//
+// On speed - This javascript implementation of Math.random() is about
+// 3-10x slower than the built-in Math.random() because it is not native
+// code, but this is typically fast enough anyway.  Seeding is more expensive,
+// especially if you use auto-seeding.  Some details (timings on Chrome 4):
+//
+// Our Math.random()            - avg less than 0.002 milliseconds per call
+// seedrandom('explicit')       - avg less than 0.5 milliseconds per call
+// seedrandom('explicit', true) - avg less than 2 milliseconds per call
+// seedrandom()                 - avg about 38 milliseconds per call
+//
+// LICENSE (BSD):
+//
+// Copyright 2010 David Bau, all rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+//
+//   1. Redistributions of source code must retain the above copyright
+//      notice, this list of conditions and the following disclaimer.
+//
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+//
+//   3. Neither the name of this module nor the names of its contributors may
+//      be used to endorse or promote products derived from this software
+//      without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+/**
+ * All code is in an anonymous closure to keep the global namespace clean.
+ *
+ * @param {number=} overflow
+ * @param {number=} startdenom
+ */
+
+// Patched by Seb so that seedrandom.js does not pollute the Math object.
+// My tests suggest that doing Math.trouble = 1 makes Math lookups about 5%
+// slower.
+numeric.seedrandom = { pow:Math.pow, random:Math.random };
+
+(function (pool, math, width, chunks, significance, overflow, startdenom) {
+
+
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+math['seedrandom'] = function seedrandom(seed, use_entropy) {
+  var key = [];
+  var arc4;
+
+  // Flatten the seed string or build one from local entropy if needed.
+  seed = mixkey(flatten(
+    use_entropy ? [seed, pool] :
+    arguments.length ? seed :
+    [new Date().getTime(), pool, window], 3), key);
+
+  // Use the seed to initialize an ARC4 generator.
+  arc4 = new ARC4(key);
+
+  // Mix the randomness into accumulated entropy.
+  mixkey(arc4.S, pool);
+
+  // Override Math.random
+
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+
+  math['random'] = function random() {  // Closure to return a random double:
+    var n = arc4.g(chunks);             // Start with a numerator n < 2 ^ 48
+    var d = startdenom;                 //   and denominator d = 2 ^ 48.
+    var x = 0;                          //   and no 'extra last byte'.
+    while (n < significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n >= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x >>>= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+
+  // Return the seed that was used
+  return seed;
+};
+
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 <= x < (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 <= x < (width ^ count).
+//
+/** @constructor */
+function ARC4(key) {
+  var t, u, me = this, keylen = key.length;
+  var i = 0, j = me.i = me.j = me.m = 0;
+  me.S = [];
+  me.c = [];
+
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+
+  // Set up S using the standard key scheduling algorithm.
+  while (i < width) { me.S[i] = i++; }
+  for (i = 0; i < width; i++) {
+    t = me.S[i];
+    j = lowbits(j + t + key[i % keylen]);
+    u = me.S[j];
+    me.S[i] = u;
+    me.S[j] = t;
+  }
+
+  // The "g" method returns the next (count) outputs as one number.
+  me.g = function getnext(count) {
+    var s = me.S;
+    var i = lowbits(me.i + 1); var t = s[i];
+    var j = lowbits(me.j + t); var u = s[j];
+    s[i] = u;
+    s[j] = t;
+    var r = s[lowbits(t + u)];
+    while (--count) {
+      i = lowbits(i + 1); t = s[i];
+      j = lowbits(j + t); u = s[j];
+      s[i] = u;
+      s[j] = t;
+      r = r * width + s[lowbits(t + u)];
+    }
+    me.i = i;
+    me.j = j;
+    return r;
+  };
+  // For robust unpredictability discard an initial batch of values.
+  // See http://www.rsa.com/rsalabs/node.asp?id=2009
+  me.g(width);
+}
+
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+/** @param {Object=} result
+  * @param {string=} prop
+  * @param {string=} typ */
+function flatten(obj, depth, result, prop, typ) {
+  result = [];
+  typ = typeof(obj);
+  if (depth && typ == 'object') {
+    for (prop in obj) {
+      if (prop.indexOf('S') < 5) {    // Avoid FF3 bug (local/sessionStorage)
+        try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+      }
+    }
+  }
+  return (result.length ? result : obj + (typ != 'string' ? '\0' : ''));
+}
+
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+/** @param {number=} smear
+  * @param {number=} j */
+function mixkey(seed, key, smear, j) {
+  seed += '';                         // Ensure the seed is a string
+  smear = 0;
+  for (j = 0; j < seed.length; j++) {
+    key[lowbits(j)] =
+      lowbits((smear ^= key[lowbits(j)] * 19) + seed.charCodeAt(j));
+  }
+  seed = '';
+  for (j in key) { seed += String.fromCharCode(key[j]); }
+  return seed;
+}
+
+//
+// lowbits()
+// A quick "n mod width" for width a power of 2.
+//
+function lowbits(n) { return n & (width - 1); }
+
+//
+// The following constants are related to IEEE 754 limits.
+//
+startdenom = math.pow(width, chunks);
+significance = math.pow(2, significance);
+overflow = significance * 2;
+
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to intefere with determinstic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+
+// End anonymous scope, and pass initial values.
+}(
+  [],   // pool: entropy pool starts empty
+  numeric.seedrandom, // math: package containing random, pow, and seedrandom
+  256,  // width: each RC4 output is 0 <= x < 256
+  6,    // chunks: at least six RC4 outputs for each double
+  52    // significance: there are 52 significant digits in a double
+  ));
+/* This file is a slightly modified version of quadprog.js from Alberto Santini.
+ * It has been slightly modified by Sébastien Loisel to make sure that it handles
+ * 0-based Arrays instead of 1-based Arrays.
+ * License is in resources/LICENSE.quadprog */
+
+function base0to1(A) {
+    if(typeof A !== "object") { return A; }
+    var ret = [], i,n=A.length;
+    for(i=0;i meq) {
+                work[l] = sum;
+            } else {
+                work[l] = -Math.abs(sum);
+                if (sum > 0) {
+                    for (j = 1; j <= n; j = j + 1) {
+                        amat[j][i] = -amat[j][i];
+                    }
+                    bvec[i] = -bvec[i];
+                }
+            }
+        }
+
+        for (i = 1; i <= nact; i = i + 1) {
+            work[iwsv + iact[i]] = 0;
+        }
+
+        nvl = 0;
+        temp = 0;
+        for (i = 1; i <= q; i = i + 1) {
+            if (work[iwsv + i] < temp * work[iwnbv + i]) {
+                nvl = i;
+                temp = work[iwsv + i] / work[iwnbv + i];
+            }
+        }
+        if (nvl === 0) {
+            return 999;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_55() {
+        for (i = 1; i <= n; i = i + 1) {
+            sum = 0;
+            for (j = 1; j <= n; j = j + 1) {
+                sum = sum + dmat[j][i] * amat[j][nvl];
+            }
+            work[i] = sum;
+        }
+
+        l1 = iwzv;
+        for (i = 1; i <= n; i = i + 1) {
+            work[l1 + i] = 0;
+        }
+        for (j = nact + 1; j <= n; j = j + 1) {
+            for (i = 1; i <= n; i = i + 1) {
+                work[l1 + i] = work[l1 + i] + dmat[i][j] * work[j];
+            }
+        }
+
+        t1inf = true;
+        for (i = nact; i >= 1; i = i - 1) {
+            sum = work[i];
+            l = iwrm + (i * (i + 3)) / 2;
+            l1 = l - i;
+            for (j = i + 1; j <= nact; j = j + 1) {
+                sum = sum - work[l] * work[iwrv + j];
+                l = l + j;
+            }
+            sum = sum / work[l1];
+            work[iwrv + i] = sum;
+            if (iact[i] < meq) {
+                // continue;
+                break;
+            }
+            if (sum < 0) {
+                // continue;
+                break;
+            }
+            t1inf = false;
+            it1 = i;
+        }
+
+        if (!t1inf) {
+            t1 = work[iwuv + it1] / work[iwrv + it1];
+            for (i = 1; i <= nact; i = i + 1) {
+                if (iact[i] < meq) {
+                    // continue;
+                    break;
+                }
+                if (work[iwrv + i] < 0) {
+                    // continue;
+                    break;
+                }
+                temp = work[iwuv + i] / work[iwrv + i];
+                if (temp < t1) {
+                    t1 = temp;
+                    it1 = i;
+                }
+            }
+        }
+
+        sum = 0;
+        for (i = iwzv + 1; i <= iwzv + n; i = i + 1) {
+            sum = sum + work[i] * work[i];
+        }
+        if (Math.abs(sum) <= vsmall) {
+            if (t1inf) {
+                ierr[1] = 1;
+                // GOTO 999
+                return 999;
+            } else {
+                for (i = 1; i <= nact; i = i + 1) {
+                    work[iwuv + i] = work[iwuv + i] - t1 * work[iwrv + i];
+                }
+                work[iwuv + nact + 1] = work[iwuv + nact + 1] + t1;
+                // GOTO 700
+                return 700;
+            }
+        } else {
+            sum = 0;
+            for (i = 1; i <= n; i = i + 1) {
+                sum = sum + work[iwzv + i] * amat[i][nvl];
+            }
+            tt = -work[iwsv + nvl] / sum;
+            t2min = true;
+            if (!t1inf) {
+                if (t1 < tt) {
+                    tt = t1;
+                    t2min = false;
+                }
+            }
+
+            for (i = 1; i <= n; i = i + 1) {
+                sol[i] = sol[i] + tt * work[iwzv + i];
+                if (Math.abs(sol[i]) < vsmall) {
+                    sol[i] = 0;
+                }
+            }
+
+            crval[1] = crval[1] + tt * sum * (tt / 2 + work[iwuv + nact + 1]);
+            for (i = 1; i <= nact; i = i + 1) {
+                work[iwuv + i] = work[iwuv + i] - tt * work[iwrv + i];
+            }
+            work[iwuv + nact + 1] = work[iwuv + nact + 1] + tt;
+
+            if (t2min) {
+                nact = nact + 1;
+                iact[nact] = nvl;
+
+                l = iwrm + ((nact - 1) * nact) / 2 + 1;
+                for (i = 1; i <= nact - 1; i = i + 1) {
+                    work[l] = work[i];
+                    l = l + 1;
+                }
+
+                if (nact === n) {
+                    work[l] = work[n];
+                } else {
+                    for (i = n; i >= nact + 1; i = i - 1) {
+                        if (work[i] === 0) {
+                            // continue;
+                            break;
+                        }
+                        gc = Math.max(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        gs = Math.min(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        if (work[i - 1] >= 0) {
+                            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        } else {
+                            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        }
+                        gc = work[i - 1] / temp;
+                        gs = work[i] / temp;
+
+                        if (gc === 1) {
+                            // continue;
+                            break;
+                        }
+                        if (gc === 0) {
+                            work[i - 1] = gs * temp;
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = dmat[j][i - 1];
+                                dmat[j][i - 1] = dmat[j][i];
+                                dmat[j][i] = temp;
+                            }
+                        } else {
+                            work[i - 1] = temp;
+                            nu = gs / (1 + gc);
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = gc * dmat[j][i - 1] + gs * dmat[j][i];
+                                dmat[j][i] = nu * (dmat[j][i - 1] + temp) - dmat[j][i];
+                                dmat[j][i - 1] = temp;
+
+                            }
+                        }
+                    }
+                    work[l] = work[nact];
+                }
+            } else {
+                sum = -bvec[nvl];
+                for (j = 1; j <= n; j = j + 1) {
+                    sum = sum + sol[j] * amat[j][nvl];
+                }
+                if (nvl > meq) {
+                    work[iwsv + nvl] = sum;
+                } else {
+                    work[iwsv + nvl] = -Math.abs(sum);
+                    if (sum > 0) {
+                        for (j = 1; j <= n; j = j + 1) {
+                            amat[j][nvl] = -amat[j][nvl];
+                        }
+                        bvec[nvl] = -bvec[nvl];
+                    }
+                }
+                // GOTO 700
+                return 700;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_797() {
+        l = iwrm + (it1 * (it1 + 1)) / 2 + 1;
+        l1 = l + it1;
+        if (work[l1] === 0) {
+            // GOTO 798
+            return 798;
+        }
+        gc = Math.max(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        gs = Math.min(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        if (work[l1 - 1] >= 0) {
+            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        } else {
+            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        }
+        gc = work[l1 - 1] / temp;
+        gs = work[l1] / temp;
+
+        if (gc === 1) {
+            // GOTO 798
+            return 798;
+        }
+        if (gc === 0) {
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = work[l1 - 1];
+                work[l1 - 1] = work[l1];
+                work[l1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = dmat[i][it1];
+                dmat[i][it1] = dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = temp;
+            }
+        } else {
+            nu = gs / (1 + gc);
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = gc * work[l1 - 1] + gs * work[l1];
+                work[l1] = nu * (work[l1 - 1] + temp) - work[l1];
+                work[l1 - 1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = gc * dmat[i][it1] + gs * dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = nu * (dmat[i][it1] + temp) - dmat[i][it1 + 1];
+                dmat[i][it1] = temp;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_798() {
+        l1 = l - it1;
+        for (i = 1; i <= it1; i = i + 1) {
+            work[l1] = work[l];
+            l = l + 1;
+            l1 = l1 + 1;
+        }
+
+        work[iwuv + it1] = work[iwuv + it1 + 1];
+        iact[it1] = iact[it1 + 1];
+        it1 = it1 + 1;
+        if (it1 < nact) {
+            // GOTO 797
+            return 797;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_799() {
+        work[iwuv + nact] = work[iwuv + nact + 1];
+        work[iwuv + nact + 1] = 0;
+        iact[nact] = 0;
+        nact = nact - 1;
+        iter[2] = iter[2] + 1;
+
+        return 0;
+    }
+
+    go = 0;
+    while (true) {
+        go = fn_goto_50();
+        if (go === 999) {
+            return;
+        }
+        while (true) {
+            go = fn_goto_55();
+            if (go === 0) {
+                break;
+            }
+            if (go === 999) {
+                return;
+            }
+            if (go === 700) {
+                if (it1 === nact) {
+                    fn_goto_799();
+                } else {
+                    while (true) {
+                        fn_goto_797();
+                        go = fn_goto_798();
+                        if (go !== 797) {
+                            break;
+                        }
+                    }
+                    fn_goto_799();
+                }
+            }
+        }
+    }
+
+}
+
+function solveQP(Dmat, dvec, Amat, bvec, meq, factorized) {
+    Dmat = base0to1(Dmat);
+    dvec = base0to1(dvec);
+    Amat = base0to1(Amat);
+    var i, n, q,
+        nact, r,
+        crval = [], iact = [], sol = [], work = [], iter = [],
+        message;
+
+    meq = meq || 0;
+    factorized = factorized ? base0to1(factorized) : [undefined, 0];
+    bvec = bvec ? base0to1(bvec) : [];
+
+    // In Fortran the array index starts from 1
+    n = Dmat.length - 1;
+    q = Amat[1].length - 1;
+
+    if (!bvec) {
+        for (i = 1; i <= q; i = i + 1) {
+            bvec[i] = 0;
+        }
+    }
+    for (i = 1; i <= q; i = i + 1) {
+        iact[i] = 0;
+    }
+    nact = 0;
+    r = Math.min(n, q);
+    for (i = 1; i <= n; i = i + 1) {
+        sol[i] = 0;
+    }
+    crval[1] = 0;
+    for (i = 1; i <= (2 * n + (r * (r + 5)) / 2 + 2 * q + 1); i = i + 1) {
+        work[i] = 0;
+    }
+    for (i = 1; i <= 2; i = i + 1) {
+        iter[i] = 0;
+    }
+
+    qpgen2(Dmat, dvec, n, n, sol, crval, Amat,
+        bvec, n, q, meq, iact, nact, iter, work, factorized);
+
+    message = "";
+    if (factorized[1] === 1) {
+        message = "constraints are inconsistent, no solution!";
+    }
+    if (factorized[1] === 2) {
+        message = "matrix D in quadratic function is not positive definite!";
+    }
+
+    return {
+        solution: base1to0(sol),
+        value: base1to0(crval),
+        unconstrained_solution: base1to0(dvec),
+        iterations: base1to0(iter),
+        iact: base1to0(iact),
+        message: message
+    };
+}
+
+numeric.solveQP = solveQP;
+/*
+Shanti Rao sent me this routine by private email. I had to modify it
+slightly to work on Arrays instead of using a Matrix object.
+It is apparently translated from http://stitchpanorama.sourceforge.net/Python/svd.py
+*/
+
+numeric.svd= function svd(A) {
+    var temp;
+//Compute the thin SVD from G. H. Golub and C. Reinsch, Numer. Math. 14, 403-420 (1970)
+    var prec= numeric.epsilon; //Math.pow(2,-52) // assumes double prec
+    var tolerance= 1.e-64/prec;
+    var itmax= 50;
+    var c=0;
+    var i=0;
+    var j=0;
+    var k=0;
+    var l=0;
+
+    var u= numeric.clone(A);
+    var m= u.length;
+
+    var n= u[0].length;
+
+    if (m < n) throw "Need more rows than columns";
+
+    var e = new Array(n);
+    var q = new Array(n);
+    for (i=0; i b)
+            return a*Math.sqrt(1.0+(b*b/a/a));
+        else if (b == 0.0)
+            return a;
+        return b*Math.sqrt(1.0+(a*a/b/b));
+    }
+
+    //Householder's reduction to bidiagonal form
+
+    var f= 0.0;
+    var g= 0.0;
+    var h= 0.0;
+    var x= 0.0;
+    var y= 0.0;
+    var z= 0.0;
+    var s= 0.0;
+
+    for (i=0; i < n; i++)
+    {
+        e[i]= g;
+        s= 0.0;
+        l= i+1;
+        for (j=i; j < m; j++)
+            s += (u[j][i]*u[j][i]);
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g-s;
+            u[i][i]=f-g;
+            for (j=l; j < n; j++)
+            {
+                s= 0.0;
+                for (k=i; k < m; k++)
+                    s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++)
+                    u[k][j]+=f*u[k][i];
+            }
+        }
+        q[i]= g;
+        s= 0.0;
+        for (j=l; j < n; j++)
+            s= s + u[i][j]*u[i][j];
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i+1];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g - s;
+            u[i][i+1] = f-g;
+            for (j=l; j < n; j++) e[j]= u[i][j]/h;
+            for (j=l; j < m; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += (u[j][k]*u[i][k]);
+                for (k=l; k < n; k++)
+                    u[j][k]+=s*e[k];
+            }
+        }
+        y= Math.abs(q[i])+Math.abs(e[i]);
+        if (y>x)
+            x=y;
+    }
+
+    // accumulation of right hand gtransformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        if (g != 0.0)
+        {
+            h= g*u[i][i+1];
+            for (j=l; j < n; j++)
+                v[j][i]=u[i][j]/h;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += u[i][k]*v[k][j];
+                for (k=l; k < n; k++)
+                    v[k][j]+=(s*v[k][i]);
+            }
+        }
+        for (j=l; j < n; j++)
+        {
+            v[i][j] = 0;
+            v[j][i] = 0;
+        }
+        v[i][i] = 1;
+        g= e[i];
+        l= i;
+    }
+
+    // accumulation of left hand transformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        l= i+1;
+        g= q[i];
+        for (j=l; j < n; j++)
+            u[i][j] = 0;
+        if (g != 0.0)
+        {
+            h= u[i][i]*g;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < m; k++) s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
+            }
+            for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
+        }
+        else
+            for (j=i; j < m; j++) u[j][i] = 0;
+        u[i][i] += 1;
+    }
+
+    // diagonalization of the bidiagonal form
+    prec= prec*x;
+    for (k=n-1; k != -1; k+= -1)
+    {
+        for (var iteration=0; iteration < itmax; iteration++)
+        {   // test f splitting
+            var test_convergence = false;
+            for (l=k; l != -1; l+= -1)
+            {
+                if (Math.abs(e[l]) <= prec)
+                {   test_convergence= true;
+                    break;
+                }
+                if (Math.abs(q[l-1]) <= prec)
+                    break;
+            }
+            if (!test_convergence)
+            {   // cancellation of e[l] if l>0
+                c= 0.0;
+                s= 1.0;
+                var l1= l-1;
+                for (i =l; i= itmax-1)
+				throw 'Error: no convergence.';
+            // shift from bottom 2x2 minor
+			x= q[l];
+			y= q[k-1];
+			g= e[k-1];
+			h= e[k];
+			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y);
+			g= pythag(f,1.0);
+            if (f < 0.0)
+				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x;
+            else
+				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x;
+            // next QR transformation
+			c= 1.0;
+			s= 1.0;
+            for (i=l+1; i< k+1; i++)
+            {
+				g= e[i];
+				y= q[i];
+				h= s*g;
+				g= c*g;
+				z= pythag(f,h);
+				e[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= x*c+g*s;
+				g= -x*s+g*c;
+				h= y*s;
+				y= y*c;
+                for (j=0; j < n; j++)
+                {
+					x= v[j][i-1];
+					z= v[j][i];
+					v[j][i-1] = x*c+z*s;
+					v[j][i] = -x*s+z*c;
+                }
+				z= pythag(f,h);
+				q[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= c*g+s*y;
+				x= -s*g+c*y;
+                for (j=0; j < m; j++)
+                {
+					y= u[j][i-1];
+					z= u[j][i];
+					u[j][i-1] = y*c+z*s;
+					u[j][i] = -y*s+z*c;
+                }
+            }
+			e[l]= 0.0;
+			e[k]= f;
+			q[k]= x;
+        }
+    }
+
+    //vt= transpose(v)
+    //return (u,q,vt)
+    for (i=0;i= 0; j--)
+     {
+      if (q[j] < q[i])
+      {
+    //  writeln(i,'-',j)
+	   c = q[j];
+	   q[j] = q[i];
+	   q[i] = c;
+       for(k=0;k phi0 && t > epsilon) {
+                var theta = phi1 / phi0;
+                var u = (Math.sqrt(1.0 + 6.0 * theta) - 1.0) / (3.0 * theta);
+                t *= u;
+            }
+            else {
+                this.copyVariables(x, x_new);
+                break;
+            }
+        }
+    }
+
+    // add -dx to x to get the new variables
+    //
+    this.getNewVariableValue = function (x, dx, t) {
+        var x_new = new Array(x.length);
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x_new[i] = x[i] - t*dx[i];
+        }
+        
+        return x_new;
+    }
+
+    // copy x_new to x
+    //
+    this.copyVariables = function (x, x_new) {
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x[i] = x_new[i]
+        }
+    }
+
+    // evaluate the function value's residual
+    //
+    this.evaluate_residual = function (funcsVal) {
+        var i;
+        var residual = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            residual += Math.abs(funcsVal[i]);
+        }
+        return residual;
+    }
+
+    // evaluate the Euclidean_norm_of_residual
+    //
+    this.evaluate_Euclidean_norm_of_residual  = function (funcsVal) {
+        var i;
+        var residual2 = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            var fabs = Math.abs(funcsVal[i]);
+            residual2 += fabs*fabs;
+        }
+        return Math.sqrt(residual2);
+    }
+    
+    // main function start here
+    //    
+    var residual_tol = 1e-7;
+    var max_iteration = 1000;
+    var epsilon = 2.22e-16;
+    var JS_GSL_SUCCESS = 0;
+    var JS_GSL_CONTINUE = 1;
+
+    // evaluate none linear system of equations and its jacobian matrix
+    //
+    var funcs = F(x);
+    var jacobian = A(x);
+
+    // iterate to get the solution
+    //
+    var iter = 0;
+    var status;
+    do {
+        iter++;
+
+        this.newton_iterate(F, A, x);
+
+        if (this.evaluate_residual(F(x)) < residual_tol)
+            status = JS_GSL_SUCCESS;
+        else
+            status = JS_GSL_CONTINUE;
+        
+    } while (status == JS_GSL_CONTINUE && iter < max_iteration)
+
+}
+
+/* unit test
+
+Rosenbrock Function 
+
+  double y0 = 1 - x0;
+  double y1 = 10 * (x1 - x0 * x0);
+
+  x0 = -1.2
+  x1 = 1.0
+
+*/
+
+
+/**
+ * Searches the interval from lowerLimit to upperLimit
+ * for a root (i.e., zero) of the function func with respect to
+ * its first argument using Brent's method root-finding algorithm.
+ *
+ * @param {function} function for which the root is sought.
+ * @param {number} the lower point of the interval to be searched.
+ * @param {number} the upper point of the interval to be searched.
+ * @param {number} the desired accuracy (convergence tolerance).
+ * @param {number} the maximum number of iterations.
+ * @returns an estimate for the root within accuracy.
+ */
+// Translated from zeroin.c in http://www.netlib.org/c/brent.shar.
+numeric.uniroot = function uniroot(func, lowerLimit, upperLimit, errorTol, maxIter) {
+  var a = lowerLimit
+    , b = upperLimit
+    , c = a
+    , fa = func(a)
+    , fb = func(b)
+    , fc = fa
+    , s = 0
+    , fs = 0
+    , tol_act   // Actual tolerance
+    , new_step  // Step at this iteration
+    , prev_step // Distance from the last but one to the last approximation
+    , p         // Interpolation step is calculated in the form p/q; division is delayed until the last moment
+    , q
+    ;
+
+  errorTol = errorTol || 0;
+  maxIter  = maxIter  || 1000;
+
+  while ( maxIter-- > 0 ) {
+
+    prev_step = b - a;
+
+    if ( Math.abs(fc) < Math.abs(fb) ) {
+      // Swap data for b to be the best approximation
+      a = b, b = c, c = a;
+      fa = fb, fb = fc, fc = fa;
+    }
+
+    tol_act = 1e-15 * Math.abs(b) + errorTol / 2;
+    new_step = ( c - b ) / 2;
+
+    if ( Math.abs(new_step) <= tol_act || fb === 0 ) {
+      return b; // Acceptable approx. is found
+    }
+
+    // Decide if the interpolation can be tried
+    if ( Math.abs(prev_step) >= tol_act && Math.abs(fa) > Math.abs(fb) ) {
+      // If prev_step was large enough and was in true direction, Interpolatiom may be tried
+      var t1, cb, t2;
+      cb = c - b;
+      if ( a === c ) { // If we have only two distinct points linear interpolation can only be applied
+        t1 = fb / fa;
+        p = cb * t1;
+        q = 1.0 - t1;
+      }
+      else { // Quadric inverse interpolation
+        q = fa / fc, t1 = fb / fc, t2 = fb / fa;
+        p = t2 * (cb * q * (q - t1) - (b - a) * (t1 - 1));
+        q = (q - 1) * (t1 - 1) * (t2 - 1);
+      }
+
+      if ( p > 0 ) {
+        q = -q;  // p was calculated with the opposite sign; make p positive
+      }
+      else {
+        p = -p;  // and assign possible minus to q
+      }
+
+      if ( p < ( 0.75 * cb * q - Math.abs( tol_act * q ) / 2 ) &&
+           p < Math.abs( prev_step * q / 2 ) ) {
+        // If (b + p / q) falls in [b,c] and isn't too large it is accepted
+        new_step = p / q;
+      }
+
+      // If p/q is too large then the bissection procedure can reduce [b,c] range to more extent
+    }
+
+    if ( Math.abs( new_step ) < tol_act ) { // Adjust the step to be not less than tolerance
+      new_step = ( new_step > 0 ) ? tol_act : -tol_act;
+    }
+
+    a = b, fa = fb;     // Save the previous approx.
+    b += new_step, fb = func(b);  // Do step to a new approxim.
+
+    if ( (fb > 0 && fc > 0) || (fb < 0 && fc < 0) ) {
+      c = a, fc = fa; // Adjust c for it to have a sign opposite to that of b
+    }
+  }
+
+};
+
+
+/*
+var test_counter;
+function f1 (x) { test_counter++; return (Math.pow(x,2)-1)*x - 5; }
+function f2 (x) { test_counter++; return Math.cos(x)-x; }
+function f3 (x) { test_counter++; return Math.sin(x)-x; }
+function f4 (x) { test_counter++; return (x + 3) * Math.pow(x - 1, 2); }
+[
+  [f1, 2, 3],
+  [f2, 2, 3],
+  [f2, -1, 3],
+  [f3, -1, 3],
+  [f4, -4, 4/3]
+].forEach(function (args) {
+  test_counter = 0;
+  var root = uniroot.apply( pv, args );
+  ;;;console.log( 'uniroot:', args.slice(1), root, test_counter );
+})
+*/
+numeric.Sparse = function Sparse(p,v) { this.p = p; this.v = v; };
+
+numeric.Sparse.scatter = function scatter(i,j,z) {
+    var n = numeric.sup(j)+1,m=i.length,jk;
+    var p = Array(n),v = Array(n),k;
+    for(k=n-1;k!==-1;--k) { p[k] = []; v[k] = []; }
+    for(k=0;k!==m;++k) {
+        jk = j[k];
+        p[jk].push(i[k]);
+        v[jk].push(z[k]);
+    }
+    return new numeric.Sparse(p,v);
+};
+
+numeric.Sparse.identity = function identity(n) {
+    return numeric.Sparse.scatter(numeric.linspace(0,n-1),numeric.linspace(0,n-1),numeric.rep([n],1));
+};
+
+numeric.Sparse.prototype.dim = function dim() {
+    var m = 0, i,j,p=this.p,k=p.length,pi,a,b;
+    for(i=k-1;i!==-1;--i) {
+        pi = p[i];
+        a = pi.length;
+        for(j=a-1;j!==-1;--j) {
+            b = pi[j];
+            if(b>m) m = b;
+        }
+    }
+    return [m+1,p.length];
+};
+
+numeric.Sparse.prototype.Lsolve = function Lsolve(b,n) {
+    if(typeof n === "undefined") { n = b.length; }
+    var i,j,k,ret = Array(n), p = this.p, v = this.v, pj,vj,m;
+    for(i=0;ij && i=j) t[i-j] = vj[k];
+        }
+        if(j!==0) {
+            for(k=n-1;k!==-1;--k) foo[k] = 0;
+            for(k=0;k3;i-=4) { f(); f(); f(); f(); }
+        while(i>0) { f(); i--; }
+        t2 = new Date();
+        if(t2-t1 > interval) break;
+    }
+    for(i=n;i>3;i-=4) { f(); f(); f(); f(); }
+    while(i>0) { f(); i--; }
+    t2 = new Date();
+    return 1000*(3*n-1)/(t2-t1);
+};
+
+numeric._myIndexOf = (function _myIndexOf(w) {
+    var n = this.length,k;
+    for(k=0;k numeric.largeArray) { ret.push('...Large Array...'); return true; }
+            var flag = false;
+            ret.push('[');
+            for(k=0;k0) { ret.push(','); if(flag) ret.push('\n '); } flag = foo(x[k]); }
+            ret.push(']');
+            return true;
+        }
+        ret.push('{');
+        var flag = false;
+        for(k in x) { if(x.hasOwnProperty(k)) { if(flag) ret.push(',\n'); flag = true; ret.push(k); ret.push(': \n'); foo(x[k]); } }
+        ret.push('}');
+        return true;
+    }
+    foo(x);
+    return ret.join('');
+};
+
+numeric.parseDate = function parseDate(d) {
+    function foo(d) {
+        if(typeof d === 'string') { return Date.parse(d.replace(/-/g,'/')); }
+        if(!(d instanceof Array)) { throw new Error("parseDate: parameter must be arrays of strings"); }
+        var ret = [],k;
+        for(k=0;k0) {
+            ret[count] = [];
+            for(j=0;j> 2;
+            q = ((x & 3) << 4) + (y >> 4);
+            r = ((y & 15) << 2) + (z >> 6);
+            s = z & 63;
+            if(i+1>=n) { r = s = 64; }
+            else if(i+2>=n) { s = 64; }
+            ret += key.charAt(p) + key.charAt(q) + key.charAt(r) + key.charAt(s);
+            }
+        return ret;
+    }
+    function crc32Array (a,from,to) {
+        if(typeof from === "undefined") { from = 0; }
+        if(typeof to === "undefined") { to = a.length; }
+        var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
+                     0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
+                     0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+                     0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
+                     0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
+                     0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+                     0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
+                     0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
+                     0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+                     0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
+                     0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
+                     0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+                     0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
+                     0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+                     0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+                     0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
+                     0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
+                     0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+                     0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
+                     0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
+                     0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+                     0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
+                     0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
+                     0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+                     0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
+                     0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
+                     0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+                     0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+                     0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
+                     0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+                     0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
+                     0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
+
+        var crc = -1, y = 0, n = a.length,i;
+
+        for (i = from; i < to; i++) {
+            y = (crc ^ a[i]) & 0xFF;
+            crc = (crc >>> 8) ^ table[y];
+        }
+
+        return crc ^ (-1);
+    }
+
+    var h = img[0].length, w = img[0][0].length, s1, s2, next,k,length,a,b,i,j,adler32,crc32;
+    var stream = [
+                  137, 80, 78, 71, 13, 10, 26, 10,                           //  0: PNG signature
+                  0,0,0,13,                                                  //  8: IHDR Chunk length
+                  73, 72, 68, 82,                                            // 12: "IHDR"
+                  (w >> 24) & 255, (w >> 16) & 255, (w >> 8) & 255, w&255,   // 16: Width
+                  (h >> 24) & 255, (h >> 16) & 255, (h >> 8) & 255, h&255,   // 20: Height
+                  8,                                                         // 24: bit depth
+                  2,                                                         // 25: RGB
+                  0,                                                         // 26: deflate
+                  0,                                                         // 27: no filter
+                  0,                                                         // 28: no interlace
+                  -1,-2,-3,-4,                                               // 29: CRC
+                  -5,-6,-7,-8,                                               // 33: IDAT Chunk length
+                  73, 68, 65, 84,                                            // 37: "IDAT"
+                  // RFC 1950 header starts here
+                  8,                                                         // 41: RFC1950 CMF
+                  29                                                         // 42: RFC1950 FLG
+                  ];
+    crc32 = crc32Array(stream,12,29);
+    stream[29] = (crc32>>24)&255;
+    stream[30] = (crc32>>16)&255;
+    stream[31] = (crc32>>8)&255;
+    stream[32] = (crc32)&255;
+    s1 = 1;
+    s2 = 0;
+    for(i=0;i>8)&255;
+        stream.push(a); stream.push(b);
+        stream.push((~a)&255); stream.push((~b)&255);
+        if(i===0) stream.push(0);
+        for(j=0;j255) a = 255;
+                else if(a<0) a=0;
+                else a = Math.round(a);
+                s1 = (s1 + a )%65521;
+                s2 = (s2 + s1)%65521;
+                stream.push(a);
+            }
+        }
+        stream.push(0);
+    }
+    adler32 = (s2<<16)+s1;
+    stream.push((adler32>>24)&255);
+    stream.push((adler32>>16)&255);
+    stream.push((adler32>>8)&255);
+    stream.push((adler32)&255);
+    length = stream.length - 41;
+    stream[33] = (length>>24)&255;
+    stream[34] = (length>>16)&255;
+    stream[35] = (length>>8)&255;
+    stream[36] = (length)&255;
+    crc32 = crc32Array(stream,37);
+    stream.push((crc32>>24)&255);
+    stream.push((crc32>>16)&255);
+    stream.push((crc32>>8)&255);
+    stream.push((crc32)&255);
+    stream.push(0);
+    stream.push(0);
+    stream.push(0);
+    stream.push(0);
+//    a = stream.length;
+    stream.push(73);  // I
+    stream.push(69);  // E
+    stream.push(78);  // N
+    stream.push(68);  // D
+    stream.push(174); // CRC1
+    stream.push(66);  // CRC2
+    stream.push(96);  // CRC3
+    stream.push(130); // CRC4
+    return 'data:image/png;base64,'+base64(stream);
+};
+
+// 2. Linear algebra with Arrays.
+numeric._dim = function _dim(x) {
+    var ret = [];
+    while(typeof x === "object") { ret.push(x.length); x = x[0]; }
+    return ret;
+};
+
+numeric.dim = function dim(x) {
+    var y,z;
+    if(typeof x === "object") {
+        y = x[0];
+        if(typeof y === "object") {
+            z = y[0];
+            if(typeof z === "object") {
+                return numeric._dim(x);
+            }
+            return [x.length,y.length];
+        }
+        return [x.length];
+    }
+    return [];
+};
+
+// mapreduce
+numeric.mapreduce = function mapreduce(body, init) {
+    return numeric.compile('x','accum','_s','_k',
+            'if(typeof accum === "undefined") accum = '+init+';\n'+
+            'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
+            'if(typeof _s === "undefined") _s = numeric.dim(x);\n'+
+            'if(typeof _k === "undefined") _k = 0;\n'+
+            'var _n = _s[_k];\n'+
+            'var i,xi;\n'+
+            'if(_k < _s.length-1) {\n'+
+            '    for(i=_n-1;i>=0;i--) {\n'+
+            '        accum = arguments.callee(x[i],accum,_s,_k+1);\n'+
+            '    }'+
+            '    return accum;\n'+
+            '}\n'+
+            'for(i=_n-1;i>=1;i-=2) { \n'+
+            '    xi = x[i];\n'+
+            '    '+body+';\n'+
+            '    xi = x[i-1];\n'+
+            '    '+body+';\n'+
+            '}\n'+
+            'if(i === 0) {\n'+
+            '    xi = x[i];\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return accum;'
+            );
+};
+
+// 
+numeric.mapreduce2 = function mapreduce2(body, setup) {
+    return numeric.compile('x',
+            'var n = x.length;\n'+
+            'var i,xi;\n'+setup+'\n'+
+            'for(i=n-1;i!==-1;--i) { \n'+
+            '    xi = x[i];\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return accum;'
+            );
+};
+
+// compare arrays/tensors
+numeric.same = function same(x,y) {
+    var i, n;
+
+    if(!(x instanceof Array) || !(y instanceof Array)) { return false; }
+    
+    n = x.length;
+    
+    if(n !== y.length) { return false; }
+    
+    for(i = 0; i < n; i++)
+    {
+        if(x[i] === y[i]) { continue; }
+        if(typeof x[i] === "object") { if(!same(x[i], y[i])) return false; }
+        else { return false; }
+    }
+    return true;
+};
+
+numeric.empty = function empty(s,k) {
+    if(typeof k === "undefined") { k=0; }
+    var n=s[k], z=Array(n), i;
+    if(s.length   === 0) { return undefined; }
+    if(s.length-1 === k) { return z; }
+    for(i=n-1;i>=0;i--) { z[i] = numeric.empty(s,k+1); }
+    return z;
+};
+
+// repeat
+numeric.rep = function rep(s, v, k) 
+{
+    // repeat value v over a tensor of size s = [s0, s1, s2, ...]
+    // k recursive index
+    if(typeof k === "undefined") { k = 0; }
+    
+    var n = s[k], ret = Array(n), i;
+    
+    if(k === s.length - 1)
+    {
+        for(i = n - 2; i >= 0; i -= 2) { ret[i+1] = v; ret[i] = v; }
+        if(i === -1) { ret[0] = v; }
+        return ret;
+    }
+    
+    for(i = n - 1; i >= 0; i--) { ret[i] = numeric.rep(s, v, k+1); }
+    
+    return ret;
+};
+
+numeric.zeros = function zeros(s) { return numeric.rep(s,0); };
+numeric.ones = function ones(s) { return numeric.rep(s,1); };
+
+// dot functions
+numeric.dotMMsmall = function dotMMsmall(x,y)
+{
+    var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0;
+    p = x.length; q = y.length; r = y[0].length;
+    ret = Array(p);
+    for(i=p-1;i>=0;i--) {
+        foo = Array(r);
+        bar = x[i];
+        for(k=r-1;k>=0;k--) {
+            woo = bar[q-1]*y[q-1][k];
+            for(j=q-2;j>=1;j-=2) {
+                i0 = j-1;
+                woo += bar[j]*y[j][k] + bar[i0]*y[i0][k];
+            }
+            if(j===0) { woo += bar[0]*y[0][k]; }
+            foo[k] = woo;
+        }
+        ret[i] = foo;
+    }
+    return ret;
+};
+
+numeric._getCol = function _getCol(A,j,x) {
+    var n = A.length, i;
+    for(i=n-1;i>0;--i) {
+        x[i] = A[i][j];
+        --i;
+        x[i] = A[i][j];
+    }
+    if(i===0) x[0] = A[0][j];
+};
+
+numeric.dotMMbig = function dotMMbig(x,y){
+    var gc = numeric._getCol, p = y.length, v = Array(p);
+    var m = x.length, n = y[0].length, A = new Array(m), xj;
+    var VV = numeric.dotVV;
+    var i,j,k,z;
+    --p;
+    --m;
+    for(i=m;i!==-1;--i) A[i] = Array(n);
+    --n;
+    for(i=n;i!==-1;--i) {
+        gc(y,i,v);
+        for(j=m;j!==-1;--j) {
+            z=0;
+            xj = x[j];
+            A[j][i] = VV(xj,v);
+        }
+    }
+    return A;
+};
+
+numeric.dotMV = function dotMV(x,y) {
+    var p = x.length, q = y.length,i;
+    var ret = Array(p), dotVV = numeric.dotVV;
+    for(i=p-1;i>=0;i--) { ret[i] = dotVV(x[i],y); }
+    return ret;
+};
+
+numeric.dotVM = function dotVM(x,y) {
+    var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0,s1,s2,s3,baz,accum;
+    p = x.length; q = y[0].length;
+    ret = Array(q);
+    for(k=q-1;k>=0;k--) {
+        woo = x[p-1]*y[p-1][k];
+        for(j=p-2;j>=1;j-=2) {
+            i0 = j-1;
+            woo += x[j]*y[j][k] + x[i0]*y[i0][k];
+        }
+        if(j===0) { woo += x[0]*y[0][k]; }
+        ret[k] = woo;
+    }
+    return ret;
+};
+
+numeric.dotVV = function dotVV(x,y) {
+    var i,n=x.length,i1,ret = x[n-1]*y[n-1];
+    for(i=n-2;i>=1;i-=2) {
+        i1 = i-1;
+        ret += x[i]*y[i] + x[i1]*y[i1];
+    }
+    if(i===0) { ret += x[0]*y[0]; }
+    return ret;
+};
+
+numeric.dot = function dot(x,y) {
+    var d = numeric.dim;
+    switch(d(x).length*1000+d(y).length) {
+    case 2002:
+        if(y.length < 10) return numeric.dotMMsmall(x,y);
+        else return numeric.dotMMbig(x,y);
+    case 2001: return numeric.dotMV(x,y);
+    case 1002: return numeric.dotVM(x,y);
+    case 1001: return numeric.dotVV(x,y);
+    case 1000: return numeric.mulVS(x,y);
+    case 1: return numeric.mulSV(x,y);
+    case 0: return x*y;
+    default: throw new Error('numeric.dot only works on vectors and matrices');
+    }
+};
+
+// diag function
+
+numeric.roll = function roll(x, r, a, s, k) {
+    if(typeof r === 'undefined') { r=1; }
+    if(typeof a === 'undefined') { a=-1; }
+    if(typeof s === 'undefined') { s=numeric.dim(x); }
+    if(typeof k === 'undefined') { k=0; }
+    if(a < 0) { a=s.length+a; }
+    if(k === a) { return x.slice(s[k]-r).concat(x.slice(0,s[k]-r)); }
+    var i,n=s[k],z=Array(n);
+    for(i=0;i=0;i--) {
+        Ai = Array(n);
+        i1 = i+2;
+        for(j=n-1;j>=i1;j-=2) {
+            Ai[j] = 0;
+            Ai[j-1] = 0;
+        }
+        if(j>i) { Ai[j] = 0; }
+        Ai[i] = d[i];
+        for(j=i-1;j>=1;j-=2) {
+            Ai[j] = 0;
+            Ai[j-1] = 0;
+        }
+        if(j===0) { Ai[0] = 0; }
+        A[i] = Ai;
+    }
+    return A;
+};
+
+numeric.getDiag = function(A) {
+    var n = Math.min(A.length,A[0].length),i,ret = Array(n);
+    for(i=n-1;i>=1;--i) {
+        ret[i] = A[i][i];
+        --i;
+        ret[i] = A[i][i];
+    }
+    if(i===0) {
+        ret[0] = A[0][0];
+    }
+    return ret;
+};
+
+numeric.identity = function identity(n) { return numeric.diag(numeric.rep([n],1)); };
+
+numeric.pointwise = function pointwise(params,body,setup) 
+{
+    if(typeof setup === "undefined") { setup = ""; }
+    var fun = [];
+    var k;
+    var avec = /\[i\]$/,p,thevec = '';
+    var haveret = false;
+    for(k=0;k=0;i--) ret[i] = arguments.callee('+params.join(',')+',_s,_k+1);\n'+
+            '    return ret;\n'+
+            '}\n'+
+            setup+'\n'+
+            'for(i=_n-1;i!==-1;--i) {\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return ret;'
+            );
+    return numeric.compile.apply(null,fun);
+};
+
+numeric.pointwise2 = function pointwise2(params,body,setup)
+{
+    if(typeof setup === "undefined") { setup = ""; }
+    var fun = [];
+    var k;
+    var avec = /\[i\]$/,p,thevec = '';
+    var haveret = false;
+    for(k=0;k=0;i--) { _biforeach(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
+});
+
+numeric._biforeach2 = (function _biforeach2(x,y,s,k,f) {
+    if(k === s.length-1) { return f(x,y); }
+    var i,n=s[k],ret = Array(n);
+    for(i=n-1;i>=0;--i) { ret[i] = _biforeach2(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
+    return ret;
+});
+
+numeric._foreach = (function _foreach(x,s,k,f) {
+    if(k === s.length-1) { f(x); return; }
+    var i,n=s[k];
+    for(i=n-1;i>=0;i--) { _foreach(x[i],s,k+1,f); }
+});
+
+numeric._foreach2 = (function _foreach2(x,s,k,f) {
+    if(k === s.length-1) { return f(x); }
+    var i,n=s[k], ret = Array(n);
+    for(i=n-1;i>=0;i--) { ret[i] = _foreach2(x[i],s,k+1,f); }
+    return ret;
+});
+
+/*numeric.anyV = numeric.mapreduce('if(xi) return true;','false');
+numeric.allV = numeric.mapreduce('if(!xi) return false;','true');
+numeric.any = function(x) { if(typeof x.length === "undefined") return x; return numeric.anyV(x); }
+numeric.all = function(x) { if(typeof x.length === "undefined") return x; return numeric.allV(x); }*/
+
+numeric.ops2 = {
+        add: '+',
+        sub: '-',
+        mul: '*',
+        div: '/',
+        mod: '%',
+        and: '&&',
+        or:  '||',
+        eq:  '===',
+        neq: '!==',
+        lt:  '<',
+        gt:  '>',
+        leq: '<=',
+        geq: '>=',
+        band: '&',
+        bor: '|',
+        bxor: '^',
+        lshift: '<<',
+        rshift: '>>',
+        rrshift: '>>>'
+};
+
+numeric.opseq = {
+        addeq: '+=',
+        subeq: '-=',
+        muleq: '*=',
+        diveq: '/=',
+        modeq: '%=',
+        lshifteq: '<<=',
+        rshifteq: '>>=',
+        rrshifteq: '>>>=',
+        bandeq: '&=',
+        boreq: '|=',
+        bxoreq: '^='
+};
+
+numeric.mathfuns = ['abs','acos','asin','atan','ceil','cos',
+                    'exp','floor','log','round','sin','sqrt','tan',
+                    'isNaN','isFinite'];
+
+numeric.mathfuns2 = ['atan2','pow','max','min'];
+
+numeric.ops1 = {
+        neg: '-',
+        not: '!',
+        bnot: '~',
+        clone: ''
+};
+
+numeric.mapreducers = {
+        any: ['if(xi) return true;','var accum = false;'],
+        all: ['if(!xi) return false;','var accum = true;'],
+        sum: ['accum += xi;','var accum = 0;'],
+        prod: ['accum *= xi;','var accum = 1;'],
+        norm2Squared: ['accum += xi*xi;','var accum = 0;'],
+        norminf: ['accum = max(accum,abs(xi));','var accum = 0, max = Math.max, abs = Math.abs;'],
+        norm1: ['accum += abs(xi);','var accum = 0, abs = Math.abs;'],
+        sup: ['accum = max(accum,xi);','var accum = -Infinity, max = Math.max;'],
+        inf: ['accum = min(accum,xi);','var accum = Infinity, min = Math.min;']
+};
+
+(function () {
+    var i,o;
+    for(i=0;iv0) { i0 = i; v0 = k; } }
+        Aj = A[i0]; A[i0] = A[j]; A[j] = Aj;
+        Ij = I[i0]; I[i0] = I[j]; I[j] = Ij;
+        x = Aj[j];
+        for(k=j;k!==n;++k)    Aj[k] /= x;
+        for(k=n-1;k!==-1;--k) Ij[k] /= x;
+        for(i=m-1;i!==-1;--i) {
+            if(i!==j) {
+                Ai = A[i];
+                Ii = I[i];
+                x = Ai[j];
+                for(k=j+1;k!==n;++k)  Ai[k] -= Aj[k]*x;
+                for(k=n-1;k>0;--k) { Ii[k] -= Ij[k]*x; --k; Ii[k] -= Ij[k]*x; }
+                if(k===0) Ii[0] -= Ij[0]*x;
+            }
+        }
+    }
+    return I;
+};
+
+numeric.det = function det(x) {
+    var s = numeric.dim(x);
+    if(s.length !== 2 || s[0] !== s[1]) { throw new Error('numeric: det() only works on square matrices'); }
+    var n = s[0], ret = 1,i,j,k,A = numeric.clone(x),Aj,Ai,alpha,temp,k1,k2,k3;
+    for(j=0;j Math.abs(A[k][j])) { k = i; } }
+        if(k !== j) {
+            temp = A[k]; A[k] = A[j]; A[j] = temp;
+            ret *= -1;
+        }
+        Aj = A[j];
+        for(i=j+1;i=1;i-=2) {
+        A1 = x[i];
+        A0 = x[i-1];
+        for(j=n-1;j>=1;--j) {
+            Bj = ret[j]; Bj[i] = A1[j]; Bj[i-1] = A0[j];
+            --j;
+            Bj = ret[j]; Bj[i] = A1[j]; Bj[i-1] = A0[j];
+        }
+        if(j===0) {
+            Bj = ret[0]; Bj[i] = A1[0]; Bj[i-1] = A0[0];
+        }
+    }
+    if(i===0) {
+        A0 = x[0];
+        for(j=n-1;j>=1;--j) {
+            ret[j][0] = A0[j];
+            --j;
+            ret[j][0] = A0[j];
+        }
+        if(j===0) { ret[0][0] = A0[0]; }
+    }
+    return ret;
+};
+
+numeric.negtranspose = function negtranspose(x) {
+    var i,j,m = x.length,n = x[0].length, ret=Array(n),A0,A1,Bj;
+    for(j=0;j=1;i-=2) {
+        A1 = x[i];
+        A0 = x[i-1];
+        for(j=n-1;j>=1;--j) {
+            Bj = ret[j]; Bj[i] = -A1[j]; Bj[i-1] = -A0[j];
+            --j;
+            Bj = ret[j]; Bj[i] = -A1[j]; Bj[i-1] = -A0[j];
+        }
+        if(j===0) {
+            Bj = ret[0]; Bj[i] = -A1[0]; Bj[i-1] = -A0[0];
+        }
+    }
+    if(i===0) {
+        A0 = x[0];
+        for(j=n-1;j>=1;--j) {
+            ret[j][0] = -A0[j];
+            --j;
+            ret[j][0] = -A0[j];
+        }
+        if(j===0) { ret[0][0] = -A0[0]; }
+    }
+    return ret;
+};
+
+numeric._random = function _random(s,k) {
+    var i,n=s[k],ret=Array(n), rnd;
+    if(k === s.length-1) {
+        rnd = Math.random;
+        for(i=n-1;i>=1;i-=2) {
+            ret[i] = rnd();
+            ret[i-1] = rnd();
+        }
+        if(i===0) { ret[0] = rnd(); }
+        return ret;
+    }
+    for(i=n-1;i>=0;i--) ret[i] = _random(s,k+1);
+    return ret;
+};
+
+numeric.random = function random(s) { return numeric._random(s,0); };
+
+numeric.norm2 = function norm2(x,a) { return numeric.sqrt(numeric.norm2Squared(x,a)); };
+
+numeric.linspace = function linspace(a,b,n) {
+    if(typeof n === "undefined") n = Math.max(Math.round(b-a)+1,1);
+    if(n<2) { return n===1?[a]:[]; }
+    var i,ret = Array(n);
+    n--;
+    for(i=n;i>=0;i--) { ret[i] = (i*b+(n-i)*a)/n; }
+    return ret;
+};
+
+numeric.logspace = function logspace(a,b,n,e) {
+    if(typeof e === 'undefined') { e=10; }
+    return numeric.pow(e, numeric.linspace(a,b,n));
+};
+
+numeric.range = function range(start,stop,step) {
+    if (typeof step === 'undefined') { step = 1; }
+    if (typeof stop === 'undefined') { stop = start; start = 0; }
+    if (step > 0 && (stop < start)) { return []; }
+    if (step < 0 && (stop > start)) { return []; }
+    var i,z=[];
+    for(i=start;i=0;i--) { ret[i] = x[i+a]; }
+            return ret;
+        }
+        for(i=n;i>=0;i--) { ret[i] = foo(x[i+a],k+1); }
+        return ret;
+    }
+    return foo(x,0);
+};
+
+numeric.setBlock = function setBlock(x,from,to,B) {
+    var s = numeric.dim(x);
+    function foo(x,y,k) {
+        var i,a = from[k], n = to[k]-a;
+        if(k === s.length-1) { for(i=n;i>=0;i--) { x[i+a] = y[i]; } }
+        for(i=n;i>=0;i--) { foo(x[i+a],y[i],k+1); }
+    }
+    foo(x,B,0);
+    return x;
+};
+
+numeric.getRange = function getRange(A, I,J ) {
+    var m = I.length, n = J.length;
+    var i,j;
+    var B = Array(m), Bi, AI;
+    for(i=m-1;i!==-1;--i) {
+        B[i] = Array(n);
+        Bi = B[i];
+        AI = A[I[i]];
+        for(j=n-1;j!==-1;--j) Bi[j] = AI[J[j]];
+    }
+    return B;
+};
+
+numeric.blockMatrix = function blockMatrix(X) {
+    var s = numeric.dim(X);
+    if(s.length<4) return numeric.blockMatrix([X]);
+    var m=s[0],n=s[1],M,N,i,j,Xij;
+    M = 0; N = 0;
+    for(i=0;i=0;i--) {
+        Ai = Array(n);
+        xi = x[i];
+        for(j=n-1;j>=3;--j) {
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+        }
+        while(j>=0) { Ai[j] = xi * y[j]; --j; }
+        A[i] = Ai;
+    }
+    return A;
+};
+
+// 3. The Tensor type T
+numeric.T = function T(x,y) { this.x = x; this.y = y; };
+numeric.t = function t(x,y) { return new numeric.T(x,y); };
+
+numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
+    var io = numeric.indexOf;
+    if(typeof setup !== "string") {
+        var k;
+        setup = '';
+        for(k in numeric) {
+            if(numeric.hasOwnProperty(k) && (rr.indexOf(k)>=0 || rc.indexOf(k)>=0 || cr.indexOf(k)>=0 || cc.indexOf(k)>=0) && k.length>1) {
+                setup += 'var '+k+' = numeric.'+k+';\n';
+            }
+        }
+    }
+    return numeric.compile(['y'],
+            'var x = this;\n'+
+            'if(!(y instanceof numeric.T)) { y = new numeric.T(y); }\n'+
+            setup+'\n'+
+            'if(x.y) {'+
+            '  if(y.y) {'+
+            '    return new numeric.T('+cc+');\n'+
+            '  }\n'+
+            '  return new numeric.T('+cr+');\n'+
+            '}\n'+
+            'if(y.y) {\n'+
+            '  return new numeric.T('+rc+');\n'+
+            '}\n'+
+            'return new numeric.T('+rr+');\n'
+    );
+};
+
+numeric.T.prototype.add = numeric.Tbinop(
+        'add(x.x,y.x)',
+        'add(x.x,y.x),y.y',
+        'add(x.x,y.x),x.y',
+        'add(x.x,y.x),add(x.y,y.y)');
+numeric.T.prototype.sub = numeric.Tbinop(
+        'sub(x.x,y.x)',
+        'sub(x.x,y.x),neg(y.y)',
+        'sub(x.x,y.x),x.y',
+        'sub(x.x,y.x),sub(x.y,y.y)');
+numeric.T.prototype.mul = numeric.Tbinop(
+        'mul(x.x,y.x)',
+        'mul(x.x,y.x),mul(x.x,y.y)',
+        'mul(x.x,y.x),mul(x.y,y.x)',
+        'sub(mul(x.x,y.x),mul(x.y,y.y)),add(mul(x.x,y.y),mul(x.y,y.x))');
+
+numeric.T.prototype.reciprocal = function reciprocal() {
+    var mul = numeric.mul, div = numeric.div;
+    if(this.y) {
+        var d = numeric.add(mul(this.x,this.x),mul(this.y,this.y));
+        return new numeric.T(div(this.x,d),div(numeric.neg(this.y),d));
+    }
+    return new numeric.T(div(1,this.x), 0);
+};
+
+numeric.T.prototype.div = function div(y) {
+    if(!(y instanceof numeric.T)) y = new numeric.T(y);
+    if(y.y) { return this.mul(y.reciprocal()); }
+    var div = numeric.div;
+    if(this.y) { return new numeric.T(div(this.x,y.x),div(this.y,y.x)); }
+    return new numeric.T(div(this.x,y.x));
+};
+
+numeric.T.prototype.dot = numeric.Tbinop(
+        'dot(x.x,y.x)',
+        'dot(x.x,y.x),dot(x.x,y.y)',
+        'dot(x.x,y.x),dot(x.y,y.x)',
+        'sub(dot(x.x,y.x),dot(x.y,y.y)),add(dot(x.x,y.y),dot(x.y,y.x))'
+        );
+
+numeric.T.prototype.transpose = function transpose() {
+    var t = numeric.transpose, x = this.x, y = this.y;
+    if(y) { return new numeric.T(t(x),t(y)); }
+    return new numeric.T(t(x));
+};
+
+numeric.T.prototype.transjugate = function transjugate() {
+    var t = numeric.transpose, x = this.x, y = this.y;
+    if(y) { return new numeric.T(t(x),numeric.negtranspose(y)); }
+    return new numeric.T(t(x));
+};
+
+numeric.Tunop = function Tunop(r,c,s) {
+    if(typeof s !== "string") { s = ''; }
+    return numeric.compile(
+            'var x = this;\n'+
+            s+'\n'+
+            'if(x.y) {'+
+            '  '+c+'\n'+
+            '}\n'+
+            r+'\n'
+    );
+};
+
+numeric.T.prototype.exp = numeric.Tunop(
+        'return new numeric.T(ex);',
+        'return new numeric.T(mul(cos(x.y),ex),mul(sin(x.y),ex));',
+        'var ex = numeric.exp(x.x), cos = numeric.cos, sin = numeric.sin, mul = numeric.mul;');
+numeric.T.prototype.conj = numeric.Tunop(
+        'return new numeric.T(x.x);',
+        'return new numeric.T(x.x,numeric.neg(x.y));');
+numeric.T.prototype.neg = numeric.Tunop(
+        'return new numeric.T(neg(x.x));',
+        'return new numeric.T(neg(x.x),neg(x.y));',
+        'var neg = numeric.neg;');
+numeric.T.prototype.sin = numeric.Tunop(
+        'return new numeric.T(numeric.sin(x.x));',
+        'return x.exp().sub(x.neg().exp()).div(new numeric.T(0,2));');
+numeric.T.prototype.cos = numeric.Tunop(
+        'return new numeric.T(numeric.cos(x.x));',
+        'return x.exp().add(x.neg().exp()).div(2);');
+numeric.T.prototype.abs = numeric.Tunop(
+        'return new numeric.T(numeric.abs(x.x));',
+        'return new numeric.T(numeric.sqrt(numeric.add(mul(x.x,x.x),mul(x.y,x.y))));',
+        'var mul = numeric.mul;');
+numeric.T.prototype.log = numeric.Tunop(
+        'return new numeric.T(numeric.log(x.x));',
+        'var theta = new numeric.T(numeric.atan2(x.y,x.x)), r = x.abs();\n'+
+        'return new numeric.T(numeric.log(r.x),theta.x);');
+numeric.T.prototype.norm2 = numeric.Tunop(
+        'return numeric.norm2(x.x);',
+        'var f = numeric.norm2Squared;\n'+
+        'return Math.sqrt(f(x.x)+f(x.y));');
+
+numeric.T.prototype.inv = function inv() {
+    var A = this;
+    if(typeof A.y === "undefined") { return new numeric.T(numeric.inv(A.x)); }
+    var n = A.x.length, i, j, k;
+    var Rx = numeric.identity(n),Ry = numeric.rep([n,n],0);
+    var Ax = numeric.clone(A.x), Ay = numeric.clone(A.y);
+    var Aix, Aiy, Ajx, Ajy, Rix, Riy, Rjx, Rjy;
+    var i,j,k,d,d1,ax,ay,bx,by,temp;
+    for(i=0;i d) { k=j; d = d1; }
+        }
+        if(k!==i) {
+            temp = Ax[i]; Ax[i] = Ax[k]; Ax[k] = temp;
+            temp = Ay[i]; Ay[i] = Ay[k]; Ay[k] = temp;
+            temp = Rx[i]; Rx[i] = Rx[k]; Rx[k] = temp;
+            temp = Ry[i]; Ry[i] = Ry[k]; Ry[k] = temp;
+        }
+        Aix = Ax[i]; Aiy = Ay[i];
+        Rix = Rx[i]; Riy = Ry[i];
+        ax = Aix[i]; ay = Aiy[i];
+        for(j=i+1;j0;i--) {
+        Rix = Rx[i]; Riy = Ry[i];
+        for(j=i-1;j>=0;j--) {
+            Rjx = Rx[j]; Rjy = Ry[j];
+            ax = Ax[j][i]; ay = Ay[j][i];
+            for(k=n-1;k>=0;k--) {
+                bx = Rix[k]; by = Riy[k];
+                Rjx[k] -= ax*bx - ay*by;
+                Rjy[k] -= ax*by + ay*bx;
+            }
+        }
+    }
+    return new numeric.T(Rx,Ry);
+};
+
+numeric.T.prototype.get = function get(i) {
+    var x = this.x, y = this.y, k = 0, ik, n = i.length;
+    if(y) {
+        while(k= 0 ? 1 : -1;
+    var alpha = s*numeric.norm2(x);
+    v[0] += alpha;
+    var foo = numeric.norm2(v);
+    if(foo === 0) { /* this should not happen */ throw new Error('eig: internal error'); }
+    return numeric.div(v,foo);
+};
+
+// upper hessenberg 
+numeric.toUpperHessenberg = function toUpperHessenberg(me) {
+    var s = numeric.dim(me);
+    if(s.length !== 2 || s[0] !== s[1]) { throw new Error('numeric: toUpperHessenberg() only works on square matrices'); }
+    var m = s[0], i,j,k,x,v,A = numeric.clone(me),B,C,Ai,Ci,Q = numeric.identity(m),Qi;
+    for(j=0;j0) {
+            v = numeric.house(x);
+            B = numeric.getBlock(A,[j+1,j],[m-1,m-1]);
+            C = numeric.tensor(v,numeric.dot(v,B));
+            for(i=j+1;i=4*det) {
+            var s1,s2;
+            s1 = 0.5*(tr+Math.sqrt(tr*tr-4*det));
+            s2 = 0.5*(tr-Math.sqrt(tr*tr-4*det));
+            Hloc = numeric.add(numeric.sub(numeric.dot(Hloc,Hloc),
+                                           numeric.mul(Hloc,s1+s2)),
+                               numeric.diag(numeric.rep([3],s1*s2)));
+        } else {
+            Hloc = numeric.add(numeric.sub(numeric.dot(Hloc,Hloc),
+                                           numeric.mul(Hloc,tr)),
+                               numeric.diag(numeric.rep([3],det)));
+        }
+        x = [Hloc[0][0],Hloc[1][0],Hloc[2][0]];
+        v = numeric.house(x);
+        B = [H[0],H[1],H[2]];
+        C = numeric.tensor(v,numeric.dot(v,B));
+        for(i=0;i<3;i++) { Hi = H[i]; Ci = C[i]; for(k=0;k 4 && termp == Math.abs(d[p]) && termq == Math.abs(d[q]))
+                {
+                    // remove small elmts
+                    A[p][q] = 0;
+                }
+                else
+                {
+                    if (Math.abs(A[p][q]) >= tresh)
+                    {
+                        // apply rotation
+                        h = d[q] - d[p];
+                        term = Math.abs(h) + gapq;
+                        if (term == Math.abs(h))
+                        {
+                            t = A[p][q]/h;
+                        }
+                        else
+                        {
+                            theta = 0.5 * h / A[p][q];
+                            t = 1/(Math.abs(theta) + Math.sqrt(1 + theta*theta));
+                            if (theta < 0)
+                            {
+                                t = -t;
+                            }
+                        }
+                        c = 1/Math.sqrt(1 + t*t);
+                        s = t * c;
+                        tau = s/(1 + c);
+                        h = t * A[p][q];
+                        zw[p] = zw[p] - h;
+                        zw[q] = zw[q] + h;
+                        d[p] = d[p] - h;
+                        d[q] = d[q] + h;
+                        A[p][q] = 0;
+                        // rotate and use upper tria only
+                        for (var j = 0; j < p; j++)
+                        {
+                            g = A[j][p];
+                            h = A[j][q];
+                            A[j][p] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        }
+                        for (var j = p + 1; j < q; j++)
+                        {
+                            g = A[p][j];
+                            h = A[j][q];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        } 
+                        for (var j = q + 1; j < n; j++)
+                        {
+                            g = A[p][j];
+                            h = A[q][j];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[q][j] = h + s * (g - h * tau);
+                        }
+                        // eigenstates
+                        for (var j = 0; j < n; j++)
+                        {
+                            g = v[j][p];
+                            h = v[j][q];
+                            v[j][p] = g - s * (h + g * tau);
+                            v[j][q] = h + s * (g - h * tau);
+                        }
+                        nrot++;
+                    }
+                }
+            }
+        }
+        bw = numeric.add(bw, zw);
+        d = numeric.clone(bw);
+        zw = numeric.rep([n], 0);
+    }
+
+    return {E: {x: v}, lambda: {x: d}, iterations: iters, niter: niter, nrot: nrot};
+}
+
+numeric.jacobinorm = function(A)
+{
+    // used in numeric.jacobi
+    var n = A.length;
+    var s = 0;
+    for (var i = 0; i < n; i ++)
+    {
+        for (var j = i + 1; j < n; j ++)
+        {
+            s = s + Math.pow(A[i][j], 2)
+        }
+    }
+    return Math.sqrt(s);
+}
+
+// eig function
+numeric.eig = function eig(A,maxiter) {
+    var QH = numeric.toUpperHessenberg(A);
+    var QB = numeric.QRFrancis(QH.H,maxiter);
+    var T = numeric.T;
+    var n = A.length,i,k,flag = false,B = QB.B,H = numeric.dot(QB.Q,numeric.dot(QH.H,numeric.transpose(QB.Q)));
+    var Q = new T(numeric.dot(QB.Q,QH.Q)),Q0;
+    var m = B.length,j;
+    var a,b,c,d,p1,p2,disc,x,y,p,q,n1,n2;
+    var sqrt = Math.sqrt;
+    for(k=0;k=0) {
+                if(p1<0) x = -0.5*(p1-sqrt(disc));
+                else     x = -0.5*(p1+sqrt(disc));
+                n1 = (a-x)*(a-x)+b*b;
+                n2 = c*c+(d-x)*(d-x);
+                if(n1>n2) {
+                    n1 = sqrt(n1);
+                    p = (a-x)/n1;
+                    q = b/n1;
+                } else {
+                    n2 = sqrt(n2);
+                    p = c/n2;
+                    q = (d-x)/n2;
+                }
+                Q0 = new T([[q,-p],[p,q]]);
+                Q.setRows(i,j,Q0.dot(Q.getRows(i,j)));
+            } else {
+                x = -0.5*p1;
+                y = 0.5*sqrt(-disc);
+                n1 = (a-x)*(a-x)+b*b;
+                n2 = c*c+(d-x)*(d-x);
+                if(n1>n2) {
+                    n1 = sqrt(n1+y*y);
+                    p = (a-x)/n1;
+                    q = b/n1;
+                    x = 0;
+                    y /= n1;
+                } else {
+                    n2 = sqrt(n2+y*y);
+                    p = c/n2;
+                    q = (d-x)/n2;
+                    x = y/n2;
+                    y = 0;
+                }
+                Q0 = new T([[q,-p],[p,q]],[[x,y],[y,-x]]);
+                Q.setRows(i,j,Q0.dot(Q.getRows(i,j)));
+            }
+        }
+    }
+    var R = Q.dot(A).dot(Q.transjugate()), n = A.length, E = numeric.T.identity(n);
+    for(j=0;j0) {
+            for(k=j-1;k>=0;k--) {
+                var Rk = R.get([k,k]), Rj = R.get([j,j]);
+                if(numeric.neq(Rk.x,Rj.x) || numeric.neq(Rk.y,Rj.y)) {
+                    x = R.getRow(k).getBlock([k],[j-1]);
+                    y = E.getRow(j).getBlock([k],[j-1]);
+                    E.set([j,k],(R.get([k,j]).neg().sub(x.dot(y))).div(Rk.sub(Rj)));
+                } else {
+                    E.setRow(j,E.getRow(k));
+                    continue;
+                }
+            }
+        }
+    }
+    for(j=0;j=counts.length) counts[counts.length] = 0;
+            if(foo[j]!==0) counts[j]++;
+        }
+    }
+    var n = counts.length;
+    var Ai = Array(n+1);
+    Ai[0] = 0;
+    for(i=0;i= k11) {
+            xj[n] = j[m];
+            if(m===0) return;
+            ++n;
+            --m;
+            km = k[m];
+            k11 = k1[m];
+        } else {
+            foo = Pinv[Aj[km]];
+            if(x[foo] === 0) {
+                x[foo] = 1;
+                k[m] = km;
+                ++m;
+                j[m] = foo;
+                km = Ai[foo];
+                k1[m] = k11 = Ai[foo+1];
+            } else ++km;
+        }
+    }
+};
+
+numeric.ccsLPSolve = function ccsLPSolve(A,B,x,xj,I,Pinv,dfs) {
+    var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
+    var Bi = B[0], Bj = B[1], Bv = B[2];
+
+    var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
+    i0 = Bi[I];
+    i1 = Bi[I+1];
+    xj.length = 0;
+    for(i=i0;i a) { e = k; a = c; }
+        }
+        if(abs(x[i])= k11) {
+            xj[n] = Pinv[j[m]];
+            if(m===0) return;
+            ++n;
+            --m;
+            km = k[m];
+            k11 = k1[m];
+        } else {
+            foo = Aj[km];
+            if(x[foo] === 0) {
+                x[foo] = 1;
+                k[m] = km;
+                ++m;
+                j[m] = foo;
+                foo = Pinv[foo];
+                km = Ai[foo];
+                k1[m] = k11 = Ai[foo+1];
+            } else ++km;
+        }
+    }
+};
+
+numeric.ccsLPSolve0 = function ccsLPSolve0(A,B,y,xj,I,Pinv,P,dfs) {
+    var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
+    var Bi = B[0], Bj = B[1], Bv = B[2];
+
+    var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
+    i0 = Bi[I];
+    i1 = Bi[I+1];
+    xj.length = 0;
+    for(i=i0;i a) { e = k; a = c; }
+        }
+        if(abs(y[P[i]]) ret[k]) ret[k] = A.length;
+    var i;
+    for(i in A) {
+        if(A.hasOwnProperty(i)) dim(A[i],ret,k+1);
+    }
+    return ret;
+};
+
+numeric.sclone = function clone(A,k,n) {
+    if(typeof k === "undefined") { k=0; }
+    if(typeof n === "undefined") { n = numeric.sdim(A).length; }
+    var i,ret = Array(A.length);
+    if(k === n-1) {
+        for(i in A) { if(A.hasOwnProperty(i)) ret[i] = A[i]; }
+        return ret;
+    }
+    for(i in A) {
+        if(A.hasOwnProperty(i)) ret[i] = clone(A[i],k+1,n);
+    }
+    return ret;
+};
+
+numeric.sdiag = function diag(d) {
+    var n = d.length,i,ret = Array(n),i1,i2,i3;
+    for(i=n-1;i>=1;i-=2) {
+        i1 = i-1;
+        ret[i] = []; ret[i][i] = d[i];
+        ret[i1] = []; ret[i1][i1] = d[i1];
+    }
+    if(i===0) { ret[0] = []; ret[0][0] = d[i]; }
+    return ret;
+};
+
+numeric.sidentity = function identity(n) { return numeric.sdiag(numeric.rep([n],1)); };
+
+numeric.stranspose = function transpose(A) {
+    var ret = [], n = A.length, i,j,Ai;
+    for(i in A) {
+        if(!(A.hasOwnProperty(i))) continue;
+        Ai = A[i];
+        for(j in Ai) {
+            if(!(Ai.hasOwnProperty(j))) continue;
+            if(typeof ret[j] !== "object") { ret[j] = []; }
+            ret[j][i] = Ai[j];
+        }
+    }
+    return ret;
+};
+
+numeric.sLUP = function LUP(A,tol) {
+    throw new Error("The function numeric.sLUP had a bug in it and has been removed. Please use the new numeric.ccsLUP function instead.");
+};
+
+numeric.sdotMM = function dotMM(A,B) {
+    var p = A.length, q = B.length, BT = numeric.stranspose(B), r = BT.length, Ai, BTk;
+    var i,j,k,accum;
+    var ret = Array(p),reti;
+    for(i=p-1;i>=0;i--) {
+        reti = [];
+        Ai = A[i];
+        for(k=r-1;k>=0;k--) {
+            accum = 0;
+            BTk = BT[k];
+            for(j in Ai) {
+                if(!(Ai.hasOwnProperty(j))) continue;
+                if(j in BTk) { accum += Ai[j]*BTk[j]; }
+            }
+            if(accum) reti[k] = accum;
+        }
+        ret[i] = reti;
+    }
+    return ret;
+};
+
+numeric.sdotMV = function dotMV(A,x) {
+    var p = A.length, Ai, i,j;
+    var ret = Array(p), accum;
+    for(i=p-1;i>=0;i--) {
+        Ai = A[i];
+        accum = 0;
+        for(j in Ai) {
+            if(!(Ai.hasOwnProperty(j))) continue;
+            if(x[j]) accum += Ai[j]*x[j];
+        }
+        if(accum) ret[i] = accum;
+    }
+    return ret;
+};
+
+numeric.sdotVM = function dotMV(x,A) {
+    var i,j,Ai,alpha;
+    var ret = [], accum;
+    for(i in x) {
+        if(!x.hasOwnProperty(i)) continue;
+        Ai = A[i];
+        alpha = x[i];
+        for(j in Ai) {
+            if(!Ai.hasOwnProperty(j)) continue;
+            if(!ret[j]) { ret[j] = 0; }
+            ret[j] += alpha*Ai[j];
+        }
+    }
+    return ret;
+};
+
+numeric.sdotVV = function dotVV(x,y) {
+    var i,ret=0;
+    for(i in x) { if(x[i] && y[i]) ret+= x[i]*y[i]; }
+    return ret;
+};
+
+numeric.sdot = function dot(A,B) {
+    var m = numeric.sdim(A).length, n = numeric.sdim(B).length;
+    var k = m*1000+n;
+    switch(k) {
+    case 0: return A*B;
+    case 1001: return numeric.sdotVV(A,B);
+    case 2001: return numeric.sdotMV(A,B);
+    case 1002: return numeric.sdotVM(A,B);
+    case 2002: return numeric.sdotMM(A,B);
+    default: throw new Error('numeric.sdot not implemented for tensors of order '+m+' and '+n);
+    }
+};
+
+numeric.sscatter = function scatter(V) {
+    var n = V[0].length, Vij, i, j, m = V.length, A = [], Aj;
+    for(i=n-1;i>=0;--i) {
+        if(!V[m-1][i]) continue;
+        Aj = A;
+        for(j=0;j=0;--i) ret[i] = [];
+                    }
+                    for(i=n;i>=0;--i) ret[i].push(k[i]);
+                    ret[n+1].push(Ai);
+                }
+            } else gather(Ai,ret,k);
+        }
+    }
+    if(k.length>n) k.pop();
+    return ret;
+};
+
+// 6. Coordinate matrices
+numeric.cLU = function LU(A) {
+    var I = A[0], J = A[1], V = A[2];
+    var p = I.length, m=0, i,j,k,a,b,c;
+    for(i=0;im) m=I[i];
+    m++;
+    var L = Array(m), U = Array(m), left = numeric.rep([m],Infinity), right = numeric.rep([m],-Infinity);
+    var Ui, Uj,alpha;
+    for(k=0;kright[i]) right[i] = j;
+    }
+    for(i=0;i right[i+1]) right[i+1] = right[i]; }
+    for(i=m-1;i>=1;i--) { if(left[i]=0;i--) {
+        while(Uj[k] > i) {
+            ret[i] -= Uv[k]*ret[Uj[k]];
+            k--;
+        }
+        ret[i] /= Uv[k];
+        k--;
+    }
+    return ret;
+};
+
+numeric.cgrid = function grid(n,shape) {
+    if(typeof n === "number") n = [n,n];
+    var ret = numeric.rep(n,-1);
+    var i,j,count;
+    if(typeof shape !== "function") {
+        switch(shape) {
+        case 'L':
+            shape = function(i,j) { return (i>=n[0]/2 || jN) N = Ai[k]; }
+    N++;
+    ret = numeric.rep([N],0);
+    for(k=0;k1) {
+            mid = floor((p+q)/2);
+            if(x[mid] <= x0) p = mid;
+            else q = mid;
+        }
+        return this._at(x0,p);
+    }
+    var n = x0.length, i, ret = Array(n);
+    for(i=n-1;i!==-1;--i) ret[i] = this.at(x0[i]);
+    return ret;
+};
+
+numeric.Spline.prototype.diff = function diff() {
+    var x = this.x;
+    var yl = this.yl;
+    var yr = this.yr;
+    var kl = this.kl;
+    var kr = this.kr;
+    var n = yl.length;
+    var i,dx,dy;
+    var zl = kl, zr = kr, pl = Array(n), pr = Array(n);
+    var add = numeric.add, mul = numeric.mul, div = numeric.div, sub = numeric.sub;
+    for(i=n-1;i!==-1;--i) {
+        dx = x[i+1]-x[i];
+        dy = sub(yr[i+1],yl[i]);
+        pl[i] = div(add(mul(dy, 6),mul(kl[i],-4*dx),mul(kr[i+1],-2*dx)),dx*dx);
+        pr[i+1] = div(add(mul(dy,-6),mul(kl[i], 2*dx),mul(kr[i+1], 4*dx)),dx*dx);
+    }
+    return new numeric.Spline(x,zl,zr,pl,pr);
+};
+
+numeric.Spline.prototype.roots = function roots() {
+    function sqr(x) { return x*x; }
+    function heval(y0,y1,k0,k1,x) {
+        var A = k0*2-(y1-y0);
+        var B = -k1*2+(y1-y0);
+        var t = (x+1)*0.5;
+        var s = t*(1-t);
+        return (1-t)*y0+t*y1+A*s*(1-t)+B*s*t;
+    }
+    var ret = [];
+    var x = this.x, yl = this.yl, yr = this.yr, kl = this.kl, kr = this.kr;
+    if(typeof yl[0] === "number") {
+        yl = [yl];
+        yr = [yr];
+        kl = [kl];
+        kr = [kr];
+    }
+    var m = yl.length,n=x.length-1,i,j,k,y,s,t;
+    var ai,bi,ci,di, ret = Array(m),ri,k0,k1,y0,y1,A,B,D,dx,cx,stops,z0,z1,zm,t0,t1,tm;
+    var sqrt = Math.sqrt;
+    for(i=0;i!==m;++i) {
+        ai = yl[i];
+        bi = yr[i];
+        ci = kl[i];
+        di = kr[i];
+        ri = [];
+        for(j=0;j!==n;j++) {
+            if(j>0 && bi[j]*ai[j]<0) ri.push(x[j]);
+            dx = (x[j+1]-x[j]);
+            cx = x[j];
+            y0 = ai[j];
+            y1 = bi[j+1];
+            k0 = ci[j]/dx;
+            k1 = di[j+1]/dx;
+            D = sqr(k0-k1+3*(y0-y1)) + 12*k1*y0;
+            A = k1+3*y0+2*k0-3*y1;
+            B = 3*(k1+k0+2*(y0-y1));
+            if(D<=0) {
+                z0 = A/B;
+                if(z0>x[j] && z0x[j] && z0x[j] && z10) {
+                    t0 = t1;
+                    z0 = z1;
+                    continue;
+                }
+                var side = 0;
+                while(1) {
+                    tm = (z0*t1-z1*t0)/(z0-z1);
+                    if(tm <= t0 || tm >= t1) { break; }
+                    zm = this._at(tm,j);
+                    if(zm*z1>0) {
+                        t1 = tm;
+                        z1 = zm;
+                        if(side === -1) z0*=0.5;
+                        side = -1;
+                    } else if(zm*z0>0) {
+                        t0 = tm;
+                        z0 = zm;
+                        if(side === 1) z1*=0.5;
+                        side = 1;
+                    } else break;
+                }
+                ri.push(tm);
+                t0 = stops[k+1];
+                z0 = this._at(t0, j);
+            }
+            if(z1 === 0) ri.push(t1);
+        }
+        ret[i] = ri;
+    }
+    if(typeof this.yl[0] === "number") return ret[0];
+    return ret;
+};
+
+numeric.spline = function spline(x,y,k1,kn) {
+    var n = x.length, b = [], dx = [], dy = [];
+    var i;
+    var sub = numeric.sub,mul = numeric.mul,add = numeric.add;
+    for(i=n-2;i>=0;i--) { dx[i] = x[i+1]-x[i]; dy[i] = sub(y[i+1],y[i]); }
+    if(typeof k1 === "string" || typeof kn === "string") {
+        k1 = kn = "periodic";
+    }
+    // Build sparse tridiagonal system
+    var T = [[],[],[]];
+    switch(typeof k1) {
+    case "undefined":
+        b[0] = mul(3/(dx[0]*dx[0]),dy[0]);
+        T[0].push(0,0);
+        T[1].push(0,1);
+        T[2].push(2/dx[0],1/dx[0]);
+        break;
+    case "string":
+        b[0] = add(mul(3/(dx[n-2]*dx[n-2]),dy[n-2]),mul(3/(dx[0]*dx[0]),dy[0]));
+        T[0].push(0,0,0);
+        T[1].push(n-2,0,1);
+        T[2].push(1/dx[n-2],2/dx[n-2]+2/dx[0],1/dx[0]);
+        break;
+    default:
+        b[0] = k1;
+        T[0].push(0);
+        T[1].push(0);
+        T[2].push(1);
+        break;
+    }
+    for(i=1;i20) { throw new Error("Numerical gradient fails"); }
+            x0[i] = x[i]+h;
+            f1 = f(x0);
+            x0[i] = x[i]-h;
+            f2 = f(x0);
+            x0[i] = x[i];
+            if(isNaN(f1) || isNaN(f2)) { h/=16; continue; }
+            J[i] = (f1-f2)/(2*h);
+            t0 = x[i]-h;
+            t1 = x[i];
+            t2 = x[i]+h;
+            d1 = (f1-f0)/h;
+            d2 = (f0-f2)/h;
+            N = max(abs(J[i]),abs(f0),abs(f1),abs(f2),abs(t0),abs(t1),abs(t2),1e-8);
+            errest = min(max(abs(d1-J[i]),abs(d2-J[i]),abs(d1-d2))/N,h/N);
+            if(errest>eps) { h/=16; }
+            else break;
+            }
+    }
+    return J;
+};
+
+numeric.uncmin = function uncmin(f,x0,tol,gradient,maxit,callback,options) {
+    var grad = numeric.gradient;
+    if(typeof options === "undefined") { options = {}; }
+    if(typeof tol === "undefined") { tol = 1e-8; }
+    if(typeof gradient === "undefined") { gradient = function(x) { return grad(f,x); }; }
+    if(typeof maxit === "undefined") maxit = 1000;
+    x0 = numeric.clone(x0);
+    var n = x0.length;
+    var f0 = f(x0),f1,df0;
+    if(isNaN(f0)) throw new Error('uncmin: f(x0) is a NaN!');
+    var max = Math.max, norm2 = numeric.norm2;
+    tol = max(tol,numeric.epsilon);
+    var step,g0,g1,H1 = options.Hinv || numeric.identity(n);
+    var dot = numeric.dot, inv = numeric.inv, sub = numeric.sub, add = numeric.add, ten = numeric.tensor, div = numeric.div, mul = numeric.mul;
+    var all = numeric.all, isfinite = numeric.isFinite, neg = numeric.neg;
+    var it=0,i,s,x1,y,Hy,Hs,ys,i0,t,nstep,t1,t2;
+    var msg = "";
+    g0 = gradient(x0);
+    while(it= 0.1*t*df0 || isNaN(f1)) {
+                t *= 0.5;
+                ++it;
+                continue;
+            }
+            break;
+        }
+        if(t*nstep < tol) { msg = "Line search step size smaller than tol"; break; }
+        if(it === maxit) { msg = "maxit reached during line search"; break; }
+        g1 = gradient(x1);
+        y = sub(g1,g0);
+        ys = dot(y,s);
+        Hy = dot(H1,y);
+        H1 = sub(add(H1,
+                mul(
+                        (ys+dot(y,Hy))/(ys*ys),
+                        ten(s,s)    )),
+                div(add(ten(Hy,s),ten(s,Hy)),ys));
+        x0 = x1;
+        f0 = f1;
+        g0 = g1;
+        ++it;
+    }
+    return {solution: x0, f: f0, gradient: g0, invHessian: H1, iterations:it, message: msg};
+};
+
+// 10. Ode solver (Dormand-Prince)
+numeric.Dopri = function Dopri(x,y,f,ymid,iterations,msg,events) {
+    this.x = x;
+    this.y = y;
+    this.f = f;
+    this.ymid = ymid;
+    this.iterations = iterations;
+    this.events = events;
+    this.message = msg;
+};
+
+numeric.Dopri.prototype._at = function _at(xi,j) {
+    function sqr(x) { return x*x; }
+    var sol = this;
+    var xs = sol.x;
+    var ys = sol.y;
+    var k1 = sol.f;
+    var ymid = sol.ymid;
+    var n = xs.length;
+    var x0,x1,xh,y0,y1,yh,xi;
+    var floor = Math.floor,h;
+    var c = 0.5;
+    var add = numeric.add, mul = numeric.mul,sub = numeric.sub, p,q,w;
+    x0 = xs[j];
+    x1 = xs[j+1];
+    y0 = ys[j];
+    y1 = ys[j+1];
+    h  = x1-x0;
+    xh = x0+c*h;
+    yh = ymid[j];
+    p = sub(k1[j  ],mul(y0,1/(x0-xh)+2/(x0-x1)));
+    q = sub(k1[j+1],mul(y1,1/(x1-xh)+2/(x1-x0)));
+    w = [sqr(xi - x1) * (xi - xh) / sqr(x0 - x1) / (x0 - xh),
+         sqr(xi - x0) * sqr(xi - x1) / sqr(x0 - xh) / sqr(x1 - xh),
+         sqr(xi - x0) * (xi - xh) / sqr(x1 - x0) / (x1 - xh),
+         (xi - x0) * sqr(xi - x1) * (xi - xh) / sqr(x0-x1) / (x0 - xh),
+         (xi - x1) * sqr(xi - x0) * (xi - xh) / sqr(x0-x1) / (x1 - xh)];
+    return add(add(add(add(mul(y0,w[0]),
+                           mul(yh,w[1])),
+                           mul(y1,w[2])),
+                           mul( p,w[3])),
+                           mul( q,w[4]));
+};
+
+numeric.Dopri.prototype.at = function at(x) {
+    var i,j,k,floor = Math.floor;
+    if(typeof x !== "number") {
+        var n = x.length, ret = Array(n);
+        for(i=n-1;i!==-1;--i) {
+            ret[i] = this.at(x[i]);
+        }
+        return ret;
+    }
+    var x0 = this.x;
+    i = 0; j = x0.length-1;
+    while(j-i>1) {
+        k = floor(0.5*(i+j));
+        if(x0[k] <= x) i = k;
+        else j = k;
+    }
+    return this._at(x,i);
+};
+
+numeric.dopri = function dopri(x0,x1,y0,f,tol,maxit,event) {
+    if(typeof tol === "undefined") { tol = 1e-6; }
+    if(typeof maxit === "undefined") { maxit = 1000; }
+    var xs = [x0], ys = [y0], k1 = [f(x0,y0)], k2,k3,k4,k5,k6,k7, ymid = [];
+    var A2 = 1/5;
+    var A3 = [3/40,9/40];
+    var A4 = [44/45,-56/15,32/9];
+    var A5 = [19372/6561,-25360/2187,64448/6561,-212/729];
+    var A6 = [9017/3168,-355/33,46732/5247,49/176,-5103/18656];
+    var b = [35/384,0,500/1113,125/192,-2187/6784,11/84];
+    var bm = [0.5*6025192743/30085553152,
+              0,
+              0.5*51252292925/65400821598,
+              0.5*-2691868925/45128329728,
+              0.5*187940372067/1594534317056,
+              0.5*-1776094331/19743644256,
+              0.5*11237099/235043384];
+    var c = [1/5,3/10,4/5,8/9,1,1];
+    var e = [-71/57600,0,71/16695,-71/1920,17253/339200,-22/525,1/40];
+    var i = 0,er,j;
+    var h = (x1-x0)/10;
+    var it = 0;
+    var add = numeric.add, mul = numeric.mul, y1,erinf;
+    var max = Math.max, min = Math.min, abs = Math.abs, norminf = numeric.norminf,pow = Math.pow;
+    var any = numeric.any, lt = numeric.lt, and = numeric.and, sub = numeric.sub;
+    var e0, e1, ev;
+    var ret = new numeric.Dopri(xs,ys,k1,ymid,-1,"");
+    if(typeof event === "function") e0 = event(x0,y0);
+    while(x0x1) h = x1-x0;
+        k2 = f(x0+c[0]*h,                add(y0,mul(   A2*h,k1[i])));
+        k3 = f(x0+c[1]*h,            add(add(y0,mul(A3[0]*h,k1[i])),mul(A3[1]*h,k2)));
+        k4 = f(x0+c[2]*h,        add(add(add(y0,mul(A4[0]*h,k1[i])),mul(A4[1]*h,k2)),mul(A4[2]*h,k3)));
+        k5 = f(x0+c[3]*h,    add(add(add(add(y0,mul(A5[0]*h,k1[i])),mul(A5[1]*h,k2)),mul(A5[2]*h,k3)),mul(A5[3]*h,k4)));
+        k6 = f(x0+c[4]*h,add(add(add(add(add(y0,mul(A6[0]*h,k1[i])),mul(A6[1]*h,k2)),mul(A6[2]*h,k3)),mul(A6[3]*h,k4)),mul(A6[4]*h,k5)));
+        y1 = add(add(add(add(add(y0,mul(k1[i],h*b[0])),mul(k3,h*b[2])),mul(k4,h*b[3])),mul(k5,h*b[4])),mul(k6,h*b[5]));
+        k7 = f(x0+h,y1);
+        er = add(add(add(add(add(mul(k1[i],h*e[0]),mul(k3,h*e[2])),mul(k4,h*e[3])),mul(k5,h*e[4])),mul(k6,h*e[5])),mul(k7,h*e[6]));
+        if(typeof er === "number") erinf = abs(er);
+        else erinf = norminf(er);
+        if(erinf > tol) { // reject
+            h = 0.2*h*pow(tol/erinf,0.25);
+            if(x0+h === x0) {
+                ret.msg = "Step size became too small";
+                break;
+            }
+            continue;
+        }
+        ymid[i] = add(add(add(add(add(add(y0,
+                mul(k1[i],h*bm[0])),
+                mul(k3   ,h*bm[2])),
+                mul(k4   ,h*bm[3])),
+                mul(k5   ,h*bm[4])),
+                mul(k6   ,h*bm[5])),
+                mul(k7   ,h*bm[6]));
+        ++i;
+        xs[i] = x0+h;
+        ys[i] = y1;
+        k1[i] = k7;
+        if(typeof event === "function") {
+            var yi,xl = x0,xr = x0+0.5*h,xi;
+            e1 = event(xr,ymid[i-1]);
+            ev = and(lt(e0,0),lt(0,e1));
+            if(!any(ev)) { xl = xr; xr = x0+h; e0 = e1; e1 = event(xr,y1); ev = and(lt(e0,0),lt(0,e1)); }
+            if(any(ev)) {
+                var xc, yc, en,ei;
+                var side=0, sl = 1.0, sr = 1.0;
+                while(1) {
+                    if(typeof e0 === "number") xi = (sr*e1*xl-sl*e0*xr)/(sr*e1-sl*e0);
+                    else {
+                        xi = xr;
+                        for(j=e0.length-1;j!==-1;--j) {
+                            if(e0[j]<0 && e1[j]>0) xi = min(xi,(sr*e1[j]*xl-sl*e0[j]*xr)/(sr*e1[j]-sl*e0[j]));
+                        }
+                    }
+                    if(xi <= xl || xi >= xr) break;
+                    yi = ret._at(xi, i-1);
+                    ei = event(xi,yi);
+                    en = and(lt(e0,0),lt(0,ei));
+                    if(any(en)) {
+                        xr = xi;
+                        e1 = ei;
+                        ev = en;
+                        sr = 1.0;
+                        if(side === -1) sl *= 0.5;
+                        else sl = 1.0;
+                        side = -1;
+                    } else {
+                        xl = xi;
+                        e0 = ei;
+                        sl = 1.0;
+                        if(side === 1) sr *= 0.5;
+                        else sr = 1.0;
+                        side = 1;
+                    }
+                }
+                y1 = ret._at(0.5*(x0+xi),i-1);
+                ret.f[i] = f(xi,yi);
+                ret.x[i] = xi;
+                ret.y[i] = yi;
+                ret.ymid[i-1] = y1;
+                ret.events = ev;
+                ret.iterations = it;
+                return ret;
+            }
+        }
+        x0 += h;
+        y0 = y1;
+        e0 = e1;
+        h = min(0.8*h*pow(tol/erinf,0.25),4*h);
+    }
+    ret.iterations = it;
+    return ret;
+};
+
+// 11. Ax = b
+numeric.LU = function(A, fast) {
+  fast = fast || false;
+
+  var abs = Math.abs;
+  var i, j, k, absAjk, Akk, Ak, Pk, Ai;
+  var max;
+  var n = A.length, n1 = n-1;
+  var P = new Array(n);
+  if(!fast) A = numeric.clone(A);
+
+  for (k = 0; k < n; ++k) {
+    Pk = k;
+    Ak = A[k];
+    max = abs(Ak[k]);
+    for (j = k + 1; j < n; ++j) {
+      absAjk = abs(A[j][k]);
+      if (max < absAjk) {
+        max = absAjk;
+        Pk = j;
+      }
+    }
+    P[k] = Pk;
+
+    if (Pk != k) {
+      A[k] = A[Pk];
+      A[Pk] = Ak;
+      Ak = A[k];
+    }
+
+    Akk = Ak[k];
+
+    for (i = k + 1; i < n; ++i) {
+      A[i][k] /= Akk;
+    }
+
+    for (i = k + 1; i < n; ++i) {
+      Ai = A[i];
+      for (j = k + 1; j < n1; ++j) {
+        Ai[j] -= Ai[k] * Ak[j];
+        ++j;
+        Ai[j] -= Ai[k] * Ak[j];
+      }
+      if(j===n1) Ai[j] -= Ai[k] * Ak[j];
+    }
+  }
+
+  return {
+    LU: A,
+    P:  P
+  };
+};
+
+numeric.LUsolve = function LUsolve(LUP, b) {
+  var i, j;
+  var LU = LUP.LU;
+  var n   = LU.length;
+  var x = numeric.clone(b);
+  var P   = LUP.P;
+  var Pi, LUi, LUii, tmp;
+
+  for (i=n-1;i!==-1;--i) x[i] = b[i];
+  for (i = 0; i < n; ++i) {
+    Pi = P[i];
+    if (P[i] !== i) {
+      tmp = x[i];
+      x[i] = x[Pi];
+      x[Pi] = tmp;
+    }
+
+    LUi = LU[i];
+    for (j = 0; j < i; ++j) {
+      x[i] -= x[j] * LUi[j];
+    }
+  }
+
+  for (i = n - 1; i >= 0; --i) {
+    LUi = LU[i];
+    for (j = i + 1; j < n; ++j) {
+      x[i] -= x[j] * LUi[j];
+    }
+
+    x[i] /= LUi[i];
+  }
+
+  return x;
+};
+
+numeric.solve = function solve(A,b,fast) { return numeric.LUsolve(numeric.LU(A,fast), b); };
+
+// 12. Linear programming
+numeric.echelonize = function echelonize(A) {
+    var s = numeric.dim(A), m = s[0], n = s[1];
+    var I = numeric.identity(m);
+    var P = Array(m);
+    var i,j,k,l,Ai,Ii,Z,a;
+    var abs = Math.abs;
+    var diveq = numeric.diveq;
+    A = numeric.clone(A);
+    for(i=0;ia1) alpha = a1;
+        g = add(c,mul(alpha,p));
+        H = dot(A1,A0);
+        for(i=m-1;i!==-1;--i) H[i][i] += 1;
+        d = solve(H,div(g,alpha),true);
+        var t0 = div(z,dot(A,d));
+        var t = 1.0;
+        for(i=n-1;i!==-1;--i) if(t0[i]<0) t = min(t,-0.999*t0[i]);
+        y = sub(x,mul(d,t));
+        z = sub(b,dot(A,y));
+        if(!all(gt(z,0))) return { solution: x, message: "", iterations: count };
+        x = y;
+        if(alpha=0) unbounded = false;
+            else unbounded = true;
+        }
+        if(unbounded) return { solution: y, message: "Unbounded", iterations: count };
+    }
+    return { solution: x, message: "maximum iteration count exceeded", iterations:count };
+};
+
+numeric._solveLP = function _solveLP(c,A,b,tol,maxit) {
+    var m = c.length, n = b.length,y;
+    var sum = numeric.sum, log = numeric.log, mul = numeric.mul, sub = numeric.sub, dot = numeric.dot, div = numeric.div, add = numeric.add;
+    var c0 = numeric.rep([m],0).concat([1]);
+    var J = numeric.rep([n,1],-1);
+    var A0 = numeric.blockMatrix([[A                   ,   J  ]]);
+    var b0 = b;
+    var y = numeric.rep([m],0).concat(Math.max(0,numeric.sup(numeric.neg(b)))+1);
+    var x0 = numeric.__solveLP(c0,A0,b0,tol,maxit,y,false);
+    var x = numeric.clone(x0.solution);
+    x.length = m;
+    var foo = numeric.inf(sub(b,dot(A,x)));
+    if(foo<0) { return { solution: NaN, message: "Infeasible", iterations: x0.iterations }; }
+    var ret = numeric.__solveLP(c, A, b, tol, maxit-x0.iterations, x, true);
+    ret.iterations += x0.iterations;
+    return ret;
+};
+
+numeric.solveLP = function solveLP(c,A,b,Aeq,beq,tol,maxit) {
+    if(typeof maxit === "undefined") maxit = 1000;
+    if(typeof tol === "undefined") tol = numeric.epsilon;
+    if(typeof Aeq === "undefined") return numeric._solveLP(c,A,b,tol,maxit);
+    var m = Aeq.length, n = Aeq[0].length, o = A.length;
+    var B = numeric.echelonize(Aeq);
+    var flags = numeric.rep([n],0);
+    var P = B.P;
+    var Q = [];
+    var i;
+    for(i=P.length-1;i!==-1;--i) flags[P[i]] = 1;
+    for(i=n-1;i!==-1;--i) if(flags[i]===0) Q.push(i);
+    var g = numeric.getRange;
+    var I = numeric.linspace(0,m-1), J = numeric.linspace(0,o-1);
+    var Aeq2 = g(Aeq,I,Q), A1 = g(A,J,P), A2 = g(A,J,Q), dot = numeric.dot, sub = numeric.sub;
+    var A3 = dot(A1,B.I);
+    var A4 = sub(A2,dot(A3,Aeq2)), b4 = sub(b,dot(A3,beq));
+    var c1 = Array(P.length), c2 = Array(Q.length);
+    for(i=P.length-1;i!==-1;--i) c1[i] = c[P[i]];
+    for(i=Q.length-1;i!==-1;--i) c2[i] = c[Q[i]];
+    var c4 = sub(c2,dot(c1,dot(B.I,Aeq2)));
+    var S = numeric._solveLP(c4,A4,b4,tol,maxit);
+    var x2 = S.solution;
+    if(x2!==x2) return S;
+    var x1 = dot(B.I,sub(beq,dot(Aeq2,x2)));
+    var x = Array(c.length);
+    for(i=P.length-1;i!==-1;--i) x[P[i]] = x1[i];
+    for(i=Q.length-1;i!==-1;--i) x[Q[i]] = x2[i];
+    return { solution: x, message:S.message, iterations: S.iterations };
+};
+
+numeric.MPStoLP = function MPStoLP(MPS) {
+    if(MPS instanceof String) { MPS.split('\n'); }
+    var state = 0;
+    var states = ['Initial state','NAME','ROWS','COLUMNS','RHS','BOUNDS','ENDATA'];
+    var n = MPS.length;
+    var i,j,z,N=0,rows = {}, sign = [], rl = 0, vars = {}, nv = 0;
+    var name;
+    var c = [], A = [], b = [];
+    function err(e) { throw new Error('MPStoLP: '+e+'\nLine '+i+': '+MPS[i]+'\nCurrent state: '+states[state]+'\n'); }
+    for(i=0;i
+//
+//   Math.seedrandom('yipee'); Sets Math.random to a function that is
+//                             initialized using the given explicit seed.
+//
+//   Math.seedrandom();        Sets Math.random to a function that is
+//                             seeded using the current time, dom state,
+//                             and other accumulated local entropy.
+//                             The generated seed string is returned.
+//
+//   Math.seedrandom('yowza', true);
+//                             Seeds using the given explicit seed mixed
+//                             together with accumulated entropy.
+//
+//   
+//                             Seeds using physical random bits downloaded
+//                             from random.org.
+//
+//                    Seeds using urandom bits from call.jsonlib.com,
+//                             which is faster than random.org.
+//
+// Examples:
+//
+//   Math.seedrandom("hello");            // Use "hello" as the seed.
+//   document.write(Math.random());       // Always 0.5463663768140734
+//   document.write(Math.random());       // Always 0.43973793770592234
+//   var rng1 = Math.random;              // Remember the current prng.
+//
+//   var autoseed = Math.seedrandom();    // New prng with an automatic seed.
+//   document.write(Math.random());       // Pretty much unpredictable.
+//
+//   Math.random = rng1;                  // Continue "hello" prng sequence.
+//   document.write(Math.random());       // Always 0.554769432473455
+//
+//   Math.seedrandom(autoseed);           // Restart at the previous seed.
+//   document.write(Math.random());       // Repeat the 'unpredictable' value.
+//
+// Notes:
+//
+// Each time seedrandom('arg') is called, entropy from the passed seed
+// is accumulated in a pool to help generate future seeds for the
+// zero-argument form of Math.seedrandom, so entropy can be injected over
+// time by calling seedrandom with explicit data repeatedly.
+//
+// On speed - This javascript implementation of Math.random() is about
+// 3-10x slower than the built-in Math.random() because it is not native
+// code, but this is typically fast enough anyway.  Seeding is more expensive,
+// especially if you use auto-seeding.  Some details (timings on Chrome 4):
+//
+// Our Math.random()            - avg less than 0.002 milliseconds per call
+// seedrandom('explicit')       - avg less than 0.5 milliseconds per call
+// seedrandom('explicit', true) - avg less than 2 milliseconds per call
+// seedrandom()                 - avg about 38 milliseconds per call
+//
+// LICENSE (BSD):
+//
+// Copyright 2010 David Bau, all rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+//
+//   1. Redistributions of source code must retain the above copyright
+//      notice, this list of conditions and the following disclaimer.
+//
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+//
+//   3. Neither the name of this module nor the names of its contributors may
+//      be used to endorse or promote products derived from this software
+//      without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+/**
+ * All code is in an anonymous closure to keep the global namespace clean.
+ *
+ * @param {number=} overflow
+ * @param {number=} startdenom
+ */
+
+// Patched by Seb so that seedrandom.js does not pollute the Math object.
+// My tests suggest that doing Math.trouble = 1 makes Math lookups about 5%
+// slower.
+numeric.seedrandom = { pow:Math.pow, random:Math.random };
+
+(function (pool, math, width, chunks, significance, overflow, startdenom) {
+
+
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+math['seedrandom'] = function seedrandom(seed, use_entropy) {
+  var key = [];
+  var arc4;
+
+  // Flatten the seed string or build one from local entropy if needed.
+  seed = mixkey(flatten(
+    use_entropy ? [seed, pool] :
+    arguments.length ? seed :
+    [new Date().getTime(), pool, window], 3), key);
+
+  // Use the seed to initialize an ARC4 generator.
+  arc4 = new ARC4(key);
+
+  // Mix the randomness into accumulated entropy.
+  mixkey(arc4.S, pool);
+
+  // Override Math.random
+
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+
+  math['random'] = function random() {  // Closure to return a random double:
+    var n = arc4.g(chunks);             // Start with a numerator n < 2 ^ 48
+    var d = startdenom;                 //   and denominator d = 2 ^ 48.
+    var x = 0;                          //   and no 'extra last byte'.
+    while (n < significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n >= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x >>>= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+
+  // Return the seed that was used
+  return seed;
+};
+
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 <= x < (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 <= x < (width ^ count).
+//
+/** @constructor */
+function ARC4(key) {
+  var t, u, me = this, keylen = key.length;
+  var i = 0, j = me.i = me.j = me.m = 0;
+  me.S = [];
+  me.c = [];
+
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+
+  // Set up S using the standard key scheduling algorithm.
+  while (i < width) { me.S[i] = i++; }
+  for (i = 0; i < width; i++) {
+    t = me.S[i];
+    j = lowbits(j + t + key[i % keylen]);
+    u = me.S[j];
+    me.S[i] = u;
+    me.S[j] = t;
+  }
+
+  // The "g" method returns the next (count) outputs as one number.
+  me.g = function getnext(count) {
+    var s = me.S;
+    var i = lowbits(me.i + 1); var t = s[i];
+    var j = lowbits(me.j + t); var u = s[j];
+    s[i] = u;
+    s[j] = t;
+    var r = s[lowbits(t + u)];
+    while (--count) {
+      i = lowbits(i + 1); t = s[i];
+      j = lowbits(j + t); u = s[j];
+      s[i] = u;
+      s[j] = t;
+      r = r * width + s[lowbits(t + u)];
+    }
+    me.i = i;
+    me.j = j;
+    return r;
+  };
+  // For robust unpredictability discard an initial batch of values.
+  // See http://www.rsa.com/rsalabs/node.asp?id=2009
+  me.g(width);
+}
+
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+/** @param {Object=} result
+  * @param {string=} prop
+  * @param {string=} typ */
+function flatten(obj, depth, result, prop, typ) {
+  result = [];
+  typ = typeof(obj);
+  if (depth && typ == 'object') {
+    for (prop in obj) {
+      if (prop.indexOf('S') < 5) {    // Avoid FF3 bug (local/sessionStorage)
+        try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+      }
+    }
+  }
+  return (result.length ? result : obj + (typ != 'string' ? '\0' : ''));
+}
+
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+/** @param {number=} smear
+  * @param {number=} j */
+function mixkey(seed, key, smear, j) {
+  seed += '';                         // Ensure the seed is a string
+  smear = 0;
+  for (j = 0; j < seed.length; j++) {
+    key[lowbits(j)] =
+      lowbits((smear ^= key[lowbits(j)] * 19) + seed.charCodeAt(j));
+  }
+  seed = '';
+  for (j in key) { seed += String.fromCharCode(key[j]); }
+  return seed;
+}
+
+//
+// lowbits()
+// A quick "n mod width" for width a power of 2.
+//
+function lowbits(n) { return n & (width - 1); }
+
+//
+// The following constants are related to IEEE 754 limits.
+//
+startdenom = math.pow(width, chunks);
+significance = math.pow(2, significance);
+overflow = significance * 2;
+
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to intefere with determinstic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+
+// End anonymous scope, and pass initial values.
+}(
+  [],   // pool: entropy pool starts empty
+  numeric.seedrandom, // math: package containing random, pow, and seedrandom
+  256,  // width: each RC4 output is 0 <= x < 256
+  6,    // chunks: at least six RC4 outputs for each double
+  52    // significance: there are 52 significant digits in a double
+  ));
+/* This file is a slightly modified version of quadprog.js from Alberto Santini.
+ * It has been slightly modified by Sébastien Loisel to make sure that it handles
+ * 0-based Arrays instead of 1-based Arrays.
+ * License is in resources/LICENSE.quadprog */
+
+function base0to1(A) {
+    if(typeof A !== "object") { return A; }
+    var ret = [], i,n=A.length;
+    for(i=0;i meq) {
+                work[l] = sum;
+            } else {
+                work[l] = -Math.abs(sum);
+                if (sum > 0) {
+                    for (j = 1; j <= n; j = j + 1) {
+                        amat[j][i] = -amat[j][i];
+                    }
+                    bvec[i] = -bvec[i];
+                }
+            }
+        }
+
+        for (i = 1; i <= nact; i = i + 1) {
+            work[iwsv + iact[i]] = 0;
+        }
+
+        nvl = 0;
+        temp = 0;
+        for (i = 1; i <= q; i = i + 1) {
+            if (work[iwsv + i] < temp * work[iwnbv + i]) {
+                nvl = i;
+                temp = work[iwsv + i] / work[iwnbv + i];
+            }
+        }
+        if (nvl === 0) {
+            return 999;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_55() {
+        for (i = 1; i <= n; i = i + 1) {
+            sum = 0;
+            for (j = 1; j <= n; j = j + 1) {
+                sum = sum + dmat[j][i] * amat[j][nvl];
+            }
+            work[i] = sum;
+        }
+
+        l1 = iwzv;
+        for (i = 1; i <= n; i = i + 1) {
+            work[l1 + i] = 0;
+        }
+        for (j = nact + 1; j <= n; j = j + 1) {
+            for (i = 1; i <= n; i = i + 1) {
+                work[l1 + i] = work[l1 + i] + dmat[i][j] * work[j];
+            }
+        }
+
+        t1inf = true;
+        for (i = nact; i >= 1; i = i - 1) {
+            sum = work[i];
+            l = iwrm + (i * (i + 3)) / 2;
+            l1 = l - i;
+            for (j = i + 1; j <= nact; j = j + 1) {
+                sum = sum - work[l] * work[iwrv + j];
+                l = l + j;
+            }
+            sum = sum / work[l1];
+            work[iwrv + i] = sum;
+            if (iact[i] < meq) {
+                // continue;
+                break;
+            }
+            if (sum < 0) {
+                // continue;
+                break;
+            }
+            t1inf = false;
+            it1 = i;
+        }
+
+        if (!t1inf) {
+            t1 = work[iwuv + it1] / work[iwrv + it1];
+            for (i = 1; i <= nact; i = i + 1) {
+                if (iact[i] < meq) {
+                    // continue;
+                    break;
+                }
+                if (work[iwrv + i] < 0) {
+                    // continue;
+                    break;
+                }
+                temp = work[iwuv + i] / work[iwrv + i];
+                if (temp < t1) {
+                    t1 = temp;
+                    it1 = i;
+                }
+            }
+        }
+
+        sum = 0;
+        for (i = iwzv + 1; i <= iwzv + n; i = i + 1) {
+            sum = sum + work[i] * work[i];
+        }
+        if (Math.abs(sum) <= vsmall) {
+            if (t1inf) {
+                ierr[1] = 1;
+                // GOTO 999
+                return 999;
+            } else {
+                for (i = 1; i <= nact; i = i + 1) {
+                    work[iwuv + i] = work[iwuv + i] - t1 * work[iwrv + i];
+                }
+                work[iwuv + nact + 1] = work[iwuv + nact + 1] + t1;
+                // GOTO 700
+                return 700;
+            }
+        } else {
+            sum = 0;
+            for (i = 1; i <= n; i = i + 1) {
+                sum = sum + work[iwzv + i] * amat[i][nvl];
+            }
+            tt = -work[iwsv + nvl] / sum;
+            t2min = true;
+            if (!t1inf) {
+                if (t1 < tt) {
+                    tt = t1;
+                    t2min = false;
+                }
+            }
+
+            for (i = 1; i <= n; i = i + 1) {
+                sol[i] = sol[i] + tt * work[iwzv + i];
+                if (Math.abs(sol[i]) < vsmall) {
+                    sol[i] = 0;
+                }
+            }
+
+            crval[1] = crval[1] + tt * sum * (tt / 2 + work[iwuv + nact + 1]);
+            for (i = 1; i <= nact; i = i + 1) {
+                work[iwuv + i] = work[iwuv + i] - tt * work[iwrv + i];
+            }
+            work[iwuv + nact + 1] = work[iwuv + nact + 1] + tt;
+
+            if (t2min) {
+                nact = nact + 1;
+                iact[nact] = nvl;
+
+                l = iwrm + ((nact - 1) * nact) / 2 + 1;
+                for (i = 1; i <= nact - 1; i = i + 1) {
+                    work[l] = work[i];
+                    l = l + 1;
+                }
+
+                if (nact === n) {
+                    work[l] = work[n];
+                } else {
+                    for (i = n; i >= nact + 1; i = i - 1) {
+                        if (work[i] === 0) {
+                            // continue;
+                            break;
+                        }
+                        gc = Math.max(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        gs = Math.min(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        if (work[i - 1] >= 0) {
+                            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        } else {
+                            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        }
+                        gc = work[i - 1] / temp;
+                        gs = work[i] / temp;
+
+                        if (gc === 1) {
+                            // continue;
+                            break;
+                        }
+                        if (gc === 0) {
+                            work[i - 1] = gs * temp;
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = dmat[j][i - 1];
+                                dmat[j][i - 1] = dmat[j][i];
+                                dmat[j][i] = temp;
+                            }
+                        } else {
+                            work[i - 1] = temp;
+                            nu = gs / (1 + gc);
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = gc * dmat[j][i - 1] + gs * dmat[j][i];
+                                dmat[j][i] = nu * (dmat[j][i - 1] + temp) - dmat[j][i];
+                                dmat[j][i - 1] = temp;
+
+                            }
+                        }
+                    }
+                    work[l] = work[nact];
+                }
+            } else {
+                sum = -bvec[nvl];
+                for (j = 1; j <= n; j = j + 1) {
+                    sum = sum + sol[j] * amat[j][nvl];
+                }
+                if (nvl > meq) {
+                    work[iwsv + nvl] = sum;
+                } else {
+                    work[iwsv + nvl] = -Math.abs(sum);
+                    if (sum > 0) {
+                        for (j = 1; j <= n; j = j + 1) {
+                            amat[j][nvl] = -amat[j][nvl];
+                        }
+                        bvec[nvl] = -bvec[nvl];
+                    }
+                }
+                // GOTO 700
+                return 700;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_797() {
+        l = iwrm + (it1 * (it1 + 1)) / 2 + 1;
+        l1 = l + it1;
+        if (work[l1] === 0) {
+            // GOTO 798
+            return 798;
+        }
+        gc = Math.max(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        gs = Math.min(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        if (work[l1 - 1] >= 0) {
+            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        } else {
+            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        }
+        gc = work[l1 - 1] / temp;
+        gs = work[l1] / temp;
+
+        if (gc === 1) {
+            // GOTO 798
+            return 798;
+        }
+        if (gc === 0) {
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = work[l1 - 1];
+                work[l1 - 1] = work[l1];
+                work[l1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = dmat[i][it1];
+                dmat[i][it1] = dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = temp;
+            }
+        } else {
+            nu = gs / (1 + gc);
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = gc * work[l1 - 1] + gs * work[l1];
+                work[l1] = nu * (work[l1 - 1] + temp) - work[l1];
+                work[l1 - 1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = gc * dmat[i][it1] + gs * dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = nu * (dmat[i][it1] + temp) - dmat[i][it1 + 1];
+                dmat[i][it1] = temp;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_798() {
+        l1 = l - it1;
+        for (i = 1; i <= it1; i = i + 1) {
+            work[l1] = work[l];
+            l = l + 1;
+            l1 = l1 + 1;
+        }
+
+        work[iwuv + it1] = work[iwuv + it1 + 1];
+        iact[it1] = iact[it1 + 1];
+        it1 = it1 + 1;
+        if (it1 < nact) {
+            // GOTO 797
+            return 797;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_799() {
+        work[iwuv + nact] = work[iwuv + nact + 1];
+        work[iwuv + nact + 1] = 0;
+        iact[nact] = 0;
+        nact = nact - 1;
+        iter[2] = iter[2] + 1;
+
+        return 0;
+    }
+
+    go = 0;
+    while (true) {
+        go = fn_goto_50();
+        if (go === 999) {
+            return;
+        }
+        while (true) {
+            go = fn_goto_55();
+            if (go === 0) {
+                break;
+            }
+            if (go === 999) {
+                return;
+            }
+            if (go === 700) {
+                if (it1 === nact) {
+                    fn_goto_799();
+                } else {
+                    while (true) {
+                        fn_goto_797();
+                        go = fn_goto_798();
+                        if (go !== 797) {
+                            break;
+                        }
+                    }
+                    fn_goto_799();
+                }
+            }
+        }
+    }
+
+}
+
+function solveQP(Dmat, dvec, Amat, bvec, meq, factorized) {
+    Dmat = base0to1(Dmat);
+    dvec = base0to1(dvec);
+    Amat = base0to1(Amat);
+    var i, n, q,
+        nact, r,
+        crval = [], iact = [], sol = [], work = [], iter = [],
+        message;
+
+    meq = meq || 0;
+    factorized = factorized ? base0to1(factorized) : [undefined, 0];
+    bvec = bvec ? base0to1(bvec) : [];
+
+    // In Fortran the array index starts from 1
+    n = Dmat.length - 1;
+    q = Amat[1].length - 1;
+
+    if (!bvec) {
+        for (i = 1; i <= q; i = i + 1) {
+            bvec[i] = 0;
+        }
+    }
+    for (i = 1; i <= q; i = i + 1) {
+        iact[i] = 0;
+    }
+    nact = 0;
+    r = Math.min(n, q);
+    for (i = 1; i <= n; i = i + 1) {
+        sol[i] = 0;
+    }
+    crval[1] = 0;
+    for (i = 1; i <= (2 * n + (r * (r + 5)) / 2 + 2 * q + 1); i = i + 1) {
+        work[i] = 0;
+    }
+    for (i = 1; i <= 2; i = i + 1) {
+        iter[i] = 0;
+    }
+
+    qpgen2(Dmat, dvec, n, n, sol, crval, Amat,
+        bvec, n, q, meq, iact, nact, iter, work, factorized);
+
+    message = "";
+    if (factorized[1] === 1) {
+        message = "constraints are inconsistent, no solution!";
+    }
+    if (factorized[1] === 2) {
+        message = "matrix D in quadratic function is not positive definite!";
+    }
+
+    return {
+        solution: base1to0(sol),
+        value: base1to0(crval),
+        unconstrained_solution: base1to0(dvec),
+        iterations: base1to0(iter),
+        iact: base1to0(iact),
+        message: message
+    };
+}
+
+numeric.solveQP = solveQP;
+/*
+Shanti Rao sent me this routine by private email. I had to modify it
+slightly to work on Arrays instead of using a Matrix object.
+It is apparently translated from http://stitchpanorama.sourceforge.net/Python/svd.py
+*/
+
+numeric.svd= function svd(A) {
+    var temp;
+//Compute the thin SVD from G. H. Golub and C. Reinsch, Numer. Math. 14, 403-420 (1970)
+    var prec= numeric.epsilon; //Math.pow(2,-52) // assumes double prec
+    var tolerance= 1.e-64/prec;
+    var itmax= 50;
+    var c=0;
+    var i=0;
+    var j=0;
+    var k=0;
+    var l=0;
+
+    var u= numeric.clone(A);
+    var m= u.length;
+
+    var n= u[0].length;
+
+    if (m < n) throw "Need more rows than columns";
+
+    var e = new Array(n);
+    var q = new Array(n);
+    for (i=0; i b)
+            return a*Math.sqrt(1.0+(b*b/a/a));
+        else if (b == 0.0)
+            return a;
+        return b*Math.sqrt(1.0+(a*a/b/b));
+    }
+
+    //Householder's reduction to bidiagonal form
+
+    var f= 0.0;
+    var g= 0.0;
+    var h= 0.0;
+    var x= 0.0;
+    var y= 0.0;
+    var z= 0.0;
+    var s= 0.0;
+
+    for (i=0; i < n; i++)
+    {
+        e[i]= g;
+        s= 0.0;
+        l= i+1;
+        for (j=i; j < m; j++)
+            s += (u[j][i]*u[j][i]);
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g-s;
+            u[i][i]=f-g;
+            for (j=l; j < n; j++)
+            {
+                s= 0.0;
+                for (k=i; k < m; k++)
+                    s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++)
+                    u[k][j]+=f*u[k][i];
+            }
+        }
+        q[i]= g;
+        s= 0.0;
+        for (j=l; j < n; j++)
+            s= s + u[i][j]*u[i][j];
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i+1];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g - s;
+            u[i][i+1] = f-g;
+            for (j=l; j < n; j++) e[j]= u[i][j]/h;
+            for (j=l; j < m; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += (u[j][k]*u[i][k]);
+                for (k=l; k < n; k++)
+                    u[j][k]+=s*e[k];
+            }
+        }
+        y= Math.abs(q[i])+Math.abs(e[i]);
+        if (y>x)
+            x=y;
+    }
+
+    // accumulation of right hand gtransformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        if (g != 0.0)
+        {
+            h= g*u[i][i+1];
+            for (j=l; j < n; j++)
+                v[j][i]=u[i][j]/h;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += u[i][k]*v[k][j];
+                for (k=l; k < n; k++)
+                    v[k][j]+=(s*v[k][i]);
+            }
+        }
+        for (j=l; j < n; j++)
+        {
+            v[i][j] = 0;
+            v[j][i] = 0;
+        }
+        v[i][i] = 1;
+        g= e[i];
+        l= i;
+    }
+
+    // accumulation of left hand transformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        l= i+1;
+        g= q[i];
+        for (j=l; j < n; j++)
+            u[i][j] = 0;
+        if (g != 0.0)
+        {
+            h= u[i][i]*g;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < m; k++) s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
+            }
+            for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
+        }
+        else
+            for (j=i; j < m; j++) u[j][i] = 0;
+        u[i][i] += 1;
+    }
+
+    // diagonalization of the bidiagonal form
+    prec= prec*x;
+    for (k=n-1; k != -1; k+= -1)
+    {
+        for (var iteration=0; iteration < itmax; iteration++)
+        {   // test f splitting
+            var test_convergence = false;
+            for (l=k; l != -1; l+= -1)
+            {
+                if (Math.abs(e[l]) <= prec)
+                {   test_convergence= true;
+                    break;
+                }
+                if (Math.abs(q[l-1]) <= prec)
+                    break;
+            }
+            if (!test_convergence)
+            {   // cancellation of e[l] if l>0
+                c= 0.0;
+                s= 1.0;
+                var l1= l-1;
+                for (i =l; i= itmax-1)
+				throw 'Error: no convergence.';
+            // shift from bottom 2x2 minor
+			x= q[l];
+			y= q[k-1];
+			g= e[k-1];
+			h= e[k];
+			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y);
+			g= pythag(f,1.0);
+            if (f < 0.0)
+				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x;
+            else
+				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x;
+            // next QR transformation
+			c= 1.0;
+			s= 1.0;
+            for (i=l+1; i< k+1; i++)
+            {
+				g= e[i];
+				y= q[i];
+				h= s*g;
+				g= c*g;
+				z= pythag(f,h);
+				e[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= x*c+g*s;
+				g= -x*s+g*c;
+				h= y*s;
+				y= y*c;
+                for (j=0; j < n; j++)
+                {
+					x= v[j][i-1];
+					z= v[j][i];
+					v[j][i-1] = x*c+z*s;
+					v[j][i] = -x*s+z*c;
+                }
+				z= pythag(f,h);
+				q[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= c*g+s*y;
+				x= -s*g+c*y;
+                for (j=0; j < m; j++)
+                {
+					y= u[j][i-1];
+					z= u[j][i];
+					u[j][i-1] = y*c+z*s;
+					u[j][i] = -y*s+z*c;
+                }
+            }
+			e[l]= 0.0;
+			e[k]= f;
+			q[k]= x;
+        }
+    }
+
+    //vt= transpose(v)
+    //return (u,q,vt)
+    for (i=0;i= 0; j--)
+     {
+      if (q[j] < q[i])
+      {
+    //  writeln(i,'-',j)
+	   c = q[j];
+	   q[j] = q[i];
+	   q[i] = c;
+       for(k=0;k phi0 && t > epsilon) {
+                var theta = phi1 / phi0;
+                var u = (Math.sqrt(1.0 + 6.0 * theta) - 1.0) / (3.0 * theta);
+                t *= u;
+            }
+            else {
+                this.copyVariables(x, x_new);
+                break;
+            }
+        }
+    }
+
+    // add -dx to x to get the new variables
+    //
+    this.getNewVariableValue = function (x, dx, t) {
+        var x_new = new Array(x.length);
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x_new[i] = x[i] - t*dx[i];
+        }
+        
+        return x_new;
+    }
+
+    // copy x_new to x
+    //
+    this.copyVariables = function (x, x_new) {
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x[i] = x_new[i]
+        }
+    }
+
+    // evaluate the function value's residual
+    //
+    this.evaluate_residual = function (funcsVal) {
+        var i;
+        var residual = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            residual += Math.abs(funcsVal[i]);
+        }
+        return residual;
+    }
+
+    // evaluate the Euclidean_norm_of_residual
+    //
+    this.evaluate_Euclidean_norm_of_residual  = function (funcsVal) {
+        var i;
+        var residual2 = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            var fabs = Math.abs(funcsVal[i]);
+            residual2 += fabs*fabs;
+        }
+        return Math.sqrt(residual2);
+    }
+    
+    // main function start here
+    //    
+    var residual_tol = 1e-7;
+    var max_iteration = 1000;
+    var epsilon = 2.22e-16;
+    var JS_GSL_SUCCESS = 0;
+    var JS_GSL_CONTINUE = 1;
+
+    // evaluate none linear system of equations and its jacobian matrix
+    //
+    var funcs = F(x);
+    var jacobian = A(x);
+
+    // iterate to get the solution
+    //
+    var iter = 0;
+    var status;
+    do {
+        iter++;
+
+        this.newton_iterate(F, A, x);
+
+        if (this.evaluate_residual(F(x)) < residual_tol)
+            status = JS_GSL_SUCCESS;
+        else
+            status = JS_GSL_CONTINUE;
+        
+    } while (status == JS_GSL_CONTINUE && iter < max_iteration)
+
+}
+
+/* unit test
+
+Rosenbrock Function 
+
+  double y0 = 1 - x0;
+  double y1 = 10 * (x1 - x0 * x0);
+
+  x0 = -1.2
+  x1 = 1.0
+
+*/
+
+
+/**
+ * Searches the interval from lowerLimit to upperLimit
+ * for a root (i.e., zero) of the function func with respect to
+ * its first argument using Brent's method root-finding algorithm.
+ *
+ * @param {function} function for which the root is sought.
+ * @param {number} the lower point of the interval to be searched.
+ * @param {number} the upper point of the interval to be searched.
+ * @param {number} the desired accuracy (convergence tolerance).
+ * @param {number} the maximum number of iterations.
+ * @returns an estimate for the root within accuracy.
+ */
+// Translated from zeroin.c in http://www.netlib.org/c/brent.shar.
+numeric.uniroot = function uniroot(func, lowerLimit, upperLimit, errorTol, maxIter) {
+  var a = lowerLimit
+    , b = upperLimit
+    , c = a
+    , fa = func(a)
+    , fb = func(b)
+    , fc = fa
+    , s = 0
+    , fs = 0
+    , tol_act   // Actual tolerance
+    , new_step  // Step at this iteration
+    , prev_step // Distance from the last but one to the last approximation
+    , p         // Interpolation step is calculated in the form p/q; division is delayed until the last moment
+    , q
+    ;
+
+  errorTol = errorTol || 0;
+  maxIter  = maxIter  || 1000;
+
+  while ( maxIter-- > 0 ) {
+
+    prev_step = b - a;
+
+    if ( Math.abs(fc) < Math.abs(fb) ) {
+      // Swap data for b to be the best approximation
+      a = b, b = c, c = a;
+      fa = fb, fb = fc, fc = fa;
+    }
+
+    tol_act = 1e-15 * Math.abs(b) + errorTol / 2;
+    new_step = ( c - b ) / 2;
+
+    if ( Math.abs(new_step) <= tol_act || fb === 0 ) {
+      return b; // Acceptable approx. is found
+    }
+
+    // Decide if the interpolation can be tried
+    if ( Math.abs(prev_step) >= tol_act && Math.abs(fa) > Math.abs(fb) ) {
+      // If prev_step was large enough and was in true direction, Interpolatiom may be tried
+      var t1, cb, t2;
+      cb = c - b;
+      if ( a === c ) { // If we have only two distinct points linear interpolation can only be applied
+        t1 = fb / fa;
+        p = cb * t1;
+        q = 1.0 - t1;
+      }
+      else { // Quadric inverse interpolation
+        q = fa / fc, t1 = fb / fc, t2 = fb / fa;
+        p = t2 * (cb * q * (q - t1) - (b - a) * (t1 - 1));
+        q = (q - 1) * (t1 - 1) * (t2 - 1);
+      }
+
+      if ( p > 0 ) {
+        q = -q;  // p was calculated with the opposite sign; make p positive
+      }
+      else {
+        p = -p;  // and assign possible minus to q
+      }
+
+      if ( p < ( 0.75 * cb * q - Math.abs( tol_act * q ) / 2 ) &&
+           p < Math.abs( prev_step * q / 2 ) ) {
+        // If (b + p / q) falls in [b,c] and isn't too large it is accepted
+        new_step = p / q;
+      }
+
+      // If p/q is too large then the bissection procedure can reduce [b,c] range to more extent
+    }
+
+    if ( Math.abs( new_step ) < tol_act ) { // Adjust the step to be not less than tolerance
+      new_step = ( new_step > 0 ) ? tol_act : -tol_act;
+    }
+
+    a = b, fa = fb;     // Save the previous approx.
+    b += new_step, fb = func(b);  // Do step to a new approxim.
+
+    if ( (fb > 0 && fc > 0) || (fb < 0 && fc < 0) ) {
+      c = a, fc = fa; // Adjust c for it to have a sign opposite to that of b
+    }
+  }
+
+};
+
+
+/*
+var test_counter;
+function f1 (x) { test_counter++; return (Math.pow(x,2)-1)*x - 5; }
+function f2 (x) { test_counter++; return Math.cos(x)-x; }
+function f3 (x) { test_counter++; return Math.sin(x)-x; }
+function f4 (x) { test_counter++; return (x + 3) * Math.pow(x - 1, 2); }
+[
+  [f1, 2, 3],
+  [f2, 2, 3],
+  [f2, -1, 3],
+  [f3, -1, 3],
+  [f4, -4, 4/3]
+].forEach(function (args) {
+  test_counter = 0;
+  var root = uniroot.apply( pv, args );
+  ;;;console.log( 'uniroot:', args.slice(1), root, test_counter );
+})
+*/
+numeric.Sparse = function Sparse(p,v) { this.p = p; this.v = v; };
+
+numeric.Sparse.scatter = function scatter(i,j,z) {
+    var n = numeric.sup(j)+1,m=i.length,jk;
+    var p = Array(n),v = Array(n),k;
+    for(k=n-1;k!==-1;--k) { p[k] = []; v[k] = []; }
+    for(k=0;k!==m;++k) {
+        jk = j[k];
+        p[jk].push(i[k]);
+        v[jk].push(z[k]);
+    }
+    return new numeric.Sparse(p,v);
+};
+
+numeric.Sparse.identity = function identity(n) {
+    return numeric.Sparse.scatter(numeric.linspace(0,n-1),numeric.linspace(0,n-1),numeric.rep([n],1));
+};
+
+numeric.Sparse.prototype.dim = function dim() {
+    var m = 0, i,j,p=this.p,k=p.length,pi,a,b;
+    for(i=k-1;i!==-1;--i) {
+        pi = p[i];
+        a = pi.length;
+        for(j=a-1;j!==-1;--j) {
+            b = pi[j];
+            if(b>m) m = b;
+        }
+    }
+    return [m+1,p.length];
+};
+
+numeric.Sparse.prototype.Lsolve = function Lsolve(b,n) {
+    if(typeof n === "undefined") { n = b.length; }
+    var i,j,k,ret = Array(n), p = this.p, v = this.v, pj,vj,m;
+    for(i=0;ij && i=j) t[i-j] = vj[k];
+        }
+        if(j!==0) {
+            for(k=n-1;k!==-1;--k) foo[k] = 0;
+            for(k=0;k3;i-=4) { f(); f(); f(); f(); }
+        while(i>0) { f(); i--; }
+        t2 = new Date();
+        if(t2-t1 > interval) break;
+    }
+    for(i=n;i>3;i-=4) { f(); f(); f(); f(); }
+    while(i>0) { f(); i--; }
+    t2 = new Date();
+    return 1000*(3*n-1)/(t2-t1);
+};
+
+numeric._myIndexOf = (function _myIndexOf(w) {
+    var n = this.length,k;
+    for(k=0;k numeric.largeArray) { ret.push('...Large Array...'); return true; }
+            var flag = false;
+            ret.push('[');
+            for(k=0;k0) { ret.push(','); if(flag) ret.push('\n '); } flag = foo(x[k]); }
+            ret.push(']');
+            return true;
+        }
+        ret.push('{');
+        var flag = false;
+        for(k in x) { if(x.hasOwnProperty(k)) { if(flag) ret.push(',\n'); flag = true; ret.push(k); ret.push(': \n'); foo(x[k]); } }
+        ret.push('}');
+        return true;
+    }
+    foo(x);
+    return ret.join('');
+};
+
+numeric.parseDate = function parseDate(d) {
+    function foo(d) {
+        if(typeof d === 'string') { return Date.parse(d.replace(/-/g,'/')); }
+        if(!(d instanceof Array)) { throw new Error("parseDate: parameter must be arrays of strings"); }
+        var ret = [],k;
+        for(k=0;k0) {
+            ret[count] = [];
+            for(j=0;j> 2;
+            q = ((x & 3) << 4) + (y >> 4);
+            r = ((y & 15) << 2) + (z >> 6);
+            s = z & 63;
+            if(i+1>=n) { r = s = 64; }
+            else if(i+2>=n) { s = 64; }
+            ret += key.charAt(p) + key.charAt(q) + key.charAt(r) + key.charAt(s);
+            }
+        return ret;
+    }
+    function crc32Array (a,from,to) {
+        if(typeof from === "undefined") { from = 0; }
+        if(typeof to === "undefined") { to = a.length; }
+        var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
+                     0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
+                     0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+                     0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
+                     0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
+                     0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+                     0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
+                     0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
+                     0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+                     0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
+                     0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
+                     0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+                     0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
+                     0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+                     0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+                     0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
+                     0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
+                     0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+                     0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
+                     0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
+                     0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+                     0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
+                     0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
+                     0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+                     0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
+                     0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
+                     0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+                     0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+                     0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
+                     0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+                     0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
+                     0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
+
+        var crc = -1, y = 0, n = a.length,i;
+
+        for (i = from; i < to; i++) {
+            y = (crc ^ a[i]) & 0xFF;
+            crc = (crc >>> 8) ^ table[y];
+        }
+
+        return crc ^ (-1);
+    }
+
+    var h = img[0].length, w = img[0][0].length, s1, s2, next,k,length,a,b,i,j,adler32,crc32;
+    var stream = [
+                  137, 80, 78, 71, 13, 10, 26, 10,                           //  0: PNG signature
+                  0,0,0,13,                                                  //  8: IHDR Chunk length
+                  73, 72, 68, 82,                                            // 12: "IHDR"
+                  (w >> 24) & 255, (w >> 16) & 255, (w >> 8) & 255, w&255,   // 16: Width
+                  (h >> 24) & 255, (h >> 16) & 255, (h >> 8) & 255, h&255,   // 20: Height
+                  8,                                                         // 24: bit depth
+                  2,                                                         // 25: RGB
+                  0,                                                         // 26: deflate
+                  0,                                                         // 27: no filter
+                  0,                                                         // 28: no interlace
+                  -1,-2,-3,-4,                                               // 29: CRC
+                  -5,-6,-7,-8,                                               // 33: IDAT Chunk length
+                  73, 68, 65, 84,                                            // 37: "IDAT"
+                  // RFC 1950 header starts here
+                  8,                                                         // 41: RFC1950 CMF
+                  29                                                         // 42: RFC1950 FLG
+                  ];
+    crc32 = crc32Array(stream,12,29);
+    stream[29] = (crc32>>24)&255;
+    stream[30] = (crc32>>16)&255;
+    stream[31] = (crc32>>8)&255;
+    stream[32] = (crc32)&255;
+    s1 = 1;
+    s2 = 0;
+    for(i=0;i>8)&255;
+        stream.push(a); stream.push(b);
+        stream.push((~a)&255); stream.push((~b)&255);
+        if(i===0) stream.push(0);
+        for(j=0;j255) a = 255;
+                else if(a<0) a=0;
+                else a = Math.round(a);
+                s1 = (s1 + a )%65521;
+                s2 = (s2 + s1)%65521;
+                stream.push(a);
+            }
+        }
+        stream.push(0);
+    }
+    adler32 = (s2<<16)+s1;
+    stream.push((adler32>>24)&255);
+    stream.push((adler32>>16)&255);
+    stream.push((adler32>>8)&255);
+    stream.push((adler32)&255);
+    length = stream.length - 41;
+    stream[33] = (length>>24)&255;
+    stream[34] = (length>>16)&255;
+    stream[35] = (length>>8)&255;
+    stream[36] = (length)&255;
+    crc32 = crc32Array(stream,37);
+    stream.push((crc32>>24)&255);
+    stream.push((crc32>>16)&255);
+    stream.push((crc32>>8)&255);
+    stream.push((crc32)&255);
+    stream.push(0);
+    stream.push(0);
+    stream.push(0);
+    stream.push(0);
+//    a = stream.length;
+    stream.push(73);  // I
+    stream.push(69);  // E
+    stream.push(78);  // N
+    stream.push(68);  // D
+    stream.push(174); // CRC1
+    stream.push(66);  // CRC2
+    stream.push(96);  // CRC3
+    stream.push(130); // CRC4
+    return 'data:image/png;base64,'+base64(stream);
+};
+
+// 2. Linear algebra with Arrays.
+numeric._dim = function _dim(x) {
+    var ret = [];
+    while(typeof x === "object") { ret.push(x.length); x = x[0]; }
+    return ret;
+};
+
+numeric.dim = function dim(x) {
+    var y,z;
+    if(typeof x === "object") {
+        y = x[0];
+        if(typeof y === "object") {
+            z = y[0];
+            if(typeof z === "object") {
+                return numeric._dim(x);
+            }
+            return [x.length,y.length];
+        }
+        return [x.length];
+    }
+    return [];
+};
+
+// mapreduce
+numeric.mapreduce = function mapreduce(body, init) {
+    return numeric.compile('x','accum','_s','_k',
+            'if(typeof accum === "undefined") accum = '+init+';\n'+
+            'if(typeof x === "number") { var xi = x; '+body+'; return accum; }\n'+
+            'if(typeof _s === "undefined") _s = numeric.dim(x);\n'+
+            'if(typeof _k === "undefined") _k = 0;\n'+
+            'var _n = _s[_k];\n'+
+            'var i,xi;\n'+
+            'if(_k < _s.length-1) {\n'+
+            '    for(i=_n-1;i>=0;i--) {\n'+
+            '        accum = arguments.callee(x[i],accum,_s,_k+1);\n'+
+            '    }'+
+            '    return accum;\n'+
+            '}\n'+
+            'for(i=_n-1;i>=1;i-=2) { \n'+
+            '    xi = x[i];\n'+
+            '    '+body+';\n'+
+            '    xi = x[i-1];\n'+
+            '    '+body+';\n'+
+            '}\n'+
+            'if(i === 0) {\n'+
+            '    xi = x[i];\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return accum;'
+            );
+};
+
+// 
+numeric.mapreduce2 = function mapreduce2(body, setup) {
+    return numeric.compile('x',
+            'var n = x.length;\n'+
+            'var i,xi;\n'+setup+'\n'+
+            'for(i=n-1;i!==-1;--i) { \n'+
+            '    xi = x[i];\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return accum;'
+            );
+};
+
+// compare arrays/tensors
+numeric.same = function same(x,y) {
+    var i, n;
+
+    if(!(x instanceof Array) || !(y instanceof Array)) { return false; }
+    
+    n = x.length;
+    
+    if(n !== y.length) { return false; }
+    
+    for(i = 0; i < n; i++)
+    {
+        if(x[i] === y[i]) { continue; }
+        if(typeof x[i] === "object") { if(!same(x[i], y[i])) return false; }
+        else { return false; }
+    }
+    return true;
+};
+
+numeric.empty = function empty(s,k) {
+    if(typeof k === "undefined") { k=0; }
+    var n=s[k], z=Array(n), i;
+    if(s.length   === 0) { return undefined; }
+    if(s.length-1 === k) { return z; }
+    for(i=n-1;i>=0;i--) { z[i] = numeric.empty(s,k+1); }
+    return z;
+};
+
+// repeat
+numeric.rep = function rep(s, v, k) 
+{
+    // repeat value v over a tensor of size s = [s0, s1, s2, ...]
+    // k recursive index
+    if(typeof k === "undefined") { k = 0; }
+    
+    var n = s[k], ret = Array(n), i;
+    
+    if(k === s.length - 1)
+    {
+        for(i = n - 2; i >= 0; i -= 2) { ret[i+1] = v; ret[i] = v; }
+        if(i === -1) { ret[0] = v; }
+        return ret;
+    }
+    
+    for(i = n - 1; i >= 0; i--) { ret[i] = numeric.rep(s, v, k+1); }
+    
+    return ret;
+};
+
+numeric.zeros = function zeros(s) { return numeric.rep(s,0); };
+numeric.ones = function ones(s) { return numeric.rep(s,1); };
+
+// dot functions
+numeric.dotMMsmall = function dotMMsmall(x,y)
+{
+    var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0;
+    p = x.length; q = y.length; r = y[0].length;
+    ret = Array(p);
+    for(i=p-1;i>=0;i--) {
+        foo = Array(r);
+        bar = x[i];
+        for(k=r-1;k>=0;k--) {
+            woo = bar[q-1]*y[q-1][k];
+            for(j=q-2;j>=1;j-=2) {
+                i0 = j-1;
+                woo += bar[j]*y[j][k] + bar[i0]*y[i0][k];
+            }
+            if(j===0) { woo += bar[0]*y[0][k]; }
+            foo[k] = woo;
+        }
+        ret[i] = foo;
+    }
+    return ret;
+};
+
+numeric._getCol = function _getCol(A,j,x) {
+    var n = A.length, i;
+    for(i=n-1;i>0;--i) {
+        x[i] = A[i][j];
+        --i;
+        x[i] = A[i][j];
+    }
+    if(i===0) x[0] = A[0][j];
+};
+
+numeric.dotMMbig = function dotMMbig(x,y){
+    var gc = numeric._getCol, p = y.length, v = Array(p);
+    var m = x.length, n = y[0].length, A = new Array(m), xj;
+    var VV = numeric.dotVV;
+    var i,j,k,z;
+    --p;
+    --m;
+    for(i=m;i!==-1;--i) A[i] = Array(n);
+    --n;
+    for(i=n;i!==-1;--i) {
+        gc(y,i,v);
+        for(j=m;j!==-1;--j) {
+            z=0;
+            xj = x[j];
+            A[j][i] = VV(xj,v);
+        }
+    }
+    return A;
+};
+
+numeric.dotMV = function dotMV(x,y) {
+    var p = x.length, q = y.length,i;
+    var ret = Array(p), dotVV = numeric.dotVV;
+    for(i=p-1;i>=0;i--) { ret[i] = dotVV(x[i],y); }
+    return ret;
+};
+
+numeric.dotVM = function dotVM(x,y) {
+    var i,j,k,p,q,r,ret,foo,bar,woo,i0,k0,p0,r0,s1,s2,s3,baz,accum;
+    p = x.length; q = y[0].length;
+    ret = Array(q);
+    for(k=q-1;k>=0;k--) {
+        woo = x[p-1]*y[p-1][k];
+        for(j=p-2;j>=1;j-=2) {
+            i0 = j-1;
+            woo += x[j]*y[j][k] + x[i0]*y[i0][k];
+        }
+        if(j===0) { woo += x[0]*y[0][k]; }
+        ret[k] = woo;
+    }
+    return ret;
+};
+
+numeric.dotVV = function dotVV(x,y) {
+    var i,n=x.length,i1,ret = x[n-1]*y[n-1];
+    for(i=n-2;i>=1;i-=2) {
+        i1 = i-1;
+        ret += x[i]*y[i] + x[i1]*y[i1];
+    }
+    if(i===0) { ret += x[0]*y[0]; }
+    return ret;
+};
+
+numeric.dot = function dot(x,y) {
+    var d = numeric.dim;
+    switch(d(x).length*1000+d(y).length) {
+    case 2002:
+        if(y.length < 10) return numeric.dotMMsmall(x,y);
+        else return numeric.dotMMbig(x,y);
+    case 2001: return numeric.dotMV(x,y);
+    case 1002: return numeric.dotVM(x,y);
+    case 1001: return numeric.dotVV(x,y);
+    case 1000: return numeric.mulVS(x,y);
+    case 1: return numeric.mulSV(x,y);
+    case 0: return x*y;
+    default: throw new Error('numeric.dot only works on vectors and matrices');
+    }
+};
+
+// diag function
+
+numeric.roll = function roll(x, r, a, s, k) {
+    if(typeof r === 'undefined') { r=1; }
+    if(typeof a === 'undefined') { a=-1; }
+    if(typeof s === 'undefined') { s=numeric.dim(x); }
+    if(typeof k === 'undefined') { k=0; }
+    if(a < 0) { a=s.length+a; }
+    if(k === a) { return x.slice(s[k]-r).concat(x.slice(0,s[k]-r)); }
+    var i,n=s[k],z=Array(n);
+    for(i=0;i=0;i--) {
+        Ai = Array(n);
+        i1 = i+2;
+        for(j=n-1;j>=i1;j-=2) {
+            Ai[j] = 0;
+            Ai[j-1] = 0;
+        }
+        if(j>i) { Ai[j] = 0; }
+        Ai[i] = d[i];
+        for(j=i-1;j>=1;j-=2) {
+            Ai[j] = 0;
+            Ai[j-1] = 0;
+        }
+        if(j===0) { Ai[0] = 0; }
+        A[i] = Ai;
+    }
+    return A;
+};
+
+numeric.getDiag = function(A) {
+    var n = Math.min(A.length,A[0].length),i,ret = Array(n);
+    for(i=n-1;i>=1;--i) {
+        ret[i] = A[i][i];
+        --i;
+        ret[i] = A[i][i];
+    }
+    if(i===0) {
+        ret[0] = A[0][0];
+    }
+    return ret;
+};
+
+numeric.identity = function identity(n) { return numeric.diag(numeric.rep([n],1)); };
+
+numeric.pointwise = function pointwise(params,body,setup) 
+{
+    if(typeof setup === "undefined") { setup = ""; }
+    var fun = [];
+    var k;
+    var avec = /\[i\]$/,p,thevec = '';
+    var haveret = false;
+    for(k=0;k=0;i--) ret[i] = arguments.callee('+params.join(',')+',_s,_k+1);\n'+
+            '    return ret;\n'+
+            '}\n'+
+            setup+'\n'+
+            'for(i=_n-1;i!==-1;--i) {\n'+
+            '    '+body+'\n'+
+            '}\n'+
+            'return ret;'
+            );
+    return numeric.compile.apply(null,fun);
+};
+
+numeric.pointwise2 = function pointwise2(params,body,setup)
+{
+    if(typeof setup === "undefined") { setup = ""; }
+    var fun = [];
+    var k;
+    var avec = /\[i\]$/,p,thevec = '';
+    var haveret = false;
+    for(k=0;k=0;i--) { _biforeach(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
+});
+
+numeric._biforeach2 = (function _biforeach2(x,y,s,k,f) {
+    if(k === s.length-1) { return f(x,y); }
+    var i,n=s[k],ret = Array(n);
+    for(i=n-1;i>=0;--i) { ret[i] = _biforeach2(typeof x==="object"?x[i]:x,typeof y==="object"?y[i]:y,s,k+1,f); }
+    return ret;
+});
+
+numeric._foreach = (function _foreach(x,s,k,f) {
+    if(k === s.length-1) { f(x); return; }
+    var i,n=s[k];
+    for(i=n-1;i>=0;i--) { _foreach(x[i],s,k+1,f); }
+});
+
+numeric._foreach2 = (function _foreach2(x,s,k,f) {
+    if(k === s.length-1) { return f(x); }
+    var i,n=s[k], ret = Array(n);
+    for(i=n-1;i>=0;i--) { ret[i] = _foreach2(x[i],s,k+1,f); }
+    return ret;
+});
+
+/*numeric.anyV = numeric.mapreduce('if(xi) return true;','false');
+numeric.allV = numeric.mapreduce('if(!xi) return false;','true');
+numeric.any = function(x) { if(typeof x.length === "undefined") return x; return numeric.anyV(x); }
+numeric.all = function(x) { if(typeof x.length === "undefined") return x; return numeric.allV(x); }*/
+
+numeric.ops2 = {
+        add: '+',
+        sub: '-',
+        mul: '*',
+        div: '/',
+        mod: '%',
+        and: '&&',
+        or:  '||',
+        eq:  '===',
+        neq: '!==',
+        lt:  '<',
+        gt:  '>',
+        leq: '<=',
+        geq: '>=',
+        band: '&',
+        bor: '|',
+        bxor: '^',
+        lshift: '<<',
+        rshift: '>>',
+        rrshift: '>>>'
+};
+
+numeric.opseq = {
+        addeq: '+=',
+        subeq: '-=',
+        muleq: '*=',
+        diveq: '/=',
+        modeq: '%=',
+        lshifteq: '<<=',
+        rshifteq: '>>=',
+        rrshifteq: '>>>=',
+        bandeq: '&=',
+        boreq: '|=',
+        bxoreq: '^='
+};
+
+numeric.mathfuns = ['abs','acos','asin','atan','ceil','cos',
+                    'exp','floor','log','round','sin','sqrt','tan',
+                    'isNaN','isFinite'];
+
+numeric.mathfuns2 = ['atan2','pow','max','min'];
+
+numeric.ops1 = {
+        neg: '-',
+        not: '!',
+        bnot: '~',
+        clone: ''
+};
+
+numeric.mapreducers = {
+        any: ['if(xi) return true;','var accum = false;'],
+        all: ['if(!xi) return false;','var accum = true;'],
+        sum: ['accum += xi;','var accum = 0;'],
+        prod: ['accum *= xi;','var accum = 1;'],
+        norm2Squared: ['accum += xi*xi;','var accum = 0;'],
+        norminf: ['accum = max(accum,abs(xi));','var accum = 0, max = Math.max, abs = Math.abs;'],
+        norm1: ['accum += abs(xi);','var accum = 0, abs = Math.abs;'],
+        sup: ['accum = max(accum,xi);','var accum = -Infinity, max = Math.max;'],
+        inf: ['accum = min(accum,xi);','var accum = Infinity, min = Math.min;']
+};
+
+(function () {
+    var i,o;
+    for(i=0;iv0) { i0 = i; v0 = k; } }
+        Aj = A[i0]; A[i0] = A[j]; A[j] = Aj;
+        Ij = I[i0]; I[i0] = I[j]; I[j] = Ij;
+        x = Aj[j];
+        for(k=j;k!==n;++k)    Aj[k] /= x;
+        for(k=n-1;k!==-1;--k) Ij[k] /= x;
+        for(i=m-1;i!==-1;--i) {
+            if(i!==j) {
+                Ai = A[i];
+                Ii = I[i];
+                x = Ai[j];
+                for(k=j+1;k!==n;++k)  Ai[k] -= Aj[k]*x;
+                for(k=n-1;k>0;--k) { Ii[k] -= Ij[k]*x; --k; Ii[k] -= Ij[k]*x; }
+                if(k===0) Ii[0] -= Ij[0]*x;
+            }
+        }
+    }
+    return I;
+};
+
+numeric.det = function det(x) {
+    var s = numeric.dim(x);
+    if(s.length !== 2 || s[0] !== s[1]) { throw new Error('numeric: det() only works on square matrices'); }
+    var n = s[0], ret = 1,i,j,k,A = numeric.clone(x),Aj,Ai,alpha,temp,k1,k2,k3;
+    for(j=0;j Math.abs(A[k][j])) { k = i; } }
+        if(k !== j) {
+            temp = A[k]; A[k] = A[j]; A[j] = temp;
+            ret *= -1;
+        }
+        Aj = A[j];
+        for(i=j+1;i=1;i-=2) {
+        A1 = x[i];
+        A0 = x[i-1];
+        for(j=n-1;j>=1;--j) {
+            Bj = ret[j]; Bj[i] = A1[j]; Bj[i-1] = A0[j];
+            --j;
+            Bj = ret[j]; Bj[i] = A1[j]; Bj[i-1] = A0[j];
+        }
+        if(j===0) {
+            Bj = ret[0]; Bj[i] = A1[0]; Bj[i-1] = A0[0];
+        }
+    }
+    if(i===0) {
+        A0 = x[0];
+        for(j=n-1;j>=1;--j) {
+            ret[j][0] = A0[j];
+            --j;
+            ret[j][0] = A0[j];
+        }
+        if(j===0) { ret[0][0] = A0[0]; }
+    }
+    return ret;
+};
+
+numeric.negtranspose = function negtranspose(x) {
+    var i,j,m = x.length,n = x[0].length, ret=Array(n),A0,A1,Bj;
+    for(j=0;j=1;i-=2) {
+        A1 = x[i];
+        A0 = x[i-1];
+        for(j=n-1;j>=1;--j) {
+            Bj = ret[j]; Bj[i] = -A1[j]; Bj[i-1] = -A0[j];
+            --j;
+            Bj = ret[j]; Bj[i] = -A1[j]; Bj[i-1] = -A0[j];
+        }
+        if(j===0) {
+            Bj = ret[0]; Bj[i] = -A1[0]; Bj[i-1] = -A0[0];
+        }
+    }
+    if(i===0) {
+        A0 = x[0];
+        for(j=n-1;j>=1;--j) {
+            ret[j][0] = -A0[j];
+            --j;
+            ret[j][0] = -A0[j];
+        }
+        if(j===0) { ret[0][0] = -A0[0]; }
+    }
+    return ret;
+};
+
+numeric._random = function _random(s,k) {
+    var i,n=s[k],ret=Array(n), rnd;
+    if(k === s.length-1) {
+        rnd = Math.random;
+        for(i=n-1;i>=1;i-=2) {
+            ret[i] = rnd();
+            ret[i-1] = rnd();
+        }
+        if(i===0) { ret[0] = rnd(); }
+        return ret;
+    }
+    for(i=n-1;i>=0;i--) ret[i] = _random(s,k+1);
+    return ret;
+};
+
+numeric.random = function random(s) { return numeric._random(s,0); };
+
+numeric.norm2 = function norm2(x,a) { return numeric.sqrt(numeric.norm2Squared(x,a)); };
+
+numeric.linspace = function linspace(a,b,n) {
+    if(typeof n === "undefined") n = Math.max(Math.round(b-a)+1,1);
+    if(n<2) { return n===1?[a]:[]; }
+    var i,ret = Array(n);
+    n--;
+    for(i=n;i>=0;i--) { ret[i] = (i*b+(n-i)*a)/n; }
+    return ret;
+};
+
+numeric.logspace = function logspace(a,b,n,e) {
+    if(typeof e === 'undefined') { e=10; }
+    return numeric.pow(e, numeric.linspace(a,b,n));
+};
+
+numeric.range = function range(start,stop,step) {
+    if (typeof step === 'undefined') { step = 1; }
+    if (typeof stop === 'undefined') { stop = start; start = 0; }
+    if (step > 0 && (stop < start)) { return []; }
+    if (step < 0 && (stop > start)) { return []; }
+    var i,z=[];
+    for(i=start;i=0;i--) { ret[i] = x[i+a]; }
+            return ret;
+        }
+        for(i=n;i>=0;i--) { ret[i] = foo(x[i+a],k+1); }
+        return ret;
+    }
+    return foo(x,0);
+};
+
+numeric.setBlock = function setBlock(x,from,to,B) {
+    var s = numeric.dim(x);
+    function foo(x,y,k) {
+        var i,a = from[k], n = to[k]-a;
+        if(k === s.length-1) { for(i=n;i>=0;i--) { x[i+a] = y[i]; } }
+        for(i=n;i>=0;i--) { foo(x[i+a],y[i],k+1); }
+    }
+    foo(x,B,0);
+    return x;
+};
+
+numeric.getRange = function getRange(A, I,J ) {
+    var m = I.length, n = J.length;
+    var i,j;
+    var B = Array(m), Bi, AI;
+    for(i=m-1;i!==-1;--i) {
+        B[i] = Array(n);
+        Bi = B[i];
+        AI = A[I[i]];
+        for(j=n-1;j!==-1;--j) Bi[j] = AI[J[j]];
+    }
+    return B;
+};
+
+numeric.blockMatrix = function blockMatrix(X) {
+    var s = numeric.dim(X);
+    if(s.length<4) return numeric.blockMatrix([X]);
+    var m=s[0],n=s[1],M,N,i,j,Xij;
+    M = 0; N = 0;
+    for(i=0;i=0;i--) {
+        Ai = Array(n);
+        xi = x[i];
+        for(j=n-1;j>=3;--j) {
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+            --j;
+            Ai[j] = xi * y[j];
+        }
+        while(j>=0) { Ai[j] = xi * y[j]; --j; }
+        A[i] = Ai;
+    }
+    return A;
+};
+
+// 3. The Tensor type T
+numeric.T = function T(x,y) { this.x = x; this.y = y; };
+numeric.t = function t(x,y) { return new numeric.T(x,y); };
+
+numeric.Tbinop = function Tbinop(rr,rc,cr,cc,setup) {
+    var io = numeric.indexOf;
+    if(typeof setup !== "string") {
+        var k;
+        setup = '';
+        for(k in numeric) {
+            if(numeric.hasOwnProperty(k) && (rr.indexOf(k)>=0 || rc.indexOf(k)>=0 || cr.indexOf(k)>=0 || cc.indexOf(k)>=0) && k.length>1) {
+                setup += 'var '+k+' = numeric.'+k+';\n';
+            }
+        }
+    }
+    return numeric.compile(['y'],
+            'var x = this;\n'+
+            'if(!(y instanceof numeric.T)) { y = new numeric.T(y); }\n'+
+            setup+'\n'+
+            'if(x.y) {'+
+            '  if(y.y) {'+
+            '    return new numeric.T('+cc+');\n'+
+            '  }\n'+
+            '  return new numeric.T('+cr+');\n'+
+            '}\n'+
+            'if(y.y) {\n'+
+            '  return new numeric.T('+rc+');\n'+
+            '}\n'+
+            'return new numeric.T('+rr+');\n'
+    );
+};
+
+numeric.T.prototype.add = numeric.Tbinop(
+        'add(x.x,y.x)',
+        'add(x.x,y.x),y.y',
+        'add(x.x,y.x),x.y',
+        'add(x.x,y.x),add(x.y,y.y)');
+numeric.T.prototype.sub = numeric.Tbinop(
+        'sub(x.x,y.x)',
+        'sub(x.x,y.x),neg(y.y)',
+        'sub(x.x,y.x),x.y',
+        'sub(x.x,y.x),sub(x.y,y.y)');
+numeric.T.prototype.mul = numeric.Tbinop(
+        'mul(x.x,y.x)',
+        'mul(x.x,y.x),mul(x.x,y.y)',
+        'mul(x.x,y.x),mul(x.y,y.x)',
+        'sub(mul(x.x,y.x),mul(x.y,y.y)),add(mul(x.x,y.y),mul(x.y,y.x))');
+
+numeric.T.prototype.reciprocal = function reciprocal() {
+    var mul = numeric.mul, div = numeric.div;
+    if(this.y) {
+        var d = numeric.add(mul(this.x,this.x),mul(this.y,this.y));
+        return new numeric.T(div(this.x,d),div(numeric.neg(this.y),d));
+    }
+    return new numeric.T(div(1,this.x), 0);
+};
+
+numeric.T.prototype.div = function div(y) {
+    if(!(y instanceof numeric.T)) y = new numeric.T(y);
+    if(y.y) { return this.mul(y.reciprocal()); }
+    var div = numeric.div;
+    if(this.y) { return new numeric.T(div(this.x,y.x),div(this.y,y.x)); }
+    return new numeric.T(div(this.x,y.x));
+};
+
+numeric.T.prototype.dot = numeric.Tbinop(
+        'dot(x.x,y.x)',
+        'dot(x.x,y.x),dot(x.x,y.y)',
+        'dot(x.x,y.x),dot(x.y,y.x)',
+        'sub(dot(x.x,y.x),dot(x.y,y.y)),add(dot(x.x,y.y),dot(x.y,y.x))'
+        );
+
+numeric.T.prototype.transpose = function transpose() {
+    var t = numeric.transpose, x = this.x, y = this.y;
+    if(y) { return new numeric.T(t(x),t(y)); }
+    return new numeric.T(t(x));
+};
+
+numeric.T.prototype.transjugate = function transjugate() {
+    var t = numeric.transpose, x = this.x, y = this.y;
+    if(y) { return new numeric.T(t(x),numeric.negtranspose(y)); }
+    return new numeric.T(t(x));
+};
+
+numeric.Tunop = function Tunop(r,c,s) {
+    if(typeof s !== "string") { s = ''; }
+    return numeric.compile(
+            'var x = this;\n'+
+            s+'\n'+
+            'if(x.y) {'+
+            '  '+c+'\n'+
+            '}\n'+
+            r+'\n'
+    );
+};
+
+numeric.T.prototype.exp = numeric.Tunop(
+        'return new numeric.T(ex);',
+        'return new numeric.T(mul(cos(x.y),ex),mul(sin(x.y),ex));',
+        'var ex = numeric.exp(x.x), cos = numeric.cos, sin = numeric.sin, mul = numeric.mul;');
+numeric.T.prototype.conj = numeric.Tunop(
+        'return new numeric.T(x.x);',
+        'return new numeric.T(x.x,numeric.neg(x.y));');
+numeric.T.prototype.neg = numeric.Tunop(
+        'return new numeric.T(neg(x.x));',
+        'return new numeric.T(neg(x.x),neg(x.y));',
+        'var neg = numeric.neg;');
+numeric.T.prototype.sin = numeric.Tunop(
+        'return new numeric.T(numeric.sin(x.x));',
+        'return x.exp().sub(x.neg().exp()).div(new numeric.T(0,2));');
+numeric.T.prototype.cos = numeric.Tunop(
+        'return new numeric.T(numeric.cos(x.x));',
+        'return x.exp().add(x.neg().exp()).div(2);');
+numeric.T.prototype.abs = numeric.Tunop(
+        'return new numeric.T(numeric.abs(x.x));',
+        'return new numeric.T(numeric.sqrt(numeric.add(mul(x.x,x.x),mul(x.y,x.y))));',
+        'var mul = numeric.mul;');
+numeric.T.prototype.log = numeric.Tunop(
+        'return new numeric.T(numeric.log(x.x));',
+        'var theta = new numeric.T(numeric.atan2(x.y,x.x)), r = x.abs();\n'+
+        'return new numeric.T(numeric.log(r.x),theta.x);');
+numeric.T.prototype.norm2 = numeric.Tunop(
+        'return numeric.norm2(x.x);',
+        'var f = numeric.norm2Squared;\n'+
+        'return Math.sqrt(f(x.x)+f(x.y));');
+
+numeric.T.prototype.inv = function inv() {
+    var A = this;
+    if(typeof A.y === "undefined") { return new numeric.T(numeric.inv(A.x)); }
+    var n = A.x.length, i, j, k;
+    var Rx = numeric.identity(n),Ry = numeric.rep([n,n],0);
+    var Ax = numeric.clone(A.x), Ay = numeric.clone(A.y);
+    var Aix, Aiy, Ajx, Ajy, Rix, Riy, Rjx, Rjy;
+    var i,j,k,d,d1,ax,ay,bx,by,temp;
+    for(i=0;i d) { k=j; d = d1; }
+        }
+        if(k!==i) {
+            temp = Ax[i]; Ax[i] = Ax[k]; Ax[k] = temp;
+            temp = Ay[i]; Ay[i] = Ay[k]; Ay[k] = temp;
+            temp = Rx[i]; Rx[i] = Rx[k]; Rx[k] = temp;
+            temp = Ry[i]; Ry[i] = Ry[k]; Ry[k] = temp;
+        }
+        Aix = Ax[i]; Aiy = Ay[i];
+        Rix = Rx[i]; Riy = Ry[i];
+        ax = Aix[i]; ay = Aiy[i];
+        for(j=i+1;j0;i--) {
+        Rix = Rx[i]; Riy = Ry[i];
+        for(j=i-1;j>=0;j--) {
+            Rjx = Rx[j]; Rjy = Ry[j];
+            ax = Ax[j][i]; ay = Ay[j][i];
+            for(k=n-1;k>=0;k--) {
+                bx = Rix[k]; by = Riy[k];
+                Rjx[k] -= ax*bx - ay*by;
+                Rjy[k] -= ax*by + ay*bx;
+            }
+        }
+    }
+    return new numeric.T(Rx,Ry);
+};
+
+numeric.T.prototype.get = function get(i) {
+    var x = this.x, y = this.y, k = 0, ik, n = i.length;
+    if(y) {
+        while(k= 0 ? 1 : -1;
+    var alpha = s*numeric.norm2(x);
+    v[0] += alpha;
+    var foo = numeric.norm2(v);
+    if(foo === 0) { /* this should not happen */ throw new Error('eig: internal error'); }
+    return numeric.div(v,foo);
+};
+
+// upper hessenberg 
+numeric.toUpperHessenberg = function toUpperHessenberg(me) {
+    var s = numeric.dim(me);
+    if(s.length !== 2 || s[0] !== s[1]) { throw new Error('numeric: toUpperHessenberg() only works on square matrices'); }
+    var m = s[0], i,j,k,x,v,A = numeric.clone(me),B,C,Ai,Ci,Q = numeric.identity(m),Qi;
+    for(j=0;j0) {
+            v = numeric.house(x);
+            B = numeric.getBlock(A,[j+1,j],[m-1,m-1]);
+            C = numeric.tensor(v,numeric.dot(v,B));
+            for(i=j+1;i=4*det) {
+            var s1,s2;
+            s1 = 0.5*(tr+Math.sqrt(tr*tr-4*det));
+            s2 = 0.5*(tr-Math.sqrt(tr*tr-4*det));
+            Hloc = numeric.add(numeric.sub(numeric.dot(Hloc,Hloc),
+                                           numeric.mul(Hloc,s1+s2)),
+                               numeric.diag(numeric.rep([3],s1*s2)));
+        } else {
+            Hloc = numeric.add(numeric.sub(numeric.dot(Hloc,Hloc),
+                                           numeric.mul(Hloc,tr)),
+                               numeric.diag(numeric.rep([3],det)));
+        }
+        x = [Hloc[0][0],Hloc[1][0],Hloc[2][0]];
+        v = numeric.house(x);
+        B = [H[0],H[1],H[2]];
+        C = numeric.tensor(v,numeric.dot(v,B));
+        for(i=0;i<3;i++) { Hi = H[i]; Ci = C[i]; for(k=0;k 4 && termp == Math.abs(d[p]) && termq == Math.abs(d[q]))
+                {
+                    // remove small elmts
+                    A[p][q] = 0;
+                }
+                else
+                {
+                    if (Math.abs(A[p][q]) >= tresh)
+                    {
+                        // apply rotation
+                        h = d[q] - d[p];
+                        term = Math.abs(h) + gapq;
+                        if (term == Math.abs(h))
+                        {
+                            t = A[p][q]/h;
+                        }
+                        else
+                        {
+                            theta = 0.5 * h / A[p][q];
+                            t = 1/(Math.abs(theta) + Math.sqrt(1 + theta*theta));
+                            if (theta < 0)
+                            {
+                                t = -t;
+                            }
+                        }
+                        c = 1/Math.sqrt(1 + t*t);
+                        s = t * c;
+                        tau = s/(1 + c);
+                        h = t * A[p][q];
+                        zw[p] = zw[p] - h;
+                        zw[q] = zw[q] + h;
+                        d[p] = d[p] - h;
+                        d[q] = d[q] + h;
+                        A[p][q] = 0;
+                        // rotate and use upper tria only
+                        for (var j = 0; j < p; j++)
+                        {
+                            g = A[j][p];
+                            h = A[j][q];
+                            A[j][p] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        }
+                        for (var j = p + 1; j < q; j++)
+                        {
+                            g = A[p][j];
+                            h = A[j][q];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[j][q] = h + s * (g - h * tau);
+                        } 
+                        for (var j = q + 1; j < n; j++)
+                        {
+                            g = A[p][j];
+                            h = A[q][j];
+                            A[p][j] = g - s * (h + g * tau);
+                            A[q][j] = h + s * (g - h * tau);
+                        }
+                        // eigenstates
+                        for (var j = 0; j < n; j++)
+                        {
+                            g = v[j][p];
+                            h = v[j][q];
+                            v[j][p] = g - s * (h + g * tau);
+                            v[j][q] = h + s * (g - h * tau);
+                        }
+                        nrot++;
+                    }
+                }
+            }
+        }
+        bw = numeric.add(bw, zw);
+        d = numeric.clone(bw);
+        zw = numeric.rep([n], 0);
+    }
+
+    return {E: {x: v}, lambda: {x: d}, iterations: iters, niter: niter, nrot: nrot};
+}
+
+numeric.jacobinorm = function(A)
+{
+    // used in numeric.jacobi
+    var n = A.length;
+    var s = 0;
+    for (var i = 0; i < n; i ++)
+    {
+        for (var j = i + 1; j < n; j ++)
+        {
+            s = s + Math.pow(A[i][j], 2)
+        }
+    }
+    return Math.sqrt(s);
+}
+
+// eig function
+numeric.eig = function eig(A,maxiter) {
+    var QH = numeric.toUpperHessenberg(A);
+    var QB = numeric.QRFrancis(QH.H,maxiter);
+    var T = numeric.T;
+    var n = A.length,i,k,flag = false,B = QB.B,H = numeric.dot(QB.Q,numeric.dot(QH.H,numeric.transpose(QB.Q)));
+    var Q = new T(numeric.dot(QB.Q,QH.Q)),Q0;
+    var m = B.length,j;
+    var a,b,c,d,p1,p2,disc,x,y,p,q,n1,n2;
+    var sqrt = Math.sqrt;
+    for(k=0;k=0) {
+                if(p1<0) x = -0.5*(p1-sqrt(disc));
+                else     x = -0.5*(p1+sqrt(disc));
+                n1 = (a-x)*(a-x)+b*b;
+                n2 = c*c+(d-x)*(d-x);
+                if(n1>n2) {
+                    n1 = sqrt(n1);
+                    p = (a-x)/n1;
+                    q = b/n1;
+                } else {
+                    n2 = sqrt(n2);
+                    p = c/n2;
+                    q = (d-x)/n2;
+                }
+                Q0 = new T([[q,-p],[p,q]]);
+                Q.setRows(i,j,Q0.dot(Q.getRows(i,j)));
+            } else {
+                x = -0.5*p1;
+                y = 0.5*sqrt(-disc);
+                n1 = (a-x)*(a-x)+b*b;
+                n2 = c*c+(d-x)*(d-x);
+                if(n1>n2) {
+                    n1 = sqrt(n1+y*y);
+                    p = (a-x)/n1;
+                    q = b/n1;
+                    x = 0;
+                    y /= n1;
+                } else {
+                    n2 = sqrt(n2+y*y);
+                    p = c/n2;
+                    q = (d-x)/n2;
+                    x = y/n2;
+                    y = 0;
+                }
+                Q0 = new T([[q,-p],[p,q]],[[x,y],[y,-x]]);
+                Q.setRows(i,j,Q0.dot(Q.getRows(i,j)));
+            }
+        }
+    }
+    var R = Q.dot(A).dot(Q.transjugate()), n = A.length, E = numeric.T.identity(n);
+    for(j=0;j0) {
+            for(k=j-1;k>=0;k--) {
+                var Rk = R.get([k,k]), Rj = R.get([j,j]);
+                if(numeric.neq(Rk.x,Rj.x) || numeric.neq(Rk.y,Rj.y)) {
+                    x = R.getRow(k).getBlock([k],[j-1]);
+                    y = E.getRow(j).getBlock([k],[j-1]);
+                    E.set([j,k],(R.get([k,j]).neg().sub(x.dot(y))).div(Rk.sub(Rj)));
+                } else {
+                    E.setRow(j,E.getRow(k));
+                    continue;
+                }
+            }
+        }
+    }
+    for(j=0;j=counts.length) counts[counts.length] = 0;
+            if(foo[j]!==0) counts[j]++;
+        }
+    }
+    var n = counts.length;
+    var Ai = Array(n+1);
+    Ai[0] = 0;
+    for(i=0;i= k11) {
+            xj[n] = j[m];
+            if(m===0) return;
+            ++n;
+            --m;
+            km = k[m];
+            k11 = k1[m];
+        } else {
+            foo = Pinv[Aj[km]];
+            if(x[foo] === 0) {
+                x[foo] = 1;
+                k[m] = km;
+                ++m;
+                j[m] = foo;
+                km = Ai[foo];
+                k1[m] = k11 = Ai[foo+1];
+            } else ++km;
+        }
+    }
+};
+
+numeric.ccsLPSolve = function ccsLPSolve(A,B,x,xj,I,Pinv,dfs) {
+    var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
+    var Bi = B[0], Bj = B[1], Bv = B[2];
+
+    var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
+    i0 = Bi[I];
+    i1 = Bi[I+1];
+    xj.length = 0;
+    for(i=i0;i a) { e = k; a = c; }
+        }
+        if(abs(x[i])= k11) {
+            xj[n] = Pinv[j[m]];
+            if(m===0) return;
+            ++n;
+            --m;
+            km = k[m];
+            k11 = k1[m];
+        } else {
+            foo = Aj[km];
+            if(x[foo] === 0) {
+                x[foo] = 1;
+                k[m] = km;
+                ++m;
+                j[m] = foo;
+                foo = Pinv[foo];
+                km = Ai[foo];
+                k1[m] = k11 = Ai[foo+1];
+            } else ++km;
+        }
+    }
+};
+
+numeric.ccsLPSolve0 = function ccsLPSolve0(A,B,y,xj,I,Pinv,P,dfs) {
+    var Ai = A[0], Aj = A[1], Av = A[2],m = Ai.length-1, n=0;
+    var Bi = B[0], Bj = B[1], Bv = B[2];
+
+    var i,i0,i1,j,J,j0,j1,k,l,l0,l1,a;
+    i0 = Bi[I];
+    i1 = Bi[I+1];
+    xj.length = 0;
+    for(i=i0;i a) { e = k; a = c; }
+        }
+        if(abs(y[P[i]]) ret[k]) ret[k] = A.length;
+    var i;
+    for(i in A) {
+        if(A.hasOwnProperty(i)) dim(A[i],ret,k+1);
+    }
+    return ret;
+};
+
+numeric.sclone = function clone(A,k,n) {
+    if(typeof k === "undefined") { k=0; }
+    if(typeof n === "undefined") { n = numeric.sdim(A).length; }
+    var i,ret = Array(A.length);
+    if(k === n-1) {
+        for(i in A) { if(A.hasOwnProperty(i)) ret[i] = A[i]; }
+        return ret;
+    }
+    for(i in A) {
+        if(A.hasOwnProperty(i)) ret[i] = clone(A[i],k+1,n);
+    }
+    return ret;
+};
+
+numeric.sdiag = function diag(d) {
+    var n = d.length,i,ret = Array(n),i1,i2,i3;
+    for(i=n-1;i>=1;i-=2) {
+        i1 = i-1;
+        ret[i] = []; ret[i][i] = d[i];
+        ret[i1] = []; ret[i1][i1] = d[i1];
+    }
+    if(i===0) { ret[0] = []; ret[0][0] = d[i]; }
+    return ret;
+};
+
+numeric.sidentity = function identity(n) { return numeric.sdiag(numeric.rep([n],1)); };
+
+numeric.stranspose = function transpose(A) {
+    var ret = [], n = A.length, i,j,Ai;
+    for(i in A) {
+        if(!(A.hasOwnProperty(i))) continue;
+        Ai = A[i];
+        for(j in Ai) {
+            if(!(Ai.hasOwnProperty(j))) continue;
+            if(typeof ret[j] !== "object") { ret[j] = []; }
+            ret[j][i] = Ai[j];
+        }
+    }
+    return ret;
+};
+
+numeric.sLUP = function LUP(A,tol) {
+    throw new Error("The function numeric.sLUP had a bug in it and has been removed. Please use the new numeric.ccsLUP function instead.");
+};
+
+numeric.sdotMM = function dotMM(A,B) {
+    var p = A.length, q = B.length, BT = numeric.stranspose(B), r = BT.length, Ai, BTk;
+    var i,j,k,accum;
+    var ret = Array(p),reti;
+    for(i=p-1;i>=0;i--) {
+        reti = [];
+        Ai = A[i];
+        for(k=r-1;k>=0;k--) {
+            accum = 0;
+            BTk = BT[k];
+            for(j in Ai) {
+                if(!(Ai.hasOwnProperty(j))) continue;
+                if(j in BTk) { accum += Ai[j]*BTk[j]; }
+            }
+            if(accum) reti[k] = accum;
+        }
+        ret[i] = reti;
+    }
+    return ret;
+};
+
+numeric.sdotMV = function dotMV(A,x) {
+    var p = A.length, Ai, i,j;
+    var ret = Array(p), accum;
+    for(i=p-1;i>=0;i--) {
+        Ai = A[i];
+        accum = 0;
+        for(j in Ai) {
+            if(!(Ai.hasOwnProperty(j))) continue;
+            if(x[j]) accum += Ai[j]*x[j];
+        }
+        if(accum) ret[i] = accum;
+    }
+    return ret;
+};
+
+numeric.sdotVM = function dotMV(x,A) {
+    var i,j,Ai,alpha;
+    var ret = [], accum;
+    for(i in x) {
+        if(!x.hasOwnProperty(i)) continue;
+        Ai = A[i];
+        alpha = x[i];
+        for(j in Ai) {
+            if(!Ai.hasOwnProperty(j)) continue;
+            if(!ret[j]) { ret[j] = 0; }
+            ret[j] += alpha*Ai[j];
+        }
+    }
+    return ret;
+};
+
+numeric.sdotVV = function dotVV(x,y) {
+    var i,ret=0;
+    for(i in x) { if(x[i] && y[i]) ret+= x[i]*y[i]; }
+    return ret;
+};
+
+numeric.sdot = function dot(A,B) {
+    var m = numeric.sdim(A).length, n = numeric.sdim(B).length;
+    var k = m*1000+n;
+    switch(k) {
+    case 0: return A*B;
+    case 1001: return numeric.sdotVV(A,B);
+    case 2001: return numeric.sdotMV(A,B);
+    case 1002: return numeric.sdotVM(A,B);
+    case 2002: return numeric.sdotMM(A,B);
+    default: throw new Error('numeric.sdot not implemented for tensors of order '+m+' and '+n);
+    }
+};
+
+numeric.sscatter = function scatter(V) {
+    var n = V[0].length, Vij, i, j, m = V.length, A = [], Aj;
+    for(i=n-1;i>=0;--i) {
+        if(!V[m-1][i]) continue;
+        Aj = A;
+        for(j=0;j=0;--i) ret[i] = [];
+                    }
+                    for(i=n;i>=0;--i) ret[i].push(k[i]);
+                    ret[n+1].push(Ai);
+                }
+            } else gather(Ai,ret,k);
+        }
+    }
+    if(k.length>n) k.pop();
+    return ret;
+};
+
+// 6. Coordinate matrices
+numeric.cLU = function LU(A) {
+    var I = A[0], J = A[1], V = A[2];
+    var p = I.length, m=0, i,j,k,a,b,c;
+    for(i=0;im) m=I[i];
+    m++;
+    var L = Array(m), U = Array(m), left = numeric.rep([m],Infinity), right = numeric.rep([m],-Infinity);
+    var Ui, Uj,alpha;
+    for(k=0;kright[i]) right[i] = j;
+    }
+    for(i=0;i right[i+1]) right[i+1] = right[i]; }
+    for(i=m-1;i>=1;i--) { if(left[i]=0;i--) {
+        while(Uj[k] > i) {
+            ret[i] -= Uv[k]*ret[Uj[k]];
+            k--;
+        }
+        ret[i] /= Uv[k];
+        k--;
+    }
+    return ret;
+};
+
+numeric.cgrid = function grid(n,shape) {
+    if(typeof n === "number") n = [n,n];
+    var ret = numeric.rep(n,-1);
+    var i,j,count;
+    if(typeof shape !== "function") {
+        switch(shape) {
+        case 'L':
+            shape = function(i,j) { return (i>=n[0]/2 || jN) N = Ai[k]; }
+    N++;
+    ret = numeric.rep([N],0);
+    for(k=0;k1) {
+            mid = floor((p+q)/2);
+            if(x[mid] <= x0) p = mid;
+            else q = mid;
+        }
+        return this._at(x0,p);
+    }
+    var n = x0.length, i, ret = Array(n);
+    for(i=n-1;i!==-1;--i) ret[i] = this.at(x0[i]);
+    return ret;
+};
+
+numeric.Spline.prototype.diff = function diff() {
+    var x = this.x;
+    var yl = this.yl;
+    var yr = this.yr;
+    var kl = this.kl;
+    var kr = this.kr;
+    var n = yl.length;
+    var i,dx,dy;
+    var zl = kl, zr = kr, pl = Array(n), pr = Array(n);
+    var add = numeric.add, mul = numeric.mul, div = numeric.div, sub = numeric.sub;
+    for(i=n-1;i!==-1;--i) {
+        dx = x[i+1]-x[i];
+        dy = sub(yr[i+1],yl[i]);
+        pl[i] = div(add(mul(dy, 6),mul(kl[i],-4*dx),mul(kr[i+1],-2*dx)),dx*dx);
+        pr[i+1] = div(add(mul(dy,-6),mul(kl[i], 2*dx),mul(kr[i+1], 4*dx)),dx*dx);
+    }
+    return new numeric.Spline(x,zl,zr,pl,pr);
+};
+
+numeric.Spline.prototype.roots = function roots() {
+    function sqr(x) { return x*x; }
+    function heval(y0,y1,k0,k1,x) {
+        var A = k0*2-(y1-y0);
+        var B = -k1*2+(y1-y0);
+        var t = (x+1)*0.5;
+        var s = t*(1-t);
+        return (1-t)*y0+t*y1+A*s*(1-t)+B*s*t;
+    }
+    var ret = [];
+    var x = this.x, yl = this.yl, yr = this.yr, kl = this.kl, kr = this.kr;
+    if(typeof yl[0] === "number") {
+        yl = [yl];
+        yr = [yr];
+        kl = [kl];
+        kr = [kr];
+    }
+    var m = yl.length,n=x.length-1,i,j,k,y,s,t;
+    var ai,bi,ci,di, ret = Array(m),ri,k0,k1,y0,y1,A,B,D,dx,cx,stops,z0,z1,zm,t0,t1,tm;
+    var sqrt = Math.sqrt;
+    for(i=0;i!==m;++i) {
+        ai = yl[i];
+        bi = yr[i];
+        ci = kl[i];
+        di = kr[i];
+        ri = [];
+        for(j=0;j!==n;j++) {
+            if(j>0 && bi[j]*ai[j]<0) ri.push(x[j]);
+            dx = (x[j+1]-x[j]);
+            cx = x[j];
+            y0 = ai[j];
+            y1 = bi[j+1];
+            k0 = ci[j]/dx;
+            k1 = di[j+1]/dx;
+            D = sqr(k0-k1+3*(y0-y1)) + 12*k1*y0;
+            A = k1+3*y0+2*k0-3*y1;
+            B = 3*(k1+k0+2*(y0-y1));
+            if(D<=0) {
+                z0 = A/B;
+                if(z0>x[j] && z0x[j] && z0x[j] && z10) {
+                    t0 = t1;
+                    z0 = z1;
+                    continue;
+                }
+                var side = 0;
+                while(1) {
+                    tm = (z0*t1-z1*t0)/(z0-z1);
+                    if(tm <= t0 || tm >= t1) { break; }
+                    zm = this._at(tm,j);
+                    if(zm*z1>0) {
+                        t1 = tm;
+                        z1 = zm;
+                        if(side === -1) z0*=0.5;
+                        side = -1;
+                    } else if(zm*z0>0) {
+                        t0 = tm;
+                        z0 = zm;
+                        if(side === 1) z1*=0.5;
+                        side = 1;
+                    } else break;
+                }
+                ri.push(tm);
+                t0 = stops[k+1];
+                z0 = this._at(t0, j);
+            }
+            if(z1 === 0) ri.push(t1);
+        }
+        ret[i] = ri;
+    }
+    if(typeof this.yl[0] === "number") return ret[0];
+    return ret;
+};
+
+numeric.spline = function spline(x,y,k1,kn) {
+    var n = x.length, b = [], dx = [], dy = [];
+    var i;
+    var sub = numeric.sub,mul = numeric.mul,add = numeric.add;
+    for(i=n-2;i>=0;i--) { dx[i] = x[i+1]-x[i]; dy[i] = sub(y[i+1],y[i]); }
+    if(typeof k1 === "string" || typeof kn === "string") {
+        k1 = kn = "periodic";
+    }
+    // Build sparse tridiagonal system
+    var T = [[],[],[]];
+    switch(typeof k1) {
+    case "undefined":
+        b[0] = mul(3/(dx[0]*dx[0]),dy[0]);
+        T[0].push(0,0);
+        T[1].push(0,1);
+        T[2].push(2/dx[0],1/dx[0]);
+        break;
+    case "string":
+        b[0] = add(mul(3/(dx[n-2]*dx[n-2]),dy[n-2]),mul(3/(dx[0]*dx[0]),dy[0]));
+        T[0].push(0,0,0);
+        T[1].push(n-2,0,1);
+        T[2].push(1/dx[n-2],2/dx[n-2]+2/dx[0],1/dx[0]);
+        break;
+    default:
+        b[0] = k1;
+        T[0].push(0);
+        T[1].push(0);
+        T[2].push(1);
+        break;
+    }
+    for(i=1;i20) { throw new Error("Numerical gradient fails"); }
+            x0[i] = x[i]+h;
+            f1 = f(x0);
+            x0[i] = x[i]-h;
+            f2 = f(x0);
+            x0[i] = x[i];
+            if(isNaN(f1) || isNaN(f2)) { h/=16; continue; }
+            J[i] = (f1-f2)/(2*h);
+            t0 = x[i]-h;
+            t1 = x[i];
+            t2 = x[i]+h;
+            d1 = (f1-f0)/h;
+            d2 = (f0-f2)/h;
+            N = max(abs(J[i]),abs(f0),abs(f1),abs(f2),abs(t0),abs(t1),abs(t2),1e-8);
+            errest = min(max(abs(d1-J[i]),abs(d2-J[i]),abs(d1-d2))/N,h/N);
+            if(errest>eps) { h/=16; }
+            else break;
+            }
+    }
+    return J;
+};
+
+numeric.uncmin = function uncmin(f,x0,tol,gradient,maxit,callback,options) {
+    var grad = numeric.gradient;
+    if(typeof options === "undefined") { options = {}; }
+    if(typeof tol === "undefined") { tol = 1e-8; }
+    if(typeof gradient === "undefined") { gradient = function(x) { return grad(f,x); }; }
+    if(typeof maxit === "undefined") maxit = 1000;
+    x0 = numeric.clone(x0);
+    var n = x0.length;
+    var f0 = f(x0),f1,df0;
+    if(isNaN(f0)) throw new Error('uncmin: f(x0) is a NaN!');
+    var max = Math.max, norm2 = numeric.norm2;
+    tol = max(tol,numeric.epsilon);
+    var step,g0,g1,H1 = options.Hinv || numeric.identity(n);
+    var dot = numeric.dot, inv = numeric.inv, sub = numeric.sub, add = numeric.add, ten = numeric.tensor, div = numeric.div, mul = numeric.mul;
+    var all = numeric.all, isfinite = numeric.isFinite, neg = numeric.neg;
+    var it=0,i,s,x1,y,Hy,Hs,ys,i0,t,nstep,t1,t2;
+    var msg = "";
+    g0 = gradient(x0);
+    while(it= 0.1*t*df0 || isNaN(f1)) {
+                t *= 0.5;
+                ++it;
+                continue;
+            }
+            break;
+        }
+        if(t*nstep < tol) { msg = "Line search step size smaller than tol"; break; }
+        if(it === maxit) { msg = "maxit reached during line search"; break; }
+        g1 = gradient(x1);
+        y = sub(g1,g0);
+        ys = dot(y,s);
+        Hy = dot(H1,y);
+        H1 = sub(add(H1,
+                mul(
+                        (ys+dot(y,Hy))/(ys*ys),
+                        ten(s,s)    )),
+                div(add(ten(Hy,s),ten(s,Hy)),ys));
+        x0 = x1;
+        f0 = f1;
+        g0 = g1;
+        ++it;
+    }
+    return {solution: x0, f: f0, gradient: g0, invHessian: H1, iterations:it, message: msg};
+};
+
+// 10. Ode solver (Dormand-Prince)
+numeric.Dopri = function Dopri(x,y,f,ymid,iterations,msg,events) {
+    this.x = x;
+    this.y = y;
+    this.f = f;
+    this.ymid = ymid;
+    this.iterations = iterations;
+    this.events = events;
+    this.message = msg;
+};
+
+numeric.Dopri.prototype._at = function _at(xi,j) {
+    function sqr(x) { return x*x; }
+    var sol = this;
+    var xs = sol.x;
+    var ys = sol.y;
+    var k1 = sol.f;
+    var ymid = sol.ymid;
+    var n = xs.length;
+    var x0,x1,xh,y0,y1,yh,xi;
+    var floor = Math.floor,h;
+    var c = 0.5;
+    var add = numeric.add, mul = numeric.mul,sub = numeric.sub, p,q,w;
+    x0 = xs[j];
+    x1 = xs[j+1];
+    y0 = ys[j];
+    y1 = ys[j+1];
+    h  = x1-x0;
+    xh = x0+c*h;
+    yh = ymid[j];
+    p = sub(k1[j  ],mul(y0,1/(x0-xh)+2/(x0-x1)));
+    q = sub(k1[j+1],mul(y1,1/(x1-xh)+2/(x1-x0)));
+    w = [sqr(xi - x1) * (xi - xh) / sqr(x0 - x1) / (x0 - xh),
+         sqr(xi - x0) * sqr(xi - x1) / sqr(x0 - xh) / sqr(x1 - xh),
+         sqr(xi - x0) * (xi - xh) / sqr(x1 - x0) / (x1 - xh),
+         (xi - x0) * sqr(xi - x1) * (xi - xh) / sqr(x0-x1) / (x0 - xh),
+         (xi - x1) * sqr(xi - x0) * (xi - xh) / sqr(x0-x1) / (x1 - xh)];
+    return add(add(add(add(mul(y0,w[0]),
+                           mul(yh,w[1])),
+                           mul(y1,w[2])),
+                           mul( p,w[3])),
+                           mul( q,w[4]));
+};
+
+numeric.Dopri.prototype.at = function at(x) {
+    var i,j,k,floor = Math.floor;
+    if(typeof x !== "number") {
+        var n = x.length, ret = Array(n);
+        for(i=n-1;i!==-1;--i) {
+            ret[i] = this.at(x[i]);
+        }
+        return ret;
+    }
+    var x0 = this.x;
+    i = 0; j = x0.length-1;
+    while(j-i>1) {
+        k = floor(0.5*(i+j));
+        if(x0[k] <= x) i = k;
+        else j = k;
+    }
+    return this._at(x,i);
+};
+
+numeric.dopri = function dopri(x0,x1,y0,f,tol,maxit,event) {
+    if(typeof tol === "undefined") { tol = 1e-6; }
+    if(typeof maxit === "undefined") { maxit = 1000; }
+    var xs = [x0], ys = [y0], k1 = [f(x0,y0)], k2,k3,k4,k5,k6,k7, ymid = [];
+    var A2 = 1/5;
+    var A3 = [3/40,9/40];
+    var A4 = [44/45,-56/15,32/9];
+    var A5 = [19372/6561,-25360/2187,64448/6561,-212/729];
+    var A6 = [9017/3168,-355/33,46732/5247,49/176,-5103/18656];
+    var b = [35/384,0,500/1113,125/192,-2187/6784,11/84];
+    var bm = [0.5*6025192743/30085553152,
+              0,
+              0.5*51252292925/65400821598,
+              0.5*-2691868925/45128329728,
+              0.5*187940372067/1594534317056,
+              0.5*-1776094331/19743644256,
+              0.5*11237099/235043384];
+    var c = [1/5,3/10,4/5,8/9,1,1];
+    var e = [-71/57600,0,71/16695,-71/1920,17253/339200,-22/525,1/40];
+    var i = 0,er,j;
+    var h = (x1-x0)/10;
+    var it = 0;
+    var add = numeric.add, mul = numeric.mul, y1,erinf;
+    var max = Math.max, min = Math.min, abs = Math.abs, norminf = numeric.norminf,pow = Math.pow;
+    var any = numeric.any, lt = numeric.lt, and = numeric.and, sub = numeric.sub;
+    var e0, e1, ev;
+    var ret = new numeric.Dopri(xs,ys,k1,ymid,-1,"");
+    if(typeof event === "function") e0 = event(x0,y0);
+    while(x0x1) h = x1-x0;
+        k2 = f(x0+c[0]*h,                add(y0,mul(   A2*h,k1[i])));
+        k3 = f(x0+c[1]*h,            add(add(y0,mul(A3[0]*h,k1[i])),mul(A3[1]*h,k2)));
+        k4 = f(x0+c[2]*h,        add(add(add(y0,mul(A4[0]*h,k1[i])),mul(A4[1]*h,k2)),mul(A4[2]*h,k3)));
+        k5 = f(x0+c[3]*h,    add(add(add(add(y0,mul(A5[0]*h,k1[i])),mul(A5[1]*h,k2)),mul(A5[2]*h,k3)),mul(A5[3]*h,k4)));
+        k6 = f(x0+c[4]*h,add(add(add(add(add(y0,mul(A6[0]*h,k1[i])),mul(A6[1]*h,k2)),mul(A6[2]*h,k3)),mul(A6[3]*h,k4)),mul(A6[4]*h,k5)));
+        y1 = add(add(add(add(add(y0,mul(k1[i],h*b[0])),mul(k3,h*b[2])),mul(k4,h*b[3])),mul(k5,h*b[4])),mul(k6,h*b[5]));
+        k7 = f(x0+h,y1);
+        er = add(add(add(add(add(mul(k1[i],h*e[0]),mul(k3,h*e[2])),mul(k4,h*e[3])),mul(k5,h*e[4])),mul(k6,h*e[5])),mul(k7,h*e[6]));
+        if(typeof er === "number") erinf = abs(er);
+        else erinf = norminf(er);
+        if(erinf > tol) { // reject
+            h = 0.2*h*pow(tol/erinf,0.25);
+            if(x0+h === x0) {
+                ret.msg = "Step size became too small";
+                break;
+            }
+            continue;
+        }
+        ymid[i] = add(add(add(add(add(add(y0,
+                mul(k1[i],h*bm[0])),
+                mul(k3   ,h*bm[2])),
+                mul(k4   ,h*bm[3])),
+                mul(k5   ,h*bm[4])),
+                mul(k6   ,h*bm[5])),
+                mul(k7   ,h*bm[6]));
+        ++i;
+        xs[i] = x0+h;
+        ys[i] = y1;
+        k1[i] = k7;
+        if(typeof event === "function") {
+            var yi,xl = x0,xr = x0+0.5*h,xi;
+            e1 = event(xr,ymid[i-1]);
+            ev = and(lt(e0,0),lt(0,e1));
+            if(!any(ev)) { xl = xr; xr = x0+h; e0 = e1; e1 = event(xr,y1); ev = and(lt(e0,0),lt(0,e1)); }
+            if(any(ev)) {
+                var xc, yc, en,ei;
+                var side=0, sl = 1.0, sr = 1.0;
+                while(1) {
+                    if(typeof e0 === "number") xi = (sr*e1*xl-sl*e0*xr)/(sr*e1-sl*e0);
+                    else {
+                        xi = xr;
+                        for(j=e0.length-1;j!==-1;--j) {
+                            if(e0[j]<0 && e1[j]>0) xi = min(xi,(sr*e1[j]*xl-sl*e0[j]*xr)/(sr*e1[j]-sl*e0[j]));
+                        }
+                    }
+                    if(xi <= xl || xi >= xr) break;
+                    yi = ret._at(xi, i-1);
+                    ei = event(xi,yi);
+                    en = and(lt(e0,0),lt(0,ei));
+                    if(any(en)) {
+                        xr = xi;
+                        e1 = ei;
+                        ev = en;
+                        sr = 1.0;
+                        if(side === -1) sl *= 0.5;
+                        else sl = 1.0;
+                        side = -1;
+                    } else {
+                        xl = xi;
+                        e0 = ei;
+                        sl = 1.0;
+                        if(side === 1) sr *= 0.5;
+                        else sr = 1.0;
+                        side = 1;
+                    }
+                }
+                y1 = ret._at(0.5*(x0+xi),i-1);
+                ret.f[i] = f(xi,yi);
+                ret.x[i] = xi;
+                ret.y[i] = yi;
+                ret.ymid[i-1] = y1;
+                ret.events = ev;
+                ret.iterations = it;
+                return ret;
+            }
+        }
+        x0 += h;
+        y0 = y1;
+        e0 = e1;
+        h = min(0.8*h*pow(tol/erinf,0.25),4*h);
+    }
+    ret.iterations = it;
+    return ret;
+};
+
+// 11. Ax = b
+numeric.LU = function(A, fast) {
+  fast = fast || false;
+
+  var abs = Math.abs;
+  var i, j, k, absAjk, Akk, Ak, Pk, Ai;
+  var max;
+  var n = A.length, n1 = n-1;
+  var P = new Array(n);
+  if(!fast) A = numeric.clone(A);
+
+  for (k = 0; k < n; ++k) {
+    Pk = k;
+    Ak = A[k];
+    max = abs(Ak[k]);
+    for (j = k + 1; j < n; ++j) {
+      absAjk = abs(A[j][k]);
+      if (max < absAjk) {
+        max = absAjk;
+        Pk = j;
+      }
+    }
+    P[k] = Pk;
+
+    if (Pk != k) {
+      A[k] = A[Pk];
+      A[Pk] = Ak;
+      Ak = A[k];
+    }
+
+    Akk = Ak[k];
+
+    for (i = k + 1; i < n; ++i) {
+      A[i][k] /= Akk;
+    }
+
+    for (i = k + 1; i < n; ++i) {
+      Ai = A[i];
+      for (j = k + 1; j < n1; ++j) {
+        Ai[j] -= Ai[k] * Ak[j];
+        ++j;
+        Ai[j] -= Ai[k] * Ak[j];
+      }
+      if(j===n1) Ai[j] -= Ai[k] * Ak[j];
+    }
+  }
+
+  return {
+    LU: A,
+    P:  P
+  };
+};
+
+numeric.LUsolve = function LUsolve(LUP, b) {
+  var i, j;
+  var LU = LUP.LU;
+  var n   = LU.length;
+  var x = numeric.clone(b);
+  var P   = LUP.P;
+  var Pi, LUi, LUii, tmp;
+
+  for (i=n-1;i!==-1;--i) x[i] = b[i];
+  for (i = 0; i < n; ++i) {
+    Pi = P[i];
+    if (P[i] !== i) {
+      tmp = x[i];
+      x[i] = x[Pi];
+      x[Pi] = tmp;
+    }
+
+    LUi = LU[i];
+    for (j = 0; j < i; ++j) {
+      x[i] -= x[j] * LUi[j];
+    }
+  }
+
+  for (i = n - 1; i >= 0; --i) {
+    LUi = LU[i];
+    for (j = i + 1; j < n; ++j) {
+      x[i] -= x[j] * LUi[j];
+    }
+
+    x[i] /= LUi[i];
+  }
+
+  return x;
+};
+
+numeric.solve = function solve(A,b,fast) { return numeric.LUsolve(numeric.LU(A,fast), b); };
+
+// 12. Linear programming
+numeric.echelonize = function echelonize(A) {
+    var s = numeric.dim(A), m = s[0], n = s[1];
+    var I = numeric.identity(m);
+    var P = Array(m);
+    var i,j,k,l,Ai,Ii,Z,a;
+    var abs = Math.abs;
+    var diveq = numeric.diveq;
+    A = numeric.clone(A);
+    for(i=0;ia1) alpha = a1;
+        g = add(c,mul(alpha,p));
+        H = dot(A1,A0);
+        for(i=m-1;i!==-1;--i) H[i][i] += 1;
+        d = solve(H,div(g,alpha),true);
+        var t0 = div(z,dot(A,d));
+        var t = 1.0;
+        for(i=n-1;i!==-1;--i) if(t0[i]<0) t = min(t,-0.999*t0[i]);
+        y = sub(x,mul(d,t));
+        z = sub(b,dot(A,y));
+        if(!all(gt(z,0))) return { solution: x, message: "", iterations: count };
+        x = y;
+        if(alpha=0) unbounded = false;
+            else unbounded = true;
+        }
+        if(unbounded) return { solution: y, message: "Unbounded", iterations: count };
+    }
+    return { solution: x, message: "maximum iteration count exceeded", iterations:count };
+};
+
+numeric._solveLP = function _solveLP(c,A,b,tol,maxit) {
+    var m = c.length, n = b.length,y;
+    var sum = numeric.sum, log = numeric.log, mul = numeric.mul, sub = numeric.sub, dot = numeric.dot, div = numeric.div, add = numeric.add;
+    var c0 = numeric.rep([m],0).concat([1]);
+    var J = numeric.rep([n,1],-1);
+    var A0 = numeric.blockMatrix([[A                   ,   J  ]]);
+    var b0 = b;
+    var y = numeric.rep([m],0).concat(Math.max(0,numeric.sup(numeric.neg(b)))+1);
+    var x0 = numeric.__solveLP(c0,A0,b0,tol,maxit,y,false);
+    var x = numeric.clone(x0.solution);
+    x.length = m;
+    var foo = numeric.inf(sub(b,dot(A,x)));
+    if(foo<0) { return { solution: NaN, message: "Infeasible", iterations: x0.iterations }; }
+    var ret = numeric.__solveLP(c, A, b, tol, maxit-x0.iterations, x, true);
+    ret.iterations += x0.iterations;
+    return ret;
+};
+
+numeric.solveLP = function solveLP(c,A,b,Aeq,beq,tol,maxit) {
+    if(typeof maxit === "undefined") maxit = 1000;
+    if(typeof tol === "undefined") tol = numeric.epsilon;
+    if(typeof Aeq === "undefined") return numeric._solveLP(c,A,b,tol,maxit);
+    var m = Aeq.length, n = Aeq[0].length, o = A.length;
+    var B = numeric.echelonize(Aeq);
+    var flags = numeric.rep([n],0);
+    var P = B.P;
+    var Q = [];
+    var i;
+    for(i=P.length-1;i!==-1;--i) flags[P[i]] = 1;
+    for(i=n-1;i!==-1;--i) if(flags[i]===0) Q.push(i);
+    var g = numeric.getRange;
+    var I = numeric.linspace(0,m-1), J = numeric.linspace(0,o-1);
+    var Aeq2 = g(Aeq,I,Q), A1 = g(A,J,P), A2 = g(A,J,Q), dot = numeric.dot, sub = numeric.sub;
+    var A3 = dot(A1,B.I);
+    var A4 = sub(A2,dot(A3,Aeq2)), b4 = sub(b,dot(A3,beq));
+    var c1 = Array(P.length), c2 = Array(Q.length);
+    for(i=P.length-1;i!==-1;--i) c1[i] = c[P[i]];
+    for(i=Q.length-1;i!==-1;--i) c2[i] = c[Q[i]];
+    var c4 = sub(c2,dot(c1,dot(B.I,Aeq2)));
+    var S = numeric._solveLP(c4,A4,b4,tol,maxit);
+    var x2 = S.solution;
+    if(x2!==x2) return S;
+    var x1 = dot(B.I,sub(beq,dot(Aeq2,x2)));
+    var x = Array(c.length);
+    for(i=P.length-1;i!==-1;--i) x[P[i]] = x1[i];
+    for(i=Q.length-1;i!==-1;--i) x[Q[i]] = x2[i];
+    return { solution: x, message:S.message, iterations: S.iterations };
+};
+
+numeric.MPStoLP = function MPStoLP(MPS) {
+    if(MPS instanceof String) { MPS.split('\n'); }
+    var state = 0;
+    var states = ['Initial state','NAME','ROWS','COLUMNS','RHS','BOUNDS','ENDATA'];
+    var n = MPS.length;
+    var i,j,z,N=0,rows = {}, sign = [], rl = 0, vars = {}, nv = 0;
+    var name;
+    var c = [], A = [], b = [];
+    function err(e) { throw new Error('MPStoLP: '+e+'\nLine '+i+': '+MPS[i]+'\nCurrent state: '+states[state]+'\n'); }
+    for(i=0;i
+//
+//   Math.seedrandom('yipee'); Sets Math.random to a function that is
+//                             initialized using the given explicit seed.
+//
+//   Math.seedrandom();        Sets Math.random to a function that is
+//                             seeded using the current time, dom state,
+//                             and other accumulated local entropy.
+//                             The generated seed string is returned.
+//
+//   Math.seedrandom('yowza', true);
+//                             Seeds using the given explicit seed mixed
+//                             together with accumulated entropy.
+//
+//   
+//                             Seeds using physical random bits downloaded
+//                             from random.org.
+//
+//                    Seeds using urandom bits from call.jsonlib.com,
+//                             which is faster than random.org.
+//
+// Examples:
+//
+//   Math.seedrandom("hello");            // Use "hello" as the seed.
+//   document.write(Math.random());       // Always 0.5463663768140734
+//   document.write(Math.random());       // Always 0.43973793770592234
+//   var rng1 = Math.random;              // Remember the current prng.
+//
+//   var autoseed = Math.seedrandom();    // New prng with an automatic seed.
+//   document.write(Math.random());       // Pretty much unpredictable.
+//
+//   Math.random = rng1;                  // Continue "hello" prng sequence.
+//   document.write(Math.random());       // Always 0.554769432473455
+//
+//   Math.seedrandom(autoseed);           // Restart at the previous seed.
+//   document.write(Math.random());       // Repeat the 'unpredictable' value.
+//
+// Notes:
+//
+// Each time seedrandom('arg') is called, entropy from the passed seed
+// is accumulated in a pool to help generate future seeds for the
+// zero-argument form of Math.seedrandom, so entropy can be injected over
+// time by calling seedrandom with explicit data repeatedly.
+//
+// On speed - This javascript implementation of Math.random() is about
+// 3-10x slower than the built-in Math.random() because it is not native
+// code, but this is typically fast enough anyway.  Seeding is more expensive,
+// especially if you use auto-seeding.  Some details (timings on Chrome 4):
+//
+// Our Math.random()            - avg less than 0.002 milliseconds per call
+// seedrandom('explicit')       - avg less than 0.5 milliseconds per call
+// seedrandom('explicit', true) - avg less than 2 milliseconds per call
+// seedrandom()                 - avg about 38 milliseconds per call
+//
+// LICENSE (BSD):
+//
+// Copyright 2010 David Bau, all rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+//
+//   1. Redistributions of source code must retain the above copyright
+//      notice, this list of conditions and the following disclaimer.
+//
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+//
+//   3. Neither the name of this module nor the names of its contributors may
+//      be used to endorse or promote products derived from this software
+//      without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+/**
+ * All code is in an anonymous closure to keep the global namespace clean.
+ *
+ * @param {number=} overflow
+ * @param {number=} startdenom
+ */
+
+// Patched by Seb so that seedrandom.js does not pollute the Math object.
+// My tests suggest that doing Math.trouble = 1 makes Math lookups about 5%
+// slower.
+numeric.seedrandom = { pow:Math.pow, random:Math.random };
+
+(function (pool, math, width, chunks, significance, overflow, startdenom) {
+
+
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+math['seedrandom'] = function seedrandom(seed, use_entropy) {
+  var key = [];
+  var arc4;
+
+  // Flatten the seed string or build one from local entropy if needed.
+  seed = mixkey(flatten(
+    use_entropy ? [seed, pool] :
+    arguments.length ? seed :
+    [new Date().getTime(), pool, window], 3), key);
+
+  // Use the seed to initialize an ARC4 generator.
+  arc4 = new ARC4(key);
+
+  // Mix the randomness into accumulated entropy.
+  mixkey(arc4.S, pool);
+
+  // Override Math.random
+
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+
+  math['random'] = function random() {  // Closure to return a random double:
+    var n = arc4.g(chunks);             // Start with a numerator n < 2 ^ 48
+    var d = startdenom;                 //   and denominator d = 2 ^ 48.
+    var x = 0;                          //   and no 'extra last byte'.
+    while (n < significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n >= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x >>>= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+
+  // Return the seed that was used
+  return seed;
+};
+
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 <= x < (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 <= x < (width ^ count).
+//
+/** @constructor */
+function ARC4(key) {
+  var t, u, me = this, keylen = key.length;
+  var i = 0, j = me.i = me.j = me.m = 0;
+  me.S = [];
+  me.c = [];
+
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+
+  // Set up S using the standard key scheduling algorithm.
+  while (i < width) { me.S[i] = i++; }
+  for (i = 0; i < width; i++) {
+    t = me.S[i];
+    j = lowbits(j + t + key[i % keylen]);
+    u = me.S[j];
+    me.S[i] = u;
+    me.S[j] = t;
+  }
+
+  // The "g" method returns the next (count) outputs as one number.
+  me.g = function getnext(count) {
+    var s = me.S;
+    var i = lowbits(me.i + 1); var t = s[i];
+    var j = lowbits(me.j + t); var u = s[j];
+    s[i] = u;
+    s[j] = t;
+    var r = s[lowbits(t + u)];
+    while (--count) {
+      i = lowbits(i + 1); t = s[i];
+      j = lowbits(j + t); u = s[j];
+      s[i] = u;
+      s[j] = t;
+      r = r * width + s[lowbits(t + u)];
+    }
+    me.i = i;
+    me.j = j;
+    return r;
+  };
+  // For robust unpredictability discard an initial batch of values.
+  // See http://www.rsa.com/rsalabs/node.asp?id=2009
+  me.g(width);
+}
+
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+/** @param {Object=} result
+  * @param {string=} prop
+  * @param {string=} typ */
+function flatten(obj, depth, result, prop, typ) {
+  result = [];
+  typ = typeof(obj);
+  if (depth && typ == 'object') {
+    for (prop in obj) {
+      if (prop.indexOf('S') < 5) {    // Avoid FF3 bug (local/sessionStorage)
+        try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+      }
+    }
+  }
+  return (result.length ? result : obj + (typ != 'string' ? '\0' : ''));
+}
+
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+/** @param {number=} smear
+  * @param {number=} j */
+function mixkey(seed, key, smear, j) {
+  seed += '';                         // Ensure the seed is a string
+  smear = 0;
+  for (j = 0; j < seed.length; j++) {
+    key[lowbits(j)] =
+      lowbits((smear ^= key[lowbits(j)] * 19) + seed.charCodeAt(j));
+  }
+  seed = '';
+  for (j in key) { seed += String.fromCharCode(key[j]); }
+  return seed;
+}
+
+//
+// lowbits()
+// A quick "n mod width" for width a power of 2.
+//
+function lowbits(n) { return n & (width - 1); }
+
+//
+// The following constants are related to IEEE 754 limits.
+//
+startdenom = math.pow(width, chunks);
+significance = math.pow(2, significance);
+overflow = significance * 2;
+
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to intefere with determinstic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+
+// End anonymous scope, and pass initial values.
+}(
+  [],   // pool: entropy pool starts empty
+  numeric.seedrandom, // math: package containing random, pow, and seedrandom
+  256,  // width: each RC4 output is 0 <= x < 256
+  6,    // chunks: at least six RC4 outputs for each double
+  52    // significance: there are 52 significant digits in a double
+  ));
+/* This file is a slightly modified version of quadprog.js from Alberto Santini.
+ * It has been slightly modified by Sébastien Loisel to make sure that it handles
+ * 0-based Arrays instead of 1-based Arrays.
+ * License is in resources/LICENSE.quadprog */
+
+function base0to1(A) {
+    if(typeof A !== "object") { return A; }
+    var ret = [], i,n=A.length;
+    for(i=0;i meq) {
+                work[l] = sum;
+            } else {
+                work[l] = -Math.abs(sum);
+                if (sum > 0) {
+                    for (j = 1; j <= n; j = j + 1) {
+                        amat[j][i] = -amat[j][i];
+                    }
+                    bvec[i] = -bvec[i];
+                }
+            }
+        }
+
+        for (i = 1; i <= nact; i = i + 1) {
+            work[iwsv + iact[i]] = 0;
+        }
+
+        nvl = 0;
+        temp = 0;
+        for (i = 1; i <= q; i = i + 1) {
+            if (work[iwsv + i] < temp * work[iwnbv + i]) {
+                nvl = i;
+                temp = work[iwsv + i] / work[iwnbv + i];
+            }
+        }
+        if (nvl === 0) {
+            return 999;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_55() {
+        for (i = 1; i <= n; i = i + 1) {
+            sum = 0;
+            for (j = 1; j <= n; j = j + 1) {
+                sum = sum + dmat[j][i] * amat[j][nvl];
+            }
+            work[i] = sum;
+        }
+
+        l1 = iwzv;
+        for (i = 1; i <= n; i = i + 1) {
+            work[l1 + i] = 0;
+        }
+        for (j = nact + 1; j <= n; j = j + 1) {
+            for (i = 1; i <= n; i = i + 1) {
+                work[l1 + i] = work[l1 + i] + dmat[i][j] * work[j];
+            }
+        }
+
+        t1inf = true;
+        for (i = nact; i >= 1; i = i - 1) {
+            sum = work[i];
+            l = iwrm + (i * (i + 3)) / 2;
+            l1 = l - i;
+            for (j = i + 1; j <= nact; j = j + 1) {
+                sum = sum - work[l] * work[iwrv + j];
+                l = l + j;
+            }
+            sum = sum / work[l1];
+            work[iwrv + i] = sum;
+            if (iact[i] < meq) {
+                // continue;
+                break;
+            }
+            if (sum < 0) {
+                // continue;
+                break;
+            }
+            t1inf = false;
+            it1 = i;
+        }
+
+        if (!t1inf) {
+            t1 = work[iwuv + it1] / work[iwrv + it1];
+            for (i = 1; i <= nact; i = i + 1) {
+                if (iact[i] < meq) {
+                    // continue;
+                    break;
+                }
+                if (work[iwrv + i] < 0) {
+                    // continue;
+                    break;
+                }
+                temp = work[iwuv + i] / work[iwrv + i];
+                if (temp < t1) {
+                    t1 = temp;
+                    it1 = i;
+                }
+            }
+        }
+
+        sum = 0;
+        for (i = iwzv + 1; i <= iwzv + n; i = i + 1) {
+            sum = sum + work[i] * work[i];
+        }
+        if (Math.abs(sum) <= vsmall) {
+            if (t1inf) {
+                ierr[1] = 1;
+                // GOTO 999
+                return 999;
+            } else {
+                for (i = 1; i <= nact; i = i + 1) {
+                    work[iwuv + i] = work[iwuv + i] - t1 * work[iwrv + i];
+                }
+                work[iwuv + nact + 1] = work[iwuv + nact + 1] + t1;
+                // GOTO 700
+                return 700;
+            }
+        } else {
+            sum = 0;
+            for (i = 1; i <= n; i = i + 1) {
+                sum = sum + work[iwzv + i] * amat[i][nvl];
+            }
+            tt = -work[iwsv + nvl] / sum;
+            t2min = true;
+            if (!t1inf) {
+                if (t1 < tt) {
+                    tt = t1;
+                    t2min = false;
+                }
+            }
+
+            for (i = 1; i <= n; i = i + 1) {
+                sol[i] = sol[i] + tt * work[iwzv + i];
+                if (Math.abs(sol[i]) < vsmall) {
+                    sol[i] = 0;
+                }
+            }
+
+            crval[1] = crval[1] + tt * sum * (tt / 2 + work[iwuv + nact + 1]);
+            for (i = 1; i <= nact; i = i + 1) {
+                work[iwuv + i] = work[iwuv + i] - tt * work[iwrv + i];
+            }
+            work[iwuv + nact + 1] = work[iwuv + nact + 1] + tt;
+
+            if (t2min) {
+                nact = nact + 1;
+                iact[nact] = nvl;
+
+                l = iwrm + ((nact - 1) * nact) / 2 + 1;
+                for (i = 1; i <= nact - 1; i = i + 1) {
+                    work[l] = work[i];
+                    l = l + 1;
+                }
+
+                if (nact === n) {
+                    work[l] = work[n];
+                } else {
+                    for (i = n; i >= nact + 1; i = i - 1) {
+                        if (work[i] === 0) {
+                            // continue;
+                            break;
+                        }
+                        gc = Math.max(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        gs = Math.min(Math.abs(work[i - 1]), Math.abs(work[i]));
+                        if (work[i - 1] >= 0) {
+                            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        } else {
+                            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+                        }
+                        gc = work[i - 1] / temp;
+                        gs = work[i] / temp;
+
+                        if (gc === 1) {
+                            // continue;
+                            break;
+                        }
+                        if (gc === 0) {
+                            work[i - 1] = gs * temp;
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = dmat[j][i - 1];
+                                dmat[j][i - 1] = dmat[j][i];
+                                dmat[j][i] = temp;
+                            }
+                        } else {
+                            work[i - 1] = temp;
+                            nu = gs / (1 + gc);
+                            for (j = 1; j <= n; j = j + 1) {
+                                temp = gc * dmat[j][i - 1] + gs * dmat[j][i];
+                                dmat[j][i] = nu * (dmat[j][i - 1] + temp) - dmat[j][i];
+                                dmat[j][i - 1] = temp;
+
+                            }
+                        }
+                    }
+                    work[l] = work[nact];
+                }
+            } else {
+                sum = -bvec[nvl];
+                for (j = 1; j <= n; j = j + 1) {
+                    sum = sum + sol[j] * amat[j][nvl];
+                }
+                if (nvl > meq) {
+                    work[iwsv + nvl] = sum;
+                } else {
+                    work[iwsv + nvl] = -Math.abs(sum);
+                    if (sum > 0) {
+                        for (j = 1; j <= n; j = j + 1) {
+                            amat[j][nvl] = -amat[j][nvl];
+                        }
+                        bvec[nvl] = -bvec[nvl];
+                    }
+                }
+                // GOTO 700
+                return 700;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_797() {
+        l = iwrm + (it1 * (it1 + 1)) / 2 + 1;
+        l1 = l + it1;
+        if (work[l1] === 0) {
+            // GOTO 798
+            return 798;
+        }
+        gc = Math.max(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        gs = Math.min(Math.abs(work[l1 - 1]), Math.abs(work[l1]));
+        if (work[l1 - 1] >= 0) {
+            temp = Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        } else {
+            temp = -Math.abs(gc * Math.sqrt(1 + gs * gs / (gc * gc)));
+        }
+        gc = work[l1 - 1] / temp;
+        gs = work[l1] / temp;
+
+        if (gc === 1) {
+            // GOTO 798
+            return 798;
+        }
+        if (gc === 0) {
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = work[l1 - 1];
+                work[l1 - 1] = work[l1];
+                work[l1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = dmat[i][it1];
+                dmat[i][it1] = dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = temp;
+            }
+        } else {
+            nu = gs / (1 + gc);
+            for (i = it1 + 1; i <= nact; i = i + 1) {
+                temp = gc * work[l1 - 1] + gs * work[l1];
+                work[l1] = nu * (work[l1 - 1] + temp) - work[l1];
+                work[l1 - 1] = temp;
+                l1 = l1 + i;
+            }
+            for (i = 1; i <= n; i = i + 1) {
+                temp = gc * dmat[i][it1] + gs * dmat[i][it1 + 1];
+                dmat[i][it1 + 1] = nu * (dmat[i][it1] + temp) - dmat[i][it1 + 1];
+                dmat[i][it1] = temp;
+            }
+        }
+
+        return 0;
+    }
+
+    function fn_goto_798() {
+        l1 = l - it1;
+        for (i = 1; i <= it1; i = i + 1) {
+            work[l1] = work[l];
+            l = l + 1;
+            l1 = l1 + 1;
+        }
+
+        work[iwuv + it1] = work[iwuv + it1 + 1];
+        iact[it1] = iact[it1 + 1];
+        it1 = it1 + 1;
+        if (it1 < nact) {
+            // GOTO 797
+            return 797;
+        }
+
+        return 0;
+    }
+
+    function fn_goto_799() {
+        work[iwuv + nact] = work[iwuv + nact + 1];
+        work[iwuv + nact + 1] = 0;
+        iact[nact] = 0;
+        nact = nact - 1;
+        iter[2] = iter[2] + 1;
+
+        return 0;
+    }
+
+    go = 0;
+    while (true) {
+        go = fn_goto_50();
+        if (go === 999) {
+            return;
+        }
+        while (true) {
+            go = fn_goto_55();
+            if (go === 0) {
+                break;
+            }
+            if (go === 999) {
+                return;
+            }
+            if (go === 700) {
+                if (it1 === nact) {
+                    fn_goto_799();
+                } else {
+                    while (true) {
+                        fn_goto_797();
+                        go = fn_goto_798();
+                        if (go !== 797) {
+                            break;
+                        }
+                    }
+                    fn_goto_799();
+                }
+            }
+        }
+    }
+
+}
+
+function solveQP(Dmat, dvec, Amat, bvec, meq, factorized) {
+    Dmat = base0to1(Dmat);
+    dvec = base0to1(dvec);
+    Amat = base0to1(Amat);
+    var i, n, q,
+        nact, r,
+        crval = [], iact = [], sol = [], work = [], iter = [],
+        message;
+
+    meq = meq || 0;
+    factorized = factorized ? base0to1(factorized) : [undefined, 0];
+    bvec = bvec ? base0to1(bvec) : [];
+
+    // In Fortran the array index starts from 1
+    n = Dmat.length - 1;
+    q = Amat[1].length - 1;
+
+    if (!bvec) {
+        for (i = 1; i <= q; i = i + 1) {
+            bvec[i] = 0;
+        }
+    }
+    for (i = 1; i <= q; i = i + 1) {
+        iact[i] = 0;
+    }
+    nact = 0;
+    r = Math.min(n, q);
+    for (i = 1; i <= n; i = i + 1) {
+        sol[i] = 0;
+    }
+    crval[1] = 0;
+    for (i = 1; i <= (2 * n + (r * (r + 5)) / 2 + 2 * q + 1); i = i + 1) {
+        work[i] = 0;
+    }
+    for (i = 1; i <= 2; i = i + 1) {
+        iter[i] = 0;
+    }
+
+    qpgen2(Dmat, dvec, n, n, sol, crval, Amat,
+        bvec, n, q, meq, iact, nact, iter, work, factorized);
+
+    message = "";
+    if (factorized[1] === 1) {
+        message = "constraints are inconsistent, no solution!";
+    }
+    if (factorized[1] === 2) {
+        message = "matrix D in quadratic function is not positive definite!";
+    }
+
+    return {
+        solution: base1to0(sol),
+        value: base1to0(crval),
+        unconstrained_solution: base1to0(dvec),
+        iterations: base1to0(iter),
+        iact: base1to0(iact),
+        message: message
+    };
+}
+
+numeric.solveQP = solveQP;
+/*
+Shanti Rao sent me this routine by private email. I had to modify it
+slightly to work on Arrays instead of using a Matrix object.
+It is apparently translated from http://stitchpanorama.sourceforge.net/Python/svd.py
+*/
+
+numeric.svd= function svd(A) {
+    var temp;
+//Compute the thin SVD from G. H. Golub and C. Reinsch, Numer. Math. 14, 403-420 (1970)
+    var prec= numeric.epsilon; //Math.pow(2,-52) // assumes double prec
+    var tolerance= 1.e-64/prec;
+    var itmax= 50;
+    var c=0;
+    var i=0;
+    var j=0;
+    var k=0;
+    var l=0;
+
+    var u= numeric.clone(A);
+    var m= u.length;
+
+    var n= u[0].length;
+
+    if (m < n) throw "Need more rows than columns";
+
+    var e = new Array(n);
+    var q = new Array(n);
+    for (i=0; i b)
+            return a*Math.sqrt(1.0+(b*b/a/a));
+        else if (b == 0.0)
+            return a;
+        return b*Math.sqrt(1.0+(a*a/b/b));
+    }
+
+    //Householder's reduction to bidiagonal form
+
+    var f= 0.0;
+    var g= 0.0;
+    var h= 0.0;
+    var x= 0.0;
+    var y= 0.0;
+    var z= 0.0;
+    var s= 0.0;
+
+    for (i=0; i < n; i++)
+    {
+        e[i]= g;
+        s= 0.0;
+        l= i+1;
+        for (j=i; j < m; j++)
+            s += (u[j][i]*u[j][i]);
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g-s;
+            u[i][i]=f-g;
+            for (j=l; j < n; j++)
+            {
+                s= 0.0;
+                for (k=i; k < m; k++)
+                    s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++)
+                    u[k][j]+=f*u[k][i];
+            }
+        }
+        q[i]= g;
+        s= 0.0;
+        for (j=l; j < n; j++)
+            s= s + u[i][j]*u[i][j];
+        if (s <= tolerance)
+            g= 0.0;
+        else
+        {
+            f= u[i][i+1];
+            g= Math.sqrt(s);
+            if (f >= 0.0) g= -g;
+            h= f*g - s;
+            u[i][i+1] = f-g;
+            for (j=l; j < n; j++) e[j]= u[i][j]/h;
+            for (j=l; j < m; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += (u[j][k]*u[i][k]);
+                for (k=l; k < n; k++)
+                    u[j][k]+=s*e[k];
+            }
+        }
+        y= Math.abs(q[i])+Math.abs(e[i]);
+        if (y>x)
+            x=y;
+    }
+
+    // accumulation of right hand gtransformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        if (g != 0.0)
+        {
+            h= g*u[i][i+1];
+            for (j=l; j < n; j++)
+                v[j][i]=u[i][j]/h;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < n; k++)
+                    s += u[i][k]*v[k][j];
+                for (k=l; k < n; k++)
+                    v[k][j]+=(s*v[k][i]);
+            }
+        }
+        for (j=l; j < n; j++)
+        {
+            v[i][j] = 0;
+            v[j][i] = 0;
+        }
+        v[i][i] = 1;
+        g= e[i];
+        l= i;
+    }
+
+    // accumulation of left hand transformations
+    for (i=n-1; i != -1; i+= -1)
+    {
+        l= i+1;
+        g= q[i];
+        for (j=l; j < n; j++)
+            u[i][j] = 0;
+        if (g != 0.0)
+        {
+            h= u[i][i]*g;
+            for (j=l; j < n; j++)
+            {
+                s=0.0;
+                for (k=l; k < m; k++) s += u[k][i]*u[k][j];
+                f= s/h;
+                for (k=i; k < m; k++) u[k][j]+=f*u[k][i];
+            }
+            for (j=i; j < m; j++) u[j][i] = u[j][i]/g;
+        }
+        else
+            for (j=i; j < m; j++) u[j][i] = 0;
+        u[i][i] += 1;
+    }
+
+    // diagonalization of the bidiagonal form
+    prec= prec*x;
+    for (k=n-1; k != -1; k+= -1)
+    {
+        for (var iteration=0; iteration < itmax; iteration++)
+        {   // test f splitting
+            var test_convergence = false;
+            for (l=k; l != -1; l+= -1)
+            {
+                if (Math.abs(e[l]) <= prec)
+                {   test_convergence= true;
+                    break;
+                }
+                if (Math.abs(q[l-1]) <= prec)
+                    break;
+            }
+            if (!test_convergence)
+            {   // cancellation of e[l] if l>0
+                c= 0.0;
+                s= 1.0;
+                var l1= l-1;
+                for (i =l; i= itmax-1)
+				throw 'Error: no convergence.';
+            // shift from bottom 2x2 minor
+			x= q[l];
+			y= q[k-1];
+			g= e[k-1];
+			h= e[k];
+			f= ((y-z)*(y+z)+(g-h)*(g+h))/(2.0*h*y);
+			g= pythag(f,1.0);
+            if (f < 0.0)
+				f= ((x-z)*(x+z)+h*(y/(f-g)-h))/x;
+            else
+				f= ((x-z)*(x+z)+h*(y/(f+g)-h))/x;
+            // next QR transformation
+			c= 1.0;
+			s= 1.0;
+            for (i=l+1; i< k+1; i++)
+            {
+				g= e[i];
+				y= q[i];
+				h= s*g;
+				g= c*g;
+				z= pythag(f,h);
+				e[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= x*c+g*s;
+				g= -x*s+g*c;
+				h= y*s;
+				y= y*c;
+                for (j=0; j < n; j++)
+                {
+					x= v[j][i-1];
+					z= v[j][i];
+					v[j][i-1] = x*c+z*s;
+					v[j][i] = -x*s+z*c;
+                }
+				z= pythag(f,h);
+				q[i-1]= z;
+				c= f/z;
+				s= h/z;
+				f= c*g+s*y;
+				x= -s*g+c*y;
+                for (j=0; j < m; j++)
+                {
+					y= u[j][i-1];
+					z= u[j][i];
+					u[j][i-1] = y*c+z*s;
+					u[j][i] = -y*s+z*c;
+                }
+            }
+			e[l]= 0.0;
+			e[k]= f;
+			q[k]= x;
+        }
+    }
+
+    //vt= transpose(v)
+    //return (u,q,vt)
+    for (i=0;i= 0; j--)
+     {
+      if (q[j] < q[i])
+      {
+    //  writeln(i,'-',j)
+	   c = q[j];
+	   q[j] = q[i];
+	   q[i] = c;
+       for(k=0;k phi0 && t > epsilon) {
+                var theta = phi1 / phi0;
+                var u = (Math.sqrt(1.0 + 6.0 * theta) - 1.0) / (3.0 * theta);
+                t *= u;
+            }
+            else {
+                this.copyVariables(x, x_new);
+                break;
+            }
+        }
+    }
+
+    // add -dx to x to get the new variables
+    //
+    this.getNewVariableValue = function (x, dx, t) {
+        var x_new = new Array(x.length);
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x_new[i] = x[i] - t*dx[i];
+        }
+        
+        return x_new;
+    }
+
+    // copy x_new to x
+    //
+    this.copyVariables = function (x, x_new) {
+        var i = 0;
+        for (i = 0; i < x.length; i++) {
+            x[i] = x_new[i]
+        }
+    }
+
+    // evaluate the function value's residual
+    //
+    this.evaluate_residual = function (funcsVal) {
+        var i;
+        var residual = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            residual += Math.abs(funcsVal[i]);
+        }
+        return residual;
+    }
+
+    // evaluate the Euclidean_norm_of_residual
+    //
+    this.evaluate_Euclidean_norm_of_residual  = function (funcsVal) {
+        var i;
+        var residual2 = 0;
+        for (i = 0; i < funcsVal.length; i++) {
+            var fabs = Math.abs(funcsVal[i]);
+            residual2 += fabs*fabs;
+        }
+        return Math.sqrt(residual2);
+    }
+    
+    // main function start here
+    //    
+    var residual_tol = 1e-7;
+    var max_iteration = 1000;
+    var epsilon = 2.22e-16;
+    var JS_GSL_SUCCESS = 0;
+    var JS_GSL_CONTINUE = 1;
+
+    // evaluate none linear system of equations and its jacobian matrix
+    //
+    var funcs = F(x);
+    var jacobian = A(x);
+
+    // iterate to get the solution
+    //
+    var iter = 0;
+    var status;
+    do {
+        iter++;
+
+        this.newton_iterate(F, A, x);
+
+        if (this.evaluate_residual(F(x)) < residual_tol)
+            status = JS_GSL_SUCCESS;
+        else
+            status = JS_GSL_CONTINUE;
+        
+    } while (status == JS_GSL_CONTINUE && iter < max_iteration)
+
+}
+
+/* unit test
+
+Rosenbrock Function 
+
+  double y0 = 1 - x0;
+  double y1 = 10 * (x1 - x0 * x0);
+
+  x0 = -1.2
+  x1 = 1.0
+
+*/
+
+
+/**
+ * Searches the interval from lowerLimit to upperLimit
+ * for a root (i.e., zero) of the function func with respect to
+ * its first argument using Brent's method root-finding algorithm.
+ *
+ * @param {function} function for which the root is sought.
+ * @param {number} the lower point of the interval to be searched.
+ * @param {number} the upper point of the interval to be searched.
+ * @param {number} the desired accuracy (convergence tolerance).
+ * @param {number} the maximum number of iterations.
+ * @returns an estimate for the root within accuracy.
+ */
+// Translated from zeroin.c in http://www.netlib.org/c/brent.shar.
+numeric.uniroot = function uniroot(func, lowerLimit, upperLimit, errorTol, maxIter) {
+  var a = lowerLimit
+    , b = upperLimit
+    , c = a
+    , fa = func(a)
+    , fb = func(b)
+    , fc = fa
+    , s = 0
+    , fs = 0
+    , tol_act   // Actual tolerance
+    , new_step  // Step at this iteration
+    , prev_step // Distance from the last but one to the last approximation
+    , p         // Interpolation step is calculated in the form p/q; division is delayed until the last moment
+    , q
+    ;
+
+  errorTol = errorTol || 0;
+  maxIter  = maxIter  || 1000;
+
+  while ( maxIter-- > 0 ) {
+
+    prev_step = b - a;
+
+    if ( Math.abs(fc) < Math.abs(fb) ) {
+      // Swap data for b to be the best approximation
+      a = b, b = c, c = a;
+      fa = fb, fb = fc, fc = fa;
+    }
+
+    tol_act = 1e-15 * Math.abs(b) + errorTol / 2;
+    new_step = ( c - b ) / 2;
+
+    if ( Math.abs(new_step) <= tol_act || fb === 0 ) {
+      return b; // Acceptable approx. is found
+    }
+
+    // Decide if the interpolation can be tried
+    if ( Math.abs(prev_step) >= tol_act && Math.abs(fa) > Math.abs(fb) ) {
+      // If prev_step was large enough and was in true direction, Interpolatiom may be tried
+      var t1, cb, t2;
+      cb = c - b;
+      if ( a === c ) { // If we have only two distinct points linear interpolation can only be applied
+        t1 = fb / fa;
+        p = cb * t1;
+        q = 1.0 - t1;
+      }
+      else { // Quadric inverse interpolation
+        q = fa / fc, t1 = fb / fc, t2 = fb / fa;
+        p = t2 * (cb * q * (q - t1) - (b - a) * (t1 - 1));
+        q = (q - 1) * (t1 - 1) * (t2 - 1);
+      }
+
+      if ( p > 0 ) {
+        q = -q;  // p was calculated with the opposite sign; make p positive
+      }
+      else {
+        p = -p;  // and assign possible minus to q
+      }
+
+      if ( p < ( 0.75 * cb * q - Math.abs( tol_act * q ) / 2 ) &&
+           p < Math.abs( prev_step * q / 2 ) ) {
+        // If (b + p / q) falls in [b,c] and isn't too large it is accepted
+        new_step = p / q;
+      }
+
+      // If p/q is too large then the bissection procedure can reduce [b,c] range to more extent
+    }
+
+    if ( Math.abs( new_step ) < tol_act ) { // Adjust the step to be not less than tolerance
+      new_step = ( new_step > 0 ) ? tol_act : -tol_act;
+    }
+
+    a = b, fa = fb;     // Save the previous approx.
+    b += new_step, fb = func(b);  // Do step to a new approxim.
+
+    if ( (fb > 0 && fc > 0) || (fb < 0 && fc < 0) ) {
+      c = a, fc = fa; // Adjust c for it to have a sign opposite to that of b
+    }
+  }
+
+};
+
+
+/*
+var test_counter;
+function f1 (x) { test_counter++; return (Math.pow(x,2)-1)*x - 5; }
+function f2 (x) { test_counter++; return Math.cos(x)-x; }
+function f3 (x) { test_counter++; return Math.sin(x)-x; }
+function f4 (x) { test_counter++; return (x + 3) * Math.pow(x - 1, 2); }
+[
+  [f1, 2, 3],
+  [f2, 2, 3],
+  [f2, -1, 3],
+  [f3, -1, 3],
+  [f4, -4, 4/3]
+].forEach(function (args) {
+  test_counter = 0;
+  var root = uniroot.apply( pv, args );
+  ;;;console.log( 'uniroot:', args.slice(1), root, test_counter );
+})
+*/
+numeric.Sparse = function Sparse(p,v) { this.p = p; this.v = v; };
+
+numeric.Sparse.scatter = function scatter(i,j,z) {
+    var n = numeric.sup(j)+1,m=i.length,jk;
+    var p = Array(n),v = Array(n),k;
+    for(k=n-1;k!==-1;--k) { p[k] = []; v[k] = []; }
+    for(k=0;k!==m;++k) {
+        jk = j[k];
+        p[jk].push(i[k]);
+        v[jk].push(z[k]);
+    }
+    return new numeric.Sparse(p,v);
+};
+
+numeric.Sparse.identity = function identity(n) {
+    return numeric.Sparse.scatter(numeric.linspace(0,n-1),numeric.linspace(0,n-1),numeric.rep([n],1));
+};
+
+numeric.Sparse.prototype.dim = function dim() {
+    var m = 0, i,j,p=this.p,k=p.length,pi,a,b;
+    for(i=k-1;i!==-1;--i) {
+        pi = p[i];
+        a = pi.length;
+        for(j=a-1;j!==-1;--j) {
+            b = pi[j];
+            if(b>m) m = b;
+        }
+    }
+    return [m+1,p.length];
+};
+
+numeric.Sparse.prototype.Lsolve = function Lsolve(b,n) {
+    if(typeof n === "undefined") { n = b.length; }
+    var i,j,k,ret = Array(n), p = this.p, v = this.v, pj,vj,m;
+    for(i=0;ij && i=j) t[i-j] = vj[k];
+        }
+        if(j!==0) {
+            for(k=n-1;k!==-1;--k) foo[k] = 0;
+            for(k=0;k ../lib/numeric-$ver.js
 cp ../lib/numeric-$ver.js  ../lib/numeric.latest.js
diff --git a/tools/unit2.js b/tools/unit2.js
index cd66a6c..93944c6 100644
--- a/tools/unit2.js
+++ b/tools/unit2.js
@@ -27,7 +27,7 @@ function XMLHttpRequest() {
 if(typeof _fs !== "undefined") global.XMLHttpRequest = XMLHttpRequest;
 var _foo = myread('./documentation.html');
 var _baz = myread('./src/numeric.js');
-var _ver = _baz.match(/numeric.version[ =]*"([0-9.]*)".*/)[1];
+var _ver = _baz.match(/numeric.version[ =]*"([0-9.\-]*)".*/)[1];
 var _bar = _foo.match(/
    [\s\S]*?(?=<\/pre>)/g);
 //.join('\n').replace(/
    /g,'').split('\nIN> ');
 _baz = [];
diff --git a/workshop.php b/workshop.php
index 47f8ae9..f3dd72b 100644
--- a/workshop.php
+++ b/workshop.php
@@ -474,7 +474,7 @@ function submit() {
     $foo = json_decode($restore,true) or die("json error");
     $incs = $foo['scripts'];
     if(is_null($incs)) {
-        $incs = array(1 => 'lib/numeric-1.2.7.js');
+        $incs = array(1 => 'lib/numeric-1.2.8-2.js');
     }
     echo <<
 
-workshop.version = "1.2.7";
-workshop.updateVersion = "lib/numeric-1.2.7.js";
+workshop.version = "1.2.8-2";
+workshop.updateVersion = "lib/numeric-1.2.8-2.js";
 workshop.preload(workshop._restore);