Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.

BUG:215923


git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdevelop@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 487 insertions, 0 deletions

diff --git a/languages/cpp/doc/stl.toc b/languages/cpp/doc/stl.toc
new file mode 100644
index 00000000..d86b82b0
--- /dev/null
+++ b/languages/cpp/doc/stl.toc
@@ -0,0 +1,487 @@
+<!DOCTYPE kdeveloptoc>
+<kdeveloptoc>
+<title>STL (sgi.com)</title>
+<base href="http://www.sgi.com/tech/stl"/>
+<tocsect1 name="Introduction" url="stl_introduction.html"/>
+<tocsect1 name="How to use the documentation" url="doc_introduction.html"/>
+<tocsect1 name="Containers" url="">
+  <tocsect2 name="Container concepts" url="">
+    <tocsect3 name="Container" url="Container.html"/>
+    <tocsect3 name="Forward Container" url="ForwardContainer.html"/>
+    <tocsect3 name="Reversible Container" url="ReversibleContainer.html"/>
+    <tocsect3 name="Random Access Container" url="RandomAccessContainer.html"/>
+  </tocsect2>
+  <tocsect2 name="Sequences concepts" url="">
+    <tocsect3 name="Sequence" url="Sequence.html"/>
+    <tocsect3 name="Front Insertion Sequence" url="FrontInsertionSequence.html"/>
+    <tocsect3 name="Back Insertion Sequence" url="BackInsertionSequence.html"/>
+  </tocsect2>
+  <tocsect2 name="Associative Containers concepts" url="">
+    <tocsect3 name="Associative Container" url="AssociativeContainer.html"/>
+    <tocsect3 name="Simple Associative Container" url="SimpleAssociativeContainer.html"/>
+    <tocsect3 name="Pair Associative Container" url="PairAssociativeContainer.html"/>
+    <tocsect3 name="Sorted Associative Container" url="SortedAssociativeContainer.html"/>
+    <tocsect3 name="Hashed Associative Container" url="HashedAssociativeContainer.html"/>
+    <tocsect3 name="HashFunction" url="HashFunction.html"/>
+    <tocsect3 name="Unique Associative Container" url="UniqueAssociativeContainer.html"/>
+    <tocsect3 name="Multiple Associative Container" url="MultipleAssociativeContainer.html"/>
+    <tocsect3 name="Unique Sorted Associative Container" url="UniqueSortedAssociativeContainer.html"/>
+    <tocsect3 name="Multiple Sorted Associative Container" url="MultipleSortedAssociativeContainer.html"/>
+    <tocsect3 name="Unique Hashed Associative Container" url="UniqueHashedAssociativeContainer.html"/>
+    <tocsect3 name="Multiple Hashed Associative Container" url="MultipleHashedAssociativeContainer.html"/>
+  </tocsect2>
+  <tocsect2 name="Container classes: Sequences" url="">
+    <tocsect3 name="vector" url="Vector.html"/>
+    <tocsect3 name="deque" url="Deque.html"/> 
+    <tocsect3 name="list" url="List.html"/>
+    <tocsect3 name="slist" url="Slist.html"/>
+    <tocsect3 name="bit_vector" url="bit_vector.html"/>
+  </tocsect2>
+  <tocsect2 name="Container classes: Associative Containers" url="">
+    <tocsect3 name="set" url="set.html"/>
+    <tocsect3 name="map" url="Map.html"/>
+    <tocsect3 name="multiset" url="multiset.html"/>
+    <tocsect3 name="multimap" url="Multimap.html"/>
+    <tocsect3 name="hash_set" url="hash_set.html"/>
+    <tocsect3 name="hash_map" url="hash_map.html"/>
+    <tocsect3 name="hash_multiset" url="hash_multiset.html"/>
+    <tocsect3 name="hash_multimap" url="hash_multimap.html"/>
+  </tocsect2>
+  <tocsect2 name="String package" url="">
+    <tocsect3 name="Character traits" url="character_traits.html"/>
+    <tocsect3 name="char_traits" url="char_traits.html"/>
+    <tocsect3 name="basic_string" url="basic_string.html"/>
+    <tocsect3 name="rope" url="Rope.html"/>
+  </tocsect2>
+  <tocsect2 name="Container adaptors" url="">
+    <tocsect3 name="stack" url="stack.html"/>
+    <tocsect3 name="queue" url="queue.html"/>
+    <tocsect3 name="bitset" url="bitset.html"/>
+  </tocsect2>
+</tocsect1>
+<tocsect1 name="Iterators" url="">
+  <tocsect2 name="Introduction" url="Iterators.html"/>
+  <tocsect2 name="Iterator Concepts" url="">
+    <tocsect3 name="Trivial Iterator" url="trivial.html"/>
+    <tocsect3 name="Input Iterator" url="InputIterator.html"/>
+    <tocsect3 name="Output Iterator" url="OutputIterator.html"/>
+    <tocsect3 name="Forward Iterator" url="ForwardIterator.html"/>
+    <tocsect3 name="Bidirectional Iterator" url="BidirectionalIterator.html"/>
+    <tocsect3 name="Random Access Iterator" url="RandomAccessIterator.html"/>
+  </tocsect2>
+  <tocsect2 name="Iterator Tags" url="">
+    <tocsect3 name="Introduction" url="iterator_tags.html"/>
+    <tocsect3 name="iterator_traits" url="iterator_traits.html"/>
+    <tocsect3 name="iterator_category" url="iterator_category.html"/>
+    <tocsect3 name="distance_type" url="distance_type.html"/>
+    <tocsect3 name="value_type" url="value_type.html"/>
+  </tocsect2>
+  <tocsect2 name="Iterator tag classes" url="">
+    <tocsect3 name="input_iterator_tag" url="input_iterator_tag.html"/>
+    <tocsect3 name="output_iterator_tag" url="output_iterator_tag.html"/>
+    <tocsect3 name="forward_iterator_tag" url="forward_iterator_tag.html"/>
+    <tocsect3 name="bidirectional_iterator_tag" url="bidirectional_iterator_tag.html"/>
+    <tocsect3 name="random_access_iterator_tag" url="random_access_iterator_tag.html"/>
+  </tocsect2>
+  <tocsect2 name="Iterator base classes" url="">
+    <tocsect3 name="input_iterator" url="input_iterator.html"/>
+    <tocsect3 name="output_iterator" url="output_iterator.html"/>
+    <tocsect3 name="forward_iterator" url="forward_iterator.html"/>
+    <tocsect3 name="bidirectional_iterator" url="bidirectional_iterator.html"/>
+    <tocsect3 name="random_access_iterator" url="random_access_iterator.html"/>
+  </tocsect2>
+  <tocsect2 name="Iterator functions" url="">
+    <tocsect3 name="distance" url="distance.html"/>
+    <tocsect3 name="advance" url="advance.html"/>
+  </tocsect2>
+  <tocsect2 name="Iterator classes" url="">
+    <tocsect3 name="istream_iterator" url="istream_iterator.html"/>
+    <tocsect3 name="ostream_iterator" url="ostream_iterator.html"/>
+    <tocsect3 name="front_insert_iterator" url="front_insert_iterator.html"/>
+    <tocsect3 name="back_insert_iterator" url="back_insert_iterator.html"/>
+    <tocsect3 name="insert_iterator" url="insert_iterator.html"/>
+    <tocsect3 name="reverse_iterator" url="ReverseIterator.html"/>
+    <tocsect3 name="reverse_bidirectional_iterator" url="ReverseBidirectionalIterator.html"/>
+    <tocsect3 name="raw_storage_iterator" url="raw_storage_iterator.html"/>
+    <tocsect3 name="sequence_buffer" url="sequence_buffer.html"/>
+  </tocsect2>
+</tocsect1>
+<tocsect1 name="Algorithms" url="">
+  <tocsect2 name="Non-mutating algorithms" url="">
+    <tocsect3 name="for_each" url="for_each.html"/>
+    <tocsect3 name="find" url="find.html"/>
+    <tocsect3 name="find_if" url="find_if.html"/>
+    <tocsect3 name="adjacent_find" url="adjacent_find.html"/>
+    <tocsect3 name="find_first_of" url="find_first_of.html"/>
+    <tocsect3 name="count" url="count.html"/>
+    <tocsect3 name="count_if" url="count_if.html"/>
+    <tocsect3 name="mismatch" url="mismatch.html"/>
+    <tocsect3 name="equal" url="equal.html"/>
+    <tocsect3 name="search" url="search.html"/>
+    <tocsect3 name="search_n" url="search_n.html"/>
+    <tocsect3 name="find_end" url="find_end.html"/>
+  </tocsect2>
+  <tocsect2 name="Mutating algorithms" url="">
+    <tocsect3 name="copy" url="copy.html"/>
+    <tocsect3 name="copy_n" url="copy_n.html"/>
+    <tocsect3 name="copy_backward" url="copy_backward.html"/>
+    <tocsect3 name="swap" url="swap.html"/>
+    <tocsect3 name="iter_swap" url="iter_swap.html"/>
+    <tocsect3 name="swap_ranges" url="swap_ranges.html"/>
+    <tocsect3 name="transform" url="transform.html"/>
+    <tocsect3 name="replace" url="replace.html"/>
+    <tocsect3 name="replace_if" url="replace_if.html"/>
+    <tocsect3 name="replace_copy" url="replace_copy.html"/>
+    <tocsect3 name="replace_copy_if" url="replace_copy_if.html"/>
+    <tocsect3 name="fill" url="fill.html"/>
+    <tocsect3 name="fill_n" url="fill_n.html"/>
+    <tocsect3 name="generate" url="generate.html"/>
+    <tocsect3 name="generate_n" url="generate_n.html"/>
+    <tocsect3 name="remove" url="remove.html"/>
+    <tocsect3 name="remove_if" url="remove_if.html"/>
+    <tocsect3 name="remove_copy" url="remove_copy.html"/>
+    <tocsect3 name="remove_copy_if" url="remove_copy_if.html"/>
+    <tocsect3 name="unique" url="unique.html"/>
+    <tocsect3 name="unique_copy" url="unique_copy.html"/>
+    <tocsect3 name="reverse" url="reverse.html"/>
+    <tocsect3 name="reverse_copy" url="reverse_copy.html"/>
+    <tocsect3 name="rotate" url="rotate.html"/>
+    <tocsect3 name="rotate_copy" url="rotate_copy.html"/>
+    <tocsect3 name="random_shuffle" url="random_shuffle.html"/>
+    <tocsect3 name="random_sample" url="random_sample.html"/>
+    <tocsect3 name="random_sample_n" url="random_sample_n.html"/>
+    <tocsect3 name="partition" url="partition.html"/>
+    <tocsect3 name="stable_partition" url="stable_partition.html"/>
+  </tocsect2>
+  <tocsect2 name="Sorting" url="">
+    <tocsect3 name="sort" url="sort.html"/>
+    <tocsect3 name="stable_sort" url="stable_sort.html"/>
+    <tocsect3 name="partial_sort" url="partial_sort.html"/>
+    <tocsect3 name="partial_sort_copy" url="partial_sort_copy.html"/>
+    <tocsect3 name="is_sorted" url="is_sorted.html"/>
+    <tocsect3 name="nth_element" url="nth_element.html"/>
+    <tocsect3 name="lower_bound" url="lower_bound.html"/>
+    <tocsect3 name="upper_bound" url="upper_bound.html"/>
+    <tocsect3 name="equal_range" url="equal_range.html"/>
+    <tocsect3 name="binary_search" url="binary_search.html"/>
+    <tocsect3 name="merge" url="merge.html"/>
+    <tocsect3 name="inplace_merge" url="inplace_merge.html"/>
+    <tocsect3 name="includes" url="includes.html"/>
+    <tocsect3 name="set_union" url="set_union.html"/>
+    <tocsect3 name="set_intersection" url="set_intersection.html"/>
+    <tocsect3 name="set_difference" url="set_difference.html"/>
+    <tocsect3 name="set_symmetric_difference" url="set_symmetric_difference.html"/>
+    <tocsect3 name="push_heap" url="push_heap.html"/>
+    <tocsect3 name="pop_heap" url="pop_heap.html"/>
+    <tocsect3 name="make_heap" url="make_heap.html"/>
+    <tocsect3 name="sort_heap" url="sort_heap.html"/>
+    <tocsect3 name="is_heap" url="is_heap.html"/>
+    <tocsect3 name="min" url="min.html"/>
+    <tocsect3 name="max" url="max.html"/>
+    <tocsect3 name="min_element" url="min_element.html"/>
+    <tocsect3 name="max_element" url="max_element.html"/>
+    <tocsect3 name="lexicographical_compare" url="lexicographical_compare.html"/>
+    <tocsect3 name="lexicographical_compare_3way" url="lexicographical_compare_3way.html"/>
+    <tocsect3 name="next_permutation" url="next_permutation.html"/>
+    <tocsect3 name="prev_permutation" url="prev_permutation.html"/>
+  </tocsect2>
+  <tocsect2 name="Generalized numeric algorithms" url="">
+    <tocsect3 name="iota" url="iota.html"/>
+    <tocsect3 name="accumulate" url="accumulate.html"/>
+    <tocsect3 name="inner_product" url="inner_product.html"/>
+    <tocsect3 name="partial_sum" url="partial_sum.html"/>
+    <tocsect3 name="adjacent_difference" url="adjacent_difference.html"/>
+    <tocsect3 name="power" url="power.html"/>
+  </tocsect2>
+</tocsect1>
+<tocsect1 name="Function Objects" url="">
+  <tocsect2 name="Introduction" url="functors.html"/>
+  <tocsect2 name="Function Object Concepts" url="">
+    <tocsect3 name="Generator" url="Generator.html"/>
+    <tocsect3 name="UnaryFunction" url="Unary Function.html"/>
+    <tocsect3 name="BinaryFunction" url="Binary Function.html"/>
+    <tocsect3 name="AdaptableGenerator" url="Adaptable Generator.html"/>
+    <tocsect3 name="AdaptableUnaryFunction" url="Adaptable Unary Function.html"/>
+    <tocsect3 name="AdaptableBinaryFunction" url="Adaptable Binary Function.html"/>
+    <tocsect3 name="Predicate" url="Predicate.html"/>
+    <tocsect3 name="BinaryPredicate" url="Binary Predicate.html"/>
+    <tocsect3 name="AdaptablePredicate" url="Adaptable Predicate.html"/>
+    <tocsect3 name="AdaptableBinaryPredicate" url="Adaptable Binary Predicate.html"/>
+    <tocsect3 name="StrictWeakOrdering" url="StrictWeakOrdering.html"/>
+    <tocsect3 name="MonoidOperation" url="Monoid Operation.html"/>
+    <tocsect3 name="RandomNumberGenerator" url="Random Number Generator.html"/>
+  </tocsect2>
+  <tocsect2 name="Predefined function objects" url="">
+    <tocsect3 name="plus" url="plus.html"/>
+    <tocsect3 name="minus" url="minus.html"/>
+    <tocsect3 name="times" url="multiplies.html"/> (formerly called "times")
+    <tocsect3 name="divides" url="divides.html"/>
+    <tocsect3 name="modulus" url="modulus.html"/>
+    <tocsect3 name="negate" url="negate.html"/>
+    <tocsect3 name="equal_to" url="equal_to.html"/>
+    <tocsect3 name="not_equal_to" url="not_equal_to.html"/>
+    <tocsect3 name="less" url="less.html"/>
+    <tocsect3 name="greater" url="greater.html"/>
+    <tocsect3 name="less_equal" url="less_equal.html"/>
+    <tocsect3 name="greater_equal" url="greater_equal.html"/>e
+    <tocsect3 name="logical_and" url="logical_and.html"/>
+    <tocsect3 name="logical_or" url="logical_or.html"/>
+    <tocsect3 name="logical_not" url="logical_not.html"/>
+    <tocsect3 name="identity" url="identity.html"/>
+    <tocsect3 name="project1st" url="project1st.html"/>
+    <tocsect3 name="project2nd" url="project2nd.html"/>
+    <tocsect3 name="select1st" url="select1st.html"/>
+    <tocsect3 name="select2nd" url="select2nd.html"/>
+    <tocsect3 name="subtractive_rng" url="subtractive_rng.html"/>
+  </tocsect2>
+  <tocsect2 name="Function object adaptors" url="">
+    <tocsect3 name="binder1st" url="binder1st.html"/>
+    <tocsect3 name="binder2nd" url="binder2nd.html"/>
+    <tocsect3 name="ptr_fun" url="ptr_fun.html"/>
+    <tocsect3 name="pointer_to_unary_function" url="pointer_to_unary_function.html"/>
+    <tocsect3 name="pointer_to_binary_function" url="pointer_to_binary_function.html"/>
+    <tocsect3 name="unary_negate" url="unary_negate.html"/>
+    <tocsect3 name="binary_negate" url="binary_negate.html"/>
+    <tocsect3 name="unary_compose" url="unary_compose.html"/>
+    <tocsect3 name="binary_compose" url="binary_compose.html"/>
+    <tocsect3 name="mem_fun_t" url="mem_fun.html"/>
+    <tocsect3 name="mem_fun_ref_t" url="mem_fun_ref.html"/>
+    <tocsect3 name="mem_fun1_t" url="mem_fun1.html"/>
+    <tocsect3 name="mem_fun1_ref_t" url="mem_fun1_ref.html"/>
+  </tocsect2>
+</tocsect1>
+<tocsect1 name="Utilities" url="">
+  <tocsect2 name="Utilities Concepts" url="">
+    <tocsect3 name="Assignable" url="Assignable.html"/>
+    <tocsect3 name="Default Constructible" url="DefaultConstructible.html"/>
+    <tocsect3 name="Equality Comparable" url="EqualityComparable.html"/>
+    <tocsect3 name="LessThan Comparable" url="LessThanComparable.html"/>
+  </tocsect2>
+  <tocsect2 name="Functions: Relational Operators" url="operators.html"/>
+  <tocsect2 name="Classes: Pair" url="pair.html"/>
+</tocsect1>
+<tocsect1 name="Memory Allocation" url="">
+  <tocsect2 name="Classes" url="">
+    <tocsect3 name="Allocators" url="Allocators.html"/>
+    <tocsect3 name="raw_storage_iterator" url="raw_storage_iterator.html"/>
+  </tocsect2>
+  <tocsect2 name="Functions" url="">
+    <tocsect3 name="construct" url="construct.html"/>
+    <tocsect3 name="destroy" url="destroy.html"/>
+    <tocsect3 name="uninitialized_copy" url="uninitialized_copy"/>
+    <tocsect3 name="uninitialized_copy_n" url="uninitialized_copy_n"/>
+    <tocsect3 name="uninitialized_fill" url="uninitialized_fill"/>
+    <tocsect3 name="uninitialized_fill_n" url="uninitialized_fill_n"/>
+    <tocsect3 name="temporary_buffer" url="temporary_buffer.html"/>
+    <tocsect3 name="get_temporary_buffer" url="get_temporary_buffer.html"/>
+    <tocsect3 name="return_temporary_buffer" url="return_temporary_buffer.html"/>
+  </tocsect2>
+</tocsect1>
+<tocsect1 name="Design documents" url="">
+  <tocsect2 name="Thread safety" url="thread_safety.html"/>
+  <tocsect2 name="Complexity specifications" url="complexity.html"/>
+  <tocsect2 name="Representation of strings" url="string_discussion.html"/>
+</tocsect1>
+<index>
+<entry name="container, STL" url="Container.html"/>
+<entry name="container, forward" url="ForwardContainer.html"/>
+<entry name="random access container" url="RandomAccessContainer.html"/>
+<entry name="container, random access" url="RandomAccessContainer.html"/>
+<entry name="reversible container" url="ReversibleContainer.html"/>
+<entry name="container, reversible" url="ReversibleContainer.html"/>
+<entry name="forward container" url="ForwardContainer.html"/>
+<entry name="multiple sorted container" url="MultipleSortedContainer.html"/>
+<entry name="container, multiple sorted" url="MultipleSortedContainer.html"/>
+<entry name="associative container" url="AssociativeContainer.html"/>
+<entry name="container, associative" url="AssociativeContainer.html"/>
+<entry name="simple associative container" url="SimpleAssociativeContainer.html"/>
+<entry name="container, simple associative" url="SimpleAssociativeContainer.html"/>
+<entry name="unique associative container" url="UniqueAssociativeContainer.html"/>
+<entry name="container, unique associative" url="UniqueAssociativeContainer.html"/>
+<entry name="sorted associative container" url="SortedAssociativeContainer.html"/>
+<entry name="container, sorted associative" url="SortedAssociativeContainer.html"/>
+<entry name="hashed associative container" url="HashedAssociativeContainer.html"/>
+<entry name="container, hashed associative" url="HashedAssociativeContainer.html"/>
+<entry name="unique hashed associative container" url="UniqueHashedAssociativeContainer.html"/>
+<entry name="container, unique hashed associative" url="UniqueHashedAssociativeContainer.html"/>
+<entry name="pair associative container" url="PairAssociativeContainer.html"/>
+<entry name="container, pair associative" url="PairAssociativeContainer.html"/>
+<entry name="multiple associative container" url="MultipleAssociativeContainer.html"/>
+<entry name="container, multiple associative" url="MultipleAssociativeContainer.html"/>
+<entry name="iterators, STL" url="Iterators.html"/>
+<entry name="trivial iterator" url="TrivialIterator.html"/>
+<entry name="iterator, trivial" url="TrivialIterator.html"/>
+<entry name="random access iterator" url="RandomAccessIterator.html"/>
+<entry name="iterator, random access" url="RandomAccessIterator.html"/>
+<entry name="forward iterator" url="ForwardIterator.html"/>
+<entry name="iterator, forward" url="ForwardIterator.html"/>
+<entry name="bidirectional iterator" url="BidirectionalIterator.html"/>
+<entry name="iterator, bidirectional" url="BidirectionalIterator.html"/>
+<entry name="input iterator" url="InputIterator.html"/>
+<entry name="iterator, input" url="InputIterator.html"/>
+<entry name="output iterator" url="OutputIterator.html"/>
+<entry name="iterator, output" url="OutputIterator.html"/>
+<entry name="iterator tags" url="IteratorTags.html"/>
+<entry name="tags, iterator, STL" url="IteratorTags.html"/>
+<entry name="sequence, STL" url="Sequence.html"/>
+<entry name="back insertion sequence" url="BackInsertionSequence.html"/>
+<entry name="sequence, back insertion" url="BackInsertionSequence.html"/>
+<entry name="front insertion sequence" url="FrontInsertionSequence.html"/>
+<entry name="sequence, front insertion" url="FrontInsertionSequence.html"/>
+<entry name="assignable, STL" url="Assignable.html"/>
+<entry name="character traits, STL" url="CharacterTraits.html"/>
+<entry name="default constructible, STL" url="DefaultConstructible.html"/>
+<entry name="equality comparable, STL" url="EqualityComparable.html"/>
+<entry name="lessthan comparable, STL" url="LessThanComparable.html"/>
+<entry name="relational operators, STL" url="RelationalOperators.html"/>
+<entry name="operators, relational, STL" url="RelationalOperators.html"/>
+<entry name="vector, STL class" url="vector.html"/>
+<entry name="deque, STL class" url="Deque.html"/>
+<entry name="list, STL class" url="List.html"/>
+<entry name="slist, STL class" url="slist.html"/>
+<entry name="bit_vector, STL class" url="bit_vector.html"/>
+<entry name="set, STL class" url="set.html"/>
+<entry name="map, STL class" url="map.html"/>
+<entry name="multiset, STL class" url="multiset.html"/>
+<entry name="multimap, STL class" url="multimap.html"/>
+<entry name="hash_set, STL class" url="hash_set.html"/>
+<entry name="hash_map, STL class" url="hash.html"/>
+<entry name="hash_multiset, STL class" url="hash_multiset.html"/>
+<entry name="hash_multimap, STL class" url="hash_multimap.html"/>
+<entry name="char_traits, STL class" url="char_traits.html"/>
+<entry name="basic_string, STL class" url="basic_string.html"/>
+<entry name="rope, STL class" url="rope.html"/>
+<entry name="stack, STL class" url="stack.html"/>
+<entry name="queue, STL class" url="queue.html"/>
+<entry name="bitset, STL class" url="bitset.html"/>
+<entry name="iterator_traits, STL class" url="iterator_traits.html"/>
+<entry name="input_iterator, STL class" url="input_iterator.html"/>
+<entry name="outputput_iterator, STL class" url="output_iterator.html"/>
+<entry name="forward_iterator, STL class" url="forward_iterator.html"/>
+<entry name="bidirectional_iterator, STL class" url="bidirectional_iterator.html"/>
+<entry name="random_access_iterator, STL class" url="random_access_iterator.html"/>
+<entry name="istream_iterator, STL class" url="istream_iterator.html"/>
+<entry name="ostream_iterator, STL class" url="ostream_iterator.html"/>
+<entry name="front_insert_iterator, STL class" url="front_insert_iterator.html"/>
+<entry name="back_insert_iterator, STL class" url="back_insert_iterator.html"/>
+<entry name="insert_iterator, STL class" url="insert_iterator.html"/>
+<entry name="reverse_iterator, STL class" url="reverse_iterator.html"/>
+<entry name="reverse_bidirectional_iterator, STL class" url="reverse_bidirectional_iterator.html"/>
+<entry name="distance, STL function" url="distance.html"/>
+<entry name="advance, STL function" url="advance.html"/>
+<entry name="for_each, STL algorithm" url="for_each.html"/>
+<entry name="find, STL algorithm" url="find.html"/>
+<entry name="find_if, STL algorithm" url="find_if.html"/>
+<entry name="adjacent_find, STL algorithm" url="adjacent_find.html"/>
+<entry name="find_first_of, STL algorithm" url="find_first_of.html"/>
+<entry name="count, STL algorithm" url="count.html"/>
+<entry name="count_if, STL algorithm" url="count_if.html"/>
+<entry name="mismatch, STL algorithm" url="mismatch.html"/>
+<entry name="equal, STL algorithm" url="equal.html"/>
+<entry name="search, STL algorithm" url="search.html"/>
+<entry name="search_n, STL algorithm" url="search_n.html"/>
+<entry name="find_end, STL algorithm" url="find_end.html"/>
+<entry name="copy, STL algorithm" url="copy.html"/>
+<entry name="copy_n, STL algorithm" url="copy_n.html"/>
+<entry name="copy_backward, STL algorithm" url="copy_backward.html"/>
+<entry name="swap, STL algorithm" url="swap.html"/>
+<entry name="iter_swap, STL algorithm" url="iter_swap.html"/>
+<entry name="swap_ranges, STL algorithm" url="swap_ranges.html"/>
+<entry name="transform, STL algorithm" url="transform.html"/>
+<entry name="replace, STL algorithm" url="replace.html"/>
+<entry name="replace_if, STL algorithm" url="replace_if.html"/>
+<entry name="replace_copy, STL algorithm" url="replace_copy.html"/>
+<entry name="fill, STL algorithm" url="fill.html"/>
+<entry name="fill_n, STL algorithm" url="fill_n.html"/>
+<entry name="generate, STL algorithm" url="generate.html"/>
+<entry name="generate_n, STL algorithm" url="generate_n.html"/>
+<entry name="remove, STL algorithm" url="remove.html"/>
+<entry name="remove_if, STL algorithm" url="remove_if.html"/>
+<entry name="remove_copy, STL algorithm" url="remove_copy.html"/>
+<entry name="remove_copy_if, STL algorithm" url="remove_copy_if.html"/>
+<entry name="unique, STL algorithm" url="unique.html"/>
+<entry name="unique_copy, STL algorithm" url="unique_copy.html"/>
+<entry name="reverse, STL algorithm" url="reverse.html"/>
+<entry name="reverse_copy, STL algorithm" url="reverse_copy.html"/>
+<entry name="rotate, STL algorithm" url="rotate.html"/>
+<entry name="rotate_copy, STL algorithm" url="rotate_copy.html"/>
+<entry name="random_shuffle, STL algorithm" url="random_shuffle.html"/>
+<entry name="random_sample, STL algorithm" url="random_sample.html"/>
+<entry name="random_sample_n, STL algorithm" url="random_sample_n.html"/>
+<entry name="partition, STL algorithm" url="partition.html"/>
+<entry name="stable_partition, STL algorithm" url="stable_partition.html"/>
+<entry name="sort, STL algorithm" url="sort.html"/>
+<entry name="stable_sort, STL algorithm" url="stable_sort.html"/>
+<entry name="partial_sort, STL algorithm" url="partial_sort.html"/>
+<entry name="partial_sort_copy, STL algorithm" url="partial_sort_copy.html"/>
+<entry name="is_sorted, STL algorithm" url="is_sorted.html"/>
+<entry name="nth_element, STL algorithm" url="nth_element.html"/>
+<entry name="lower_bound, STL algorithm" url="lower_bound.html"/>
+<entry name="upper_bound, STL algorithm" url="upper_bound.html"/>
+<entry name="equal_range, STL algorithm" url="equal_range.html"/>
+<entry name="binary_search, STL algorithm" url="binary_search.html"/>
+<entry name="merge, STL algorithm" url="merge.html"/>
+<entry name="inplace_merge, STL algorithm" url="inplace_merge.html"/>
+<entry name="includes, STL algorithm" url="includes.html"/>
+<entry name="set_union, STL algorithm" url="set_union.html"/>
+<entry name="set_intersection, STL algorithm" url="set_intersection.html"/>
+<entry name="set_difference, STL algorithm" url="set_difference.html"/>
+<entry name="set_symmetric_difference, STL algorithm" url="set_symmetric_difference.html"/>
+<entry name="push_heap, STL algorithm" url="push_heap.html"/>
+<entry name="pop_heap, STL algorithm" url="pop_heap.html"/>
+<entry name="make_heap, STL algorithm" url="make_heap.html"/>
+<entry name="sort_heap, STL algorithm" url="sort_heap.html"/>
+<entry name="is_heap, STL algorithm" url="is_heap.html"/>
+<entry name="min, STL algorithm" url="min.html"/>
+<entry name="max, STL algorithm" url="max.html"/>
+<entry name="min_element, STL algorithm" url="min_element.html"/>
+<entry name="max_element, STL algorithm" url="max_element.html"/>
+<entry name="lexicographical_compare, STL algorithm" url="lexicographic_compare.html"/>
+<entry name="lexicographical_compare_3way, STL algorithm" url="lexicographic_compare_3way.html"/>
+<entry name="next_permutation, STL algorithm" url="next_permutation.html"/>
+<entry name="prev_permutation, STL algorithm" url="prev_permutation.html"/>
+<entry name="iota, STL algorithm" url="ioata.html"/>
+<entry name="accumulate, STL algorithm" url="accumulate.html"/>
+<entry name="inner_product, STL algorithm" url="inner_product.html"/>
+<entry name="partial_sum, STL algorithm" url="partial_sum.html"/>
+<entry name="adjacent_difference, STL algorithm" url="adjacent_difference.html"/>
+<entry name="power, STL algorithm" url="power.html"/>
+<entry name="plus, STL functor" url="plus.html"/>
+<entry name="minus, STL functor" url="minus.html"/>
+<entry name="times, STL functor" url="times.html"/>
+<entry name="divides, STL functor" url="divides.html"/>
+<entry name="modulus, STL functor" url="modulus.html"/>
+<entry name="negate, STL functor" url="negate.html"/>
+<entry name="equal_to, STL functor" url="equal_to.html"/>
+<entry name="not_equal_to, STL functor" url="not_equal_to.html"/>
+<entry name="less, STL functor" url="less.html"/>
+<entry name="greater, STL functor" url="greater.html"/>
+<entry name="less_equal, STL functor" url="less_equal.html"/>
+<entry name="greater_equal, STL functor" url="greater_equal.html"/>
+<entry name="logical_and, STL functor" url="logical_and.html"/>
+<entry name="logical_or, STL functor" url="logical_or.html"/>
+<entry name="logical_not, STL functor" url="logical_not.html"/>
+<entry name="identity, STL functor" url="identity.html"/>
+<entry name="project1st, STL functor" url="project1st.html"/>
+<entry name="project2nd, STL functor" url="project2nd.html"/>
+<entry name="select1st, STL functor" url="select1st.html"/>
+<entry name="select2nd, STL functor" url="select2nd.html"/>
+<entry name="subtractive_rng, STL functor" url="subtractive_rng.html"/>
+<entry name="binder1st, STL functor" url="binder1st.html"/>
+<entry name="binder2nd, STL functor" url="binder2nd.html"/>
+<entry name="ptr_fun, STL functor" url="ptr_fun.html"/>
+<entry name="pointer_to_unary_function, STL functor" url="pointer_to_unary.html"/>
+<entry name="pointer_to_binary_function, STL functor" url="pointer_to_binary.html"/>
+<entry name="unary_negate, STL functor" url="unary_negate.html"/>
+<entry name="binary_negate, STL functor" url="binary_negate.html"/>
+<entry name="unary_compose, STL functor" url="unary_compose.html"/>
+<entry name="binary_compose, STL functor" url="binary_compose.html"/>
+<entry name="mem_fun_t, STL functor" url="mem_fun_t.html"/>
+<entry name="mem_fun_ref_t, STL functor" url="mem_fun_ref_t.html"/>
+<entry name="mem_fun1_t, STL functor" url="mem_fun1_t.html"/>
+<entry name="mem_fun1_ref_t, STL functor" url="mem_fun1_ref_t.html"/>
+<entry name="pair, STL class" url="pair.html"/>
+<entry name="priority_queue, STL" url="priority_queue.html"/>
+</index>
+</kdeveloptoc>
+