nmatrix 0.0.1 → 0.0.2

data/ext/nmatrix/rational.c

@@ -1,98 +0,0 @@
-/////////////////////////////////////////////////////////////////////
-// = NMatrix
-//
-// A linear algebra library for scientific computation in Ruby.
-// NMatrix is part of SciRuby.
-//
-// NMatrix was originally inspired by and derived from NArray, by
-// Masahiro Tanaka: http://narray.rubyforge.org
-//
-// == Copyright Information
-//
-// SciRuby is Copyright (c) 2010 - 2012, Ruby Science Foundation
-// NMatrix is Copyright (c) 2012, Ruby Science Foundation
-//
-// Please see LICENSE.txt for additional copyright notices.
-//
-// == Contributing
-//
-// By contributing source code to SciRuby, you agree to be bound by
-// our Contributor Agreement:
-//
-// * https://github.com/SciRuby/sciruby/wiki/Contributor-Agreement
-//
-// == rational.c
-//
-// This file is largely based off of Ruby 1.9.3's rational.c. It
-// contains functions for dealing with rational types which are
-// not Ruby VALUE-based.
-
-#ifndef RATIONAL_C
-# define RATIONAL_C
-
-#include "nmatrix.h"
-
-
-inline int64_t nmrb_gcd(int64_t x, int64_t y) {
-  int64_t t;
-
-  if (x < 0) x = -x;
-  if (y < 0) y = -y;
-
-  if (x == 0) return y;
-  if (y == 0) return x;
-
-  while (x > 0) {
-    t = x;
-    x = y % x;
-    y = t;
-  }
-
-  return y;
-}
-
-/*
-static double f_gcd(double x, double y) {
-  double z;
-
-  if (x < 0.0) x = -x;
-  if (y < 0.0) y = -y;
-  if (x == 0.0) return y;
-  if (y == 0.0) return x;
-
-  for (;;) {
-    z = x;
-    x = y % x;
-    y = z;
-  }
-  // NOTREACHED
-}*/
-
-/*
-inline VALUE nmrb_rational_new_no_reduce1(VALUE klass, int64_t x) {
-  return nurat_s_canonicalize_internal_no_reduce(klass, x, 1);
-}
-
-inline static VALUE nurat_s_canonicalize_internal_no_reduce(VALUE klass, int64_t num, int64_t den) {
-  if (den < 0) {
-    num = -num;
-    den = -den;
-  } else if (den == 0) {
-    rb_raise_zerodiv();
-  }
-  return nurat_s_new_internal(klass, num, den);
-}*/
-/*
-inline VALUE nmrb_rational_new(VALUE klass, int64_t num, int64_t den) {
-  NEWOBJ(obj, struct RRational);
-  OBJSETUP(obj, klass, T_RATIONAL);
-
-  obj->num = INT2FIX(num);
-  obj->den = INT2FIX(den);
-
-  return (VALUE)obj;
-}
-*/
-
-
-#endif

data/ext/nmatrix/yale/complexmath.template.c

