Gecko [ nbspublicschool.com ]

Name	Size	Permission
algorithmfwd.h	20.66 KB	-rw-r--r--
alloc_traits.h	17.66 KB	-rw-r--r--
allocator.h	6.1 KB	-rw-r--r--
atomic_base.h	24.99 KB	-rw-r--r--
atomic_lockfree_defines.h	2.2 KB	-rw-r--r--
basic_ios.h	14.76 KB	-rw-r--r--
basic_ios.tcc	5.89 KB	-rw-r--r--
basic_string.h	109.49 KB	-rw-r--r--
basic_string.tcc	38.43 KB	-rw-r--r--
boost_concept_check.h	26.41 KB	-rw-r--r--
c++0x_warning.h	1.47 KB	-rw-r--r--
char_traits.h	16.95 KB	-rw-r--r--
codecvt.h	16.23 KB	-rw-r--r--
concept_check.h	3.26 KB	-rw-r--r--
cpp_type_traits.h	9.56 KB	-rw-r--r--
cxxabi_forced.h	1.77 KB	-rw-r--r--
deque.tcc	31.91 KB	-rw-r--r--
exception_defines.h	1.6 KB	-rw-r--r--
exception_ptr.h	5.29 KB	-rw-r--r--
forward_list.h	46.72 KB	-rw-r--r--
forward_list.tcc	15.17 KB	-rw-r--r--
fstream.tcc	28.3 KB	-rw-r--r--
functexcept.h	3.04 KB	-rw-r--r--
functional_hash.h	6.05 KB	-rw-r--r--
gslice.h	5.39 KB	-rw-r--r--
gslice_array.h	7.59 KB	-rw-r--r--
hash_bytes.h	2.1 KB	-rw-r--r--
hashtable.h	61.05 KB	-rw-r--r--
hashtable_policy.h	52.72 KB	-rw-r--r--
indirect_array.h	7.68 KB	-rw-r--r--
ios_base.h	27.85 KB	-rw-r--r--
istream.tcc	30.36 KB	-rw-r--r--
list.tcc	12.2 KB	-rw-r--r--
locale_classes.h	22.45 KB	-rw-r--r--
locale_classes.tcc	8.18 KB	-rw-r--r--
locale_facets.h	88.84 KB	-rw-r--r--
locale_facets.tcc	38.02 KB	-rw-r--r--
locale_facets_nonio.h	63.51 KB	-rw-r--r--
locale_facets_nonio.tcc	40.85 KB	-rw-r--r--
localefwd.h	5.1 KB	-rw-r--r--
mask_array.h	7.41 KB	-rw-r--r--
memoryfwd.h	2.36 KB	-rw-r--r--
move.h	5.67 KB	-rw-r--r--
nested_exception.h	4.58 KB	-rw-r--r--
ostream.tcc	12.03 KB	-rw-r--r--
ostream_insert.h	3.91 KB	-rw-r--r--
postypes.h	8.02 KB	-rw-r--r--
ptr_traits.h	5.17 KB	-rw-r--r--
random.h	173.19 KB	-rw-r--r--
random.tcc	106.59 KB	-rw-r--r--
range_access.h	3.06 KB	-rw-r--r--
regex.h	83.49 KB	-rw-r--r--
regex_compiler.h	27.68 KB	-rw-r--r--
regex_constants.h	10.81 KB	-rw-r--r--
regex_cursor.h	2.7 KB	-rw-r--r--
regex_error.h	4.5 KB	-rw-r--r--
regex_grep_matcher.h	4.23 KB	-rw-r--r--
regex_grep_matcher.tcc	5.41 KB	-rw-r--r--
regex_nfa.h	10.65 KB	-rw-r--r--
regex_nfa.tcc	4.85 KB	-rw-r--r--
shared_ptr.h	18.97 KB	-rw-r--r--
shared_ptr_base.h	40.65 KB	-rw-r--r--
slice_array.h	9.12 KB	-rw-r--r--
sstream.tcc	9.27 KB	-rw-r--r--
stl_algo.h	212.55 KB	-rw-r--r--
stl_algobase.h	41.41 KB	-rw-r--r--
stl_bvector.h	28.98 KB	-rw-r--r--
stl_construct.h	5.05 KB	-rw-r--r--
stl_deque.h	66.41 KB	-rw-r--r--
stl_function.h	22.06 KB	-rw-r--r--
stl_heap.h	19.99 KB	-rw-r--r--
stl_iterator.h	35.77 KB	-rw-r--r--
stl_iterator_base_funcs.h	6.8 KB	-rw-r--r--
stl_iterator_base_types.h	8.19 KB	-rw-r--r--
stl_list.h	52.83 KB	-rw-r--r--
stl_map.h	36.78 KB	-rw-r--r--
stl_multimap.h	33.94 KB	-rw-r--r--
stl_multiset.h	28.37 KB	-rw-r--r--
stl_numeric.h	13.5 KB	-rw-r--r--
stl_pair.h	9.63 KB	-rw-r--r--
stl_queue.h	18.21 KB	-rw-r--r--
stl_raw_storage_iter.h	3.37 KB	-rw-r--r--
stl_relops.h	4.49 KB	-rw-r--r--
stl_set.h	28.61 KB	-rw-r--r--
stl_stack.h	9.65 KB	-rw-r--r--
stl_tempbuf.h	8.15 KB	-rw-r--r--
stl_tree.h	53.56 KB	-rw-r--r--
stl_uninitialized.h	19.95 KB	-rw-r--r--
stl_vector.h	48.64 KB	-rw-r--r--
stream_iterator.h	6.44 KB	-rw-r--r--
streambuf.tcc	4.81 KB	-rw-r--r--
streambuf_iterator.h	12.33 KB	-rw-r--r--
stringfwd.h	2.37 KB	-rw-r--r--
unique_ptr.h	17.19 KB	-rw-r--r--
unordered_map.h	47.76 KB	-rw-r--r--
unordered_set.h	43.25 KB	-rw-r--r--
uses_allocator.h	3.49 KB	-rw-r--r--
valarray_after.h	22.12 KB	-rw-r--r--
valarray_array.h	21.23 KB	-rw-r--r--
valarray_array.tcc	7.08 KB	-rw-r--r--
valarray_before.h	18.08 KB	-rw-r--r--
vector.tcc	25.55 KB	-rw-r--r--

Code Editor : algorithmfwd.h

// <algorithm> Forward declarations  -*- C++ -*-

// Copyright (C) 2007-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library 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, 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 General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file bits/algorithmfwd.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{algorithm}
 */

#ifndef _GLIBCXX_ALGORITHMFWD_H
#define _GLIBCXX_ALGORITHMFWD_H 1

#pragma GCC system_header

#include <bits/c++config.h>
#include <bits/stl_pair.h>
#include <bits/stl_iterator_base_types.h>
#if __cplusplus >= 201103L
#include <initializer_list>
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/*
    adjacent_find
    all_of (C++0x)
    any_of (C++0x)
    binary_search
    copy
    copy_backward
    copy_if (C++0x)
    copy_n (C++0x)
    count
    count_if
    equal
    equal_range
    fill
    fill_n
    find
    find_end
    find_first_of
    find_if
    find_if_not (C++0x)
    for_each
    generate
    generate_n
    includes
    inplace_merge
    is_heap (C++0x)
    is_heap_until (C++0x)
    is_partitioned (C++0x)
    is_sorted (C++0x)
    is_sorted_until (C++0x)
    iter_swap
    lexicographical_compare
    lower_bound
    make_heap
    max
    max_element
    merge
    min
    min_element
    minmax (C++0x)
    minmax_element (C++0x)
    mismatch
    next_permutation
    none_of (C++0x)
    nth_element
    partial_sort
    partial_sort_copy
    partition
    partition_copy (C++0x)
    partition_point (C++0x)
    pop_heap
    prev_permutation
    push_heap
    random_shuffle
    remove
    remove_copy
    remove_copy_if
    remove_if
    replace
    replace_copy
    replace_copy_if
    replace_if
    reverse
    reverse_copy
    rotate
    rotate_copy
    search
    search_n
    set_difference
    set_intersection
    set_symmetric_difference
    set_union
    shuffle (C++0x)
    sort
    sort_heap
    stable_partition
    stable_sort
    swap
    swap_ranges
    transform
    unique
    unique_copy
    upper_bound
  */

/**
   * @defgroup algorithms Algorithms
   *
   * Components for performing algorithmic operations. Includes
   * non-modifying sequence, modifying (mutating) sequence, sorting,
   * searching, merge, partition, heap, set, minima, maxima, and
   * permutation operations.
   */

/**
   * @defgroup mutating_algorithms Mutating
   * @ingroup algorithms
   */

