From cc3e0ffe8cca969669a015fefa757187dbe6b534 Mon Sep 17 00:00:00 2001
From: Martin von Gagern <gagern@ma.tum.de>
Date: Tue, 18 Nov 2014 16:36:35 +0100
Subject: [PATCH 1/2] 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<n; i++) e[i] = q[i] = 0.0;
-	var v = numeric.rep([n,n],0);
-//	v.zero();
-	
- 	function pythag(a,b)
- 	{
-		a = Math.abs(a)
-		b = Math.abs(b)
-		if (a > 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<k+1; i++)
-				{	
-					f= s*e[i]
-					e[i]= c*e[i]
-					if (Math.abs(f) <= prec)
-						break
-					g= q[i]
-					h= pythag(f,g)
-					q[i]= h
-					c= g/h
-					s= -f/h
-					for (j=0; j < m; j++)
-					{	
-						y= u[j][l1]
-						z= u[j][i]
-						u[j][l1] =  y*c+(z*s)
-						u[j][i] = -y*s+(z*c)
-					} 
-				}	
-			}
-			// test f convergence
-			z= q[k]
-			if (l== k)
-			{	//convergence
-				if (z<0.0)
-				{	//q[k] is made non-negative
-					q[k]= -z
-					for (j=0; j < n; j++)
-						v[j][k] = -v[j][k]
-				}
-				break  //break out of iteration loop and move on to next k value
-			}
-			if (iteration >= 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<q.length; i++) 
-	  if (q[i] < prec) q[i] = 0
-	  
-	//sort eigenvalues	
-	for (i=0; i< n; i++)
-	{	 
-	//writeln(q)
-	 for (j=i-1; j >= 0; j--)
-	 {
-	  if (q[j] < q[i])
-	  {
-	//  writeln(i,'-',j)
-	   c = q[j]
-	   q[j] = q[i]
-	   q[i] = c
-	   for(k=0;k<u.length;k++) { temp = u[k][i]; u[k][i] = u[k][j]; u[k][j] = temp; }
-	   for(k=0;k<v.length;k++) { temp = v[k][i]; v[k][i] = v[k][j]; v[k][j] = temp; }
-//	   u.swapCols(i,j)
-//	   v.swapCols(i,j)
-	   i = j	   
-	  }
-	 }	
-	}
-	
-	return {U:u,S:q,V:v}
-};
-
+/*
+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<n; i++) e[i] = q[i] = 0.0;
+	var v = numeric.rep([n,n],0);
+//	v.zero();
+	
+ 	function pythag(a,b)
+ 	{
+		a = Math.abs(a)
+		b = Math.abs(b)
+		if (a > 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<k+1; i++)
+				{	
+					f= s*e[i]
+					e[i]= c*e[i]
+					if (Math.abs(f) <= prec)
+						break
+					g= q[i]
+					h= pythag(f,g)
+					q[i]= h
+					c= g/h
+					s= -f/h
+					for (j=0; j < m; j++)
+					{	
+						y= u[j][l1]
+						z= u[j][i]
+						u[j][l1] =  y*c+(z*s)
+						u[j][i] = -y*s+(z*c)
+					} 
+				}	
+			}
+			// test f convergence
+			z= q[k]
+			if (l== k)
+			{	//convergence
+				if (z<0.0)
+				{	//q[k] is made non-negative
+					q[k]= -z
+					for (j=0; j < n; j++)
+						v[j][k] = -v[j][k]
+				}
+				break  //break out of iteration loop and move on to next k value
+			}
+			if (iteration >= 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<q.length; i++) 
+	  if (q[i] < prec) q[i] = 0
+	  
+	//sort eigenvalues	
+	for (i=0; i< n; i++)
+	{	 
+	//writeln(q)
+	 for (j=i-1; j >= 0; j--)
+	 {
+	  if (q[j] < q[i])
+	  {
+	//  writeln(i,'-',j)
+	   c = q[j]
+	   q[j] = q[i]
+	   q[i] = c
+	   for(k=0;k<u.length;k++) { temp = u[k][i]; u[k][i] = u[k][j]; u[k][j] = temp; }
+	   for(k=0;k<v.length;k++) { temp = v[k][i]; v[k][i] = v[k][j]; v[k][j] = temp; }
+//	   u.swapCols(i,j)
+//	   v.swapCols(i,j)
+	   i = j	   
+	  }
+	 }	
+	}
+	
+	return {U:u,S:q,V:v}
+};
+

From 233fcd640f467230e047546bf1438fa955a9fe1b Mon Sep 17 00:00:00 2001
From: Martin von Gagern <gagern@ma.tum.de>
Date: Tue, 18 Nov 2014 16:42:46 +0100
Subject: [PATCH 2/2] 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<foo.length;k++) {
       var bar = (foo[k]+",").match(pat),baz;
@@ -140,7 +140,7 @@ numeric.parseCSV = function parseCSV(t) {
       }
     }
     return ret;
-}
+};
 
 numeric.toCSV = function toCSV(A) {
     var s = numeric.dim(A);
@@ -154,14 +154,14 @@ numeric.toCSV = function toCSV(A) {
         ret[i] = row.join(', ');
     }
     return ret.join('\n')+'\n';
-}
+};
 
 numeric.getURL = function getURL(url) {
     var client = new XMLHttpRequest();
     client.open("GET",url,false);
     client.send();
     return client;
-}
+};
 
 numeric.imageURL = function imageURL(img) {
     function base64(A) {
@@ -303,14 +303,14 @@ numeric.imageURL = function imageURL(img) {
     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;
@@ -326,7 +326,7 @@ numeric.dim = function dim(x) {
         return [x.length];
     }
     return [];
-}
+};
 
 numeric.mapreduce = function mapreduce(body,init) {
     return Function('x','accum','_s','_k',
@@ -354,7 +354,7 @@ numeric.mapreduce = function mapreduce(body,init) {
             '}\n'+
             'return accum;'
             );
-}
+};
 numeric.mapreduce2 = function mapreduce2(body,setup) {
     return Function('x',
             'var n = x.length;\n'+
@@ -365,7 +365,7 @@ numeric.mapreduce2 = function mapreduce2(body,setup) {
             '}\n'+
             'return accum;'
             );
-}
+};
 
 
 numeric.same = function same(x,y) {
@@ -379,7 +379,7 @@ numeric.same = function same(x,y) {
         else { return false; }
     }
     return true;
-}
+};
 
 numeric.rep = function rep(s,v,k) {
     if(typeof k === "undefined") { k=0; }
@@ -391,7 +391,7 @@ numeric.rep = function rep(s,v,k) {
     }
     for(i=n-1;i>=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<n;j++) ret[j] = Array(m);
@@ -899,7 +899,7 @@ numeric.negtranspose = function negtranspose(x) {
         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;
@@ -914,10 +914,10 @@ numeric._random = function _random(s,k) {
     }
     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.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;j<j1;++j) { B[Aj[j]][i] = Av[j]; }
     }
     return B;
-}
+};
 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);
@@ -1630,12 +1630,12 @@ numeric.ccsTSolve = function ccsTSolve(A,b,x,bj,xj) {
         }
     }
     return x;
-}
+};
 numeric.ccsDFS = function ccsDFS(n) {
     this.k = Array(n);
     this.k1 = Array(n);
     this.j = Array(n);
-}
+};
 numeric.ccsDFS.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv) {
     var m = 0,foo,n=xj.length;
     var k = this.k, k1 = this.k1, j = this.j,km,k11;
@@ -1664,7 +1664,7 @@ numeric.ccsDFS.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv) {
             } 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];
@@ -1688,7 +1688,7 @@ numeric.ccsLPSolve = function ccsLPSolve(A,B,x,xj,I,Pinv,dfs) {
         }
     }
     return x;
-}
+};
 numeric.ccsLUP1 = function ccsLUP1(A,threshold) {
     var m = A[0].length-1;
     var L = [numeric.rep([m+1],0),[],[]], U = [numeric.rep([m+1], 0),[],[]];
@@ -1735,12 +1735,12 @@ numeric.ccsLUP1 = function ccsLUP1(A,threshold) {
     }
     for(j=Lj.length-1;j!==-1;--j) { Lj[j] = Pinv[Lj[j]]; }
     return {L:L, U:U, P:P, Pinv:Pinv};
-}
+};
 numeric.ccsDFS0 = function ccsDFS0(n) {
     this.k = Array(n);
     this.k1 = Array(n);
     this.j = Array(n);
-}
+};
 numeric.ccsDFS0.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv,P) {
     var m = 0,foo,n=xj.length;
     var k = this.k, k1 = this.k1, j = this.j,km,k11;
@@ -1771,7 +1771,7 @@ numeric.ccsDFS0.prototype.dfs = function dfs(J,Ai,Aj,x,xj,Pinv,P) {
             } 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];
@@ -1793,7 +1793,7 @@ numeric.ccsLPSolve0 = function ccsLPSolve0(A,B,y,xj,I,Pinv,P,dfs) {
         for(k=j0;k<j1;++k) y[Aj[k]] -= a*Av[k];
         y[l] = a;
     }
-}
+};
 numeric.ccsLUP0 = function ccsLUP0(A,threshold) {
     var m = A[0].length-1;
     var L = [numeric.rep([m+1],0),[],[]], U = [numeric.rep([m+1], 0),[],[]];
@@ -1839,10 +1839,10 @@ numeric.ccsLUP0 = function ccsLUP0(A,threshold) {
     }
     for(j=Lj.length-1;j!==-1;--j) { Lj[j] = Pinv[Lj[j]]; }
     return {L:L, U:U, P:P, Pinv:Pinv};
-}
+};
 numeric.ccsLUP = numeric.ccsLUP0;
 
-numeric.ccsDim = function ccsDim(A) { return [numeric.sup(A[1])+1,A[0].length-1]; }
+numeric.ccsDim = function ccsDim(A) { return [numeric.sup(A[1])+1,A[0].length-1]; };
 numeric.ccsGetBlock = function ccsGetBlock(A,i,j) {
     var s = numeric.ccsDim(A),m=s[0],n=s[1];
     if(typeof i === "undefined") { i = numeric.linspace(0,m-1); }
@@ -1877,7 +1877,7 @@ numeric.ccsGetBlock = function ccsGetBlock(A,i,j) {
         Bi[q+1] = count;
     }
     return B;
-}
+};
 
 numeric.ccsDot = function ccsDot(A,B) {
     var Ai = A[0], Aj = A[1], Av = A[2];
@@ -1920,7 +1920,7 @@ numeric.ccsDot = function ccsDot(A,B) {
         Ci[k+1] = Ci[k]+p;
     }
     return C;
-}
+};
 
 numeric.ccsLUPSolve = function ccsLUPSolve(LUP,B) {
     var L = LUP.L, U = LUP.U, P = LUP.P;
@@ -1960,7 +1960,7 @@ numeric.ccsLUPSolve = function ccsLUPSolve(LUP,B) {
         Xi[i+1] = N;
     }
     return [Xi,Xj,Xv];
-}
+};
 
 numeric.ccsbinop = function ccsbinop(body,setup) {
     if(typeof setup === "undefined") setup='';
@@ -2044,7 +2044,7 @@ numeric.ccsScatter = function ccsScatter(A) {
         ptr[Aii]=ptr[Aii]+1;
     }
     return [Ri,Rj,Rv];
-}
+};
 
 numeric.ccsGather = function ccsGather(A) {
     var Ai = A[0], Aj = A[1], Av = A[2];
@@ -2063,7 +2063,7 @@ numeric.ccsGather = function ccsGather(A) {
         }
     }
     return [Ri,Rj,Rv];
-}
+};
 
 // The following sparse linear algebra routines are deprecated.
 
@@ -2092,7 +2092,7 @@ numeric.sclone = function clone(A,k,n) {
         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;
@@ -2103,9 +2103,9 @@ numeric.sdiag = function diag(d) {
     }
     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.sidentity = function identity(n) { return numeric.sdiag(numeric.rep([n],1)); };
 
 numeric.stranspose = function transpose(A) {
     var ret = [], n = A.length, i,j,Ai;
@@ -2119,7 +2119,7 @@ numeric.stranspose = function transpose(A) {
         }
     }
     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.");
@@ -2144,7 +2144,7 @@ numeric.sdotMM = function dotMM(A,B) {
         ret[i] = reti;
     }
     return ret;
-}
+};
 
 numeric.sdotMV = function dotMV(A,x) {
     var p = A.length, Ai, i,j;
@@ -2159,7 +2159,7 @@ numeric.sdotMV = function dotMV(A,x) {
         if(accum) ret[i] = accum;
     }
     return ret;
-}
+};
 
 numeric.sdotVM = function dotMV(x,A) {
     var i,j,Ai,alpha;
@@ -2175,13 +2175,13 @@ numeric.sdotVM = function dotMV(x,A) {
         }
     }
     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;
@@ -2194,7 +2194,7 @@ numeric.sdot = function dot(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;
@@ -2209,7 +2209,7 @@ numeric.sscatter = function scatter(V) {
         Aj[V[j][i]] = V[j+1][i];
     }
     return A;
-}
+};
 
 numeric.sgather = function gather(A,ret,k) {
     if(typeof ret === "undefined") ret = [];
@@ -2233,7 +2233,7 @@ numeric.sgather = function gather(A,ret,k) {
     }
     if(k.length>n) 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[1]/2); }
+            shape = function(i,j) { return (i>=n[0]/2 || j<n[1]/2); };
             break;
         default:
             shape = function(i,j) { return true; };
@@ -2352,7 +2352,7 @@ numeric.cgrid = function grid(n,shape) {
             count++;
         }
     return ret;
-}
+};
 
 numeric.cdelsq = function delsq(g) {
     var dir = [[-1,0],[0,-1],[0,1],[1,0]];
@@ -2373,7 +2373,7 @@ numeric.cdelsq = function delsq(g) {
         Lv.push(4);
     }
     return [Li,Lj,Lv];
-}
+};
 
 numeric.cdotMV = function dotMV(A,x) {
     var ret, Ai = A[0], Aj = A[1], Av = A[2],k,p=Ai.length,N;
@@ -2383,11 +2383,11 @@ numeric.cdotMV = function dotMV(A,x) {
     ret = numeric.rep([N],0);
     for(k=0;k<p;k++) { ret[Ai[k]]+=Av[k]*x[Aj[k]]; }
     return ret;
-}
+};
 
 // 7. Splines
 
-numeric.Spline = function Spline(x,yl,yr,kl,kr) { this.x = x; this.yl = yl; this.yr = yr; this.kl = kl; this.kr = kr; }
+numeric.Spline = function Spline(x,yl,yr,kl,kr) { this.x = x; this.yl = yl; this.yr = yr; this.kl = kl; this.kr = kr; };
 numeric.Spline.prototype._at = function _at(x1,p) {
     var x = this.x;
     var yl = this.yl;
@@ -2401,7 +2401,7 @@ numeric.Spline.prototype._at = function _at(x1,p) {
     t = (x1-x[p])/(x[p+1]-x[p]);
     var s = t*(1-t);
     return add(add(add(mul(1-t,yl[p]),mul(t,yr[p+1])),mul(a,s*(1-t))),mul(b,s*t));
-}
+};
 numeric.Spline.prototype.at = function at(x0) {
     if(typeof x0 === "number") {
         var x = this.x;
@@ -2419,7 +2419,7 @@ numeric.Spline.prototype.at = function at(x0) {
     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;
@@ -2437,7 +2437,7 @@ numeric.Spline.prototype.diff = function diff() {
         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) {
@@ -2530,7 +2530,7 @@ numeric.Spline.prototype.roots = function roots() {
     }
     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;
@@ -2600,7 +2600,7 @@ numeric.spline = function spline(x,y,k1,kn) {
     if(typeof y[0] === "number") k = k[0];
     else k = numeric.transpose(k);
     return new numeric.Spline(x,y,y,k,k);
-}
+};
 
 // 8. FFT
 numeric.fftpow2 = function fftpow2(x,y) {
@@ -2630,7 +2630,7 @@ numeric.fftpow2 = function fftpow2(x,y) {
         x[i] = xe[j] + ci*xo[j] - si*yo[j];
         y[i] = ye[j] + ci*yo[j] + si*xo[j];
     }
-}
+};
 numeric._ifftpow2 = function _ifftpow2(x,y) {
     var n = x.length;
     if(n === 1) return;
@@ -2658,12 +2658,12 @@ numeric._ifftpow2 = function _ifftpow2(x,y) {
         x[i] = xe[j] + ci*xo[j] - si*yo[j];
         y[i] = ye[j] + ci*yo[j] + si*xo[j];
     }
-}
+};
 numeric.ifftpow2 = function ifftpow2(x,y) {
     numeric._ifftpow2(x,y);
     numeric.diveq(x,x.length);
     numeric.diveq(y,y.length);
-}
+};
 numeric.convpow2 = function convpow2(ax,ay,bx,by) {
     numeric.fftpow2(ax,ay);
     numeric.fftpow2(bx,by);
@@ -2674,7 +2674,7 @@ numeric.convpow2 = function convpow2(ax,ay,bx,by) {
         ay[i] = axi*byi+ayi*bxi;
     }
     numeric.ifftpow2(ax,ay);
-}
+};
 numeric.T.prototype.fft = function fft() {
     var x = this.x, y = this.y;
     var n = x.length, log = Math.log, log2 = log(2),
@@ -2690,7 +2690,7 @@ numeric.T.prototype.fft = function fft() {
         cx[k] = cos(t);
         cy[k] = sin(t);
         cx[m-k] = cos(t);
-        cy[m-k] = sin(t)
+        cy[m-k] = sin(t);
     }
     var X = new numeric.T(a,b), Y = new numeric.T(cx,cy);
     X = X.mul(Y);
@@ -2699,7 +2699,7 @@ numeric.T.prototype.fft = function fft() {
     X.x.length = n;
     X.y.length = n;
     return X;
-}
+};
 numeric.T.prototype.ifft = function ifft() {
     var x = this.x, y = this.y;
     var n = x.length, log = Math.log, log2 = log(2),
@@ -2715,7 +2715,7 @@ numeric.T.prototype.ifft = function ifft() {
         cx[k] = cos(t);
         cy[k] = sin(t);
         cx[m-k] = cos(t);
-        cy[m-k] = sin(t)
+        cy[m-k] = sin(t);
     }
     var X = new numeric.T(a,b), Y = new numeric.T(cx,cy);
     X = X.mul(Y);
@@ -2724,7 +2724,7 @@ numeric.T.prototype.ifft = function ifft() {
     X.x.length = n;
     X.y.length = n;
     return X.div(n);
-}
+};
 
 //9. Unconstrained optimization
 numeric.gradient = function gradient(f,x) {
@@ -2759,7 +2759,7 @@ numeric.gradient = function gradient(f,x) {
             }
     }
     return J;
-}
+};
 
 numeric.uncmin = function uncmin(f,x0,tol,gradient,maxit,callback,options) {
     var grad = numeric.gradient;
@@ -2819,7 +2819,7 @@ numeric.uncmin = function uncmin(f,x0,tol,gradient,maxit,callback,options) {
         ++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) {
@@ -2830,7 +2830,7 @@ numeric.Dopri = function Dopri(x,y,f,ymid,iterations,msg,events) {
     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;
@@ -2862,7 +2862,7 @@ numeric.Dopri.prototype._at = function _at(xi,j) {
                            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") {
@@ -2880,7 +2880,7 @@ numeric.Dopri.prototype.at = function at(x) {
         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; }
@@ -2996,7 +2996,7 @@ numeric.dopri = function dopri(x0,x1,y0,f,tol,maxit,event) {
     }
     ret.iterations = it;
     return ret;
-}
+};
 
 // 11. Ax = b
 numeric.LU = function(A, fast) {
@@ -3049,7 +3049,7 @@ numeric.LU = function(A, fast) {
     LU: A,
     P:  P
   };
-}
+};
 
 numeric.LUsolve = function LUsolve(LUP, b) {
   var i, j;
@@ -3084,9 +3084,9 @@ numeric.LUsolve = function LUsolve(LUP, b) {
   }
 
   return x;
-}
+};
 
-numeric.solve = function solve(A,b,fast) { return numeric.LUsolve(numeric.LU(A,fast), b); }
+numeric.solve = function solve(A,b,fast) { return numeric.LUsolve(numeric.LU(A,fast), b); };
 
 // 12. Linear programming
 numeric.echelonize = function echelonize(A) {
@@ -3113,7 +3113,7 @@ numeric.echelonize = function echelonize(A) {
         }
     }
     return {I:I, A:A, P:P};
-}
+};
 
 numeric.__solveLP = function __solveLP(c,A,b,tol,maxit,x,flag) {
     var sum = numeric.sum, log = numeric.log, mul = numeric.mul, sub = numeric.sub, dot = numeric.dot, div = numeric.div, add = numeric.add;
@@ -3159,7 +3159,7 @@ numeric.__solveLP = function __solveLP(c,A,b,tol,maxit,x,flag) {
         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;
@@ -3208,7 +3208,7 @@ numeric.solveLP = function solveLP(c,A,b,Aeq,beq,tol,maxit) {
     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'); }
@@ -3260,4 +3260,4 @@ numeric.MPStoLP = function MPStoLP(MPS) {
         }
     }
     err('Reached end of file without ENDATA');
-}
+};
diff --git a/src/sparse2.js b/src/sparse2.js
index 89d93c8..fd0b5c6 100644
--- a/src/sparse2.js
+++ b/src/sparse2.js
@@ -1,4 +1,4 @@
-numeric.Sparse = function Sparse(p,v) { this.p = p; this.v = v; }
+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;
@@ -9,10 +9,10 @@ numeric.Sparse.scatter = function scatter(i,j,z) {
         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) {
@@ -24,7 +24,7 @@ numeric.Sparse.prototype.dim = function dim() {
         }
     }
     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;
@@ -47,7 +47,7 @@ numeric.Sparse.prototype.Lsolve = function Lsolve(b,n) {
         }
     }
     return ret;
-}
+};
 numeric.Sparse.prototype.LU = function LU() {
     var p = this.p, v = this.v, pj, vj, n = p.length,m;
     var i,j,k, L = numeric.Sparse.identity(n), Up = Array(n), Uv = Array(n),uj,t,Lpj,Lvj;
@@ -93,7 +93,7 @@ numeric.Sparse.prototype.LU = function LU() {
         L.v[j] = Lvj;
     }
     return {L:L, U:new numeric.Sparse(Up,Uv)};
-}
+};
 numeric.Sparse.prototype.dotV = function dotV(x) {
     var p = this.p, v = this.v, m = (this.dim())[0], n = x.length,xj;
     var i,j,k,pj,vj,a, ret = numeric.rep([m],0);
@@ -107,7 +107,7 @@ numeric.Sparse.prototype.dotV = function dotV(x) {
         }
     }
     return ret;
-}
+};
 numeric.Sparse.prototype.dotM = function dotM(A) {
     var u,v,n = A.p.length, m = (A.dim())[1],Api,Avi,a;
     var i,j,k;
@@ -128,9 +128,9 @@ numeric.Sparse.prototype.dotM = function dotM(A) {
         Rv[i] = Avi;
     }
     return new numeric.Sparse(Rp,Rv);
-}
+};
 numeric.Sparse.prototype.dot = function dot(z) {
     if(z instanceof numeric.Sparse) return this.dotM(z);
     return this.dotV(z);
-}
+};
 
diff --git a/src/svd.js b/src/svd.js
index 1db88e6..e32546d 100644
--- a/src/svd.js
+++ b/src/svd.js
@@ -21,7 +21,7 @@ numeric.svd= function svd(A) {
 	
 	var n= u[0].length;
 	
-	if (m < n) throw "Need more rows than columns"
+	if (m < n) throw "Need more rows than columns";
 	
 	var e = new Array(n);
 	var q = new Array(n);
@@ -31,13 +31,13 @@ numeric.svd= function svd(A) {
 	
  	function pythag(a,b)
  	{
-		a = Math.abs(a)
-		b = Math.abs(b)
+		a = Math.abs(a);
+		b = Math.abs(b);
 		if (a > 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<k+1; i++)
 				{	
-					f= s*e[i]
-					e[i]= c*e[i]
+					f= s*e[i];
+					e[i]= c*e[i];
 					if (Math.abs(f) <= prec)
-						break
-					g= q[i]
-					h= pythag(f,g)
-					q[i]= h
-					c= g/h
-					s= -f/h
+						break;
+					g= q[i];
+					h= pythag(f,g);
+					q[i]= h;
+					c= g/h;
+					s= -f/h;
 					for (j=0; j < m; j++)
 					{	
-						y= u[j][l1]
-						z= u[j][i]
-						u[j][l1] =  y*c+(z*s)
-						u[j][i] = -y*s+(z*c)
+						y= u[j][l1];
+						z= u[j][i];
+						u[j][l1] =  y*c+(z*s);
+						u[j][i] = -y*s+(z*c);
 					} 
 				}	
 			}
 			// test f convergence
-			z= q[k]
+			z= q[k];
 			if (l== k)
 			{	//convergence
 				if (z<0.0)
 				{	//q[k] is made non-negative
-					q[k]= -z
+					q[k]= -z;
 					for (j=0; j < n; j++)
-						v[j][k] = -v[j][k]
+						v[j][k] = -v[j][k];
 				}
-				break  //break out of iteration loop and move on to next k value
+				break; //break out of iteration loop and move on to next k value
 			}
 			if (iteration >= 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<q.length; i++) 
-	  if (q[i] < prec) q[i] = 0
+	  if (q[i] < prec) q[i] = 0;
 	  
 	//sort eigenvalues	
 	for (i=0; i< n; i++)
@@ -279,18 +279,18 @@ numeric.svd= function svd(A) {
 	  if (q[j] < q[i])
 	  {
 	//  writeln(i,'-',j)
-	   c = q[j]
-	   q[j] = q[i]
-	   q[i] = c
+	   c = q[j];
+	   q[j] = q[i];
+	   q[i] = c;
 	   for(k=0;k<u.length;k++) { temp = u[k][i]; u[k][i] = u[k][j]; u[k][j] = temp; }
 	   for(k=0;k<v.length;k++) { temp = v[k][i]; v[k][i] = v[k][j]; v[k][j] = temp; }
 //	   u.swapCols(i,j)
 //	   v.swapCols(i,j)
-	   i = j	   
+	   i = j;
 	  }
 	 }	
 	}
 	
-	return {U:u,S:q,V:v}
+	return {U:u,S:q,V:v};
 };