2012-03-27 23:13:14 +00:00
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
2018-12-28 15:30:48 +00:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> < html xmlns = "http://www.w3.org/1999/xhtml" > < head > < meta http-equiv = "Content-Type" content = "text/html; charset=UTF-8" / > < title > Chapter < / title > < meta name = "generator" content = "DocBook XSL Stylesheets Vsnapshot" / > < meta name = "keywords" content = "ISO C++, library, algorithm" / > < meta name = "keywords" content = "ISO C++, runtime, library" / > < link rel = "home" href = "../index.html" title = "The GNU C++ Library" / > < link rel = "up" href = "std_contents.html" title = "Part / > < link rel = "prev" href = "iterators.html" title = "Chapter / > < link rel = "next" href = "numerics.html" title = "Chapter / > < / head > < body > < div class = "navheader" > < table width = "100%" summary = "Navigation header" > < tr > < th colspan = "3" align = "center" > Chapter
2012-03-27 23:13:14 +00:00
Algorithms
2014-09-21 17:33:12 +00:00
< / th > < / tr > < tr > < td width = "20%" align = "left" > < a accesskey = "p" href = "iterators.html" > Prev< / a > < / td > < th width = "60%" align = "center" > Part
2012-03-27 23:13:14 +00:00
Standard Contents
2014-09-21 17:33:12 +00:00
< / th > < td width = "20%" align = "right" > < a accesskey = "n" href = "numerics.html" > Next< / a > < / td > < / tr > < / table > < hr / > < / div > < div class = "chapter" > < div class = "titlepage" > < div > < div > < h2 class = "title" > < a id = "std.algorithms" > < / a > Chapter
2012-03-27 23:13:14 +00:00
Algorithms
2015-08-28 15:33:40 +00:00
< a id = "id-1.3.4.9.1.1.1" class = "indexterm" > < / a >
2014-09-21 17:33:12 +00:00
< / h2 > < / div > < / div > < / div > < div class = "toc" > < p > < strong > Table of Contents< / strong > < / p > < dl class = "toc" > < dt > < span class = "section" > < a href = "algorithms.html#std.algorithms.mutating" > Mutating< / a > < / span > < / dt > < dd > < dl > < dt > < span class = "section" > < a href = "algorithms.html#algorithms.mutating.swap" > < code class = "function" > swap< / code > < / a > < / span > < / dt > < dd > < dl > < dt > < span class = "section" > < a href = "algorithms.html#algorithms.swap.specializations" > Specializations< / a > < / span > < / dt > < / dl > < / dd > < / dl > < / dd > < / dl > < / div > < p >
2012-03-27 23:13:14 +00:00
The neatest accomplishment of the algorithms section is that all the
work is done via iterators, not containers directly. This means two
important things:
2014-09-21 17:33:12 +00:00
< / p > < div class = "orderedlist" > < ol class = "orderedlist" type = "1" > < li class = "listitem" > < p >
2012-03-27 23:13:14 +00:00
Anything that behaves like an iterator can be used in one of
these algorithms. Raw pointers make great candidates, thus
built-in arrays are fine containers, as well as your own
iterators.
< / p > < / li > < li class = "listitem" > < p >
The algorithms do not (and cannot) affect the container as a
whole; only the things between the two iterator endpoints. If
you pass a range of iterators only enclosing the middle third of
a container, then anything outside that range is inviolate.
< / p > < / li > < / ol > < / div > < p >
Even strings can be fed through the algorithms here, although the
string class has specialized versions of many of these functions
(for example, < code class = "code" > string::find()< / code > ). Most of the examples
on this page will use simple arrays of integers as a playground
for algorithms, just to keep things simple. The use of
< span class = "emphasis" > < em > N< / em > < / span > as a size in the examples is to keep things
easy to read but probably won't be valid code. You can use wrappers
such as those described in
the < a class = "link" href = "containers.html" title = "Chapter > containers section< / a > to keep
real code readable.
< / p > < p >
The single thing that trips people up the most is the definition
of < span class = "emphasis" > < em > range< / em > < / span > used with iterators; the famous
"past-the-end" rule that everybody loves to hate. The
< a class = "link" href = "iterators.html" title = "Chapter > iterators section< / a > of this
document has a complete explanation of this simple rule that seems
to cause so much confusion. Once you
get < span class = "emphasis" > < em > range< / em > < / span > into your head (it's not that hard,
honest!), then the algorithms are a cakewalk.
2014-09-21 17:33:12 +00:00
< / p > < div class = "section" > < div class = "titlepage" > < div > < div > < h2 class = "title" style = "clear: both" > < a id = "std.algorithms.mutating" > < / a > Mutating< / h2 > < / div > < / div > < / div > < div class = "section" > < div class = "titlepage" > < div > < div > < h3 class = "title" > < a id = "algorithms.mutating.swap" > < / a > < code class = "function" > swap< / code > < / h3 > < / div > < / div > < / div > < div class = "section" > < div class = "titlepage" > < div > < div > < h4 class = "title" > < a id = "algorithms.swap.specializations" > < / a > Specializations< / h4 > < / div > < / div > < / div > < p > If you call < code class = "code" > std::swap(x,y); < / code > where x and y are standard
2012-03-27 23:13:14 +00:00
containers, then the call will automatically be replaced by a call to
< code class = "code" > x.swap(y); < / code > instead.
< / p > < p > This allows member functions of each container class to take over, and
containers' swap functions should have O(1) complexity according to
the standard. (And while "should" allows implementations to
behave otherwise and remain compliant, this implementation does in
fact use constant-time swaps.) This should not be surprising, since
for two containers of the same type to swap contents, only some
internal pointers to storage need to be exchanged.
2014-09-21 17:33:12 +00:00
< / p > < / div > < / div > < / div > < / div > < div class = "navfooter" > < hr / > < table width = "100%" summary = "Navigation footer" > < tr > < td width = "40%" align = "left" > < a accesskey = "p" href = "iterators.html" > Prev< / a > < / td > < td width = "20%" align = "center" > < a accesskey = "u" href = "std_contents.html" > Up< / a > < / td > < td width = "40%" align = "right" > < a accesskey = "n" href = "numerics.html" > Next< / a > < / td > < / tr > < tr > < td width = "40%" align = "left" valign = "top" > Chapter
2012-03-27 23:13:14 +00:00
Iterators
2014-09-21 17:33:12 +00:00
< / td > < td width = "20%" align = "center" > < a accesskey = "h" href = "../index.html" > Home< / a > < / td > < td width = "40%" align = "right" valign = "top" >
2012-03-27 23:13:14 +00:00
Numerics
2014-09-21 17:33:12 +00:00
< / td > < / tr > < / table > < / div > < / body > < / html >