/**
   * @defgroup non_mutating_algorithms Non-Mutating
   * @ingroup algorithms
   */

/**
   * @defgroup sorting_algorithms Sorting
   * @ingroup algorithms
   */

/**
   * @defgroup set_algorithms Set Operation
   * @ingroup sorting_algorithms
   *
   * These algorithms are common set operations performed on sequences
   * that are already sorted. The number of comparisons will be
   * linear.
   */

/**
   * @defgroup binary_search_algorithms Binary Search
   * @ingroup sorting_algorithms
   *
   * These algorithms are variations of a classic binary search, and
   * all assume that the sequence being searched is already sorted.
   * 
   * The number of comparisons will be logarithmic (and as few as
   * possible).  The number of steps through the sequence will be
   * logarithmic for random-access iterators (e.g., pointers), and
   * linear otherwise.
   * 
   * The LWG has passed Defect Report 270, which notes: <em>The
   * proposed resolution reinterprets binary search. Instead of
   * thinking about searching for a value in a sorted range, we view
   * that as an important special case of a more general algorithm:
   * searching for the partition point in a partitioned range.  We
   * also add a guarantee that the old wording did not: we ensure that
   * the upper bound is no earlier than the lower bound, that the pair
   * returned by equal_range is a valid range, and that the first part
   * of that pair is the lower bound.</em>
   *
   * The actual effect of the first sentence is that a comparison
   * functor passed by the user doesn't necessarily need to induce a
   * strict weak ordering relation.  Rather, it partitions the range.
   */

// adjacent_find

#if __cplusplus >= 201103L
  template<typename _IIter, typename _Predicate>
    bool
    all_of(_IIter, _IIter, _Predicate);

template<typename _IIter, typename _Predicate>
    bool
    any_of(_IIter, _IIter, _Predicate);
#endif

template<typename _FIter, typename _Tp>
    bool 
    binary_search(_FIter, _FIter, const _Tp&);

template<typename _FIter, typename _Tp, typename _Compare>
    bool 
    binary_search(_FIter, _FIter, const _Tp&, _Compare);

template<typename _IIter, typename _OIter>
    _OIter 
    copy(_IIter, _IIter, _OIter);

template<typename _BIter1, typename _BIter2>
    _BIter2
    copy_backward(_BIter1, _BIter1, _BIter2);

#if __cplusplus >= 201103L
  template<typename _IIter, typename _OIter, typename _Predicate>
    _OIter
    copy_if(_IIter, _IIter, _OIter, _Predicate);

template<typename _IIter, typename _Size, typename _OIter>
    _OIter
    copy_n(_IIter, _Size, _OIter);
#endif

// count
  // count_if

template<typename _FIter, typename _Tp>
    pair<_FIter, _FIter>
    equal_range(_FIter, _FIter, const _Tp&);

template<typename _FIter, typename _Tp, typename _Compare>
    pair<_FIter, _FIter>
    equal_range(_FIter, _FIter, const _Tp&, _Compare);

template<typename _FIter, typename _Tp>
    void 
    fill(_FIter, _FIter, const _Tp&);

template<typename _OIter, typename _Size, typename _Tp>
    _OIter
    fill_n(_OIter, _Size, const _Tp&);

// find

template<typename _FIter1, typename _FIter2>
    _FIter1
    find_end(_FIter1, _FIter1, _FIter2, _FIter2);

template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
    _FIter1
    find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);

// find_first_of
  // find_if

#if __cplusplus >= 201103L
  template<typename _IIter, typename _Predicate>
    _IIter
    find_if_not(_IIter, _IIter, _Predicate);
#endif

// for_each
  // generate
  // generate_n

template<typename _IIter1, typename _IIter2>
    bool 
    includes(_IIter1, _IIter1, _IIter2, _IIter2);

template<typename _IIter1, typename _IIter2, typename _Compare>
    bool 
    includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);

template<typename _BIter>
    void 
    inplace_merge(_BIter, _BIter, _BIter);

template<typename _BIter, typename _Compare>
    void 
    inplace_merge(_BIter, _BIter, _BIter, _Compare);

