carray 1.3.5 → 1.5.1

data/lib/carray/io/pg.rb

@@ -1,101 +0,0 @@
-require "pg"
-require "carray"
-
-class CArray
-  
-  def self.load_pg (expr, *args)
-    case expr
-    when Hash
-      opts = expr
-      sql, *vars = *args
-      db = PG.connect(opts)
-      begin
-        result = db.async_exec(sql, *vars)
-        names = result.fields
-        table = result.values
-      rescue Interrupt
-        db.cancel
-        raise 
-      ensure
-        db.finish       
-      end
-    when PG::Result
-      result = expr
-      names = result.fields
-      table = result.values
-    when PG::Connection
-      db = expr
-      sql, *vars = *args
-      begin
-        result = db.async_exec(sql, *vars)
-        names = result.fields
-        table = result.values
-      rescue Interrupt
-        db.cancel
-        raise
-      end
-    else
-      raise "invalid 1st arg"
-    end
-    table = table.to_ca
-    table.instance_exec { 
-      @result = result
-      @names  = names
-    }
-    class << table
-      attr_reader :names, :result
-      def column (name)
-        if self.size == 0
-          if name.is_a?(Integer)
-            return CA_OBJECT([])
-          elsif @names
-            if i = @names.index(name.to_s)
-              return CA_OBJECT([])
-            end
-          end
-          return nil          
-        else
-          if name.is_a?(Integer)
-            return self[false, name]
-          elsif @names
-            if i = @names.index(name.to_s)
-              return self[false, i]
-            end
-          end
-          return nil
-        end
-      end
-    end
-    return table
-  end
-
-  def unescape_bytea (type, subdim = nil)
-    bytes = CArray.sizeof(type)
-    max_bytesize = self.convert{|v| v ? PG::Connection.unescape_bytea(v).bytesize : 0}.max
-    unless subdim
-      subdim = [max_bytesize/bytes]
-    end
-    out = CArray.new(type, dim + subdim)
-    needed_bytes = out.elements/self.elements*bytes
-    ref = out.refer(:fixlen, dim, :bytes=>needed_bytes)
-    if needed_bytes == max_bytesize
-      ref.load_binary self.convert {|v| PG::Connection.unescape_bytea(v) }.join
-    else
-      self.each_addr do |addr|
-        if self[addr]
-          text = PG::Connection.unescape_bytea(self[addr])
-          ref[[addr]].load_binary PG::Connection.unescape_bytea(self[addr])
-        else
-          out[addr,false] = UNDEF
-        end
-      end
-    end
-    return out
-  end
-  
-  def escape_bytea (db)
-    return db.escape_bytea(self.to_s)
-  end
-
-end
-

data/lib/carray/io/sqlite3.rb

