blob: 80cb399b9d4986012e27407d12232d4141bb8767 [file] [log] [blame]
<!--
Licensed to the Apache Software Foundation (ASF) under one or more
contributor license agreements. See the NOTICE file distributed
with this work for additional information regarding copyright
ownership. The ASF licenses this file to you under the Apache
License, Version 2.0 (the License); you may not use this file
except in compliance with the License. You may obtain a copy of
the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied. See the License for the specific language governing
permissions and limitations under the License.
Copyright 1999-2007 Rogue Wave Software, Inc.
-->
<HTML>
<HEAD>
<TITLE>Generic Algorithms</TITLE>
<LINK REL=StyleSheet HREF="../rw.css" TYPE="text/css" TITLE="Apache stdcxx Stylesheet"></HEAD>
<BODY BGCOLOR=#FFFFFF>
<A HREF="IV.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="13-1.html"><IMG SRC="images/bnext.gif" WIDTH=25 HEIGHT=21 ALT="Next file" BORDER=O></A><DIV CLASS="DOCUMENTNAME"><B>Apache C++ Standard Library User's Guide</B></DIV>
<H1>Chapter 13: Generic Algorithms</H1>
<UL>
<UL><LI><A HREF="13-1.html">13.1 Overview</A></LI></UL>
<UL><UL><LI><A HREF="13-1.html#1311">13.1.1 Include Files</A></LI></UL></UL>
<UL><LI><A HREF="13-2.html">13.2 Initialization Algorithms</A></LI></UL>
<UL><UL><LI><A HREF="13-2.html#1321">13.2.1 Fill a Sequence with An Initial Value</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-2.html#1322">13.2.2 Copy One Sequence Into Another Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-2.html#1323">13.2.3 Initialize a Sequence with Generated Values</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-2.html#1324">13.2.4 Swap Values from Two Parallel Ranges</A></LI></UL></UL>
<UL><LI><A HREF="13-3.html">13.3 Searching Operations</A></LI></UL>
<UL><UL><LI><A HREF="13-3.html#1331">13.3.1 Find an Element Satisfying a Condition</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1332">13.3.2 Find Consecutive Duplicate Elements</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1333">13.3.3 Find the First Occurrence of Any Value from a Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1334">13.3.4 Find a Sub-Sequence within a Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1335">13.3.5 Find the Last Occurrence of a Sub-Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1336">13.3.6 Locate Maximum or Minimum Element</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-3.html#1337">13.3.7 Locate the First Mismatched Elements in Parallel Sequences</A></LI></UL></UL>
<UL><LI><A HREF="13-4.html">13.4 In-Place Transformations</A></LI></UL>
<UL><UL><LI><A HREF="13-4.html#1341">13.4.1 Reverse Elements in a Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1342">13.4.2 Replace Certain Elements With Fixed Value</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1343">13.4.3 Rotate Elements Around a Midpoint</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1344">13.4.4 Partition a Sequence into Two Groups</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1345">13.4.5 Generate Permutations in Sequence</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1346">13.4.6 Merge Two Adjacent Sequences into One</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-4.html#1347">13.4.7 Randomly Rearrange Elements in a Sequence</A></LI></UL></UL>
<UL><LI><A HREF="13-5.html">13.5 Removal Algorithms</A></LI></UL>
<UL><UL><LI><A HREF="13-5.html#1351">13.5.1 Remove Unwanted Elements</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-5.html#1352">13.5.2 Remove Runs of Similar Values</A></LI></UL></UL>
<UL><LI><A HREF="13-6.html">13.6 Scalar-Producing Algorithms</A></LI></UL>
<UL><UL><LI><A HREF="13-6.html#1361">13.6.1 Count the Number of Elements That Satisfy a Condition</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-6.html#1362">13.6.2 Reduce Sequence to a Single Value</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-6.html#1363">13.6.3 Generalized Inner Product</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-6.html#1364">13.6.4 Test Two Sequences for Pairwise Equality</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-6.html#1365">13.6.5 Lexical Comparison</A></LI></UL></UL>
<UL><LI><A HREF="13-7.html">13.7 Sequence-Generating Algorithms</A></LI></UL>
<UL><UL><LI><A HREF="13-7.html#1371">13.7.1 Transform One or Two Sequences</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-7.html#1372">13.7.2 Partial Sums</A></LI></UL></UL>
<UL><UL><LI><A HREF="13-7.html#1373">13.7.3 Adjacent Differences</A></LI></UL></UL>
<UL><LI><A HREF="13-8.html">13.8 The for_each() Algorithm</A></LI></UL>
</UL>
<BR>
<HR>
<A HREF="IV.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="13-1.html"><IMG SRC="images/bnext.gif" WIDTH=20 HEIGHT=21 ALT="Next file" BORDER=O></A>
<!-- Google Analytics tracking code -->
<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-1775151-1";
urchinTracker();
</script>
<!-- end of Google Analytics tracking code -->
</BODY>
</HTML>