Mercurial > octave
view liboctave/util/oct-binmap.h @ 22402:4caa7b28d183
maint: Style check C++ code in liboctave/
* Array-C.cc, Array-b.cc, Array-ch.cc, Array-d.cc, Array-f.cc, Array-fC.cc,
Array-i.cc, Array-idx-vec.cc, Array-s.cc, Array-str.cc, Array-util.cc,
Array-util.h, Array-voidp.cc, Array.cc, Array.h, CColVector.cc, CColVector.h,
CDiagMatrix.cc, CDiagMatrix.h, CMatrix.cc, CMatrix.h, CNDArray.cc, CNDArray.h,
CRowVector.cc, CRowVector.h, CSparse.cc, CSparse.h, DiagArray2.cc,
DiagArray2.h, MArray-C.cc, MArray-d.cc, MArray-f.cc, MArray-fC.cc, MArray-i.cc,
MArray-s.cc, MArray.cc, MArray.h, MDiagArray2.cc, MDiagArray2.h, MSparse-C.cc,
MSparse-d.cc, MSparse.cc, MSparse.h, Matrix.h, MatrixType.cc, MatrixType.h,
PermMatrix.cc, PermMatrix.h, Range.cc, Range.h, Sparse-C.cc, Sparse-b.cc,
Sparse-d.cc, Sparse.cc, Sparse.h, boolMatrix.cc, boolMatrix.h, boolNDArray.cc,
boolNDArray.h, boolSparse.cc, boolSparse.h, chMatrix.cc, chMatrix.h,
chNDArray.cc, chNDArray.h, dColVector.cc, dColVector.h, dDiagMatrix.cc,
dDiagMatrix.h, dMatrix.cc, dMatrix.h, dNDArray.cc, dNDArray.h, dRowVector.cc,
dRowVector.h, dSparse.cc, dSparse.h, dim-vector.cc, dim-vector.h,
fCColVector.cc, fCColVector.h, fCDiagMatrix.cc, fCDiagMatrix.h, fCMatrix.cc,
fCMatrix.h, fCNDArray.cc, fCNDArray.h, fCRowVector.cc, fCRowVector.h,
fColVector.cc, fColVector.h, fDiagMatrix.cc, fDiagMatrix.h, fMatrix.cc,
fMatrix.h, fNDArray.cc, fNDArray.h, fRowVector.cc, fRowVector.h, idx-vector.cc,
idx-vector.h, int16NDArray.cc, int16NDArray.h, int32NDArray.cc, int32NDArray.h,
int64NDArray.cc, int64NDArray.h, int8NDArray.cc, int8NDArray.h, intNDArray.cc,
intNDArray.h, uint16NDArray.cc, uint16NDArray.h, uint32NDArray.cc,
uint32NDArray.h, uint64NDArray.h, uint8NDArray.h, blaswrap.c, cquit.c,
f77-extern.cc, f77-fcn.c, f77-fcn.h, lo-error.c, lo-error.h, quit.cc, quit.h,
liboctave-build-info.h, liboctave-build-info.in.cc, CollocWt.cc, CollocWt.h,
DAE.h, DAEFunc.h, DAERT.h, DAERTFunc.h, DASPK.cc, DASPK.h, DASRT.cc, DASRT.h,
DASSL.cc, DASSL.h, DET.h, EIG.cc, EIG.h, LSODE.cc, LSODE.h, ODE.h, ODEFunc.h,
ODES.cc, ODES.h, ODESFunc.h, Quad.cc, Quad.h, aepbalance.cc, aepbalance.h,
base-dae.h, base-de.h, base-min.h, bsxfun-decl.h, bsxfun-defs.cc, bsxfun.h,
chol.cc, chol.h, eigs-base.cc, eigs-base.h, fEIG.cc, fEIG.h, gepbalance.cc,
gepbalance.h, gsvd.cc, gsvd.h, hess.cc, hess.h, lo-amos-proto.h,
lo-arpack-proto.h, lo-blas-proto.h, lo-fftpack-proto.h, lo-lapack-proto.h,
lo-mappers.cc, lo-mappers.h, lo-qrupdate-proto.h, lo-ranlib-proto.h,
lo-slatec-proto.h, lo-specfun.cc, lo-specfun.h, lu.cc, lu.h, oct-convn.cc,
oct-fftw.cc, oct-fftw.h, oct-norm.h, oct-rand.cc, oct-rand.h, oct-spparms.cc,
oct-spparms.h, qr.cc, qr.h, qrp.cc, qrp.h, randgamma.cc, randgamma.h,
randmtzig.cc, randmtzig.h, randpoisson.cc, randpoisson.h, schur.cc, schur.h,
sparse-chol.cc, sparse-chol.h, sparse-dmsolve.cc, sparse-dmsolve.h,
sparse-lu.cc, sparse-lu.h, sparse-qr.cc, sparse-qr.h, svd.cc, svd.h,
Sparse-diag-op-defs.h, Sparse-op-decls.h, Sparse-op-defs.h,
Sparse-perm-op-defs.h, mx-base.h, mx-defs.h, mx-ext.h, mx-inlines.cc,
mx-op-decl.h, mx-op-defs.h, child-list.cc, child-list.h, dir-ops.cc, dir-ops.h,
file-ops.cc, file-ops.h, file-stat.cc, file-stat.h, lo-sysdep.cc, lo-sysdep.h,
mach-info.cc, mach-info.h, oct-env.cc, oct-env.h, oct-group.cc, oct-group.h,
oct-passwd.cc, oct-passwd.h, oct-syscalls.cc, oct-time.cc, oct-time.h,
oct-uname.cc, oct-uname.h, action-container.h, base-list.h, byte-swap.h,
caseless-str.h, cmd-edit.cc, cmd-edit.h, cmd-hist.cc, cmd-hist.h, data-conv.cc,
data-conv.h, f2c-main.c, functor.h, glob-match.cc, glob-match.h, kpse.cc,
kpse.h, lo-array-errwarn.cc, lo-array-errwarn.h, lo-array-gripes.cc,
lo-array-gripes.h, lo-cutils.c, lo-cutils.h, lo-hash.cc, lo-hash.h, lo-ieee.cc,
lo-ieee.h, lo-macros.h, lo-math.h, lo-regexp.cc, lo-regexp.h, lo-traits.h,
lo-utils.cc, lo-utils.h, oct-alloc.h, oct-base64.cc, oct-binmap.h, oct-cmplx.h,
oct-glob.cc, oct-glob.h, oct-inttypes-fwd.h, oct-inttypes.cc, oct-inttypes.h,
oct-locbuf.cc, oct-mutex.cc, oct-mutex.h, oct-refcount.h, oct-rl-edit.c,
oct-rl-edit.h, oct-rl-hist.c, oct-rl-hist.h, oct-shlib.cc, oct-shlib.h,
oct-sort.cc, oct-sort.h, oct-sparse.h, oct-string.cc, oct-string.h,
pathsearch.cc, pathsearch.h, singleton-cleanup.cc, singleton-cleanup.h,
sparse-sort.cc, sparse-sort.h, sparse-util.cc, sparse-util.h, str-vec.cc,
str-vec.h, sun-utils.h, unwind-prot.cc, unwind-prot.h, url-transfer.cc,
url-transfer.h, areadlink-wrapper.c, areadlink-wrapper.h,
async-system-wrapper.c, async-system-wrapper.h, base64-wrappers.c,
base64-wrappers.h, canonicalize-file-name-wrapper.c,
canonicalize-file-name-wrapper.h, dirent-wrappers.c, dirent-wrappers.h,
fcntl-wrappers.c, fcntl-wrappers.h, filepos-wrappers.c, filepos-wrappers.h,
fpucw-wrappers.c, fpucw-wrappers.h, gen-tempname-wrapper.c,
gen-tempname-wrapper.h, getopt-wrapper.c, glob-wrappers.c, hash-wrappers.c,
hash-wrappers.h, math-wrappers.c, math-wrappers.h, mkostemp-wrapper.c,
mkostemp-wrapper.h, nanosleep-wrapper.c, nanosleep-wrapper.h, nproc-wrapper.c,
nproc-wrapper.h, octave-popen2.c, octave-popen2.h, putenv-wrapper.c,
putenv-wrapper.h, set-program-name-wrapper.c, set-program-name-wrapper.h,
signal-wrappers.c, signal-wrappers.h, stat-wrappers.c, stat-wrappers.h,
strdup-wrapper.c, strdup-wrapper.h, strftime-wrapper.c, strftime-wrapper.h,
strmode-wrapper.c, strmode-wrapper.h, strptime-wrapper.c, strptime-wrapper.h,
time-wrappers.c, time-wrappers.h, tmpfile-wrapper.c, tmpfile-wrapper.h,
uname-wrapper.c, uname-wrapper.h, unistd-wrappers.c, unistd-wrappers.h,
unsetenv-wrapper.c, unsetenv-wrapper.h, vasprintf-wrapper.c,
vasprintf-wrapper.h, wait-for-input.c, wait-for-input.h, wait-wrappers.c,
wait-wrappers.h:
Wrap long lines < 80 characters. Update incorrect indentation.
author | Rik <rik@octave.org> |
---|---|
date | Mon, 29 Aug 2016 11:09:25 -0700 |
parents | d0562b3159c7 |
children | 3a2b891d0b33 e9a0469dedd9 |
line wrap: on
line source
/* Copyright (C) 2010-2016 VZLU Prague This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #if ! defined (octave_oct_binmap_h) #define octave_oct_binmap_h 1 #include "octave-config.h" #include "Array.h" #include "Sparse.h" #include "Array-util.h" #include "bsxfun.h" // This source file implements a general binary maping function for arrays. // The syntax is binmap<type> (a, b, f,[name]). // type denotes the expected return type of the operation. // a, b, should be one of the 6 combinations: // // Array-Array // Array-scalar // scalar-Array // Sparse-Sparse // Sparse-scalar // scalar-Sparse // // If both operands are nonscalar, name must be supplied. It is used // as the base for error message when operands are nonconforming. // // The operation needs not be homogeneous, i.e., a, b and the result // may be of distinct types. f can have any of the four signatures: // // U f (T, R) // U f (const T&, R) // U f (T, const R&) // U f (const T&, const R&) // // Additionally, f can be an arbitrary functor object. // // octave_quit() is called at appropriate places, hence the operation // is breakable. // The following template wrappers are provided for automatic bsxfun // calls (see the function signature for do_bsxfun_op). template <typename R, typename X, typename Y, typename F> class bsxfun_wrapper { private: static F f; public: static void set_f (const F& f_in) { f = f_in; } static void op_mm (size_t n, R* r, const X* x , const Y* y) { for (size_t i = 0; i < n; i++) r[i] = f (x[i], y[i]); } static void op_sm (size_t n, R* r, X x, const Y* y) { for (size_t i = 0; i < n; i++) r[i] = f (x, y[i]); } static void op_ms (size_t n , R* r, const X* x, Y y) { for (size_t i = 0; i < n; i++) r[i] = f (x[i], y); } }; // Static init template <typename R, typename X, typename Y, typename F> F bsxfun_wrapper<R, X, Y, F>::f; // scalar-Array template <typename U, typename T, typename R, typename F> Array<U> binmap (const T& x, const Array<R>& ya, F fcn) { octave_idx_type len = ya.numel (); const R *y = ya.data (); Array<U> result (ya.dims ()); U *p = result.fortran_vec (); octave_idx_type i; for (i = 0; i < len - 3; i += 4) { octave_quit (); p[i] = fcn (x, y[i]); p[i+1] = fcn (x, y[i+1]); p[i+2] = fcn (x, y[i+2]); p[i+3] = fcn (x, y[i+3]); } octave_quit (); for (; i < len; i++) p[i] = fcn (x, y[i]); return result; } // Array-scalar template <typename U, typename T, typename R, typename F> Array<U> binmap (const Array<T>& xa, const R& y, F fcn) { octave_idx_type len = xa.numel (); const R *x = xa.data (); Array<U> result (xa.dims ()); U *p = result.fortran_vec (); octave_idx_type i; for (i = 0; i < len - 3; i += 4) { octave_quit (); p[i] = fcn (x[i], y); p[i+1] = fcn (x[i+1], y); p[i+2] = fcn (x[i+2], y); p[i+3] = fcn (x[i+3], y); } octave_quit (); for (; i < len; i++) p[i] = fcn (x[i], y); return result; } // Array-Array (treats singletons as scalars) template <typename U, typename T, typename R, typename F> Array<U> binmap (const Array<T>& xa, const Array<R>& ya, F fcn, const char *name) { dim_vector xad = xa.dims (); dim_vector yad = ya.dims (); if (xa.numel () == 1) return binmap<U, T, R, F> (xa(0), ya, fcn); else if (ya.numel () == 1) return binmap<U, T, R, F> (xa, ya(0), fcn); else if (xad != yad) { if (! is_valid_bsxfun (name, xad, yad)) octave::err_nonconformant (name, xad, yad); bsxfun_wrapper<U, T, R, F>::set_f(fcn); return do_bsxfun_op (xa, ya, bsxfun_wrapper<U, T, R, F>::op_mm, bsxfun_wrapper<U, T, R, F>::op_sm, bsxfun_wrapper<U, T, R, F>::op_ms); } octave_idx_type len = xa.numel (); const T *x = xa.data (); const T *y = ya.data (); Array<U> result (xa.dims ()); U *p = result.fortran_vec (); octave_idx_type i; for (i = 0; i < len - 3; i += 4) { octave_quit (); p[i] = fcn (x[i], y[i]); p[i+1] = fcn (x[i+1], y[i+1]); p[i+2] = fcn (x[i+2], y[i+2]); p[i+3] = fcn (x[i+3], y[i+3]); } octave_quit (); for (; i < len; i++) p[i] = fcn (x[i], y[i]); return result; } // scalar-Sparse template <typename U, typename T, typename R, typename F> Sparse<U> binmap (const T& x, const Sparse<R>& ys, F fcn) { R yzero = R (); U fz = fcn (x, yzero); if (fz == U ()) // Sparsity preserving fcn { octave_idx_type nz = ys.nnz (); Sparse<U> retval (ys.rows (), ys.cols (), nz); std::copy (ys.ridx (), ys.ridx () + nz, retval.ridx ()); std::copy (ys.cidx (), ys.cidx () + ys.cols () + 1, retval.cidx ()); for (octave_idx_type i = 0; i < nz; i++) { octave_quit (); // FIXME: Could keep track of whether fcn call results in a 0. // If no zeroes are created could skip maybe_compress() retval.xdata (i) = fcn (x, ys.data (i)); } octave_quit (); retval.maybe_compress (true); return retval; } else return Sparse<U> (binmap<U, T, R, F> (x, ys.array_value (), fcn)); } // Sparse-scalar template <typename U, typename T, typename R, typename F> Sparse<U> binmap (const Sparse<T>& xs, const R& y, F fcn) { T xzero = T (); U fz = fcn (xzero, y); if (fz == U ()) // Sparsity preserving fcn { octave_idx_type nz = xs.nnz (); Sparse<U> retval (xs.rows (), xs.cols (), nz); std::copy (xs.ridx (), xs.ridx () + nz, retval.ridx ()); std::copy (xs.cidx (), xs.cidx () + xs.cols () + 1, retval.cidx ()); for (octave_idx_type i = 0; i < nz; i++) { octave_quit (); // FIXME: Could keep track of whether fcn call results in a 0. // If no zeroes are created could skip maybe_compress() retval.xdata (i) = fcn (xs.data (i), y); } octave_quit (); retval.maybe_compress (true); return retval; } else return Sparse<U> (binmap<U, T, R, F> (xs.array_value (), y, fcn)); } // Sparse-Sparse (treats singletons as scalars) template <typename U, typename T, typename R, typename F> Sparse<U> binmap (const Sparse<T>& xs, const Sparse<R>& ys, F fcn, const char *name) { if (xs.rows () == 1 && xs.cols () == 1) return binmap<U, T, R, F> (xs(0,0), ys, fcn); else if (ys.rows () == 1 && ys.cols () == 1) return binmap<U, T, R, F> (xs, ys(0,0), fcn); else if (xs.dims () != ys.dims ()) octave::err_nonconformant (name, xs.dims (), ys.dims ()); T xzero = T (); R yzero = R (); U fz = fcn (xzero, yzero); if (fz == U ()) { // Sparsity-preserving function. Do it efficiently. octave_idx_type nr = xs.rows (); octave_idx_type nc = xs.cols (); Sparse<T> retval (nr, nc, xs.nnz () + ys.nnz ()); octave_idx_type nz = 0; for (octave_idx_type j = 0; j < nc; j++) { octave_quit (); octave_idx_type jx = xs.cidx (j); octave_idx_type jx_max = xs.cidx (j+1); bool jx_lt_max = jx < jx_max; octave_idx_type jy = ys.cidx (j); octave_idx_type jy_max = ys.cidx (j+1); bool jy_lt_max = jy < jy_max; while (jx_lt_max || jy_lt_max) { if (! jy_lt_max || (jx_lt_max && (xs.ridx (jx) < ys.ridx (jy)))) { retval.xridx (nz) = xs.ridx (jx); retval.xdata (nz) = fcn (xs.data (jx), yzero); jx++; jx_lt_max = jx < jx_max; } else if (! jx_lt_max || (jy_lt_max && (ys.ridx (jy) < xs.ridx (jx)))) { retval.xridx (nz) = ys.ridx (jy); retval.xdata (nz) = fcn (xzero, ys.data (jy)); jy++; jy_lt_max = jy < jy_max; } else { retval.xridx (nz) = xs.ridx (jx); retval.xdata (nz) = fcn (xs.data (jx), ys.data (jy)); jx++; jx_lt_max = jx < jx_max; jy++; jy_lt_max = jy < jy_max; } nz++; } retval.xcidx (j+1) = nz; } retval.maybe_compress (true); return retval; } else return Sparse<U> (binmap<U, T, R, F> (xs.array_value (), ys.array_value (), fcn, name)); } // Overloads for function pointers. // Signature (T, R) template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const Array<R>& ya, U (*fcn) (T, R), const char *name) { return binmap<U, T, R, U (*) (T, R)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Array<U> binmap (const T& x, const Array<R>& ya, U (*fcn) (T, R)) { return binmap<U, T, R, U (*) (T, R)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const R& y, U (*fcn) (T, R)) { return binmap<U, T, R, U (*) (T, R)> (xa, y, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const Sparse<R>& ya, U (*fcn) (T, R), const char *name) { return binmap<U, T, R, U (*) (T, R)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const T& x, const Sparse<R>& ya, U (*fcn) (T, R)) { return binmap<U, T, R, U (*) (T, R)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const R& y, U (*fcn) (T, R)) { return binmap<U, T, R, U (*) (T, R)> (xa, y, fcn); } // Signature (const T&, const R&) template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const Array<R>& ya, U (*fcn) (const T&, const R&), const char *name) { return binmap<U, T, R, U (*) (const T&, const R&)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Array<U> binmap (const T& x, const Array<R>& ya, U (*fcn) (const T&, const R&)) { return binmap<U, T, R, U (*) (const T&, const R&)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const R& y, U (*fcn) (const T&, const R&)) { return binmap<U, T, R, U (*) (const T&, const R&)> (xa, y, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const Sparse<R>& ya, U (*fcn) (const T&, const R&), const char *name) { return binmap<U, T, R, U (*) (const T&, const R&)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const T& x, const Sparse<R>& ya, U (*fcn) (const T&, const R&)) { return binmap<U, T, R, U (*) (const T&, const R&)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const R& y, U (*fcn) (const T&, const R&)) { return binmap<U, T, R, U (*) (const T&, const R&)> (xa, y, fcn); } // Signature (const T&, R) template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const Array<R>& ya, U (*fcn) (const T&, R), const char *name) { return binmap<U, T, R, U (*) (const T&, R)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Array<U> binmap (const T& x, const Array<R>& ya, U (*fcn) (const T&, R)) { return binmap<U, T, R, U (*) (const T&, R)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const R& y, U (*fcn) (const T&, R)) { return binmap<U, T, R, U (*) (const T&, R)> (xa, y, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const Sparse<R>& ya, U (*fcn) (const T&, R), const char *name) { return binmap<U, T, R, U (*) (const T&, R)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const T& x, const Sparse<R>& ya, U (*fcn) (const T&, R)) { return binmap<U, T, R, U (*) (const T&, R)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const R& y, U (*fcn) (const T&, R)) { return binmap<U, T, R, U (*) (const T&, R)> (xa, y, fcn); } // Signature (T, const R&) template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const Array<R>& ya, U (*fcn) (T, const R&), const char *name) { return binmap<U, T, R, U (*) (T, const R&)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Array<U> binmap (const T& x, const Array<R>& ya, U (*fcn) (T, const R&)) { return binmap<U, T, R, U (*) (T, const R&)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Array<U> binmap (const Array<T>& xa, const R& y, U (*fcn) (T, const R&)) { return binmap<U, T, R, U (*) (T, const R&)> (xa, y, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const Sparse<R>& ya, U (*fcn) (T, const R&), const char *name) { return binmap<U, T, R, U (*) (T, const R&)> (xa, ya, fcn, name); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const T& x, const Sparse<R>& ya, U (*fcn) (T, const R&)) { return binmap<U, T, R, U (*) (T, const R&)> (x, ya, fcn); } template <typename U, typename T, typename R> inline Sparse<U> binmap (const Sparse<T>& xa, const R& y, U (*fcn) (T, const R&)) { return binmap<U, T, R, U (*) (T, const R&)> (xa, y, fcn); } #endif