/usr/include/libmesh/parallel_conversion_utils.h is in libmesh-dev 0.7.1-2ubuntu1.
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 | // $Id: parallel_conversion_utils.h 3874 2010-07-02 21:57:26Z roystgnr $
// The libMesh Finite Element Library.
// Copyright (C) 2002-2008 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// This library 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
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef __parallel_conversion_utils_h__
#define __parallel_conversion_utils_h__
#include <vector>
#include "libmesh_common.h"
#ifdef LIBMESH_HAVE_LIBHILBERT
#include "hilbert.h"
#endif
namespace libMesh
{
//--------------------------------------------------------------------------
namespace Parallel {
namespace Utils {
/**
* Utility function that returns true if the vector v
* is sorted, false otherwise. O(N), the length of the
* vector. This is implemented solely because the std::is_sorted
* appears to be an STL extension.
*/
template <typename KeyType>
inline
bool is_sorted (const std::vector<KeyType>& v)
{
if (v.empty())
return true;
for (unsigned int i=1; i<v.size(); i++)
if (v[i] < v[i-1])
return false;
return true;
}
/**
* A utility function which converts whatever \p KeyType is to
* a \p double for the histogram bounds
*/
template <typename KeyType>
inline
double to_double (const KeyType &k)
{
return static_cast<double>(k);
}
/**
* A utility to convert a \p double to some
* sort of \p KeyType, for interpreting how
* histogram bounds relate to \p KeyType
* positions.
*/
template <typename KeyType>
inline
KeyType to_key_type (const double f)
{
return static_cast<KeyType>(f);
}
#ifdef LIBMESH_HAVE_LIBHILBERT
template <>
inline
double to_double (const Hilbert::HilbertIndices &bvt)
{
return static_cast<double>(bvt.rack2);
}
template <>
inline
Hilbert::HilbertIndices
to_key_type (const double f)
{
Hilbert::HilbertIndices bvt;
bvt.rack0 = 0;
bvt.rack1 = 0;
bvt.rack2 = static_cast<Hilbert::inttype>(f);
return bvt;
}
#endif // LIBMESH_HAVE_LIBHILBERT
}
}
} // namespace libMesh
#endif // #define __parallel_conversion_utils_h__
|