ruby-dnn 0.4.0 → 0.4.1

data/lib/dnn/ext/rb_stb_image/numo/types/robj_macro.h

@@ -1,75 +0,0 @@
-#define m_zero INT2FIX(0)
-#define m_one  INT2FIX(1)
-
-#define m_num_to_data(x) (x)
-#define m_data_to_num(x) (x)
-
-#define m_from_double(x) rb_float_new(x)
-#define m_from_real(x)   rb_float_new(x)
-
-#define m_add(x,y)     rb_funcall(x,'+',1,y)
-#define m_sub(x,y)     rb_funcall(x,'-',1,y)
-#define m_mul(x,y)     rb_funcall(x,'*',1,y)
-#define m_div(x,y)     rb_funcall(x,'/',1,y)
-#define m_mod(x,y)     rb_funcall(x,'%',1,y)
-#define m_divmod(x,y,a,b)                               \
-    {x = rb_funcall(x,id_divmod,1,y);                   \
-     a = RARRAY_PTR(x)[0]; b = RARRAY_PTR(x)[0];}
-#define m_pow(x,y)     rb_funcall(x,id_pow,1,y)
-#define m_pow_int(x,y) rb_funcall(x,id_pow,1,y)
-
-#define m_abs(x)       rb_funcall(x,id_abs,0)
-#define m_minus(x)     rb_funcall(x,id_minus,0)
-#define m_reciprocal(x)   rb_funcall(x,id_reciprocal,0)
-#define m_square(x)    rb_funcall(x,'*',1,x)
-#define m_floor(x)     rb_funcall(x,id_floor,0)
-#define m_round(x)     rb_funcall(x,id_round,0)
-#define m_ceil(x)      rb_funcall(x,id_ceil,0)
-#define m_trunc(x)     rb_funcall(x,id_truncate,0)
-#define m_sign(x)      rb_funcall(x,id_ufo,1,INT2FIX(0))
-
-#define m_eq(x,y)      RTEST(rb_funcall(x,id_eq,1,y))
-#define m_ne(x,y)      RTEST(rb_funcall(x,id_ne,1,y))
-#define m_gt(x,y)      RTEST(rb_funcall(x,id_gt,1,y))
-#define m_ge(x,y)      RTEST(rb_funcall(x,id_ge,1,y))
-#define m_lt(x,y)      RTEST(rb_funcall(x,id_lt,1,y))
-#define m_le(x,y)      RTEST(rb_funcall(x,id_le,1,y))
-
-#define m_bit_and(x,y) rb_funcall(x,id_bit_and,1,y)
-#define m_bit_or(x,y)  rb_funcall(x,id_bit_or, 1,y)
-#define m_bit_xor(x,y) rb_funcall(x,id_bit_xor,1,y)
-#define m_bit_not(x)   rb_funcall(x,id_bit_not,0)
-
-#define m_left_shift(x,y) rb_funcall(x,id_left_shift,1,y)
-#define m_right_shift(x,y) rb_funcall(x,id_right_shift,1,y)
-
-#define m_isnan(x)     ((rb_respond_to(x,id_nan_p)) ? RTEST(rb_funcall(x,id_nan_p,0)) : 0)
-#define m_isinf(x)     ((rb_respond_to(x,id_infinite_p)) ? RTEST(rb_funcall(x,id_infinite_p,0)) : 0)
-#define m_isposinf(x)  ((rb_respond_to(x,id_infinite_p)) ?        \
-                        ((RTEST(rb_funcall(x,id_infinite_p,0))) ? \
-                         m_gt(x,INT2FIX(0)) : 0) : 0)
-#define m_isneginf(x)  ((rb_respond_to(x,id_infinite_p)) ?              \
-                        ((RTEST(rb_funcall(x,id_infinite_p,0))) ?       \
-                         m_lt(x,INT2FIX(0)) : 0) : 0)
-#define m_isfinite(x)  ((rb_respond_to(x,id_finite_p)) ? RTEST(rb_funcall(x,id_finite_p,0)) : 0)
-
-#define m_mulsum_init INT2FIX(0)
-
-#define m_sprintf(s,x) robj_sprintf(s,x)
-
-static inline int robj_sprintf(char *s, VALUE x) {
-    VALUE v = rb_funcall(x,rb_intern("to_s"),0);
-    return sprintf(s,"%s",StringValuePtr(v));
-}
-
-#define m_sqrt(x)                                          \
-    rb_funcall(rb_const_get(rb_mKernel,rb_intern("Math")), \
-               rb_intern("sqrt"),1,x);
-
-static inline dtype f_seq(dtype x, dtype y, size_t c)
-{
-    y = m_mul(y,SIZET2NUM(c));
-    return m_add(x,y);
-}
-
-#include "real_accum.h"

