diff -rc2P gsl-1.6/AUTHORS gsl-1.7/AUTHORS *** gsl-1.6/AUTHORS Tue Jul 22 15:20:10 2003 --- gsl-1.7/AUTHORS Tue Sep 13 09:44:43 2005 *************** *** 21,24 **** Nicolas Darnis (ndarnis@cvf.fr) - canonical permutation functions Tuomo Keskitalo (tuomo.keskitalo@iki.fi) - multidimensional minimization ! Ivo Alxneit (ivo.alxneit@psi.ch) - multidimensional minimization Jason H. Stover (jason@sakla.net) - cumulative distribution functions \ No newline at end of file --- 21,25 ---- Nicolas Darnis (ndarnis@cvf.fr) - canonical permutation functions Tuomo Keskitalo (tuomo.keskitalo@iki.fi) - multidimensional minimization ! Ivo Alxneit (ivo.alxneit@psi.ch) - multidimensional minimization, wavelet ! transforms Jason H. Stover (jason@sakla.net) - cumulative distribution functions \ No newline at end of file diff -rc2P gsl-1.6/BUGS gsl-1.7/BUGS *** gsl-1.6/BUGS Mon Dec 27 19:18:37 2004 --- gsl-1.7/BUGS Mon Aug 22 15:26:23 2005 *************** *** 49,244 **** The correct value is -2. - - ---------------------------------------------------------------------- - BUG#10 -- gsl_sf_fermi_dirac_int error estimates - - Some of the error estimates on gsl_sf_fermi_dirac_int are much too - large. The value itself is pretty accurate. - - In the test_sf_result you need to work in something like - - if(r.err > 1.0e5 * (fabs(r.val - val) + GSL_DBL_EPSILON * fabs(val))) - s |= TEST_SF_INCONS; /* error estimate too large */ - - in addition to the existing - - if(fabs(val - r.val) > 2.0*r.err) s |= TEST_SF_INCONS; - - to catch those. - - #include - #include - #include - - int main() { - gsl_sf_result r; - int status; - - status = gsl_sf_fermi_dirac_int_e (9, 500.0, &r); - printf("FD_9(500) = %.18e +- %.18e\n", r.val, r.err); - } - - result, - - FD_9(500) = 2.692738498426942915e+20 +- 2.629627439870118259e+47 - - Exact = 2.692738498...e+20 - ---------------------------------------------------------------------- ! BUG#14 -- qagil ! ! The extrapolation used in qags gives negative results when integrating ! the small tails of probability distributions using qagil, even though ! each individual term in the sequence is positive and increasing (!). ! This is a feature of the original quadpack and appears to be due to ! the extrapolation algorithm, which should probably be tweaked to avoid ! this undesirable behavior. ! ! ---------------------------------------------------------------------- ! BUG#18 -- R250 discrepancy, and initialisation in R250 / GSFR4 ! ! This bug report is correct. The original paper has the same discrepancy. ! ! From: Andreas Schneider <1@c07.de> ! To: bug-gsl@gnu.org ! Subject: [Bug-gsl] Wrong algorithm in gsl_rng_r250 ! Date: Sun, 25 Apr 2004 13:23:39 +0200 ! ! The documentation claims that gsl_rng_r250 does ! x_n = x_{n-103} ^ x_{n-250}, ! but actually the implementation does ! ! x_n = x_{n-147} ^ x_{n-250}. ! ! This error seems to be very common. It must have been introduced long time ago. ! ! I fed some data from both variants into Marsaglia's diehard and found that the ! documented version is better in most tests. Thus the error is probably in the ! implementation and the documentation is right. ! ! The orthogonalisation routine for R250 is different from the original ! paper (it should be k=7*i+3 instead of k=7+i*3) ! ! Also in the initialisation of GSFR, the initial lower 6695 indices ! never participate in calculations of subsequent random numbers, so the ! "orthogonalisation" has no effect. Check whether this also affects ! R250. ! ! ---------------------------------------------------------------------- ! BUG#20 -- seg fault from gsl_sf_legendre_sphPlm_e (underflow) ! ! In the following bit of code, the first call works, but the second call ! fails with an internal underflow gsl: exp.c:541: ERROR: underflow ! ! #include ! #include ! #include ! #include ! ! int main() { ! gsl_sf_result y; ! gsl_sf_legendre_sphPlm_e(140,135,1,&y); gsl_sf_legendre_sphPlm_e(140,135,0.99998689456491752,&y); - return(0); - } - - Reported by "Kevin M. Huffenberger" - ---------------------------------------------------------------------- - BUG#22 - test suite fails with djgpp - Andris Pavenis reports that the test suite fails - on DOS with djgpp due to missing $(EXEEXT) extensions on the - executables in TESTS. This is an automake problem, but can be worked - around by adding the extensions $(EXEEXT) manually to each executable - in the TEST= lines in */Makefile.am. He supplied a patch to do this. ---------------------------------------------------------------------- ! BUG#26 - underflow in gsl_sf_legendre_sphPlm_array ! there is a potential underflow in legendre_poly.c in the lines ! lnpre = -0.25*M_LNPI + 0.5 * (lnpoch.val + m*lncirc.val); ! y_mm = sqrt((2.0+1.0/m)/(4.0*M_PI)) * sgn * exp(lnpre); ! ! for large negative values of lnpre. ! ! #include ! #include ! #include ! ! int main (void) { ! int lmax=2000, l=1997, m=796; ! double Xlm[2005]; ! double cx = 0.921; ! int status = gsl_sf_legendre_sphPlm_array(lmax,m,cx,Xlm); ! double v = Xlm[l-m]; ! printf("cx= %.5e l=%d m=%d Plm=%.18e status=%d\n",cx,l,m,v, status); ! } ! ! ---------------------------------------------------------------------- ! BUG#27 - handling of zero leading coefficients in poly/*solve routines ! ! The poly/solve_ and poly/zsolve_ routines should handle the case of ! leading coefficients being zero more gracefully. Currently the ! leading coefficient is assumed to be non-zero. ! ---------------------------------------------------------------------- ! BUG#28 - underflow for small parameters in gsl_ran_gamma ! The function gsl_ran_gamma does not handle the case of small ! parameters well, a<<1, returning 0 (probably via underflow). ! #include ! #include ! #include ! ! int main() { ! gsl_rng *rng; ! double x; ! gsl_rng_env_setup(); ! rng = gsl_rng_alloc (gsl_rng_default); ! x = gsl_ran_gamma(rng, 1e-3, 1.0); ! printf("%.18e\n", x); ! } ! ---------------------------------------------------------------------- ! BUG#29 - missing documentation for gsl_sf_legendre_Pl_deriv_array etc ! There is no documentation for the _deriv_ functions in ! specfunc/legendre_poly.c. They are tested and part of the public API ! so they should be documented. ! ! ---------------------------------------------------------------------- ! BUG#30 - incorrect result from gsl_sf_elljac_e ! The function gsl_sf_elljac_e returns an incorrect result in the first ! case below, due propagated inaccuracies from cancellation error. The ! correct result should be dn(3K)=sqrt(2) but the returned result is ! 1.0. ! ! #include ! #include ! #include ! #include ! #include ! ! int main (void) ! { ! double m = 0.5; ! double phi = M_PI_2; ! double sn; ! double cn; ! double dn1,dn2; ! double K; ! int ignore; ! ! K = gsl_sf_ellint_F(M_PI_2,sqrt(m), GSL_PREC_DOUBLE); ! ignore = gsl_sf_elljac_e(3*K, m, &sn, &cn, &dn1); ! ignore = gsl_sf_elljac_e(3*K+0.00000001, m, &sn, &cn, &dn2); ! ! printf("%.18e\n", dn1); ! printf("%.18e\n", dn2); ! return 0; ! } ---------------------------------------------------------------------- --- 49,95 ---- The correct value is -2. ---------------------------------------------------------------------- ! BUG#20 -- underflow in gsl_sf_legendre_sphPlm functions ! The functions gsl_sf_legendre_sphPlm and gsl_sf_legendre_sphPlm_array ! have underflows for large l,m. Also the error can be significant in ! these cases (even though the computed value is reasonable). ! gsl_sf_legendre_sphPlm_e(200, 1, -0.5,&y) -- large error ! gsl_sf_legendre_sphPlm_e(140,135,1,&y); -- underflow gsl_sf_legendre_sphPlm_e(140,135,0.99998689456491752,&y); ---------------------------------------------------------------------- ! BUG#41 -- improve constness in multifit ! Not really a bug but worth fixing. There are a few others like this ! lurking out there. ! From: Jari Häkkinen ! To: bug-gsl@gnu.org ! Subject: [Bug-gsl] 'const'ness of function arguments ! Date: Tue, 16 Aug 2005 20:37:13 +0200 ! Precedence: list ! Envelope-to: bjg@network-theory.co.uk ! Hi all, ! I've noticed two fitting functions that probably should have a 'const' ! qualifier on the third argument. The 'x' parameter in fdfsolver.c: ! int ! gsl_multifit_fdfsolver_set (gsl_multifit_fdfsolver * s, ! gsl_multifit_function_fdf * f, ! gsl_vector * x) ! and in fsolver.c: ! int ! gsl_multifit_fsolver_set (gsl_multifit_fsolver * s, ! gsl_multifit_function * f, ! gsl_vector * x) ! can safely be set to 'const' since these are only used for ! initialization of another gsl_vector. ---------------------------------------------------------------------- + Last assigned bug number = 41 diff -rc2P gsl-1.6/COPYING gsl-1.7/COPYING *** gsl-1.6/COPYING Tue Aug 12 13:36:58 2003 --- gsl-1.7/COPYING Sun Jun 26 13:25:34 2005 *************** *** 1,8 **** - GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. ! 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. --- 1,7 ---- GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. ! 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. *************** *** 307,311 **** You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --- 306,310 ---- You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software ! Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA *************** *** 315,319 **** when it starts in an interactive mode: ! Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it --- 314,318 ---- when it starts in an interactive mode: ! Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it diff -rc2P gsl-1.6/ChangeLog gsl-1.7/ChangeLog *** gsl-1.6/ChangeLog Fri Nov 12 17:19:34 2004 --- gsl-1.7/ChangeLog Mon Aug 22 15:26:23 2005 *************** *** 1,2 **** --- 1,16 ---- + 2005-08-05 Brian Gough + + * gsl/Makefile.am: need to remove makefile with later versions of + automake + + 2005-04-05 Brian Gough + + * configure.ac: added ieeefp.h test for solaris + + 2005-01-13 Brian Gough + + * configure.ac: added case for 86_64 in IEEE arithmetic interface + detection + 2004-10-26 Brian Gough diff -rc2P gsl-1.6/INSTALL gsl-1.7/INSTALL *** gsl-1.6/INSTALL Mon Dec 27 19:18:37 2004 --- gsl-1.7/INSTALL Mon Aug 22 15:26:23 2005 *************** *** 27,40 **** next section of this file (below). ! An extensive test suite is available. It can be invoked with "make ! check" in each directory. All tests can be run together with "make ! check" at the top level. The test output should be directed to a file ! rather than a terminal, with the command, make check > log 2>&1 ! since it is several megabytes in size. ! If you run "make check" and get some failures, please see the notes on platform specific problems below. If you find failures that are not mentioned, please report them to bug-gsl@gnu.org. --- 27,42 ---- next section of this file (below). ! An extensive test suite is available. After compiling the library ! with "make", it can be invoked with "make check" at the top level. ! The test output should be directed to a file rather than a terminal, ! with the command, make check > log 2>&1 ! to allow any errors to be examined in detail. By default, only test ! failures are shown. To see the complete output, set the environment ! variable GSL_TEST_VERBOSE=1. ! If you run the tests and get some failures, please see the notes on platform specific problems below. If you find failures that are not mentioned, please report them to bug-gsl@gnu.org. *************** *** 44,48 **** make install ! The default install directory prefix is /usr/local. Consult the "Further Information" section below for instructions on installing the library in another location or changing other default compilation --- 46,50 ---- make install ! The default installation directory prefix is /usr/local. Consult the "Further Information" section below for instructions on installing the library in another location or changing other default compilation *************** *** 57,60 **** --- 59,73 ---- specific platforms. + * General hints for all platforms + * AIX + * Compaq/DEC Alpha + * HP-UX + * IRIX + * MacOS X / PowerPC + * Microsoft Windows + * OpenBSD + * OS/2 + * Solaris + Hints for any platform ====================== *************** *** 121,124 **** --- 134,143 ---- LDFLAGS="-Wl,-bbigtoc" ./configure + On older versions of AIX (e.g. 4.2) the size of the command-line is + limited to 24kb, which causes linking to fail (due to the large number + of files to be linked). Unfortunately this limit cannot be increased. + To link the library you may need to use a manual approach of + incrementally combining the object files in smaller groups. + Hints for Compaq/DEC Alpha ========================== *************** *** 180,185 **** CFLAGS="-mabi-64" LDFLAGS="-mabi=64 -mips4 -L/usr/local/lib/mabi=64" ! Hints for MacOS X ! ================= Note that GSL contains files with filenames of 32 characters or more. --- 199,204 ---- CFLAGS="-mabi-64" LDFLAGS="-mabi=64 -mips4 -L/usr/local/lib/mabi=64" ! Hints for MacOS X and PowerPC ! ============================= Note that GSL contains files with filenames of 32 characters or more. *************** *** 205,208 **** --- 224,238 ---- in addition to the normal compilation options. + The GCC 3.3 compiler shipped by Apple contains a bug which causes the + wavelet tests to fail on "data untouched" tests at optimisation level + -O2. You can compile with CFLAGS="-O1 ..." to work around this. + + F J Frankin reported that some early + versions of GCC-2.95 have a problem with long argument lists on PPC + architecture, and this prevents GSL from compiling correctly (e.g. the + test program in the blas directory gives a segmentation fault when + run). This problem is fixed in more recent versions of GCC. + + Hints for Microsoft Windows =========================== *************** *** 228,245 **** config.h file to comment out the line which defines HAVE_ISINF. - Hints for PowerPC - ================= - - F J Frankin reported that some early - versions of GCC-2.95 have a problem with long argument lists on PPC - architecture, and this prevents GSL from compiling correctly (e.g. the - test program in the blas directory gives a segmentation fault when - run). This problem is fixed in more recent versions of GCC. - Hints for Solaris ================= If you are using the Sun compilers then the library should be compiled ! with the Sun C compiler 'cc', not the Sun C++ compiler 'CC'. There may be some warnings about "end of loop code not reached". These --- 258,287 ---- config.h file to comment out the line which defines HAVE_ISINF. Hints for Solaris ================= If you are using the Sun compilers then the library should be compiled ! with the Sun C compiler 'cc', not 'CC' which is the C++ compiler. ! ! The Sun compiler tools are stored in non-standard directories -- make ! sure that all the compiler and linker tools (cc, ar, ranlib, ld) are ! on the PATH. A typical PATH should include the directories ! /opt/SUNWspro/bin:/usr/ccs/bin:/usr/ucb in that order. ! ! For example, ! ! $ PATH=/opt/SUNWspro/bin:/usr/ccs/bin:/usr/ucb:$PATH ! $ ./configure CC=cc CFLAGS=-O ! ! If you see configure output ! ! checking for ar... : ! ! it means that 'ar' has not been found, and the library will fail to ! build. ! ! If you use the Sun compiler you should use the Sun linker and ! assembler. If you use GCC, you can use the GNU linker and assembler ! or the Sun linker and assembler. There may be some warnings about "end of loop code not reached". These diff -rc2P gsl-1.6/Makefile.in gsl-1.7/Makefile.in *** gsl-1.6/Makefile.in Fri Dec 31 15:15:19 2004 --- gsl-1.7/Makefile.in Tue Sep 13 10:05:27 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 17,20 **** --- 17,24 ---- # AUTOMAKE_OPTIONS = readme-alpha + + + + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 24,28 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = . - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 28,31 ---- *************** *** 38,42 **** --- 41,147 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + bin_PROGRAMS = gsl-randist$(EXEEXT) gsl-histogram$(EXEEXT) + DIST_COMMON = README $(am__configure_deps) $(noinst_HEADERS) \ + $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in $(srcdir)/config.h.in \ + $(srcdir)/gsl-config.in $(srcdir)/gsl.pc.in \ + $(srcdir)/gsl.spec.in $(srcdir)/gsl_version.h.in \ + $(top_srcdir)/configure AUTHORS COPYING ChangeLog INSTALL NEWS \ + THANKS TODO acconfig.h config.guess config.sub depcomp \ + install-sh ltmain.sh mdate-sh missing mkinstalldirs + subdir = . + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ + configure.lineno configure.status.lineno + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = config.h + CONFIG_CLEAN_FILES = gsl-config gsl.pc gsl_version.h gsl.spec + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" \ + "$(DESTDIR)$(bindir)" "$(DESTDIR)$(m4datadir)" \ + "$(DESTDIR)$(pkgconfigdir)" "$(DESTDIR)$(pkgincludedir)" + libLTLIBRARIES_INSTALL = $(INSTALL) + LTLIBRARIES = $(lib_LTLIBRARIES) + am__DEPENDENCIES_1 = block/libgslblock.la blas/libgslblas.la \ + complex/libgslcomplex.la cheb/libgslcheb.la dht/libgsldht.la \ + diff/libgsldiff.la deriv/libgslderiv.la eigen/libgsleigen.la \ + err/libgslerr.la fft/libgslfft.la fit/libgslfit.la \ + histogram/libgslhistogram.la ieee-utils/libgslieeeutils.la \ + integration/libgslintegration.la \ + interpolation/libgslinterpolation.la linalg/libgsllinalg.la \ + matrix/libgslmatrix.la min/libgslmin.la monte/libgslmonte.la \ + multifit/libgslmultifit.la multimin/libgslmultimin.la \ + multiroots/libgslmultiroots.la ntuple/libgslntuple.la \ + ode-initval/libgslodeiv.la permutation/libgslpermutation.la \ + combination/libgslcombination.la poly/libgslpoly.la \ + qrng/libgslqrng.la randist/libgslrandist.la rng/libgslrng.la \ + roots/libgslroots.la siman/libgslsiman.la sort/libgslsort.la \ + specfunc/libgslspecfunc.la statistics/libgslstatistics.la \ + sum/libgslsum.la sys/libgslsys.la test/libgsltest.la \ + utils/libutils.la vector/libgslvector.la cdf/libgslcdf.la \ + wavelet/libgslwavelet.la + libgsl_la_DEPENDENCIES = $(am__DEPENDENCIES_1) + am_libgsl_la_OBJECTS = version.lo + libgsl_la_OBJECTS = $(am_libgsl_la_OBJECTS) + binPROGRAMS_INSTALL = $(INSTALL_PROGRAM) + PROGRAMS = $(bin_PROGRAMS) + am_gsl_histogram_OBJECTS = gsl-histogram.$(OBJEXT) + gsl_histogram_OBJECTS = $(am_gsl_histogram_OBJECTS) + gsl_histogram_DEPENDENCIES = libgsl.la cblas/libgslcblas.la + am_gsl_randist_OBJECTS = gsl-randist.$(OBJEXT) + gsl_randist_OBJECTS = $(am_gsl_randist_OBJECTS) + gsl_randist_DEPENDENCIES = libgsl.la cblas/libgslcblas.la + binSCRIPT_INSTALL = $(INSTALL_SCRIPT) + SCRIPTS = $(bin_SCRIPTS) + DEFAULT_INCLUDES = -I. -I$(srcdir) -I. + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgsl_la_SOURCES) $(gsl_histogram_SOURCES) \ + $(gsl_randist_SOURCES) + DIST_SOURCES = $(libgsl_la_SOURCES) $(gsl_histogram_SOURCES) \ + $(gsl_randist_SOURCES) + RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ + html-recursive info-recursive install-data-recursive \ + install-exec-recursive install-info-recursive \ + install-recursive installcheck-recursive installdirs-recursive \ + pdf-recursive ps-recursive uninstall-info-recursive \ + uninstall-recursive + m4dataDATA_INSTALL = $(INSTALL_DATA) + pkgconfigDATA_INSTALL = $(INSTALL_DATA) + DATA = $(m4data_DATA) $(pkgconfig_DATA) + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DIST_SUBDIRS = $(SUBDIRS) + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) + distdir = $(PACKAGE)-$(VERSION) + top_distdir = $(distdir) + am__remove_distdir = \ + { test ! -d $(distdir) \ + || { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \ + && rm -fr $(distdir); }; } + DIST_ARCHIVES = $(distdir).tar.gz + GZIP_ENV = --best + distuninstallcheck_listfiles = find . -type f -print + distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 116,119 **** --- 221,226 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 136,139 **** --- 243,247 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 143,160 **** sysconfdir = @sysconfdir@ target_alias = @target_alias@ - SUBDIRS = gsl utils sys test err const complex cheb block vector matrix permutation combination sort ieee-utils cblas blas linalg eigen specfunc dht qrng rng randist fft poly fit multifit statistics siman sum integration interpolation histogram ode-initval roots multiroots min multimin monte ntuple diff deriv cdf wavelet doc - SUBLIBS = block/libgslblock.la blas/libgslblas.la complex/libgslcomplex.la cheb/libgslcheb.la dht/libgsldht.la diff/libgsldiff.la deriv/libgslderiv.la eigen/libgsleigen.la err/libgslerr.la fft/libgslfft.la fit/libgslfit.la histogram/libgslhistogram.la ieee-utils/libgslieeeutils.la integration/libgslintegration.la interpolation/libgslinterpolation.la linalg/libgsllinalg.la matrix/libgslmatrix.la min/libgslmin.la monte/libgslmonte.la multifit/libgslmultifit.la multimin/libgslmultimin.la multiroots/libgslmultiroots.la ntuple/libgslntuple.la ode-initval/libgslodeiv.la permutation/libgslpermutation.la combination/libgslcombination.la poly/libgslpoly.la qrng/libgslqrng.la randist/libgslrandist.la rng/libgslrng.la roots/libgslroots.la siman/libgslsiman.la sort/libgslsort.la specfunc/libgslspecfunc.la statistics/libgslstatistics.la sum/libgslsum.la sys/libgslsys.la test/libgsltest.la utils/libutils.la vector/libgslvector.la cdf/libgslcdf.la wavelet/libgslwavelet.la - pkginclude_HEADERS = gsl_math.h gsl_pow_int.h gsl_nan.h gsl_machine.h gsl_mode.h gsl_precision.h gsl_types.h gsl_version.h - bin_SCRIPTS = gsl-config - pkgconfigdir = $(libdir)/pkgconfig pkgconfig_DATA = gsl.pc - EXTRA_DIST = autogen.sh gsl-config.in gsl.pc.in configure.ac THANKS BUGS SUPPORT gsl.spec.in gsl.m4 test_gsl_histogram.sh - lib_LTLIBRARIES = libgsl.la libgsl_la_SOURCES = version.c --- 251,261 ---- *************** *** 162,251 **** libgsl_la_LDFLAGS = -version-info $(GSL_LT_VERSION) noinst_HEADERS = templates_on.h templates_off.h - m4datadir = $(datadir)/aclocal m4data_DATA = gsl.m4 - - bin_PROGRAMS = gsl-randist gsl-histogram - gsl_randist_SOURCES = gsl-randist.c gsl_randist_LDADD = libgsl.la cblas/libgslcblas.la - gsl_histogram_SOURCES = gsl-histogram.c gsl_histogram_LDADD = libgsl.la cblas/libgslcblas.la - check_SCRIPTS = test_gsl_histogram.sh TESTS = test_gsl_histogram.sh - subdir = . - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = config.h - CONFIG_CLEAN_FILES = gsl-config gsl.pc gsl_version.h gsl.spec - LTLIBRARIES = $(lib_LTLIBRARIES) - - libgsl_la_DEPENDENCIES = block/libgslblock.la blas/libgslblas.la \ - complex/libgslcomplex.la cheb/libgslcheb.la dht/libgsldht.la \ - diff/libgsldiff.la deriv/libgslderiv.la eigen/libgsleigen.la \ - err/libgslerr.la fft/libgslfft.la fit/libgslfit.la \ - histogram/libgslhistogram.la ieee-utils/libgslieeeutils.la \ - integration/libgslintegration.la \ - interpolation/libgslinterpolation.la linalg/libgsllinalg.la \ - matrix/libgslmatrix.la min/libgslmin.la monte/libgslmonte.la \ - multifit/libgslmultifit.la multimin/libgslmultimin.la \ - multiroots/libgslmultiroots.la ntuple/libgslntuple.la \ - ode-initval/libgslodeiv.la permutation/libgslpermutation.la \ - combination/libgslcombination.la poly/libgslpoly.la \ - qrng/libgslqrng.la randist/libgslrandist.la rng/libgslrng.la \ - roots/libgslroots.la siman/libgslsiman.la sort/libgslsort.la \ - specfunc/libgslspecfunc.la statistics/libgslstatistics.la \ - sum/libgslsum.la sys/libgslsys.la test/libgsltest.la \ - utils/libutils.la vector/libgslvector.la cdf/libgslcdf.la \ - wavelet/libgslwavelet.la - am_libgsl_la_OBJECTS = version.lo - libgsl_la_OBJECTS = $(am_libgsl_la_OBJECTS) - bin_PROGRAMS = gsl-randist$(EXEEXT) gsl-histogram$(EXEEXT) - PROGRAMS = $(bin_PROGRAMS) - - am_gsl_histogram_OBJECTS = gsl-histogram.$(OBJEXT) - gsl_histogram_OBJECTS = $(am_gsl_histogram_OBJECTS) - gsl_histogram_DEPENDENCIES = libgsl.la cblas/libgslcblas.la - gsl_histogram_LDFLAGS = - am_gsl_randist_OBJECTS = gsl-randist.$(OBJEXT) - gsl_randist_OBJECTS = $(am_gsl_randist_OBJECTS) - gsl_randist_DEPENDENCIES = libgsl.la cblas/libgslcblas.la - gsl_randist_LDFLAGS = - SCRIPTS = $(bin_SCRIPTS) - - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I. - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgsl_la_SOURCES) $(gsl_histogram_SOURCES) \ - $(gsl_randist_SOURCES) - DATA = $(m4data_DATA) $(pkgconfig_DATA) - - HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) - - - RECURSIVE_TARGETS = info-recursive dvi-recursive pdf-recursive \ - ps-recursive install-info-recursive uninstall-info-recursive \ - all-recursive install-data-recursive install-exec-recursive \ - installdirs-recursive install-recursive uninstall-recursive \ - check-recursive installcheck-recursive - DIST_COMMON = README $(noinst_HEADERS) $(pkginclude_HEADERS) AUTHORS \ - COPYING ChangeLog INSTALL Makefile.am Makefile.in NEWS THANKS \ - TODO acconfig.h aclocal.m4 config.guess config.h.in config.sub \ - configure configure.ac depcomp gsl-config.in gsl.pc.in \ - gsl.spec.in gsl_version.h.in install-sh ltmain.sh mdate-sh \ - missing mkinstalldirs - DIST_SUBDIRS = $(SUBDIRS) - SOURCES = $(libgsl_la_SOURCES) $(gsl_histogram_SOURCES) $(gsl_randist_SOURCES) - all: config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive --- 263,274 ---- *************** *** 253,271 **** .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! ! am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ ! configure.lineno ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe) ! $(top_builddir)/config.status: $(srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck - $(srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(srcdir)/configure.ac $(ACLOCAL_M4) $(CONFIGURE_DEPENDENCIES) - cd $(srcdir) && $(AUTOCONF) ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ configure.ac cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) --- 276,311 ---- .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! am--refresh: ! @: ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! echo ' cd $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps'; \ ! cd $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! echo ' $(SHELL) ./config.status'; \ ! $(SHELL) ./config.status;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ ! esac; ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(srcdir) && $(AUTOCONF) ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) *************** *** 279,306 **** @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status config.h ! ! $(srcdir)/config.h.in: @MAINTAINER_MODE_TRUE@ $(top_srcdir)/configure.ac $(ACLOCAL_M4) $(top_srcdir)/acconfig.h cd $(top_srcdir) && $(AUTOHEADER) ! touch $(srcdir)/config.h.in distclean-hdr: -rm -f config.h stamp-h1 ! gsl-config: $(top_builddir)/config.status gsl-config.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl.pc: $(top_builddir)/config.status gsl.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl_version.h: $(top_builddir)/config.status gsl_version.h.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl.spec: $(top_builddir)/config.status gsl.spec.in cd $(top_builddir) && $(SHELL) ./config.status $@ - libLTLIBRARIES_INSTALL = $(INSTALL) install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(libdir) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) $$p $(DESTDIR)$(libdir)/$$f"; \ ! $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) $$p $(DESTDIR)$(libdir)/$$f; \ else :; fi; \ done --- 319,345 ---- @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status config.h ! $(srcdir)/config.h.in: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) $(top_srcdir)/acconfig.h cd $(top_srcdir) && $(AUTOHEADER) ! rm -f stamp-h1 ! touch $@ distclean-hdr: -rm -f config.h stamp-h1 ! gsl-config: $(top_builddir)/config.status $(srcdir)/gsl-config.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl.pc: $(top_builddir)/config.status $(srcdir)/gsl.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl_version.h: $(top_builddir)/config.status $(srcdir)/gsl_version.h.in cd $(top_builddir) && $(SHELL) ./config.status $@ ! gsl.spec: $(top_builddir)/config.status $(srcdir)/gsl.spec.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) ! test -z "$(libdir)" || $(mkdir_p) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ ! f=$(am__strip_dir) \ ! echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) '$$p' '$(DESTDIR)$(libdir)/$$f'"; \ ! $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) "$$p" "$(DESTDIR)$(libdir)/$$f"; \ else :; fi; \ done *************** *** 308,315 **** uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) ! @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ ! p="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(LIBTOOL) --mode=uninstall rm -f $(DESTDIR)$(libdir)/$$p"; \ ! $(LIBTOOL) --mode=uninstall rm -f $(DESTDIR)$(libdir)/$$p; \ done --- 347,354 ---- uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) ! @set -x; list='$(lib_LTLIBRARIES)'; for p in $$list; do \ ! p=$(am__strip_dir) \ ! echo " $(LIBTOOL) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$p'"; \ ! $(LIBTOOL) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$p"; \ done *************** *** 318,322 **** @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 357,361 ---- @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 324,331 **** libgsl.la: $(libgsl_la_OBJECTS) $(libgsl_la_DEPENDENCIES) $(LINK) -rpath $(libdir) $(libgsl_la_LDFLAGS) $(libgsl_la_OBJECTS) $(libgsl_la_LIBADD) $(LIBS) - binPROGRAMS_INSTALL = $(INSTALL_PROGRAM) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(bindir) @list='$(bin_PROGRAMS)'; for p in $$list; do \ p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ --- 363,369 ---- libgsl.la: $(libgsl_la_OBJECTS) $(libgsl_la_DEPENDENCIES) $(LINK) -rpath $(libdir) $(libgsl_la_LDFLAGS) $(libgsl_la_OBJECTS) $(libgsl_la_LIBADD) $(LIBS) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) ! test -z "$(bindir)" || $(mkdir_p) "$(DESTDIR)$(bindir)" @list='$(bin_PROGRAMS)'; for p in $$list; do \ p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ *************** *** 334,339 **** ; then \ f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \ ! echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) $$p $(DESTDIR)$(bindir)/$$f"; \ ! $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) $$p $(DESTDIR)$(bindir)/$$f || exit 1; \ else :; fi; \ done --- 372,377 ---- ; then \ f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \ ! echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) '$$p' '$(DESTDIR)$(bindir)/$$f'"; \ ! $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) "$$p" "$(DESTDIR)$(bindir)/$$f" || exit 1; \ else :; fi; \ done *************** *** 343,348 **** @list='$(bin_PROGRAMS)'; for p in $$list; do \ f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \ ! echo " rm -f $(DESTDIR)$(bindir)/$$f"; \ ! rm -f $(DESTDIR)$(bindir)/$$f; \ done --- 381,386 ---- @list='$(bin_PROGRAMS)'; for p in $$list; do \ f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \ ! echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \ ! rm -f "$(DESTDIR)$(bindir)/$$f"; \ done *************** *** 359,372 **** @rm -f gsl-randist$(EXEEXT) $(LINK) $(gsl_randist_LDFLAGS) $(gsl_randist_OBJECTS) $(gsl_randist_LDADD) $(LIBS) - binSCRIPT_INSTALL = $(INSTALL_SCRIPT) install-binSCRIPTS: $(bin_SCRIPTS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(bindir) @list='$(bin_SCRIPTS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ if test -f $$d$$p; then \ f=`echo "$$p" | sed 's|^.*/||;$(transform)'`; \ ! echo " $(binSCRIPT_INSTALL) $$d$$p $(DESTDIR)$(bindir)/$$f"; \ ! $(binSCRIPT_INSTALL) $$d$$p $(DESTDIR)$(bindir)/$$f; \ else :; fi; \ done --- 397,409 ---- @rm -f gsl-randist$(EXEEXT) $(LINK) $(gsl_randist_LDFLAGS) $(gsl_randist_OBJECTS) $(gsl_randist_LDADD) $(LIBS) install-binSCRIPTS: $(bin_SCRIPTS) @$(NORMAL_INSTALL) ! test -z "$(bindir)" || $(mkdir_p) "$(DESTDIR)$(bindir)" @list='$(bin_SCRIPTS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ if test -f $$d$$p; then \ f=`echo "$$p" | sed 's|^.*/||;$(transform)'`; \ ! echo " $(binSCRIPT_INSTALL) '$$d$$p' '$(DESTDIR)$(bindir)/$$f'"; \ ! $(binSCRIPT_INSTALL) "$$d$$p" "$(DESTDIR)$(bindir)/$$f"; \ else :; fi; \ done *************** *** 376,385 **** @list='$(bin_SCRIPTS)'; for p in $$list; do \ f=`echo "$$p" | sed 's|^.*/||;$(transform)'`; \ ! echo " rm -f $(DESTDIR)$(bindir)/$$f"; \ ! rm -f $(DESTDIR)$(bindir)/$$f; \ done mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 413,422 ---- @list='$(bin_SCRIPTS)'; for p in $$list; do \ f=`echo "$$p" | sed 's|^.*/||;$(transform)'`; \ ! echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \ ! rm -f "$(DESTDIR)$(bindir)/$$f"; \ done mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 387,397 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 424,434 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 404,416 **** -rm -f libtool uninstall-info-am: - m4dataDATA_INSTALL = $(INSTALL_DATA) install-m4dataDATA: $(m4data_DATA) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(m4datadir) @list='$(m4data_DATA)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(m4dataDATA_INSTALL) $$d$$p $(DESTDIR)$(m4datadir)/$$f"; \ ! $(m4dataDATA_INSTALL) $$d$$p $(DESTDIR)$(m4datadir)/$$f; \ done --- 441,452 ---- -rm -f libtool uninstall-info-am: install-m4dataDATA: $(m4data_DATA) @$(NORMAL_INSTALL) ! test -z "$(m4datadir)" || $(mkdir_p) "$(DESTDIR)$(m4datadir)" @list='$(m4data_DATA)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(m4dataDATA_INSTALL) '$$d$$p' '$(DESTDIR)$(m4datadir)/$$f'"; \ ! $(m4dataDATA_INSTALL) "$$d$$p" "$(DESTDIR)$(m4datadir)/$$f"; \ done *************** *** 418,434 **** @$(NORMAL_UNINSTALL) @list='$(m4data_DATA)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(m4datadir)/$$f"; \ ! rm -f $(DESTDIR)$(m4datadir)/$$f; \ done - pkgconfigDATA_INSTALL = $(INSTALL_DATA) install-pkgconfigDATA: $(pkgconfig_DATA) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgconfigdir) @list='$(pkgconfig_DATA)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgconfigDATA_INSTALL) $$d$$p $(DESTDIR)$(pkgconfigdir)/$$f"; \ ! $(pkgconfigDATA_INSTALL) $$d$$p $(DESTDIR)$(pkgconfigdir)/$$f; \ done --- 454,469 ---- @$(NORMAL_UNINSTALL) @list='$(m4data_DATA)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(m4datadir)/$$f'"; \ ! rm -f "$(DESTDIR)$(m4datadir)/$$f"; \ done install-pkgconfigDATA: $(pkgconfig_DATA) @$(NORMAL_INSTALL) ! test -z "$(pkgconfigdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfigdir)" @list='$(pkgconfig_DATA)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgconfigDATA_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgconfigdir)/$$f'"; \ ! $(pkgconfigDATA_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgconfigdir)/$$f"; \ done *************** *** 436,452 **** @$(NORMAL_UNINSTALL) @list='$(pkgconfig_DATA)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgconfigdir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgconfigdir)/$$f; \ done - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 471,486 ---- @$(NORMAL_UNINSTALL) @list='$(pkgconfig_DATA)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgconfigdir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgconfigdir)/$$f"; \ done install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 454,460 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 488,494 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 466,470 **** # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): ! @set fnord $$MAKEFLAGS; amf=$$2; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ --- 500,510 ---- # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): ! @failcom='exit 1'; \ ! for f in x $$MAKEFLAGS; do \ ! case $$f in \ ! *=* | --[!k]*);; \ ! *k*) failcom='fail=yes';; \ ! esac; \ ! done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ *************** *** 478,482 **** fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ ! || case "$$amf" in *=*) exit 1;; *k*) fail=yes;; *) exit 1;; esac; \ done; \ if test "$$dot_seen" = "no"; then \ --- 518,522 ---- fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ ! || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ *************** *** 486,490 **** mostlyclean-recursive clean-recursive distclean-recursive \ maintainer-clean-recursive: ! @set fnord $$MAKEFLAGS; amf=$$2; \ dot_seen=no; \ case "$@" in \ --- 526,536 ---- mostlyclean-recursive clean-recursive distclean-recursive \ maintainer-clean-recursive: ! @failcom='exit 1'; \ ! for f in x $$MAKEFLAGS; do \ ! case $$f in \ ! *=* | --[!k]*);; \ ! *k*) failcom='fail=yes';; \ ! esac; \ ! done; \ dot_seen=no; \ case "$@" in \ *************** *** 507,511 **** fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ ! || case "$$amf" in *=*) exit 1;; *k*) fail=yes;; *) exit 1;; esac; \ done && test -z "$$fail" tags-recursive: --- 553,557 ---- fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ ! || eval $$failcom; \ done && test -z "$$fail" tags-recursive: *************** *** 518,529 **** done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 564,567 ---- *************** *** 534,537 **** --- 572,576 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ *************** *** 539,550 **** tags=; \ here=`pwd`; \ ! if (etags --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ else \ include_option=--include; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ ! test -f $$subdir/TAGS && \ tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \ fi; \ --- 578,591 ---- tags=; \ here=`pwd`; \ ! if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ + empty_fix=.; \ else \ include_option=--include; \ + empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ ! test ! -f $$subdir/TAGS || \ tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \ fi; \ *************** *** 556,563 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ --- 597,605 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ *************** *** 596,605 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 638,647 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 608,617 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 650,659 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 638,642 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 680,684 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 644,648 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 686,690 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 650,676 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = . - distdir = $(PACKAGE)-$(VERSION) - - am__remove_distdir = \ - { test ! -d $(distdir) \ - || { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \ - && rm -fr $(distdir); }; } - - GZIP_ENV = --best - distuninstallcheck_listfiles = find . -type f -print - distcleancheck_listfiles = find . -type f -print distdir: $(DISTFILES) $(am__remove_distdir) mkdir $(distdir) ! $(mkinstalldirs) $(distdir)/. @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ --- 692,705 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) $(am__remove_distdir) mkdir $(distdir) ! $(mkdir_p) $(distdir)/. @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ *************** *** 684,688 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 713,717 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 699,711 **** fi; \ done ! list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ ! test -d $(distdir)/$$subdir \ ! || mkdir $(distdir)/$$subdir \ || exit 1; \ (cd $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ ! top_distdir="$(top_distdir)" \ ! distdir=../$(distdir)/$$subdir \ distdir) \ || exit 1; \ --- 728,742 ---- fi; \ done ! list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ ! test -d "$(distdir)/$$subdir" \ ! || $(mkdir_p) "$(distdir)/$$subdir" \ || exit 1; \ + distdir=`$(am__cd) $(distdir) && pwd`; \ + top_distdir=`$(am__cd) $(top_distdir) && pwd`; \ (cd $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ ! top_distdir="$$top_distdir" \ ! distdir="$$distdir/$$subdir" \ distdir) \ || exit 1; \ *************** *** 718,726 **** || chmod -R a+r $(distdir) dist-gzip: distdir ! $(AMTAR) chof - $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist dist-all: distdir ! $(AMTAR) chof - $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) --- 749,774 ---- || chmod -R a+r $(distdir) dist-gzip: distdir ! tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz ! $(am__remove_distdir) ! ! dist-bzip2: distdir ! tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 ! $(am__remove_distdir) ! ! dist-tarZ: distdir ! tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z ! $(am__remove_distdir) ! ! dist-shar: distdir ! shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz ! $(am__remove_distdir) ! ! dist-zip: distdir ! -rm -f $(distdir).zip ! zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir ! tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) *************** *** 729,734 **** # tarfile. distcheck: dist ! $(am__remove_distdir) ! GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(AMTAR) xf - chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build --- 777,792 ---- # tarfile. distcheck: dist ! case '$(DIST_ARCHIVES)' in \ ! *.tar.gz*) \ ! GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(am__untar) ;;\ ! *.tar.bz2*) \ ! bunzip2 -c $(distdir).tar.bz2 | $(am__untar) ;;\ ! *.tar.Z*) \ ! uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ ! *.shar.gz*) \ ! GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\ ! *.zip*) \ ! unzip $(distdir).zip ;;\ ! esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build *************** *** 750,754 **** && chmod -R a-w "$$dc_install_base" \ && ({ \ ! (cd ../.. && $(mkinstalldirs) "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ --- 808,812 ---- && chmod -R a-w "$$dc_install_base" \ && ({ \ ! (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ *************** *** 757,766 **** } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ ! && $(MAKE) $(AM_MAKEFLAGS) dist-gzip \ ! && rm -f $(distdir).tar.gz \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck $(am__remove_distdir) ! @echo "$(distdir).tar.gz is ready for distribution" | \ ! sed 'h;s/./=/g;p;x;p;x' distuninstallcheck: @cd $(distuninstallcheck_dir) \ --- 815,825 ---- } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ ! && $(MAKE) $(AM_MAKEFLAGS) dist \ ! && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck $(am__remove_distdir) ! @(echo "$(distdir) archives ready for distribution: "; \ ! list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ ! sed -e '1{h;s/./=/g;p;x;}' -e '$${p;x;}' distuninstallcheck: @cd $(distuninstallcheck_dir) \ *************** *** 791,796 **** installdirs: installdirs-recursive installdirs-am: ! $(mkinstalldirs) $(DESTDIR)$(libdir) $(DESTDIR)$(bindir) $(DESTDIR)$(bindir) $(DESTDIR)$(m4datadir) $(DESTDIR)$(pkgconfigdir) $(DESTDIR)$(pkgincludedir) ! install: install-recursive install-exec: install-exec-recursive --- 850,856 ---- installdirs: installdirs-recursive installdirs-am: ! for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(m4datadir)" "$(DESTDIR)$(pkgconfigdir)" "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-recursive install-exec: install-exec-recursive *************** *** 804,808 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 864,868 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 812,816 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 872,876 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 824,829 **** distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) ! distclean-am: clean-am distclean-compile distclean-generic distclean-hdr \ ! distclean-libtool distclean-tags dvi: dvi-recursive --- 884,890 ---- distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) ! -rm -f Makefile ! distclean-am: clean-am distclean-compile distclean-generic \ ! distclean-hdr distclean-libtool distclean-tags dvi: dvi-recursive *************** *** 831,834 **** --- 892,897 ---- dvi-am: + html: html-recursive + info: info-recursive *************** *** 849,853 **** maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) ! -rm -rf autom4te.cache maintainer-clean-am: distclean-am maintainer-clean-generic --- 912,917 ---- maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) ! -rm -rf $(top_srcdir)/autom4te.cache ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 866,898 **** uninstall-am: uninstall-binPROGRAMS uninstall-binSCRIPTS \ ! uninstall-info-am uninstall-libLTLIBRARIES uninstall-m4dataDATA \ ! uninstall-pkgconfigDATA uninstall-pkgincludeHEADERS uninstall-info: uninstall-info-recursive ! .PHONY: $(RECURSIVE_TARGETS) CTAGS GTAGS all all-am check check-TESTS \ ! check-am clean clean-binPROGRAMS clean-generic \ clean-libLTLIBRARIES clean-libtool clean-recursive ctags \ ! ctags-recursive dist dist-all dist-gzip distcheck distclean \ ! distclean-compile distclean-generic distclean-hdr \ ! distclean-libtool distclean-recursive distclean-tags \ ! distcleancheck distdir distuninstallcheck dvi dvi-am \ ! dvi-recursive info info-am info-recursive install install-am \ ! install-binPROGRAMS install-binSCRIPTS install-data \ ! install-data-am install-data-recursive install-exec \ ! install-exec-am install-exec-recursive install-info \ ! install-info-am install-info-recursive install-libLTLIBRARIES \ install-m4dataDATA install-man install-pkgconfigDATA \ ! install-pkgincludeHEADERS install-recursive install-strip \ ! installcheck installcheck-am installdirs installdirs-am \ ! installdirs-recursive maintainer-clean maintainer-clean-generic \ ! maintainer-clean-recursive mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool mostlyclean-recursive \ ! pdf pdf-am pdf-recursive ps ps-am ps-recursive tags \ ! tags-recursive uninstall uninstall-am uninstall-binPROGRAMS \ ! uninstall-binSCRIPTS uninstall-info-am uninstall-info-recursive \ uninstall-libLTLIBRARIES uninstall-m4dataDATA \ ! uninstall-pkgconfigDATA uninstall-pkgincludeHEADERS \ ! uninstall-recursive --- 930,960 ---- uninstall-am: uninstall-binPROGRAMS uninstall-binSCRIPTS \ ! uninstall-info-am uninstall-libLTLIBRARIES \ ! uninstall-m4dataDATA uninstall-pkgconfigDATA \ ! uninstall-pkgincludeHEADERS uninstall-info: uninstall-info-recursive ! .PHONY: $(RECURSIVE_TARGETS) CTAGS GTAGS all all-am am--refresh check \ ! check-TESTS check-am clean clean-binPROGRAMS clean-generic \ clean-libLTLIBRARIES clean-libtool clean-recursive ctags \ ! ctags-recursive dist dist-all dist-bzip2 dist-gzip dist-shar \ ! dist-tarZ dist-zip distcheck distclean distclean-compile \ ! distclean-generic distclean-hdr distclean-libtool \ ! distclean-recursive distclean-tags distcleancheck distdir \ ! distuninstallcheck dvi dvi-am html html-am info info-am \ ! install install-am install-binPROGRAMS install-binSCRIPTS \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-libLTLIBRARIES \ install-m4dataDATA install-man install-pkgconfigDATA \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs installdirs-am maintainer-clean \ ! maintainer-clean-generic maintainer-clean-recursive \ ! mostlyclean mostlyclean-compile mostlyclean-generic \ ! mostlyclean-libtool mostlyclean-recursive pdf pdf-am ps ps-am \ ! tags tags-recursive uninstall uninstall-am \ ! uninstall-binPROGRAMS uninstall-binSCRIPTS uninstall-info-am \ uninstall-libLTLIBRARIES uninstall-m4dataDATA \ ! uninstall-pkgconfigDATA uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/NEWS gsl-1.7/NEWS *** gsl-1.6/NEWS Mon Dec 27 17:33:55 2004 --- gsl-1.7/NEWS Wed Sep 14 11:11:10 2005 *************** *** 1,3 **** ! * What is new in gsl-1.6: ** Added a new wavelet directory, with 1-dimensional and 2-dimensional --- 1,68 ---- ! * What is new in gsl-1.7: ! ! ** Switched gsl_randist_binomial to use the faster binomial random ! variate TPE algorithm by default. The previous binomial variate ! algorithm is available as gsl_randist_binomial_knuth. This will ! result in a different sequence of binomial variates in programs using ! this function. ! ! ** Improved the algorithm for gsl_sf_elljac_e to avoid cancellation ! errors near quarter periods. ! ! ** Fixed the branch selection in gsl_sf_gamma_inc_Q_e to avoid ! inaccurate results for large a,x where x~=~a. ! ! ** The multilinear fitting functions now have forms which accept a ! user-specified tolerance for the SVD cutoff and return the ! corresponding effective rank of the design matrix. ! ! ** The quadratic solvers in poly/ now handle linear equations ! gracefully (i.e. quadratrics with a leading coefficient of zero). ! ! ** The output of "make check" now only shows test failures by default, ! to reduce the amount of output. Set the environment variable ! GSL_TEST_VERBOSE=1 to display all the output. To assist debugging, ! the test number of each failure is shown in square brackets at the ! line-end [NNNN]. ! ! ** Fixed bugs in gsl_linalg_SV_decomp_jacobi which caused ! incorrect results for some input matrices. ! ! ** Bessel, coulomb, dilogarithm and legendre_H3d functions now use ! hypot internally to avoid overflow when computing terms like ! sqrt(1+x*x). ! ! ** The 'Usage' chapter of the reference manual now explains how to ! handle deprecated functions using the GSL_DISABLE_DEPRECATED macro. ! ! ** The conflicting enum definitions for 'forward' and 'backward' in ! gsl_ftt.h and gsl_wavelet.h are deprecated. User code should switch ! to the new definitions gsl_fft_forward, gsl_fft_backward, ! gsl_wavelet_forward and gsl_wavelet_backward. Selectively define ! GSL_DISABLE_DEPRECATED before including the headers to use the new ! definitions on either or both modules. ! ! ** Fixed an error in the the brent minimisation algorithm. Iterations ! should now follow Brent's original description correctly. ! ! ** The bound coulomb function gsl_sf_hydrogenicR_e no longer reports ! an underflow for exact zeroes of the wavefunction. ! ! ** gsl_linalg_SV_decomp_jacobi now reports an error for the ! unimplemented case M and Brian Gough ! . --- 65,79 ---- A short program which reproducibly exercises the bug ! It is useful if you can check whether the same problem occurs when the ! library is compiled without optimization. Thank you. ! Any errors or omissions in the manual can also be reported to the ! same address. Contributing to GSL =================== ! If you are interested in participating in GSL development, please see ! the developers' webpage at http://sources.redhat.com/gsl/devel.html ! diff -rc2P gsl-1.6/SUPPORT gsl-1.7/SUPPORT *** gsl-1.6/SUPPORT Fri Dec 24 13:54:21 2004 --- gsl-1.7/SUPPORT Mon Aug 22 15:22:22 2005 *************** *** 19,23 **** scientific and quantitative applications. ! Rate: $1495/year (950 ukp) for base maintenance contract. Updated: 2004-04-26 --- 19,23 ---- scientific and quantitative applications. ! Rate: From $150/hour. Updated: 2004-04-26 diff -rc2P gsl-1.6/THANKS gsl-1.7/THANKS *** gsl-1.6/THANKS Fri Dec 31 14:33:15 2004 --- gsl-1.7/THANKS Tue Sep 13 09:41:22 2005 *************** *** 335,336 **** --- 335,347 ---- maintaining the Debian package for GSL. + * Jari Häkkinen for svd bug reports + + * Marco Canini patch for IXP2400 Xscale + + * Ben Klemens bug report for sorting vectors + with NANs + + * Peter Brommer bug report and patch + for Brent minimisation algorithm. + + * Gabriel Withington typo in docs diff -rc2P gsl-1.6/TODO gsl-1.7/TODO *** gsl-1.6/TODO Mon Dec 27 19:18:37 2004 --- gsl-1.7/TODO Wed Jul 27 15:42:52 2005 *************** *** 155,157 **** evaluate C and Fortran expressions could be useful. ! --- 155,159 ---- evaluate C and Fortran expressions could be useful. ! * We should have an index mapping type object which handles elements ! of size_t for vectors and matrices, or at least vectors and matrices ! of size_t in addition to long, int, etc. diff -rc2P gsl-1.6/aclocal.m4 gsl-1.7/aclocal.m4 *** gsl-1.6/aclocal.m4 Fri Dec 31 15:15:09 2004 --- gsl-1.7/aclocal.m4 Tue Sep 13 10:04:22 2005 *************** *** 1,6 **** ! # generated automatically by aclocal 1.7.5 -*- Autoconf -*- ! # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002 ! # Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,6 ---- ! # generated automatically by aclocal 1.9.6 -*- Autoconf -*- ! # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, ! # 2005 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 12,45 **** # PARTICULAR PURPOSE. ! # Do all the work for Automake. -*- Autoconf -*- ! # This macro actually does too much some checks are only needed if ! # your package does certain things. But this isn't really a big deal. ! # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 # Free Software Foundation, Inc. ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! # serial 10 ! AC_PREREQ([2.54]) ! # Autoconf 2.50 wants to disallow AM_ names. We explicitly allow ! # the ones we care about. ! m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) --- 12,133 ---- # PARTICULAR PURPOSE. ! # Copyright (C) 2002, 2003, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # AM_AUTOMAKE_VERSION(VERSION) ! # ---------------------------- ! # Automake X.Y traces this macro to ensure aclocal.m4 has been ! # generated from the m4 files accompanying Automake X.Y. ! AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version="1.9"]) ! ! # AM_SET_CURRENT_AUTOMAKE_VERSION ! # ------------------------------- ! # Call AM_AUTOMAKE_VERSION so it can be traced. ! # This function is AC_REQUIREd by AC_INIT_AUTOMAKE. ! AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], ! [AM_AUTOMAKE_VERSION([1.9.6])]) ! ! # AM_AUX_DIR_EXPAND -*- Autoconf -*- ! ! # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! ! # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets ! # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to ! # `$srcdir', `$srcdir/..', or `$srcdir/../..'. ! # ! # Of course, Automake must honor this variable whenever it calls a ! # tool from the auxiliary directory. The problem is that $srcdir (and ! # therefore $ac_aux_dir as well) can be either absolute or relative, ! # depending on how configure is run. This is pretty annoying, since ! # it makes $ac_aux_dir quite unusable in subdirectories: in the top ! # source directory, any form will work fine, but in subdirectories a ! # relative path needs to be adjusted first. ! # ! # $ac_aux_dir/missing ! # fails when called from a subdirectory if $ac_aux_dir is relative ! # $top_srcdir/$ac_aux_dir/missing ! # fails if $ac_aux_dir is absolute, ! # fails when called from a subdirectory in a VPATH build with ! # a relative $ac_aux_dir ! # ! # The reason of the latter failure is that $top_srcdir and $ac_aux_dir ! # are both prefixed by $srcdir. In an in-source build this is usually ! # harmless because $srcdir is `.', but things will broke when you ! # start a VPATH build or use an absolute $srcdir. ! # ! # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, ! # iff we strip the leading $srcdir from $ac_aux_dir. That would be: ! # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` ! # and then we would define $MISSING as ! # MISSING="\${SHELL} $am_aux_dir/missing" ! # This will work as long as MISSING is not called from configure, because ! # unfortunately $(top_srcdir) has no meaning in configure. ! # However there are other variables, like CC, which are often used in ! # configure, and could therefore not use this "fixed" $ac_aux_dir. ! # ! # Another solution, used here, is to always expand $ac_aux_dir to an ! # absolute PATH. The drawback is that using absolute paths prevent a ! # configured tree to be moved without reconfiguration. ! ! AC_DEFUN([AM_AUX_DIR_EXPAND], ! [dnl Rely on autoconf to set up CDPATH properly. ! AC_PREREQ([2.50])dnl ! # expand $ac_aux_dir to an absolute path ! am_aux_dir=`cd $ac_aux_dir && pwd` ! ]) ! # AM_CONDITIONAL -*- Autoconf -*- ! ! # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005 # Free Software Foundation, Inc. + # + # This file is free software; the Free Software Foundation + # gives unlimited permission to copy and/or distribute it, + # with or without modifications, as long as this notice is preserved. ! # serial 7 ! # AM_CONDITIONAL(NAME, SHELL-CONDITION) ! # ------------------------------------- ! # Define a conditional. ! AC_DEFUN([AM_CONDITIONAL], ! [AC_PREREQ(2.52)dnl ! ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], ! [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl ! AC_SUBST([$1_TRUE]) ! AC_SUBST([$1_FALSE]) ! if $2; then ! $1_TRUE= ! $1_FALSE='#' ! else ! $1_TRUE='#' ! $1_FALSE= ! fi ! AC_CONFIG_COMMANDS_PRE( ! [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then ! AC_MSG_ERROR([[conditional "$1" was never defined. ! Usually this means the macro was only invoked conditionally.]]) ! fi])]) ! # Do all the work for Automake. -*- Autoconf -*- ! # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 ! # Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # serial 12 ! # This macro actually does too much. Some checks are only needed if ! # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) *************** *** 55,60 **** # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], ! [AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl ! AC_REQUIRE([AC_PROG_INSTALL])dnl # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && --- 143,152 ---- # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], ! [AC_PREREQ([2.58])dnl ! dnl Autoconf wants to disallow AM_ names. We explicitly allow ! dnl the ones we care about. ! m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl ! AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl ! AC_REQUIRE([AC_PROG_INSTALL])dnl # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && *************** *** 95,101 **** AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) - AM_MISSING_PROG(AMTAR, tar) AM_PROG_INSTALL_SH AM_PROG_INSTALL_STRIP # We need awk for the "check" target. The system "awk" is bad on # some platforms. --- 187,193 ---- AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AM_PROG_INSTALL_SH AM_PROG_INSTALL_STRIP + AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. *************** *** 103,107 **** AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl ! _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], --- 195,201 ---- AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl ! _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], ! [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], ! [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], *************** *** 137,189 **** echo "timestamp for $1" >`AS_DIRNAME([$1])`/stamp-h[]$_am_stamp_count]) ! # Copyright 2002 Free Software Foundation, Inc. ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # AM_AUTOMAKE_VERSION(VERSION) ! # ---------------------------- ! # Automake X.Y traces this macro to ensure aclocal.m4 has been ! # generated from the m4 files accompanying Automake X.Y. ! AC_DEFUN([AM_AUTOMAKE_VERSION],[am__api_version="1.7"]) ! # AM_SET_CURRENT_AUTOMAKE_VERSION ! # ------------------------------- ! # Call AM_AUTOMAKE_VERSION so it can be traced. ! # This function is AC_REQUIREd by AC_INIT_AUTOMAKE. ! AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], ! [AM_AUTOMAKE_VERSION([1.7.5])]) ! # Helper functions for option handling. -*- Autoconf -*- ! # Copyright 2001, 2002 Free Software Foundation, Inc. ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! # serial 2 # _AM_MANGLE_OPTION(NAME) --- 231,405 ---- echo "timestamp for $1" >`AS_DIRNAME([$1])`/stamp-h[]$_am_stamp_count]) ! # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # AM_PROG_INSTALL_SH ! # ------------------ ! # Define $install_sh. ! AC_DEFUN([AM_PROG_INSTALL_SH], ! [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl ! install_sh=${install_sh-"$am_aux_dir/install-sh"} ! AC_SUBST(install_sh)]) ! # Copyright (C) 2003, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # serial 2 ! # Check whether the underlying file-system supports filenames ! # with a leading dot. For instance MS-DOS doesn't. ! AC_DEFUN([AM_SET_LEADING_DOT], ! [rm -rf .tst 2>/dev/null ! mkdir .tst 2>/dev/null ! if test -d .tst; then ! am__leading_dot=. ! else ! am__leading_dot=_ ! fi ! rmdir .tst 2>/dev/null ! AC_SUBST([am__leading_dot])]) ! # Add --enable-maintainer-mode option to configure. -*- Autoconf -*- ! # From Jim Meyering ! # Copyright (C) 1996, 1998, 2000, 2001, 2002, 2003, 2004, 2005 ! # Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # serial 4 ! AC_DEFUN([AM_MAINTAINER_MODE], ! [AC_MSG_CHECKING([whether to enable maintainer-specific portions of Makefiles]) ! dnl maintainer-mode is disabled by default ! AC_ARG_ENABLE(maintainer-mode, ! [ --enable-maintainer-mode enable make rules and dependencies not useful ! (and sometimes confusing) to the casual installer], ! USE_MAINTAINER_MODE=$enableval, ! USE_MAINTAINER_MODE=no) ! AC_MSG_RESULT([$USE_MAINTAINER_MODE]) ! AM_CONDITIONAL(MAINTAINER_MODE, [test $USE_MAINTAINER_MODE = yes]) ! MAINT=$MAINTAINER_MODE_TRUE ! AC_SUBST(MAINT)dnl ! ] ! ) ! AU_DEFUN([jm_MAINTAINER_MODE], [AM_MAINTAINER_MODE]) ! # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- ! # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2005 ! # Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! ! # serial 4 ! ! # AM_MISSING_PROG(NAME, PROGRAM) ! # ------------------------------ ! AC_DEFUN([AM_MISSING_PROG], ! [AC_REQUIRE([AM_MISSING_HAS_RUN]) ! $1=${$1-"${am_missing_run}$2"} ! AC_SUBST($1)]) ! ! ! # AM_MISSING_HAS_RUN ! # ------------------ ! # Define MISSING if not defined so far and test if it supports --run. ! # If it does, set am_missing_run to use it, otherwise, to nothing. ! AC_DEFUN([AM_MISSING_HAS_RUN], ! [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl ! test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" ! # Use eval to expand $SHELL ! if eval "$MISSING --run true"; then ! am_missing_run="$MISSING --run " ! else ! am_missing_run= ! AC_MSG_WARN([`missing' script is too old or missing]) ! fi ! ]) ! ! # Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! ! # AM_PROG_MKDIR_P ! # --------------- ! # Check whether `mkdir -p' is supported, fallback to mkinstalldirs otherwise. ! # ! # Automake 1.8 used `mkdir -m 0755 -p --' to ensure that directories ! # created by `make install' are always world readable, even if the ! # installer happens to have an overly restrictive umask (e.g. 077). ! # This was a mistake. There are at least two reasons why we must not ! # use `-m 0755': ! # - it causes special bits like SGID to be ignored, ! # - it may be too restrictive (some setups expect 775 directories). ! # ! # Do not use -m 0755 and let people choose whatever they expect by ! # setting umask. ! # ! # We cannot accept any implementation of `mkdir' that recognizes `-p'. ! # Some implementations (such as Solaris 8's) are not thread-safe: if a ! # parallel make tries to run `mkdir -p a/b' and `mkdir -p a/c' ! # concurrently, both version can detect that a/ is missing, but only ! # one can create it and the other will error out. Consequently we ! # restrict ourselves to GNU make (using the --version option ensures ! # this.) ! AC_DEFUN([AM_PROG_MKDIR_P], ! [if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then ! # We used to keeping the `.' as first argument, in order to ! # allow $(mkdir_p) to be used without argument. As in ! # $(mkdir_p) $(somedir) ! # where $(somedir) is conditionally defined. However this is wrong ! # for two reasons: ! # 1. if the package is installed by a user who cannot write `.' ! # make install will fail, ! # 2. the above comment should most certainly read ! # $(mkdir_p) $(DESTDIR)$(somedir) ! # so it does not work when $(somedir) is undefined and ! # $(DESTDIR) is not. ! # To support the latter case, we have to write ! # test -z "$(somedir)" || $(mkdir_p) $(DESTDIR)$(somedir), ! # so the `.' trick is pointless. ! mkdir_p='mkdir -p --' ! else ! # On NextStep and OpenStep, the `mkdir' command does not ! # recognize any option. It will interpret all options as ! # directories to create, and then abort because `.' already ! # exists. ! for d in ./-p ./--version; ! do ! test -d $d && rmdir $d ! done ! # $(mkinstalldirs) is defined by Automake if mkinstalldirs exists. ! if test -f "$ac_aux_dir/mkinstalldirs"; then ! mkdir_p='$(mkinstalldirs)' ! else ! mkdir_p='$(install_sh) -d' ! fi ! fi ! AC_SUBST([mkdir_p])]) ! ! # Helper functions for option handling. -*- Autoconf -*- ! ! # Copyright (C) 2001, 2002, 2003, 2005 Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! ! # serial 3 # _AM_MANGLE_OPTION(NAME) *************** *** 210,235 **** [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) ! # ! # Check to make sure that the build environment is sane. ! # ! ! # Copyright 1996, 1997, 2000, 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! # serial 3 # AM_SANITY_CHECK --- 426,439 ---- [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) ! # Check to make sure that the build environment is sane. -*- Autoconf -*- ! # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005 ! # Free Software Foundation, Inc. ! # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. ! # serial 4 # AM_SANITY_CHECK *************** *** 274,433 **** AC_MSG_RESULT(yes)]) ! # -*- Autoconf -*- ! ! ! # Copyright 1997, 1999, 2000, 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # serial 3 ! ! # AM_MISSING_PROG(NAME, PROGRAM) ! # ------------------------------ ! AC_DEFUN([AM_MISSING_PROG], ! [AC_REQUIRE([AM_MISSING_HAS_RUN]) ! $1=${$1-"${am_missing_run}$2"} ! AC_SUBST($1)]) ! ! ! # AM_MISSING_HAS_RUN ! # ------------------ ! # Define MISSING if not defined so far and test if it supports --run. ! # If it does, set am_missing_run to use it, otherwise, to nothing. ! AC_DEFUN([AM_MISSING_HAS_RUN], ! [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl ! test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" ! # Use eval to expand $SHELL ! if eval "$MISSING --run true"; then ! am_missing_run="$MISSING --run " ! else ! am_missing_run= ! AC_MSG_WARN([`missing' script is too old or missing]) ! fi ! ]) ! ! # AM_AUX_DIR_EXPAND ! ! # Copyright 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets ! # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to ! # `$srcdir', `$srcdir/..', or `$srcdir/../..'. ! # ! # Of course, Automake must honor this variable whenever it calls a ! # tool from the auxiliary directory. The problem is that $srcdir (and ! # therefore $ac_aux_dir as well) can be either absolute or relative, ! # depending on how configure is run. This is pretty annoying, since ! # it makes $ac_aux_dir quite unusable in subdirectories: in the top ! # source directory, any form will work fine, but in subdirectories a ! # relative path needs to be adjusted first. ! # ! # $ac_aux_dir/missing ! # fails when called from a subdirectory if $ac_aux_dir is relative ! # $top_srcdir/$ac_aux_dir/missing ! # fails if $ac_aux_dir is absolute, ! # fails when called from a subdirectory in a VPATH build with ! # a relative $ac_aux_dir ! # ! # The reason of the latter failure is that $top_srcdir and $ac_aux_dir ! # are both prefixed by $srcdir. In an in-source build this is usually ! # harmless because $srcdir is `.', but things will broke when you ! # start a VPATH build or use an absolute $srcdir. ! # ! # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, ! # iff we strip the leading $srcdir from $ac_aux_dir. That would be: ! # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` ! # and then we would define $MISSING as ! # MISSING="\${SHELL} $am_aux_dir/missing" ! # This will work as long as MISSING is not called from configure, because ! # unfortunately $(top_srcdir) has no meaning in configure. ! # However there are other variables, like CC, which are often used in ! # configure, and could therefore not use this "fixed" $ac_aux_dir. # ! # Another solution, used here, is to always expand $ac_aux_dir to an ! # absolute PATH. The drawback is that using absolute paths prevent a ! # configured tree to be moved without reconfiguration. ! ! # Rely on autoconf to set up CDPATH properly. ! AC_PREREQ([2.50]) ! ! AC_DEFUN([AM_AUX_DIR_EXPAND], [ ! # expand $ac_aux_dir to an absolute path ! am_aux_dir=`cd $ac_aux_dir && pwd` ! ]) ! ! # AM_PROG_INSTALL_SH ! # ------------------ ! # Define $install_sh. ! ! # Copyright 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! AC_DEFUN([AM_PROG_INSTALL_SH], ! [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl ! install_sh=${install_sh-"$am_aux_dir/install-sh"} ! AC_SUBST(install_sh)]) # AM_PROG_INSTALL_STRIP ! ! # Copyright 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially --- 478,489 ---- AC_MSG_RESULT(yes)]) ! # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # ! # This file is free software; the Free Software Foundation ! # gives unlimited permission to copy and/or distribute it, ! # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP ! # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially *************** *** 450,860 **** AC_SUBST([INSTALL_STRIP_PROGRAM])]) ! # -*- Autoconf -*- ! # Copyright (C) 2003 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # serial 1 ! ! # Check whether the underlying file-system supports filenames ! # with a leading dot. For instance MS-DOS doesn't. ! AC_DEFUN([AM_SET_LEADING_DOT], ! [rm -rf .tst 2>/dev/null ! mkdir .tst 2>/dev/null ! if test -d .tst; then ! am__leading_dot=. ! else ! am__leading_dot=_ ! fi ! rmdir .tst 2>/dev/null ! AC_SUBST([am__leading_dot])]) ! ! # serial 5 -*- Autoconf -*- ! ! # Copyright (C) 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be ! # written in clear, in which case automake, when reading aclocal.m4, ! # will think it sees a *use*, and therefore will trigger all it's ! # C support machinery. Also note that it means that autoscan, seeing ! # CC etc. in the Makefile, will ask for an AC_PROG_CC use... ! # _AM_DEPENDENCIES(NAME) ! # ---------------------- ! # See how the compiler implements dependency checking. ! # NAME is "CC", "CXX", "GCJ", or "OBJC". ! # We try a few techniques and use that to set a single cache variable. ! # ! # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was ! # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular ! # dependency, and given that the user is not expected to run this macro, ! # just rely on AC_PROG_CC. ! AC_DEFUN([_AM_DEPENDENCIES], ! [AC_REQUIRE([AM_SET_DEPDIR])dnl ! AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl ! AC_REQUIRE([AM_MAKE_INCLUDE])dnl ! AC_REQUIRE([AM_DEP_TRACK])dnl ! ! ifelse([$1], CC, [depcc="$CC" am_compiler_list=], ! [$1], CXX, [depcc="$CXX" am_compiler_list=], ! [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], ! [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], ! [depcc="$$1" am_compiler_list=]) ! ! AC_CACHE_CHECK([dependency style of $depcc], ! [am_cv_$1_dependencies_compiler_type], ! [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then ! # We make a subdir and do the tests there. Otherwise we can end up ! # making bogus files that we don't know about and never remove. For ! # instance it was reported that on HP-UX the gcc test will end up ! # making a dummy file named `D' -- because `-MD' means `put the output ! # in D'. mkdir conftest.dir ! # Copy depcomp to subdir because otherwise we won't find it if we're ! # using a relative directory. ! cp "$am_depcomp" conftest.dir ! cd conftest.dir ! ! am_cv_$1_dependencies_compiler_type=none ! if test "$am_compiler_list" = ""; then ! am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` ! fi ! for depmode in $am_compiler_list; do ! # We need to recreate these files for each test, as the compiler may ! # overwrite some of them when testing with obscure command lines. ! # This happens at least with the AIX C compiler. ! echo '#include "conftest.h"' > conftest.c ! echo 'int i;' > conftest.h ! echo "${am__include} ${am__quote}conftest.Po${am__quote}" > confmf ! ! case $depmode in ! nosideeffect) ! # after this tag, mechanisms are not by side-effect, so they'll ! # only be used when explicitly requested ! if test "x$enable_dependency_tracking" = xyes; then ! continue ! else ! break ! fi ! ;; ! none) break ;; ! esac ! # We check with `-c' and `-o' for the sake of the "dashmstdout" ! # mode. It turns out that the SunPro C++ compiler does not properly ! # handle `-M -o', and we need to detect this. ! if depmode=$depmode \ ! source=conftest.c object=conftest.o \ ! depfile=conftest.Po tmpdepfile=conftest.TPo \ ! $SHELL ./depcomp $depcc -c -o conftest.o conftest.c \ ! >/dev/null 2>conftest.err && ! grep conftest.h conftest.Po > /dev/null 2>&1 && ! ${MAKE-make} -s -f confmf > /dev/null 2>&1; then ! # icc doesn't choke on unknown options, it will just issue warnings ! # (even with -Werror). So we grep stderr for any message ! # that says an option was ignored. ! if grep 'ignoring option' conftest.err >/dev/null 2>&1; then :; else ! am_cv_$1_dependencies_compiler_type=$depmode ! break ! fi ! fi ! done ! ! cd .. rm -rf conftest.dir ! else ! am_cv_$1_dependencies_compiler_type=none ! fi ! ]) ! AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) ! AM_CONDITIONAL([am__fastdep$1], [ ! test "x$enable_dependency_tracking" != xno \ ! && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ! ]) ! ! ! # AM_SET_DEPDIR ! # ------------- ! # Choose a directory name for dependency files. ! # This macro is AC_REQUIREd in _AM_DEPENDENCIES ! AC_DEFUN([AM_SET_DEPDIR], ! [AC_REQUIRE([AM_SET_LEADING_DOT])dnl ! AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ! ]) ! ! ! # AM_DEP_TRACK ! # ------------ ! AC_DEFUN([AM_DEP_TRACK], ! [AC_ARG_ENABLE(dependency-tracking, ! [ --disable-dependency-tracking Speeds up one-time builds ! --enable-dependency-tracking Do not reject slow dependency extractors]) ! if test "x$enable_dependency_tracking" != xno; then ! am_depcomp="$ac_aux_dir/depcomp" ! AMDEPBACKSLASH='\' ! fi ! AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) ! AC_SUBST([AMDEPBACKSLASH]) ! ]) ! ! # Generate code to set up dependency tracking. -*- Autoconf -*- ! ! # Copyright 1999, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! #serial 2 ! ! # _AM_OUTPUT_DEPENDENCY_COMMANDS ! # ------------------------------ ! AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], ! [for mf in $CONFIG_FILES; do ! # Strip MF so we end up with the name of the file. ! mf=`echo "$mf" | sed -e 's/:.*$//'` ! # Check whether this is an Automake generated Makefile or not. ! # We used to match only the files named `Makefile.in', but ! # some people rename them; so instead we look at the file content. ! # Grep'ing the first line is not enough: some people post-process ! # each Makefile.in and add a new line on top of each file to say so. ! # So let's grep whole file. ! if grep '^#.*generated by automake' $mf > /dev/null 2>&1; then ! dirpart=`AS_DIRNAME("$mf")` ! else ! continue fi - grep '^DEP_FILES *= *[[^ @%:@]]' < "$mf" > /dev/null || continue - # Extract the definition of DEP_FILES from the Makefile without - # running `make'. - DEPDIR=`sed -n -e '/^DEPDIR = / s///p' < "$mf"` - test -z "$DEPDIR" && continue - # When using ansi2knr, U may be empty or an underscore; expand it - U=`sed -n -e '/^U = / s///p' < "$mf"` - test -d "$dirpart/$DEPDIR" || mkdir "$dirpart/$DEPDIR" - # We invoke sed twice because it is the simplest approach to - # changing $(DEPDIR) to its actual value in the expansion. - for file in `sed -n -e ' - /^DEP_FILES = .*\\\\$/ { - s/^DEP_FILES = // - :loop - s/\\\\$// - p - n - /\\\\$/ b loop - p - } - /^DEP_FILES = / s/^DEP_FILES = //p' < "$mf" | \ - sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do - # Make sure the directory exists. - test -f "$dirpart/$file" && continue - fdir=`AS_DIRNAME(["$file"])` - AS_MKDIR_P([$dirpart/$fdir]) - # echo "creating $dirpart/$file" - echo '# dummy' > "$dirpart/$file" - done done ! ])# _AM_OUTPUT_DEPENDENCY_COMMANDS ! ! ! # AM_OUTPUT_DEPENDENCY_COMMANDS ! # ----------------------------- ! # This macro should only be invoked once -- use via AC_REQUIRE. ! # ! # This code is only required when automatic dependency tracking ! # is enabled. FIXME. This creates each `.P' file that we will ! # need in order to bootstrap the dependency handling code. ! AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], ! [AC_CONFIG_COMMANDS([depfiles], ! [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], ! [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ! ]) ! ! # Check to see how 'make' treats includes. -*- Autoconf -*- ! # Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # serial 2 ! ! # AM_MAKE_INCLUDE() ! # ----------------- ! # Check to see how make treats includes. ! AC_DEFUN([AM_MAKE_INCLUDE], ! [am_make=${MAKE-make} ! cat > confinc << 'END' ! am__doit: ! @echo done ! .PHONY: am__doit ! END ! # If we don't find an include directive, just comment out the code. ! AC_MSG_CHECKING([for style of include used by $am_make]) ! am__include="#" ! am__quote= ! _am_result=none ! # First try GNU make style include. ! echo "include confinc" > confmf ! # We grep out `Entering directory' and `Leaving directory' ! # messages which can occur if `w' ends up in MAKEFLAGS. ! # In particular we don't look at `^make:' because GNU make might ! # be invoked under some other name (usually "gmake"), in which ! # case it prints its new name instead of `make'. ! if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then ! am__include=include ! am__quote= ! _am_result=GNU ! fi ! # Now try BSD make style include. ! if test "$am__include" = "#"; then ! echo '.include "confinc"' > confmf ! if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then ! am__include=.include ! am__quote="\"" ! _am_result=BSD ! fi ! fi ! AC_SUBST([am__include]) ! AC_SUBST([am__quote]) ! AC_MSG_RESULT([$_am_result]) ! rm -f confinc confmf ! ]) ! ! # AM_CONDITIONAL -*- Autoconf -*- ! ! # Copyright 1997, 2000, 2001 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # serial 5 ! ! AC_PREREQ(2.52) ! ! # AM_CONDITIONAL(NAME, SHELL-CONDITION) ! # ------------------------------------- ! # Define a conditional. ! AC_DEFUN([AM_CONDITIONAL], ! [ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], ! [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl ! AC_SUBST([$1_TRUE]) ! AC_SUBST([$1_FALSE]) ! if $2; then ! $1_TRUE= ! $1_FALSE='#' ! else ! $1_TRUE='#' ! $1_FALSE= ! fi ! AC_CONFIG_COMMANDS_PRE( ! [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then ! AC_MSG_ERROR([conditional "$1" was never defined. ! Usually this means the macro was only invoked conditionally.]) ! fi])]) ! ! # Add --enable-maintainer-mode option to configure. ! # From Jim Meyering ! ! # Copyright 1996, 1998, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! # This program is free software; you can redistribute it and/or modify ! # it under the terms of the GNU General Public License as published by ! # the Free Software Foundation; either version 2, or (at your option) ! # any later version. ! ! # This program is distributed in the hope that it will be useful, ! # but WITHOUT ANY WARRANTY; without even the implied warranty of ! # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! # GNU General Public License for more details. ! ! # You should have received a copy of the GNU General Public License ! # along with this program; if not, write to the Free Software ! # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA ! # 02111-1307, USA. ! ! # serial 2 ! ! AC_DEFUN([AM_MAINTAINER_MODE], ! [AC_MSG_CHECKING([whether to enable maintainer-specific portions of Makefiles]) ! dnl maintainer-mode is disabled by default ! AC_ARG_ENABLE(maintainer-mode, ! [ --enable-maintainer-mode enable make rules and dependencies not useful ! (and sometimes confusing) to the casual installer], ! USE_MAINTAINER_MODE=$enableval, ! USE_MAINTAINER_MODE=no) ! AC_MSG_RESULT([$USE_MAINTAINER_MODE]) ! AM_CONDITIONAL(MAINTAINER_MODE, [test $USE_MAINTAINER_MODE = yes]) ! MAINT=$MAINTAINER_MODE_TRUE ! AC_SUBST(MAINT)dnl ! ] ! ) ! ! AU_DEFUN([jm_MAINTAINER_MODE], [AM_MAINTAINER_MODE]) # libtool.m4 - Configure libtool for the host system. -*-Shell-script-*- --- 506,604 ---- AC_SUBST([INSTALL_STRIP_PROGRAM])]) ! # Check how to create a tarball. -*- Autoconf -*- + # Copyright (C) 2004, 2005 Free Software Foundation, Inc. + # + # This file is free software; the Free Software Foundation + # gives unlimited permission to copy and/or distribute it, + # with or without modifications, as long as this notice is preserved. ! # serial 2 + # _AM_PROG_TAR(FORMAT) + # -------------------- + # Check how to create a tarball in format FORMAT. + # FORMAT should be one of `v7', `ustar', or `pax'. + # + # Substitute a variable $(am__tar) that is a command + # writing to stdout a FORMAT-tarball containing the directory + # $tardir. + # tardir=directory && $(am__tar) > result.tar + # + # Substitute a variable $(am__untar) that extract such + # a tarball read from stdin. + # $(am__untar) < result.tar + AC_DEFUN([_AM_PROG_TAR], + [# Always define AMTAR for backward compatibility. + AM_MISSING_PROG([AMTAR], [tar]) + m4_if([$1], [v7], + [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'], + [m4_case([$1], [ustar],, [pax],, + [m4_fatal([Unknown tar format])]) + AC_MSG_CHECKING([how to create a $1 tar archive]) + # Loop over all known methods to create a tar archive until one works. + _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' + _am_tools=${am_cv_prog_tar_$1-$_am_tools} + # Do not fold the above two line into one, because Tru64 sh and + # Solaris sh will not grok spaces in the rhs of `-'. + for _am_tool in $_am_tools + do + case $_am_tool in + gnutar) + for _am_tar in tar gnutar gtar; + do + AM_RUN_LOG([$_am_tar --version]) && break + done + am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' + am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' + am__untar="$_am_tar -xf -" + ;; + plaintar) + # Must skip GNU tar: if it does not support --format= it doesn't create + # ustar tarball either. + (tar --version) >/dev/null 2>&1 && continue + am__tar='tar chf - "$$tardir"' + am__tar_='tar chf - "$tardir"' + am__untar='tar xf -' + ;; + pax) + am__tar='pax -L -x $1 -w "$$tardir"' + am__tar_='pax -L -x $1 -w "$tardir"' + am__untar='pax -r' + ;; + cpio) + am__tar='find "$$tardir" -print | cpio -o -H $1 -L' + am__tar_='find "$tardir" -print | cpio -o -H $1 -L' + am__untar='cpio -i -H $1 -d' + ;; + none) + am__tar=false + am__tar_=false + am__untar=false + ;; + esac + # If the value was cached, stop now. We just wanted to have am__tar + # and am__untar set. + test -n "${am_cv_prog_tar_$1}" && break ! # tar/untar a dummy directory, and stop if the command works ! rm -rf conftest.dir mkdir conftest.dir ! echo GrepMe > conftest.dir/file ! AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir ! if test -s conftest.tar; then ! AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done ! rm -rf conftest.dir ! AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) ! AC_MSG_RESULT([$am_cv_prog_tar_$1])]) ! AC_SUBST([am__tar]) ! AC_SUBST([am__untar]) ! ]) # _AM_PROG_TAR # libtool.m4 - Configure libtool for the host system. -*-Shell-script-*- diff -rc2P gsl-1.6/blas/ChangeLog gsl-1.7/blas/ChangeLog *** gsl-1.6/blas/ChangeLog Fri Dec 24 13:56:16 2004 --- gsl-1.7/blas/ChangeLog Tue Apr 5 15:57:38 2005 *************** *** 1,2 **** --- 1,7 ---- + 2005-04-05 Brian Gough + + * blas.c (gsl_blas_ssyrk): test conformance against size correctly + allowing for transpose + 2004-12-21 Brian Gough diff -rc2P gsl-1.6/blas/Makefile.in gsl-1.7/blas/Makefile.in *** gsl-1.6/blas/Makefile.in Fri Dec 31 15:15:20 2004 --- gsl-1.7/blas/Makefile.in Tue Sep 13 10:04:34 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,80 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + subdir = blas + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog TODO + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslblas_la_LIBADD = + am_libgslblas_la_OBJECTS = blas.lo + libgslblas_la_OBJECTS = $(am_libgslblas_la_OBJECTS) + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslblas_la_SOURCES) + DIST_SOURCES = $(libgslblas_la_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 154,159 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 176,180 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,189 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslblas.la - pkginclude_HEADERS = gsl_blas.h gsl_blas_types.h - INCLUDES = -I$(top_srcdir) - libgslblas_la_SOURCES = blas.c - subdir = blas - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslblas_la_LDFLAGS = - libgslblas_la_LIBADD = - am_libgslblas_la_OBJECTS = blas.lo - libgslblas_la_OBJECTS = $(am_libgslblas_la_OBJECTS) - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslblas_la_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in \ - TODO - SOURCES = $(libgslblas_la_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu blas/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 185,224 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslblas.la pkginclude_HEADERS = gsl_blas.h gsl_blas_types.h INCLUDES = -I$(top_srcdir) libgslblas_la_SOURCES = blas.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps blas/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps blas/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 191,195 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 226,230 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 199,203 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 234,238 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 205,215 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 240,250 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 222,234 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 257,268 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 236,252 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 270,278 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 257,260 **** --- 283,287 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 268,275 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 295,303 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 294,301 **** distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 322,325 ---- *************** *** 311,315 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 335,339 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 329,335 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 353,360 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 343,347 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 368,372 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 351,355 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 376,380 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 362,366 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 387,391 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 370,373 **** --- 395,400 ---- dvi-am: + html: html-am + info: info-am *************** *** 385,389 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 412,416 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 406,411 **** clean-libtool clean-noinstLTLIBRARIES ctags distclean \ distclean-compile distclean-generic distclean-libtool \ ! distclean-tags distdir dvi dvi-am info info-am install \ ! install-am install-data install-data-am install-exec \ install-exec-am install-info install-info-am install-man \ install-pkgincludeHEADERS install-strip installcheck \ --- 433,438 ---- clean-libtool clean-noinstLTLIBRARIES ctags distclean \ distclean-compile distclean-generic distclean-libtool \ ! distclean-tags distdir dvi dvi-am html html-am info info-am \ ! install install-am install-data install-data-am install-exec \ install-exec-am install-info install-info-am install-man \ install-pkgincludeHEADERS install-strip installcheck \ diff -rc2P gsl-1.6/blas/blas.c gsl-1.7/blas/blas.c *** gsl-1.6/blas/blas.c Fri Dec 24 13:54:21 2004 --- gsl-1.7/blas/blas.c Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ *************** *** 1628,1631 **** --- 1628,1632 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1634,1638 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1635,1639 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); *************** *** 1651,1654 **** --- 1652,1656 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1657,1661 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1659,1663 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); *************** *** 1677,1680 **** --- 1679,1683 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1683,1687 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1686,1690 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); *************** *** 1702,1705 **** --- 1705,1709 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1708,1712 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1712,1716 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); *************** *** 1728,1731 **** --- 1732,1736 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1734,1738 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1739,1743 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); *************** *** 1752,1755 **** --- 1757,1761 ---- const size_t M = C->size1; const size_t N = C->size2; + const size_t J = (Trans == CblasNoTrans) ? A->size1 : A->size2; const size_t K = (Trans == CblasNoTrans) ? A->size2 : A->size1; *************** *** 1758,1762 **** GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != K) { GSL_ERROR ("invalid length", GSL_EBADLEN); --- 1764,1768 ---- GSL_ERROR ("matrix C must be square", GSL_ENOTSQR); } ! else if (N != J) { GSL_ERROR ("invalid length", GSL_EBADLEN); diff -rc2P gsl-1.6/blas/gsl_blas.h gsl-1.7/blas/gsl_blas.h *** gsl-1.6/blas/gsl_blas.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/blas/gsl_blas.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/blas/gsl_blas_types.h gsl-1.7/blas/gsl_blas_types.h *** gsl-1.6/blas/gsl_blas_types.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/blas/gsl_blas_types.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/ChangeLog gsl-1.7/block/ChangeLog *** gsl-1.6/block/ChangeLog Sun Jun 6 15:47:49 2004 --- gsl-1.7/block/ChangeLog Sat May 21 14:10:38 2005 *************** *** 1,2 **** --- 1,7 ---- + 2005-05-21 Brian Gough + + * Makefile.am (pkginclude_HEADERS): removed unused file + gsl_block_complex.h + 2004-06-03 Brian Gough diff -rc2P gsl-1.6/block/Makefile.am gsl-1.7/block/Makefile.am *** gsl-1.6/block/Makefile.am Sat Sep 11 13:45:08 2004 --- gsl-1.7/block/Makefile.am Sat May 21 14:10:38 2005 *************** *** 3,7 **** check_PROGRAMS = test ! pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h INCLUDES= -I$(top_builddir) -I$(top_srcdir) --- 3,7 ---- check_PROGRAMS = test ! pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h INCLUDES= -I$(top_builddir) -I$(top_srcdir) diff -rc2P gsl-1.6/block/Makefile.in gsl-1.7/block/Makefile.in *** gsl-1.6/block/Makefile.in Fri Dec 31 15:15:20 2004 --- gsl-1.7/block/Makefile.in Tue Sep 13 10:04:35 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = block + DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \ + $(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslblock_la_LIBADD = + am_libgslblock_la_OBJECTS = init.lo file.lo block.lo + libgslblock_la_OBJECTS = $(am_libgslblock_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslblock.la ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la \ + ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslblock_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslblock_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,208 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslblock.la ! ! check_PROGRAMS = test ! ! pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h ! INCLUDES = -I$(top_builddir) -I$(top_srcdir) - TESTS = $(check_PROGRAMS) - test_LDADD = libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_SOURCES = test.c - CLEANFILES = test.txt test.dat - noinst_HEADERS = block_source.c init_source.c fprintf_source.c fwrite_source.c test_complex_source.c test_source.c test_io.c test_complex_io.c - libgslblock_la_SOURCES = init.c file.c block.c - subdir = block - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslblock_la_LDFLAGS = - libgslblock_la_LIBADD = - am_libgslblock_la_OBJECTS = init.lo file.lo block.lo - libgslblock_la_OBJECTS = $(am_libgslblock_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslblock.la ../ieee-utils/libgslieeeutils.la \ - ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la \ - ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslblock_la_SOURCES) $(test_SOURCES) - HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) - - DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) ChangeLog \ - Makefile.am Makefile.in - SOURCES = $(libgslblock_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu block/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,235 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslblock.la ! pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h INCLUDES = -I$(top_builddir) -I$(top_srcdir) TESTS = $(check_PROGRAMS) test_LDADD = libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la test_SOURCES = test.c CLEANFILES = test.txt test.dat noinst_HEADERS = block_source.c init_source.c fprintf_source.c fwrite_source.c test_complex_source.c test_source.c test_io.c test_complex_io.c libgslblock_la_SOURCES = init.c file.c block.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps block/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps block/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 210,214 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 237,241 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 228,232 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 255,259 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 234,244 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 261,271 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 251,263 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 278,289 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 265,281 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 291,299 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 286,289 **** --- 304,308 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 297,304 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 316,324 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 337,346 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 357,366 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 349,358 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 369,378 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 379,383 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 399,403 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 385,389 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 405,409 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 391,403 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 411,419 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 413,417 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 429,433 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 433,439 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 449,456 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 447,451 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 464,468 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 456,460 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 473,477 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 467,471 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 484,488 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 475,478 **** --- 492,497 ---- dvi-am: + html: html-am + info: info-am *************** *** 490,494 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 509,513 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 512,522 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 531,542 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/block/block_source.c gsl-1.7/block/block_source.c *** gsl-1.6/block/block_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/block_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/fprintf_source.c gsl-1.7/block/fprintf_source.c *** gsl-1.6/block/fprintf_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/fprintf_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/fwrite_source.c gsl-1.7/block/fwrite_source.c *** gsl-1.6/block/fwrite_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/fwrite_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_char.h gsl-1.7/block/gsl_block_char.h *** gsl-1.6/block/gsl_block_char.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_char.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ Only in gsl-1.6/block: gsl_block_complex.h diff -rc2P gsl-1.6/block/gsl_block_complex_double.h gsl-1.7/block/gsl_block_complex_double.h *** gsl-1.6/block/gsl_block_complex_double.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_complex_double.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_complex_float.h gsl-1.7/block/gsl_block_complex_float.h *** gsl-1.6/block/gsl_block_complex_float.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_complex_float.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_complex_long_double.h gsl-1.7/block/gsl_block_complex_long_double.h *** gsl-1.6/block/gsl_block_complex_long_double.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_complex_long_double.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_double.h gsl-1.7/block/gsl_block_double.h *** gsl-1.6/block/gsl_block_double.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_double.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_float.h gsl-1.7/block/gsl_block_float.h *** gsl-1.6/block/gsl_block_float.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_float.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_int.h gsl-1.7/block/gsl_block_int.h *** gsl-1.6/block/gsl_block_int.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_int.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_long.h gsl-1.7/block/gsl_block_long.h *** gsl-1.6/block/gsl_block_long.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_long.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_long_double.h gsl-1.7/block/gsl_block_long_double.h *** gsl-1.6/block/gsl_block_long_double.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_long_double.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_short.h gsl-1.7/block/gsl_block_short.h *** gsl-1.6/block/gsl_block_short.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_short.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_uchar.h gsl-1.7/block/gsl_block_uchar.h *** gsl-1.6/block/gsl_block_uchar.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_uchar.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_uint.h gsl-1.7/block/gsl_block_uint.h *** gsl-1.6/block/gsl_block_uint.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_uint.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_ulong.h gsl-1.7/block/gsl_block_ulong.h *** gsl-1.6/block/gsl_block_ulong.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_ulong.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_block_ushort.h gsl-1.7/block/gsl_block_ushort.h *** gsl-1.6/block/gsl_block_ushort.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/block/gsl_block_ushort.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/gsl_check_range.h gsl-1.7/block/gsl_check_range.h *** gsl-1.6/block/gsl_check_range.h Sun Jun 20 18:41:17 2004 --- gsl-1.7/block/gsl_check_range.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/init_source.c gsl-1.7/block/init_source.c *** gsl-1.6/block/init_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/init_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/test.c gsl-1.7/block/test.c *** gsl-1.6/block/test.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/test_complex_io.c gsl-1.7/block/test_complex_io.c *** gsl-1.6/block/test_complex_io.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/test_complex_io.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/test_complex_source.c gsl-1.7/block/test_complex_source.c *** gsl-1.6/block/test_complex_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/test_complex_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/test_io.c gsl-1.7/block/test_io.c *** gsl-1.6/block/test_io.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/test_io.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/block/test_source.c gsl-1.7/block/test_source.c *** gsl-1.6/block/test_source.c Fri Jul 25 15:18:07 2003 --- gsl-1.7/block/test_source.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/Makefile.in gsl-1.7/cblas/Makefile.in *** gsl-1.6/cblas/Makefile.in Fri Dec 31 15:15:21 2004 --- gsl-1.7/cblas/Makefile.in Tue Sep 13 10:04:36 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,122 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = cblas + DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \ + $(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog TODO + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgincludedir)" + libLTLIBRARIES_INSTALL = $(INSTALL) + LTLIBRARIES = $(lib_LTLIBRARIES) + libgslcblas_la_LIBADD = + am_libgslcblas_la_OBJECTS = sasum.lo saxpy.lo scasum.lo scnrm2.lo \ + scopy.lo sdot.lo sdsdot.lo sgbmv.lo sgemm.lo sgemv.lo sger.lo \ + snrm2.lo srot.lo srotg.lo srotm.lo srotmg.lo ssbmv.lo sscal.lo \ + sspmv.lo sspr.lo sspr2.lo sswap.lo ssymm.lo ssymv.lo ssyr.lo \ + ssyr2.lo ssyr2k.lo ssyrk.lo stbmv.lo stbsv.lo stpmv.lo \ + stpsv.lo strmm.lo strmv.lo strsm.lo strsv.lo dasum.lo daxpy.lo \ + dcopy.lo ddot.lo dgbmv.lo dgemm.lo dgemv.lo dger.lo dnrm2.lo \ + drot.lo drotg.lo drotm.lo drotmg.lo dsbmv.lo dscal.lo dsdot.lo \ + dspmv.lo dspr.lo dspr2.lo dswap.lo dsymm.lo dsymv.lo dsyr.lo \ + dsyr2.lo dsyr2k.lo dsyrk.lo dtbmv.lo dtbsv.lo dtpmv.lo \ + dtpsv.lo dtrmm.lo dtrmv.lo dtrsm.lo dtrsv.lo dzasum.lo \ + dznrm2.lo caxpy.lo ccopy.lo cdotc_sub.lo cdotu_sub.lo cgbmv.lo \ + cgemm.lo cgemv.lo cgerc.lo cgeru.lo chbmv.lo chemm.lo chemv.lo \ + cher.lo cher2.lo cher2k.lo cherk.lo chpmv.lo chpr.lo chpr2.lo \ + cscal.lo csscal.lo cswap.lo csymm.lo csyr2k.lo csyrk.lo \ + ctbmv.lo ctbsv.lo ctpmv.lo ctpsv.lo ctrmm.lo ctrmv.lo ctrsm.lo \ + ctrsv.lo zaxpy.lo zcopy.lo zdotc_sub.lo zdotu_sub.lo zdscal.lo \ + zgbmv.lo zgemm.lo zgemv.lo zgerc.lo zgeru.lo zhbmv.lo zhemm.lo \ + zhemv.lo zher.lo zher2.lo zher2k.lo zherk.lo zhpmv.lo zhpr.lo \ + zhpr2.lo zscal.lo zswap.lo zsymm.lo zsyr2k.lo zsyrk.lo \ + ztbmv.lo ztbsv.lo ztpmv.lo ztpsv.lo ztrmm.lo ztrmv.lo ztrsm.lo \ + ztrsv.lo icamax.lo idamax.lo isamax.lo izamax.lo xerbla.lo + libgslcblas_la_OBJECTS = $(am_libgslcblas_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) test_amax.$(OBJEXT) \ + test_asum.$(OBJEXT) test_axpy.$(OBJEXT) test_copy.$(OBJEXT) \ + test_dot.$(OBJEXT) test_gbmv.$(OBJEXT) test_gemm.$(OBJEXT) \ + test_gemv.$(OBJEXT) test_ger.$(OBJEXT) test_hbmv.$(OBJEXT) \ + test_hemm.$(OBJEXT) test_hemv.$(OBJEXT) test_her.$(OBJEXT) \ + test_her2.$(OBJEXT) test_her2k.$(OBJEXT) test_herk.$(OBJEXT) \ + test_hpmv.$(OBJEXT) test_hpr.$(OBJEXT) test_hpr2.$(OBJEXT) \ + test_nrm2.$(OBJEXT) test_rot.$(OBJEXT) test_rotg.$(OBJEXT) \ + test_rotm.$(OBJEXT) test_rotmg.$(OBJEXT) test_sbmv.$(OBJEXT) \ + test_scal.$(OBJEXT) test_spmv.$(OBJEXT) test_spr.$(OBJEXT) \ + test_spr2.$(OBJEXT) test_swap.$(OBJEXT) test_symm.$(OBJEXT) \ + test_symv.$(OBJEXT) test_syr.$(OBJEXT) test_syr2.$(OBJEXT) \ + test_syr2k.$(OBJEXT) test_syrk.$(OBJEXT) test_tbmv.$(OBJEXT) \ + test_tbsv.$(OBJEXT) test_tpmv.$(OBJEXT) test_tpsv.$(OBJEXT) \ + test_trmm.$(OBJEXT) test_trmv.$(OBJEXT) test_trsm.$(OBJEXT) \ + test_trsv.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslcblas.la ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslcblas_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslcblas_la_SOURCES) $(test_SOURCES) + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 196,201 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 218,222 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 143,247 **** lib_LTLIBRARIES = libgslcblas.la libgslcblas_la_LDFLAGS = -version-info $(GSL_LT_CBLAS_VERSION) - pkginclude_HEADERS = gsl_cblas.h - INCLUDES = -I$(top_srcdir) ! ! libgslcblas_la_SOURCES = sasum.c saxpy.c scasum.c scnrm2.c scopy.c sdot.c sdsdot.c sgbmv.c sgemm.c sgemv.c sger.c snrm2.c srot.c srotg.c srotm.c srotmg.c ssbmv.c sscal.c sspmv.c sspr.c sspr2.c sswap.c ssymm.c ssymv.c ssyr.c ssyr2.c ssyr2k.c ssyrk.c stbmv.c stbsv.c stpmv.c stpsv.c strmm.c strmv.c strsm.c strsv.c dasum.c daxpy.c dcopy.c ddot.c dgbmv.c dgemm.c dgemv.c dger.c dnrm2.c drot.c drotg.c drotm.c drotmg.c dsbmv.c dscal.c dsdot.c dspmv.c dspr.c dspr2.c dswap.c dsymm.c dsymv.c dsyr.c dsyr2.c dsyr2k.c dsyrk.c dtbmv.c dtbsv.c dtpmv.c dtpsv.c dtrmm.c dtrmv.c dtrsm.c dtrsv.c dzasum.c dznrm2.c caxpy.c ccopy.c cdotc_sub.c cdotu_sub.c cgbmv.c cgemm.c cgemv.c cgerc.c cgeru.c chbmv.c chemm.c chemv.c cher.c cher2.c cher2k.c cherk.c chpmv.c chpr.c chpr2.c cscal.c csscal.c cswap.c csymm.c csyr2k.c csyrk.c ctbmv.c ctbsv.c ctpmv.c ctpsv.c ctrmm.c ctrmv.c ctrsm.c ctrsv.c zaxpy.c zcopy.c zdotc_sub.c zdotu_sub.c zdscal.c zgbmv.c zgemm.c zgemv.c zgerc.c zgeru.c zhbmv.c zhemm.c zhemv.c zher.c zher2.c zher2k.c zherk.c zhpmv.c zhpr.c zhpr2.c zscal.c zswap.c zsymm.c zsyr2k.c zsyrk.c ztbmv.c ztbsv.c ztpmv.c ztpsv.c ztrmm.c ztrmv.c ztrsm.c ztrsv.c icamax.c idamax.c isamax.c izamax.c xerbla.c ! ! noinst_HEADERS = tests.c tests.h cblas.h source_asum_c.h source_asum_r.h source_axpy_c.h source_axpy_r.h source_copy_c.h source_copy_r.h source_dot_c.h source_dot_r.h source_gbmv_c.h source_gbmv_r.h source_gemm_c.h source_gemm_r.h source_gemv_c.h source_gemv_r.h source_ger.h source_gerc.h source_geru.h source_hbmv.h source_hemm.h source_hemv.h source_her.h source_her2.h source_her2k.h source_herk.h source_hpmv.h source_hpr.h source_hpr2.h source_iamax_c.h source_iamax_r.h source_nrm2_c.h source_nrm2_r.h source_rot.h source_rotg.h source_rotm.h source_rotmg.h source_sbmv.h source_scal_c.h source_scal_c_s.h source_scal_r.h source_spmv.h source_spr.h source_spr2.h source_swap_c.h source_swap_r.h source_symm_c.h source_symm_r.h source_symv.h source_syr.h source_syr2.h source_syr2k_c.h source_syr2k_r.h source_syrk_c.h source_syrk_r.h source_tbmv_c.h source_tbmv_r.h source_tbsv_c.h source_tbsv_r.h source_tpmv_c.h source_tpmv_r.h source_tpsv_c.h source_tpsv_r.h source_trmm_c.h source_trmm_r.h source_trmv_c.h source_trmv_r.h source_trsm_c.h source_trsm_r.h source_trsv_c.h source_trsv_r.h hypot.c ! ! check_PROGRAMS = test TESTS = $(check_PROGRAMS) - test_LDADD = libgslcblas.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la test_SOURCES = test.c test_amax.c test_asum.c test_axpy.c test_copy.c test_dot.c test_gbmv.c test_gemm.c test_gemv.c test_ger.c test_hbmv.c test_hemm.c test_hemv.c test_her.c test_her2.c test_her2k.c test_herk.c test_hpmv.c test_hpr.c test_hpr2.c test_nrm2.c test_rot.c test_rotg.c test_rotm.c test_rotmg.c test_sbmv.c test_scal.c test_spmv.c test_spr.c test_spr2.c test_swap.c test_symm.c test_symv.c test_syr.c test_syr2.c test_syr2k.c test_syrk.c test_tbmv.c test_tbsv.c test_tpmv.c test_tpsv.c test_trmm.c test_trmv.c test_trsm.c test_trsv.c - subdir = cblas - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(lib_LTLIBRARIES) - - libgslcblas_la_LIBADD = - am_libgslcblas_la_OBJECTS = sasum.lo saxpy.lo scasum.lo scnrm2.lo \ - scopy.lo sdot.lo sdsdot.lo sgbmv.lo sgemm.lo sgemv.lo sger.lo \ - snrm2.lo srot.lo srotg.lo srotm.lo srotmg.lo ssbmv.lo sscal.lo \ - sspmv.lo sspr.lo sspr2.lo sswap.lo ssymm.lo ssymv.lo ssyr.lo \ - ssyr2.lo ssyr2k.lo ssyrk.lo stbmv.lo stbsv.lo stpmv.lo stpsv.lo \ - strmm.lo strmv.lo strsm.lo strsv.lo dasum.lo daxpy.lo dcopy.lo \ - ddot.lo dgbmv.lo dgemm.lo dgemv.lo dger.lo dnrm2.lo drot.lo \ - drotg.lo drotm.lo drotmg.lo dsbmv.lo dscal.lo dsdot.lo dspmv.lo \ - dspr.lo dspr2.lo dswap.lo dsymm.lo dsymv.lo dsyr.lo dsyr2.lo \ - dsyr2k.lo dsyrk.lo dtbmv.lo dtbsv.lo dtpmv.lo dtpsv.lo dtrmm.lo \ - dtrmv.lo dtrsm.lo dtrsv.lo dzasum.lo dznrm2.lo caxpy.lo \ - ccopy.lo cdotc_sub.lo cdotu_sub.lo cgbmv.lo cgemm.lo cgemv.lo \ - cgerc.lo cgeru.lo chbmv.lo chemm.lo chemv.lo cher.lo cher2.lo \ - cher2k.lo cherk.lo chpmv.lo chpr.lo chpr2.lo cscal.lo csscal.lo \ - cswap.lo csymm.lo csyr2k.lo csyrk.lo ctbmv.lo ctbsv.lo ctpmv.lo \ - ctpsv.lo ctrmm.lo ctrmv.lo ctrsm.lo ctrsv.lo zaxpy.lo zcopy.lo \ - zdotc_sub.lo zdotu_sub.lo zdscal.lo zgbmv.lo zgemm.lo zgemv.lo \ - zgerc.lo zgeru.lo zhbmv.lo zhemm.lo zhemv.lo zher.lo zher2.lo \ - zher2k.lo zherk.lo zhpmv.lo zhpr.lo zhpr2.lo zscal.lo zswap.lo \ - zsymm.lo zsyr2k.lo zsyrk.lo ztbmv.lo ztbsv.lo ztpmv.lo ztpsv.lo \ - ztrmm.lo ztrmv.lo ztrsm.lo ztrsv.lo icamax.lo idamax.lo \ - isamax.lo izamax.lo xerbla.lo - libgslcblas_la_OBJECTS = $(am_libgslcblas_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) test_amax.$(OBJEXT) test_asum.$(OBJEXT) \ - test_axpy.$(OBJEXT) test_copy.$(OBJEXT) test_dot.$(OBJEXT) \ - test_gbmv.$(OBJEXT) test_gemm.$(OBJEXT) test_gemv.$(OBJEXT) \ - test_ger.$(OBJEXT) test_hbmv.$(OBJEXT) test_hemm.$(OBJEXT) \ - test_hemv.$(OBJEXT) test_her.$(OBJEXT) test_her2.$(OBJEXT) \ - test_her2k.$(OBJEXT) test_herk.$(OBJEXT) test_hpmv.$(OBJEXT) \ - test_hpr.$(OBJEXT) test_hpr2.$(OBJEXT) test_nrm2.$(OBJEXT) \ - test_rot.$(OBJEXT) test_rotg.$(OBJEXT) test_rotm.$(OBJEXT) \ - test_rotmg.$(OBJEXT) test_sbmv.$(OBJEXT) test_scal.$(OBJEXT) \ - test_spmv.$(OBJEXT) test_spr.$(OBJEXT) test_spr2.$(OBJEXT) \ - test_swap.$(OBJEXT) test_symm.$(OBJEXT) test_symv.$(OBJEXT) \ - test_syr.$(OBJEXT) test_syr2.$(OBJEXT) test_syr2k.$(OBJEXT) \ - test_syrk.$(OBJEXT) test_tbmv.$(OBJEXT) test_tbsv.$(OBJEXT) \ - test_tpmv.$(OBJEXT) test_tpsv.$(OBJEXT) test_trmm.$(OBJEXT) \ - test_trmv.$(OBJEXT) test_trsm.$(OBJEXT) test_trsv.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslcblas.la ../ieee-utils/libgslieeeutils.la \ - ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslcblas_la_SOURCES) $(test_SOURCES) - HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) - - DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) ChangeLog \ - Makefile.am Makefile.in TODO - SOURCES = $(libgslcblas_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu cblas/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) ! libLTLIBRARIES_INSTALL = $(INSTALL) install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(libdir) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) $$p $(DESTDIR)$(libdir)/$$f"; \ ! $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) $$p $(DESTDIR)$(libdir)/$$f; \ else :; fi; \ done --- 228,319 ---- lib_LTLIBRARIES = libgslcblas.la libgslcblas_la_LDFLAGS = -version-info $(GSL_LT_CBLAS_VERSION) pkginclude_HEADERS = gsl_cblas.h INCLUDES = -I$(top_srcdir) ! libgslcblas_la_SOURCES = sasum.c saxpy.c scasum.c scnrm2.c scopy.c \ ! sdot.c sdsdot.c sgbmv.c sgemm.c sgemv.c sger.c snrm2.c srot.c \ ! srotg.c srotm.c srotmg.c ssbmv.c sscal.c sspmv.c sspr.c \ ! sspr2.c sswap.c ssymm.c ssymv.c ssyr.c ssyr2.c ssyr2k.c \ ! ssyrk.c stbmv.c stbsv.c stpmv.c stpsv.c strmm.c strmv.c \ ! strsm.c strsv.c dasum.c daxpy.c dcopy.c ddot.c dgbmv.c dgemm.c \ ! dgemv.c dger.c dnrm2.c drot.c drotg.c drotm.c drotmg.c dsbmv.c \ ! dscal.c dsdot.c dspmv.c dspr.c dspr2.c dswap.c dsymm.c dsymv.c \ ! dsyr.c dsyr2.c dsyr2k.c dsyrk.c dtbmv.c dtbsv.c dtpmv.c \ ! dtpsv.c dtrmm.c dtrmv.c dtrsm.c dtrsv.c dzasum.c dznrm2.c \ ! caxpy.c ccopy.c cdotc_sub.c cdotu_sub.c cgbmv.c cgemm.c \ ! cgemv.c cgerc.c cgeru.c chbmv.c chemm.c chemv.c cher.c cher2.c \ ! cher2k.c cherk.c chpmv.c chpr.c chpr2.c cscal.c csscal.c \ ! cswap.c csymm.c csyr2k.c csyrk.c ctbmv.c ctbsv.c ctpmv.c \ ! ctpsv.c ctrmm.c ctrmv.c ctrsm.c ctrsv.c zaxpy.c zcopy.c \ ! zdotc_sub.c zdotu_sub.c zdscal.c zgbmv.c zgemm.c zgemv.c \ ! zgerc.c zgeru.c zhbmv.c zhemm.c zhemv.c zher.c zher2.c \ ! zher2k.c zherk.c zhpmv.c zhpr.c zhpr2.c zscal.c zswap.c \ ! zsymm.c zsyr2k.c zsyrk.c ztbmv.c ztbsv.c ztpmv.c ztpsv.c \ ! ztrmm.c ztrmv.c ztrsm.c ztrsv.c icamax.c idamax.c isamax.c \ ! izamax.c xerbla.c ! noinst_HEADERS = tests.c tests.h cblas.h source_asum_c.h \ ! source_asum_r.h source_axpy_c.h source_axpy_r.h \ ! source_copy_c.h source_copy_r.h source_dot_c.h source_dot_r.h \ ! source_gbmv_c.h source_gbmv_r.h source_gemm_c.h \ ! source_gemm_r.h source_gemv_c.h source_gemv_r.h source_ger.h \ ! source_gerc.h source_geru.h source_hbmv.h source_hemm.h \ ! source_hemv.h source_her.h source_her2.h source_her2k.h \ ! source_herk.h source_hpmv.h source_hpr.h source_hpr2.h \ ! source_iamax_c.h source_iamax_r.h source_nrm2_c.h \ ! source_nrm2_r.h source_rot.h source_rotg.h source_rotm.h \ ! source_rotmg.h source_sbmv.h source_scal_c.h source_scal_c_s.h \ ! source_scal_r.h source_spmv.h source_spr.h source_spr2.h \ ! source_swap_c.h source_swap_r.h source_symm_c.h \ ! source_symm_r.h source_symv.h source_syr.h source_syr2.h \ ! source_syr2k_c.h source_syr2k_r.h source_syrk_c.h \ ! source_syrk_r.h source_tbmv_c.h source_tbmv_r.h \ ! source_tbsv_c.h source_tbsv_r.h source_tpmv_c.h \ ! source_tpmv_r.h source_tpsv_c.h source_tpsv_r.h \ ! source_trmm_c.h source_trmm_r.h source_trmv_c.h \ ! source_trmv_r.h source_trsm_c.h source_trsm_r.h \ ! source_trsv_c.h source_trsv_r.h hypot.c TESTS = $(check_PROGRAMS) test_LDADD = libgslcblas.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la test_SOURCES = test.c test_amax.c test_asum.c test_axpy.c test_copy.c test_dot.c test_gbmv.c test_gemm.c test_gemv.c test_ger.c test_hbmv.c test_hemm.c test_hemv.c test_her.c test_her2.c test_her2k.c test_herk.c test_hpmv.c test_hpr.c test_hpr2.c test_nrm2.c test_rot.c test_rotg.c test_rotm.c test_rotmg.c test_sbmv.c test_scal.c test_spmv.c test_spr.c test_spr2.c test_swap.c test_symm.c test_symv.c test_syr.c test_syr2.c test_syr2k.c test_syrk.c test_tbmv.c test_tbsv.c test_tpmv.c test_tpsv.c test_trmm.c test_trmv.c test_trsm.c test_trsv.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps cblas/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps cblas/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) ! test -z "$(libdir)" || $(mkdir_p) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ ! f=$(am__strip_dir) \ ! echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) '$$p' '$(DESTDIR)$(libdir)/$$f'"; \ ! $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) "$$p" "$(DESTDIR)$(libdir)/$$f"; \ else :; fi; \ done *************** *** 249,256 **** uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) ! @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ ! p="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(LIBTOOL) --mode=uninstall rm -f $(DESTDIR)$(libdir)/$$p"; \ ! $(LIBTOOL) --mode=uninstall rm -f $(DESTDIR)$(libdir)/$$p; \ done --- 321,328 ---- uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) ! @set -x; list='$(lib_LTLIBRARIES)'; for p in $$list; do \ ! p=$(am__strip_dir) \ ! echo " $(LIBTOOL) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$p'"; \ ! $(LIBTOOL) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$p"; \ done *************** *** 259,263 **** @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 331,335 ---- @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 277,281 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 349,353 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 283,293 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 355,365 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 300,312 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 372,383 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 314,330 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 385,393 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 335,338 **** --- 398,402 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 346,353 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 410,418 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 386,395 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 451,460 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 398,407 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 463,472 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 428,432 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 493,497 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 434,438 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 499,503 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 440,452 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 505,513 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 462,466 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 523,527 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 482,488 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(libdir) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 543,550 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 496,500 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 558,562 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 504,508 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 566,570 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 515,519 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 577,581 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 523,526 **** --- 585,590 ---- dvi-am: + html: html-am + info: info-am *************** *** 538,542 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 602,606 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 561,569 **** clean-libtool ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-libLTLIBRARIES install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ --- 625,633 ---- clean-libtool ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-libLTLIBRARIES \ ! install-man install-pkgincludeHEADERS install-strip \ ! installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ diff -rc2P gsl-1.6/cblas/gsl_cblas.h gsl-1.7/cblas/gsl_cblas.h *** gsl-1.6/cblas/gsl_cblas.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/gsl_cblas.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_asum_c.h gsl-1.7/cblas/source_asum_c.h *** gsl-1.6/cblas/source_asum_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_asum_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_asum_r.h gsl-1.7/cblas/source_asum_r.h *** gsl-1.6/cblas/source_asum_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_asum_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_axpy_c.h gsl-1.7/cblas/source_axpy_c.h *** gsl-1.6/cblas/source_axpy_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_axpy_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_axpy_r.h gsl-1.7/cblas/source_axpy_r.h *** gsl-1.6/cblas/source_axpy_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_axpy_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_copy_c.h gsl-1.7/cblas/source_copy_c.h *** gsl-1.6/cblas/source_copy_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_copy_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_copy_r.h gsl-1.7/cblas/source_copy_r.h *** gsl-1.6/cblas/source_copy_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_copy_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_dot_c.h gsl-1.7/cblas/source_dot_c.h *** gsl-1.6/cblas/source_dot_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_dot_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_dot_r.h gsl-1.7/cblas/source_dot_r.h *** gsl-1.6/cblas/source_dot_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_dot_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gbmv_c.h gsl-1.7/cblas/source_gbmv_c.h *** gsl-1.6/cblas/source_gbmv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gbmv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gbmv_r.h gsl-1.7/cblas/source_gbmv_r.h *** gsl-1.6/cblas/source_gbmv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gbmv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gemm_c.h gsl-1.7/cblas/source_gemm_c.h *** gsl-1.6/cblas/source_gemm_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gemm_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gemm_r.h gsl-1.7/cblas/source_gemm_r.h *** gsl-1.6/cblas/source_gemm_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gemm_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gemv_c.h gsl-1.7/cblas/source_gemv_c.h *** gsl-1.6/cblas/source_gemv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gemv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gemv_r.h gsl-1.7/cblas/source_gemv_r.h *** gsl-1.6/cblas/source_gemv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gemv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_ger.h gsl-1.7/cblas/source_ger.h *** gsl-1.6/cblas/source_ger.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_ger.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_gerc.h gsl-1.7/cblas/source_gerc.h *** gsl-1.6/cblas/source_gerc.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_gerc.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_geru.h gsl-1.7/cblas/source_geru.h *** gsl-1.6/cblas/source_geru.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_geru.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hbmv.h gsl-1.7/cblas/source_hbmv.h *** gsl-1.6/cblas/source_hbmv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hbmv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hemm.h gsl-1.7/cblas/source_hemm.h *** gsl-1.6/cblas/source_hemm.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hemm.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hemv.h gsl-1.7/cblas/source_hemv.h *** gsl-1.6/cblas/source_hemv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hemv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_her.h gsl-1.7/cblas/source_her.h *** gsl-1.6/cblas/source_her.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_her.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_her2.h gsl-1.7/cblas/source_her2.h *** gsl-1.6/cblas/source_her2.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_her2.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_her2k.h gsl-1.7/cblas/source_her2k.h *** gsl-1.6/cblas/source_her2k.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_her2k.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_herk.h gsl-1.7/cblas/source_herk.h *** gsl-1.6/cblas/source_herk.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_herk.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hpmv.h gsl-1.7/cblas/source_hpmv.h *** gsl-1.6/cblas/source_hpmv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hpmv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hpr.h gsl-1.7/cblas/source_hpr.h *** gsl-1.6/cblas/source_hpr.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hpr.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_hpr2.h gsl-1.7/cblas/source_hpr2.h *** gsl-1.6/cblas/source_hpr2.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_hpr2.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_iamax_c.h gsl-1.7/cblas/source_iamax_c.h *** gsl-1.6/cblas/source_iamax_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_iamax_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_iamax_r.h gsl-1.7/cblas/source_iamax_r.h *** gsl-1.6/cblas/source_iamax_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_iamax_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_nrm2_c.h gsl-1.7/cblas/source_nrm2_c.h *** gsl-1.6/cblas/source_nrm2_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_nrm2_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_nrm2_r.h gsl-1.7/cblas/source_nrm2_r.h *** gsl-1.6/cblas/source_nrm2_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_nrm2_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_rot.h gsl-1.7/cblas/source_rot.h *** gsl-1.6/cblas/source_rot.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_rot.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_rotg.h gsl-1.7/cblas/source_rotg.h *** gsl-1.6/cblas/source_rotg.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_rotg.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_rotm.h gsl-1.7/cblas/source_rotm.h *** gsl-1.6/cblas/source_rotm.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_rotm.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_rotmg.h gsl-1.7/cblas/source_rotmg.h *** gsl-1.6/cblas/source_rotmg.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_rotmg.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_sbmv.h gsl-1.7/cblas/source_sbmv.h *** gsl-1.6/cblas/source_sbmv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_sbmv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_scal_c.h gsl-1.7/cblas/source_scal_c.h *** gsl-1.6/cblas/source_scal_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_scal_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_scal_c_s.h gsl-1.7/cblas/source_scal_c_s.h *** gsl-1.6/cblas/source_scal_c_s.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_scal_c_s.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_scal_r.h gsl-1.7/cblas/source_scal_r.h *** gsl-1.6/cblas/source_scal_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_scal_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_spmv.h gsl-1.7/cblas/source_spmv.h *** gsl-1.6/cblas/source_spmv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_spmv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_spr.h gsl-1.7/cblas/source_spr.h *** gsl-1.6/cblas/source_spr.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_spr.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_spr2.h gsl-1.7/cblas/source_spr2.h *** gsl-1.6/cblas/source_spr2.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_spr2.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_swap_c.h gsl-1.7/cblas/source_swap_c.h *** gsl-1.6/cblas/source_swap_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_swap_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_swap_r.h gsl-1.7/cblas/source_swap_r.h *** gsl-1.6/cblas/source_swap_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_swap_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_symm_c.h gsl-1.7/cblas/source_symm_c.h *** gsl-1.6/cblas/source_symm_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_symm_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_symm_r.h gsl-1.7/cblas/source_symm_r.h *** gsl-1.6/cblas/source_symm_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_symm_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_symv.h gsl-1.7/cblas/source_symv.h *** gsl-1.6/cblas/source_symv.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_symv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syr.h gsl-1.7/cblas/source_syr.h *** gsl-1.6/cblas/source_syr.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syr.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syr2.h gsl-1.7/cblas/source_syr2.h *** gsl-1.6/cblas/source_syr2.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syr2.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syr2k_c.h gsl-1.7/cblas/source_syr2k_c.h *** gsl-1.6/cblas/source_syr2k_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syr2k_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syr2k_r.h gsl-1.7/cblas/source_syr2k_r.h *** gsl-1.6/cblas/source_syr2k_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syr2k_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syrk_c.h gsl-1.7/cblas/source_syrk_c.h *** gsl-1.6/cblas/source_syrk_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syrk_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_syrk_r.h gsl-1.7/cblas/source_syrk_r.h *** gsl-1.6/cblas/source_syrk_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_syrk_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tbmv_c.h gsl-1.7/cblas/source_tbmv_c.h *** gsl-1.6/cblas/source_tbmv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tbmv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tbmv_r.h gsl-1.7/cblas/source_tbmv_r.h *** gsl-1.6/cblas/source_tbmv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tbmv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tbsv_c.h gsl-1.7/cblas/source_tbsv_c.h *** gsl-1.6/cblas/source_tbsv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tbsv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tbsv_r.h gsl-1.7/cblas/source_tbsv_r.h *** gsl-1.6/cblas/source_tbsv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tbsv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tpmv_c.h gsl-1.7/cblas/source_tpmv_c.h *** gsl-1.6/cblas/source_tpmv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tpmv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tpmv_r.h gsl-1.7/cblas/source_tpmv_r.h *** gsl-1.6/cblas/source_tpmv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tpmv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tpsv_c.h gsl-1.7/cblas/source_tpsv_c.h *** gsl-1.6/cblas/source_tpsv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tpsv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_tpsv_r.h gsl-1.7/cblas/source_tpsv_r.h *** gsl-1.6/cblas/source_tpsv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_tpsv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trmm_c.h gsl-1.7/cblas/source_trmm_c.h *** gsl-1.6/cblas/source_trmm_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trmm_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trmm_r.h gsl-1.7/cblas/source_trmm_r.h *** gsl-1.6/cblas/source_trmm_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trmm_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trmv_c.h gsl-1.7/cblas/source_trmv_c.h *** gsl-1.6/cblas/source_trmv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trmv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trmv_r.h gsl-1.7/cblas/source_trmv_r.h *** gsl-1.6/cblas/source_trmv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trmv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trsm_c.h gsl-1.7/cblas/source_trsm_c.h *** gsl-1.6/cblas/source_trsm_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trsm_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trsm_r.h gsl-1.7/cblas/source_trsm_r.h *** gsl-1.6/cblas/source_trsm_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trsm_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trsv_c.h gsl-1.7/cblas/source_trsv_c.h *** gsl-1.6/cblas/source_trsv_c.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trsv_c.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/source_trsv_r.h gsl-1.7/cblas/source_trsv_r.h *** gsl-1.6/cblas/source_trsv_r.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/cblas/source_trsv_r.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/test.c gsl-1.7/cblas/test.c *** gsl-1.6/cblas/test.c Fri Jul 25 15:18:08 2003 --- gsl-1.7/cblas/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cblas/xerbla.c gsl-1.7/cblas/xerbla.c *** gsl-1.6/cblas/xerbla.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cblas/xerbla.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/ChangeLog gsl-1.7/cdf/ChangeLog *** gsl-1.6/cdf/ChangeLog Fri Nov 12 17:17:25 2004 --- gsl-1.7/cdf/ChangeLog Wed Jun 22 14:53:06 2005 *************** *** 1,2 **** --- 1,7 ---- + 2005-06-20 Brian Gough + + * test.c: removed tests using subnormal values, since they tend to + fail when extended precision registers are not available. + 2004-10-26 Brian Gough diff -rc2P gsl-1.6/cdf/Makefile.in gsl-1.7/cdf/Makefile.in *** gsl-1.6/cdf/Makefile.in Fri Dec 31 15:15:22 2004 --- gsl-1.7/cdf/Makefile.in Tue Sep 13 10:04:37 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,94 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = cdf + DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \ + $(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslcdf_la_LIBADD = + am_libgslcdf_la_OBJECTS = beta.lo cauchy.lo cauchyinv.lo chisq.lo \ + chisqinv.lo exponential.lo exponentialinv.lo exppow.lo \ + fdist.lo flat.lo flatinv.lo gamma.lo gammainv.lo gauss.lo \ + gaussinv.lo gumbel1.lo gumbel1inv.lo gumbel2.lo gumbel2inv.lo \ + laplace.lo laplaceinv.lo logistic.lo logisticinv.lo \ + lognormal.lo lognormalinv.lo pareto.lo paretoinv.lo \ + rayleigh.lo rayleighinv.lo tdist.lo tdistinv.lo weibull.lo \ + weibullinv.lo + libgslcdf_la_OBJECTS = $(am_libgslcdf_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslcdf.la ../randist/libgslrandist.la \ + ../rng/libgslrng.la ../specfunc/libgslspecfunc.la \ + ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ + ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslcdf_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslcdf_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 168,173 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 190,194 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,212 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcdf.la - pkginclude_HEADERS = gsl_cdf.h - INCLUDES = -I$(top_builddir) - libgslcdf_la_SOURCES = beta.c cauchy.c cauchyinv.c chisq.c chisqinv.c exponential.c exponentialinv.c exppow.c fdist.c flat.c flatinv.c gamma.c gammainv.c gauss.c gaussinv.c gumbel1.c gumbel1inv.c gumbel2.c gumbel2inv.c laplace.c laplaceinv.c logistic.c logisticinv.c lognormal.c lognormalinv.c pareto.c paretoinv.c rayleigh.c rayleighinv.c tdist.c tdistinv.c weibull.c weibullinv.c - noinst_HEADERS = beta_inc.c rat_eval.h test_auto.c - TESTS = $(check_PROGRAMS) - - check_PROGRAMS = test - test_SOURCES = test.c test_LDADD = libgslcdf.la ../randist/libgslrandist.la ../rng/libgslrng.la ../specfunc/libgslspecfunc.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - subdir = cdf - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslcdf_la_LDFLAGS = - libgslcdf_la_LIBADD = - am_libgslcdf_la_OBJECTS = beta.lo cauchy.lo cauchyinv.lo chisq.lo \ - chisqinv.lo exponential.lo exponentialinv.lo exppow.lo fdist.lo \ - flat.lo flatinv.lo gamma.lo gammainv.lo gauss.lo gaussinv.lo \ - gumbel1.lo gumbel1inv.lo gumbel2.lo gumbel2inv.lo laplace.lo \ - laplaceinv.lo logistic.lo logisticinv.lo lognormal.lo \ - lognormalinv.lo pareto.lo paretoinv.lo rayleigh.lo \ - rayleighinv.lo tdist.lo tdistinv.lo weibull.lo weibullinv.lo - libgslcdf_la_OBJECTS = $(am_libgslcdf_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslcdf.la ../randist/libgslrandist.la \ - ../rng/libgslrng.la ../specfunc/libgslspecfunc.la \ - ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ - ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslcdf_la_SOURCES) $(test_SOURCES) - HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) - - DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) ChangeLog \ - Makefile.am Makefile.in - SOURCES = $(libgslcdf_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu cdf/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 199,242 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcdf.la pkginclude_HEADERS = gsl_cdf.h INCLUDES = -I$(top_builddir) libgslcdf_la_SOURCES = beta.c cauchy.c cauchyinv.c chisq.c chisqinv.c exponential.c exponentialinv.c exppow.c fdist.c flat.c flatinv.c gamma.c gammainv.c gauss.c gaussinv.c gumbel1.c gumbel1inv.c gumbel2.c gumbel2inv.c laplace.c laplaceinv.c logistic.c logisticinv.c lognormal.c lognormalinv.c pareto.c paretoinv.c rayleigh.c rayleighinv.c tdist.c tdistinv.c weibull.c weibullinv.c noinst_HEADERS = beta_inc.c rat_eval.h test_auto.c TESTS = $(check_PROGRAMS) test_SOURCES = test.c test_LDADD = libgslcdf.la ../randist/libgslrandist.la ../rng/libgslrng.la ../specfunc/libgslspecfunc.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps cdf/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps cdf/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 214,218 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 244,248 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 232,236 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 262,266 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 238,248 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 268,278 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 255,267 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 285,296 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 269,285 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 298,306 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 290,293 **** --- 311,315 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 301,308 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 323,331 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 341,350 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 364,373 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 353,362 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 376,385 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 383,387 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 406,410 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 389,393 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 412,416 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 395,407 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 418,426 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 417,421 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 436,440 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 437,443 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 456,463 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 451,455 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 471,475 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 459,463 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 479,483 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 470,474 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 490,494 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 478,481 **** --- 498,503 ---- dvi-am: + html: html-am + info: info-am *************** *** 493,497 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 515,519 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 515,525 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 537,548 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/cdf/beta_inc.c gsl-1.7/cdf/beta_inc.c *** gsl-1.6/cdf/beta_inc.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/beta_inc.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/cauchy.c gsl-1.7/cdf/cauchy.c *** gsl-1.6/cdf/cauchy.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/cauchy.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/cauchyinv.c gsl-1.7/cdf/cauchyinv.c *** gsl-1.6/cdf/cauchyinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/cauchyinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/exponential.c gsl-1.7/cdf/exponential.c *** gsl-1.6/cdf/exponential.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/exponential.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/exponentialinv.c gsl-1.7/cdf/exponentialinv.c *** gsl-1.6/cdf/exponentialinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/exponentialinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/exppow.c gsl-1.7/cdf/exppow.c *** gsl-1.6/cdf/exppow.c Fri Nov 12 17:17:25 2004 --- gsl-1.7/cdf/exppow.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/flat.c gsl-1.7/cdf/flat.c *** gsl-1.6/cdf/flat.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/flat.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/flatinv.c gsl-1.7/cdf/flatinv.c *** gsl-1.6/cdf/flatinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/flatinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/gumbel1.c gsl-1.7/cdf/gumbel1.c *** gsl-1.6/cdf/gumbel1.c Sun Jul 27 19:43:08 2003 --- gsl-1.7/cdf/gumbel1.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/gumbel1inv.c gsl-1.7/cdf/gumbel1inv.c *** gsl-1.6/cdf/gumbel1inv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/gumbel1inv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/gumbel2.c gsl-1.7/cdf/gumbel2.c *** gsl-1.6/cdf/gumbel2.c Sun Jul 27 17:15:32 2003 --- gsl-1.7/cdf/gumbel2.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/gumbel2inv.c gsl-1.7/cdf/gumbel2inv.c *** gsl-1.6/cdf/gumbel2inv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/gumbel2inv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/laplace.c gsl-1.7/cdf/laplace.c *** gsl-1.6/cdf/laplace.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/laplace.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/laplaceinv.c gsl-1.7/cdf/laplaceinv.c *** gsl-1.6/cdf/laplaceinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/laplaceinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/logistic.c gsl-1.7/cdf/logistic.c *** gsl-1.6/cdf/logistic.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/logistic.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/logisticinv.c gsl-1.7/cdf/logisticinv.c *** gsl-1.6/cdf/logisticinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/logisticinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/lognormal.c gsl-1.7/cdf/lognormal.c *** gsl-1.6/cdf/lognormal.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/lognormal.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/lognormalinv.c gsl-1.7/cdf/lognormalinv.c *** gsl-1.6/cdf/lognormalinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/lognormalinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/pareto.c gsl-1.7/cdf/pareto.c *** gsl-1.6/cdf/pareto.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/pareto.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/paretoinv.c gsl-1.7/cdf/paretoinv.c *** gsl-1.6/cdf/paretoinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/paretoinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/rayleigh.c gsl-1.7/cdf/rayleigh.c *** gsl-1.6/cdf/rayleigh.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/rayleigh.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/rayleighinv.c gsl-1.7/cdf/rayleighinv.c *** gsl-1.6/cdf/rayleighinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/rayleighinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/test.c gsl-1.7/cdf/test.c *** gsl-1.6/cdf/test.c Fri Nov 12 17:17:25 2004 --- gsl-1.7/cdf/test.c Wed Jun 22 14:53:06 2005 *************** *** 119,123 **** TEST (gsl_cdf_ugaussian_P, (-10.0), 7.619853024160526065973343257e-24, TEST_TOL3); TEST (gsl_cdf_ugaussian_P, (-30.0), 4.906713927148187059533809288e-198, TEST_TOL3); - TEST (gsl_cdf_ugaussian_P, (-40.0), 3.655893540915029703748985850e-350, TEST_TOL3); TEST (gsl_cdf_ugaussian_P, (-1e10), 0.0, 0.0); --- 119,122 ---- *************** *** 131,135 **** TEST (gsl_cdf_ugaussian_Q, (10.0), 7.619853024160526065973343257e-24, TEST_TOL3); TEST (gsl_cdf_ugaussian_Q, (30.0), 4.906713927148187059533809288e-198, TEST_TOL3); - TEST (gsl_cdf_ugaussian_Q, (40.0), 3.655893540915029703748985850e-350, TEST_TOL3); TEST (gsl_cdf_ugaussian_Q, (1e10), 0.0, 0.0); --- 130,133 ---- *************** *** 549,553 **** TEST (gsl_cdf_fdist_Q, (10.0, 200.0, 500.0), 5.98048337181948436e-96, TEST_TOL6); TEST (gsl_cdf_fdist_Q, (20.0, 200.0, 500.0), 2.92099265879979502e-155, TEST_TOL6); - TEST (gsl_cdf_fdist_Q, (100.0, 200.0, 500.0), 6.53118977244362760e-316, 0.0); TEST (gsl_cdf_fdist_Q, (1000.0, 200.0, 500.0), 0.0, 0.0); TEST (gsl_cdf_fdist_Q, (10000.0, 200.0, 500.0), 0.0, 0.0); --- 547,550 ---- diff -rc2P gsl-1.6/cdf/weibull.c gsl-1.7/cdf/weibull.c *** gsl-1.6/cdf/weibull.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/weibull.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cdf/weibullinv.c gsl-1.7/cdf/weibullinv.c *** gsl-1.6/cdf/weibullinv.c Fri Jul 25 15:18:09 2003 --- gsl-1.7/cdf/weibullinv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/Makefile.in gsl-1.7/cheb/Makefile.in *** gsl-1.6/cheb/Makefile.in Fri Dec 31 15:15:22 2004 --- gsl-1.7/cheb/Makefile.in Tue Sep 13 10:04:38 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = cheb + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslcheb_la_LIBADD = + am_libgslcheb_la_OBJECTS = deriv.lo eval.lo init.lo integ.lo + libgslcheb_la_OBJECTS = $(am_libgslcheb_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslcheb.la ../ieee-utils/libgslieeeutils.la \ + ../test/libgsltest.la ../sys/libgslsys.la ../err/libgslerr.la \ + ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslcheb_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslcheb_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,203 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcheb.la - pkginclude_HEADERS = gsl_chebyshev.h - INCLUDES = -I$(top_builddir) - libgslcheb_la_SOURCES = deriv.c eval.c init.c integ.c - TESTS = $(check_PROGRAMS) - - check_PROGRAMS = test - test_LDADD = libgslcheb.la ../ieee-utils/libgslieeeutils.la ../test/libgsltest.la ../sys/libgslsys.la ../err/libgslerr.la ../utils/libutils.la - test_SOURCES = test.c - subdir = cheb - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslcheb_la_LDFLAGS = - libgslcheb_la_LIBADD = - am_libgslcheb_la_OBJECTS = deriv.lo eval.lo init.lo integ.lo - libgslcheb_la_OBJECTS = $(am_libgslcheb_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslcheb.la ../ieee-utils/libgslieeeutils.la \ - ../test/libgsltest.la ../sys/libgslsys.la ../err/libgslerr.la \ - ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslcheb_la_SOURCES) $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in - SOURCES = $(libgslcheb_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu cheb/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,233 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcheb.la pkginclude_HEADERS = gsl_chebyshev.h INCLUDES = -I$(top_builddir) libgslcheb_la_SOURCES = deriv.c eval.c init.c integ.c TESTS = $(check_PROGRAMS) test_LDADD = libgslcheb.la ../ieee-utils/libgslieeeutils.la ../test/libgsltest.la ../sys/libgslsys.la ../err/libgslerr.la ../utils/libutils.la test_SOURCES = test.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps cheb/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps cheb/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 205,209 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 235,239 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 223,227 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 253,257 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 229,239 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 259,269 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 246,258 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 276,287 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 260,276 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 289,297 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 281,284 **** --- 302,306 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 292,299 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 314,322 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 332,341 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 355,364 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 344,353 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 367,376 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 374,378 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 397,401 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 380,384 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 403,407 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 386,398 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 409,417 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 408,412 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 427,431 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 428,434 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 447,454 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 442,446 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 462,466 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 450,454 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 470,474 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 461,465 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 481,485 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 469,472 **** --- 489,494 ---- dvi-am: + html: html-am + info: info-am *************** *** 484,488 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 506,510 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 506,516 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 528,539 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/cheb/deriv.c gsl-1.7/cheb/deriv.c *** gsl-1.6/cheb/deriv.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/cheb/deriv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/eval.c gsl-1.7/cheb/eval.c *** gsl-1.6/cheb/eval.c Fri Dec 24 20:45:02 2004 --- gsl-1.7/cheb/eval.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/gsl_chebyshev.h gsl-1.7/cheb/gsl_chebyshev.h *** gsl-1.6/cheb/gsl_chebyshev.h Wed Dec 29 16:41:26 2004 --- gsl-1.7/cheb/gsl_chebyshev.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/init.c gsl-1.7/cheb/init.c *** gsl-1.6/cheb/init.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/cheb/init.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/integ.c gsl-1.7/cheb/integ.c *** gsl-1.6/cheb/integ.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/cheb/integ.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/cheb/test.c gsl-1.7/cheb/test.c *** gsl-1.6/cheb/test.c Sat Sep 11 14:10:00 2004 --- gsl-1.7/cheb/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/combination/Makefile.in gsl-1.7/combination/Makefile.in *** gsl-1.6/combination/Makefile.in Fri Dec 31 15:15:22 2004 --- gsl-1.7/combination/Makefile.in Tue Sep 13 10:04:39 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,87 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = combination + DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \ + $(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslcombination_la_LIBADD = + am_libgslcombination_la_OBJECTS = init.lo file.lo combination.lo + libgslcombination_la_OBJECTS = $(am_libgslcombination_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslcombination.la ../vector/libgslvector.la \ + ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la \ + ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslcombination_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslcombination_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 161,166 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 183,187 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,207 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcombination.la - pkginclude_HEADERS = gsl_combination.h - INCLUDES = -I$(top_builddir) -I$(top_srcdir) - libgslcombination_la_SOURCES = init.c file.c combination.c - noinst_HEADERS = - TESTS = $(check_PROGRAMS) - - check_PROGRAMS = test - test_SOURCES = test.c - test_LDADD = libgslcombination.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - subdir = combination - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslcombination_la_LDFLAGS = - libgslcombination_la_LIBADD = - am_libgslcombination_la_OBJECTS = init.lo file.lo combination.lo - libgslcombination_la_OBJECTS = $(am_libgslcombination_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslcombination.la ../vector/libgslvector.la \ - ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ - ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la \ - ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslcombination_la_SOURCES) $(test_SOURCES) - HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS) - - DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) ChangeLog \ - Makefile.am Makefile.in - SOURCES = $(libgslcombination_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu combination/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 192,235 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcombination.la pkginclude_HEADERS = gsl_combination.h INCLUDES = -I$(top_builddir) -I$(top_srcdir) libgslcombination_la_SOURCES = init.c file.c combination.c noinst_HEADERS = TESTS = $(check_PROGRAMS) test_SOURCES = test.c test_LDADD = libgslcombination.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps combination/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps combination/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 209,213 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 237,241 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 227,231 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 255,259 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 233,243 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 261,271 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 250,262 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 278,289 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 264,280 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 291,299 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 285,288 **** --- 304,308 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 296,303 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 316,324 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 336,345 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 357,366 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 348,357 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 369,378 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 378,382 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 399,403 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 384,388 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 405,409 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 390,402 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 411,419 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 412,416 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 429,433 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 432,438 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 449,456 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 446,450 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 464,468 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 454,458 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 472,476 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 465,469 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 483,487 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 473,476 **** --- 491,496 ---- dvi-am: + html: html-am + info: info-am *************** *** 488,492 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 508,512 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 510,520 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 530,541 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/combination/combination.c gsl-1.7/combination/combination.c *** gsl-1.6/combination/combination.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/combination/combination.c Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/combination/file.c gsl-1.7/combination/file.c *** gsl-1.6/combination/file.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/combination/file.c Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/combination/gsl_combination.h gsl-1.7/combination/gsl_combination.h *** gsl-1.6/combination/gsl_combination.h Sun Jun 6 15:47:49 2004 --- gsl-1.7/combination/gsl_combination.h Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/combination/init.c gsl-1.7/combination/init.c *** gsl-1.6/combination/init.c Wed Jul 30 09:13:50 2003 --- gsl-1.7/combination/init.c Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/combination/test.c gsl-1.7/combination/test.c *** gsl-1.6/combination/test.c Sat Jul 26 17:30:24 2003 --- gsl-1.7/combination/test.c Sun Jun 26 13:25:34 2005 *************** *** 16,20 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 16,20 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/complex/Makefile.in gsl-1.7/complex/Makefile.in *** gsl-1.6/complex/Makefile.in Fri Dec 31 15:15:24 2004 --- gsl-1.7/complex/Makefile.in Tue Sep 13 10:04:41 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = complex + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog TODO + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslcomplex_la_LIBADD = + am_libgslcomplex_la_OBJECTS = math.lo + libgslcomplex_la_OBJECTS = $(am_libgslcomplex_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslcomplex.la ../err/libgslerr.la \ + ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ + ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslcomplex_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslcomplex_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,203 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcomplex.la - pkginclude_HEADERS = gsl_complex.h gsl_complex_math.h #INCLUDES = -I$(top_builddir) -I$(top_srcdir) INCLUDES = -I$(top_srcdir) - libgslcomplex_la_SOURCES = math.c - TESTS = $(check_PROGRAMS) - check_PROGRAMS = test - test_SOURCES = test.c results.h results1.h results_real.h test_LDADD = libgslcomplex.la ../err/libgslerr.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - subdir = complex - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslcomplex_la_LDFLAGS = - libgslcomplex_la_LIBADD = - am_libgslcomplex_la_OBJECTS = math.lo - libgslcomplex_la_OBJECTS = $(am_libgslcomplex_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslcomplex.la ../err/libgslerr.la \ - ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ - ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslcomplex_la_SOURCES) $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in \ - TODO - SOURCES = $(libgslcomplex_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu complex/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,235 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslcomplex.la pkginclude_HEADERS = gsl_complex.h gsl_complex_math.h #INCLUDES = -I$(top_builddir) -I$(top_srcdir) INCLUDES = -I$(top_srcdir) libgslcomplex_la_SOURCES = math.c TESTS = $(check_PROGRAMS) test_SOURCES = test.c results.h results1.h results_real.h test_LDADD = libgslcomplex.la ../err/libgslerr.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps complex/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps complex/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 205,209 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 237,241 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 223,227 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 255,259 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 229,239 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 261,271 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 246,258 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 278,289 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 260,276 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 291,299 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 281,284 **** --- 304,308 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 292,299 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 316,324 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 332,341 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 357,366 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 344,353 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 369,378 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 374,378 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 399,403 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 380,384 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 405,409 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 386,398 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 411,419 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 408,412 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 429,433 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 428,434 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 449,456 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 442,446 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 464,468 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 450,454 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 472,476 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 461,465 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 483,487 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 469,472 **** --- 491,496 ---- dvi-am: + html: html-am + info: info-am *************** *** 484,488 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 508,512 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 506,516 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 530,541 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/complex/gsl_complex.h gsl-1.7/complex/gsl_complex.h *** gsl-1.6/complex/gsl_complex.h Fri Jul 25 15:18:17 2003 --- gsl-1.7/complex/gsl_complex.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/complex/gsl_complex_math.h gsl-1.7/complex/gsl_complex_math.h *** gsl-1.6/complex/gsl_complex_math.h Sun Jun 20 18:41:17 2004 --- gsl-1.7/complex/gsl_complex_math.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/complex/math.c gsl-1.7/complex/math.c *** gsl-1.6/complex/math.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/complex/math.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/complex/test.c gsl-1.7/complex/test.c *** gsl-1.6/complex/test.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/complex/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/config.guess gsl-1.7/config.guess *** gsl-1.6/config.guess Mon Jun 16 08:00:23 2003 --- gsl-1.7/config.guess Mon Jun 16 09:54:25 2003 *************** *** 2,8 **** # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! # 2000, 2001, 2002, 2003 Free Software Foundation, Inc. ! timestamp='2003-05-09' # This file is free software; you can redistribute it and/or modify it --- 2,8 ---- # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! # 2000, 2001, 2002 Free Software Foundation, Inc. ! timestamp='2002-10-21' # This file is free software; you can redistribute it and/or modify it *************** *** 99,113 **** # use `HOST_CC' if defined, but it is deprecated. ! # Portable tmp directory creation inspired by the Autoconf team. ! set_cc_for_build=' ! trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; ! trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; ! : ${TMPDIR=/tmp} ; ! { tmp=`(umask 077 && mktemp -d -q "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || ! { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || ! { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; ! dummy=$tmp/dummy ; ! tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; --- 99,110 ---- # use `HOST_CC' if defined, but it is deprecated. ! # This shell variable is my proudest work .. or something. --bje ! set_cc_for_build='tmpdir=${TMPDIR-/tmp}/config-guess-$$ ; ! (old=`umask` && umask 077 && mkdir $tmpdir && umask $old && unset old) ! || (echo "$me: cannot create $tmpdir" >&2 && exit 1) ; ! dummy=$tmpdir/dummy ; ! files="$dummy.c $dummy.o $dummy.rel $dummy" ; ! trap '"'"'rm -f $files; rmdir $tmpdir; exit 1'"'"' 1 2 15 ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; *************** *** 117,120 **** --- 114,118 ---- fi ; done ; + rm -f $files ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; *************** *** 123,127 **** ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; ! esac ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. --- 121,126 ---- ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; ! esac ; ! unset files' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. *************** *** 180,195 **** esac # The OS release ! # Debian GNU/NetBSD machines have a different userland, and ! # thus, need a distinct triplet. However, they do not need ! # kernel version information, so it can be replaced with a ! # suitable tag, in the style of linux-gnu. ! case "${UNAME_VERSION}" in ! Debian*) ! release='-gnu' ! ;; ! *) ! release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ! ;; ! esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: --- 179,183 ---- esac # The OS release ! release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: *************** *** 240,284 **** UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` fi - # According to Compaq, /usr/sbin/psrinfo has been available on - # OSF/1 and Tru64 systems produced since 1995. I hope that - # covers most systems running today. This code pipes the CPU - # types through head -n 1, so we only detect the type of CPU 0. - ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` - case "$ALPHA_CPU_TYPE" in - "EV4 (21064)") - UNAME_MACHINE="alpha" ;; - "EV4.5 (21064)") - UNAME_MACHINE="alpha" ;; - "LCA4 (21066/21068)") - UNAME_MACHINE="alpha" ;; - "EV5 (21164)") - UNAME_MACHINE="alphaev5" ;; - "EV5.6 (21164A)") - UNAME_MACHINE="alphaev56" ;; - "EV5.6 (21164PC)") - UNAME_MACHINE="alphapca56" ;; - "EV5.7 (21164PC)") - UNAME_MACHINE="alphapca57" ;; - "EV6 (21264)") - UNAME_MACHINE="alphaev6" ;; - "EV6.7 (21264A)") - UNAME_MACHINE="alphaev67" ;; - "EV6.8CB (21264C)") - UNAME_MACHINE="alphaev68" ;; - "EV6.8AL (21264B)") - UNAME_MACHINE="alphaev68" ;; - "EV6.8CX (21264D)") - UNAME_MACHINE="alphaev68" ;; - "EV6.9A (21264/EV69A)") - UNAME_MACHINE="alphaev69" ;; - "EV7 (21364)") - UNAME_MACHINE="alphaev7" ;; - "EV7.9 (21364A)") - UNAME_MACHINE="alphaev79" ;; - esac # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[VTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit 0 ;; --- 228,291 ---- UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` fi # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. + eval $set_cc_for_build + cat <$dummy.s + .data + \$Lformat: + .byte 37,100,45,37,120,10,0 # "%d-%x\n" + + .text + .globl main + .align 4 + .ent main + main: + .frame \$30,16,\$26,0 + ldgp \$29,0(\$27) + .prologue 1 + .long 0x47e03d80 # implver \$0 + lda \$2,-1 + .long 0x47e20c21 # amask \$2,\$1 + lda \$16,\$Lformat + mov \$0,\$17 + not \$1,\$18 + jsr \$26,printf + ldgp \$29,0(\$26) + mov 0,\$16 + jsr \$26,exit + .end main + EOF + $CC_FOR_BUILD -o $dummy $dummy.s 2>/dev/null + if test "$?" = 0 ; then + case `$dummy` in + 0-0) + UNAME_MACHINE="alpha" + ;; + 1-0) + UNAME_MACHINE="alphaev5" + ;; + 1-1) + UNAME_MACHINE="alphaev56" + ;; + 1-101) + UNAME_MACHINE="alphapca56" + ;; + 2-303) + UNAME_MACHINE="alphaev6" + ;; + 2-307) + UNAME_MACHINE="alphaev67" + ;; + 2-1307) + UNAME_MACHINE="alphaev68" + ;; + 3-1307) + UNAME_MACHINE="alphaev7" + ;; + esac + fi + rm -f $dummy.s $dummy && rmdir $tmpdir echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[VTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit 0 ;; *************** *** 433,437 **** $CC_FOR_BUILD -o $dummy $dummy.c \ && $dummy `echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` \ ! && exit 0 echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; --- 440,445 ---- $CC_FOR_BUILD -o $dummy $dummy.c \ && $dummy `echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` \ ! && rm -f $dummy.c $dummy && rmdir $tmpdir && exit 0 ! rm -f $dummy.c $dummy && rmdir $tmpdir echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; *************** *** 442,446 **** echo powerpc-harris-powermax exit 0 ;; ! Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit 0 ;; --- 450,454 ---- echo powerpc-harris-powermax exit 0 ;; ! Night_Hawk:*:*:PowerMAX_OS) echo powerpc-harris-powermax exit 0 ;; *************** *** 517,521 **** } EOF ! $CC_FOR_BUILD -o $dummy $dummy.c && $dummy && exit 0 echo rs6000-ibm-aix3.2.5 elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then --- 525,530 ---- } EOF ! $CC_FOR_BUILD -o $dummy $dummy.c && $dummy && rm -f $dummy.c $dummy && rmdir $tmpdir && exit 0 ! rm -f $dummy.c $dummy && rmdir $tmpdir echo rs6000-ibm-aix3.2.5 elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then *************** *** 616,633 **** EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` ! test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac - if [ ${HP_ARCH} = "hppa2.0w" ] - then - # avoid double evaluation of $set_cc_for_build - test -n "$CC_FOR_BUILD" || eval $set_cc_for_build - if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E -) | grep __LP64__ >/dev/null - then - HP_ARCH="hppa2.0w" - else - HP_ARCH="hppa64" - fi - fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; --- 625,632 ---- EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` ! if test -z "$HP_ARCH"; then HP_ARCH=hppa; fi ! rm -f $dummy.c $dummy && rmdir $tmpdir fi ;; esac echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; *************** *** 663,667 **** } EOF ! $CC_FOR_BUILD -o $dummy $dummy.c && $dummy && exit 0 echo unknown-hitachi-hiuxwe2 exit 0 ;; --- 662,667 ---- } EOF ! $CC_FOR_BUILD -o $dummy $dummy.c && $dummy && rm -f $dummy.c $dummy && rmdir $tmpdir && exit 0 ! rm -f $dummy.c $dummy && rmdir $tmpdir echo unknown-hitachi-hiuxwe2 exit 0 ;; *************** *** 721,724 **** --- 721,727 ---- echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; + CRAY*T3D:*:*:*) + echo alpha-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit 0 ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' *************** *** 727,733 **** echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; - *:UNICOS/mp:*:*) - echo nv1-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' - exit 0 ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` --- 730,733 ---- *************** *** 745,749 **** echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; ! *:FreeBSD:*:*|*:GNU/FreeBSD:*:*) # Determine whether the default compiler uses glibc. eval $set_cc_for_build --- 745,749 ---- echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; ! *:FreeBSD:*:*) # Determine whether the default compiler uses glibc. eval $set_cc_for_build *************** *** 757,760 **** --- 757,761 ---- EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^LIBC=` + rm -f $dummy.c && rmdir $tmpdir echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`${LIBC:+-$LIBC} exit 0 ;; *************** *** 769,776 **** exit 0 ;; x86:Interix*:3*) ! echo i586-pc-interix3 ! exit 0 ;; ! [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) ! echo i${UNAME_MACHINE}-pc-mks exit 0 ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) --- 770,774 ---- exit 0 ;; x86:Interix*:3*) ! echo i386-pc-interix3 exit 0 ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) *************** *** 778,782 **** # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? ! echo i586-pc-interix exit 0 ;; i*:UWIN*:*) --- 776,780 ---- # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? ! echo i386-pc-interix exit 0 ;; i*:UWIN*:*) *************** *** 821,844 **** EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^CPU=` ! test x"${CPU}" != x && echo "${CPU}-unknown-linux-gnu" && exit 0 ! ;; ! mips64:Linux:*:*) ! eval $set_cc_for_build ! sed 's/^ //' << EOF >$dummy.c ! #undef CPU ! #undef mips64 ! #undef mips64el ! #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) ! CPU=mips64el ! #else ! #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) ! CPU=mips64 ! #else ! CPU= ! #endif ! #endif ! EOF ! eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^CPU=` ! test x"${CPU}" != x && echo "${CPU}-unknown-linux-gnu" && exit 0 ;; ppc:Linux:*:*) --- 819,824 ---- EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^CPU=` ! rm -f $dummy.c && rmdir $tmpdir ! test x"${CPU}" != x && echo "${CPU}-pc-linux-gnu" && exit 0 ;; ppc:Linux:*:*) *************** *** 935,938 **** --- 915,919 ---- EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^LIBC=` + rm -f $dummy.c && rmdir $tmpdir test x"${LIBC}" != x && echo "${UNAME_MACHINE}-pc-linux-${LIBC}" && exit 0 test x"${TENTATIVE}" != x && echo "${TENTATIVE}" && exit 0 *************** *** 952,972 **** echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit 0 ;; - i*86:OS/2:*:*) - # If we were able to find `uname', then EMX Unix compatibility - # is probably installed. - echo ${UNAME_MACHINE}-pc-os2-emx - exit 0 ;; - i*86:XTS-300:*:STOP) - echo ${UNAME_MACHINE}-unknown-stop - exit 0 ;; - i*86:atheos:*:*) - echo ${UNAME_MACHINE}-unknown-atheos - exit 0 ;; - i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) - echo i386-unknown-lynxos${UNAME_RELEASE} - exit 0 ;; - i*86:*DOS:*:*) - echo ${UNAME_MACHINE}-pc-msdosdjgpp - exit 0 ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` --- 933,936 ---- *************** *** 1003,1006 **** --- 967,973 ---- fi exit 0 ;; + i*86:*DOS:*:*) + echo ${UNAME_MACHINE}-pc-msdosdjgpp + exit 0 ;; pc:*:*:*) # Left here for compatibility: *************** *** 1029,1038 **** echo m68k-convergent-sysv exit 0 ;; - M680?0:D-NIX:5.3:*) - echo m68k-diab-dnix - exit 0 ;; M68*:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; ! 3[34]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ --- 996,1002 ---- echo m68k-convergent-sysv exit 0 ;; M68*:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; ! 3[34]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ *************** *** 1051,1054 **** --- 1015,1021 ---- echo m68k-atari-sysv4 exit 0 ;; + i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) + echo i386-unknown-lynxos${UNAME_RELEASE} + exit 0 ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} *************** *** 1132,1140 **** exit 0 ;; *:Darwin:*:*) ! case `uname -p` in ! *86) UNAME_PROCESSOR=i686 ;; ! powerpc) UNAME_PROCESSOR=powerpc ;; ! esac ! echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit 0 ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) --- 1099,1103 ---- exit 0 ;; *:Darwin:*:*) ! echo `uname -p`-apple-darwin${UNAME_RELEASE} exit 0 ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) *************** *** 1172,1175 **** --- 1135,1143 ---- echo ${UNAME_MACHINE}-unknown-plan9 exit 0 ;; + i*86:OS/2:*:*) + # If we were able to find `uname', then EMX Unix compatibility + # is probably installed. + echo ${UNAME_MACHINE}-pc-os2-emx + exit 0 ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 *************** *** 1190,1193 **** --- 1158,1167 ---- echo pdp10-unknown-its exit 0 ;; + i*86:XTS-300:*:STOP) + echo ${UNAME_MACHINE}-unknown-stop + exit 0 ;; + i*86:atheos:*:*) + echo ${UNAME_MACHINE}-unknown-atheos + exit 0 ;; esac *************** *** 1310,1314 **** EOF ! $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && $dummy && exit 0 # Apollos put the system type in the environment. --- 1284,1289 ---- EOF ! $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && $dummy && rm -f $dummy.c $dummy && rmdir $tmpdir && exit 0 ! rm -f $dummy.c $dummy && rmdir $tmpdir # Apollos put the system type in the environment. diff -rc2P gsl-1.6/config.h.in gsl-1.7/config.h.in *** gsl-1.6/config.h.in Fri Dec 31 15:29:14 2004 --- gsl-1.7/config.h.in Tue Sep 13 10:18:05 2005 *************** *** 63,66 **** --- 63,69 ---- #undef HAVE_DOPRNT + /* Define to 1 if you have the header file. */ + #undef HAVE_IEEEFP_H + /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H diff -rc2P gsl-1.6/config.sub gsl-1.7/config.sub *** gsl-1.6/config.sub Mon Jun 16 08:00:23 2003 --- gsl-1.7/config.sub Mon Jun 16 09:54:25 2003 *************** *** 2,8 **** # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! # 2000, 2001, 2002, 2003 Free Software Foundation, Inc. ! timestamp='2003-05-09' # This file is (in principle) common to ALL GNU software. --- 2,8 ---- # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! # 2000, 2001, 2002 Free Software Foundation, Inc. ! timestamp='2002-09-05' # This file is (in principle) common to ALL GNU software. *************** *** 119,123 **** maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in ! nto-qnx* | linux-gnu* | freebsd*-gnu* | netbsd*-gnu* | storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` --- 119,123 ---- maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in ! nto-qnx* | linux-gnu* | freebsd*-gnu* | storm-chaos* | os2-emx* | windows32-* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` *************** *** 246,250 **** | mips64vr5000 | mips64vr5000el \ | mipsisa32 | mipsisa32el \ - | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64sb1 | mipsisa64sb1el \ --- 246,249 ---- *************** *** 252,256 **** | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ - | msp430 \ | ns16k | ns32k \ | openrisc | or32 \ --- 251,254 ---- *************** *** 258,262 **** | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ ! | sh | sh[1234] | sh[23]e | sh[34]eb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc86x | sparclet | sparclite | sparcv9 | sparcv9b \ --- 256,260 ---- | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ ! | sh | sh[1234] | sh3e | sh[34]eb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc86x | sparclet | sparclite | sparcv9 | sparcv9b \ *************** *** 297,301 **** | avr-* \ | bs2000-* \ ! | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ --- 295,299 ---- | avr-* \ | bs2000-* \ ! | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* \ | clipper-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ *************** *** 318,328 **** | mips64vr5000-* | mips64vr5000el-* \ | mipsisa32-* | mipsisa32el-* \ - | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ ! | mipstx39-* | mipstx39el-* \ ! | msp430-* \ ! | none-* | np1-* | nv1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ --- 316,324 ---- | mips64vr5000-* | mips64vr5000el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ ! | mipstx39 | mipstx39el \ ! | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ *************** *** 330,340 **** | pyramid-* \ | romp-* | rs6000-* \ ! | sh-* | sh[1234]-* | sh[23]e-* | sh[34]eb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc86x-* | sparclet-* | sparclite-* \ | sparcv9-* | sparcv9b-* | strongarm-* | sv1-* | sx?-* \ ! | tahoe-* | thumb-* \ ! | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ ! | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ --- 326,334 ---- | pyramid-* \ | romp-* | rs6000-* \ ! | sh-* | sh[1234]-* | sh3e-* | sh[34]eb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc86x-* | sparclet-* | sparclite-* \ | sparcv9-* | sparcv9b-* | strongarm-* | sv1-* | sx?-* \ ! | tahoe-* | thumb-* | tic30-* | tic4x-* | tic54x-* | tic80-* | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ *************** *** 374,380 **** os=-bsd ;; - amd64) - basic_machine=x86_64-pc - ;; amdahl) basic_machine=580-amdahl --- 368,371 ---- *************** *** 726,733 **** basic_machine=np1-gould ;; - nv1) - basic_machine=nv1-cray - os=-unicosmp - ;; nsr-tandem) basic_machine=nsr-tandem --- 717,720 ---- *************** *** 915,918 **** --- 902,909 ---- os=-dynix ;; + t3d) + basic_machine=alpha-cray + os=-unicos + ;; t3e) basic_machine=alphaev5-cray *************** *** 931,942 **** os=-coff ;; - tic55x | c55x*) - basic_machine=tic55x-unknown - os=-coff - ;; - tic6x | c6x*) - basic_machine=tic6x-unknown - os=-coff - ;; tx39) basic_machine=mipstx39-unknown --- 922,925 ---- *************** *** 995,998 **** --- 978,985 ---- os=-proelf ;; + windows32) + basic_machine=i386-pc + os=-windows32-msvcrt + ;; xps | xps100) basic_machine=xps100-honeywell *************** *** 1041,1045 **** basic_machine=we32k-att ;; ! sh3 | sh4 | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; --- 1028,1032 ---- basic_machine=we32k-att ;; ! sh3 | sh4 | sh3eb | sh4eb | sh[1234]le | sh3ele) basic_machine=sh-unknown ;; *************** *** 1127,1136 **** | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -uxpv* | -beos* | -mpeix* | -udk* \ ! | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ ! | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ ! | -powermax* | -dnix*) # Remember, each alternative MUST END IN *, to match a version number. ;; --- 1114,1122 ---- | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -uxpv* | -beos* | -mpeix* | -udk* \ ! | -interix* | -uwin* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ ! | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* | -powermax*) # Remember, each alternative MUST END IN *, to match a version number. ;; *************** *** 1144,1151 **** esac ;; - -nto-qnx*) - ;; -nto*) ! os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ --- 1130,1135 ---- esac ;; -nto*) ! os=-nto-qnx ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ *************** *** 1241,1250 **** os=-mint ;; - -aros*) - os=-aros - ;; - -kaos*) - os=-kaos - ;; -none) ;; --- 1225,1228 ---- diff -rc2P gsl-1.6/configure gsl-1.7/configure *** gsl-1.6/configure Fri Dec 31 15:15:46 2004 --- gsl-1.7/configure Tue Sep 13 10:17:14 2005 *************** *** 1,5 **** #! /bin/sh # Guess values for system-dependent variables and create Makefiles. ! # Generated by GNU Autoconf 2.59 for gsl 1.6. # # Copyright (C) 2003 Free Software Foundation, Inc. --- 1,5 ---- #! /bin/sh # Guess values for system-dependent variables and create Makefiles. ! # Generated by GNU Autoconf 2.59 for gsl 1.7. # # Copyright (C) 2003 Free Software Foundation, Inc. *************** *** 427,432 **** PACKAGE_NAME='gsl' PACKAGE_TARNAME='gsl' ! PACKAGE_VERSION='1.6' ! PACKAGE_STRING='gsl 1.6' PACKAGE_BUGREPORT='' --- 427,432 ---- PACKAGE_NAME='gsl' PACKAGE_TARNAME='gsl' ! PACKAGE_VERSION='1.7' ! PACKAGE_STRING='gsl 1.7' PACKAGE_BUGREPORT='' *************** *** 469,473 **** #endif" ! ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datadir sysconfdir sharedstatedir localstatedir libdir includedir oldincludedir infodir mandir build_alias host_alias target_alias DEFS ECHO_C ECHO_N ECHO_T LIBS INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA CYGPATH_W PACKAGE VERSION ACLOCAL AUTOCONF AUTOMAKE AUTOHEADER MAKEINFO AMTAR install_sh STRIP ac_ct_STRIP INSTALL_STRIP_PROGRAM AWK SET_MAKE am__leading_dot MAINTAINER_MODE_TRUE MAINTAINER_MODE_FALSE MAINT GSL_LT_VERSION GSL_LT_CBLAS_VERSION RELEASED build build_cpu build_vendor build_os host host_cpu host_vendor host_os CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT CPP LN_S RANLIB ac_ct_RANLIB AR ac_ct_AR ECHO EGREP LIBTOOL GSL_CFLAGS GSL_LIBS HAVE_INLINE LIBOBJS HAVE_PRINTF_LONGDOUBLE HAVE_EXTENDED_PRECISION_REGISTERS HAVE_GNUSPARC_IEEE_INTERFACE HAVE_GNUM68K_IEEE_INTERFACE HAVE_GNUPPC_IEEE_INTERFACE HAVE_GNUX86_IEEE_INTERFACE HAVE_SUNOS4_IEEE_INTERFACE HAVE_SOLARIS_IEEE_INTERFACE HAVE_HPUX11_IEEE_INTERFACE HAVE_HPUX_IEEE_INTERFACE HAVE_TRU64_IEEE_INTERFACE HAVE_IRIX_IEEE_INTERFACE HAVE_AIX_IEEE_INTERFACE HAVE_FREEBSD_IEEE_INTERFACE HAVE_OS2EMX_IEEE_INTERFACE HAVE_NETBSD_IEEE_INTERFACE HAVE_OPENBSD_IEEE_INTERFACE HAVE_DARWIN_IEEE_INTERFACE HAVE_IEEE_COMPARISONS HAVE_IEEE_DENORMALS LTLIBOBJS' ac_subst_files='' --- 469,473 ---- #endif" ! ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datadir sysconfdir sharedstatedir localstatedir libdir includedir oldincludedir infodir mandir build_alias host_alias target_alias DEFS ECHO_C ECHO_N ECHO_T LIBS INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA CYGPATH_W PACKAGE VERSION ACLOCAL AUTOCONF AUTOMAKE AUTOHEADER MAKEINFO install_sh STRIP ac_ct_STRIP INSTALL_STRIP_PROGRAM mkdir_p AWK SET_MAKE am__leading_dot AMTAR am__tar am__untar MAINTAINER_MODE_TRUE MAINTAINER_MODE_FALSE MAINT GSL_LT_VERSION GSL_LT_CBLAS_VERSION RELEASED build build_cpu build_vendor build_os host host_cpu host_vendor host_os CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT CPP LN_S RANLIB ac_ct_RANLIB AR ac_ct_AR ECHO EGREP LIBTOOL GSL_CFLAGS GSL_LIBS HAVE_INLINE LIBOBJS HAVE_PRINTF_LONGDOUBLE HAVE_EXTENDED_PRECISION_REGISTERS HAVE_GNUSPARC_IEEE_INTERFACE HAVE_GNUM68K_IEEE_INTERFACE HAVE_GNUPPC_IEEE_INTERFACE HAVE_GNUX86_IEEE_INTERFACE HAVE_SUNOS4_IEEE_INTERFACE HAVE_SOLARIS_IEEE_INTERFACE HAVE_HPUX11_IEEE_INTERFACE HAVE_HPUX_IEEE_INTERFACE HAVE_TRU64_IEEE_INTERFACE HAVE_IRIX_IEEE_INTERFACE HAVE_AIX_IEEE_INTERFACE HAVE_FREEBSD_IEEE_INTERFACE HAVE_OS2EMX_IEEE_INTERFACE HAVE_NETBSD_IEEE_INTERFACE HAVE_OPENBSD_IEEE_INTERFACE HAVE_DARWIN_IEEE_INTERFACE HAVE_IEEE_COMPARISONS HAVE_IEEE_DENORMALS LTLIBOBJS' ac_subst_files='' *************** *** 938,942 **** # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF ! \`configure' configures gsl 1.6 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... --- 938,942 ---- # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF ! \`configure' configures gsl 1.7 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... *************** *** 1004,1008 **** if test -n "$ac_init_help"; then case $ac_init_help in ! short | recursive ) echo "Configuration of gsl 1.6:";; esac cat <<\_ACEOF --- 1004,1008 ---- if test -n "$ac_init_help"; then case $ac_init_help in ! short | recursive ) echo "Configuration of gsl 1.7:";; esac cat <<\_ACEOF *************** *** 1011,1016 **** --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] ! --enable-maintainer-mode enable make rules and dependencies not useful ! (and sometimes confusing) to the casual installer --enable-shared=PKGS build shared libraries default=yes --enable-static=PKGS build static libraries default=yes --- 1011,1016 ---- --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] ! --enable-maintainer-mode enable make rules and dependencies not useful ! (and sometimes confusing) to the casual installer --enable-shared=PKGS build shared libraries default=yes --enable-static=PKGS build static libraries default=yes *************** *** 1131,1135 **** if $ac_init_version; then cat <<\_ACEOF ! gsl configure 1.6 generated by GNU Autoconf 2.59 --- 1131,1135 ---- if $ac_init_version; then cat <<\_ACEOF ! gsl configure 1.7 generated by GNU Autoconf 2.59 *************** *** 1145,1149 **** running configure, to aid debugging if configure makes a mistake. ! It was created by gsl $as_me 1.6, which was generated by GNU Autoconf 2.59. Invocation command line was --- 1145,1149 ---- running configure, to aid debugging if configure makes a mistake. ! It was created by gsl $as_me 1.7, which was generated by GNU Autoconf 2.59. Invocation command line was *************** *** 1483,1487 **** ! am__api_version="1.7" ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; do --- 1483,1487 ---- ! am__api_version="1.9" ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; do *************** *** 1646,1650 **** rm conftest.sed - # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` --- 1646,1649 ---- *************** *** 1660,1663 **** --- 1659,1695 ---- fi + if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then + # We used to keeping the `.' as first argument, in order to + # allow $(mkdir_p) to be used without argument. As in + # $(mkdir_p) $(somedir) + # where $(somedir) is conditionally defined. However this is wrong + # for two reasons: + # 1. if the package is installed by a user who cannot write `.' + # make install will fail, + # 2. the above comment should most certainly read + # $(mkdir_p) $(DESTDIR)$(somedir) + # so it does not work when $(somedir) is undefined and + # $(DESTDIR) is not. + # To support the latter case, we have to write + # test -z "$(somedir)" || $(mkdir_p) $(DESTDIR)$(somedir), + # so the `.' trick is pointless. + mkdir_p='mkdir -p --' + else + # On NextStep and OpenStep, the `mkdir' command does not + # recognize any option. It will interpret all options as + # directories to create, and then abort because `.' already + # exists. + for d in ./-p ./--version; + do + test -d $d && rmdir $d + done + # $(mkinstalldirs) is defined by Automake if mkinstalldirs exists. + if test -f "$ac_aux_dir/mkinstalldirs"; then + mkdir_p='$(mkinstalldirs)' + else + mkdir_p='$(install_sh) -d' + fi + fi + for ac_prog in gawk mawk nawk awk do *************** *** 1738,1742 **** rmdir .tst 2>/dev/null ! # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && test -f $srcdir/config.status; then --- 1770,1774 ---- rmdir .tst 2>/dev/null ! # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && test -f $srcdir/config.status; then *************** *** 1758,1762 **** # Define the identity of the package. PACKAGE='gsl' ! VERSION='1.6' --- 1790,1794 ---- # Define the identity of the package. PACKAGE='gsl' ! VERSION='1.7' *************** *** 1786,1792 **** MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} - - AMTAR=${AMTAR-"${am_missing_run}tar"} - install_sh=${install_sh-"$am_aux_dir/install-sh"} --- 1818,1821 ---- *************** *** 1881,1884 **** --- 1910,1920 ---- # We need awk for the "check" target. The system "awk" is bad on # some platforms. + # Always define AMTAR for backward compatibility. + + AMTAR=${AMTAR-"${am_missing_run}tar"} + + am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' + + *************** *** 1912,1916 **** ! GSL_LT_VERSION="7:0:7" GSL_LT_CBLAS_VERSION="0:0:0" --- 1948,1952 ---- ! GSL_LT_VERSION="8:0:8" GSL_LT_CBLAS_VERSION="0:0:0" *************** *** 4867,4871 **** *-*-irix6*) # Find out which ABI we are using. ! echo '#line 4869 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 --- 4903,4907 ---- *-*-irix6*) # Find out which ABI we are using. ! echo '#line 4905 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 *************** *** 5425,5429 **** CFLAGS="$CFLAGS -o out/conftest2.$ac_objext" compiler_c_o=no ! if { (eval echo configure:5427: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>out/conftest.err; } && test -s out/conftest2.$ac_objext; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings --- 5461,5465 ---- CFLAGS="$CFLAGS -o out/conftest2.$ac_objext" compiler_c_o=no ! if { (eval echo configure:5463: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>out/conftest.err; } && test -s out/conftest2.$ac_objext; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings *************** *** 7351,7355 **** lt_status=$lt_dlunknown cat > conftest.$ac_ext < conftest.$ac_ext < conftest.$ac_ext < conftest.$ac_ext <&5 + echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 + if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 + fi + echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 + echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 + else + # Is the header compilable? + echo "$as_me:$LINENO: checking $ac_header usability" >&5 + echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 + cat >conftest.$ac_ext <<_ACEOF + /* confdefs.h. */ + _ACEOF + cat confdefs.h >>conftest.$ac_ext + cat >>conftest.$ac_ext <<_ACEOF + /* end confdefs.h. */ + $ac_includes_default + #include <$ac_header> + _ACEOF + rm -f conftest.$ac_objext + if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -z "$ac_c_werror_flag" + || test ! -s conftest.err' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_header_compiler=yes + else + echo "$as_me: failed program was:" >&5 + sed 's/^/| /' conftest.$ac_ext >&5 + + ac_header_compiler=no + fi + rm -f conftest.err conftest.$ac_objext conftest.$ac_ext + echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 + echo "${ECHO_T}$ac_header_compiler" >&6 + + # Is the header present? + echo "$as_me:$LINENO: checking $ac_header presence" >&5 + echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 + cat >conftest.$ac_ext <<_ACEOF + /* confdefs.h. */ + _ACEOF + cat confdefs.h >>conftest.$ac_ext + cat >>conftest.$ac_ext <<_ACEOF + /* end confdefs.h. */ + #include <$ac_header> + _ACEOF + if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + ac_cpp_err=$ac_cpp_err$ac_c_werror_flag + else + ac_cpp_err= + fi + else + ac_cpp_err=yes + fi + if test -z "$ac_cpp_err"; then + ac_header_preproc=yes + else + echo "$as_me: failed program was:" >&5 + sed 's/^/| /' conftest.$ac_ext >&5 + + ac_header_preproc=no + fi + rm -f conftest.err conftest.$ac_ext + echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 + echo "${ECHO_T}$ac_header_preproc" >&6 + + # So? What about this header? + case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in + yes:no: ) + { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 + echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 + echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} + ac_header_preproc=yes + ;; + no:yes:* ) + { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 + echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 + echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 + echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 + echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 + echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 + echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} + ( + cat <<\_ASBOX + ## ------------------------------ ## + ## Report this to the gsl lists. ## + ## ------------------------------ ## + _ASBOX + ) | + sed "s/^/$as_me: WARNING: /" >&2 + ;; + esac + echo "$as_me:$LINENO: checking for $ac_header" >&5 + echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 + if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 + else + eval "$as_ac_Header=\$ac_header_preproc" + fi + echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 + echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 + + fi + if test `eval echo '${'$as_ac_Header'}'` = yes; then + cat >>confdefs.h <<_ACEOF + #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 + _ACEOF + + fi + + done + + *************** *** 10039,10043 **** ac_cv_c_ieee_interface=gnuppc ;; ! *86-*-linux*) ac_cv_c_ieee_interface=gnux86 ;; --- 10225,10229 ---- ac_cv_c_ieee_interface=gnuppc ;; ! *86-*-linux* | *86_64-*-linux*) ac_cv_c_ieee_interface=gnux86 ;; *************** *** 10746,10750 **** cat >&5 <<_CSEOF ! This file was extended by gsl $as_me 1.6, which was generated by GNU Autoconf 2.59. Invocation command line was --- 10932,10936 ---- cat >&5 <<_CSEOF ! This file was extended by gsl $as_me 1.7, which was generated by GNU Autoconf 2.59. Invocation command line was *************** *** 10806,10810 **** cat >>$CONFIG_STATUS <<_ACEOF ac_cs_version="\\ ! gsl config.status 1.6 configured by $0, generated by GNU Autoconf 2.59, with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\" --- 10992,10996 ---- cat >>$CONFIG_STATUS <<_ACEOF ac_cs_version="\\ ! gsl config.status 1.7 configured by $0, generated by GNU Autoconf 2.59, with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\" *************** *** 11056,11067 **** s,@AUTOHEADER@,$AUTOHEADER,;t t s,@MAKEINFO@,$MAKEINFO,;t t - s,@AMTAR@,$AMTAR,;t t s,@install_sh@,$install_sh,;t t s,@STRIP@,$STRIP,;t t s,@ac_ct_STRIP@,$ac_ct_STRIP,;t t s,@INSTALL_STRIP_PROGRAM@,$INSTALL_STRIP_PROGRAM,;t t s,@AWK@,$AWK,;t t s,@SET_MAKE@,$SET_MAKE,;t t s,@am__leading_dot@,$am__leading_dot,;t t s,@MAINTAINER_MODE_TRUE@,$MAINTAINER_MODE_TRUE,;t t s,@MAINTAINER_MODE_FALSE@,$MAINTAINER_MODE_FALSE,;t t --- 11242,11256 ---- s,@AUTOHEADER@,$AUTOHEADER,;t t s,@MAKEINFO@,$MAKEINFO,;t t s,@install_sh@,$install_sh,;t t s,@STRIP@,$STRIP,;t t s,@ac_ct_STRIP@,$ac_ct_STRIP,;t t s,@INSTALL_STRIP_PROGRAM@,$INSTALL_STRIP_PROGRAM,;t t + s,@mkdir_p@,$mkdir_p,;t t s,@AWK@,$AWK,;t t s,@SET_MAKE@,$SET_MAKE,;t t s,@am__leading_dot@,$am__leading_dot,;t t + s,@AMTAR@,$AMTAR,;t t + s,@am__tar@,$am__tar,;t t + s,@am__untar@,$am__untar,;t t s,@MAINTAINER_MODE_TRUE@,$MAINTAINER_MODE_TRUE,;t t s,@MAINTAINER_MODE_FALSE@,$MAINTAINER_MODE_FALSE,;t t diff -rc2P gsl-1.6/configure.ac gsl-1.7/configure.ac *** gsl-1.6/configure.ac Fri Dec 31 15:14:54 2004 --- gsl-1.7/configure.ac Tue Sep 13 09:45:03 2005 *************** *** 1,5 **** dnl Process this file with autoconf to produce a configure script. ! AC_INIT([gsl],[1.6]) AC_CONFIG_SRCDIR(gsl_math.h) --- 1,5 ---- dnl Process this file with autoconf to produce a configure script. ! AC_INIT([gsl],[1.7]) AC_CONFIG_SRCDIR(gsl_math.h) *************** *** 19,24 **** dnl gsl-1.5 libgsl 6:0:6 libgslcblas 0:0:0 dnl gsl-1.6 libgsl 7:0:7 libgslcblas 0:0:0 ! GSL_LT_VERSION="7:0:7" AC_SUBST(GSL_LT_VERSION) GSL_LT_CBLAS_VERSION="0:0:0" --- 19,25 ---- dnl gsl-1.5 libgsl 6:0:6 libgslcblas 0:0:0 dnl gsl-1.6 libgsl 7:0:7 libgslcblas 0:0:0 + dnl gsl-1.7 libgsl 8:0:8 libgslcblas 0:0:0 ! GSL_LT_VERSION="8:0:8" AC_SUBST(GSL_LT_VERSION) GSL_LT_CBLAS_VERSION="0:0:0" *************** *** 81,84 **** --- 82,86 ---- dnl Checks for header files. + AC_CHECK_HEADERS(ieeefp.h) dnl Checks for typedefs, structures, and compiler characteristics. *************** *** 208,212 **** ac_cv_c_ieee_interface=gnuppc ;; ! *86-*-linux*) ac_cv_c_ieee_interface=gnux86 ;; --- 210,214 ---- ac_cv_c_ieee_interface=gnuppc ;; ! *86-*-linux* | *86_64-*-linux*) ac_cv_c_ieee_interface=gnux86 ;; diff -rc2P gsl-1.6/const/Makefile.in gsl-1.7/const/Makefile.in *** gsl-1.6/const/Makefile.in Fri Dec 31 15:15:24 2004 --- gsl-1.7/const/Makefile.in Tue Sep 13 10:04:42 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 22,25 ---- *************** *** 36,40 **** --- 35,81 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = const + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog TODO + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la \ + ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(test_SOURCES) + DIST_SOURCES = $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 155,160 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 177,181 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,193 **** target_alias = @target_alias@ pkginclude_HEADERS = gsl_const.h gsl_const_cgs.h gsl_const_mks.h gsl_const_cgsm.h gsl_const_mksa.h gsl_const_num.h - INCLUDES = -I$(top_builddir) - TESTS = $(check_PROGRAMS) - - check_PROGRAMS = test - test_SOURCES = test.c - test_LDADD = ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - subdir = const - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ - ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in \ - TODO - SOURCES = $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu const/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-checkPROGRAMS: --- 186,226 ---- target_alias = @target_alias@ pkginclude_HEADERS = gsl_const.h gsl_const_cgs.h gsl_const_mks.h gsl_const_cgsm.h gsl_const_mksa.h gsl_const_num.h INCLUDES = -I$(top_builddir) TESTS = $(check_PROGRAMS) test_SOURCES = test.c test_LDADD = ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps const/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps const/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-checkPROGRAMS: *************** *** 202,206 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 235,239 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 208,218 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 241,251 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 225,237 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 258,269 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 239,255 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 271,279 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 260,263 **** --- 284,288 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 271,278 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 296,304 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 311,320 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 337,346 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 323,332 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 349,358 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 353,357 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 379,383 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 359,363 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 385,389 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 365,377 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 391,399 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 387,391 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 409,413 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 407,413 **** check: check-am all-am: Makefile $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 429,436 ---- check: check-am all-am: Makefile $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 421,425 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 444,448 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 429,433 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 452,456 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 436,443 **** clean: clean-am ! clean-am: clean-checkPROGRAMS clean-generic clean-libtool mostlyclean-am distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 459,467 ---- clean: clean-am ! clean-am: clean-checkPROGRAMS clean-generic clean-libtool \ ! mostlyclean-am distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 447,450 **** --- 471,476 ---- dvi-am: + html: html-am + info: info-am *************** *** 462,466 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 488,492 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 481,495 **** .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \ ! clean-checkPROGRAMS clean-generic clean-libtool ctags distclean \ ! distclean-compile distclean-generic distclean-libtool \ ! distclean-tags distdir dvi dvi-am info info-am install \ ! install-am install-data install-data-am install-exec \ ! install-exec-am install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ ! uninstall-pkgincludeHEADERS # Tell versions [3.59,3.63) of GNU make to not export all variables. --- 507,521 ---- .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \ ! clean-checkPROGRAMS clean-generic clean-libtool ctags \ ! distclean distclean-compile distclean-generic \ ! distclean-libtool distclean-tags distdir dvi dvi-am html \ ! html-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool \ ! pdf pdf-am ps ps-am tags uninstall uninstall-am \ ! uninstall-info-am uninstall-pkgincludeHEADERS # Tell versions [3.59,3.63) of GNU make to not export all variables. diff -rc2P gsl-1.6/const/gsl_const.h gsl-1.7/const/gsl_const.h *** gsl-1.6/const/gsl_const.h Sun Jun 20 18:41:17 2004 --- gsl-1.7/const/gsl_const.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/gsl_const_cgs.h gsl-1.7/const/gsl_const_cgs.h *** gsl-1.6/const/gsl_const_cgs.h Fri Mar 5 15:15:22 2004 --- gsl-1.7/const/gsl_const_cgs.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/gsl_const_cgsm.h gsl-1.7/const/gsl_const_cgsm.h *** gsl-1.6/const/gsl_const_cgsm.h Sun Jun 20 18:41:17 2004 --- gsl-1.7/const/gsl_const_cgsm.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/gsl_const_mks.h gsl-1.7/const/gsl_const_mks.h *** gsl-1.6/const/gsl_const_mks.h Fri Mar 5 15:15:22 2004 --- gsl-1.7/const/gsl_const_mks.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/gsl_const_mksa.h gsl-1.7/const/gsl_const_mksa.h *** gsl-1.6/const/gsl_const_mksa.h Sun Jun 20 18:41:17 2004 --- gsl-1.7/const/gsl_const_mksa.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/gsl_const_num.h gsl-1.7/const/gsl_const_num.h *** gsl-1.6/const/gsl_const_num.h Thu Nov 27 13:01:27 2003 --- gsl-1.7/const/gsl_const_num.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/const/test.c gsl-1.7/const/test.c *** gsl-1.6/const/test.c Thu May 27 12:05:35 2004 --- gsl-1.7/const/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/deriv/Makefile.in gsl-1.7/deriv/Makefile.in *** gsl-1.6/deriv/Makefile.in Fri Dec 31 15:15:25 2004 --- gsl-1.7/deriv/Makefile.in Tue Sep 13 10:04:43 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = deriv + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgslderiv_la_LIBADD = + am_libgslderiv_la_OBJECTS = deriv.lo + libgslderiv_la_OBJECTS = $(am_libgslderiv_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgslderiv.la ../vector/libgslvector.la \ + ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgslderiv_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgslderiv_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,201 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgslderiv.la - INCLUDES = -I$(top_builddir) - libgslderiv_la_SOURCES = deriv.c - pkginclude_HEADERS = gsl_deriv.h - TESTS = $(check_PROGRAMS) - check_PROGRAMS = test #demo - test_SOURCES = test.c test_LDADD = libgslderiv.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la - subdir = deriv - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgslderiv_la_LDFLAGS = - libgslderiv_la_LIBADD = - am_libgslderiv_la_OBJECTS = deriv.lo - libgslderiv_la_OBJECTS = $(am_libgslderiv_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgslderiv.la ../vector/libgslvector.la \ - ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ - ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgslderiv_la_SOURCES) $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in - SOURCES = $(libgslderiv_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu deriv/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,233 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgslderiv.la INCLUDES = -I$(top_builddir) libgslderiv_la_SOURCES = deriv.c pkginclude_HEADERS = gsl_deriv.h TESTS = $(check_PROGRAMS) test_SOURCES = test.c test_LDADD = libgslderiv.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps deriv/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps deriv/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 203,207 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 235,239 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 221,225 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 253,257 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 227,237 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 259,269 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 244,256 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 276,287 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 258,274 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 289,297 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 279,282 **** --- 302,306 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 290,297 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 314,322 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 330,339 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 355,364 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 342,351 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 367,376 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 372,376 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 397,401 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 378,382 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 403,407 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 384,396 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 409,417 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 406,410 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 427,431 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 426,432 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 447,454 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 440,444 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 462,466 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 448,452 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 470,474 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 459,463 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 481,485 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 467,470 **** --- 489,494 ---- dvi-am: + html: html-am + info: info-am *************** *** 482,486 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 506,510 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 504,514 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 528,539 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/deriv/deriv.c gsl-1.7/deriv/deriv.c *** gsl-1.6/deriv/deriv.c Sat Mar 20 23:07:20 2004 --- gsl-1.7/deriv/deriv.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/deriv/gsl_deriv.h gsl-1.7/deriv/gsl_deriv.h *** gsl-1.6/deriv/gsl_deriv.h Sat Mar 20 23:07:20 2004 --- gsl-1.7/deriv/gsl_deriv.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/deriv/test.c gsl-1.7/deriv/test.c *** gsl-1.6/deriv/test.c Sat Mar 20 23:07:20 2004 --- gsl-1.7/deriv/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/dht/Makefile.in gsl-1.7/dht/Makefile.in *** gsl-1.6/dht/Makefile.in Fri Dec 31 15:15:25 2004 --- gsl-1.7/dht/Makefile.in Tue Sep 13 10:04:44 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = dht + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgsldht_la_LIBADD = + am_libgsldht_la_OBJECTS = dht.lo + libgsldht_la_OBJECTS = $(am_libgsldht_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgsldht.la ../specfunc/libgslspecfunc.la \ + ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ + ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgsldht_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgsldht_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,203 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgsldht.la - pkginclude_HEADERS = gsl_dht.h - INCLUDES = -I$(top_builddir) - TESTS = $(check_PROGRAMS) - - check_PROGRAMS = test - test_LDADD = libgsldht.la ../specfunc/libgslspecfunc.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_SOURCES = test.c - libgsldht_la_SOURCES = dht.c - subdir = dht - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgsldht_la_LDFLAGS = - libgsldht_la_LIBADD = - am_libgsldht_la_OBJECTS = dht.lo - libgsldht_la_OBJECTS = $(am_libgsldht_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgsldht.la ../specfunc/libgslspecfunc.la \ - ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la \ - ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgsldht_la_SOURCES) $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in - SOURCES = $(libgsldht_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu dht/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,233 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgsldht.la pkginclude_HEADERS = gsl_dht.h INCLUDES = -I$(top_builddir) TESTS = $(check_PROGRAMS) test_LDADD = libgsldht.la ../specfunc/libgslspecfunc.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la test_SOURCES = test.c libgsldht_la_SOURCES = dht.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps dht/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps dht/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 205,209 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 235,239 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 223,227 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 253,257 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 229,239 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 259,269 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 246,258 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 276,287 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 260,276 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 289,297 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 281,284 **** --- 302,306 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 292,299 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 314,322 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 332,341 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 355,364 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 344,353 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 367,376 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 374,378 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 397,401 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 380,384 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 403,407 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 386,398 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 409,417 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 408,412 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 427,431 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 428,434 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 447,454 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 442,446 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 462,466 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 450,454 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 470,474 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 461,465 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 481,485 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 469,472 **** --- 489,494 ---- dvi-am: + html: html-am + info: info-am *************** *** 484,488 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 506,510 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 506,516 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 528,539 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/dht/dht.c gsl-1.7/dht/dht.c *** gsl-1.6/dht/dht.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/dht/dht.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/dht/gsl_dht.h gsl-1.7/dht/gsl_dht.h *** gsl-1.6/dht/gsl_dht.h Fri Jul 25 15:18:18 2003 --- gsl-1.7/dht/gsl_dht.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/dht/test.c gsl-1.7/dht/test.c *** gsl-1.6/dht/test.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/dht/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/diff/Makefile.in gsl-1.7/diff/Makefile.in *** gsl-1.6/diff/Makefile.in Fri Dec 31 15:15:26 2004 --- gsl-1.7/diff/Makefile.in Tue Sep 13 10:04:45 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 15,18 **** --- 15,19 ---- @SET_MAKE@ + srcdir = @srcdir@ top_srcdir = @top_srcdir@ *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 23,26 ---- *************** *** 36,40 **** --- 36,86 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + check_PROGRAMS = test$(EXEEXT) + subdir = diff + DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in ChangeLog + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + LTLIBRARIES = $(noinst_LTLIBRARIES) + libgsldiff_la_LIBADD = + am_libgsldiff_la_OBJECTS = diff.lo + libgsldiff_la_OBJECTS = $(am_libgsldiff_la_OBJECTS) + am_test_OBJECTS = test.$(OBJEXT) + test_OBJECTS = $(am_test_OBJECTS) + test_DEPENDENCIES = libgsldiff.la ../vector/libgslvector.la \ + ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ + ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la + DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) + depcomp = + am__depfiles_maybe = + COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ + $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) + LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) \ + $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ + $(AM_CFLAGS) $(CFLAGS) + CCLD = $(CC) + LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ + $(AM_LDFLAGS) $(LDFLAGS) -o $@ + SOURCES = $(libgsldiff_la_SOURCES) $(test_SOURCES) + DIST_SOURCES = $(libgsldiff_la_SOURCES) $(test_SOURCES) + am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; + am__vpath_adj = case $$p in \ + $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ + *) f=$$p;; \ + esac; + am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; + am__installdirs = "$(DESTDIR)$(pkgincludedir)" + pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) + HEADERS = $(pkginclude_HEADERS) + ETAGS = etags + CTAGS = ctags + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 160,165 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 182,186 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 142,201 **** target_alias = @target_alias@ noinst_LTLIBRARIES = libgsldiff.la - INCLUDES = -I$(top_builddir) - libgsldiff_la_SOURCES = diff.c - pkginclude_HEADERS = gsl_diff.h - TESTS = $(check_PROGRAMS) - check_PROGRAMS = test #demo - test_SOURCES = test.c test_LDADD = libgsldiff.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la - subdir = diff - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - LTLIBRARIES = $(noinst_LTLIBRARIES) - - libgsldiff_la_LDFLAGS = - libgsldiff_la_LIBADD = - am_libgsldiff_la_OBJECTS = diff.lo - libgsldiff_la_OBJECTS = $(am_libgsldiff_la_OBJECTS) - check_PROGRAMS = test$(EXEEXT) - am_test_OBJECTS = test.$(OBJEXT) - test_OBJECTS = $(am_test_OBJECTS) - test_DEPENDENCIES = libgsldiff.la ../vector/libgslvector.la \ - ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la \ - ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la - test_LDFLAGS = - - DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir) - depcomp = - am__depfiles_maybe = - COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ - $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - LTCOMPILE = $(LIBTOOL) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) \ - $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) - CCLD = $(CC) - LINK = $(LIBTOOL) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ - $(AM_LDFLAGS) $(LDFLAGS) -o $@ - DIST_SOURCES = $(libgsldiff_la_SOURCES) $(test_SOURCES) - HEADERS = $(pkginclude_HEADERS) - - DIST_COMMON = $(pkginclude_HEADERS) ChangeLog Makefile.am Makefile.in - SOURCES = $(libgsldiff_la_SOURCES) $(test_SOURCES) - all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu diff/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) clean-noinstLTLIBRARIES: --- 191,233 ---- target_alias = @target_alias@ noinst_LTLIBRARIES = libgsldiff.la INCLUDES = -I$(top_builddir) libgsldiff_la_SOURCES = diff.c pkginclude_HEADERS = gsl_diff.h TESTS = $(check_PROGRAMS) test_SOURCES = test.c test_LDADD = libgsldiff.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps diff/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps diff/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstLTLIBRARIES: *************** *** 203,207 **** @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" = "$$p" && dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ --- 235,239 ---- @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ ! test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ *************** *** 221,225 **** mostlyclean-compile: ! -rm -f *.$(OBJEXT) core *.core distclean-compile: --- 253,257 ---- mostlyclean-compile: ! -rm -f *.$(OBJEXT) distclean-compile: *************** *** 227,237 **** .c.o: ! $(COMPILE) -c `test -f '$<' || echo '$(srcdir)/'`$< .c.obj: ! $(COMPILE) -c `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(srcdir)/$<'; fi` .c.lo: ! $(LTCOMPILE) -c -o $@ `test -f '$<' || echo '$(srcdir)/'`$< mostlyclean-libtool: --- 259,269 ---- .c.o: ! $(COMPILE) -c $< .c.obj: ! $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: ! $(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: *************** *** 244,256 **** -rm -f libtool uninstall-info-am: - pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f"; \ ! $(pkgincludeHEADERS_INSTALL) $$d$$p $(DESTDIR)$(pkgincludedir)/$$f; \ done --- 276,287 ---- -rm -f libtool uninstall-info-am: install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) ! test -z "$(pkgincludedir)" || $(mkdir_p) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ ! f=$(am__strip_dir) \ ! echo " $(pkgincludeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! $(pkgincludeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgincludedir)/$$f"; \ done *************** *** 258,274 **** @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f="`echo $$p | sed -e 's|^.*/||'`"; \ ! echo " rm -f $(DESTDIR)$(pkgincludedir)/$$f"; \ ! rm -f $(DESTDIR)$(pkgincludedir)/$$f; \ done - ETAGS = etags - ETAGSFLAGS = - - CTAGS = ctags - CTAGSFLAGS = - - tags: TAGS - ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ --- 289,297 ---- @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; for p in $$list; do \ ! f=$(am__strip_dir) \ ! echo " rm -f '$(DESTDIR)$(pkgincludedir)/$$f'"; \ ! rm -f "$(DESTDIR)$(pkgincludedir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ *************** *** 279,282 **** --- 302,306 ---- END { for (i in files) print i; }'`; \ mkid -fID $$unique + tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 290,297 **** $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! test -z "$(ETAGS_ARGS)$$tags$$unique" \ ! || $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique ! ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ --- 314,322 ---- $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ ! if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ ! test -n "$$unique" || unique=$$empty_fix; \ ! $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ ! $$tags $$unique; \ ! fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ *************** *** 330,339 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ --- 355,364 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xpass=`expr $$xpass + 1`; \ ! failed=`expr $$failed + 1`; \ ! echo "XPASS: $$tst"; \ ;; \ *) \ ! echo "PASS: $$tst"; \ ;; \ esac; \ *************** *** 342,351 **** case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ --- 367,376 ---- case " $(XFAIL_TESTS) " in \ *" $$tst "*) \ ! xfail=`expr $$xfail + 1`; \ ! echo "XFAIL: $$tst"; \ ;; \ *) \ ! failed=`expr $$failed + 1`; \ ! echo "FAIL: $$tst"; \ ;; \ esac; \ *************** *** 372,376 **** if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$skipped"; \ fi; \ --- 397,401 ---- if test "$$skip" -ne 0; then \ skipped="($$skip tests were not run)"; \ ! test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ *************** *** 378,382 **** if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -gt `echo "$$banner" | wc -c` && \ dashes="$$report"; \ fi; \ --- 403,407 ---- if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ ! test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ *************** *** 384,396 **** echo "$$dashes"; \ echo "$$banner"; \ ! test -n "$$skipped" && echo "$$skipped"; \ ! test -n "$$report" && echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) --- 409,417 ---- echo "$$dashes"; \ echo "$$banner"; \ ! test -z "$$skipped" || echo "$$skipped"; \ ! test -z "$$report" || echo "$$report"; \ echo "$$dashes"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) *************** *** 406,410 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 427,431 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 426,432 **** check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(pkgincludedir) install: install-am install-exec: install-exec-am --- 447,454 ---- check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: ! for dir in "$(DESTDIR)$(pkgincludedir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 440,444 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 462,466 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 448,452 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 470,474 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 459,463 **** distclean: distclean-am ! distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags --- 481,485 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags *************** *** 467,470 **** --- 489,494 ---- dvi-am: + html: html-am + info: info-am *************** *** 482,486 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-generic --- 506,510 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic *************** *** 504,514 **** clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-pkgincludeHEADERS \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-generic mostlyclean \ ! mostlyclean-compile mostlyclean-generic mostlyclean-libtool pdf \ ! pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS --- 528,539 ---- clean-noinstLTLIBRARIES ctags distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ ! dvi-am html html-am info info-am install install-am \ ! install-data install-data-am install-exec install-exec-am \ ! install-info install-info-am install-man \ ! install-pkgincludeHEADERS install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-generic mostlyclean mostlyclean-compile \ ! mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ ! tags uninstall uninstall-am uninstall-info-am \ uninstall-pkgincludeHEADERS diff -rc2P gsl-1.6/diff/diff.c gsl-1.7/diff/diff.c *** gsl-1.6/diff/diff.c Fri Jul 25 15:18:10 2003 --- gsl-1.7/diff/diff.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/diff/gsl_diff.h gsl-1.7/diff/gsl_diff.h *** gsl-1.6/diff/gsl_diff.h Fri Jul 25 15:18:18 2003 --- gsl-1.7/diff/gsl_diff.h Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/diff/test.c gsl-1.7/diff/test.c *** gsl-1.6/diff/test.c Sat Jul 26 17:29:22 2003 --- gsl-1.7/diff/test.c Sun Jun 26 13:25:34 2005 *************** *** 15,19 **** * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ --- 15,19 ---- * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software ! * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ diff -rc2P gsl-1.6/doc/Makefile.am gsl-1.7/doc/Makefile.am *** gsl-1.6/doc/Makefile.am Sat Sep 11 13:45:32 2004 --- gsl-1.7/doc/Makefile.am Fri May 27 11:11:52 2005 *************** *** 7,11 **** man_MANS = gsl.3 gsl-config.1 gsl-randist.1 gsl-histogram.1 ! figures = multimin.eps siman-test.eps siman-energy.eps 12-cities.eps initial-route.eps final-route.eps fft-complex-radix2-f.eps fft-complex-radix2-t.eps fft-complex-radix2.eps fft-real-mixedradix.eps roots-bisection.eps roots-false-position.eps roots-newtons-method.eps roots-secant-method.eps histogram.eps histogram2d.eps min-interval.eps fit-wlinear.eps fit-wlinear2.eps fit-exp.eps ntuple.eps qrng.eps cheb.eps vdp.eps interp.eps rand-beta.tex rand-binomial.tex rand-cauchy.tex rand-chisq.tex rand-erlang.tex rand-exponential.tex rand-fdist.tex rand-flat.tex rand-gamma.tex rand-gaussian.tex rand-geometric.tex rand-laplace.tex rand-logarithmic.tex rand-logistic.tex rand-lognormal.tex rand-pareto.tex rand-poisson.tex rand-hypergeometric.tex rand-nbinomial.tex rand-pascal.tex rand-bivariate-gaussian.tex rand-rayleigh.tex rand-rayleigh-tail.tex rand-tdist.tex rand-weibull.tex random-walk.tex randplots.gnp rand-exppow.tex rand-levy.tex rand-levyskew.tex rand-gumbel.tex rand-bernoulli.tex rand-gaussian-tail.tex rand-gumbel1.tex rand-gumbel2.tex landau.dat rand-landau.tex dwt-orig.eps dwt-samp.eps examples_src = examples/blas.c examples/block.c examples/cblas.c examples/cdf.c examples/cheb.c examples/combination.c examples/const.c examples/demo_fn.c examples/diff.c examples/eigen.c examples/fft.c examples/fftmr.c examples/fftreal.c examples/fitting.c examples/fitting2.c examples/fitting3.c examples/histogram.c examples/histogram2d.c examples/ieee.c examples/ieeeround.c examples/integration.c examples/interp.c examples/intro.c examples/linalglu.c examples/matrix.c examples/matrixw.c examples/min.c examples/monte.c examples/ntupler.c examples/ntuplew.c examples/ode-initval.c examples/odefixed.c examples/permseq.c examples/permshuffle.c examples/polyroots.c examples/qrng.c examples/randpoisson.c examples/randwalk.c examples/rng.c examples/rngunif.c examples/rootnewt.c examples/roots.c examples/siman.c examples/sortsmall.c examples/specfun.c examples/specfun_e.c examples/stat.c examples/statsort.c examples/sum.c examples/vector.c examples/vectorr.c examples/vectorview.c examples/vectorw.c examples/demo_fn.h examples/dwt.c --- 7,11 ---- man_MANS = gsl.3 gsl-config.1 gsl-randist.1 gsl-histogram.1 ! figures = multimin.eps siman-test.eps siman-energy.eps 12-cities.eps initial-route.eps final-route.eps fft-complex-radix2-f.eps fft-complex-radix2-t.eps fft-complex-radix2.eps fft-real-mixedradix.eps roots-bisection.eps roots-false-position.eps roots-newtons-method.eps roots-secant-method.eps histogram.eps histogram2d.eps min-interval.eps fit-wlinear.eps fit-wlinear2.eps fit-exp.eps ntuple.eps qrng.eps cheb.eps vdp.eps interp2.eps rand-beta.tex rand-binomial.tex rand-cauchy.tex rand-chisq.tex rand-erlang.tex rand-exponential.tex rand-fdist.tex rand-flat.tex rand-gamma.tex rand-gaussian.tex rand-geometric.tex rand-laplace.tex rand-logarithmic.tex rand-logistic.tex rand-lognormal.tex rand-pareto.tex rand-poisson.tex rand-hypergeometric.tex rand-nbinomial.tex rand-pascal.tex rand-bivariate-gaussian.tex rand-rayleigh.tex rand-rayleigh-tail.tex rand-tdist.tex rand-weibull.tex random-walk.tex randplots.gnp rand-exppow.tex rand-levy.tex rand-levyskew.tex rand-gumbel.tex rand-bernoulli.tex rand-gaussian-tail.tex rand-gumbel1.tex rand-gumbel2.tex landau.dat rand-landau.tex dwt-orig.eps dwt-samp.eps examples_src = examples/blas.c examples/block.c examples/cblas.c examples/cdf.c examples/cheb.c examples/combination.c examples/const.c examples/demo_fn.c examples/diff.c examples/eigen.c examples/fft.c examples/fftmr.c examples/fftreal.c examples/fitting.c examples/fitting2.c examples/fitting3.c examples/histogram.c examples/histogram2d.c examples/ieee.c examples/ieeeround.c examples/integration.c examples/interp.c examples/intro.c examples/linalglu.c examples/matrix.c examples/matrixw.c examples/min.c examples/monte.c examples/ntupler.c examples/ntuplew.c examples/ode-initval.c examples/odefixed.c examples/permseq.c examples/permshuffle.c examples/polyroots.c examples/qrng.c examples/randpoisson.c examples/randwalk.c examples/rng.c examples/rngunif.c examples/rootnewt.c examples/roots.c examples/siman.c examples/sortsmall.c examples/specfun.c examples/specfun_e.c examples/stat.c examples/statsort.c examples/sum.c examples/vector.c examples/vectorr.c examples/vectorview.c examples/vectorw.c examples/demo_fn.h examples/dwt.c *************** *** 19,28 **** EXTRA_DIST = $(man_MANS) $(noinst_DATA) gsl-design.texi fftalgorithms.tex fftalgorithms.bib algorithm.sty algorithmic.sty calc.sty - - - - - - - - --- 19,20 ---- diff -rc2P gsl-1.6/doc/Makefile.in gsl-1.7/doc/Makefile.in *** gsl-1.6/doc/Makefile.in Fri Dec 31 15:15:26 2004 --- gsl-1.7/doc/Makefile.in Tue Sep 13 10:04:46 2005 *************** *** 1,7 **** ! # Makefile.in generated by automake 1.7.5 from Makefile.am. # @configure_input@ ! # Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 ! # Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, --- 1,7 ---- ! # Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ ! # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, ! # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, *************** *** 22,26 **** pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. - am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ --- 22,25 ---- *************** *** 36,40 **** --- 35,75 ---- PRE_UNINSTALL = : POST_UNINSTALL = : + build_triplet = @build@ host_triplet = @host@ + subdir = doc + DIST_COMMON = $(gsl_ref_TEXINFOS) $(srcdir)/Makefile.am \ + $(srcdir)/Makefile.in $(srcdir)/stamp-vti \ + $(srcdir)/version-ref.texi ChangeLog mdate-sh texinfo.tex + ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 + am__aclocal_m4_deps = $(top_srcdir)/configure.ac + am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ + $(ACLOCAL_M4) + mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs + CONFIG_HEADER = $(top_builddir)/config.h + CONFIG_CLEAN_FILES = + depcomp = + am__depfiles_maybe = + SOURCES = + DIST_SOURCES = + INFO_DEPS = $(srcdir)/gsl-ref.info + am__TEXINFO_TEX_DIR = $(srcdir) + DVIS = gsl-ref.dvi + PDFS = gsl-ref.pdf + PSS = gsl-ref.ps + HTMLS = gsl-ref.html + TEXINFOS = gsl-ref.texi + TEXI2DVI = texi2dvi + TEXI2PDF = $(TEXI2DVI) --pdf --batch + MAKEINFOHTML = $(MAKEINFO) --html + AM_MAKEINFOHTMLFLAGS = $(AM_MAKEINFOFLAGS) + DVIPS = dvips + am__installdirs = "$(DESTDIR)$(infodir)" "$(DESTDIR)$(man1dir)" \ + "$(DESTDIR)$(man3dir)" + man1dir = $(mandir)/man1 + man3dir = $(mandir)/man3 + NROFF = nroff + MANS = $(man_MANS) + DATA = $(noinst_DATA) + DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ *************** *** 114,117 **** --- 149,154 ---- ac_ct_STRIP = @ac_ct_STRIP@ am__leading_dot = @am__leading_dot@ + am__tar = @am__tar@ + am__untar = @am__untar@ bindir = @bindir@ build = @build@ *************** *** 134,137 **** --- 171,175 ---- localstatedir = @localstatedir@ mandir = @mandir@ + mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ *************** *** 141,190 **** sysconfdir = @sysconfdir@ target_alias = @target_alias@ - info_TEXINFOS = gsl-ref.texi noinst_TEXINFOS = gsl-design.texi ! gsl_ref_TEXINFOS = err.texi cblas.texi blas.texi min.texi fft.texi rng.texi randist.texi roots.texi statistics.texi specfunc.texi specfunc-airy.texi specfunc-bessel.texi specfunc-chebyshev.texi specfunc-clausen.texi specfunc-coulomb.texi specfunc-coupling.texi specfunc-dawson.texi specfunc-debye.texi specfunc-dilog.texi specfunc-elementary.texi specfunc-ellint.texi specfunc-elljac.texi specfunc-erf.texi specfunc-exp.texi specfunc-expint.texi specfunc-fermi-dirac.texi specfunc-gamma.texi specfunc-gegenbauer.texi specfunc-hyperg.texi specfunc-lambert.texi specfunc-laguerre.texi specfunc-legendre.texi specfunc-log.texi specfunc-pow-int.texi specfunc-psi.texi specfunc-synchrotron.texi specfunc-transport.texi specfunc-trig.texi specfunc-zeta.texi siman.texi vectors.texi debug.texi histogram.texi ode-initval.texi integration.texi ieee754.texi montecarlo.texi sum.texi intro.texi usage.texi dwt.texi dht.texi interp.texi poly.texi linalg.texi eigen.texi multiroots.texi sort.texi permutation.texi combination.texi complex.texi math.texi fitting.texi multifit.texi const.texi ntuple.texi diff.texi qrng.texi cheb.texi multimin.texi gpl.texi fdl.texi autoconf.texi freemanuals.texi ! man_MANS = gsl.3 gsl-config.1 gsl-randist.1 gsl-histogram.1 ! ! figures = multimin.eps siman-test.eps siman-energy.eps 12-cities.eps initial-route.eps final-route.eps fft-complex-radix2-f.eps fft-complex-radix2-t.eps fft-complex-radix2.eps fft-real-mixedradix.eps roots-bisection.eps roots-false-position.eps roots-newtons-method.eps roots-secant-method.eps histogram.eps histogram2d.eps min-interval.eps fit-wlinear.eps fit-wlinear2.eps fit-exp.eps ntuple.eps qrng.eps cheb.eps vdp.eps interp.eps rand-beta.tex rand-binomial.tex rand-cauchy.tex rand-chisq.tex rand-erlang.tex rand-exponential.tex rand-fdist.tex rand-flat.tex rand-gamma.tex rand-gaussian.tex rand-geometric.tex rand-laplace.tex rand-logarithmic.tex rand-logistic.tex rand-lognormal.tex rand-pareto.tex rand-poisson.tex rand-hypergeometric.tex rand-nbinomial.tex rand-pascal.tex rand-bivariate-gaussian.tex rand-rayleigh.tex rand-rayleigh-tail.tex rand-tdist.tex rand-weibull.tex random-walk.tex randplots.gnp rand-exppow.tex rand-levy.tex rand-levyskew.tex rand-gumbel.tex rand-bernoulli.tex rand-gaussian-tail.tex rand-gumbel1.tex rand-gumbel2.tex landau.dat rand-landau.tex dwt-orig.eps dwt-samp.eps ! ! examples_src = examples/blas.c examples/block.c examples/cblas.c examples/cdf.c examples/cheb.c examples/combination.c examples/const.c examples/demo_fn.c examples/diff.c examples/eigen.c examples/fft.c examples/fftmr.c examples/fftreal.c examples/fitting.c examples/fitting2.c examples/fitting3.c examples/histogram.c examples/histogram2d.c examples/ieee.c examples/ieeeround.c examples/integration.c examples/interp.c examples/intro.c examples/linalglu.c examples/matrix.c examples/matrixw.c examples/min.c examples/monte.c examples/ntupler.c examples/ntuplew.c examples/ode-initval.c examples/odefixed.c examples/permseq.c examples/permshuffle.c examples/polyroots.c examples/qrng.c examples/randpoisson.c examples/randwalk.c examples/rng.c examples/rngunif.c examples/rootnewt.c examples/roots.c examples/siman.c examples/sortsmall.c examples/specfun.c examples/specfun_e.c examples/stat.c examples/statsort.c examples/sum.c examples/vector.c examples/vectorr.c examples/vectorview.c examples/vectorw.c examples/demo_fn.h examples/dwt.c ! examples_out = examples/blas.out examples/block.out examples/cblas.out examples/cdf.out examples/combination.out examples/const.out examples/diff.out examples/integration.out examples/intro.out examples/linalglu.out examples/min.out examples/polyroots.out examples/randpoisson.2.out examples/randpoisson.out examples/rng.out examples/rngunif.2.out examples/rngunif.out examples/sortsmall.out examples/specfun.out examples/specfun_e.out examples/stat.out examples/statsort.out examples/sum.out examples/vectorview.out examples/ecg.dat examples/dwt.dat - noinst_DATA = $(examples_src) $(examples_out) $(figures) - EXTRA_DIST = $(man_MANS) $(noinst_DATA) gsl-design.texi fftalgorithms.tex fftalgorithms.bib algorithm.sty algorithmic.sty calc.sty - subdir = doc - ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 - mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs - CONFIG_HEADER = $(top_builddir)/config.h - CONFIG_CLEAN_FILES = - depcomp = - am__depfiles_maybe = - DIST_SOURCES = - am__TEXINFO_TEX_DIR = $(srcdir) - INFO_DEPS = gsl-ref.info - DVIS = gsl-ref.dvi - PDFS = gsl-ref.pdf - PSS = gsl-ref.ps - TEXINFOS = gsl-ref.texi - - NROFF = nroff - MANS = $(man_MANS) - DATA = $(noinst_DATA) - - DIST_COMMON = $(gsl_ref_TEXINFOS) ChangeLog Makefile.am Makefile.in \ - mdate-sh stamp-vti texinfo.tex version-ref.texi all: all-am .SUFFIXES: ! .SUFFIXES: .dvi .info .pdf .ps .texi ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.ac $(ACLOCAL_M4) cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu doc/Makefile ! Makefile: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.in $(top_builddir)/config.status ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe) mostlyclean-libtool: --- 179,282 ---- sysconfdir = @sysconfdir@ target_alias = @target_alias@ info_TEXINFOS = gsl-ref.texi noinst_TEXINFOS = gsl-design.texi ! gsl_ref_TEXINFOS = err.texi cblas.texi blas.texi min.texi fft.texi \ ! rng.texi randist.texi roots.texi statistics.texi specfunc.texi \ ! specfunc-airy.texi specfunc-bessel.texi \ ! specfunc-chebyshev.texi specfunc-clausen.texi \ ! specfunc-coulomb.texi specfunc-coupling.texi \ ! specfunc-dawson.texi specfunc-debye.texi specfunc-dilog.texi \ ! specfunc-elementary.texi specfunc-ellint.texi \ ! specfunc-elljac.texi specfunc-erf.texi specfunc-exp.texi \ ! specfunc-expint.texi specfunc-fermi-dirac.texi \ ! specfunc-gamma.texi specfunc-gegenbauer.texi \ ! specfunc-hyperg.texi specfunc-lambert.texi \ ! specfunc-laguerre.texi specfunc-legendre.texi \ ! specfunc-log.texi specfunc-pow-int.texi specfunc-psi.texi \ ! specfunc-synchrotron.texi specfunc-transport.texi \ ! specfunc-trig.texi specfunc-zeta.texi siman.texi vectors.texi \ ! debug.texi histogram.texi ode-initval.texi integration.texi \ ! ieee754.texi montecarlo.texi sum.texi intro.texi usage.texi \ ! dwt.texi dht.texi interp.texi poly.texi linalg.texi eigen.texi \ ! multiroots.texi sort.texi permutation.texi combination.texi \ ! complex.texi math.texi fitting.texi multifit.texi const.texi \ ! ntuple.texi diff.texi qrng.texi cheb.texi multimin.texi \ ! gpl.texi fdl.texi autoconf.texi freemanuals.texi man_MANS = gsl.3 gsl-config.1 gsl-randist.1 gsl-histogram.1 ! figures = multimin.eps siman-test.eps siman-energy.eps 12-cities.eps \ ! initial-route.eps final-route.eps fft-complex-radix2-f.eps \ ! fft-complex-radix2-t.eps fft-complex-radix2.eps \ ! fft-real-mixedradix.eps roots-bisection.eps \ ! roots-false-position.eps roots-newtons-method.eps \ ! roots-secant-method.eps histogram.eps histogram2d.eps \ ! min-interval.eps fit-wlinear.eps fit-wlinear2.eps fit-exp.eps \ ! ntuple.eps qrng.eps cheb.eps vdp.eps interp2.eps rand-beta.tex \ ! rand-binomial.tex rand-cauchy.tex rand-chisq.tex \ ! rand-erlang.tex rand-exponential.tex rand-fdist.tex \ ! rand-flat.tex rand-gamma.tex rand-gaussian.tex \ ! rand-geometric.tex rand-laplace.tex rand-logarithmic.tex \ ! rand-logistic.tex rand-lognormal.tex rand-pareto.tex \ ! rand-poisson.tex rand-hypergeometric.tex rand-nbinomial.tex \ ! rand-pascal.tex rand-bivariate-gaussian.tex rand-rayleigh.tex \ ! rand-rayleigh-tail.tex rand-tdist.tex rand-weibull.tex \ ! random-walk.tex randplots.gnp rand-exppow.tex rand-levy.tex \ ! rand-levyskew.tex rand-gumbel.tex rand-bernoulli.tex \ ! rand-gaussian-tail.tex rand-gumbel1.tex rand-gumbel2.tex \ ! landau.dat rand-landau.tex dwt-orig.eps dwt-samp.eps ! examples_src = examples/blas.c examples/block.c examples/cblas.c \ ! examples/cdf.c examples/cheb.c examples/combination.c \ ! examples/const.c examples/demo_fn.c examples/diff.c \ ! examples/eigen.c examples/fft.c examples/fftmr.c \ ! examples/fftreal.c examples/fitting.c examples/fitting2.c \ ! examples/fitting3.c examples/histogram.c \ ! examples/histogram2d.c examples/ieee.c examples/ieeeround.c \ ! examples/integration.c examples/interp.c examples/intro.c \ ! examples/linalglu.c examples/matrix.c examples/matrixw.c \ ! examples/min.c examples/monte.c examples/ntupler.c \ ! examples/ntuplew.c examples/ode-initval.c examples/odefixed.c \ ! examples/permseq.c examples/permshuffle.c examples/polyroots.c \ ! examples/qrng.c examples/randpoisson.c examples/randwalk.c \ ! examples/rng.c examples/rngunif.c examples/rootnewt.c \ ! examples/roots.c examples/siman.c examples/sortsmall.c \ ! examples/specfun.c examples/specfun_e.c examples/stat.c \ ! examples/statsort.c examples/sum.c examples/vector.c \ ! examples/vectorr.c examples/vectorview.c examples/vectorw.c \ ! examples/demo_fn.h examples/dwt.c examples_out = examples/blas.out examples/block.out examples/cblas.out examples/cdf.out examples/combination.out examples/const.out examples/diff.out examples/integration.out examples/intro.out examples/linalglu.out examples/min.out examples/polyroots.out examples/randpoisson.2.out examples/randpoisson.out examples/rng.out examples/rngunif.2.out examples/rngunif.out examples/sortsmall.out examples/specfun.out examples/specfun_e.out examples/stat.out examples/statsort.out examples/sum.out examples/vectorview.out examples/ecg.dat examples/dwt.dat noinst_DATA = $(examples_src) $(examples_out) $(figures) EXTRA_DIST = $(man_MANS) $(noinst_DATA) gsl-design.texi fftalgorithms.tex fftalgorithms.bib algorithm.sty algorithmic.sty calc.sty all: all-am .SUFFIXES: ! .SUFFIXES: .dvi .html .info .pdf .ps .texi ! $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) ! @for dep in $?; do \ ! case '$(am__configure_deps)' in \ ! *$$dep*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ ! && exit 0; \ ! exit 1;; \ ! esac; \ ! done; \ ! echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps doc/Makefile'; \ cd $(top_srcdir) && \ ! $(AUTOMAKE) --gnu --ignore-deps doc/Makefile ! .PRECIOUS: Makefile ! Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status ! @case '$?' in \ ! *config.status*) \ ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ ! *) \ ! echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ ! cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ ! esac; ! ! $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! ! $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ! $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) ! cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh mostlyclean-libtool: *************** *** 198,219 **** .texi.info: ! @rm -f $@ $@-[0-9] $@-[0-9][0-9] $(@:.info=).i[0-9] $(@:.info=).i[0-9][0-9] ! $(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir) \ ! -o $@ `test -f '$<' || echo '$(srcdir)/'`$< .texi.dvi: TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ ! $(TEXI2DVI) `test -f '$<' || echo '$(srcdir)/'`$< .texi.pdf: TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ ! $(TEXI2PDF) `test -f '$<' || echo '$(srcdir)/'`$< ! gsl-ref.info: gsl-ref.texi version-ref.texi $(gsl_ref_TEXINFOS) ! gsl-ref.dvi: gsl-ref.texi version-ref.texi $(gsl_ref_TEXINFOS) ! gsl-ref.pdf: gsl-ref.texi version-ref.texi $(gsl_ref_TEXINFOS) ! version-ref.texi: @MAINTAINER_MODE_TRUE@ stamp-vti ! stamp-vti: gsl-ref.texi $(top_srcdir)/configure @(dir=.; test -f ./gsl-ref.texi || dir=$(srcdir); \ set `$(SHELL) $(srcdir)/mdate-sh $$dir/gsl-ref.texi`; \ --- 290,343 ---- .texi.info: ! restore=: && backupdir="$(am__leading_dot)am$$$$" && \ ! am__cwd=`pwd` && cd $(srcdir) && \ ! rm -rf $$backupdir && mkdir $$backupdir && \ ! if ($(MAKEINFO) --version) >/dev/null 2>&1; then \ ! for f in $@ $@-[0-9] $@-[0-9][0-9] $(@:.info=).i[0-9] $(@:.info=).i[0-9][0-9]; do \ ! if test -f $$f; then mv $$f $$backupdir; restore=mv; else :; fi; \ ! done; \ ! else :; fi && \ ! cd "$$am__cwd"; \ ! if $(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir) \ ! -o $@ $<; \ ! then \ ! rc=0; \ ! cd $(srcdir); \ ! else \ ! rc=$$?; \ ! cd $(srcdir) && \ ! $$restore $$backupdir/* `echo "./$@" | sed 's|[^/]*$$||'`; \ ! fi; \ ! rm -rf $$backupdir; exit $$rc .texi.dvi: TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ ! $(TEXI2DVI) $< .texi.pdf: TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ ! $(TEXI2PDF) $< ! ! .texi.html: ! rm -rf $(@:.html=.htp) ! if $(MAKEINFOHTML) $(AM_MAKEINFOHTMLFLAGS) $(MAKEINFOFLAGS) -I $(srcdir) \ ! -o $(@:.html=.htp) $<; \ ! then \ ! rm -rf $@; \ ! if test ! -d $(@:.html=.htp) && test -d $(@:.html=); then \ ! mv $(@:.html=) $@; else mv $(@:.html=.htp) $@; fi; \ ! else \ ! if test ! -d $(@:.html=.htp) && test -d $(@:.html=); then \ ! rm -rf $(@:.html=); else rm -Rf $(@:.html=.htp) $@; fi; \ ! exit 1; \ ! fi ! $(srcdir)/gsl-ref.info: gsl-ref.texi $(srcdir)/version-ref.texi $(gsl_ref_TEXINFOS) ! gsl-ref.dvi: gsl-ref.texi $(srcdir)/version-ref.texi $(gsl_ref_TEXINFOS) ! gsl-ref.pdf: gsl-ref.texi $(srcdir)/version-ref.texi $(gsl_ref_TEXINFOS) ! gsl-ref.html: gsl-ref.texi $(srcdir)/version-ref.texi $(gsl_ref_TEXINFOS) ! $(srcdir)/version-ref.texi: @MAINTAINER_MODE_TRUE@ $(srcdir)/stamp-vti ! $(srcdir)/stamp-vti: gsl-ref.texi $(top_srcdir)/configure @(dir=.; test -f ./gsl-ref.texi || dir=$(srcdir); \ set `$(SHELL) $(srcdir)/mdate-sh $$dir/gsl-ref.texi`; \ *************** *** 222,230 **** echo "@set EDITION $(VERSION)"; \ echo "@set VERSION $(VERSION)") > vti.tmp ! @cmp -s vti.tmp version-ref.texi \ ! || (echo "Updating version-ref.texi"; \ ! cp vti.tmp version-ref.texi) -@rm -f vti.tmp ! @cp version-ref.texi $@ mostlyclean-vti: --- 346,354 ---- echo "@set EDITION $(VERSION)"; \ echo "@set VERSION $(VERSION)") > vti.tmp ! @cmp -s vti.tmp $(srcdir)/version-ref.texi \ ! || (echo "Updating $(srcdir)/version-ref.texi"; \ ! cp vti.tmp $(srcdir)/version-ref.texi) -@rm -f vti.tmp ! @cp $(srcdir)/version-ref.texi $@ mostlyclean-vti: *************** *** 232,252 **** maintainer-clean-vti: ! @MAINTAINER_MODE_TRUE@ -rm -f stamp-vti version-ref.texi ! TEXI2DVI = texi2dvi ! ! TEXI2PDF = $(TEXI2DVI) --pdf --batch ! DVIPS = dvips .dvi.ps: $(DVIPS) -o $@ $< uninstall-info-am: ! $(PRE_UNINSTALL) @if (install-info --version && \ ! install-info --version | grep -i -v debian) >/dev/null 2>&1; then \ list='$(INFO_DEPS)'; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ ! echo " install-info --info-dir=$(DESTDIR)$(infodir) --remove $(DESTDIR)$(infodir)/$$relfile"; \ ! install-info --info-dir=$(DESTDIR)$(infodir) --remove $(DESTDIR)$(infodir)/$$relfile; \ done; \ else :; fi --- 356,373 ---- maintainer-clean-vti: ! @MAINTAINER_MODE_TRUE@ -rm -f $(srcdir)/stamp-vti $(srcdir)/version-ref.texi .dvi.ps: + TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ $(DVIPS) -o $@ $< uninstall-info-am: ! @$(PRE_UNINSTALL) @if (install-info --version && \ ! install-info --version 2>&1 | sed 1q | grep -i -v debian) >/dev/null 2>&1; then \ list='$(INFO_DEPS)'; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ ! echo " install-info --info-dir='$(DESTDIR)$(infodir)' --remove '$(DESTDIR)$(infodir)/$$relfile'"; \ ! install-info --info-dir="$(DESTDIR)$(infodir)" --remove "$(DESTDIR)$(infodir)/$$relfile"; \ done; \ else :; fi *************** *** 256,261 **** relfile=`echo "$$file" | sed 's|^.*/||'`; \ relfile_i=`echo "$$relfile" | sed 's|\.info$$||;s|$$|.i|'`; \ ! (if cd $(DESTDIR)$(infodir); then \ ! echo " rm -f $$relfile $$relfile-[0-9] $$relfile-[0-9][0-9] $$relfile_i[0-9] $$relfile_i[0-9][0-9])"; \ rm -f $$relfile $$relfile-[0-9] $$relfile-[0-9][0-9] $$relfile_i[0-9] $$relfile_i[0-9][0-9]; \ else :; fi); \ --- 377,382 ---- relfile=`echo "$$file" | sed 's|^.*/||'`; \ relfile_i=`echo "$$relfile" | sed 's|\.info$$||;s|$$|.i|'`; \ ! (if cd "$(DESTDIR)$(infodir)"; then \ ! echo " cd '$(DESTDIR)$(infodir)' && rm -f $$relfile $$relfile-[0-9] $$relfile-[0-9][0-9] $$relfile_i[0-9] $$relfile_i[0-9][0-9]"; \ rm -f $$relfile $$relfile-[0-9] $$relfile-[0-9][0-9] $$relfile_i[0-9] $$relfile_i[0-9][0-9]; \ else :; fi); \ *************** *** 263,268 **** --- 384,393 ---- dist-info: $(INFO_DEPS) + @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ list='$(INFO_DEPS)'; \ for base in $$list; do \ + case $$base in \ + $(srcdir)/*) base=`echo "$$base" | sed "s|^$$srcdirstrip/||"`;; \ + esac; \ if test -f $$base; then d=.; else d=$(srcdir); fi; \ for file in $$d/$$base*; do \ *************** *** 274,281 **** mostlyclean-aminfo: ! -rm -f gsl-ref.aux gsl-ref.cp gsl-ref.cps gsl-ref.fn gsl-ref.fns gsl-ref.ky \ gsl-ref.kys gsl-ref.log gsl-ref.pg gsl-ref.pgs gsl-ref.tmp \ gsl-ref.toc gsl-ref.tp gsl-ref.tps gsl-ref.vr gsl-ref.vrs \ ! gsl-ref.dvi gsl-ref.pdf gsl-ref.ps maintainer-clean-aminfo: --- 399,406 ---- mostlyclean-aminfo: ! -rm -rf gsl-ref.aux gsl-ref.cp gsl-ref.cps gsl-ref.fn gsl-ref.fns gsl-ref.ky \ gsl-ref.kys gsl-ref.log gsl-ref.pg gsl-ref.pgs gsl-ref.tmp \ gsl-ref.toc gsl-ref.tp gsl-ref.tps gsl-ref.vr gsl-ref.vrs \ ! gsl-ref.dvi gsl-ref.pdf gsl-ref.ps gsl-ref.html maintainer-clean-aminfo: *************** *** 285,293 **** rm -f $$i $$i-[0-9] $$i-[0-9][0-9] $$i_i[0-9] $$i_i[0-9][0-9]; \ done - - man1dir = $(mandir)/man1 install-man1: $(man1_MANS) $(man_MANS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(man1dir) @list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ --- 410,416 ---- rm -f $$i $$i-[0-9] $$i-[0-9][0-9] $$i_i[0-9] $$i_i[0-9][0-9]; \ done install-man1: $(man1_MANS) $(man_MANS) @$(NORMAL_INSTALL) ! test -z "$(man1dir)" || $(mkdir_p) "$(DESTDIR)$(man1dir)" @list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ *************** *** 308,313 **** inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst"; \ ! $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst; \ done uninstall-man1: --- 431,436 ---- inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " $(INSTALL_DATA) '$$file' '$(DESTDIR)$(man1dir)/$$inst'"; \ ! $(INSTALL_DATA) "$$file" "$(DESTDIR)$(man1dir)/$$inst"; \ done uninstall-man1: *************** *** 329,340 **** inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " rm -f $(DESTDIR)$(man1dir)/$$inst"; \ ! rm -f $(DESTDIR)$(man1dir)/$$inst; \ done - - man3dir = $(mandir)/man3 install-man3: $(man3_MANS) $(man_MANS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(man3dir) @list='$(man3_MANS) $(dist_man3_MANS) $(nodist_man3_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ --- 452,461 ---- inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " rm -f '$(DESTDIR)$(man1dir)/$$inst'"; \ ! rm -f "$(DESTDIR)$(man1dir)/$$inst"; \ done install-man3: $(man3_MANS) $(man_MANS) @$(NORMAL_INSTALL) ! test -z "$(man3dir)" || $(mkdir_p) "$(DESTDIR)$(man3dir)" @list='$(man3_MANS) $(dist_man3_MANS) $(nodist_man3_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ *************** *** 355,360 **** inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " $(INSTALL_DATA) $$file $(DESTDIR)$(man3dir)/$$inst"; \ ! $(INSTALL_DATA) $$file $(DESTDIR)$(man3dir)/$$inst; \ done uninstall-man3: --- 476,481 ---- inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " $(INSTALL_DATA) '$$file' '$(DESTDIR)$(man3dir)/$$inst'"; \ ! $(INSTALL_DATA) "$$file" "$(DESTDIR)$(man3dir)/$$inst"; \ done uninstall-man3: *************** *** 376,381 **** inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " rm -f $(DESTDIR)$(man3dir)/$$inst"; \ ! rm -f $(DESTDIR)$(man3dir)/$$inst; \ done tags: TAGS --- 497,502 ---- inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ ! echo " rm -f '$(DESTDIR)$(man3dir)/$$inst'"; \ ! rm -f "$(DESTDIR)$(man3dir)/$$inst"; \ done tags: TAGS *************** *** 385,395 **** CTAGS: - DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) - - top_distdir = .. - distdir = $(top_distdir)/$(PACKAGE)-$(VERSION) distdir: $(DISTFILES) ! $(mkinstalldirs) $(distdir)/examples @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ --- 506,512 ---- CTAGS: distdir: $(DISTFILES) ! $(mkdir_p) $(distdir)/examples @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ *************** *** 403,407 **** if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkinstalldirs) "$(distdir)$$dir"; \ else \ dir=''; \ --- 520,524 ---- if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ ! $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ *************** *** 424,430 **** check: check-am all-am: Makefile $(INFO_DEPS) $(MANS) $(DATA) - installdirs: ! $(mkinstalldirs) $(DESTDIR)$(infodir) $(DESTDIR)$(man1dir) $(DESTDIR)$(man3dir) install: install-am install-exec: install-exec-am --- 541,548 ---- check: check-am all-am: Makefile $(INFO_DEPS) $(MANS) $(DATA) installdirs: ! for dir in "$(DESTDIR)$(infodir)" "$(DESTDIR)$(man1dir)" "$(DESTDIR)$(man3dir)"; do \ ! test -z "$$dir" || $(mkdir_p) "$$dir"; \ ! done install: install-am install-exec: install-exec-am *************** *** 438,442 **** install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install --- 556,560 ---- install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ ! install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install *************** *** 446,450 **** distclean-generic: ! -rm -f Makefile $(CONFIG_CLEAN_FILES) maintainer-clean-generic: --- 564,568 ---- distclean-generic: ! -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: *************** *** 456,460 **** distclean: distclean-am ! distclean-am: clean-am distclean-generic distclean-libtool --- 574,578 ---- distclean: distclean-am ! -rm -f Makefile distclean-am: clean-am distclean-generic distclean-libtool *************** *** 463,466 **** --- 581,588 ---- dvi-am: $(DVIS) + html: html-am + + html-am: $(HTMLS) + info: info-am *************** *** 475,481 **** install-info-am: $(INFO_DEPS) @$(NORMAL_INSTALL) ! $(mkinstalldirs) $(DESTDIR)$(infodir) ! @list='$(INFO_DEPS)'; \ for file in $$list; do \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ file_i=`echo "$$file" | sed 's|\.info$$||;s|$$|.i|'`; \ --- 597,607 ---- install-info-am: $(INFO_DEPS) @$(NORMAL_INSTALL) ! test -z "$(infodir)" || $(mkdir_p) "$(DESTDIR)$(infodir)" ! @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ ! list='$(INFO_DEPS)'; \ for file in $$list; do \ + case $$file in \ + $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ + esac; \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ file_i=`echo "$$file" | sed 's|\.info$$||;s|$$|.i|'`; \ *************** *** 484,489 **** if test -f $$ifile; then \ relfile=`echo "$$ifile" | sed 's|^.*/||'`; \ ! echo " $(INSTALL_DATA) $$ifile $(DESTDIR)$(infodir)/$$relfile"; \ ! $(INSTALL_DATA) $$ifile $(DESTDIR)$(infodir)/$$relfile; \ else : ; fi; \ done; \ --- 610,615 ---- if test -f $$ifile; then \ relfile=`echo "$$ifile" | sed 's|^.*/||'`; \ ! echo " $(INSTALL_DATA) '$$ifile' '$(DESTDIR)$(infodir)/$$relfile'"; \ ! $(INSTALL_DATA) "$$ifile" "$(DESTDIR)$(infodir)/$$relfile"; \ else : ; fi; \ done; \ *************** *** 491,500 **** @$(POST_INSTALL) @if (install-info --version && \ ! install-info --version | grep -i -v debian) >/dev/null 2>&1; then \ list='$(INFO_DEPS)'; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ ! echo " install-info --info-dir=$(DESTDIR)$(infodir) $(DESTDIR)$(infodir)/$$relfile";\ ! install-info --info-dir=$(DESTDIR)$(infodir) $(DESTDIR)$(infodir)/$$relfile || :;\ done; \ else : ; fi --- 617,626 ---- @$(POST_INSTALL) @if (install-info --version && \ ! install-info --version 2>&1 | sed 1q | grep -i -v debian) >/dev/null 2>&1; then \ list='$(INFO_DEPS)'; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ ! echo " install-info --info-dir='$(DESTDIR)$(infodir)' '$(DESTDIR)$(infodir)/$$relfile'";\ ! install-info --info-dir="$(DESTDIR)$(infodir)" "$(DESTDIR)$(infodir)/$$relfile" || :;\ done; \ else : ; fi *************** *** 504,508 **** maintainer-clean: maintainer-clean-am ! maintainer-clean-am: distclean-am maintainer-clean-aminfo \ maintainer-clean-generic maintainer-clean-vti --- 630,634 ---- maintainer-clean: maintainer-clean-am ! -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-aminfo \ maintainer-clean-generic maintainer-clean-vti *************** *** 526,539 **** .PHONY: all all-am check check-am clean clean-generic clean-libtool \ ! dist-info distclean distclean-generic distclean-libtool distdir \ ! dvi dvi-am info info-am install install-am install-data \ ! install-data-am install-exec install-exec-am install-info \ ! install-info-am install-man install-man1 install-man3 \ ! install-strip installcheck installcheck-am installdirs \ ! maintainer-clean maintainer-clean-aminfo \ ! maintainer-clean-generic maintainer-clean-vti mostlyclean \ ! mostlyclean-aminfo mostlyclean-generic mostlyclean-libtool \ ! mostlyclean-vti pdf pdf-am ps ps-am uninstall uninstall-am \ ! uninstall-info-am uninstall-man uninstall-man1 uninstall-man3 # Tell versions [3.59,3.63) of GNU make to not export all variables. --- 652,666 ---- .PHONY: all all-am check check-am clean clean-generic clean-libtool \ ! dist-info distclean distclean-generic distclean-libtool \ ! distdir dvi dvi-am html html-am info info-am install \ ! install-am install-data install-data-am install-exec \ ! install-exec-am install-info install-info-am install-man \ ! install-man1 install-man3 install-strip installcheck \ ! installcheck-am installdirs maintainer-clean \ ! maintainer-clean-aminfo maintainer-clean-generic \ ! maintainer-clean-vti mostlyclean mostlyclean-aminfo \ ! mostlyclean-generic mostlyclean-libtool mostlyclean-vti pdf \ ! pdf-am ps ps-am uninstall uninstall-am uninstall-info-am \ ! uninstall-man uninstall-man1 uninstall-man3 # Tell versions [3.59,3.63) of GNU make to not export all variables. diff -rc2P gsl-1.6/doc/autoconf.texi gsl-1.7/doc/autoconf.texi *** gsl-1.6/doc/autoconf.texi Sun Mar 2 20:25:29 2003 --- gsl-1.7/doc/autoconf.texi Sat May 21 13:28:05 2005 *************** *** 2,10 **** For applications using @code{autoconf} the standard macro ! @code{AC_CHECK_LIB} can be used to link with the library automatically from a @code{configure} script. The library itself depends on the presence of a @sc{cblas} and math library as well, so these must also be located before linking with the main @code{libgsl} file. The following ! commands should be placed in the @file{configure.in} file to perform these tests, --- 2,10 ---- For applications using @code{autoconf} the standard macro ! @code{AC_CHECK_LIB} can be used to link with GSL automatically from a @code{configure} script. The library itself depends on the presence of a @sc{cblas} and math library as well, so these must also be located before linking with the main @code{libgsl} file. The following ! commands should be placed in the @file{configure.ac} file to perform these tests, *************** *** 57,63 **** @example ! libgsdv_la_LDFLAGS = \ ! $(GTK_LIBDIR) \ ! $(GTK_LIBS) -lgsdvgsl $(GSL_LIBS) -lgslcblas @end example @noindent --- 57,61 ---- @example ! libfoo_la_LDFLAGS = -lfoo $(GSL_LIBS) -lgslcblas @end example @noindent diff -rc2P gsl-1.6/doc/blas.texi gsl-1.7/doc/blas.texi *** gsl-1.6/doc/blas.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/blas.texi Sat May 21 13:28:05 2005 *************** *** 63,67 **** @end table @noindent ! The type of matrices are, @table @b --- 63,67 ---- @end table @noindent ! The types of matrices are, @table @b *************** *** 180,183 **** --- 180,184 ---- @end tex @ifinfo + @example ||x||_2 = \sqrt @{\sum (\Re(x_i)^2 + \Im(x_i)^2)@}. *************** *** 209,213 **** These functions return the index of the largest element of the vector @var{x}. The largest element is determined by its absolute magnitude for ! real vector and by the sum of the magnitudes of the real and imaginary parts @math{|\Re(x_i)| + |\Im(x_i)|} for complex vectors. If the largest value occurs several times then the index of the first --- 210,214 ---- These functions return the index of the largest element of the vector @var{x}. The largest element is determined by its absolute magnitude for ! real vectors and by the sum of the magnitudes of the real and imaginary parts @math{|\Re(x_i)| + |\Im(x_i)|} for complex vectors. If the largest value occurs several times then the index of the first *************** *** 259,263 **** These functions compute a Givens rotation @math{(c,s)} which zeroes the vector @math{(a,b)}, - @tex \beforedisplay --- 260,263 ---- *************** *** 280,283 **** --- 280,284 ---- @end tex @ifinfo + @example [ c s ] [ a ] = [ r ] *************** *** 299,304 **** @cindex Modified Givens Rotation, BLAS @cindex Givens Rotation, Modified, BLAS ! These functions compute a modified Given's transformation. The modified ! Given's transformation is defined in the original Level-1 @sc{blas} specification, given in the references. @end deftypefun --- 300,305 ---- @cindex Modified Givens Rotation, BLAS @cindex Givens Rotation, Modified, BLAS ! These functions compute a modified Givens transformation. The modified ! Givens transformation is defined in the original Level-1 @sc{blas} specification, given in the references. @end deftypefun *************** *** 306,310 **** @deftypefun int gsl_blas_srotm (gsl_vector_float * @var{x}, gsl_vector_float * @var{y}, const float @var{P}[]) @deftypefunx int gsl_blas_drotm (gsl_vector * @var{x}, gsl_vector * @var{y}, const double @var{P}[]) ! These functions apply a modified Given's transformation. @end deftypefun --- 307,311 ---- @deftypefun int gsl_blas_srotm (gsl_vector_float * @var{x}, gsl_vector_float * @var{y}, const float @var{P}[]) @deftypefunx int gsl_blas_drotm (gsl_vector * @var{x}, gsl_vector * @var{y}, const double @var{P}[]) ! These functions apply a modified Givens transformation. @end deftypefun *************** *** 345,349 **** @deftypefunx int gsl_blas_dtrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix * @var{A}, gsl_vector * @var{x}) @deftypefunx int gsl_blas_ctrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix_complex_float * @var{A}, gsl_vector_complex_float * @var{x}) ! @deftypefunx int gsl_blas_ztrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix_complex * @var{A}, gsl_vector_complex *@var{x}) @cindex TRSV, Level-2 BLAS These functions compute @math{inv(op(A)) x} for @var{x}, where --- 346,350 ---- @deftypefunx int gsl_blas_dtrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix * @var{A}, gsl_vector * @var{x}) @deftypefunx int gsl_blas_ctrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix_complex_float * @var{A}, gsl_vector_complex_float * @var{x}) ! @deftypefunx int gsl_blas_ztrsv (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_matrix_complex * @var{A}, gsl_vector_complex * @var{x}) @cindex TRSV, Level-2 BLAS These functions compute @math{inv(op(A)) x} for @var{x}, where *************** *** 515,520 **** @deftypefunx int gsl_blas_ztrsm (CBLAS_SIDE_t @var{Side}, CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_complex @var{alpha}, const gsl_matrix_complex * @var{A}, gsl_matrix_complex * @var{B}) @cindex TRSM, Level-3 BLAS ! These functions compute the matrix-matrix product @math{B = \alpha op(inv(A)) ! B} for @var{Side} is @code{CblasLeft} and @math{B = \alpha B op(inv(A))} for @var{Side} is @code{CblasRight}. The matrix @var{A} is triangular and @math{op(A) = A}, @math{A^T}, @math{A^H} for @var{TransA} = --- 516,522 ---- @deftypefunx int gsl_blas_ztrsm (CBLAS_SIDE_t @var{Side}, CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{TransA}, CBLAS_DIAG_t @var{Diag}, const gsl_complex @var{alpha}, const gsl_matrix_complex * @var{A}, gsl_matrix_complex * @var{B}) @cindex TRSM, Level-3 BLAS ! These functions compute the inverse-matrix matrix product ! @math{B = \alpha op(inv(A))B} for @var{Side} is ! @code{CblasLeft} and @math{B = \alpha B op(inv(A))} for @var{Side} is @code{CblasRight}. The matrix @var{A} is triangular and @math{op(A) = A}, @math{A^T}, @math{A^H} for @var{TransA} = *************** *** 560,564 **** @deftypefunx int gsl_blas_dsyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, double @var{alpha}, const gsl_matrix * @var{A}, const gsl_matrix * @var{B}, double @var{beta}, gsl_matrix * @var{C}) @deftypefunx int gsl_blas_csyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, const gsl_complex_float @var{alpha}, const gsl_matrix_complex_float * @var{A}, const gsl_matrix_complex_float * @var{B}, const gsl_complex_float @var{beta}, gsl_matrix_complex_float * @var{C}) ! @deftypefunx int gsl_blas_zsyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, const gsl_complex @var{alpha}, const gsl_matrix_complex * @var{A}, const gsl_matrix_complex * @var{B}, const gsl_complex @var{beta}, gsl_matrix_complex *@var{C}) @cindex SYR2K, Level-3 BLAS These functions compute a rank-2k update of the symmetric matrix @var{C}, --- 562,566 ---- @deftypefunx int gsl_blas_dsyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, double @var{alpha}, const gsl_matrix * @var{A}, const gsl_matrix * @var{B}, double @var{beta}, gsl_matrix * @var{C}) @deftypefunx int gsl_blas_csyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, const gsl_complex_float @var{alpha}, const gsl_matrix_complex_float * @var{A}, const gsl_matrix_complex_float * @var{B}, const gsl_complex_float @var{beta}, gsl_matrix_complex_float * @var{C}) ! @deftypefunx int gsl_blas_zsyr2k (CBLAS_UPLO_t @var{Uplo}, CBLAS_TRANSPOSE_t @var{Trans}, const gsl_complex @var{alpha}, const gsl_matrix_complex * @var{A}, const gsl_matrix_complex * @var{B}, const gsl_complex @var{beta}, gsl_matrix_complex * @var{C}) @cindex SYR2K, Level-3 BLAS These functions compute a rank-2k update of the symmetric matrix @var{C}, *************** *** 591,595 **** The following program computes the product of two matrices using the Level-3 @sc{blas} function @sc{dgemm}, - @tex \beforedisplay --- 593,596 ---- *************** *** 613,616 **** --- 614,618 ---- @end tex @ifinfo + @example [ 0.11 0.12 0.13 ] [ 1011 1012 ] [ 367.76 368.12 ] *************** *** 628,631 **** --- 630,634 ---- @noindent Here is the output from the program, + @example $ ./a.out *************** *** 642,649 **** @itemize @asis @item ! @cite{BLAS Homepage} @uref{http://www.netlib.org/blas/} @item ! @cite{BLAS Technical Forum} @uref{http://www.netlib.org/cgi-bin/checkout/blast/blast.pl} @end itemize --- 645,652 ---- @itemize @asis @item ! @cite{BLAS Homepage} @* @uref{http://www.netlib.org/blas/} @item ! @cite{BLAS Technical Forum} @* @uref{http://www.netlib.org/cgi-bin/checkout/blast/blast.pl} @end itemize *************** *** 654,670 **** @itemize @asis @item ! C. Lawson, R. Hanson, D. Kincaid, F. Krogh, "Basic Linear Algebra ! Subprograms for Fortran Usage", @cite{ACM Transactions on Mathematical ! Software}, Vol. 5 (1979), Pages 308-325. @item ! J.J. Dongarra, J. DuCroz, S. Hammarling, R. Hanson, "An Extended Set of ! Fortran Basic Linear Algebra Subprograms", @cite{ACM Transactions on ! Mathematical Software}, Vol. 14, No. 1 (1988), Pages 1-32. @item ! J.J. Dongarra, I. Duff, J. DuCroz, S. Hammarling, "A Set of ! Level 3 Basic Linear Algebra Subprograms", @cite{ACM Transactions on ! Mathematical Software}, Vol. 16 (1990), Pages 1-28. @end itemize @noindent --- 657,673 ---- @itemize @asis @item ! C. Lawson, R. Hanson, D. Kincaid, F. Krogh, ``Basic Linear Algebra ! Subprograms for Fortran Usage'', @cite{ACM Transactions on Mathematical ! Software}, Vol.@: 5 (1979), Pages 308--325. @item ! J.J. Dongarra, J. DuCroz, S. Hammarling, R. Hanson, ``An Extended Set of ! Fortran Basic Linear Algebra Subprograms'', @cite{ACM Transactions on ! Mathematical Software}, Vol.@: 14, No.@: 1 (1988), Pages 1--32. @item ! J.J. Dongarra, I. Duff, J. DuCroz, S. Hammarling, ``A Set of ! Level 3 Basic Linear Algebra Subprograms'', @cite{ACM Transactions on ! Mathematical Software}, Vol.@: 16 (1990), Pages 1--28. @end itemize @noindent diff -rc2P gsl-1.6/doc/cblas.texi gsl-1.7/doc/cblas.texi *** gsl-1.6/doc/cblas.texi Mon Jun 2 15:27:50 2003 --- gsl-1.7/doc/cblas.texi Sat May 21 13:28:05 2005 *************** *** 18,157 **** @section Level 1 ! @deftypefun float cblas_sdsdot (const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun double cblas_dsdot (const int @var{N}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun float cblas_sdot (const int @var{N}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun double cblas_ddot (const int @var{N}, const double *@var{x}, const int @var{incx}, const double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cdotu_sub (const int @var{N}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{dotu}) @end deftypefun ! @deftypefun void cblas_cdotc_sub (const int @var{N}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{dotc}) @end deftypefun ! @deftypefun void cblas_zdotu_sub (const int @var{N}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{dotu}) @end deftypefun ! @deftypefun void cblas_zdotc_sub (const int @var{N}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{dotc}) @end deftypefun ! @deftypefun float cblas_snrm2 (const int @var{N}, const float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_sasum (const int @var{N}, const float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dnrm2 (const int @var{N}, const double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dasum (const int @var{N}, const double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_scnrm2 (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_scasum (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dznrm2 (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dzasum (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_isamax (const int @var{N}, const float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_idamax (const int @var{N}, const double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_icamax (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_izamax (const int @var{N}, const void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_sswap (const int @var{N}, float *@var{x}, const int @var{incx}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_scopy (const int @var{N}, const float *@var{x}, const int @var{incx}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_saxpy (const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dswap (const int @var{N}, double *@var{x}, const int @var{incx}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dcopy (const int @var{N}, const double *@var{x}, const int @var{incx}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_daxpy (const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cswap (const int @var{N}, void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ccopy (const int @var{N}, const void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_caxpy (const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zswap (const int @var{N}, void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zcopy (const int @var{N}, const void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zaxpy (const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_srotg (float *@var{a}, float *@var{b}, float *@var{c}, float *@var{s}) @end deftypefun ! @deftypefun void cblas_srotmg (float *@var{d1}, float *@var{d2}, float *@var{b1}, const float @var{b2}, float *@var{P}) @end deftypefun ! @deftypefun void cblas_srot (const int @var{N}, float *@var{x}, const int @var{incx}, float *@var{y}, const int @var{incy}, const float @var{c}, const float @var{s}) @end deftypefun ! @deftypefun void cblas_srotm (const int @var{N}, float *@var{x}, const int @var{incx}, float *@var{y}, const int @var{incy}, const float *@var{P}) @end deftypefun ! @deftypefun void cblas_drotg (double *@var{a}, double *@var{b}, double *@var{c}, double *@var{s}) @end deftypefun ! @deftypefun void cblas_drotmg (double *@var{d1}, double *@var{d2}, double *@var{b1}, const double @var{b2}, double *@var{P}) @end deftypefun ! @deftypefun void cblas_drot (const int @var{N}, double *@var{x}, const int @var{incx}, double *@var{y}, const int @var{incy}, const double @var{c}, const double @var{s}) @end deftypefun ! @deftypefun void cblas_drotm (const int @var{N}, double *@var{x}, const int @var{incx}, double *@var{y}, const int @var{incy}, const double *@var{P}) @end deftypefun ! @deftypefun void cblas_sscal (const int @var{N}, const float @var{alpha}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dscal (const int @var{N}, const double @var{alpha}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_cscal (const int @var{N}, const void *@var{alpha}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zscal (const int @var{N}, const void *@var{alpha}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_csscal (const int @var{N}, const float @var{alpha}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zdscal (const int @var{N}, const double @var{alpha}, void *@var{x}, const int @var{incx}) @end deftypefun --- 18,157 ---- @section Level 1 ! @deftypefun float cblas_sdsdot (const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun double cblas_dsdot (const int @var{N}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun float cblas_sdot (const int @var{N}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun double cblas_ddot (const int @var{N}, const double * @var{x}, const int @var{incx}, const double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cdotu_sub (const int @var{N}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{dotu}) @end deftypefun ! @deftypefun void cblas_cdotc_sub (const int @var{N}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{dotc}) @end deftypefun ! @deftypefun void cblas_zdotu_sub (const int @var{N}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{dotu}) @end deftypefun ! @deftypefun void cblas_zdotc_sub (const int @var{N}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{dotc}) @end deftypefun ! @deftypefun float cblas_snrm2 (const int @var{N}, const float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_sasum (const int @var{N}, const float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dnrm2 (const int @var{N}, const double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dasum (const int @var{N}, const double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_scnrm2 (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun float cblas_scasum (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dznrm2 (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun double cblas_dzasum (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_isamax (const int @var{N}, const float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_idamax (const int @var{N}, const double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_icamax (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun CBLAS_INDEX cblas_izamax (const int @var{N}, const void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_sswap (const int @var{N}, float * @var{x}, const int @var{incx}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_scopy (const int @var{N}, const float * @var{x}, const int @var{incx}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_saxpy (const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dswap (const int @var{N}, double * @var{x}, const int @var{incx}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dcopy (const int @var{N}, const double * @var{x}, const int @var{incx}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_daxpy (const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cswap (const int @var{N}, void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ccopy (const int @var{N}, const void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_caxpy (const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zswap (const int @var{N}, void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zcopy (const int @var{N}, const void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zaxpy (const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_srotg (float * @var{a}, float * @var{b}, float * @var{c}, float * @var{s}) @end deftypefun ! @deftypefun void cblas_srotmg (float * @var{d1}, float * @var{d2}, float * @var{b1}, const float @var{b2}, float * @var{P}) @end deftypefun ! @deftypefun void cblas_srot (const int @var{N}, float * @var{x}, const int @var{incx}, float * @var{y}, const int @var{incy}, const float @var{c}, const float @var{s}) @end deftypefun ! @deftypefun void cblas_srotm (const int @var{N}, float * @var{x}, const int @var{incx}, float * @var{y}, const int @var{incy}, const float * @var{P}) @end deftypefun ! @deftypefun void cblas_drotg (double * @var{a}, double * @var{b}, double * @var{c}, double * @var{s}) @end deftypefun ! @deftypefun void cblas_drotmg (double * @var{d1}, double * @var{d2}, double * @var{b1}, const double @var{b2}, double * @var{P}) @end deftypefun ! @deftypefun void cblas_drot (const int @var{N}, double * @var{x}, const int @var{incx}, double * @var{y}, const int @var{incy}, const double @var{c}, const double @var{s}) @end deftypefun ! @deftypefun void cblas_drotm (const int @var{N}, double * @var{x}, const int @var{incx}, double * @var{y}, const int @var{incy}, const double * @var{P}) @end deftypefun ! @deftypefun void cblas_sscal (const int @var{N}, const float @var{alpha}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dscal (const int @var{N}, const double @var{alpha}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_cscal (const int @var{N}, const void * @var{alpha}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zscal (const int @var{N}, const void * @var{alpha}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_csscal (const int @var{N}, const float @var{alpha}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zdscal (const int @var{N}, const double @var{alpha}, void * @var{x}, const int @var{incx}) @end deftypefun *************** *** 159,358 **** @section Level 2 ! @deftypefun void cblas_sgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{x}, const int @var{incx}, const float @var{beta}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{x}, const int @var{incx}, const float @var{beta}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_strmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float *@var{A}, const int @var{lda}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const float *@var{A}, const int @var{lda}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float *@var{Ap}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_strsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float *@var{A}, const int @var{lda}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const float *@var{A}, const int @var{lda}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float *@var{Ap}, float *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{x}, const int @var{incx}, const double @var{beta}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{x}, const int @var{incx}, const double @var{beta}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dtrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double *@var{A}, const int @var{lda}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const double *@var{A}, const int @var{lda}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double *@var{Ap}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double *@var{A}, const int @var{lda}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const double *@var{A}, const int @var{lda}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double *@var{Ap}, double *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_cgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ctrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{Ap}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{Ap}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ztrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{Ap}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void *@var{A}, const int @var{lda}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void *@var{Ap}, void *@var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ssymv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{x}, const int @var{incx}, const float @var{beta}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ssbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{x}, const int @var{incx}, const float @var{beta}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sspmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{Ap}, const float *@var{x}, const int @var{incx}, const float @var{beta}, float *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sger (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}, float *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_ssyr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, float *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_sspr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, float *@var{Ap}) @end deftypefun ! @deftypefun void cblas_ssyr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}, float *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_sspr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float *@var{x}, const int @var{incx}, const float *@var{y}, const int @var{incy}, float *@var{A}) @end deftypefun ! @deftypefun void cblas_dsymv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{x}, const int @var{incx}, const double @var{beta}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dsbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{x}, const int @var{incx}, const double @var{beta}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dspmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{Ap}, const double *@var{x}, const int @var{incx}, const double @var{beta}, double *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dger (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, const double *@var{y}, const int @var{incy}, double *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dsyr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, double *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dspr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, double *@var{Ap}) @end deftypefun ! @deftypefun void cblas_dsyr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, const double *@var{y}, const int @var{incy}, double *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dspr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double *@var{x}, const int @var{incx}, const double *@var{y}, const int @var{incy}, double *@var{A}) @end deftypefun ! @deftypefun void cblas_chemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_chbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_chpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{Ap}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cgeru (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_cgerc (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_cher (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_chpr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{A}) @end deftypefun ! @deftypefun void cblas_cher2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_chpr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{Ap}) @end deftypefun ! @deftypefun void cblas_zhemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zhbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zhpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{Ap}, const void *@var{x}, const int @var{incx}, const void *@var{beta}, void *@var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zgeru (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zgerc (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zher (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zhpr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const void *@var{x}, const int @var{incx}, void *@var{A}) @end deftypefun ! @deftypefun void cblas_zher2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zhpr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void *@var{alpha}, const void *@var{x}, const int @var{incx}, const void *@var{y}, const int @var{incy}, void *@var{Ap}) @end deftypefun --- 159,358 ---- @section Level 2 ! @deftypefun void cblas_sgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{x}, const int @var{incx}, const float @var{beta}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{x}, const int @var{incx}, const float @var{beta}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_strmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float * @var{A}, const int @var{lda}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const float * @var{A}, const int @var{lda}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float * @var{Ap}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_strsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float * @var{A}, const int @var{lda}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const float * @var{A}, const int @var{lda}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_stpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const float * @var{Ap}, float * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{x}, const int @var{incx}, const double @var{beta}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{x}, const int @var{incx}, const double @var{beta}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dtrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double * @var{A}, const int @var{lda}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const double * @var{A}, const int @var{lda}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double * @var{Ap}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double * @var{A}, const int @var{lda}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const double * @var{A}, const int @var{lda}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_dtpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const double * @var{Ap}, double * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_cgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ctrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{Ap}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ctpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{Ap}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_zgemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zgbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_TRANSPOSE @var{TransA}, const int @var{M}, const int @var{N}, const int @var{KL}, const int @var{KU}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ztrmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{Ap}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztrsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztbsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const int @var{K}, const void * @var{A}, const int @var{lda}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ztpsv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{N}, const void * @var{Ap}, void * @var{x}, const int @var{incx}) @end deftypefun ! @deftypefun void cblas_ssymv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{x}, const int @var{incx}, const float @var{beta}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_ssbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{x}, const int @var{incx}, const float @var{beta}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sspmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{Ap}, const float * @var{x}, const int @var{incx}, const float @var{beta}, float * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_sger (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}, float * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_ssyr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, float * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_sspr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, float * @var{Ap}) @end deftypefun ! @deftypefun void cblas_ssyr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}, float * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_sspr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const float * @var{x}, const int @var{incx}, const float * @var{y}, const int @var{incy}, float * @var{A}) @end deftypefun ! @deftypefun void cblas_dsymv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{x}, const int @var{incx}, const double @var{beta}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dsbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{x}, const int @var{incx}, const double @var{beta}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dspmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{Ap}, const double * @var{x}, const int @var{incx}, const double @var{beta}, double * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_dger (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, const double * @var{y}, const int @var{incy}, double * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dsyr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, double * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dspr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, double * @var{Ap}) @end deftypefun ! @deftypefun void cblas_dsyr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, const double * @var{y}, const int @var{incy}, double * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_dspr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const double * @var{x}, const int @var{incx}, const double * @var{y}, const int @var{incy}, double * @var{A}) @end deftypefun ! @deftypefun void cblas_chemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_chbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_chpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{Ap}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_cgeru (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_cgerc (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_cher (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_chpr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const float @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{A}) @end deftypefun ! @deftypefun void cblas_cher2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_chpr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{Ap}) @end deftypefun ! @deftypefun void cblas_zhemv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zhbmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zhpmv (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{Ap}, const void * @var{x}, const int @var{incx}, const void * @var{beta}, void * @var{y}, const int @var{incy}) @end deftypefun ! @deftypefun void cblas_zgeru (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zgerc (const enum CBLAS_ORDER @var{order}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zher (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zhpr (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const double @var{alpha}, const void * @var{x}, const int @var{incx}, void * @var{A}) @end deftypefun ! @deftypefun void cblas_zher2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{A}, const int @var{lda}) @end deftypefun ! @deftypefun void cblas_zhpr2 (const enum CBLAS_ORDER @var{order}, const enum CBLAS_UPLO @var{Uplo}, const int @var{N}, const void * @var{alpha}, const void * @var{x}, const int @var{incx}, const void * @var{y}, const int @var{incy}, void * @var{Ap}) @end deftypefun *************** *** 361,455 **** ! @deftypefun void cblas_sgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{B}, const int @var{ldb}, const float @var{beta}, float *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{B}, const int @var{ldb}, const float @var{beta}, float *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float @var{beta}, float *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, const float *@var{B}, const int @var{ldb}, const float @var{beta}, float *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_strmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, float *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_strsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float *@var{A}, const int @var{lda}, float *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_dgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{B}, const int @var{ldb}, const double @var{beta}, double *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{B}, const int @var{ldb}, const double @var{beta}, double *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double @var{beta}, double *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, const double *@var{B}, const int @var{ldb}, const double @var{beta}, double *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dtrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, double *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_dtrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double *@var{A}, const int @var{lda}, double *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_cgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ctrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, void *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_ctrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, void *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_zgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ztrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, void *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_ztrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, void *@var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_chemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_cherk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const void *@var{A}, const int @var{lda}, const float @var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_cher2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const float @var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zhemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const void *@var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zherk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const void *@var{A}, const int @var{lda}, const double @var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zher2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void *@var{alpha}, const void *@var{A}, const int @var{lda}, const void *@var{B}, const int @var{ldb}, const double @var{beta}, void *@var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_xerbla (int @var{p}, const char *@var{rout}, const char *@var{form}, ...) @end deftypefun --- 361,455 ---- ! @deftypefun void cblas_sgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{B}, const int @var{ldb}, const float @var{beta}, float * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{B}, const int @var{ldb}, const float @var{beta}, float * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float @var{beta}, float * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ssyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, const float * @var{B}, const int @var{ldb}, const float @var{beta}, float * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_strmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, float * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_strsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const float @var{alpha}, const float * @var{A}, const int @var{lda}, float * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_dgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{B}, const int @var{ldb}, const double @var{beta}, double * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{B}, const int @var{ldb}, const double @var{beta}, double * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double @var{beta}, double * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dsyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, const double * @var{B}, const int @var{ldb}, const double @var{beta}, double * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_dtrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, double * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_dtrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const double @var{alpha}, const double * @var{A}, const int @var{lda}, double * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_cgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_csyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ctrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, void * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_ctrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, void * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_zgemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_TRANSPOSE @var{TransB}, const int @var{M}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsymm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsyrk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zsyr2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_ztrmm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, void * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_ztrsm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{TransA}, const enum CBLAS_DIAG @var{Diag}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, void * @var{B}, const int @var{ldb}) @end deftypefun ! @deftypefun void cblas_chemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_cherk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const float @var{alpha}, const void * @var{A}, const int @var{lda}, const float @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_cher2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const float @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zhemm (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_SIDE @var{Side}, const enum CBLAS_UPLO @var{Uplo}, const int @var{M}, const int @var{N}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const void * @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zherk (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const double @var{alpha}, const void * @var{A}, const int @var{lda}, const double @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_zher2k (const enum CBLAS_ORDER @var{Order}, const enum CBLAS_UPLO @var{Uplo}, const enum CBLAS_TRANSPOSE @var{Trans}, const int @var{N}, const int @var{K}, const void * @var{alpha}, const void * @var{A}, const int @var{lda}, const void * @var{B}, const int @var{ldb}, const double @var{beta}, void * @var{C}, const int @var{ldc}) @end deftypefun ! @deftypefun void cblas_xerbla (int @var{p}, const char * @var{rout}, const char * @var{form}, ...) @end deftypefun *************** *** 459,463 **** The following program computes the product of two matrices using the Level-3 @sc{blas} function @sc{sgemm}, - @tex \beforedisplay --- 459,462 ---- *************** *** 481,484 **** --- 480,484 ---- @end tex @ifinfo + @example [ 0.11 0.12 0.13 ] [ 1011 1012 ] [ 367.76 368.12 ] *************** *** 499,503 **** @example ! gcc demo.c -lgslcblas @end example @noindent --- 499,503 ---- @example ! $ gcc -Wall demo.c -lgslcblas @end example @noindent *************** *** 505,508 **** --- 505,509 ---- case as the @sc{cblas} library is an independent unit. Here is the output from the program, + @example $ ./a.out diff -rc2P gsl-1.6/doc/cheb.texi gsl-1.7/doc/cheb.texi *** gsl-1.6/doc/cheb.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/cheb.texi Sat May 21 13:28:05 2005 *************** *** 17,21 **** @menu ! * The gsl_cheb_series struct:: * Creation and Calculation of Chebyshev Series:: * Chebyshev Series Evaluation:: --- 17,21 ---- @menu ! * Chebyshev Definitions:: * Creation and Calculation of Chebyshev Series:: * Chebyshev Series Evaluation:: *************** *** 25,30 **** @end menu ! @node The gsl_cheb_series struct ! @section The gsl_cheb_series struct A Chebyshev series is stored using the following structure, --- 25,30 ---- @end menu ! @node Chebyshev Definitions ! @section Definitions A Chebyshev series is stored using the following structure, *************** *** 43,47 **** @var{order}+1 terms, including the coefficient @math{c[0]}. The series is computed using the following convention, - @tex \beforedisplay --- 43,46 ---- *************** *** 52,55 **** --- 51,55 ---- @end tex @ifinfo + @example f(x) = (c_0 / 2) + \sum_@{n=1@} c_n T_n(x) *************** *** 151,155 **** @verbatiminclude examples/cheb.c @end example - @noindent The output from the program gives the original function, 10-th order --- 151,154 ---- *************** *** 170,174 **** @item R. Broucke, ``Ten Subroutines for the Manipulation of Chebyshev Series ! [C1] (Algorithm 446)''. @cite{Communications of the ACM} 16(4), 254-256 (1973) @end itemize --- 169,173 ---- @item R. Broucke, ``Ten Subroutines for the Manipulation of Chebyshev Series ! [C1] (Algorithm 446)''. @cite{Communications of the ACM} 16(4), 254--256 (1973) @end itemize diff -rc2P gsl-1.6/doc/combination.texi gsl-1.7/doc/combination.texi *** gsl-1.6/doc/combination.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/combination.texi Sat May 21 13:28:05 2005 *************** *** 3,11 **** This chapter describes functions for creating and manipulating combinations. A combination @math{c} is represented by an array of ! @math{k} integers in the range 0 .. @math{n-1}, where each value ! @math{c_i} is from the range 0 .. @math{n-1} and occurs at most once. The ! combination @math{c} corresponds to indices of @math{k} elements chosen from an ! @math{n} element vector. Combinations are useful for iterating over all ! @math{k}-element subsets of a set. The functions described in this chapter are defined in the header file --- 3,11 ---- This chapter describes functions for creating and manipulating combinations. A combination @math{c} is represented by an array of ! @math{k} integers in the range 0 to @math{n-1}, where each value ! @math{c_i} occurs at most once. The combination @math{c} corresponds to ! indices of @math{k} elements chosen from an @math{n} element vector. ! Combinations are useful for iterating over all @math{k}-element subsets ! of a set. The functions described in this chapter are defined in the header file *************** *** 26,30 **** @section The Combination struct ! A combination is stored by a structure containing three components, the values of @math{n} and @math{k}, and a pointer to the combination array. The elements of the combination array are all of type @code{size_t}, and --- 26,30 ---- @section The Combination struct ! A combination is defined by a structure containing three components, the values of @math{n} and @math{k}, and a pointer to the combination array. The elements of the combination array are all of type @code{size_t}, and *************** *** 64,73 **** @deftypefun void gsl_combination_init_first (gsl_combination * @var{c}) This function initializes the combination @var{c} to the ! lexicographically first combination, i.e. @math{(0,1,2,...,k-1)}. @end deftypefun @deftypefun void gsl_combination_init_last (gsl_combination * @var{c}) This function initializes the combination @var{c} to the ! lexicographically last combination, i.e. @math{(n-k,n-k+1,...,n-1)}. @end deftypefun --- 64,73 ---- @deftypefun void gsl_combination_init_first (gsl_combination * @var{c}) This function initializes the combination @var{c} to the ! lexicographically first combination, i.e. @math{(0,1,2,@dots{},k-1)}. @end deftypefun @deftypefun void gsl_combination_init_last (gsl_combination * @var{c}) This function initializes the combination @var{c} to the ! lexicographically last combination, i.e. @math{(n-k,n-k+1,@dots{},n-1)}. @end deftypefun *************** *** 78,82 **** @deftypefun int gsl_combination_memcpy (gsl_combination * @var{dest}, const gsl_combination * @var{src}) This function copies the elements of the combination @var{src} into the ! combination @var{dest}. The two combinations must have the same sizes. @end deftypefun --- 78,82 ---- @deftypefun int gsl_combination_memcpy (gsl_combination * @var{dest}, const gsl_combination * @var{src}) This function copies the elements of the combination @var{src} into the ! combination @var{dest}. The two combinations must have the same size. @end deftypefun *************** *** 85,94 **** @section Accessing combination elements ! The following function can be used to access combinations elements. @deftypefun size_t gsl_combination_get (const gsl_combination * @var{c}, const size_t @var{i}) This function returns the value of the @var{i}-th element of the combination @var{c}. If @var{i} lies outside the allowed range of 0 to ! @var{k}-1 then the error handler is invoked and 0 is returned. @end deftypefun --- 85,94 ---- @section Accessing combination elements ! The following function can be used to access the elements of a combination. @deftypefun size_t gsl_combination_get (const gsl_combination * @var{c}, const size_t @var{i}) This function returns the value of the @var{i}-th element of the combination @var{c}. If @var{i} lies outside the allowed range of 0 to ! @math{@var{k}-1} then the error handler is invoked and 0 is returned. @end deftypefun *************** *** 97,105 **** @deftypefun size_t gsl_combination_n (const gsl_combination * @var{c}) ! This function returns the @math{n} parameter of the combination @var{c}. @end deftypefun @deftypefun size_t gsl_combination_k (const gsl_combination * @var{c}) ! This function returns the @math{k} parameter of the combination @var{c}. @end deftypefun --- 97,105 ---- @deftypefun size_t gsl_combination_n (const gsl_combination * @var{c}) ! This function returns the range (@math{n}) of the combination @var{c}. @end deftypefun @deftypefun size_t gsl_combination_k (const gsl_combination * @var{c}) ! This function returns the number of elements (@math{k}) in the combination @var{c}. @end deftypefun *************** *** 113,118 **** @cindex testing combination for validity This function checks that the combination @var{c} is valid. The @var{k} ! elements should contain numbers from range 0 .. @var{n}-1, each number ! at most once. The numbers have to be in increasing order. @end deftypefun --- 113,118 ---- @cindex testing combination for validity This function checks that the combination @var{c} is valid. The @var{k} ! elements should lie in the range 0 to @math{@var{n}-1}, with each ! value occurring once at most and in increasing order. @end deftypefun *************** *** 153,158 **** @deftypefun int gsl_combination_fread (FILE * @var{stream}, gsl_combination * @var{c}) ! This function reads into the combination @var{c} from the open stream ! @var{stream} in binary format. The combination @var{c} must be preallocated with correct values of @math{n} and @math{k} since the function uses the size of @var{c} to determine how many bytes to read. --- 153,158 ---- @deftypefun int gsl_combination_fread (FILE * @var{stream}, gsl_combination * @var{c}) ! This function reads elements from the open stream @var{stream} into the ! combination @var{c} in binary format. The combination @var{c} must be preallocated with correct values of @math{n} and @math{k} since the function uses the size of @var{c} to determine how many bytes to read. *************** *** 162,166 **** @end deftypefun ! @deftypefun int gsl_combination_fprintf (FILE * @var{stream}, const gsl_combination * @var{c}, const char *@var{format}) This function writes the elements of the combination @var{c} line-by-line to the stream @var{stream} using the format specifier --- 162,166 ---- @end deftypefun ! @deftypefun int gsl_combination_fprintf (FILE * @var{stream}, const gsl_combination * @var{c}, const char * @var{format}) This function writes the elements of the combination @var{c} line-by-line to the stream @var{stream} using the format specifier *************** *** 193,200 **** @example ! bash$ ./a.out @verbatiminclude examples/combination.out @end example - @noindent @noindent --- 193,199 ---- @example ! $ ./a.out @verbatiminclude examples/combination.out @end example @noindent *************** *** 206,209 **** --- 205,209 ---- @section References and Further Reading + @noindent Further information on combinations can be found in, *************** *** 213,222 **** Generation, Enumeration and Search}, 1998, CRC Press LLC, ISBN 084933988X - - @item - Donald E. Knuth, @cite{The Art of Computer Programming: Combinatorial - Algorithms} (Vol 4, pre-fascicle 2c) - @url{http://www-cs-faculty.stanford.edu/~knuth/fasc2c.ps.gz} @end itemize @noindent --- 213,218 ---- Generation, Enumeration and Search}, 1998, CRC Press LLC, ISBN 084933988X @end itemize @noindent + diff -rc2P gsl-1.6/doc/complex.texi gsl-1.7/doc/complex.texi *** gsl-1.6/doc/complex.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/complex.texi Sat May 21 13:28:05 2005 *************** *** 13,19 **** Mathematical Functions}. The functions return principal values which are the same as those in GNU Calc, which in turn are the same as those in ! @cite{Common Lisp, The Language (Second Edition)} (n.b. The second ! edition uses different definitions from the first edition) and the ! HP-28/48 series of calculators. The complex types are defined in the header file @file{gsl_complex.h}, --- 13,19 ---- Mathematical Functions}. The functions return principal values which are the same as those in GNU Calc, which in turn are the same as those in ! @cite{Common Lisp, The Language (Second Edition)}@footnote{Note that the ! first edition uses different definitions.} and the HP-28/48 series of ! calculators. The complex types are defined in the header file @file{gsl_complex.h}, *************** *** 264,268 **** @deftypefun gsl_complex gsl_complex_sin (gsl_complex @var{z}) ! @cindex sin of complex number This function returns the complex sine of the complex number @var{z}, @math{\sin(z) = (\exp(iz) - \exp(-iz))/(2i)}. --- 264,268 ---- @deftypefun gsl_complex gsl_complex_sin (gsl_complex @var{z}) ! @cindex sin, of complex number This function returns the complex sine of the complex number @var{z}, @math{\sin(z) = (\exp(iz) - \exp(-iz))/(2i)}. *************** *** 310,314 **** This function returns the complex arcsine of the real number @var{z}, @math{\arcsin(z)}. For @math{z} between @math{-1} and @math{1}, the ! function returns a real value in the range @math{(-\pi,\pi]}. For @math{z} less than @math{-1} the result has a real part of @math{-\pi/2} and a positive imaginary part. For @math{z} greater than @math{1} the --- 310,314 ---- This function returns the complex arcsine of the real number @var{z}, @math{\arcsin(z)}. For @math{z} between @math{-1} and @math{1}, the ! function returns a real value in the range @math{[-\pi/2,\pi/2]}. For @math{z} less than @math{-1} the result has a real part of @math{-\pi/2} and a positive imaginary part. For @math{z} greater than @math{1} the *************** *** 326,330 **** @math{\arccos(z)}. For @math{z} between @math{-1} and @math{1}, the function returns a real value in the range @math{[0,\pi]}. For @math{z} ! less than @math{-1} the result has a real part of @math{\pi/2} and a negative imaginary part. For @math{z} greater than @math{1} the result is purely imaginary and positive. --- 326,330 ---- @math{\arccos(z)}. For @math{z} between @math{-1} and @math{1}, the function returns a real value in the range @math{[0,\pi]}. For @math{z} ! less than @math{-1} the result has a real part of @math{\pi} and a negative imaginary part. For @math{z} greater than @math{1} the result is purely imaginary and positive. *************** *** 455,467 **** @item T. E. Hull, Thomas F. Fairgrieve, Ping Tak Peter Tang, ! "Implementing Complex Elementary Functions Using Exception ! Handling", @cite{ACM Transactions on Mathematical Software}, Volume 20 ! (1994), pp 215-244, Corrigenda, p553 @item T. E. Hull, Thomas F. Fairgrieve, Ping Tak Peter Tang, ! "Implementing the complex arcsin and arccosine functions using exception ! handling", @cite{ACM Transactions on Mathematical Software}, Volume 23 ! (1997) pp 299-335 @end itemize @noindent --- 455,467 ---- @item T. E. Hull, Thomas F. Fairgrieve, Ping Tak Peter Tang, ! ``Implementing Complex Elementary Functions Using Exception ! Handling'', @cite{ACM Transactions on Mathematical Software}, Volume 20 ! (1994), pp 215--244, Corrigenda, p553 @item T. E. Hull, Thomas F. Fairgrieve, Ping Tak Peter Tang, ! ``Implementing the complex arcsin and arccosine functions using exception ! handling'', @cite{ACM Transactions on Mathematical Software}, Volume 23 ! (1997) pp 299--335 @end itemize @noindent *************** *** 472,482 **** @item Abramowitz and Stegun, @cite{Handbook of Mathematical Functions}, ! "Circular Functions in Terms of Real and Imaginary Parts", Formulas 4.3.55--58, ! "Inverse Circular Functions in Terms of Real and Imaginary Parts", Formulas 4.4.37--39, ! "Hyperbolic Functions in Terms of Real and Imaginary Parts", Formulas 4.5.49--52, ! "Inverse Hyperbolic Functions -- relation to Inverse Circular Functions", Formulas 4.6.14--19. --- 472,482 ---- @item Abramowitz and Stegun, @cite{Handbook of Mathematical Functions}, ! ``Circular Functions in Terms of Real and Imaginary Parts'', Formulas 4.3.55--58, ! ``Inverse Circular Functions in Terms of Real and Imaginary Parts'', Formulas 4.4.37--39, ! ``Hyperbolic Functions in Terms of Real and Imaginary Parts'', Formulas 4.5.49--52, ! ``Inverse Hyperbolic Functions---relation to Inverse Circular Functions'', Formulas 4.6.14--19. diff -rc2P gsl-1.6/doc/const.texi gsl-1.7/doc/const.texi *** gsl-1.6/doc/const.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/const.texi Sat May 21 13:28:05 2005 *************** *** 22,28 **** * Measurement of Time:: * Imperial Units :: ! * Nautical Units:: * Printers Units:: ! * Volume:: * Mass and Weight :: * Thermal Energy and Power:: --- 22,28 ---- * Measurement of Time:: * Imperial Units :: ! * Speed and Nautical Units:: * Printers Units:: ! * Volume Area and Length:: * Mass and Weight :: * Thermal Energy and Power:: *************** *** 83,98 **** @item GSL_CONST_MKSA_GAUSS The magnetic field of 1 Gauss. - - @item GSL_CONST_MKSA_MICRON - The length of 1 micron. - - @item GSL_CONST_MKSA_HECTARE - The area of 1 hectare. - - @item GSL_CONST_MKSA_MILES_PER_HOUR - The speed of 1 mile per hour. - - @item GSL_CONST_MKSA_KILOMETERS_PER_HOUR - The speed of 1 kilometer per hour. @end table --- 83,86 ---- *************** *** 220,228 **** ! @node Nautical Units ! @section Nautical Units @cindex nautical units @table @code @item GSL_CONST_MKSA_NAUTICAL_MILE The length of 1 nautical mile. --- 208,222 ---- ! @node Speed and Nautical Units ! @section Speed and Nautical Units @cindex nautical units @table @code + @item GSL_CONST_MKSA_KILOMETERS_PER_HOUR + The speed of 1 kilometer per hour. + + @item GSL_CONST_MKSA_MILES_PER_HOUR + The speed of 1 mile per hour. + @item GSL_CONST_MKSA_NAUTICAL_MILE The length of 1 nautical mile. *************** *** 249,257 **** ! @node Volume ! @section Volume @cindex volume units @table @code @item GSL_CONST_MKSA_ACRE The area of 1 acre. --- 243,257 ---- ! @node Volume Area and Length ! @section Volume, Area and Length @cindex volume units @table @code + @item GSL_CONST_MKSA_MICRON + The length of 1 micron. + + @item GSL_CONST_MKSA_HECTARE + The area of 1 hectare. + @item GSL_CONST_MKSA_ACRE The area of 1 acre. *************** *** 536,547 **** The required data is the average distance of each planet from the Sun in ! astronomical units (the eccentricities of the orbits will be neglected ! for the purposes of this calculation). The average radius of the orbit ! of Mars is 1.52 astronomical units, and for the orbit of Earth it is 1 ! astronomical unit (by definition). These values are combined with the ! MKSA values of the constants for the speed of light and the length of an ! astronomical unit to produce a result for the shortest and longest ! light-travel times in seconds. The figures are converted into minutes ! before being displayed. @example --- 536,547 ---- The required data is the average distance of each planet from the Sun in ! astronomical units (the eccentricities and inclinations of the orbits ! will be neglected for the purposes of this calculation). The average ! radius of the orbit of Mars is 1.52 astronomical units, and for the ! orbit of Earth it is 1 astronomical unit (by definition). These values ! are combined with the MKSA values of the constants for the speed of ! light and the length of an astronomical unit to produce a result for the ! shortest and longest light-travel times in seconds. The figures are ! converted into minutes before being displayed. @example *************** *** 558,566 **** @section References and Further Reading ! Further information on the values of physical constants is available ! from the NIST website, @itemize @asis ! @item ! @uref{http://www.physics.nist.gov/cuu/Constants/index.html} @end itemize --- 558,571 ---- @section References and Further Reading ! The authoritative sources for physical constanst are the 2002 CODATA ! recommended values, published in the articles below. Further information ! on the values of physical constants is also available from the cited ! articles and the NIST website. @itemize @asis ! @item Journal of Physical and Chemical Reference Data, 28(6), 1713-1852, 1999 ! @item Reviews of Modern Physics, 72(2), 351-495, 2000 ! @item @uref{http://www.physics.nist.gov/cuu/Constants/index.html} ! @item @uref{http://physics.nist.gov/Pubs/SP811/appenB9.html} @end itemize + diff -rc2P gsl-1.6/doc/debug.texi gsl-1.7/doc/debug.texi *** gsl-1.6/doc/debug.texi Fri Nov 12 17:20:42 2004 --- gsl-1.7/doc/debug.texi Sat May 21 13:28:05 2005 *************** *** 38,42 **** status = gsl_fft_complex_wavetable_alloc (0, &complex_wavetable); @end smallexample - @noindent The function @code{gsl_fft_complex_wavetable_alloc} takes the length of --- 38,41 ---- *************** *** 48,52 **** @smallexample ! bash$ gdb test_trap GDB is free software and you are welcome to distribute copies --- 47,51 ---- @smallexample ! $ gdb test_trap GDB is free software and you are welcome to distribute copies *************** *** 58,62 **** Breakpoint 1 at 0x8050b1e: file error.c, line 14. @end smallexample - @noindent When we run the program this breakpoint catches the error and shows the --- 57,60 ---- *************** *** 255,259 **** -fshort-enums -fno-common -Dinline= -g -O4 @end example - @noindent For details of each option consult the manual @cite{Using and Porting --- 253,256 ---- *************** *** 369,370 **** --- 366,378 ---- Source-Level Debugger}, Free Software Foundation, ISBN 1882114779 @end itemize + @noindent + For a tutorial introduction to the GNU C Compiler and related programs, + see + + @itemize @asis + @item + B.J. Gough, @cite{An Introduction to GCC}, Network Theory Ltd, ISBN + 0954161793 + @end itemize + + diff -rc2P gsl-1.6/doc/dht.texi gsl-1.7/doc/dht.texi *** gsl-1.6/doc/dht.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/dht.texi Sat May 21 13:28:05 2005 *************** *** 24,28 **** Then the finite @math{\nu}-Hankel transform of @math{f(t)} is defined to be the set of numbers @math{g_m} given by, - @tex \beforedisplay --- 24,27 ---- *************** *** 32,39 **** \afterdisplay @end tex - @noindent so that, - @tex \beforedisplay --- 31,36 ---- *************** *** 43,62 **** \afterdisplay @end tex - @noindent Suppose that @math{f} is band-limited in the sense that @math{g_m=0} for @math{m > M}. Then we have the following fundamental sampling theorem. - @tex \beforedisplay $$ g_m = {{2}\over{j_{\nu,M}^2}} ! \sum_{k=1}^{M-1} f({{j_{\nu,k}}\over{j_{\nu,M}}}) {{J_\nu(j_{\nu,m} j_{\nu,k} / j_{\nu,M})}\over{J_{\nu+1}(j_{\nu,k})^2}}. $$ \afterdisplay @end tex - @noindent It is this discrete expression which defines the discrete Hankel --- 40,56 ---- \afterdisplay @end tex @noindent Suppose that @math{f} is band-limited in the sense that @math{g_m=0} for @math{m > M}. Then we have the following fundamental sampling theorem. @tex \beforedisplay $$ g_m = {{2}\over{j_{\nu,M}^2}} ! \sum_{k=1}^{M-1} f\left({{j_{\nu,k}}\over{j_{\nu,M}}}\right) {{J_\nu(j_{\nu,m} j_{\nu,k} / j_{\nu,M})}\over{J_{\nu+1}(j_{\nu,k})^2}}. $$ \afterdisplay @end tex @noindent It is this discrete expression which defines the discrete Hankel *************** *** 111,116 **** @deftypefun double gsl_dht_x_sample (const gsl_dht * @var{t}, int @var{n}) ! This function returns the value of the n'th sample point in the unit interval, ! @c{${{j_{\nu,n+1}}\over{j_{\nu,M}}} X$} @math{(j_@{\nu,n+1@}/j_@{\nu,M@}) X}. These are the points where the function @math{f(t)} is assumed to be sampled. --- 105,110 ---- @deftypefun double gsl_dht_x_sample (const gsl_dht * @var{t}, int @var{n}) ! This function returns the value of the @var{n}-th sample point in the unit interval, ! @c{${({j_{\nu,n+1}} / {j_{\nu,M}}}) X$} @math{(j_@{\nu,n+1@}/j_@{\nu,M@}) X}. These are the points where the function @math{f(t)} is assumed to be sampled. *************** *** 118,123 **** @deftypefun double gsl_dht_k_sample (const gsl_dht * @var{t}, int @var{n}) ! This function returns the value of the n'th sample point in "k-space", ! @c{${{j_{\nu,n+1}}\over X}$} @math{j_@{\nu,n+1@}/X}. @end deftypefun --- 112,117 ---- @deftypefun double gsl_dht_k_sample (const gsl_dht * @var{t}, int @var{n}) ! This function returns the value of the @var{n}-th sample point in ``k-space'', ! @c{${{j_{\nu,n+1}} / X}$} @math{j_@{\nu,n+1@}/X}. @end deftypefun *************** *** 130,138 **** @itemize @asis @item ! H. Fisk Johnson, Comp. Phys. Comm. 43, 181 (1987). @end itemize @itemize @asis @item ! D. Lemoine, J. Chem. Phys. 101, 3936 (1994). @end itemize --- 124,132 ---- @itemize @asis @item ! H. Fisk Johnson, Comp.@: Phys.@: Comm.@: 43, 181 (1987). @end itemize @itemize @asis @item ! D. Lemoine, J. Chem.@: Phys.@: 101, 3936 (1994). @end itemize diff -rc2P gsl-1.6/doc/diff.texi gsl-1.7/doc/diff.texi *** gsl-1.6/doc/diff.texi Fri Nov 12 17:19:53 2004 --- gsl-1.7/doc/diff.texi Sat May 21 13:28:05 2005 *************** *** 19,23 **** @section Functions ! @deftypefun int gsl_deriv_central (const gsl_function *@var{f}, double @var{x}, double @var{h}, double *@var{result}, double *@var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive central difference algorithm with --- 19,23 ---- @section Functions ! @deftypefun int gsl_deriv_central (const gsl_function * @var{f}, double @var{x}, double @var{h}, double * @var{result}, double * @var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive central difference algorithm with *************** *** 36,40 **** @end deftypefun ! @deftypefun int gsl_deriv_forward (const gsl_function *@var{f}, double @var{x}, double @var{h}, double *@var{result}, double *@var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive forward difference algorithm with --- 36,40 ---- @end deftypefun ! @deftypefun int gsl_deriv_forward (const gsl_function * @var{f}, double @var{x}, double @var{h}, double * @var{result}, double * @var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive forward difference algorithm with *************** *** 54,58 **** @end deftypefun ! @deftypefun int gsl_deriv_backward (const gsl_function *@var{f}, double @var{x}, double @var{h}, double *@var{result}, double *@var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive backward difference algorithm --- 54,58 ---- @end deftypefun ! @deftypefun int gsl_deriv_backward (const gsl_function * @var{f}, double @var{x}, double @var{h}, double * @var{result}, double * @var{abserr}) This function computes the numerical derivative of the function @var{f} at the point @var{x} using an adaptive backward difference algorithm diff -rc2P gsl-1.6/doc/dwt-orig.eps gsl-1.7/doc/dwt-orig.eps *** gsl-1.6/doc/dwt-orig.eps Fri Jul 23 16:55:12 2004 --- gsl-1.7/doc/dwt-orig.eps Mon Aug 22 15:25:31 2005 *************** *** 295,299 **** fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 [FontBBox] 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { --- 295,299 ---- fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 /FontBBox load 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { diff -rc2P gsl-1.6/doc/dwt-samp.eps gsl-1.7/doc/dwt-samp.eps *** gsl-1.6/doc/dwt-samp.eps Fri Jul 23 16:55:12 2004 --- gsl-1.7/doc/dwt-samp.eps Mon Aug 22 15:25:31 2005 *************** *** 295,299 **** fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 [FontBBox] 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { --- 295,299 ---- fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 /FontBBox load 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { diff -rc2P gsl-1.6/doc/dwt.texi gsl-1.7/doc/dwt.texi *** gsl-1.6/doc/dwt.texi Fri Jul 23 16:55:12 2004 --- gsl-1.7/doc/dwt.texi Sat May 21 13:28:05 2005 *************** *** 1,7 **** ! @cindex Wavelets ! @cindex Discrete wavelet transforms, see Wavelets ! @cindex DWT, see Wavelets ! @cindex Wavelet transforms, discrete, see Wavelets ! @cindex transforms, Wavelet, see Wavelets This chapter describes functions for performing Discrete Wavelet --- 1,5 ---- ! @cindex DWT, see wavelet transforms ! @cindex wavelet transforms ! @cindex transforms, wavelet This chapter describes functions for performing Discrete Wavelet *************** *** 24,28 **** The continuous wavelet transform and its inverse are defined by the relations, - @tex \beforedisplay --- 22,25 ---- *************** *** 33,44 **** @end tex @ifinfo @example w(s,\tau) = \int f(t) * \psi^*_@{s,\tau@}(t) dt @end example @end ifinfo - @noindent and, - @tex \beforedisplay --- 30,40 ---- @end tex @ifinfo + @example w(s,\tau) = \int f(t) * \psi^*_@{s,\tau@}(t) dt @end example @end ifinfo @noindent and, @tex \beforedisplay *************** *** 49,52 **** --- 45,49 ---- @end tex @ifinfo + @example f(t) = \int \int_@{-\infty@}^\infty w(s, \tau) * \psi_@{s,\tau@}(t) d\tau ds *************** *** 59,66 **** wavelet}. ! The discrete version of the wavelet transform acts on evenly sampled ! data, with fixed scaling and translation steps (@math{s}, @math{\tau}). ! The frequency and time axes are sampled @dfn{dyadically} on scales of ! @math{2^j} through a level parameter @math{j}. @c The wavelet @math{\psi} @c can be expressed in terms of a scaling function @math{\varphi}, --- 56,63 ---- wavelet}. ! The discrete version of the wavelet transform acts on equally-spaced ! samples, with fixed scaling and translation steps (@math{s}, ! @math{\tau}). The frequency and time axes are sampled @dfn{dyadically} ! on scales of @math{2^j} through a level parameter @math{j}. @c The wavelet @math{\psi} @c can be expressed in terms of a scaling function @math{\varphi}, *************** *** 116,121 **** The @code{gsl_wavelet} structure contains the filter coefficients ! defining the wavelet and associated offset parameters (for wavelets with ! centered support). @deftypefun {gsl_wavelet *} gsl_wavelet_alloc (const gsl_wavelet_type * @var{T}, size_t @var{k}) --- 113,117 ---- The @code{gsl_wavelet} structure contains the filter coefficients ! defining the wavelet and any associated offset parameters. @deftypefun {gsl_wavelet *} gsl_wavelet_alloc (const gsl_wavelet_type * @var{T}, size_t @var{k}) *************** *** 135,139 **** vanishing moments. The implemented wavelets are @c{$k=4, 6, \dots, 20$} ! @math{k=4, 6, ..., 20}, with @var{k} even. @end deffn --- 131,135 ---- vanishing moments. The implemented wavelets are @c{$k=4, 6, \dots, 20$} ! @math{k=4, 6, @dots{}, 20}, with @var{k} even. @end deffn *************** *** 174,179 **** The @code{gsl_wavelet_workspace} structure contains scratch space of the ! same size as the input data, for holding intermediate results during the ! transform. @deftypefun {gsl_wavelet_workspace *} gsl_wavelet_workspace_alloc (size_t @var{n}) --- 170,175 ---- The @code{gsl_wavelet_workspace} structure contains scratch space of the ! same size as the input data and is used to hold intermediate results ! during the transform. @deftypefun {gsl_wavelet_workspace *} gsl_wavelet_workspace_alloc (size_t @var{n}) *************** *** 186,191 **** @end deftypefun ! @deftypefun {void} gsl_wavelet_workspace_free (gsl_wavelet_workspace * @var{workspace}) ! This function frees the allocated workspace @var{workspace}. @end deftypefun --- 182,187 ---- @end deftypefun ! @deftypefun {void} gsl_wavelet_workspace_free (gsl_wavelet_workspace * @var{work}) ! This function frees the allocated workspace @var{work}. @end deftypefun *************** *** 208,214 **** @cindex DWT, one dimensional ! @deftypefun int gsl_dwt_transform (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_direction @var{dir}, gsl_wavelet_workspace * @var{work}) ! @deftypefunx int gsl_dwt_transform_forward (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_workspace * @var{work}) ! @deftypefunx int gsl_dwt_transform_inverse (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_workspace * @var{work}) These functions compute in-place forward and inverse discrete wavelet --- 204,210 ---- @cindex DWT, one dimensional ! @deftypefun int gsl_wavelet_transform (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_direction @var{dir}, gsl_wavelet_workspace * @var{work}) ! @deftypefunx int gsl_wavelet_transform_forward (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_workspace * @var{work}) ! @deftypefunx int gsl_wavelet_transform_inverse (const gsl_wavelet * @var{w}, double * @var{data}, size_t @var{stride}, size_t @var{n}, gsl_wavelet_workspace * @var{work}) These functions compute in-place forward and inverse discrete wavelet *************** *** 233,237 **** The total number of levels is @math{J = \log_2(n)}. The output data has the following form, - @tex \beforedisplay --- 229,232 ---- *************** *** 242,245 **** --- 237,241 ---- @end tex @ifinfo + @example (s_@{-1,0@}, d_@{0,0@}, d_@{1,0@}, d_@{1,1@}, d_@{2,0@}, ..., *************** *** 268,284 **** ``standard'' and ``non-standard'' forms. ! The ``standard'' transform performs a discrete wavelet transform on all ! rows of the matrix, followed by a separate discrete wavelet transform on ! the columns of the resulting row-transformed matrix. This procedure ! uses the same ordering as a two-dimensional fourier transform. ! ! The ``non-standard'' transform is performed in interleaved passes of the ! each level of the transform on the rows and columns of the matrix. The ! first level of the transform is carried out on the matrix rows, and then ! the columns of the partially row-transformed data. This procedure is ! then repeated across the rows and columns of the data for the subsequent ! levels of the transform, until the full discrete wavelet transform is ! complete. The non-standard form of the discrete wavelet transform is ! typically used in image analysis. The functions described in this section are declared in the header file --- 264,280 ---- ``standard'' and ``non-standard'' forms. ! The ``standard'' transform performs a complete discrete wavelet ! transform on the rows of the matrix, followed by a separate complete ! discrete wavelet transform on the columns of the resulting ! row-transformed matrix. This procedure uses the same ordering as a ! two-dimensional fourier transform. ! ! The ``non-standard'' transform is performed in interleaved passes on the ! rows and columns of the matrix for each level of the transform. The ! first level of the transform is applied to the matrix rows, and then to ! the matrix columns. This procedure is then repeated across the rows and ! columns of the data for the subsequent levels of the transform, until ! the full discrete wavelet transform is complete. The non-standard form ! of the discrete wavelet transform is typically used in image analysis. The functions described in this section are declared in the header file *************** *** 328,332 **** @node DWT Examples ! @section Example The following program demonstrates the use of the one-dimensional --- 324,328 ---- @node DWT Examples ! @section Examples The following program demonstrates the use of the one-dimensional *************** *** 354,361 **** @center @image{dwt-orig,3.4in} @center @image{dwt-samp,3.4in} ! @display Original (upper) and wavelet-compressed (lower) ECG signals, using the 20 largest components of the Daubechies(4) discrete wavelet transform. ! @end display @end iftex --- 350,357 ---- @center @image{dwt-orig,3.4in} @center @image{dwt-samp,3.4in} ! @quotation Original (upper) and wavelet-compressed (lower) ECG signals, using the 20 largest components of the Daubechies(4) discrete wavelet transform. ! @end quotation @end iftex *************** *** 388,392 **** @itemize @asis @item ! St@'ephane Mallat. @cite{A wavelet tour of signal processing} (Second edition). Academic Press (1999), ISBN 012466606X. @end itemize --- 384,388 ---- @itemize @asis @item ! S. G. Mallat. @cite{A wavelet tour of signal processing} (Second edition). Academic Press (1999), ISBN 012466606X. @end itemize *************** *** 405,409 **** @item S. G. Mallat. ! A Theory for Multiresolution Signal Decomposition --- The Wavelet Representation. @cite{IEEE Transactions on Pattern Analysis and Machine Intelligence}, 11, 1989, 674--693. --- 401,405 ---- @item S. G. Mallat. ! A Theory for Multiresolution Signal Decomposition---The Wavelet Representation. @cite{IEEE Transactions on Pattern Analysis and Machine Intelligence}, 11, 1989, 674--693. diff -rc2P gsl-1.6/doc/eigen.texi gsl-1.7/doc/eigen.texi *** gsl-1.6/doc/eigen.texi Fri Nov 12 17:16:43 2004 --- gsl-1.7/doc/eigen.texi Sat May 21 13:28:05 2005 *************** *** 11,15 **** large matrices will want to use the sophisticated routines found in @sc{lapack}. The Fortran version of @sc{lapack} is recommended as the ! standard package for linear algebra. The functions described in this chapter are declared in the header file --- 11,15 ---- large matrices will want to use the sophisticated routines found in @sc{lapack}. The Fortran version of @sc{lapack} is recommended as the ! standard package for large-scale linear algebra. The functions described in this chapter are declared in the header file diff -rc2P gsl-1.6/doc/err.texi gsl-1.7/doc/err.texi *** gsl-1.6/doc/err.texi Mon Jun 2 15:43:49 2003 --- gsl-1.7/doc/err.texi Sat May 21 13:28:05 2005 *************** *** 70,74 **** file @file{gsl_errno.h}. They all have the prefix @code{GSL_} and expand to non-zero constant integer values. Many of the error codes use ! the same base name as a corresponding error code in C library. Here are some of the most common error codes, --- 70,74 ---- file @file{gsl_errno.h}. They all have the prefix @code{GSL_} and expand to non-zero constant integer values. Many of the error codes use ! the same base name as the corresponding error code in the C library. Here are some of the most common error codes, *************** *** 223,227 **** return gsl_errno; @end example - @noindent The macro definition in @file{gsl_errno.h} actually wraps the code --- 223,226 ---- diff -rc2P gsl-1.6/doc/examples/dwt.c gsl-1.7/doc/examples/dwt.c *** gsl-1.6/doc/examples/dwt.c Fri Jul 23 16:55:12 2004 --- gsl-1.7/doc/examples/dwt.c Sat May 21 13:28:05 2005 *************** *** 12,15 **** --- 12,21 ---- size_t *p = malloc (n * sizeof (size_t)); + gsl_wavelet *w; + gsl_wavelet_workspace *work; + + w = gsl_wavelet_alloc (gsl_wavelet_daubechies, 4); + work = gsl_wavelet_workspace_alloc (n); + FILE *f = fopen (argv[1], "r"); for (i = 0; i < n; i++) *************** *** 19,43 **** fclose (f); ! { ! gsl_wavelet *w = gsl_wavelet_alloc (gsl_wavelet_daubechies, 4); ! gsl_wavelet_workspace *work = gsl_wavelet_workspace_alloc (n); ! ! gsl_wavelet_transform_forward (w, data, 1, n, work); ! ! for (i = 0; i < n; i++) ! { ! abscoeff[i] = fabs (data[i]); ! } ! ! gsl_sort_index (p, abscoeff, 1, n); ! ! for (i = 0; (i + nc) < n; i++) ! data[p[i]] = 0; ! ! gsl_wavelet_transform_inverse (w, data, 1, n, work); ! } for (i = 0; i < n; i++) { printf ("%g\n", data[i]); } --- 25,44 ---- fclose (f); ! gsl_wavelet_transform_forward (w, data, 1, n, work); for (i = 0; i < n; i++) { + abscoeff[i] = fabs (data[i]); + } + + gsl_sort_index (p, abscoeff, 1, n); + + for (i = 0; (i + nc) < n; i++) + data[p[i]] = 0; + + gsl_wavelet_transform_inverse (w, data, 1, n, work); + + for (i = 0; i < n; i++) + { printf ("%g\n", data[i]); } diff -rc2P gsl-1.6/doc/examples/fft.c gsl-1.7/doc/examples/fft.c *** gsl-1.6/doc/examples/fft.c Mon Jun 2 15:44:49 2003 --- gsl-1.7/doc/examples/fft.c Sat May 21 13:28:06 2005 *************** *** 10,20 **** main (void) { ! int i; ! double data[2*128]; for (i = 0; i < 128; i++) { ! REAL(data,i) = 0.0; ! IMAG(data,i) = 0.0; } --- 10,18 ---- main (void) { ! int i; double data[2*128]; for (i = 0; i < 128; i++) { ! REAL(data,i) = 0.0; IMAG(data,i) = 0.0; } diff -rc2P gsl-1.6/doc/examples/histogram.c gsl-1.7/doc/examples/histogram.c *** gsl-1.6/doc/examples/histogram.c Fri Jun 20 15:19:08 2003 --- gsl-1.7/doc/examples/histogram.c Sat May 21 13:28:06 2005 *************** *** 24,30 **** { double x; - gsl_histogram * h = gsl_histogram_alloc (n); - gsl_histogram_set_ranges_uniform (h, a, b); --- 24,28 ---- *************** *** 33,42 **** gsl_histogram_increment (h, x); } - gsl_histogram_fprintf (stdout, h, "%g", "%g"); - gsl_histogram_free (h); } - exit (0); } --- 31,37 ---- diff -rc2P gsl-1.6/doc/examples/matrix.c gsl-1.7/doc/examples/matrix.c *** gsl-1.6/doc/examples/matrix.c Fri Mar 5 14:12:41 2004 --- gsl-1.7/doc/examples/matrix.c Sat May 21 13:28:06 2005 *************** *** 12,16 **** gsl_matrix_set (m, i, j, 0.23 + 100*i + j); ! for (i = 0; i < 10; i++) for (j = 0; j < 3; j++) printf ("m(%d,%d) = %g\n", i, j, --- 12,16 ---- gsl_matrix_set (m, i, j, 0.23 + 100*i + j); ! for (i = 0; i < 100; i++) for (j = 0; j < 3; j++) printf ("m(%d,%d) = %g\n", i, j, diff -rc2P gsl-1.6/doc/examples/polyroots.c gsl-1.7/doc/examples/polyroots.c *** gsl-1.6/doc/examples/polyroots.c Mon Jun 2 16:06:41 2003 --- gsl-1.7/doc/examples/polyroots.c Sat May 21 13:28:06 2005 *************** *** 6,10 **** { int i; ! /* coefficient of P(x) = -1 + x^5 */ double a[6] = { -1, 0, 0, 0, 0, 1 }; double z[10]; --- 6,10 ---- { int i; ! /* coefficients of P(x) = -1 + x^5 */ double a[6] = { -1, 0, 0, 0, 0, 1 }; double z[10]; diff -rc2P gsl-1.6/doc/fdl.texi gsl-1.7/doc/fdl.texi *** gsl-1.6/doc/fdl.texi Sun Jun 20 18:40:13 2004 --- gsl-1.7/doc/fdl.texi Sun Jun 26 13:25:34 2005 *************** *** 1,11 **** @cindex FDL, GNU Free Documentation License @center Version 1.2, November 2002 @display Copyright @copyright{} 2000,2001,2002 Free Software Foundation, Inc. ! 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA ! Everyone is permitted to copy and distribute verbatim copies ! of this license document, but changing it is not allowed. @end display --- 1,14 ---- @cindex FDL, GNU Free Documentation License @center Version 1.2, November 2002 + @iftex + @smallerfonts @rm + @end iftex @display Copyright @copyright{} 2000,2001,2002 Free Software Foundation, Inc. ! 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA ! Everyone is permitted to copy and distribute verbatim copies of this license ! document, but changing it is not allowed. @end display *************** *** 405,409 **** @page ! @unnumberedsec ADDENDUM: How to use this License for your documents To use this License in a document you have written, include a copy of --- 408,412 ---- @page ! @heading ADDENDUM: How to use this License for your documents To use this License in a document you have written, include a copy of *************** *** 413,423 **** @smallexample @group ! Copyright (C) @var{year} @var{your name}. ! Permission is granted to copy, distribute and/or modify this document ! under the terms of the GNU Free Documentation License, Version 1.2 ! or any later version published by the Free Software Foundation; ! with no Invariant Sections, no Front-Cover Texts, and no Back-Cover ! Texts. A copy of the license is included in the section entitled ``GNU ! Free Documentation License''. @end group @end smallexample --- 416,427 ---- @smallexample @group ! Copyright (C) @var{year} @var{your name}. ! Permission is granted to copy, distribute and/or modify ! this document under the terms of the GNU Free ! Documentation License, Version 1.2 or any later version ! published by the Free Software Foundation; with no ! Invariant Sections, no Front-Cover Texts, and no ! Back-Cover Texts. A copy of the license is included in ! the section entitled ``GNU Free Documentation License''. @end group @end smallexample *************** *** 428,434 **** @smallexample @group ! with the Invariant Sections being @var{list their titles}, with ! the Front-Cover Texts being @var{list}, and with the Back-Cover Texts ! being @var{list}. @end group @end smallexample --- 432,438 ---- @smallexample @group ! with the Invariant Sections being @var{list their ! titles}, with the Front-Cover Texts being @var{list}, and ! with the Back-Cover Texts being @var{list}. @end group @end smallexample *************** *** 443,446 **** --- 447,453 ---- to permit their use in free software. + @iftex + @textfonts @rm + @end iftex @c Local Variables: @c ispell-local-pdict: "ispell-dict" diff -rc2P gsl-1.6/doc/fft.texi gsl-1.7/doc/fft.texi *** gsl-1.6/doc/fft.texi Mon Nov 29 14:54:51 2004 --- gsl-1.7/doc/fft.texi Sat May 21 13:28:05 2005 *************** *** 10,14 **** efficiency there are separate versions of the routines for real data and for complex data. The mixed-radix routines are a reimplementation of the ! @sc{fftpack} library by Paul Swarztrauber. Fortran code for @sc{fftpack} is available on Netlib (@sc{fftpack} also includes some routines for sine and cosine transforms but these are currently not available in GSL). For --- 10,14 ---- efficiency there are separate versions of the routines for real data and for complex data. The mixed-radix routines are a reimplementation of the ! @sc{fftpack} library of Paul Swarztrauber. Fortran code for @sc{fftpack} is available on Netlib (@sc{fftpack} also includes some routines for sine and cosine transforms but these are currently not available in GSL). For *************** *** 33,37 **** Fast Fourier Transforms are efficient algorithms for calculating the discrete fourier transform (DFT), - @tex \beforedisplay --- 33,36 ---- *************** *** 42,45 **** --- 41,45 ---- @end tex @ifinfo + @example x_j = \sum_@{k=0@}^@{N-1@} z_k \exp(-2\pi i j k / N) *************** *** 68,72 **** @c{$x = \hbox{FFT}(z)$} @math{x = FFT(z)}, is, - @tex \beforedisplay --- 68,71 ---- *************** *** 77,90 **** @end tex @ifinfo @example x_j = \sum_@{k=0@}^@{N-1@} z_k \exp(-2\pi i j k / N) @end example @end ifinfo - @noindent and the definition of the @dfn{inverse fourier transform}, @c{$x = \hbox{IFFT}(z)$} @math{x = IFFT(z)}, is, - @tex \beforedisplay --- 76,88 ---- @end tex @ifinfo + @example x_j = \sum_@{k=0@}^@{N-1@} z_k \exp(-2\pi i j k / N) @end example @end ifinfo @noindent and the definition of the @dfn{inverse fourier transform}, @c{$x = \hbox{IFFT}(z)$} @math{x = IFFT(z)}, is, @tex \beforedisplay *************** *** 95,103 **** @end tex @ifinfo @example z_j = @{1 \over N@} \sum_@{k=0@}^@{N-1@} x_k \exp(2\pi i j k / N). @end example @end ifinfo - @noindent The factor of @math{1/N} makes this a true inverse. For example, a call --- 93,101 ---- @end tex @ifinfo + @example z_j = @{1 \over N@} \sum_@{k=0@}^@{N-1@} x_k \exp(2\pi i j k / N). @end example @end ifinfo @noindent The factor of @math{1/N} makes this a true inverse. For example, a call *************** *** 116,120 **** The @dfn{backwards FFT} is simply our terminology for an unscaled version of the inverse FFT, - @tex \beforedisplay --- 114,117 ---- *************** *** 125,133 **** @end tex @ifinfo @example z^@{backwards@}_j = \sum_@{k=0@}^@{N-1@} x_k \exp(2\pi i j k / N). @end example @end ifinfo - @noindent When the overall scale of the result is unimportant it is often --- 122,130 ---- @end tex @ifinfo + @example z^@{backwards@}_j = \sum_@{k=0@}^@{N-1@} x_k \exp(2\pi i j k / N). @end example @end ifinfo @noindent When the overall scale of the result is unimportant it is often *************** *** 149,153 **** gsl_complex_packed_array data = x; @end example - @noindent can be used to hold an array of three complex numbers, @code{z[3]}, in --- 146,149 ---- *************** *** 162,166 **** data[5] = Im(z[2]) @end example - @noindent The array indices for the data have the same ordering as those --- 158,161 ---- *************** *** 211,215 **** N-1 z(t = N-1) x(f = -1/(N Delta)) @end example - @noindent When @math{N} is even the location @math{N/2} contains the most positive --- 206,209 ---- *************** *** 227,235 **** although not necessarily the most efficient. They use the Cooley-Tukey algorithm to compute in-place complex FFTs for lengths which are a power ! of 2 --- no additional storage is required. The corresponding self-sorting mixed-radix routines offer better performance at the expense of requiring additional working space. ! All these functions are declared in the header file @file{gsl_fft_complex.h}. @deftypefun int gsl_fft_complex_radix2_forward (gsl_complex_packed_array @var{data}, size_t @var{stride}, size_t @var{n}) --- 221,229 ---- although not necessarily the most efficient. They use the Cooley-Tukey algorithm to compute in-place complex FFTs for lengths which are a power ! of 2---no additional storage is required. The corresponding self-sorting mixed-radix routines offer better performance at the expense of requiring additional working space. ! All the functions described in this section are declared in the header file @file{gsl_fft_complex.h}. @deftypefun int gsl_fft_complex_radix2_forward (gsl_complex_packed_array @var{data}, size_t @var{stride}, size_t @var{n}) *************** *** 246,250 **** the transform @var{n} is restricted to powers of two. For the @code{transform} version of the function the @var{sign} argument can be ! either @code{forward} (-1) or @code{backward} (+1). The functions return a value of @code{GSL_SUCCESS} if no errors were --- 240,244 ---- the transform @var{n} is restricted to powers of two. For the @code{transform} version of the function the @var{sign} argument can be ! either @code{forward} (@math{-1}) or @code{backward} (@math{+1}). The functions return a value of @code{GSL_SUCCESS} if no errors were *************** *** 289,294 **** wrap-around of negative times at @math{t=128}, and working in units of @math{k/N}, the DFT approximates the continuum fourier transform, giving ! a modulated @math{\sin} function. ! @iftex @tex --- 283,287 ---- wrap-around of negative times at @math{t=128}, and working in units of @math{k/N}, the DFT approximates the continuum fourier transform, giving ! a modulated sine function. @iftex @tex *************** *** 301,311 **** @sp 1 ! @center @image{fft-complex-radix2-t,3.4in} ! @center @image{fft-complex-radix2-f,3.4in} ! ! @display A pulse and its discrete fourier transform, output from the example program. ! @end display @end iftex --- 294,303 ---- @sp 1 ! @center @image{fft-complex-radix2-t,2.8in} ! @center @image{fft-complex-radix2-f,2.8in} ! @quotation A pulse and its discrete fourier transform, output from the example program. ! @end quotation @end iftex *************** *** 317,324 **** This section describes mixed-radix FFT algorithms for complex data. The mixed-radix functions work for FFTs of any length. They are a ! reimplementation of the Fortran @sc{fftpack} library by Paul ! Swarztrauber. The theory is explained in the review article ! @cite{Self-sorting Mixed-radix FFTs} by Clive Temperton. The routines ! here use the same indexing scheme and basic algorithms as @sc{fftpack}. The mixed-radix algorithm is based on sub-transform modules---highly --- 309,316 ---- This section describes mixed-radix FFT algorithms for complex data. The mixed-radix functions work for FFTs of any length. They are a ! reimplementation of Paul Swarztrauber's Fortran @sc{fftpack} library. ! The theory is explained in the review article @cite{Self-sorting ! Mixed-radix FFTs} by Clive Temperton. The routines here use the same ! indexing scheme and basic algorithms as @sc{fftpack}. The mixed-radix algorithm is based on sub-transform modules---highly *************** *** 367,371 **** @comment wavetable as arguments. ! All these functions are declared in the header file @file{gsl_fft_complex.h}. @deftypefun {gsl_fft_complex_wavetable *} gsl_fft_complex_wavetable_alloc (size_t @var{n}) --- 359,364 ---- @comment wavetable as arguments. ! All the functions described in this section are declared in the header ! file @file{gsl_fft_complex.h}. @deftypefun {gsl_fft_complex_wavetable *} gsl_fft_complex_wavetable_alloc (size_t @var{n}) *************** *** 399,405 **** examine them. For example, the chosen factorization of the FFT length is given and can be used to provide an estimate of the run-time or ! numerical error. ! ! The wavetable structure is declared in the header file @file{gsl_fft_complex.h}. --- 392,396 ---- examine them. For example, the chosen factorization of the FFT length is given and can be used to provide an estimate of the run-time or ! numerical error. The wavetable structure is declared in the header file @file{gsl_fft_complex.h}. *************** *** 475,479 **** trigonometric lookup tables and a workspace @var{work}. For the @code{transform} version of the function the @var{sign} argument can be ! either @code{forward} (-1) or @code{backward} (+1). The functions return a value of @code{0} if no errors were detected. The --- 466,470 ---- trigonometric lookup tables and a workspace @var{work}. For the @code{transform} version of the function the @var{sign} argument can be ! either @code{forward} (@math{-1}) or @code{backward} (@math{+1}). The functions return a value of @code{0} if no errors were detected. The *************** *** 501,505 **** @verbatiminclude examples/fftmr.c @end example - @noindent Note that we have assumed that the program is using the default --- 492,495 ---- *************** *** 515,519 **** transforms. The fourier transform of a real sequence is not real. It is a complex sequence with a special symmetry: - @tex \beforedisplay --- 505,508 ---- *************** *** 524,532 **** @end tex @ifinfo @example z_k = z_@{N-k@}^* @end example @end ifinfo - @noindent A sequence with this symmetry is called @dfn{conjugate-complex} or --- 513,521 ---- @end tex @ifinfo + @example z_k = z_@{N-k@}^* @end example @end ifinfo @noindent A sequence with this symmetry is called @dfn{conjugate-complex} or *************** *** 541,545 **** real sequence. The half-complex coefficients @math{c} of a real sequence @math{x} are given by fourier analysis, - @tex \beforedisplay --- 530,533 ---- *************** *** 550,563 **** @end tex @ifinfo @example c_k = \sum_@{j=0@}^@{N-1@} x_k \exp(-2 \pi i j k /N) @end example @end ifinfo - @noindent Functions in @code{gsl_fft_halfcomplex} compute inverse or backwards transforms. They reconstruct real sequences by fourier synthesis from their half-complex frequency coefficients, @math{c}, - @tex \beforedisplay --- 538,550 ---- @end tex @ifinfo + @example c_k = \sum_@{j=0@}^@{N-1@} x_k \exp(-2 \pi i j k /N) @end example @end ifinfo @noindent Functions in @code{gsl_fft_halfcomplex} compute inverse or backwards transforms. They reconstruct real sequences by fourier synthesis from their half-complex frequency coefficients, @math{c}, @tex \beforedisplay *************** *** 568,582 **** @end tex @ifinfo @example x_j = @{1 \over N@} \sum_@{k=0@}^@{N-1@} c_k \exp(2 \pi i j k /N) @end example @end ifinfo - @noindent The symmetry of the half-complex sequence implies that only half of the complex numbers in the output need to be stored. The remaining half can ! be reconstructed using the half-complex symmetry condition. (This works ! for all lengths, even and odd. When the length is even the middle value, ! where @math{k=N/2}, is also real). Thus only @var{N} real numbers are required to store the half-complex sequence, and the transform of a real sequence can be stored in the same size array as the original data. --- 555,569 ---- @end tex @ifinfo + @example x_j = @{1 \over N@} \sum_@{k=0@}^@{N-1@} c_k \exp(2 \pi i j k /N) @end example @end ifinfo @noindent The symmetry of the half-complex sequence implies that only half of the complex numbers in the output need to be stored. The remaining half can ! be reconstructed using the half-complex symmetry condition. This works ! for all lengths, even and odd---when the length is even the middle value ! where @math{k=N/2} is also real. Thus only @var{N} real numbers are required to store the half-complex sequence, and the transform of a real sequence can be stored in the same size array as the original data. *************** *** 584,592 **** The precise storage arrangements depend on the algorithm, and are different for radix-2 and mixed-radix routines. The radix-2 function ! operates in-place, which constrain the locations where each element can be stored. The restriction forces real and imaginary parts to be stored far apart. The mixed-radix algorithm does not have this restriction, and it stores the real and imaginary parts of a given term in neighboring ! locations. This is desirable for better locality of memory accesses. @node Radix-2 FFT routines for real data --- 571,579 ---- The precise storage arrangements depend on the algorithm, and are different for radix-2 and mixed-radix routines. The radix-2 function ! operates in-place, which constrains the locations where each element can be stored. The restriction forces real and imaginary parts to be stored far apart. The mixed-radix algorithm does not have this restriction, and it stores the real and imaginary parts of a given term in neighboring ! locations (which is desirable for better locality of memory accesses). @node Radix-2 FFT routines for real data *************** *** 705,709 **** complex[4].imag = -halfcomplex[2] @end example - @noindent The upper elements of the @var{complex} array, @code{complex[3]} and --- 692,695 ---- *************** *** 729,733 **** complex[5].imag = -halfcomplex[2] @end example - @noindent The upper elements of the @var{complex} array, @code{complex[4]} and --- 715,718 ---- *************** *** 971,976 **** @comment The notes are available from @url{http://www-dsp.rice.edu/res/fft/fftnote.asc}. @noindent ! For serious FFT work we recommend the use of the dedicated FFTW library ! by Frigo and Johnson. The FFTW library is self-optimizing --- it automatically tunes itself for each hardware platform in order to achieve maximum performance. It is available under the GNU GPL. --- 956,961 ---- @comment The notes are available from @url{http://www-dsp.rice.edu/res/fft/fftnote.asc}. @noindent ! For large-scale FFT work we recommend the use of the dedicated FFTW library ! by Frigo and Johnson. The FFTW library is self-optimizing---it automatically tunes itself for each hardware platform in order to achieve maximum performance. It is available under the GNU GPL. diff -rc2P gsl-1.6/doc/fit-wlinear.eps gsl-1.7/doc/fit-wlinear.eps *** gsl-1.6/doc/fit-wlinear.eps Sun Aug 6 10:31:59 2000 --- gsl-1.7/doc/fit-wlinear.eps Mon Aug 22 15:25:31 2005 *************** *** 256,260 **** fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 [FontBBox] 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { --- 256,260 ---- fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 /FontBBox load 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { diff -rc2P gsl-1.6/doc/fit-wlinear2.eps gsl-1.7/doc/fit-wlinear2.eps *** gsl-1.6/doc/fit-wlinear2.eps Sun Jul 29 13:10:38 2001 --- gsl-1.7/doc/fit-wlinear2.eps Mon Aug 22 15:25:31 2005 *************** *** 295,299 **** fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 [FontBBox] 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { --- 295,299 ---- fgred fggreen fgblue setrgbcolor /fontDict printFont findfont printSize scalefont dup setfont def ! /descender fontDict begin 0 /FontBBox load 1 get FontMatrix end transform exch pop def /vertoffset 1 printSize sub descender sub def { diff -rc2P gsl-1.6/doc/fitting.texi gsl-1.7/doc/fitting.texi *** gsl-1.6/doc/fitting.texi Fri Nov 12 17:20:42 2004 --- gsl-1.7/doc/fitting.texi Wed Jul 27 15:40:00 2005 *************** *** 28,32 **** For weighted data the best-fit is found by minimizing the weighted sum of squared residuals, @math{\chi^2}, - @tex \beforedisplay --- 28,31 ---- *************** *** 37,45 **** @end tex @ifinfo @example \chi^2 = \sum_i w_i (y_i - (c_0 + c_1 x_i))^2 @end example @end ifinfo - @noindent for the parameters @math{c_0}, @math{c_1}. For unweighted data the --- 36,44 ---- @end tex @ifinfo + @example \chi^2 = \sum_i w_i (y_i - (c_0 + c_1 x_i))^2 @end example @end ifinfo @noindent for the parameters @math{c_0}, @math{c_1}. For unweighted data the *************** *** 73,77 **** @end deftypefun ! @deftypefun int gsl_fit_linear_est (double @var{x}, double @var{c0}, double @var{c1}, double @var{c00}, double @var{c01}, double @var{c11}, double *@var{y}, double *@var{y_err}) This function uses the best-fit linear regression coefficients @var{c0},@var{c1} and their estimated covariance --- 72,76 ---- @end deftypefun ! @deftypefun int gsl_fit_linear_est (double @var{x}, double @var{c0}, double @var{c1}, double @var{c00}, double @var{c01}, double @var{c11}, double * @var{y}, double * @var{y_err}) This function uses the best-fit linear regression coefficients @var{c0},@var{c1} and their estimated covariance *************** *** 88,92 **** @math{Y = c_1 X}. For weighted data the best-fit is found by minimizing the weighted sum of squared residuals, @math{\chi^2}, - @tex \beforedisplay --- 87,90 ---- *************** *** 97,105 **** @end tex @ifinfo @example \chi^2 = \sum_i w_i (y_i - c_1 x_i)^2 @end example @end ifinfo - @noindent for the parameter @math{c_1}. For unweighted data the sum is --- 95,103 ---- @end tex @ifinfo + @example \chi^2 = \sum_i w_i (y_i - c_1 x_i)^2 @end example @end ifinfo @noindent for the parameter @math{c_1}. For unweighted data the sum is *************** *** 125,134 **** The variance of the parameter @var{c1} is estimated from the weighted ! data and returned via the parameters @var{cov11}. The weighted sum of squares of the residuals from the best-fit line, @math{\chi^2}, is returned in @var{chisq}. @end deftypefun ! @deftypefun int gsl_fit_mul_est (double @var{x}, double @var{c1}, double @var{c11}, double *@var{y}, double *@var{y_err}) This function uses the best-fit linear regression coefficient @var{c1} and its estimated covariance @var{cov11} to compute the fitted function --- 123,132 ---- The variance of the parameter @var{c1} is estimated from the weighted ! data and returned via the parameter @var{cov11}. The weighted sum of squares of the residuals from the best-fit line, @math{\chi^2}, is returned in @var{chisq}. @end deftypefun ! @deftypefun int gsl_fit_mul_est (double @var{x}, double @var{c1}, double @var{c11}, double * @var{y}, double * @var{y_err}) This function uses the best-fit linear regression coefficient @var{c1} and its estimated covariance @var{cov11} to compute the fitted function *************** *** 144,153 **** general linear model, @math{y = X c} where @math{y} is a vector of @math{n} observations, @math{X} is an @math{n} by @math{p} matrix of ! predictor variables, and @math{c} are the @math{p} unknown best-fit ! parameters, which are to be estimated. The best-fit is found by minimizing the weighted sums of squared residuals, @math{\chi^2}, - @tex \beforedisplay --- 142,149 ---- general linear model, @math{y = X c} where @math{y} is a vector of @math{n} observations, @math{X} is an @math{n} by @math{p} matrix of ! predictor variables, and the elements of the vector @math{c} are the @math{p} unknown best-fit parameters which are to be estimated. The best-fit is found by minimizing the weighted sums of squared residuals, @math{\chi^2}, @tex \beforedisplay *************** *** 158,161 **** --- 154,158 ---- @end tex @ifinfo + @example \chi^2 = (y - X c)^T W (y - X c) *************** *** 171,175 **** appropriately. For example, to fit to a @math{p}-th order polynomial in @var{x}, use the following matrix, - @tex \beforedisplay --- 168,171 ---- *************** *** 180,183 **** --- 176,180 ---- @end tex @ifinfo + @example X_@{ij@} = x_i^j *************** *** 190,194 **** To fit to a set of @math{p} sinusoidal functions with fixed frequencies @math{\omega_1}, @math{\omega_2}, @dots{}, @math{\omega_p}, use, - @tex \beforedisplay --- 187,190 ---- *************** *** 199,202 **** --- 195,199 ---- @end tex @ifinfo + @example X_@{ij@} = sin(\omega_j x_i) *************** *** 206,210 **** To fit to @math{p} independent variables @math{x_1}, @math{x_2}, @dots{}, @math{x_p}, use, - @tex \beforedisplay --- 203,206 ---- *************** *** 215,218 **** --- 211,215 ---- @end tex @ifinfo + @example X_@{ij@} = x_j(i) *************** *** 240,244 **** @deftypefun int gsl_multifit_linear (const gsl_matrix * @var{X}, const gsl_vector * @var{y}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) ! This function computes the best-fit parameters @var{c} of the model @math{y = X c} for the observations @var{y} and the matrix of predictor variables @var{X}. The variance-covariance matrix of the model --- 237,242 ---- @deftypefun int gsl_multifit_linear (const gsl_matrix * @var{X}, const gsl_vector * @var{y}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) ! @deftypefunx int gsl_multifit_linear_svd (const gsl_matrix * @var{X}, const gsl_vector * @var{y}, double @var{tol}, size_t * @var{rank}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) ! These functions compute the best-fit parameters @var{c} of the model @math{y = X c} for the observations @var{y} and the matrix of predictor variables @var{X}. The variance-covariance matrix of the model *************** *** 252,270 **** improve the accuracy of the singular values. Any components which have zero singular value (to machine precision) are discarded from the fit. @end deftypefun @deftypefun int gsl_multifit_wlinear (const gsl_matrix * @var{X}, const gsl_vector * @var{w}, const gsl_vector * @var{y}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) ! This function computes the best-fit parameters @var{c} of the model ! @math{y = X c} for the observations @var{y} and the matrix of predictor ! variables @var{X}. The covariance matrix of the model parameters ! @var{cov} is estimated from the weighted data. The weighted sum of ! squares of the residuals from the best-fit, @math{\chi^2}, is returned ! in @var{chisq}. The best-fit is found by singular value decomposition of the matrix @var{X} using the preallocated workspace provided in @var{work}. Any components which have zero singular value (to machine precision) are ! discarded from the fit. @end deftypefun --- 250,276 ---- improve the accuracy of the singular values. Any components which have zero singular value (to machine precision) are discarded from the fit. + In the second form of the function the components are discarded if the + ratio of singular values @math{s_i/s_0} falls below the user-specified + tolerance @var{tol}, and the effective rank is returned in @var{rank}. + @end deftypefun @deftypefun int gsl_multifit_wlinear (const gsl_matrix * @var{X}, const gsl_vector * @var{w}, const gsl_vector * @var{y}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) + @deftypefunx int gsl_multifit_wlinear_svd (const gsl_matrix * @var{X}, const gsl_vector * @var{w}, const gsl_vector * @var{y}, double @var{tol}, size_t * @var{rank}, gsl_vector * @var{c}, gsl_matrix * @var{cov}, double * @var{chisq}, gsl_multifit_linear_workspace * @var{work}) ! This function computes the best-fit parameters @var{c} of the weighted ! model @math{y = X c} for the observations @var{y} with weights @var{w} ! and the matrix of predictor variables @var{X}. The covariance matrix of ! the model parameters @var{cov} is estimated from the weighted data. The ! weighted sum of squares of the residuals from the best-fit, ! @math{\chi^2}, is returned in @var{chisq}. The best-fit is found by singular value decomposition of the matrix @var{X} using the preallocated workspace provided in @var{work}. Any components which have zero singular value (to machine precision) are ! discarded from the fit. In the second form of the function the ! components are discarded if the ratio of singular values @math{s_i/s_0} ! falls below the user-specified tolerance @var{tol}, and the effective ! rank is returned in @var{rank}. @end deftypefun *************** *** 302,306 **** @iftex @sp 1 ! @center @image{fit-wlinear,3.4in} @end iftex --- 308,312 ---- @iftex @sp 1 ! @center @image{fit-wlinear,3.0in} @end iftex *************** *** 309,313 **** @code{gsl_multifit_wlinear}. The model matrix @math{X} for a quadratic fit is given by, - @tex \beforedisplay --- 315,318 ---- *************** *** 321,324 **** --- 326,330 ---- @end tex @ifinfo + @example X = [ 1 , x_0 , x_0^2 ; *************** *** 389,393 **** @iftex @sp 1 ! @center @image{fit-wlinear2,3.4in} @end iftex --- 395,399 ---- @iftex @sp 1 ! @center @image{fit-wlinear2,3.0in} @end iftex *************** *** 396,400 **** A summary of formulas and techniques for least squares fitting can be ! found in the "Statistics" chapter of the Annual Review of Particle Physics prepared by the Particle Data Group, --- 402,406 ---- A summary of formulas and techniques for least squares fitting can be ! found in the ``Statistics'' chapter of the Annual Review of Particle Physics prepared by the Particle Data Group, *************** *** 409,413 **** above. - @noindent @cindex NIST Statistical Reference Datasets @cindex Statistical Reference Datasets (StRD) --- 415,418 ---- diff -rc2P gsl-1.6/doc/freemanuals.texi gsl-1.7/doc/freemanuals.texi *** gsl-1.6/doc/freemanuals.texi Thu Jun 24 14:18:54 2004 --- gsl-1.7/doc/freemanuals.texi Sat May 21 13:28:05 2005 *************** *** 92,95 **** The Free Software Foundation maintains a list of free documentation ! published by other publishers, at ! @uref{http://www.fsf.org/doc/other-free-books.html}. --- 92,99 ---- The Free Software Foundation maintains a list of free documentation ! published by other publishers: ! ! @itemize @asis ! @item ! @uref{http://www.fsf.org/doc/other-free-books.html} ! @end itemize diff -rc2P gsl-1.6/doc/gpl.texi gsl-1.7/doc/gpl.texi *** gsl-1.6/doc/gpl.texi Sun Aug 10 16:54:40 2003 --- gsl-1.7/doc/gpl.texi Sat May 21 13:28:05 2005 *************** *** 1,3 **** --- 1,6 ---- @center Version 2, June 1991 + @iftex + @smallerfonts @rm + @end iftex @c This file is intended to be included in another file. *************** *** 11,15 **** @end display ! @unnumberedsec Preamble The licenses for most software are designed to take away your --- 14,18 ---- @end display ! @heading Preamble The licenses for most software are designed to take away your *************** *** 62,66 **** @iftex ! @unnumberedsec TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end iftex @ifinfo --- 65,69 ---- @iftex ! @heading TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end iftex @ifinfo *************** *** 324,328 **** @page ! @unnumberedsec Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest --- 327,331 ---- @page ! @heading Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest *************** *** 336,340 **** @smallexample ! @var{one line to give the program's name and a brief idea of what it does.} Copyright (C) @var{yyyy} @var{name of author} --- 339,343 ---- @smallexample ! @var{one line to give the program's name and a brief idea @*of what it does.} Copyright (C) @var{yyyy} @var{name of author} *************** *** 376,379 **** --- 379,383 ---- suits your program. + @need 1500 You should also get your employer (if you work as a programmer) or your school, if any, to sign a ``copyright disclaimer'' for the program, if *************** *** 389,392 **** --- 393,399 ---- @end smallexample + @iftex + @smallerfonts @rm + @end iftex This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may *************** *** 394,395 **** --- 401,407 ---- library. If this is what you want to do, use the GNU Library General Public License instead of this License. + + @iftex + @* + @textfonts @rm + @end iftex diff -rc2P gsl-1.6/doc/gsl-design.texi gsl-1.7/doc/gsl-design.texi *** gsl-1.6/doc/gsl-design.texi Mon Nov 29 14:54:51 2004 --- gsl-1.7/doc/gsl-design.texi Sat May 21 13:28:05 2005 *************** *** 309,312 **** --- 309,315 ---- can be added to the GSL webpages. + For security, sign your package with GPG (@code{gpg --detach-sign + @var{file}}). + An example package @samp{rngextra} containing two additional random number generators can be found at diff -rc2P gsl-1.6/doc/gsl-ref.info gsl-1.7/doc/gsl-ref.info *** gsl-1.6/doc/gsl-ref.info Fri Dec 31 15:30:03 2004 --- gsl-1.7/doc/gsl-ref.info Tue Sep 13 10:18:36 2005 *************** *** 10,549 **** Indirect: gsl-ref.info-1: 228 ! gsl-ref.info-2: 295768 ! gsl-ref.info-3: 594317 ! gsl-ref.info-4: 893991  Tag Table: (Indirect) Node: Top228 ! Node: Introduction2078 ! Node: Routines available in GSL2726 ! Node: GSL is Free Software4364 ! Node: Obtaining GSL6693 ! Node: No Warranty7833 ! Node: Reporting Bugs8261 ! Node: Further Information9057 ! Node: Conventions used in this manual9759 ! Node: Using the library10515 ! Node: An Example Program11072 ! Node: Compiling and Linking11773 ! Node: Shared Libraries14657 ! Node: ANSI C Compliance15757 ! Node: Inline functions16836 ! Node: Long double17843 ! Node: Portability functions19233 ! Node: Alternative optimized functions20627 ! Node: Support for different numeric types22075 ! Node: Compatibility with C++25133 ! Node: Aliasing of arrays25445 ! Node: Thread-safety26186 ! Node: Code Reuse27253 ! Node: Error Handling27880 ! Node: Error Reporting28626 ! Node: Error Codes30515 ! Node: Error Handlers32265 ! Node: Using GSL error reporting in your own functions35911 ! Node: Error Reporting Examples37859 ! Node: Mathematical Functions39077 ! Node: Mathematical Constants39834 ! Node: Infinities and Not-a-number40955 ! Node: Elementary Functions42009 ! Node: Small integer powers44246 ! Node: Testing the Sign of Numbers45790 ! Node: Testing for Odd and Even Numbers46212 ! Node: Maximum and Minimum functions46758 ! Node: Approximate Comparison of Floating Point Numbers48824 ! Node: Complex Numbers50023 ! Node: Complex numbers51364 ! Node: Properties of complex numbers53152 ! Node: Complex arithmetic operators54127 ! Node: Elementary Complex Functions56850 ! Node: Complex Trigonometric Functions58654 ! Node: Inverse Complex Trigonometric Functions59861 ! Node: Complex Hyperbolic Functions62447 ! Node: Inverse Complex Hyperbolic Functions63729 ! Node: Complex Number References and Further Reading65553 ! Node: Polynomials66942 ! Node: Polynomial Evaluation67705 ! Node: Divided Difference Representation of Polynomials68156 ! Node: Quadratic Equations69814 ! Node: Cubic Equations71581 ! Node: General Polynomial Equations72926 ! Node: Roots of Polynomials Examples74794 ! Node: Roots of Polynomials References and Further Reading76215 ! Node: Special Functions77150 ! Node: Special Function Usage79092 ! Node: The gsl_sf_result struct80267 ! Node: Special Function Modes81523 ! Node: Airy Functions and Derivatives82451 ! Node: Airy Functions83139 ! Node: Derivatives of Airy Functions84479 ! Node: Zeros of Airy Functions85818 ! Node: Zeros of Derivatives of Airy Functions86521 ! Node: Bessel Functions87264 ! Node: Regular Cylindrical Bessel Functions88448 ! Node: Irregular Cylindrical Bessel Functions89754 ! Node: Regular Modified Cylindrical Bessel Functions91192 ! Node: Irregular Modified Cylindrical Bessel Functions93995 ! Node: Regular Spherical Bessel Functions96939 ! Node: Irregular Spherical Bessel Functions99130 ! Node: Regular Modified Spherical Bessel Functions100797 ! Node: Irregular Modified Spherical Bessel Functions102780 ! Node: Regular Bessel Function - Fractional Order104823 ! Node: Irregular Bessel Functions - Fractional Order105807 ! Node: Regular Modified Bessel Functions - Fractional Order106374 ! Node: Irregular Modified Bessel Functions - Fractional Order107281 ! Node: Zeros of Regular Bessel Functions108496 ! Node: Clausen Functions109579 ! Node: Coulomb Functions110173 ! Node: Normalized Hydrogenic Bound States110596 ! Node: Coulomb Wave Functions111602 ! Node: Coulomb Wave Function Normalization Constant114984 ! Node: Coupling Coefficients115723 ! Node: 3-j Symbols116438 ! Node: 6-j Symbols117028 ! Node: 9-j Symbols117638 ! Node: Dawson Function118330 ! Node: Debye Functions118887 ! Node: Dilogarithm120164 ! Node: Real Argument120449 ! Node: Complex Argument121002 ! Node: Elementary Operations121456 ! Node: Elliptic Integrals122268 ! Node: Definition of Legendre Forms122731 ! Node: Definition of Carlson Forms123566 ! Node: Legendre Form of Complete Elliptic Integrals124264 ! Node: Legendre Form of Incomplete Elliptic Integrals125130 ! Node: Carlson Forms126847 ! Node: Elliptic Functions (Jacobi)128372 ! Node: Error Functions128942 ! Node: Error Function129383 ! Node: Complementary Error Function129727 ! Node: Log Complementary Error Function130172 ! Node: Probability functions130608 ! Node: Exponential Functions131833 ! Node: Exponential Function132206 ! Node: Relative Exponential Functions133399 ! Node: Exponentiation With Error Estimate135048 ! Node: Exponential Integrals136239 ! Node: Exponential Integral136711 ! Node: Ei(x)137338 ! Node: Hyperbolic Integrals137769 ! Node: Ei_3(x)138406 ! Node: Trigonometric Integrals138771 ! Node: Arctangent Integral139352 ! Node: Fermi-Dirac Function139715 ! Node: Complete Fermi-Dirac Integrals140065 ! Node: Incomplete Fermi-Dirac Integrals142496 ! Node: Gamma Function143123 ! Node: Gegenbauer Functions151103 ! Node: Hypergeometric Functions152724 ! Node: Laguerre Functions156925 ! Node: Lambert W Functions158177 ! Node: Legendre Functions and Spherical Harmonics159191 ! Node: Legendre Polynomials159770 ! Node: Associated Legendre Polynomials and Spherical Harmonics161587 ! Node: Conical Functions163991 ! Node: Radial Functions for Hyperbolic Space166085 ! Node: Logarithm and Related Functions168241 ! Node: Power Function169843 ! Node: Psi (Digamma) Function170772 ! Node: Digamma Function171273 ! Node: Trigamma Function172082 ! Node: Polygamma Function172641 ! Node: Synchrotron Functions173009 ! Node: Transport Functions173758 ! Node: Trigonometric Functions174847 ! Node: Circular Trigonometric Functions175460 ! Node: Trigonometric Functions for Complex Arguments176447 ! Node: Hyperbolic Trigonometric Functions177464 ! Node: Conversion Functions178049 ! Node: Restriction Functions178816 ! Node: Trigonometric Functions With Error Estimates179427 ! Node: Zeta Functions180171 ! Node: Riemann Zeta Function180619 ! Node: Riemann Zeta Function Minus One181280 ! Node: Hurwitz Zeta Function182033 ! Node: Eta Function182522 ! Node: Special Functions Examples183063 ! Node: Special Functions References and Further Reading184788 ! Node: Vectors and Matrices185884 ! Node: Data types186639 ! Node: Blocks187834 ! Node: Block allocation188742 ! Node: Reading and writing blocks190131 ! Node: Example programs for blocks192179 ! Node: Vectors192811 ! Node: Vector allocation194673 ! Node: Accessing vector elements196194 ! Node: Initializing vector elements198401 ! Node: Reading and writing vectors199080 ! Node: Vector views201144 ! Node: Copying vectors208557 ! Node: Exchanging elements209403 ! Node: Vector operations209947 ! Node: Finding maximum and minimum elements of vectors211443 ! Node: Vector properties212950 ! Node: Example programs for vectors213298 ! Node: Matrices215482 ! Node: Matrix allocation218332 ! Node: Accessing matrix elements219902 ! Node: Initializing matrix elements221594 ! Node: Reading and writing matrices222375 ! Node: Matrix views224452 ! Node: Creating row and column views231570 ! Node: Copying matrices234716 ! Node: Copying rows and columns235298 ! Node: Exchanging rows and columns236959 ! Node: Matrix operations238420 ! Node: Finding maximum and minimum elements of matrices240040 ! Node: Matrix properties241894 ! Node: Example programs for matrices242245 ! Node: Vector and Matrix References and Further Reading246195 ! Node: Permutations246673 ! Node: The Permutation struct247957 ! Node: Permutation allocation248451 ! Node: Accessing permutation elements249872 ! Node: Permutation properties250625 ! Node: Permutation functions251313 ! Node: Applying Permutations252558 ! Node: Reading and writing permutations254470 ! Node: Permutations in Cyclic Form256639 ! Node: Permutation Examples259866 ! Node: Permutation References and Further Reading262317 ! Node: Combinations262981 ! Node: The Combination struct263851 ! Node: Combination allocation264391 ! Node: Accessing combination elements266161 ! Node: Combination properties266721 ! Node: Combination functions267596 ! Node: Reading and writing combinations268524 ! Node: Combination Examples270700 ! Node: Combination References and Further Reading272020 ! Node: Sorting272588 ! Node: Sorting objects273528 ! Node: Sorting vectors276427 ! Node: Selecting the k smallest or largest elements278986 ! Node: Computing the rank282285 ! Node: Sorting Examples283491 ! Node: Sorting References and Further Reading285112 ! Node: BLAS Support285648 ! Node: GSL BLAS Interface288616 ! Node: Level 1 GSL BLAS Interface289093 ! Node: Level 2 GSL BLAS Interface295768 ! Node: Level 3 GSL BLAS Interface305022 ! Node: BLAS Examples316099 ! Node: BLAS References and Further Reading317552 ! Node: Linear Algebra318896 ! Node: LU Decomposition320132 ! Node: QR Decomposition325113 ! Node: QR Decomposition with Column Pivoting330753 ! Node: Singular Value Decomposition335120 ! Node: Cholesky Decomposition338414 ! Node: Tridiagonal Decomposition of Real Symmetric Matrices340312 ! Node: Tridiagonal Decomposition of Hermitian Matrices342147 ! Node: Bidiagonalization344062 ! Node: Householder Transformations346464 ! Node: Householder solver for linear systems348296 ! Node: Tridiagonal Systems349187 ! Node: Linear Algebra Examples351682 ! Node: Linear Algebra References and Further Reading353713 ! Node: Eigensystems355191 ! Node: Real Symmetric Matrices356230 ! Node: Complex Hermitian Matrices358446 ! Node: Sorting Eigenvalues and Eigenvectors360948 ! Node: Eigenvalue and Eigenvector Examples362267 ! Node: Eigenvalue and Eigenvector References364632 ! Node: Fast Fourier Transforms365330 ! Node: Mathematical Definitions366533 ! Node: Overview of complex data FFTs368928 ! Node: Radix-2 FFT routines for complex data371866 ! Node: Mixed-radix FFT routines for complex data376105 ! Node: Overview of real data FFTs385483 ! Node: Radix-2 FFT routines for real data387910 ! Node: Mixed-radix FFT routines for real data390736 ! Node: FFT References and Further Reading401385 ! Node: Numerical Integration404242 ! Node: Numerical Integration Introduction405781 ! Node: QNG non-adaptive Gauss-Kronrod integration409235 ! Node: QAG adaptive integration410494 ! Node: QAGS adaptive integration with singularities413121 ! Node: QAGP adaptive integration with known singular points414908 ! Node: QAGI adaptive integration on infinite intervals416208 ! Node: QAWC adaptive integration for Cauchy principal values418430 ! Node: QAWS adaptive integration for singular functions419593 ! Node: QAWO adaptive integration for oscillatory functions422818 ! Node: QAWF adaptive integration for Fourier integrals426568 ! Node: Numerical integration error codes429146 ! Node: Numerical integration examples429902 ! Node: Numerical integration References and Further Reading431935 ! Node: Random Number Generation432651 ! Node: General comments on random numbers434147 ! Node: The Random Number Generator Interface436087 ! Node: Random number generator initialization437435 ! Node: Sampling from a random number generator439432 ! Node: Auxiliary random number generator functions441904 ! Node: Random number environment variables444226 ! Node: Copying random number generator state446751 ! Node: Reading and writing random number generator state447703 ! Node: Random number generator algorithms449103 ! Node: Unix random number generators458488 ! Node: Other random number generators462202 ! Node: Random Number Generator Performance471486 ! Node: Random Number Generator Examples472797 ! Node: Random Number References and Further Reading474374 ! Node: Random Number Acknowledgements475871 ! Node: Quasi-Random Sequences476345 ! Node: Quasi-random number generator initialization477365 ! Node: Sampling from a quasi-random number generator478263 ! Node: Auxiliary quasi-random number generator functions478857 ! Node: Saving and resorting quasi-random number generator state479790 ! Node: Quasi-random number generator algorithms480576 ! Node: Quasi-random number generator examples481339 ! Node: Quasi-random number references482329 ! Node: Random Number Distributions482839 ! Node: Random Number Distribution Introduction485684 ! Node: The Gaussian Distribution486736 ! Node: The Gaussian Tail Distribution489146 ! Node: The Bivariate Gaussian Distribution490761 ! Node: The Exponential Distribution492060 ! Node: The Laplace Distribution493181 ! Node: The Exponential Power Distribution494260 ! Node: The Cauchy Distribution495212 ! Node: The Rayleigh Distribution496444 ! Node: The Rayleigh Tail Distribution497598 ! Node: The Landau Distribution498454 ! Node: The Levy alpha-Stable Distributions499392 ! Node: The Levy skew alpha-Stable Distribution500435 ! Node: The Gamma Distribution502032 ! Node: The Flat (Uniform) Distribution503177 ! Node: The Lognormal Distribution504299 ! Node: The Chi-squared Distribution505627 ! Node: The F-distribution507011 ! Node: The t-distribution508433 ! Node: The Beta Distribution509807 ! Node: The Logistic Distribution510777 ! Node: The Pareto Distribution511886 ! Node: Spherical Vector Distributions513026 ! Node: The Weibull Distribution515809 ! Node: The Type-1 Gumbel Distribution516983 ! Node: The Type-2 Gumbel Distribution518200 ! Node: The Dirichlet Distribution519411 ! Node: General Discrete Distributions521062 ! Node: The Poisson Distribution524909 ! Node: The Bernoulli Distribution525624 ! Node: The Binomial Distribution526350 ! Node: The Multinomial Distribution527212 ! Node: The Negative Binomial Distribution528848 ! Node: The Pascal Distribution529851 ! Node: The Geometric Distribution530674 ! Node: The Hypergeometric Distribution531478 ! Node: The Logarithmic Distribution532465 ! Node: Shuffling and Sampling533241 ! Node: Random Number Distribution Examples536079 ! Node: Random Number Distribution References and Further Reading539303 ! Node: Statistics541357 ! Node: Mean and standard deviation and variance542631 ! Node: Absolute deviation545674 ! Node: Higher moments (skewness and kurtosis)546958 ! Node: Autocorrelation549085 ! Node: Covariance549888 ! Node: Weighted Samples550826 ! Node: Maximum and Minimum values556082 ! Node: Median and Percentiles558518 ! Node: Example statistical programs560925 ! Node: Statistics References and Further Reading563635 ! Node: Histograms564819 ! Node: The histogram struct566573 ! Node: Histogram allocation568370 ! Node: Copying Histograms571348 ! Node: Updating and accessing histogram elements572012 ! Node: Searching histogram ranges575261 ! Node: Histogram Statistics576249 ! Node: Histogram Operations578092 ! Node: Reading and writing histograms580135 ! Node: Resampling from histograms583153 ! Node: The histogram probability distribution struct583941 ! Node: Example programs for histograms586955 ! Node: Two dimensional histograms589075 ! Node: The 2D histogram struct589784 ! Node: 2D Histogram allocation591571 ! Node: Copying 2D Histograms593626 ! Node: Updating and accessing 2D histogram elements594317 ! Node: Searching 2D histogram ranges597947 ! Node: 2D Histogram Statistics598952 ! Node: 2D Histogram Operations601733 ! Node: Reading and writing 2D histograms603883 ! Node: Resampling from 2D histograms607524 ! Node: Example programs for 2D histograms610526 ! Node: N-tuples612591 ! Node: The ntuple struct613841 ! Node: Creating ntuples614309 ! Node: Opening an existing ntuple file614965 ! Node: Writing ntuples615582 ! Node: Reading ntuples616031 ! Node: Closing an ntuple file616351 ! Node: Histogramming ntuple values616680 ! Node: Example ntuple programs618673 ! Node: Ntuple References and Further Reading622114 ! Node: Monte Carlo Integration622425 ! Node: Monte Carlo Interface623666 ! Node: PLAIN Monte Carlo626299 ! Node: MISER628723 ! Node: VEGAS634546 ! Node: Monte Carlo Examples642839 ! Node: Monte Carlo Integration References and Further Reading648867 ! Node: Simulated Annealing649619 ! Node: Simulated Annealing algorithm650765 ! Node: Simulated Annealing functions651935 ! Node: Examples with Simulated Annealing656434 ! Node: Trivial example656919 ! Node: Traveling Salesman Problem659688 ! Node: Ordinary Differential Equations663098 ! Node: Defining the ODE System663913 ! Node: Stepping Functions665774 ! Node: Adaptive Step-size Control669196 ! Node: Evolution674655 ! Node: ODE Example programs676704 ! Node: ODE References and Further Reading681742 ! Node: Interpolation682371 ! Node: Introduction to Interpolation683378 ! Node: Interpolation Functions683809 ! Node: Interpolation Types684972 ! Node: Index Look-up and Acceleration686938 ! Node: Evaluation of Interpolating Functions688554 ! Node: Higher-level Interface690920 ! Node: Interpolation Example programs692780 ! Node: Interpolation References and Further Reading694485 ! Node: Numerical Differentiation694915 ! Node: Numerical Differentiation functions695498 ! Node: Numerical Differentiation Examples698332 ! Node: Numerical Differentiation References699776 ! Node: Chebyshev Approximations700317 ! Node: The gsl_cheb_series struct701332 ! Node: Creation and Calculation of Chebyshev Series702136 ! Node: Chebyshev Series Evaluation703100 ! Node: Derivatives and Integrals704460 ! Node: Chebyshev Approximation examples705690 ! Node: Chebyshev Approximation References and Further Reading707223 ! Node: Series Acceleration707662 ! Node: Acceleration functions708421 ! Node: Acceleration functions without error estimation710650 ! Node: Example of accelerating a series713256 ! Node: Series Acceleration References715668 ! Node: Wavelet Transforms716549 ! Node: DWT Definitions717084 ! Node: DWT Initialization718023 ! Node: DWT Transform Functions720617 ! Node: DWT in one dimension721142 ! Node: DWT in two dimension723128 ! Node: DWT Examples727719 ! Node: DWT References729423 ! Node: Discrete Hankel Transforms731582 ! Node: Discrete Hankel Transform Definition732044 ! Node: Discrete Hankel Transform Functions733880 ! Node: Discrete Hankel Transform References735384 ! Node: One dimensional Root-Finding735778 ! Node: Root Finding Overview737032 ! Node: Root Finding Caveats738880 ! Node: Initializing the Solver740634 ! Node: Providing the function to solve743249 ! Node: Search Bounds and Guesses747048 ! Node: Root Finding Iteration747899 ! Node: Search Stopping Parameters749732 ! Node: Root Bracketing Algorithms752233 ! Node: Root Finding Algorithms using Derivatives755518 ! Node: Root Finding Examples759008 ! Node: Root Finding References and Further Reading766362 ! Node: One dimensional Minimization766989 ! Node: Minimization Overview768285 ! Node: Minimization Caveats769971 ! Node: Initializing the Minimizer771298 ! Node: Providing the function to minimize773525 ! Node: Minimization Iteration773993 ! Node: Minimization Stopping Parameters776105 ! Node: Minimization Algorithms777703 ! Node: Minimization Examples780132 ! Node: Minimization References and Further Reading783128 ! Node: Multidimensional Root-Finding783574 ! Node: Overview of Multidimensional Root Finding785057 ! Node: Initializing the Multidimensional Solver787234 ! Node: Providing the multidimensional system of equations to solve790404 ! Node: Iteration of the multidimensional solver795347 ! Node: Search Stopping Parameters for the multidimensional solver797514 ! Node: Algorithms using Derivatives799239 ! Node: Algorithms without Derivatives803971 ! Node: Example programs for Multidimensional Root finding806750 ! Node: References and Further Reading for Multidimensional Root Finding815537 ! Node: Multidimensional Minimization816766 ! Node: Multimin Overview818052 ! Node: Multimin Caveats820040 ! Node: Initializing the Multidimensional Minimizer820779 ! Node: Providing a function to minimize823678 ! Node: Multimin Iteration827375 ! Node: Multimin Stopping Criteria829344 ! Node: Multimin Algorithms830884 ! Node: Multimin Examples835132 ! Node: Multimin References and Further Reading841889 ! Node: Least-Squares Fitting842499 ! Node: Linear regression843431 ! Node: Linear fitting without a constant term846021 ! Node: Multi-parameter fitting848410 ! Node: Fitting Examples852159 ! Node: Fitting References and Further Reading858989 ! Node: Nonlinear Least-Squares Fitting859799 ! Node: Overview of Nonlinear Least-Squares Fitting861247 ! Node: Initializing the Nonlinear Least-Squares Solver862127 ! Node: Providing the Function to be Minimized864786 ! Node: Iteration of the Minimization Algorithm867427 ! Node: Search Stopping Parameters for Minimization Algorithms869241 ! Node: Minimization Algorithms using Derivatives871323 ! Node: Minimization Algorithms without Derivatives874560 ! Node: Computing the covariance matrix of best fit parameters874942 ! Node: Example programs for Nonlinear Least-Squares Fitting876000 ! Node: References and Further Reading for Nonlinear Least-Squares Fitting883340 ! Node: Physical Constants884064 ! Node: Fundamental Constants885460 ! Node: Astronomy and Astrophysics886843 ! Node: Atomic and Nuclear Physics887498 ! Node: Measurement of Time889054 ! Node: Imperial Units889474 ! Node: Nautical Units889896 ! Node: Printers Units890214 ! Node: Volume890501 ! Node: Mass and Weight891019 ! Node: Thermal Energy and Power891812 ! Node: Pressure892223 ! Node: Viscosity892824 ! Node: Light and Illumination893088 ! Node: Radioactivity893668 ! Node: Force and Energy893991 ! Node: Prefixes894383 ! Node: Physical Constant Examples895114 ! Node: Physical Constant References and Further Reading896906 ! Node: IEEE floating-point arithmetic897262 ! Node: Representation of floating point numbers897842 ! Node: Setting up your IEEE environment902355 ! Node: IEEE References and Further Reading908291 ! Node: Debugging Numerical Programs909292 ! Node: Using gdb909754 ! Node: Examining floating point registers913108 ! Node: Handling floating point exceptions914385 ! Node: GCC warning options for numerical programs915791 ! Node: Debugging References919976 ! Node: Contributors to GSL920518 ! Node: Autoconf Macros922724 ! Node: GSL CBLAS Library926774 ! Node: Level 1 CBLAS Functions927279 ! Node: Level 2 CBLAS Functions932425 ! Node: Level 3 CBLAS Functions948787 ! Node: GSL CBLAS Examples958306 ! Node: Free Software Needs Free Documentation959907 ! Node: GNU General Public License964974 ! Node: GNU Free Documentation License984267 ! Node: Function Index1006703 ! Node: Variable Index1126445 ! Node: Type Index1127255 ! Node: Concept Index1129184  End Tag Table --- 10,551 ---- Indirect: gsl-ref.info-1: 228 ! gsl-ref.info-2: 299155 ! gsl-ref.info-3: 598821 ! gsl-ref.info-4: 898452  Tag Table: (Indirect) Node: Top228 ! Node: Introduction2225 ! Node: Routines available in GSL2873 ! Node: GSL is Free Software4585 ! Node: Obtaining GSL6914 ! Node: No Warranty8029 ! Node: Reporting Bugs8527 ! Node: Further Information9403 ! Node: Conventions used in this manual10105 ! Node: Using the library10861 ! Node: An Example Program11443 ! Node: Compiling and Linking12144 ! Node: Shared Libraries14882 ! Node: ANSI C Compliance16290 ! Node: Inline functions17375 ! Node: Long double18410 ! Node: Portability functions19800 ! Node: Alternative optimized functions21194 ! Node: Support for different numeric types22644 ! Node: Compatibility with C++25699 ! Node: Aliasing of arrays26261 ! Node: Thread-safety27002 ! Node: Deprecated Functions28079 ! Node: Code Reuse28694 ! Node: Error Handling29328 ! Node: Error Reporting30074 ! Node: Error Codes31963 ! Node: Error Handlers33719 ! Node: Using GSL error reporting in your own functions37365 ! Node: Error Reporting Examples39313 ! Node: Mathematical Functions40531 ! Node: Mathematical Constants41288 ! Node: Infinities and Not-a-number42410 ! Node: Elementary Functions43464 ! Node: Small integer powers45703 ! Node: Testing the Sign of Numbers47245 ! Node: Testing for Odd and Even Numbers47667 ! Node: Maximum and Minimum functions48213 ! Node: Approximate Comparison of Floating Point Numbers50279 ! Node: Complex Numbers51478 ! Ref: Complex Numbers-Footnote-152782 ! Node: Complex numbers52846 ! Node: Properties of complex numbers54634 ! Node: Complex arithmetic operators55609 ! Node: Elementary Complex Functions58332 ! Node: Complex Trigonometric Functions60136 ! Node: Inverse Complex Trigonometric Functions61343 ! Node: Complex Hyperbolic Functions63931 ! Node: Inverse Complex Hyperbolic Functions65213 ! Node: Complex Number References and Further Reading67037 ! Node: Polynomials68425 ! Node: Polynomial Evaluation69188 ! Node: Divided Difference Representation of Polynomials69639 ! Node: Quadratic Equations71297 ! Node: Cubic Equations73227 ! Node: General Polynomial Equations74588 ! Node: Roots of Polynomials Examples76868 ! Node: Roots of Polynomials References and Further Reading78286 ! Node: Special Functions79223 ! Node: Special Function Usage81191 ! Node: The gsl_sf_result struct82366 ! Node: Special Function Modes83622 ! Node: Airy Functions and Derivatives84550 ! Node: Airy Functions85238 ! Node: Derivatives of Airy Functions86578 ! Node: Zeros of Airy Functions88070 ! Node: Zeros of Derivatives of Airy Functions88773 ! Node: Bessel Functions89516 ! Node: Regular Cylindrical Bessel Functions90700 ! Node: Irregular Cylindrical Bessel Functions92005 ! Node: Regular Modified Cylindrical Bessel Functions93442 ! Node: Irregular Modified Cylindrical Bessel Functions96243 ! Node: Regular Spherical Bessel Functions99185 ! Node: Irregular Spherical Bessel Functions101375 ! Node: Regular Modified Spherical Bessel Functions103041 ! Node: Irregular Modified Spherical Bessel Functions105023 ! Node: Regular Bessel Function - Fractional Order107065 ! Node: Irregular Bessel Functions - Fractional Order108048 ! Node: Regular Modified Bessel Functions - Fractional Order108614 ! Node: Irregular Modified Bessel Functions - Fractional Order109521 ! Node: Zeros of Regular Bessel Functions110737 ! Node: Clausen Functions111820 ! Node: Coulomb Functions112414 ! Node: Normalized Hydrogenic Bound States112855 ! Node: Coulomb Wave Functions113862 ! Node: Coulomb Wave Function Normalization Constant117259 ! Node: Coupling Coefficients117998 ! Node: 3-j Symbols118713 ! Node: 6-j Symbols119303 ! Node: 9-j Symbols119913 ! Node: Dawson Function120605 ! Node: Debye Functions121162 ! Node: Dilogarithm122462 ! Node: Real Argument122747 ! Node: Complex Argument123300 ! Node: Elementary Operations123754 ! Node: Elliptic Integrals124566 ! Node: Definition of Legendre Forms125029 ! Node: Definition of Carlson Forms125864 ! Node: Legendre Form of Complete Elliptic Integrals126562 ! Node: Legendre Form of Incomplete Elliptic Integrals127428 ! Node: Carlson Forms129146 ! Node: Elliptic Functions (Jacobi)130671 ! Node: Error Functions131241 ! Node: Error Function131682 ! Node: Complementary Error Function132039 ! Node: Log Complementary Error Function132483 ! Node: Probability functions132919 ! Node: Exponential Functions134152 ! Node: Exponential Function134525 ! Node: Relative Exponential Functions135718 ! Node: Exponentiation With Error Estimate137367 ! Node: Exponential Integrals138558 ! Node: Exponential Integral139030 ! Node: Ei(x)139660 ! Node: Hyperbolic Integrals140092 ! Node: Ei_3(x)140730 ! Node: Trigonometric Integrals141106 ! Node: Arctangent Integral141687 ! Node: Fermi-Dirac Function142071 ! Node: Complete Fermi-Dirac Integrals142431 ! Node: Incomplete Fermi-Dirac Integrals144862 ! Node: Gamma and Beta Functions145489 ! Node: Gegenbauer Functions153671 ! Node: Hypergeometric Functions155302 ! Node: Laguerre Functions159503 ! Node: Lambert W Functions160755 ! Node: Legendre Functions and Spherical Harmonics161769 ! Node: Legendre Polynomials162348 ! Node: Associated Legendre Polynomials and Spherical Harmonics164348 ! Node: Conical Functions167128 ! Node: Radial Functions for Hyperbolic Space169225 ! Node: Logarithm and Related Functions171381 ! Node: Power Function172983 ! Node: Psi (Digamma) Function173912 ! Node: Digamma Function174422 ! Node: Trigamma Function175232 ! Node: Polygamma Function175791 ! Node: Synchrotron Functions176159 ! Node: Transport Functions176908 ! Node: Trigonometric Functions177997 ! Node: Circular Trigonometric Functions178610 ! Node: Trigonometric Functions for Complex Arguments179597 ! Node: Hyperbolic Trigonometric Functions180614 ! Node: Conversion Functions181199 ! Node: Restriction Functions181966 ! Node: Trigonometric Functions With Error Estimates182577 ! Node: Zeta Functions183321 ! Node: Riemann Zeta Function183769 ! Node: Riemann Zeta Function Minus One184430 ! Node: Hurwitz Zeta Function185183 ! Node: Eta Function185672 ! Node: Special Functions Examples186213 ! Node: Special Functions References and Further Reading187940 ! Node: Vectors and Matrices189036 ! Node: Data types189791 ! Node: Blocks190986 ! Node: Block allocation191894 ! Node: Reading and writing blocks193283 ! Node: Example programs for blocks195331 ! Node: Vectors195963 ! Node: Vector allocation197841 ! Node: Accessing vector elements199362 ! Node: Initializing vector elements201588 ! Node: Reading and writing vectors202267 ! Node: Vector views204331 ! Node: Copying vectors211749 ! Node: Exchanging elements212595 ! Node: Vector operations213139 ! Node: Finding maximum and minimum elements of vectors214635 ! Node: Vector properties216142 ! Node: Example programs for vectors216490 ! Node: Matrices218722 ! Node: Matrix allocation221572 ! Node: Accessing matrix elements223142 ! Node: Initializing matrix elements224834 ! Node: Reading and writing matrices225615 ! Node: Matrix views227692 ! Node: Creating row and column views234810 ! Node: Copying matrices237959 ! Node: Copying rows and columns238541 ! Node: Exchanging rows and columns240202 ! Node: Matrix operations241663 ! Node: Finding maximum and minimum elements of matrices243283 ! Node: Matrix properties245137 ! Node: Example programs for matrices245488 ! Node: Vector and Matrix References and Further Reading249537 ! Node: Permutations250015 ! Node: The Permutation struct251299 ! Node: Permutation allocation251794 ! Node: Accessing permutation elements253215 ! Node: Permutation properties253968 ! Node: Permutation functions254656 ! Node: Applying Permutations255901 ! Node: Reading and writing permutations257813 ! Node: Permutations in cyclic form259983 ! Node: Permutation Examples263395 ! Node: Permutation References and Further Reading265868 ! Node: Combinations266532 ! Node: The Combination struct267371 ! Node: Combination allocation267912 ! Node: Accessing combination elements269681 ! Node: Combination properties270249 ! Node: Combination functions271121 ! Node: Reading and writing combinations272049 ! Node: Combination Examples274235 ! Node: Combination References and Further Reading275551 ! Node: Sorting275944 ! Node: Sorting objects276888 ! Node: Sorting vectors279787 ! Node: Selecting the k smallest or largest elements282348 ! Node: Computing the rank285672 ! Node: Sorting Examples286878 ! Node: Sorting References and Further Reading288499 ! Node: BLAS Support289035 ! Node: GSL BLAS Interface292004 ! Node: Level 1 GSL BLAS Interface292481 ! Node: Level 2 GSL BLAS Interface299155 ! Node: Level 3 GSL BLAS Interface308410 ! Node: BLAS Examples319495 ! Node: BLAS References and Further Reading320949 ! Node: Linear Algebra322298 ! Node: LU Decomposition323546 ! Node: QR Decomposition328718 ! Node: QR Decomposition with Column Pivoting334477 ! Node: Singular Value Decomposition338869 ! Node: Cholesky Decomposition342221 ! Node: Tridiagonal Decomposition of Real Symmetric Matrices344119 ! Node: Tridiagonal Decomposition of Hermitian Matrices345954 ! Node: Bidiagonalization347872 ! Node: Householder Transformations350274 ! Node: Householder solver for linear systems352106 ! Node: Tridiagonal Systems352997 ! Node: Linear Algebra Examples355492 ! Node: Linear Algebra References and Further Reading357518 ! Node: Eigensystems358996 ! Node: Real Symmetric Matrices360047 ! Node: Complex Hermitian Matrices362263 ! Node: Sorting Eigenvalues and Eigenvectors364765 ! Node: Eigenvalue and Eigenvector Examples366084 ! Node: Eigenvalue and Eigenvector References368449 ! Node: Fast Fourier Transforms369147 ! Node: Mathematical Definitions370350 ! Node: Overview of complex data FFTs372745 ! Node: Radix-2 FFT routines for complex data375683 ! Node: Mixed-radix FFT routines for complex data379925 ! Node: Overview of real data FFTs389319 ! Node: Radix-2 FFT routines for real data391743 ! Node: Mixed-radix FFT routines for real data394569 ! Node: FFT References and Further Reading405218 ! Node: Numerical Integration408077 ! Node: Numerical Integration Introduction409616 ! Node: QNG non-adaptive Gauss-Kronrod integration413338 ! Node: QAG adaptive integration414598 ! Node: QAGS adaptive integration with singularities417226 ! Node: QAGP adaptive integration with known singular points419015 ! Node: QAGI adaptive integration on infinite intervals420318 ! Node: QAWC adaptive integration for Cauchy principal values422588 ! Node: QAWS adaptive integration for singular functions423752 ! Node: QAWO adaptive integration for oscillatory functions426979 ! Node: QAWF adaptive integration for Fourier integrals430743 ! Node: Numerical integration error codes433355 ! Node: Numerical integration examples434111 ! Node: Numerical integration References and Further Reading436140 ! Node: Random Number Generation436856 ! Node: General comments on random numbers438352 ! Node: The Random Number Generator Interface440292 ! Node: Random number generator initialization441640 ! Node: Sampling from a random number generator443643 ! Node: Auxiliary random number generator functions446123 ! Node: Random number environment variables448457 ! Node: Copying random number generator state450974 ! Node: Reading and writing random number generator state451937 ! Node: Random number generator algorithms453337 ! Node: Unix random number generators462725 ! Node: Other random number generators466439 ! Node: Random Number Generator Performance475747 ! Node: Random Number Generator Examples477058 ! Node: Random Number References and Further Reading478640 ! Node: Random Number Acknowledgements479925 ! Node: Quasi-Random Sequences480399 ! Node: Quasi-random number generator initialization481500 ! Node: Sampling from a quasi-random number generator482502 ! Node: Auxiliary quasi-random number generator functions483108 ! Node: Saving and resorting quasi-random number generator state484041 ! Node: Quasi-random number generator algorithms484827 ! Node: Quasi-random number generator examples485590 ! Node: Quasi-random number references486580 ! Node: Random Number Distributions487096 ! Node: Random Number Distribution Introduction489941 ! Node: The Gaussian Distribution491035 ! Node: The Gaussian Tail Distribution493451 ! Node: The Bivariate Gaussian Distribution495096 ! Node: The Exponential Distribution496397 ! Node: The Laplace Distribution497520 ! Node: The Exponential Power Distribution498601 ! Node: The Cauchy Distribution499565 ! Node: The Rayleigh Distribution500799 ! Node: The Rayleigh Tail Distribution501955 ! Node: The Landau Distribution502813 ! Node: The Levy alpha-Stable Distributions503754 ! Node: The Levy skew alpha-Stable Distribution504799 ! Node: The Gamma Distribution506398 ! Node: The Flat (Uniform) Distribution507654 ! Node: The Lognormal Distribution508778 ! Node: The Chi-squared Distribution510108 ! Node: The F-distribution511494 ! Node: The t-distribution512918 ! Node: The Beta Distribution514294 ! Node: The Logistic Distribution515266 ! Node: The Pareto Distribution516377 ! Node: Spherical Vector Distributions517529 ! Node: The Weibull Distribution520347 ! Node: The Type-1 Gumbel Distribution521523 ! Node: The Type-2 Gumbel Distribution522742 ! Node: The Dirichlet Distribution523955 ! Node: General Discrete Distributions525608 ! Node: The Poisson Distribution529457 ! Node: The Bernoulli Distribution530174 ! Node: The Binomial Distribution530912 ! Node: The Multinomial Distribution531776 ! Node: The Negative Binomial Distribution533414 ! Node: The Pascal Distribution534419 ! Node: The Geometric Distribution535244 ! Node: The Hypergeometric Distribution536060 ! Node: The Logarithmic Distribution537049 ! Node: Shuffling and Sampling537827 ! Node: Random Number Distribution Examples540671 ! Node: Random Number Distribution References and Further Reading543906 ! Node: Statistics545960 ! Node: Mean and standard deviation and variance547233 ! Node: Absolute deviation550261 ! Node: Higher moments (skewness and kurtosis)551541 ! Node: Autocorrelation553660 ! Node: Covariance554462 ! Node: Weighted Samples555399 ! Node: Maximum and Minimum values560620 ! Node: Median and Percentiles563044 ! Node: Example statistical programs565447 ! Node: Statistics References and Further Reading568157 ! Node: Histograms569353 ! Node: The histogram struct571107 ! Node: Histogram allocation572899 ! Node: Copying Histograms575876 ! Node: Updating and accessing histogram elements576540 ! Node: Searching histogram ranges579789 ! Node: Histogram Statistics580777 ! Node: Histogram Operations582620 ! Node: Reading and writing histograms584675 ! Node: Resampling from histograms587693 ! Node: The histogram probability distribution struct588481 ! Node: Example programs for histograms591495 ! Node: Two dimensional histograms593571 ! Node: The 2D histogram struct594280 ! Node: 2D Histogram allocation596075 ! Node: Copying 2D Histograms598130 ! Node: Updating and accessing 2D histogram elements598821 ! Node: Searching 2D histogram ranges602452 ! Node: 2D Histogram Statistics603458 ! Node: 2D Histogram Operations606295 ! Node: Reading and writing 2D histograms608450 ! Node: Resampling from 2D histograms612091 ! Node: Example programs for 2D histograms615093 ! Node: N-tuples617158 ! Node: The ntuple struct618408 ! Node: Creating ntuples618876 ! Node: Opening an existing ntuple file619532 ! Node: Writing ntuples620149 ! Node: Reading ntuples620598 ! Node: Closing an ntuple file620918 ! Node: Histogramming ntuple values621247 ! Node: Example ntuple programs623242 ! Node: Ntuple References and Further Reading626683 ! Node: Monte Carlo Integration626994 ! Node: Monte Carlo Interface628233 ! Node: PLAIN Monte Carlo630870 ! Node: MISER633294 ! Node: VEGAS639113 ! Node: Monte Carlo Examples647425 ! Node: Monte Carlo Integration References and Further Reading653453 ! Node: Simulated Annealing654225 ! Node: Simulated Annealing algorithm655371 ! Node: Simulated Annealing functions656541 ! Node: Examples with Simulated Annealing661048 ! Node: Trivial example661533 ! Node: Traveling Salesman Problem664303 ! Node: Ordinary Differential Equations667891 ! Node: Defining the ODE System668706 ! Node: Stepping Functions670887 ! Node: Adaptive Step-size Control674819 ! Node: Evolution680259 ! Node: ODE Example programs682806 ! Node: ODE References and Further Reading687844 ! Node: Interpolation688473 ! Node: Introduction to Interpolation689480 ! Node: Interpolation Functions689911 ! Node: Interpolation Types691074 ! Node: Index Look-up and Acceleration693041 ! Node: Evaluation of Interpolating Functions694657 ! Node: Higher-level Interface697023 ! Node: Interpolation Example programs698883 ! Node: Interpolation References and Further Reading700588 ! Node: Numerical Differentiation701018 ! Node: Numerical Differentiation functions701601 ! Node: Numerical Differentiation Examples704444 ! Node: Numerical Differentiation References705888 ! Node: Chebyshev Approximations706429 ! Node: Chebyshev Definitions707439 ! Node: Creation and Calculation of Chebyshev Series708208 ! Node: Chebyshev Series Evaluation709167 ! Node: Derivatives and Integrals710527 ! Node: Chebyshev Approximation examples711757 ! Node: Chebyshev Approximation References and Further Reading713290 ! Node: Series Acceleration713729 ! Node: Acceleration functions714488 ! Node: Acceleration functions without error estimation716717 ! Node: Example of accelerating a series719323 ! Node: Series Acceleration References721731 ! Node: Wavelet Transforms722609 ! Node: DWT Definitions723144 ! Node: DWT Initialization724086 ! Node: DWT Transform Functions726644 ! Node: DWT in one dimension727169 ! Node: DWT in two dimension729167 ! Node: DWT Examples733742 ! Node: DWT References735445 ! Node: Discrete Hankel Transforms737598 ! Node: Discrete Hankel Transform Definition738060 ! Node: Discrete Hankel Transform Functions739896 ! Node: Discrete Hankel Transform References741400 ! Node: One dimensional Root-Finding741794 ! Node: Root Finding Overview743048 ! Node: Root Finding Caveats744896 ! Node: Initializing the Solver746653 ! Node: Providing the function to solve749268 ! Node: Search Bounds and Guesses753067 ! Node: Root Finding Iteration753918 ! Node: Search Stopping Parameters755751 ! Node: Root Bracketing Algorithms758252 ! Node: Root Finding Algorithms using Derivatives761537 ! Node: Root Finding Examples765027 ! Node: Root Finding References and Further Reading772369 ! Node: One dimensional Minimization772996 ! Node: Minimization Overview774292 ! Node: Minimization Caveats775988 ! Node: Initializing the Minimizer777315 ! Node: Providing the function to minimize779541 ! Node: Minimization Iteration780009 ! Node: Minimization Stopping Parameters782128 ! Node: Minimization Algorithms783726 ! Node: Minimization Examples786153 ! Node: Minimization References and Further Reading789145 ! Node: Multidimensional Root-Finding789591 ! Node: Overview of Multidimensional Root Finding791074 ! Node: Initializing the Multidimensional Solver793251 ! Node: Providing the multidimensional system of equations to solve796421 ! Node: Iteration of the multidimensional solver801364 ! Node: Search Stopping Parameters for the multidimensional solver803531 ! Node: Algorithms using Derivatives805256 ! Node: Algorithms without Derivatives809988 ! Node: Example programs for Multidimensional Root finding812992 ! Node: References and Further Reading for Multidimensional Root Finding821780 ! Node: Multidimensional Minimization823009 ! Node: Multimin Overview824295 ! Node: Multimin Caveats826257 ! Node: Initializing the Multidimensional Minimizer826996 ! Node: Providing a function to minimize829901 ! Node: Multimin Iteration833599 ! Node: Multimin Stopping Criteria835571 ! Node: Multimin Algorithms837111 ! Node: Multimin Examples841424 ! Node: Multimin References and Further Reading848181 ! Node: Least-Squares Fitting848849 ! Node: Linear regression849781 ! Node: Linear fitting without a constant term852383 ! Node: Multi-parameter fitting854773 ! Node: Fitting Examples859484 ! Node: Fitting References and Further Reading866314 ! Node: Nonlinear Least-Squares Fitting867127 ! Node: Overview of Nonlinear Least-Squares Fitting868575 ! Node: Initializing the Nonlinear Least-Squares Solver869455 ! Node: Providing the Function to be Minimized872114 ! Node: Iteration of the Minimization Algorithm874755 ! Node: Search Stopping Parameters for Minimization Algorithms876581 ! Node: Minimization Algorithms using Derivatives878663 ! Node: Minimization Algorithms without Derivatives881899 ! Node: Computing the covariance matrix of best fit parameters882281 ! Node: Example programs for Nonlinear Least-Squares Fitting883339 ! Node: References and Further Reading for Nonlinear Least-Squares Fitting890631 ! Node: Physical Constants891355 ! Node: Fundamental Constants892777 ! Node: Astronomy and Astrophysics893906 ! Node: Atomic and Nuclear Physics894561 ! Node: Measurement of Time896117 ! Node: Imperial Units896537 ! Node: Speed and Nautical Units896969 ! Node: Printers Units897463 ! Node: Volume Area and Length897776 ! Node: Mass and Weight898452 ! Node: Thermal Energy and Power899261 ! Node: Pressure899672 ! Node: Viscosity900273 ! Node: Light and Illumination900537 ! Node: Radioactivity901117 ! Node: Force and Energy901440 ! Node: Prefixes901832 ! Node: Physical Constant Examples902563 ! Node: Physical Constant References and Further Reading904372 ! Node: IEEE floating-point arithmetic905071 ! Node: Representation of floating point numbers905651 ! Node: Setting up your IEEE environment910164 ! Node: IEEE References and Further Reading916813 ! Node: Debugging Numerical Programs917957 ! Node: Using gdb918419 ! Node: Examining floating point registers921769 ! Node: Handling floating point exceptions923046 ! Node: GCC warning options for numerical programs924452 ! Node: Debugging References928637 ! Node: Contributors to GSL929341 ! Node: Autoconf Macros931547 ! Node: GSL CBLAS Library935525 ! Node: Level 1 CBLAS Functions936030 ! Node: Level 2 CBLAS Functions941278 ! Node: Level 3 CBLAS Functions957874 ! Node: GSL CBLAS Examples967497 ! Node: Free Software Needs Free Documentation969107 ! Node: GNU General Public License974176 ! Node: GNU Free Documentation License993474 ! Node: Function Index1015910 ! Node: Variable Index1136473 ! Node: Type Index1137283 ! Node: Concept Index1139212  End Tag Table diff -rc2P gsl-1.6/doc/gsl-ref.info-1 gsl-1.7/doc/gsl-ref.info-1 *** gsl-1.6/doc/gsl-ref.info-1 Fri Dec 31 15:30:03 2004 --- gsl-1.7/doc/gsl-ref.info-1 Tue Sep 13 10:18:36 2005 *************** *** 15,19 **** This file documents the GNU Scientific Library (GSL), a collection of numerical routines for scientific computing. It corresponds to release ! 1.6 of the library. More information about GSL can be found at the project homepage, --- 15,20 ---- This file documents the GNU Scientific Library (GSL), a collection of numerical routines for scientific computing. It corresponds to release ! 1.7 of the library. Please report any errors in this manual to ! . More information about GSL can be found at the project homepage, *************** *** 26,29 **** --- 27,33 ---- Ltd at `http://www.network-theory.co.uk/gsl/manual/'. + The money raised from sales of the manual helps support the + development of GSL. + * Menu: *************** *** 111,114 **** --- 115,119 ---- Routines are available for the following areas, + Complex Numbers Roots of Polynomials Special Functions Vectors and Matrices *************** *** 127,130 **** --- 132,137 ---- Least-Squares Fitting Minimization IEEE Floating-Point Physical Constants + Wavelets + The use of these routines is described in this manual. Each chapter *************** *** 197,203 **** to take advantage of additional features in the GNU C compiler and GNU C library. However, the library is fully portable and should compile on ! most systems. Precompiled versions of the library and support contracts ! can be purchased from commercial redistributors listed on the website ! above. Announcements of new releases, updates and other relevant events are --- 204,209 ---- to take advantage of additional features in the GNU C compiler and GNU C library. However, the library is fully portable and should compile on ! most systems. Precompiled versions of the library can be purchased from ! commercial redistributors listed on the website above. Announcements of new releases, updates and other relevant events are *************** *** 208,212 **** Subject: subscribe ! You will receive a response asking to you to reply in order to confirm your subscription. --- 214,218 ---- Subject: subscribe ! You will receive a response asking you to reply in order to confirm your subscription. *************** *** 219,224 **** The software described in this manual has no warranty, it is provided "as is". It is your responsibility to validate the behavior of the ! routines and their accuracy using the source code provided. Consult the ! GNU General Public license for further details (*note GNU General Public License::). --- 225,231 ---- The software described in this manual has no warranty, it is provided "as is". It is your responsibility to validate the behavior of the ! routines and their accuracy using the source code provided, or to ! purchase support and warranties from commercial redistributors. Consult ! the GNU General Public license for further details (*note GNU General Public License::). *************** *** 248,253 **** * A short program which exercises the bug ! It is also useful if you can report whether the same problem occurs ! when the library is compiled without optimization. Thank you.  --- 255,263 ---- * A short program which exercises the bug ! It is useful if you can check whether the same problem occurs when the ! library is compiled without optimization. Thank you. ! ! Any errors or omissions in this manual can also be reported to the ! same address.  *************** *** 314,317 **** --- 324,328 ---- * Aliasing of arrays:: * Thread-safety:: + * Deprecated Functions:: * Code Reuse:: *************** *** 362,376 **** `/usr/local/include/gsl'. A typical compilation command for a source file `example.c' with the GNU C compiler `gcc' is, $ gcc -Wall -I/usr/local/include -c example.c This results in an object file `example.o'. The default include path for `gcc' searches `/usr/local/include' automatically so the `-I' ! option can be omitted when GSL is installed in its default location. ! The library is installed as a single file, `libgsl.a'. A shared ! version of the library is also installed on systems that support shared ! libraries. The default location of these files is `/usr/local/lib'. ! If this directory is not on the standard search path of your linker you ! will also need to provide its location as a command line flag. To link against the library you need to specify both the main --- 373,393 ---- `/usr/local/include/gsl'. A typical compilation command for a source file `example.c' with the GNU C compiler `gcc' is, + $ gcc -Wall -I/usr/local/include -c example.c This results in an object file `example.o'. The default include path for `gcc' searches `/usr/local/include' automatically so the `-I' ! option can actually be omitted when GSL is installed in its default ! location. ! Linking programs with the library ! --------------------------------- ! ! The library is installed as a single file, `libgsl.a'. A shared ! version of the library `libgsl.so' is also installed on systems that ! support shared libraries. The default location of these files is ! `/usr/local/lib'. If this directory is not on the standard search path ! of your linker you will also need to provide its location as a command ! line flag. To link against the library you need to specify both the main *************** *** 387,392 **** in its default location. ! The following command line shows how you would link the same ! application with an alternative blas library called `libcblas', $ gcc example.o -lgsl -lcblas -lm --- 404,412 ---- in its default location. ! Linking with an alternative BLAS library ! ---------------------------------------- ! ! The following command line shows how you would link the same application ! with an alternative CBLAS library called `libcblas', $ gcc example.o -lgsl -lcblas -lm *************** *** 404,416 **** For more information see *Note BLAS Support::. - The program `gsl-config' provides information on the local version - of the library. For example, the following command shows that the - library has been installed under the directory `/usr/local', - - $ gsl-config --prefix - /usr/local - - Further information is available using the command `gsl-config --help'. -  File: gsl-ref.info, Node: Shared Libraries, Next: ANSI C Compliance, Prev: Compiling and Linking, Up: Using the library --- 424,427 ---- *************** *** 419,427 **** ================ ! To run a program linked with the shared version of the library it may be ! necessary to define the shell variable `LD_LIBRARY_PATH' to include the ! directory where the library is installed. For example, in the Bourne ! shell (`/bin/sh' or `/bin/bash'), the library path can be set with the ! following commands: $ LD_LIBRARY_PATH=/usr/local/lib:$LD_LIBRARY_PATH --- 430,448 ---- ================ ! To run a program linked with the shared version of the library the ! operating system must be able to locate the corresponding `.so' file at ! runtime. If the library cannot be found, the following error will ! occur: ! ! $ ./a.out ! ./a.out: error while loading shared libraries: ! libgsl.so.0: cannot open shared object file: No such ! file or directory ! ! To avoid this error, define the shell variable `LD_LIBRARY_PATH' to ! include the directory where the library is installed. ! ! For example, in the Bourne shell (`/bin/sh' or `/bin/bash'), the ! library search path can be set with the following commands: $ LD_LIBRARY_PATH=/usr/local/lib:$LD_LIBRARY_PATH *************** *** 451,456 **** The library is written in ANSI C and is intended to conform to the ANSI ! C standard. It should be portable to any system with a working ANSI C ! compiler. The library does not rely on any non-ANSI extensions in the --- 472,477 ---- The library is written in ANSI C and is intended to conform to the ANSI ! C standard (C89). It should be portable to any system with a working ! ANSI C compiler. The library does not rely on any non-ANSI extensions in the *************** *** 476,485 **** ================ ! The `inline' keyword is not part of ANSI C and the library does not ! export any inline function definitions by default. However, the library ! provides optional inline versions of performance-critical functions by ! conditional compilation. The inline versions of these functions can be ! included by defining the macro `HAVE_INLINE' when compiling an ! application. $ gcc -Wall -c -DHAVE_INLINE example.c --- 497,506 ---- ================ ! The `inline' keyword is not part of the original ANSI C standard (C89) ! and the library does not export any inline function definitions by ! default. However, the library provides optional inline versions of ! performance-critical functions by conditional compilation. The inline ! versions of these functions can be included by defining the macro ! `HAVE_INLINE' when compiling an application, $ gcc -Wall -c -DHAVE_INLINE example.c *************** *** 567,571 **** optimal on all architectures. For example, there are several ways to compute a Gaussian random variate and their relative speeds are ! platform-dependent. In cases like this the library provides alternate implementations of these functions with the same interface. If you write your application using calls to the standard implementation you --- 588,592 ---- optimal on all architectures. For example, there are several ways to compute a Gaussian random variate and their relative speeds are ! platform-dependent. In cases like this the library provides alternative implementations of these functions with the same interface. If you write your application using calls to the standard implementation you *************** *** 598,605 **** Many functions in the library are defined for different numeric types. This feature is implemented by varying the name of the function with a ! type-related modifier -- a primitive form of C++ templates. The ! modifier is inserted into the function name after the initial module ! prefix. The following table shows the function names defined for all ! the numeric types of an imaginary module `gsl_foo' with function `fn', gsl_foo_fn double --- 619,626 ---- Many functions in the library are defined for different numeric types. This feature is implemented by varying the name of the function with a ! type-related modifier--a primitive form of C++ templates. The modifier ! is inserted into the function name after the initial module prefix. ! The following table shows the function names defined for all the ! numeric types of an imaginary module `gsl_foo' with function `fn', gsl_foo_fn double *************** *** 664,668 **** The library header files automatically define functions to have `extern ! "C"' linkage when included in C++ programs.  --- 685,694 ---- The library header files automatically define functions to have `extern ! "C"' linkage when included in C++ programs. This allows the functions ! to be called directly from C++. ! ! To use C++ exception handling within user-defined functions passed to ! the library as parameters, the library must be built with the ! additional `CFLAGS' compilation option `-fexceptions'.  *************** *** 683,687 ****  ! File: gsl-ref.info, Node: Thread-safety, Next: Code Reuse, Prev: Aliasing of arrays, Up: Using the library Thread-safety --- 709,713 ----  ! File: gsl-ref.info, Node: Thread-safety, Next: Deprecated Functions, Prev: Aliasing of arrays, Up: Using the library Thread-safety *************** *** 705,709 ****  ! File: gsl-ref.info, Node: Code Reuse, Prev: Thread-safety, Up: Using the library Code Reuse --- 731,749 ----  ! File: gsl-ref.info, Node: Deprecated Functions, Next: Code Reuse, Prev: Thread-safety, Up: Using the library ! ! Deprecated Functions ! ==================== ! ! From time to time, it may be necessary for the definitions of some ! functions to be altered or removed from the library. In these ! circumstances the functions will first be declared "deprecated" and ! then removed from subsequent versions of the library. Functions that ! are deprecated can be disabled in the current release by setting the ! preprocessor definition `GSL_DISABLE_DEPRECATED'. This allows existing ! code to be tested for forwards compatibility. ! !  ! File: gsl-ref.info, Node: Code Reuse, Prev: Deprecated Functions, Up: Using the library Code Reuse *************** *** 797,802 **** file `gsl_errno.h'. They all have the prefix `GSL_' and expand to non-zero constant integer values. Many of the error codes use the same ! base name as a corresponding error code in C library. Here are some of ! the most common error codes, - Macro: int GSL_EDOM --- 837,842 ---- file `gsl_errno.h'. They all have the prefix `GSL_' and expand to non-zero constant integer values. Many of the error codes use the same ! base name as the corresponding error code in the C library. Here are ! some of the most common error codes, - Macro: int GSL_EDOM *************** *** 1033,1037 **** The library ensures that the standard BSD mathematical constants are ! defined. For reference here is a list of the constants. `M_E' --- 1073,1077 ---- The library ensures that the standard BSD mathematical constants are ! defined. For reference, here is a list of the constants: `M_E' *************** *** 1157,1165 **** - Function: double gsl_ldexp (double X, int E) This function computes the value of x * 2^e. It provides an ! alternative to the standard math function `ldexp(x)'. - Function: double gsl_frexp (double X, int * E) This function splits the number x into its normalized fraction f ! and exponent e, such that x = f * 2^e and 0.5 <= f < 1. Ihe function returns f and stores the exponent in e. If x is zero, both f and e are set to zero. This function provides an --- 1197,1205 ---- - Function: double gsl_ldexp (double X, int E) This function computes the value of x * 2^e. It provides an ! alternative to the standard math function `ldexp(x,e)'. - Function: double gsl_frexp (double X, int * E) This function splits the number x into its normalized fraction f ! and exponent e, such that x = f * 2^e and 0.5 <= f < 1. The function returns f and stores the exponent in e. If x is zero, both f and e are set to zero. This function provides an *************** *** 1179,1186 **** - Function: double gsl_pow_int (double X, int N) This routine computes the power x^n for integer N. The power is ! computed efficiently -- for example, x^8 is computed as ! ((x^2)^2)^2, requiring only 3 multiplications. A version of this ! function which also computes the numerical error in the result is ! available as `gsl_sf_pow_int_e'. - Function: double gsl_pow_2 (const double X) --- 1219,1226 ---- - Function: double gsl_pow_int (double X, int N) This routine computes the power x^n for integer N. The power is ! computed efficiently--for example, x^8 is computed as ((x^2)^2)^2, ! requiring only 3 multiplications. A version of this function ! which also computes the numerical error in the result is available ! as `gsl_sf_pow_int_e'. - Function: double gsl_pow_2 (const double X) *************** *** 1311,1317 **** Mathematical Functions'. The functions return principal values which are the same as those in GNU Calc, which in turn are the same as those in ! `Common Lisp, The Language (Second Edition)' (n.b. The second edition ! uses different definitions from the first edition) and the HP-28/48 ! series of calculators. The complex types are defined in the header file `gsl_complex.h', --- 1351,1356 ---- Mathematical Functions'. The functions return principal values which are the same as those in GNU Calc, which in turn are the same as those in ! `Common Lisp, The Language (Second Edition)'(1) and the HP-28/48 series ! of calculators. The complex types are defined in the header file `gsl_complex.h', *************** *** 1331,1334 **** --- 1370,1377 ---- * Complex Number References and Further Reading:: + ---------- Footnotes ---------- + + (1) Note that the first edition uses different definitions. +  File: gsl-ref.info, Node: Complex numbers, Next: Properties of complex numbers, Up: Complex Numbers *************** *** 1560,1566 **** This function returns the complex arcsine of the real number Z, \arcsin(z). For z between -1 and 1, the function returns a real ! value in the range (-\pi,\pi]. For z less than -1 the result has a ! real part of -\pi/2 and a positive imaginary part. For z greater ! than 1 the result has a real part of \pi/2 and a negative imaginary part. --- 1603,1609 ---- This function returns the complex arcsine of the real number Z, \arcsin(z). For z between -1 and 1, the function returns a real ! value in the range [-\pi/2,\pi/2]. For z less than -1 the result ! has a real part of -\pi/2 and a positive imaginary part. For z ! greater than 1 the result has a real part of \pi/2 and a negative imaginary part. *************** *** 1574,1578 **** \arccos(z). For z between -1 and 1, the function returns a real value in the range [0,\pi]. For z less than -1 the result has a ! real part of \pi/2 and a negative imaginary part. For z greater than 1 the result is purely imaginary and positive. --- 1617,1621 ---- \arccos(z). For z between -1 and 1, the function returns a real value in the range [0,\pi]. For z less than -1 the result has a ! real part of \pi and a negative imaginary part. For z greater than 1 the result is purely imaginary and positive. *************** *** 1700,1704 **** Imaginary Parts", Formulas 4.4.37-39, "Hyperbolic Functions in Terms of Real and Imaginary Parts", Formulas 4.5.49-52, "Inverse ! Hyperbolic Functions - relation to Inverse Circular Functions", Formulas 4.6.14-19. --- 1743,1747 ---- Imaginary Parts", Formulas 4.4.37-39, "Hyperbolic Functions in Terms of Real and Imaginary Parts", Formulas 4.5.49-52, "Inverse ! Hyperbolic Functions--relation to Inverse Circular Functions", Formulas 4.6.14-19. *************** *** 1781,1792 **** - Function: int gsl_poly_solve_quadratic (double A, double B, double ! C, double *X0, double *X1) This function finds the real roots of the quadratic equation, a x^2 + b x + c = 0 ! The number of real roots (either zero or two) is returned, and their locations are stored in X0 and X1. If no real roots are ! found then X0 and X1 are not modified. When two real roots are found they are stored in X0 and X1 in ascending order. The case of coincident roots is not considered special. For example --- 1824,1836 ---- - Function: int gsl_poly_solve_quadratic (double A, double B, double ! C, double * X0, double * X1) This function finds the real roots of the quadratic equation, a x^2 + b x + c = 0 ! The number of real roots (either zero, one or two) is returned, and their locations are stored in X0 and X1. If no real roots are ! found then X0 and X1 are not modified. If one real root is found ! (i.e. if a=0) then it is stored in X0. When two real roots are found they are stored in X0 and X1 in ascending order. The case of coincident roots is not considered special. For example *************** *** 1804,1816 **** - Function: int gsl_poly_complex_solve_quadratic (double A, double B, ! double C, gsl_complex *Z0, gsl_complex *Z1) This function finds the complex roots of the quadratic equation, a z^2 + b z + c = 0 ! The number of complex roots is returned (always two) and the locations of the roots are stored in Z0 and Z1. The roots are returned in ascending order, sorted first by their real components ! and then by their imaginary components. --- 1848,1861 ---- - Function: int gsl_poly_complex_solve_quadratic (double A, double B, ! double C, gsl_complex * Z0, gsl_complex * Z1) This function finds the complex roots of the quadratic equation, a z^2 + b z + c = 0 ! The number of complex roots is returned (either one or two) and the locations of the roots are stored in Z0 and Z1. The roots are returned in ascending order, sorted first by their real components ! and then by their imaginary components. If only one real root is ! found (i.e. if a=0) then it is stored in Z0. *************** *** 1822,1826 **** - Function: int gsl_poly_solve_cubic (double A, double B, double C, ! double *X0, double *X1, double *X2) This function finds the real roots of the cubic equation, --- 1867,1871 ---- - Function: int gsl_poly_solve_cubic (double A, double B, double C, ! double * X0, double * X1, double * X2) This function finds the real roots of the cubic equation, *************** *** 1837,1841 **** - Function: int gsl_poly_complex_solve_cubic (double A, double B, ! double C, gsl_complex *Z0, gsl_complex *Z1, gsl_complex *Z2) This function finds the complex roots of the cubic equation, --- 1882,1887 ---- - Function: int gsl_poly_complex_solve_cubic (double A, double B, ! double C, gsl_complex * Z0, gsl_complex * Z1, gsl_complex * ! Z2) This function finds the complex roots of the cubic equation, *************** *** 1885,1889 **** The function returns `GSL_SUCCESS' if all the roots are found and ! `GSL_EFAILED' if the QR reduction does not converge.  --- 1931,1941 ---- The function returns `GSL_SUCCESS' if all the roots are found and ! `GSL_EFAILED' if the QR reduction does not converge. Note that due ! to finite precision, roots of higher multiplicity are returned as a ! cluster of simple roots with reduced accuracy. The solution of ! polynomials with higher-order roots requires specialized ! algorithms that take the multiplicity structure into account (see ! e.g. Z. Zeng, Algorithm 835, ACM Transactions on Mathematical ! Software, Volume 30, Issue 2 (2004), pp 218-236).  *************** *** 1907,1911 **** { int i; ! /* coefficient of P(x) = -1 + x^5 */ double a[6] = { -1, 0, 0, 0, 0, 1 }; double z[10]; --- 1959,1963 ---- { int i; ! /* coefficients of P(x) = -1 + x^5 */ double a[6] = { -1, 0, 0, 0, 0, 1 }; double z[10]; *************** *** 1929,1933 **** The output of the program is, ! bash$ ./a.out z0 = -0.809016994374947451 +0.587785252292473137 --- 1981,1985 ---- The output of the program is, ! $ ./a.out z0 = -0.809016994374947451 +0.587785252292473137 *************** *** 1957,1964 **** A. Edelman and H. Murakami, "Polynomial roots from companion matrix ! eigenvalues", `Mathematics of Computation', Vol. 64 No. 210 (1995), 763-776. ! The formulas for divided difference are given in Abramowitz and Stegun, Abramowitz and Stegun, `Handbook of Mathematical Functions', --- 2009,2016 ---- A. Edelman and H. Murakami, "Polynomial roots from companion matrix ! eigenvalues", `Mathematics of Computation', Vol. 64, No. 210 (1995), 763-776. ! The formulas for divided differences are given in Abramowitz and Stegun, Abramowitz and Stegun, `Handbook of Mathematical Functions', *************** *** 1983,1989 **** error in the calculated value of the function. ! The functions are declared in individual header files, such as ! `gsl_sf_airy.h', `gsl_sf_bessel.h', etc. The complete set of header ! files can be included using the file `gsl_sf.h'. * Menu: --- 2035,2041 ---- error in the calculated value of the function. ! The functions in this chapter are declared in individual header ! files, such as `gsl_sf_airy.h', `gsl_sf_bessel.h', etc. The complete ! set of header files can be included using the file `gsl_sf.h'. * Menu: *************** *** 2007,2011 **** * Exponential Integrals:: * Fermi-Dirac Function:: ! * Gamma Function:: * Gegenbauer Functions:: * Hypergeometric Functions:: --- 2059,2063 ---- * Exponential Integrals:: * Fermi-Dirac Function:: ! * Gamma and Beta Functions:: * Gegenbauer Functions:: * Hypergeometric Functions:: *************** *** 2190,2195 **** - Function: int gsl_sf_airy_Ai_deriv_scaled_e (double X, gsl_mode_t MODE, gsl_sf_result * RESULT) ! These routines compute the derivative of the scaled Airy function ! S_A(x) Ai(x). - Function: double gsl_sf_airy_Bi_deriv_scaled (double X, gsl_mode_t --- 2242,2248 ---- - Function: int gsl_sf_airy_Ai_deriv_scaled_e (double X, gsl_mode_t MODE, gsl_sf_result * RESULT) ! These routines compute the scaled Airy function derivative S_A(x) ! Ai'(x). For x>0 the scaling factor S_A(x) is \exp(+(2/3) ! x^(3/2)), and is 1 for x<0. - Function: double gsl_sf_airy_Bi_deriv_scaled (double X, gsl_mode_t *************** *** 2197,2202 **** - Function: int gsl_sf_airy_Bi_deriv_scaled_e (double X, gsl_mode_t MODE, gsl_sf_result * RESULT) ! These routines compute the derivative of the scaled Airy function ! S_B(x) Bi(x).  --- 2250,2256 ---- - Function: int gsl_sf_airy_Bi_deriv_scaled_e (double X, gsl_mode_t MODE, gsl_sf_result * RESULT) ! These routines compute the scaled Airy function derivative S_B(x) ! Bi'(x). For x>0 the scaling factor S_B(x) is exp(-(2/3) x^(3/2)), ! and is 1 for x<0.  *************** *** 2292,2296 **** functions J_n(x) for n from NMIN to NMAX inclusive, storing the results in the array RESULT_ARRAY. The values are computed using ! recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2346,2350 ---- functions J_n(x) for n from NMIN to NMAX inclusive, storing the results in the array RESULT_ARRAY. The values are computed using ! recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2322,2326 **** Bessel functions Y_n(x) for n from NMIN to NMAX inclusive, storing the results in the array RESULT_ARRAY. The domain of the function ! is x>0. The values are computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2376,2380 ---- Bessel functions Y_n(x) for n from NMIN to NMAX inclusive, storing the results in the array RESULT_ARRAY. The domain of the function ! is x>0. The values are computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2354,2358 **** inclusive, storing the results in the array RESULT_ARRAY. The start of the range NMIN must be positive or zero. The values are ! computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2408,2412 ---- inclusive, storing the results in the array RESULT_ARRAY. The start of the range NMIN must be positive or zero. The values are ! computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2381,2385 **** inclusive, storing the results in the array RESULT_ARRAY. The start of the range NMIN must be positive or zero. The values are ! computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2435,2439 ---- inclusive, storing the results in the array RESULT_ARRAY. The start of the range NMIN must be positive or zero. The values are ! computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2413,2417 **** start of the range NMIN must be positive or zero. The domain of the function is x>0. The values are computed using recurrence ! relations, for efficiency, and therefore may differ slightly from the exact values. --- 2467,2471 ---- start of the range NMIN must be positive or zero. The domain of the function is x>0. The values are computed using recurrence ! relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2441,2445 **** start of the range NMIN must be positive or zero. The domain of the function is x>0. The values are computed using recurrence ! relations, for efficiency, and therefore may differ slightly from the exact values. --- 2495,2499 ---- start of the range NMIN must be positive or zero. The domain of the function is x>0. The values are computed using recurrence ! relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2476,2480 **** functions j_l(x) for l from 0 to LMAX inclusive for lmax >= 0 and x >= 0, storing the results in the array RESULT_ARRAY. The values ! are computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2530,2534 ---- functions j_l(x) for l from 0 to LMAX inclusive for lmax >= 0 and x >= 0, storing the results in the array RESULT_ARRAY. The values ! are computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2520,2524 **** functions y_l(x) for l from 0 to LMAX inclusive for lmax >= 0, storing the results in the array RESULT_ARRAY. The values are ! computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2574,2578 ---- functions y_l(x) for l from 0 to LMAX inclusive for lmax >= 0, storing the results in the array RESULT_ARRAY. The values are ! computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2562,2566 **** cylindrical Bessel functions \exp(-|x|) i_l(x) for l from 0 to LMAX inclusive for lmax >= 0, storing the results in the array ! RESULT_ARRAY. The values are computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2616,2620 ---- cylindrical Bessel functions \exp(-|x|) i_l(x) for l from 0 to LMAX inclusive for lmax >= 0, storing the results in the array ! RESULT_ARRAY. The values are computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2605,2609 **** spherical Bessel functions \exp(x) k_l(x) for l from 0 to LMAX inclusive for lmax >= 0 and x>0, storing the results in the array ! RESULT_ARRAY. The values are computed using recurrence relations, for efficiency, and therefore may differ slightly from the exact values. --- 2659,2663 ---- spherical Bessel functions \exp(x) k_l(x) for l from 0 to LMAX inclusive for lmax >= 0 and x>0, storing the results in the array ! RESULT_ARRAY. The values are computed using recurrence relations for efficiency, and therefore may differ slightly from the exact values. *************** *** 2612,2617 **** File: gsl-ref.info, Node: Regular Bessel Function - Fractional Order, Next: Irregular Bessel Functions - Fractional Order, Prev: Irregular Modified Spherical Bessel Functions, Up: Bessel Functions ! Regular Bessel Function - Fractional Order ! ------------------------------------------ - Function: double gsl_sf_bessel_Jnu (double NU, double X) --- 2666,2671 ---- File: gsl-ref.info, Node: Regular Bessel Function - Fractional Order, Next: Irregular Bessel Functions - Fractional Order, Prev: Irregular Modified Spherical Bessel Functions, Up: Bessel Functions ! Regular Bessel Function--Fractional Order ! ----------------------------------------- - Function: double gsl_sf_bessel_Jnu (double NU, double X) *************** *** 2619,2623 **** gsl_sf_result * RESULT) These routines compute the regular cylindrical Bessel function of ! fractional order nu, J_\nu(x). - Function: int gsl_sf_bessel_sequence_Jnu_e (double NU, gsl_mode_t --- 2673,2677 ---- gsl_sf_result * RESULT) These routines compute the regular cylindrical Bessel function of ! fractional order \nu, J_\nu(x). - Function: int gsl_sf_bessel_sequence_Jnu_e (double NU, gsl_mode_t *************** *** 2632,2637 **** File: gsl-ref.info, Node: Irregular Bessel Functions - Fractional Order, Next: Regular Modified Bessel Functions - Fractional Order, Prev: Regular Bessel Function - Fractional Order, Up: Bessel Functions ! Irregular Bessel Functions - Fractional Order ! --------------------------------------------- - Function: double gsl_sf_bessel_Ynu (double NU, double X) --- 2686,2691 ---- File: gsl-ref.info, Node: Irregular Bessel Functions - Fractional Order, Next: Regular Modified Bessel Functions - Fractional Order, Prev: Regular Bessel Function - Fractional Order, Up: Bessel Functions ! Irregular Bessel Functions--Fractional Order ! -------------------------------------------- - Function: double gsl_sf_bessel_Ynu (double NU, double X) *************** *** 2639,2649 **** gsl_sf_result * RESULT) These routines compute the irregular cylindrical Bessel function of ! fractional order nu, Y_\nu(x).  File: gsl-ref.info, Node: Regular Modified Bessel Functions - Fractional Order, Next: Irregular Modified Bessel Functions - Fractional Order, Prev: Irregular Bessel Functions - Fractional Order, Up: Bessel Functions ! Regular Modified Bessel Functions - Fractional Order ! ---------------------------------------------------- - Function: double gsl_sf_bessel_Inu (double NU, double X) --- 2693,2703 ---- gsl_sf_result * RESULT) These routines compute the irregular cylindrical Bessel function of ! fractional order \nu, Y_\nu(x).  File: gsl-ref.info, Node: Regular Modified Bessel Functions - Fractional Order, Next: Irregular Modified Bessel Functions - Fractional Order, Prev: Irregular Bessel Functions - Fractional Order, Up: Bessel Functions ! Regular Modified Bessel Functions--Fractional Order ! --------------------------------------------------- - Function: double gsl_sf_bessel_Inu (double NU, double X) *************** *** 2651,2655 **** gsl_sf_result * RESULT) These routines compute the regular modified Bessel function of ! fractional order nu, I_\nu(x) for x>0, \nu>0. - Function: double gsl_sf_bessel_Inu_scaled (double NU, double X) --- 2705,2709 ---- gsl_sf_result * RESULT) These routines compute the regular modified Bessel function of ! fractional order \nu, I_\nu(x) for x>0, \nu>0. - Function: double gsl_sf_bessel_Inu_scaled (double NU, double X) *************** *** 2657,2667 **** gsl_sf_result * RESULT) These routines compute the scaled regular modified Bessel function ! of fractional order nu, \exp(-|x|)I_\nu(x) for x>0, \nu>0.  File: gsl-ref.info, Node: Irregular Modified Bessel Functions - Fractional Order, Next: Zeros of Regular Bessel Functions, Prev: Regular Modified Bessel Functions - Fractional Order, Up: Bessel Functions ! Irregular Modified Bessel Functions - Fractional Order ! ------------------------------------------------------ - Function: double gsl_sf_bessel_Knu (double NU, double X) --- 2711,2721 ---- gsl_sf_result * RESULT) These routines compute the scaled regular modified Bessel function ! of fractional order \nu, \exp(-|x|)I_\nu(x) for x>0, \nu>0.  File: gsl-ref.info, Node: Irregular Modified Bessel Functions - Fractional Order, Next: Zeros of Regular Bessel Functions, Prev: Regular Modified Bessel Functions - Fractional Order, Up: Bessel Functions ! Irregular Modified Bessel Functions--Fractional Order ! ----------------------------------------------------- - Function: double gsl_sf_bessel_Knu (double NU, double X) *************** *** 2669,2673 **** gsl_sf_result * RESULT) These routines compute the irregular modified Bessel function of ! fractional order nu, K_\nu(x) for x>0, \nu>0. - Function: double gsl_sf_bessel_lnKnu (double NU, double X) --- 2723,2727 ---- gsl_sf_result * RESULT) These routines compute the irregular modified Bessel function of ! fractional order \nu, K_\nu(x) for x>0, \nu>0. - Function: double gsl_sf_bessel_lnKnu (double NU, double X) *************** *** 2675,2679 **** gsl_sf_result * RESULT) These routines compute the logarithm of the irregular modified ! Bessel function of fractional order nu, \ln(K_\nu(x)) for x>0, \nu>0. --- 2729,2733 ---- gsl_sf_result * RESULT) These routines compute the logarithm of the irregular modified ! Bessel function of fractional order \nu, \ln(K_\nu(x)) for x>0, \nu>0. *************** *** 2682,2686 **** gsl_sf_result * RESULT) These routines compute the scaled irregular modified Bessel ! function of fractional order nu, \exp(+|x|) K_\nu(x) for x>0, \nu>0. --- 2736,2740 ---- gsl_sf_result * RESULT) These routines compute the scaled irregular modified Bessel ! function of fractional order \nu, \exp(+|x|) K_\nu(x) for x>0, \nu>0. *************** *** 2717,2725 **** The Clausen function is defined by the following integral, Cl_2(x) = - \int_0^x dt \log(2 \sin(t/2)) ! It is related to the dilogarithm by Cl_2(\theta) = \Im Li_2(\exp(i ! \theta)). The Clausen functions are declared in the header file ! `gsl_sf_clausen.h'. - Function: double gsl_sf_clausen (double X) --- 2771,2780 ---- The Clausen function is defined by the following integral, + Cl_2(x) = - \int_0^x dt \log(2 \sin(t/2)) ! It is related to the dilogarithm by Cl_2(\theta) = \Im ! Li_2(\exp(i\theta)). The Clausen functions are declared in the header ! file `gsl_sf_clausen.h'. - Function: double gsl_sf_clausen (double X) *************** *** 2733,2737 **** ================= ! The Coulomb functions are declared in the header file `gsl_sf_coulomb.h'. Both bound state and scattering solutions are available. --- 2788,2792 ---- ================= ! The prototypes of the Coulomb functions are declared in the header file `gsl_sf_coulomb.h'. Both bound state and scattering solutions are available. *************** *** 2761,2764 **** --- 2816,2820 ---- These routines compute the N-th normalized hydrogenic bound state radial wavefunction, + R_n := 2 (Z^{3/2}/n^2) \sqrt{(n-l-1)!/(n+l)!} \exp(-Z r/n) (2Z/n)^l L^{2l+1}_{n-l-1}(2Z/n r). *************** *** 2790,2797 **** gsl_sf_result * G, gsl_sf_result * GP, double * EXP_F, double * EXP_G) ! This function computes the coulomb wave functions F_L(\eta,x), ! G_{L-k}(\eta,x) and their derivatives with respect to x, ! F'_L(\eta,x) G'_{L-k}(\eta,x). The parameters are restricted to L, ! L-k > -1/2, x > 0 and integer k. Note that L itself is not restricted to being an integer. The results are stored in the parameters F, G for the function values and FP, GP for the --- 2846,2853 ---- gsl_sf_result * G, gsl_sf_result * GP, double * EXP_F, double * EXP_G) ! This function computes the Coulomb wave functions F_L(\eta,x), ! G_{L-k}(\eta,x) and their derivatives F'_L(\eta,x), ! G'_{L-k}(\eta,x) with respect to x. The parameters are restricted ! to L, L-k > -1/2, x > 0 and integer k. Note that L itself is not restricted to being an integer. The results are stored in the parameters F, G for the function values and FP, GP for the *************** *** 2802,2808 **** - Function: int gsl_sf_coulomb_wave_F_array (double L_MIN, int KMAX, double ETA, double X, double FC_ARRAY[], double * F_EXPONENT) ! This function computes the function F_L(eta,x) for L = Lmin \dots ! Lmin + kmax storing the results in FC_ARRAY. In the case of ! overflow the exponent is stored in F_EXPONENT. - Function: int gsl_sf_coulomb_wave_FG_array (double L_MIN, int KMAX, --- 2858,2864 ---- - Function: int gsl_sf_coulomb_wave_F_array (double L_MIN, int KMAX, double ETA, double X, double FC_ARRAY[], double * F_EXPONENT) ! This function computes the Coulomb wave function F_L(\eta,x) for L ! = Lmin \dots Lmin + kmax, storing the results in FC_ARRAY. In the ! case of overflow the exponent is stored in F_EXPONENT. - Function: int gsl_sf_coulomb_wave_FG_array (double L_MIN, int KMAX, *************** *** 2849,2853 **** - Function: int gsl_sf_coulomb_CL_array (double LMIN, int KMAX, double ETA, double CL[]) ! This function computes the coulomb wave function normalization constant C_L(\eta) for L = Lmin \dots Lmin + kmax, Lmin > -1. --- 2905,2909 ---- - Function: int gsl_sf_coulomb_CL_array (double LMIN, int KMAX, double ETA, double CL[]) ! This function computes the Coulomb wave function normalization constant C_L(\eta) for L = Lmin \dots Lmin + kmax, Lmin > -1. *************** *** 2952,2959 **** =============== ! The Debye functions are defined by the integral D_n(x) = n/x^n \int_0^x ! dt (t^n/(e^t - 1)). For further information see Abramowitz & Stegun, ! Section 27.1. The Debye functions are declared in the header file ! `gsl_sf_debye.h'. - Function: double gsl_sf_debye_1 (double X) --- 3008,3017 ---- =============== ! The Debye functions D_n(x) are defined by the following integral, ! ! D_n(x) = n/x^n \int_0^x dt (t^n/(e^t - 1)) ! ! For further information see Abramowitz & Stegun, Section 27.1. The ! Debye functions are declared in the header file `gsl_sf_debye.h'. - Function: double gsl_sf_debye_1 (double X) *************** *** 3147,3150 **** --- 3205,3209 ---- D(\phi,k,n) which is defined through the Carlson form RD(x,y,z) by the following relation, + D(\phi,k,n) = RD (1-\sin^2(\phi), 1-k^2 \sin^2(\phi), 1). *************** *** 3224,3230 **** - Function: double gsl_sf_erf (double X) - Function: int gsl_sf_erf_e (double X, gsl_sf_result * RESULT) ! These routines compute the error function erf(x) = (2/\sqrt(\pi)) ! \int_0^x dt \exp(-t^2). !  --- 3283,3288 ---- - Function: double gsl_sf_erf (double X) - Function: int gsl_sf_erf_e (double X, gsl_sf_result * RESULT) ! These routines compute the error function erf(x), where erf(x) = ! (2/\sqrt(\pi)) \int_0^x dt \exp(-t^2).  *************** *** 3239,3243 **** 1 - erf(x) = (2/\sqrt(\pi)) \int_x^\infty \exp(-t^2). -  File: gsl-ref.info, Node: Log Complementary Error Function, Next: Probability functions, Prev: Complementary Error Function, Up: Error Functions --- 3297,3300 ---- *************** *** 3271,3278 **** The "hazard function" for the normal distribution, also known as the ! inverse Mill's ratio, is defined as h(x) = Z(x)/Q(x) = \sqrt2/\pi ! \exp(-x^2 / 2) / \erfc(x/\sqrt 2). It decreases rapidly as x ! approaches -\infty and asymptotes to h(x) \sim x as x approaches ! +\infty. - Function: double gsl_sf_hazard (double X) --- 3328,3337 ---- The "hazard function" for the normal distribution, also known as the ! inverse Mill's ratio, is defined as, ! ! h(x) = Z(x)/Q(x) = \sqrt{2/\pi} \exp(-x^2 / 2) / \erfc(x/\sqrt 2) ! ! It decreases rapidly as x approaches -\infty and asymptotes to h(x) ! \sim x as x approaches +\infty. - Function: double gsl_sf_hazard (double X) *************** *** 3416,3420 **** - Function: int gsl_sf_expint_E1_e (double X, gsl_sf_result * RESULT) These routines compute the exponential integral E_1(x), ! E_1(x) := Re \int_1^\infty dt \exp(-xt)/t. --- 3475,3480 ---- - Function: int gsl_sf_expint_E1_e (double X, gsl_sf_result * RESULT) These routines compute the exponential integral E_1(x), ! ! E_1(x) := \Re \int_1^\infty dt \exp(-xt)/t. *************** *** 3423,3426 **** --- 3483,3487 ---- These routines compute the second-order exponential integral E_2(x), + E_2(x) := \Re \int_1^\infty dt \exp(-xt)/t^2. *************** *** 3435,3438 **** --- 3496,3500 ---- - Function: int gsl_sf_expint_Ei_e (double X, gsl_sf_result * RESULT) These routines compute the exponential integral Ei(x), + Ei(x) := - PV(\int_{-x}^\infty dt \exp(-t)/t) *************** *** 3452,3456 **** - Function: double gsl_sf_Chi (double X) - Function: int gsl_sf_Chi_e (double X, gsl_sf_result * RESULT) ! These routines compute the integral Chi(x) := Re[ \gamma_E + \log(x) + \int_0^x dt (\cosh[t]-1)/t] , where \gamma_E is the Euler constant (available as the macro `M_EULER'). --- 3514,3518 ---- - Function: double gsl_sf_Chi (double X) - Function: int gsl_sf_Chi_e (double X, gsl_sf_result * RESULT) ! These routines compute the integral Chi(x) := \Re[ \gamma_E + \log(x) + \int_0^x dt (\cosh[t]-1)/t] , where \gamma_E is the Euler constant (available as the macro `M_EULER'). *************** *** 3464,3469 **** - Function: double gsl_sf_expint_3 (double X) - Function: int gsl_sf_expint_3_e (double X, gsl_sf_result * RESULT) ! These routines compute the exponential integral Ei_3(x) = \int_0^x ! dt \exp(-t^3) for x >= 0.  --- 3526,3531 ---- - Function: double gsl_sf_expint_3 (double X) - Function: int gsl_sf_expint_3_e (double X, gsl_sf_result * RESULT) ! These routines compute the third-order exponential integral ! Ei_3(x) = \int_0^xdt \exp(-t^3) for x >= 0.  *************** *** 3491,3499 **** - Function: double gsl_sf_atanint (double X) - Function: int gsl_sf_atanint_e (double X, gsl_sf_result * RESULT) ! These routines compute the Arctangent integral AtanInt(x) = ! \int_0^x dt \arctan(t)/t.  ! File: gsl-ref.info, Node: Fermi-Dirac Function, Next: Gamma Function, Prev: Exponential Integrals, Up: Special Functions Fermi-Dirac Function --- 3553,3561 ---- - Function: double gsl_sf_atanint (double X) - Function: int gsl_sf_atanint_e (double X, gsl_sf_result * RESULT) ! These routines compute the Arctangent integral, which is defined ! as AtanInt(x) = \int_0^x dt \arctan(t)/t.  ! File: gsl-ref.info, Node: Fermi-Dirac Function, Next: Gamma and Beta Functions, Prev: Exponential Integrals, Up: Special Functions Fermi-Dirac Function *************** *** 3585,3592 ****  ! File: gsl-ref.info, Node: Gamma Function, Next: Gegenbauer Functions, Prev: Fermi-Dirac Function, Up: Special Functions ! Gamma Function ! ============== The Gamma function is defined by the following integral, --- 3647,3654 ----  ! File: gsl-ref.info, Node: Gamma and Beta Functions, Next: Gegenbauer Functions, Prev: Fermi-Dirac Function, Up: Special Functions ! Gamma and Beta Functions ! ======================== The Gamma function is defined by the following integral, *************** *** 3594,3600 **** \Gamma(x) = \int_0^\infty dt t^{x-1} \exp(-t) ! Further information on the Gamma function can be found in Abramowitz & ! Stegun, Chapter 6. The functions described in this section are ! declared in the header file `gsl_sf_gamma.h'. - Function: double gsl_sf_gamma (double X) --- 3656,3663 ---- \Gamma(x) = \int_0^\infty dt t^{x-1} \exp(-t) ! It is related to the factorial function by \Gamma(n)=(n-1)! for ! positive integer n. Further information on the Gamma function can be ! found in Abramowitz & Stegun, Chapter 6. The functions described in ! this section are declared in the header file `gsl_sf_gamma.h'. - Function: double gsl_sf_gamma (double X) *************** *** 3617,3621 **** RESULT_LG, double * SGN) This routine computes the sign of the gamma function and the ! logarithm its magnitude, subject to x not being a negative integer. The function is computed using the real Lanczos method. The value of the gamma function can be reconstructed using the --- 3680,3684 ---- RESULT_LG, double * SGN) This routine computes the sign of the gamma function and the ! logarithm of its magnitude, subject to x not being a negative integer. The function is computed using the real Lanczos method. The value of the gamma function can be reconstructed using the *************** *** 3694,3698 **** These routines compute the Pochhammer symbol (a)_x := \Gamma(a + x)/\Gamma(a), subject to a and a+x not being negative integers. ! The Pochhammer symbol is also known as the Apell symbol. - Function: double gsl_sf_lnpoch (double A, double X) --- 3757,3762 ---- These routines compute the Pochhammer symbol (a)_x := \Gamma(a + x)/\Gamma(a), subject to a and a+x not being negative integers. ! The Pochhammer symbol is also known as the Apell symbol and ! sometimes written as (a,x). - Function: double gsl_sf_lnpoch (double A, double X) *************** *** 3706,3710 **** These routines compute the sign of the Pochhammer symbol and the logarithm of its magnitude. The computed parameters are result = ! \log(|(a)_x|) and sgn = sgn((a)_x) where (a)_x := \Gamma(a + x)/\Gamma(a), subject to a, a+x not being negative integers. --- 3770,3774 ---- These routines compute the sign of the Pochhammer symbol and the logarithm of its magnitude. The computed parameters are result = ! \log(|(a)_x|) and sgn = \sgn((a)_x) where (a)_x := \Gamma(a + x)/\Gamma(a), subject to a, a+x not being negative integers. *************** *** 3712,3717 **** - Function: int gsl_sf_pochrel_e (double A, double X, gsl_sf_result * RESULT) ! These routines compute the relative Pochhammer symbol ((a,x) - ! 1)/x where (a,x) = (a)_x := \Gamma(a + x)/\Gamma(a). - Function: double gsl_sf_gamma_inc_Q (double A, double X) --- 3776,3781 ---- - Function: int gsl_sf_pochrel_e (double A, double X, gsl_sf_result * RESULT) ! These routines compute the relative Pochhammer symbol ((a)_x - ! 1)/x where (a)_x := \Gamma(a + x)/\Gamma(a). - Function: double gsl_sf_gamma_inc_Q (double A, double X) *************** *** 3755,3763 **** - Function: int gsl_sf_beta_inc_e (double A, double B, double X, gsl_sf_result * RESULT) ! These routines compute the normalize incomplete Beta function ! B_x(a,b)/B(a,b) for a > 0, b > 0, and 0 <= x <= 1.  ! File: gsl-ref.info, Node: Gegenbauer Functions, Next: Hypergeometric Functions, Prev: Gamma Function, Up: Special Functions Gegenbauer Functions --- 3819,3828 ---- - Function: int gsl_sf_beta_inc_e (double A, double B, double X, gsl_sf_result * RESULT) ! These routines compute the normalized incomplete Beta function ! B_x(a,b)/B(a,b) where B_x(a,b) = \int_0^x t^{a-1} (1-t)^{b-1} dt ! for a > 0, b > 0, and 0 <= x <= 1.  ! File: gsl-ref.info, Node: Gegenbauer Functions, Next: Hypergeometric Functions, Prev: Gamma and Beta Functions, Up: Special Functions Gegenbauer Functions *************** *** 3979,3984 **** - Function: int gsl_sf_legendre_Pl_array (int LMAX, double X, double RESULT_ARRAY[]) ! This function computes an array of Legendre polynomials P_l(x) for ! l = 0, \dots, lmax, |x| <= 1 - Function: double gsl_sf_legendre_Q0 (double X) --- 4044,4052 ---- - Function: int gsl_sf_legendre_Pl_array (int LMAX, double X, double RESULT_ARRAY[]) ! - Function: int gsl_sf_legendre_Pl_deriv_array (int LMAX, double X, ! double RESULT_ARRAY[], double RESULT_DERIV_ARRAY[]) ! These functions compute an array of Legendre polynomials P_l(x), ! and optionally their derivatives dP_l(x)/dx, for l = 0, \dots, ! lmax, |x| <= 1 - Function: double gsl_sf_legendre_Q0 (double X) *************** *** 4023,4028 **** - Function: int gsl_sf_legendre_Plm_array (int LMAX, int M, double X, double RESULT_ARRAY[]) ! This function computes an array of Legendre polynomials P_l^m(x) ! for m >= 0, l = |m|, ..., lmax, |x| <= 1. - Function: double gsl_sf_legendre_sphPlm (int L, int M, double X) --- 4091,4099 ---- - Function: int gsl_sf_legendre_Plm_array (int LMAX, int M, double X, double RESULT_ARRAY[]) ! - Function: int gsl_sf_legendre_Plm_deriv_array (int LMAX, int M, ! double X, double RESULT_ARRAY[], double RESULT_DERIV_ARRAY[]) ! These functions compute an array of Legendre polynomials P_l^m(x), ! and optionally their derivatives dP_l^m(x)/dx, for m >= 0, l = ! |m|, ..., lmax, |x| <= 1. - Function: double gsl_sf_legendre_sphPlm (int L, int M, double X) *************** *** 4037,4043 **** - Function: int gsl_sf_legendre_sphPlm_array (int LMAX, int M, double X, double RESULT_ARRAY[]) ! This function computes an array of normalized associated Legendre ! functions $\sqrt{(2l+1)/(4\pi)} \sqrt{(l-m)!/(l+m)!} P_l^m(x)$ for ! m >= 0, l = |m|, ..., lmax, |x| <= 1.0 - Function: int gsl_sf_legendre_array_size (const int LMAX, const int --- 4108,4117 ---- - Function: int gsl_sf_legendre_sphPlm_array (int LMAX, int M, double X, double RESULT_ARRAY[]) ! - Function: int gsl_sf_legendre_sphPlm_deriv_array (int LMAX, int M, ! double X, double RESULT_ARRAY[], double RESULT_DERIV_ARRAY[]) ! These functions compute an array of normalized associated Legendre ! functions $\sqrt{(2l+1)/(4\pi)} \sqrt{(l-m)!/(l+m)!} P_l^m(x)$, ! and optionally their derivatives, for m >= 0, l = |m|, ..., lmax, ! |x| <= 1.0 - Function: int gsl_sf_legendre_array_size (const int LMAX, const int *************** *** 4052,4056 **** ----------------- ! The Conical Functions P^\mu_{-(1/2)+i\lambda}(x), Q^\mu_{-(1/2)+i\lambda} are described in Abramowitz & Stegun, Section 8.12. --- 4126,4130 ---- ----------------- ! The Conical Functions P^\mu_{-(1/2)+i\lambda}(x) and Q^\mu_{-(1/2)+i\lambda} are described in Abramowitz & Stegun, Section 8.12. *************** *** 4128,4132 **** - Function: int gsl_sf_legendre_H3d_e (int L, double LAMBDA, double ETA, gsl_sf_result * RESULT) ! These routines compute the L'th radial eigenfunction of the Laplacian on the 3-dimensional hyperbolic space \eta >= 0, l >= 0. In the flat limit this takes the form L^{H3d}_l(\lambda,\eta) = --- 4202,4206 ---- - Function: int gsl_sf_legendre_H3d_e (int L, double LAMBDA, double ETA, gsl_sf_result * RESULT) ! These routines compute the L-th radial eigenfunction of the Laplacian on the 3-dimensional hyperbolic space \eta >= 0, l >= 0. In the flat limit this takes the form L^{H3d}_l(\lambda,\eta) = *************** *** 4203,4210 **** ====================== ! The polygamma functions of order m defined by \psi^{(m)}(x) = (d/dx)^m ! \psi(x) = (d/dx)^{m+1} \log(\Gamma(x)), where \psi(x) = ! \Gamma'(x)/\Gamma(x) is known as the digamma function. These functions ! are declared in the header file `gsl_sf_psi.h'. * Menu: --- 4277,4286 ---- ====================== ! The polygamma functions of order m are defined by ! ! \psi^{(m)}(x) = (d/dx)^m \psi(x) = (d/dx)^{m+1} \log(\Gamma(x)) ! ! where \psi(x) = \Gamma'(x)/\Gamma(x) is known as the digamma function. ! These functions are declared in the header file `gsl_sf_psi.h'. * Menu: *************** *** 4233,4237 **** - Function: int gsl_sf_psi_1piy_e (double Y, gsl_sf_result * RESULT) These routines compute the real part of the digamma function on ! the line 1+i y, Re[\psi(1 + i y)].  --- 4309,4313 ---- - Function: int gsl_sf_psi_1piy_e (double Y, gsl_sf_result * RESULT) These routines compute the real part of the digamma function on ! the line 1+i y, \Re[\psi(1 + i y)].  *************** *** 4559,4562 **** --- 4635,4639 ---- Here are the results of running the program, + $ ./a.out *************** *** 4587,4590 **** --- 4664,4668 ---- The results of the function are the same, + $ ./a.out *************** *** 4841,4845 **** the block will be deallocated when the vector is freed. If the vector points to a block owned by another object then the OWNER field is zero ! and any underlying block will not be deallocated. The functions for allocating and accessing vectors are defined in --- 4919,4923 ---- the block will be deallocated when the vector is freed. If the vector points to a block owned by another object then the OWNER field is zero ! and any underlying block will not be deallocated with the vector. The functions for allocating and accessing vectors are defined in *************** *** 4900,4920 **** Unlike FORTRAN compilers, C compilers do not usually provide support for range checking of vectors and matrices. Range checking is ! available in the GNU C Compiler extension `checkergcc' but it is not ! available on every platform. The functions `gsl_vector_get' and ! `gsl_vector_set' can perform portable range checking for you and report ! an error if you attempt to access elements outside the allowed range. The functions for accessing the elements of a vector or matrix are defined in `gsl_vector.h' and declared `extern inline' to eliminate function-call overhead. You must compile your program with the macro ! `HAVE_INLINE' defined to use these functions. If necessary you can ! turn off range checking completely without modifying any source files ! by recompiling your program with the preprocessor definition ! `GSL_RANGE_CHECK_OFF'. Provided your compiler supports inline ! functions the effect of turning off range checking is to replace calls ! to `gsl_vector_get(v,i)' by `v->data[i*v->stride]' and calls to ! `gsl_vector_set(v,i,x)' by `v->data[i*v->stride]=x'. Thus there should ! be no performance penalty for using the range checking functions when ! range checking is turned off. - Function: double gsl_vector_get (const gsl_vector * V, size_t I) --- 4978,5000 ---- Unlike FORTRAN compilers, C compilers do not usually provide support for range checking of vectors and matrices. Range checking is ! available in the GNU C Compiler bounds-checking extension, but it is not ! part of the default installation of GCC. The functions ! `gsl_vector_get' and `gsl_vector_set' can perform portable range ! checking for you and report an error if you attempt to access elements ! outside the allowed range. The functions for accessing the elements of a vector or matrix are defined in `gsl_vector.h' and declared `extern inline' to eliminate function-call overhead. You must compile your program with the macro ! `HAVE_INLINE' defined to use these functions. ! ! If necessary you can turn off range checking completely without ! modifying any source files by recompiling your program with the ! preprocessor definition `GSL_RANGE_CHECK_OFF'. Provided your compiler ! supports inline functions the effect of turning off range checking is ! to replace calls to `gsl_vector_get(v,i)' by `v->data[i*v->stride]' and ! calls to `gsl_vector_set(v,i,x)' by `v->data[i*v->stride]=x'. Thus ! there should be no performance penalty for using the range checking ! functions when range checking is turned off. - Function: double gsl_vector_get (const gsl_vector * V, size_t I) *************** *** 5014,5023 **** taking the address of this component with the `&' operator. ! When using this pointer, it is important to ensure that the view itself remains in scope--the simplest way to do so is by always writing ! the pointer as `&'VIEW`.vector', and not storing this value in another ! pointer variable. ! - Function: gsl_vector_view gsl_vector_subvector (gsl_vector *V, size_t OFFSET, size_t N) - Function: gsl_vector_const_view gsl_vector_const_subvector (const --- 5094,5103 ---- taking the address of this component with the `&' operator. ! When using this pointer it is important to ensure that the view itself remains in scope--the simplest way to do so is by always writing ! the pointer as `&'VIEW`.vector', and never storing this value in ! another variable. ! - Function: gsl_vector_view gsl_vector_subvector (gsl_vector * V, size_t OFFSET, size_t N) - Function: gsl_vector_const_view gsl_vector_const_subvector (const *************** *** 5050,5054 **** - Function: gsl_vector_view gsl_vector_subvector_with_stride ! (gsl_vector *V, size_t OFFSET, size_t STRIDE, size_t N) - Function: gsl_vector_const_view gsl_vector_const_subvector_with_stride (const gsl_vector * V, size_t --- 5130,5134 ---- - Function: gsl_vector_view gsl_vector_subvector_with_stride ! (gsl_vector * V, size_t OFFSET, size_t STRIDE, size_t N) - Function: gsl_vector_const_view gsl_vector_const_subvector_with_stride (const gsl_vector * V, size_t *************** *** 5077,5081 **** argument just as a directly allocated vector would be, using `&'VIEW`.vector'. For example, the following code computes the ! norm of odd elements of `v' using the BLAS routine DNRM2, gsl_vector_view v_odd --- 5157,5161 ---- argument just as a directly allocated vector would be, using `&'VIEW`.vector'. For example, the following code computes the ! norm of the odd elements of `v' using the BLAS routine DNRM2, gsl_vector_view v_odd *************** *** 5088,5094 **** - Function: gsl_vector_view gsl_vector_complex_real ! (gsl_vector_complex *V) - Function: gsl_vector_const_view gsl_vector_complex_const_real (const ! gsl_vector_complex *V) These functions return a vector view of the real parts of the complex vector V. --- 5168,5174 ---- - Function: gsl_vector_view gsl_vector_complex_real ! (gsl_vector_complex * V) - Function: gsl_vector_const_view gsl_vector_complex_const_real (const ! gsl_vector_complex * V) These functions return a vector view of the real parts of the complex vector V. *************** *** 5099,5105 **** - Function: gsl_vector_view gsl_vector_complex_imag ! (gsl_vector_complex *V) - Function: gsl_vector_const_view gsl_vector_complex_const_imag (const ! gsl_vector_complex *V) These functions return a vector view of the imaginary parts of the complex vector V. --- 5179,5185 ---- - Function: gsl_vector_view gsl_vector_complex_imag ! (gsl_vector_complex * V) - Function: gsl_vector_const_view gsl_vector_complex_const_imag (const ! gsl_vector_complex * V) These functions return a vector view of the imaginary parts of the complex vector V. *************** *** 5109,5116 **** declared `const'. ! - Function: gsl_vector_view gsl_vector_view_array (double *BASE, size_t N) - Function: gsl_vector_const_view gsl_vector_const_view_array (const ! double *BASE, size_t N) These functions return a vector view of an array. The start of the new vector is given by BASE and has N elements. --- 5189,5196 ---- declared `const'. ! - Function: gsl_vector_view gsl_vector_view_array (double * BASE, size_t N) - Function: gsl_vector_const_view gsl_vector_const_view_array (const ! double * BASE, size_t N) These functions return a vector view of an array. The start of the new vector is given by BASE and has N elements. *************** *** 5312,5320 **** range-checking code in `gsl_vector_get'. v_0 = 1.23 v_1 = 2.23 v_2 = 3.23 gsl: vector_source.c:12: ERROR: index out of range ! IOT trap/Abort (core dumped) The next program shows how to write a vector to a file. --- 5392,5402 ---- range-checking code in `gsl_vector_get'. + $ ./a.out v_0 = 1.23 v_1 = 2.23 v_2 = 3.23 gsl: vector_source.c:12: ERROR: index out of range ! Default GSL error handler invoked. ! Aborted (core dumped) The next program shows how to write a vector to a file. *************** *** 5604,5608 **** is given by, ! m'(i,j) = m->data[(k1*m->tda + k1) + i*m->tda + j] where the index I runs from 0 to `n1-1' and the index J runs from --- 5686,5690 ---- is given by, ! m'(i,j) = m->data[(k1*m->tda + k2) + i*m->tda + j] where the index I runs from 0 to `n1-1' and the index J runs from *************** *** 5758,5762 **** J is out of range. ! The function `gsl_vector_const_column' equivalent to `gsl_matrix_column' but can be used for matrices which are declared `const'. --- 5840,5844 ---- J is out of range. ! The function `gsl_vector_const_column' is equivalent to `gsl_matrix_column' but can be used for matrices which are declared `const'. *************** *** 6000,6004 **** gsl_matrix_set (m, i, j, 0.23 + 100*i + j); ! for (i = 0; i < 10; i++) for (j = 0; j < 3; j++) printf ("m(%d,%d) = %g\n", i, j, --- 6082,6086 ---- gsl_matrix_set (m, i, j, 0.23 + 100*i + j); ! for (i = 0; i < 100; i++) for (j = 0; j < 3; j++) printf ("m(%d,%d) = %g\n", i, j, *************** *** 6012,6015 **** --- 6094,6098 ---- range-checking code in `gsl_matrix_get'. + $ ./a.out m(0,0) = 0.23 m(0,1) = 1.23 *************** *** 6021,6025 **** m(9,2) = 902.23 gsl: matrix_source.c:13: ERROR: first index out of range ! IOT trap/Abort (core dumped) The next program shows how to write a matrix to a file. --- 6104,6109 ---- m(9,2) = 902.23 gsl: matrix_source.c:13: ERROR: first index out of range ! Default GSL error handler invoked. ! Aborted (core dumped) The next program shows how to write a matrix to a file. *************** *** 6069,6073 **** The following program demonstrates the use of vector views. The ! program computes the column-norms of a matrix. #include --- 6153,6157 ---- The following program demonstrates the use of vector views. The ! program computes the column norms of a matrix. #include *************** *** 6102,6107 **** } ! Here is the output of the program, which can be confirmed using GNU ! OCTAVE, $ ./a.out --- 6186,6190 ---- } ! Here is the output of the program, $ ./a.out *************** *** 6118,6126 **** matrix column 9, norm = 3.07313 octave> m = sin(0:9)' * ones(1,10) + ones(10,1) * cos(0:9); octave> sqrt(sum(m.^2)) ans = - 4.3146 3.1205 2.1932 3.2611 2.5342 2.5728 4.2047 3.6520 2.0852 3.0731 --- 6201,6212 ---- matrix column 9, norm = 3.07313 + The results can be confirmed using GNU OCTAVE, + + $ octave + GNU Octave, version 2.0.16.92 octave> m = sin(0:9)' * ones(1,10) + ones(10,1) * cos(0:9); octave> sqrt(sum(m.^2)) ans = 4.3146 3.1205 2.1932 3.2611 2.5342 2.5728 4.2047 3.6520 2.0852 3.0731 *************** *** 6147,6151 **** This chapter describes functions for creating and manipulating permutations. A permutation p is represented by an array of n integers ! in the range 0 .. n-1, where each value p_i occurs once and only once. The application of a permutation p to a vector v yields a new vector v' where v'_i = v_{p_i}. For example, the array (0,1,3,2) represents a --- 6233,6237 ---- This chapter describes functions for creating and manipulating permutations. A permutation p is represented by an array of n integers ! in the range 0 to n-1, where each value p_i occurs once and only once. The application of a permutation p to a vector v yields a new vector v' where v'_i = v_{p_i}. For example, the array (0,1,3,2) represents a *************** *** 6170,6174 **** * Applying Permutations:: * Reading and writing permutations:: ! * Permutations in Cyclic Form:: * Permutation Examples:: * Permutation References and Further Reading:: --- 6256,6260 ---- * Applying Permutations:: * Reading and writing permutations:: ! * Permutations in cyclic form:: * Permutation Examples:: * Permutation References and Further Reading:: *************** *** 6180,6184 **** ====================== ! A permutation is stored by a structure containing two components, the size of the permutation and a pointer to the permutation array. The elements of the permutation array are all of type `size_t'. The --- 6266,6270 ---- ====================== ! A permutation is defined by a structure containing two components, the size of the permutation and a pointer to the permutation array. The elements of the permutation array are all of type `size_t'. The *************** *** 6257,6261 **** - Function: int gsl_permutation_valid (gsl_permutation * P) This function checks that the permutation P is valid. The N ! elements should contain each of the numbers 0 .. N-1 once and only once. --- 6343,6347 ---- - Function: int gsl_permutation_valid (gsl_permutation * P) This function checks that the permutation P is valid. The N ! elements should contain each of the numbers 0 to N-1 once and only once. *************** *** 6330,6334 ****  ! File: gsl-ref.info, Node: Reading and writing permutations, Next: Permutations in Cyclic Form, Prev: Applying Permutations, Up: Permutations Reading and writing permutations --- 6416,6420 ----  ! File: gsl-ref.info, Node: Reading and writing permutations, Next: Permutations in cyclic form, Prev: Applying Permutations, Up: Permutations Reading and writing permutations *************** *** 6357,6361 **** - Function: int gsl_permutation_fprintf (FILE * STREAM, const ! gsl_permutation * P, const char *FORMAT) This function writes the elements of the permutation P line-by-line to the stream STREAM using the format specifier --- 6443,6447 ---- - Function: int gsl_permutation_fprintf (FILE * STREAM, const ! gsl_permutation * P, const char * FORMAT) This function writes the elements of the permutation P line-by-line to the stream STREAM using the format specifier *************** *** 6374,6402 ****  ! File: gsl-ref.info, Node: Permutations in Cyclic Form, Next: Permutation Examples, Prev: Reading and writing permutations, Up: Permutations ! Permutations in Cyclic Form =========================== ! A permutation can be represented in both linear and cyclic notations. ! The functions described in this section can be used to convert between ! the two forms. ! ! The linear notation is an index mapping, and has already been ! described above. The cyclic notation represents a permutation as a series of circular rearrangements of groups of elements, or "cycles". ! Any permutation can be decomposed into a combination of cycles. For ! example, under the cycle (1 2 3), 1 is replaced by 2, 2 is replaced by 3 ! and 3 is replaced by 1 in a circular fashion. Cycles of different sets ! of elements can be combined independently, for example (1 2 3) (4 5) ! combines the cycle (1 2 3) with the cycle (4 5), which is an exchange of ! elements 4 and 5. A cycle of length one represents an element which is ! unchanged by the permutation and is referred to as a "singleton". ! ! The cyclic notation for a permutation is not unique, but can be ! rearranged into a unique "canonical form" by a reordering of elements. ! The library uses the canonical form defined in Knuth's `Art of Computer ! Programming' (Vol 1, 3rd Ed, 1997) Section 1.3.3, p.178. The procedure for obtaining the canonical form given by Knuth is, --- 6460,6487 ----  ! File: gsl-ref.info, Node: Permutations in cyclic form, Next: Permutation Examples, Prev: Reading and writing permutations, Up: Permutations ! Permutations in cyclic form =========================== ! A permutation can be represented in both "linear" and "cyclic" ! notations. The functions described in this section convert between the ! two forms. The linear notation is an index mapping, and has already ! been described above. The cyclic notation expresses a permutation as a series of circular rearrangements of groups of elements, or "cycles". ! For example, under the cycle (1 2 3), 1 is replaced by 2, 2 is ! replaced by 3 and 3 is replaced by 1 in a circular fashion. Cycles of ! different sets of elements can be combined independently, for example ! (1 2 3) (4 5) combines the cycle (1 2 3) with the cycle (4 5), which is ! an exchange of elements 4 and 5. A cycle of length one represents an ! element which is unchanged by the permutation and is referred to as a ! "singleton". ! ! It can be shown that every permutation can be decomposed into ! combinations of cycles. The decomposition is not unique, but can always ! be rearranged into a standard "canonical form" by a reordering of ! elements. The library uses the canonical form defined in Knuth's `Art ! of Computer Programming' (Vol 1, 3rd Ed, 1997) Section 1.3.3, p.178. The procedure for obtaining the canonical form given by Knuth is, *************** *** 6417,6423 **** addition, by removing the brackets it can be considered as a linear representation of a different permutation. In the example given above ! the permutation (2 4 3 0 1) would become (1 4 0 2 3). This mapping ! between linear permutations defined by the canonical form has many ! important uses in the theory of permutations. - Function: int gsl_permutation_linear_to_canonical (gsl_permutation * --- 6502,6507 ---- addition, by removing the brackets it can be considered as a linear representation of a different permutation. In the example given above ! the permutation (2 4 3 0 1) would become (1 4 0 2 3). This mapping has ! many applications in the theory of permutations. - Function: int gsl_permutation_linear_to_canonical (gsl_permutation * *************** *** 6433,6455 **** - Function: size_t gsl_permutation_inversions (const gsl_permutation * P) ! This function counts the number of inversions in the permutation P. - Function: size_t gsl_permutation_linear_cycles (const gsl_permutation * P) ! This function counts the number of cycles in the permutation P. - Function: size_t gsl_permutation_canonical_cycles (const gsl_permutation * Q) This function counts the number of cycles in the permutation Q, ! where Q is given in canonical form.  ! File: gsl-ref.info, Node: Permutation Examples, Next: Permutation References and Further Reading, Prev: Permutations in Cyclic Form, Up: Permutations Examples ======== ! The example program below creates a random permutation by shuffling and ! finds its inverse. #include --- 6517,6544 ---- - Function: size_t gsl_permutation_inversions (const gsl_permutation * P) ! This function counts the number of inversions in the permutation ! P. An inversion is any pair of elements that are not in order. ! For example, the permutation 2031 has three inversions, ! corresponding to the pairs (2,0) (2,1) and (3,1). The identity ! permutation has no inversions. - Function: size_t gsl_permutation_linear_cycles (const gsl_permutation * P) ! This function counts the number of cycles in the permutation P, ! given in linear form. - Function: size_t gsl_permutation_canonical_cycles (const gsl_permutation * Q) This function counts the number of cycles in the permutation Q, ! given in canonical form.  ! File: gsl-ref.info, Node: Permutation Examples, Next: Permutation References and Further Reading, Prev: Permutations in cyclic form, Up: Permutations Examples ======== ! The example program below creates a random permutation (by shuffling the ! elements of the identity) and finds its inverse. #include *************** *** 6492,6496 **** Here is the output from the program, ! bash$ ./a.out initial permutation: 0 1 2 3 4 5 6 7 8 9 random permutation: 1 3 5 2 7 6 0 4 9 8 --- 6581,6585 ---- Here is the output from the program, ! $ ./a.out initial permutation: 0 1 2 3 4 5 6 7 8 9 random permutation: 1 3 5 2 7 6 0 4 9 8 *************** *** 6501,6505 **** output. ! The next example program steps forwards through all possible 3-rd order permutations, starting from the identity, --- 6590,6594 ---- output. ! The next example program steps forwards through all possible third order permutations, starting from the identity, *************** *** 6526,6530 **** Here is the output from the program, ! bash$ ./a.out 0 1 2 0 2 1 --- 6615,6619 ---- Here is the output from the program, ! $ ./a.out 0 1 2 0 2 1 *************** *** 6534,6538 **** 2 1 0 ! All 6 permutations are generated in lexicographic order. To reverse the sequence, begin with the final permutation (which is the reverse of the identity) and replace `gsl_permutation_next' with --- 6623,6627 ---- 2 1 0 ! The permutations are generated in lexicographic order. To reverse the sequence, begin with the final permutation (which is the reverse of the identity) and replace `gsl_permutation_next' with *************** *** 6565,6572 **** This chapter describes functions for creating and manipulating combinations. A combination c is represented by an array of k integers ! in the range 0 .. n-1, where each value c_i is from the range 0 .. n-1 ! and occurs at most once. The combination c corresponds to indices of k ! elements chosen from an n element vector. Combinations are useful for ! iterating over all k-element subsets of a set. The functions described in this chapter are defined in the header --- 6654,6661 ---- This chapter describes functions for creating and manipulating combinations. A combination c is represented by an array of k integers ! in the range 0 to n-1, where each value c_i occurs at most once. The ! combination c corresponds to indices of k elements chosen from an n ! element vector. Combinations are useful for iterating over all ! k-element subsets of a set. The functions described in this chapter are defined in the header *************** *** 6590,6594 **** ====================== ! A combination is stored by a structure containing three components, the values of n and k, and a pointer to the combination array. The elements of the combination array are all of type `size_t', and are --- 6679,6683 ---- ====================== ! A combination is defined by a structure containing three components, the values of n and k, and a pointer to the combination array. The elements of the combination array are all of type `size_t', and are *************** *** 6639,6643 **** gsl_combination * SRC) This function copies the elements of the combination SRC into the ! combination DEST. The two combinations must have the same sizes.  --- 6728,6732 ---- gsl_combination * SRC) This function copies the elements of the combination SRC into the ! combination DEST. The two combinations must have the same size.  *************** *** 6647,6651 **** ============================== ! The following function can be used to access combinations elements. - Function: size_t gsl_combination_get (const gsl_combination * C, --- 6736,6741 ---- ============================== ! The following function can be used to access the elements of a ! combination. - Function: size_t gsl_combination_get (const gsl_combination * C, *************** *** 6662,6669 **** - Function: size_t gsl_combination_n (const gsl_combination * C) ! This function returns the n parameter of the combination C. - Function: size_t gsl_combination_k (const gsl_combination * C) ! This function returns the k parameter of the combination C. - Function: size_t * gsl_combination_data (const gsl_combination * C) --- 6752,6760 ---- - Function: size_t gsl_combination_n (const gsl_combination * C) ! This function returns the range (n) of the combination C. - Function: size_t gsl_combination_k (const gsl_combination * C) ! This function returns the number of elements (k) in the ! combination C. - Function: size_t * gsl_combination_data (const gsl_combination * C) *************** *** 6673,6678 **** - Function: int gsl_combination_valid (gsl_combination * C) This function checks that the combination C is valid. The K ! elements should contain numbers from range 0 .. N-1, each number ! at most once. The numbers have to be in increasing order.  --- 6764,6769 ---- - Function: int gsl_combination_valid (gsl_combination * C) This function checks that the combination C is valid. The K ! elements should lie in the range 0 to N-1, with each value ! occurring once at most and in increasing order.  *************** *** 6715,6728 **** - Function: int gsl_combination_fread (FILE * STREAM, gsl_combination * C) ! This function reads into the combination C from the open stream ! STREAM in binary format. The combination C must be preallocated ! with correct values of n and k since the function uses the size of ! C to determine how many bytes to read. The function returns ! `GSL_EFAILED' if there was a problem reading from the file. The ! data is assumed to have been written in the native binary format ! on the same architecture. - Function: int gsl_combination_fprintf (FILE * STREAM, const ! gsl_combination * C, const char *FORMAT) This function writes the elements of the combination C line-by-line to the stream STREAM using the format specifier --- 6806,6819 ---- - Function: int gsl_combination_fread (FILE * STREAM, gsl_combination * C) ! This function reads elements from the open stream STREAM into the ! combination C in binary format. The combination C must be ! preallocated with correct values of n and k since the function ! uses the size of C to determine how many bytes to read. The ! function returns `GSL_EFAILED' if there was a problem reading from ! the file. The data is assumed to have been written in the native ! binary format on the same architecture. - Function: int gsl_combination_fprintf (FILE * STREAM, const ! gsl_combination * C, const char * FORMAT) This function writes the elements of the combination C line-by-line to the stream STREAM using the format specifier *************** *** 6778,6782 **** Here is the output from the program, ! bash$ ./a.out All subsets of {0,1,2,3} by size: --- 6869,6873 ---- Here is the output from the program, ! $ ./a.out All subsets of {0,1,2,3} by size: *************** *** 6813,6820 **** 084933988X - Donald E. Knuth, `The Art of Computer Programming: Combinatorial - Algorithms' (Vol 4, pre-fascicle 2c) - -  File: gsl-ref.info, Node: Sorting, Next: BLAS Support, Prev: Combinations, Up: Top --- 6904,6907 ---- *************** *** 6826,6836 **** indirectly (using an index). All the functions use the "heapsort" algorithm. Heapsort is an O(N \log N) algorithm which operates ! in-place. It does not require any additional storage and provides ! consistent performance. The running time for its worst-case (ordered ! data) is not significantly longer than the average and best cases. ! Note that the heapsort algorithm does not preserve the relative ! ordering of equal elements -- it is an "unstable" sort. However the ! resulting order of equal elements will be consistent across different ! platforms when using these functions. * Menu: --- 6913,6923 ---- indirectly (using an index). All the functions use the "heapsort" algorithm. Heapsort is an O(N \log N) algorithm which operates ! in-place and does not require any additional storage. It also provides ! consistent performance, the running time for its worst-case (ordered ! data) being not significantly longer than the average and best cases. ! Note that the heapsort algorithm does not preserve the relative ordering ! of equal elements--it is an "unstable" sort. However the resulting ! order of equal elements will be consistent across different platforms ! when using these functions. * Menu: *************** *** 6947,6951 **** This function indirectly sorts the N elements of the array DATA with stride STRIDE into ascending order, storing the resulting ! permutation in P. The array P must be allocated to a sufficient length to store the N elements of the permutation. The elements of P give the index of the array element which would have been --- 7034,7038 ---- This function indirectly sorts the N elements of the array DATA with stride STRIDE into ascending order, storing the resulting ! permutation in P. The array P must be allocated with a sufficient length to store the N elements of the permutation. The elements of P give the index of the array element which would have been *************** *** 6982,6995 **** double * SRC, size_t STRIDE, size_t N) This function copies the K smallest elements of the array SRC, of ! size N and stride STRIDE, in ascending numerical order in DEST. ! The size K of the subset must be less than or equal to N. The ! data SRC is not modified by this operation. - Function: void gsl_sort_largest (double * DEST, size_t K, const double * SRC, size_t STRIDE, size_t N) This function copies the K largest elements of the array SRC, of ! size N and stride STRIDE, in descending numerical order in DEST. K ! must be less than or equal to N. The data SRC is not modified by ! this operation. - Function: void gsl_sort_vector_smallest (double * DEST, size_t K, --- 7069,7082 ---- double * SRC, size_t STRIDE, size_t N) This function copies the K smallest elements of the array SRC, of ! size N and stride STRIDE, in ascending numerical order into the ! array DEST. The size K of the subset must be less than or equal ! to N. The data SRC is not modified by this operation. - Function: void gsl_sort_largest (double * DEST, size_t K, const double * SRC, size_t STRIDE, size_t N) This function copies the K largest elements of the array SRC, of ! size N and stride STRIDE, in descending numerical order into the ! array DEST. K must be less than or equal to N. The data SRC is not ! modified by this operation. - Function: void gsl_sort_vector_smallest (double * DEST, size_t K, *************** *** 7220,7224 **** matrix-matrix solve, inv(A) B ! The type of matrices are, GE --- 7307,7311 ---- matrix-matrix solve, inv(A) B ! The types of matrices are, GE *************** *** 7338,7341 **** --- 7425,7429 ---- - Function: double gsl_blas_dznrm2 (const gsl_vector_complex * X) These functions compute the Euclidean norm of the complex vector X, + ||x||_2 = \sqrt {\sum (\Re(x_i)^2 + \Im(x_i)^2)}. *************** *** 7360,7364 **** These functions return the index of the largest element of the vector X. The largest element is determined by its absolute ! magnitude for real vector and by the sum of the magnitudes of the real and imaginary parts |\Re(x_i)| + |\Im(x_i)| for complex vectors. If the largest value occurs several times then the index --- 7448,7452 ---- These functions return the index of the largest element of the vector X. The largest element is determined by its absolute ! magnitude for real vectors and by the sum of the magnitudes of the real and imaginary parts |\Re(x_i)| + |\Im(x_i)| for complex vectors. If the largest value occurs several times then the index *************** *** 7430,7435 **** - Function: int gsl_blas_drotmg (double D1[], double D2[], double B1[], double B2, double P[]) ! These functions compute a modified Given's transformation. The ! modified Given's transformation is defined in the original Level-1 BLAS specification, given in the references. --- 7518,7523 ---- - Function: int gsl_blas_drotmg (double D1[], double D2[], double B1[], double B2, double P[]) ! These functions compute a modified Givens transformation. The ! modified Givens transformation is defined in the original Level-1 BLAS specification, given in the references. *************** *** 7438,7441 **** - Function: int gsl_blas_drotm (gsl_vector * X, gsl_vector * Y, const double P[]) ! These functions apply a modified Given's transformation. --- 7526,7529 ---- - Function: int gsl_blas_drotm (gsl_vector * X, gsl_vector * Y, const double P[]) ! These functions apply a modified Givens transformation. diff -rc2P gsl-1.6/doc/gsl-ref.info-2 gsl-1.7/doc/gsl-ref.info-2 *** gsl-1.6/doc/gsl-ref.info-2 Fri Dec 31 15:30:03 2004 --- gsl-1.7/doc/gsl-ref.info-2 Tue Sep 13 10:18:36 2005 *************** *** 63,67 **** - Function: int gsl_blas_ztrsv (CBLAS_UPLO_t UPLO, CBLAS_TRANSPOSE_t TRANSA, CBLAS_DIAG_t DIAG, const gsl_matrix_complex * A, ! gsl_vector_complex *X) These functions compute inv(op(A)) x for X, where op(A) = A, A^T, A^H for TRANSA = `CblasNoTrans', `CblasTrans', `CblasConjTrans'. --- 63,67 ---- - Function: int gsl_blas_ztrsv (CBLAS_UPLO_t UPLO, CBLAS_TRANSPOSE_t TRANSA, CBLAS_DIAG_t DIAG, const gsl_matrix_complex * A, ! gsl_vector_complex * X) These functions compute inv(op(A)) x for X, where op(A) = A, A^T, A^H for TRANSA = `CblasNoTrans', `CblasTrans', `CblasConjTrans'. *************** *** 275,282 **** gsl_complex ALPHA, const gsl_matrix_complex * A, gsl_matrix_complex * B) ! These functions compute the matrix-matrix product B = \alpha ! op(inv(A)) B for SIDE is `CblasLeft' and B = \alpha B op(inv(A)) ! for SIDE is `CblasRight'. The matrix A is triangular and op(A) = ! A, A^T, A^H for TRANSA = `CblasNoTrans', `CblasTrans', `CblasConjTrans' When UPLO is `CblasUpper' then the upper triangle of A is used, and when UPLO is `CblasLower' then the lower triangle --- 275,282 ---- gsl_complex ALPHA, const gsl_matrix_complex * A, gsl_matrix_complex * B) ! These functions compute the inverse-matrix matrix product B = ! \alpha op(inv(A))B for SIDE is `CblasLeft' and B = \alpha B ! op(inv(A)) for SIDE is `CblasRight'. The matrix A is triangular ! and op(A) = A, A^T, A^H for TRANSA = `CblasNoTrans', `CblasTrans', `CblasConjTrans' When UPLO is `CblasUpper' then the upper triangle of A is used, and when UPLO is `CblasLower' then the lower triangle *************** *** 335,339 **** TRANS, const gsl_complex ALPHA, const gsl_matrix_complex * A, const gsl_matrix_complex * B, const gsl_complex BETA, ! gsl_matrix_complex *C) These functions compute a rank-2k update of the symmetric matrix C, C = \alpha A B^T + \alpha B A^T + \beta C when TRANS is --- 335,339 ---- TRANS, const gsl_complex ALPHA, const gsl_matrix_complex * A, const gsl_matrix_complex * B, const gsl_complex BETA, ! gsl_matrix_complex * C) These functions compute a rank-2k update of the symmetric matrix C, C = \alpha A B^T + \alpha B A^T + \beta C when TRANS is *************** *** 412,415 **** --- 412,416 ---- Here is the output from the program, + $ ./a.out *************** *** 427,431 **** BLAS Technical Forum web-site. ! `BLAS Homepage' `http://www.netlib.org/blas/' `BLAS Technical Forum' --- 428,433 ---- BLAS Technical Forum web-site. ! `BLAS Homepage' ! `http://www.netlib.org/blas/' `BLAS Technical Forum' *************** *** 465,470 **** Anyone interested in large systems will want to use the sophisticated routines found in LAPACK. The Fortran version of LAPACK is recommended ! as the standard package for linear algebra. It supports blocked ! algorithms, specialized data representations and other optimizations. The functions described in this chapter are declared in the header --- 467,473 ---- Anyone interested in large systems will want to use the sophisticated routines found in LAPACK. The Fortran version of LAPACK is recommended ! as the standard package for large-scale linear algebra. It supports ! blocked algorithms, specialized data representations and other ! optimizations. The functions described in this chapter are declared in the header *************** *** 506,512 **** - Function: int gsl_linalg_LU_decomp (gsl_matrix * A, gsl_permutation ! * P, int *SIGNUM) - Function: int gsl_linalg_complex_LU_decomp (gsl_matrix_complex * A, ! gsl_permutation * P, int *SIGNUM) These functions factorize the square matrix A into the LU decomposition PA = LU. On output the diagonal and upper --- 509,515 ---- - Function: int gsl_linalg_LU_decomp (gsl_matrix * A, gsl_permutation ! * P, int * SIGNUM) - Function: int gsl_linalg_complex_LU_decomp (gsl_matrix_complex * A, ! gsl_permutation * P, int * SIGNUM) These functions factorize the square matrix A into the LU decomposition PA = LU. On output the diagonal and upper *************** *** 531,535 **** * LU, const gsl_permutation * P, const gsl_vector_complex * B, gsl_vector_complex * X) ! These functions solve the system A x = b using the LU decomposition of A into (LU, P) given by `gsl_linalg_LU_decomp' or `gsl_linalg_complex_LU_decomp'. --- 534,538 ---- * LU, const gsl_permutation * P, const gsl_vector_complex * B, gsl_vector_complex * X) ! These functions solve the square system A x = b using the LU decomposition of A into (LU, P) given by `gsl_linalg_LU_decomp' or `gsl_linalg_complex_LU_decomp'. *************** *** 539,544 **** - Function: int gsl_linalg_complex_LU_svx (const gsl_matrix_complex * LU, const gsl_permutation * P, gsl_vector_complex * X) ! These functions solve the system A x = b in-place using the LU ! decomposition of A into (LU,P). On input X should contain the right-hand side b, which is replaced by the solution on output. --- 542,547 ---- - Function: int gsl_linalg_complex_LU_svx (const gsl_matrix_complex * LU, const gsl_permutation * P, gsl_vector_complex * X) ! These functions solve the square system A x = b in-place using the ! LU decomposition of A into (LU,P). On input X should contain the right-hand side b, which is replaced by the solution on output. *************** *** 563,567 **** The inverse is computed by solving the system A x = b for each column of the identity matrix. It is preferable to avoid direct ! computation of the inverse whenever possible. - Function: double gsl_linalg_LU_det (gsl_matrix * LU, int SIGNUM) --- 566,573 ---- The inverse is computed by solving the system A x = b for each column of the identity matrix. It is preferable to avoid direct ! use of the inverse whenever possible, as the linear solver ! functions can obtain the same result more efficiently and reliably ! (consult any introductory textbook on numerical linear algebra for ! details). - Function: double gsl_linalg_LU_det (gsl_matrix * LU, int SIGNUM) *************** *** 577,583 **** LU) These functions compute the logarithm of the absolute value of the ! determinant of a matrix A, \ln|det(A)|, from its LU decomposition, ! LU. This function may be useful if the direct computation of the ! determinant would overflow or underflow. - Function: int gsl_linalg_LU_sgndet (gsl_matrix * LU, int SIGNUM) --- 583,589 ---- LU) These functions compute the logarithm of the absolute value of the ! determinant of a matrix A, \ln|\det(A)|, from its LU ! decomposition, LU. This function may be useful if the direct ! computation of the determinant would overflow or underflow. - Function: int gsl_linalg_LU_sgndet (gsl_matrix * LU, int SIGNUM) *************** *** 585,589 **** (gsl_matrix_complex * LU, int SIGNUM) These functions compute the sign or phase factor of the ! determinant of a matrix A, det(A)/|det(A)|, from its LU decomposition, LU. --- 591,595 ---- (gsl_matrix_complex * LU, int SIGNUM) These functions compute the sign or phase factor of the ! determinant of a matrix A, \det(A)/|\det(A)|, from its LU decomposition, LU. *************** *** 625,637 **** - Function: int gsl_linalg_QR_solve (const gsl_matrix * QR, const gsl_vector * TAU, const gsl_vector * B, gsl_vector * X) ! This function solves the system A x = b using the QR decomposition ! of A into (QR, TAU) given by `gsl_linalg_QR_decomp'. - Function: int gsl_linalg_QR_svx (const gsl_matrix * QR, const gsl_vector * TAU, gsl_vector * X) ! This function solves the system A x = b in-place using the QR ! decomposition of A into (QR,TAU) given by `gsl_linalg_QR_decomp'. ! On input X should contain the right-hand side b, which is replaced ! by the solution on output. - Function: int gsl_linalg_QR_lssolve (const gsl_matrix * QR, const --- 631,645 ---- - Function: int gsl_linalg_QR_solve (const gsl_matrix * QR, const gsl_vector * TAU, const gsl_vector * B, gsl_vector * X) ! This function solves the square system A x = b using the QR ! decomposition of A into (QR, TAU) given by `gsl_linalg_QR_decomp'. ! The least-squares solution for rectangular systems can be found ! using `gsl_linalg_QR_lssolve'. - Function: int gsl_linalg_QR_svx (const gsl_matrix * QR, const gsl_vector * TAU, gsl_vector * X) ! This function solves the square system A x = b in-place using the ! QR decomposition of A into (QR,TAU) given by ! `gsl_linalg_QR_decomp'. On input X should contain the right-hand ! side b, which is replaced by the solution on output. - Function: int gsl_linalg_QR_lssolve (const gsl_matrix * QR, const *************** *** 713,725 **** A P = Q R ! The first r columns of this Q form an orthonormal basis for the range ! of A for a matrix with column rank r. This decomposition can also be ! used to convert the linear system A x = b into the triangular system R ! y = Q^T b, x = P y, which can be solved by back-substitution and permutation. We denote the QR decomposition with column pivoting by QRP^T since A = Q R P^T. - Function: int gsl_linalg_QRPT_decomp (gsl_matrix * A, gsl_vector * ! TAU, gsl_permutation * P, int *SIGNUM, gsl_vector * NORM) This function factorizes the M-by-N matrix A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper --- 721,733 ---- A P = Q R ! The first r columns of Q form an orthonormal basis for the range of A ! for a matrix with column rank r. This decomposition can also be used ! to convert the linear system A x = b into the triangular system R y = ! Q^T b, x = P y, which can be solved by back-substitution and permutation. We denote the QR decomposition with column pivoting by QRP^T since A = Q R P^T. - Function: int gsl_linalg_QRPT_decomp (gsl_matrix * A, gsl_vector * ! TAU, gsl_permutation * P, int * SIGNUM, gsl_vector * NORM) This function factorizes the M-by-N matrix A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper *************** *** 735,739 **** Householder vector v_i = (0,...,1,A(i+1,i),A(i+2,i),...,A(m,i)). This is the same storage scheme as used by LAPACK. The vector ! NORM is workspace of length N used for column pivoting. The algorithm used to perform the decomposition is Householder QR --- 743,747 ---- Householder vector v_i = (0,...,1,A(i+1,i),A(i+2,i),...,A(m,i)). This is the same storage scheme as used by LAPACK. The vector ! NORM is a workspace of length N used for column pivoting. The algorithm used to perform the decomposition is Householder QR *************** *** 743,747 **** - Function: int gsl_linalg_QRPT_decomp2 (const gsl_matrix * A, gsl_matrix * Q, gsl_matrix * R, gsl_vector * TAU, ! gsl_permutation * P, int *SIGNUM, gsl_vector * NORM) This function factorizes the matrix A into the decomposition A = Q R P^T without modifying A itself and storing the output in the --- 751,755 ---- - Function: int gsl_linalg_QRPT_decomp2 (const gsl_matrix * A, gsl_matrix * Q, gsl_matrix * R, gsl_vector * TAU, ! gsl_permutation * P, int * SIGNUM, gsl_vector * NORM) This function factorizes the matrix A into the decomposition A = Q R P^T without modifying A itself and storing the output in the *************** *** 751,755 **** gsl_vector * TAU, const gsl_permutation * P, const gsl_vector * B, gsl_vector * X) ! This function solves the system A x = b using the QRP^T decomposition of A into (QR, TAU, P) given by `gsl_linalg_QRPT_decomp'. --- 759,763 ---- gsl_vector * TAU, const gsl_permutation * P, const gsl_vector * B, gsl_vector * X) ! This function solves the square system A x = b using the QRP^T decomposition of A into (QR, TAU, P) given by `gsl_linalg_QRPT_decomp'. *************** *** 757,769 **** - Function: int gsl_linalg_QRPT_svx (const gsl_matrix * QR, const gsl_vector * TAU, const gsl_permutation * P, gsl_vector * X) ! This function solves the system A x = b in-place using the QRP^T ! decomposition of A into (QR,TAU,P). On input X should contain the ! right-hand side b, which is replaced by the solution on output. - Function: int gsl_linalg_QRPT_QRsolve (const gsl_matrix * Q, const gsl_matrix * R, const gsl_permutation * P, const gsl_vector * B, gsl_vector * X) ! This function solves the system R P^T x = Q^T b for X. It can be ! used when the QR decomposition of a matrix is available in unpacked form as (Q, R). --- 765,778 ---- - Function: int gsl_linalg_QRPT_svx (const gsl_matrix * QR, const gsl_vector * TAU, const gsl_permutation * P, gsl_vector * X) ! This function solves the square system A x = b in-place using the ! QRP^T decomposition of A into (QR,TAU,P). On input X should ! contain the right-hand side b, which is replaced by the solution ! on output. - Function: int gsl_linalg_QRPT_QRsolve (const gsl_matrix * Q, const gsl_matrix * R, const gsl_permutation * P, const gsl_vector * B, gsl_vector * X) ! This function solves the square system R P^T x = Q^T b for X. It ! can be used when the QR decomposition of a matrix is available in unpacked form as (Q, R). *************** *** 817,827 **** gsl_vector * S, gsl_vector * WORK) This function factorizes the M-by-N matrix A into the singular ! value decomposition A = U S V^T. On output the matrix A is ! replaced by U. The diagonal elements of the singular value matrix ! S are stored in the vector S. The singular values are non-negative ! and form a non-increasing sequence from S_1 to S_N. The matrix V ! contains the elements of V in untransposed form. To form the ! product U S V^T it is necessary to take the transpose of V. A ! workspace of length N is required in WORK. This routine uses the Golub-Reinsch SVD algorithm. --- 826,836 ---- gsl_vector * S, gsl_vector * WORK) This function factorizes the M-by-N matrix A into the singular ! value decomposition A = U S V^T for M >= N. On output the matrix ! A is replaced by U. The diagonal elements of the singular value ! matrix S are stored in the vector S. The singular values are ! non-negative and form a non-increasing sequence from S_1 to S_N. ! The matrix V contains the elements of V in untransposed form. To ! form the product U S V^T it is necessary to take the transpose of ! V. A workspace of length N is required in WORK. This routine uses the Golub-Reinsch SVD algorithm. *************** *** 831,842 **** This function computes the SVD using the modified Golub-Reinsch algorithm, which is faster for M>>N. It requires the vector WORK ! and the N-by-N matrix X as additional working space. - Function: int gsl_linalg_SV_decomp_jacobi (gsl_matrix * A, gsl_matrix * V, gsl_vector * S) ! This function computes the SVD using one-sided Jacobi ! orthogonalization (see references for details). The Jacobi method can compute singular values to higher relative accuracy than ! Golub-Reinsch algorithms. - Function: int gsl_linalg_SV_solve (gsl_matrix * U, gsl_matrix * V, --- 840,851 ---- This function computes the SVD using the modified Golub-Reinsch algorithm, which is faster for M>>N. It requires the vector WORK ! of length N and the N-by-N matrix X as additional working space. - Function: int gsl_linalg_SV_decomp_jacobi (gsl_matrix * A, gsl_matrix * V, gsl_vector * S) ! This function computes the SVD of the M-by-N matrix A using ! one-sided Jacobi orthogonalization for M >= N. The Jacobi method can compute singular values to higher relative accuracy than ! Golub-Reinsch algorithms (see references for details). - Function: int gsl_linalg_SV_solve (gsl_matrix * U, gsl_matrix * V, *************** *** 943,947 **** A = U T U^T ! where U is an unitary matrix and T is a real symmetric tridiagonal matrix. --- 952,956 ---- A = U T U^T ! where U is a unitary matrix and T is a real symmetric tridiagonal matrix. *************** *** 969,973 **** A, gsl_vector * DIAG, gsl_vector * SUBDIAG) This function unpacks the diagonal and subdiagonal of the encoded ! tridiagonal decomposition (A, TAU) obtained from `gsl_linalg_hermtd_decomp' into the real vectors DIAG and SUBDIAG. --- 978,982 ---- A, gsl_vector * DIAG, gsl_vector * SUBDIAG) This function unpacks the diagonal and subdiagonal of the encoded ! tridiagonal decomposition (A, TAU) obtained from the `gsl_linalg_hermtd_decomp' into the real vectors DIAG and SUBDIAG. *************** *** 1200,1203 **** --- 1209,1213 ---- This can be verified by multiplying the solution x by the original matrix A using GNU OCTAVE, + octave> A = [ 0.18, 0.60, 0.57, 0.96; 0.41, 0.24, 0.99, 0.58; *************** *** 1209,1213 **** octave> A * x ans = - 1.0000 2.0000 --- 1219,1222 ---- *************** *** 1250,1256 **** the following papers, ! J.C.Nash, "A one-sided transformation method for the singular value ! decomposition and algebraic eigenproblem", `Computer Journal', ! Volume 18, Number 1 (1973), p 74--76 James Demmel, Kresimir Veselic, "Jacobi's Method is more accurate --- 1259,1265 ---- the following papers, ! J.C. Nash, "A one-sided transformation method for the singular ! value decomposition and algebraic eigenproblem", `Computer ! Journal', Volume 18, Number 1 (1973), p 74-76 James Demmel, Kresimir Veselic, "Jacobi's Method is more accurate *************** *** 1275,1279 **** and eigenvectors of large matrices will want to use the sophisticated routines found in LAPACK. The Fortran version of LAPACK is recommended ! as the standard package for linear algebra. The functions described in this chapter are declared in the header --- 1284,1288 ---- and eigenvectors of large matrices will want to use the sophisticated routines found in LAPACK. The Fortran version of LAPACK is recommended ! as the standard package for large-scale linear algebra. The functions described in this chapter are declared in the header *************** *** 1540,1544 **** efficiency there are separate versions of the routines for real data and for complex data. The mixed-radix routines are a reimplementation of ! the FFTPACK library by Paul Swarztrauber. Fortran code for FFTPACK is available on Netlib (FFTPACK also includes some routines for sine and cosine transforms but these are currently not available in GSL). For --- 1549,1553 ---- efficiency there are separate versions of the routines for real data and for complex data. The mixed-radix routines are a reimplementation of ! the FFTPACK library of Paul Swarztrauber. Fortran code for FFTPACK is available on Netlib (FFTPACK also includes some routines for sine and cosine transforms but these are currently not available in GSL). For *************** *** 1695,1704 **** although not necessarily the most efficient. They use the Cooley-Tukey algorithm to compute in-place complex FFTs for lengths which are a power ! of 2 -- no additional storage is required. The corresponding self-sorting mixed-radix routines offer better performance at the expense of requiring additional working space. ! All these functions are declared in the header file ! `gsl_fft_complex.h'. - Function: int gsl_fft_complex_radix2_forward --- 1704,1713 ---- although not necessarily the most efficient. They use the Cooley-Tukey algorithm to compute in-place complex FFTs for lengths which are a power ! of 2--no additional storage is required. The corresponding self-sorting mixed-radix routines offer better performance at the expense of requiring additional working space. ! All the functions described in this section are declared in the ! header file `gsl_fft_complex.h'. - Function: int gsl_fft_complex_radix2_forward *************** *** 1751,1761 **** main (void) { ! int i; ! double data[2*128]; for (i = 0; i < 128; i++) { ! REAL(data,i) = 0.0; ! IMAG(data,i) = 0.0; } --- 1760,1768 ---- main (void) { ! int i; double data[2*128]; for (i = 0; i < 128; i++) { ! REAL(data,i) = 0.0; IMAG(data,i) = 0.0; } *************** *** 1796,1800 **** wrap-around of negative times at t=128, and working in units of k/N, the DFT approximates the continuum fourier transform, giving a ! modulated \sin function.  --- 1803,1807 ---- wrap-around of negative times at t=128, and working in units of k/N, the DFT approximates the continuum fourier transform, giving a ! modulated sine function.  *************** *** 1806,1811 **** This section describes mixed-radix FFT algorithms for complex data. The mixed-radix functions work for FFTs of any length. They are a ! reimplementation of the Fortran FFTPACK library by Paul Swarztrauber. ! The theory is explained in the review article `Self-sorting Mixed-radix FFTs' by Clive Temperton. The routines here use the same indexing scheme and basic algorithms as FFTPACK. --- 1813,1818 ---- This section describes mixed-radix FFT algorithms for complex data. The mixed-radix functions work for FFTs of any length. They are a ! reimplementation of Paul Swarztrauber's Fortran FFTPACK library. The ! theory is explained in the review article `Self-sorting Mixed-radix FFTs' by Clive Temperton. The routines here use the same indexing scheme and basic algorithms as FFTPACK. *************** *** 1840,1845 **** Algorithms' for details on adding support for other factors. ! All these functions are declared in the header file ! `gsl_fft_complex.h'. - Function: gsl_fft_complex_wavetable * --- 1847,1852 ---- Algorithms' for details on adding support for other factors. ! All the functions described in this section are declared in the ! header file `gsl_fft_complex.h'. - Function: gsl_fft_complex_wavetable * *************** *** 1873,1879 **** examine them. For example, the chosen factorization of the FFT length is given and can be used to provide an estimate of the run-time or ! numerical error. ! ! The wavetable structure is declared in the header file `gsl_fft_complex.h'. --- 1880,1884 ---- examine them. For example, the chosen factorization of the FFT length is given and can be used to provide an estimate of the run-time or ! numerical error. The wavetable structure is declared in the header file `gsl_fft_complex.h'. *************** *** 2060,2077 **** The symmetry of the half-complex sequence implies that only half of the complex numbers in the output need to be stored. The remaining half can ! be reconstructed using the half-complex symmetry condition. (This works ! for all lengths, even and odd. When the length is even the middle ! value, where k=N/2, is also real). Thus only N real numbers are ! required to store the half-complex sequence, and the transform of a real ! sequence can be stored in the same size array as the original data. The precise storage arrangements depend on the algorithm, and are different for radix-2 and mixed-radix routines. The radix-2 function ! operates in-place, which constrain the locations where each element can be stored. The restriction forces real and imaginary parts to be stored far apart. The mixed-radix algorithm does not have this restriction, and it stores the real and imaginary parts of a given term in ! neighboring locations. This is desirable for better locality of memory ! accesses.  --- 2065,2082 ---- The symmetry of the half-complex sequence implies that only half of the complex numbers in the output need to be stored. The remaining half can ! be reconstructed using the half-complex symmetry condition. This works ! for all lengths, even and odd--when the length is even the middle value ! where k=N/2 is also real. Thus only N real numbers are required to ! store the half-complex sequence, and the transform of a real sequence ! can be stored in the same size array as the original data. The precise storage arrangements depend on the algorithm, and are different for radix-2 and mixed-radix routines. The radix-2 function ! operates in-place, which constrains the locations where each element can be stored. The restriction forces real and imaginary parts to be stored far apart. The mixed-radix algorithm does not have this restriction, and it stores the real and imaginary parts of a given term in ! neighboring locations (which is desirable for better locality of memory ! accesses).  *************** *** 2453,2458 **** Signal Processing'. IEEE Press, 1979. ! For serious FFT work we recommend the use of the dedicated FFTW library ! by Frigo and Johnson. The FFTW library is self-optimizing -- it automatically tunes itself for each hardware platform in order to achieve maximum performance. It is available under the GNU GPL. --- 2458,2463 ---- Signal Processing'. IEEE Press, 1979. ! For large-scale FFT work we recommend the use of the dedicated FFTW ! library by Frigo and Johnson. The FFTW library is self-optimizing--it automatically tunes itself for each hardware platform in order to achieve maximum performance. It is available under the GNU GPL. *************** *** 2551,2580 **** order rule gives an estimate of the error in the approximation. ! The algorithms for general functions (without a weight function) are ! based on Gauss-Kronrod rules. A Gauss-Kronrod rule begins with a ! classical Gaussian quadrature rule of order m. This is extended with ! additional points between each of the abscissae to give a higher order ! Kronrod rule of order 2m+1. The Kronrod rule is efficient because it ! reuses existing function evaluations from the Gaussian rule. The ! higher order Kronrod rule is used as the best approximation to the ! integral, and the difference between the two rules is used as an estimate of the error in the approximation. ! For integrands with weight functions the algorithms use ! Clenshaw-Curtis quadrature rules. A Clenshaw-Curtis rule begins with ! an n-th order Chebyshev polynomial approximation to the integrand. This ! polynomial can be integrated exactly to give an approximation to the ! integral of the original function. The Chebyshev expansion can be ! extended to higher orders to improve the approximation. The presence of ! singularities (or other behavior) in the integrand can cause slow ! convergence in the Chebyshev approximation. The modified Clenshaw-Curtis rules used in QUADPACK separate out several common ! weight functions which cause slow convergence. These weight functions ! are integrated analytically against the Chebyshev polynomials to ! precompute "modified Chebyshev moments". Combining the moments with ! the Chebyshev approximation to the function gives the desired integral. ! The use of analytic integration for the singular part of the function ! allows exact cancellations and substantially improves the overall ! convergence behavior of the integration.  --- 2556,2603 ---- order rule gives an estimate of the error in the approximation. ! Integrands without weight functions ! ----------------------------------- ! ! The algorithms for general functions (without a weight function) are ! based on Gauss-Kronrod rules. ! ! A Gauss-Kronrod rule begins with a classical Gaussian quadrature ! rule of order m. This is extended with additional points between each ! of the abscissae to give a higher order Kronrod rule of order 2m+1. ! The Kronrod rule is efficient because it reuses existing function ! evaluations from the Gaussian rule. ! ! The higher order Kronrod rule is used as the best approximation to ! the integral, and the difference between the two rules is used as an estimate of the error in the approximation. ! Integrands with weight functions ! -------------------------------- ! ! For integrands with weight functions the algorithms use Clenshaw-Curtis ! quadrature rules. ! ! A Clenshaw-Curtis rule begins with an n-th order Chebyshev ! polynomial approximation to the integrand. This polynomial can be ! integrated exactly to give an approximation to the integral of the ! original function. The Chebyshev expansion can be extended to higher ! orders to improve the approximation and provide an estimate of the ! error. ! ! Integrands with singular weight functions ! ----------------------------------------- ! ! The presence of singularities (or other behavior) in the integrand can ! cause slow convergence in the Chebyshev approximation. The modified Clenshaw-Curtis rules used in QUADPACK separate out several common ! weight functions which cause slow convergence. ! ! These weight functions are integrated analytically against the ! Chebyshev polynomials to precompute "modified Chebyshev moments". ! Combining the moments with the Chebyshev approximation to the function ! gives the desired integral. The use of analytic integration for the ! singular part of the function allows exact cancellations and ! substantially improves the overall convergence behavior of the ! integration.  *************** *** 2588,2592 **** points. It is provided for fast integration of smooth functions. ! - Function: int gsl_integration_qng (const gsl_function *F, double A, double B, double EPSABS, double EPSREL, double * RESULT, double * ABSERR, size_t * NEVAL) --- 2611,2615 ---- points. It is provided for fast integration of smooth functions. ! - Function: int gsl_integration_qng (const gsl_function * F, double A, double B, double EPSABS, double EPSREL, double * RESULT, double * ABSERR, size_t * NEVAL) *************** *** 2625,2629 **** This function frees the memory associated with the workspace W. ! - Function: int gsl_integration_qag (const gsl_function *F, double A, double B, double EPSABS, double EPSREL, size_t LIMIT, int KEY, gsl_integration_workspace * WORKSPACE, double * RESULT, --- 2648,2652 ---- This function frees the memory associated with the workspace W. ! - Function: int gsl_integration_qag (const gsl_function * F, double A, double B, double EPSABS, double EPSREL, size_t LIMIT, int KEY, gsl_integration_workspace * WORKSPACE, double * RESULT, *************** *** 2672,2677 **** - Function: int gsl_integration_qags (const gsl_function * F, double A, double B, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double *RESULT, double ! *ABSERR) This function applies the Gauss-Kronrod 21-point integration rule adaptively until an estimate of the integral of f over (a,b) is --- 2695,2700 ---- - Function: int gsl_integration_qags (const gsl_function * F, double A, double B, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double * RESULT, ! double * ABSERR) This function applies the Gauss-Kronrod 21-point integration rule adaptively until an estimate of the integral of f over (a,b) is *************** *** 2694,2701 **** ==================================================== ! - Function: int gsl_integration_qagp (const gsl_function * F, double ! *PTS, size_t NPTS, double EPSABS, double EPSREL, size_t ! LIMIT, gsl_integration_workspace * WORKSPACE, double *RESULT, ! double *ABSERR) This function applies the adaptive integration algorithm QAGS taking account of the user-supplied locations of singular points. --- 2717,2724 ---- ==================================================== ! - Function: int gsl_integration_qagp (const gsl_function * F, double * ! PTS, size_t NPTS, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double * RESULT, ! double * ABSERR) This function applies the adaptive integration algorithm QAGS taking account of the user-supplied locations of singular points. *************** *** 2726,2733 **** - Function: int gsl_integration_qagi (gsl_function * F, double EPSABS, double EPSREL, size_t LIMIT, gsl_integration_workspace * ! WORKSPACE, double *RESULT, double *ABSERR) This function computes the integral of the function F over the infinite interval (-\infty,+\infty). The integral is mapped onto ! the interval (0,1] using the transformation x = (1-t)/t, \int_{-\infty}^{+\infty} dx f(x) = --- 2749,2756 ---- - Function: int gsl_integration_qagi (gsl_function * F, double EPSABS, double EPSREL, size_t LIMIT, gsl_integration_workspace * ! WORKSPACE, double * RESULT, double * ABSERR) This function computes the integral of the function F over the infinite interval (-\infty,+\infty). The integral is mapped onto ! the semi-open interval (0,1] using the transformation x = (1-t)/t, \int_{-\infty}^{+\infty} dx f(x) = *************** *** 2742,2750 **** - Function: int gsl_integration_qagiu (gsl_function * F, double A, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double *RESULT, double ! *ABSERR) This function computes the integral of the function F over the semi-infinite interval (a,+\infty). The integral is mapped onto ! the interval (0,1] using the transformation x = a + (1-t)/t, \int_{a}^{+\infty} dx f(x) = --- 2765,2774 ---- - Function: int gsl_integration_qagiu (gsl_function * F, double A, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double * RESULT, ! double * ABSERR) This function computes the integral of the function F over the semi-infinite interval (a,+\infty). The integral is mapped onto ! the semi-open interval (0,1] using the transformation x = a + ! (1-t)/t, \int_{a}^{+\infty} dx f(x) = *************** *** 2755,2763 **** - Function: int gsl_integration_qagil (gsl_function * F, double B, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double *RESULT, double ! *ABSERR) This function computes the integral of the function F over the semi-infinite interval (-\infty,b). The integral is mapped onto ! the region (0,1] using the transformation x = b - (1-t)/t, \int_{+\infty}^{b} dx f(x) = --- 2779,2788 ---- - Function: int gsl_integration_qagil (gsl_function * F, double B, double EPSABS, double EPSREL, size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double * RESULT, ! double * ABSERR) This function computes the integral of the function F over the semi-infinite interval (-\infty,b). The integral is mapped onto ! the semi-open interval (0,1] using the transformation x = b - ! (1-t)/t, \int_{+\infty}^{b} dx f(x) = *************** *** 2772,2776 **** ===================================================== ! - Function: int gsl_integration_qawc (gsl_function *F, double A, double B, double C, double EPSABS, double EPSREL, size_t LIMIT, gsl_integration_workspace * WORKSPACE, double * --- 2797,2801 ---- ===================================================== ! - Function: int gsl_integration_qawc (gsl_function * F, double A, double B, double C, double EPSABS, double EPSREL, size_t LIMIT, gsl_integration_workspace * WORKSPACE, double * *************** *** 2841,2846 **** A, const double B, gsl_integration_qaws_table * T, const double EPSABS, const double EPSREL, const size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double *RESULT, double ! *ABSERR) This function computes the integral of the function f(x) over the interval (a,b) with the singular weight function (x-a)^\alpha --- 2866,2871 ---- A, const double B, gsl_integration_qaws_table * T, const double EPSABS, const double EPSREL, const size_t LIMIT, ! gsl_integration_workspace * WORKSPACE, double * RESULT, ! double * ABSERR) This function computes the integral of the function f(x) over the interval (a,b) with the singular weight function (x-a)^\alpha *************** *** 2916,2921 **** A, const double EPSABS, const double EPSREL, const size_t LIMIT, gsl_integration_workspace * WORKSPACE, ! gsl_integration_qawo_table * WF, double *RESULT, double ! *ABSERR) This function uses an adaptive algorithm to compute the integral of f over (a,b) with the weight function \sin(\omega x) or --- 2941,2946 ---- A, const double EPSABS, const double EPSREL, const size_t LIMIT, gsl_integration_workspace * WORKSPACE, ! gsl_integration_qawo_table * WF, double * RESULT, double * ! ABSERR) This function uses an adaptive algorithm to compute the integral of f over (a,b) with the weight function \sin(\omega x) or *************** *** 2933,2941 **** exceed the allocated size of the workspace. ! Those subintervals with "large" widths d, d\omega > 4 are computed ! using a 25-point Clenshaw-Curtis integration rule, which handles ! the oscillatory behavior. Subintervals with a "small" width ! d\omega < 4 are computed using a 15-point Gauss-Kronrod ! integration. --- 2958,2966 ---- exceed the allocated size of the workspace. ! Those subintervals with "large" widths d where d\omega > 4 are ! computed using a 25-point Clenshaw-Curtis integration rule, which ! handles the oscillatory behavior. Subintervals with a "small" ! widths where d\omega < 4 are computed using a 15-point ! Gauss-Kronrod integration. *************** *** 2950,2955 **** gsl_integration_workspace * WORKSPACE, gsl_integration_workspace * CYCLE_WORKSPACE, ! gsl_integration_qawo_table * WF, double *RESULT, double ! *ABSERR) This function attempts to compute a Fourier integral of the function F over the semi-infinite interval [a,+\infty). --- 2975,2980 ---- gsl_integration_workspace * WORKSPACE, gsl_integration_workspace * CYCLE_WORKSPACE, ! gsl_integration_qawo_table * WF, double * RESULT, double * ! ABSERR) This function attempts to compute a Fourier integral of the function F over the semi-infinite interval [a,+\infty). *************** *** 2958,2965 **** I = \int_a^{+\infty} dx f(x) cos(omega x) ! The parameter \omega is taken from the table WF (the length L can ! take any value, since it is overridden by this function to a value ! appropriate for the fourier integration). The integral is computed ! using the QAWO algorithm over each of the subintervals, C_1 = [a, a + c] --- 2983,2991 ---- I = \int_a^{+\infty} dx f(x) cos(omega x) ! The parameter \omega and choice of \sin or \cos is taken from the ! table WF (the length L can take any value, since it is overridden ! by this function to a value appropriate for the fourier ! integration). The integral is computed using the QAWO algorithm ! over each of the subintervals, C_1 = [a, a + c] *************** *** 3077,3081 **** subdivisions. ! bash$ ./a.out result = -3.999999999999973799 --- 3103,3107 ---- subdivisions. ! $ ./a.out result = -3.999999999999973799 *************** *** 3209,3213 **** ====================================== ! - Random: gsl_rng * gsl_rng_alloc (const gsl_rng_type * T) This function returns a pointer to a newly-created instance of a random number generator of type T. For example, the following --- 3235,3239 ---- ====================================== ! - Function: gsl_rng * gsl_rng_alloc (const gsl_rng_type * T) This function returns a pointer to a newly-created instance of a random number generator of type T. For example, the following *************** *** 3228,3232 **** in this chapter. ! - Random: void gsl_rng_set (const gsl_rng * R, unsigned long int S) This function initializes (or `seeds') the random number generator. If the generator is seeded with the same value of S on --- 3254,3258 ---- in this chapter. ! - Function: void gsl_rng_set (const gsl_rng * R, unsigned long int S) This function initializes (or `seeds') the random number generator. If the generator is seeded with the same value of S on *************** *** 3240,3244 **** equal to zero reproduces this when using `gsl_rng_ranlux'. ! - Random: void gsl_rng_free (gsl_rng * R) This function frees all the memory associated with the generator R. --- 3266,3270 ---- equal to zero reproduces this when using `gsl_rng_ranlux'. ! - Function: void gsl_rng_free (gsl_rng * R) This function frees all the memory associated with the generator R. *************** *** 3253,3257 **** obtain non-uniform distributions *note Random Number Distributions::. ! - Random: unsigned long int gsl_rng_get (const gsl_rng * R) This function returns a random integer from the generator R. The minimum and maximum values depend on the algorithm used, but all --- 3279,3283 ---- obtain non-uniform distributions *note Random Number Distributions::. ! - Function: unsigned long int gsl_rng_get (const gsl_rng * R) This function returns a random integer from the generator R. The minimum and maximum values depend on the algorithm used, but all *************** *** 3260,3264 **** `gsl_rng_max (r)' and `gsl_rng_min (r)'. ! - Random: double gsl_rng_uniform (const gsl_rng * R) This function returns a double precision floating point number uniformly distributed in the range [0,1). The range includes 0.0 --- 3286,3290 ---- `gsl_rng_max (r)' and `gsl_rng_min (r)'. ! - Function: double gsl_rng_uniform (const gsl_rng * R) This function returns a double precision floating point number uniformly distributed in the range [0,1). The range includes 0.0 *************** *** 3270,3274 **** represented in a single `unsigned long int'). ! - Random: double gsl_rng_uniform_pos (const gsl_rng * R) This function returns a positive double precision floating point number uniformly distributed in the range (0,1), excluding both --- 3296,3300 ---- represented in a single `unsigned long int'). ! - Function: double gsl_rng_uniform_pos (const gsl_rng * R) This function returns a positive double precision floating point number uniformly distributed in the range (0,1), excluding both *************** *** 3278,3282 **** singularity at 0.0. ! - Random: unsigned long int gsl_rng_uniform_int (const gsl_rng * R, unsigned long int N) This function returns a random integer from 0 to N-1 inclusive. --- 3304,3308 ---- singularity at 0.0. ! - Function: unsigned long int gsl_rng_uniform_int (const gsl_rng * R, unsigned long int N) This function returns a random integer from 0 to N-1 inclusive. *************** *** 3300,3304 **** generator parameters into your own code. ! - Random: const char * gsl_rng_name (const gsl_rng * R) This function returns a pointer to the name of the generator. For example, --- 3326,3330 ---- generator parameters into your own code. ! - Function: const char * gsl_rng_name (const gsl_rng * R) This function returns a pointer to the name of the generator. For example, *************** *** 3309,3317 **** would print something like `r is a 'taus' generator'. ! - Random: unsigned long int gsl_rng_max (const gsl_rng * R) `gsl_rng_max' returns the largest value that `gsl_rng_get' can return. ! - Random: unsigned long int gsl_rng_min (const gsl_rng * R) `gsl_rng_min' returns the smallest value that `gsl_rng_get' can return. Usually this value is zero. There are some generators --- 3335,3343 ---- would print something like `r is a 'taus' generator'. ! - Function: unsigned long int gsl_rng_max (const gsl_rng * R) `gsl_rng_max' returns the largest value that `gsl_rng_get' can return. ! - Function: unsigned long int gsl_rng_min (const gsl_rng * R) `gsl_rng_min' returns the smallest value that `gsl_rng_get' can return. Usually this value is zero. There are some generators *************** *** 3319,3324 **** the minimum value is 1. ! - Random: void * gsl_rng_state (const gsl_rng * R) ! - Random: size_t gsl_rng_size (const gsl_rng * R) These functions return a pointer to the state of generator R and its size. You can use this information to access the state --- 3345,3350 ---- the minimum value is 1. ! - Function: void * gsl_rng_state (const gsl_rng * R) ! - Function: size_t gsl_rng_size (const gsl_rng * R) These functions return a pointer to the state of generator R and its size. You can use this information to access the state *************** *** 3330,3334 **** fwrite (state, n, 1, stream); ! - Random: const gsl_rng_type ** gsl_rng_types_setup (void) This function returns a pointer to an array of all the available generator types, terminated by a null pointer. The function should --- 3356,3360 ---- fwrite (state, n, 1, stream); ! - Function: const gsl_rng_type ** gsl_rng_types_setup (void) This function returns a pointer to an array of all the available generator types, terminated by a null pointer. The function should *************** *** 3406,3410 **** defaults, an `mt19937' generator with a seed of 0, ! bash$ ./a.out generator type: mt19937 --- 3432,3436 ---- defaults, an `mt19937' generator with a seed of 0, ! $ ./a.out generator type: mt19937 *************** *** 3415,3419 **** default generator and the seed, ! bash$ GSL_RNG_TYPE="taus" GSL_RNG_SEED=123 ./a.out GSL_RNG_TYPE=taus GSL_RNG_SEED=123 --- 3441,3445 ---- default generator and the seed, ! $ GSL_RNG_TYPE="taus" GSL_RNG_SEED=123 ./a.out GSL_RNG_TYPE=taus GSL_RNG_SEED=123 *************** *** 3428,3442 **** ===================================== ! The above methods ignore the random number `state' which changes from ! call to call. It is often useful to be able to save and restore the ! state. To permit these practices, a few somewhat more advanced functions are supplied. These include: ! - Random: int gsl_rng_memcpy (gsl_rng * DEST, const gsl_rng * SRC) This function copies the random number generator SRC into the pre-existing generator DEST, making DEST into an exact copy of SRC. The two generators must be of the same type. ! - Random: gsl_rng * gsl_rng_clone (const gsl_rng * R) This function returns a pointer to a newly created generator which is an exact copy of the generator R. --- 3454,3468 ---- ===================================== ! The above methods do not expose the random number `state' which changes ! from call to call. It is often useful to be able to save and restore ! the state. To permit these practices, a few somewhat more advanced functions are supplied. These include: ! - Function: int gsl_rng_memcpy (gsl_rng * DEST, const gsl_rng * SRC) This function copies the random number generator SRC into the pre-existing generator DEST, making DEST into an exact copy of SRC. The two generators must be of the same type. ! - Function: gsl_rng * gsl_rng_clone (const gsl_rng * R) This function returns a pointer to a newly created generator which is an exact copy of the generator R. *************** *** 3502,3509 **** Simulation', Vol. 8, No. 1 (Jan. 1998), Pages 3-30 ! The generator `gsl_rng_19937' uses the second revision of the seeding procedure published by the two authors above in 2002. The original seeding procedures could cause spurious artifacts for ! some seed values. They are still available through the alternate generators `gsl_rng_mt19937_1999' and `gsl_rng_mt19937_1998'. --- 3528,3535 ---- Simulation', Vol. 8, No. 1 (Jan. 1998), Pages 3-30 ! The generator `gsl_rng_mt19937' uses the second revision of the seeding procedure published by the two authors above in 2002. The original seeding procedures could cause spurious artifacts for ! some seed values. They are still available through the alternative generators `gsl_rng_mt19937_1999' and `gsl_rng_mt19937_1998'. *************** *** 3520,3524 **** is about 10^171. The algorithm has mathematically proven properties and can provide truly decorrelated numbers at a known ! level of randomness. The higher luxury levels provide additional decorrelation between samples as an additional safety margin. --- 3546,3550 ---- is about 10^171. The algorithm has mathematically proven properties and can provide truly decorrelated numbers at a known ! level of randomness. The higher luxury levels provide increased decorrelation between samples as an additional safety margin. *************** *** 3575,3579 **** P. L'Ecuyer, "Combined Multiple Recursive Random Number ! Generators," `Operations Research', 44, 5 (1996), 816-822. - Generator: gsl_rng_mrg --- 3601,3605 ---- P. L'Ecuyer, "Combined Multiple Recursive Random Number ! Generators", `Operations Research', 44, 5 (1996), 816-822. - Generator: gsl_rng_mrg *************** *** 3806,3810 **** - Generator: gsl_rng_r250 This is the shift-register generator of Kirkpatrick and Stoll. The ! sequence is x_n = x_{n-103} ^^ x_{n-250} --- 3832,3836 ---- - Generator: gsl_rng_r250 This is the shift-register generator of Kirkpatrick and Stoll. The ! sequence is based on the recurrence x_n = x_{n-103} ^^ x_{n-250} *************** *** 4023,4027 **** The following program demonstrates the use of a random number generator ! to produce uniform random numbers in range [0.0, 1.0), #include --- 4049,4053 ---- The following program demonstrates the use of a random number generator ! to produce uniform random numbers in the range [0.0, 1.0), #include *************** *** 4071,4075 **** a different stream of numbers. The generator itself can be changed using the environment variable `GSL_RNG_TYPE'. Here is the output of ! the program using a seed value of 123 and the mutiple-recursive generator `mrg', --- 4097,4101 ---- a different stream of numbers. The generator itself can be changed using the environment variable `GSL_RNG_TYPE'. Here is the output of ! the program using a seed value of 123 and the multiple-recursive generator `mrg', *************** *** 4110,4120 **** `handsim.ps'. - On the World Wide Web, see the pLab home page - (`http://random.mat.sbg.ac.at/') for a lot of information on the - state-of-the-art in random number generation, and for numerous links to - various "random" WWW sites. - The source code for the DIEHARD random number generator tests is also ! available online. `DIEHARD source code' G. Marsaglia, --- 4136,4141 ---- `handsim.ps'. The source code for the DIEHARD random number generator tests is also ! available online, `DIEHARD source code' G. Marsaglia, *************** *** 4151,4158 **** This chapter describes functions for generating quasi-random sequences in arbitrary dimensions. A quasi-random sequence progressively covers a ! d-dimensional space with a set of points that are uniformly distributed. ! Quasi-random sequences are also known as low-discrepancy sequences. The ! quasi-random sequence generators use an interface that is similar to the ! interface for random number generators. The functions described in this section are declared in the header --- 4172,4180 ---- This chapter describes functions for generating quasi-random sequences in arbitrary dimensions. A quasi-random sequence progressively covers a ! d-dimensional space with a set of points that are uniformly ! distributed. Quasi-random sequences are also known as low-discrepancy ! sequences. The quasi-random sequence generators use an interface that ! is similar to the interface for random number generators, except that ! seeding is not required--each generator produces a single sequence. The functions described in this section are declared in the header *************** *** 4188,4191 **** --- 4210,4215 ---- - Function: void gsl_qrng_init (gsl_qrng * Q) This function reinitializes the generator Q to its starting point. + Note that quasi-random sequences do not use a seed and always + produce the same set of values.  *************** *** 4196,4203 **** - Function: int gsl_qrng_get (const gsl_qrng * Q, double X[]) ! This function returns the next point X from the sequence generator ! Q. The space available for X must match the dimension of the ! generator. The point X will lie in the range 0 < x_i < 1 for each ! x_i.  --- 4220,4227 ---- - Function: int gsl_qrng_get (const gsl_qrng * Q, double X[]) ! This function stores the next point from the sequence generator Q ! in the array X. The space available for X must match the ! dimension of the generator. The point X will lie in the range 0 < ! x_i < 1 for each x_i.  *************** *** 4309,4314 **** P. Bratley and B.L. Fox and H. Niederreiter, "Algorithm 738: Programs to Generate Niederreiter's Low-discrepancy Sequences", ! Transactions on Mathematical Software, Vol. 20, No. 4, December, ! 1994, p. 494-495.  --- 4333,4338 ---- P. Bratley and B.L. Fox and H. Niederreiter, "Algorithm 738: Programs to Generate Niederreiter's Low-discrepancy Sequences", ! `ACM Transactions on Mathematical Software', Vol. 20, No. 4, ! December, 1994, p. 494-495.  *************** *** 4322,4334 **** distributions described in this chapter can be obtained using any of the random number generators in the library as an underlying source of ! randomness. In the simplest cases a non-uniform distribution can be ! obtained analytically from the uniform distribution of a random number ! generator by applying an appropriate transformation. This method uses ! one call to the random number generator. ! ! More complicated distributions are created by the ! "acceptance-rejection" method, which compares the desired distribution ! against a distribution which is similar and known analytically. This ! usually requires several samples from the generator. The library also provides cumulative distribution functions and --- 4346,4358 ---- distributions described in this chapter can be obtained using any of the random number generators in the library as an underlying source of ! randomness. ! ! In the simplest cases a non-uniform distribution can be obtained ! analytically from the uniform distribution of a random number generator ! by applying an appropriate transformation. This method uses one call to ! the random number generator. More complicated distributions are created ! by the "acceptance-rejection" method, which compares the desired ! distribution against a distribution which is similar and known ! analytically. This usually requires several samples from the generator. The library also provides cumulative distribution functions and *************** *** 4396,4411 **** infinitesimal range x to x+dx is p dx. ! The cumulative distribution function for the lower tail is defined ! by, P(x) = \int_{-\infty}^{x} dx' p(x') and gives the probability of a variate taking a value less than x. ! The cumulative distribution function for the upper tail is defined ! by, Q(x) = \int_{x}^{+\infty} dx' p(x') and gives the probability of a variate taking a value greater than x. ! The upper and lower cumulative distribution functions are related by P(x) + Q(x) = 1 and satisfy 0 <= P(x) <= 1, 0 <= Q(x) <= 1. --- 4420,4438 ---- infinitesimal range x to x+dx is p dx. ! The cumulative distribution function for the lower tail P(x) is ! defined by the integral, ! P(x) = \int_{-\infty}^{x} dx' p(x') and gives the probability of a variate taking a value less than x. ! The cumulative distribution function for the upper tail Q(x) is ! defined by the integral, ! Q(x) = \int_{x}^{+\infty} dx' p(x') and gives the probability of a variate taking a value greater than x. ! ! The upper and lower cumulative distribution functions are related by P(x) + Q(x) = 1 and satisfy 0 <= P(x) <= 1, 0 <= Q(x) <= 1. *************** *** 4420,4424 **** ========================= ! - Random: double gsl_ran_gaussian (const gsl_rng * R, double SIGMA) This function returns a Gaussian random variate, with mean zero and standard deviation SIGMA. The probability distribution for --- 4447,4451 ---- ========================= ! - Function: double gsl_ran_gaussian (const gsl_rng * R, double SIGMA) This function returns a Gaussian random variate, with mean zero and standard deviation SIGMA. The probability distribution for *************** *** 4444,4450 **** Kinderman-Monahan ratio method. ! - Random: double gsl_ran_ugaussian (const gsl_rng * R) - Function: double gsl_ran_ugaussian_pdf (double X) ! - Random: double gsl_ran_ugaussian_ratio_method (const gsl_rng * R) These functions compute results for the unit Gaussian distribution. They are equivalent to the functions above with a --- 4471,4477 ---- Kinderman-Monahan ratio method. ! - Function: double gsl_ran_ugaussian (const gsl_rng * R) - Function: double gsl_ran_ugaussian_pdf (double X) ! - Function: double gsl_ran_ugaussian_ratio_method (const gsl_rng * R) These functions compute results for the unit Gaussian distribution. They are equivalent to the functions above with a *************** *** 4472,4476 **** ============================== ! - Random: double gsl_ran_gaussian_tail (const gsl_rng * R, double A, double SIGMA) This function provides random variates from the upper tail of a --- 4499,4503 ---- ============================== ! - Function: double gsl_ran_gaussian_tail (const gsl_rng * R, double A, double SIGMA) This function provides random variates from the upper tail of a *************** *** 4478,4488 **** returned are larger than the lower limit A, which must be positive. The method is based on Marsaglia's famous ! rectangle-wedge-tail algorithm (Ann Math Stat 32, 894-899 (1961)), ! with this aspect explained in Knuth, v2, 3rd ed, p139,586 (exercise 11). The probability distribution for Gaussian tail random variates is, ! p(x) dx = {1 \over N(a;\sigma)} \exp (- x^2/(2 \sigma^2)) dx for x > a where N(a;\sigma) is the normalization constant, --- 4505,4515 ---- returned are larger than the lower limit A, which must be positive. The method is based on Marsaglia's famous ! rectangle-wedge-tail algorithm (Ann. Math. Stat. 32, 894-899 ! (1961)), with this aspect explained in Knuth, v2, 3rd ed, p139,586 (exercise 11). The probability distribution for Gaussian tail random variates is, ! p(x) dx = {1 \over N(a;\sigma) \sqrt{2 \pi \sigma^2}} \exp (- x^2/(2 \sigma^2)) dx for x > a where N(a;\sigma) is the normalization constant, *************** *** 4498,4502 **** ! - Random: double gsl_ran_ugaussian_tail (const gsl_rng * R, double A) - Function: double gsl_ran_ugaussian_tail_pdf (double X, double A) These functions compute results for the tail of a unit Gaussian --- 4525,4529 ---- ! - Function: double gsl_ran_ugaussian_tail (const gsl_rng * R, double A) - Function: double gsl_ran_ugaussian_tail_pdf (double X, double A) These functions compute results for the tail of a unit Gaussian *************** *** 4510,4519 **** =================================== ! - Random: void gsl_ran_bivariate_gaussian (const gsl_rng * R, double SIGMA_X, double SIGMA_Y, double RHO, double * X, double * Y) ! This function generates a pair of correlated gaussian variates, with mean zero, correlation coefficient RHO and standard deviations SIGMA_X and SIGMA_Y in the x and y directions. The probability ! distribution for bivariate gaussian random variates is, p(x,y) dx dy = {1 \over 2 \pi \sigma_x \sigma_y \sqrt{1-\rho^2}} \exp (-(x^2/\sigma_x^2 + y^2/\sigma_y^2 - 2 \rho x y/(\sigma_x\sigma_y))/2(1-\rho^2)) dx dy --- 4537,4546 ---- =================================== ! - Function: void gsl_ran_bivariate_gaussian (const gsl_rng * R, double SIGMA_X, double SIGMA_Y, double RHO, double * X, double * Y) ! This function generates a pair of correlated Gaussian variates, with mean zero, correlation coefficient RHO and standard deviations SIGMA_X and SIGMA_Y in the x and y directions. The probability ! distribution for bivariate Gaussian random variates is, p(x,y) dx dy = {1 \over 2 \pi \sigma_x \sigma_y \sqrt{1-\rho^2}} \exp (-(x^2/\sigma_x^2 + y^2/\sigma_y^2 - 2 \rho x y/(\sigma_x\sigma_y))/2(1-\rho^2)) dx dy *************** *** 4525,4529 **** double SIGMA_X, double SIGMA_Y, double RHO) This function computes the probability density p(x,y) at (X,Y) for ! a bivariate gaussian distribution with standard deviations SIGMA_X, SIGMA_Y and correlation coefficient RHO, using the formula given above. --- 4552,4556 ---- double SIGMA_X, double SIGMA_Y, double RHO) This function computes the probability density p(x,y) at (X,Y) for ! a bivariate Gaussian distribution with standard deviations SIGMA_X, SIGMA_Y and correlation coefficient RHO, using the formula given above. *************** *** 4536,4540 **** ============================ ! - Random: double gsl_ran_exponential (const gsl_rng * R, double MU) This function returns a random variate from the exponential distribution with mean MU. The distribution is, --- 4563,4567 ---- ============================ ! - Function: double gsl_ran_exponential (const gsl_rng * R, double MU) This function returns a random variate from the exponential distribution with mean MU. The distribution is, *************** *** 4564,4568 **** ======================== ! - Random: double gsl_ran_laplace (const gsl_rng * R, double A) This function returns a random variate from the Laplace distribution with width A. The distribution is, --- 4591,4595 ---- ======================== ! - Function: double gsl_ran_laplace (const gsl_rng * R, double A) This function returns a random variate from the Laplace distribution with width A. The distribution is, *************** *** 4591,4595 **** ================================== ! - Random: double gsl_ran_exppow (const gsl_rng * R, double A, double B) This function returns a random variate from the exponential power distribution with scale parameter A and exponent B. The --- 4618,4623 ---- ================================== ! - Function: double gsl_ran_exppow (const gsl_rng * R, double A, double ! B) This function returns a random variate from the exponential power distribution with scale parameter A and exponent B. The *************** *** 4614,4618 **** ======================= ! - Random: double gsl_ran_cauchy (const gsl_rng * R, double A) This function returns a random variate from the Cauchy distribution with scale parameter A. The probability distribution --- 4642,4646 ---- ======================= ! - Function: double gsl_ran_cauchy (const gsl_rng * R, double A) This function returns a random variate from the Cauchy distribution with scale parameter A. The probability distribution *************** *** 4644,4648 **** ========================= ! - Random: double gsl_ran_rayleigh (const gsl_rng * R, double SIGMA) This function returns a random variate from the Rayleigh distribution with scale parameter SIGMA. The distribution is, --- 4672,4676 ---- ========================= ! - Function: double gsl_ran_rayleigh (const gsl_rng * R, double SIGMA) This function returns a random variate from the Rayleigh distribution with scale parameter SIGMA. The distribution is, *************** *** 4672,4676 **** ============================== ! - Random: double gsl_ran_rayleigh_tail (const gsl_rng * R, double A, double SIGMA) This function returns a random variate from the tail of the --- 4700,4704 ---- ============================== ! - Function: double gsl_ran_rayleigh_tail (const gsl_rng * R, double A, double SIGMA) This function returns a random variate from the tail of the *************** *** 4695,4699 **** ======================= ! - Random: double gsl_ran_landau (const gsl_rng * R) This function returns a random variate from the Landau distribution. The probability distribution for Landau random --- 4723,4727 ---- ======================= ! - Function: double gsl_ran_landau (const gsl_rng * R) This function returns a random variate from the Landau distribution. The probability distribution for Landau random *************** *** 4703,4706 **** --- 4731,4735 ---- For numerical purposes it is more convenient to use the following equivalent form of the integral, + p(x) = (1/\pi) \int_0^\infty dt \exp(-t \log(t) - x t) \sin(\pi t). *************** *** 4717,4721 **** =================================== ! - Random: double gsl_ran_levy (const gsl_rng * R, double C, double ALPHA) This function returns a random variate from the Levy symmetric --- 4746,4750 ---- =================================== ! - Function: double gsl_ran_levy (const gsl_rng * R, double C, double ALPHA) This function returns a random variate from the Levy symmetric *************** *** 4740,4744 **** ======================================= ! - Random: double gsl_ran_levy_skew (const gsl_rng * R, double C, double ALPHA, double BETA) This function returns a random variate from the Levy skew stable --- 4769,4773 ---- ======================================= ! - Function: double gsl_ran_levy_skew (const gsl_rng * R, double C, double ALPHA, double BETA) This function returns a random variate from the Levy skew stable *************** *** 4774,4778 **** ====================== ! - Random: double gsl_ran_gamma (const gsl_rng * R, double A, double B) This function returns a random variate from the gamma distribution. The distribution function is, --- 4803,4808 ---- ====================== ! - Function: double gsl_ran_gamma (const gsl_rng * R, double A, double ! B) This function returns a random variate from the gamma distribution. The distribution function is, *************** *** 4782,4785 **** --- 4812,4818 ---- for x > 0. + The gamma distribution with an integer parameter A is known as the + Erlang distribution. + - Function: double gsl_ran_gamma_pdf (double X, double A, double B) This function computes the probability density p(x) at X for a *************** *** 4802,4806 **** =============================== ! - Random: double gsl_ran_flat (const gsl_rng * R, double A, double B) This function returns a random variate from the flat (uniform) distribution from A to B. The distribution is, --- 4835,4839 ---- =============================== ! - Function: double gsl_ran_flat (const gsl_rng * R, double A, double B) This function returns a random variate from the flat (uniform) distribution from A to B. The distribution is, *************** *** 4829,4833 **** ========================== ! - Random: double gsl_ran_lognormal (const gsl_rng * R, double ZETA, double SIGMA) This function returns a random variate from the lognormal --- 4862,4866 ---- ========================== ! - Function: double gsl_ran_lognormal (const gsl_rng * R, double ZETA, double SIGMA) This function returns a random variate from the lognormal *************** *** 4871,4875 **** has a chi-squared distribution with n degrees of freedom. ! - Random: double gsl_ran_chisq (const gsl_rng * R, double NU) This function returns a random variate from the chi-squared distribution with NU degrees of freedom. The distribution function --- 4904,4908 ---- has a chi-squared distribution with n degrees of freedom. ! - Function: double gsl_ran_chisq (const gsl_rng * R, double NU) This function returns a random variate from the chi-squared distribution with NU degrees of freedom. The distribution function *************** *** 4908,4913 **** has an F-distribution F(x;\nu_1,\nu_2). ! - Random: double gsl_ran_fdist (const gsl_rng * R, double NU1, double ! NU2) This function returns a random variate from the F-distribution with degrees of freedom NU1 and NU2. The distribution function is, --- 4941,4946 ---- has an F-distribution F(x;\nu_1,\nu_2). ! - Function: double gsl_ran_fdist (const gsl_rng * R, double NU1, ! double NU2) This function returns a random variate from the F-distribution with degrees of freedom NU1 and NU2. The distribution function is, *************** *** 4947,4951 **** has a t-distribution t(x;\nu) with \nu degrees of freedom. ! - Random: double gsl_ran_tdist (const gsl_rng * R, double NU) This function returns a random variate from the t-distribution. The distribution function is, --- 4980,4984 ---- has a t-distribution t(x;\nu) with \nu degrees of freedom. ! - Function: double gsl_ran_tdist (const gsl_rng * R, double NU) This function returns a random variate from the t-distribution. The distribution function is, *************** *** 4976,4980 **** ===================== ! - Random: double gsl_ran_beta (const gsl_rng * R, double A, double B) This function returns a random variate from the beta distribution. The distribution function is, --- 5009,5013 ---- ===================== ! - Function: double gsl_ran_beta (const gsl_rng * R, double A, double B) This function returns a random variate from the beta distribution. The distribution function is, *************** *** 5001,5005 **** ========================= ! - Random: double gsl_ran_logistic (const gsl_rng * R, double A) This function returns a random variate from the logistic distribution. The distribution function is, --- 5034,5038 ---- ========================= ! - Function: double gsl_ran_logistic (const gsl_rng * R, double A) This function returns a random variate from the logistic distribution. The distribution function is, *************** *** 5029,5033 **** ======================= ! - Random: double gsl_ran_pareto (const gsl_rng * R, double A, double B) This function returns a random variate from the Pareto distribution of order A. The distribution function is, --- 5062,5067 ---- ======================= ! - Function: double gsl_ran_pareto (const gsl_rng * R, double A, double ! B) This function returns a random variate from the Pareto distribution of order A. The distribution function is, *************** *** 5061,5067 **** in the steps of a random walk. ! - Random: void gsl_ran_dir_2d (const gsl_rng * R, double *X, double *Y) ! - Random: void gsl_ran_dir_2d_trig_method (const gsl_rng * R, double ! *X, double *Y) This function returns a random direction vector v = (X,Y) in two dimensions. The vector is normalized such that |v|^2 = x^2 + y^2 --- 5095,5102 ---- in the steps of a random walk. ! - Function: void gsl_ran_dir_2d (const gsl_rng * R, double * X, double ! * Y) ! - Function: void gsl_ran_dir_2d_trig_method (const gsl_rng * R, double ! * X, double * Y) This function returns a random direction vector v = (X,Y) in two dimensions. The vector is normalized such that |v|^2 = x^2 + y^2 *************** *** 5081,5086 **** then x=(u^2-v^2)/(u^2+v^2) and y=2uv/(u^2+v^2). ! - Random: void gsl_ran_dir_3d (const gsl_rng * R, double *X, double ! *Y, double * Z) This function returns a random direction vector v = (X,Y,Z) in three dimensions. The vector is normalized such that |v|^2 = x^2 --- 5116,5121 ---- then x=(u^2-v^2)/(u^2+v^2) and y=2uv/(u^2+v^2). ! - Function: void gsl_ran_dir_3d (const gsl_rng * R, double * X, double ! * Y, double * Z) This function returns a random direction vector v = (X,Y,Z) in three dimensions. The vector is normalized such that |v|^2 = x^2 *************** *** 5090,5094 **** any axis is actually uniform (this is only true for 3 dimensions). ! - Random: void gsl_ran_dir_nd (const gsl_rng * R, size_t N, double *X) This function returns a random direction vector v = (x_1,x_2,...,x_n) in N dimensions. The vector is normalized such --- 5125,5130 ---- any axis is actually uniform (this is only true for 3 dimensions). ! - Function: void gsl_ran_dir_nd (const gsl_rng * R, size_t N, double * ! X) This function returns a random direction vector v = (x_1,x_2,...,x_n) in N dimensions. The vector is normalized such *************** *** 5106,5111 **** ======================== ! - Random: double gsl_ran_weibull (const gsl_rng * R, double A, double ! B) This function returns a random variate from the Weibull distribution. The distribution function is, --- 5142,5147 ---- ======================== ! - Function: double gsl_ran_weibull (const gsl_rng * R, double A, ! double B) This function returns a random variate from the Weibull distribution. The distribution function is, *************** *** 5135,5140 **** ============================== ! - Random: double gsl_ran_gumbel1 (const gsl_rng * R, double A, double ! B) This function returns a random variate from the Type-1 Gumbel distribution. The Type-1 Gumbel distribution function is, --- 5171,5176 ---- ============================== ! - Function: double gsl_ran_gumbel1 (const gsl_rng * R, double A, ! double B) This function returns a random variate from the Type-1 Gumbel distribution. The Type-1 Gumbel distribution function is, *************** *** 5164,5169 **** ============================== ! - Random: double gsl_ran_gumbel2 (const gsl_rng * R, double A, double ! B) This function returns a random variate from the Type-2 Gumbel distribution. The Type-2 Gumbel distribution function is, --- 5200,5205 ---- ============================== ! - Function: double gsl_ran_gumbel2 (const gsl_rng * R, double A, ! double B) This function returns a random variate from the Type-2 Gumbel distribution. The Type-2 Gumbel distribution function is, *************** *** 5193,5197 **** ========================== ! - Random: void gsl_ran_dirichlet (const gsl_rng * R, size_t K, const double ALPHA[], double THETA[]) This function returns an array of K random variates from a --- 5229,5233 ---- ========================== ! - Function: void gsl_ran_dirichlet (const gsl_rng * R, size_t K, const double ALPHA[], double THETA[]) This function returns an array of K random variates from a *************** *** 5283,5287 **** used as an argument for the `gsl_ran_discrete' function below. ! - Random: size_t gsl_ran_discrete (const gsl_rng * R, const gsl_ran_discrete_t * G) After the preprocessor, above, has been called, you use this --- 5319,5323 ---- used as an argument for the `gsl_ran_discrete' function below. ! - Function: size_t gsl_ran_discrete (const gsl_rng * R, const gsl_ran_discrete_t * G) After the preprocessor, above, has been called, you use this *************** *** 5305,5309 **** ======================== ! - Random: unsigned int gsl_ran_poisson (const gsl_rng * R, double MU) This function returns a random integer from the Poisson distribution with mean MU. The probability distribution for --- 5341,5345 ---- ======================== ! - Function: unsigned int gsl_ran_poisson (const gsl_rng * R, double MU) This function returns a random integer from the Poisson distribution with mean MU. The probability distribution for *************** *** 5325,5329 **** ========================== ! - Random: unsigned int gsl_ran_bernoulli (const gsl_rng * R, double P) This function returns either 0 or 1, the result of a Bernoulli trial with probability P. The probability distribution for a --- 5361,5366 ---- ========================== ! - Function: unsigned int gsl_ran_bernoulli (const gsl_rng * R, double ! P) This function returns either 0 or 1, the result of a Bernoulli trial with probability P. The probability distribution for a *************** *** 5346,5351 **** ========================= ! - Random: unsigned int gsl_ran_binomial (const gsl_rng * R, double P, ! unsigned int N) This function returns a random integer from the binomial distribution, the number of successes in N independent trials with --- 5383,5388 ---- ========================= ! - Function: unsigned int gsl_ran_binomial (const gsl_rng * R, double ! P, unsigned int N) This function returns a random integer from the binomial distribution, the number of successes in N independent trials with *************** *** 5370,5374 **** ============================ ! - Random: void gsl_ran_multinomial (const gsl_rng * R, size_t K, unsigned int N, const double P[], unsigned int N[]) This function returns an array of K random variates from a --- 5407,5411 ---- ============================ ! - Function: void gsl_ran_multinomial (const gsl_rng * R, size_t K, unsigned int N, const double P[], unsigned int N[]) This function returns an array of K random variates from a *************** *** 5407,5411 **** ================================== ! - Random: unsigned int gsl_ran_negative_binomial (const gsl_rng * R, double P, double N) This function returns a random integer from the negative binomial --- 5444,5448 ---- ================================== ! - Function: unsigned int gsl_ran_negative_binomial (const gsl_rng * R, double P, double N) This function returns a random integer from the negative binomial *************** *** 5431,5435 **** ======================= ! - Random: unsigned int gsl_ran_pascal (const gsl_rng * R, double P, unsigned int N) This function returns a random integer from the Pascal --- 5468,5472 ---- ======================= ! - Function: unsigned int gsl_ran_pascal (const gsl_rng * R, double P, unsigned int N) This function returns a random integer from the Pascal *************** *** 5454,5458 **** ========================== ! - Random: unsigned int gsl_ran_geometric (const gsl_rng * R, double P) This function returns a random integer from the geometric distribution, the number of independent trials with probability P --- 5491,5496 ---- ========================== ! - Function: unsigned int gsl_ran_geometric (const gsl_rng * R, double ! P) This function returns a random integer from the geometric distribution, the number of independent trials with probability P *************** *** 5476,5480 **** =============================== ! - Random: unsigned int gsl_ran_hypergeometric (const gsl_rng * R, unsigned int N1, unsigned int N2, unsigned int T) This function returns a random integer from the hypergeometric --- 5514,5518 ---- =============================== ! - Function: unsigned int gsl_ran_hypergeometric (const gsl_rng * R, unsigned int N1, unsigned int N2, unsigned int T) This function returns a random integer from the hypergeometric *************** *** 5500,5505 **** ============================ ! - Random: unsigned int gsl_ran_logarithmic (const gsl_rng * R, double ! P) This function returns a random integer from the logarithmic distribution. The probability distribution for logarithmic random --- 5538,5543 ---- ============================ ! - Function: unsigned int gsl_ran_logarithmic (const gsl_rng * R, ! double P) This function returns a random integer from the logarithmic distribution. The probability distribution for logarithmic random *************** *** 5529,5534 **** 3.4.2, "Random Sampling and Shuffling". ! - Random: void gsl_ran_shuffle (const gsl_rng * R, void * BASE, size_t ! N, size_t SIZE) This function randomly shuffles the order of N objects, each of size SIZE, stored in the array BASE[0..N-1]. The output of the --- 5567,5572 ---- 3.4.2, "Random Sampling and Shuffling". ! - Function: void gsl_ran_shuffle (const gsl_rng * R, void * BASE, ! size_t N, size_t SIZE) This function randomly shuffles the order of N objects, each of size SIZE, stored in the array BASE[0..N-1]. The output of the *************** *** 5549,5553 **** ! - Random: int gsl_ran_choose (const gsl_rng * R, void * DEST, size_t K, void * SRC, size_t N, size_t SIZE) This function fills the array DEST[k] with K objects taken --- 5587,5591 ---- ! - Function: int gsl_ran_choose (const gsl_rng * R, void * DEST, size_t K, void * SRC, size_t N, size_t SIZE) This function fills the array DEST[k] with K objects taken *************** *** 5577,5582 **** ! - Random: void gsl_ran_sample (const gsl_rng * R, void * DEST, size_t ! K, void * SRC, size_t N, size_t SIZE) This function is like `gsl_ran_choose' but samples K items from the original array of N items SRC with replacement, so the same --- 5615,5620 ---- ! - Function: void gsl_ran_sample (const gsl_rng * R, void * DEST, ! size_t K, void * SRC, size_t N, size_t SIZE) This function is like `gsl_ran_choose' but samples K items from the original array of N items SRC with replacement, so the same *************** *** 5632,5636 **** default location) then the program can be compiled with these options, ! gcc demo.c -lgsl -lgslcblas -lm Here is the output of the program, --- 5670,5674 ---- default location) then the program can be compiled with these options, ! $ gcc -Wall demo.c -lgsl -lgslcblas -lm Here is the output of the program, *************** *** 5680,5686 **** } ! Example output from the program, three 10-step random walks from the ! origin. ! The following program computes the upper and lower cumulative --- 5718,5723 ---- } ! Here is the output from the program, three 10-step random walks from ! the origin, The following program computes the upper and lower cumulative *************** *** 5787,5791 **** floating-point data have the prefix `gsl_stats' and are declared in the header file `gsl_statistics_double.h'. The versions for integer data ! have the prefix `gsl_stats_int' and are declared in the header files `gsl_statistics_int.h'. --- 5824,5828 ---- floating-point data have the prefix `gsl_stats' and are declared in the header file `gsl_statistics_double.h'. The versions for integer data ! have the prefix `gsl_stats_int' and are declared in the header file `gsl_statistics_int.h'. *************** *** 5809,5814 **** ===================================== ! - Statistics: double gsl_stats_mean (const double DATA[], size_t ! STRIDE, size_t N) This function returns the arithmetic mean of DATA, a dataset of length N with stride STRIDE. The arithmetic mean, or "sample --- 5846,5851 ---- ===================================== ! - Function: double gsl_stats_mean (const double DATA[], size_t STRIDE, ! size_t N) This function returns the arithmetic mean of DATA, a dataset of length N with stride STRIDE. The arithmetic mean, or "sample *************** *** 5821,5825 **** N. ! - Statistics: double gsl_stats_variance (const double DATA[], size_t STRIDE, size_t N) This function returns the estimated, or "sample", variance of --- 5858,5862 ---- N. ! - Function: double gsl_stats_variance (const double DATA[], size_t STRIDE, size_t N) This function returns the estimated, or "sample", variance of *************** *** 5839,5843 **** `gsl_stats_variance_m'. ! - Statistics: double gsl_stats_variance_m (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function returns the sample variance of DATA relative to the --- 5876,5880 ---- `gsl_stats_variance_m'. ! - Function: double gsl_stats_variance_m (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function returns the sample variance of DATA relative to the *************** *** 5847,5859 **** \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2 ! - Statistics: double gsl_stats_sd (const double DATA[], size_t STRIDE, size_t N) ! - Statistics: double gsl_stats_sd_m (const double DATA[], size_t ! STRIDE, size_t N, double MEAN) The standard deviation is defined as the square root of the variance. These functions return the square root of the corresponding variance functions above. ! - Statistics: double gsl_stats_variance_with_fixed_mean (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function computes an unbiased estimate of the variance of --- 5884,5896 ---- \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2 ! - Function: double gsl_stats_sd (const double DATA[], size_t STRIDE, size_t N) ! - Function: double gsl_stats_sd_m (const double DATA[], size_t STRIDE, ! size_t N, double MEAN) The standard deviation is defined as the square root of the variance. These functions return the square root of the corresponding variance functions above. ! - Function: double gsl_stats_variance_with_fixed_mean (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function computes an unbiased estimate of the variance of *************** *** 5865,5871 **** \Hat\sigma^2 = (1/N) \sum (x_i - \mu)^2 ! ! - Statistics: double gsl_stats_sd_with_fixed_mean (const double ! DATA[], size_t STRIDE, size_t N, double MEAN) This function calculates the standard deviation of DATA for a fixed population mean MEAN. The result is the square root of the --- 5902,5907 ---- \Hat\sigma^2 = (1/N) \sum (x_i - \mu)^2 ! - Function: double gsl_stats_sd_with_fixed_mean (const double DATA[], ! size_t STRIDE, size_t N, double MEAN) This function calculates the standard deviation of DATA for a fixed population mean MEAN. The result is the square root of the *************** *** 5878,5882 **** ================== ! - Statistics: double gsl_stats_absdev (const double DATA[], size_t STRIDE, size_t N) This function computes the absolute deviation from the mean of --- 5914,5918 ---- ================== ! - Function: double gsl_stats_absdev (const double DATA[], size_t STRIDE, size_t N) This function computes the absolute deviation from the mean of *************** *** 5891,5895 **** the mean of DATA via a call to `gsl_stats_mean'. ! - Statistics: double gsl_stats_absdev_m (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function computes the absolute deviation of the dataset DATA --- 5927,5931 ---- the mean of DATA via a call to `gsl_stats_mean'. ! - Function: double gsl_stats_absdev_m (const double DATA[], size_t STRIDE, size_t N, double MEAN) This function computes the absolute deviation of the dataset DATA *************** *** 5909,5914 **** ====================================== ! - Statistics: double gsl_stats_skew (const double DATA[], size_t ! STRIDE, size_t N) This function computes the skewness of DATA, a dataset of length N with stride STRIDE. The skewness is defined as, --- 5945,5950 ---- ====================================== ! - Function: double gsl_stats_skew (const double DATA[], size_t STRIDE, ! size_t N) This function computes the skewness of DATA, a dataset of length N with stride STRIDE. The skewness is defined as, *************** *** 5922,5926 **** DATA via calls to `gsl_stats_mean' and `gsl_stats_sd'. ! - Statistics: double gsl_stats_skew_m_sd (const double DATA[], size_t STRIDE, size_t N, double MEAN, double SD) This function computes the skewness of the dataset DATA using the --- 5958,5962 ---- DATA via calls to `gsl_stats_mean' and `gsl_stats_sd'. ! - Function: double gsl_stats_skew_m_sd (const double DATA[], size_t STRIDE, size_t N, double MEAN, double SD) This function computes the skewness of the dataset DATA using the *************** *** 5932,5936 **** and standard deviation of DATA and want to avoid recomputing them. ! - Statistics: double gsl_stats_kurtosis (const double DATA[], size_t STRIDE, size_t N) This function computes the kurtosis of DATA, a dataset of length N --- 5968,5972 ---- and standard deviation of DATA and want to avoid recomputing them. ! - Function: double gsl_stats_kurtosis (const double DATA[], size_t STRIDE, size_t N) This function computes the kurtosis of DATA, a dataset of length N *************** *** 5943,5947 **** gaussian distribution. ! - Statistics: double gsl_stats_kurtosis_m_sd (const double DATA[], size_t STRIDE, size_t N, double MEAN, double SD) This function computes the kurtosis of the dataset DATA using the --- 5979,5983 ---- gaussian distribution. ! - Function: double gsl_stats_kurtosis_m_sd (const double DATA[], size_t STRIDE, size_t N, double MEAN, double SD) This function computes the kurtosis of the dataset DATA using the *************** *** 5968,5972 **** \sum_{i = 1}^{n} (x_{i} - \Hat\mu) (x_{i} - \Hat\mu)} - - Function: double gsl_stats_lag1_autocorrelation_m (const double DATA[], const size_t STRIDE, const size_t N, const double --- 6004,6007 ---- *************** *** 5990,5994 **** covar = (1/(n - 1)) \sum_{i = 1}^{n} (x_i - \Hat x) (y_i - \Hat y) - - Function: double gsl_stats_covariance_m (const double DATA1[], const size_t STRIDE1, const double DATA2[], const size_t N, const --- 6025,6028 ---- *************** *** 6013,6018 **** zero corresponds to removing a sample from a dataset. ! - Statistics: double gsl_stats_wmean (const double W[], size_t ! WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function returns the weighted mean of the dataset DATA with stride STRIDE and length N, using the set of weights W with stride --- 6047,6052 ---- zero corresponds to removing a sample from a dataset. ! - Function: double gsl_stats_wmean (const double W[], size_t WSTRIDE, ! const double DATA[], size_t STRIDE, size_t N) This function returns the weighted mean of the dataset DATA with stride STRIDE and length N, using the set of weights W with stride *************** *** 6021,6025 **** \Hat\mu = (\sum w_i x_i) / (\sum w_i) ! - Statistics: double gsl_stats_wvariance (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function returns the estimated variance of the dataset DATA --- 6055,6059 ---- \Hat\mu = (\sum w_i x_i) / (\sum w_i) ! - Function: double gsl_stats_wvariance (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function returns the estimated variance of the dataset DATA *************** *** 6035,6039 **** weights. ! - Statistics: double gsl_stats_wvariance_m (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN) --- 6069,6073 ---- weights. ! - Function: double gsl_stats_wvariance_m (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN) *************** *** 6041,6045 **** dataset DATA using the given weighted mean WMEAN. ! - Statistics: double gsl_stats_wsd (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) The standard deviation is defined as the square root of the --- 6075,6079 ---- dataset DATA using the given weighted mean WMEAN. ! - Function: double gsl_stats_wsd (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) The standard deviation is defined as the square root of the *************** *** 6047,6057 **** corresponding variance function `gsl_stats_wvariance' above. ! - Statistics: double gsl_stats_wsd_m (const double W[], size_t ! WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double ! WMEAN) This function returns the square root of the corresponding variance function `gsl_stats_wvariance_m' above. ! - Statistics: double gsl_stats_wvariance_with_fixed_mean (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, const double MEAN) --- 6081,6090 ---- corresponding variance function `gsl_stats_wvariance' above. ! - Function: double gsl_stats_wsd_m (const double W[], size_t WSTRIDE, ! const double DATA[], size_t STRIDE, size_t N, double WMEAN) This function returns the square root of the corresponding variance function `gsl_stats_wvariance_m' above. ! - Function: double gsl_stats_wvariance_with_fixed_mean (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, const double MEAN) *************** *** 6064,6068 **** \Hat\sigma^2 = (\sum w_i (x_i - \mu)^2) / (\sum w_i) ! - Statistics: double gsl_stats_wsd_with_fixed_mean (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, const double MEAN) --- 6097,6101 ---- \Hat\sigma^2 = (\sum w_i (x_i - \mu)^2) / (\sum w_i) ! - Function: double gsl_stats_wsd_with_fixed_mean (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, const double MEAN) *************** *** 6071,6075 **** corresponding variance function above. ! - Statistics: double gsl_stats_wabsdev (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function computes the weighted absolute deviation from the --- 6104,6108 ---- corresponding variance function above. ! - Function: double gsl_stats_wabsdev (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function computes the weighted absolute deviation from the *************** *** 6079,6083 **** absdev = (\sum w_i |x_i - \Hat\mu|) / (\sum w_i) ! - Statistics: double gsl_stats_wabsdev_m (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN) --- 6112,6116 ---- absdev = (\sum w_i |x_i - \Hat\mu|) / (\sum w_i) ! - Function: double gsl_stats_wabsdev_m (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN) *************** *** 6085,6095 **** dataset DATA about the given weighted mean WMEAN. ! - Statistics: double gsl_stats_wskew (const double W[], size_t ! WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function computes the weighted skewness of the dataset DATA. skew = (\sum w_i ((x_i - xbar)/\sigma)^3) / (\sum w_i) ! - Statistics: double gsl_stats_wskew_m_sd (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN, double WSD) --- 6118,6128 ---- dataset DATA about the given weighted mean WMEAN. ! - Function: double gsl_stats_wskew (const double W[], size_t WSTRIDE, ! const double DATA[], size_t STRIDE, size_t N) This function computes the weighted skewness of the dataset DATA. skew = (\sum w_i ((x_i - xbar)/\sigma)^3) / (\sum w_i) ! - Function: double gsl_stats_wskew_m_sd (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double WMEAN, double WSD) *************** *** 6098,6109 **** deviation, WMEAN and WSD. ! - Statistics: double gsl_stats_wkurtosis (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function computes the weighted kurtosis of the dataset DATA. kurtosis = ((\sum w_i ((x_i - xbar)/sigma)^4) / (\sum w_i)) - 3 ! - Statistics: double gsl_stats_wkurtosis_m_sd (const double W[], ! size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N, ! double WMEAN, double WSD) This function computes the weighted kurtosis of the dataset DATA using the given values of the weighted mean and weighted standard --- 6131,6143 ---- deviation, WMEAN and WSD. ! - Function: double gsl_stats_wkurtosis (const double W[], size_t WSTRIDE, const double DATA[], size_t STRIDE, size_t N) This function computes the weighted kurtosis of the dataset DATA. + kurtosis = ((\sum w_i ((x_i - xbar)/sigma)^4) / (\sum w_i)) - 3 ! - Function: double gsl_stats_wkurtosis_m_sd (const double W[], size_t ! WSTRIDE, const double DATA[], size_t STRIDE, size_t N, double ! WMEAN, double WSD) This function computes the weighted kurtosis of the dataset DATA using the given values of the weighted mean and weighted standard *************** *** 6116,6121 **** ========================== ! - Statistics: double gsl_stats_max (const double DATA[], size_t ! STRIDE, size_t N) This function returns the maximum value in DATA, a dataset of length N with stride STRIDE. The maximum value is defined as the --- 6150,6155 ---- ========================== ! - Function: double gsl_stats_max (const double DATA[], size_t STRIDE, ! size_t N) This function returns the maximum value in DATA, a dataset of length N with stride STRIDE. The maximum value is defined as the *************** *** 6126,6131 **** before calling this function. ! - Statistics: double gsl_stats_min (const double DATA[], size_t ! STRIDE, size_t N) This function returns the minimum value in DATA, a dataset of length N with stride STRIDE. The minimum value is defined as the --- 6160,6165 ---- before calling this function. ! - Function: double gsl_stats_min (const double DATA[], size_t STRIDE, ! size_t N) This function returns the minimum value in DATA, a dataset of length N with stride STRIDE. The minimum value is defined as the *************** *** 6136,6145 **** before calling this function. ! - Statistics: void gsl_stats_minmax (double * MIN, double * MAX, const double DATA[], size_t STRIDE, size_t N) This function finds both the minimum and maximum values MIN, MAX in DATA in a single pass. ! - Statistics: size_t gsl_stats_max_index (const double DATA[], size_t STRIDE, size_t N) This function returns the index of the maximum value in DATA, a --- 6170,6179 ---- before calling this function. ! - Function: void gsl_stats_minmax (double * MIN, double * MAX, const double DATA[], size_t STRIDE, size_t N) This function finds both the minimum and maximum values MIN, MAX in DATA in a single pass. ! - Function: size_t gsl_stats_max_index (const double DATA[], size_t STRIDE, size_t N) This function returns the index of the maximum value in DATA, a *************** *** 6149,6153 **** first one is chosen. ! - Statistics: size_t gsl_stats_min_index (const double DATA[], size_t STRIDE, size_t N) This function returns the index of the minimum value in DATA, a --- 6183,6187 ---- first one is chosen. ! - Function: size_t gsl_stats_min_index (const double DATA[], size_t STRIDE, size_t N) This function returns the index of the minimum value in DATA, a *************** *** 6157,6162 **** first one is chosen. ! - Statistics: void gsl_stats_minmax_index (size_t * MIN_INDEX, size_t ! * MAX_INDEX, const double DATA[], size_t STRIDE, size_t N) This function returns the indexes MIN_INDEX, MAX_INDEX of the minimum and maximum values in DATA in a single pass. --- 6191,6196 ---- first one is chosen. ! - Function: void gsl_stats_minmax_index (size_t * MIN_INDEX, size_t * ! MAX_INDEX, const double DATA[], size_t STRIDE, size_t N) This function returns the indexes MIN_INDEX, MAX_INDEX of the minimum and maximum values in DATA in a single pass. *************** *** 6172,6176 **** of 0 to 1, instead of percentiles (which use a scale of 0 to 100). ! - Statistics: double gsl_stats_median_from_sorted_data (const double SORTED_DATA[], size_t STRIDE, size_t N) This function returns the median value of SORTED_DATA, a dataset --- 6206,6210 ---- of 0 to 1, instead of percentiles (which use a scale of 0 to 100). ! - Function: double gsl_stats_median_from_sorted_data (const double SORTED_DATA[], size_t STRIDE, size_t N) This function returns the median value of SORTED_DATA, a dataset *************** *** 6187,6191 **** floating-point number, even for integer data types. ! - Statistics: double gsl_stats_quantile_from_sorted_data (const double SORTED_DATA[], size_t STRIDE, size_t N, double F) This function returns a quantile value of SORTED_DATA, a --- 6221,6225 ---- floating-point number, even for integer data types. ! - Function: double gsl_stats_quantile_from_sorted_data (const double SORTED_DATA[], size_t STRIDE, size_t N, double F) This function returns a quantile value of SORTED_DATA, a *************** *** 6326,6330 **** Review D54, 1 (1996) ! The Review of Particle Physics is available online at `http://pdg.lbl.gov/'. --- 6360,6364 ---- Review D54, 1 (1996) ! The Review of Particle Physics is available online at the website `http://pdg.lbl.gov/'. *************** *** 6402,6406 **** lower end and exclusive at the upper end. Mathematically this means that the bins are defined by the following inequality, - bin[i] corresponds to range[i] <= x < range[i+1] --- 6436,6439 ---- *************** *** 6409,6423 **** ! [ bin[0] )[ bin[1] )[ bin[2] )[ bin[3] )[ bin[5] ) ---|---------|---------|---------|---------|---------|--- x r[0] r[1] r[2] r[3] r[4] r[5] In this picture the values of the RANGE array are denoted by r. On the ! left-hand side of each bin the square bracket "`['" denotes an ! inclusive lower bound (r <= x), and the round parentheses "`)'" on the ! right-hand side denote an exclusive upper bound (x < r). Thus any ! samples which fall on the upper end of the histogram are excluded. If ! you want to include this value for the last bin you will need to add an ! extra bin to your histogram. The `gsl_histogram' struct and its associated functions are defined --- 6442,6456 ---- ! [ bin[0] )[ bin[1] )[ bin[2] )[ bin[3] )[ bin[4] ) ---|---------|---------|---------|---------|---------|--- x r[0] r[1] r[2] r[3] r[4] r[5] In this picture the values of the RANGE array are denoted by r. On the ! left-hand side of each bin the square bracket `[' denotes an inclusive ! lower bound (r <= x), and the round parentheses `)' on the right-hand ! side denote an exclusive upper bound (x < r). Thus any samples which ! fall on the upper end of the histogram are excluded. If you want to ! include this value for the last bin you will need to add an extra bin ! to your histogram. The `gsl_histogram' struct and its associated functions are defined *************** *** 6478,6482 **** bins are reset to zero. The bin ranges are shown in the table below, - bin[0] corresponds to xmin <= x < xmin + d bin[1] corresponds to xmin + d <= x < xmin + 2 d --- 6511,6514 ---- *************** *** 6637,6659 **** ==================== ! - Function: int gsl_histogram_equal_bins_p (const gsl_histogram *H1, ! const gsl_histogram *H2) This function returns 1 if the all of the individual bin ranges of the two histograms are identical, and 0 otherwise. ! - Function: int gsl_histogram_add (gsl_histogram *H1, const ! gsl_histogram *H2) This function adds the contents of the bins in histogram H2 to the corresponding bins of histogram H1, i.e. h'_1(i) = h_1(i) + h_2(i). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram_sub (gsl_histogram *H1, const ! gsl_histogram *H2) This function subtracts the contents of the bins in histogram H2 from the corresponding bins of histogram H1, i.e. h'_1(i) = h_1(i) - h_2(i). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram_mul (gsl_histogram *H1, const ! gsl_histogram *H2) This function multiplies the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. --- 6669,6691 ---- ==================== ! - Function: int gsl_histogram_equal_bins_p (const gsl_histogram * H1, ! const gsl_histogram * H2) This function returns 1 if the all of the individual bin ranges of the two histograms are identical, and 0 otherwise. ! - Function: int gsl_histogram_add (gsl_histogram * H1, const ! gsl_histogram * H2) This function adds the contents of the bins in histogram H2 to the corresponding bins of histogram H1, i.e. h'_1(i) = h_1(i) + h_2(i). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram_sub (gsl_histogram * H1, const ! gsl_histogram * H2) This function subtracts the contents of the bins in histogram H2 from the corresponding bins of histogram H1, i.e. h'_1(i) = h_1(i) - h_2(i). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram_mul (gsl_histogram * H1, const ! gsl_histogram * H2) This function multiplies the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. *************** *** 6661,6666 **** bin ranges. ! - Function: int gsl_histogram_div (gsl_histogram *H1, const ! gsl_histogram *H2) This function divides the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. --- 6693,6698 ---- bin ranges. ! - Function: int gsl_histogram_div (gsl_histogram * H1, const ! gsl_histogram * H2) This function divides the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. *************** *** 6668,6676 **** bin ranges. ! - Function: int gsl_histogram_scale (gsl_histogram *H, double SCALE) This function multiplies the contents of the bins of histogram H by the constant SCALE, i.e. h'_1(i) = h_1(i) * scale. ! - Function: int gsl_histogram_shift (gsl_histogram *H, double OFFSET) This function shifts the contents of the bins of histogram H by the constant OFFSET, i.e. h'_1(i) = h_1(i) + offset. --- 6700,6708 ---- bin ranges. ! - Function: int gsl_histogram_scale (gsl_histogram * H, double SCALE) This function multiplies the contents of the bins of histogram H by the constant SCALE, i.e. h'_1(i) = h_1(i) * scale. ! - Function: int gsl_histogram_shift (gsl_histogram * H, double OFFSET) This function shifts the contents of the bins of histogram H by the constant OFFSET, i.e. h'_1(i) = h_1(i) + offset. *************** *** 6858,6864 **** { double x; - gsl_histogram * h = gsl_histogram_alloc (n); - gsl_histogram_set_ranges_uniform (h, a, b); --- 6890,6894 ---- *************** *** 6867,6876 **** gsl_histogram_increment (h, x); } - gsl_histogram_fprintf (stdout, h, "%g", "%g"); - gsl_histogram_free (h); } - exit (0); } --- 6897,6903 ---- *************** *** 6924,6928 **** `double * yrange' The ranges of the bins in the y-direction are stored in an ! array of NY + 1 pointed to by YRANGE. `double * bin' --- 6951,6955 ---- `double * yrange' The ranges of the bins in the y-direction are stored in an ! array of NY + 1 elements pointed to by YRANGE. `double * bin' *************** *** 6939,6943 **** Mathematically this means that the bins are defined by the following inequality, - bin(i,j) corresponds to xrange[i] <= x < xrange[i+1] and yrange[j] <= y < yrange[j+1] --- 6966,6969 ---- diff -rc2P gsl-1.6/doc/gsl-ref.info-3 gsl-1.7/doc/gsl-ref.info-3 *** gsl-1.6/doc/gsl-ref.info-3 Fri Dec 31 15:30:03 2004 --- gsl-1.7/doc/gsl-ref.info-3 Tue Sep 13 10:18:36 2005 *************** *** 40,44 **** - Function: double gsl_histogram2d_get (const gsl_histogram2d * H, size_t I, size_t J) ! This function returns the contents of the (I,J)th bin of the histogram H. If (I,J) lies outside the valid range of indices for the histogram then the error handler is called with an error code --- 40,44 ---- - Function: double gsl_histogram2d_get (const gsl_histogram2d * H, size_t I, size_t J) ! This function returns the contents of the (I,J)-th bin of the histogram H. If (I,J) lies outside the valid range of indices for the histogram then the error handler is called with an error code *************** *** 87,91 **** This function finds and sets the indices I and J to the to the bin which covers the coordinates (X,Y). The bin is located using a ! binary search. The search includes an optimization for histogram with uniform ranges, and will return the correct bin immediately in this case. If (x,y) is found then the function sets the indices --- 87,91 ---- This function finds and sets the indices I and J to the to the bin which covers the coordinates (X,Y). The bin is located using a ! binary search. The search includes an optimization for histograms with uniform ranges, and will return the correct bin immediately in this case. If (x,y) is found then the function sets the indices *************** *** 106,112 **** - Function: void gsl_histogram2d_max_bin (const gsl_histogram2d * H, size_t * I, size_t * J) ! This function returns the indices (I,J) of the bin containing the ! maximum value in the histogram H. In the case where several bins ! contain the same maximum value the first bin found is returned. - Function: double gsl_histogram2d_min_val (const gsl_histogram2d * H) --- 106,113 ---- - Function: void gsl_histogram2d_max_bin (const gsl_histogram2d * H, size_t * I, size_t * J) ! This function finds the indices of the bin containing the maximum ! value in the histogram H and stores the result in (I,J). In the ! case where several bins contain the same maximum value the first ! bin found is returned. - Function: double gsl_histogram2d_min_val (const gsl_histogram2d * H) *************** *** 116,122 **** - Function: void gsl_histogram2d_min_bin (const gsl_histogram2d * H, size_t * I, size_t * J) ! This function returns the indices (I,J) of the bin containing the ! minimum value in the histogram H. In the case where several bins ! contain the same maximum value the first bin found is returned. - Function: double gsl_histogram2d_xmean (const gsl_histogram2d * H) --- 117,124 ---- - Function: void gsl_histogram2d_min_bin (const gsl_histogram2d * H, size_t * I, size_t * J) ! This function finds the indices of the bin containing the minimum ! value in the histogram H and stores the result in (I,J). In the ! case where several bins contain the same maximum value the first ! bin found is returned. - Function: double gsl_histogram2d_xmean (const gsl_histogram2d * H) *************** *** 160,176 **** ======================= ! - Function: int gsl_histogram2d_equal_bins_p (const gsl_histogram2d ! *H1, const gsl_histogram2d *H2) ! This function returns 1 if the all of the individual bin ranges of ! the two histograms are identical, and 0 otherwise. ! - Function: int gsl_histogram2d_add (gsl_histogram2d *H1, const ! gsl_histogram2d *H2) This function adds the contents of the bins in histogram H2 to the corresponding bins of histogram H1, i.e. h'_1(i,j) = h_1(i,j) + h_2(i,j). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram2d_sub (gsl_histogram2d *H1, const ! gsl_histogram2d *H2) This function subtracts the contents of the bins in histogram H2 from the corresponding bins of histogram H1, i.e. h'_1(i,j) = --- 162,178 ---- ======================= ! - Function: int gsl_histogram2d_equal_bins_p (const gsl_histogram2d * ! H1, const gsl_histogram2d * H2) ! This function returns 1 if all the individual bin ranges of the two ! histograms are identical, and 0 otherwise. ! - Function: int gsl_histogram2d_add (gsl_histogram2d * H1, const ! gsl_histogram2d * H2) This function adds the contents of the bins in histogram H2 to the corresponding bins of histogram H1, i.e. h'_1(i,j) = h_1(i,j) + h_2(i,j). The two histograms must have identical bin ranges. ! - Function: int gsl_histogram2d_sub (gsl_histogram2d * H1, const ! gsl_histogram2d * H2) This function subtracts the contents of the bins in histogram H2 from the corresponding bins of histogram H1, i.e. h'_1(i,j) = *************** *** 178,183 **** ranges. ! - Function: int gsl_histogram2d_mul (gsl_histogram2d *H1, const ! gsl_histogram2d *H2) This function multiplies the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. --- 180,185 ---- ranges. ! - Function: int gsl_histogram2d_mul (gsl_histogram2d * H1, const ! gsl_histogram2d * H2) This function multiplies the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. *************** *** 185,190 **** identical bin ranges. ! - Function: int gsl_histogram2d_div (gsl_histogram2d *H1, const ! gsl_histogram2d *H2) This function divides the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. --- 187,192 ---- identical bin ranges. ! - Function: int gsl_histogram2d_div (gsl_histogram2d * H1, const ! gsl_histogram2d * H2) This function divides the contents of the bins of histogram H1 by the contents of the corresponding bins in histogram H2, i.e. *************** *** 192,201 **** identical bin ranges. ! - Function: int gsl_histogram2d_scale (gsl_histogram2d *H, double SCALE) This function multiplies the contents of the bins of histogram H by the constant SCALE, i.e. h'_1(i,j) = h_1(i,j) scale. ! - Function: int gsl_histogram2d_shift (gsl_histogram2d *H, double OFFSET) This function shifts the contents of the bins of histogram H by --- 194,203 ---- identical bin ranges. ! - Function: int gsl_histogram2d_scale (gsl_histogram2d * H, double SCALE) This function multiplies the contents of the bins of histogram H by the constant SCALE, i.e. h'_1(i,j) = h_1(i,j) scale. ! - Function: int gsl_histogram2d_shift (gsl_histogram2d * H, double OFFSET) This function shifts the contents of the bins of histogram H by *************** *** 558,563 **** - Function: int gsl_ntuple_project (gsl_histogram * H, gsl_ntuple * ! NTUPLE, gsl_ntuple_value_fn *VALUE_FUNC, gsl_ntuple_select_fn ! *SELECT_FUNC) This function updates the histogram H from the ntuple NTUPLE using the functions VALUE_FUNC and SELECT_FUNC. For each ntuple row --- 560,565 ---- - Function: int gsl_ntuple_project (gsl_histogram * H, gsl_ntuple * ! NTUPLE, gsl_ntuple_value_fn * VALUE_FUNC, ! gsl_ntuple_select_fn * SELECT_FUNC) This function updates the histogram H from the ntuple NTUPLE using the functions VALUE_FUNC and SELECT_FUNC. For each ntuple row *************** *** 730,734 **** number of function calls. The routines also provide a statistical estimate of the error on the result. This error estimate should be ! taken as a guide rather than as a strict error bound -- random sampling of the region may not uncover all the important features of the function, resulting in an underestimate of the error. --- 732,736 ---- number of function calls. The routines also provide a statistical estimate of the error on the result. This error estimate should be ! taken as a guide rather than as a strict error bound--random sampling of the region may not uncover all the important features of the function, resulting in an underestimate of the error. *************** *** 778,782 **** `double (* f) (double * X, size_t DIM, void * PARAMS)' ! this function should return the value f(x,params) for argument X and parameters PARAMS, where X is an array of size DIM giving the coordinates of the point where the function is --- 780,784 ---- `double (* f) (double * X, size_t DIM, void * PARAMS)' ! this function should return the value f(x,params) for the argument X and parameters PARAMS, where X is an array of size DIM giving the coordinates of the point where the function is *************** *** 844,852 **** \sigma^2 (E; N) = (V / N) \sum_i^N (f(x_i) - )^2. ! For large N this variance decreases asymptotically as var(f)/N, where ! var(f) is the true variance of the function over the integration region. The error estimate itself should decrease as \sigma(f)/\sqrt{N}. The familiar law of errors decreasing as ! 1/\sqrt{N} applies -- to reduce the error by a factor of 10 requires a 100-fold increase in the number of sample points. --- 846,854 ---- \sigma^2 (E; N) = (V / N) \sum_i^N (f(x_i) - )^2. ! For large N this variance decreases asymptotically as \Var(f)/N, where ! \Var(f) is the true variance of the function over the integration region. The error estimate itself should decrease as \sigma(f)/\sqrt{N}. The familiar law of errors decreasing as ! 1/\sqrt{N} applies--to reduce the error by a factor of 10 requires a 100-fold increase in the number of sample points. *************** *** 894,901 **** two disjoint regions a and b with Monte Carlo estimates of the integral E_a(f) and E_b(f) and variances \sigma_a^2(f) and \sigma_b^2(f), the ! variance Var(f) of the combined estimate E(f) = (1/2) (E_a(f) + E_b(f)) is given by, ! Var(f) = (\sigma_a^2(f) / 4 N_a) + (\sigma_b^2(f) / 4 N_b). It can be shown that this variance is minimized by distributing the --- 896,903 ---- two disjoint regions a and b with Monte Carlo estimates of the integral E_a(f) and E_b(f) and variances \sigma_a^2(f) and \sigma_b^2(f), the ! variance \Var(f) of the combined estimate E(f) = (1/2) (E_a(f) + E_b(f)) is given by, ! \Var(f) = (\sigma_a^2(f) / 4 N_a) + (\sigma_b^2(f) / 4 N_b). It can be shown that this variance is minimized by distributing the *************** *** 987,991 **** variance to depend on a scaling parameter \alpha, ! Var(f) = {\sigma_a \over N_a^\alpha} + {\sigma_b \over N_b^\alpha}. The authors of the original paper describing MISER recommend the --- 989,993 ---- variance to depend on a scaling parameter \alpha, ! \Var(f) = {\sigma_a \over N_a^\alpha} + {\sigma_b \over N_b^\alpha}. The authors of the original paper describing MISER recommend the *************** *** 1000,1004 **** center of the hypercubic integration region. The default value of dither is zero, so no variation is introduced. If needed, a ! typical value of DITHER is around 0.1.  --- 1002,1006 ---- center of the hypercubic integration region. The default value of dither is zero, so no variation is introduced. If needed, a ! typical value of DITHER is 0.1.  *************** *** 1021,1025 **** with a corresponding variance, ! Var_g(f; N) = Var(f/g; N). If the probability distribution is chosen as g = |f|/I(|f|) then it can --- 1023,1027 ---- with a corresponding variance, ! \Var_g(f; N) = \Var(f/g; N). If the probability distribution is chosen as g = |f|/I(|f|) then it can *************** *** 1049,1054 **** divided into a number of "boxes", with each box getting a fixed number of points (the goal is 2). Each box can then have a fractional number ! of bins, but if bins/box is less than two, Vegas switches to a kind ! variance reduction (rather than importance sampling). - Function: gsl_monte_vegas_state * gsl_monte_vegas_alloc (size_t DIM) --- 1051,1056 ---- divided into a number of "boxes", with each box getting a fixed number of points (the goal is 2). Each box can then have a fractional number ! of bins, but if the ratio of bins-per-box is less than two, Vegas ! switches to a kind variance reduction (rather than importance sampling). - Function: gsl_monte_vegas_state * gsl_monte_vegas_alloc (size_t DIM) *************** *** 1352,1356 **** ============================== ! The MISER algorithm is described in the following article, W.H. Press, G.R. Farrar, `Recursive Stratified Sampling for --- 1354,1359 ---- ============================== ! The MISER algorithm is described in the following article by Press and ! Farrar, W.H. Press, G.R. Farrar, `Recursive Stratified Sampling for *************** *** 1429,1433 **** ============================= ! - Function: void gsl_siman_solve (const gsl_rng * R, void *X0_P, gsl_siman_Efunc_t EF, gsl_siman_step_t TAKE_STEP, gsl_siman_metric_t DISTANCE, gsl_siman_print_t --- 1432,1436 ---- ============================= ! - Function: void gsl_siman_solve (const gsl_rng * R, void * X0_P, gsl_siman_Efunc_t EF, gsl_siman_step_t TAKE_STEP, gsl_siman_metric_t DISTANCE, gsl_siman_print_t *************** *** 1476,1479 **** --- 1479,1483 ---- - Data Type: gsl_siman_Efunc_t This function type should return the energy of a configuration XP. + double (*gsl_siman_Efunc_t) (void *xp) *************** *** 1482,1485 **** --- 1486,1490 ---- random step taken from the generator R, up to a maximum distance of STEP_SIZE. + void (*gsl_siman_step_t) (const gsl_rng *r, void *xp, double step_size) *************** *** 1488,1491 **** --- 1493,1497 ---- This function type should return the distance between two configurations XP and YP. + double (*gsl_siman_metric_t) (void *xp, void *yp) *************** *** 1493,1500 **** This function type should print the contents of the configuration XP. void (*gsl_siman_print_t) (void *xp) - Data Type: gsl_siman_copy_t ! This function type should copy the configuration DEST into SOURCE. void (*gsl_siman_copy_t) (void *source, void *dest) --- 1499,1508 ---- This function type should print the contents of the configuration XP. + void (*gsl_siman_print_t) (void *xp) - Data Type: gsl_siman_copy_t ! This function type should copy the configuration SOURCE into DEST. ! void (*gsl_siman_copy_t) (void *source, void *dest) *************** *** 1502,1505 **** --- 1510,1514 ---- This function type should create a new copy of the configuration XP. + void * (*gsl_siman_copy_construct_t) (void *xp) *************** *** 1507,1510 **** --- 1516,1520 ---- This function type should destroy the configuration XP, freeing its memory. + void (*gsl_siman_destroy_t) (void *xp) *************** *** 1638,1647 **** Here are a couple of plots that are generated by running `siman_test' in the following way: ! ./siman_test | grep -v "^#" ! | xyplot -xyil -y -0.88 -0.83 -d "x...y" ! | xyps -d > siman-test.eps ! ./siman_test | grep -v "^#" ! | xyplot -xyil -xl "generation" -yl "energy" -d "x..y" ! | xyps -d > siman-energy.eps  --- 1648,1658 ---- Here are a couple of plots that are generated by running `siman_test' in the following way: ! ! $ ./siman_test | grep -v "^#" ! | xyplot -xyil -y -0.88 -0.83 -d "x...y" ! | xyps -d > siman-test.eps ! $ ./siman_test | grep -v "^#" ! | xyplot -xyil -xl "generation" -yl "energy" -d "x..y" ! | xyps -d > siman-energy.eps  *************** *** 1665,1692 **** The full code can be found in `siman/siman_tsp.c', but I include here some plots generated in the following way: ! ./siman_tsp > tsp.output ! grep -v "^#" tsp.output ! | xyplot -xyil -d "x................y" ! -lx "generation" -ly "distance" ! -lt "TSP -- 12 southwest cities" ! | xyps -d > 12-cities.eps ! grep initial_city_coord tsp.output ! | awk '{print $2, $3, $4, $5}' ! | xyplot -xyil -lb0 -cs 0.8 ! -lx "longitude (- means west)" ! -ly "latitude" ! -lt "TSP -- initial-order" ! | xyps -d > initial-route.eps ! grep final_city_coord tsp.output ! | awk '{print $2, $3, $4, $5}' ! | xyplot -xyil -lb0 -cs 0.8 ! -lx "longitude (- means west)" ! -ly "latitude" ! -lt "TSP -- final-order" ! | xyps -d > final-route.eps ! ! This is the output showing the initial order of the cities; ! longitude is negative, since it is west and I want the plot to look ! like a map. # initial coordinates of cities (longitude and latitude) ###initial_city_coord: -105.95 35.68 Santa Fe --- 1676,1702 ---- The full code can be found in `siman/siman_tsp.c', but I include here some plots generated in the following way: ! ! $ ./siman_tsp > tsp.output ! $ grep -v "^#" tsp.output ! | xyplot -xyil -d "x................y" ! -lx "generation" -ly "distance" ! -lt "TSP -- 12 southwest cities" ! | xyps -d > 12-cities.eps ! $ grep initial_city_coord tsp.output ! | awk '{print $2, $3, $4, $5}' ! | xyplot -xyil -lb0 -cs 0.8 ! -lx "longitude (- means west)" -ly "latitude" ! -lt "TSP -- initial-order" ! | xyps -d > initial-route.eps ! $ grep final_city_coord tsp.output ! | awk '{print $2, $3, $4, $5}' ! | xyplot -xyil -lb0 -cs 0.8 ! -lx "longitude (- means west)" -ly "latitude" ! -lt "TSP -- final-order" ! | xyps -d > final-route.eps ! ! This is the output showing the initial order of the cities; longitude is ! negative, since it is west and I want the plot to look like a map. ! # initial coordinates of cities (longitude and latitude) ###initial_city_coord: -105.95 35.68 Santa Fe *************** *** 1705,1708 **** --- 1715,1719 ---- The optimal route turns out to be: + # final coordinates of cities (longitude and latitude) ###final_city_coord: -105.95 35.68 Santa Fe *************** *** 1723,1726 **** --- 1734,1745 ---- the calculation at which a new temperature is set) for this problem: + References and Further Reading + ============================== + + Further information is available in the following book, + + `Modern Heuristic Techniques for Combinatorial Problems', Colin R. + Reeves (ed.), McGraw-Hill, 1995 (ISBN 0-07-709239-2). +  File: gsl-ref.info, Node: Ordinary Differential Equations, Next: Interpolation, Prev: Simulated Annealing, Up: Top *************** *** 1768,1779 **** This function should store the vector elements f_i(t,y,params) in the array DYDT, for arguments (T,Y) and ! parameters PARAMS `int (* jacobian) (double t, const double y[], double * dfdy, double dfdt[], void * params);' ! This function should store the vector elements df_i(t,y,params)/dt in the array DFDT and the Jacobian matrix ! J_{ij} in the array DFDY regarded as a row-ordered matrix `J(i,j) = dfdy[i * dimension + j]' where `dimension' is the ! dimension of the system. Some of the simpler solver algorithms do not make use of the --- 1787,1802 ---- This function should store the vector elements f_i(t,y,params) in the array DYDT, for arguments (T,Y) and ! parameters PARAMS. The function should return `GSL_SUCCESS' ! if the calculation was completed successfully. Any other ! return value indicates an error. `int (* jacobian) (double t, const double y[], double * dfdy, double dfdt[], void * params);' ! This function should store the vector of derivative elements df_i(t,y,params)/dt in the array DFDT and the Jacobian matrix ! J_{ij} in the array DFDY, regarded as a row-ordered matrix `J(i,j) = dfdy[i * dimension + j]' where `dimension' is the ! dimension of the system. The function should return ! `GSL_SUCCESS' if the calculation was completed successfully. ! Any other return value indicates an error. Some of the simpler solver algorithms do not make use of the *************** *** 1845,1848 **** --- 1868,1880 ---- stored in DYDT_OUT if it is not null. + If the user-supplied functions defined in the system DYDT return a + status other than `GSL_SUCCESS' the step will be aborted. In this + case, the elements of Y will be restored to their pre-step values + and the error code from the user-supplied function will be + returned. To distinguish between error codes from the + user-supplied functions and those from `gsl_odeiv_step_apply' + itself, any user-defined return values should be distinct from the + standard GSL error codes. + The following algorithms are available, *************** *** 1885,1891 **** ========================== ! The control function examines the proposed change to the solution and ! its error estimate produced by a stepping function and attempts to ! determine the optimal step-size for a user-specified level of error. - Function: gsl_odeiv_control * gsl_odeiv_control_standard_new (double --- 1917,1923 ---- ========================== ! The control function examines the proposed change to the solution ! produced by a stepping function and attempts to determine the optimal ! step-size for a user-specified level of error. - Function: gsl_odeiv_control * gsl_odeiv_control_standard_new (double *************** *** 1908,1912 **** h_new = h_old * S * (E/D)^(-1/q) ! where q is the consistency order of method (e.g. q=4 for 4(5) embedded RK), and S is a safety factor of 0.9. The ratio E/D is taken to be the maximum of the ratios E_i/D_i. --- 1940,1944 ---- h_new = h_old * S * (E/D)^(-1/q) ! where q is the consistency order of the method (e.g. q=4 for 4(5) embedded RK), and S is a safety factor of 0.9. The ratio E/D is taken to be the maximum of the ratios E_i/D_i. *************** *** 2027,2030 **** --- 2059,2070 ---- time-step the value of T will be set to T1 exactly. + If the user-supplied functions defined in the system DYDT return a + status other than `GSL_SUCCESS' the step will be aborted. In this + case, T and Y will be restored to their pre-step values and the + error code from the user-supplied function will be returned. To + distinguish between error codes from the user-supplied functions + and those from `gsl_odeiv_evolve_apply' itself, any user-defined + return values should be distinct from the standard GSL error codes. + - Function: int gsl_odeiv_evolve_reset (gsl_odeiv_evolve * E) This function resets the evolution function E. It should be used *************** *** 2202,2206 **** } ! The derivatives must be initialised for the starting point t=0 before the first step is taken. Subsequent steps use the output derivatives DYDT_OUT as inputs to the next step by copying their values into --- 2242,2246 ---- } ! The derivatives must be initialized for the starting point t=0 before the first step is taken. Subsequent steps use the output derivatives DYDT_OUT as inputs to the next step by copying their values into *************** *** 2262,2266 **** Given a set of data points (x_1, y_1) \dots (x_n, y_n) the routines described in this section compute a continuous interpolating function ! y(x) such that y_i = y(x_i). The interpolation is piecewise smooth, and its behavior at the end-points is determined by the type of interpolation used. --- 2302,2306 ---- Given a set of data points (x_1, y_1) \dots (x_n, y_n) the routines described in this section compute a continuous interpolating function ! y(x) such that y(x_i) = y_i. The interpolation is piecewise smooth, and its behavior at the end-points is determined by the type of interpolation used. *************** *** 2335,2338 **** --- 2375,2379 ---- would print something like, + interp uses 'cspline' interpolation. *************** *** 2564,2569 **** ========= ! - Function: int gsl_deriv_central (const gsl_function *F, double X, ! double H, double *RESULT, double *ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive central difference algorithm with --- 2605,2610 ---- ========= ! - Function: int gsl_deriv_central (const gsl_function * F, double X, ! double H, double * RESULT, double * ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive central difference algorithm with *************** *** 2580,2585 **** derivative calculation, so only 4-points are actually used. ! - Function: int gsl_deriv_forward (const gsl_function *F, double X, ! double H, double *RESULT, double *ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive forward difference algorithm with --- 2621,2626 ---- derivative calculation, so only 4-points are actually used. ! - Function: int gsl_deriv_forward (const gsl_function * F, double X, ! double H, double * RESULT, double * ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive forward difference algorithm with *************** *** 2598,2603 **** rule x+h/2, x+h. ! - Function: int gsl_deriv_backward (const gsl_function *F, double X, ! double H, double *RESULT, double *ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive backward difference algorithm --- 2639,2644 ---- rule x+h/2, x+h. ! - Function: int gsl_deriv_backward (const gsl_function * F, double X, ! double H, double * RESULT, double * ABSERR) This function computes the numerical derivative of the function F at the point X using an adaptive backward difference algorithm *************** *** 2701,2705 **** * Menu: ! * The gsl_cheb_series struct:: * Creation and Calculation of Chebyshev Series:: * Chebyshev Series Evaluation:: --- 2742,2746 ---- * Menu: ! * Chebyshev Definitions:: * Creation and Calculation of Chebyshev Series:: * Chebyshev Series Evaluation:: *************** *** 2709,2716 ****  ! File: gsl-ref.info, Node: The gsl_cheb_series struct, Next: Creation and Calculation of Chebyshev Series, Up: Chebyshev Approximations ! The gsl_cheb_series struct ! ========================== A Chebyshev series is stored using the following structure, --- 2750,2757 ----  ! File: gsl-ref.info, Node: Chebyshev Definitions, Next: Creation and Calculation of Chebyshev Series, Up: Chebyshev Approximations ! Definitions ! =========== A Chebyshev series is stored using the following structure, *************** *** 2733,2737 ****  ! File: gsl-ref.info, Node: Creation and Calculation of Chebyshev Series, Next: Chebyshev Series Evaluation, Prev: The gsl_cheb_series struct, Up: Chebyshev Approximations Creation and Calculation of Chebyshev Series --- 2774,2778 ----  ! File: gsl-ref.info, Node: Creation and Calculation of Chebyshev Series, Next: Chebyshev Series Evaluation, Prev: Chebyshev Definitions, Up: Chebyshev Approximations Creation and Calculation of Chebyshev Series *************** *** 3059,3063 **** accurate, giving the correct number of significant digits. ! bash$ ./a.out term-by-term sum = 1.5961632439130233 using 20 terms --- 3100,3104 ---- accurate, giving the correct number of significant digits. ! $ ./a.out term-by-term sum = 1.5961632439130233 using 20 terms *************** *** 3093,3097 **** A review paper on the Levin Transform is available online, Herbert H. H. Homeier, Scalar Levin-Type Sequence Transformations, ! `http://xxx.lanl.gov/abs/math/0005209'.  --- 3134,3138 ---- A review paper on the Levin Transform is available online, Herbert H. H. Homeier, Scalar Levin-Type Sequence Transformations, ! `http://arxiv.org/abs/math/0005209'.  *************** *** 3132,3137 **** translation from a single function, referred to as the "mother wavelet". ! The discrete version of the wavelet transform acts on evenly sampled ! data, with fixed scaling and translation steps (s, \tau). The frequency and time axes are sampled "dyadically" on scales of 2^j through a level parameter j. The resulting family of functions --- 3173,3178 ---- translation from a single function, referred to as the "mother wavelet". ! The discrete version of the wavelet transform acts on equally-spaced ! samples, with fixed scaling and translation steps (s, \tau). The frequency and time axes are sampled "dyadically" on scales of 2^j through a level parameter j. The resulting family of functions *************** *** 3149,3154 **** The `gsl_wavelet' structure contains the filter coefficients defining ! the wavelet and associated offset parameters (for wavelets with ! centered support). - Function: gsl_wavelet * gsl_wavelet_alloc (const gsl_wavelet_type * --- 3190,3194 ---- The `gsl_wavelet' structure contains the filter coefficients defining ! the wavelet and any associated offset parameters. - Function: gsl_wavelet * gsl_wavelet_alloc (const gsl_wavelet_type * *************** *** 3191,3196 **** The `gsl_wavelet_workspace' structure contains scratch space of the ! same size as the input data, for holding intermediate results during the ! transform. - Function: gsl_wavelet_workspace * gsl_wavelet_workspace_alloc --- 3231,3236 ---- The `gsl_wavelet_workspace' structure contains scratch space of the ! same size as the input data and is used to hold intermediate results ! during the transform. - Function: gsl_wavelet_workspace * gsl_wavelet_workspace_alloc *************** *** 3204,3209 **** - Function: void gsl_wavelet_workspace_free (gsl_wavelet_workspace * ! WORKSPACE) ! This function frees the allocated workspace WORKSPACE.  --- 3244,3249 ---- - Function: void gsl_wavelet_workspace_free (gsl_wavelet_workspace * ! WORK) ! This function frees the allocated workspace WORK.  *************** *** 3230,3240 **** ----------------------------------- ! - Function: int gsl_dwt_transform (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_direction DIR, gsl_wavelet_workspace * WORK) ! - Function: int gsl_dwt_transform_forward (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_workspace * WORK) ! - Function: int gsl_dwt_transform_inverse (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_workspace * WORK) --- 3270,3280 ---- ----------------------------------- ! - Function: int gsl_wavelet_transform (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_direction DIR, gsl_wavelet_workspace * WORK) ! - Function: int gsl_wavelet_transform_forward (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_workspace * WORK) ! - Function: int gsl_wavelet_transform_inverse (const gsl_wavelet * W, double * DATA, size_t STRIDE, size_t N, gsl_wavelet_workspace * WORK) *************** *** 3277,3293 **** "standard" and "non-standard" forms. ! The "standard" transform performs a discrete wavelet transform on all ! rows of the matrix, followed by a separate discrete wavelet transform on ! the columns of the resulting row-transformed matrix. This procedure ! uses the same ordering as a two-dimensional fourier transform. ! ! The "non-standard" transform is performed in interleaved passes of ! the each level of the transform on the rows and columns of the matrix. ! The first level of the transform is carried out on the matrix rows, and ! then the columns of the partially row-transformed data. This procedure ! is then repeated across the rows and columns of the data for the ! subsequent levels of the transform, until the full discrete wavelet ! transform is complete. The non-standard form of the discrete wavelet ! transform is typically used in image analysis. The functions described in this section are declared in the header --- 3317,3333 ---- "standard" and "non-standard" forms. ! The "standard" transform performs a complete discrete wavelet ! transform on the rows of the matrix, followed by a separate complete ! discrete wavelet transform on the columns of the resulting ! row-transformed matrix. This procedure uses the same ordering as a ! two-dimensional fourier transform. ! ! The "non-standard" transform is performed in interleaved passes on ! the rows and columns of the matrix for each level of the transform. The ! first level of the transform is applied to the matrix rows, and then to ! the matrix columns. This procedure is then repeated across the rows and ! columns of the data for the subsequent levels of the transform, until ! the full discrete wavelet transform is complete. The non-standard form ! of the discrete wavelet transform is typically used in image analysis. The functions described in this section are declared in the header *************** *** 3354,3359 **** File: gsl-ref.info, Node: DWT Examples, Next: DWT References, Prev: DWT Transform Functions, Up: Wavelet Transforms ! Example ! ======= The following program demonstrates the use of the one-dimensional --- 3394,3399 ---- File: gsl-ref.info, Node: DWT Examples, Next: DWT References, Prev: DWT Transform Functions, Up: Wavelet Transforms ! Examples ! ======== The following program demonstrates the use of the one-dimensional *************** *** 3375,3378 **** --- 3415,3424 ---- size_t *p = malloc (n * sizeof (size_t)); + gsl_wavelet *w; + gsl_wavelet_workspace *work; + + w = gsl_wavelet_alloc (gsl_wavelet_daubechies, 4); + work = gsl_wavelet_workspace_alloc (n); + FILE *f = fopen (argv[1], "r"); for (i = 0; i < n; i++) *************** *** 3382,3406 **** fclose (f); ! { ! gsl_wavelet *w = gsl_wavelet_alloc (gsl_wavelet_daubechies, 4); ! gsl_wavelet_workspace *work = gsl_wavelet_workspace_alloc (n); ! ! gsl_wavelet_transform_forward (w, data, 1, n, work); ! ! for (i = 0; i < n; i++) ! { ! abscoeff[i] = fabs (data[i]); ! } ! ! gsl_sort_index (p, abscoeff, 1, n); ! ! for (i = 0; (i + nc) < n; i++) ! data[p[i]] = 0; ! ! gsl_wavelet_transform_inverse (w, data, 1, n, work); ! } for (i = 0; i < n; i++) { printf ("%g\n", data[i]); } --- 3428,3447 ---- fclose (f); ! gsl_wavelet_transform_forward (w, data, 1, n, work); for (i = 0; i < n; i++) { + abscoeff[i] = fabs (data[i]); + } + + gsl_sort_index (p, abscoeff, 1, n); + + for (i = 0; (i + nc) < n; i++) + data[p[i]] = 0; + + gsl_wavelet_transform_inverse (w, data, 1, n, work); + + for (i = 0; i < n; i++) + { printf ("%g\n", data[i]); } *************** *** 3434,3438 **** and local cosine bases see, ! Ste'phane Mallat. `A wavelet tour of signal processing' (Second edition). Academic Press (1999), ISBN 012466606X. --- 3475,3479 ---- and local cosine bases see, ! S. G. Mallat. `A wavelet tour of signal processing' (Second edition). Academic Press (1999), ISBN 012466606X. *************** *** 3444,3450 **** Mathematical Society', 315(1), 1989, 69-87. ! S. G. Mallat. A Theory for Multiresolution Signal Decomposition ! -- The Wavelet Representation. `IEEE Transactions on Pattern ! Analysis and Machine Intelligence', 11, 1989, 674-693. The coefficients for the individual wavelet families implemented by the --- 3485,3491 ---- Mathematical Society', 315(1), 1989, 69-87. ! S. G. Mallat. A Theory for Multiresolution Signal ! Decomposition--The Wavelet Representation. `IEEE Transactions on ! Pattern Analysis and Machine Intelligence', 11, 1989, 674-693. The coefficients for the individual wavelet families implemented by the *************** *** 3550,3559 **** - Function: double gsl_dht_x_sample (const gsl_dht * T, int N) ! This function returns the value of the n'th sample point in the unit interval, (j_{\nu,n+1}/j_{\nu,M}) X. These are the points where the function f(t) is assumed to be sampled. - Function: double gsl_dht_k_sample (const gsl_dht * T, int N) ! This function returns the value of the n'th sample point in "k-space", j_{\nu,n+1}/X. --- 3591,3600 ---- - Function: double gsl_dht_x_sample (const gsl_dht * T, int N) ! This function returns the value of the N-th sample point in the unit interval, (j_{\nu,n+1}/j_{\nu,M}) X. These are the points where the function f(t) is assumed to be sampled. - Function: double gsl_dht_k_sample (const gsl_dht * T, int N) ! This function returns the value of the N-th sample point in "k-space", j_{\nu,n+1}/X. *************** *** 3665,3669 **** still work for odd-multiplicity roots (e.g. cubic, quintic, ...). Root polishing algorithms generally work with higher multiplicity roots, but ! at reduced rate of convergence. In these cases the "Steffenson algorithm" can be used to accelerate the convergence of multiple roots. --- 3706,3710 ---- still work for odd-multiplicity roots (e.g. cubic, quintic, ...). Root polishing algorithms generally work with higher multiplicity roots, but ! at a reduced rate of convergence. In these cases the "Steffenson algorithm" can be used to accelerate the convergence of multiple roots. *************** *** 3672,3678 **** haphazardly to check for the _existence_ of roots. There are better ways to do this. Because it is easy to create situations where ! numerical root finders go awry, it is a bad idea to throw a root finder ! at a function you do not know much about. In general it is best to ! examine the function visually by plotting before searching for a root.  --- 3713,3720 ---- haphazardly to check for the _existence_ of roots. There are better ways to do this. Because it is easy to create situations where ! numerical root finders can fail, it is a bad idea to throw a root ! finder at a function you do not know much about. In general it is best ! to examine the function visually by plotting before searching for a ! root.  *************** *** 4270,4274 **** Here are the results of the iterations, ! bash$ ./a.out using brent method iter [ lower, upper] root err err(est) --- 4312,4316 ---- Here are the results of the iterations, ! $ ./a.out using brent method iter [ lower, upper] root err err(est) *************** *** 4286,4290 **** method can be observed, ! bash$ ./a.out using bisection method iter [ lower, upper] root err err(est) --- 4328,4332 ---- method can be observed, ! $ ./a.out using bisection method iter [ lower, upper] root err err(est) *************** *** 4359,4363 **** Here are the results for Newton's method, ! bash$ ./a.out using newton method iter root err err(est) --- 4401,4405 ---- Here are the results for Newton's method, ! $ ./a.out using newton method iter root err err(est) *************** *** 4440,4450 **** the interval. On each iteration a new point x' is selected using one of the available algorithms. If the new point is a better estimate of ! the minimum, f(x') < f(x), then the current estimate of the minimum x ! is updated. The new point also allows the size of the bounded interval ! to be reduced, by choosing the most compact set of points which ! satisfies the constraint f(a) > f(x) < f(b). The interval is reduced ! until it encloses the true minimum to a desired tolerance. This ! provides a best estimate of the location of the minimum and a rigorous ! error estimate. Several bracketing algorithms are available within a single --- 4482,4492 ---- the interval. On each iteration a new point x' is selected using one of the available algorithms. If the new point is a better estimate of ! the minimum, i.e. where f(x') < f(x), then the current estimate of the ! minimum x is updated. The new point also allows the size of the ! bounded interval to be reduced, by choosing the most compact set of ! points which satisfies the constraint f(a) > f(x) < f(b). The interval ! is reduced until it encloses the true minimum to a desired tolerance. ! This provides a best estimate of the location of the minimum and a ! rigorous error estimate. Several bracketing algorithms are available within a single *************** *** 4521,4525 **** If the interval given does not contain a minimum, then the function ! returns an error code of `GSL_FAILURE'. - Function: int gsl_min_fminimizer_set_with_values (gsl_min_fminimizer --- 4563,4567 ---- If the interval given does not contain a minimum, then the function ! returns an error code of `GSL_EINVAL'. - Function: int gsl_min_fminimizer_set_with_values (gsl_min_fminimizer *************** *** 4597,4607 **** - Function: double gsl_min_fminimizer_f_minimum (const ! gsl_min_fminimizer *S) - Function: double gsl_min_fminimizer_f_upper (const ! gsl_min_fminimizer *S) - Function: double gsl_min_fminimizer_f_lower (const ! gsl_min_fminimizer *S) These functions return the value of the function at the current ! estimate of the minimum and at the upper and lower bounds of interval for the minimizer S. --- 4639,4649 ---- - Function: double gsl_min_fminimizer_f_minimum (const ! gsl_min_fminimizer * S) - Function: double gsl_min_fminimizer_f_upper (const ! gsl_min_fminimizer * S) - Function: double gsl_min_fminimizer_f_lower (const ! gsl_min_fminimizer * S) These functions return the value of the function at the current ! estimate of the minimum and at the upper and lower bounds of the interval for the minimizer S. *************** *** 4655,4659 **** The minimization algorithms described in this section require an initial ! interval which is guaranteed to contain a minimum -- if a and b are the endpoints of the interval and x is an estimate of the minimum then f(a) > f(x) < f(b). This ensures that the function has at least one minimum --- 4697,4701 ---- The minimization algorithms described in this section require an initial ! interval which is guaranteed to contain a minimum--if a and b are the endpoints of the interval and x is an estimate of the minimum then f(a) > f(x) < f(b). This ensures that the function has at least one minimum *************** *** 4771,4775 **** Here are the results of the minimization procedure. ! bash$ ./a.out 0 [0.0000000, 6.0000000] 2.0000000 -1.1415927 6.0000000 --- 4813,4817 ---- Here are the results of the minimization procedure. ! $ ./a.out 0 [0.0000000, 6.0000000] 2.0000000 -1.1415927 6.0000000 *************** *** 5295,5299 **** The algorithms described in this section do not require any derivative information to be supplied by the user. Any derivatives needed are ! approximated from by finite difference. - Solver: gsl_multiroot_fsolver_hybrids --- 5337,5344 ---- The algorithms described in this section do not require any derivative information to be supplied by the user. Any derivatives needed are ! approximated by finite differences. Note that if the ! finite-differencing step size chosen by these routines is inappropriate, ! an explicit user-supplied numerical derivative can always be used with ! the algorithms described in the previous section. - Solver: gsl_multiroot_fsolver_hybrids *************** *** 5346,5351 **** for details). ! This algorithm is not recommended and is included only for ! demonstration purposes.  --- 5391,5396 ---- for details). ! This algorithm is included only for demonstration purposes, and is ! not recommended for serious use.  *************** *** 5460,5463 **** --- 5505,5509 ---- current position, and the vector `s->f' with corresponding function values. + int print_state (size_t iter, gsl_multiroot_fsolver * s) *************** *** 5685,5692 **** functions the gradient g = \nabla f vanishes at the minimum. In general there are no bracketing methods available for the minimization of ! n-dimensional functions. All algorithms proceed from an initial guess using a search algorithm which attempts to move in a downhill direction. ! All algorithms making use of the gradient of the function perform a one-dimensional line minimisation along this direction until the lowest point is found to a suitable tolerance. The search direction is then --- 5731,5738 ---- functions the gradient g = \nabla f vanishes at the minimum. In general there are no bracketing methods available for the minimization of ! n-dimensional functions. The algorithms proceed from an initial guess using a search algorithm which attempts to move in a downhill direction. ! Algorithms making use of the gradient of the function perform a one-dimensional line minimisation along this direction until the lowest point is found to a suitable tolerance. The search direction is then *************** *** 5701,5708 **** the simplex falls below a given tolerance. ! Several minimization algorithms are available within a single ! framework. The user provides a high-level driver for the algorithms, and ! the library provides the individual functions necessary for each of the ! steps. There are three main phases of the iteration. The steps are, * initialize minimizer state, S, for algorithm T --- 5747,5754 ---- the simplex falls below a given tolerance. ! Both types of algorithms use a standard framework. The user provides ! a high-level driver for the algorithms, and the library provides the ! individual functions necessary for each of the steps. There are three ! main phases of the iteration. The steps are, * initialize minimizer state, S, for algorithm T *************** *** 5747,5753 **** - Function: gsl_multimin_fdfminimizer * gsl_multimin_fdfminimizer_alloc (const ! gsl_multimin_fdfminimizer_type *T, size_t N) - Function: gsl_multimin_fminimizer * gsl_multimin_fminimizer_alloc ! (const gsl_multimin_fminimizer_type *T, size_t N) This function returns a pointer to a newly allocated instance of a minimizer of type T for an N-dimension function. If there is --- 5793,5799 ---- - Function: gsl_multimin_fdfminimizer * gsl_multimin_fdfminimizer_alloc (const ! gsl_multimin_fdfminimizer_type * T, size_t N) - Function: gsl_multimin_fminimizer * gsl_multimin_fminimizer_alloc ! (const gsl_multimin_fminimizer_type * T, size_t N) This function returns a pointer to a newly allocated instance of a minimizer of type T for an N-dimension function. If there is *************** *** 5757,5762 **** - Function: int gsl_multimin_fdfminimizer_set ! (gsl_multimin_fdfminimizer * S, gsl_multimin_function_fdf ! *FDF, const gsl_vector * X, double STEP_SIZE, double TOL) This function initializes the minimizer S to minimize the function FDF starting from the initial point X. The size of the first --- 5803,5808 ---- - Function: int gsl_multimin_fdfminimizer_set ! (gsl_multimin_fdfminimizer * S, gsl_multimin_function_fdf * ! FDF, const gsl_vector * X, double STEP_SIZE, double TOL) This function initializes the minimizer S to minimize the function FDF starting from the initial point X. The size of the first *************** *** 5769,5773 **** - Function: int gsl_multimin_fminimizer_set (gsl_multimin_fminimizer * ! S, gsl_multimin_function *F, const gsl_vector * X, const gsl_vector * STEP_SIZE) This function initializes the minimizer S to minimize the function --- 5815,5819 ---- - Function: int gsl_multimin_fminimizer_set (gsl_multimin_fminimizer * ! S, gsl_multimin_function * F, const gsl_vector * X, const gsl_vector * STEP_SIZE) This function initializes the minimizer S to minimize the function *************** *** 5777,5783 **** - Function: void gsl_multimin_fdfminimizer_free ! (gsl_multimin_fdfminimizer *S) - Function: void gsl_multimin_fminimizer_free (gsl_multimin_fminimizer ! *S) This function frees all the memory associated with the minimizer S. --- 5823,5829 ---- - Function: void gsl_multimin_fdfminimizer_free ! (gsl_multimin_fdfminimizer * S) - Function: void gsl_multimin_fminimizer_free (gsl_multimin_fminimizer ! * S) This function frees all the memory associated with the minimizer S. *************** *** 5805,5809 **** calculates both the function value and the gradient together. In order to allow for general parameters the functions are defined by the ! following data type: - Data Type: gsl_multimin_function_fdf --- 5851,5855 ---- calculates both the function value and the gradient together. In order to allow for general parameters the functions are defined by the ! following data types: - Data Type: gsl_multimin_function_fdf *************** *** 5916,5922 **** - Function: int gsl_multimin_fdfminimizer_iterate ! (gsl_multimin_fdfminimizer *S) - Function: int gsl_multimin_fminimizer_iterate ! (gsl_multimin_fminimizer *S) These functions perform a single iteration of the minimizer S. If the iteration encounters an unexpected problem then an error code --- 5962,5968 ---- - Function: int gsl_multimin_fdfminimizer_iterate ! (gsl_multimin_fdfminimizer * S) - Function: int gsl_multimin_fminimizer_iterate ! (gsl_multimin_fminimizer * S) These functions perform a single iteration of the minimizer S. If the iteration encounters an unexpected problem then an error code *************** *** 5945,5949 **** - Function: int gsl_multimin_fdfminimizer_restart ! (gsl_multimin_fdfminimizer *S) This function resets the minimizer S to use the current point as a new starting point. --- 5991,5995 ---- - Function: int gsl_multimin_fdfminimizer_restart ! (gsl_multimin_fdfminimizer * S) This function resets the minimizer S to use the current point as a new starting point. *************** *** 5996,6000 **** There are several minimization methods available. The best choice of algorithm depends on the problem. All of the algorithms use the value ! of the function and most of its gradient at each evaluation point, too. - Minimizer: gsl_multimin_fdfminimizer_conjugate_fr --- 6042,6047 ---- There are several minimization methods available. The best choice of algorithm depends on the problem. All of the algorithms use the value ! of the function and its gradient at each evaluation point, except for ! the Simplex algorithm which uses function values only. - Minimizer: gsl_multimin_fdfminimizer_conjugate_fr *************** *** 6003,6015 **** minimizations. The sequence of search directions is used to build up an approximation to the curvature of the function in the ! neighborhood of the minimum. An initial search direction P is ! chosen using the gradient and line minimization is carried out in ! that direction. The accuracy of the line minimization is ! specified by the parameter TOL. At the minimum along this line ! the function gradient G and the search direction P are orthogonal. ! The line minimization terminates when dot(p,g) < tol |p| |g|. The ! search direction is updated using the Fletcher-Reeves formula p' ! = g' - \beta g where \beta=-|g'|^2/|g|^2, and the line ! minimization is then repeated for the new search direction. - Minimizer: gsl_multimin_fdfminimizer_conjugate_pr --- 6050,6064 ---- minimizations. The sequence of search directions is used to build up an approximation to the curvature of the function in the ! neighborhood of the minimum. ! ! An initial search direction P is chosen using the gradient, and ! line minimization is carried out in that direction. The accuracy ! of the line minimization is specified by the parameter TOL. The ! minimum along this line occurs when the function gradient G and ! the search direction P are orthogonal. The line minimization ! terminates when dot(p,g) < tol |p| |g|. The search direction is ! updated using the Fletcher-Reeves formula p' = g' - \beta g where ! \beta=-|g'|^2/|g|^2, and the line minimization is then repeated ! for the new search direction. - Minimizer: gsl_multimin_fdfminimizer_conjugate_pr *************** *** 6043,6046 **** --- 6092,6096 ---- vectors p_i from the starting vector X and the vector STEP_SIZE as follows: + p_0 = (x_0, x_1, ... , x_n) p_1 = (x_0 + step_size_0, x_1, ... , x_n) *************** *** 6050,6059 **** These vectors form the n+1 vertices of a simplex in n dimensions. ! On each iteration step the algorithm tries to improve the ! parameter vector p_i corresponding to the highest function value ! by simple geometrical transformations. These are reflection, ! reflection followed by expansion, contraction and multiple ! contraction. Using these transformations the simplex moves through ! the parameter space towards the minimum, where it contracts itself. After each iteration, the best vertex is returned. Note, that due --- 6100,6109 ---- These vectors form the n+1 vertices of a simplex in n dimensions. ! On each iteration the algorithm tries to improve the parameter ! vector p_i corresponding to the highest function value by simple ! geometrical transformations. These are reflection, reflection ! followed by expansion, contraction and multiple contraction. Using ! these transformations the simplex moves through the parameter ! space towards the minimum, where it contracts itself. After each iteration, the best vertex is returned. Note, that due *************** *** 6281,6289 **** C.W. Ueberhuber, `Numerical Computation (Volume 2)', Chapter 14, ! Section 4.4 "Minimization Methods", p. 325--335, Springer (1997), ISBN 3-540-62057-5. J.A. Nelder and R. Mead, `A simplex method for function ! minimization', Computer Journal vol. 7 (1965), 308--315.  --- 6331,6341 ---- C.W. Ueberhuber, `Numerical Computation (Volume 2)', Chapter 14, ! Section 4.4 "Minimization Methods", p. 325-335, Springer (1997), ISBN 3-540-62057-5. + The simplex algorithm is described in the following paper, + J.A. Nelder and R. Mead, `A simplex method for function ! minimization', Computer Journal vol. 7 (1965), 308-315.  *************** *** 6358,6362 **** - Function: int gsl_fit_linear_est (double X, double C0, double C1, ! double C00, double C01, double C11, double *Y, double *Y_ERR) This function uses the best-fit linear regression coefficients C0,C1 and their estimated covariance COV00,COV01,COV11 to compute --- 6410,6415 ---- - Function: int gsl_fit_linear_est (double X, double C0, double C1, ! double C00, double C01, double C11, double * Y, double * ! Y_ERR) This function uses the best-fit linear regression coefficients C0,C1 and their estimated covariance COV00,COV01,COV11 to compute *************** *** 6403,6412 **** The variance of the parameter C1 is estimated from the weighted ! data and returned via the parameters COV11. The weighted sum of squares of the residuals from the best-fit line, \chi^2, is returned in CHISQ. - Function: int gsl_fit_mul_est (double X, double C1, double C11, ! double *Y, double *Y_ERR) This function uses the best-fit linear regression coefficient C1 and its estimated covariance COV11 to compute the fitted function --- 6456,6465 ---- The variance of the parameter C1 is estimated from the weighted ! data and returned via the parameter COV11. The weighted sum of squares of the residuals from the best-fit line, \chi^2, is returned in CHISQ. - Function: int gsl_fit_mul_est (double X, double C1, double C11, ! double * Y, double * Y_ERR) This function uses the best-fit linear regression coefficient C1 and its estimated covariance COV11 to compute the fitted function *************** *** 6422,6427 **** The functions described in this section perform least-squares fits to a general linear model, y = X c where y is a vector of n observations, X ! is an n by p matrix of predictor variables, and c are the p unknown ! best-fit parameters, which are to be estimated. The best-fit is found by minimizing the weighted sums of squared --- 6475,6481 ---- The functions described in this section perform least-squares fits to a general linear model, y = X c where y is a vector of n observations, X ! is an n by p matrix of predictor variables, and the elements of the ! vector c are the p unknown best-fit parameters which are to be ! estimated. The best-fit is found by minimizing the weighted sums of squared *************** *** 6474,6478 **** gsl_vector * Y, gsl_vector * C, gsl_matrix * COV, double * CHISQ, gsl_multifit_linear_workspace * WORK) ! This function computes the best-fit parameters C of the model y = X c for the observations Y and the matrix of predictor variables X. The variance-covariance matrix of the model parameters COV is --- 6528,6536 ---- gsl_vector * Y, gsl_vector * C, gsl_matrix * COV, double * CHISQ, gsl_multifit_linear_workspace * WORK) ! - Function: int gsl_multifit_linear_svd (const gsl_matrix * X, const ! gsl_vector * Y, double TOL, size_t * RANK, gsl_vector * C, ! gsl_matrix * COV, double * CHISQ, ! gsl_multifit_linear_workspace * WORK) ! These functions compute the best-fit parameters C of the model y = X c for the observations Y and the matrix of predictor variables X. The variance-covariance matrix of the model parameters COV is *************** *** 6486,6490 **** improve the accuracy of the singular values. Any components which have zero singular value (to machine precision) are discarded from ! the fit. - Function: int gsl_multifit_wlinear (const gsl_matrix * X, const --- 6544,6552 ---- improve the accuracy of the singular values. Any components which have zero singular value (to machine precision) are discarded from ! the fit. In the second form of the function the components are ! discarded if the ratio of singular values s_i/s_0 falls below the ! user-specified tolerance TOL, and the effective rank is returned ! in RANK. ! - Function: int gsl_multifit_wlinear (const gsl_matrix * X, const *************** *** 6492,6505 **** gsl_matrix * COV, double * CHISQ, gsl_multifit_linear_workspace * WORK) ! This function computes the best-fit parameters C of the model y = ! X c for the observations Y and the matrix of predictor variables ! X. The covariance matrix of the model parameters COV is estimated ! from the weighted data. The weighted sum of squares of the ! residuals from the best-fit, \chi^2, is returned in CHISQ. The best-fit is found by singular value decomposition of the matrix X using the preallocated workspace provided in WORK. Any components which have zero singular value (to machine precision) ! are discarded from the fit.  --- 6554,6575 ---- gsl_matrix * COV, double * CHISQ, gsl_multifit_linear_workspace * WORK) ! - Function: int gsl_multifit_wlinear_svd (const gsl_matrix * X, const ! gsl_vector * W, const gsl_vector * Y, double TOL, size_t * ! RANK, gsl_vector * C, gsl_matrix * COV, double * CHISQ, ! gsl_multifit_linear_workspace * WORK) ! This function computes the best-fit parameters C of the weighted ! model y = X c for the observations Y with weights W and the matrix ! of predictor variables X. The covariance matrix of the model ! parameters COV is estimated from the weighted data. The weighted ! sum of squares of the residuals from the best-fit, \chi^2, is ! returned in CHISQ. The best-fit is found by singular value decomposition of the matrix X using the preallocated workspace provided in WORK. Any components which have zero singular value (to machine precision) ! are discarded from the fit. In the second form of the function the ! components are discarded if the ratio of singular values s_i/s_0 ! falls below the user-specified tolerance TOL, and the effective ! rank is returned in RANK.  *************** *** 6748,6752 **** above. ! The tests used to prepare these routines are based on the NIST Statistical Reference Datasets. The datasets and their documentation are available from NIST at the following website, --- 6818,6822 ---- above. ! The tests used to prepare these routines are based on the NIST Statistical Reference Datasets. The datasets and their documentation are available from NIST at the following website, *************** *** 6948,6953 **** the iteration encounters an unexpected problem then an error code will be returned. The solver maintains a current estimate of the ! best-fit parameters at all times. This information can be accessed ! with the following auxiliary functions, The solver struct S contains the following entries, which can be --- 7018,7022 ---- the iteration encounters an unexpected problem then an error code will be returned. The solver maintains a current estimate of the ! best-fit parameters at all times. The solver struct S contains the following entries, which can be *************** *** 6968,6971 **** --- 7037,7043 ---- `gsl_multifit_fdfsolver' struct only) + The best-fit information also can be accessed with the following + auxiliary functions, + - Function: gsl_vector * gsl_multifit_fsolver_position (const gsl_multifit_fsolver * S) *************** *** 7033,7039 **** The minimization algorithms described in this section make use of both the function and its derivative. They require an initial guess for the ! location of the minimum. There is no absolute guarantee of convergence ! - the function must be suitable for this technique and the initial ! guess must be sufficiently close to the minimum for it to work. - Derivative Solver: gsl_multifit_fdfsolver_lmsder --- 7105,7111 ---- The minimization algorithms described in this section make use of both the function and its derivative. They require an initial guess for the ! location of the minimum. There is no absolute guarantee of ! convergence--the function must be suitable for this technique and the ! initial guess must be sufficiently close to the minimum for it to work. - Derivative Solver: gsl_multifit_fdfsolver_lmsder *************** *** 7210,7215 **** gsl_matrix_set (J, i, 1, -t * A * e/s); gsl_matrix_set (J, i, 2, 1/s); - - } return GSL_SUCCESS; --- 7282,7285 ---- *************** *** 7247,7261 **** gsl_matrix *covar = gsl_matrix_alloc (p, p); - double y[N], sigma[N]; - struct data d = { n, y, sigma}; - gsl_multifit_function_fdf f; - double x_init[3] = { 1.0, 0.0, 0.0 }; - gsl_vector_view x = gsl_vector_view_array (x_init, p); - const gsl_rng_type * type; gsl_rng * r; --- 7317,7325 ---- *************** *** 7411,7417 **** * Measurement of Time:: * Imperial Units :: ! * Nautical Units:: * Printers Units:: ! * Volume:: * Mass and Weight :: * Thermal Energy and Power:: --- 7475,7481 ---- * Measurement of Time:: * Imperial Units :: ! * Speed and Nautical Units:: * Printers Units:: ! * Volume Area and Length:: * Mass and Weight :: * Thermal Energy and Power:: *************** *** 7473,7488 **** The magnetic field of 1 Gauss. - `GSL_CONST_MKSA_MICRON' - The length of 1 micron. - - `GSL_CONST_MKSA_HECTARE' - The area of 1 hectare. - - `GSL_CONST_MKSA_MILES_PER_HOUR' - The speed of 1 mile per hour. - - `GSL_CONST_MKSA_KILOMETERS_PER_HOUR' - The speed of 1 kilometer per hour. -  File: gsl-ref.info, Node: Astronomy and Astrophysics, Next: Atomic and Nuclear Physics, Prev: Fundamental Constants, Up: Physical Constants --- 7537,7540 ---- *************** *** 7587,7591 ****  ! File: gsl-ref.info, Node: Imperial Units, Next: Nautical Units, Prev: Measurement of Time, Up: Physical Constants Imperial Units --- 7639,7643 ----  ! File: gsl-ref.info, Node: Imperial Units, Next: Speed and Nautical Units, Prev: Measurement of Time, Up: Physical Constants Imperial Units *************** *** 7608,7615 ****  ! File: gsl-ref.info, Node: Nautical Units, Next: Printers Units, Prev: Imperial Units, Up: Physical Constants ! Nautical Units ! ============== `GSL_CONST_MKSA_NAUTICAL_MILE' --- 7660,7673 ----  ! File: gsl-ref.info, Node: Speed and Nautical Units, Next: Printers Units, Prev: Imperial Units, Up: Physical Constants ! Speed and Nautical Units ! ======================== ! ! `GSL_CONST_MKSA_KILOMETERS_PER_HOUR' ! The speed of 1 kilometer per hour. ! ! `GSL_CONST_MKSA_MILES_PER_HOUR' ! The speed of 1 mile per hour. `GSL_CONST_MKSA_NAUTICAL_MILE' *************** *** 7623,7627 ****  ! File: gsl-ref.info, Node: Printers Units, Next: Volume, Prev: Nautical Units, Up: Physical Constants Printers Units --- 7681,7685 ----  ! File: gsl-ref.info, Node: Printers Units, Next: Volume Area and Length, Prev: Speed and Nautical Units, Up: Physical Constants Printers Units *************** *** 7635,7642 ****  ! File: gsl-ref.info, Node: Volume, Next: Mass and Weight, Prev: Printers Units, Up: Physical Constants ! Volume ! ====== `GSL_CONST_MKSA_ACRE' --- 7693,7706 ----  ! File: gsl-ref.info, Node: Volume Area and Length, Next: Mass and Weight, Prev: Printers Units, Up: Physical Constants ! ! Volume, Area and Length ! ======================= ! `GSL_CONST_MKSA_MICRON' ! The length of 1 micron. ! ! `GSL_CONST_MKSA_HECTARE' ! The area of 1 hectare. `GSL_CONST_MKSA_ACRE' *************** *** 7661,7800 **** The volume of 1 pint. -  - File: gsl-ref.info, Node: Mass and Weight, Next: Thermal Energy and Power, Prev: Volume, Up: Physical Constants - - Mass and Weight - =============== - - `GSL_CONST_MKSA_POUND_MASS' - The mass of 1 pound. - - `GSL_CONST_MKSA_OUNCE_MASS' - The mass of 1 ounce. - - `GSL_CONST_MKSA_TON' - The mass of 1 ton. - - `GSL_CONST_MKSA_METRIC_TON' - The mass of 1 metric ton (1000 kg). - - `GSL_CONST_MKSA_UK_TON' - The mass of 1 UK ton. - - `GSL_CONST_MKSA_TROY_OUNCE' - The mass of 1 troy ounce. - - `GSL_CONST_MKSA_CARAT' - The mass of 1 carat. - - `GSL_CONST_MKSA_GRAM_FORCE' - The force of 1 gram weight. - - `GSL_CONST_MKSA_POUND_FORCE' - The force of 1 pound weight. - - `GSL_CONST_MKSA_KILOPOUND_FORCE' - The force of 1 kilopound weight. - - `GSL_CONST_MKSA_POUNDAL' - The force of 1 poundal. - -  - File: gsl-ref.info, Node: Thermal Energy and Power, Next: Pressure, Prev: Mass and Weight, Up: Physical Constants - - Thermal Energy and Power - ======================== - - `GSL_CONST_MKSA_CALORIE' - The energy of 1 calorie. - - `GSL_CONST_MKSA_BTU' - The energy of 1 British Thermal Unit, btu. - - `GSL_CONST_MKSA_THERM' - The energy of 1 Therm. - - `GSL_CONST_MKSA_HORSEPOWER' - The power of 1 horsepower. - -  - File: gsl-ref.info, Node: Pressure, Next: Viscosity, Prev: Thermal Energy and Power, Up: Physical Constants - - Pressure - ======== - - `GSL_CONST_MKSA_BAR' - The pressure of 1 bar. - - `GSL_CONST_MKSA_STD_ATMOSPHERE' - The pressure of 1 standard atmosphere. - - `GSL_CONST_MKSA_TORR' - The pressure of 1 torr. - - `GSL_CONST_MKSA_METER_OF_MERCURY' - The pressure of 1 meter of mercury. - - `GSL_CONST_MKSA_INCH_OF_MERCURY' - The pressure of 1 inch of mercury. - - `GSL_CONST_MKSA_INCH_OF_WATER' - The pressure of 1 inch of water. - - `GSL_CONST_MKSA_PSI' - The pressure of 1 pound per square inch. - -  - File: gsl-ref.info, Node: Viscosity, Next: Light and Illumination, Prev: Pressure, Up: Physical Constants - - Viscosity - ========= - - `GSL_CONST_MKSA_POISE' - The dynamic viscosity of 1 poise. - - `GSL_CONST_MKSA_STOKES' - The kinematic viscosity of 1 stokes. - -  - File: gsl-ref.info, Node: Light and Illumination, Next: Radioactivity, Prev: Viscosity, Up: Physical Constants - - Light and Illumination - ====================== - - `GSL_CONST_MKSA_STILB' - The luminance of 1 stilb. - - `GSL_CONST_MKSA_LUMEN' - The luminous flux of 1 lumen. - - `GSL_CONST_MKSA_LUX' - The illuminance of 1 lux. - - `GSL_CONST_MKSA_PHOT' - The illuminance of 1 phot. - - `GSL_CONST_MKSA_FOOTCANDLE' - The illuminance of 1 footcandle. - - `GSL_CONST_MKSA_LAMBERT' - The luminance of 1 lambert. - - `GSL_CONST_MKSA_FOOTLAMBERT' - The luminance of 1 footlambert. - -  - File: gsl-ref.info, Node: Radioactivity, Next: Force and Energy, Prev: Light and Illumination, Up: Physical Constants - - Radioactivity - ============= - - `GSL_CONST_MKSA_CURIE' - The activity of 1 curie. - - `GSL_CONST_MKSA_ROENTGEN' - The exposure of 1 roentgen. - - `GSL_CONST_MKSA_RAD' - The absorbed dose of 1 rad. - --- 7725,7726 ---- diff -rc2P gsl-1.6/doc/gsl-ref.info-4 gsl-1.7/doc/gsl-ref.info-4 *** gsl-1.6/doc/gsl-ref.info-4 Fri Dec 31 15:30:03 2004 --- gsl-1.7/doc/gsl-ref.info-4 Tue Sep 13 10:18:36 2005 *************** *** 8,11 **** --- 8,149 ----  + File: gsl-ref.info, Node: Mass and Weight, Next: Thermal Energy and Power, Prev: Volume Area and Length, Up: Physical Constants + + Mass and Weight + =============== + + `GSL_CONST_MKSA_POUND_MASS' + The mass of 1 pound. + + `GSL_CONST_MKSA_OUNCE_MASS' + The mass of 1 ounce. + + `GSL_CONST_MKSA_TON' + The mass of 1 ton. + + `GSL_CONST_MKSA_METRIC_TON' + The mass of 1 metric ton (1000 kg). + + `GSL_CONST_MKSA_UK_TON' + The mass of 1 UK ton. + + `GSL_CONST_MKSA_TROY_OUNCE' + The mass of 1 troy ounce. + + `GSL_CONST_MKSA_CARAT' + The mass of 1 carat. + + `GSL_CONST_MKSA_GRAM_FORCE' + The force of 1 gram weight. + + `GSL_CONST_MKSA_POUND_FORCE' + The force of 1 pound weight. + + `GSL_CONST_MKSA_KILOPOUND_FORCE' + The force of 1 kilopound weight. + + `GSL_CONST_MKSA_POUNDAL' + The force of 1 poundal. + +  + File: gsl-ref.info, Node: Thermal Energy and Power, Next: Pressure, Prev: Mass and Weight, Up: Physical Constants + + Thermal Energy and Power + ======================== + + `GSL_CONST_MKSA_CALORIE' + The energy of 1 calorie. + + `GSL_CONST_MKSA_BTU' + The energy of 1 British Thermal Unit, btu. + + `GSL_CONST_MKSA_THERM' + The energy of 1 Therm. + + `GSL_CONST_MKSA_HORSEPOWER' + The power of 1 horsepower. + +  + File: gsl-ref.info, Node: Pressure, Next: Viscosity, Prev: Thermal Energy and Power, Up: Physical Constants + + Pressure + ======== + + `GSL_CONST_MKSA_BAR' + The pressure of 1 bar. + + `GSL_CONST_MKSA_STD_ATMOSPHERE' + The pressure of 1 standard atmosphere. + + `GSL_CONST_MKSA_TORR' + The pressure of 1 torr. + + `GSL_CONST_MKSA_METER_OF_MERCURY' + The pressure of 1 meter of mercury. + + `GSL_CONST_MKSA_INCH_OF_MERCURY' + The pressure of 1 inch of mercury. + + `GSL_CONST_MKSA_INCH_OF_WATER' + The pressure of 1 inch of water. + + `GSL_CONST_MKSA_PSI' + The pressure of 1 pound per square inch. + +  + File: gsl-ref.info, Node: Viscosity, Next: Light and Illumination, Prev: Pressure, Up: Physical Constants + + Viscosity + ========= + + `GSL_CONST_MKSA_POISE' + The dynamic viscosity of 1 poise. + + `GSL_CONST_MKSA_STOKES' + The kinematic viscosity of 1 stokes. + +  + File: gsl-ref.info, Node: Light and Illumination, Next: Radioactivity, Prev: Viscosity, Up: Physical Constants + + Light and Illumination + ====================== + + `GSL_CONST_MKSA_STILB' + The luminance of 1 stilb. + + `GSL_CONST_MKSA_LUMEN' + The luminous flux of 1 lumen. + + `GSL_CONST_MKSA_LUX' + The illuminance of 1 lux. + + `GSL_CONST_MKSA_PHOT' + The illuminance of 1 phot. + + `GSL_CONST_MKSA_FOOTCANDLE' + The illuminance of 1 footcandle. + + `GSL_CONST_MKSA_LAMBERT' + The luminance of 1 lambert. + + `GSL_CONST_MKSA_FOOTLAMBERT' + The luminance of 1 footlambert. + +  + File: gsl-ref.info, Node: Radioactivity, Next: Force and Energy, Prev: Light and Illumination, Up: Physical Constants + + Radioactivity + ============= + + `GSL_CONST_MKSA_CURIE' + The activity of 1 curie. + + `GSL_CONST_MKSA_ROENTGEN' + The exposure of 1 roentgen. + + `GSL_CONST_MKSA_RAD' + The absorbed dose of 1 rad. + +  File: gsl-ref.info, Node: Force and Energy, Next: Prefixes, Prev: Radioactivity, Up: Physical Constants *************** *** 92,102 **** The required data is the average distance of each planet from the ! Sun in astronomical units (the eccentricities of the orbits will be ! neglected for the purposes of this calculation). The average radius of ! the orbit of Mars is 1.52 astronomical units, and for the orbit of ! Earth it is 1 astronomical unit (by definition). These values are ! combined with the MKSA values of the constants for the speed of light ! and the length of an astronomical unit to produce a result for the ! shortest and longest light-travel times in seconds. The figures are converted into minutes before being displayed. --- 230,240 ---- The required data is the average distance of each planet from the ! Sun in astronomical units (the eccentricities and inclinations of the ! orbits will be neglected for the purposes of this calculation). The ! average radius of the orbit of Mars is 1.52 astronomical units, and for ! the orbit of Earth it is 1 astronomical unit (by definition). These ! values are combined with the MKSA values of the constants for the speed ! of light and the length of an astronomical unit to produce a result for ! the shortest and longest light-travel times in seconds. The figures are converted into minutes before being displayed. *************** *** 139,147 **** ============================== ! Further information on the values of physical constants is available ! from the NIST website, `http://www.physics.nist.gov/cuu/Constants/index.html'  File: gsl-ref.info, Node: IEEE floating-point arithmetic, Next: Debugging Numerical Programs, Prev: Physical Constants, Up: Top --- 277,294 ---- ============================== ! The authoritative sources for physical constanst are the 2002 CODATA ! recommended values, published in the articles below. Further information ! on the values of physical constants is also available from the cited ! articles and the NIST website. ! ! Journal of Physical and Chemical Reference Data, 28(6), 1713-1852, ! 1999 ! ! Reviews of Modern Physics, 72(2), 351-495, 2000 `http://www.physics.nist.gov/cuu/Constants/index.html' + `http://physics.nist.gov/Pubs/SP811/appenB9.html' +  File: gsl-ref.info, Node: IEEE floating-point arithmetic, Next: Debugging Numerical Programs, Prev: Physical Constants, Up: Top *************** *** 360,364 **** error code of `GSL_EUNSUP'. ! The following combination of modes is convenient for many purposes, GSL_IEEE_MODE="double-precision,"\ --- 507,524 ---- error code of `GSL_EUNSUP'. ! When options are specified using this method, the resulting mode is ! based on a default setting of the highest available precision ! (double precision or extended precision, depending on the ! platform) in round-to-nearest mode, with all exceptions enabled ! apart from the INEXACT exception. The INEXACT exception is ! generated whenever rounding occurs, so it must generally be ! disabled in typical scientific calculations. All other ! floating-point exceptions are enabled by default, including ! underflows and the use of denormalized numbers, for safety. They ! can be disabled with the individual `mask-' settings or together ! using `mask-all'. ! ! The following adjusted combination of modes is convenient for many ! purposes, GSL_IEEE_MODE="double-precision,"\ *************** *** 412,416 **** here, ! GSL_IEEE_MODE="round-to-nearest" ./a.out i= 1 sum=1.000000000000000000 error=-1.71828 i= 2 sum=2.000000000000000000 error=-0.718282 --- 572,576 ---- here, ! $ GSL_IEEE_MODE="round-to-nearest" ./a.out i= 1 sum=1.000000000000000000 error=-1.71828 i= 2 sum=2.000000000000000000 error=-0.718282 *************** *** 423,427 **** final result is less accurate, ! GSL_IEEE_MODE="round-down" ./a.out i= 1 sum=1.000000000000000000 error=-1.71828 .... --- 583,587 ---- final result is less accurate, ! $ GSL_IEEE_MODE="round-down" ./a.out i= 1 sum=1.000000000000000000 error=-1.71828 .... *************** *** 449,453 **** iterations and the final result is much less accurate, ! GSL_IEEE_MODE="single-precision" ./a.out .... i=12 sum=2.718281984329223633 error=1.5587e-07 --- 609,613 ---- iterations and the final result is much less accurate, ! $ GSL_IEEE_MODE="single-precision" ./a.out .... i=12 sum=2.718281984329223633 error=1.5587e-07 *************** *** 470,475 **** A more pedagogical introduction to the standard can be found in the ! paper "What Every Computer Scientist Should Know About Floating-Point ! Arithmetic". David Goldberg: What Every Computer Scientist Should Know About --- 630,634 ---- A more pedagogical introduction to the standard can be found in the ! following paper, David Goldberg: What Every Computer Scientist Should Know About *************** *** 478,487 **** Corrigendum: `ACM Computing Surveys', Vol. 23, No. 3 (September ! 1991), page 413. ! See also the sections by B. A. Wichmann and Charles B. Dunham in ! Surveyor's Forum: "What Every Computer Scientist Should Know About ! Floating-Point Arithmetic". `ACM Computing Surveys', Vol. 24, No. ! 3 (September 1992), page 319.  --- 637,650 ---- Corrigendum: `ACM Computing Surveys', Vol. 23, No. 3 (September ! 1991), page 413. and see also the sections by B. A. Wichmann and ! Charles B. Dunham in Surveyor's Forum: "What Every Computer ! Scientist Should Know About Floating-Point Arithmetic". `ACM ! Computing Surveys', Vol. 24, No. 3 (September 1992), page 319. ! ! A detailed textbook on IEEE arithmetic and its practical use is ! available from SIAM Press, ! Michael L. Overton, `Numerical Computing with IEEE Floating Point ! Arithmetic', SIAM Press, ISBN 0898715717.  *************** *** 533,537 **** define a breakpoint in `gsl_error', ! bash$ gdb test_trap GDB is free software and you are welcome to distribute copies --- 696,700 ---- define a breakpoint in `gsl_error', ! $ gdb test_trap GDB is free software and you are welcome to distribute copies *************** *** 771,774 **** --- 934,943 ---- Source-Level Debugger', Free Software Foundation, ISBN 1882114779 + For a tutorial introduction to the GNU C Compiler and related programs, + see + + B.J. Gough, `An Introduction to GCC', Network Theory Ltd, ISBN + 0954161793 +  File: gsl-ref.info, Node: Contributors to GSL, Next: Autoconf Macros, Prev: Debugging Numerical Programs, Up: Top *************** *** 850,858 **** For applications using `autoconf' the standard macro `AC_CHECK_LIB' can ! be used to link with the library automatically from a `configure' ! script. The library itself depends on the presence of a CBLAS and math ! library as well, so these must also be located before linking with the ! main `libgsl' file. The following commands should be placed in the ! `configure.in' file to perform these tests, AC_CHECK_LIB(m,main) --- 1019,1027 ---- For applications using `autoconf' the standard macro `AC_CHECK_LIB' can ! be used to link with GSL automatically from a `configure' script. The ! library itself depends on the presence of a CBLAS and math library as ! well, so these must also be located before linking with the main ! `libgsl' file. The following commands should be placed in the ! `configure.ac' file to perform these tests, AC_CHECK_LIB(m,main) *************** *** 894,900 **** is equal to `gsl-config --cflags' command. For example, ! libgsdv_la_LDFLAGS = \ ! $(GTK_LIBDIR) \ ! $(GTK_LIBS) -lgsdvgsl $(GSL_LIBS) -lgslcblas Note that the macro `AM_PATH_GSL' needs to use the C compiler so it --- 1063,1067 ---- is equal to `gsl-config --cflags' command. For example, ! libfoo_la_LDFLAGS = -lfoo $(GSL_LIBS) -lgslcblas Note that the macro `AM_PATH_GSL' needs to use the C compiler so it *************** *** 978,1116 **** - Function: float cblas_sdsdot (const int N, const float ALPHA, const ! float *X, const int INCX, const float *Y, const int INCY) ! - Function: double cblas_dsdot (const int N, const float *X, const int ! INCX, const float *Y, const int INCY) ! - Function: float cblas_sdot (const int N, const float *X, const int ! INCX, const float *Y, const int INCY) ! - Function: double cblas_ddot (const int N, const double *X, const int ! INCX, const double *Y, const int INCY) ! - Function: void cblas_cdotu_sub (const int N, const void *X, const ! int INCX, const void *Y, const int INCY, void *DOTU) ! - Function: void cblas_cdotc_sub (const int N, const void *X, const ! int INCX, const void *Y, const int INCY, void *DOTC) ! - Function: void cblas_zdotu_sub (const int N, const void *X, const ! int INCX, const void *Y, const int INCY, void *DOTU) ! - Function: void cblas_zdotc_sub (const int N, const void *X, const ! int INCX, const void *Y, const int INCY, void *DOTC) ! - Function: float cblas_snrm2 (const int N, const float *X, const int INCX) ! - Function: float cblas_sasum (const int N, const float *X, const int INCX) ! - Function: double cblas_dnrm2 (const int N, const double *X, const int INCX) ! - Function: double cblas_dasum (const int N, const double *X, const int INCX) ! - Function: float cblas_scnrm2 (const int N, const void *X, const int INCX) ! - Function: float cblas_scasum (const int N, const void *X, const int INCX) ! - Function: double cblas_dznrm2 (const int N, const void *X, const int ! INCX) ! - Function: double cblas_dzasum (const int N, const void *X, const int ! INCX) ! - Function: CBLAS_INDEX cblas_isamax (const int N, const float *X, const int INCX) ! - Function: CBLAS_INDEX cblas_idamax (const int N, const double *X, const int INCX) ! - Function: CBLAS_INDEX cblas_icamax (const int N, const void *X, const int INCX) ! - Function: CBLAS_INDEX cblas_izamax (const int N, const void *X, const int INCX) ! - Function: void cblas_sswap (const int N, float *X, const int INCX, ! float *Y, const int INCY) ! - Function: void cblas_scopy (const int N, const float *X, const int ! INCX, float *Y, const int INCY) - Function: void cblas_saxpy (const int N, const float ALPHA, const ! float *X, const int INCX, float *Y, const int INCY) ! - Function: void cblas_dswap (const int N, double *X, const int INCX, ! double *Y, const int INCY) ! - Function: void cblas_dcopy (const int N, const double *X, const int ! INCX, double *Y, const int INCY) - Function: void cblas_daxpy (const int N, const double ALPHA, const ! double *X, const int INCX, double *Y, const int INCY) ! - Function: void cblas_cswap (const int N, void *X, const int INCX, ! void *Y, const int INCY) ! - Function: void cblas_ccopy (const int N, const void *X, const int ! INCX, void *Y, const int INCY) ! - Function: void cblas_caxpy (const int N, const void *ALPHA, const ! void *X, const int INCX, void *Y, const int INCY) ! - Function: void cblas_zswap (const int N, void *X, const int INCX, ! void *Y, const int INCY) ! - Function: void cblas_zcopy (const int N, const void *X, const int ! INCX, void *Y, const int INCY) ! - Function: void cblas_zaxpy (const int N, const void *ALPHA, const ! void *X, const int INCX, void *Y, const int INCY) ! - Function: void cblas_srotg (float *A, float *B, float *C, float *S) ! - Function: void cblas_srotmg (float *D1, float *D2, float *B1, const ! float B2, float *P) ! - Function: void cblas_srot (const int N, float *X, const int INCX, ! float *Y, const int INCY, const float C, const float S) ! - Function: void cblas_srotm (const int N, float *X, const int INCX, ! float *Y, const int INCY, const float *P) ! - Function: void cblas_drotg (double *A, double *B, double *C, double ! *S) ! - Function: void cblas_drotmg (double *D1, double *D2, double *B1, ! const double B2, double *P) ! - Function: void cblas_drot (const int N, double *X, const int INCX, ! double *Y, const int INCY, const double C, const double S) ! - Function: void cblas_drotm (const int N, double *X, const int INCX, ! double *Y, const int INCY, const double *P) ! - Function: void cblas_sscal (const int N, const float ALPHA, float ! *X, const int INCX) - Function: void cblas_dscal (const int N, const double ALPHA, double ! *X, const int INCX) ! - Function: void cblas_cscal (const int N, const void *ALPHA, void *X, ! const int INCX) ! - Function: void cblas_zscal (const int N, const void *ALPHA, void *X, ! const int INCX) ! - Function: void cblas_csscal (const int N, const float ALPHA, void ! *X, const int INCX) ! - Function: void cblas_zdscal (const int N, const double ALPHA, void ! *X, const int INCX)  --- 1145,1284 ---- - Function: float cblas_sdsdot (const int N, const float ALPHA, const ! float * X, const int INCX, const float * Y, const int INCY) ! - Function: double cblas_dsdot (const int N, const float * X, const ! int INCX, const float * Y, const int INCY) ! - Function: float cblas_sdot (const int N, const float * X, const int ! INCX, const float * Y, const int INCY) ! - Function: double cblas_ddot (const int N, const double * X, const ! int INCX, const double * Y, const int INCY) ! - Function: void cblas_cdotu_sub (const int N, const void * X, const ! int INCX, const void * Y, const int INCY, void * DOTU) ! - Function: void cblas_cdotc_sub (const int N, const void * X, const ! int INCX, const void * Y, const int INCY, void * DOTC) ! - Function: void cblas_zdotu_sub (const int N, const void * X, const ! int INCX, const void * Y, const int INCY, void * DOTU) ! - Function: void cblas_zdotc_sub (const int N, const void * X, const ! int INCX, const void * Y, const int INCY, void * DOTC) ! - Function: float cblas_snrm2 (const int N, const float * X, const int INCX) ! - Function: float cblas_sasum (const int N, const float * X, const int INCX) ! - Function: double cblas_dnrm2 (const int N, const double * X, const int INCX) ! - Function: double cblas_dasum (const int N, const double * X, const int INCX) ! - Function: float cblas_scnrm2 (const int N, const void * X, const int INCX) ! - Function: float cblas_scasum (const int N, const void * X, const int INCX) ! - Function: double cblas_dznrm2 (const int N, const void * X, const ! int INCX) ! - Function: double cblas_dzasum (const int N, const void * X, const ! int INCX) ! - Function: CBLAS_INDEX cblas_isamax (const int N, const float * X, const int INCX) ! - Function: CBLAS_INDEX cblas_idamax (const int N, const double * X, const int INCX) ! - Function: CBLAS_INDEX cblas_icamax (const int N, const void * X, const int INCX) ! - Function: CBLAS_INDEX cblas_izamax (const int N, const void * X, const int INCX) ! - Function: void cblas_sswap (const int N, float * X, const int INCX, ! float * Y, const int INCY) ! - Function: void cblas_scopy (const int N, const float * X, const int ! INCX, float * Y, const int INCY) - Function: void cblas_saxpy (const int N, const float ALPHA, const ! float * X, const int INCX, float * Y, const int INCY) ! - Function: void cblas_dswap (const int N, double * X, const int INCX, ! double * Y, const int INCY) ! - Function: void cblas_dcopy (const int N, const double * X, const int ! INCX, double * Y, const int INCY) - Function: void cblas_daxpy (const int N, const double ALPHA, const ! double * X, const int INCX, double * Y, const int INCY) ! - Function: void cblas_cswap (const int N, void * X, const int INCX, ! void * Y, const int INCY) ! - Function: void cblas_ccopy (const int N, const void * X, const int ! INCX, void * Y, const int INCY) ! - Function: void cblas_caxpy (const int N, const void * ALPHA, const ! void * X, const int INCX, void * Y, const int INCY) ! - Function: void cblas_zswap (const int N, void * X, const int INCX, ! void * Y, const int INCY) ! - Function: void cblas_zcopy (const int N, const void * X, const int ! INCX, void * Y, const int INCY) ! - Function: void cblas_zaxpy (const int N, const void * ALPHA, const ! void * X, const int INCX, void * Y, const int INCY) ! - Function: void cblas_srotg (float * A, float * B, float * C, float * ! S) ! - Function: void cblas_srotmg (float * D1, float * D2, float * B1, ! const float B2, float * P) ! - Function: void cblas_srot (const int N, float * X, const int INCX, ! float * Y, const int INCY, const float C, const float S) ! - Function: void cblas_srotm (const int N, float * X, const int INCX, ! float * Y, const int INCY, const float * P) ! - Function: void cblas_drotg (double * A, double * B, double * C, ! double * S) ! - Function: void cblas_drotmg (double * D1, double * D2, double * B1, ! const double B2, double * P) ! - Function: void cblas_drot (const int N, double * X, const int INCX, ! double * Y, const int INCY, const double C, const double S) ! - Function: void cblas_drotm (const int N, double * X, const int INCX, ! double * Y, const int INCY, const double * P) ! - Function: void cblas_sscal (const int N, const float ALPHA, float * ! X, const int INCX) - Function: void cblas_dscal (const int N, const double ALPHA, double ! * X, const int INCX) ! - Function: void cblas_cscal (const int N, const void * ALPHA, void * ! X, const int INCX) ! - Function: void cblas_zscal (const int N, const void * ALPHA, void * ! X, const int INCX) ! - Function: void cblas_csscal (const int N, const float ALPHA, void * ! X, const int INCX) ! - Function: void cblas_zdscal (const int N, const double ALPHA, void * ! X, const int INCX)  *************** *** 1122,1441 **** - Function: void cblas_sgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const float ! ALPHA, const float *A, const int LDA, const float *X, const ! int INCX, const float BETA, float *Y, const int INCY) - Function: void cblas_sgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const float ALPHA, const float *A, const ! int LDA, const float *X, const int INCX, const float BETA, ! float *Y, const int INCY) - Function: void cblas_strmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float *A, const int ! LDA, float *X, const int INCX) - Function: void cblas_stbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const float ! *A, const int LDA, float *X, const int INCX) - Function: void cblas_stpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float *AP, float *X, ! const int INCX) - Function: void cblas_strsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float *A, const int ! LDA, float *X, const int INCX) - Function: void cblas_stbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const float ! *A, const int LDA, float *X, const int INCX) - Function: void cblas_stpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float *AP, float *X, ! const int INCX) - Function: void cblas_dgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const ! double ALPHA, const double *A, const int LDA, const double ! *X, const int INCX, const double BETA, double *Y, const int INCY) - Function: void cblas_dgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const double ALPHA, const double *A, const ! int LDA, const double *X, const int INCX, const double BETA, ! double *Y, const int INCY) - Function: void cblas_dtrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double *A, const int ! LDA, double *X, const int INCX) - Function: void cblas_dtbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const enum CBLAS_DIAG DIAG, const int N, const int K, const double ! *A, const int LDA, double *X, const int INCX) - Function: void cblas_dtpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double *AP, double ! *X, const int INCX) - Function: void cblas_dtrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double *A, const int ! LDA, double *X, const int INCX) - Function: void cblas_dtbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const enum CBLAS_DIAG DIAG, const int N, const int K, const double ! *A, const int LDA, double *X, const int INCX) - Function: void cblas_dtpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double *AP, double ! *X, const int INCX) - Function: void cblas_cgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const void ! *ALPHA, const void *A, const int LDA, const void *X, const ! int INCX, const void *BETA, void *Y, const int INCY) - Function: void cblas_cgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const void *ALPHA, const void *A, const int ! LDA, const void *X, const int INCX, const void *BETA, void ! *Y, const int INCY) - Function: void cblas_ctrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *A, const int ! LDA, void *X, const int INCX) - Function: void cblas_ctbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void ! *A, const int LDA, void *X, const int INCX) - Function: void cblas_ctpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *AP, void *X, const int INCX) - Function: void cblas_ctrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *A, const int ! LDA, void *X, const int INCX) - Function: void cblas_ctbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void ! *A, const int LDA, void *X, const int INCX) - Function: void cblas_ctpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *AP, void *X, const int INCX) - Function: void cblas_zgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const void ! *ALPHA, const void *A, const int LDA, const void *X, const ! int INCX, const void *BETA, void *Y, const int INCY) - Function: void cblas_zgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const void *ALPHA, const void *A, const int ! LDA, const void *X, const int INCX, const void *BETA, void ! *Y, const int INCY) - Function: void cblas_ztrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *A, const int ! LDA, void *X, const int INCX) - Function: void cblas_ztbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void ! *A, const int LDA, void *X, const int INCX) - Function: void cblas_ztpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *AP, void *X, const int INCX) - Function: void cblas_ztrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *A, const int ! LDA, void *X, const int INCX) - Function: void cblas_ztbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void ! *A, const int LDA, void *X, const int INCX) - Function: void cblas_ztpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void *AP, void *X, const int INCX) - Function: void cblas_ssymv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *A, const int LDA, const float *X, const int INCX, const ! float BETA, float *Y, const int INCY) - Function: void cblas_ssbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const int K, const float ALPHA, ! const float *A, const int LDA, const float *X, const int ! INCX, const float BETA, float *Y, const int INCY) - Function: void cblas_sspmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *AP, const float *X, const int INCX, const float BETA, float ! *Y, const int INCY) - Function: void cblas_sger (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const float ALPHA, const float *X, const int ! INCX, const float *Y, const int INCY, float *A, const int LDA) - Function: void cblas_ssyr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *X, const int INCX, float *A, const int LDA) - Function: void cblas_sspr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *X, const int INCX, float *AP) - Function: void cblas_ssyr2 (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *X, const int INCX, const float *Y, const int INCY, float *A, ! const int LDA) - Function: void cblas_sspr2 (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! *X, const int INCX, const float *Y, const int INCY, float *A) - Function: void cblas_dsymv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *A, const int LDA, const double *X, const int INCX, ! const double BETA, double *Y, const int INCY) - Function: void cblas_dsbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const int K, const double ! ALPHA, const double *A, const int LDA, const double *X, const ! int INCX, const double BETA, double *Y, const int INCY) - Function: void cblas_dspmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *AP, const double *X, const int INCX, const double ! BETA, double *Y, const int INCY) - Function: void cblas_dger (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const double ALPHA, const double *X, const ! int INCX, const double *Y, const int INCY, double *A, const int LDA) - Function: void cblas_dsyr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *X, const int INCX, double *A, const int LDA) - Function: void cblas_dspr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *X, const int INCX, double *AP) - Function: void cblas_dsyr2 (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *X, const int INCX, const double *Y, const int INCY, ! double *A, const int LDA) - Function: void cblas_dspr2 (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const ! double *X, const int INCX, const double *Y, const int INCY, ! double *A) - Function: void cblas_chemv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *A, const int LDA, const void *X, const int INCX, const void ! *BETA, void *Y, const int INCY) - Function: void cblas_chbmv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const int K, const void *ALPHA, ! const void *A, const int LDA, const void *X, const int INCX, ! const void *BETA, void *Y, const int INCY) - Function: void cblas_chpmv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *AP, const void *X, const int INCX, const void *BETA, void ! *Y, const int INCY) - Function: void cblas_cgeru (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const void *ALPHA, const void *X, const int ! INCX, const void *Y, const int INCY, void *A, const int LDA) - Function: void cblas_cgerc (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const void *ALPHA, const void *X, const int ! INCX, const void *Y, const int INCY, void *A, const int LDA) - Function: void cblas_cher (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const float ALPHA, const void ! *X, const int INCX, void *A, const int LDA) - Function: void cblas_chpr (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const float ALPHA, const void ! *X, const int INCX, void *A) - Function: void cblas_cher2 (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *X, const int INCX, const void *Y, const int INCY, void *A, ! const int LDA) - Function: void cblas_chpr2 (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *X, const int INCX, const void *Y, const int INCY, void *AP) - Function: void cblas_zhemv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *A, const int LDA, const void *X, const int INCX, const void ! *BETA, void *Y, const int INCY) - Function: void cblas_zhbmv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const int K, const void *ALPHA, ! const void *A, const int LDA, const void *X, const int INCX, ! const void *BETA, void *Y, const int INCY) - Function: void cblas_zhpmv (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *AP, const void *X, const int INCX, const void *BETA, void ! *Y, const int INCY) - Function: void cblas_zgeru (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const void *ALPHA, const void *X, const int ! INCX, const void *Y, const int INCY, void *A, const int LDA) - Function: void cblas_zgerc (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const void *ALPHA, const void *X, const int ! INCX, const void *Y, const int INCY, void *A, const int LDA) - Function: void cblas_zher (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const void ! *X, const int INCX, void *A, const int LDA) - Function: void cblas_zhpr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const double ALPHA, const void ! *X, const int INCX, void *A) - Function: void cblas_zher2 (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *X, const int INCX, const void *Y, const int INCY, void *A, ! const int LDA) - Function: void cblas_zhpr2 (const enum CBLAS_ORDER ORDER, const enum ! CBLAS_UPLO UPLO, const int N, const void *ALPHA, const void ! *X, const int INCX, const void *Y, const int INCY, void *AP)  --- 1290,1613 ---- - Function: void cblas_sgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const float ! ALPHA, const float * A, const int LDA, const float * X, const ! int INCX, const float BETA, float * Y, const int INCY) - Function: void cblas_sgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const float ALPHA, const float * A, const ! int LDA, const float * X, const int INCX, const float BETA, ! float * Y, const int INCY) - Function: void cblas_strmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float * A, const int ! LDA, float * X, const int INCX) - Function: void cblas_stbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const float * ! A, const int LDA, float * X, const int INCX) - Function: void cblas_stpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float * AP, float * ! X, const int INCX) - Function: void cblas_strsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float * A, const int ! LDA, float * X, const int INCX) - Function: void cblas_stbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const float * ! A, const int LDA, float * X, const int INCX) - Function: void cblas_stpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const float * AP, float * ! X, const int INCX) - Function: void cblas_dgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const ! double ALPHA, const double * A, const int LDA, const double * ! X, const int INCX, const double BETA, double * Y, const int INCY) - Function: void cblas_dgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const double ALPHA, const double * A, const ! int LDA, const double * X, const int INCX, const double BETA, ! double * Y, const int INCY) - Function: void cblas_dtrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double * A, const ! int LDA, double * X, const int INCX) - Function: void cblas_dtbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const enum CBLAS_DIAG DIAG, const int N, const int K, const double ! * A, const int LDA, double * X, const int INCX) - Function: void cblas_dtpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double * AP, double ! * X, const int INCX) - Function: void cblas_dtrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double * A, const ! int LDA, double * X, const int INCX) - Function: void cblas_dtbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const enum CBLAS_DIAG DIAG, const int N, const int K, const double ! * A, const int LDA, double * X, const int INCX) - Function: void cblas_dtpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const double * AP, double ! * X, const int INCX) - Function: void cblas_cgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const void ! * ALPHA, const void * A, const int LDA, const void * X, const ! int INCX, const void * BETA, void * Y, const int INCY) - Function: void cblas_cgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const void * ALPHA, const void * A, const ! int LDA, const void * X, const int INCX, const void * BETA, ! void * Y, const int INCY) - Function: void cblas_ctrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * A, const int ! LDA, void * X, const int INCX) - Function: void cblas_ctbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void * ! A, const int LDA, void * X, const int INCX) - Function: void cblas_ctpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * AP, void * X, const int INCX) - Function: void cblas_ctrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * A, const int ! LDA, void * X, const int INCX) - Function: void cblas_ctbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void * ! A, const int LDA, void * X, const int INCX) - Function: void cblas_ctpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * AP, void * X, const int INCX) - Function: void cblas_zgemv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const void ! * ALPHA, const void * A, const int LDA, const void * X, const ! int INCX, const void * BETA, void * Y, const int INCY) - Function: void cblas_zgbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_TRANSPOSE TRANSA, const int M, const int N, const int ! KL, const int KU, const void * ALPHA, const void * A, const ! int LDA, const void * X, const int INCX, const void * BETA, ! void * Y, const int INCY) - Function: void cblas_ztrmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * A, const int ! LDA, void * X, const int INCX) - Function: void cblas_ztbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void * ! A, const int LDA, void * X, const int INCX) - Function: void cblas_ztpmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * AP, void * X, const int INCX) - Function: void cblas_ztrsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * A, const int ! LDA, void * X, const int INCX) - Function: void cblas_ztbsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const int K, const void * ! A, const int LDA, void * X, const int INCX) - Function: void cblas_ztpsv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const enum CBLAS_TRANSPOSE TRANSA, const ! enum CBLAS_DIAG DIAG, const int N, const void * AP, void * X, const int INCX) - Function: void cblas_ssymv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! * A, const int LDA, const float * X, const int INCX, const ! float BETA, float * Y, const int INCY) - Function: void cblas_ssbmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const int K, const float ALPHA, ! const float * A, const int LDA, const float * X, const int ! INCX, const float BETA, float * Y, const int INCY) - Function: void cblas_sspmv (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! * AP, const float * X, const int INCX, const float BETA, ! float * Y, const int INCY) - Function: void cblas_sger (const enum CBLAS_ORDER ORDER, const int ! M, const int N, const float ALPHA, const float * X, const int ! INCX, const float * Y, const int INCY, float * A, const int ! LDA) - Function: void cblas_ssyr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! * X, const int INCX, float * A, const int LDA) - Function: void cblas_sspr (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const int N, const float ALPHA, const float ! * X, const int INCX, float * AP) - Function: void cblas_ssyr2 (const enum CBLAS_ORDER ORDER, const enum CBLAS_UPLO UPLO, const i