rb-gsl 1.16.0.4 → 1.16.0.5

data/lib/gsl.rb

@@ -3,12 +3,6 @@ begin
 rescue LoadError
 end
 
-begin
-  require "gsl/#{RUBY_VERSION[/\d+.\d+/]}/gsl_native"
-rescue LoadError => err
-  raise if err.respond_to?(:path) && !err.path
-  require 'gsl/gsl_native'
-end
-
+require 'gsl_native'
 require 'gsl/version'
 require 'gsl/oper'

data/lib/gsl/gnuplot.rb

@@ -18,7 +18,7 @@ class Array
   end
   def to_gsplot
     f = ""
-    
+
     if ( self[0].kind_of? Array ) then
       x = self[0]
       y = self[1]
@@ -35,7 +35,7 @@ class Array
     else
       self[0].zip( *self[1..-1] ).to_gsplot
     end
-    
+
     f
   end
 end

data/lib/gsl/version.rb

@@ -1,5 +1,3 @@
 module GSL
-
-  RUBY_GSL_VERSION = RB_GSL_VERSION = '1.16.0.4'
-
+  RUBY_GSL_VERSION = RB_GSL_VERSION = '1.16.0.5'
 end

data/rb-gsl.gemspec

@@ -0,0 +1,29 @@
+# -*- encoding: utf-8 -*-
+require File.dirname(__FILE__) + '/lib/gsl/version'
+require 'date'
+
+Gem::Specification.new do |s|
+  s.name = 'rb-gsl'
+  s.version = GSL::RUBY_GSL_VERSION
+  s.date = Date.today.to_s
+
+  s.require_paths = %w(lib)
+  s.authors = ['Yoshiki Tsunesada', 'David MacMahon', 'Jens Wille']
+  s.summary = 'Ruby interface to the GNU Scientific Library'
+  s.description = 'Ruby/GSL is a Ruby interface to the GNU Scientific Library, for numerical computing with Ruby'
+  s.email = 'jens.wille@gmail.com'
+  s.extensions  = Dir['ext/**/extconf.rb']
+  s.extra_rdoc_files = Dir['**/*.rdoc']
+  s.files = `git ls-files`.split("\n")
+  s.homepage = 'http://github.com/SciRuby/rb-gsl'
+  s.licenses = ['GPL-2.0']
+  s.rdoc_options = ['--title', "Ruby/GSL (#{GSL::RUBY_GSL_VERSION})", '--charset', 'UTF-8', '--line-numbers', '--all', '--main', 'index.rdoc', '--root', 'rdoc']
+  s.required_ruby_version = '>= 1.9.3'
+  s.requirements = ['GSL (http://www.gnu.org/software/gsl/)']
+
+  s.post_install_message = "#{s.name} can be installed with or without narray support. Please install narray before and reinstall #{s.name} if it is missing."
+
+  s.add_development_dependency 'rake-compiler', '>= 0'
+  s.add_development_dependency 'rake', '>= 0'
+  s.add_development_dependency 'test-unit', '>= 0'
+end

data/rdoc/blas.rdoc

@@ -260,10 +260,10 @@
 # * GSL::Blas::Right
 #
 #
-# {prev}[link:sort_rdoc.html]
-# {next}[link:linalg_rdoc.html]
+# {prev}[link:rdoc/sort_rdoc.html]
+# {next}[link:rdoc/linalg_rdoc.html]
 #
-# {Reference index}[link:ref_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:bspline_rdoc.html#label-Overview]
-# 1. {Initializing the B-splines solver}[link:bspline_rdoc.html#label-Initializing+the+B-splines+solver]
-# 1. {Constructing the knots vector}[link:bspline_rdoc.html#label-Constructing+the+knots+vector]
-# 1. {Evaluation of B-splines}[link:bspline_rdoc.html#label-Evaluation+of+B-splines]
+# 1. {Overview}[link:rdoc/bspline_rdoc.html#label-Overview]
+# 1. {Initializing the B-splines solver}[link:rdoc/bspline_rdoc.html#label-Initializing+the+B-splines+solver]
+# 1. {Constructing the knots vector}[link:rdoc/bspline_rdoc.html#label-Constructing+the+knots+vector]
+# 1. {Evaluation of B-splines}[link:rdoc/bspline_rdoc.html#label-Evaluation+of+B-splines]
 #
 # == 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:nonlinearfit_rdoc.html]
-# {next}[link:const_rdoc.html]
+# {prev}[link:rdoc/nonlinearfit_rdoc.html]
+# {next}[link:rdoc/const_rdoc.html]
 #
-# {Reference index}[link:ref_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:cheb_rdoc.html#label-Cheb+class]
-# 1. {Chebyshev Series Evaluation}[link:cheb_rdoc.html#label-Chebyshev+Series+Evaluation]
-# 1. {Derivatives and Integrals}[link:cheb_rdoc.html#label-Derivatives+and+Integrals]
-# 1. {Examples}[link:cheb_rdoc.html#label-Example]
+# 1. {GSL::Cheb class}[link:rdoc/cheb_rdoc.html#label-Cheb+class]
+# 1. {Chebyshev Series Evaluation}[link:rdoc/cheb_rdoc.html#label-Chebyshev+Series+Evaluation]
+# 1. {Derivatives and Integrals}[link:rdoc/cheb_rdoc.html#label-Derivatives+and+Integrals]
+# 1. {Examples}[link:rdoc/cheb_rdoc.html#label-Example]
 #
 # == <tt>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: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:diff_rdoc.html]
-# {next}[link:sum_rdoc.html]
+# {prev}[link:rdoc/diff_rdoc.html]
+# {next}[link:rdoc/sum_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #

data/rdoc/cholesky_complex.rdoc

@@ -42,5 +42,5 @@
 #   should contain the right-hand side <tt>b</tt>,
 #   which is replaced by the solution on output.
 #
-# {back}[link:linalg_rdoc.html]
+# {back}[link:rdoc/linalg_rdoc.html]
 #

data/rdoc/combi.rdoc

@@ -1,12 +1,12 @@
 #
 # = Combinations
 # Contents:
-# 1. {Combination allocation}[link:combi_rdoc.html#label-Combination+allocation]
-# 1. {Methods}[link:combi_rdoc.html#label-Methods]
-#    1. {Accessing combination elements}[link:combi_rdoc.html#label-Accessing+combination+elements]
-#    1. {Combination properties}[link:combi_rdoc.html#label-Combination+properties]
-#    1. {Combination functions}[link:combi_rdoc.html#label-Combination+functions]
-#    1. {Reading and writing combinations}[link:combi_rdoc.html#label-Reading+and+writing+combinations]
+# 1. {Combination allocation}[link:rdoc/combi_rdoc.html#label-Combination+allocation]
+# 1. {Methods}[link:rdoc/combi_rdoc.html#label-Methods]
+#    1. {Accessing combination elements}[link:rdoc/combi_rdoc.html#label-Accessing+combination+elements]
+#    1. {Combination properties}[link:rdoc/combi_rdoc.html#label-Combination+properties]
+#    1. {Combination functions}[link:rdoc/combi_rdoc.html#label-Combination+functions]
+#    1. {Reading and writing combinations}[link:rdoc/combi_rdoc.html#label-Reading+and+writing+combinations]
 #
 # == Combination allocation
 # ---
@@ -116,10 +116,10 @@
 #        end while c.next == GSL::SUCCESS
 #      end
 #
-# {prev}[link:perm_rdoc.html]
-# {next}[link:sort_rdoc.html]
+# {prev}[link:rdoc/perm_rdoc.html]
+# {next}[link:rdoc/sort_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/complex.rdoc

@@ -1,14 +1,14 @@
 #
 # = Complex Numbers
 # Contents:
