/usr/include/rheolef/msg_left_permutation_apply.h is in librheolef-dev 6.6-1build2.
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 | #ifndef _RHEO_MSG_LEFT_PERMUTATION_APPLY_H
#define _RHEO_MSG_LEFT_PERMUTATION_APPLY_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
///
/// =========================================================================
namespace rheolef {
/*F:
NAME: msg_left_permutation_apply -- sequentail apply (@PACKAGE@ @VERSION@)
DESCRIPTION:
Applies a left permutation to an array.
ALGORITHM:
msg_left_permutation_apply
"input": the length array
| x(0:nx-1), py(0:n-1)
"output": the pointer array and the total size
| y(0:n)
begin
| for i := 0 to n-1 do
| y(py(i)) := x(i)
| endfor
end
COMPLEXITY:
Time and memory complexity is O(n).
METHODS: @msg_left_permutation_apply
AUTHORS:
LMC-IMAG, 38041 Grenoble cedex 9, France
| Pierre.Saramito@imag.fr
DATE: 6 january 1999
END:
*/
//<msg_left_permutation_apply:
template <
class InputIterator1,
class InputIterator2,
class SetOp,
class OutputRandomIterator>
void
msg_left_permutation_apply (
InputIterator1 x,
SetOp op,
InputIterator2 py,
InputIterator2 last_py,
OutputRandomIterator y)
{
while (py != last_py)
op(y[*py++], *x++);
}
//>msg_left_permutation_apply:
} // namespace rheolef
#endif // _RHEO_MSG_LEFT_PERMUTATION_APPLY_H
|