fast_matrix 0.1.66 → 0.2.0

data/ext/fast_matrix/matrix.h

@@ -1,28 +0,0 @@
-#ifndef FAST_MATRIX_MATRIX_H
-#define FAST_MATRIX_MATRIX_H 1
-
-#include "ruby.h"
-
-extern VALUE cMatrix;
-extern const rb_data_type_t matrix_type;
-
-// matrix
-//     m --->
-//   [ 0,    1, ..,  m-1]
-// n [ m,  m+1, .., 2m-1]
-// | [2m, 2m+1, .., 3m-1]
-// V [ . . . . .
-//         . . . .  nm-1]
-struct matrix
-{
-    int m;
-    int n;
-
-    double* data;
-};
-
-void c_matrix_init(struct matrix* mtr, int m, int n);
-
-void init_fm_matrix();
-
-#endif /* FAST_MATRIX_MATRIX_H */

data/ext/fast_matrix/vector.c

@@ -1,277 +0,0 @@
-#include "vector.h"
-#include "c_array_operations.h"
-#include "errors.h"
-#include "matrix.h"
-
-VALUE cVector;
-
-void vector_free(void* data);
-size_t vector_size(const void* data);
-
-const rb_data_type_t vector_type =
-{
-    .wrap_struct_name = "vector",
-    .function =
-    {
-                .dmark = NULL,
-                .dfree = vector_free,
-                .dsize = vector_size,
-        },
-        .data = NULL,
-        .flags = RUBY_TYPED_FREE_IMMEDIATELY,
-};
-
-void vector_free(void* data)
-{
-	free(((*(struct vector*)data)).data);
-    free(data);
-}
-
-size_t vector_size(const void* data)
-{
-	return sizeof(struct vector);
-}
-
-VALUE vector_alloc(VALUE self)
-{
-	struct vector* vct = malloc(sizeof(struct vector));
-    vct->data = NULL;
-	return TypedData_Wrap_Struct(self, &vector_type, vct);
-}
-
-void c_vector_init(struct vector* vect, int n)
-{
-    vect->n = n;
-    vect->data = malloc(n * sizeof(double));
-}
-
-VALUE vector_initialize(VALUE self, VALUE size)
-{
-	struct vector* data;
-    int n = raise_rb_value_to_int(size);
-
-    if(n <= 0)
-        rb_raise(fm_eIndexError, "Size cannot be negative or zero");
-
-	TypedData_Get_Struct(self, struct vector, &vector_type, data);
-
-    c_vector_init(data, n);
-
-	return self;
-}
-
-//  []=
-VALUE vector_set(VALUE self, VALUE idx, VALUE v)
-{
-    int i = raise_rb_value_to_int(idx);
-    double x = raise_rb_value_to_double(v);
-
-	struct vector* data;
-	TypedData_Get_Struct(self, struct vector, &vector_type, data);
-
-    i = (i < 0) ? data->n + i : i;
-    raise_check_range(i, 0, data->n);
-
-    data->data[i] = x;
-    return v;
-}
-
-//  []
-VALUE vector_get(VALUE self, VALUE idx)
-{
-    int i = raise_rb_value_to_int(idx);
-
-	struct vector* data;
-	TypedData_Get_Struct(self, struct vector, &vector_type, data);
-
-    i = (i < 0) ? data->n + i : i;
-    
-    if(i < 0 || i >= data->n)
-        return Qnil;
-
-    return DBL2NUM(data->data[i]);
-}
-
-VALUE c_vector_size(VALUE self)
-{
-	struct vector* data;
-	TypedData_Get_Struct(self, struct vector, &vector_type, data);
-    return INT2NUM(data->n);
-}
-
-
-VALUE vector_add_with(VALUE self, VALUE value)
-{
-	struct vector* A;
-    struct vector* B;
-	TypedData_Get_Struct(self, struct vector, &vector_type, A);
-	TypedData_Get_Struct(value, struct vector, &vector_type, B);
-
-    if(A->n != B->n)
-        rb_raise(fm_eIndexError, "Different sizes matrices");
-
-    int n = A->n;
-
-    struct vector* C;
-    VALUE result = TypedData_Make_Struct(cVector, struct vector, &vector_type, C);
-
-    c_vector_init(C, n);
-    add_d_arrays_to_result(n, A->data, B->data, C->data);
-
-    return result;
-}
-
-
-VALUE vector_add_from(VALUE self, VALUE value)
-{
-	struct vector* A;
-    struct vector* B;
-	TypedData_Get_Struct(self, struct vector, &vector_type, A);
-	TypedData_Get_Struct(value, struct vector, &vector_type, B);
-
-    if(A->n != B->n)
-        rb_raise(fm_eIndexError, "Different sizes matrices");
-
-    int n = A->n;
-
-    add_d_arrays_to_first(n, A->data, B->data);
-
-    return self;
-}
-
-VALUE vector_equal(VALUE self, VALUE value)
-{
-	struct vector* A;
-    struct vector* B;
-	TypedData_Get_Struct(self, struct vector, &vector_type, A);
-	TypedData_Get_Struct(value, struct vector, &vector_type, B);
-
-    if(A->n != B->n)
-		return Qfalse;
-
-    int n = A->n;
-
-    if(equal_d_arrays(n, A->data, B->data))
-		return Qtrue;
-	return Qfalse;
-}
-
-VALUE vector_copy(VALUE v)
-{
-	struct vector* V;
-	TypedData_Get_Struct(v, struct vector, &vector_type, V);
-
-    struct vector* R;
-    VALUE result = TypedData_Make_Struct(cVector, struct vector, &vector_type, R);
-
-    c_vector_init(R, V->n);
-    copy_d_array(R->n, V->data, R->data);
-
-    return result;
-}
-
-// V - vector n
-// M - matrix m x 1
-// R - matrix m x n
-void c_vector_matrix_multiply(int n, int m, const double* V, const double* M, double* R)
-{
-    fill_d_array(m * n, R, 0);
-
-    for(int j = 0; j < n; ++j)
-    {
-        double* p_r = R + m * j;
-        double d_v = V[j];
-        
-        for(int i = 0; i < m; ++i)
-            p_r[i] += d_v * M[i];
-    }
-}
-
-VALUE vector_multiply_vm(VALUE self, VALUE other)
-{
-	struct vector* V;
-    struct matrix* M;
-	TypedData_Get_Struct(self, struct vector, &vector_type, V);
-	TypedData_Get_Struct(other, struct matrix, &matrix_type, M);
-
-    if(M->n != 1)
-        rb_raise(fm_eIndexError, "Number of rows must be 1");
-
-    int m = M->m;
-    int n = V->n;
-
-    struct matrix* R;
-    VALUE result = TypedData_Make_Struct(cMatrix, struct matrix, &matrix_type, R);
-
-    c_matrix_init(R, m, n);
-    c_vector_matrix_multiply(n, m, V->data, M->data, R->data);
-
-    return result;
-}
-
-VALUE vector_multiply_vn(VALUE self, VALUE value)
-{
-	struct vector* A;
-	TypedData_Get_Struct(self, struct vector, &vector_type, A);
-
-    double d = NUM2DBL(value);
-
-    struct vector* R;
-    VALUE result = TypedData_Make_Struct(cVector, struct vector, &vector_type, R);
-
-    c_vector_init(R, A->n);
-    copy_d_array(R->n, A->data, R->data);
-    multiply_d_array(R->n, R->data, d);
-
-    return result;
-}
-
-VALUE vector_multiply_vv(VALUE self, VALUE other)
-{
-    struct vector* A;
-    struct vector* B;
-    TypedData_Get_Struct(self, struct vector, &vector_type, A);
-    TypedData_Get_Struct(other, struct vector, &vector_type, B);
-    
-    if(B->n != 1)
-        rb_raise(fm_eIndexError, "Length of vector must be equal to 1");
-
-    struct vector* R;
-    VALUE result = TypedData_Make_Struct(cVector, struct vector, &vector_type, R);
-
-    c_vector_init(R, A->n);
-    copy_d_array(A->n, A->data, R->data);
-    multiply_d_array(R->n, R->data, B->data[0]);
-
-    return result;
-}
-
-VALUE vector_multiply(VALUE self, VALUE v)
-{
-    if(RB_FLOAT_TYPE_P(v) || FIXNUM_P(v)
-        || RB_TYPE_P(v, T_BIGNUM))
-        return vector_multiply_vn(self, v);
-    if(RBASIC_CLASS(v) == cMatrix)
-        return vector_multiply_vm(self, v);
-    if(RBASIC_CLASS(v) == cVector)
-        return vector_multiply_vv(self, v);
-    rb_raise(fm_eTypeError, "Invalid klass for multiply");
-}
-
-void init_fm_vector()
-{
-    VALUE  mod = rb_define_module("FastMatrix");
-	cVector = rb_define_class_under(mod, "Vector", rb_cData);
-
-	rb_define_alloc_func(cVector, vector_alloc);
-
-	rb_define_method(cVector, "initialize", vector_initialize, 1);
-	rb_define_method(cVector, "[]", vector_get, 1);
-	rb_define_method(cVector, "[]=", vector_set, 2);
-	rb_define_method(cVector, "size", c_vector_size, 0);
-	rb_define_method(cVector, "+", vector_add_with, 1);
-	rb_define_method(cVector, "+=", vector_add_from, 1);
-	rb_define_method(cVector, "eql?", vector_equal, 1);
-	rb_define_method(cVector, "clone", vector_copy, 0);
-	rb_define_method(cVector, "*", vector_multiply, 1);
-}