NUMERICAL RECIPES THIRD EDITION v3.01 to v3.02 FILE COMPARISON
(Note: there are no code differences from v3.00 to v3.01.)
   
L: NR_C301 (previous version files)  
R: NR_C302 (new version files)  
   
File: code\cholesky.h  

L6	VecDoub tmp;

   
File: code\deviates.h  

L102

Int swch;

   
File: code\hash.h  

L13	kk = (Ullong *)key;\
R13	kk = (Ullong *)key;
L54	Hashtable(Int nh, Int nv);
R54	Hashtable(Int nh, Int nm);
L63	Hashtable<keyT,hfnT>::Hashtable(Int nh, Int nv):
	hash(sizeof(keyT)), nhash(nh), nmax(nv), nn(0), ng(0),
	htable(nh), next(nv), garbg(nv), thehash(nv) {
R63	Hashtable<keyT,hfnT>::Hashtable(Int nh, Int nm):
	hash(sizeof(keyT)), nhash(nh), nmax(nm), nn(0), ng(0),
	htable(nh), next(nm), garbg(nm), thehash(nm) {

   
File: code\kdtree.h  

L56	Int nearest(Int jpt);

   
File: code\ludcmp.h  

R30

imax=k;

   
File: code\mins_ndim.h  

L190	Doub den=MAX(fp,1.0);
R190	Doub den=MAX(abs(fp),1.0);

   
File: code\mparith.h  

L231	const Uint IAOFF=48,MACC=2;
R231	const Uint MACC=2;

   
File: code\pade.h  

L3	const Doub BIG=1.0e99;
L7	VecInt indx(n);

   
File: code\psplot.h  

L3	FILE *PLT;
	char *file;
R3	static FILE *PLT;
	static char *file;
L20	PSpage(FILE *PPLT, char *ffile) : PLT(PPLT), file(ffile){}
R20	PSpage() {}
L100	: PSpage(page.PLT,page.file),
	pll(ppll), qll(qqll), pur(ppur), qur(qqur),
R100	: pll(ppll), qll(qqll), pur(ppur), qur(qqur),
R202	FILE *PSpage::PLT;
	char *PSpage::file;

   
File: code\quasinewton.h  

L39	den=MAX(fret,1.0);
R39	den=MAX(abs(fret),1.0);

   
File: code\ran.h  
   
File: code\roots.h  

L275	Doub f=funcd(rts);
	Doub df=funcd.df(rts);
R275	f=funcd(rts);
	df=funcd.df(rts);

   
File: code\roots_multidim.h  

L183	if (qr->sing) throw("singular Jacobian in broydn");
R183	if (qr->sing) {
	MatDoub one(n,n,0.0);
	for (i=0;i<n;i++) one[i][i]=1.0;
	delete qr;
	qr=new QRdcmp(one);
	}
R223	Doub slope=0.0;
	for (i=0;i<n;i++) slope += g[i]*p[i];
	if (slope >= 0.0) {
	restrt=true;
	continue;
	}

   
File: code\savgol.h  

L8	VecInt indx(m+1);

   
File: code\series.h  
   
File: code\simplex.h  

R164	delete lu;
	for (Int i=0;i<n;i++)
	delete a[i+1];
R173	delete lu;
	for (Int i=0;i<n;i++)
	delete a[i+1];
R180	delete lu;
	for (Int i=0;i<n;i++)
	delete a[i+1];

   
File: code\stiel.h  
   
File: code\svd.h  

L52	int i,j,m=b.ncols();
	if (b.nrows() != n || x.nrows() != n || b.ncols() != x.ncols())
R52	int i,j,p=b.ncols();
	if (b.nrows() != m || x.nrows() != n || x.ncols() != p)
L55	VecDoub xx(n);
	for (j=0;j<m;j++) {
	for (i=0;i<n;i++) xx[i] = b[i][j];
	solve(xx,xx,thresh);
R55	VecDoub xx(n),bcol(m);
	for (j=0;j<p;j++) {
	for (i=0;i<m;i++) bcol[i] = b[i][j];
	solve(bcol,xx,thresh);