/usr/include/gnash/GnashAlgorithm.h is in gnash-dev 0.8.11~git20160109-1build1.
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 | // GnashAlgorithm.h: useful templates and functors for generic algorithms
//
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012
// Free Software Foundation, Inc.
//
// This program 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 3 of the License, or
// (at your option) any later version.
//
// This program 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 this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
//
#ifndef GNASH_ALGORITHM_H
#define GNASH_ALGORITHM_H
#include <algorithm>
#include <functional>
namespace gnash {
/// Return a pointer to a type
template<typename T>
struct CreatePointer
{
typedef T* result_type;
result_type operator()(T& t) {
return &t;
}
};
/// Erase elements from an associative container based on a predicate
//
/// This removes elements from a container such as a map if they fulfil a
/// particular condition. Because keys of associative container are const,
/// we can't do this using iterators, because we can't write to them.
template<typename Container, typename Predicate>
void EraseIf(Container& c, Predicate p)
{
typedef typename Container::iterator iterator;
for (iterator i = c.begin(), e = c.end(); i != e; ) {
iterator stored = i++;
if (p(*stored)) c.erase(stored);
}
}
/// Get the size of an array without passing a pointer by mistake
template<typename T, size_t N>
size_t
arraySize(T(&)[N])
{
return N;
}
/// Call a functor on the second element of each element in a range.
//
/// @tparam T An iterator type satisfying the requirements of a
/// forward iterator
/// @tparam U The type of the functor op.
/// @param begin The start of the range to call op on.
/// @param end The end of the range to call op on.
/// @param op The function to call on each second element.
template<typename T, typename U>
void
foreachSecond(T begin, T end, U op)
{
typedef typename std::iterator_traits<T>::value_type value_type;
std::for_each(begin, end, std::bind(op,
std::bind(&value_type::second, std::placeholders::_1)));
}
} // namespace gnash
#endif
|