Sha256: 9261581b03d3ae1e3e96455bf6c0d3703236d48237d6d20fe48a6ab881405772
Contents?: true
Size: 1.79 KB
Versions: 16
Compression:
Stored size: 1.79 KB
Contents
/////////////////////////////////////////////////////////////////////
// = 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 - 2014, Ruby Science Foundation
// NMatrix is Copyright (c) 2012 - 2014, John Woods and the 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
//
// == scal.h
//
// BLAS scal function.
//
#ifndef SCAL_H
#define SCAL_H
namespace nm { namespace math {
/* Purpose */
/* ======= */
/* DSCAL scales a vector by a constant. */
/* uses unrolled loops for increment equal to one. */
/* Further Details */
/* =============== */
/* jack dongarra, linpack, 3/11/78. */
/* modified 3/93 to return if incx .le. 0. */
/* modified 12/3/93, array(1) declarations changed to array(*) */
/* ===================================================================== */
template <typename DType>
inline void scal(const int n, const DType scalar, DType* x, const int incx) {
if (n <= 0 || incx <= 0) {
return;
}
for (int i = 0; incx < 0 ? i > n*incx : i < n*incx; i += incx) {
x[i] = scalar * x[i];
}
}
/*
* Function signature conversion for LAPACK's scal function.
*/
template <typename DType>
inline void cblas_scal(const int n, const void* scalar, void* x, const int incx) {
scal<DType>(n, *reinterpret_cast<const DType*>(scalar), reinterpret_cast<DType*>(x), incx);
}
}} // end of nm::math
#endif
Version data entries
16 entries across 16 versions & 5 rubygems