FM / detail

/usr/include/boost/detail

Name	Size	Mode	Actions
winapi/	-	0755	rm
algorithm.hpp	2898	0644	edit dl rm
allocator_utilities.hpp	4790	0644	edit dl rm
atomic_count.hpp	618	0644	edit dl rm
basic_pointerbuf.hpp	4469	0644	edit dl rm
binary_search.hpp	6239	0644	edit dl rm
bitmask.hpp	3033	0644	edit dl rm
call_traits.hpp	4324	0644	edit dl rm
catch_exceptions.hpp	5677	0644	edit dl rm
compressed_pair.hpp	17002	0644	edit dl rm
container_fwd.hpp	5160	0644	edit dl rm
fenv.hpp	3206	0644	edit dl rm
has_default_constructor.hpp	935	0644	edit dl rm
identifier.hpp	3178	0644	edit dl rm
indirect_traits.hpp	4423	0644	edit dl rm
interlocked.hpp	14258	0644	edit dl rm
is_incrementable.hpp	3071	0644	edit dl rm
is_sorted.hpp	1432	0644	edit dl rm
is_xxx.hpp	1250	0644	edit dl rm
iterator.hpp	1146	0644	edit dl rm
lcast_precision.hpp	6089	0644	edit dl rm
lightweight_main.hpp	1226	0644	edit dl rm
lightweight_mutex.hpp	630	0644	edit dl rm
lightweight_test.hpp	436	0644	edit dl rm
lightweight_test_report.hpp	2223	0644	edit dl rm
lightweight_thread.hpp	811	0644	edit dl rm
named_template_params.hpp	6124	0644	edit dl rm
no_exceptions_support.hpp	570	0644	edit dl rm
numeric_traits.hpp	5490	0644	edit dl rm
ob_compressed_pair.hpp	16399	0644	edit dl rm
quick_allocator.hpp	606	0644	edit dl rm
reference_content.hpp	2443	0644	edit dl rm
scoped_enum_emulation.hpp	541	0644	edit dl rm
select_type.hpp	1130	0644	edit dl rm
sp_typeinfo.hpp	857	0644	edit dl rm
templated_streams.hpp	2242	0644	edit dl rm
utf8_codecvt_facet.hpp	7745	0644	edit dl rm
utf8_codecvt_facet.ipp	9578	0644	edit dl rm
workaround.hpp	335	0644	edit dl rm

Edit: /usr/include/boost/detail/algorithm.hpp (2898B)

// (C) Copyright Jeremy Siek 2001.
// Distributed under the Boost Software License, Version 1.0. (See accompany-
// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 */

#ifndef BOOST_ALGORITHM_HPP
#define BOOST_ALGORITHM_HPP

// Algorithms on sequences
//
// The functions in this file have not yet gone through formal
// review, and are subject to change. This is a work in progress.
// They have been checked into the detail directory because
// there are some graph algorithms that use these functions.

#include <algorithm>
#include <vector>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/range/algorithm/equal.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <boost/range/algorithm/stable_sort.hpp>
#include <boost/range/algorithm/find_if.hpp>
#include <boost/range/algorithm/count.hpp>
#include <boost/range/algorithm/count_if.hpp>
#include <boost/range/algorithm_ext/is_sorted.hpp>
#include <boost/range/algorithm_ext/iota.hpp>

namespace boost
{

template < typename InputIterator, typename Predicate >
bool any_if(InputIterator first, InputIterator last, Predicate p)
{
    return std::find_if(first, last, p) != last;
}

template < typename Container, typename Predicate >
bool any_if(const Container& c, Predicate p)
{
    return any_if(boost::begin(c), boost::end(c), p);
}

template < typename InputIterator, typename T >
bool container_contains(InputIterator first, InputIterator last, T value)
{
    return std::find(first, last, value) != last;
}
template < typename Container, typename T >
bool container_contains(const Container& c, const T& value)
{
    return container_contains(boost::begin(c), boost::end(c), value);
}

} // namespace boost

#endif // BOOST_ALGORITHM_HPP

// (C) Copyright Jeremy Siek 2001. // Distributed under the Boost Software License, Version 1.0. (See accompany- // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) /* * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1996 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. */ #ifndef BOOST_ALGORITHM_HPP #define BOOST_ALGORITHM_HPP // Algorithms on sequences // // The functions in this file have not yet gone through formal // review, and are subject to change. This is a work in progress. // They have been checked into the detail directory because // there are some graph algorithms that use these functions. #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { template < typename InputIterator, typename Predicate > bool any_if(InputIterator first, InputIterator last, Predicate p) { return std::find_if(first, last, p) != last; } template < typename Container, typename Predicate > bool any_if(const Container& c, Predicate p) { return any_if(boost::begin(c), boost::end(c), p); } template < typename InputIterator, typename T > bool container_contains(InputIterator first, InputIterator last, T value) { return std::find(first, last, value) != last; } template < typename Container, typename T > bool container_contains(const Container& c, const T& value) { return container_contains(boost::begin(c), boost::end(c), value); } } // namespace boost #endif // BOOST_ALGORITHM_HPP