#if __cplusplus >= 201103L
  template<typename _RAIter>
    bool 
    is_heap(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    bool 
    is_heap(_RAIter, _RAIter, _Compare);

template<typename _RAIter>
    _RAIter 
    is_heap_until(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    _RAIter 
    is_heap_until(_RAIter, _RAIter, _Compare);

template<typename _IIter, typename _Predicate>
    bool
    is_partitioned(_IIter, _IIter, _Predicate);

template<typename _FIter1, typename _FIter2>
    bool
    is_permutation(_FIter1, _FIter1, _FIter2);

template<typename _FIter1, typename _FIter2,
	   typename _BinaryPredicate>
    bool
    is_permutation(_FIter1, _FIter1, _FIter2, _BinaryPredicate);

template<typename _FIter>
    bool 
    is_sorted(_FIter, _FIter);

template<typename _FIter, typename _Compare>
    bool 
    is_sorted(_FIter, _FIter, _Compare);

template<typename _FIter>
    _FIter 
    is_sorted_until(_FIter, _FIter);

template<typename _FIter, typename _Compare>
    _FIter 
    is_sorted_until(_FIter, _FIter, _Compare);
#endif

template<typename _FIter1, typename _FIter2>
    void 
    iter_swap(_FIter1, _FIter2);

template<typename _FIter, typename _Tp>
    _FIter 
    lower_bound(_FIter, _FIter, const _Tp&);

template<typename _FIter, typename _Tp, typename _Compare>
    _FIter 
    lower_bound(_FIter, _FIter, const _Tp&, _Compare);

template<typename _RAIter>
    void 
    make_heap(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    make_heap(_RAIter, _RAIter, _Compare);

template<typename _Tp> 
    const _Tp& 
    max(const _Tp&, const _Tp&);

template<typename _Tp, typename _Compare>
    const _Tp& 
    max(const _Tp&, const _Tp&, _Compare);

// max_element
  // merge

template<typename _Tp> 
    const _Tp& 
    min(const _Tp&, const _Tp&);

template<typename _Tp, typename _Compare>
    const _Tp& 
    min(const _Tp&, const _Tp&, _Compare);

// min_element

#if __cplusplus >= 201103L
  template<typename _Tp>
    pair<const _Tp&, const _Tp&> 
    minmax(const _Tp&, const _Tp&);

template<typename _Tp, typename _Compare>
    pair<const _Tp&, const _Tp&>
    minmax(const _Tp&, const _Tp&, _Compare);

template<typename _FIter>
    pair<_FIter, _FIter>
    minmax_element(_FIter, _FIter);

template<typename _FIter, typename _Compare>
    pair<_FIter, _FIter>
    minmax_element(_FIter, _FIter, _Compare);

template<typename _Tp>
    _Tp
    min(initializer_list<_Tp>);

template<typename _Tp, typename _Compare>
    _Tp
    min(initializer_list<_Tp>, _Compare);

template<typename _Tp>
    _Tp
    max(initializer_list<_Tp>);

template<typename _Tp, typename _Compare>
    _Tp
    max(initializer_list<_Tp>, _Compare);

template<typename _Tp>
    pair<_Tp, _Tp>
    minmax(initializer_list<_Tp>);

template<typename _Tp, typename _Compare>
    pair<_Tp, _Tp>
    minmax(initializer_list<_Tp>, _Compare);
#endif

// mismatch

template<typename _BIter>
    bool 
    next_permutation(_BIter, _BIter);

template<typename _BIter, typename _Compare>
    bool 
    next_permutation(_BIter, _BIter, _Compare);

#if __cplusplus >= 201103L
  template<typename _IIter, typename _Predicate>
    bool
    none_of(_IIter, _IIter, _Predicate);
#endif

// nth_element
  // partial_sort

template<typename _IIter, typename _RAIter>
    _RAIter
    partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter);

template<typename _IIter, typename _RAIter, typename _Compare>
    _RAIter
    partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare);

// partition

#if __cplusplus >= 201103L
  template<typename _IIter, typename _OIter1,
	   typename _OIter2, typename _Predicate>
    pair<_OIter1, _OIter2>
    partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate);

template<typename _FIter, typename _Predicate>
    _FIter
    partition_point(_FIter, _FIter, _Predicate);
#endif