-# 1. {Class methods}[link:complex_rdoc.html#label-Class+Methods]
-# 1. {Properties of Complex Numbers}[link:complex_rdoc.html#label-Properties+of+complex+numbers]
-# 1. {Complex Arithmetic Operators}[link:complex_rdoc.html#label-Complex+arithmetic+operators]
-# 1. {Elementary Complex Functions}[link:complex_rdoc.html#label-Elementary+Complex+Functions]
-# 1. {Complex Trigonometric Functions}[link:complex_rdoc.html#label-Complex+Trigonometric+Functions]
-# 1. {Inverse Complex Trigonometric Functions}[link:complex_rdoc.html#label-Inverse+Complex+Trigonometric+Functions]
-# 1. {Complex Hyperbolic Functions}[link:complex_rdoc.html#label-Complex+Hyperbolic+Functions]
-# 1. {Inverse Complex Hyperbolic Functions}[link:complex_rdoc.html#label-Inverse+Complex+Hyperbolic+Functions]
+# 1. {Class methods}[link:rdoc/complex_rdoc.html#label-Class+Methods]
+# 1. {Properties of Complex Numbers}[link:rdoc/complex_rdoc.html#label-Properties+of+complex+numbers]
+# 1. {Complex Arithmetic Operators}[link:rdoc/complex_rdoc.html#label-Complex+arithmetic+operators]
+# 1. {Elementary Complex Functions}[link:rdoc/complex_rdoc.html#label-Elementary+Complex+Functions]
+# 1. {Complex Trigonometric Functions}[link:rdoc/complex_rdoc.html#label-Complex+Trigonometric+Functions]
+# 1. {Inverse Complex Trigonometric Functions}[link:rdoc/complex_rdoc.html#label-Inverse+Complex+Trigonometric+Functions]
+# 1. {Complex Hyperbolic Functions}[link:rdoc/complex_rdoc.html#label-Complex+Hyperbolic+Functions]
+# 1. {Inverse Complex Hyperbolic Functions}[link:rdoc/complex_rdoc.html#label-Inverse+Complex+Hyperbolic+Functions]
 #
 # == Class Methods
 # ---
@@ -201,10 +201,10 @@
 # * GSL::Complex#arccoth(z)
 #
 #
-# {prev}[link:math_rdoc.html]
-# {next}[link:poly_rdoc.html]
+# {prev}[link:rdoc/math_rdoc.html]
+# {next}[link:rdoc/poly_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/const.rdoc

@@ -15,23 +15,23 @@
 # See also the {GSL reference}[https://gnu.org/software/gsl/manual/gsl-ref_37.html#SEC479]
 #
 # Contents:
-# 1. {Fundamental Constants}[link:const_rdoc.html#label-Fundamental+Constants]
-# 1. {Astronomy and Astrophysics}[link:const_rdoc.html#label-Astronomy+and+Astrophysics]
-# 1. {Atomic and Nuclear Physics}[link:const_rdoc.html#label-Atomic+and+Nuclear+Physics]
-# 1. {Measurement of Time}[link:const_rdoc.html#label-Measurement+of+Time]
-# 1. {Imperial Units}[link:const_rdoc.html#label-Imperial+Units]
-# 1. {Nautical Units}[link:const_rdoc.html#label-Nautical+Units]
-# 1. {Printers Units}[link:const_rdoc.html#label-Printers+Units]
-# 1. {Volume}[link:const_rdoc.html#label-Volume]
-# 1. {Mass and Weight}[link:const_rdoc.html#label-Mass+and+Weight]
-# 1. {Thermal Energy and Power}[link:const_rdoc.html#label-Thermal+Energy+and+Power]
-# 1. {Pressure}[link:const_rdoc.html#label-Pressure]
-# 1. {Viscosity}[link:const_rdoc.html#label-Viscosity]
-# 1. {Light and Illumination}[link:const_rdoc.html#label-Light+and+Illumination]
-# 1. {Radioactivity}[link:const_rdoc.html#label-Radioactivity]
-# 1. {Force and Energy}[link:const_rdoc.html#label-Force+and+Energy]
-# 1. {Prefixes}[link:const_rdoc.html#label-Prefixes]
-# 1. {Examples}[link:const_rdoc.html#label-Example]
+# 1. {Fundamental Constants}[link:rdoc/const_rdoc.html#label-Fundamental+Constants]
+# 1. {Astronomy and Astrophysics}[link:rdoc/const_rdoc.html#label-Astronomy+and+Astrophysics]
+# 1. {Atomic and Nuclear Physics}[link:rdoc/const_rdoc.html#label-Atomic+and+Nuclear+Physics]
+# 1. {Measurement of Time}[link:rdoc/const_rdoc.html#label-Measurement+of+Time]
+# 1. {Imperial Units}[link:rdoc/const_rdoc.html#label-Imperial+Units]
+# 1. {Nautical Units}[link:rdoc/const_rdoc.html#label-Nautical+Units]
+# 1. {Printers Units}[link:rdoc/const_rdoc.html#label-Printers+Units]
+# 1. {Volume}[link:rdoc/const_rdoc.html#label-Volume]
+# 1. {Mass and Weight}[link:rdoc/const_rdoc.html#label-Mass+and+Weight]
+# 1. {Thermal Energy and Power}[link:rdoc/const_rdoc.html#label-Thermal+Energy+and+Power]
+# 1. {Pressure}[link:rdoc/const_rdoc.html#label-Pressure]
+# 1. {Viscosity}[link:rdoc/const_rdoc.html#label-Viscosity]
+# 1. {Light and Illumination}[link:rdoc/const_rdoc.html#label-Light+and+Illumination]
+# 1. {Radioactivity}[link:rdoc/const_rdoc.html#label-Radioactivity]
+# 1. {Force and Energy}[link:rdoc/const_rdoc.html#label-Force+and+Energy]
+# 1. {Prefixes}[link:rdoc/const_rdoc.html#label-Prefixes]
+# 1. {Examples}[link:rdoc/const_rdoc.html#label-Example]
 #
 # == Fundamental Constants
 # ---