@@ -1,71 +0,0 @@
-
-inline static %%TYPE%% BOOL2%%= dtype.id.to_s.upcase%%(bool expr) {
-  %%TYPE%% result;
-  result.r = expr;
-  result.i = 0;
-  return result;
-}
-
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_mul(double ar, double ai, double br, double bi) {
-  %%TYPE%% result;
-
-  result.r = ar * br - ai * bi;
-  result.i = ar * bi + br * ai;
-
-  return result;
-}
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_div(double ar, double ai, double br, double bi) {
-  %%TYPE%% result;
-  double denom = br * br + bi * bi;
-
-  result.r = (ar * br + ai * bi) / denom;
-  result.i = (ai * br - ar * bi) / denom;
-
-  return result;
-}
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_add(%%= dtype.sym == :complex128 ? "double ar, double ai, double br, double bi" : "float ar, float ai, float br, float bi"%%) {
-  %%TYPE%% result;
-
-  result.r = ar + br;
-  result.i = ai + bi;
-
-  return result;
-}
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_sub(%%= dtype.sym == :complex128 ? "double ar, double ai, double br, double bi" : "float ar, float ai, float br, float bi"%%) {
-  %%TYPE%% result;
-
-  result.r = ar - br;
-  result.i = ai - bi;
-
-  return result;
-}
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_mod(%%= dtype.sym == :complex128 ? "double ar, double ai, double br, double bi" : "float ar, float ai, float br, float bi"%%) {
-  %%TYPE%% result;
-  rb_raise(rb_eNotImpError, "modulo arithmetic for complex numbers not yet implemented");
-
-  return result;
-}
-
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_bang(%%= dtype.sym == :complex128 ? "double ar, double ai" : "float ar, float ai"%%) {
-  %%TYPE%% result = {!ar, 0};
-  return result;
-}
-
-inline static %%TYPE%% %%TYPE_ABBREV%%_negate(%%= dtype.sym == :complex128 ? "double ar, double ai" : "float ar, float ai"%%) {
-  %%TYPE%% result;
-  result.r = -ar;
-  result.i = -ai;
-  return result;
-}
-

data/ext/nmatrix/yale/elementwise.template.c

@@ -1,46 +0,0 @@
-
-int %%INT_ABBREV%%_%%TYPE_ABBREV%%_ew(y_size_t n, y_size_t m, enum NMatrix_Ops op, const u_%%INT%%* ija, const u_%%INT%%* ijb, const u_%%INT%%* ijc, %%TYPE%%* a, %%TYPE%%* b, %%TYPE%%* c)
-{
-  y_size_t i;
-  y_size_t c_jj, a_jj, b_jj;
-  %%TYPE%% left, right;
-
-  for (i = 0; i < n; ++i) {
-    // do operation on diagonals first:
-    if (i < m) {
-      if (b) %%TYPE_ABBREV%%_ew_op_binary(op, &(c[i]), a[i], b[i]);
-      else   %%TYPE_ABBREV%%_ew_op_unary(op, &(c[i]), a[i]);
-    }
-
-    c_jj = ijc[i];
-    a_jj = ija[i];
-    if (ijb) b_jj = ijb[i];
-
-    //fprintf(stderr, "i16_f64_ew: n=%d, i=%d, c_jj=%d\n", (int)(n), (int)(i), (int)(c_jj));
-    while (c_jj < ijc[i+1]) {
-      // one or the other has to be the correct column (j = ijc[c_jj] ==? ija[a_jj])
-      if (a_jj < ija[i+1] && ija[a_jj] == ijc[c_jj]) {
-        %%TYPE left = a[a_jj]%%
-        ++a_jj;
-      } else {
-        %%TYPE left = 0%%
-      }
-
-      if (b) { // some ops don't have a second vector
-        if (b_jj < ijb[i+1] && ijb[b_jj] == ijc[c_jj]) {
-          %%TYPE right = b[b_jj]%%
-          ++b_jj;
-        } else {
-          %%TYPE right = 0%%
-        }
-
-        %%TYPE_ABBREV%%_ew_op_binary(op, &(c[c_jj]), left, right);
-      } else {
-        %%TYPE_ABBREV%%_ew_op_unary(op,  &(c[c_jj]), left);
-      }
-
-      ++c_jj;
-    }
-  }
-  return 0;
-}

data/ext/nmatrix/yale/elementwise_op.template.c

