carray 1.4.0 → 1.5.5

data/lib/carray/base/obsolete.rb

@@ -1,131 +0,0 @@
-
-class CArray
-  
-  def fa                               # :nodoc:
-    warn "CArray#fa will be obsolete, use CArray#t"
-    return self.t
-  end
-
-  def block_iterator (*argv)           # :nodoc:
-    warn "CArray#block_iterator will be obsolete, use CArray#blocks"
-    return blocks(*argv)
-  end
-
-  def window_iterator (*argv)          # :nodoc:
-    warn "CArray#window_iterator will be obsolete, use CArray#windows"
-    return windows(*argv)
-  end
-
-  def rotated (*argv)                  # :nodoc:
-    warn "CArray#rotated will be obsolete, use CArray#rolled"
-    argv.push({:roll => Array.new(rank){1} })
-    return shifted(*argv)
-  end
-
-  def rotate! (*argv)                  # :nodoc:
-    warn "CArray#rotate! will be obsolete, use CArray#roll!"
-    self[] = self.rolled(*argv)
-    return self
-  end
-
-  def rotate (*argv)                   # :nodoc:
-    warn "CArray#rotate will be obsolete, use CArray#roll"
-    return self.rolled(*argv).to_ca
-  end
-
-  def select (&block)                  # :nodoc:
-    warn "CArray#select will be obsolete"
-    case block.arity
-    when 1
-      return self[*yield(self)]
-    when -1, 0
-      return self[*instance_exec(&block)]
-    else
-      raise
-    end
-  end
-
-  def transform (type, dim, opt = {}) # :nodoc:
-    warn("CArray#transform will be obsolete")
-    return refer(type, dim, opt).to_ca
-  end
-  
-  def classify (klass, outlier = nil)  # :nodoc:
-    warn "CArray#classify will be obsolete"
-    b = CArray.int32(*dim)
-    f = CArray.boolean(*dim) { 1 }
-    attach {
-      (klass.elements-1).times do |i|
-        r = f.and(self < klass[i+1])
-        b[r] = i
-        f[r] = 0
-      end
-      if outlier
-        b[self < klass[0]] = outlier
-        b[f] = outlier
-      else
-        b[self < klass[0]] = -1
-        b[f] = klass.elements-1
-      end
-    }
-    return b
-  end
-
-
-=begin
-  def histogram (klass)
-    c = CArray.int32(klass.elements-1)
-    f = CArray.boolean(*dim) { 1 }
-    attach {
-      k = 0
-      r = f.and(self < klass[0])
-      f[r] = 0
-      (klass.elements-1).times do |i|
-        r = f.and(self < klass[i+1])
-        c[k] = r.count_true
-        f[r] = 0
-        k+=1
-      end
-    }
-    return c
-  end
-=end
-
-end
-
-class Numeric
-  
-  [
-    :boolean,
-    :int8,
-    :uint8,
-    :int16,
-    :uint16,
-    :int32,
-    :uint32,
-    :int64,
-    :uint64,
-    :float32,
-    :float64,
-    :float128,
-    :cmplx64,
-    :cmplx128,
-    :cmplx256,
-    :byte,
-    :short,
-    :int,
-    :float,
-    :double,
-    :complex,
-    :dcomplex,
-    :object
-  ].each do |name|
-    class_eval %{
-      def #{name} ()
-        warn "Numeric##{name} will be obsolete"
-        CScalar.new(#{name.inspect}) {self}
-      end
-    }
-  end
-
-end

data/lib/carray/math/interp.rb

@@ -1,57 +0,0 @@
-# ----------------------------------------------------------------------------
-#
-#  carray/math/interp.rb
-#
-#  This file is part of Ruby/CArray extension library.
-#  You can redistribute it and/or modify it under the terms of
-#  the Ruby Licence.
-#
-#  Copyright (C) 2005 Hiroki Motoyoshi
-#
-# ----------------------------------------------------------------------------
-
-require "carray"
-
-class CA::Interp
-
-  ADAPTERS = {}
-
-  def initialize (type, scales, value, options={})
-    adapter_class = ADAPTERS[type]
-    if adapter_class
-      @type    = type
-      @adapter = adapter_class.new(scales, value, options)
-    else
-      raise RuntimeError, "unknown interp adapter <#{type}>"
-    end
-  end
-
-  def [] (*args)
-    return @adapter.evaluate(*args)
-  end
-
-  def method_missing (id, *args)
-    return @adapter.send(id, *args)
-  end
-
-end
-
-class CA::Interp::Adapter # :nodoc:
-
-  def self.install_adapter (name)
-    CA::Interp::ADAPTERS[name] = self
-  end
-  
-end
-
-def CA.interp (*argv)
-  return CA::Interp.new(*argv)
-end
-
-CA.each_load_path("carray/math/interp") {
-  Dir["adapter_*.rb"].each do |basename|
-    if basename =~ /\A(adapter_.+)\.rb\Z/
-      require "carray/math/interp/" + $1
-    end
-  end
-}

data/lib/carray/math/interp/adapter_gsl_spline.rb

@@ -1,47 +0,0 @@
-#
-#
-#
-
-#
-# :type => type
-#
-#   * "linear"
-#   * "polynomial"
-#   * "cspline"
-#   * "cspline_periodic"
-#   * "akima"
-#   * "akima_periodic"
-#
-
-require "carray/math/interp"
-begin
-  require "gsl"
-rescue LoadError
-end
-
-class CA::Interp::GSLSpline < CA::Interp::Adapter
-  
-  install_adapter "gsl:spline"
-  
-  def initialize (scales, value, options={})
-    @y  = value
-    @x  = scales
-    type = options[:type] || "linear"
-    CArray.attach(@x, @y) {
-      @interp = GSL::Spline.alloc(type, @x.na, @y.na)
-    }
-  end
-  
-  def evaluate (x0)
-    case x0
-    when CArray
-      return x0.attach { @interp.eval(x0.na).ca }
-    else
-      return @interp.eval(x0)
-    end
-  end
-  
-  alias grid evaluate
-
-end
-

data/mt19937ar.c

@@ -1,182 +0,0 @@
-/*
-  The names of routines in original mt19937ar.c are all prefixed with "ca_"
-  to avoid collision with ruby's runtime library.
-*/
-
-#include "mt19937ar.h"
-
-/*
-   A C-program for MT19937, with initialization improved 2002/1/26.
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   Before using, initialize the state by using init_genrand(seed)
-   or init_by_array(init_key, key_length).
-
-   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-   Copyright (C) 2005, Mutsuo Saito,
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-   Any feedback is very welcome.
-   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
-*/
-
-#include <stdio.h>
-#include "mt19937ar.h"
-
-/* Period parameters */
-#define N 624
-#define M 397
-#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
-#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
-#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
-
-static unsigned long mt[N]; /* the array for the state vector  */
-static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
-
-/* initializes mt[N] with a seed */
-void init_genrand(unsigned long s)
-{
-    mt[0]= s & 0xffffffffUL;
-    for (mti=1; mti<N; mti++) {
-        mt[mti] =
-            (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
-        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
-        /* In the previous versions, MSBs of the seed affect   */
-        /* only MSBs of the array mt[].                        */
-        /* 2002/01/09 modified by Makoto Matsumoto             */
-        mt[mti] &= 0xffffffffUL;
-        /* for >32 bit machines */
-    }
-}
-
-/* initialize by an array with array-length */
-/* init_key is the array for initializing keys */
-/* key_length is its length */
-/* slight change for C++, 2004/2/26 */
-void init_by_array(unsigned long init_key[], int key_length)
-{
-    int i, j, k;
-    init_genrand(19650218UL);
-    i=1; j=0;
-    k = (N>key_length ? N : key_length);
-    for (; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
-          + init_key[j] + j; /* non linear */
-        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
-        i++; j++;
-        if (i>=N) { mt[0] = mt[N-1]; i=1; }
-        if (j>=key_length) j=0;
-    }
-    for (k=N-1; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
-          - i; /* non linear */
-        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
-        i++;
-        if (i>=N) { mt[0] = mt[N-1]; i=1; }
-    }
-
-    mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
-}
-
-/* generates a random number on [0,0xffffffff]-interval */
-unsigned long genrand_int32(void)
-{
-    unsigned long y;
-    static unsigned long mag01[2]={0x0UL, MATRIX_A};
-    /* mag01[x] = x * MATRIX_A  for x=0,1 */
-
-    if (mti >= N) { /* generate N words at one time */
-        int kk;
-
-        if (mti == N+1)   /* if init_genrand() has not been called, */
-            init_genrand(5489UL); /* a default initial seed is used */
-
-        for (kk=0;kk<N-M;kk++) {
-            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
-            mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
-        }
-        for (;kk<N-1;kk++) {
-            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
-            mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
-        }
-        y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
-        mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
-
-        mti = 0;
-    }
-
-    y = mt[mti++];
-
-    /* Tempering */
-    y ^= (y >> 11);
-    y ^= (y << 7) & 0x9d2c5680UL;
-    y ^= (y << 15) & 0xefc60000UL;
-    y ^= (y >> 18);
-
-    return y;
-}
-
-/* generates a random number on [0,0x7fffffff]-interval */
-long genrand_int31(void)
-{
-    return (long)(genrand_int32()>>1);
-}
-
-/* generates a random number on [0,1]-real-interval */
-double genrand_real1(void)
-{
-    return genrand_int32()*(1.0/4294967295.0);
-    /* divided by 2^32-1 */
-}
-
-/* generates a random number on [0,1)-real-interval */
-double genrand_real2(void)
-{
-    return genrand_int32()*(1.0/4294967296.0);
-    /* divided by 2^32 */
-}
-
-/* generates a random number on (0,1)-real-interval */
-double genrand_real3(void)
-{
-    return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
-    /* divided by 2^32 */
-}
-
-/* generates a random number on [0,1) with 53-bit resolution*/
-double genrand_res53(void)
-{
-    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
-    return(a*67108864.0+b)*(1.0/9007199254740992.0);
-}
-/* These real versions are due to Isaku Wada, 2002/01/09 added */

data/mt19937ar.h

@@ -1,86 +0,0 @@
-/*
-  The names of routines in original mt19937ar.c are all prefixed with "ca_"
-  to avoid collision with ruby's runtime library.
-*/
-
-#define init_genrand  ca_init_genrand
-#define init_by_array ca_init_by_array
-#define genrand_int32 ca_genrand_int32
-#define genrand_int31 ca_genrand_int31
-#define genrand_real1 ca_genrand_real1
-#define genrand_real2 ca_genrand_real2
-#define genrand_real3 ca_genrand_real3
-#define genrand_res53 ca_genrand_res53
-
-/*
-   A C-program for MT19937, with initialization improved 2002/1/26.
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   Before using, initialize the state by using init_genrand(seed)
-   or init_by_array(init_key, key_length).
-
-   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-   Copyright (C) 2005, Mutsuo Saito
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-   Any feedback is very welcome.
-   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
-*/
-
-/* initializes mt[N] with a seed */
-void init_genrand(unsigned long s);
-
-/* initialize by an array with array-length */
-/* init_key is the array for initializing keys */
-/* key_length is its length */
-/* slight change for C++, 2004/2/26 */
-void init_by_array(unsigned long init_key[], int key_length);
-
-/* generates a random number on [0,0xffffffff]-interval */
-unsigned long genrand_int32(void);
-
-/* generates a random number on [0,0x7fffffff]-interval */
-long genrand_int31(void);
-
-/* These real versions are due to Isaku Wada, 2002/01/09 added */
-/* generates a random number on [0,1]-real-interval */
-double genrand_real1(void);
-
-/* generates a random number on [0,1)-real-interval */
-double genrand_real2(void);
-
-/* generates a random number on (0,1)-real-interval */
-double genrand_real3(void);
-
-/* generates a random number on [0,1) with 53-bit resolution*/
-double genrand_res53(void);