@@ -537,10 +537,10 @@
 #      printf("minimum = %.1f minutes\n", t_min / minutes);
 #      printf("maximum = %.1f minutes\n\n", t_max / minutes);
 #
-# {prev}[link:bspline_rdoc.html]
-# {next}[link:graph_rdoc.html]
+# {prev}[link:rdoc/bspline_rdoc.html]
+# {next}[link:rdoc/graph_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/dht.rdoc

@@ -3,9 +3,9 @@
 # This chapter describes functions for performing Discrete Hankel Transforms
 # (DHTs).
 #
-# 1. {Definitions}[link:dht_rdoc.html#label-Definitions]
-# 1. {Initialization}[link:dht_rdoc.html#label-Initialization]
-# 1. {Methods}[link:dht_rdoc.html#label-Methods]
+# 1. {Definitions}[link:rdoc/dht_rdoc.html#label-Definitions]
+# 1. {Initialization}[link:rdoc/dht_rdoc.html#label-Initialization]
+# 1. {Methods}[link:rdoc/dht_rdoc.html#label-Methods]
 #
 # == Definitions
 # The discrete Hankel transform acts on a vector of sampled data, where the
@@ -113,10 +113,10 @@
 #
 #   Return the (n,m)-th transform coefficient.
 #
-# {prev}[link:sum_rdoc.html]
-# {next}[link:roots_rdoc.html]
+# {prev}[link:rdoc/sum_rdoc.html]
+# {next}[link:rdoc/roots_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/diff.rdoc

@@ -5,8 +5,8 @@
 # of finite difference and to estimate the error in the derivative.
 #
 # Contentes:
-# 1. {Deriv methods}[link:diff_rdoc.html#label-Deriv+methods+%28for+GSL+1.4.90+or+later%29]
-# 1. {Diff methods}[link:diff_rdoc.html#label-Diff+Methods+%28obsolete%29]
+# 1. {Deriv methods}[link:rdoc/diff_rdoc.html#label-Deriv+methods+%28for+GSL+1.4.90+or+later%29]
+# 1. {Diff methods}[link:rdoc/diff_rdoc.html#label-Diff+Methods+%28obsolete%29]
 #
 # == Deriv methods (for GSL 1.4.90 or later)
 # Numerical derivatives should now be calculated using the
@@ -73,7 +73,7 @@
 # * GSL::Diff.central(f, x)
 # * GSL::Function#diff_central(x)
 #
-#   These compute the numerical derivative of the function <tt>f</tt> ( {GSL::Function}[link:function_rdoc.html] object) at the point <tt>x</tt>
+#   These compute the numerical derivative of the function <tt>f</tt> ( {GSL::Function}[link:rdoc/function_rdoc.html] object) at the point <tt>x</tt>
 #   using an adaptive central difference algorithm. The result is returned as an array
 #   which contains the derivative and an estimate of its absolute error.
 #
@@ -124,10 +124,10 @@
 #      f'(x) = 0.0000000160 +/- 0.0000000339
 #      exact = 0.0000000000
 #
-# {prev}[link:interp_rdoc.html]
-# {next}[link:cheb_rdoc.html]
+# {prev}[link:rdoc/interp_rdoc.html]
+# {next}[link:rdoc/cheb_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/ehandling.rdoc

@@ -42,9 +42,9 @@
 #   This replaces the Ruby/GSL default error handler by a user-defined handler
 #   given by a Proc object <tt>proc</tt> or a block.
 #
-# {prev}[link:use_rdoc.html]
-# {next}[link:math_rdoc.html]
+# {prev}[link:rdoc/use_rdoc.html]
+# {next}[link:rdoc/math_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #

data/rdoc/eigen.rdoc

@@ -1,14 +1,14 @@
 #
 # = Eigensystems
 # === Contentes
-# 1. {Modules and classes}[link:eigen_rdoc.html#label-Modules+and+classes]
-# 1. {Real Symmetric Matrices}[link:eigen_rdoc.html#label-Real+Symmetric+Matrices]
-# 1. {Complex Hermitian Matrices}[link:eigen_rdoc.html#label-Complex+Hermitian+Matrices]
-# 1. {Real Nonsymmetric Matrices}[link:eigen_rdoc.html#label-Real+Nonsymmetric+Matrices+%28%3E%3D+GSL-1.9%29] (>= GSL-1.9)
-# 1. {Real Generalized Symmetric-Definite Eigensystems}[link:eigen_rdoc.html#label-Real+Generalized+Symmetric-Definite+Eigensystems+%28GSL-1.10%29] (>= GSL-1.10)
-# 1. {Complex Generalized Hermitian-Definite Eigensystems}[link:eigen_rdoc.html#label-Complex+Generalized+Hermitian-Definite+Eigensystems+%28%3E%3D+GSL-1.10%29] (>= GSL-1.10)
-# 1. {Real Generalized Nonsymmetric Eigensystems}[link:eigen_rdoc.html#label-Real+Generalized+Nonsymmetric+Eigensystems+%28%3E%3D+GSL-1.10%29] (>= GSL-1.10)
-# 1. {Sorting Eigenvalues and Eigenvectors }[link:eigen_rdoc.html#label-Sorting+Eigenvalues+and+Eigenvectors]
+# 1. {Modules and classes}[link:rdoc/eigen_rdoc.html#label-Modules+and+classes]
+# 1. {Real Symmetric Matrices}[link:rdoc/eigen_rdoc.html#label-Real+Symmetric+Matrices]
+# 1. {Complex Hermitian Matrices}[link:rdoc/eigen_rdoc.html#label-Complex+Hermitian+Matrices]
+# 1. {Real Nonsymmetric Matrices}[link:rdoc/eigen_rdoc.html#label-Real+Nonsymmetric+Matrices+%28%3E%3D+GSL-1.9%29] (>= GSL-1.9)
+# 1. {Real Generalized Symmetric-Definite Eigensystems}[link:rdoc/eigen_rdoc.html#label-Real+Generalized+Symmetric-Definite+Eigensystems+%28GSL-1.10%29] (>= GSL-1.10)
+# 1. {Complex Generalized Hermitian-Definite Eigensystems}[link:rdoc/eigen_rdoc.html#label-Complex+Generalized+Hermitian-Definite+Eigensystems+%28%3E%3D+GSL-1.10%29] (>= GSL-1.10)
+# 1. {Real Generalized Nonsymmetric Eigensystems}[link:rdoc/eigen_rdoc.html#label-Real+Generalized+Nonsymmetric+Eigensystems+%28%3E%3D+GSL-1.10%29] (>= GSL-1.10)
+# 1. {Sorting Eigenvalues and Eigenvectors }[link:rdoc/eigen_rdoc.html#label-Sorting+Eigenvalues+and+Eigenvectors]
 #
 # == Modules and classes
 #