template<typename _RAIter>
    void 
    pop_heap(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    pop_heap(_RAIter, _RAIter, _Compare);

template<typename _BIter>
    bool 
    prev_permutation(_BIter, _BIter);

template<typename _BIter, typename _Compare>
    bool 
    prev_permutation(_BIter, _BIter, _Compare);

template<typename _RAIter>
    void 
    push_heap(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    push_heap(_RAIter, _RAIter, _Compare);

// random_shuffle

template<typename _FIter, typename _Tp>
    _FIter 
    remove(_FIter, _FIter, const _Tp&);

template<typename _FIter, typename _Predicate>
    _FIter 
    remove_if(_FIter, _FIter, _Predicate);

template<typename _IIter, typename _OIter, typename _Tp>
    _OIter 
    remove_copy(_IIter, _IIter, _OIter, const _Tp&);

template<typename _IIter, typename _OIter, typename _Predicate>
    _OIter 
    remove_copy_if(_IIter, _IIter, _OIter, _Predicate);

// replace

template<typename _IIter, typename _OIter, typename _Tp>
    _OIter 
    replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&);

template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp>
    _OIter 
    replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&);

// replace_if

template<typename _BIter>
    void 
    reverse(_BIter, _BIter);

template<typename _BIter, typename _OIter>
    _OIter 
    reverse_copy(_BIter, _BIter, _OIter);

template<typename _FIter>
    void 
    rotate(_FIter, _FIter, _FIter);

template<typename _FIter, typename _OIter>
    _OIter 
    rotate_copy(_FIter, _FIter, _FIter, _OIter);

// search
  // search_n
  // set_difference
  // set_intersection
  // set_symmetric_difference
  // set_union

#if (__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99_STDINT_TR1)
  template<typename _RAIter, typename _UGenerator>
    void
    shuffle(_RAIter, _RAIter, _UGenerator&&);
#endif

template<typename _RAIter>
    void 
    sort_heap(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    sort_heap(_RAIter, _RAIter, _Compare);

template<typename _BIter, typename _Predicate>
    _BIter 
    stable_partition(_BIter, _BIter, _Predicate);

template<typename _Tp> 
    void 
    swap(_Tp&, _Tp&)
#if __cplusplus >= 201103L
    noexcept(__and_<is_nothrow_move_constructible<_Tp>,
	            is_nothrow_move_assignable<_Tp>>::value)
#endif
    ;

template<typename _Tp, size_t _Nm>
    void
    swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm])
#if __cplusplus >= 201103L
    noexcept(noexcept(swap(*__a, *__b)))
#endif
    ;

template<typename _FIter1, typename _FIter2>
    _FIter2 
    swap_ranges(_FIter1, _FIter1, _FIter2);

// transform

template<typename _FIter>
    _FIter 
    unique(_FIter, _FIter);

template<typename _FIter, typename _BinaryPredicate>
    _FIter 
    unique(_FIter, _FIter, _BinaryPredicate);

// unique_copy

template<typename _FIter, typename _Tp>
    _FIter 
    upper_bound(_FIter, _FIter, const _Tp&);

template<typename _FIter, typename _Tp, typename _Compare>
    _FIter 
    upper_bound(_FIter, _FIter, const _Tp&, _Compare);

_GLIBCXX_END_NAMESPACE_VERSION

_GLIBCXX_BEGIN_NAMESPACE_ALGO

template<typename _FIter>
    _FIter 
    adjacent_find(_FIter, _FIter);

template<typename _FIter, typename _BinaryPredicate>
    _FIter 
    adjacent_find(_FIter, _FIter, _BinaryPredicate);

template<typename _IIter, typename _Tp>
    typename iterator_traits<_IIter>::difference_type
    count(_IIter, _IIter, const _Tp&);

template<typename _IIter, typename _Predicate>
    typename iterator_traits<_IIter>::difference_type
    count_if(_IIter, _IIter, _Predicate);

template<typename _IIter1, typename _IIter2>
    bool 
    equal(_IIter1, _IIter1, _IIter2);

template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
    bool 
    equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate);

template<typename _IIter, typename _Tp>
    _IIter 
    find(_IIter, _IIter, const _Tp&);

template<typename _FIter1, typename _FIter2>
    _FIter1
    find_first_of(_FIter1, _FIter1, _FIter2, _FIter2);

template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
    _FIter1
    find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);

template<typename _IIter, typename _Predicate>
    _IIter
    find_if(_IIter, _IIter, _Predicate);

template<typename _IIter, typename _Funct>
    _Funct 
    for_each(_IIter, _IIter, _Funct);

template<typename _FIter, typename _Generator>
    void 
    generate(_FIter, _FIter, _Generator);

template<typename _OIter, typename _Size, typename _Generator>
    _OIter
    generate_n(_OIter, _Size, _Generator);