@@ -1,73 +0,0 @@
-
-static inline void %%TYPE_ABBREV%%_ew_op_unary(enum NMatrix_Ops op, %%TYPE%%* result, %%TYPE%% left) {
-  switch(op) {
-  case '!':
-    %%TYPE *result = !left%%
-    break;
-  case NM_OP_NEG:
-    %%TYPE *result = -left%%
-    break;
-  case '~':
-    %%TYPE *result = ~left%%
-    break;
-  default:
-    rb_raise(rb_eNotImpError, "Unrecognized element-wise unary operator");
-  }
-}
-
-
-
-static inline void %%TYPE_ABBREV%%_ew_op_binary(enum NMatrix_Ops op, %%TYPE%%* result, %%TYPE%% left, %%TYPE%% right) {
-  switch(op) {
-  case '+':
-    %%TYPE *result = left + right%%
-    break;
-  case '-':
-    %%TYPE *result = left - right%%
-    break;
-  case '*':
-    %%TYPE *result = left * right%%
-    break;
-  case '/':
-    %%TYPE *result = left / right%%
-    break;
-  case '%':
-    %%TYPE *result = left % right%%
-    break;
-  case NM_OP_EQEQ:
-    %%TYPE *result = left == right%%
-    break;
-  case NM_OP_NEQ:
-    %%TYPE *result = left != right%%
-    break;
-  case '>':
-    %%TYPE *result = left > right%%
-    break;
-  case '<':
-    %%TYPE *result = left < right%%
-    break;
-  case NM_OP_GTE:
-    %%TYPE *result = left >= right%%
-    break;
-  case NM_OP_LTE:
-    %%TYPE *result = left <= right%%
-    break;
-  case '&':
-    %%TYPE *result = left & right%%
-    break;
-  case '|':
-    %%TYPE *result = left | right%%
-    break;
-  case '^':
-    %%TYPE *result = left ^ right%%
-    break;
-  case NM_OP_LSH:
-    %%TYPE *result = left << right%%
-    break;
-  case NM_OP_RSH:
-    %%TYPE *result = left >> right%%
-    break;
-  default:
-    rb_raise(rb_eNotImpError, "Unrecognized element-wise binary operator");
-  }
-}

data/ext/nmatrix/yale/numbmm.template.c

@@ -1,94 +0,0 @@
-// numeric matrix multiply c=a*b
-void %%INT_ABBREV%%_%%TYPE_ABBREV%%_numbmm_(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, YALE_PARAM C)
-{
-  u_%%INT%% next[m];
-  %%TYPE%% sums[m];
-
-  %%TYPE%% v;
-  %%= if [:rational,:complex,:value].include?(dtype.type); "#{dtype.long_dtype.sizeof} temp1;"; end%%
-
-  u_%%INT%% head, length, temp, ndnz = 0;
-  u_%%INT%% jj_start, jj_end, kk_start, kk_end;
-  u_%%INT%% i, j, k, kk, jj;
-  u_%%INT%% minmn = SMMP_MIN(m,n);
-
-  u_%%INT%% *ia = (u_%%INT%%*)(A.ia),
-            *ja = (u_%%INT%%*)(A.ja),
-            *ib = (u_%%INT%%*)(B.ia),
-            *jb = (u_%%INT%%*)(B.ja),
-            *ic = (u_%%INT%%*)(C.ia),
-            *jc = (u_%%INT%%*)(C.ja);
-  %%TYPE%% *a = A.a,
-           *b = B.a,
-           *c = C.a;
-
-  for (i = 0; i < m; ++i) { // initialize scratch arrays
-    next[i] = U%%INT_MAX%%;
-    %%TYPE sums[i] = 0%%
-  }
-
-  for (i = 0; i < n; ++i) { // walk down the rows
-    head = U%%INT_MAX%%-1; // head gets assigned as whichever column of B's row j we last visited
-    length = 0;
-
-    jj_start = ia[i];
-    jj_end   = ia[i+1];
-
-    for (jj = jj_start; jj <= jj_end; ++jj) { // walk through entries in each row
-
-      if (jj == jj_end) { // if we're in the last entry for this row:
-        if (!A.diag || i >= minmn) continue;
-        j   = i;      // if it's a new Yale matrix, and last entry, get the diagonal position (j) and entry (ajj)
-        %%TYPE v = a[i]%%
-      } else {
-        j   = ja[jj]; // if it's not the last entry for this row, get the column (j) and entry (ajj)
-        %%TYPE v = a[jj]%%
-      }
-
-      kk_start = ib[j];   // Find the first entry of row j of matrix B
-      kk_end   = ib[j+1];
-      for (kk = kk_start; kk <= kk_end; ++kk) {
-
-        if (kk == kk_end) { // Get the column id for that entry
-          if (!B.diag || j >= minmn) continue;
-          k  = j;
-          %%TYPE sums[k] += v*b[k]%%
-        } else {
-          k  = jb[kk];
-          %%TYPE sums[k] += v*b[kk]%%
-        }
-
-        if (next[k] == U%%INT_MAX%%) {
-          next[k] = head;
-          head    = k;
-          ++length;
-        }
-      }
-    }
-
-    for (jj = 0; jj < length; ++jj) {
-      if (%%TYPE sums[head] != 0%%) {
-        if (C.diag && head == i) {
-          %%TYPE c[head] = sums[head]%%
-        } else {
-          jc[n+1+ndnz] = head;
-          %%TYPE c[n+1+ndnz] = sums[head]%%
-          ++ndnz;
-        }
-      }
-
-      temp = head;
-      head = next[head];
-
-      next[temp] = U%%INT_MAX%%;
-      %%TYPE sums[temp] = 0%%
-    }
-
-    ic[i+1] = n+1+ndnz;
-  }
-} /* numbmm_ */
-
-
-
-
-