@@ -392,10 +392,10 @@
 #   and <tt>GSL::EIGEN_SORT_ABS_DESC</tt> are supported due to the eigenvalues
 #   being complex.
 #
-# {prev}[link:linalg_rdoc.html]
-# {next}[link:fft_rdoc.html]
+# {prev}[link:rdoc/linalg_rdoc.html]
+# {next}[link:rdoc/fft_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/fft.rdoc

@@ -1,24 +1,24 @@
 #
 # = Fast Fourier Transforms
 # Contents:
-# 1. {Mathematical Definitions}[link:fft_rdoc.html#label-Mathematical+Definitions]
-# 1. {Complex data FFTs}[link:fft_rdoc.html#label-Complex+data+FFTs]
-#    1. {Overview of complex data FFTs}[link:fft_rdoc.html#label-Overview+of+complex+data+FFTs]
-#    1. {Radix-2 FFT routines for complex data}[link:fft_rdoc.html#label-Radix-2+FFT+routines+for+complex+data]
-#       1. {Example of the complex Radix-2 FFT}[link:fft_rdoc.html#label-Example+of+complex+Radix-2+FFT]
-#    1. {Mixed-radix FFT routines for complex data}[link:fft_rdoc.html#label-Mixed-radix+FFT+routines+for+complex+data]
-#       1. {GSL::FFT::ComplexWavetable class}[link:fft_rdoc.html#label-ComplexWavetable+class]
-#       1. {GSL::FFT::ComplexWorkspace class}[link:fft_rdoc.html#label-ComplexWorkspace+class]
-#       1. {Methods to compute the transform}[link:fft_rdoc.html#label-Methods+to+compute+transform]
-#       1. {Example of the mixed-radix FFT}[link:fft_rdoc.html#label-Example+to+use+the+mixed-radix+FFT+algorithm]
-# 1. {Real data FFTs}[link:fft_rdoc.html#label-Real+data+FFTs]
-#    1. {Overview of real data FFTs}[link:fft_rdoc.html#label-Overview+of+real+data+FFTs]
-#    1. {Radix-2 FFT routines for real data}[link:fft_rdoc.html#label-Radix-2+FFT+routines+for+real+data]
-# 1. {Mixed-radix FFT routines for real data}[link:fft_rdoc.html#label-Mixed-radix+FFT+routines+for+real+data]
-#    1. {Data storage scheme}[link:fft_rdoc.html#label-Data+storage+scheme]
-#       1. {Wavetable and Workspace classes}[link:fft_rdoc.html#label-Wavetable+and+Workspace+classes]
-#       1. {Methods for real FFTs}[link:fft_rdoc.html#label-Methods+for+mixed-radix+real+FFTs]
-# 1. {Examples}[link:fft_rdoc.html#label-Examples]
+# 1. {Mathematical Definitions}[link:rdoc/fft_rdoc.html#label-Mathematical+Definitions]
+# 1. {Complex data FFTs}[link:rdoc/fft_rdoc.html#label-Complex+data+FFTs]
+#    1. {Overview of complex data FFTs}[link:rdoc/fft_rdoc.html#label-Overview+of+complex+data+FFTs]
+#    1. {Radix-2 FFT routines for complex data}[link:rdoc/fft_rdoc.html#label-Radix-2+FFT+routines+for+complex+data]
+#       1. {Example of the complex Radix-2 FFT}[link:rdoc/fft_rdoc.html#label-Example+of+complex+Radix-2+FFT]
+#    1. {Mixed-radix FFT routines for complex data}[link:rdoc/fft_rdoc.html#label-Mixed-radix+FFT+routines+for+complex+data]
+#       1. {GSL::FFT::ComplexWavetable class}[link:rdoc/fft_rdoc.html#label-ComplexWavetable+class]
+#       1. {GSL::FFT::ComplexWorkspace class}[link:rdoc/fft_rdoc.html#label-ComplexWorkspace+class]
+#       1. {Methods to compute the transform}[link:rdoc/fft_rdoc.html#label-Methods+to+compute+transform]
+#       1. {Example of the mixed-radix FFT}[link:rdoc/fft_rdoc.html#label-Example+to+use+the+mixed-radix+FFT+algorithm]
+# 1. {Real data FFTs}[link:rdoc/fft_rdoc.html#label-Real+data+FFTs]
+#    1. {Overview of real data FFTs}[link:rdoc/fft_rdoc.html#label-Overview+of+real+data+FFTs]
+#    1. {Radix-2 FFT routines for real data}[link:rdoc/fft_rdoc.html#label-Radix-2+FFT+routines+for+real+data]
+# 1. {Mixed-radix FFT routines for real data}[link:rdoc/fft_rdoc.html#label-Mixed-radix+FFT+routines+for+real+data]
+#    1. {Data storage scheme}[link:rdoc/fft_rdoc.html#label-Data+storage+scheme]
+#       1. {Wavetable and Workspace classes}[link:rdoc/fft_rdoc.html#label-Wavetable+and+Workspace+classes]
+#       1. {Methods for real FFTs}[link:rdoc/fft_rdoc.html#label-Methods+for+mixed-radix+real+FFTs]
+# 1. {Examples}[link:rdoc/fft_rdoc.html#label-Examples]
 #
 # == Mathematical Definitions
 # Fast Fourier Transforms are efficient algorithms for calculating the discrete
