rb-gsl 1.15.3.1 → 1.15.3.2

data/ext/signal.c

@@ -104,7 +104,7 @@ static VALUE rb_gsl_fft_conv_corr(int argc, VALUE *argv, VALUE obj,
         enum FFT_CONV_CORR flag1,
         enum FFT_CONV_CORR flag2)
 {
-  double *data1, *data2, *data3;
+  double *data1, *data2, *data3 = NULL;
   size_t stride1, stride2, size1, size2;
 #ifdef HAVE_NARRAY_H
   int naflag1, naflag2, shape;
@@ -118,7 +118,7 @@ static VALUE rb_gsl_fft_conv_corr(int argc, VALUE *argv, VALUE obj,
   int flagt = 0, flagw = 0;
   //  size_t i;
   gsl_vector *vtmp1 = NULL, *vtmp2 = NULL;
-  VALUE ary;
+  VALUE ary = NULL;
   switch (argc) {
   case 3:
     data1 = get_ptr_double3(obj, &size1, &stride1, &naflag1);

data/ext/vector_complex.c

@@ -250,7 +250,7 @@ void rb_gsl_vector_complex_set_subvector(int argc, VALUE *argv, gsl_vector_compl
     gsl_vector_complex_memcpy(&vv.vector, vother);
   } else if(rb_obj_is_kind_of(other, rb_cArray)) {
     // TODO Support other forms of Array contents as well
-    if(n != RARRAY_LEN(other)) {
+    if((int) n != RARRAY_LEN(other)) {
       rb_raise(rb_eRangeError, "lengths do not match (%d != %d)", (int) n, (int) RARRAY_LEN(other));
     }
     for(i = 0; i < n; i++) {
@@ -335,10 +335,11 @@ static VALUE rb_gsl_vector_complex_reverse_each(VALUE obj)
   gsl_complex * zp;
   size_t i;
   Data_Get_Struct(obj, gsl_vector_complex, v);
-  for (i = v->size-1; i >= 0; i--) {
+  for (i = v->size-1;; i--) {
     vz = Data_Make_Struct(cgsl_complex, gsl_complex, 0, free, zp);
     *zp = gsl_vector_complex_get(v, i);
     rb_yield(vz);
+    if (i == 0) break;
   }
   return obj;
 }
@@ -357,7 +358,7 @@ static VALUE rb_gsl_vector_complex_reverse_each_index(VALUE obj)
   gsl_vector_complex *v = NULL;
   size_t i;
   Data_Get_Struct(obj, gsl_vector_complex, v);
-  for (i = v->size-1; i >= 0; i--) {
+  for (i = v->size-1;; i--) {
     rb_yield(INT2FIX(i));
     if (i == 0) break;
   }
@@ -860,7 +861,7 @@ static VALUE rb_gsl_vector_complex_ifftshift_bang(VALUE obj)
 static VALUE rb_gsl_vector_complex_ifftshift(VALUE obj)
 {
   return rb_gsl_vector_complex_ifftshift_bang(rb_gsl_vector_complex_clone(obj));
-  gsl_vector_complex *v, *vnew;
+  /*gsl_vector_complex *v, *vnew;
   gsl_vector_complex_view vv, vvnew;
   size_t n;
 
@@ -876,7 +877,7 @@ static VALUE rb_gsl_vector_complex_ifftshift(VALUE obj)
   vvnew = gsl_vector_complex_subvector(v, (n+1)/2, n/2);
   gsl_vector_complex_memcpy(&vvnew.vector, &vv.vector);
 
-  return Data_Wrap_Struct(VECTOR_COMPLEX_ROW_COL(obj), 0, gsl_vector_complex_free, vnew);  
+  return Data_Wrap_Struct(VECTOR_COMPLEX_ROW_COL(obj), 0, gsl_vector_complex_free, vnew);  */
 }
 
 static VALUE rb_gsl_vector_complex_isnull(VALUE obj)
@@ -939,9 +940,9 @@ static VALUE rb_gsl_vector_complex_trans(VALUE obj)
 static VALUE rb_gsl_vector_complex_trans2(VALUE obj)
 {
   if (CLASS_OF(obj) == cgsl_vector_complex) 
-    RBASIC(obj)->klass = cgsl_vector_complex_col;
+    RBGSL_SET_CLASS(obj, cgsl_vector_complex_col);
   else if (CLASS_OF(obj) == cgsl_vector_complex_col) 
-    RBASIC(obj)->klass = cgsl_vector_complex;
+    RBGSL_SET_CLASS(obj, cgsl_vector_complex);
   else {
     rb_raise(rb_eRuntimeError, "method trans! for %s is forbidden",
 	     rb_class2name(CLASS_OF(obj)));
@@ -1961,18 +1962,18 @@ static VALUE rb_gsl_vector_complex_zip(int argc, VALUE *argv, VALUE obj)
     argc2 = argc - 1;
     argv2 = argv + 1;
   }
-  for (i = 0; i < argc2; i++) {
+  for (i = 0; (int) i < argc2; i++) {
     CHECK_VECTOR_COMPLEX(argv2[i]);
   }
   vp = (gsl_vector_complex**) malloc(sizeof(gsl_vector_complex**));
-  for (i = 0; i < argc2; i++) {
+  for (i = 0; (int) i < argc2; i++) {
     Data_Get_Struct(argv2[i], gsl_vector_complex, vp[i]);
   }
   ary = rb_ary_new2(v0->size);
   for (i = 0; i < v0->size; i++) {
     vnew = gsl_vector_complex_alloc(argc2 + 1);
     gsl_vector_complex_set(vnew, 0, gsl_vector_complex_get(v0, i));
-    for (j = 0; j < argc2; j++) {
+    for (j = 0; (int) j < argc2; j++) {
       if (i < vp[j]->size) {
 	gsl_vector_complex_set(vnew, j+1, gsl_vector_complex_get(vp[j], i));
       } else {

data/ext/vector_double.c

@@ -914,13 +914,15 @@ static VALUE rb_gsl_vector_filescan_na(VALUE klass, VALUE file)
   strcpy(filename, STR2CSTR(file));
   sprintf(buf, "wc %s", filename);
   fp = popen(buf, "r");
-  fgets(buf, 1024, fp);
+  if (fgets(buf, 1024, fp) == NULL)
+    rb_sys_fail(0);
   pclose(fp);
   sscanf(buf, "%d", &nn);
   lines = (size_t) nn;      /* vector length */
   shape[0] = lines;
   fp = fopen(filename, "r");
-  fgets(buf, 1024, fp);
+  if (fgets(buf, 1024, fp) == NULL)
+    rb_sys_fail(0);
   n = count_columns(buf);   /* number of vectors created */
   ptr = (double**) xmalloc(sizeof(double**)*n);
   ary = rb_ary_new2(n);
@@ -934,7 +936,8 @@ static VALUE rb_gsl_vector_filescan_na(VALUE klass, VALUE file)
     else break;
   }
   for (i = 1; i < lines; i++) {
-    fgets(buf, 1024, fp);
+    if (fgets(buf, 1024, fp) == NULL)
+      rb_sys_fail(0);
     p = buf;
     for (j = 0; j < n; j++) {
       p = str_scan_double(p, &val);
@@ -1252,7 +1255,7 @@ static VALUE rb_gsl_vector_clip(int argc, VALUE *argv, VALUE obj)
     x = gsl_vector_get(v, i);
     if (x > hi) x = hi;
     else if (x < lo) x = lo;
-    else;
+    else {};
     gsl_vector_set(vnew, i, x);
   }
   return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew);

data/ext/vector_source.c

@@ -95,7 +95,7 @@ void parse_subvector_args(int argc, VALUE *argv, size_t size,
     } else {
       CHECK_FIXNUM(argv[0]);
       length = FIX2INT(argv[0]);
-      if((length < 0 && -length > size) || (length > 0 && length > size)) {
+      if((length < 0 && -length > (int) size) || (length > 0 && length > (int) size)) {
         rb_raise(rb_eRangeError,
             "length %d is out of range for Vector of length %d",
 		 length, (int) size);
@@ -283,7 +283,7 @@ VALUE FUNCTION(rb_gsl_vector,new)(int argc, VALUE *argv, VALUE klass)
   default:
     v = FUNCTION(gsl_vector,alloc)(argc);
     if (v == NULL) rb_raise(rb_eNoMemError, "gsl_vector_alloc failed");
-    for (i = 0; i < argc; i++) {
+    for (i = 0; (int) i < argc; i++) {
       switch(TYPE(argv[i])) {
         case T_FIXNUM: case T_BIGNUM: case T_FLOAT:
           xnative = NUMCONV2(argv[i]);
@@ -348,7 +348,7 @@ static VALUE FUNCTION(rb_gsl_vector,get)(int argc, VALUE *argv, VALUE obj)
         vnew = FUNCTION(gsl_vector,alloc)(p->size);
         for (j = 0; j < p->size; j++) {
           k = p->data[j];
-          if (k < 0) k = p->size + j;
+          //if (k < 0) k = p->size + j;
           FUNCTION(gsl_vector,set)(vnew, j, FUNCTION(gsl_vector,get)(v, k));
         }
         retval = Data_Wrap_Struct(GSL_TYPE(cgsl_vector), 0, FUNCTION(gsl_vector,free), vnew);
@@ -412,7 +412,7 @@ void FUNCTION(rb_gsl_vector,set_subvector)(int argc, VALUE *argv, GSL_TYPE(gsl_v
     // Views) well.
     FUNCTION(gsl_vector,memcpy)(&vv.vector, vother);
   } else if(rb_obj_is_kind_of(other, rb_cArray)) {
-    if(n != RARRAY_LEN(other)) {
+    if((int) n != RARRAY_LEN(other)) {
       rb_raise(rb_eRangeError, "lengths do not match (%d != %d)", (int) n, (int) RARRAY_LEN(other));
     }
     for(i = 0; i < n; i++) {
@@ -511,7 +511,7 @@ static VALUE FUNCTION(rb_gsl_vector,reverse_each)(VALUE obj)
   GSL_TYPE(gsl_vector) *v = NULL;
   size_t i;
   Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
-  for (i = v->size-1; i >= 0; i--) {
+  for (i = v->size-1;; i--) {
     rb_yield(C_TO_VALUE2(FUNCTION(gsl_vector,get)(v, i)));
     if (i == 0) break;
   }
@@ -532,7 +532,7 @@ static VALUE FUNCTION(rb_gsl_vector,reverse_each_index)(VALUE obj)
   GSL_TYPE(gsl_vector) *v = NULL;
   size_t i;
   Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
-  for (i = v->size-1; i >= 0; i--) {
+  for (i = v->size-1;; i--) {
     rb_yield(INT2FIX(i));
     if (i == 0) break;
   }
@@ -673,15 +673,15 @@ static VALUE FUNCTION(rb_gsl_vector,trans)(VALUE obj)
 static VALUE FUNCTION(rb_gsl_vector,trans_bang)(VALUE obj)
 {
 #ifdef BASE_DOUBLE
-  if (CLASS_OF(obj) == cgsl_vector) RBASIC(obj)->klass = cgsl_vector_col;
-  else if (CLASS_OF(obj) == cgsl_vector_col) RBASIC(obj)->klass = cgsl_vector;
+  if (CLASS_OF(obj) == cgsl_vector) RBGSL_SET_CLASS(obj, cgsl_vector_col);
+  else if (CLASS_OF(obj) == cgsl_vector_col) RBGSL_SET_CLASS(obj, cgsl_vector);
   else {
     rb_raise(rb_eRuntimeError, "method trans! for %s is not permitted.",
 	     rb_class2name(CLASS_OF(obj)));
   }	
 #elif defined(BASE_INT)
-  if (CLASS_OF(obj) == cgsl_vector_int) RBASIC(obj)->klass = cgsl_vector_int_col;
-  else if (CLASS_OF(obj) == cgsl_vector_int_col) RBASIC(obj)->klass = cgsl_vector_int;
+  if (CLASS_OF(obj) == cgsl_vector_int) RBGSL_SET_CLASS(obj, cgsl_vector_int_col);
+  else if (CLASS_OF(obj) == cgsl_vector_int_col) RBGSL_SET_CLASS(obj, cgsl_vector_int);
   else {
     rb_raise(rb_eRuntimeError, "method trans! for %s is not permitted.",
 	     rb_class2name(CLASS_OF(obj)));
@@ -757,7 +757,7 @@ static VALUE FUNCTION(rb_gsl_vector,connect)(int argc, VALUE *argv, VALUE obj)
     Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
     total += v->size;
   }
-  for (i = 0; i < argc; i++) {
+  for (i = 0; (int) i < argc; i++) {
     CHECK_VEC(argv[i]);
     Data_Get_Struct(argv[i], GSL_TYPE(gsl_vector), v);
     total += v->size;
@@ -769,7 +769,7 @@ static VALUE FUNCTION(rb_gsl_vector,connect)(int argc, VALUE *argv, VALUE obj)
     memcpy(ptr, v->data, sizeof(BASE)*v->size);
     ptr += v->size;
   }
-  for (i = 0; i < argc; i++) {
+  for (i = 0; (int) i < argc; i++) {
     Data_Get_Struct(argv[i], GSL_TYPE(gsl_vector), v);
     memcpy(ptr, v->data, sizeof(BASE)*v->size);
     ptr += v->size;
@@ -1345,7 +1345,7 @@ VALUE FUNCTION(rb_gsl_vector,to_s)(VALUE obj)
     for (i = 1; i < v->size; i++) {
       sprintf(buf,  PRINTF_FORMAT, FUNCTION(gsl_vector,get)(v, i));
       rb_str_cat(str, buf, strlen(buf));
-      if (i >= (55/dig) && i != v->size-1) {
+      if ((int) i >= (55/dig) && i != v->size-1) {
         strcpy(buf, "... ");
         rb_str_cat(str, buf, strlen(buf));
         break;
@@ -1409,7 +1409,7 @@ static VALUE FUNCTION(rb_gsl_vector,subvector_with_stride)(int argc, VALUE *argv
       if(offset < 0) {
         rb_raise(rb_eRangeError, "offset %d out of range", offset - (int)v->size);
       }
-    } else if(offset >= v->size) {
+    } else if(offset >= (int) v->size) {
       rb_raise(rb_eRangeError, "offset %d out of range", offset);
     }
     if(step == 0) {
@@ -1487,7 +1487,7 @@ static VALUE FUNCTION(rb_gsl_vector,matrix_view_with_tda)(VALUE obj, VALUE nn1,
 void FUNCTION(mygsl_vector,shift)(GSL_TYPE(gsl_vector) *p, size_t n)
 {
   size_t i;
-  for (i = n; i >= 0; i--) {
+  for (i = n;; i--) {
     FUNCTION(gsl_vector,set)(p, i+1, FUNCTION(gsl_vector,get)(p, i));
     if (i == 0) break;
   }
@@ -1497,7 +1497,7 @@ void FUNCTION(mygsl_vector,shift)(GSL_TYPE(gsl_vector) *p, size_t n)
 void FUNCTION(mygsl_vector,shift_scale2)(GSL_TYPE(gsl_vector) *p, size_t n)
 {
   size_t i;
-  for (i = n; i >= 0; i--) {
+  for (i = n;; i--) {
     FUNCTION(gsl_vector,set)(p, i+1, 2*FUNCTION(gsl_vector,get)(p, i));
     if (i == 0) break;
   }
@@ -1617,7 +1617,7 @@ static VALUE FUNCTION(rb_gsl_vector,to_gplot)(int argc, VALUE *argv, VALUE obj)
     istart = 1;
     break;
   }
-  for (i = 0; i < argc; i++) {
+  for (i = 0; (int) i < argc; i++) {
     if (TYPE(argv[0]) == T_ARRAY) tmp = rb_ary_entry(argv[0], i);
     else tmp = argv[i];
     CHECK_VEC(tmp);
@@ -1699,7 +1699,7 @@ GSL_TYPE(gsl_vector)* FUNCTION(mygsl_vector,mul_matrix)(GSL_TYPE(gsl_vector) *v,
 void FUNCTION(mygsl_vector,to_m_circulant)(GSL_TYPE(gsl_matrix) *m, GSL_TYPE(gsl_vector) *v)
 {
   size_t i, j;
-  for (i = v->size-1; i >= 0; i--) {
+  for (i = v->size-1;; i--) {
     for (j = 0; j < v->size; j++) {
       if (j <= i) FUNCTION(gsl_matrix,set)(m, i, j, FUNCTION(gsl_vector,get)(v, v->size-1-i+j));
       else FUNCTION(gsl_matrix,set)(m, i, j, FUNCTION(gsl_vector,get)(v, j-i-1));
@@ -2157,7 +2157,7 @@ static VALUE FUNCTION(rb_gsl_vector,delete_at)(VALUE obj, VALUE ii)
   if (i2 < 0) {
     i2 += v->size;
   }
-  if (i2 < 0 || i2 > v->size-1) return Qnil;
+  if (i2 < 0 || i2 > (int) (v->size-1)) return Qnil;
   i = (size_t) i2;
   x = FUNCTION(gsl_vector,get)(v, i);
   memmove(v->data+i, v->data+i+1, sizeof(BASE)*(v->size-1-i));
@@ -2209,7 +2209,7 @@ static VALUE FUNCTION(rb_gsl_vector,delete)(VALUE obj, VALUE yy)
     }
   }
   v->size -= count;
-  return count ? y : Qnil;
+  return count ? (VALUE) y : Qnil;
 }
 
 /* singleton method */
@@ -2233,14 +2233,16 @@ static VALUE FUNCTION(rb_gsl_vector,filescan)(VALUE klass, VALUE file)
   sprintf(buf, "sed '/^#/d' %s | wc", filename);
   if ((fp = popen(buf, "r")) == NULL) 
     rb_raise(rb_eIOError, "popen failed.");
-  fgets(buf, 1024, fp);
+  if (fgets(buf, 1024, fp) == NULL)
+    rb_sys_fail(0);
   pclose(fp);
   sscanf(buf, "%d", &nn);
   lines = (size_t) nn;  /*  vector length */
   if ((fp = fopen(filename, "r")) == NULL) 
     rb_raise(rb_eIOError, "cannot open file %s.", filename);
   while (1) {
-	  fgets(buf, 1024, fp);    /* read the first line to count number of columns */
+	  if (fgets(buf, 1024, fp) == NULL)    /* read the first line to count number of columns */
+      rb_sys_fail(0);
 	  if (buf[0] == '#') continue;
 	  else break;
 	}
@@ -2254,7 +2256,8 @@ static VALUE FUNCTION(rb_gsl_vector,filescan)(VALUE klass, VALUE file)
   rewind(fp);
   for (i = 0, ii = 0; ii < lines; i++) {
 		pos = ftell(fp);
-		fgets(buf, 1024, fp);
+		if (fgets(buf, 1024, fp) == NULL)
+      rb_sys_fail(0);
 		if (buf[0] == '#') continue;
 		fseek(fp, pos, SEEK_SET);
     for (j = 0, jj = 0; jj < n; j++) {
@@ -2871,18 +2874,18 @@ static VALUE FUNCTION(rb_gsl_vector,zip)(int argc, VALUE *argv, VALUE obj)
     argc2 = argc - 1;
     argv2 = argv + 1;
   }
-  for (i = 0; i < argc2; i++) {
+  for (i = 0; (int) i < argc2; i++) {
     CHECK_VEC(argv2[i]);
   }
   vp = (GSL_TYPE(gsl_vector)**) malloc(sizeof(GSL_TYPE(gsl_vector)**));
-  for (i = 0; i < argc2; i++) {
+  for (i = 0; (int) i < argc2; i++) {
     Data_Get_Struct(argv2[i], GSL_TYPE(gsl_vector), vp[i]);
   }
   ary = rb_ary_new2(v0->size);
   for (i = 0; i < v0->size; i++) {
     vnew = FUNCTION(gsl_vector,alloc)(argc2 + 1);
     FUNCTION(gsl_vector,set)(vnew, 0, FUNCTION(gsl_vector,get)(v0, i));
-    for (j = 0; j < argc2; j++) {
+    for (j = 0; (int) j < argc2; j++) {
       if (i < vp[j]->size) {
 	FUNCTION(gsl_vector,set)(vnew, j+1, FUNCTION(gsl_vector,get)(vp[j], i));
       } else {

data/ext/wavelet.c

@@ -363,7 +363,7 @@ static VALUE rb_gsl_wavelet_trans(int argc, VALUE *argv, VALUE obj,
   //int status;
   double *ptr1 = NULL, *ptr2 = NULL;
   size_t n, stride;
-  VALUE ary, ret;
+  VALUE ary = NULL, ret;
 #ifdef HAVE_NARRAY_H
   struct NARRAY *na;
 #endif

data/include/rb_gsl_common.h

@@ -293,6 +293,18 @@ EXTERN ID rb_gsl_id_beg, rb_gsl_id_end, rb_gsl_id_excl, rb_gsl_id_to_a;
     rb_raise(rb_eTypeError, "wrong argument type (GSL::Histogram expected)");
 #endif
 
+#ifndef RBGSL_SET_CLASS
+#ifdef RB_OBJ_WRITE
+#define RBGSL_SET_CLASS0(obj0, cls) RB_OBJ_WRITE(obj0, &(RBASIC_CLASS(obj0)), cls)
+#else
+#define RBGSL_SET_CLASS0(obj0, cls) RBASIC(obj0)->klass = cls
+#endif
+#define RBGSL_SET_CLASS(obj, cls) do { \
+  VALUE _obj_ = (obj); \
+  RBGSL_SET_CLASS0(_obj_, cls); \
+} while (0)
+#endif
+
 void rb_gsl_error_handler(const char *reason, const char *file,
 				 int line, int gsl_errno);
 

data/include/rb_gsl_config.h

@@ -52,11 +52,20 @@
 #ifndef GSL_1_15_LATER
 #define GSL_1_15_LATER
 #endif
+#ifndef HAVE_EIGEN_FRANCIS
+#define HAVE_EIGEN_FRANCIS
+#endif
 #ifndef RUBY_GSL_VERSION
-#define RUBY_GSL_VERSION "1.15.0"
+#define RUBY_GSL_VERSION "1.15.3"
 #endif
 #ifndef RUBY_1_8_LATER
 #define RUBY_1_8_LATER
 #endif
+#ifndef RUBY_1_9_LATER
+#define RUBY_1_9_LATER
+#endif
+#ifndef RUBY_1_9_2_LATER
+#define RUBY_1_9_2_LATER
+#endif
 
 #endif

data/rdoc/blas.rdoc

@@ -260,10 +260,10 @@
 # * GSL::Blas::Right
 #
 #
-# {prev}[link:files/rdoc/sort_rdoc.html]
-# {next}[link:files/rdoc/linalg_rdoc.html]
+# {prev}[link:rdoc/sort_rdoc.html]
+# {next}[link:rdoc/linalg_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/bspline.rdoc

@@ -2,10 +2,10 @@
 # = Basis Splines
 # This chapter describes functions for the computation of smoothing basis splines (B-splines). This is only for GSL-1.9 or later.
 #
-# 1. {Overview}[link:files/rdoc/bspline_rdoc.html#1]
-# 1. {Initializing the B-splines solver}[link:files/rdoc/bspline_rdoc.html#2]
-# 1. {Constructing the knots vector}[link:files/rdoc/bspline_rdoc.html#3]
-# 1. {Evaluation of B-splines}[link:files/rdoc/bspline_rdoc.html#4]
+# 1. {Overview}[link:rdoc/bspline_rdoc.html#1]
+# 1. {Initializing the B-splines solver}[link:rdoc/bspline_rdoc.html#2]
+# 1. {Constructing the knots vector}[link:rdoc/bspline_rdoc.html#3]
+# 1. {Evaluation of B-splines}[link:rdoc/bspline_rdoc.html#4]
 #
 # == {}[link:index.html"name="1] Overview
 #
@@ -34,9 +34,9 @@
 #
 #   This method evaluates all B-spline basis functions at the position <tt>x</tt> and stores them in <tt>B</tt> (if given), so that the ith element of <tt>B</tt> is <tt>B_i(x)</tt>. <tt>B</tt> must be of length <tt>n = nbreak + k - 2</tt>. If <tt>B</tt> is not given, a newly created vector is returned.It is far more efficient to compute all of the basis functions at once than to compute them individually, due to the nature of the defining recurrence relation. 
 #
-# {prev}[link:files/rdoc/nonlinearfit_rdoc.html]
-# {next}[link:files/rdoc/const_rdoc.html]
+# {prev}[link:rdoc/nonlinearfit_rdoc.html]
+# {next}[link:rdoc/const_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #

data/rdoc/cheb.rdoc

@@ -10,10 +10,10 @@
 # T_0(x) = 1, T_1(x) = x, T_2(x) = 2 x^2 - 1. 
 # For further information see Abramowitz & Stegun, Chapter 22. 
 #
-# 1. {GSL::Cheb class}[link:files/rdoc/cheb_rdoc.html#1]
-# 1. {Chebyshev Series Evaluation}[link:files/rdoc/cheb_rdoc.html#2]
-# 1. {Derivatives and Integrals}[link:files/rdoc/cheb_rdoc.html#3]
-# 1. {Examples}[link:files/rdoc/cheb_rdoc.html#4]
+# 1. {GSL::Cheb class}[link:rdoc/cheb_rdoc.html#1]
+# 1. {Chebyshev Series Evaluation}[link:rdoc/cheb_rdoc.html#2]
+# 1. {Derivatives and Integrals}[link:rdoc/cheb_rdoc.html#3]
+# 1. {Examples}[link:rdoc/cheb_rdoc.html#4]
 #
 # == {}[link:index.html"name="1] <tt>GSL::Cheb</tt> class
 #
@@ -26,7 +26,7 @@
 # ---
 # * GSL::Cheb#init(f, a, b)
 #
-#   This computes the Chebyshev approximation the function <tt>f</tt> over the range (<tt>a,b</tt>) to the previously specified order. Where <tt>f</tt> is a {GSL::Function}[link:files/rdoc/function_rdoc.html] object. The computation of the Chebyshev approximation is an O(n^2) process, and requires <tt>n</tt> function evaluations.
+#   This computes the Chebyshev approximation the function <tt>f</tt> over the range (<tt>a,b</tt>) to the previously specified order. Where <tt>f</tt> is a {GSL::Function}[link:rdoc/function_rdoc.html] object. The computation of the Chebyshev approximation is an O(n^2) process, and requires <tt>n</tt> function evaluations.
 #
 #   * ex: Approximate a step function defined in (0, 1) by a Chebyshev series of order 40.
 #       f = GSL::Function.alloc { |x|
@@ -91,9 +91,9 @@
 #
 # See also the example scripts in <tt>examples/cheb/</tt>.
 #
-# {prev}[link:files/rdoc/diff_rdoc.html]
-# {next}[link:files/rdoc/sum_rdoc.html]
+# {prev}[link:rdoc/diff_rdoc.html]
+# {next}[link:rdoc/sum_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #