/usr/include/sc/util/group/messaget.h is in libsc-dev 2.3.1-18build1.
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 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 | //
// messaget.h
//
// Copyright (C) 1996 Limit Point Systems, Inc.
//
// Author: Curtis Janssen <cljanss@limitpt.com>
// Maintainer: LPS
//
// This file is part of the SC Toolkit.
//
// The SC Toolkit is free software; you can redistribute it and/or modify
// it under the terms of the GNU Library General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
//
// The SC Toolkit 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 Library General Public License for more details.
//
// You should have received a copy of the GNU Library General Public License
// along with the SC Toolkit; see the file COPYING.LIB. If not, write to
// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
//
// The U.S. Government is granted a limited license as per AL 91-7.
//
#ifndef _util_group_messaget_h
#define _util_group_messaget_h
#ifdef __GNUC__
#pragma implementation
#endif
#include <util/group/message.h>
namespace sc {
template <class T>
void
GrpSumReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
target[i] += data[i];
}
}
template <class T>
void
GrpMinReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
if (target[i] > data[i]) target[i] = data[i];
}
}
template <class T>
void
GrpMaxReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
if (target[i] < data[i]) target[i] = data[i];
}
}
template <class T>
void
GrpArithmeticAndReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
target[i] = target[i] & data[i];
}
}
template <class T>
void
GrpArithmeticOrReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
target[i] = target[i] | data[i];
}
}
template <class T>
void
GrpArithmeticXOrReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
target[i] = target[i] ^ data[i];
}
}
template <class T>
void
GrpProductReduce<T>::reduce(T*target, T*data, int nelement)
{
for (int i=0; i<nelement; i++) {
target[i] *= data[i];
}
}
template <class T>
void
GrpFunctionReduce<T>::reduce(T*target, T*data, int nelement)
{
(*func_)(target,data,nelement);
}
}
#endif
/////////////////////////////////////////////////////////////////////////////
// Local Variables:
// mode: c++
// c-file-style: "CLJ"
// End:
|