@@ -59,7 +59,7 @@
 # == Complex data FFTs
 # === Overview of complex data FFTs
 # The complex data FFT routines are provided as instance methods of
-# {GSL::Vector::Complex}[link:vector_complex_rdoc.html].
+# {GSL::Vector::Complex}[link:rdoc/vector_complex_rdoc.html].
 #
 # Here is a table which shows the layout of the array data, and the correspondence
 # between the time-domain complex data z, and the frequency-domain complex data x.
@@ -82,7 +82,7 @@
 # frequencies +1/(2 Delta), -1/(2 Delta) which are equivalent. If N is odd then
 # general structure of the table above still applies, but N/2 does not appear.
 #
-# {GSL::Vector::Complex}[link:vector_complex_rdoc.html] provides four methods for
+# {GSL::Vector::Complex}[link:rdoc/vector_complex_rdoc.html] provides four methods for
 # shifting the frequency domain data between <b>FFT order</b>, shown in the table
 # above, and <b>natural order</b>, which has the most negative freqeuncy component
 # first, the zero frequency component in the middle, and the most positive
@@ -263,7 +263,7 @@
 # === Overview of real data FFTs
 #
 # The functions for real data FFTs are provided as instance methods of
-# {GSL::Vector}[link:vector_rdoc.html].  While they are similar to those for
+# {GSL::Vector}[link:rdoc/vector_rdoc.html].  While they are similar to those for
 # complex data, there is an important difference in the data storage layout
 # between forward and inverse transforms.  The Fourier transform of a real
 # sequence is not real. It is a complex sequence with a special symmetry.  A
@@ -274,7 +274,7 @@
 # Forward transforms of real sequences produce half complex sequences of the same
 # length.  Backward and inverse transforms of half complex sequences produce real
 # sequences of the same length.  In both cases, the input and output sequences
-# are instances of {GSL::Vector}[link:vector_rdoc.html].
+# are instances of {GSL::Vector}[link:rdoc/vector_rdoc.html].
 #
 # The precise storage arrangements of half complex seqeunces depend on the
 # algorithm, and are different for radix-2 and mixed-radix routines. The radix-2
@@ -288,7 +288,7 @@
 #
 # === Radix-2 FFT routines for real data
 # The routines for readix-2 real FFTs are provided as instance methods of
-# {GSL::Vector}[link:vector_rdoc.html].
+# {GSL::Vector}[link:rdoc/vector_rdoc.html].
 #
 # <b>The FFT methods described below return FFTed data, and the input vector is
 # not changed. Use methods with '!' as <tt>radix2_tranform!</tt> for in-place
@@ -526,10 +526,10 @@
 #
 #     graph(nil, data, data2, "-T X -C -g 3 -L 'Real-halfcomplex' -x 0 #{data.size}")
 #
-# {prev}[link:eigen_rdoc.html]
-# {next}[link:wavelet_rdoc.html]
+# {prev}[link:rdoc/eigen_rdoc.html]
+# {next}[link:rdoc/wavelet_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #
 #