Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members  

algo.h

Go to the documentation of this file.
00001 /*
00002  *
00003  * Copyright (c) 1994
00004  * Hewlett-Packard Company
00005  *
00006  * Permission to use, copy, modify, distribute and sell this software
00007  * and its documentation for any purpose is hereby granted without fee,
00008  * provided that the above copyright notice appear in all copies and
00009  * that both that copyright notice and this permission notice appear
00010  * in supporting documentation.  Hewlett-Packard Company makes no
00011  * representations about the suitability of this software for any
00012  * purpose.  It is provided "as is" without express or implied warranty.
00013  *
00014  *
00015  * Copyright (c) 1996,1997
00016  * Silicon Graphics Computer Systems, Inc.
00017  *
00018  * Permission to use, copy, modify, distribute and sell this software
00019  * and its documentation for any purpose is hereby granted without fee,
00020  * provided that the above copyright notice appear in all copies and
00021  * that both that copyright notice and this permission notice appear
00022  * in supporting documentation.  Silicon Graphics makes no
00023  * representations about the suitability of this software for any
00024  * purpose.  It is provided "as is" without express or implied warranty.
00025  */
00026 
00027 #ifndef _CPP_BACKWARD_ALGO_H
00028 #define _CPP_BACKWARD_ALGO_H 1
00029 
00030 #include "backward_warning.h"
00031 #include "algobase.h"
00032 #include "tempbuf.h"
00033 #include "iterator.h"
00034 #include <bits/stl_algo.h>
00035 #include <bits/stl_numeric.h>
00036 
00037 // Names from <stl_algo.h>
00038 using std::for_each; 
00039 using std::find; 
00040 using std::find_if; 
00041 using std::adjacent_find; 
00042 using std::count; 
00043 using std::count_if; 
00044 using std::search; 
00045 using std::search_n; 
00046 using std::swap_ranges; 
00047 using std::transform; 
00048 using std::replace; 
00049 using std::replace_if; 
00050 using std::replace_copy; 
00051 using std::replace_copy_if; 
00052 using std::generate; 
00053 using std::generate_n; 
00054 using std::remove; 
00055 using std::remove_if; 
00056 using std::remove_copy; 
00057 using std::remove_copy_if; 
00058 using std::unique; 
00059 using std::unique_copy; 
00060 using std::reverse; 
00061 using std::reverse_copy; 
00062 using std::rotate; 
00063 using std::rotate_copy; 
00064 using std::random_shuffle; 
00065 using std::random_sample; 
00066 using std::random_sample_n; 
00067 using std::partition; 
00068 using std::stable_partition; 
00069 using std::sort; 
00070 using std::stable_sort; 
00071 using std::partial_sort; 
00072 using std::partial_sort_copy; 
00073 using std::nth_element; 
00074 using std::lower_bound; 
00075 using std::upper_bound; 
00076 using std::equal_range; 
00077 using std::binary_search; 
00078 using std::merge; 
00079 using std::inplace_merge; 
00080 using std::includes; 
00081 using std::set_union; 
00082 using std::set_intersection; 
00083 using std::set_difference; 
00084 using std::set_symmetric_difference; 
00085 using std::min_element; 
00086 using std::max_element; 
00087 using std::next_permutation; 
00088 using std::prev_permutation; 
00089 using std::find_first_of; 
00090 using std::find_end; 
00091 using std::is_sorted; 
00092 using std::is_heap; 
00093 
00094 // Names from stl_heap.h
00095 using std::push_heap;
00096 using std::pop_heap;
00097 using std::make_heap;
00098 using std::sort_heap;
00099 
00100 // Names from stl_numeric.h
00101 using std::accumulate; 
00102 using std::inner_product; 
00103 using std::partial_sum; 
00104 using std::adjacent_difference; 
00105 using std::power; 
00106 using std::iota; 
00107 
00108 #endif /* _CPP_BACKWARD_ALGO_H */
00109 
00110 // Local Variables:
00111 // mode:C++
00112 // End:

Generated at Tue May 1 16:28:37 2001 for libstdc++-v3 by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001