⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 convolve.cc

📁 著名的数学计算类库
💻 CC
字号:
/*************************************************************************** * blitz/array/convolve.cc  One-dimensional convolution * * Copyright (C) 1997-2001 Todd Veldhuizen <tveldhui@oonumerics.org> * * This program 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 2 * of the License, or (at your option) any later version. * * This program 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. * * Suggestions:          blitz-dev@oonumerics.org * Bugs:                 blitz-bugs@oonumerics.org * * For more information, please see the Blitz++ Home Page: *    http://oonumerics.org/blitz/ * ****************************************************************************/#ifndef BZ_ARRAY_CONVOLVE_CC#define BZ_ARRAY_CONVOLVE_CCBZ_NAMESPACE(blitz)template<typename T>Array<T,1> convolve(const Array<T,1>& B, const Array<T,1>& C){    int Bl = B.lbound(0), Bh = B.ubound(0);    int Cl = C.lbound(0), Ch = C.ubound(0);    int lbound = Bl + Cl;    int ubound = Bh + Ch;        Array<T,1> A(Range(lbound,ubound));    for (int i=lbound; i <= ubound; ++i)    {        int jl = i - Ch;        if (jl < Bl)            jl = Bl;        int jh = i - Cl;        if (jh > Bh)            jh = Bh;        T result = 0;        for (int j=jl; j <= jh; ++j)            result += B(j) * C(i-j);        A(i) = result;    }    return A;}BZ_NAMESPACE_END#endif // BZ_ARRAY_CONVOLVE_CC

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -