This file is indexed.

/usr/include/rheolef/array_store.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
70
#ifndef _RHEOLEF_ARRAY_STORE_H
#define _RHEOLEF_ARRAY_STORE_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 {
//
// implementation for dense array
//
template <class OutputRandomIterator, class SetOp, class Size, class IsContainer = boost::mpl::false_>
struct array_store {};

// dense array of simple type, i.e. T is a mpi_datatype
template <class OutputRandomIterator, class SetOp, class Size>
struct array_store<OutputRandomIterator, SetOp, Size, boost::mpl::false_> {
    typedef typename std::iterator_traits<OutputRandomIterator>::value_type T;
    typedef typename std::pair<Size,T>                                      data_type;
    void operator()(const std::pair<Size,T>& val) { _op(_x [val.first], val.second); }
    Size n_new_entry() const { return 0; }
    array_store(OutputRandomIterator x, SetOp op) : _x(x), _op(op) {}
    OutputRandomIterator _x;
    SetOp                _op;
};
// dense array of more complex type, i.e. T is a container of mpi_datatype
template <class OutputRandomIterator, class SetOp, class Size>
struct array_store<OutputRandomIterator, SetOp, Size, boost::mpl::true_> {
    typedef typename std::iterator_traits<OutputRandomIterator>::value_type T;
    typedef typename T::value_type                                          U;
    typedef typename std::pair<Size,U>                                      data_type;
    void operator()(const std::pair<Size,U>& val) {
#ifdef TO_CLEAN
	// TODO: assume here that op is set_add_op; how to implement set_op ?
        // and that T=set, because we use T::insert() and T::value_type
	_x [val.first].insert (val.second);
#endif // TO_CLEAN
	_op (_x [val.first], val.second);
    }
    Size n_new_entry() const { return 0; }
    array_store(OutputRandomIterator x, SetOp op) : _x(x), _op(op) {}
    OutputRandomIterator _x;
    SetOp                _op;
};

// a simple wrapper, for convenience:
template <class OutputRandomIterator, class SetOp, class Size, class IsContainer>
inline
array_store<OutputRandomIterator, SetOp, Size, IsContainer>
array_make_store(OutputRandomIterator x, SetOp op, Size, IsContainer)
{
    return array_store<OutputRandomIterator, SetOp, Size, IsContainer>(x,op);
}
} // namespace rheolef
#endif // _RHEOLEF_ARRAY_STORE_H