@@ -1,215 +0,0 @@
-require "carray"
-require "sqlite3"
-require "carray/io/table"
-
-class CArray
-  
-  def self.load_sqlite3 (expr, *args)
-    case expr
-    when String
-      file = expr
-      sql, *vars = *args
-      db = SQLite3::Database.new(file)
-      names, *table = db.execute2(sql, *vars)
-      db.close
-    when SQLite3::Database
-      db = expr
-      sql, *vars = *args
-      names, *table = db.execute2(sql, *vars)
-    when SQLite3::Statement
-      stmt = expr
-      vars = args
-      names = stmt.columns
-      table = stmt.execute!(*vars)
-    else
-      raise "invalid 1st arg"
-    end
-    table = table.to_ca
-    table.extend(CA::TableMethods)
-    table.column_names = names
-    return table
-  end
-
-  def to_sqlite3 (database: nil, table:, datatype: "numeric", schema: nil, transaction: true)
-    unless rank <= 2
-      raise "to_sqlite3 is valid only for 2-dim array (table)"
-    end
-    case database
-    when SQLite3::Database
-    when String
-      if File.exist? database
-        database = SQLite3::Database.open(database)
-      else
-        database = SQLite3::Database.new(database)        
-      end
-    else
-      database = SQLite3::Database.new ":memory:"
-    end
-    if respond_to?(:column_names) and column_names
-      vars = column_names
-    else
-      if rank == 1
-        vars = ["c0"]
-      else
-        vars = CArray.object(dim1).seq.map{|s| "c#{s}" }
-      end
-    end
-    
-    if schema
-      database.execute "create table if not exists #{table} (" + schema + ")"          
-    else
-      database.execute "create table if not exists #{table} (" + vars.map{|s| s + " " + datatype }.join(",") + ")"
-    end
-
-    insert = database.prepare %{ insert or replace into #{table} values (#{(["?"]*vars.size).join(",")}) }
-    database.transaction if transaction
-    if rank == 1
-      dim0.times do |i|
-        insert.execute [self[i]]
-      end
-    else
-      begin
-        dim0.times do |i|
-          begin
-           insert.execute self[i,nil].to_a
-          rescue
-            puts self[i,nil].to_a
-            raise $!
-          end
-        end
-      end
-    end
-    database.commit if transaction
-    insert.close
-    return database
-  end
-
-  def unblob (type, subdim = nil)
-    bytes = CArray.sizeof(type)
-    elem = nil
-    self.each do |e|
-      unless e.nil?
-        elem = e
-        break
-      end
-    end
-    if elem == nil and subdim == nil
-      raise "all element is nil, please specify dimension."
-    end
-    unless subdim
-      subdim = [elem.bytesize/bytes]
-    end
-    out = CArray.new(type, dim + subdim)
-    needed_bytes = out.elements/self.elements*bytes
-    ref = out.refer(:fixlen, dim, :bytes=>needed_bytes)
-    if elem and needed_bytes != elem.bytesize 
-      self.each_addr do |addr|
-        if self[addr].nil?
-          ref[[addr]] = UNDEF
-        else
-          ref[[addr]].load_binary self[addr]
-        end
-      end
-    elsif self.any_equal?(nil)
-      copy  = self.to_ca
-      sel   = self.eq(nil)
-      copy[sel] = "\0" * needed_bytes
-      ref.load_binary copy.join
-      ref[sel] = UNDEF
-    else
-      ref.load_binary self.join
-    end
-    return out
-  end
-  
-end
-
-module SQLite3
-  
-  class Database
-    
-    def create_table (table, data, names = nil)
-      ncols = data.rank == 1 ? 1 : data.dim1
-      if names
-        varlist = names.map{|s| s.to_s }
-      elsif data.respond_to?(:names)
-        varlist = data.names
-      else
-        varlist = []
-        ncols.times do |i|
-          varlist << "col#{i}"
-        end
-      end
-      execute %{create table #{table} (#{varlist.join(",")})}
-      insert(table, data)
-    end
-    
-    def insert (table, data)
-      table_info = execute %{
-        pragma table_info(#{table}) 
-      }  
-      if table_info.empty?
-        raise "#{table} is empty table"
-      end
-      qstns = (["?"]*table_info.size).join(",")
-      self.transaction {
-        stmt = prepare %{ 
-          insert or replace into #{table} values (#{qstns}) 
-        }
-        data.to_a.each do |row|
-          stmt.execute *row
-        end
-        stmt.close      
-      }
-    end
-
-    def schema (table = nil)
-      if table
-        return get_first_value %{
-          select sql from sqlite_master where type in ('table', 'view', 'index') and name = "#{table}"
-        }
-      else
-        return execute(%{
-          select sql from sqlite_master where type in ('table', 'view', 'index')
-        }).map{|v| v[0]}
-      end
-    end
-
-    # insert
-    def import_table (dbfile, src_table, dst_table = nil)
-      dst_table ||= src_table
-      db = "db#{Thread.current.object_id}"
-      execute %{
-        attach database "#{dbfile}" as #{db};
-      }
-      sql = get_first_value %{
-        select sql from #{db}.sqlite_master where type = 'table' and name = "#{src_table}"
-      }
-      sql.sub!(/create\s+table\s(.+?)\s/i, "create table if not exists #{dst_table}")
-      execute sql
-      execute %{
-        insert into #{dst_table} select * from #{db}.#{src_table};
-      }
-      indeces = execute %{
-        select sql from #{db}.sqlite_master where type = 'index' and tbl_name = "#{src_table}"        
-      } 
-      indeces.each do |row|
-        sql = row[0]
-        unless sql
-          break
-        end
-        sql.sub!(/create\s+index/i, "create index if not exists")
-        sql.sub!(/on\s+#{src_table}\(/i, "on #{dst_table}(")
-        execute sql
-      end
-      execute %{
-        detach database #{db};
-      }
-    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 */