/usr/include/GDF/tools.h is in libgdf-dev 0.1.2-2+b7.
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 | //
// This file is part of libGDF.
//
// libGDF 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 3 of
// the License, or (at your option) any later version.
//
// libGDF 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 libGDF. If not, see <http://www.gnu.org/licenses/>.
//
// Copyright 2010 Martin Billinger
#ifndef __TOOLS_H_INCLUDED__
#define __TOOLS_H_INCLUDED__
#include <vector>
namespace gdf
{
template<class T>
T gcd( T a, T b)
{
if( a == 0 )
return b;
if( b == 0 )
return a;
while( 1 )
{
a = a % b;
if( a == 0 )
return b;
b = b % a;
if( b == 0 )
return a;
}
}
template<class T>
T gcd( const std::vector<T> &v, size_t p, size_t r )
{
if( v.size() == 0 )
throw exception::empty_container( "calculating GCD" );
if( p>=v.size() || r>= v.size() )
throw exception::index_out_of_range( "calculating GCD" );
if( r == p+1 )
return gcd( v[p], v[r] );
if( r == p )
return v[p];
int q = (p+r)/2;
return gcd( gcd( v, p, q ), gcd( v, q+1, r ) );
}
template<class T>
T gcd( const std::vector<T> &v )
{
return gcd( v, size_t(0), v.size()-1 );
}
template<class T>
T max( const std::vector<T> &v )
{
T m = v[0];
for( size_t i=1; i<v.size(); i++ )
m = std::max( m, v[i] );
return m;
}
template<class T>
T min( const std::vector<T> &v )
{
T m = v[0];
for( size_t i=1; i<v.size(); i++ )
m = std::min( m, v[i] );
return m;
}
template<class T>
T sum( const std::vector<T> &v )
{
T m = v[0];
for( size_t i=1; i<v.size(); i++ )
m = m + v[i];
return m;
}
}
#endif // TOOLS_H
|