/usr/include/rheolef/csr_row.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 | ///
/// 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 {
// get elem(i): return (i,xi) or (-1, 0.0)
// NOTE: suppose row is sorted by increasing indexes
template <class T>
pair<csr<T>::size_type,T>
csr<T>::const_row::operator() (size_type i) const
{
csr<T>::const_row::const_iterator iter = csr<T>::const_row::begin();
csr<T>::const_row::const_iterator last = csr<T>::const_row::end();
while (iter != last && (*iter).first <= i) {
if ((*iter).first == i) return *iter;
++iter;
}
return pair<size_type,T>(size_type(-1),T());
}
template <class T>
void
csr<T>::row::reset ()
{
csr<T>::row::iterator iter = begin();
csr<T>::row::iterator last = end();
while (iter != last) {
insert (iter, pair<size_type,T>((*iter).first, T()));
++iter;
}
}
}// namespace rheolef
|