data/lib/dnn/ext/rb_stb_image/numo/types/robject.h

@@ -1,27 +0,0 @@
-typedef VALUE dtype;
-typedef VALUE rtype;
-#define cT  numo_cRObject
-#define cRT cT
-//#define mTM mRObjectMath
-
-#include "float_def.h"
-#include "robj_macro.h"
-
-#define m_min_init (0.0/0.0)
-#define m_max_init (0.0/0.0)
-#define m_extract(x) (*(VALUE*)x)
-#define m_nearly_eq(x,y) robj_nearly_eq(x,y)
-
-inline static int robj_nearly_eq(VALUE vx, VALUE vy)
-{
-    double x, y;
-    x = NUM2DBL(vx);
-    y = NUM2DBL(vy);
-    return (fabs(x-y)<=(fabs(x)+fabs(y))*DBL_EPSILON*2);
-}
-
-/* generates a random number on [0,1)-real-interval */
-inline static dtype m_rand(dtype max)
-{
-    return DBL2NUM(genrand_res53_mix() * max);
-}

data/lib/dnn/ext/rb_stb_image/numo/types/scomplex.h

@@ -1,44 +0,0 @@
-typedef scomplex dtype;
-typedef float rtype;
-#define cT  numo_cSComplex
-#define cRT numo_cSFloat
-#define mTM numo_mSComplexMath
-
-#include "complex_macro.h"
-
-static inline bool c_nearly_eq(dtype x, dtype y) {
-    return c_abs(c_sub(x,y)) <= (c_abs(x)+c_abs(y))*FLT_EPSILON*2;
-}
-
-#ifdef SFMT_H
-/* generates a random number on [0,1)-real-interval */
-inline static dtype m_rand(dtype max)
-{
-    dtype z;
-    REAL(z) = to_real2(gen_rand32()) * REAL(max);
-    IMAG(z) = to_real2(gen_rand32()) * IMAG(max);
-    return z;
-}
-
-/* generates random numbers from the normal distribution
-   using Box-Muller Transformation.
- */
-inline static void m_rand_norm(dtype mu, rtype sigma, dtype *a0)
-{
-    rtype x1, x2, w;
-    do {
-	x1 = to_real2(gen_rand32());
-	x1 = x1*2-1;
-	x2 = to_real2(gen_rand32());
-	x2 = x2*2-1;
-	w = x1 * x1 + x2 * x2;
-    } while (w>=1);
-    w = sqrt( (-2*log(w)) / w );
-    REAL(*a0) = x1*w * sigma + REAL(mu);
-    IMAG(*a0) = x2*w * sigma + IMAG(mu);
-}
-#endif
-
-#define M_EPSILON rb_float_new(1.1920928955078125e-07)
-#define M_MIN     rb_float_new(1.1754943508222875e-38)
-#define M_MAX     rb_float_new(3.4028234663852886e+38)

data/lib/dnn/ext/rb_stb_image/numo/types/sfloat.h

