Mercurial > octave
view liboctave/numeric/oct-convn.cc @ 22197:e43d83253e28
refill multi-line macro definitions
Use the Emacs C++ mode style for line continuation markers in
multi-line macro definitions.
* make_int.cc, __dsearchn__.cc, __magick_read__.cc, besselj.cc,
bitfcns.cc, bsxfun.cc, cellfun.cc, data.cc, defun-dld.h, defun-int.h,
defun.h, det.cc, error.h, find.cc, gcd.cc, graphics.cc, interpreter.h,
jit-ir.h, jit-typeinfo.h, lookup.cc, ls-mat5.cc, max.cc, mexproto.h,
mxarray.in.h, oct-stream.cc, ordschur.cc, pr-output.cc, profiler.h,
psi.cc, regexp.cc, sparse-xdiv.cc, sparse-xpow.cc, tril.cc, txt-eng.h,
utils.cc, variables.cc, variables.h, xdiv.cc, xpow.cc, __glpk__.cc,
ov-base.cc, ov-base.h, ov-cell.cc, ov-ch-mat.cc, ov-classdef.cc,
ov-complex.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-float.cc, ov-float.h,
ov-flt-complex.cc, ov-flt-cx-mat.cc, ov-flt-re-mat.cc,
ov-int-traits.h, ov-lazy-idx.h, ov-perm.cc, ov-re-mat.cc,
ov-re-sparse.cc, ov-scalar.cc, ov-scalar.h, ov-str-mat.cc,
ov-type-conv.h, ov.cc, ov.h, op-class.cc, op-int-conv.cc, op-int.h,
op-str-str.cc, ops.h, lex.ll, Array.cc, CMatrix.cc, CSparse.cc,
MArray.cc, MArray.h, MDiagArray2.cc, MDiagArray2.h, MSparse.h,
Sparse.cc, dMatrix.cc, dSparse.cc, fCMatrix.cc, fMatrix.cc,
idx-vector.cc, f77-fcn.h, quit.h, bsxfun-decl.h, bsxfun-defs.cc,
lo-specfun.cc, oct-convn.cc, oct-convn.h, oct-norm.cc, oct-norm.h,
oct-rand.cc, Sparse-op-decls.h, Sparse-op-defs.h, mx-inlines.cc,
mx-op-decl.h, mx-op-defs.h, mach-info.cc, oct-group.cc, oct-passwd.cc,
oct-syscalls.cc, oct-time.cc, data-conv.cc, kpse.cc, lo-ieee.h,
lo-macros.h, oct-cmplx.h, oct-glob.cc, oct-inttypes.cc,
oct-inttypes.h, oct-locbuf.h, oct-sparse.h, url-transfer.cc,
oct-conf-post.in.h, shared-fcns.h: Refill macro definitions.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Mon, 01 Aug 2016 12:40:18 -0400 |
parents | 407c66ae1e20 |
children | bac0d6f07a3e |
line wrap: on
line source
/* Copyright (C) 2010-2015 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 (HAVE_CONFIG_H) # include "config.h" #endif #include <iostream> #include <algorithm> #include "f77-fcn.h" #include "oct-convn.h" #include "oct-locbuf.h" // 2d convolution with a matrix kernel. template <typename T, typename R> static void convolve_2d (const T *a, octave_idx_type ma, octave_idx_type na, const R *b, octave_idx_type mb, octave_idx_type nb, T *c, bool inner); // Forward instances to our Fortran implementations. #define FORWARD_IMPL(T_CXX, R_CXX, T, R, T_CAST, T_CONST_CAST, \ R_CONST_CAST, f, F) \ extern "C" \ F77_RET_T \ F77_FUNC (f##conv2o, F##CONV2O) (const F77_INT&, \ const F77_INT&, \ const T*, const F77_INT&, \ const F77_INT&, const R*, T *); \ \ extern "C" \ F77_RET_T \ F77_FUNC (f##conv2i, F##CONV2I) (const F77_INT&, \ const F77_INT&, \ const T*, const F77_INT&, \ const F77_INT&, const R*, T *); \ \ template <> void \ convolve_2d<T_CXX, R_CXX> (const T_CXX *a, F77_INT ma, F77_INT na, \ const R_CXX *b, F77_INT mb, F77_INT nb, \ T_CXX *c, bool inner) \ { \ if (inner) \ F77_XFCN (f##conv2i, F##CONV2I, (ma, na, T_CONST_CAST (a), \ mb, nb, R_CONST_CAST (b), \ T_CAST (c))); \ else \ F77_XFCN (f##conv2o, F##CONV2O, (ma, na, T_CONST_CAST (a), \ mb, nb, R_CONST_CAST (b), \ T_CAST (c))); \ } FORWARD_IMPL (double, double, F77_DBLE, F77_DBLE, , , , d, D) FORWARD_IMPL (float, float, F77_REAL, F77_REAL, , , , s, S) FORWARD_IMPL (std::complex<double>, std::complex<double>, F77_DBLE_CMPLX, F77_DBLE_CMPLX, F77_DBLE_CMPLX_ARG, F77_CONST_DBLE_CMPLX_ARG, F77_CONST_DBLE_CMPLX_ARG, z, Z) FORWARD_IMPL (std::complex<float>, std::complex<float>, F77_CMPLX, F77_CMPLX, F77_CMPLX_ARG, F77_CONST_CMPLX_ARG, F77_CONST_CMPLX_ARG, c, C) FORWARD_IMPL (std::complex<double>, double, F77_DBLE_CMPLX, F77_DBLE, F77_DBLE_CMPLX_ARG, F77_CONST_DBLE_CMPLX_ARG, , zd, ZD) FORWARD_IMPL (std::complex<float>, float, F77_CMPLX, F77_REAL, F77_CMPLX_ARG, F77_CONST_CMPLX_ARG, , cs, CS) template <typename T, typename R> void convolve_nd (const T *a, const dim_vector& ad, const dim_vector& acd, const R *b, const dim_vector& bd, const dim_vector& bcd, T *c, const dim_vector& ccd, int nd, bool inner) { if (nd == 2) convolve_2d<T, R> (a, ad(0), ad(1), b, bd(0), bd(1), c, inner); else { octave_idx_type ma = acd(nd-2); octave_idx_type na = ad(nd-1); octave_idx_type mb = bcd(nd-2); octave_idx_type nb = bd(nd-1); octave_idx_type ldc = ccd(nd-2); if (inner) { for (octave_idx_type ja = 0; ja < na - nb + 1; ja++) for (octave_idx_type jb = 0; jb < nb; jb++) convolve_nd<T, R> (a + ma*(ja+jb), ad, acd, b + mb*(nb-jb-1), bd, bcd, c + ldc*ja, ccd, nd-1, inner); } else { for (octave_idx_type ja = 0; ja < na; ja++) for (octave_idx_type jb = 0; jb < nb; jb++) convolve_nd<T, R> (a + ma*ja, ad, acd, b + mb*jb, bd, bcd, c + ldc*(ja+jb), ccd, nd-1, inner); } } } // Arbitrary convolutor. // The 2nd array is assumed to be the smaller one. template <typename T, typename R> static MArray<T> convolve (const MArray<T>& a, const MArray<R>& b, convn_type ct) { if (a.is_empty () || b.is_empty ()) return MArray<T> (); int nd = std::max (a.ndims (), b.ndims ()); const dim_vector adims = a.dims ().redim (nd); const dim_vector bdims = b.dims ().redim (nd); dim_vector cdims = dim_vector::alloc (nd); for (int i = 0; i < nd; i++) { if (ct == convn_valid) cdims(i) = std::max (adims(i) - bdims(i) + 1, static_cast<octave_idx_type> (0)); else cdims(i) = std::max (adims(i) + bdims(i) - 1, static_cast<octave_idx_type> (0)); } MArray<T> c (cdims, T ()); convolve_nd<T, R> (a.fortran_vec (), adims, adims.cumulative (), b.fortran_vec (), bdims, bdims.cumulative (), c.fortran_vec (), cdims.cumulative (), nd, ct == convn_valid); if (ct == convn_same) { // Pick the relevant part. Array<idx_vector> sidx (dim_vector (nd, 1)); for (int i = 0; i < nd; i++) sidx(i) = idx_vector::make_range (bdims(i)/2, 1, adims(i)); c = c.index (sidx); } return c; } #define CONV_DEFS(TPREF, RPREF) \ TPREF ## NDArray \ convn (const TPREF ## NDArray& a, const RPREF ## NDArray& b, \ convn_type ct) \ { \ return convolve (a, b, ct); \ } \ TPREF ## Matrix \ convn (const TPREF ## Matrix& a, const RPREF ## Matrix& b, \ convn_type ct) \ { \ return convolve (a, b, ct); \ } \ TPREF ## Matrix \ convn (const TPREF ## Matrix& a, const RPREF ## ColumnVector& c, \ const RPREF ## RowVector& r, convn_type ct) \ { \ return convolve (a, c * r, ct); \ } CONV_DEFS ( , ) CONV_DEFS (Complex, ) CONV_DEFS (Complex, Complex) CONV_DEFS (Float, Float) CONV_DEFS (FloatComplex, Float) CONV_DEFS (FloatComplex, FloatComplex)