carray 1.3.7 → 1.5.4

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);

data/rdoc_main.rb

@@ -1,27 +0,0 @@
-#
-# Ruby/CArray
-#
-# 
-# CArray - 
-#
-# : classes
-#
-#   CArray
-#   
-#
-#
-#
-#
-#
-#
-#
-
-
-class Module # :nodoc:
-end
-
-class Class # :nodoc:
-end
-
-class Numeric # :nodoc:
-end

data/rdoc_math.rb

@@ -1,5 +0,0 @@
-#
-#
-#
-#
-#

data/rdoc_stat.rb

@@ -1,31 +0,0 @@
-class CArray
-
-  # Accumulates the all elements. The overflow is treated in 
-  # the C-language way.
-  #
-  #   a = CArray.int8(2) { [127,1] };
-  #   a.sum
-  #   => 128.0
-  #   a.accumulate
-  #   => -128
-  #
-  #   a = CArray.uint32(2) { [0xffffffff,1] };
-  #   a.sum
-  #   => 4294967296.0
-  #   a.accumulate
-  #   => 0
-  #
-  #   a = CArray.float(2) { [0xffffffff,1] };
-  #   a.sum
-  #   => 4294967297.0
-  #   a.accumulate
-  #   => 4294967296.0
-  #
-  #   a = CArray.object(2) { [0xffffffff,1] };
-  #   a.sum
-  #   => 4294967296
-  #   a.accumulate
-  #   => 4294967296
-  def accumulate (options={})
-  end
-end

data/spec/CABlockIterator/CABlockIterator_spec.rb

@@ -1,113 +0,0 @@
-require "carray"
-
-describe CABlockIterator do
-
-  describe "each method" do
-
-    before do
-      @original = CArray.object(4,4).seq!
-      @it = @original.blocks(0..1, 0..1)
-    end
-
-    it "should call 4-times its block" do
-      count = 0
-      @it.each do |blk|
-        count += 1
-      end
-      ( count ).should == 4
-    end
-
-    it "should have the block parameter of 2x2 CABlock object" do
-      @it.each do |blk|
-        ( blk ).should be_an_instance_of(CABlock)
-        ( blk.data_type ).should == CA_OBJECT
-        ( blk.dim ).should == [2,2]
-      end
-    end
-
-  end
-
-  describe "reference method []" do
-
-    before do
-      @original = CArray.object(4,4).seq!
-      @it = @original.blocks(0..1, 0..1)
-    end
-
-    it "should return a 2x2 CABlock object" do
-      blk = @it[0]
-      ( blk ).should be_an_instance_of(CABlock)
-      ( blk.data_type ).should == CA_OBJECT
-      ( blk ).should == CA_OBJECT([[0,1],[4,5]])
-      blk = @it[1,0]
-      ( blk ).should be_an_instance_of(CABlock)
-      ( blk.data_type ).should == CA_OBJECT
-      ( blk ).should == CA_OBJECT([[8,9],[12,13]])
-    end
-
-    it "should return a 2x2 CABlock object" do
-      ( @it[0] ).should == @it.kernel_at_addr(0, @it.reference)
-      ( @it[1,0] ).should == @it.kernel_at_index([1,0], @it.reference)
-    end
-
-  end
-
-  describe "store method []=" do
-
-    before do
-      @original = CArray.object(4,4).seq!
-      @it = @original.blocks(0..1, 0..1)
-    end
-
-    it "should return a 2x2 CABlock object" do
-      @it[0] = 1
-      @it[1,0] = 2
-      ( @it.reference ).should == CA_OBJECT( [ [ 1, 1, 2, 3 ],
-                                               [ 1, 1, 6, 7 ],
-                                               [ 2, 2, 10, 11 ],
-                                               [ 2, 2, 14, 15 ] ] )
-    end
-
-  end
-
-  describe "pick method" do
-
-    before do
-      @original = CArray.object(4,4).seq!
-      @it = @original.blocks(0..1, 0..1)
-    end
-
-    it "should return a 2x2 CABlock object" do
-      blk = @it.pick(0)
-      ( blk ).should be_an_instance_of(CArray)
-      ( blk.data_type ).should == CA_OBJECT
-      ( blk ).should == CA_OBJECT([[0,2],[8,10]])
-      blk = @it.pick(1,0)
-      ( blk ).should be_an_instance_of(CArray)
-      ( blk.data_type ).should == CA_OBJECT
-      ( blk ).should == CA_OBJECT([[4,6],[12,14]])
-    end
-
-  end
-
-  describe "put method" do
-
-    before do
-      @original = CArray.object(4,4).seq!
-      @it = @original.blocks(0..1, 0..1)
-    end
-
-    it "should store value via 2x2 CBlock object" do
-      @it.put(0,1)
-      @it.put(0,1,2)
-      ( @it.pick(0) ).should == CA_OBJECT([[1,1],[1,1]])
-      ( @it.pick(0,1) ).should == CA_OBJECT([[2,2],[2,2]])
-      ( @it.reference ).should == CA_OBJECT([[ 1, 2, 1, 2 ],
-                                             [ 4, 5, 6, 7 ],
-                                             [ 1, 2, 1, 2 ],
-                                             [ 12, 13, 14, 15 ]])
-    end
-
-  end
-
-end