@@ -1,43 +0,0 @@
-typedef float dtype;
-typedef float rtype;
-#define cT  numo_cSFloat
-#define cRT numo_cSFloat
-#define mTM numo_mSFloatMath
-
-#include "float_macro.h"
-
-#ifdef SFMT_H
-/* generates a random number on [0,1)-real-interval */
-inline static dtype m_rand(dtype max)
-{
-    return to_real2(gen_rand32()) * max;
-}
-
-/* generates random numbers from the normal distribution
-   using Box-Muller Transformation.
- */
-inline static void m_rand_norm(dtype mu, dtype sigma, dtype *a0, dtype *a1)
-{
-    dtype x1, x2, w;
-    do {
-	x1 = to_real2(gen_rand32());
-	x1 = x1*2-1;
-	x2 = to_real2(gen_rand32());
-	x2 = x2*2-1;
-	w = x1 * x1 + x2 * x2;
-    } while (w>=1);
-    w = sqrt( (-2*log(w)) / w );
-    if (a0) {*a0 = x1*w * sigma + mu;}
-    if (a1) {*a1 = x2*w * sigma + mu;}
-}
-#endif
-
-#define m_min_init numo_sfloat_new_dim0(0.0/0.0)
-#define m_max_init numo_sfloat_new_dim0(0.0/0.0)
-
-#define m_extract(x) rb_float_new(*(float*)x)
-#define m_nearly_eq(x,y) (fabs(x-y)<=(fabs(x)+fabs(y))*FLT_EPSILON*2)
-
-#define M_EPSILON rb_float_new(1.1920928955078125e-07)
-#define M_MIN     rb_float_new(1.1754943508222875e-38)
-#define M_MAX     rb_float_new(3.4028234663852886e+38)

data/lib/dnn/ext/rb_stb_image/numo/types/uint16.h

@@ -1,21 +0,0 @@
-typedef u_int16_t dtype;
-typedef u_int16_t rtype;
-#define cT  numo_cUInt16
-#define cRT cT
-
-#define m_num_to_data(x) ((dtype)NUM2UINT(x))
-#define m_data_to_num(x) UINT2NUM((unsigned int)(x))
-#define m_extract(x)     UINT2NUM((unsigned int)*(dtype*)(x))
-#define m_sprintf(s,x)   sprintf(s,"%u",(unsigned int)(x))
-
-#ifndef UINT16_MAX
-#define UINT16_MAX (65535)
-#endif
-
-#define DATA_MIN UINT16_MIN
-#define DATA_MAX UINT16_MAX
-
-#define M_MIN  INT2FIX(0)
-#define M_MAX  m_data_to_num(UINT16_MAX)
-
-#include "uint_macro.h"

data/lib/dnn/ext/rb_stb_image/numo/types/uint32.h

@@ -1,21 +0,0 @@
-typedef u_int32_t dtype;
-typedef u_int32_t rtype;
-#define cT  numo_cUInt32
-#define cRT cT
-
-#define m_num_to_data(x) ((dtype)NUM2UINT32(x))
-#define m_data_to_num(x) UINT322NUM((u_int32_t)(x))
-#define m_extract(x)     UINT322NUM((u_int32_t)*(dtype*)(x))
-#define m_sprintf(s,x)   sprintf(s,"%"PRIu32,(u_int32_t)(x))
-
-#ifndef UINT32_MAX
-#define UINT32_MAX (4294967295u)
-#endif
-
-#define DATA_MIN UINT32_MIN
-#define DATA_MAX UINT32_MAX
-
-#define M_MIN  INT2FIX(0)
-#define M_MAX  m_data_to_num(UINT32_MAX)
-
-#include "uint_macro.h"

data/lib/dnn/ext/rb_stb_image/numo/types/uint64.h