data/ext/nmatrix/yale/smmp1.template.c

@@ -1,21 +0,0 @@
-
-void %%TYPE_ABBREV%%_symbmm(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, YALE_PARAM C)
-{
-  if (A.diag && A.ia != A.ja) {
-    fprintf(stderr, "A.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (B.diag && B.ia != B.ja) {
-    fprintf(stderr, "B.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (C.diag && C.ia != C.ja) {
-    fprintf(stderr, "C.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-
-  %%TYPE_ABBREV%%_symbmm_(n, m, A, B, C);
-}

data/ext/nmatrix/yale/smmp2.template.c

@@ -1,43 +0,0 @@
-
-void %%INT_ABBREV%%_%%TYPE_ABBREV%%_numbmm(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, YALE_PARAM C)
-{
-  if (A.diag && A.ia != A.ja) {
-    fprintf(stderr, "A.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (B.diag && B.ia != B.ja) {
-    fprintf(stderr, "B.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (C.diag && C.ia != C.ja) {
-    fprintf(stderr, "C.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  %%INT_ABBREV%%_%%TYPE_ABBREV%%_numbmm_(n, m, A, B, C);
-}
-
-// Perform both the symbolic and numeric steps together.
-void %%INT_ABBREV%%_%%TYPE_ABBREV%%_smmp(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, YALE_PARAM C)
-{
-  if (A.diag && A.ia != A.ja) {
-    fprintf(stderr, "A.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (B.diag && B.ia != B.ja) {
-    fprintf(stderr, "B.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  if (C.diag && C.ia != C.ja) {
-    fprintf(stderr, "C.diag=true, but ia!=ja. For new yale, ia must equal ja.");
-    return;
-  }
-
-  %%INT_ABBREV%%_symbmm_(n, m, A, B, C);
-  %%INT_ABBREV%%_%%TYPE_ABBREV%%_numbmm_(n, m, A, B, C);
-  %%INT_ABBREV%%_%%TYPE_ABBREV%%_smmp_sort_columns_(n, C);
-}

data/ext/nmatrix/yale/smmp2_header.template.c

@@ -1,46 +0,0 @@
-/////////////////////////////////////////////////////////////////////
-// = NMatrix
-//
-// A linear algebra library for scientific computation in Ruby.
-// NMatrix is part of SciRuby.
-//
-// NMatrix was originally inspired by and derived from NArray, by
-// Masahiro Tanaka: http://narray.rubyforge.org
-//
-// == Copyright Information
-//
-// SciRuby is Copyright (c) 2010 - 2012, Ruby Science Foundation
-// NMatrix is Copyright (c) 2012, Ruby Science Foundation
-//
-// Please see LICENSE.txt for additional copyright notices.
-//
-// == Contributing
-//
-// By contributing source code to SciRuby, you agree to be bound by
-// our Contributor Agreement:
-//
-// * https://github.com/SciRuby/sciruby/wiki/Contributor-Agreement
-//
-// == smmp2.c
-//
-/* ======================================================================= *
- * Sparse Matrix Multiplication Package                                    *
- * Randolph E. Bank and Craig C. Douglas                                   *
- * na.bank@na-net.ornl.gov and na.cdouglas@na-net.ornl.gov                 *
- * ======================================================================= */
-// This was originally derived from the above paper, but the algorithm they
-// give, in Fortran, uses 1-based indexing, and I simply could not make it
-// work. So I went back to where I found the link to that paper -- SciPy's
-// CSR type -- and looked at what they had done:
-//
-// https://github.com/scipy/scipy/blob/master/scipy/sparse/sparsetools/csr.h
-//
-// However, the SciPy version does not use the "new Yale" format, but rather
-// "old Yale." Thus, some modification was necessary -- reincorporating some
-// stuff from the original Bank & Douglas paper.
-//
-//
-// DO NOT MODIFY smmp2.c DIRECTLY, as it is autogenerated by generator.rb.
-
-#include <stdio.h>
-#include "nmatrix.h"

data/ext/nmatrix/yale/sort_columns.template.c

@@ -1,56 +0,0 @@
-//TODO: More efficient sorting algorithm than selection sort would be nice, probably.
-// Remember, we're dealing with unique keys, which simplifies things.
-// Doesn't have to be in-place, since we probably just multiplied and that wasn't in-place.
-
-void %%INT_ABBREV%%_%%TYPE_ABBREV%%_smmp_sort_columns_(y_size_t n, YALE_PARAM A)
-{
-  u_%%INT%% i, jj, jj_start, jj_end, min, min_jj;
-  %%TYPE%% temp_val;
-
-  u_%%INT%% *ia = (u_%%INT%%*)(A.ia),
-            *ja = (u_%%INT%%*)(A.ja);
-  %%TYPE%% *a = (%%TYPE%%*)(A.a);
-
-  for (i = 0; i < n; ++i) {
-    // No need to sort if there are 0 or 1 entries in the row
-    if (ia[i+1] - ia[i] < 2) continue;
-
-    jj_end = ia[i+1];
-    for (jj_start = ia[i]; jj_start < jj_end; ++jj_start) {
-
-      // If the previous min is just current-1, this key/value pair is already in sorted order.
-      // This follows from the unique condition on our column keys.
-      if (jj_start > ia[i] && min+1 == ja[jj_start]) {
-        min    = ja[jj_start];
-        continue;
-      }
-
-      // find the minimum key (column index) between jj_start and jj_end
-      min    = ja[jj_start];
-      min_jj = jj_start;
-      for (jj = jj_start+1; jj < jj_end; ++jj) {
-        if (ja[jj] < min) {
-          min_jj = jj;
-          min    = ja[jj];
-        }
-      }
-
-      // if min is already first, skip this iteration
-      if (min_jj == jj_start) continue;
-
-      for (jj = jj_start; jj < jj_end; ++jj) {
-        // swap minimum key/value pair with key/value pair in the first position.
-        if (min_jj != jj) {
-          // min already = ja[min_jj], so use this as temp_key
-          %%TYPE temp_val = a[min_jj]%%
-
-          ja[min_jj] = ja[jj];
-          %%TYPE a[min_jj] = a[jj]%%
-
-          ja[jj] = min;
-          %%TYPE a[jj] = temp_val%%
-        }
-      }
-    }
-  }
-}

data/ext/nmatrix/yale/symbmm.template.c

@@ -1,54 +0,0 @@
-
-// Symbolic matrix multiply c=a*b
-void %%TYPE_ABBREV%%_symbmm_(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, YALE_PARAM C)
-{
-  u_%%TYPE%% mask[m];
-  u_%%TYPE%% i, j, k, kk, jj, minmn, ndnz = n; /* Local variables */
-
-  u_%%TYPE%% *ia = (u_%%TYPE%%*)(A.ia),
-            *ja = (u_%%TYPE%%*)(A.ja),
-            *ib = (u_%%TYPE%%*)(B.ia),
-            *jb = (u_%%TYPE%%*)(B.ja),
-            *ic = (u_%%TYPE%%*)(C.ia);
-
-  for (j = 0; j < m; ++j)
-    mask[j] = U%%TYPE_MAX%%;
-
-  if (C.diag)  ic[0] = n+1;
-  else        ic[0] = 0;
-
-  minmn = SMMP_MIN(m,n);
-
-  for (i = 0; i < n; ++i) { // MAIN LOOP: through rows
-
-    for (jj = ia[i]; jj <= ia[i+1]; ++jj) { // merge row lists, walking through columns in each row
-
-      // j <- column index given by JA[jj], or handle diagonal.
-      if (jj == ia[i+1]) { // Don't really do it the last time -- just handle diagonals in a new yale matrix.
-        if (!A.diag || i >= minmn) continue;
-        j = i;
-      } else j = ja[jj];
-
-      for (kk = ib[j]; kk <= ib[j+1]; ++kk) { // Now walk through columns of row J in matrix B.
-        if (kk == ib[j+1]) {
-          if (!B.diag || j >= minmn) continue;
-          k = j;
-        } else k = jb[kk];
-
-        if (mask[k] != i) {
-          mask[k] = i;
-          ++ndnz;
-        }
-      }
-    }
-
-    if (C.diag && !mask[i]) --ndnz;
-
-    ic[i+1] = ndnz;
-  }
-} /* symbmm_ */
-
-
-
-
-

data/ext/nmatrix/yale/transp.template.c

@@ -1,68 +0,0 @@
-
-void %%INT_ABBREV%%_%%TYPE_ABBREV%%_transp_(y_size_t n, y_size_t m, YALE_PARAM A, YALE_PARAM B, bool move)
-{
-  u_%%INT%% i, j, index;
-
-  u_%%INT%% *ia = (u_%%INT%%*)(A.ia),
-            *ja = (u_%%INT%%*)(A.ja),
-            *ib = (u_%%INT%%*)(B.ia),
-            *jb = (u_%%INT%%*)(B.ja);
-  %%TYPE%% *a = A.a,
-           *b = B.a;
-
-  // Clear B
-  for (i = 0; i < m+1; ++i)
-    ib[i] = 0;
-  if (move) {
-    for (i = 0; i < m+1; ++i) {
-      %%TYPE b[i] = 0%%
-    }
-  }
-
-  if (A.diag) ib[0] = m + 1;
-  else       ib[0] = 0;
-
-/*       count indices for each column */
-
-  for (i = 0; i < n; ++i) {
-    for (j = ia[i]; j < ia[i+1]; ++j)
-        ++(ib[ja[j]+1]);
-  }
-
-  for (i = 0; i < m; ++i)
-    ib[i+1] = ib[i] + ib[i+1];
-
-/*       now make jb */
-
-  for (i = 0; i < n; ++i) {
-
-    for (j = ia[i]; j < ia[i+1]; ++j) {
-      index = ja[j];
-      jb[ib[index]] = i;
-
-      if (move)
-        %%TYPE b[ib[index]] = a[j]%%
-
-      ++(ib[index]);
-    }
-  }
-
-/*       now fixup ib */
-
-  for (i = m; i >= 1; --i)
-    ib[i] = ib[i-1];
-
-
-  if (A.diag) {
-    if (move) {
-      j = SMMP_MIN(n,m);
-
-      for (i = 0; i < j; ++i)
-        %%TYPE b[i] = a[i]%%
-    }
-    ib[0] = m + 1;
-
-  } else {
-    ib[0] = 0;
-  }
-}