/usr/include/rheolef/csr-algo-amuld.h is in librheolef-dev 5.93-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 | # ifndef _SKIT_CSR_ALGO_AMUD_H
# define _SKIT_CSR_ALGO_AMUD_H
///
/// This file is part of Rheolef.
///
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
///
/// Rheolef 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.
///
/// Rheolef 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 Rheolef; if not, write to the Free Software
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
///
/// =========================================================================
//
// CSR: Compressed Sparse Row format
//
// csr*diag
//
// author: Pierre.Saramito@imag.fr
//
// date: 24 september 1997
//
//@!\vfill\listofalgorithms
/*@!
\vfill \pagebreak \mbox{} \vfill \begin{algorithm}[h]
\caption{{\tt amuld}: csr*diag sparse product}
\begin{algorithmic}
\INPUT {the diagonal and the matrix in CSR format}
ia(0:nrow), ja(0:nnz-1), a(0:nnz-1),
d(0:ncol-1)
\ENDINPUT
\OUTPUT {the result in CSR format}
ib(0:nrow), jb(0:nnzl-1), b(0:nnzl-1)
\ENDOUTPUT
\NOTE {the algorithm is in-place}
\ENDNOTE
\BEGIN
{\em first: copy ia into ib} \\
\FORTO {i := 0} {nrow}
ib(i) := ia(i)
\ENDFOR
{\em second: copy ja into jb} \\
\FORTO {p := 0} {nnz-1}
jb(p) := ja(p)
\ENDFOR
{\em third: compute b from a and d} \\
\FORTO {i := 0} {nrow-1}
\FORTO {p := ia(i)} {ia(i+1)-1}
b (p) := a(p) * d(ja(p))
\ENDFOR
\ENDFOR
\END
\end{algorithmic} \end{algorithm}
\vfill \pagebreak \mbox{} \vfill
*/
namespace rheolef {
// third pass: compute b from a and d
template <
class InputIterator1,
class InputIterator2,
class InputIterator3,
class RandomAcessIterator,
class OutputIterator>
void
amuld (
InputIterator1 ia,
InputIterator1 last_ia,
InputIterator2 ja,
InputIterator3 first_a,
RandomAcessIterator d,
OutputIterator b)
{
InputIterator3 a = first_a + (*ia++);
while (ia != last_ia) {
InputIterator3 last_a = first_a + (*ia++);
while (a != last_a)
*b++ = (*a++) * d [*ja++];
}
}
//@!\vfill
}// namespace rheolef
# endif // _SKIT_CSR_ALGO_AMUD_H
|