@@ -1,21 +0,0 @@
-typedef u_int64_t dtype;
-typedef u_int64_t rtype;
-#define cT  numo_cUInt64
-#define cRT cT
-
-#define m_num_to_data(x) ((dtype)NUM2UINT64(x))
-#define m_data_to_num(x) UINT642NUM((u_int64_t)(x))
-#define m_extract(x)     UINT642NUM((u_int64_t)*(dtype*)(x))
-#define m_sprintf(s,x)   sprintf(s,"%"PRIu64,(u_int64_t)(x))
-
-#ifndef UINT64_MAX
-#define UINT64_MAX (18446744073709551615ul)
-#endif
-
-#define DATA_MIN UINT64_MIN
-#define DATA_MAX UINT64_MAX
-
-#define M_MIN  INT2FIX(0)
-#define M_MAX  m_data_to_num(UINT64_MAX)
-
-#include "uint_macro.h"

data/lib/dnn/ext/rb_stb_image/numo/types/uint8.h

@@ -1,21 +0,0 @@
-typedef u_int8_t dtype;
-typedef u_int8_t rtype;
-#define cT  numo_cUInt8
-#define cRT cT
-
-#define m_num_to_data(x) ((dtype)NUM2UINT(x))
-#define m_data_to_num(x) UINT2NUM((unsigned int)(x))
-#define m_extract(x)     UINT2NUM((unsigned int)*(dtype*)(x))
-#define m_sprintf(s,x)   sprintf(s,"%u",(unsigned int)(x))
-
-#ifndef UINT8_MAX
-#define UINT8_MAX (255)
-#endif
-
-#define DATA_MIN UINT8_MIN
-#define DATA_MAX UINT8_MAX
-
-#define M_MIN  INT2FIX(0)
-#define M_MAX  m_data_to_num(UINT8_MAX)
-
-#include "uint_macro.h"

data/lib/dnn/ext/rb_stb_image/numo/types/uint_macro.h

@@ -1,32 +0,0 @@
-#include "xint_macro.h"
-
-#define m_abs(x)     (x)
-#define m_sign(x)    (((x)==0) ? 0:1)
-
-static inline dtype int_reciprocal(dtype x) {
-    switch (x) {
-    case 1:
-        return 1;
-    case 0:
-        rb_raise(rb_eZeroDivError, "divided by 0");
-    default:
-        return 0;
-    }
-}
-
-static dtype pow_int(dtype x, int p)
-{
-    dtype r = m_one;
-    switch(p) {
-    case 0: return 1;
-    case 1: return x;
-    case 2: return x*x;
-    case 3: return x*x*x;
-    }
-    while (p) {
-        if (p&1) r *= x;
-        x *= x;
-        p >>= 1;
-    }
-    return r;
-}

data/lib/dnn/ext/rb_stb_image/numo/types/xint_macro.h

@@ -1,189 +0,0 @@
-#define m_zero 0
-#define m_one  1
-
-#define m_from_double(x) (x)
-#define m_from_real(x) (x)
-
-#define m_add(x,y) ((x)+(y))
-#define m_sub(x,y) ((x)-(y))
-#define m_mul(x,y) ((x)*(y))
-#define m_div(x,y) ((x)/(y))
-#define m_mod(x,y) ((x)%(y))
-#define m_divmod(x,y,a,b) {a=(x)/(y); b=m_mod(x,y);}
-#define m_pow(x,y) pow_int(x,y)
-#define m_pow_int(x,y) pow_int(x,y)
-
-#define m_bit_and(x,y) ((x)&(y))
-#define m_bit_or(x,y)  ((x)|(y))
-#define m_bit_xor(x,y) ((x)^(y))
-#define m_bit_not(x)   (~(x))
-
-#define m_minus(x)   (-(x))
-#define m_reciprocal(x) int_reciprocal(x)
-#define m_square(x)  ((x)*(x))
-
-#define m_eq(x,y) ((x)==(y))
-#define m_ne(x,y) ((x)!=(y))
-#define m_gt(x,y) ((x)>(y))
-#define m_ge(x,y) ((x)>=(y))
-#define m_lt(x,y) ((x)<(y))
-#define m_le(x,y) ((x)<=(y))
-#define m_left_shift(x,y) ((x)<<(y))
-#define m_right_shift(x,y) ((x)>>(y))
-
-#define m_isnan(x) 0
-
-#define m_mulsum(x,y,z) {z += x*y;}
-#define m_mulsum_init INT2FIX(0)
-#define m_cumsum(x,y) {x += y;}
-#define m_cumprod(x,y) {x *= y;}
-
-#define cmp(a,b)                                        \
-    ((qsort_cast(a)==qsort_cast(b)) ? 0 :               \
-     (qsort_cast(a) > qsort_cast(b)) ? 1 : -1)
-#define cmpgt(a,b)                              \
-    (qsort_cast(a) > qsort_cast(b))
-
-
-static inline dtype f_sum(size_t n, char *p, ssize_t stride)
-{
-    dtype x,y=0;
-    size_t i=n;
-    for (; i--;) {
-        x = *(dtype*)p;
-        y += x;
-        p += stride;
-    }
-    return y;
-}
-
-static inline dtype f_prod(size_t n, char *p, ssize_t stride)
-{
-    dtype x,y=1;
-    size_t i=n;
-    for (; i--;) {
-        x = *(dtype*)p;
-        y *= x;
-        p += stride;
-    }
-    return y;
-}
-
-static inline dtype f_min(size_t n, char *p, ssize_t stride)
-{
-    dtype x,y;
-    size_t i=n;
-
-    y = *(dtype*)p;
-    p += stride;
-    i--;
-    for (; i--;) {
-        x = *(dtype*)p;
-        if (x < y) {
-            y = x;
-        }
-        p += stride;
-    }
-    return y;
-}
-
-static inline dtype f_max(size_t n, char *p, ssize_t stride)
-{
-    dtype x,y;
-    size_t i=n;
-
-    y = *(dtype*)p;
-    p += stride;
-    i--;
-    for (; i--;) {
-        x = *(dtype*)p;
-        if (x > y) {
-            y = x;
-        }
-        p += stride;
-    }
-    return y;
-}
-
-static inline size_t f_min_index(size_t n, char *p, ssize_t stride)
-{
-    dtype x, y;
-    size_t i, j=0;
-
-    y = *(dtype*)p;
-    for (i=1; i<n; i++) {
-        x = *(dtype*)(p+i*stride);
-        if (x < y) {
-            y = x;
-            j = i;
-        }
-    }
-    return j;
-}
-
-static inline size_t f_max_index(size_t n, char *p, ssize_t stride)
-{
-    dtype x, y;
-    size_t i, j=0;
-
-    y = *(dtype*)p;
-    for (i=1; i<n; i++) {
-        x = *(dtype*)(p+i*stride);
-        if (x > y) {
-            y = x;
-            j = i;
-        }
-    }
-    return j;
-}
-
-static inline void
-f_minmax(size_t n, char *p, ssize_t stride, dtype* amin, dtype* amax)
-{
-    dtype x,min,max;
-    size_t i=n;
-
-    min = max = *(dtype*)p;
-    p += stride;
-    for (i--; i--;) {
-        x = *(dtype*)p;
-        if (m_gt(x,max)) {
-            max = x;
-        }
-        if (m_lt(x,min)) {
-            min = x;
-        }
-        p += stride;
-    }
-    *amin = min;
-    *amax = max;
-    return;
-}
-
-static inline dtype f_ptp(size_t n, char *p, ssize_t stride)
-{
-    dtype min,max;
-    f_minmax(n,p,stride,&min,&max);
-    return m_sub(max,min);
-}
-
-static inline double f_seq(double x, double y, double c)
-{
-    return x + y * c;
-}
-
-static inline dtype f_maximum(dtype x, dtype y)
-{
-    if (m_ge(x,y)) {
-        return x;
-    }
-    return y;
-}
-
-static inline dtype f_minimum(dtype x, dtype y)
-{
-    if (m_le(x,y)) {
-        return x;
-    }
-    return y;
-}