template<typename _IIter1, typename _IIter2>
    bool 
    lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2);

template<typename _IIter1, typename _IIter2, typename _Compare>
    bool 
    lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);

template<typename _FIter>
    _FIter 
    max_element(_FIter, _FIter);

template<typename _FIter, typename _Compare>
    _FIter 
    max_element(_FIter, _FIter, _Compare);

template<typename _IIter1, typename _IIter2, typename _OIter>
    _OIter 
    merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);

template<typename _IIter1, typename _IIter2, typename _OIter, 
	   typename _Compare>
    _OIter 
    merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);

template<typename _FIter>
    _FIter 
    min_element(_FIter, _FIter);

template<typename _FIter, typename _Compare>
    _FIter 
    min_element(_FIter, _FIter, _Compare);

template<typename _IIter1, typename _IIter2>
    pair<_IIter1, _IIter2>
    mismatch(_IIter1, _IIter1, _IIter2);

template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
    pair<_IIter1, _IIter2>
    mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate);

template<typename _RAIter>
    void 
    nth_element(_RAIter, _RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    nth_element(_RAIter, _RAIter, _RAIter, _Compare);

template<typename _RAIter>
    void 
    partial_sort(_RAIter, _RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    partial_sort(_RAIter, _RAIter, _RAIter, _Compare);

template<typename _BIter, typename _Predicate>
    _BIter 
    partition(_BIter, _BIter, _Predicate);

template<typename _RAIter>
    void 
    random_shuffle(_RAIter, _RAIter);

template<typename _RAIter, typename _Generator>
    void 
    random_shuffle(_RAIter, _RAIter,
#if __cplusplus >= 201103L
		   _Generator&&);
#else
		   _Generator&);
#endif

template<typename _FIter, typename _Tp>
    void 
    replace(_FIter, _FIter, const _Tp&, const _Tp&);

template<typename _FIter, typename _Predicate, typename _Tp>
    void 
    replace_if(_FIter, _FIter, _Predicate, const _Tp&);

template<typename _FIter1, typename _FIter2>
    _FIter1 
    search(_FIter1, _FIter1, _FIter2, _FIter2);

template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
    _FIter1 
    search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);

template<typename _FIter, typename _Size, typename _Tp>
    _FIter 
    search_n(_FIter, _FIter, _Size, const _Tp&);

template<typename _FIter, typename _Size, typename _Tp, 
	   typename _BinaryPredicate>
    _FIter 
    search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);

template<typename _IIter1, typename _IIter2, typename _OIter>
    _OIter 
    set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);

template<typename _IIter1, typename _IIter2, typename _OIter, 
	   typename _Compare>
    _OIter 
    set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);

template<typename _IIter1, typename _IIter2, typename _OIter>
    _OIter 
    set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);

template<typename _IIter1, typename _IIter2, typename _OIter,
	   typename _Compare>
    _OIter 
    set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);

template<typename _IIter1, typename _IIter2, typename _OIter>
    _OIter
    set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);

template<typename _IIter1, typename _IIter2, typename _OIter, 
	   typename _Compare>
    _OIter
    set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, 
			     _OIter, _Compare);

template<typename _IIter1, typename _IIter2, typename _OIter>
    _OIter 
    set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);

template<typename _IIter1, typename _IIter2, typename _OIter,
	   typename _Compare>
    _OIter 
    set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);

template<typename _RAIter>
    void 
    sort(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    sort(_RAIter, _RAIter, _Compare);

template<typename _RAIter>
    void 
    stable_sort(_RAIter, _RAIter);

template<typename _RAIter, typename _Compare>
    void 
    stable_sort(_RAIter, _RAIter, _Compare);

template<typename _IIter, typename _OIter, typename _UnaryOperation>
    _OIter 
    transform(_IIter, _IIter, _OIter, _UnaryOperation);

template<typename _IIter1, typename _IIter2, typename _OIter, 
	   typename _BinaryOperation>
    _OIter 
    transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation);

template<typename _IIter, typename _OIter>
    _OIter 
    unique_copy(_IIter, _IIter, _OIter);

template<typename _IIter, typename _OIter, typename _BinaryPredicate>
    _OIter 
    unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate);

_GLIBCXX_END_NAMESPACE_ALGO
} // namespace std

#ifdef _GLIBCXX_PARALLEL
# include <parallel/algorithmfwd.h>
#endif

#endif

${this.title}

Code Editor : algorithmfwd.h