From 119dbb1fceae4b4233d7a5fe1c38afc748c7af94 Mon Sep 17 00:00:00 2001 From: Jerry Quinn Date: Tue, 15 Jul 2003 07:30:29 +0000 Subject: stl_algo.h (includes, [...]): Document. 2003-07-15 Jerry Quinn * include/bits/stl_algo.h (includes, set_union, set_intersection, set_difference, set_symmetric_difference, max_element, min_element, next_permutation, prev_permutation, find_first_of, find_end): Document. * include/bits/stl_algobase.h (copy,copy_backward): Clarify overlap restrictions in docs. * include/bits/stl_heap.h (push_heap, pop_heap, make_heap, sort_heap): Document. * docs/doxygen/doxygroups.cc (setoperations): New group. From-SVN: r69387 --- libstdc++-v3/docs/doxygen/doxygroups.cc | 8 ++++++++ 1 file changed, 8 insertions(+) (limited to 'libstdc++-v3/docs/doxygen') diff --git a/libstdc++-v3/docs/doxygen/doxygroups.cc b/libstdc++-v3/docs/doxygen/doxygroups.cc index ccf7204..a1f3b28 100644 --- a/libstdc++-v3/docs/doxygen/doxygroups.cc +++ b/libstdc++-v3/docs/doxygen/doxygroups.cc @@ -202,6 +202,14 @@ relation. Rather, it partitions the range. */ // // // // // // // // // // // // // // // // // // // // // // // // +/** @addtogroup setoperations Set operation algorithms +These algorithms are common set operations performed on sequences that are +already sorted. + +The number of comparisons will be linear. +*/ + +// // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // // /* * @addtogroup groupname description of group -- cgit v1.1