diff options
Diffstat (limited to 'libs/sort')
469 files changed, 45565 insertions, 0 deletions
diff --git a/libs/sort/Jamfile.v2 b/libs/sort/Jamfile.v2 new file mode 100644 index 000000000..9e5d38fc0 --- /dev/null +++ b/libs/sort/Jamfile.v2 @@ -0,0 +1,42 @@ +# Copyright Steven Ross 2009.
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+# See http://www.boost.org/libs/sort for library home page.
+
+local properties = ;
+if --tune in [ modules.peek : ARGV ]
+{
+ properties = <location>. <variant>release ;
+}
+
+project spreadsort : source-location example : requirements <include>../.. <include>../../.. $(properties) ;
+
+exe spreadsort : sample.cpp ;
+exe alreadysorted : alreadysorted.cpp ;
+exe mostlysorted : mostlysorted.cpp ;
+exe rightshift : rightshiftsample.cpp ;
+exe reverseintsort : reverseintsample.cpp ;
+exe int64 : int64.cpp ;
+exe floatsort : floatsample.cpp ;
+exe shiftfloatsort : shiftfloatsample.cpp ;
+exe floatfunctorsort : floatfunctorsample.cpp ;
+exe double : double.cpp ;
+exe stringsort : stringsample.cpp ;
+exe wstringsort : wstringsample.cpp ;
+exe reversestringsort : reversestringsample.cpp ;
+exe charstringsort : charstringsample.cpp ;
+exe stringfunctorsort : stringfunctorsample.cpp ;
+exe reversestringfunctorsort : reversestringfunctorsample.cpp ;
+exe keyplusdata : keyplusdatasample.cpp ;
+exe randomgen : randomgen.cpp ;
+exe boostrandomgen : boostrandomgen.cpp ;
+exe alrbreaker : alrbreaker.cpp ;
+exe binaryalrbreaker : binaryalrbreaker.cpp ;
+exe caseinsensitive : caseinsensitive.cpp ;
+exe generalizedstruct : generalizedstruct.cpp ;
+
+# benchmarks need to be built with linkflags="-lboost_system -lboost_thread"
+#exe parallelint : parallelint.cpp boost_system ;
+#exe parallelstring : parallelstring.cpp ;
\ No newline at end of file diff --git a/libs/sort/README.md b/libs/sort/README.md new file mode 100644 index 000000000..f3b39e8e1 --- /dev/null +++ b/libs/sort/README.md @@ -0,0 +1,27 @@ +sort
+====
+
+Boost Sort library that includes spreadsort, a hybrid radix sort that is faster than O(n*log(n))
+
+Replace "/" with "\" in paths below if you're using Windows.
+To install, download boost, run bootstrap, and copy this library into <your boost root>/libs/sort.
+
+Run the unit tests from your boost root:
+./b2 libs/sort/test
+
+Then go to <your boost root>/libs/sort and run tune.pl:
+Then from the same directory verify correctness and speed on small data sets:
+perl tune.pl -small [-windows]
+(it needs the windows option to build for windows)
+This tests sorting on many different distributions and data types, making sure the results are identical to std::sort and showing a speed comparison that is a weighted average across multiple data distributions.
+If you're interested in more accurate speed comparisons, run the same command either without the -small option, or with the -large option instead. This will take substantially longer.
+
+Documentation is available from the index.html in this same directory, including a description of the algorithm, how to use it, and why it's faster.
+
+Finally, if you have an unusual computing system, you may want to use the -tune option to tune.pl, to tune the constants used by the library for your specific system. BEWARE that this will overwrite the default boost/sort/spreadsort/detail/constants.hpp provided by the library. Making a copy first is a good idea. Also note that it doesn't tune MAX_SPLITS, the most important parameter, because that should only be tuned with the -large option and it can overfit to the specific amount of data passed in.
+
+Feel free to contact spreadsort@gmail.com with any questions about this library.
+
+Copyright 2014-2015 Steven Ross
+Distributed under the Boost Software License, Version 1.0. (See http://www.boost.org/LICENSE_1_0.txt)
+
diff --git a/libs/sort/doc/4_threaded.png b/libs/sort/doc/4_threaded.png Binary files differnew file mode 100644 index 000000000..b06d32492 --- /dev/null +++ b/libs/sort/doc/4_threaded.png diff --git a/libs/sort/doc/Jamfile.v2 b/libs/sort/doc/Jamfile.v2 new file mode 100644 index 000000000..df68f37c5 --- /dev/null +++ b/libs/sort/doc/Jamfile.v2 @@ -0,0 +1,160 @@ +# Spreadsort documentation Jamfile
+# Copyright (c) 2014 Steven Ross
+#
+# Distributed under the Boost Software License,
+# Version 1.0. (See accompanying file LICENSE_1_0.txt
+# or copy at http://boost.org/LICENSE_1_0.txt)
+
+# Reminder: whitespace MUST terminate variable name!
+# so spaces or newlines BEFORE ; and : and AFTER too.
+# (because : and ; are keywords!)
+
+import doxygen ;
+import quickbook ;
+import os ; # Needed to get environment variables.
+import modules ;
+
+path-constant here : . ; # convenient to refer to files in the same directory as this jamfile.v2
+path-constant boost-images : ../../../doc/src/images ;
+path-constant images_location : ./doc ; # location of SVG and PNG images referenced by Quickbook.
+# http://docbook.sourceforge.net/release/xsl/1.77.1/doc/html/img.src.path.html
+# relative to /doc ?
+
+path-constant parent : .. ; # Beman Dawes - so that inspect.exe will start in boost-root/libs/timer
+ # when run from another directory, such as boost-root/status
+using auto-index ;
+using doxygen ; # Required if you want to use Doxygen.
+using quickbook ;
+using boostbook ;
+
+if --enable-index in [ modules.peek : ARGV ]
+{
+ ECHO "Building the Spreadsort docs with automatic index generation enabled." ;
+ using auto-index ;
+ project sort_doc : requirements
+ <auto-index>on
+ <auto-index-script>sort.idx
+ <auto-index-prefix>.
+ <auto-index-verbose>on
+ <format>html:<auto-index-internal>on
+ <format>html:<xsl:param>generate.index=0
+ <format>pdf:<auto-index-internal>on
+ <format>pdf:<xsl:param>index.on.type=1
+ <quickbook-define>enable_index ;
+}
+else
+{
+ project sort_doc ;
+ ECHO "Building the Spreadsort docs with automatic index generation disabled. Try building with --enable-index." ;
+}
+
+doxygen autodoc
+ :
+ [ glob $(here)/../include/boost/sort.hpp ]
+ [ glob $(here)/../include/boost/sort/spreadsort/*.hpp ]
+ # [ glob $(here)/../include/boost/sort/detail/spreadsort/*.hpp ] # Hide implementation/detail for now.
+ # but could also include this and switch Boost.Sort C++ reference info to include implementation/detail or not using Doxygen macro DETAIL.
+ # See http://www.stack.nl/~dimitri/doxygen/manual/commands.html#cmdcond
+ # and http://www.stack.nl/~dimitri/doxygen/manual/config.html#cfg_enabled_sections
+ # by adding this line below with other Doxygen parameters
+ # <doxygen:param>ENABLED_SECTIONS="DETAIL"
+ # Or setting this macro value ENABLED_SECTIONS="DETAIL" in /doxygen/sort_doxyfile.txt for Standalone Doxygen documentaation.
+ # This might be useful for maintainers.
+
+ :
+ <doxygen:param>PROJECT_NAME="Sort"
+ <doxygen:param>RECURSIVE=NO
+ <doxygen:param>ENABLE_PREPROCESSING=YES
+ <doxygen:param>EXPAND_ONLY_PREDEF=YES
+ <doxygen:param>EXTRACT_ALL=NO
+ <doxygen:param>EXTRACT_PRIVATE=NO
+ <doxygen:param>HIDE_UNDOC_MEMBERS=YES
+ <doxygen:param>MACRO_EXPANSION=YES
+ <doxygen:param>SORT_MEMBER_DOCS=NO
+ <doxygen:param>SHOW_INCLUDE_FILES=NO
+ <doxygen:param>MAX_INITIALIZER_LINES=0
+ <doxygen:param>VERBATIM_HEADERS=NO
+ <doxygen:param>WARNINGS=NO # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings for undocumented members.
+ # If EXTRACT_ALL is set to YES then this flag will automatically be disabled.
+ <doxygen:param>WARN_IF_UNDOCUMENTED=NO # If WARN_IF_UNDOCUMENTED is set to YES,
+ # then doxygen will generate warnings for all undocumented members.
+ <doxygen:param>WARN_IF_DOC_ERROR=YES # If WARN_IF_DOC_ERROR is set to YES, Doxygen will generate warnings for
+ # potential errors in the documentation.
+ <doxygen:param>WARN_LOGFILE=AutoDoxywarnings.log # This may not be empty (usually not a good sign!), depending on options chosen.
+ # Much better to send message to a logfile than the default stderr.
+ # and make sure that there are no Doxygen errors or significant warnings in the log file.
+
+ #<reftitle>"Reference" # Default is "Reference" but helpful to specify library.
+ <xsl:param>"boost.doxygen.reftitle=Boost.Sort C++ Reference"
+ # See Doxygen configuration for detailed explanation of these options.
+ ;
+
+xml sort
+ :
+ sort.qbk # This is your 'root' Quickbook file (that may include other .qbk files).
+ ;
+
+boostbook standalone
+ :
+ sort
+ :
+ # http://www.sagehill.net/docbookxsl/SectionNumbering.html
+ <xsl:param>boost.root=../../../.. # modular-boost
+ <xsl:param>chapter.autolabel=0 # No Chapter numbering.
+ <xsl:param>chunk.section.depth=8
+ <xsl:param>toc.section.depth=8 # How far down sections get TOCs.
+ <xsl:param>toc.max.depth=4 # Max depth in each TOC.
+ <xsl:param>generate.section.toc.level=1
+
+
+ # PDF Options:
+ # TOC Generation: this is needed for FOP-0.9 and later:
+ <xsl:param>fop1.extensions=0
+ <xsl:param>xep.extensions=1
+ # TOC generation: this is needed for FOP 0.2, but must not be set to zero for FOP-0.9!
+ <xsl:param>fop.extensions=1
+ # No indent on body text:
+ <xsl:param>body.start.indent=0pt
+ # Margin size:
+ <xsl:param>page.margin.inner=0.5in
+ # Margin size:
+ <xsl:param>page.margin.outer=0.5in
+ # Paper type = A4
+ <xsl:param>paper.type=A4
+ # Yes, we want graphics for admonishments:
+ <xsl:param>admon.graphics=1
+ #<format>html:<xsl:param>img.src.path=$(images_location)/
+ # Default works for html, need ./doc for PDF
+ # Set this one for PDF generation *only*:
+ # default png graphics are awful in PDF form,
+ # better use SVGs instead, if available:
+
+ <format>pdf:<xsl:param>img.src.path=$(images_location)/
+ <format>pdf:<xsl:param>admon.graphics.extension=".svg"
+ <format>pdf:<xsl:param>admon.graphics.path=$(boost-images)/
+
+ <dependency>autodoc #
+
+ ;
+
+install pdfinstall
+ : standalone
+ : <location>. <install-type>PDF <name>sort.pdf
+ ;
+explicit css ;
+explicit images ;
+
+# This will run the inspect tool automatically from the doc folder
+# but sadly seems to build the tool each time so is very slow.
+# Also it produces lots of output from the original docs.
+# So not very useful yet.
+
+# Run inspect tool.
+# run /boost/tools/inspect//inspect/<variant>release
+# : $(parent) -text -brief # command line
+# : # input files
+# : <dependency>/boost/filesystem//boost_filesystem
+# <test-info>always_show_run_output # requirements
+# : inspect # test name
+# ;
+
diff --git a/libs/sort/doc/bits_per_byte.png b/libs/sort/doc/bits_per_byte.png Binary files differnew file mode 100644 index 000000000..9106e3b7a --- /dev/null +++ b/libs/sort/doc/bits_per_byte.png diff --git a/libs/sort/doc/doxygen/boost-no-inspect b/libs/sort/doc/doxygen/boost-no-inspect new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/libs/sort/doc/doxygen/boost-no-inspect diff --git a/libs/sort/doc/doxygen/doxywarnings.log b/libs/sort/doc/doxygen/doxywarnings.log new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/libs/sort/doc/doxygen/doxywarnings.log diff --git a/libs/sort/doc/doxygen/html/_2example_2sample_8cpp-example.html b/libs/sort/doc/doxygen/html/_2example_2sample_8cpp-example.html new file mode 100644 index 000000000..2e595f184 --- /dev/null +++ b/libs/sort/doc/doxygen/html/_2example_2sample_8cpp-example.html @@ -0,0 +1,136 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: /example/sample.cpp</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li><a href="examples.html"><span>Examples</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">/example/sample.cpp</div> </div> +</div><!--header--> +<div class="contents"> +<p>Integer sort algorithm using random access iterators. All variants fall back to <code>std::sort</code> if the data is too small.<code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../../graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../../graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">Propagates</td><td>exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</dd></dl> +<div class="fragment"></div><!-- fragment --> </div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Tue Jan 6 2015 16:36:35 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/alrbreaker_8cpp.html b/libs/sort/doc/doxygen/html/alrbreaker_8cpp.html new file mode 100644 index 000000000..bdcae3859 --- /dev/null +++ b/libs/sort/doc/doxygen/html/alrbreaker_8cpp.html @@ -0,0 +1,290 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/alrbreaker.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> | +<a href="#var-members">Variables</a> </div> + <div class="headertitle"> +<div class="title">alrbreaker.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   boost::uint64_t</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3bc09656dab629cfa24aa2ab3f44a3e6"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a>   3</td></tr> +<tr class="separator:a3bc09656dab629cfa24aa2ab3f44a3e6"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a53572e34857429ae9b6d9c5f4d02b453"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a53572e34857429ae9b6d9c5f4d02b453">fill_vector</a> (vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > &input, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> base_value, unsigned remaining_bits)</td></tr> +<tr class="separator:a53572e34857429ae9b6d9c5f4d02b453"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0fc34f49b0e6eaed5e5c3accb409b1d1"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">main</a> (int, const char **)</td></tr> +<tr class="separator:a0fc34f49b0e6eaed5e5c3accb409b1d1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a> +Variables</h2></td></tr> +<tr class="memitem:a4587b2f61869f9798cb12a8ebb37387d"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a> = <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a> - 1</td></tr> +<tr class="separator:a4587b2f61869f9798cb12a8ebb37387d"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a50fb2847ba87c9bd84e0c5c8a951f9de"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">bit_shift</a></td></tr> +<tr class="separator:a50fb2847ba87c9bd84e0c5c8a951f9de"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:afc30457e398e72300f20714123913b78"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">radix_threshold</a> = detail::rough_log_2_size(<a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) + 1</td></tr> +<tr class="separator:afc30457e398e72300f20714123913b78"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a60c4ea1dd4d297e0d2e395375e0e716c"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a60c4ea1dd4d297e0d2e395375e0e716c">top_splits</a> = 12</td></tr> +<tr class="separator:a60c4ea1dd4d297e0d2e395375e0e716c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a8b984673f3b3e097d3f37508923452fa"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">typed_one</a> = 1</td></tr> +<tr class="separator:a8b984673f3b3e097d3f37508923452fa"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a3bc09656dab629cfa24aa2ab3f44a3e6"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define ALR_THRESHOLD   3</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   boost::uint64_t</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a53572e34857429ae9b6d9c5f4d02b453"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">void fill_vector </td> + <td>(</td> + <td class="paramtype">vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > & </td> + <td class="paramname"><em>input</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> </td> + <td class="paramname"><em>base_value</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>remaining_bits</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0fc34f49b0e6eaed5e5c3accb409b1d1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Variable Documentation</h2> +<a class="anchor" id="a50fb2847ba87c9bd84e0c5c8a951f9de"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned bit_shift</td> + </tr> + </table> +</div><div class="memdoc"> +<b>Initial value:</b><div class="fragment"><div class="line">= detail::rough_log_2_size(<a class="code" href="alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) -</div> +<div class="line"> detail::int_log_mean_bin_size</div> +<div class="ttc" id="alrbreaker_8cpp_html_a4587b2f61869f9798cb12a8ebb37387d"><div class="ttname"><a href="alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a></div><div class="ttdeci">const unsigned max_count</div><div class="ttdef"><b>Definition:</b> alrbreaker.cpp:28</div></div> +</div><!-- fragment --> +</div> +</div> +<a class="anchor" id="a4587b2f61869f9798cb12a8ebb37387d"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned max_count = <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a> - 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afc30457e398e72300f20714123913b78"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned radix_threshold = detail::rough_log_2_size(<a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) + 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a60c4ea1dd4d297e0d2e395375e0e716c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned top_splits = 12</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a8b984673f3b3e097d3f37508923452fa"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> typed_one = 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/alreadysorted_8cpp.html b/libs/sort/doc/doxygen/html/alreadysorted_8cpp.html new file mode 100644 index 000000000..3d0dcf853 --- /dev/null +++ b/libs/sort/doc/doxygen/html/alreadysorted_8cpp.html @@ -0,0 +1,164 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/alreadysorted.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">alreadysorted.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="alreadysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="alreadysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/annotated.html b/libs/sort/doc/doxygen/html/annotated.html new file mode 100644 index 000000000..c6a8bcddd --- /dev/null +++ b/libs/sort/doc/doxygen/html/annotated.html @@ -0,0 +1,109 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Class List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">Class List</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</div><div class="directory"> +<table class="directory"> +<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceboost.html" target="_self">boost</a></td><td class="desc"></td></tr> +<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structbracket.html" target="_self">bracket</a></td><td class="desc"></td></tr> +<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_d_a_t_a___t_y_p_e.html" target="_self">DATA_TYPE</a></td><td class="desc"></td></tr> +<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structgetsize.html" target="_self">getsize</a></td><td class="desc"></td></tr> +<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structgreaterthan.html" target="_self">greaterthan</a></td><td class="desc"></td></tr> +<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structlessthan.html" target="_self">lessthan</a></td><td class="desc"></td></tr> +<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnegrightshift.html" target="_self">negrightshift</a></td><td class="desc"></td></tr> +<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structrightshift.html" target="_self">rightshift</a></td><td class="desc"></td></tr> +</table> +</div><!-- directory --> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/arrowdown.png b/libs/sort/doc/doxygen/html/arrowdown.png Binary files differnew file mode 100644 index 000000000..0b63f6d38 --- /dev/null +++ b/libs/sort/doc/doxygen/html/arrowdown.png diff --git a/libs/sort/doc/doxygen/html/arrowright.png b/libs/sort/doc/doxygen/html/arrowright.png Binary files differnew file mode 100644 index 000000000..c6ee22f93 --- /dev/null +++ b/libs/sort/doc/doxygen/html/arrowright.png diff --git a/libs/sort/doc/doxygen/html/bc_s.png b/libs/sort/doc/doxygen/html/bc_s.png Binary files differnew file mode 100644 index 000000000..224b29aa9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/bc_s.png diff --git a/libs/sort/doc/doxygen/html/bdwn.png b/libs/sort/doc/doxygen/html/bdwn.png Binary files differnew file mode 100644 index 000000000..940a0b950 --- /dev/null +++ b/libs/sort/doc/doxygen/html/bdwn.png diff --git a/libs/sort/doc/doxygen/html/binaryalrbreaker_8cpp.html b/libs/sort/doc/doxygen/html/binaryalrbreaker_8cpp.html new file mode 100644 index 000000000..45084e889 --- /dev/null +++ b/libs/sort/doc/doxygen/html/binaryalrbreaker_8cpp.html @@ -0,0 +1,306 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/binaryalrbreaker.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> | +<a href="#var-members">Variables</a> </div> + <div class="headertitle"> +<div class="title">binaryalrbreaker.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   boost::uint64_t</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3bc09656dab629cfa24aa2ab3f44a3e6"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a>   3</td></tr> +<tr class="separator:a3bc09656dab629cfa24aa2ab3f44a3e6"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:ac9ac611850049644567c33a1b01e108a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#ac9ac611850049644567c33a1b01e108a">fill_vector</a> (vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > &input, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> base_value, unsigned remaining_bits, const vector< unsigned > &indices, int index)</td></tr> +<tr class="separator:ac9ac611850049644567c33a1b01e108a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0154ebfc03900bb5789ff9a306a480a9"><td class="memItemLeft" align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">get_index</a> (unsigned count)</td></tr> +<tr class="separator:a0154ebfc03900bb5789ff9a306a480a9"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0fc34f49b0e6eaed5e5c3accb409b1d1"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">main</a> (int, const char **)</td></tr> +<tr class="separator:a0fc34f49b0e6eaed5e5c3accb409b1d1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a> +Variables</h2></td></tr> +<tr class="memitem:a4587b2f61869f9798cb12a8ebb37387d"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a> = <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a> - 1</td></tr> +<tr class="separator:a4587b2f61869f9798cb12a8ebb37387d"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a50fb2847ba87c9bd84e0c5c8a951f9de"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">bit_shift</a></td></tr> +<tr class="separator:a50fb2847ba87c9bd84e0c5c8a951f9de"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:afc30457e398e72300f20714123913b78"><td class="memItemLeft" align="right" valign="top">const unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">radix_threshold</a> = detail::rough_log_2_size(<a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) + 1</td></tr> +<tr class="separator:afc30457e398e72300f20714123913b78"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a8b984673f3b3e097d3f37508923452fa"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">typed_one</a> = 1</td></tr> +<tr class="separator:a8b984673f3b3e097d3f37508923452fa"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a3bc09656dab629cfa24aa2ab3f44a3e6"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define ALR_THRESHOLD   3</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   boost::uint64_t</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="ac9ac611850049644567c33a1b01e108a"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">void fill_vector </td> + <td>(</td> + <td class="paramtype">vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > & </td> + <td class="paramname"><em>input</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> </td> + <td class="paramname"><em>base_value</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>remaining_bits</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const vector< unsigned > & </td> + <td class="paramname"><em>indices</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">int </td> + <td class="paramname"><em>index</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0154ebfc03900bb5789ff9a306a480a9"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">unsigned get_index </td> + <td>(</td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>count</em></td><td>)</td> + <td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0fc34f49b0e6eaed5e5c3accb409b1d1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Variable Documentation</h2> +<a class="anchor" id="a50fb2847ba87c9bd84e0c5c8a951f9de"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned bit_shift</td> + </tr> + </table> +</div><div class="memdoc"> +<b>Initial value:</b><div class="fragment"><div class="line">= detail::rough_log_2_size(<a class="code" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) -</div> +<div class="line"> detail::int_log_mean_bin_size</div> +<div class="ttc" id="binaryalrbreaker_8cpp_html_a4587b2f61869f9798cb12a8ebb37387d"><div class="ttname"><a href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a></div><div class="ttdeci">const unsigned max_count</div><div class="ttdef"><b>Definition:</b> binaryalrbreaker.cpp:28</div></div> +</div><!-- fragment --> +</div> +</div> +<a class="anchor" id="a4587b2f61869f9798cb12a8ebb37387d"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned max_count = <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">ALR_THRESHOLD</a> - 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afc30457e398e72300f20714123913b78"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const unsigned radix_threshold = detail::rough_log_2_size(<a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">max_count</a>) + 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a8b984673f3b3e097d3f37508923452fa"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> typed_one = 1</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/boostrandomgen_8cpp.html b/libs/sort/doc/doxygen/html/boostrandomgen_8cpp.html new file mode 100644 index 000000000..adcbe93f4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/boostrandomgen_8cpp.html @@ -0,0 +1,142 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/boostrandomgen.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">boostrandomgen.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <stdio.h></code><br /> +<code>#include "stdlib.h"</code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <boost/random.hpp></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="boostrandomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/caseinsensitive_8cpp.html b/libs/sort/doc/doxygen/html/caseinsensitive_8cpp.html new file mode 100644 index 000000000..159f1c9eb --- /dev/null +++ b/libs/sort/doc/doxygen/html/caseinsensitive_8cpp.html @@ -0,0 +1,157 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/caseinsensitive.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">caseinsensitive.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <boost/algorithm/string.hpp></code><br /> +<code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html">lessthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html">bracket</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html">getsize</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="caseinsensitive_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/charstringsample_8cpp.html b/libs/sort/doc/doxygen/html/charstringsample_8cpp.html new file mode 100644 index 000000000..a82141f00 --- /dev/null +++ b/libs/sort/doc/doxygen/html/charstringsample_8cpp.html @@ -0,0 +1,154 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/charstringsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">charstringsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html">bracket</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html">getsize</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="charstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/classes.html b/libs/sort/doc/doxygen/html/classes.html new file mode 100644 index 000000000..c84631e75 --- /dev/null +++ b/libs/sort/doc/doxygen/html/classes.html @@ -0,0 +1,114 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Class Index</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li class="current"><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">Class Index</div> </div> +</div><!--header--> +<div class="contents"> +<div class="qindex"><a class="qindex" href="#letter_B">B</a> | <a class="qindex" href="#letter_D">D</a> | <a class="qindex" href="#letter_G">G</a> | <a class="qindex" href="#letter_L">L</a> | <a class="qindex" href="#letter_N">N</a> | <a class="qindex" href="#letter_R">R</a></div> +<table style="margin: 10px; white-space: nowrap;" align="center" width="95%" border="0" cellspacing="0" cellpadding="0"> +<tr><td rowspan="2" valign="bottom"><a name="letter_D"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  D  </div></td></tr></table> +</td><td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  g  </div></td></tr></table> +</td><td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  l  </div></td></tr></table> +</td><td rowspan="2" valign="bottom"><a name="letter_r"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  r  </div></td></tr></table> +</td></tr> +<tr></tr> +<tr><td valign="top"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   </td><td valign="top"><a class="el" href="structgetsize.html">getsize</a>   </td><td valign="top"><a class="el" href="structlessthan.html">lessthan</a>   </td><td valign="top"><a class="el" href="structrightshift.html">rightshift</a>   </td></tr> +<tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  b  </div></td></tr></table> +</td><td valign="top"><a class="el" href="structgreaterthan.html">greaterthan</a>   </td><td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  n  </div></td></tr></table> +</td><td></td></tr> +<tr><td></td><td></td></tr> +<tr><td valign="top"><a class="el" href="structbracket.html">bracket</a>   </td><td></td><td valign="top"><a class="el" href="structnegrightshift.html">negrightshift</a>   </td><td></td></tr> +<tr><td></td><td></td><td></td><td></td></tr> +</table> +<div class="qindex"><a class="qindex" href="#letter_B">B</a> | <a class="qindex" href="#letter_D">D</a> | <a class="qindex" href="#letter_G">G</a> | <a class="qindex" href="#letter_L">L</a> | <a class="qindex" href="#letter_N">N</a> | <a class="qindex" href="#letter_R">R</a></div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/closed.png b/libs/sort/doc/doxygen/html/closed.png Binary files differnew file mode 100644 index 000000000..98cc2c909 --- /dev/null +++ b/libs/sort/doc/doxygen/html/closed.png diff --git a/libs/sort/doc/doxygen/html/constants_8hpp.html b/libs/sort/doc/doxygen/html/constants_8hpp.html new file mode 100644 index 000000000..38e1e40cf --- /dev/null +++ b/libs/sort/doc/doxygen/html/constants_8hpp.html @@ -0,0 +1,132 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/constants.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#enum-members">Enumerations</a> </div> + <div class="headertitle"> +<div class="title">constants.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p><a href="constants_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort_1_1detail"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">boost::sort::detail</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="enum-members"></a> +Enumerations</h2></td></tr> +<tr class="memitem:a7bbd2027f75936442318063f34953907"><td class="memItemLeft" align="right" valign="top">enum  </td><td class="memItemRight" valign="bottom">{ <br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a> = 11, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a> = max_splits + 1, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">boost::sort::detail::int_log_mean_bin_size</a> = 2, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">boost::sort::detail::int_log_min_split_count</a> = 9, +<br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">boost::sort::detail::int_log_finishing_count</a> = 31, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">boost::sort::detail::float_log_mean_bin_size</a> = 2, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">boost::sort::detail::float_log_min_split_count</a> = 8, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">boost::sort::detail::float_log_finishing_count</a> = 4, +<br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d">boost::sort::detail::min_sort_size</a> = 1000 +<br /> + }</td></tr> +<tr class="separator:a7bbd2027f75936442318063f34953907"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/constants_8hpp_source.html b/libs/sort/doc/doxygen/html/constants_8hpp_source.html new file mode 100644 index 000000000..ca60a95b7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/constants_8hpp_source.html @@ -0,0 +1,153 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/constants.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">constants.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="constants_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//constant definitions for the Boost Sort library</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_CONSTANTS</span></div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_CONSTANTS</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="namespaceboost.html"> 11</a></span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00012"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html"> 12</a></span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html"> 13</a></span> <span class="keyword">namespace </span>detail {</div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">//Tuning constants</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">//This should be tuned to your processor cache;</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">//if you go too large you get cache misses on bins</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">//The smaller this number, the less worst-case memory usage.</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">//If too small, too many recursions slow down spreadsort</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"> 19</a></span> <span class="keyword">enum</span> { <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> = 11,</div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">//It's better to have a few cache misses and finish sorting</span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">//than to run another iteration</span></div> +<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"> 22</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> + 1,</div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">//Sets the minimum number of items per bin.</span></div> +<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de"> 24</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a> = 2,</div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">//Used to force a comparison-based sorting for small bins, if it's faster.</span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">//Minimum value 1</span></div> +<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf"> 27</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a> = 9,</div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">//This is the minimum split count to use spreadsort when it will finish in one</span></div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//iteration. Make this larger the faster std::sort is relative to integer_sort.</span></div> +<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27"> 30</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a> = 31,</div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">//Sets the minimum number of items per bin for floating point.</span></div> +<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33"> 32</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a> = 2,</div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">//Used to force a comparison-based sorting for small bins, if it's faster.</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">//Minimum value 1</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c"> 35</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a> = 8,</div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">//This is the minimum split count to use spreadsort when it will finish in one</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">//iteration. Make this larger the faster std::sort is relative to float_sort.</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28"> 38</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a> = 4,</div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//There is a minimum size below which it is not worth using spreadsort</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d"> 40</a></span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d">min_sort_size</a> = 1000 };</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> }</div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> }</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> }</div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">boost::sort::detail::float_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:38</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">boost::sort::detail::int_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:30</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:22</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">boost::sort::detail::int_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d">boost::sort::detail::min_sort_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:40</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">boost::sort::detail::int_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:24</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">boost::sort::detail::float_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:35</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">boost::sort::detail::float_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:32</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp.html b/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp.html new file mode 100644 index 000000000..6ba5ab510 --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp.html @@ -0,0 +1,185 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/float_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">float_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <limits></code><br /> +<code>#include <functional></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/serialization/static_warning.hpp></code><br /> +<code>#include <boost/utility/enable_if.hpp></code><br /> +<code>#include <<a class="el" href="constants_8hpp_source.html">boost/sort/spreadsort/detail/constants.hpp</a>></code><br /> +<code>#include <<a class="el" href="detail_2integer__sort_8hpp_source.html">boost/sort/spreadsort/detail/integer_sort.hpp</a>></code><br /> +<code>#include <<a class="el" href="spreadsort__common_8hpp_source.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></code><br /> +<code>#include <boost/cstdint.hpp></code><br /> +</div> +<p><a href="detail_2float__sort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort_1_1detail"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">boost::sort::detail</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a8e8308c47bd14eff1c1d0f498289de35"><td class="memTemplParams" colspan="2">template<class Cast_type , class RandomAccessIter > </td></tr> +<tr class="memitem:a8e8308c47bd14eff1c1d0f498289de35"><td class="memTemplItemLeft" align="right" valign="top">Cast_type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">boost::sort::detail::cast_float_iter</a> (const RandomAccessIter &floatiter)</td></tr> +<tr class="separator:a8e8308c47bd14eff1c1d0f498289de35"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a8aaa1645892e6f6845455605b48a5d0e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a8aaa1645892e6f6845455605b48a5d0e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">boost::sort::detail::is_sorted_or_find_extremes</a> (RandomAccessIter current, RandomAccessIter last, Div_type &max, Div_type &min, Right_shift rshift)</td></tr> +<tr class="separator:a8aaa1645892e6f6845455605b48a5d0e"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type > </td></tr> +<tr class="memitem:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">boost::sort::detail::inner_float_swap_loop</a> (RandomAccessIter *bins, const RandomAccessIter &nextbinstart, unsigned ii, const unsigned log_divisor, const Div_type div_min)</td></tr> +<tr class="separator:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a18fb49752147ebb43503428568323d37"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type > </td></tr> +<tr class="memitem:a18fb49752147ebb43503428568323d37"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">boost::sort::detail::float_swap_loop</a> (RandomAccessIter *bins, RandomAccessIter &nextbinstart, unsigned ii, const size_t *bin_sizes, const unsigned log_divisor, const Div_type div_min)</td></tr> +<tr class="separator:a18fb49752147ebb43503428568323d37"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a75e908c58d77dce852027ea90c59ea8e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Cast_type > </td></tr> +<tr class="memitem:a75e908c58d77dce852027ea90c59ea8e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a75e908c58d77dce852027ea90c59ea8e">boost::sort::detail::is_sorted_or_find_extremes</a> (RandomAccessIter current, RandomAccessIter last, Cast_type &max, Cast_type &min)</td></tr> +<tr class="separator:a75e908c58d77dce852027ea90c59ea8e"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3b8a896e29139b047fb1886262d124ab"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a3b8a896e29139b047fb1886262d124ab"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">boost::sort::detail::positive_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a3b8a896e29139b047fb1886262d124ab"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">boost::sort::detail::negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:af7cc04cc70debc73a6bdbde6552b556c"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </td></tr> +<tr class="memitem:af7cc04cc70debc73a6bdbde6552b556c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#af7cc04cc70debc73a6bdbde6552b556c">boost::sort::detail::negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift)</td></tr> +<tr class="separator:af7cc04cc70debc73a6bdbde6552b556c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3936c51da0154af6003bc491b542fa12"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </td></tr> +<tr class="memitem:a3936c51da0154af6003bc491b542fa12"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a3936c51da0154af6003bc491b542fa12">boost::sort::detail::negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a3936c51da0154af6003bc491b542fa12"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">boost::sort::detail::float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </td></tr> +<tr class="memitem:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a85d8622f809c9c5ee535890de4aa9ff3">boost::sort::detail::float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift)</td></tr> +<tr class="separator:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </td></tr> +<tr class="memitem:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7b984ddce7638d78d26ea22cea08f2e7">boost::sort::detail::float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(boost::uint64_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#aa9667055e88a8492bac9cd1b14cc86e0">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a298f19036e85ffc74dbe92d2c26eae77"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a298f19036e85ffc74dbe92d2c26eae77"><td class="memTemplItemLeft" align="right" valign="top">boost::disable_if_c< (sizeof(boost::uint64_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)||sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type))&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a298f19036e85ffc74dbe92d2c26eae77">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:a298f19036e85ffc74dbe92d2c26eae77"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memTemplItemLeft" align="right" valign="top">void::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a22be02c948faa1f93e4dbb58b03b6e42">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift)</td></tr> +<tr class="separator:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a5e85811e357edf81ed621e25407b3256"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a5e85811e357edf81ed621e25407b3256"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(size_t)< sizeof(Div_type)&&sizeof(boost::uintmax_t) >=sizeof(Div_type), void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a5e85811e357edf81ed621e25407b3256">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift)</td></tr> +<tr class="separator:a5e85811e357edf81ed621e25407b3256"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </td></tr> +<tr class="memitem:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memTemplItemLeft" align="right" valign="top">void::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a23494fbb0eadd6a979f0b6c9fc19ea61">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad73450f75077d802111a93f66e24a4bc"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </td></tr> +<tr class="memitem:ad73450f75077d802111a93f66e24a4bc"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(size_t)< sizeof(Div_type)&&sizeof(boost::uintmax_t) >=sizeof(Div_type), void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad73450f75077d802111a93f66e24a4bc">boost::sort::detail::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:ad73450f75077d802111a93f66e24a4bc"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp_source.html new file mode 100644 index 000000000..181cd2c1d --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2float__sort_8hpp_source.html @@ -0,0 +1,922 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/float_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">float_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="detail_2float__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Details for templated Spreadsort-based float_sort.</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">float_mem_cast fix provided by:</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Scott McMurray</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_FLOAT_SORT_HPP</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_FLOAT_SORT_HPP</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <functional></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <boost/utility/enable_if.hpp></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <<a class="code" href="detail_2integer__sort_8hpp.html">boost/sort/spreadsort/detail/integer_sort.hpp</a>></span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">namespace </span>detail {</div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">//Casts a RandomAccessIter to the specified integer type</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">template</span><<span class="keyword">class</span> Cast_type, <span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">inline</span> Cast_type</div> +<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35"> 37</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">cast_float_iter</a>(<span class="keyword">const</span> RandomAccessIter & floatiter)</div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  {</div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  Data_type;</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">//Only cast IEEE floating-point numbers, and only to same-sized integers</span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(Cast_type) == <span class="keyword">sizeof</span>(Data_type));</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Data_type>::is_iec559);</div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Cast_type>::is_integer);</div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  Cast_type result;</div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  std::memcpy(&result, &(*floatiter), <span class="keyword">sizeof</span>(Data_type));</div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> result;</div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// maximum. Values are Right_shifted 0 bits before comparison.</span></div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> +<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e"> 54</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  Div_type & max, Div_type & min, Right_shift rshift)</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  min = max = rshift(*current, 0);</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  Div_type prev = min;</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">bool</span> sorted = <span class="keyword">true</span>;</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">while</span> (++current < last) {</div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  Div_type value = rshift(*current, 0);</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  sorted &= value >= prev;</div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  prev = value;</div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (max < value)</div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  max = value;</div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < min)</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  min = value;</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> sorted;</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">//Specialized swap loops for floating-point casting</span></div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> +<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3"> 74</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">inner_float_swap_loop</a>(RandomAccessIter * bins,</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> RandomAccessIter & nextbinstart, <span class="keywordtype">unsigned</span> ii</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  {</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  RandomAccessIter * local_bin = bins + ii;</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < nextbinstart;</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  ++current) {</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">for</span> (RandomAccessIter * target_bin =</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  (bins + ((cast_float_iter<Div_type, RandomAccessIter>(current) >></div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  log_divisor) - div_min)); target_bin != local_bin;</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  target_bin = bins + ((cast_float_iter<Div_type, RandomAccessIter></div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  (current) >> log_divisor) - div_min)) {</div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  RandomAccessIter b = (*target_bin)++;</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  RandomAccessIter * b_bin = bins + ((<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">cast_float_iter</a><Div_type,</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  RandomAccessIter>(b) >> log_divisor) - div_min);</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">//Three-way swap; if the item to be swapped doesn't belong in the</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">//current bin, swap it to where it belongs</span></div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  RandomAccessIter c = (*b_bin)++;</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  tmp = *c;</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  *c = *b;</div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  tmp = *b;</div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  *b = *current;</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  *current = tmp;</div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  *local_bin = nextbinstart;</div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> +<div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37"> 107</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">float_swap_loop</a>(RandomAccessIter * bins,</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  RandomAccessIter & nextbinstart, <span class="keywordtype">unsigned</span> ii,</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> *bin_sizes,</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  nextbinstart += bin_sizes[ii];</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  inner_float_swap_loop<RandomAccessIter, Div_type></div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  (bins, nextbinstart, ii, log_divisor, div_min);</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// maximum. Values are cast to Cast_type before comparison.</span></div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Cast_type></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> +<div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a75e908c58d77dce852027ea90c59ea8e"> 121</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  Cast_type & max, Cast_type & min)</div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  min = max = cast_float_iter<Cast_type, RandomAccessIter>(current);</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Cast_type prev = min;</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">bool</span> sorted = <span class="keyword">true</span>;</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">while</span> (++current < last) {</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  Cast_type value = cast_float_iter<Cast_type, RandomAccessIter>(current);</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  sorted &= value >= prev;</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  prev = value;</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">if</span> (max < value)</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  max = value;</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < min)</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  min = value;</div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> sorted;</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">//Special-case sorting of positive floats with casting</span></div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Size_type></div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab"> 142</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">positive_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  Div_type max, min;</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  max, min))</div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  current++) >> log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  bins[0] = first;</div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u)</div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  float_swap_loop<RandomAccessIter, Div_type></div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  (bins, nextbinstart, u, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  bins[bin_count - 1] = last;</div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++u) {</div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::sort(lastPos, bin_cache[u]);</div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  positive_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">//Sorting negative floats</span></div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">//Bins are iterated in reverse because max_neg_float = min_neg_int</span></div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Size_type></div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9"> 201</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  {</div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  Div_type max, min;</div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  max, min))</div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  current++) >> log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  bins[bin_count - 1] = first;</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  float_swap_loop<RandomAccessIter, Div_type></div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  (bins, nextbinstart, ii, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//Update the end position because we don't process the last bin</span></div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  bin_cache[cache_offset] = last;</div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  lastPos = bin_cache[ii], --ii) {</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  std::sort(lastPos, bin_cache[ii]);</div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  negative_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div> +<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div> +<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">//Sorting negative floats</span></div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">//Bins are iterated in reverse order because max_neg_float = min_neg_int</span></div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">class </span>Size_type></div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#af7cc04cc70debc73a6bdbde6552b556c"> 262</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  {</div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  Div_type max, min;</div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, rshift))</div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  bins[bin_count - 1] = first;</div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  swap_loop<RandomAccessIter, Div_type, Right_shift></div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  (bins, nextbinstart, ii, rshift, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">//Update the end position of the unprocessed last bin</span></div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  bin_cache[cache_offset] = last;</div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  lastPos = bin_cache[ii], --ii) {</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::sort(lastPos, bin_cache[ii]);</div> +<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> +<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  Size_type></div> +<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, rshift);</div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type></div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a3936c51da0154af6003bc491b542fa12"> 320</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset,</div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  {</div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  Div_type max, min;</div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, rshift))</div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div> +<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  bins[bin_count - 1] = first;</div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> +<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  swap_loop<RandomAccessIter, Div_type, Right_shift></div> +<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  (bins, nextbinstart, ii, rshift, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">//Update the end position of the unprocessed last bin</span></div> +<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  bin_cache[cache_offset] = last;</div> +<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div> +<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  lastPos = bin_cache[ii], --ii) {</div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  std::sort(lastPos, bin_cache[ii], comp);</div> +<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  Compare, Size_type>(lastPos, bin_cache[ii],</div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  bin_cache, cache_end,</div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div> +<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div> +<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div> +<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">//Casting special-case for floating-point sorting</span></div> +<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Size_type></div> +<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a"> 379</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div> +<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  Div_type max, min;</div> +<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> +<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  max, min))</div> +<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> +<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  current++) >> log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">//The index of the first positive bin</span></div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">//Must be divided small enough to fit into an integer</span></div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordtype">unsigned</span> first_positive = (div_min < 0) ? <span class="keywordtype">unsigned</span>(-div_min) : 0;</div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">//Resetting if all bins are negative</span></div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> +<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  first_positive = cache_end - cache_offset;</div> +<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">//Reversing the order of the negative bins</span></div> +<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> +<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> +<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> +<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> +<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  bins[first_positive - 1] = first;</div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  bins[ii] = first + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">//Handling positives following negatives</span></div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span> (first_positive < bin_count) {</div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  bins[first_positive] = first + bin_sizes[0];</div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  bin_sizes[first_positive] += bin_sizes[0];</div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  }</div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  bins[0] = first;</div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  bins[u + 1] = first + bin_sizes[u];</div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  bin_sizes[u + 1] += bin_sizes[u];</div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div> +<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> +<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  nextbinstart = first + bin_sizes[u];</div> +<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  inner_float_swap_loop<RandomAccessIter, Div_type></div> +<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  (bins, nextbinstart, u, log_divisor, div_min);</div> +<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> </div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">//Handling negative values first</span></div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  lastPos = bin_cache[ii--]) {</div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  std::sort(lastPos, bin_cache[ii]);</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  negative_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  std::sort(lastPos, bin_cache[u]);</div> +<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> +<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  positive_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div> +<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div> +<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div> +<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">//Functor implementation for recursive sorting</span></div> +<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift</div> +<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  , <span class="keyword">class </span>Size_type></div> +<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a85d8622f809c9c5ee535890de4aa9ff3"> 477</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div> +<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div> +<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  Div_type max, min;</div> +<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, rshift))</div> +<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div> +<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">//The index of the first positive bin</span></div> +<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordtype">unsigned</span> first_positive = (div_min < 0) ? <span class="keywordtype">unsigned</span>(-div_min) : 0;</div> +<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">//Resetting if all bins are negative</span></div> +<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> +<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  first_positive = cache_end - cache_offset;</div> +<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">//Reversing the order of the negative bins</span></div> +<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> +<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> +<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> +<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> +<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  bins[first_positive - 1] = first;</div> +<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> +<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  bins[ii] = first + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> +<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div> +<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">//Handling positives following negatives</span></div> +<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (static_cast<unsigned>(first_positive) < bin_count) {</div> +<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  bins[first_positive] = first + bin_sizes[0];</div> +<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  bin_sizes[first_positive] += bin_sizes[0];</div> +<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div> +<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div> +<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  bins[0] = first;</div> +<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> +<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  bins[u + 1] = first + bin_sizes[u];</div> +<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  bin_sizes[u + 1] += bin_sizes[u];</div> +<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div> +<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div> +<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> +<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  next_bin_start = first + bin_sizes[u];</div> +<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift></div> +<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  (bins, next_bin_start, u, rshift, log_divisor, div_min);</div> +<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div> +<div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div> +<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div> +<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">//Handling negative values first</span></div> +<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> +<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  lastPos = bin_cache[ii--]) {</div> +<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  std::sort(lastPos, bin_cache[ii]);</div> +<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> +<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type,</div> +<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  Right_shift, Size_type>(lastPos, bin_cache[ii], bin_cache,</div> +<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  cache_end, bin_sizes, rshift);</div> +<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div> +<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div> +<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> +<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  std::sort(lastPos, bin_cache[u]);</div> +<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> +<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Size_type,</div> +<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>></div> +<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift);</div> +<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  }</div> +<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div> +<div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div> +<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type></div> +<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00575"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7b984ddce7638d78d26ea22cea08f2e7"> 575</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset,</div> +<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div> +<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  Div_type max, min;</div> +<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, rshift))</div> +<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> +<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> +<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  Div_type div_min = min >> log_divisor;</div> +<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  Div_type div_max = max >> log_divisor;</div> +<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div> +<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">//The index of the first positive bin</span></div> +<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordtype">unsigned</span> first_positive = </div> +<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  (div_min < 0) ? static_cast<unsigned>(-div_min) : 0;</div> +<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">//Resetting if all bins are negative</span></div> +<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> +<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  first_positive = cache_end - cache_offset;</div> +<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">//Reversing the order of the negative bins</span></div> +<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> +<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> +<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> +<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> +<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  bins[first_positive - 1] = first;</div> +<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> +<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  bins[ii] = first + bin_sizes[ii + 1];</div> +<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> +<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  }</div> +<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">//Handling positives following negatives</span></div> +<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (static_cast<unsigned>(first_positive) < bin_count) {</div> +<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  bins[first_positive] = first + bin_sizes[0];</div> +<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  bin_sizes[first_positive] += bin_sizes[0];</div> +<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div> +<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div> +<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  bins[0] = first;</div> +<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> +<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  bins[u + 1] = first + bin_sizes[u];</div> +<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  bin_sizes[u + 1] += bin_sizes[u];</div> +<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div> +<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div> +<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> +<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  next_bin_start = first + bin_sizes[u];</div> +<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift></div> +<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  (bins, next_bin_start, u, rshift, log_divisor, div_min);</div> +<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  }</div> +<div class="line"><a name="l00630"></a><span class="lineno"> 630</span> </div> +<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> +<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div> +<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">//Handling negative values first</span></div> +<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> +<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> +<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> +<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  lastPos = bin_cache[ii--]) {</div> +<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> +<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  std::sort(lastPos, bin_cache[ii], comp);</div> +<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> +<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> +<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  Compare, Size_type>(lastPos, bin_cache[ii],</div> +<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  bin_cache, cache_end,</div> +<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div> +<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> </div> +<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> +<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  std::sort(lastPos, bin_cache[u], comp);</div> +<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> +<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  Size_type, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>></div> +<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div> +<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div> +<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div> +<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">//Checking whether the value type is a float, and trying a 32-bit integer</span></div> +<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> +<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> +<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  && std::numeric_limits<<span class="keyword">typename</span></div> +<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> +<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00679"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b"> 679</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  {</div> +<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  float_sort_rec<RandomAccessIter, boost::int32_t, boost::uint32_t></div> +<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  (first, last, bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  }</div> +<div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div> +<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">//Checking whether the value type is a double, and using a 64-bit integer</span></div> +<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(boost::uint64_t) ==</div> +<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> +<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  && std::numeric_limits<<span class="keyword">typename</span></div> +<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> +<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00694"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#aa9667055e88a8492bac9cd1b14cc86e0"> 694</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  {</div> +<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  float_sort_rec<RandomAccessIter, boost::int64_t, boost::uint64_t></div> +<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  (first, last, bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div> +<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div> +<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< (<span class="keyword">sizeof</span>(boost::uint64_t) ==</div> +<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> +<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  || <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> +<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type))</div> +<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  && std::numeric_limits<<span class="keyword">typename</span></div> +<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> +<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00710"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a298f19036e85ffc74dbe92d2c26eae77"> 710</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  {</div> +<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  BOOST_STATIC_WARNING(!(<span class="keyword">sizeof</span>(boost::uint64_t) ==</div> +<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> +<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  || <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> +<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type))</div> +<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  || !std::numeric_limits<<span class="keyword">typename</span></div> +<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559);</div> +<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  std::sort(first, last);</div> +<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div> +<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div> +<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">//These approaches require the user to do the typecast</span></div> +<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">//with rshift but default comparision</span></div> +<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< sizeof(size_t) >= <span class="keyword">sizeof</span>(Div_type),</div> +<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00726"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a22be02c948faa1f93e4dbb58b03b6e42"> 726</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  Right_shift rshift)</div> +<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  {</div> +<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  float_sort_rec<RandomAccessIter, Div_type, Right_shift, size_t></div> +<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  (first, last, bin_cache, 0, bin_sizes, rshift);</div> +<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div> +<div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div> +<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">//maximum integer size with rshift but default comparision</span></div> +<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(size_t) < <span class="keyword">sizeof</span>(Div_type)</div> +<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  && <span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00739"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a5e85811e357edf81ed621e25407b3256"> 739</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  Right_shift rshift)</div> +<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  {</div> +<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  float_sort_rec<RandomAccessIter, Div_type, Right_shift, boost::uintmax_t></div> +<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  (first, last, bin_cache, 0, bin_sizes, rshift);</div> +<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  }</div> +<div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div> +<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">//sizeof(Div_type) doesn't match, so use std::sort</span></div> +<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< sizeof(boost::uintmax_t) >=</div> +<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  Right_shift rshift)</div> +<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  {</div> +<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  BOOST_STATIC_WARNING(<span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type));</div> +<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::sort(first, last);</div> +<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div> +<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div> +<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">//specialized comparison</span></div> +<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< sizeof(size_t) >= <span class="keyword">sizeof</span>(Div_type),</div> +<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00764"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a23494fbb0eadd6a979f0b6c9fc19ea61"> 764</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div> +<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a><RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keywordtype">size_t</span>></div> +<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  (first, last, bin_cache, 0, bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div> +<div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div> +<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">//max-sized integer with specialized comparison</span></div> +<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(size_t) < <span class="keyword">sizeof</span>(Div_type)</div> +<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  && <span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad73450f75077d802111a93f66e24a4bc"> 779</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  {</div> +<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> +<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a><RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  boost::uintmax_t></div> +<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  (first, last, bin_cache, 0, bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  }</div> +<div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div> +<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">//sizeof(Div_type) doesn't match, so use std::sort</span></div> +<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< sizeof(boost::uintmax_t) >=</div> +<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  {</div> +<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  BOOST_STATIC_WARNING(<span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type));</div> +<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div> +<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div> +<div class="line"><a name="l00801"></a><span class="lineno"> 801</span> }</div> +<div class="line"><a name="l00802"></a><span class="lineno"> 802</span> }</div> +<div class="line"><a name="l00803"></a><span class="lineno"> 803</span> </div> +<div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a1faa4283ebb64ba23c4a73c1c0a6548a"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">boost::sort::detail::float_sort_rec</a></div><div class="ttdeci">void float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:379</div></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a8e8308c47bd14eff1c1d0f498289de35"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">boost::sort::detail::cast_float_iter</a></div><div class="ttdeci">Cast_type cast_float_iter(const RandomAccessIter &floatiter)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:37</div></div> +<div class="ttc" id="detail_2integer__sort_8hpp_html"><div class="ttname"><a href="detail_2integer__sort_8hpp.html">integer_sort.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">boost::sort::detail::float_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:38</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ac04e982cc9f6bcc101f6af6bcd7b36b3"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">boost::sort::detail::inner_float_swap_loop</a></div><div class="ttdeci">void inner_float_swap_loop(RandomAccessIter *bins, const RandomAccessIter &nextbinstart, unsigned ii, const unsigned log_divisor, const Div_type div_min)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:74</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a4ba5c57512d16f300c08b7a6b4e6ff23"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a></div><div class="ttdeci">size_t get_min_count(unsigned log_range)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:51</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div> +<div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a18fb49752147ebb43503428568323d37"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">boost::sort::detail::float_swap_loop</a></div><div class="ttdeci">void float_swap_loop(RandomAccessIter *bins, RandomAccessIter &nextbinstart, unsigned ii, const size_t *bin_sizes, const unsigned log_divisor, const Div_type div_min)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:107</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a852a51cde62aa67347cb9b4a7350bbac"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a></div><div class="ttdeci">unsigned rough_log_2_size(const T &input)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:34</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a8aaa1645892e6f6845455605b48a5d0e"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">boost::sort::detail::is_sorted_or_find_extremes</a></div><div class="ttdeci">bool is_sorted_or_find_extremes(RandomAccessIter current, RandomAccessIter last, Div_type &max, Div_type &min, Right_shift rshift)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:54</div></div> +<div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">boost::sort::detail::float_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:35</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">boost::sort::detail::float_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:32</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a6b85a606f35ef97e23c7f8aed1c655b9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">boost::sort::detail::negative_float_sort_rec</a></div><div class="ttdeci">void negative_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:201</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a3b8a896e29139b047fb1886262d124ab"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">boost::sort::detail::positive_float_sort_rec</a></div><div class="ttdeci">void positive_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:142</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_aaa66aec0efcc4f4a7f5584886e93444b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">boost::sort::detail::float_sort</a></div><div class="ttdeci">boost::enable_if_c< sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type float_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:679</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp.html b/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp.html new file mode 100644 index 000000000..440b0843a --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp.html @@ -0,0 +1,111 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/integer_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">integer_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <limits></code><br /> +<code>#include <functional></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/serialization/static_warning.hpp></code><br /> +<code>#include <boost/utility/enable_if.hpp></code><br /> +<code>#include <<a class="el" href="constants_8hpp_source.html">boost/sort/spreadsort/detail/constants.hpp</a>></code><br /> +<code>#include <<a class="el" href="spreadsort__common_8hpp_source.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></code><br /> +<code>#include <boost/cstdint.hpp></code><br /> +</div> +<p><a href="detail_2integer__sort_8hpp_source.html">Go to the source code of this file.</a></p> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp_source.html new file mode 100644 index 000000000..46765a175 --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2integer__sort_8hpp_source.html @@ -0,0 +1,608 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/integer_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">integer_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="detail_2integer__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Details for templated Spreadsort-based integer_sort.</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_INTEGER_SORT_HPP</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_INTEGER_SORT_HPP</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <functional></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/utility/enable_if.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"></span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">//! \cond DETAIL</span></div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"></span></div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">namespace </span>detail {</div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// maximum using <.</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  RandomAccessIter & max, RandomAccessIter & min)</div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  min = max = current;</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">//This assumes we have more than 1 element based on prior checks.</span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">while</span> (!(*(current + 1) < *current)) {</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">//If everything is in sorted order, return</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (++current == last - 1)</div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">//The maximum is the last sorted element</span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  max = current;</div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//Start from the first unsorted element</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">while</span> (++current < last) {</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (*max < *current)</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  max = current;</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*current < *min)</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  min = current;</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// maximum.</span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// Use a user-defined comparison operator</span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Compare></div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  RandomAccessIter & max, RandomAccessIter & min, Compare comp)</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  min = max = current;</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">while</span> (!comp(*(current + 1), *current)) {</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">//If everything is in sorted order, return</span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (++current == last - 1)</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//The maximum is the last sorted element</span></div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  max = current;</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">while</span> (++current < last) {</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (comp(*max, *current))</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  max = current;</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (comp(*current, *min))</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  min = current;</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">//Gets a non-negative right bit shift to operate as a logarithmic divisor</span></div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">template</span><<span class="keywordtype">unsigned</span> log_mean_bin_size></div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">inline</span> <span class="keywordtype">int</span></div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  get_log_divisor(<span class="keywordtype">size_t</span> count, <span class="keywordtype">int</span> log_range)</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">int</span> log_divisor;</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//If we can finish in one iteration without exceeding either</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">//(2 to the max_finishing_splits) or n bins, do so</span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> ((log_divisor = log_range - <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(count)) <= 0 &&</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  log_range <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>)</div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  log_divisor = 0;</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">//otherwise divide the data into an optimized number of pieces</span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  log_divisor += log_mean_bin_size;</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">//Cannot exceed max_splits or cache misses slow down bin lookups</span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> ((log_range - log_divisor) > <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>)</div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  log_divisor = log_range - <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>;</div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> log_divisor;</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">//Implementation for recursive integer sorting</span></div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Size_type></div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">//This step is roughly 10% of runtime, but it helps avoid worst-case</span></div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">//behavior and improve behavior with real data</span></div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">//If you know the maximum and minimum ahead of time, you can pass those</span></div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">//values in and skip this step for the first iteration</span></div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  RandomAccessIter max, min;</div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min))</div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<int_log_mean_bin_size>(</div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type((*max >> 0) - (*min >> 0))));</div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  Div_type div_min = *min >> log_divisor;</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Div_type div_max = *max >> log_divisor;</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  RandomAccessIter * bins =</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  bin_sizes[<span class="keywordtype">size_t</span>((*(current++) >> log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  bins[0] = first;</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u) {</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  RandomAccessIter * local_bin = bins + u;</div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  nextbinstart += bin_sizes[u];</div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < nextbinstart;</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  ++current) {</div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">//Swapping elements in current into place until the correct</span></div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">//element has been swapped in</span></div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span> (target_bin = (bins + ((*current >> log_divisor) - div_min));</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  target_bin = bins + ((*current >> log_divisor) - div_min)) {</div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">//3-way swap; this is about 1% faster than a 2-way swap</span></div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">//The main advantage is less copies are involved per item</span></div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">//put in the correct place</span></div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  RandomAccessIter b = (*target_bin)++;</div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  RandomAccessIter * b_bin = bins + ((*b >> log_divisor) - div_min);</div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  RandomAccessIter c = (*b_bin)++;</div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  tmp = *c;</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  *c = *b;</div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  tmp = *b;</div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  *b = *current;</div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  *current = tmp;</div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  *local_bin = nextbinstart;</div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  bins[bin_count - 1] = last;</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">//If we've bucketsorted, the array is sorted and we should skip recursion</span></div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">//log_divisor is the remaining range; calculating the comparison threshold</span></div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">size_t</span> max_count =</div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>>(log_divisor);</div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++u) {</div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  Size_type count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  std::sort(lastPos, bin_cache[u]);</div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  spreadsort_rec<RandomAccessIter, Div_type, Size_type>(lastPos,</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  bin_cache[u],</div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  bin_cache,</div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  cache_end,</div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  bin_sizes);</div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">//Generic bitshift-based 3-way swapping code</span></div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> inner_swap_loop(RandomAccessIter * bins,</div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> RandomAccessIter & next_bin_start, <span class="keywordtype">unsigned</span> ii, Right_shift &rshift</div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  RandomAccessIter * local_bin = bins + ii;</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  ++current) {</div> +<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">for</span> (RandomAccessIter * target_bin =</div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  (bins + (rshift(*current, log_divisor) - div_min));</div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  target_bin = bins + (rshift(*current, log_divisor) - div_min)) {</div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  RandomAccessIter b = (*target_bin)++;</div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  RandomAccessIter * b_bin =</div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  bins + (rshift(*b, log_divisor) - div_min);</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">//Three-way swap; if the item to be swapped doesn't belong</span></div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">//in the current bin, swap it to where it belongs</span></div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  RandomAccessIter c = (*b_bin)++;</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  tmp = *c;</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  *c = *b;</div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">//Note: we could increment current once the swap is done in this case</span></div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">//but that seems to impair performance</span></div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  tmp = *b;</div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  *b = *current;</div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  *current = tmp;</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">//Standard swapping wrapper for ascending values</span></div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> swap_loop(RandomAccessIter * bins,</div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  RandomAccessIter & next_bin_start, <span class="keywordtype">unsigned</span> ii, Right_shift &rshift</div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  , <span class="keyword">const</span> <span class="keywordtype">size_t</span> *bin_sizes</div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  next_bin_start += bin_sizes[ii];</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift>(bins,</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  next_bin_start, ii, rshift, log_divisor, div_min);</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">//Functor implementation for recursive sorting</span></div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type, <span class="keywordtype">unsigned</span> log_mean_bin_size,</div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  {</div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  RandomAccessIter max, min;</div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, comp))</div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<log_mean_bin_size>(last - first,</div> +<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(rshift(*max, 0) - rshift(*min, 0))));</div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  Div_type div_min = rshift(*min, log_divisor);</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  Div_type div_max = rshift(*max, log_divisor);</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  bins[0] = first;</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u)</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  swap_loop<RandomAccessIter, Div_type, Right_shift>(bins, next_bin_start,</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  u, rshift, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  bins[bin_count - 1] = last;</div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div> +<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">//If we've bucketsorted, the array is sorted</span></div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><log_mean_bin_size, log_min_split_count,</div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  log_finishing_count>(log_divisor);</div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  ++u) {</div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  std::sort(lastPos, bin_cache[u], comp);</div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  Size_type, log_mean_bin_size, log_min_split_count, log_finishing_count></div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift, comp);</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">//Functor implementation for recursive sorting with only Shift overridden</span></div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">class </span>Size_type, <span class="keywordtype">unsigned</span> log_mean_bin_size,</div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div> +<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> +<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  {</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  RandomAccessIter max, min;</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min))</div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<log_mean_bin_size>(last - first,</div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(rshift(*max, 0) - rshift(*min, 0))));</div> +<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  Div_type div_min = rshift(*min, log_divisor);</div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  Div_type div_max = rshift(*max, log_divisor);</div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> +<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  cache_end, bin_count);</div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">//Calculating the size of each bin</span></div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  bins[0] = first;</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  RandomAccessIter nextbinstart = first;</div> +<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> ii = 0; ii < bin_count - 1; ++ii)</div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  swap_loop<RandomAccessIter, Div_type, Right_shift>(bins, nextbinstart,</div> +<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  ii, rshift, bin_sizes, log_divisor, div_min);</div> +<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  bins[bin_count - 1] = last;</div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">//If we've bucketsorted, the array is sorted</span></div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">if</span> (!log_divisor)</div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><log_mean_bin_size, log_min_split_count,</div> +<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  log_finishing_count>(log_divisor);</div> +<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div> +<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  ++u) {</div> +<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (count < max_count)</div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  std::sort(lastPos, bin_cache[u]);</div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Size_type,</div> +<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  log_mean_bin_size, log_min_split_count, log_finishing_count>(lastPos,</div> +<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  bin_cache[u], bin_cache, cache_end, bin_sizes, rshift);</div> +<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div> +<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div> +<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div> +<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div> +<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  {</div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  spreadsort_rec<RandomAccessIter, Div_type, size_t>(first, last,</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div> +<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div> +<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> +<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div> +<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div> +<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  spreadsort_rec<RandomAccessIter, Div_type, boost::uintmax_t>(first,</div> +<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  last, bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> +<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div> +<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div> +<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  {</div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div> +<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::sort(first, last);</div> +<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div> +<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div> +<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">//Same for the full functor version</span></div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div> +<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div> +<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  Right_shift shift, Compare comp)</div> +<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  {</div> +<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  size_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  (first, last, bin_cache, 0, bin_sizes, shift, comp);</div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  Right_shift shift, Compare comp)</div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  {</div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div> +<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  boost::uintmax_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div> +<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  (first, last, bin_cache, 0, bin_sizes, shift, comp);</div> +<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div> +<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div> +<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div> +<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  Right_shift shift, Compare comp)</div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  {</div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div> +<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">//Same for the right shift version</span></div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  Right_shift shift)</div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  {</div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, size_t,</div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  (first, last, bin_cache, 0, bin_sizes, shift);</div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div> +<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div> +<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  Right_shift shift)</div> +<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  {</div> +<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div> +<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift,</div> +<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  boost::uintmax_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>,</div> +<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div> +<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  (first, last, bin_cache, 0, bin_sizes, shift);</div> +<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div> +<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div> +<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div> +<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div> +<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> +<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  Right_shift shift)</div> +<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div> +<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div> +<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div> +<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  std::sort(first, last);</div> +<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div> +<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div> +<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> }</div> +<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> }<span class="comment"></span></div> +<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment">//! \endcond</span></div> +<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"></span></div> +<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div> +<div class="ttc" id="namespaceboost_1_1sort_html_ae6ffbcf932699589fd2b93879f209013"><div class="ttname"><a href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort::integer_sort</a></div><div class="ttdeci">void integer_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">Integer sort algorithm using random access iterators. (All variants fall back to std::sort if the dat...</div><div class="ttdef"><b>Definition:</b> integer_sort.hpp:78</div></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">boost::sort::detail::int_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:30</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:22</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a4ba5c57512d16f300c08b7a6b4e6ff23"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a></div><div class="ttdeci">size_t get_min_count(unsigned log_range)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:51</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">boost::sort::detail::int_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div> +<div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a852a51cde62aa67347cb9b4a7350bbac"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a></div><div class="ttdeci">unsigned rough_log_2_size(const T &input)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:34</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a8aaa1645892e6f6845455605b48a5d0e"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">boost::sort::detail::is_sorted_or_find_extremes</a></div><div class="ttdeci">bool is_sorted_or_find_extremes(RandomAccessIter current, RandomAccessIter last, Div_type &max, Div_type &min, Right_shift rshift)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:54</div></div> +<div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">boost::sort::detail::int_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:24</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp.html b/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp.html new file mode 100644 index 000000000..9bbbbfc6a --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp.html @@ -0,0 +1,159 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/string_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">string_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <limits></code><br /> +<code>#include <functional></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/serialization/static_warning.hpp></code><br /> +<code>#include <boost/utility/enable_if.hpp></code><br /> +<code>#include <<a class="el" href="constants_8hpp_source.html">boost/sort/spreadsort/detail/constants.hpp</a>></code><br /> +<code>#include <<a class="el" href="spreadsort__common_8hpp_source.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></code><br /> +<code>#include <boost/cstdint.hpp></code><br /> +</div> +<p><a href="detail_2string__sort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type ></a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type ></a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort_1_1detail"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">boost::sort::detail</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a585497946eeb8cc1d2072642d7f1da01"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a585497946eeb8cc1d2072642d7f1da01"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">boost::sort::detail::update_offset</a> (RandomAccessIter first, RandomAccessIter finish, size_t &char_offset)</td></tr> +<tr class="separator:a585497946eeb8cc1d2072642d7f1da01"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length > </td></tr> +<tr class="memitem:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a415ebdb0c9a5e9209bbfc7d2e576374c">boost::sort::detail::update_offset</a> (RandomAccessIter first, RandomAccessIter finish, size_t &char_offset, Get_char getchar, Get_length length)</td></tr> +<tr class="separator:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">boost::sort::detail::string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a66be693262defeff06a4a3507155d4a3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a66be693262defeff06a4a3507155d4a3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">boost::sort::detail::reverse_string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a66be693262defeff06a4a3507155d4a3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:af825e4484173e0b886d0b24f66ae4a64"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length > </td></tr> +<tr class="memitem:af825e4484173e0b886d0b24f66ae4a64"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#af825e4484173e0b886d0b24f66ae4a64">boost::sort::detail::string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length)</td></tr> +<tr class="separator:af825e4484173e0b886d0b24f66ae4a64"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a49ccfc022cfef8a14bbbbeccd36d78ec">boost::sort::detail::string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="separator:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ab71cd7c25eada649fa1aff16fb3549f6">boost::sort::detail::reverse_string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="separator:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp_source.html new file mode 100644 index 000000000..e43465912 --- /dev/null +++ b/libs/sort/doc/doxygen/html/detail_2string__sort_8hpp_source.html @@ -0,0 +1,939 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/string_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">string_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="detail_2string__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Details for a templated general-case hybrid-radix string_sort.</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_HPP</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_HPP</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <functional></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/utility/enable_if.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">namespace </span>detail {</div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> max_step_size = 64;</div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">//Offsetting on identical characters. This function works a chunk of</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">//characters at a time for cache efficiency and optimal worst-case</span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">//performance.</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">template</span><<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01"> 39</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(RandomAccessIter first, RandomAccessIter finish,</div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">size_t</span> &char_offset)</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  {</div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> char_size = <span class="keyword">sizeof</span>(Unsigned_char_type);</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">size_t</span> nextOffset = char_offset;</div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordtype">int</span> step_size = max_step_size;</div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  RandomAccessIter curr = first;</div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">do</span> {</div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">//Ignore empties, but if the nextOffset would exceed the length or</span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">//not match, exit; we've found the last matching character</span></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//This will reduce the step_size if the current step doesn't match.</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> ((*curr).size() > char_offset) {</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span>((*curr).size() <= (nextOffset + step_size)) {</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  step_size = (*curr).size() - nextOffset - 1;</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (step_size < 1) {</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  char_offset = nextOffset;</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> step_byte_size = step_size * char_size;</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (memcmp(curr->data() + nextOffset, first->data() + nextOffset, </div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  step_byte_size) != 0) {</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (step_size == 1) {</div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  char_offset = nextOffset;</div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  step_size = (step_size > 4) ? 4 : 1;</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  ++curr;</div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  } <span class="keywordflow">while</span> (curr != finish);</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  nextOffset += step_size;</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">//Offsetting on identical characters. This function works a character</span></div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">//at a time for optimal worst-case performance.</span></div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">template</span><<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Get_<span class="keywordtype">char</span>, <span class="keyword">class</span> Get_length></div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a415ebdb0c9a5e9209bbfc7d2e576374c"> 80</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(RandomAccessIter first, RandomAccessIter finish,</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">size_t</span> &char_offset, Get_char getchar, Get_length length)</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">size_t</span> nextOffset = char_offset;</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  RandomAccessIter curr = first;</div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">do</span> {</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">//ignore empties, but if the nextOffset would exceed the length or</span></div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">//not match, exit; we've found the last matching character</span></div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (length(*curr) > char_offset && (length(*curr) <= (nextOffset + 1)</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  || getchar((*curr), nextOffset) != getchar((*first), nextOffset))) {</div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  char_offset = nextOffset;</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  } <span class="keywordflow">while</span> (++curr != finish);</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  ++nextOffset;</div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">//This comparison functor assumes strings are identical up to char_offset</span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html"> 101</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a> {</div> +<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91"> 102</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">offset_less_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>(char_offset){}</div> +<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06"> 103</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keyword"> </span>{</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(x.size(), y.size());</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>; u < minSize; ++u) {</div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(x[u]) == <span class="keyword">sizeof</span>(Unsigned_char_type));</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (static_cast<Unsigned_char_type>(x[u]) !=</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  static_cast<Unsigned_char_type>(y[u])) {</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>(x[u]) < </div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  static_cast<Unsigned_char_type>(y[u]);</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> x.size() < y.size();</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div> +<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac"> 116</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>;</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  };</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">//Compares strings assuming they are identical up to char_offset</span></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html"> 121</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a> {</div> +<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa"> 122</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">offset_greater_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>(char_offset){}</div> +<div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73"> 123</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="keyword"> </span>{</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(x.size(), y.size());</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>; u < minSize; ++u) {</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(x[u]) == <span class="keyword">sizeof</span>(Unsigned_char_type));</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">if</span> (static_cast<Unsigned_char_type>(x[u]) !=</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  static_cast<Unsigned_char_type>(y[u])) {</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>(x[u]) > </div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  static_cast<Unsigned_char_type>(y[u]);</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> x.size() > y.size();</div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div> +<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243"> 136</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>;</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  };</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">//This comparison functor assumes strings are identical up to char_offset</span></div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Get_<span class="keywordtype">char</span>, <span class="keyword">class</span> Get_length></div> +<div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html"> 141</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a> {</div> +<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007"> 142</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">offset_char_less_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>(char_offset){}</div> +<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3"> 143</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keyword"> </span>{</div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(<a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(x), <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(y));</div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>; u < minSize; ++u) {</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (<a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(x, u) != <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(y, u)) {</div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(x, u) < <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(y, u);</div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(x) < <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(y);</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div> +<div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2"> 153</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>;</div> +<div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30"> 154</a></span>  Get_char <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>;</div> +<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936"> 155</a></span>  Get_length <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>;</div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  };</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">//String sorting recursive implementation</span></div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba"> 161</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordtype">size_t</span> char_offset,</div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  Data_type;</div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">//with a mild average performance impact.</span></div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">while</span> ((*first).size() <= char_offset) {</div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (++first == last)</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  RandomAccessIter finish = last - 1;</div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">//Getting the last non-empty</span></div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (;(*finish).size() <= char_offset; --finish);</div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  ++finish;</div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">//a few characters at a time for optimal worst-case performance.</span></div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  update_offset<RandomAccessIter, Unsigned_char_type>(first, finish,</div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  char_offset);</div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  cache_end, membin_count) + 1;</div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> ((*current).size() <= char_offset) {</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  bin_sizes[0]++;</div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  bin_sizes[<span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset])</div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  + 1]++;</div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  bin_cache[cache_offset] = first;</div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  bin_cache[cache_offset + u + 1] =</div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">//handling empty bins</span></div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> +<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  next_bin_start += bin_sizes[0];</div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  ++current) {</div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">//empties belong in this bin</span></div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">while</span> ((*current).size() > char_offset) {</div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  target_bin =</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  bins + <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]);</div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">//this saves iterations in multiple loops</span></div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  local_bin = bins + u;</div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  next_bin_start += bin_sizes[u + 1];</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  ++current) {</div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">for</span> (target_bin = bins + static_cast<Unsigned_char_type></div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  ((*current)[char_offset]); target_bin != local_bin;</div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  target_bin = bins + <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span></div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  ((*current)[char_offset])) iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  bins[last_bin] = last;</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">//Skip this loop for empties</span></div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (count < max_size)</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  std::sort(lastPos, bin_cache[u],</div> +<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than<Data_type, Unsigned_char_type></a>(char_offset + 1));</div> +<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  string_sort_rec<RandomAccessIter, Unsigned_char_type>(lastPos,</div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div> +<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">//Sorts strings in reverse order, with empties at the end</span></div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3"> 266</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordtype">size_t</span> char_offset,</div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">unsigned</span> cache_offset,</div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">size_t</span> *bin_sizes)</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  {</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  Data_type;</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">//with a mild average performance impact.</span></div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  RandomAccessIter curr = first;</div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">while</span> ((*curr).size() <= char_offset) {</div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (++curr == last)</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">//Getting the last non-empty</span></div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">while</span> ((*(--last)).size() <= char_offset);</div> +<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  ++last;</div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">//a few characters at a time for optimal worst-case performance.</span></div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  update_offset<RandomAccessIter, Unsigned_char_type>(first, last,</div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  char_offset);</div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">//Equal worst-case of radix and comparison when bin_count = n*log(n).</span></div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_bin = bin_count - 1;</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  cache_end, membin_count);</div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  RandomAccessIter * end_bin = &(bin_cache[cache_offset + max_bin]);</div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div> +<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> ((*current).size() <= char_offset) {</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  bin_sizes[bin_count]++;</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  bin_sizes[max_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span></div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  ((*current)[char_offset])]++;</div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div> +<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  bin_cache[cache_offset] = first;</div> +<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> +<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  bin_cache[cache_offset + u + 1] =</div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  RandomAccessIter next_bin_start = last;</div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">//handling empty bins</span></div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset + bin_count]);</div> +<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  RandomAccessIter lastFull = *local_bin;</div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  ++current) {</div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">//empties belong in this bin</span></div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">while</span> ((*current).size() > char_offset) {</div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  target_bin =</div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  end_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]);</div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  next_bin_start = first;</div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">//iterate backwards to find the last non-empty bin</span></div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">//this saves iterations in multiple loops</span></div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordtype">unsigned</span> last_bin = max_bin;</div> +<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin]; --last_bin);</div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> +<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  local_bin = bins + u;</div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  next_bin_start += bin_sizes[u];</div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  ++current) {</div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">for</span> (target_bin =</div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  end_bin - static_cast<Unsigned_char_type>((*current)[char_offset]);</div> +<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  target_bin =</div> +<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  end_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]))</div> +<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div> +<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  bins[last_bin] = lastFull;</div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">//Skip this loop for empties</span></div> +<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u <= cache_offset + last_bin;</div> +<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (count < max_size)</div> +<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  std::sort(lastPos, bin_cache[u], <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a><Data_type,</div> +<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  Unsigned_char_type>(char_offset + 1));</div> +<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  reverse_string_sort_rec<RandomAccessIter, Unsigned_char_type></div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);</div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div> +<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">//String sorting recursive implementation</span></div> +<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> +<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">class </span>Get_length></div> +<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#af825e4484173e0b886d0b24f66ae4a64"> 378</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  Get_char getchar, Get_length length)</div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div> +<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> +<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  Data_type;</div> +<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> +<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">//with a mild average performance impact.</span></div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">while</span> (length(*first) <= char_offset) {</div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (++first == last)</div> +<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div> +<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  RandomAccessIter finish = last - 1;</div> +<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">//Getting the last non-empty</span></div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">for</span> (;length(*finish) <= char_offset; --finish);</div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  ++finish;</div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(first, finish, char_offset, getchar, length);</div> +<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div> +<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> +<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> +<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  cache_end, membin_count) + 1;</div> +<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div> +<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> +<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> +<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  bin_sizes[0]++;</div> +<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div> +<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  bin_sizes[getchar((*current), char_offset) + 1]++;</div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  bin_cache[cache_offset] = first;</div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  bin_cache[cache_offset + u + 1] =</div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="comment">//handling empty bins</span></div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  next_bin_start += bin_sizes[0];</div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  ++current) {</div> +<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">//empties belong in this bin</span></div> +<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> +<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  target_bin = bins + getchar((*current), char_offset);</div> +<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div> +<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div> +<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">//this saves iterations in multiple loops</span></div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> ii = 0; ii < last_bin; ++ii) {</div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  local_bin = bins + ii;</div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  next_bin_start += bin_sizes[ii + 1];</div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ++current) {</div> +<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (target_bin = bins + getchar((*current), char_offset);</div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  target_bin = bins + getchar((*current), char_offset))</div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  }</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  bins[last_bin] = last;</div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">//Skip this loop for empties</span></div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">if</span> (count < max_size)</div> +<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  std::sort(lastPos, bin_cache[u], <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a><Data_type,</div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  Get_char, Get_length>(char_offset + 1));</div> +<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> +<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  Get_length>(lastPos, bin_cache[u], char_offset + 1, bin_cache,</div> +<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  cache_end, bin_sizes, getchar, length);</div> +<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div> +<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div> +<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div> +<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">//String sorting recursive implementation</span></div> +<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> +<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">class </span>Get_length, <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00481"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a49ccfc022cfef8a14bbbbeccd36d78ec"> 481</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> +<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  Get_char getchar, Get_length length, Compare comp)</div> +<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div> +<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> +<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">//with a mild average performance impact.</span></div> +<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> +<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">while</span> (length(*first) <= char_offset) {</div> +<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">if</span> (++first == last)</div> +<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  }</div> +<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  RandomAccessIter finish = last - 1;</div> +<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">//Getting the last non-empty</span></div> +<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">for</span> (;length(*finish) <= char_offset; --finish);</div> +<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  ++finish;</div> +<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(first, finish, char_offset, getchar, length);</div> +<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div> +<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> +<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> +<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> +<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> +<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  cache_end, membin_count) + 1;</div> +<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div> +<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> +<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> +<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  bin_sizes[0]++;</div> +<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div> +<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  bin_sizes[getchar((*current), char_offset) + 1]++;</div> +<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div> +<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  bin_cache[cache_offset] = first;</div> +<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> +<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  bin_cache[cache_offset + u + 1] =</div> +<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> +<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> </div> +<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  RandomAccessIter next_bin_start = first;</div> +<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">//handling empty bins</span></div> +<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> +<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  next_bin_start += bin_sizes[0];</div> +<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> +<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  ++current) {</div> +<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">//empties belong in this bin</span></div> +<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> +<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  target_bin = bins + getchar((*current), char_offset);</div> +<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div> +<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div> +<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> +<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">//this saves iterations in multiple loops</span></div> +<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> +<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> +<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> +<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  local_bin = bins + u;</div> +<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  next_bin_start += bin_sizes[u + 1];</div> +<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  ++current) {</div> +<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> +<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (target_bin = bins + getchar((*current), char_offset);</div> +<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  target_bin = bins + getchar((*current), char_offset))</div> +<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div> +<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div> +<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  bins[last_bin] = last;</div> +<div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div> +<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> +<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">//Skip this loop for empties</span></div> +<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> +<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (count < max_size)</div> +<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  std::sort(lastPos, bin_cache[u], comp);</div> +<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> +<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  Get_length, Compare></div> +<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end,</div> +<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  bin_sizes, getchar, length, comp);</div> +<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div> +<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div> +<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div> +<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">//Sorts strings in reverse order, with empties at the end</span></div> +<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> +<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">class </span>Get_length, <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> +<div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ab71cd7c25eada649fa1aff16fb3549f6"> 582</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> +<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> +<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  Get_char getchar, Get_length length, Compare comp)</div> +<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  {</div> +<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> +<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">//with a mild average performance impact.</span></div> +<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  RandomAccessIter curr = first;</div> +<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> +<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">while</span> (length(*curr) <= char_offset) {</div> +<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">if</span> (++curr == last)</div> +<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div> +<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">//Getting the last non-empty</span></div> +<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">while</span> (length(*(--last)) <= char_offset);</div> +<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  ++last;</div> +<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> +<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">//a character at a time for optimal worst-case performance.</span></div> +<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(curr, last, char_offset, getchar, length);</div> +<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div> +<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> +<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> +<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> +<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> +<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_bin = bin_count - 1;</div> +<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">unsigned</span> cache_end;</div> +<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> +<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  cache_end, membin_count);</div> +<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  RandomAccessIter *end_bin = &(bin_cache[cache_offset + max_bin]);</div> +<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div> +<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> +<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> +<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> +<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  bin_sizes[bin_count]++;</div> +<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div> +<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  bin_sizes[max_bin - getchar((*current), char_offset)]++;</div> +<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div> +<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">//Assign the bin positions</span></div> +<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  bin_cache[cache_offset] = first;</div> +<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> +<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  bin_cache[cache_offset + u + 1] =</div> +<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> +<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div> +<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">//Swap into place</span></div> +<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  RandomAccessIter next_bin_start = last;</div> +<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">//handling empty bins</span></div> +<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset + bin_count]);</div> +<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  RandomAccessIter lastFull = *local_bin;</div> +<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  RandomAccessIter * target_bin;</div> +<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> +<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  ++current) {</div> +<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">//empties belong in this bin</span></div> +<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> +<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  target_bin = end_bin - getchar((*current), char_offset);</div> +<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div> +<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div> +<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  next_bin_start = first;</div> +<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> +<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">//this saves iterations in multiple loops</span></div> +<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordtype">unsigned</span> last_bin = max_bin;</div> +<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin]; --last_bin);</div> +<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> +<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> +<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  local_bin = bins + u;</div> +<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  next_bin_start += bin_sizes[u];</div> +<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">//Iterating over each element in this bin</span></div> +<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> +<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  ++current) {</div> +<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> +<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">for</span> (target_bin = end_bin - getchar((*current), char_offset);</div> +<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  target_bin != local_bin;</div> +<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  target_bin = end_bin - getchar((*current), char_offset))</div> +<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  iter_swap(current, (*target_bin)++);</div> +<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div> +<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  *local_bin = next_bin_start;</div> +<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div> +<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  bins[last_bin] = lastFull;</div> +<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">//Recursing</span></div> +<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  RandomAccessIter lastPos = first;</div> +<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">//Skip this loop for empties</span></div> +<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u <= cache_offset + last_bin;</div> +<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  lastPos = bin_cache[u], ++u) {</div> +<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> +<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> +<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">if</span> (count < 2)</div> +<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> +<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (count < max_size)</div> +<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  std::sort(lastPos, bin_cache[u], comp);</div> +<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a><RandomAccessIter, Unsigned_char_type,</div> +<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  Get_char, Get_length, Compare></div> +<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end,</div> +<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  bin_sizes, getchar, length, comp);</div> +<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  }</div> +<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  }</div> +<div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div> +<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  >::type</div> +<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  Unsigned_char_type)</div> +<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  {</div> +<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> +<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  string_sort_rec<RandomAccessIter, Unsigned_char_type></div> +<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  (first, last, 0, bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div> +<div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div> +<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  >::type</div> +<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  Unsigned_char_type)</div> +<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  {</div> +<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> +<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> +<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  std::sort(first, last);</div> +<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div> +<div class="line"><a name="l00706"></a><span class="lineno"> 706</span> </div> +<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  >::type</div> +<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  Unsigned_char_type)</div> +<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  {</div> +<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> +<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  reverse_string_sort_rec<RandomAccessIter, Unsigned_char_type></div> +<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  (first, last, 0, bin_cache, 0, bin_sizes);</div> +<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div> +<div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div> +<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  >::type</div> +<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  Unsigned_char_type)</div> +<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  {</div> +<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> +<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  Data_type;</div> +<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> +<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> +<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::sort(first, last, std::greater<Data_type>());</div> +<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div> +<div class="line"><a name="l00732"></a><span class="lineno"> 732</span> </div> +<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  >::type</div> +<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  Get_char getchar, Get_length length, Unsigned_char_type)</div> +<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  {</div> +<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> +<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> +<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  Get_length>(first, last, 0, bin_cache, 0, bin_sizes, getchar, length);</div> +<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div> +<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> </div> +<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  >::type</div> +<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  Get_char getchar, Get_length length, Unsigned_char_type)</div> +<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  {</div> +<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> +<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> +<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::sort(first, last);</div> +<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div> +<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div> +<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  >::type</div> +<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> +<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div> +<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> +<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char</div> +<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  , Get_length, Compare></div> +<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  (first, last, 0, bin_cache, 0, bin_sizes, getchar, length, comp);</div> +<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div> +<div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div> +<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">//disable_if_c was refusing to compile, so rewrote to use enable_if_c</span></div> +<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Unsigned_char_type) > 2), <span class="keywordtype">void</span></div> +<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  >::type</div> +<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> +<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  {</div> +<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> +<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> +<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div> +<div class="line"><a name="l00786"></a><span class="lineno"> 786</span> </div> +<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> +<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  >::type</div> +<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> +<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  {</div> +<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> +<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  std::vector<RandomAccessIter> bin_cache;</div> +<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> +<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  Get_length, Compare></div> +<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  (first, last, 0, bin_cache, 0, bin_sizes, getchar, length, comp);</div> +<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div> +<div class="line"><a name="l00801"></a><span class="lineno"> 801</span> </div> +<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> +<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> +<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  >::type</div> +<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> +<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  {</div> +<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> +<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> +<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div> +<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div> +<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> }</div> +<div class="line"><a name="l00815"></a><span class="lineno"> 815</span> }</div> +<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div> +<div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a585497946eeb8cc1d2072642d7f1da01"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">boost::sort::detail::update_offset</a></div><div class="ttdeci">void update_offset(RandomAccessIter first, RandomAccessIter finish, size_t &char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:39</div></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_a0716b085964e676c8c9735bafa783007"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">boost::sort::detail::offset_char_less_than::offset_char_less_than</a></div><div class="ttdeci">offset_char_less_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:142</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a2d28d7eb61a69c61c0362cfefa264d73"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">boost::sort::detail::offset_greater_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:123</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a3ce63f721a5a4453317ffc0ea61a6243"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">boost::sort::detail::offset_greater_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:136</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:121</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad1655ab39e410e18b6e8b6694405e5ba"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">boost::sort::detail::string_sort_rec</a></div><div class="ttdeci">void string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:161</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a66be693262defeff06a4a3507155d4a3"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">boost::sort::detail::reverse_string_sort_rec</a></div><div class="ttdeci">void reverse_string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:266</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html_a0c153f50b29e9bea224df345c5ff1e91"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">boost::sort::detail::offset_less_than::offset_less_than</a></div><div class="ttdeci">offset_less_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:102</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_ae5ee4abf81ecfb4ff4016792b81bfbd2"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">boost::sort::detail::offset_char_less_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:153</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a950a2dbbe75f048a0b343dbf7c532dc0"><div class="ttname"><a href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort::string_sort</a></div><div class="ttdeci">void string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:29</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:141</div></div> +<div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a4ad4785d90f47d51ff1d2fac8c21bb48"><div class="ttname"><a href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort::reverse_string_sort</a></div><div class="ttdeci">void reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:49</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:101</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a9603b8028ace4872c6e056917c7889aa"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">boost::sort::detail::offset_greater_than::offset_greater_than</a></div><div class="ttdeci">offset_greater_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:122</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html_a3f2184b627e54eb990bfe2022b6f8f06"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">boost::sort::detail::offset_less_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:103</div></div> +<div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html_ae6d1402367790441b962b8cc9f066aac"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">boost::sort::detail::offset_less_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:116</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_a8ff12c3dcf4a6ea9942b8fc1e5046936"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">boost::sort::detail::offset_char_less_than::length</a></div><div class="ttdeci">Get_length length</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:155</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_afb5424173c237d8cd25722a02c23ab30"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">boost::sort::detail::offset_char_less_than::getchar</a></div><div class="ttdeci">Get_char getchar</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:154</div></div> +<div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_ad20c3572610e68d76c49dfff2eba2bf3"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">boost::sort::detail::offset_char_less_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:143</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_0dcad0da4f36218cbabb216021de9867.html b/libs/sort/doc/doxygen/html/dir_0dcad0da4f36218cbabb216021de9867.html new file mode 100644 index 000000000..0174fa5c1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_0dcad0da4f36218cbabb216021de9867.html @@ -0,0 +1,105 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">sort Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="subdirs"></a> +Directories</h2></td></tr> +<tr class="memitem:dir_4aa236a92b75d6f514e733718a475329"><td class="memItemLeft" align="right" valign="top">directory  </td><td class="memItemRight" valign="bottom"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a> +Files</h2></td></tr> +<tr class="memitem:sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="sort_8hpp.html">sort.hpp</a> <a href="sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_1878a3f4746a95c6aad317458cc7ef80.html b/libs/sort/doc/doxygen/html/dir_1878a3f4746a95c6aad317458cc7ef80.html new file mode 100644 index 000000000..1f7ff9520 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_1878a3f4746a95c6aad317458cc7ef80.html @@ -0,0 +1,100 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">boost Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="subdirs"></a> +Directories</h2></td></tr> +<tr class="memitem:dir_0dcad0da4f36218cbabb216021de9867"><td class="memItemLeft" align="right" valign="top">directory  </td><td class="memItemRight" valign="bottom"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_1b6f0a484b3a75c2ed43dc394e95eff6.html b/libs/sort/doc/doxygen/html/dir_1b6f0a484b3a75c2ed43dc394e95eff6.html new file mode 100644 index 000000000..b3b838b75 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_1b6f0a484b3a75c2ed43dc394e95eff6.html @@ -0,0 +1,108 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">detail Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a> +Files</h2></td></tr> +<tr class="memitem:constants_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="constants_8hpp.html">constants.hpp</a> <a href="constants_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:detail_2float__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="detail_2float__sort_8hpp.html">float_sort.hpp</a> <a href="detail_2float__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:detail_2integer__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="detail_2integer__sort_8hpp.html">integer_sort.hpp</a> <a href="detail_2integer__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:spreadsort__common_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a> <a href="spreadsort__common_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:detail_2string__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="detail_2string__sort_8hpp.html">string_sort.hpp</a> <a href="detail_2string__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_4aa236a92b75d6f514e733718a475329.html b/libs/sort/doc/doxygen/html/dir_4aa236a92b75d6f514e733718a475329.html new file mode 100644 index 000000000..59cb05769 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_4aa236a92b75d6f514e733718a475329.html @@ -0,0 +1,106 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">spreadsort Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a> +Files</h2></td></tr> +<tr class="memitem:float__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="float__sort_8hpp.html">float_sort.hpp</a> <a href="float__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:integer__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="integer__sort_8hpp.html">integer_sort.hpp</a> <a href="integer__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:spreadsort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="spreadsort_8hpp.html">spreadsort.hpp</a> <a href="spreadsort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:string__sort_8hpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="string__sort_8hpp.html">string_sort.hpp</a> <a href="string__sort_8hpp_source.html">[code]</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html b/libs/sort/doc/doxygen/html/dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html new file mode 100644 index 000000000..337b7d592 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html @@ -0,0 +1,151 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">example Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a> +Files</h2></td></tr> +<tr class="memitem:alrbreaker_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="alrbreaker_8cpp.html">alrbreaker.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:alreadysorted_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="alreadysorted_8cpp.html">alreadysorted.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:binaryalrbreaker_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="binaryalrbreaker_8cpp.html">binaryalrbreaker.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:boostrandomgen_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="boostrandomgen_8cpp.html">boostrandomgen.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:caseinsensitive_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="caseinsensitive_8cpp.html">caseinsensitive.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:charstringsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="charstringsample_8cpp.html">charstringsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:double_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="double_8cpp.html">double.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:floatfunctorsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="floatfunctorsample_8cpp.html">floatfunctorsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:floatsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="floatsample_8cpp.html">floatsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:generalizedstruct_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="generalizedstruct_8cpp.html">generalizedstruct.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:int64_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="int64_8cpp.html">int64.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:keyplusdatasample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="keyplusdatasample_8cpp.html">keyplusdatasample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:mostlysorted_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="mostlysorted_8cpp.html">mostlysorted.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:parallelint_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelint_8cpp.html">parallelint.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:parallelstring_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelstring_8cpp.html">parallelstring.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:randomgen_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="randomgen_8cpp.html">randomgen.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:reverseintsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="reverseintsample_8cpp.html">reverseintsample.cpp</a></td></tr> +<tr class="memdesc:reverseintsample_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">integer sort with a rightshift functor reverse sorting example. <br /></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:reversestringfunctorsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="reversestringfunctorsample_8cpp.html">reversestringfunctorsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:reversestringsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="reversestringsample_8cpp.html">reversestringsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:rightshiftsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="rightshiftsample_8cpp.html">rightshiftsample.cpp</a></td></tr> +<tr class="memdesc:rightshiftsample_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort with a rightshift functor sorting example. <br /></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:sample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="sample_8cpp.html">sample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:shiftfloatsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="shiftfloatsample_8cpp.html">shiftfloatsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:stringfunctorsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="stringfunctorsample_8cpp.html">stringfunctorsample.cpp</a></td></tr> +<tr class="memdesc:stringfunctorsample_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">spreadsort string functor sorting example. <br /></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:stringsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="stringsample_8cpp.html">stringsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:wstringsample_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="wstringsample_8cpp.html">wstringsample.cpp</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/dir_d44c64559bbebec7f509842c48db8b23.html b/libs/sort/doc/doxygen/html/dir_d44c64559bbebec7f509842c48db8b23.html new file mode 100644 index 000000000..6714aa6bd --- /dev/null +++ b/libs/sort/doc/doxygen/html/dir_d44c64559bbebec7f509842c48db8b23.html @@ -0,0 +1,100 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include Directory Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">include Directory Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="subdirs"></a> +Directories</h2></td></tr> +<tr class="memitem:dir_1878a3f4746a95c6aad317458cc7ef80"><td class="memItemLeft" align="right" valign="top">directory  </td><td class="memItemRight" valign="bottom"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/doc.png b/libs/sort/doc/doxygen/html/doc.png Binary files differnew file mode 100644 index 000000000..17edabff9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/doc.png diff --git a/libs/sort/doc/doxygen/html/double_8cpp.html b/libs/sort/doc/doxygen/html/double_8cpp.html new file mode 100644 index 000000000..df5a200da --- /dev/null +++ b/libs/sort/doc/doxygen/html/double_8cpp.html @@ -0,0 +1,177 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/double.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">double.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="double_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   double</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a38779bfd63dd113c9f7602664546a58c"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="double_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>   boost::int64_t</td></tr> +<tr class="separator:a38779bfd63dd113c9f7602664546a58c"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="double_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a38779bfd63dd113c9f7602664546a58c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define CAST_TYPE   boost::int64_t</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   double</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/doxygen.css b/libs/sort/doc/doxygen/html/doxygen.css new file mode 100644 index 000000000..a00083315 --- /dev/null +++ b/libs/sort/doc/doxygen/html/doxygen.css @@ -0,0 +1,1449 @@ +/* The standard CSS for doxygen 1.8.9.1 */ + +body, table, div, p, dl { + font: 400 14px/22px Roboto,sans-serif; +} + +/* @group Heading Levels */ + +h1.groupheader { + font-size: 150%; +} + +.title { + font: 400 14px/28px Roboto,sans-serif; + font-size: 150%; + font-weight: bold; + margin: 10px 2px; +} + +h2.groupheader { + border-bottom: 1px solid #879ECB; + color: #354C7B; + font-size: 150%; + font-weight: normal; + margin-top: 1.75em; + padding-top: 8px; + padding-bottom: 4px; + width: 100%; +} + +h3.groupheader { + font-size: 100%; +} + +h1, h2, h3, h4, h5, h6 { + -webkit-transition: text-shadow 0.5s linear; + -moz-transition: text-shadow 0.5s linear; + -ms-transition: text-shadow 0.5s linear; + -o-transition: text-shadow 0.5s linear; + transition: text-shadow 0.5s linear; + margin-right: 15px; +} + +h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow { + text-shadow: 0 0 15px cyan; +} + +dt { + font-weight: bold; +} + +div.multicol { + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; +} + +p.startli, p.startdd { + margin-top: 2px; +} + +p.starttd { + margin-top: 0px; +} + +p.endli { + margin-bottom: 0px; +} + +p.enddd { + margin-bottom: 4px; +} + +p.endtd { + margin-bottom: 2px; +} + +/* @end */ + +caption { + font-weight: bold; +} + +span.legend { + font-size: 70%; + text-align: center; +} + +h3.version { + font-size: 90%; + text-align: center; +} + +div.qindex, div.navtab{ + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; +} + +div.qindex, div.navpath { + width: 100%; + line-height: 140%; +} + +div.navtab { + margin-right: 15px; +} + +/* @group Link Styling */ + +a { + color: #3D578C; + font-weight: normal; + text-decoration: none; +} + +.contents a:visited { + color: #4665A2; +} + +a:hover { + text-decoration: underline; +} + +a.qindex { + font-weight: bold; +} + +a.qindexHL { + font-weight: bold; + background-color: #9CAFD4; + color: #ffffff; + border: 1px double #869DCA; +} + +.contents a.qindexHL:visited { + color: #ffffff; +} + +a.el { + font-weight: bold; +} + +a.elRef { +} + +a.code, a.code:visited, a.line, a.line:visited { + color: #4665A2; +} + +a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { + color: #4665A2; +} + +/* @end */ + +dl.el { + margin-left: -1cm; +} + +pre.fragment { + border: 1px solid #C4CFE5; + background-color: #FBFCFD; + padding: 4px 6px; + margin: 4px 8px 4px 2px; + overflow: auto; + word-wrap: break-word; + font-size: 9pt; + line-height: 125%; + font-family: monospace, fixed; + font-size: 105%; +} + +div.fragment { + padding: 4px 6px; + margin: 4px 8px 4px 2px; + background-color: #FBFCFD; + border: 1px solid #C4CFE5; +} + +div.line { + font-family: monospace, fixed; + font-size: 13px; + min-height: 13px; + line-height: 1.0; + text-wrap: unrestricted; + white-space: -moz-pre-wrap; /* Moz */ + white-space: -pre-wrap; /* Opera 4-6 */ + white-space: -o-pre-wrap; /* Opera 7 */ + white-space: pre-wrap; /* CSS3 */ + word-wrap: break-word; /* IE 5.5+ */ + text-indent: -53px; + padding-left: 53px; + padding-bottom: 0px; + margin: 0px; + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +div.line.glow { + background-color: cyan; + box-shadow: 0 0 10px cyan; +} + + +span.lineno { + padding-right: 4px; + text-align: right; + border-right: 2px solid #0F0; + background-color: #E8E8E8; + white-space: pre; +} +span.lineno a { + background-color: #D8D8D8; +} + +span.lineno a:hover { + background-color: #C8C8C8; +} + +div.ah, span.ah { + background-color: black; + font-weight: bold; + color: #ffffff; + margin-bottom: 3px; + margin-top: 3px; + padding: 0.2em; + border: solid thin #333; + border-radius: 0.5em; + -webkit-border-radius: .5em; + -moz-border-radius: .5em; + box-shadow: 2px 2px 3px #999; + -webkit-box-shadow: 2px 2px 3px #999; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + background-image: -webkit-gradient(linear, left top, left bottom, from(#eee), to(#000),color-stop(0.3, #444)); + background-image: -moz-linear-gradient(center top, #eee 0%, #444 40%, #000); +} + +div.classindex ul { + list-style: none; + padding-left: 0; +} + +div.classindex span.ai { + display: inline-block; +} + +div.groupHeader { + margin-left: 16px; + margin-top: 12px; + font-weight: bold; +} + +div.groupText { + margin-left: 16px; + font-style: italic; +} + +body { + background-color: white; + color: black; + margin: 0; +} + +div.contents { + margin-top: 10px; + margin-left: 12px; + margin-right: 8px; +} + +td.indexkey { + background-color: #EBEFF6; + font-weight: bold; + border: 1px solid #C4CFE5; + margin: 2px 0px 2px 0; + padding: 2px 10px; + white-space: nowrap; + vertical-align: top; +} + +td.indexvalue { + background-color: #EBEFF6; + border: 1px solid #C4CFE5; + padding: 2px 10px; + margin: 2px 0px; +} + +tr.memlist { + background-color: #EEF1F7; +} + +p.formulaDsp { + text-align: center; +} + +img.formulaDsp { + +} + +img.formulaInl { + vertical-align: middle; +} + +div.center { + text-align: center; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; +} + +div.center img { + border: 0px; +} + +address.footer { + text-align: right; + padding-right: 12px; +} + +img.footer { + border: 0px; + vertical-align: middle; +} + +/* @group Code Colorization */ + +span.keyword { + color: #008000 +} + +span.keywordtype { + color: #604020 +} + +span.keywordflow { + color: #e08000 +} + +span.comment { + color: #800000 +} + +span.preprocessor { + color: #806020 +} + +span.stringliteral { + color: #002080 +} + +span.charliteral { + color: #008080 +} + +span.vhdldigit { + color: #ff00ff +} + +span.vhdlchar { + color: #000000 +} + +span.vhdlkeyword { + color: #700070 +} + +span.vhdllogic { + color: #ff0000 +} + +blockquote { + background-color: #F7F8FB; + border-left: 2px solid #9CAFD4; + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; +} + +/* @end */ + +/* +.search { + color: #003399; + font-weight: bold; +} + +form.search { + margin-bottom: 0px; + margin-top: 0px; +} + +input.search { + font-size: 75%; + color: #000080; + font-weight: normal; + background-color: #e8eef2; +} +*/ + +td.tiny { + font-size: 75%; +} + +.dirtab { + padding: 4px; + border-collapse: collapse; + border: 1px solid #A3B4D7; +} + +th.dirtab { + background: #EBEFF6; + font-weight: bold; +} + +hr { + height: 0px; + border: none; + border-top: 1px solid #4A6AAA; +} + +hr.footer { + height: 1px; +} + +/* @group Member Descriptions */ + +table.memberdecls { + border-spacing: 0px; + padding: 0px; +} + +.memberdecls td, .fieldtable tr { + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +.memberdecls td.glow, .fieldtable tr.glow { + background-color: cyan; + box-shadow: 0 0 15px cyan; +} + +.mdescLeft, .mdescRight, +.memItemLeft, .memItemRight, +.memTemplItemLeft, .memTemplItemRight, .memTemplParams { + background-color: #F9FAFC; + border: none; + margin: 4px; + padding: 1px 0 0 8px; +} + +.mdescLeft, .mdescRight { + padding: 0px 8px 4px 8px; + color: #555; +} + +.memSeparator { + border-bottom: 1px solid #DEE4F0; + line-height: 1px; + margin: 0px; + padding: 0px; +} + +.memItemLeft, .memTemplItemLeft { + white-space: nowrap; +} + +.memItemRight { + width: 100%; +} + +.memTemplParams { + color: #4665A2; + white-space: nowrap; + font-size: 80%; +} + +/* @end */ + +/* @group Member Details */ + +/* Styles for detailed member documentation */ + +.memtemplate { + font-size: 80%; + color: #4665A2; + font-weight: normal; + margin-left: 9px; +} + +.memnav { + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; + margin: 2px; + margin-right: 15px; + padding: 2px; +} + +.mempage { + width: 100%; +} + +.memitem { + padding: 0; + margin-bottom: 10px; + margin-right: 5px; + -webkit-transition: box-shadow 0.5s linear; + -moz-transition: box-shadow 0.5s linear; + -ms-transition: box-shadow 0.5s linear; + -o-transition: box-shadow 0.5s linear; + transition: box-shadow 0.5s linear; + display: table !important; + width: 100%; +} + +.memitem.glow { + box-shadow: 0 0 15px cyan; +} + +.memname { + font-weight: bold; + margin-left: 6px; +} + +.memname td { + vertical-align: bottom; +} + +.memproto, dl.reflist dt { + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 0px 6px 0px; + color: #253555; + font-weight: bold; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + /* opera specific markup */ + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-top-right-radius: 4px; + border-top-left-radius: 4px; + /* firefox specific markup */ + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + -moz-border-radius-topright: 4px; + -moz-border-radius-topleft: 4px; + /* webkit specific markup */ + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + -webkit-border-top-right-radius: 4px; + -webkit-border-top-left-radius: 4px; + +} + +.memdoc, dl.reflist dd { + border-bottom: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 10px 2px 10px; + background-color: #FBFCFD; + border-top-width: 0; + background-image:url('nav_g.png'); + background-repeat:repeat-x; + background-color: #FFFFFF; + /* opera specific markup */ + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + /* firefox specific markup */ + -moz-border-radius-bottomleft: 4px; + -moz-border-radius-bottomright: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + /* webkit specific markup */ + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +dl.reflist dt { + padding: 5px; +} + +dl.reflist dd { + margin: 0px 0px 10px 0px; + padding: 5px; +} + +.paramkey { + text-align: right; +} + +.paramtype { + white-space: nowrap; +} + +.paramname { + color: #602020; + white-space: nowrap; +} +.paramname em { + font-style: normal; +} +.paramname code { + line-height: 14px; +} + +.params, .retval, .exception, .tparams { + margin-left: 0px; + padding-left: 0px; +} + +.params .paramname, .retval .paramname { + font-weight: bold; + vertical-align: top; +} + +.params .paramtype { + font-style: italic; + vertical-align: top; +} + +.params .paramdir { + font-family: "courier new",courier,monospace; + vertical-align: top; +} + +table.mlabels { + border-spacing: 0px; +} + +td.mlabels-left { + width: 100%; + padding: 0px; +} + +td.mlabels-right { + vertical-align: bottom; + padding: 0px; + white-space: nowrap; +} + +span.mlabels { + margin-left: 8px; +} + +span.mlabel { + background-color: #728DC1; + border-top:1px solid #5373B4; + border-left:1px solid #5373B4; + border-right:1px solid #C4CFE5; + border-bottom:1px solid #C4CFE5; + text-shadow: none; + color: white; + margin-right: 4px; + padding: 2px 3px; + border-radius: 3px; + font-size: 7pt; + white-space: nowrap; + vertical-align: middle; +} + + + +/* @end */ + +/* these are for tree view inside a (index) page */ + +div.directory { + margin: 10px 0px; + border-top: 1px solid #9CAFD4; + border-bottom: 1px solid #9CAFD4; + width: 100%; +} + +.directory table { + border-collapse:collapse; +} + +.directory td { + margin: 0px; + padding: 0px; + vertical-align: top; +} + +.directory td.entry { + white-space: nowrap; + padding-right: 6px; + padding-top: 3px; +} + +.directory td.entry a { + outline:none; +} + +.directory td.entry a img { + border: none; +} + +.directory td.desc { + width: 100%; + padding-left: 6px; + padding-right: 6px; + padding-top: 3px; + border-left: 1px solid rgba(0,0,0,0.05); +} + +.directory tr.even { + padding-left: 6px; + background-color: #F7F8FB; +} + +.directory img { + vertical-align: -30%; +} + +.directory .levels { + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; +} + +.directory .levels span { + cursor: pointer; + padding-left: 2px; + padding-right: 2px; + color: #3D578C; +} + +.arrow { + color: #9CAFD4; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; + cursor: pointer; + font-size: 80%; + display: inline-block; + width: 16px; + height: 22px; +} + +.icon { + font-family: Arial, Helvetica; + font-weight: bold; + font-size: 12px; + height: 14px; + width: 16px; + display: inline-block; + background-color: #728DC1; + color: white; + text-align: center; + border-radius: 4px; + margin-left: 2px; + margin-right: 2px; +} + +.icona { + width: 24px; + height: 22px; + display: inline-block; +} + +.iconfopen { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderopen.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.iconfclosed { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderclosed.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.icondoc { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('doc.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +table.directory { + font: 400 14px Roboto,sans-serif; +} + +/* @end */ + +div.dynheader { + margin-top: 8px; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +address { + font-style: normal; + color: #2A3D61; +} + +table.doxtable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.doxtable td, table.doxtable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.doxtable th { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +table.fieldtable { + /*width: 100%;*/ + margin-bottom: 10px; + border: 1px solid #A8B8D9; + border-spacing: 0px; + -moz-border-radius: 4px; + -webkit-border-radius: 4px; + border-radius: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + -webkit-box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); +} + +.fieldtable td, .fieldtable th { + padding: 3px 7px 2px; +} + +.fieldtable td.fieldtype, .fieldtable td.fieldname { + white-space: nowrap; + border-right: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + vertical-align: top; +} + +.fieldtable td.fieldname { + padding-top: 3px; +} + +.fieldtable td.fielddoc { + border-bottom: 1px solid #A8B8D9; + /*width: 100%;*/ +} + +.fieldtable td.fielddoc p:first-child { + margin-top: 0px; +} + +.fieldtable td.fielddoc p:last-child { + margin-bottom: 2px; +} + +.fieldtable tr:last-child td { + border-bottom: none; +} + +.fieldtable th { + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + font-size: 90%; + color: #253555; + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + -moz-border-radius-topleft: 4px; + -moz-border-radius-topright: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; +} + + +.tabsearch { + top: 0px; + left: 10px; + height: 36px; + background-image: url('tab_b.png'); + z-index: 101; + overflow: hidden; + font-size: 13px; +} + +.navpath ul +{ + font-size: 11px; + background-image:url('tab_b.png'); + background-repeat:repeat-x; + background-position: 0 -5px; + height:30px; + line-height:30px; + color:#8AA0CC; + border:solid 1px #C2CDE4; + overflow:hidden; + margin:0px; + padding:0px; +} + +.navpath li +{ + list-style-type:none; + float:left; + padding-left:10px; + padding-right:15px; + background-image:url('bc_s.png'); + background-repeat:no-repeat; + background-position:right; + color:#364D7C; +} + +.navpath li.navelem a +{ + height:32px; + display:block; + text-decoration: none; + outline: none; + color: #283A5D; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; +} + +.navpath li.navelem a:hover +{ + color:#6884BD; +} + +.navpath li.footer +{ + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + color:#364D7C; + font-size: 8pt; +} + + +div.summary +{ + float: right; + font-size: 8pt; + padding-right: 5px; + width: 50%; + text-align: right; +} + +div.summary a +{ + white-space: nowrap; +} + +div.ingroups +{ + font-size: 8pt; + width: 50%; + text-align: left; +} + +div.ingroups a +{ + white-space: nowrap; +} + +div.header +{ + background-image:url('nav_h.png'); + background-repeat:repeat-x; + background-color: #F9FAFC; + margin: 0px; + border-bottom: 1px solid #C4CFE5; +} + +div.headertitle +{ + padding: 5px 5px 5px 10px; +} + +dl +{ + padding: 0 0 0 10px; +} + +/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug */ +dl.section +{ + margin-left: 0px; + padding-left: 0px; +} + +dl.note +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #D0C000; +} + +dl.warning, dl.attention +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #FF0000; +} + +dl.pre, dl.post, dl.invariant +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #00D000; +} + +dl.deprecated +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #505050; +} + +dl.todo +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #00C0E0; +} + +dl.test +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #3030E0; +} + +dl.bug +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #C08050; +} + +dl.section dd { + margin-bottom: 6px; +} + + +#projectlogo +{ + text-align: center; + vertical-align: bottom; + border-collapse: separate; +} + +#projectlogo img +{ + border: 0px none; +} + +#projectname +{ + font: 300% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 2px 0px; +} + +#projectbrief +{ + font: 120% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#projectnumber +{ + font: 50% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#titlearea +{ + padding: 0px; + margin: 0px; + width: 100%; + border-bottom: 1px solid #5373B4; +} + +.image +{ + text-align: center; +} + +.dotgraph +{ + text-align: center; +} + +.mscgraph +{ + text-align: center; +} + +.diagraph +{ + text-align: center; +} + +.caption +{ + font-weight: bold; +} + +div.zoom +{ + border: 1px solid #90A5CE; +} + +dl.citelist { + margin-bottom:50px; +} + +dl.citelist dt { + color:#334975; + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; +} + +dl.citelist dd { + margin:2px 0; + padding:5px 0; +} + +div.toc { + padding: 14px 25px; + background-color: #F4F6FA; + border: 1px solid #D8DFEE; + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 20px 10px 10px; + width: 200px; +} + +div.toc li { + background: url("bdwn.png") no-repeat scroll 0 5px transparent; + font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif; + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; +} + +div.toc h3 { + font: bold 12px/1.2 Arial,FreeSans,sans-serif; + color: #4665A2; + border-bottom: 0 none; + margin: 0; +} + +div.toc ul { + list-style: none outside none; + border: medium none; + padding: 0px; +} + +div.toc li.level1 { + margin-left: 0px; +} + +div.toc li.level2 { + margin-left: 15px; +} + +div.toc li.level3 { + margin-left: 30px; +} + +div.toc li.level4 { + margin-left: 45px; +} + +.inherit_header { + font-weight: bold; + color: gray; + cursor: pointer; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +.inherit_header td { + padding: 6px 0px 2px 5px; +} + +.inherit { + display: none; +} + +tr.heading h2 { + margin-top: 12px; + margin-bottom: 4px; +} + +/* tooltip related style info */ + +.ttc { + position: absolute; + display: none; +} + +#powerTip { + cursor: default; + white-space: nowrap; + background-color: white; + border: 1px solid gray; + border-radius: 4px 4px 4px 4px; + box-shadow: 1px 1px 7px gray; + display: none; + font-size: smaller; + max-width: 80%; + opacity: 0.9; + padding: 1ex 1em 1em; + position: absolute; + z-index: 2147483647; +} + +#powerTip div.ttdoc { + color: grey; + font-style: italic; +} + +#powerTip div.ttname a { + font-weight: bold; +} + +#powerTip div.ttname { + font-weight: bold; +} + +#powerTip div.ttdeci { + color: #006318; +} + +#powerTip div { + margin: 0px; + padding: 0px; + font: 12px/16px Roboto,sans-serif; +} + +#powerTip:before, #powerTip:after { + content: ""; + position: absolute; + margin: 0px; +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.s:after, #powerTip.s:before, +#powerTip.w:after, #powerTip.w:before, +#powerTip.e:after, #powerTip.e:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.nw:after, #powerTip.nw:before, +#powerTip.sw:after, #powerTip.sw:before { + border: solid transparent; + content: " "; + height: 0; + width: 0; + position: absolute; +} + +#powerTip.n:after, #powerTip.s:after, +#powerTip.w:after, #powerTip.e:after, +#powerTip.nw:after, #powerTip.ne:after, +#powerTip.sw:after, #powerTip.se:after { + border-color: rgba(255, 255, 255, 0); +} + +#powerTip.n:before, #powerTip.s:before, +#powerTip.w:before, #powerTip.e:before, +#powerTip.nw:before, #powerTip.ne:before, +#powerTip.sw:before, #powerTip.se:before { + border-color: rgba(128, 128, 128, 0); +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.nw:after, #powerTip.nw:before { + top: 100%; +} + +#powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after { + border-top-color: #ffffff; + border-width: 10px; + margin: 0px -10px; +} +#powerTip.n:before { + border-top-color: #808080; + border-width: 11px; + margin: 0px -11px; +} +#powerTip.n:after, #powerTip.n:before { + left: 50%; +} + +#powerTip.nw:after, #powerTip.nw:before { + right: 14px; +} + +#powerTip.ne:after, #powerTip.ne:before { + left: 14px; +} + +#powerTip.s:after, #powerTip.s:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.sw:after, #powerTip.sw:before { + bottom: 100%; +} + +#powerTip.s:after, #powerTip.se:after, #powerTip.sw:after { + border-bottom-color: #ffffff; + border-width: 10px; + margin: 0px -10px; +} + +#powerTip.s:before, #powerTip.se:before, #powerTip.sw:before { + border-bottom-color: #808080; + border-width: 11px; + margin: 0px -11px; +} + +#powerTip.s:after, #powerTip.s:before { + left: 50%; +} + +#powerTip.sw:after, #powerTip.sw:before { + right: 14px; +} + +#powerTip.se:after, #powerTip.se:before { + left: 14px; +} + +#powerTip.e:after, #powerTip.e:before { + left: 100%; +} +#powerTip.e:after { + border-left-color: #ffffff; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.e:before { + border-left-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +#powerTip.w:after, #powerTip.w:before { + right: 100%; +} +#powerTip.w:after { + border-right-color: #ffffff; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.w:before { + border-right-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +@media print +{ + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } +} + diff --git a/libs/sort/doc/doxygen/html/doxygen.png b/libs/sort/doc/doxygen/html/doxygen.png Binary files differnew file mode 100644 index 000000000..3ff17d807 --- /dev/null +++ b/libs/sort/doc/doxygen/html/doxygen.png diff --git a/libs/sort/doc/doxygen/html/dynsections.js b/libs/sort/doc/doxygen/html/dynsections.js new file mode 100644 index 000000000..85e183690 --- /dev/null +++ b/libs/sort/doc/doxygen/html/dynsections.js @@ -0,0 +1,97 @@ +function toggleVisibility(linkObj) +{ + var base = $(linkObj).attr('id'); + var summary = $('#'+base+'-summary'); + var content = $('#'+base+'-content'); + var trigger = $('#'+base+'-trigger'); + var src=$(trigger).attr('src'); + if (content.is(':visible')===true) { + content.hide(); + summary.show(); + $(linkObj).addClass('closed').removeClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + content.show(); + summary.hide(); + $(linkObj).removeClass('closed').addClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + } + return false; +} + +function updateStripes() +{ + $('table.directory tr'). + removeClass('even').filter(':visible:even').addClass('even'); +} + +function toggleLevel(level) +{ + $('table.directory tr').each(function() { + var l = this.id.split('_').length-1; + var i = $('#img'+this.id.substring(3)); + var a = $('#arr'+this.id.substring(3)); + if (l<level+1) { + i.removeClass('iconfopen iconfclosed').addClass('iconfopen'); + a.html('▼'); + $(this).show(); + } else if (l==level+1) { + i.removeClass('iconfclosed iconfopen').addClass('iconfclosed'); + a.html('►'); + $(this).show(); + } else { + $(this).hide(); + } + }); + updateStripes(); +} + +function toggleFolder(id) +{ + // the clicked row + var currentRow = $('#row_'+id); + + // all rows after the clicked row + var rows = currentRow.nextAll("tr"); + + var re = new RegExp('^row_'+id+'\\d+_$', "i"); //only one sub + + // only match elements AFTER this one (can't hide elements before) + var childRows = rows.filter(function() { return this.id.match(re); }); + + // first row is visible we are HIDING + if (childRows.filter(':first').is(':visible')===true) { + // replace down arrow by right arrow for current row + var currentRowSpans = currentRow.find("span"); + currentRowSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed"); + currentRowSpans.filter(".arrow").html('►'); + rows.filter("[id^=row_"+id+"]").hide(); // hide all children + } else { // we are SHOWING + // replace right arrow by down arrow for current row + var currentRowSpans = currentRow.find("span"); + currentRowSpans.filter(".iconfclosed").removeClass("iconfclosed").addClass("iconfopen"); + currentRowSpans.filter(".arrow").html('▼'); + // replace down arrows by right arrows for child rows + var childRowsSpans = childRows.find("span"); + childRowsSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed"); + childRowsSpans.filter(".arrow").html('►'); + childRows.show(); //show all children + } + updateStripes(); +} + + +function toggleInherit(id) +{ + var rows = $('tr.inherit.'+id); + var img = $('tr.inherit_header.'+id+' img'); + var src = $(img).attr('src'); + if (rows.filter(':first').is(':visible')===true) { + rows.css('display','none'); + $(img).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + rows.css('display','table-row'); // using show() causes jump in firefox + $(img).attr('src',src.substring(0,src.length-10)+'open.png'); + } +} + diff --git a/libs/sort/doc/doxygen/html/examples.html b/libs/sort/doc/doxygen/html/examples.html new file mode 100644 index 000000000..2d1a7ceb1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/examples.html @@ -0,0 +1,95 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Examples</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li class="current"><a href="examples.html"><span>Examples</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">Examples</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock">Here is a list of all examples:</div><ul> +<li><a class="el" href="_2example_2sample_8cpp-example.html">/example/sample.cpp</a></li> + +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Tue Jan 6 2015 16:36:35 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/files.html b/libs/sort/doc/doxygen/html/files.html new file mode 100644 index 000000000..1620e4467 --- /dev/null +++ b/libs/sort/doc/doxygen/html/files.html @@ -0,0 +1,135 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: File List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">File List</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock">Here is a list of all files with brief descriptions:</div><div class="directory"> +<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span><span onclick="javascript:toggleLevel(5);">5</span>]</div><table class="directory"> +<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">▼</span><span id="img_0_" class="iconfopen" onclick="toggleFolder('0_')"> </span><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html" target="_self">example</a></td><td class="desc"></td></tr> +<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="alrbreaker_8cpp.html" target="_self">alrbreaker.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="alreadysorted_8cpp.html" target="_self">alreadysorted.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="binaryalrbreaker_8cpp.html" target="_self">binaryalrbreaker.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="boostrandomgen_8cpp.html" target="_self">boostrandomgen.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="caseinsensitive_8cpp.html" target="_self">caseinsensitive.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="charstringsample_8cpp.html" target="_self">charstringsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="double_8cpp.html" target="_self">double.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="floatfunctorsample_8cpp.html" target="_self">floatfunctorsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="floatsample_8cpp.html" target="_self">floatsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="generalizedstruct_8cpp.html" target="_self">generalizedstruct.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_10_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="int64_8cpp.html" target="_self">int64.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="keyplusdatasample_8cpp.html" target="_self">keyplusdatasample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_12_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="mostlysorted_8cpp.html" target="_self">mostlysorted.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="parallelint_8cpp.html" target="_self">parallelint.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="parallelstring_8cpp.html" target="_self">parallelstring.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="randomgen_8cpp.html" target="_self">randomgen.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_16_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="reverseintsample_8cpp.html" target="_self">reverseintsample.cpp</a></td><td class="desc">Integer sort with a rightshift functor reverse sorting example </td></tr> +<tr id="row_0_17_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="reversestringfunctorsample_8cpp.html" target="_self">reversestringfunctorsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_18_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="reversestringsample_8cpp.html" target="_self">reversestringsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_19_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="rightshiftsample_8cpp.html" target="_self">rightshiftsample.cpp</a></td><td class="desc">Integer sort with a rightshift functor sorting example </td></tr> +<tr id="row_0_20_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="sample_8cpp.html" target="_self">sample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_21_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="shiftfloatsample_8cpp.html" target="_self">shiftfloatsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_22_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="stringfunctorsample_8cpp.html" target="_self">stringfunctorsample.cpp</a></td><td class="desc">Spreadsort string functor sorting example </td></tr> +<tr id="row_0_23_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="stringsample_8cpp.html" target="_self">stringsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_0_24_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="wstringsample_8cpp.html" target="_self">wstringsample.cpp</a></td><td class="desc"></td></tr> +<tr id="row_1_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">▼</span><span id="img_1_" class="iconfopen" onclick="toggleFolder('1_')"> </span><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html" target="_self">include</a></td><td class="desc"></td></tr> +<tr id="row_1_0_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">▼</span><span id="img_1_0_" class="iconfopen" onclick="toggleFolder('1_0_')"> </span><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html" target="_self">boost</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_1_0_0_" class="arrow" onclick="toggleFolder('1_0_0_')">▼</span><span id="img_1_0_0_" class="iconfopen" onclick="toggleFolder('1_0_0_')"> </span><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html" target="_self">sort</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_1_0_0_0_" class="arrow" onclick="toggleFolder('1_0_0_0_')">▼</span><span id="img_1_0_0_0_" class="iconfopen" onclick="toggleFolder('1_0_0_0_')"> </span><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html" target="_self">spreadsort</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_0_0_" class="even"><td class="entry"><span style="width:80px;display:inline-block;"> </span><a href="float__sort_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="float__sort_8hpp.html" target="_self">float_sort.hpp</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_0_1_"><td class="entry"><span style="width:80px;display:inline-block;"> </span><a href="integer__sort_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="integer__sort_8hpp.html" target="_self">integer_sort.hpp</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_0_2_" class="even"><td class="entry"><span style="width:80px;display:inline-block;"> </span><a href="spreadsort_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="spreadsort_8hpp.html" target="_self">spreadsort.hpp</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_0_3_"><td class="entry"><span style="width:80px;display:inline-block;"> </span><a href="string__sort_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="string__sort_8hpp.html" target="_self">string_sort.hpp</a></td><td class="desc"></td></tr> +<tr id="row_1_0_0_1_" class="even"><td class="entry"><span style="width:64px;display:inline-block;"> </span><a href="sort_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="sort_8hpp.html" target="_self">sort.hpp</a></td><td class="desc"></td></tr> +</table> +</div><!-- directory --> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/float__sort_8hpp.html b/libs/sort/doc/doxygen/html/float__sort_8hpp.html new file mode 100644 index 000000000..5869bd28a --- /dev/null +++ b/libs/sort/doc/doxygen/html/float__sort_8hpp.html @@ -0,0 +1,139 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/float_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">float_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <limits></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/constants.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/float_sort.hpp></code><br /> +</div> +<p><a href="float__sort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplParams" colspan="2">template<class Data_type , class Cast_type > </td></tr> +<tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplItemLeft" align="right" valign="top">Cast_type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">boost::sort::float_mem_cast</a> (const Data_type &data)</td></tr> +<tr class="memdesc:ac3a946e197df6cfc4968c6371ace319b"><td class="mdescLeft"> </td><td class="mdescRight">Casts a float to the specified integer type. <a href="#ac3a946e197df6cfc4968c6371ace319b">More...</a><br /></td></tr> +<tr class="separator:ac3a946e197df6cfc4968c6371ace319b"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">boost::sort::float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:acbcfc139de18c5c35c0ff1744c56e211"><td class="mdescLeft"> </td><td class="mdescRight"><code>float_sort</code> with casting to the appropriate size. <a href="#acbcfc139de18c5c35c0ff1744c56e211">More...</a><br /></td></tr> +<tr class="separator:acbcfc139de18c5c35c0ff1744c56e211"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift > </td></tr> +<tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12">boost::sort::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift)</td></tr> +<tr class="memdesc:ad65f9ec25686acfbd2a59683cc99be12"><td class="mdescLeft"> </td><td class="mdescRight">Floating-point sort algorithm using random access iterators with just right-shift functor. <a href="#ad65f9ec25686acfbd2a59683cc99be12">More...</a><br /></td></tr> +<tr class="separator:ad65f9ec25686acfbd2a59683cc99be12"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift , class Compare > </td></tr> +<tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">boost::sort::float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)</td></tr> +<tr class="memdesc:a941746cb1461c5f4971c2cf1efb9301e"><td class="mdescLeft"> </td><td class="mdescRight">Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator. <a href="#a941746cb1461c5f4971c2cf1efb9301e">More...</a><br /></td></tr> +<tr class="separator:a941746cb1461c5f4971c2cf1efb9301e"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/float__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/float__sort_8hpp_source.html new file mode 100644 index 000000000..a8078908b --- /dev/null +++ b/libs/sort/doc/doxygen/html/float__sort_8hpp_source.html @@ -0,0 +1,244 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/float_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">float_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="float__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//Templated Spreadsort-based implementation of float_sort and float_mem_cast</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort/ for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">float_mem_cast fix provided by:</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Scott McMurray</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifndef BOOST_FLOAT_SORT_HPP</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define BOOST_FLOAT_SORT_HPP</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/constants.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/float_sort.hpp></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div> +<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespaceboost.html"> 27</a></span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html"> 28</a></span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"></span></div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> \brief Casts a float to the specified integer type.</span></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"></span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> \tparam Data_type Floating-point IEEE 754/IEC559 type.</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> \tparam Cast_type Integer type (same size) to which to cast.</span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"></span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> \par Example:</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> \code</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> struct rightshift {</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> int operator()(const DATA_TYPE &x, const unsigned offset) const {</span></div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> return float_mem_cast<KEY_TYPE, CAST_TYPE>(x.key) >> offset;</span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> }</span></div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> };</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> \endcode</span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Cast_type></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">inline</span> Cast_type</div> +<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b"> 48</a></span>  <a class="code" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">float_mem_cast</a>(<span class="keyword">const</span> Data_type & data)</div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {</div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// Only cast IEEE floating-point numbers, and only to a same-sized integer.</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(Cast_type) == <span class="keyword">sizeof</span>(Data_type));</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Data_type>::is_iec559);</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Cast_type>::is_integer);</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  Cast_type result;</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  std::memcpy(&result, &data, <span class="keyword">sizeof</span>(Cast_type));</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> result;</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"></span></div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> \brief @c float_sort with casting to the appropriate size.</span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"></span></div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"></span></div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> <a href="../../doc/graph/windows_float_sort.htm"> windows_float_sort</a></span></div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> <a href="../../doc/graph/osx_float_sort.htm"> osx_float_sort</a></span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span></div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"></span></div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"></span></div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> \par A simple example of sorting some floating-point is:</span></div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> \code</span></div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> vector<float> vec;</span></div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> vec.push_back(1.0);</span></div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> vec.push_back(2.3);</span></div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> vec.push_back(1.3);</span></div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> spreadsort(vec.begin(), vec.end());</span></div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> \endcode</span></div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> \par The sorted vector contains ascending values "1.0 1.3 2.3".</span></div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"></span></div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211"> 86</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  {</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  std::sort(first, last);</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">detail::float_sort</a>(first, last);</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> \brief Floating-point sort algorithm using random access iterators with just right-shift functor.</span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> \tparam Right_shift Functor for right-shift by parameter @c shift bits.</span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"></span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> \param[in] rshift Number of bits to right-shift (using functor).</span></div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"></span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12"> 105</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  Right_shift rshift)</div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::sort(first, last);</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">detail::float_sort</a>(first, last, rshift(*first, 0), rshift);</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"></span></div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> \brief Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator.</span></div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span></div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> \tparam Right_shift functor for right-shift by parameter @c shift bits.</span></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"></span></div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> \param[in] rshift Number of bits to right-shift (using functor).</span></div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> \param[in] comp comparison functor.</span></div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Right_shift, <span class="keyword">class</span> Compare></div> +<div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e"> 129</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  Right_shift rshift, Compare comp)</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">detail::float_sort</a>(first, last, rshift(*first, 0), rshift, comp);</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> }</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> }</div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> float_sort.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a941746cb1461c5f4971c2cf1efb9301e"><div class="ttname"><a href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">boost::sort::float_sort</a></div><div class="ttdeci">void float_sort(RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)</div><div class="ttdoc">Float sort algorithm using random access iterators with both right-shift and user-defined comparison ...</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:129</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_ac3a946e197df6cfc4968c6371ace319b"><div class="ttname"><a href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">boost::sort::float_mem_cast</a></div><div class="ttdeci">Cast_type float_mem_cast(const Data_type &data)</div><div class="ttdoc">Casts a float to the specified integer type. </div><div class="ttdef"><b>Definition:</b> float_sort.hpp:48</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_acbcfc139de18c5c35c0ff1744c56e211"><div class="ttname"><a href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">boost::sort::float_sort</a></div><div class="ttdeci">void float_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">float_sort with casting to the appropriate size. </div><div class="ttdef"><b>Definition:</b> float_sort.hpp:86</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/floatfunctorsample_8cpp.html b/libs/sort/doc/doxygen/html/floatfunctorsample_8cpp.html new file mode 100644 index 000000000..acc4b83c1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/floatfunctorsample_8cpp.html @@ -0,0 +1,188 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/floatfunctorsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">floatfunctorsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html">rightshift</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html">lessthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:a38779bfd63dd113c9f7602664546a58c"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="floatfunctorsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>   int</td></tr> +<tr class="separator:a38779bfd63dd113c9f7602664546a58c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ae35c40bc2f912c11f0e36ac66cba4489"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">KEY_TYPE</a>   float</td></tr> +<tr class="separator:ae35c40bc2f912c11f0e36ac66cba4489"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="floatfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a38779bfd63dd113c9f7602664546a58c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define CAST_TYPE   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ae35c40bc2f912c11f0e36ac66cba4489"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define KEY_TYPE   float</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/floatsample_8cpp.html b/libs/sort/doc/doxygen/html/floatsample_8cpp.html new file mode 100644 index 000000000..772dcf406 --- /dev/null +++ b/libs/sort/doc/doxygen/html/floatsample_8cpp.html @@ -0,0 +1,177 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/floatsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">floatsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="floatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   float</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a38779bfd63dd113c9f7602664546a58c"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="floatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>   int</td></tr> +<tr class="separator:a38779bfd63dd113c9f7602664546a58c"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="floatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a38779bfd63dd113c9f7602664546a58c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define CAST_TYPE   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   float</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/folderclosed.png b/libs/sort/doc/doxygen/html/folderclosed.png Binary files differnew file mode 100644 index 000000000..bb8ab35ed --- /dev/null +++ b/libs/sort/doc/doxygen/html/folderclosed.png diff --git a/libs/sort/doc/doxygen/html/folderopen.png b/libs/sort/doc/doxygen/html/folderopen.png Binary files differnew file mode 100644 index 000000000..d6c7f676a --- /dev/null +++ b/libs/sort/doc/doxygen/html/folderopen.png diff --git a/libs/sort/doc/doxygen/html/ftv2blank.png b/libs/sort/doc/doxygen/html/ftv2blank.png Binary files differnew file mode 100644 index 000000000..63c605bb4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2blank.png diff --git a/libs/sort/doc/doxygen/html/ftv2doc.png b/libs/sort/doc/doxygen/html/ftv2doc.png Binary files differnew file mode 100644 index 000000000..17edabff9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2doc.png diff --git a/libs/sort/doc/doxygen/html/ftv2folderclosed.png b/libs/sort/doc/doxygen/html/ftv2folderclosed.png Binary files differnew file mode 100644 index 000000000..bb8ab35ed --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2folderclosed.png diff --git a/libs/sort/doc/doxygen/html/ftv2folderopen.png b/libs/sort/doc/doxygen/html/ftv2folderopen.png Binary files differnew file mode 100644 index 000000000..d6c7f676a --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2folderopen.png diff --git a/libs/sort/doc/doxygen/html/ftv2lastnode.png b/libs/sort/doc/doxygen/html/ftv2lastnode.png Binary files differnew file mode 100644 index 000000000..63c605bb4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2lastnode.png diff --git a/libs/sort/doc/doxygen/html/ftv2link.png b/libs/sort/doc/doxygen/html/ftv2link.png Binary files differnew file mode 100644 index 000000000..17edabff9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2link.png diff --git a/libs/sort/doc/doxygen/html/ftv2mlastnode.png b/libs/sort/doc/doxygen/html/ftv2mlastnode.png Binary files differnew file mode 100644 index 000000000..0b63f6d38 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2mlastnode.png diff --git a/libs/sort/doc/doxygen/html/ftv2mnode.png b/libs/sort/doc/doxygen/html/ftv2mnode.png Binary files differnew file mode 100644 index 000000000..0b63f6d38 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2mnode.png diff --git a/libs/sort/doc/doxygen/html/ftv2node.png b/libs/sort/doc/doxygen/html/ftv2node.png Binary files differnew file mode 100644 index 000000000..63c605bb4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2node.png diff --git a/libs/sort/doc/doxygen/html/ftv2plastnode.png b/libs/sort/doc/doxygen/html/ftv2plastnode.png Binary files differnew file mode 100644 index 000000000..c6ee22f93 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2plastnode.png diff --git a/libs/sort/doc/doxygen/html/ftv2pnode.png b/libs/sort/doc/doxygen/html/ftv2pnode.png Binary files differnew file mode 100644 index 000000000..c6ee22f93 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2pnode.png diff --git a/libs/sort/doc/doxygen/html/ftv2splitbar.png b/libs/sort/doc/doxygen/html/ftv2splitbar.png Binary files differnew file mode 100644 index 000000000..fe895f2c5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2splitbar.png diff --git a/libs/sort/doc/doxygen/html/ftv2vertline.png b/libs/sort/doc/doxygen/html/ftv2vertline.png Binary files differnew file mode 100644 index 000000000..63c605bb4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/ftv2vertline.png diff --git a/libs/sort/doc/doxygen/html/functions.html b/libs/sort/doc/doxygen/html/functions.html new file mode 100644 index 000000000..9878e030b --- /dev/null +++ b/libs/sort/doc/doxygen/html/functions.html @@ -0,0 +1,134 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Class Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li class="current"><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="functions.html"><span>All</span></a></li> + <li><a href="functions_func.html"><span>Functions</span></a></li> + <li><a href="functions_vars.html"><span>Variables</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> +<div class="textblock">Here is a list of all class members with links to the classes they belong to:</div><ul> +<li>a +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54">DATA_TYPE</a> +</li> +<li>birth +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c">DATA_TYPE</a> +</li> +<li>data +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c">DATA_TYPE</a> +</li> +<li>first_name +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403">DATA_TYPE</a> +</li> +<li>key +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">DATA_TYPE</a> +</li> +<li>last_name +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43">DATA_TYPE</a> +</li> +<li>net_worth +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621">DATA_TYPE</a> +</li> +<li>operator()() +: <a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">bracket</a> +, <a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">getsize</a> +, <a class="el" href="structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd">greaterthan</a> +, <a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">lessthan</a> +, <a class="el" href="structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2">negrightshift</a> +, <a class="el" href="structrightshift.html#a87a59db62b9d8c90a02df98442199598">rightshift</a> +</li> +<li>operator<() +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5">DATA_TYPE</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/functions_func.html b/libs/sort/doc/doxygen/html/functions_func.html new file mode 100644 index 000000000..0080be09e --- /dev/null +++ b/libs/sort/doc/doxygen/html/functions_func.html @@ -0,0 +1,113 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Class Members - Functions</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li class="current"><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="functions.html"><span>All</span></a></li> + <li class="current"><a href="functions_func.html"><span>Functions</span></a></li> + <li><a href="functions_vars.html"><span>Variables</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>operator()() +: <a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">bracket</a> +, <a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">getsize</a> +, <a class="el" href="structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd">greaterthan</a> +, <a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">lessthan</a> +, <a class="el" href="structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2">negrightshift</a> +, <a class="el" href="structrightshift.html#a3464d6de770ac9db414271587a712d12">rightshift</a> +</li> +<li>operator<() +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5">DATA_TYPE</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/functions_vars.html b/libs/sort/doc/doxygen/html/functions_vars.html new file mode 100644 index 000000000..3864228ec --- /dev/null +++ b/libs/sort/doc/doxygen/html/functions_vars.html @@ -0,0 +1,123 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Class Members - Variables</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li class="current"><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="functions.html"><span>All</span></a></li> + <li><a href="functions_func.html"><span>Functions</span></a></li> + <li class="current"><a href="functions_vars.html"><span>Variables</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>a +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54">DATA_TYPE</a> +</li> +<li>birth +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c">DATA_TYPE</a> +</li> +<li>data +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c">DATA_TYPE</a> +</li> +<li>first_name +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403">DATA_TYPE</a> +</li> +<li>key +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">DATA_TYPE</a> +</li> +<li>last_name +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43">DATA_TYPE</a> +</li> +<li>net_worth +: <a class="el" href="struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621">DATA_TYPE</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/generalizedstruct_8cpp.html b/libs/sort/doc/doxygen/html/generalizedstruct_8cpp.html new file mode 100644 index 000000000..28161b23f --- /dev/null +++ b/libs/sort/doc/doxygen/html/generalizedstruct_8cpp.html @@ -0,0 +1,157 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/generalizedstruct.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">generalizedstruct.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <<a class="el" href="float__sort_8hpp_source.html">boost/sort/spreadsort/float_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html">lessthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html">bracket</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html">getsize</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="generalizedstruct_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/globals.html b/libs/sort/doc/doxygen/html/globals.html new file mode 100644 index 000000000..96c91efc3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/globals.html @@ -0,0 +1,255 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: File Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li class="current"><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="globals.html"><span>All</span></a></li> + <li><a href="globals_func.html"><span>Functions</span></a></li> + <li><a href="globals_vars.html"><span>Variables</span></a></li> + <li><a href="globals_defs.html"><span>Macros</span></a></li> + </ul> + </div> + <div id="navrow4" class="tabs3"> + <ul class="tablist"> + <li><a href="#index_a"><span>a</span></a></li> + <li><a href="#index_b"><span>b</span></a></li> + <li><a href="#index_c"><span>c</span></a></li> + <li><a href="#index_d"><span>d</span></a></li> + <li><a href="#index_f"><span>f</span></a></li> + <li><a href="#index_g"><span>g</span></a></li> + <li><a href="#index_i"><span>i</span></a></li> + <li><a href="#index_k"><span>k</span></a></li> + <li><a href="#index_m"><span>m</span></a></li> + <li><a href="#index_r"><span>r</span></a></li> + <li><a href="#index_s"><span>s</span></a></li> + <li class="current"><a href="#index_t"><span>t</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> +<div class="textblock">Here is a list of all file members with links to the files they belong to:</div> + +<h3><a class="anchor" id="index_a"></a>- a -</h3><ul> +<li>ALR_THRESHOLD +: <a class="el" href="alrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_b"></a>- b -</h3><ul> +<li>bit_shift +: <a class="el" href="alrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_c"></a>- c -</h3><ul> +<li>CAST_TYPE +: <a class="el" href="double_8cpp.html#a38779bfd63dd113c9f7602664546a58c">double.cpp</a> +, <a class="el" href="floatfunctorsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">floatfunctorsample.cpp</a> +, <a class="el" href="floatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">floatsample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">shiftfloatsample.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_d"></a>- d -</h3><ul> +<li>DATA_TYPE +: <a class="el" href="alrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">alrbreaker.cpp</a> +, <a class="el" href="alreadysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">alreadysorted.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">binaryalrbreaker.cpp</a> +, <a class="el" href="double_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">double.cpp</a> +, <a class="el" href="floatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">floatsample.cpp</a> +, <a class="el" href="int64_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">int64.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">mostlysorted.cpp</a> +, <a class="el" href="parallelint_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">parallelint.cpp</a> +, <a class="el" href="parallelstring_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">parallelstring.cpp</a> +, <a class="el" href="reverseintsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">reverseintsample.cpp</a> +, <a class="el" href="reversestringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">reversestringsample.cpp</a> +, <a class="el" href="rightshiftsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">rightshiftsample.cpp</a> +, <a class="el" href="sample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">sample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">shiftfloatsample.cpp</a> +, <a class="el" href="stringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">stringsample.cpp</a> +, <a class="el" href="wstringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">wstringsample.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_f"></a>- f -</h3><ul> +<li>fill_vector() +: <a class="el" href="alrbreaker_8cpp.html#a53572e34857429ae9b6d9c5f4d02b453">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#ac9ac611850049644567c33a1b01e108a">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_g"></a>- g -</h3><ul> +<li>get_index() +: <a class="el" href="binaryalrbreaker_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">binaryalrbreaker.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">mostlysorted.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_i"></a>- i -</h3><ul> +<li>is_sorted() +: <a class="el" href="parallelint_8cpp.html#af6d351e5a33a6614628ba40ab9776aa6">parallelint.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_k"></a>- k -</h3><ul> +<li>KEY_TYPE +: <a class="el" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">floatfunctorsample.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_m"></a>- m -</h3><ul> +<li>main() +: <a class="el" href="alrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">alrbreaker.cpp</a> +, <a class="el" href="alreadysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">alreadysorted.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">binaryalrbreaker.cpp</a> +, <a class="el" href="boostrandomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">boostrandomgen.cpp</a> +, <a class="el" href="caseinsensitive_8cpp.html#a217dbf8b442f20279ea00b898af96f52">caseinsensitive.cpp</a> +, <a class="el" href="charstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">charstringsample.cpp</a> +, <a class="el" href="double_8cpp.html#a217dbf8b442f20279ea00b898af96f52">double.cpp</a> +, <a class="el" href="floatfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">floatfunctorsample.cpp</a> +, <a class="el" href="floatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">floatsample.cpp</a> +, <a class="el" href="generalizedstruct_8cpp.html#a217dbf8b442f20279ea00b898af96f52">generalizedstruct.cpp</a> +, <a class="el" href="int64_8cpp.html#a217dbf8b442f20279ea00b898af96f52">int64.cpp</a> +, <a class="el" href="keyplusdatasample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">keyplusdatasample.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">mostlysorted.cpp</a> +, <a class="el" href="parallelint_8cpp.html#a217dbf8b442f20279ea00b898af96f52">parallelint.cpp</a> +, <a class="el" href="parallelstring_8cpp.html#a217dbf8b442f20279ea00b898af96f52">parallelstring.cpp</a> +, <a class="el" href="randomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">randomgen.cpp</a> +, <a class="el" href="reverseintsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reverseintsample.cpp</a> +, <a class="el" href="reversestringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reversestringfunctorsample.cpp</a> +, <a class="el" href="reversestringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reversestringsample.cpp</a> +, <a class="el" href="rightshiftsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">rightshiftsample.cpp</a> +, <a class="el" href="sample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">sample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">shiftfloatsample.cpp</a> +, <a class="el" href="stringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">stringfunctorsample.cpp</a> +, <a class="el" href="stringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">stringsample.cpp</a> +, <a class="el" href="wstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">wstringsample.cpp</a> +</li> +<li>max_count +: <a class="el" href="alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_r"></a>- r -</h3><ul> +<li>radix_threshold +: <a class="el" href="alrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_s"></a>- s -</h3><ul> +<li>sort_loop() +: <a class="el" href="parallelint_8cpp.html#acbd0dadb301334e73befdafddd98b044">parallelint.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_t"></a>- t -</h3><ul> +<li>top_splits +: <a class="el" href="alrbreaker_8cpp.html#a60c4ea1dd4d297e0d2e395375e0e716c">alrbreaker.cpp</a> +</li> +<li>typed_one +: <a class="el" href="alrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">binaryalrbreaker.cpp</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/globals_defs.html b/libs/sort/doc/doxygen/html/globals_defs.html new file mode 100644 index 000000000..414d0ec00 --- /dev/null +++ b/libs/sort/doc/doxygen/html/globals_defs.html @@ -0,0 +1,133 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: File Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li class="current"><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="globals.html"><span>All</span></a></li> + <li><a href="globals_func.html"><span>Functions</span></a></li> + <li><a href="globals_vars.html"><span>Variables</span></a></li> + <li class="current"><a href="globals_defs.html"><span>Macros</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>ALR_THRESHOLD +: <a class="el" href="alrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6">binaryalrbreaker.cpp</a> +</li> +<li>CAST_TYPE +: <a class="el" href="double_8cpp.html#a38779bfd63dd113c9f7602664546a58c">double.cpp</a> +, <a class="el" href="floatfunctorsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">floatfunctorsample.cpp</a> +, <a class="el" href="floatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">floatsample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">shiftfloatsample.cpp</a> +</li> +<li>DATA_TYPE +: <a class="el" href="alrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">alrbreaker.cpp</a> +, <a class="el" href="alreadysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">alreadysorted.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">binaryalrbreaker.cpp</a> +, <a class="el" href="double_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">double.cpp</a> +, <a class="el" href="floatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">floatsample.cpp</a> +, <a class="el" href="int64_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">int64.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">mostlysorted.cpp</a> +, <a class="el" href="parallelint_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">parallelint.cpp</a> +, <a class="el" href="parallelstring_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">parallelstring.cpp</a> +, <a class="el" href="reverseintsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">reverseintsample.cpp</a> +, <a class="el" href="reversestringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">reversestringsample.cpp</a> +, <a class="el" href="rightshiftsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">rightshiftsample.cpp</a> +, <a class="el" href="sample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">sample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">shiftfloatsample.cpp</a> +, <a class="el" href="stringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">stringsample.cpp</a> +, <a class="el" href="wstringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">wstringsample.cpp</a> +</li> +<li>KEY_TYPE +: <a class="el" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">floatfunctorsample.cpp</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/globals_func.html b/libs/sort/doc/doxygen/html/globals_func.html new file mode 100644 index 000000000..de7ce55a8 --- /dev/null +++ b/libs/sort/doc/doxygen/html/globals_func.html @@ -0,0 +1,170 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: File Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li class="current"><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="globals.html"><span>All</span></a></li> + <li class="current"><a href="globals_func.html"><span>Functions</span></a></li> + <li><a href="globals_vars.html"><span>Variables</span></a></li> + <li><a href="globals_defs.html"><span>Macros</span></a></li> + </ul> + </div> + <div id="navrow4" class="tabs3"> + <ul class="tablist"> + <li><a href="#index_f"><span>f</span></a></li> + <li><a href="#index_g"><span>g</span></a></li> + <li><a href="#index_i"><span>i</span></a></li> + <li><a href="#index_m"><span>m</span></a></li> + <li class="current"><a href="#index_s"><span>s</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> +  + +<h3><a class="anchor" id="index_f"></a>- f -</h3><ul> +<li>fill_vector() +: <a class="el" href="alrbreaker_8cpp.html#a53572e34857429ae9b6d9c5f4d02b453">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#ac9ac611850049644567c33a1b01e108a">binaryalrbreaker.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_g"></a>- g -</h3><ul> +<li>get_index() +: <a class="el" href="binaryalrbreaker_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">binaryalrbreaker.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">mostlysorted.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_i"></a>- i -</h3><ul> +<li>is_sorted() +: <a class="el" href="parallelint_8cpp.html#af6d351e5a33a6614628ba40ab9776aa6">parallelint.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_m"></a>- m -</h3><ul> +<li>main() +: <a class="el" href="alrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">alrbreaker.cpp</a> +, <a class="el" href="wstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">wstringsample.cpp</a> +, <a class="el" href="stringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">stringsample.cpp</a> +, <a class="el" href="stringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">stringfunctorsample.cpp</a> +, <a class="el" href="shiftfloatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">shiftfloatsample.cpp</a> +, <a class="el" href="sample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">sample.cpp</a> +, <a class="el" href="rightshiftsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">rightshiftsample.cpp</a> +, <a class="el" href="reversestringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reversestringsample.cpp</a> +, <a class="el" href="reversestringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reversestringfunctorsample.cpp</a> +, <a class="el" href="reverseintsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">reverseintsample.cpp</a> +, <a class="el" href="randomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">randomgen.cpp</a> +, <a class="el" href="parallelstring_8cpp.html#a217dbf8b442f20279ea00b898af96f52">parallelstring.cpp</a> +, <a class="el" href="parallelint_8cpp.html#a217dbf8b442f20279ea00b898af96f52">parallelint.cpp</a> +, <a class="el" href="mostlysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">mostlysorted.cpp</a> +, <a class="el" href="keyplusdatasample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">keyplusdatasample.cpp</a> +, <a class="el" href="int64_8cpp.html#a217dbf8b442f20279ea00b898af96f52">int64.cpp</a> +, <a class="el" href="generalizedstruct_8cpp.html#a217dbf8b442f20279ea00b898af96f52">generalizedstruct.cpp</a> +, <a class="el" href="floatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">floatsample.cpp</a> +, <a class="el" href="floatfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">floatfunctorsample.cpp</a> +, <a class="el" href="double_8cpp.html#a217dbf8b442f20279ea00b898af96f52">double.cpp</a> +, <a class="el" href="charstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">charstringsample.cpp</a> +, <a class="el" href="caseinsensitive_8cpp.html#a217dbf8b442f20279ea00b898af96f52">caseinsensitive.cpp</a> +, <a class="el" href="boostrandomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">boostrandomgen.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1">binaryalrbreaker.cpp</a> +, <a class="el" href="alreadysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">alreadysorted.cpp</a> +</li> +</ul> + + +<h3><a class="anchor" id="index_s"></a>- s -</h3><ul> +<li>sort_loop() +: <a class="el" href="parallelint_8cpp.html#acbd0dadb301334e73befdafddd98b044">parallelint.cpp</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/globals_vars.html b/libs/sort/doc/doxygen/html/globals_vars.html new file mode 100644 index 000000000..58bc298fc --- /dev/null +++ b/libs/sort/doc/doxygen/html/globals_vars.html @@ -0,0 +1,121 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: File Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li class="current"><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="globals.html"><span>All</span></a></li> + <li><a href="globals_func.html"><span>Functions</span></a></li> + <li class="current"><a href="globals_vars.html"><span>Variables</span></a></li> + <li><a href="globals_defs.html"><span>Macros</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>bit_shift +: <a class="el" href="alrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de">binaryalrbreaker.cpp</a> +</li> +<li>max_count +: <a class="el" href="alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d">binaryalrbreaker.cpp</a> +</li> +<li>radix_threshold +: <a class="el" href="alrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#afc30457e398e72300f20714123913b78">binaryalrbreaker.cpp</a> +</li> +<li>top_splits +: <a class="el" href="alrbreaker_8cpp.html#a60c4ea1dd4d297e0d2e395375e0e716c">alrbreaker.cpp</a> +</li> +<li>typed_one +: <a class="el" href="alrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">alrbreaker.cpp</a> +, <a class="el" href="binaryalrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa">binaryalrbreaker.cpp</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/index.html b/libs/sort/doc/doxygen/html/index.html new file mode 100644 index 000000000..2fa067cf0 --- /dev/null +++ b/libs/sort/doc/doxygen/html/index.html @@ -0,0 +1,90 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Main Page</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li class="current"><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">Boost.Sort Documentation</div> </div> +</div><!--header--> +<div class="contents"> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/int64_8cpp.html b/libs/sort/doc/doxygen/html/int64_8cpp.html new file mode 100644 index 000000000..dcb59e939 --- /dev/null +++ b/libs/sort/doc/doxygen/html/int64_8cpp.html @@ -0,0 +1,164 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/int64.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">int64.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="int64_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   boost::int64_t</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="int64_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   boost::int64_t</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/integer__sort_8hpp.html b/libs/sort/doc/doxygen/html/integer__sort_8hpp.html new file mode 100644 index 000000000..3dbbc7776 --- /dev/null +++ b/libs/sort/doc/doxygen/html/integer__sort_8hpp.html @@ -0,0 +1,135 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/integer_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">integer_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <limits></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/constants.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/integer_sort.hpp></code><br /> +</div> +<p><a href="integer__sort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort::integer_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:ae6ffbcf932699589fd2b93879f209013"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#ae6ffbcf932699589fd2b93879f209013">More...</a><br /></td></tr> +<tr class="separator:ae6ffbcf932699589fd2b93879f209013"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift , class Compare > </td></tr> +<tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817">boost::sort::integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp)</td></tr> +<tr class="memdesc:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#aa4ebb2541be58f9f0fecd8d7c108b817">More...</a><br /></td></tr> +<tr class="separator:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift > </td></tr> +<tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">boost::sort::integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift)</td></tr> +<tr class="memdesc:ae50349854aad811f67a540d9b3aa4d4a"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#ae50349854aad811f67a540d9b3aa4d4a">More...</a><br /></td></tr> +<tr class="separator:ae50349854aad811f67a540d9b3aa4d4a"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/integer__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/integer__sort_8hpp_source.html new file mode 100644 index 000000000..b88ff8790 --- /dev/null +++ b/libs/sort/doc/doxygen/html/integer__sort_8hpp_source.html @@ -0,0 +1,300 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/integer_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">integer_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="integer__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//Templated Spreadsort-based implementation of integer_sort</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort/ for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"></span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Doxygen comments by Paul A. Bristow Jan 2015</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"></span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#ifndef BOOST_INTEGER_SORT_HPP</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#define BOOST_INTEGER_SORT_HPP</span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/constants.hpp></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/integer_sort.hpp></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">//Top-level sorting call for integers.</span></div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"></span></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">/*! \brief Integer sort algorithm using random access iterators.</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"></span></div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"></span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"></span></div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"></span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"></span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"></span></div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013"> 75</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  {</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// Don't sort if it's too small to optimize.</span></div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  std::sort(first, last);</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">detail::integer_sort</a>(first, last, *first >> 0);</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"></span></div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">/*! \brief Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator.</span></div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"></span></div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"></span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> \tparam Right_shift functor for right-shift by parameter @c shift bits.</span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"></span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> \param[in] shift Number of bits to right-shift (using functor).</span></div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> \param[in] comp comparison functor.</span></div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"></span></div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"></span></div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"></span></div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span></div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"></span></div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Right_shift, <span class="keyword">class</span> Compare></div> +<div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817"> 132</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  Right_shift shift, Compare comp) {</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">detail::integer_sort</a>(first, last, shift(*first, 0), shift, comp);</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"></span></div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">/*! \brief Integer sort algorithm using random access iterators with just right-shift functor.</span></div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"></span></div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"></span></div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">\par Performance:</span></div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a>\n</span></div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"></span></div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> \tparam Right_shift functor for right-shift by parameter @c shift bits.</span></div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"></span></div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> \param[in] shift Number of bits to right-shift (using functor).</span></div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"></span></div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"></span></div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"></span></div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"></span></div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"></span></div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Right_shift></div> +<div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a"> 186</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  Right_shift shift) {</div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  std::sort(first, last);</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">detail::integer_sort</a>(first, last, shift(*first, 0), shift);</div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> }</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> }</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div> +<div class="ttc" id="namespaceboost_1_1sort_html_ae6ffbcf932699589fd2b93879f209013"><div class="ttname"><a href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort::integer_sort</a></div><div class="ttdeci">void integer_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">Integer sort algorithm using random access iterators. (All variants fall back to std::sort if the dat...</div><div class="ttdef"><b>Definition:</b> integer_sort.hpp:75</div></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> float_sort.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_ae50349854aad811f67a540d9b3aa4d4a"><div class="ttname"><a href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">boost::sort::integer_sort</a></div><div class="ttdeci">void integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift)</div><div class="ttdoc">Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to std::sort if the data size is too small, < detail::min_sort_size). </div><div class="ttdef"><b>Definition:</b> integer_sort.hpp:186</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/jquery.js b/libs/sort/doc/doxygen/html/jquery.js new file mode 100644 index 000000000..1f4d0b47c --- /dev/null +++ b/libs/sort/doc/doxygen/html/jquery.js @@ -0,0 +1,68 @@ +/*! + * jQuery JavaScript Library v1.7.1 + * http://jquery.com/ + * + * Copyright 2011, John Resig + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * Includes Sizzle.js + * http://sizzlejs.com/ + * Copyright 2011, The Dojo Foundation + * Released under the MIT, BSD, and GPL Licenses. + * + * Date: Mon Nov 21 21:11:03 2011 -0500 + */ +(function(bb,L){var av=bb.document,bu=bb.navigator,bl=bb.location;var b=(function(){var bF=function(b0,b1){return new bF.fn.init(b0,b1,bD)},bU=bb.jQuery,bH=bb.$,bD,bY=/^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/,bM=/\S/,bI=/^\s+/,bE=/\s+$/,bA=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,bN=/^[\],:{}\s]*$/,bW=/\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,bP=/"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,bJ=/(?:^|:|,)(?:\s*\[)+/g,by=/(webkit)[ \/]([\w.]+)/,bR=/(opera)(?:.*version)?[ \/]([\w.]+)/,bQ=/(msie) ([\w.]+)/,bS=/(mozilla)(?:.*? rv:([\w.]+))?/,bB=/-([a-z]|[0-9])/ig,bZ=/^-ms-/,bT=function(b0,b1){return(b1+"").toUpperCase()},bX=bu.userAgent,bV,bC,e,bL=Object.prototype.toString,bG=Object.prototype.hasOwnProperty,bz=Array.prototype.push,bK=Array.prototype.slice,bO=String.prototype.trim,bv=Array.prototype.indexOf,bx={};bF.fn=bF.prototype={constructor:bF,init:function(b0,b4,b3){var b2,b5,b1,b6;if(!b0){return this}if(b0.nodeType){this.context=this[0]=b0;this.length=1;return this}if(b0==="body"&&!b4&&av.body){this.context=av;this[0]=av.body;this.selector=b0;this.length=1;return this}if(typeof b0==="string"){if(b0.charAt(0)==="<"&&b0.charAt(b0.length-1)===">"&&b0.length>=3){b2=[null,b0,null]}else{b2=bY.exec(b0)}if(b2&&(b2[1]||!b4)){if(b2[1]){b4=b4 instanceof bF?b4[0]:b4;b6=(b4?b4.ownerDocument||b4:av);b1=bA.exec(b0);if(b1){if(bF.isPlainObject(b4)){b0=[av.createElement(b1[1])];bF.fn.attr.call(b0,b4,true)}else{b0=[b6.createElement(b1[1])]}}else{b1=bF.buildFragment([b2[1]],[b6]);b0=(b1.cacheable?bF.clone(b1.fragment):b1.fragment).childNodes}return bF.merge(this,b0)}else{b5=av.getElementById(b2[2]);if(b5&&b5.parentNode){if(b5.id!==b2[2]){return b3.find(b0)}this.length=1;this[0]=b5}this.context=av;this.selector=b0;return this}}else{if(!b4||b4.jquery){return(b4||b3).find(b0)}else{return this.constructor(b4).find(b0)}}}else{if(bF.isFunction(b0)){return b3.ready(b0)}}if(b0.selector!==L){this.selector=b0.selector;this.context=b0.context}return bF.makeArray(b0,this)},selector:"",jquery:"1.7.1",length:0,size:function(){return this.length},toArray:function(){return bK.call(this,0)},get:function(b0){return b0==null?this.toArray():(b0<0?this[this.length+b0]:this[b0])},pushStack:function(b1,b3,b0){var b2=this.constructor();if(bF.isArray(b1)){bz.apply(b2,b1)}else{bF.merge(b2,b1)}b2.prevObject=this;b2.context=this.context;if(b3==="find"){b2.selector=this.selector+(this.selector?" ":"")+b0}else{if(b3){b2.selector=this.selector+"."+b3+"("+b0+")"}}return b2},each:function(b1,b0){return bF.each(this,b1,b0)},ready:function(b0){bF.bindReady();bC.add(b0);return this},eq:function(b0){b0=+b0;return b0===-1?this.slice(b0):this.slice(b0,b0+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(bK.apply(this,arguments),"slice",bK.call(arguments).join(","))},map:function(b0){return this.pushStack(bF.map(this,function(b2,b1){return b0.call(b2,b1,b2)}))},end:function(){return this.prevObject||this.constructor(null)},push:bz,sort:[].sort,splice:[].splice};bF.fn.init.prototype=bF.fn;bF.extend=bF.fn.extend=function(){var b9,b2,b0,b1,b6,b7,b5=arguments[0]||{},b4=1,b3=arguments.length,b8=false;if(typeof b5==="boolean"){b8=b5;b5=arguments[1]||{};b4=2}if(typeof b5!=="object"&&!bF.isFunction(b5)){b5={}}if(b3===b4){b5=this;--b4}for(;b4<b3;b4++){if((b9=arguments[b4])!=null){for(b2 in b9){b0=b5[b2];b1=b9[b2];if(b5===b1){continue}if(b8&&b1&&(bF.isPlainObject(b1)||(b6=bF.isArray(b1)))){if(b6){b6=false;b7=b0&&bF.isArray(b0)?b0:[]}else{b7=b0&&bF.isPlainObject(b0)?b0:{}}b5[b2]=bF.extend(b8,b7,b1)}else{if(b1!==L){b5[b2]=b1}}}}}return b5};bF.extend({noConflict:function(b0){if(bb.$===bF){bb.$=bH}if(b0&&bb.jQuery===bF){bb.jQuery=bU}return bF},isReady:false,readyWait:1,holdReady:function(b0){if(b0){bF.readyWait++}else{bF.ready(true)}},ready:function(b0){if((b0===true&&!--bF.readyWait)||(b0!==true&&!bF.isReady)){if(!av.body){return setTimeout(bF.ready,1)}bF.isReady=true;if(b0!==true&&--bF.readyWait>0){return}bC.fireWith(av,[bF]);if(bF.fn.trigger){bF(av).trigger("ready").off("ready")}}},bindReady:function(){if(bC){return}bC=bF.Callbacks("once memory");if(av.readyState==="complete"){return setTimeout(bF.ready,1)}if(av.addEventListener){av.addEventListener("DOMContentLoaded",e,false);bb.addEventListener("load",bF.ready,false)}else{if(av.attachEvent){av.attachEvent("onreadystatechange",e);bb.attachEvent("onload",bF.ready);var b0=false;try{b0=bb.frameElement==null}catch(b1){}if(av.documentElement.doScroll&&b0){bw()}}}},isFunction:function(b0){return bF.type(b0)==="function"},isArray:Array.isArray||function(b0){return bF.type(b0)==="array"},isWindow:function(b0){return b0&&typeof b0==="object"&&"setInterval" in b0},isNumeric:function(b0){return !isNaN(parseFloat(b0))&&isFinite(b0)},type:function(b0){return b0==null?String(b0):bx[bL.call(b0)]||"object"},isPlainObject:function(b2){if(!b2||bF.type(b2)!=="object"||b2.nodeType||bF.isWindow(b2)){return false}try{if(b2.constructor&&!bG.call(b2,"constructor")&&!bG.call(b2.constructor.prototype,"isPrototypeOf")){return false}}catch(b1){return false}var b0;for(b0 in b2){}return b0===L||bG.call(b2,b0)},isEmptyObject:function(b1){for(var b0 in b1){return false}return true},error:function(b0){throw new Error(b0)},parseJSON:function(b0){if(typeof b0!=="string"||!b0){return null}b0=bF.trim(b0);if(bb.JSON&&bb.JSON.parse){return bb.JSON.parse(b0)}if(bN.test(b0.replace(bW,"@").replace(bP,"]").replace(bJ,""))){return(new Function("return "+b0))()}bF.error("Invalid JSON: "+b0)},parseXML:function(b2){var b0,b1;try{if(bb.DOMParser){b1=new DOMParser();b0=b1.parseFromString(b2,"text/xml")}else{b0=new ActiveXObject("Microsoft.XMLDOM");b0.async="false";b0.loadXML(b2)}}catch(b3){b0=L}if(!b0||!b0.documentElement||b0.getElementsByTagName("parsererror").length){bF.error("Invalid XML: "+b2)}return b0},noop:function(){},globalEval:function(b0){if(b0&&bM.test(b0)){(bb.execScript||function(b1){bb["eval"].call(bb,b1)})(b0)}},camelCase:function(b0){return b0.replace(bZ,"ms-").replace(bB,bT)},nodeName:function(b1,b0){return b1.nodeName&&b1.nodeName.toUpperCase()===b0.toUpperCase()},each:function(b3,b6,b2){var b1,b4=0,b5=b3.length,b0=b5===L||bF.isFunction(b3);if(b2){if(b0){for(b1 in b3){if(b6.apply(b3[b1],b2)===false){break}}}else{for(;b4<b5;){if(b6.apply(b3[b4++],b2)===false){break}}}}else{if(b0){for(b1 in b3){if(b6.call(b3[b1],b1,b3[b1])===false){break}}}else{for(;b4<b5;){if(b6.call(b3[b4],b4,b3[b4++])===false){break}}}}return b3},trim:bO?function(b0){return b0==null?"":bO.call(b0)}:function(b0){return b0==null?"":b0.toString().replace(bI,"").replace(bE,"")},makeArray:function(b3,b1){var b0=b1||[];if(b3!=null){var b2=bF.type(b3);if(b3.length==null||b2==="string"||b2==="function"||b2==="regexp"||bF.isWindow(b3)){bz.call(b0,b3)}else{bF.merge(b0,b3)}}return b0},inArray:function(b2,b3,b1){var b0;if(b3){if(bv){return bv.call(b3,b2,b1)}b0=b3.length;b1=b1?b1<0?Math.max(0,b0+b1):b1:0;for(;b1<b0;b1++){if(b1 in b3&&b3[b1]===b2){return b1}}}return -1},merge:function(b4,b2){var b3=b4.length,b1=0;if(typeof b2.length==="number"){for(var b0=b2.length;b1<b0;b1++){b4[b3++]=b2[b1]}}else{while(b2[b1]!==L){b4[b3++]=b2[b1++]}}b4.length=b3;return b4},grep:function(b1,b6,b0){var b2=[],b5;b0=!!b0;for(var b3=0,b4=b1.length;b3<b4;b3++){b5=!!b6(b1[b3],b3);if(b0!==b5){b2.push(b1[b3])}}return b2},map:function(b0,b7,b8){var b5,b6,b4=[],b2=0,b1=b0.length,b3=b0 instanceof bF||b1!==L&&typeof b1==="number"&&((b1>0&&b0[0]&&b0[b1-1])||b1===0||bF.isArray(b0));if(b3){for(;b2<b1;b2++){b5=b7(b0[b2],b2,b8);if(b5!=null){b4[b4.length]=b5}}}else{for(b6 in b0){b5=b7(b0[b6],b6,b8);if(b5!=null){b4[b4.length]=b5}}}return b4.concat.apply([],b4)},guid:1,proxy:function(b4,b3){if(typeof b3==="string"){var b2=b4[b3];b3=b4;b4=b2}if(!bF.isFunction(b4)){return L}var b0=bK.call(arguments,2),b1=function(){return b4.apply(b3,b0.concat(bK.call(arguments)))};b1.guid=b4.guid=b4.guid||b1.guid||bF.guid++;return b1},access:function(b0,b8,b6,b2,b5,b7){var b1=b0.length;if(typeof b8==="object"){for(var b3 in b8){bF.access(b0,b3,b8[b3],b2,b5,b6)}return b0}if(b6!==L){b2=!b7&&b2&&bF.isFunction(b6);for(var b4=0;b4<b1;b4++){b5(b0[b4],b8,b2?b6.call(b0[b4],b4,b5(b0[b4],b8)):b6,b7)}return b0}return b1?b5(b0[0],b8):L},now:function(){return(new Date()).getTime()},uaMatch:function(b1){b1=b1.toLowerCase();var b0=by.exec(b1)||bR.exec(b1)||bQ.exec(b1)||b1.indexOf("compatible")<0&&bS.exec(b1)||[];return{browser:b0[1]||"",version:b0[2]||"0"}},sub:function(){function b0(b3,b4){return new b0.fn.init(b3,b4)}bF.extend(true,b0,this);b0.superclass=this;b0.fn=b0.prototype=this();b0.fn.constructor=b0;b0.sub=this.sub;b0.fn.init=function b2(b3,b4){if(b4&&b4 instanceof bF&&!(b4 instanceof b0)){b4=b0(b4)}return bF.fn.init.call(this,b3,b4,b1)};b0.fn.init.prototype=b0.fn;var b1=b0(av);return b0},browser:{}});bF.each("Boolean Number String Function Array Date RegExp Object".split(" "),function(b1,b0){bx["[object "+b0+"]"]=b0.toLowerCase()});bV=bF.uaMatch(bX);if(bV.browser){bF.browser[bV.browser]=true;bF.browser.version=bV.version}if(bF.browser.webkit){bF.browser.safari=true}if(bM.test("\xA0")){bI=/^[\s\xA0]+/;bE=/[\s\xA0]+$/}bD=bF(av);if(av.addEventListener){e=function(){av.removeEventListener("DOMContentLoaded",e,false);bF.ready()}}else{if(av.attachEvent){e=function(){if(av.readyState==="complete"){av.detachEvent("onreadystatechange",e);bF.ready()}}}}function bw(){if(bF.isReady){return}try{av.documentElement.doScroll("left")}catch(b0){setTimeout(bw,1);return}bF.ready()}return bF})();var a2={};function X(e){var bv=a2[e]={},bw,bx;e=e.split(/\s+/);for(bw=0,bx=e.length;bw<bx;bw++){bv[e[bw]]=true}return bv}b.Callbacks=function(bw){bw=bw?(a2[bw]||X(bw)):{};var bB=[],bC=[],bx,by,bv,bz,bA,bE=function(bF){var bG,bJ,bI,bH,bK;for(bG=0,bJ=bF.length;bG<bJ;bG++){bI=bF[bG];bH=b.type(bI);if(bH==="array"){bE(bI)}else{if(bH==="function"){if(!bw.unique||!bD.has(bI)){bB.push(bI)}}}}},e=function(bG,bF){bF=bF||[];bx=!bw.memory||[bG,bF];by=true;bA=bv||0;bv=0;bz=bB.length;for(;bB&&bA<bz;bA++){if(bB[bA].apply(bG,bF)===false&&bw.stopOnFalse){bx=true;break}}by=false;if(bB){if(!bw.once){if(bC&&bC.length){bx=bC.shift();bD.fireWith(bx[0],bx[1])}}else{if(bx===true){bD.disable()}else{bB=[]}}}},bD={add:function(){if(bB){var bF=bB.length;bE(arguments);if(by){bz=bB.length}else{if(bx&&bx!==true){bv=bF;e(bx[0],bx[1])}}}return this},remove:function(){if(bB){var bF=arguments,bH=0,bI=bF.length;for(;bH<bI;bH++){for(var bG=0;bG<bB.length;bG++){if(bF[bH]===bB[bG]){if(by){if(bG<=bz){bz--;if(bG<=bA){bA--}}}bB.splice(bG--,1);if(bw.unique){break}}}}}return this},has:function(bG){if(bB){var bF=0,bH=bB.length;for(;bF<bH;bF++){if(bG===bB[bF]){return true}}}return false},empty:function(){bB=[];return this},disable:function(){bB=bC=bx=L;return this},disabled:function(){return !bB},lock:function(){bC=L;if(!bx||bx===true){bD.disable()}return this},locked:function(){return !bC},fireWith:function(bG,bF){if(bC){if(by){if(!bw.once){bC.push([bG,bF])}}else{if(!(bw.once&&bx)){e(bG,bF)}}}return this},fire:function(){bD.fireWith(this,arguments);return this},fired:function(){return !!bx}};return bD};var aJ=[].slice;b.extend({Deferred:function(by){var bx=b.Callbacks("once memory"),bw=b.Callbacks("once memory"),bv=b.Callbacks("memory"),e="pending",bA={resolve:bx,reject:bw,notify:bv},bC={done:bx.add,fail:bw.add,progress:bv.add,state:function(){return e},isResolved:bx.fired,isRejected:bw.fired,then:function(bE,bD,bF){bB.done(bE).fail(bD).progress(bF);return this},always:function(){bB.done.apply(bB,arguments).fail.apply(bB,arguments);return this},pipe:function(bF,bE,bD){return b.Deferred(function(bG){b.each({done:[bF,"resolve"],fail:[bE,"reject"],progress:[bD,"notify"]},function(bI,bL){var bH=bL[0],bK=bL[1],bJ;if(b.isFunction(bH)){bB[bI](function(){bJ=bH.apply(this,arguments);if(bJ&&b.isFunction(bJ.promise)){bJ.promise().then(bG.resolve,bG.reject,bG.notify)}else{bG[bK+"With"](this===bB?bG:this,[bJ])}})}else{bB[bI](bG[bK])}})}).promise()},promise:function(bE){if(bE==null){bE=bC}else{for(var bD in bC){bE[bD]=bC[bD]}}return bE}},bB=bC.promise({}),bz;for(bz in bA){bB[bz]=bA[bz].fire;bB[bz+"With"]=bA[bz].fireWith}bB.done(function(){e="resolved"},bw.disable,bv.lock).fail(function(){e="rejected"},bx.disable,bv.lock);if(by){by.call(bB,bB)}return bB},when:function(bA){var bx=aJ.call(arguments,0),bv=0,e=bx.length,bB=new Array(e),bw=e,by=e,bC=e<=1&&bA&&b.isFunction(bA.promise)?bA:b.Deferred(),bE=bC.promise();function bD(bF){return function(bG){bx[bF]=arguments.length>1?aJ.call(arguments,0):bG;if(!(--bw)){bC.resolveWith(bC,bx)}}}function bz(bF){return function(bG){bB[bF]=arguments.length>1?aJ.call(arguments,0):bG;bC.notifyWith(bE,bB)}}if(e>1){for(;bv<e;bv++){if(bx[bv]&&bx[bv].promise&&b.isFunction(bx[bv].promise)){bx[bv].promise().then(bD(bv),bC.reject,bz(bv))}else{--bw}}if(!bw){bC.resolveWith(bC,bx)}}else{if(bC!==bA){bC.resolveWith(bC,e?[bA]:[])}}return bE}});b.support=(function(){var bJ,bI,bF,bG,bx,bE,bA,bD,bz,bK,bB,by,bw,bv=av.createElement("div"),bH=av.documentElement;bv.setAttribute("className","t");bv.innerHTML=" <link/><table></table><a href='/a' style='top:1px;float:left;opacity:.55;'>a</a><input type='checkbox'/>";bI=bv.getElementsByTagName("*");bF=bv.getElementsByTagName("a")[0];if(!bI||!bI.length||!bF){return{}}bG=av.createElement("select");bx=bG.appendChild(av.createElement("option"));bE=bv.getElementsByTagName("input")[0];bJ={leadingWhitespace:(bv.firstChild.nodeType===3),tbody:!bv.getElementsByTagName("tbody").length,htmlSerialize:!!bv.getElementsByTagName("link").length,style:/top/.test(bF.getAttribute("style")),hrefNormalized:(bF.getAttribute("href")==="/a"),opacity:/^0.55/.test(bF.style.opacity),cssFloat:!!bF.style.cssFloat,checkOn:(bE.value==="on"),optSelected:bx.selected,getSetAttribute:bv.className!=="t",enctype:!!av.createElement("form").enctype,html5Clone:av.createElement("nav").cloneNode(true).outerHTML!=="<:nav></:nav>",submitBubbles:true,changeBubbles:true,focusinBubbles:false,deleteExpando:true,noCloneEvent:true,inlineBlockNeedsLayout:false,shrinkWrapBlocks:false,reliableMarginRight:true};bE.checked=true;bJ.noCloneChecked=bE.cloneNode(true).checked;bG.disabled=true;bJ.optDisabled=!bx.disabled;try{delete bv.test}catch(bC){bJ.deleteExpando=false}if(!bv.addEventListener&&bv.attachEvent&&bv.fireEvent){bv.attachEvent("onclick",function(){bJ.noCloneEvent=false});bv.cloneNode(true).fireEvent("onclick")}bE=av.createElement("input");bE.value="t";bE.setAttribute("type","radio");bJ.radioValue=bE.value==="t";bE.setAttribute("checked","checked");bv.appendChild(bE);bD=av.createDocumentFragment();bD.appendChild(bv.lastChild);bJ.checkClone=bD.cloneNode(true).cloneNode(true).lastChild.checked;bJ.appendChecked=bE.checked;bD.removeChild(bE);bD.appendChild(bv);bv.innerHTML="";if(bb.getComputedStyle){bA=av.createElement("div");bA.style.width="0";bA.style.marginRight="0";bv.style.width="2px";bv.appendChild(bA);bJ.reliableMarginRight=(parseInt((bb.getComputedStyle(bA,null)||{marginRight:0}).marginRight,10)||0)===0}if(bv.attachEvent){for(by in {submit:1,change:1,focusin:1}){bB="on"+by;bw=(bB in bv);if(!bw){bv.setAttribute(bB,"return;");bw=(typeof bv[bB]==="function")}bJ[by+"Bubbles"]=bw}}bD.removeChild(bv);bD=bG=bx=bA=bv=bE=null;b(function(){var bM,bU,bV,bT,bN,bO,bL,bS,bR,e,bP,bQ=av.getElementsByTagName("body")[0];if(!bQ){return}bL=1;bS="position:absolute;top:0;left:0;width:1px;height:1px;margin:0;";bR="visibility:hidden;border:0;";e="style='"+bS+"border:5px solid #000;padding:0;'";bP="<div "+e+"><div></div></div><table "+e+" cellpadding='0' cellspacing='0'><tr><td></td></tr></table>";bM=av.createElement("div");bM.style.cssText=bR+"width:0;height:0;position:static;top:0;margin-top:"+bL+"px";bQ.insertBefore(bM,bQ.firstChild);bv=av.createElement("div");bM.appendChild(bv);bv.innerHTML="<table><tr><td style='padding:0;border:0;display:none'></td><td>t</td></tr></table>";bz=bv.getElementsByTagName("td");bw=(bz[0].offsetHeight===0);bz[0].style.display="";bz[1].style.display="none";bJ.reliableHiddenOffsets=bw&&(bz[0].offsetHeight===0);bv.innerHTML="";bv.style.width=bv.style.paddingLeft="1px";b.boxModel=bJ.boxModel=bv.offsetWidth===2;if(typeof bv.style.zoom!=="undefined"){bv.style.display="inline";bv.style.zoom=1;bJ.inlineBlockNeedsLayout=(bv.offsetWidth===2);bv.style.display="";bv.innerHTML="<div style='width:4px;'></div>";bJ.shrinkWrapBlocks=(bv.offsetWidth!==2)}bv.style.cssText=bS+bR;bv.innerHTML=bP;bU=bv.firstChild;bV=bU.firstChild;bN=bU.nextSibling.firstChild.firstChild;bO={doesNotAddBorder:(bV.offsetTop!==5),doesAddBorderForTableAndCells:(bN.offsetTop===5)};bV.style.position="fixed";bV.style.top="20px";bO.fixedPosition=(bV.offsetTop===20||bV.offsetTop===15);bV.style.position=bV.style.top="";bU.style.overflow="hidden";bU.style.position="relative";bO.subtractsBorderForOverflowNotVisible=(bV.offsetTop===-5);bO.doesNotIncludeMarginInBodyOffset=(bQ.offsetTop!==bL);bQ.removeChild(bM);bv=bM=null;b.extend(bJ,bO)});return bJ})();var aS=/^(?:\{.*\}|\[.*\])$/,aA=/([A-Z])/g;b.extend({cache:{},uuid:0,expando:"jQuery"+(b.fn.jquery+Math.random()).replace(/\D/g,""),noData:{embed:true,object:"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",applet:true},hasData:function(e){e=e.nodeType?b.cache[e[b.expando]]:e[b.expando];return !!e&&!S(e)},data:function(bx,bv,bz,by){if(!b.acceptData(bx)){return}var bG,bA,bD,bE=b.expando,bC=typeof bv==="string",bF=bx.nodeType,e=bF?b.cache:bx,bw=bF?bx[bE]:bx[bE]&&bE,bB=bv==="events";if((!bw||!e[bw]||(!bB&&!by&&!e[bw].data))&&bC&&bz===L){return}if(!bw){if(bF){bx[bE]=bw=++b.uuid}else{bw=bE}}if(!e[bw]){e[bw]={};if(!bF){e[bw].toJSON=b.noop}}if(typeof bv==="object"||typeof bv==="function"){if(by){e[bw]=b.extend(e[bw],bv)}else{e[bw].data=b.extend(e[bw].data,bv)}}bG=bA=e[bw];if(!by){if(!bA.data){bA.data={}}bA=bA.data}if(bz!==L){bA[b.camelCase(bv)]=bz}if(bB&&!bA[bv]){return bG.events}if(bC){bD=bA[bv];if(bD==null){bD=bA[b.camelCase(bv)]}}else{bD=bA}return bD},removeData:function(bx,bv,by){if(!b.acceptData(bx)){return}var bB,bA,bz,bC=b.expando,bD=bx.nodeType,e=bD?b.cache:bx,bw=bD?bx[bC]:bC;if(!e[bw]){return}if(bv){bB=by?e[bw]:e[bw].data;if(bB){if(!b.isArray(bv)){if(bv in bB){bv=[bv]}else{bv=b.camelCase(bv);if(bv in bB){bv=[bv]}else{bv=bv.split(" ")}}}for(bA=0,bz=bv.length;bA<bz;bA++){delete bB[bv[bA]]}if(!(by?S:b.isEmptyObject)(bB)){return}}}if(!by){delete e[bw].data;if(!S(e[bw])){return}}if(b.support.deleteExpando||!e.setInterval){delete e[bw]}else{e[bw]=null}if(bD){if(b.support.deleteExpando){delete bx[bC]}else{if(bx.removeAttribute){bx.removeAttribute(bC)}else{bx[bC]=null}}}},_data:function(bv,e,bw){return b.data(bv,e,bw,true)},acceptData:function(bv){if(bv.nodeName){var e=b.noData[bv.nodeName.toLowerCase()];if(e){return !(e===true||bv.getAttribute("classid")!==e)}}return true}});b.fn.extend({data:function(by,bA){var bB,e,bw,bz=null;if(typeof by==="undefined"){if(this.length){bz=b.data(this[0]);if(this[0].nodeType===1&&!b._data(this[0],"parsedAttrs")){e=this[0].attributes;for(var bx=0,bv=e.length;bx<bv;bx++){bw=e[bx].name;if(bw.indexOf("data-")===0){bw=b.camelCase(bw.substring(5));a5(this[0],bw,bz[bw])}}b._data(this[0],"parsedAttrs",true)}}return bz}else{if(typeof by==="object"){return this.each(function(){b.data(this,by)})}}bB=by.split(".");bB[1]=bB[1]?"."+bB[1]:"";if(bA===L){bz=this.triggerHandler("getData"+bB[1]+"!",[bB[0]]);if(bz===L&&this.length){bz=b.data(this[0],by);bz=a5(this[0],by,bz)}return bz===L&&bB[1]?this.data(bB[0]):bz}else{return this.each(function(){var bC=b(this),bD=[bB[0],bA];bC.triggerHandler("setData"+bB[1]+"!",bD);b.data(this,by,bA);bC.triggerHandler("changeData"+bB[1]+"!",bD)})}},removeData:function(e){return this.each(function(){b.removeData(this,e)})}});function a5(bx,bw,by){if(by===L&&bx.nodeType===1){var bv="data-"+bw.replace(aA,"-$1").toLowerCase();by=bx.getAttribute(bv);if(typeof by==="string"){try{by=by==="true"?true:by==="false"?false:by==="null"?null:b.isNumeric(by)?parseFloat(by):aS.test(by)?b.parseJSON(by):by}catch(bz){}b.data(bx,bw,by)}else{by=L}}return by}function S(bv){for(var e in bv){if(e==="data"&&b.isEmptyObject(bv[e])){continue}if(e!=="toJSON"){return false}}return true}function bi(by,bx,bA){var bw=bx+"defer",bv=bx+"queue",e=bx+"mark",bz=b._data(by,bw);if(bz&&(bA==="queue"||!b._data(by,bv))&&(bA==="mark"||!b._data(by,e))){setTimeout(function(){if(!b._data(by,bv)&&!b._data(by,e)){b.removeData(by,bw,true);bz.fire()}},0)}}b.extend({_mark:function(bv,e){if(bv){e=(e||"fx")+"mark";b._data(bv,e,(b._data(bv,e)||0)+1)}},_unmark:function(by,bx,bv){if(by!==true){bv=bx;bx=by;by=false}if(bx){bv=bv||"fx";var e=bv+"mark",bw=by?0:((b._data(bx,e)||1)-1);if(bw){b._data(bx,e,bw)}else{b.removeData(bx,e,true);bi(bx,bv,"mark")}}},queue:function(bv,e,bx){var bw;if(bv){e=(e||"fx")+"queue";bw=b._data(bv,e);if(bx){if(!bw||b.isArray(bx)){bw=b._data(bv,e,b.makeArray(bx))}else{bw.push(bx)}}return bw||[]}},dequeue:function(by,bx){bx=bx||"fx";var bv=b.queue(by,bx),bw=bv.shift(),e={};if(bw==="inprogress"){bw=bv.shift()}if(bw){if(bx==="fx"){bv.unshift("inprogress")}b._data(by,bx+".run",e);bw.call(by,function(){b.dequeue(by,bx)},e)}if(!bv.length){b.removeData(by,bx+"queue "+bx+".run",true);bi(by,bx,"queue")}}});b.fn.extend({queue:function(e,bv){if(typeof e!=="string"){bv=e;e="fx"}if(bv===L){return b.queue(this[0],e)}return this.each(function(){var bw=b.queue(this,e,bv);if(e==="fx"&&bw[0]!=="inprogress"){b.dequeue(this,e)}})},dequeue:function(e){return this.each(function(){b.dequeue(this,e)})},delay:function(bv,e){bv=b.fx?b.fx.speeds[bv]||bv:bv;e=e||"fx";return this.queue(e,function(bx,bw){var by=setTimeout(bx,bv);bw.stop=function(){clearTimeout(by)}})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(bD,bw){if(typeof bD!=="string"){bw=bD;bD=L}bD=bD||"fx";var e=b.Deferred(),bv=this,by=bv.length,bB=1,bz=bD+"defer",bA=bD+"queue",bC=bD+"mark",bx;function bE(){if(!(--bB)){e.resolveWith(bv,[bv])}}while(by--){if((bx=b.data(bv[by],bz,L,true)||(b.data(bv[by],bA,L,true)||b.data(bv[by],bC,L,true))&&b.data(bv[by],bz,b.Callbacks("once memory"),true))){bB++;bx.add(bE)}}bE();return e.promise()}});var aP=/[\n\t\r]/g,af=/\s+/,aU=/\r/g,g=/^(?:button|input)$/i,D=/^(?:button|input|object|select|textarea)$/i,l=/^a(?:rea)?$/i,ao=/^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,F=b.support.getSetAttribute,be,aY,aF;b.fn.extend({attr:function(e,bv){return b.access(this,e,bv,true,b.attr)},removeAttr:function(e){return this.each(function(){b.removeAttr(this,e)})},prop:function(e,bv){return b.access(this,e,bv,true,b.prop)},removeProp:function(e){e=b.propFix[e]||e;return this.each(function(){try{this[e]=L;delete this[e]}catch(bv){}})},addClass:function(by){var bA,bw,bv,bx,bz,bB,e;if(b.isFunction(by)){return this.each(function(bC){b(this).addClass(by.call(this,bC,this.className))})}if(by&&typeof by==="string"){bA=by.split(af);for(bw=0,bv=this.length;bw<bv;bw++){bx=this[bw];if(bx.nodeType===1){if(!bx.className&&bA.length===1){bx.className=by}else{bz=" "+bx.className+" ";for(bB=0,e=bA.length;bB<e;bB++){if(!~bz.indexOf(" "+bA[bB]+" ")){bz+=bA[bB]+" "}}bx.className=b.trim(bz)}}}}return this},removeClass:function(bz){var bA,bw,bv,by,bx,bB,e;if(b.isFunction(bz)){return this.each(function(bC){b(this).removeClass(bz.call(this,bC,this.className))})}if((bz&&typeof bz==="string")||bz===L){bA=(bz||"").split(af);for(bw=0,bv=this.length;bw<bv;bw++){by=this[bw];if(by.nodeType===1&&by.className){if(bz){bx=(" "+by.className+" ").replace(aP," ");for(bB=0,e=bA.length;bB<e;bB++){bx=bx.replace(" "+bA[bB]+" "," ")}by.className=b.trim(bx)}else{by.className=""}}}}return this},toggleClass:function(bx,bv){var bw=typeof bx,e=typeof bv==="boolean";if(b.isFunction(bx)){return this.each(function(by){b(this).toggleClass(bx.call(this,by,this.className,bv),bv)})}return this.each(function(){if(bw==="string"){var bA,bz=0,by=b(this),bB=bv,bC=bx.split(af);while((bA=bC[bz++])){bB=e?bB:!by.hasClass(bA);by[bB?"addClass":"removeClass"](bA)}}else{if(bw==="undefined"||bw==="boolean"){if(this.className){b._data(this,"__className__",this.className)}this.className=this.className||bx===false?"":b._data(this,"__className__")||""}}})},hasClass:function(e){var bx=" "+e+" ",bw=0,bv=this.length;for(;bw<bv;bw++){if(this[bw].nodeType===1&&(" "+this[bw].className+" ").replace(aP," ").indexOf(bx)>-1){return true}}return false},val:function(bx){var e,bv,by,bw=this[0];if(!arguments.length){if(bw){e=b.valHooks[bw.nodeName.toLowerCase()]||b.valHooks[bw.type];if(e&&"get" in e&&(bv=e.get(bw,"value"))!==L){return bv}bv=bw.value;return typeof bv==="string"?bv.replace(aU,""):bv==null?"":bv}return}by=b.isFunction(bx);return this.each(function(bA){var bz=b(this),bB;if(this.nodeType!==1){return}if(by){bB=bx.call(this,bA,bz.val())}else{bB=bx}if(bB==null){bB=""}else{if(typeof bB==="number"){bB+=""}else{if(b.isArray(bB)){bB=b.map(bB,function(bC){return bC==null?"":bC+""})}}}e=b.valHooks[this.nodeName.toLowerCase()]||b.valHooks[this.type];if(!e||!("set" in e)||e.set(this,bB,"value")===L){this.value=bB}})}});b.extend({valHooks:{option:{get:function(e){var bv=e.attributes.value;return !bv||bv.specified?e.value:e.text}},select:{get:function(e){var bA,bv,bz,bx,by=e.selectedIndex,bB=[],bC=e.options,bw=e.type==="select-one";if(by<0){return null}bv=bw?by:0;bz=bw?by+1:bC.length;for(;bv<bz;bv++){bx=bC[bv];if(bx.selected&&(b.support.optDisabled?!bx.disabled:bx.getAttribute("disabled")===null)&&(!bx.parentNode.disabled||!b.nodeName(bx.parentNode,"optgroup"))){bA=b(bx).val();if(bw){return bA}bB.push(bA)}}if(bw&&!bB.length&&bC.length){return b(bC[by]).val()}return bB},set:function(bv,bw){var e=b.makeArray(bw);b(bv).find("option").each(function(){this.selected=b.inArray(b(this).val(),e)>=0});if(!e.length){bv.selectedIndex=-1}return e}}},attrFn:{val:true,css:true,html:true,text:true,data:true,width:true,height:true,offset:true},attr:function(bA,bx,bB,bz){var bw,e,by,bv=bA.nodeType;if(!bA||bv===3||bv===8||bv===2){return}if(bz&&bx in b.attrFn){return b(bA)[bx](bB)}if(typeof bA.getAttribute==="undefined"){return b.prop(bA,bx,bB)}by=bv!==1||!b.isXMLDoc(bA);if(by){bx=bx.toLowerCase();e=b.attrHooks[bx]||(ao.test(bx)?aY:be)}if(bB!==L){if(bB===null){b.removeAttr(bA,bx);return}else{if(e&&"set" in e&&by&&(bw=e.set(bA,bB,bx))!==L){return bw}else{bA.setAttribute(bx,""+bB);return bB}}}else{if(e&&"get" in e&&by&&(bw=e.get(bA,bx))!==null){return bw}else{bw=bA.getAttribute(bx);return bw===null?L:bw}}},removeAttr:function(bx,bz){var by,bA,bv,e,bw=0;if(bz&&bx.nodeType===1){bA=bz.toLowerCase().split(af);e=bA.length;for(;bw<e;bw++){bv=bA[bw];if(bv){by=b.propFix[bv]||bv;b.attr(bx,bv,"");bx.removeAttribute(F?bv:by);if(ao.test(bv)&&by in bx){bx[by]=false}}}}},attrHooks:{type:{set:function(e,bv){if(g.test(e.nodeName)&&e.parentNode){b.error("type property can't be changed")}else{if(!b.support.radioValue&&bv==="radio"&&b.nodeName(e,"input")){var bw=e.value;e.setAttribute("type",bv);if(bw){e.value=bw}return bv}}}},value:{get:function(bv,e){if(be&&b.nodeName(bv,"button")){return be.get(bv,e)}return e in bv?bv.value:null},set:function(bv,bw,e){if(be&&b.nodeName(bv,"button")){return be.set(bv,bw,e)}bv.value=bw}}},propFix:{tabindex:"tabIndex",readonly:"readOnly","for":"htmlFor","class":"className",maxlength:"maxLength",cellspacing:"cellSpacing",cellpadding:"cellPadding",rowspan:"rowSpan",colspan:"colSpan",usemap:"useMap",frameborder:"frameBorder",contenteditable:"contentEditable"},prop:function(bz,bx,bA){var bw,e,by,bv=bz.nodeType;if(!bz||bv===3||bv===8||bv===2){return}by=bv!==1||!b.isXMLDoc(bz);if(by){bx=b.propFix[bx]||bx;e=b.propHooks[bx]}if(bA!==L){if(e&&"set" in e&&(bw=e.set(bz,bA,bx))!==L){return bw}else{return(bz[bx]=bA)}}else{if(e&&"get" in e&&(bw=e.get(bz,bx))!==null){return bw}else{return bz[bx]}}},propHooks:{tabIndex:{get:function(bv){var e=bv.getAttributeNode("tabindex");return e&&e.specified?parseInt(e.value,10):D.test(bv.nodeName)||l.test(bv.nodeName)&&bv.href?0:L}}}});b.attrHooks.tabindex=b.propHooks.tabIndex;aY={get:function(bv,e){var bx,bw=b.prop(bv,e);return bw===true||typeof bw!=="boolean"&&(bx=bv.getAttributeNode(e))&&bx.nodeValue!==false?e.toLowerCase():L},set:function(bv,bx,e){var bw;if(bx===false){b.removeAttr(bv,e)}else{bw=b.propFix[e]||e;if(bw in bv){bv[bw]=true}bv.setAttribute(e,e.toLowerCase())}return e}};if(!F){aF={name:true,id:true};be=b.valHooks.button={get:function(bw,bv){var e;e=bw.getAttributeNode(bv);return e&&(aF[bv]?e.nodeValue!=="":e.specified)?e.nodeValue:L},set:function(bw,bx,bv){var e=bw.getAttributeNode(bv);if(!e){e=av.createAttribute(bv);bw.setAttributeNode(e)}return(e.nodeValue=bx+"")}};b.attrHooks.tabindex.set=be.set;b.each(["width","height"],function(bv,e){b.attrHooks[e]=b.extend(b.attrHooks[e],{set:function(bw,bx){if(bx===""){bw.setAttribute(e,"auto");return bx}}})});b.attrHooks.contenteditable={get:be.get,set:function(bv,bw,e){if(bw===""){bw="false"}be.set(bv,bw,e)}}}if(!b.support.hrefNormalized){b.each(["href","src","width","height"],function(bv,e){b.attrHooks[e]=b.extend(b.attrHooks[e],{get:function(bx){var bw=bx.getAttribute(e,2);return bw===null?L:bw}})})}if(!b.support.style){b.attrHooks.style={get:function(e){return e.style.cssText.toLowerCase()||L},set:function(e,bv){return(e.style.cssText=""+bv)}}}if(!b.support.optSelected){b.propHooks.selected=b.extend(b.propHooks.selected,{get:function(bv){var e=bv.parentNode;if(e){e.selectedIndex;if(e.parentNode){e.parentNode.selectedIndex}}return null}})}if(!b.support.enctype){b.propFix.enctype="encoding"}if(!b.support.checkOn){b.each(["radio","checkbox"],function(){b.valHooks[this]={get:function(e){return e.getAttribute("value")===null?"on":e.value}}})}b.each(["radio","checkbox"],function(){b.valHooks[this]=b.extend(b.valHooks[this],{set:function(e,bv){if(b.isArray(bv)){return(e.checked=b.inArray(b(e).val(),bv)>=0)}}})});var bd=/^(?:textarea|input|select)$/i,n=/^([^\.]*)?(?:\.(.+))?$/,J=/\bhover(\.\S+)?\b/,aO=/^key/,bf=/^(?:mouse|contextmenu)|click/,T=/^(?:focusinfocus|focusoutblur)$/,U=/^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,Y=function(e){var bv=U.exec(e);if(bv){bv[1]=(bv[1]||"").toLowerCase();bv[3]=bv[3]&&new RegExp("(?:^|\\s)"+bv[3]+"(?:\\s|$)")}return bv},j=function(bw,e){var bv=bw.attributes||{};return((!e[1]||bw.nodeName.toLowerCase()===e[1])&&(!e[2]||(bv.id||{}).value===e[2])&&(!e[3]||e[3].test((bv["class"]||{}).value)))},bt=function(e){return b.event.special.hover?e:e.replace(J,"mouseenter$1 mouseleave$1")};b.event={add:function(bx,bC,bJ,bA,by){var bD,bB,bK,bI,bH,bF,e,bG,bv,bz,bw,bE;if(bx.nodeType===3||bx.nodeType===8||!bC||!bJ||!(bD=b._data(bx))){return}if(bJ.handler){bv=bJ;bJ=bv.handler}if(!bJ.guid){bJ.guid=b.guid++}bK=bD.events;if(!bK){bD.events=bK={}}bB=bD.handle;if(!bB){bD.handle=bB=function(bL){return typeof b!=="undefined"&&(!bL||b.event.triggered!==bL.type)?b.event.dispatch.apply(bB.elem,arguments):L};bB.elem=bx}bC=b.trim(bt(bC)).split(" ");for(bI=0;bI<bC.length;bI++){bH=n.exec(bC[bI])||[];bF=bH[1];e=(bH[2]||"").split(".").sort();bE=b.event.special[bF]||{};bF=(by?bE.delegateType:bE.bindType)||bF;bE=b.event.special[bF]||{};bG=b.extend({type:bF,origType:bH[1],data:bA,handler:bJ,guid:bJ.guid,selector:by,quick:Y(by),namespace:e.join(".")},bv);bw=bK[bF];if(!bw){bw=bK[bF]=[];bw.delegateCount=0;if(!bE.setup||bE.setup.call(bx,bA,e,bB)===false){if(bx.addEventListener){bx.addEventListener(bF,bB,false)}else{if(bx.attachEvent){bx.attachEvent("on"+bF,bB)}}}}if(bE.add){bE.add.call(bx,bG);if(!bG.handler.guid){bG.handler.guid=bJ.guid}}if(by){bw.splice(bw.delegateCount++,0,bG)}else{bw.push(bG)}b.event.global[bF]=true}bx=null},global:{},remove:function(bJ,bE,bv,bH,bB){var bI=b.hasData(bJ)&&b._data(bJ),bF,bx,bz,bL,bC,bA,bG,bw,by,bK,bD,e;if(!bI||!(bw=bI.events)){return}bE=b.trim(bt(bE||"")).split(" ");for(bF=0;bF<bE.length;bF++){bx=n.exec(bE[bF])||[];bz=bL=bx[1];bC=bx[2];if(!bz){for(bz in bw){b.event.remove(bJ,bz+bE[bF],bv,bH,true)}continue}by=b.event.special[bz]||{};bz=(bH?by.delegateType:by.bindType)||bz;bD=bw[bz]||[];bA=bD.length;bC=bC?new RegExp("(^|\\.)"+bC.split(".").sort().join("\\.(?:.*\\.)?")+"(\\.|$)"):null;for(bG=0;bG<bD.length;bG++){e=bD[bG];if((bB||bL===e.origType)&&(!bv||bv.guid===e.guid)&&(!bC||bC.test(e.namespace))&&(!bH||bH===e.selector||bH==="**"&&e.selector)){bD.splice(bG--,1);if(e.selector){bD.delegateCount--}if(by.remove){by.remove.call(bJ,e)}}}if(bD.length===0&&bA!==bD.length){if(!by.teardown||by.teardown.call(bJ,bC)===false){b.removeEvent(bJ,bz,bI.handle)}delete bw[bz]}}if(b.isEmptyObject(bw)){bK=bI.handle;if(bK){bK.elem=null}b.removeData(bJ,["events","handle"],true)}},customEvent:{getData:true,setData:true,changeData:true},trigger:function(bv,bD,bA,bJ){if(bA&&(bA.nodeType===3||bA.nodeType===8)){return}var bG=bv.type||bv,bx=[],e,bw,bC,bH,bz,by,bF,bE,bB,bI;if(T.test(bG+b.event.triggered)){return}if(bG.indexOf("!")>=0){bG=bG.slice(0,-1);bw=true}if(bG.indexOf(".")>=0){bx=bG.split(".");bG=bx.shift();bx.sort()}if((!bA||b.event.customEvent[bG])&&!b.event.global[bG]){return}bv=typeof bv==="object"?bv[b.expando]?bv:new b.Event(bG,bv):new b.Event(bG);bv.type=bG;bv.isTrigger=true;bv.exclusive=bw;bv.namespace=bx.join(".");bv.namespace_re=bv.namespace?new RegExp("(^|\\.)"+bx.join("\\.(?:.*\\.)?")+"(\\.|$)"):null;by=bG.indexOf(":")<0?"on"+bG:"";if(!bA){e=b.cache;for(bC in e){if(e[bC].events&&e[bC].events[bG]){b.event.trigger(bv,bD,e[bC].handle.elem,true)}}return}bv.result=L;if(!bv.target){bv.target=bA}bD=bD!=null?b.makeArray(bD):[];bD.unshift(bv);bF=b.event.special[bG]||{};if(bF.trigger&&bF.trigger.apply(bA,bD)===false){return}bB=[[bA,bF.bindType||bG]];if(!bJ&&!bF.noBubble&&!b.isWindow(bA)){bI=bF.delegateType||bG;bH=T.test(bI+bG)?bA:bA.parentNode;bz=null;for(;bH;bH=bH.parentNode){bB.push([bH,bI]);bz=bH}if(bz&&bz===bA.ownerDocument){bB.push([bz.defaultView||bz.parentWindow||bb,bI])}}for(bC=0;bC<bB.length&&!bv.isPropagationStopped();bC++){bH=bB[bC][0];bv.type=bB[bC][1];bE=(b._data(bH,"events")||{})[bv.type]&&b._data(bH,"handle");if(bE){bE.apply(bH,bD)}bE=by&&bH[by];if(bE&&b.acceptData(bH)&&bE.apply(bH,bD)===false){bv.preventDefault()}}bv.type=bG;if(!bJ&&!bv.isDefaultPrevented()){if((!bF._default||bF._default.apply(bA.ownerDocument,bD)===false)&&!(bG==="click"&&b.nodeName(bA,"a"))&&b.acceptData(bA)){if(by&&bA[bG]&&((bG!=="focus"&&bG!=="blur")||bv.target.offsetWidth!==0)&&!b.isWindow(bA)){bz=bA[by];if(bz){bA[by]=null}b.event.triggered=bG;bA[bG]();b.event.triggered=L;if(bz){bA[by]=bz}}}}return bv.result},dispatch:function(e){e=b.event.fix(e||bb.event);var bz=((b._data(this,"events")||{})[e.type]||[]),bA=bz.delegateCount,bG=[].slice.call(arguments,0),by=!e.exclusive&&!e.namespace,bH=[],bC,bB,bK,bx,bF,bE,bv,bD,bI,bw,bJ;bG[0]=e;e.delegateTarget=this;if(bA&&!e.target.disabled&&!(e.button&&e.type==="click")){bx=b(this);bx.context=this.ownerDocument||this;for(bK=e.target;bK!=this;bK=bK.parentNode||this){bE={};bD=[];bx[0]=bK;for(bC=0;bC<bA;bC++){bI=bz[bC];bw=bI.selector;if(bE[bw]===L){bE[bw]=(bI.quick?j(bK,bI.quick):bx.is(bw))}if(bE[bw]){bD.push(bI)}}if(bD.length){bH.push({elem:bK,matches:bD})}}}if(bz.length>bA){bH.push({elem:this,matches:bz.slice(bA)})}for(bC=0;bC<bH.length&&!e.isPropagationStopped();bC++){bv=bH[bC];e.currentTarget=bv.elem;for(bB=0;bB<bv.matches.length&&!e.isImmediatePropagationStopped();bB++){bI=bv.matches[bB];if(by||(!e.namespace&&!bI.namespace)||e.namespace_re&&e.namespace_re.test(bI.namespace)){e.data=bI.data;e.handleObj=bI;bF=((b.event.special[bI.origType]||{}).handle||bI.handler).apply(bv.elem,bG);if(bF!==L){e.result=bF;if(bF===false){e.preventDefault();e.stopPropagation()}}}}}return e.result},props:"attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),fixHooks:{},keyHooks:{props:"char charCode key keyCode".split(" "),filter:function(bv,e){if(bv.which==null){bv.which=e.charCode!=null?e.charCode:e.keyCode}return bv}},mouseHooks:{props:"button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "),filter:function(bx,bw){var by,bz,e,bv=bw.button,bA=bw.fromElement;if(bx.pageX==null&&bw.clientX!=null){by=bx.target.ownerDocument||av;bz=by.documentElement;e=by.body;bx.pageX=bw.clientX+(bz&&bz.scrollLeft||e&&e.scrollLeft||0)-(bz&&bz.clientLeft||e&&e.clientLeft||0);bx.pageY=bw.clientY+(bz&&bz.scrollTop||e&&e.scrollTop||0)-(bz&&bz.clientTop||e&&e.clientTop||0)}if(!bx.relatedTarget&&bA){bx.relatedTarget=bA===bx.target?bw.toElement:bA}if(!bx.which&&bv!==L){bx.which=(bv&1?1:(bv&2?3:(bv&4?2:0)))}return bx}},fix:function(bw){if(bw[b.expando]){return bw}var bv,bz,e=bw,bx=b.event.fixHooks[bw.type]||{},by=bx.props?this.props.concat(bx.props):this.props;bw=b.Event(e);for(bv=by.length;bv;){bz=by[--bv];bw[bz]=e[bz]}if(!bw.target){bw.target=e.srcElement||av}if(bw.target.nodeType===3){bw.target=bw.target.parentNode}if(bw.metaKey===L){bw.metaKey=bw.ctrlKey}return bx.filter?bx.filter(bw,e):bw},special:{ready:{setup:b.bindReady},load:{noBubble:true},focus:{delegateType:"focusin"},blur:{delegateType:"focusout"},beforeunload:{setup:function(bw,bv,e){if(b.isWindow(this)){this.onbeforeunload=e}},teardown:function(bv,e){if(this.onbeforeunload===e){this.onbeforeunload=null}}}},simulate:function(bw,by,bx,bv){var bz=b.extend(new b.Event(),bx,{type:bw,isSimulated:true,originalEvent:{}});if(bv){b.event.trigger(bz,null,by)}else{b.event.dispatch.call(by,bz)}if(bz.isDefaultPrevented()){bx.preventDefault()}}};b.event.handle=b.event.dispatch;b.removeEvent=av.removeEventListener?function(bv,e,bw){if(bv.removeEventListener){bv.removeEventListener(e,bw,false)}}:function(bv,e,bw){if(bv.detachEvent){bv.detachEvent("on"+e,bw)}};b.Event=function(bv,e){if(!(this instanceof b.Event)){return new b.Event(bv,e)}if(bv&&bv.type){this.originalEvent=bv;this.type=bv.type;this.isDefaultPrevented=(bv.defaultPrevented||bv.returnValue===false||bv.getPreventDefault&&bv.getPreventDefault())?i:bk}else{this.type=bv}if(e){b.extend(this,e)}this.timeStamp=bv&&bv.timeStamp||b.now();this[b.expando]=true};function bk(){return false}function i(){return true}b.Event.prototype={preventDefault:function(){this.isDefaultPrevented=i;var bv=this.originalEvent;if(!bv){return}if(bv.preventDefault){bv.preventDefault()}else{bv.returnValue=false}},stopPropagation:function(){this.isPropagationStopped=i;var bv=this.originalEvent;if(!bv){return}if(bv.stopPropagation){bv.stopPropagation()}bv.cancelBubble=true},stopImmediatePropagation:function(){this.isImmediatePropagationStopped=i;this.stopPropagation()},isDefaultPrevented:bk,isPropagationStopped:bk,isImmediatePropagationStopped:bk};b.each({mouseenter:"mouseover",mouseleave:"mouseout"},function(bv,e){b.event.special[bv]={delegateType:e,bindType:e,handle:function(bz){var bB=this,bA=bz.relatedTarget,by=bz.handleObj,bw=by.selector,bx;if(!bA||(bA!==bB&&!b.contains(bB,bA))){bz.type=by.origType;bx=by.handler.apply(this,arguments);bz.type=e}return bx}}});if(!b.support.submitBubbles){b.event.special.submit={setup:function(){if(b.nodeName(this,"form")){return false}b.event.add(this,"click._submit keypress._submit",function(bx){var bw=bx.target,bv=b.nodeName(bw,"input")||b.nodeName(bw,"button")?bw.form:L;if(bv&&!bv._submit_attached){b.event.add(bv,"submit._submit",function(e){if(this.parentNode&&!e.isTrigger){b.event.simulate("submit",this.parentNode,e,true)}});bv._submit_attached=true}})},teardown:function(){if(b.nodeName(this,"form")){return false}b.event.remove(this,"._submit")}}}if(!b.support.changeBubbles){b.event.special.change={setup:function(){if(bd.test(this.nodeName)){if(this.type==="checkbox"||this.type==="radio"){b.event.add(this,"propertychange._change",function(e){if(e.originalEvent.propertyName==="checked"){this._just_changed=true}});b.event.add(this,"click._change",function(e){if(this._just_changed&&!e.isTrigger){this._just_changed=false;b.event.simulate("change",this,e,true)}})}return false}b.event.add(this,"beforeactivate._change",function(bw){var bv=bw.target;if(bd.test(bv.nodeName)&&!bv._change_attached){b.event.add(bv,"change._change",function(e){if(this.parentNode&&!e.isSimulated&&!e.isTrigger){b.event.simulate("change",this.parentNode,e,true)}});bv._change_attached=true}})},handle:function(bv){var e=bv.target;if(this!==e||bv.isSimulated||bv.isTrigger||(e.type!=="radio"&&e.type!=="checkbox")){return bv.handleObj.handler.apply(this,arguments)}},teardown:function(){b.event.remove(this,"._change");return bd.test(this.nodeName)}}}if(!b.support.focusinBubbles){b.each({focus:"focusin",blur:"focusout"},function(bx,e){var bv=0,bw=function(by){b.event.simulate(e,by.target,b.event.fix(by),true)};b.event.special[e]={setup:function(){if(bv++===0){av.addEventListener(bx,bw,true)}},teardown:function(){if(--bv===0){av.removeEventListener(bx,bw,true)}}}})}b.fn.extend({on:function(bw,e,bz,by,bv){var bA,bx;if(typeof bw==="object"){if(typeof e!=="string"){bz=e;e=L}for(bx in bw){this.on(bx,e,bz,bw[bx],bv)}return this}if(bz==null&&by==null){by=e;bz=e=L}else{if(by==null){if(typeof e==="string"){by=bz;bz=L}else{by=bz;bz=e;e=L}}}if(by===false){by=bk}else{if(!by){return this}}if(bv===1){bA=by;by=function(bB){b().off(bB);return bA.apply(this,arguments)};by.guid=bA.guid||(bA.guid=b.guid++)}return this.each(function(){b.event.add(this,bw,by,bz,e)})},one:function(bv,e,bx,bw){return this.on.call(this,bv,e,bx,bw,1)},off:function(bw,e,by){if(bw&&bw.preventDefault&&bw.handleObj){var bv=bw.handleObj;b(bw.delegateTarget).off(bv.namespace?bv.type+"."+bv.namespace:bv.type,bv.selector,bv.handler);return this}if(typeof bw==="object"){for(var bx in bw){this.off(bx,e,bw[bx])}return this}if(e===false||typeof e==="function"){by=e;e=L}if(by===false){by=bk}return this.each(function(){b.event.remove(this,bw,by,e)})},bind:function(e,bw,bv){return this.on(e,null,bw,bv)},unbind:function(e,bv){return this.off(e,null,bv)},live:function(e,bw,bv){b(this.context).on(e,this.selector,bw,bv);return this},die:function(e,bv){b(this.context).off(e,this.selector||"**",bv);return this},delegate:function(e,bv,bx,bw){return this.on(bv,e,bx,bw)},undelegate:function(e,bv,bw){return arguments.length==1?this.off(e,"**"):this.off(bv,e,bw)},trigger:function(e,bv){return this.each(function(){b.event.trigger(e,bv,this)})},triggerHandler:function(e,bv){if(this[0]){return b.event.trigger(e,bv,this[0],true)}},toggle:function(bx){var bv=arguments,e=bx.guid||b.guid++,bw=0,by=function(bz){var bA=(b._data(this,"lastToggle"+bx.guid)||0)%bw;b._data(this,"lastToggle"+bx.guid,bA+1);bz.preventDefault();return bv[bA].apply(this,arguments)||false};by.guid=e;while(bw<bv.length){bv[bw++].guid=e}return this.click(by)},hover:function(e,bv){return this.mouseenter(e).mouseleave(bv||e)}});b.each(("blur focus focusin focusout load resize scroll unload click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup error contextmenu").split(" "),function(bv,e){b.fn[e]=function(bx,bw){if(bw==null){bw=bx;bx=null}return arguments.length>0?this.on(e,null,bx,bw):this.trigger(e)};if(b.attrFn){b.attrFn[e]=true}if(aO.test(e)){b.event.fixHooks[e]=b.event.keyHooks}if(bf.test(e)){b.event.fixHooks[e]=b.event.mouseHooks}}); +/*! + * Sizzle CSS Selector Engine + * Copyright 2011, The Dojo Foundation + * Released under the MIT, BSD, and GPL Licenses. + * More information: http://sizzlejs.com/ + */ +(function(){var bH=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^\[\]]*\]|['"][^'"]*['"]|[^\[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,bC="sizcache"+(Math.random()+"").replace(".",""),bI=0,bL=Object.prototype.toString,bB=false,bA=true,bK=/\\/g,bO=/\r\n/g,bQ=/\W/;[0,0].sort(function(){bA=false;return 0});var by=function(bV,e,bY,bZ){bY=bY||[];e=e||av;var b1=e;if(e.nodeType!==1&&e.nodeType!==9){return[]}if(!bV||typeof bV!=="string"){return bY}var bS,b3,b6,bR,b2,b5,b4,bX,bU=true,bT=by.isXML(e),bW=[],b0=bV;do{bH.exec("");bS=bH.exec(b0);if(bS){b0=bS[3];bW.push(bS[1]);if(bS[2]){bR=bS[3];break}}}while(bS);if(bW.length>1&&bD.exec(bV)){if(bW.length===2&&bE.relative[bW[0]]){b3=bM(bW[0]+bW[1],e,bZ)}else{b3=bE.relative[bW[0]]?[e]:by(bW.shift(),e);while(bW.length){bV=bW.shift();if(bE.relative[bV]){bV+=bW.shift()}b3=bM(bV,b3,bZ)}}}else{if(!bZ&&bW.length>1&&e.nodeType===9&&!bT&&bE.match.ID.test(bW[0])&&!bE.match.ID.test(bW[bW.length-1])){b2=by.find(bW.shift(),e,bT);e=b2.expr?by.filter(b2.expr,b2.set)[0]:b2.set[0]}if(e){b2=bZ?{expr:bW.pop(),set:bF(bZ)}:by.find(bW.pop(),bW.length===1&&(bW[0]==="~"||bW[0]==="+")&&e.parentNode?e.parentNode:e,bT);b3=b2.expr?by.filter(b2.expr,b2.set):b2.set;if(bW.length>0){b6=bF(b3)}else{bU=false}while(bW.length){b5=bW.pop();b4=b5;if(!bE.relative[b5]){b5=""}else{b4=bW.pop()}if(b4==null){b4=e}bE.relative[b5](b6,b4,bT)}}else{b6=bW=[]}}if(!b6){b6=b3}if(!b6){by.error(b5||bV)}if(bL.call(b6)==="[object Array]"){if(!bU){bY.push.apply(bY,b6)}else{if(e&&e.nodeType===1){for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&(b6[bX]===true||b6[bX].nodeType===1&&by.contains(e,b6[bX]))){bY.push(b3[bX])}}}else{for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&b6[bX].nodeType===1){bY.push(b3[bX])}}}}}else{bF(b6,bY)}if(bR){by(bR,b1,bY,bZ);by.uniqueSort(bY)}return bY};by.uniqueSort=function(bR){if(bJ){bB=bA;bR.sort(bJ);if(bB){for(var e=1;e<bR.length;e++){if(bR[e]===bR[e-1]){bR.splice(e--,1)}}}}return bR};by.matches=function(e,bR){return by(e,null,null,bR)};by.matchesSelector=function(e,bR){return by(bR,null,null,[e]).length>0};by.find=function(bX,e,bY){var bW,bS,bU,bT,bV,bR;if(!bX){return[]}for(bS=0,bU=bE.order.length;bS<bU;bS++){bV=bE.order[bS];if((bT=bE.leftMatch[bV].exec(bX))){bR=bT[1];bT.splice(1,1);if(bR.substr(bR.length-1)!=="\\"){bT[1]=(bT[1]||"").replace(bK,"");bW=bE.find[bV](bT,e,bY);if(bW!=null){bX=bX.replace(bE.match[bV],"");break}}}}if(!bW){bW=typeof e.getElementsByTagName!=="undefined"?e.getElementsByTagName("*"):[]}return{set:bW,expr:bX}};by.filter=function(b1,b0,b4,bU){var bW,e,bZ,b6,b3,bR,bT,bV,b2,bS=b1,b5=[],bY=b0,bX=b0&&b0[0]&&by.isXML(b0[0]);while(b1&&b0.length){for(bZ in bE.filter){if((bW=bE.leftMatch[bZ].exec(b1))!=null&&bW[2]){bR=bE.filter[bZ];bT=bW[1];e=false;bW.splice(1,1);if(bT.substr(bT.length-1)==="\\"){continue}if(bY===b5){b5=[]}if(bE.preFilter[bZ]){bW=bE.preFilter[bZ](bW,bY,b4,b5,bU,bX);if(!bW){e=b6=true}else{if(bW===true){continue}}}if(bW){for(bV=0;(b3=bY[bV])!=null;bV++){if(b3){b6=bR(b3,bW,bV,bY);b2=bU^b6;if(b4&&b6!=null){if(b2){e=true}else{bY[bV]=false}}else{if(b2){b5.push(b3);e=true}}}}}if(b6!==L){if(!b4){bY=b5}b1=b1.replace(bE.match[bZ],"");if(!e){return[]}break}}}if(b1===bS){if(e==null){by.error(b1)}else{break}}bS=b1}return bY};by.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)};var bw=by.getText=function(bU){var bS,bT,e=bU.nodeType,bR="";if(e){if(e===1||e===9){if(typeof bU.textContent==="string"){return bU.textContent}else{if(typeof bU.innerText==="string"){return bU.innerText.replace(bO,"")}else{for(bU=bU.firstChild;bU;bU=bU.nextSibling){bR+=bw(bU)}}}}else{if(e===3||e===4){return bU.nodeValue}}}else{for(bS=0;(bT=bU[bS]);bS++){if(bT.nodeType!==8){bR+=bw(bT)}}}return bR};var bE=by.selectors={order:["ID","NAME","TAG"],match:{ID:/#((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,CLASS:/\.((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,NAME:/\[name=['"]*((?:[\w\u00c0-\uFFFF\-]|\\.)+)['"]*\]/,ATTR:/\[\s*((?:[\w\u00c0-\uFFFF\-]|\\.)+)\s*(?:(\S?=)\s*(?:(['"])(.*?)\3|(#?(?:[\w\u00c0-\uFFFF\-]|\\.)*)|)|)\s*\]/,TAG:/^((?:[\w\u00c0-\uFFFF\*\-]|\\.)+)/,CHILD:/:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,POS:/:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,PSEUDO:/:((?:[\w\u00c0-\uFFFF\-]|\\.)+)(?:\((['"]?)((?:\([^\)]+\)|[^\(\)]*)+)\2\))?/},leftMatch:{},attrMap:{"class":"className","for":"htmlFor"},attrHandle:{href:function(e){return e.getAttribute("href")},type:function(e){return e.getAttribute("type")}},relative:{"+":function(bW,bR){var bT=typeof bR==="string",bV=bT&&!bQ.test(bR),bX=bT&&!bV;if(bV){bR=bR.toLowerCase()}for(var bS=0,e=bW.length,bU;bS<e;bS++){if((bU=bW[bS])){while((bU=bU.previousSibling)&&bU.nodeType!==1){}bW[bS]=bX||bU&&bU.nodeName.toLowerCase()===bR?bU||false:bU===bR}}if(bX){by.filter(bR,bW,true)}},">":function(bW,bR){var bV,bU=typeof bR==="string",bS=0,e=bW.length;if(bU&&!bQ.test(bR)){bR=bR.toLowerCase();for(;bS<e;bS++){bV=bW[bS];if(bV){var bT=bV.parentNode;bW[bS]=bT.nodeName.toLowerCase()===bR?bT:false}}}else{for(;bS<e;bS++){bV=bW[bS];if(bV){bW[bS]=bU?bV.parentNode:bV.parentNode===bR}}if(bU){by.filter(bR,bW,true)}}},"":function(bT,bR,bV){var bU,bS=bI++,e=bN;if(typeof bR==="string"&&!bQ.test(bR)){bR=bR.toLowerCase();bU=bR;e=bv}e("parentNode",bR,bS,bT,bU,bV)},"~":function(bT,bR,bV){var bU,bS=bI++,e=bN;if(typeof bR==="string"&&!bQ.test(bR)){bR=bR.toLowerCase();bU=bR;e=bv}e("previousSibling",bR,bS,bT,bU,bV)}},find:{ID:function(bR,bS,bT){if(typeof bS.getElementById!=="undefined"&&!bT){var e=bS.getElementById(bR[1]);return e&&e.parentNode?[e]:[]}},NAME:function(bS,bV){if(typeof bV.getElementsByName!=="undefined"){var bR=[],bU=bV.getElementsByName(bS[1]);for(var bT=0,e=bU.length;bT<e;bT++){if(bU[bT].getAttribute("name")===bS[1]){bR.push(bU[bT])}}return bR.length===0?null:bR}},TAG:function(e,bR){if(typeof bR.getElementsByTagName!=="undefined"){return bR.getElementsByTagName(e[1])}}},preFilter:{CLASS:function(bT,bR,bS,e,bW,bX){bT=" "+bT[1].replace(bK,"")+" ";if(bX){return bT}for(var bU=0,bV;(bV=bR[bU])!=null;bU++){if(bV){if(bW^(bV.className&&(" "+bV.className+" ").replace(/[\t\n\r]/g," ").indexOf(bT)>=0)){if(!bS){e.push(bV)}}else{if(bS){bR[bU]=false}}}}return false},ID:function(e){return e[1].replace(bK,"")},TAG:function(bR,e){return bR[1].replace(bK,"").toLowerCase()},CHILD:function(e){if(e[1]==="nth"){if(!e[2]){by.error(e[0])}e[2]=e[2].replace(/^\+|\s*/g,"");var bR=/(-?)(\d*)(?:n([+\-]?\d*))?/.exec(e[2]==="even"&&"2n"||e[2]==="odd"&&"2n+1"||!/\D/.test(e[2])&&"0n+"+e[2]||e[2]);e[2]=(bR[1]+(bR[2]||1))-0;e[3]=bR[3]-0}else{if(e[2]){by.error(e[0])}}e[0]=bI++;return e},ATTR:function(bU,bR,bS,e,bV,bW){var bT=bU[1]=bU[1].replace(bK,"");if(!bW&&bE.attrMap[bT]){bU[1]=bE.attrMap[bT]}bU[4]=(bU[4]||bU[5]||"").replace(bK,"");if(bU[2]==="~="){bU[4]=" "+bU[4]+" "}return bU},PSEUDO:function(bU,bR,bS,e,bV){if(bU[1]==="not"){if((bH.exec(bU[3])||"").length>1||/^\w/.test(bU[3])){bU[3]=by(bU[3],null,null,bR)}else{var bT=by.filter(bU[3],bR,bS,true^bV);if(!bS){e.push.apply(e,bT)}return false}}else{if(bE.match.POS.test(bU[0])||bE.match.CHILD.test(bU[0])){return true}}return bU},POS:function(e){e.unshift(true);return e}},filters:{enabled:function(e){return e.disabled===false&&e.type!=="hidden"},disabled:function(e){return e.disabled===true},checked:function(e){return e.checked===true},selected:function(e){if(e.parentNode){e.parentNode.selectedIndex}return e.selected===true},parent:function(e){return !!e.firstChild},empty:function(e){return !e.firstChild},has:function(bS,bR,e){return !!by(e[3],bS).length},header:function(e){return(/h\d/i).test(e.nodeName)},text:function(bS){var e=bS.getAttribute("type"),bR=bS.type;return bS.nodeName.toLowerCase()==="input"&&"text"===bR&&(e===bR||e===null)},radio:function(e){return e.nodeName.toLowerCase()==="input"&&"radio"===e.type},checkbox:function(e){return e.nodeName.toLowerCase()==="input"&&"checkbox"===e.type},file:function(e){return e.nodeName.toLowerCase()==="input"&&"file"===e.type},password:function(e){return e.nodeName.toLowerCase()==="input"&&"password"===e.type},submit:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"submit"===bR.type},image:function(e){return e.nodeName.toLowerCase()==="input"&&"image"===e.type},reset:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"reset"===bR.type},button:function(bR){var e=bR.nodeName.toLowerCase();return e==="input"&&"button"===bR.type||e==="button"},input:function(e){return(/input|select|textarea|button/i).test(e.nodeName)},focus:function(e){return e===e.ownerDocument.activeElement}},setFilters:{first:function(bR,e){return e===0},last:function(bS,bR,e,bT){return bR===bT.length-1},even:function(bR,e){return e%2===0},odd:function(bR,e){return e%2===1},lt:function(bS,bR,e){return bR<e[3]-0},gt:function(bS,bR,e){return bR>e[3]-0},nth:function(bS,bR,e){return e[3]-0===bR},eq:function(bS,bR,e){return e[3]-0===bR}},filter:{PSEUDO:function(bS,bX,bW,bY){var e=bX[1],bR=bE.filters[e];if(bR){return bR(bS,bW,bX,bY)}else{if(e==="contains"){return(bS.textContent||bS.innerText||bw([bS])||"").indexOf(bX[3])>=0}else{if(e==="not"){var bT=bX[3];for(var bV=0,bU=bT.length;bV<bU;bV++){if(bT[bV]===bS){return false}}return true}else{by.error(e)}}}},CHILD:function(bS,bU){var bT,b0,bW,bZ,e,bV,bY,bX=bU[1],bR=bS;switch(bX){case"only":case"first":while((bR=bR.previousSibling)){if(bR.nodeType===1){return false}}if(bX==="first"){return true}bR=bS;case"last":while((bR=bR.nextSibling)){if(bR.nodeType===1){return false}}return true;case"nth":bT=bU[2];b0=bU[3];if(bT===1&&b0===0){return true}bW=bU[0];bZ=bS.parentNode;if(bZ&&(bZ[bC]!==bW||!bS.nodeIndex)){bV=0;for(bR=bZ.firstChild;bR;bR=bR.nextSibling){if(bR.nodeType===1){bR.nodeIndex=++bV}}bZ[bC]=bW}bY=bS.nodeIndex-b0;if(bT===0){return bY===0}else{return(bY%bT===0&&bY/bT>=0)}}},ID:function(bR,e){return bR.nodeType===1&&bR.getAttribute("id")===e},TAG:function(bR,e){return(e==="*"&&bR.nodeType===1)||!!bR.nodeName&&bR.nodeName.toLowerCase()===e},CLASS:function(bR,e){return(" "+(bR.className||bR.getAttribute("class"))+" ").indexOf(e)>-1},ATTR:function(bV,bT){var bS=bT[1],e=by.attr?by.attr(bV,bS):bE.attrHandle[bS]?bE.attrHandle[bS](bV):bV[bS]!=null?bV[bS]:bV.getAttribute(bS),bW=e+"",bU=bT[2],bR=bT[4];return e==null?bU==="!=":!bU&&by.attr?e!=null:bU==="="?bW===bR:bU==="*="?bW.indexOf(bR)>=0:bU==="~="?(" "+bW+" ").indexOf(bR)>=0:!bR?bW&&e!==false:bU==="!="?bW!==bR:bU==="^="?bW.indexOf(bR)===0:bU==="$="?bW.substr(bW.length-bR.length)===bR:bU==="|="?bW===bR||bW.substr(0,bR.length+1)===bR+"-":false},POS:function(bU,bR,bS,bV){var e=bR[2],bT=bE.setFilters[e];if(bT){return bT(bU,bS,bR,bV)}}}};var bD=bE.match.POS,bx=function(bR,e){return"\\"+(e-0+1)};for(var bz in bE.match){bE.match[bz]=new RegExp(bE.match[bz].source+(/(?![^\[]*\])(?![^\(]*\))/.source));bE.leftMatch[bz]=new RegExp(/(^(?:.|\r|\n)*?)/.source+bE.match[bz].source.replace(/\\(\d+)/g,bx))}var bF=function(bR,e){bR=Array.prototype.slice.call(bR,0);if(e){e.push.apply(e,bR);return e}return bR};try{Array.prototype.slice.call(av.documentElement.childNodes,0)[0].nodeType}catch(bP){bF=function(bU,bT){var bS=0,bR=bT||[];if(bL.call(bU)==="[object Array]"){Array.prototype.push.apply(bR,bU)}else{if(typeof bU.length==="number"){for(var e=bU.length;bS<e;bS++){bR.push(bU[bS])}}else{for(;bU[bS];bS++){bR.push(bU[bS])}}}return bR}}var bJ,bG;if(av.documentElement.compareDocumentPosition){bJ=function(bR,e){if(bR===e){bB=true;return 0}if(!bR.compareDocumentPosition||!e.compareDocumentPosition){return bR.compareDocumentPosition?-1:1}return bR.compareDocumentPosition(e)&4?-1:1}}else{bJ=function(bY,bX){if(bY===bX){bB=true;return 0}else{if(bY.sourceIndex&&bX.sourceIndex){return bY.sourceIndex-bX.sourceIndex}}var bV,bR,bS=[],e=[],bU=bY.parentNode,bW=bX.parentNode,bZ=bU;if(bU===bW){return bG(bY,bX)}else{if(!bU){return -1}else{if(!bW){return 1}}}while(bZ){bS.unshift(bZ);bZ=bZ.parentNode}bZ=bW;while(bZ){e.unshift(bZ);bZ=bZ.parentNode}bV=bS.length;bR=e.length;for(var bT=0;bT<bV&&bT<bR;bT++){if(bS[bT]!==e[bT]){return bG(bS[bT],e[bT])}}return bT===bV?bG(bY,e[bT],-1):bG(bS[bT],bX,1)};bG=function(bR,e,bS){if(bR===e){return bS}var bT=bR.nextSibling;while(bT){if(bT===e){return -1}bT=bT.nextSibling}return 1}}(function(){var bR=av.createElement("div"),bS="script"+(new Date()).getTime(),e=av.documentElement;bR.innerHTML="<a name='"+bS+"'/>";e.insertBefore(bR,e.firstChild);if(av.getElementById(bS)){bE.find.ID=function(bU,bV,bW){if(typeof bV.getElementById!=="undefined"&&!bW){var bT=bV.getElementById(bU[1]);return bT?bT.id===bU[1]||typeof bT.getAttributeNode!=="undefined"&&bT.getAttributeNode("id").nodeValue===bU[1]?[bT]:L:[]}};bE.filter.ID=function(bV,bT){var bU=typeof bV.getAttributeNode!=="undefined"&&bV.getAttributeNode("id");return bV.nodeType===1&&bU&&bU.nodeValue===bT}}e.removeChild(bR);e=bR=null})();(function(){var e=av.createElement("div");e.appendChild(av.createComment(""));if(e.getElementsByTagName("*").length>0){bE.find.TAG=function(bR,bV){var bU=bV.getElementsByTagName(bR[1]);if(bR[1]==="*"){var bT=[];for(var bS=0;bU[bS];bS++){if(bU[bS].nodeType===1){bT.push(bU[bS])}}bU=bT}return bU}}e.innerHTML="<a href='#'></a>";if(e.firstChild&&typeof e.firstChild.getAttribute!=="undefined"&&e.firstChild.getAttribute("href")!=="#"){bE.attrHandle.href=function(bR){return bR.getAttribute("href",2)}}e=null})();if(av.querySelectorAll){(function(){var e=by,bT=av.createElement("div"),bS="__sizzle__";bT.innerHTML="<p class='TEST'></p>";if(bT.querySelectorAll&&bT.querySelectorAll(".TEST").length===0){return}by=function(b4,bV,bZ,b3){bV=bV||av;if(!b3&&!by.isXML(bV)){var b2=/^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec(b4);if(b2&&(bV.nodeType===1||bV.nodeType===9)){if(b2[1]){return bF(bV.getElementsByTagName(b4),bZ)}else{if(b2[2]&&bE.find.CLASS&&bV.getElementsByClassName){return bF(bV.getElementsByClassName(b2[2]),bZ)}}}if(bV.nodeType===9){if(b4==="body"&&bV.body){return bF([bV.body],bZ)}else{if(b2&&b2[3]){var bY=bV.getElementById(b2[3]);if(bY&&bY.parentNode){if(bY.id===b2[3]){return bF([bY],bZ)}}else{return bF([],bZ)}}}try{return bF(bV.querySelectorAll(b4),bZ)}catch(b0){}}else{if(bV.nodeType===1&&bV.nodeName.toLowerCase()!=="object"){var bW=bV,bX=bV.getAttribute("id"),bU=bX||bS,b6=bV.parentNode,b5=/^\s*[+~]/.test(b4);if(!bX){bV.setAttribute("id",bU)}else{bU=bU.replace(/'/g,"\\$&")}if(b5&&b6){bV=bV.parentNode}try{if(!b5||b6){return bF(bV.querySelectorAll("[id='"+bU+"'] "+b4),bZ)}}catch(b1){}finally{if(!bX){bW.removeAttribute("id")}}}}}return e(b4,bV,bZ,b3)};for(var bR in e){by[bR]=e[bR]}bT=null})()}(function(){var e=av.documentElement,bS=e.matchesSelector||e.mozMatchesSelector||e.webkitMatchesSelector||e.msMatchesSelector;if(bS){var bU=!bS.call(av.createElement("div"),"div"),bR=false;try{bS.call(av.documentElement,"[test!='']:sizzle")}catch(bT){bR=true}by.matchesSelector=function(bW,bY){bY=bY.replace(/\=\s*([^'"\]]*)\s*\]/g,"='$1']");if(!by.isXML(bW)){try{if(bR||!bE.match.PSEUDO.test(bY)&&!/!=/.test(bY)){var bV=bS.call(bW,bY);if(bV||!bU||bW.document&&bW.document.nodeType!==11){return bV}}}catch(bX){}}return by(bY,null,null,[bW]).length>0}}})();(function(){var e=av.createElement("div");e.innerHTML="<div class='test e'></div><div class='test'></div>";if(!e.getElementsByClassName||e.getElementsByClassName("e").length===0){return}e.lastChild.className="e";if(e.getElementsByClassName("e").length===1){return}bE.order.splice(1,0,"CLASS");bE.find.CLASS=function(bR,bS,bT){if(typeof bS.getElementsByClassName!=="undefined"&&!bT){return bS.getElementsByClassName(bR[1])}};e=null})();function bv(bR,bW,bV,bZ,bX,bY){for(var bT=0,bS=bZ.length;bT<bS;bT++){var e=bZ[bT];if(e){var bU=false;e=e[bR];while(e){if(e[bC]===bV){bU=bZ[e.sizset];break}if(e.nodeType===1&&!bY){e[bC]=bV;e.sizset=bT}if(e.nodeName.toLowerCase()===bW){bU=e;break}e=e[bR]}bZ[bT]=bU}}}function bN(bR,bW,bV,bZ,bX,bY){for(var bT=0,bS=bZ.length;bT<bS;bT++){var e=bZ[bT];if(e){var bU=false;e=e[bR];while(e){if(e[bC]===bV){bU=bZ[e.sizset];break}if(e.nodeType===1){if(!bY){e[bC]=bV;e.sizset=bT}if(typeof bW!=="string"){if(e===bW){bU=true;break}}else{if(by.filter(bW,[e]).length>0){bU=e;break}}}e=e[bR]}bZ[bT]=bU}}}if(av.documentElement.contains){by.contains=function(bR,e){return bR!==e&&(bR.contains?bR.contains(e):true)}}else{if(av.documentElement.compareDocumentPosition){by.contains=function(bR,e){return !!(bR.compareDocumentPosition(e)&16)}}else{by.contains=function(){return false}}}by.isXML=function(e){var bR=(e?e.ownerDocument||e:0).documentElement;return bR?bR.nodeName!=="HTML":false};var bM=function(bS,e,bW){var bV,bX=[],bU="",bY=e.nodeType?[e]:e;while((bV=bE.match.PSEUDO.exec(bS))){bU+=bV[0];bS=bS.replace(bE.match.PSEUDO,"")}bS=bE.relative[bS]?bS+"*":bS;for(var bT=0,bR=bY.length;bT<bR;bT++){by(bS,bY[bT],bX,bW)}return by.filter(bU,bX)};by.attr=b.attr;by.selectors.attrMap={};b.find=by;b.expr=by.selectors;b.expr[":"]=b.expr.filters;b.unique=by.uniqueSort;b.text=by.getText;b.isXMLDoc=by.isXML;b.contains=by.contains})();var ab=/Until$/,aq=/^(?:parents|prevUntil|prevAll)/,a9=/,/,bp=/^.[^:#\[\.,]*$/,P=Array.prototype.slice,H=b.expr.match.POS,ay={children:true,contents:true,next:true,prev:true};b.fn.extend({find:function(e){var bw=this,by,bv;if(typeof e!=="string"){return b(e).filter(function(){for(by=0,bv=bw.length;by<bv;by++){if(b.contains(bw[by],this)){return true}}})}var bx=this.pushStack("","find",e),bA,bB,bz;for(by=0,bv=this.length;by<bv;by++){bA=bx.length;b.find(e,this[by],bx);if(by>0){for(bB=bA;bB<bx.length;bB++){for(bz=0;bz<bA;bz++){if(bx[bz]===bx[bB]){bx.splice(bB--,1);break}}}}}return bx},has:function(bv){var e=b(bv);return this.filter(function(){for(var bx=0,bw=e.length;bx<bw;bx++){if(b.contains(this,e[bx])){return true}}})},not:function(e){return this.pushStack(aG(this,e,false),"not",e)},filter:function(e){return this.pushStack(aG(this,e,true),"filter",e)},is:function(e){return !!e&&(typeof e==="string"?H.test(e)?b(e,this.context).index(this[0])>=0:b.filter(e,this).length>0:this.filter(e).length>0)},closest:function(by,bx){var bv=[],bw,e,bz=this[0];if(b.isArray(by)){var bB=1;while(bz&&bz.ownerDocument&&bz!==bx){for(bw=0;bw<by.length;bw++){if(b(bz).is(by[bw])){bv.push({selector:by[bw],elem:bz,level:bB})}}bz=bz.parentNode;bB++}return bv}var bA=H.test(by)||typeof by!=="string"?b(by,bx||this.context):0;for(bw=0,e=this.length;bw<e;bw++){bz=this[bw];while(bz){if(bA?bA.index(bz)>-1:b.find.matchesSelector(bz,by)){bv.push(bz);break}else{bz=bz.parentNode;if(!bz||!bz.ownerDocument||bz===bx||bz.nodeType===11){break}}}}bv=bv.length>1?b.unique(bv):bv;return this.pushStack(bv,"closest",by)},index:function(e){if(!e){return(this[0]&&this[0].parentNode)?this.prevAll().length:-1}if(typeof e==="string"){return b.inArray(this[0],b(e))}return b.inArray(e.jquery?e[0]:e,this)},add:function(e,bv){var bx=typeof e==="string"?b(e,bv):b.makeArray(e&&e.nodeType?[e]:e),bw=b.merge(this.get(),bx);return this.pushStack(C(bx[0])||C(bw[0])?bw:b.unique(bw))},andSelf:function(){return this.add(this.prevObject)}});function C(e){return !e||!e.parentNode||e.parentNode.nodeType===11}b.each({parent:function(bv){var e=bv.parentNode;return e&&e.nodeType!==11?e:null},parents:function(e){return b.dir(e,"parentNode")},parentsUntil:function(bv,e,bw){return b.dir(bv,"parentNode",bw)},next:function(e){return b.nth(e,2,"nextSibling")},prev:function(e){return b.nth(e,2,"previousSibling")},nextAll:function(e){return b.dir(e,"nextSibling")},prevAll:function(e){return b.dir(e,"previousSibling")},nextUntil:function(bv,e,bw){return b.dir(bv,"nextSibling",bw)},prevUntil:function(bv,e,bw){return b.dir(bv,"previousSibling",bw)},siblings:function(e){return b.sibling(e.parentNode.firstChild,e)},children:function(e){return b.sibling(e.firstChild)},contents:function(e){return b.nodeName(e,"iframe")?e.contentDocument||e.contentWindow.document:b.makeArray(e.childNodes)}},function(e,bv){b.fn[e]=function(by,bw){var bx=b.map(this,bv,by);if(!ab.test(e)){bw=by}if(bw&&typeof bw==="string"){bx=b.filter(bw,bx)}bx=this.length>1&&!ay[e]?b.unique(bx):bx;if((this.length>1||a9.test(bw))&&aq.test(e)){bx=bx.reverse()}return this.pushStack(bx,e,P.call(arguments).join(","))}});b.extend({filter:function(bw,e,bv){if(bv){bw=":not("+bw+")"}return e.length===1?b.find.matchesSelector(e[0],bw)?[e[0]]:[]:b.find.matches(bw,e)},dir:function(bw,bv,by){var e=[],bx=bw[bv];while(bx&&bx.nodeType!==9&&(by===L||bx.nodeType!==1||!b(bx).is(by))){if(bx.nodeType===1){e.push(bx)}bx=bx[bv]}return e},nth:function(by,e,bw,bx){e=e||1;var bv=0;for(;by;by=by[bw]){if(by.nodeType===1&&++bv===e){break}}return by},sibling:function(bw,bv){var e=[];for(;bw;bw=bw.nextSibling){if(bw.nodeType===1&&bw!==bv){e.push(bw)}}return e}});function aG(bx,bw,e){bw=bw||0;if(b.isFunction(bw)){return b.grep(bx,function(bz,by){var bA=!!bw.call(bz,by,bz);return bA===e})}else{if(bw.nodeType){return b.grep(bx,function(bz,by){return(bz===bw)===e})}else{if(typeof bw==="string"){var bv=b.grep(bx,function(by){return by.nodeType===1});if(bp.test(bw)){return b.filter(bw,bv,!e)}else{bw=b.filter(bw,bv)}}}}return b.grep(bx,function(bz,by){return(b.inArray(bz,bw)>=0)===e})}function a(e){var bw=aR.split("|"),bv=e.createDocumentFragment();if(bv.createElement){while(bw.length){bv.createElement(bw.pop())}}return bv}var aR="abbr|article|aside|audio|canvas|datalist|details|figcaption|figure|footer|header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",ag=/ jQuery\d+="(?:\d+|null)"/g,ar=/^\s+/,R=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,d=/<([\w:]+)/,w=/<tbody/i,W=/<|&#?\w+;/,ae=/<(?:script|style)/i,O=/<(?:script|object|embed|option|style)/i,ah=new RegExp("<(?:"+aR+")","i"),o=/checked\s*(?:[^=]|=\s*.checked.)/i,bm=/\/(java|ecma)script/i,aN=/^\s*<!(?:\[CDATA\[|\-\-)/,ax={option:[1,"<select multiple='multiple'>","</select>"],legend:[1,"<fieldset>","</fieldset>"],thead:[1,"<table>","</table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],col:[2,"<table><tbody></tbody><colgroup>","</colgroup></table>"],area:[1,"<map>","</map>"],_default:[0,"",""]},ac=a(av);ax.optgroup=ax.option;ax.tbody=ax.tfoot=ax.colgroup=ax.caption=ax.thead;ax.th=ax.td;if(!b.support.htmlSerialize){ax._default=[1,"div<div>","</div>"]}b.fn.extend({text:function(e){if(b.isFunction(e)){return this.each(function(bw){var bv=b(this);bv.text(e.call(this,bw,bv.text()))})}if(typeof e!=="object"&&e!==L){return this.empty().append((this[0]&&this[0].ownerDocument||av).createTextNode(e))}return b.text(this)},wrapAll:function(e){if(b.isFunction(e)){return this.each(function(bw){b(this).wrapAll(e.call(this,bw))})}if(this[0]){var bv=b(e,this[0].ownerDocument).eq(0).clone(true);if(this[0].parentNode){bv.insertBefore(this[0])}bv.map(function(){var bw=this;while(bw.firstChild&&bw.firstChild.nodeType===1){bw=bw.firstChild}return bw}).append(this)}return this},wrapInner:function(e){if(b.isFunction(e)){return this.each(function(bv){b(this).wrapInner(e.call(this,bv))})}return this.each(function(){var bv=b(this),bw=bv.contents();if(bw.length){bw.wrapAll(e)}else{bv.append(e)}})},wrap:function(e){var bv=b.isFunction(e);return this.each(function(bw){b(this).wrapAll(bv?e.call(this,bw):e)})},unwrap:function(){return this.parent().each(function(){if(!b.nodeName(this,"body")){b(this).replaceWith(this.childNodes)}}).end()},append:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.appendChild(e)}})},prepend:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.insertBefore(e,this.firstChild)}})},before:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this)})}else{if(arguments.length){var e=b.clean(arguments);e.push.apply(e,this.toArray());return this.pushStack(e,"before",arguments)}}},after:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this.nextSibling)})}else{if(arguments.length){var e=this.pushStack(this,"after",arguments);e.push.apply(e,b.clean(arguments));return e}}},remove:function(e,bx){for(var bv=0,bw;(bw=this[bv])!=null;bv++){if(!e||b.filter(e,[bw]).length){if(!bx&&bw.nodeType===1){b.cleanData(bw.getElementsByTagName("*"));b.cleanData([bw])}if(bw.parentNode){bw.parentNode.removeChild(bw)}}}return this},empty:function(){for(var e=0,bv;(bv=this[e])!=null;e++){if(bv.nodeType===1){b.cleanData(bv.getElementsByTagName("*"))}while(bv.firstChild){bv.removeChild(bv.firstChild)}}return this},clone:function(bv,e){bv=bv==null?false:bv;e=e==null?bv:e;return this.map(function(){return b.clone(this,bv,e)})},html:function(bx){if(bx===L){return this[0]&&this[0].nodeType===1?this[0].innerHTML.replace(ag,""):null}else{if(typeof bx==="string"&&!ae.test(bx)&&(b.support.leadingWhitespace||!ar.test(bx))&&!ax[(d.exec(bx)||["",""])[1].toLowerCase()]){bx=bx.replace(R,"<$1></$2>");try{for(var bw=0,bv=this.length;bw<bv;bw++){if(this[bw].nodeType===1){b.cleanData(this[bw].getElementsByTagName("*"));this[bw].innerHTML=bx}}}catch(by){this.empty().append(bx)}}else{if(b.isFunction(bx)){this.each(function(bz){var e=b(this);e.html(bx.call(this,bz,e.html()))})}else{this.empty().append(bx)}}}return this},replaceWith:function(e){if(this[0]&&this[0].parentNode){if(b.isFunction(e)){return this.each(function(bx){var bw=b(this),bv=bw.html();bw.replaceWith(e.call(this,bx,bv))})}if(typeof e!=="string"){e=b(e).detach()}return this.each(function(){var bw=this.nextSibling,bv=this.parentNode;b(this).remove();if(bw){b(bw).before(e)}else{b(bv).append(e)}})}else{return this.length?this.pushStack(b(b.isFunction(e)?e():e),"replaceWith",e):this}},detach:function(e){return this.remove(e,true)},domManip:function(bB,bF,bE){var bx,by,bA,bD,bC=bB[0],bv=[];if(!b.support.checkClone&&arguments.length===3&&typeof bC==="string"&&o.test(bC)){return this.each(function(){b(this).domManip(bB,bF,bE,true)})}if(b.isFunction(bC)){return this.each(function(bH){var bG=b(this);bB[0]=bC.call(this,bH,bF?bG.html():L);bG.domManip(bB,bF,bE)})}if(this[0]){bD=bC&&bC.parentNode;if(b.support.parentNode&&bD&&bD.nodeType===11&&bD.childNodes.length===this.length){bx={fragment:bD}}else{bx=b.buildFragment(bB,this,bv)}bA=bx.fragment;if(bA.childNodes.length===1){by=bA=bA.firstChild}else{by=bA.firstChild}if(by){bF=bF&&b.nodeName(by,"tr");for(var bw=0,e=this.length,bz=e-1;bw<e;bw++){bE.call(bF?ba(this[bw],by):this[bw],bx.cacheable||(e>1&&bw<bz)?b.clone(bA,true,true):bA)}}if(bv.length){b.each(bv,bo)}}return this}});function ba(e,bv){return b.nodeName(e,"table")?(e.getElementsByTagName("tbody")[0]||e.appendChild(e.ownerDocument.createElement("tbody"))):e}function t(bB,bv){if(bv.nodeType!==1||!b.hasData(bB)){return}var by,bx,e,bA=b._data(bB),bz=b._data(bv,bA),bw=bA.events;if(bw){delete bz.handle;bz.events={};for(by in bw){for(bx=0,e=bw[by].length;bx<e;bx++){b.event.add(bv,by+(bw[by][bx].namespace?".":"")+bw[by][bx].namespace,bw[by][bx],bw[by][bx].data)}}}if(bz.data){bz.data=b.extend({},bz.data)}}function ai(bv,e){var bw;if(e.nodeType!==1){return}if(e.clearAttributes){e.clearAttributes()}if(e.mergeAttributes){e.mergeAttributes(bv)}bw=e.nodeName.toLowerCase();if(bw==="object"){e.outerHTML=bv.outerHTML}else{if(bw==="input"&&(bv.type==="checkbox"||bv.type==="radio")){if(bv.checked){e.defaultChecked=e.checked=bv.checked}if(e.value!==bv.value){e.value=bv.value}}else{if(bw==="option"){e.selected=bv.defaultSelected}else{if(bw==="input"||bw==="textarea"){e.defaultValue=bv.defaultValue}}}}e.removeAttribute(b.expando)}b.buildFragment=function(bz,bx,bv){var by,e,bw,bA,bB=bz[0];if(bx&&bx[0]){bA=bx[0].ownerDocument||bx[0]}if(!bA.createDocumentFragment){bA=av}if(bz.length===1&&typeof bB==="string"&&bB.length<512&&bA===av&&bB.charAt(0)==="<"&&!O.test(bB)&&(b.support.checkClone||!o.test(bB))&&(b.support.html5Clone||!ah.test(bB))){e=true;bw=b.fragments[bB];if(bw&&bw!==1){by=bw}}if(!by){by=bA.createDocumentFragment();b.clean(bz,bA,by,bv)}if(e){b.fragments[bB]=bw?by:1}return{fragment:by,cacheable:e}};b.fragments={};b.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,bv){b.fn[e]=function(bw){var bz=[],bC=b(bw),bB=this.length===1&&this[0].parentNode;if(bB&&bB.nodeType===11&&bB.childNodes.length===1&&bC.length===1){bC[bv](this[0]);return this}else{for(var bA=0,bx=bC.length;bA<bx;bA++){var by=(bA>0?this.clone(true):this).get();b(bC[bA])[bv](by);bz=bz.concat(by)}return this.pushStack(bz,e,bC.selector)}}});function bg(e){if(typeof e.getElementsByTagName!=="undefined"){return e.getElementsByTagName("*")}else{if(typeof e.querySelectorAll!=="undefined"){return e.querySelectorAll("*")}else{return[]}}}function az(e){if(e.type==="checkbox"||e.type==="radio"){e.defaultChecked=e.checked}}function E(e){var bv=(e.nodeName||"").toLowerCase();if(bv==="input"){az(e)}else{if(bv!=="script"&&typeof e.getElementsByTagName!=="undefined"){b.grep(e.getElementsByTagName("input"),az)}}}function al(e){var bv=av.createElement("div");ac.appendChild(bv);bv.innerHTML=e.outerHTML;return bv.firstChild}b.extend({clone:function(by,bA,bw){var e,bv,bx,bz=b.support.html5Clone||!ah.test("<"+by.nodeName)?by.cloneNode(true):al(by);if((!b.support.noCloneEvent||!b.support.noCloneChecked)&&(by.nodeType===1||by.nodeType===11)&&!b.isXMLDoc(by)){ai(by,bz);e=bg(by);bv=bg(bz);for(bx=0;e[bx];++bx){if(bv[bx]){ai(e[bx],bv[bx])}}}if(bA){t(by,bz);if(bw){e=bg(by);bv=bg(bz);for(bx=0;e[bx];++bx){t(e[bx],bv[bx])}}}e=bv=null;return bz},clean:function(bw,by,bH,bA){var bF;by=by||av;if(typeof by.createElement==="undefined"){by=by.ownerDocument||by[0]&&by[0].ownerDocument||av}var bI=[],bB;for(var bE=0,bz;(bz=bw[bE])!=null;bE++){if(typeof bz==="number"){bz+=""}if(!bz){continue}if(typeof bz==="string"){if(!W.test(bz)){bz=by.createTextNode(bz)}else{bz=bz.replace(R,"<$1></$2>");var bK=(d.exec(bz)||["",""])[1].toLowerCase(),bx=ax[bK]||ax._default,bD=bx[0],bv=by.createElement("div");if(by===av){ac.appendChild(bv)}else{a(by).appendChild(bv)}bv.innerHTML=bx[1]+bz+bx[2];while(bD--){bv=bv.lastChild}if(!b.support.tbody){var e=w.test(bz),bC=bK==="table"&&!e?bv.firstChild&&bv.firstChild.childNodes:bx[1]==="<table>"&&!e?bv.childNodes:[];for(bB=bC.length-1;bB>=0;--bB){if(b.nodeName(bC[bB],"tbody")&&!bC[bB].childNodes.length){bC[bB].parentNode.removeChild(bC[bB])}}}if(!b.support.leadingWhitespace&&ar.test(bz)){bv.insertBefore(by.createTextNode(ar.exec(bz)[0]),bv.firstChild)}bz=bv.childNodes}}var bG;if(!b.support.appendChecked){if(bz[0]&&typeof(bG=bz.length)==="number"){for(bB=0;bB<bG;bB++){E(bz[bB])}}else{E(bz)}}if(bz.nodeType){bI.push(bz)}else{bI=b.merge(bI,bz)}}if(bH){bF=function(bL){return !bL.type||bm.test(bL.type)};for(bE=0;bI[bE];bE++){if(bA&&b.nodeName(bI[bE],"script")&&(!bI[bE].type||bI[bE].type.toLowerCase()==="text/javascript")){bA.push(bI[bE].parentNode?bI[bE].parentNode.removeChild(bI[bE]):bI[bE])}else{if(bI[bE].nodeType===1){var bJ=b.grep(bI[bE].getElementsByTagName("script"),bF);bI.splice.apply(bI,[bE+1,0].concat(bJ))}bH.appendChild(bI[bE])}}}return bI},cleanData:function(bv){var by,bw,e=b.cache,bB=b.event.special,bA=b.support.deleteExpando;for(var bz=0,bx;(bx=bv[bz])!=null;bz++){if(bx.nodeName&&b.noData[bx.nodeName.toLowerCase()]){continue}bw=bx[b.expando];if(bw){by=e[bw];if(by&&by.events){for(var bC in by.events){if(bB[bC]){b.event.remove(bx,bC)}else{b.removeEvent(bx,bC,by.handle)}}if(by.handle){by.handle.elem=null}}if(bA){delete bx[b.expando]}else{if(bx.removeAttribute){bx.removeAttribute(b.expando)}}delete e[bw]}}}});function bo(e,bv){if(bv.src){b.ajax({url:bv.src,async:false,dataType:"script"})}else{b.globalEval((bv.text||bv.textContent||bv.innerHTML||"").replace(aN,"/*$0*/"))}if(bv.parentNode){bv.parentNode.removeChild(bv)}}var ak=/alpha\([^)]*\)/i,au=/opacity=([^)]*)/,z=/([A-Z]|^ms)/g,bc=/^-?\d+(?:px)?$/i,bn=/^-?\d/,I=/^([\-+])=([\-+.\de]+)/,a7={position:"absolute",visibility:"hidden",display:"block"},an=["Left","Right"],a1=["Top","Bottom"],Z,aI,aX;b.fn.css=function(e,bv){if(arguments.length===2&&bv===L){return this}return b.access(this,e,bv,true,function(bx,bw,by){return by!==L?b.style(bx,bw,by):b.css(bx,bw)})};b.extend({cssHooks:{opacity:{get:function(bw,bv){if(bv){var e=Z(bw,"opacity","opacity");return e===""?"1":e}else{return bw.style.opacity}}}},cssNumber:{fillOpacity:true,fontWeight:true,lineHeight:true,opacity:true,orphans:true,widows:true,zIndex:true,zoom:true},cssProps:{"float":b.support.cssFloat?"cssFloat":"styleFloat"},style:function(bx,bw,bD,by){if(!bx||bx.nodeType===3||bx.nodeType===8||!bx.style){return}var bB,bC,bz=b.camelCase(bw),bv=bx.style,bE=b.cssHooks[bz];bw=b.cssProps[bz]||bz;if(bD!==L){bC=typeof bD;if(bC==="string"&&(bB=I.exec(bD))){bD=(+(bB[1]+1)*+bB[2])+parseFloat(b.css(bx,bw));bC="number"}if(bD==null||bC==="number"&&isNaN(bD)){return}if(bC==="number"&&!b.cssNumber[bz]){bD+="px"}if(!bE||!("set" in bE)||(bD=bE.set(bx,bD))!==L){try{bv[bw]=bD}catch(bA){}}}else{if(bE&&"get" in bE&&(bB=bE.get(bx,false,by))!==L){return bB}return bv[bw]}},css:function(by,bx,bv){var bw,e;bx=b.camelCase(bx);e=b.cssHooks[bx];bx=b.cssProps[bx]||bx;if(bx==="cssFloat"){bx="float"}if(e&&"get" in e&&(bw=e.get(by,true,bv))!==L){return bw}else{if(Z){return Z(by,bx)}}},swap:function(bx,bw,by){var e={};for(var bv in bw){e[bv]=bx.style[bv];bx.style[bv]=bw[bv]}by.call(bx);for(bv in bw){bx.style[bv]=e[bv]}}});b.curCSS=b.css;b.each(["height","width"],function(bv,e){b.cssHooks[e]={get:function(by,bx,bw){var bz;if(bx){if(by.offsetWidth!==0){return p(by,e,bw)}else{b.swap(by,a7,function(){bz=p(by,e,bw)})}return bz}},set:function(bw,bx){if(bc.test(bx)){bx=parseFloat(bx);if(bx>=0){return bx+"px"}}else{return bx}}}});if(!b.support.opacity){b.cssHooks.opacity={get:function(bv,e){return au.test((e&&bv.currentStyle?bv.currentStyle.filter:bv.style.filter)||"")?(parseFloat(RegExp.$1)/100)+"":e?"1":""},set:function(by,bz){var bx=by.style,bv=by.currentStyle,e=b.isNumeric(bz)?"alpha(opacity="+bz*100+")":"",bw=bv&&bv.filter||bx.filter||"";bx.zoom=1;if(bz>=1&&b.trim(bw.replace(ak,""))===""){bx.removeAttribute("filter");if(bv&&!bv.filter){return}}bx.filter=ak.test(bw)?bw.replace(ak,e):bw+" "+e}}}b(function(){if(!b.support.reliableMarginRight){b.cssHooks.marginRight={get:function(bw,bv){var e;b.swap(bw,{display:"inline-block"},function(){if(bv){e=Z(bw,"margin-right","marginRight")}else{e=bw.style.marginRight}});return e}}}});if(av.defaultView&&av.defaultView.getComputedStyle){aI=function(by,bw){var bv,bx,e;bw=bw.replace(z,"-$1").toLowerCase();if((bx=by.ownerDocument.defaultView)&&(e=bx.getComputedStyle(by,null))){bv=e.getPropertyValue(bw);if(bv===""&&!b.contains(by.ownerDocument.documentElement,by)){bv=b.style(by,bw)}}return bv}}if(av.documentElement.currentStyle){aX=function(bz,bw){var bA,e,by,bv=bz.currentStyle&&bz.currentStyle[bw],bx=bz.style;if(bv===null&&bx&&(by=bx[bw])){bv=by}if(!bc.test(bv)&&bn.test(bv)){bA=bx.left;e=bz.runtimeStyle&&bz.runtimeStyle.left;if(e){bz.runtimeStyle.left=bz.currentStyle.left}bx.left=bw==="fontSize"?"1em":(bv||0);bv=bx.pixelLeft+"px";bx.left=bA;if(e){bz.runtimeStyle.left=e}}return bv===""?"auto":bv}}Z=aI||aX;function p(by,bw,bv){var bA=bw==="width"?by.offsetWidth:by.offsetHeight,bz=bw==="width"?an:a1,bx=0,e=bz.length;if(bA>0){if(bv!=="border"){for(;bx<e;bx++){if(!bv){bA-=parseFloat(b.css(by,"padding"+bz[bx]))||0}if(bv==="margin"){bA+=parseFloat(b.css(by,bv+bz[bx]))||0}else{bA-=parseFloat(b.css(by,"border"+bz[bx]+"Width"))||0}}}return bA+"px"}bA=Z(by,bw,bw);if(bA<0||bA==null){bA=by.style[bw]||0}bA=parseFloat(bA)||0;if(bv){for(;bx<e;bx++){bA+=parseFloat(b.css(by,"padding"+bz[bx]))||0;if(bv!=="padding"){bA+=parseFloat(b.css(by,"border"+bz[bx]+"Width"))||0}if(bv==="margin"){bA+=parseFloat(b.css(by,bv+bz[bx]))||0}}}return bA+"px"}if(b.expr&&b.expr.filters){b.expr.filters.hidden=function(bw){var bv=bw.offsetWidth,e=bw.offsetHeight;return(bv===0&&e===0)||(!b.support.reliableHiddenOffsets&&((bw.style&&bw.style.display)||b.css(bw,"display"))==="none")};b.expr.filters.visible=function(e){return !b.expr.filters.hidden(e)}}var k=/%20/g,ap=/\[\]$/,bs=/\r?\n/g,bq=/#.*$/,aD=/^(.*?):[ \t]*([^\r\n]*)\r?$/mg,aZ=/^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,aM=/^(?:about|app|app\-storage|.+\-extension|file|res|widget):$/,aQ=/^(?:GET|HEAD)$/,c=/^\/\//,M=/\?/,a6=/<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,q=/^(?:select|textarea)/i,h=/\s+/,br=/([?&])_=[^&]*/,K=/^([\w\+\.\-]+:)(?:\/\/([^\/?#:]*)(?::(\d+))?)?/,A=b.fn.load,aa={},r={},aE,s,aV=["*/"]+["*"];try{aE=bl.href}catch(aw){aE=av.createElement("a");aE.href="";aE=aE.href}s=K.exec(aE.toLowerCase())||[];function f(e){return function(by,bA){if(typeof by!=="string"){bA=by;by="*"}if(b.isFunction(bA)){var bx=by.toLowerCase().split(h),bw=0,bz=bx.length,bv,bB,bC;for(;bw<bz;bw++){bv=bx[bw];bC=/^\+/.test(bv);if(bC){bv=bv.substr(1)||"*"}bB=e[bv]=e[bv]||[];bB[bC?"unshift":"push"](bA)}}}}function aW(bv,bE,bz,bD,bB,bx){bB=bB||bE.dataTypes[0];bx=bx||{};bx[bB]=true;var bA=bv[bB],bw=0,e=bA?bA.length:0,by=(bv===aa),bC;for(;bw<e&&(by||!bC);bw++){bC=bA[bw](bE,bz,bD);if(typeof bC==="string"){if(!by||bx[bC]){bC=L}else{bE.dataTypes.unshift(bC);bC=aW(bv,bE,bz,bD,bC,bx)}}}if((by||!bC)&&!bx["*"]){bC=aW(bv,bE,bz,bD,"*",bx)}return bC}function am(bw,bx){var bv,e,by=b.ajaxSettings.flatOptions||{};for(bv in bx){if(bx[bv]!==L){(by[bv]?bw:(e||(e={})))[bv]=bx[bv]}}if(e){b.extend(true,bw,e)}}b.fn.extend({load:function(bw,bz,bA){if(typeof bw!=="string"&&A){return A.apply(this,arguments)}else{if(!this.length){return this}}var by=bw.indexOf(" ");if(by>=0){var e=bw.slice(by,bw.length);bw=bw.slice(0,by)}var bx="GET";if(bz){if(b.isFunction(bz)){bA=bz;bz=L}else{if(typeof bz==="object"){bz=b.param(bz,b.ajaxSettings.traditional);bx="POST"}}}var bv=this;b.ajax({url:bw,type:bx,dataType:"html",data:bz,complete:function(bC,bB,bD){bD=bC.responseText;if(bC.isResolved()){bC.done(function(bE){bD=bE});bv.html(e?b("<div>").append(bD.replace(a6,"")).find(e):bD)}if(bA){bv.each(bA,[bD,bB,bC])}}});return this},serialize:function(){return b.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?b.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||q.test(this.nodeName)||aZ.test(this.type))}).map(function(e,bv){var bw=b(this).val();return bw==null?null:b.isArray(bw)?b.map(bw,function(by,bx){return{name:bv.name,value:by.replace(bs,"\r\n")}}):{name:bv.name,value:bw.replace(bs,"\r\n")}}).get()}});b.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "),function(e,bv){b.fn[bv]=function(bw){return this.on(bv,bw)}});b.each(["get","post"],function(e,bv){b[bv]=function(bw,by,bz,bx){if(b.isFunction(by)){bx=bx||bz;bz=by;by=L}return b.ajax({type:bv,url:bw,data:by,success:bz,dataType:bx})}});b.extend({getScript:function(e,bv){return b.get(e,L,bv,"script")},getJSON:function(e,bv,bw){return b.get(e,bv,bw,"json")},ajaxSetup:function(bv,e){if(e){am(bv,b.ajaxSettings)}else{e=bv;bv=b.ajaxSettings}am(bv,e);return bv},ajaxSettings:{url:aE,isLocal:aM.test(s[1]),global:true,type:"GET",contentType:"application/x-www-form-urlencoded",processData:true,async:true,accepts:{xml:"application/xml, text/xml",html:"text/html",text:"text/plain",json:"application/json, text/javascript","*":aV},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:"responseXML",text:"responseText"},converters:{"* text":bb.String,"text html":true,"text json":b.parseJSON,"text xml":b.parseXML},flatOptions:{context:true,url:true}},ajaxPrefilter:f(aa),ajaxTransport:f(r),ajax:function(bz,bx){if(typeof bz==="object"){bx=bz;bz=L}bx=bx||{};var bD=b.ajaxSetup({},bx),bS=bD.context||bD,bG=bS!==bD&&(bS.nodeType||bS instanceof b)?b(bS):b.event,bR=b.Deferred(),bN=b.Callbacks("once memory"),bB=bD.statusCode||{},bC,bH={},bO={},bQ,by,bL,bE,bI,bA=0,bw,bK,bJ={readyState:0,setRequestHeader:function(bT,bU){if(!bA){var e=bT.toLowerCase();bT=bO[e]=bO[e]||bT;bH[bT]=bU}return this},getAllResponseHeaders:function(){return bA===2?bQ:null},getResponseHeader:function(bT){var e;if(bA===2){if(!by){by={};while((e=aD.exec(bQ))){by[e[1].toLowerCase()]=e[2]}}e=by[bT.toLowerCase()]}return e===L?null:e},overrideMimeType:function(e){if(!bA){bD.mimeType=e}return this},abort:function(e){e=e||"abort";if(bL){bL.abort(e)}bF(0,e);return this}};function bF(bZ,bU,b0,bW){if(bA===2){return}bA=2;if(bE){clearTimeout(bE)}bL=L;bQ=bW||"";bJ.readyState=bZ>0?4:0;var bT,b4,b3,bX=bU,bY=b0?bj(bD,bJ,b0):L,bV,b2;if(bZ>=200&&bZ<300||bZ===304){if(bD.ifModified){if((bV=bJ.getResponseHeader("Last-Modified"))){b.lastModified[bC]=bV}if((b2=bJ.getResponseHeader("Etag"))){b.etag[bC]=b2}}if(bZ===304){bX="notmodified";bT=true}else{try{b4=G(bD,bY);bX="success";bT=true}catch(b1){bX="parsererror";b3=b1}}}else{b3=bX;if(!bX||bZ){bX="error";if(bZ<0){bZ=0}}}bJ.status=bZ;bJ.statusText=""+(bU||bX);if(bT){bR.resolveWith(bS,[b4,bX,bJ])}else{bR.rejectWith(bS,[bJ,bX,b3])}bJ.statusCode(bB);bB=L;if(bw){bG.trigger("ajax"+(bT?"Success":"Error"),[bJ,bD,bT?b4:b3])}bN.fireWith(bS,[bJ,bX]);if(bw){bG.trigger("ajaxComplete",[bJ,bD]);if(!(--b.active)){b.event.trigger("ajaxStop")}}}bR.promise(bJ);bJ.success=bJ.done;bJ.error=bJ.fail;bJ.complete=bN.add;bJ.statusCode=function(bT){if(bT){var e;if(bA<2){for(e in bT){bB[e]=[bB[e],bT[e]]}}else{e=bT[bJ.status];bJ.then(e,e)}}return this};bD.url=((bz||bD.url)+"").replace(bq,"").replace(c,s[1]+"//");bD.dataTypes=b.trim(bD.dataType||"*").toLowerCase().split(h);if(bD.crossDomain==null){bI=K.exec(bD.url.toLowerCase());bD.crossDomain=!!(bI&&(bI[1]!=s[1]||bI[2]!=s[2]||(bI[3]||(bI[1]==="http:"?80:443))!=(s[3]||(s[1]==="http:"?80:443))))}if(bD.data&&bD.processData&&typeof bD.data!=="string"){bD.data=b.param(bD.data,bD.traditional)}aW(aa,bD,bx,bJ);if(bA===2){return false}bw=bD.global;bD.type=bD.type.toUpperCase();bD.hasContent=!aQ.test(bD.type);if(bw&&b.active++===0){b.event.trigger("ajaxStart")}if(!bD.hasContent){if(bD.data){bD.url+=(M.test(bD.url)?"&":"?")+bD.data;delete bD.data}bC=bD.url;if(bD.cache===false){var bv=b.now(),bP=bD.url.replace(br,"$1_="+bv);bD.url=bP+((bP===bD.url)?(M.test(bD.url)?"&":"?")+"_="+bv:"")}}if(bD.data&&bD.hasContent&&bD.contentType!==false||bx.contentType){bJ.setRequestHeader("Content-Type",bD.contentType)}if(bD.ifModified){bC=bC||bD.url;if(b.lastModified[bC]){bJ.setRequestHeader("If-Modified-Since",b.lastModified[bC])}if(b.etag[bC]){bJ.setRequestHeader("If-None-Match",b.etag[bC])}}bJ.setRequestHeader("Accept",bD.dataTypes[0]&&bD.accepts[bD.dataTypes[0]]?bD.accepts[bD.dataTypes[0]]+(bD.dataTypes[0]!=="*"?", "+aV+"; q=0.01":""):bD.accepts["*"]);for(bK in bD.headers){bJ.setRequestHeader(bK,bD.headers[bK])}if(bD.beforeSend&&(bD.beforeSend.call(bS,bJ,bD)===false||bA===2)){bJ.abort();return false}for(bK in {success:1,error:1,complete:1}){bJ[bK](bD[bK])}bL=aW(r,bD,bx,bJ);if(!bL){bF(-1,"No Transport")}else{bJ.readyState=1;if(bw){bG.trigger("ajaxSend",[bJ,bD])}if(bD.async&&bD.timeout>0){bE=setTimeout(function(){bJ.abort("timeout")},bD.timeout)}try{bA=1;bL.send(bH,bF)}catch(bM){if(bA<2){bF(-1,bM)}else{throw bM}}}return bJ},param:function(e,bw){var bv=[],by=function(bz,bA){bA=b.isFunction(bA)?bA():bA;bv[bv.length]=encodeURIComponent(bz)+"="+encodeURIComponent(bA)};if(bw===L){bw=b.ajaxSettings.traditional}if(b.isArray(e)||(e.jquery&&!b.isPlainObject(e))){b.each(e,function(){by(this.name,this.value)})}else{for(var bx in e){v(bx,e[bx],bw,by)}}return bv.join("&").replace(k,"+")}});function v(bw,by,bv,bx){if(b.isArray(by)){b.each(by,function(bA,bz){if(bv||ap.test(bw)){bx(bw,bz)}else{v(bw+"["+(typeof bz==="object"||b.isArray(bz)?bA:"")+"]",bz,bv,bx)}})}else{if(!bv&&by!=null&&typeof by==="object"){for(var e in by){v(bw+"["+e+"]",by[e],bv,bx)}}else{bx(bw,by)}}}b.extend({active:0,lastModified:{},etag:{}});function bj(bD,bC,bz){var bv=bD.contents,bB=bD.dataTypes,bw=bD.responseFields,by,bA,bx,e;for(bA in bw){if(bA in bz){bC[bw[bA]]=bz[bA]}}while(bB[0]==="*"){bB.shift();if(by===L){by=bD.mimeType||bC.getResponseHeader("content-type")}}if(by){for(bA in bv){if(bv[bA]&&bv[bA].test(by)){bB.unshift(bA);break}}}if(bB[0] in bz){bx=bB[0]}else{for(bA in bz){if(!bB[0]||bD.converters[bA+" "+bB[0]]){bx=bA;break}if(!e){e=bA}}bx=bx||e}if(bx){if(bx!==bB[0]){bB.unshift(bx)}return bz[bx]}}function G(bH,bz){if(bH.dataFilter){bz=bH.dataFilter(bz,bH.dataType)}var bD=bH.dataTypes,bG={},bA,bE,bw=bD.length,bB,bC=bD[0],bx,by,bF,bv,e;for(bA=1;bA<bw;bA++){if(bA===1){for(bE in bH.converters){if(typeof bE==="string"){bG[bE.toLowerCase()]=bH.converters[bE]}}}bx=bC;bC=bD[bA];if(bC==="*"){bC=bx}else{if(bx!=="*"&&bx!==bC){by=bx+" "+bC;bF=bG[by]||bG["* "+bC];if(!bF){e=L;for(bv in bG){bB=bv.split(" ");if(bB[0]===bx||bB[0]==="*"){e=bG[bB[1]+" "+bC];if(e){bv=bG[bv];if(bv===true){bF=e}else{if(e===true){bF=bv}}break}}}}if(!(bF||e)){b.error("No conversion from "+by.replace(" "," to "))}if(bF!==true){bz=bF?bF(bz):e(bv(bz))}}}}return bz}var aC=b.now(),u=/(\=)\?(&|$)|\?\?/i;b.ajaxSetup({jsonp:"callback",jsonpCallback:function(){return b.expando+"_"+(aC++)}});b.ajaxPrefilter("json jsonp",function(bD,bA,bC){var bx=bD.contentType==="application/x-www-form-urlencoded"&&(typeof bD.data==="string");if(bD.dataTypes[0]==="jsonp"||bD.jsonp!==false&&(u.test(bD.url)||bx&&u.test(bD.data))){var bB,bw=bD.jsonpCallback=b.isFunction(bD.jsonpCallback)?bD.jsonpCallback():bD.jsonpCallback,bz=bb[bw],e=bD.url,by=bD.data,bv="$1"+bw+"$2";if(bD.jsonp!==false){e=e.replace(u,bv);if(bD.url===e){if(bx){by=by.replace(u,bv)}if(bD.data===by){e+=(/\?/.test(e)?"&":"?")+bD.jsonp+"="+bw}}}bD.url=e;bD.data=by;bb[bw]=function(bE){bB=[bE]};bC.always(function(){bb[bw]=bz;if(bB&&b.isFunction(bz)){bb[bw](bB[0])}});bD.converters["script json"]=function(){if(!bB){b.error(bw+" was not called")}return bB[0]};bD.dataTypes[0]="json";return"script"}});b.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/javascript|ecmascript/},converters:{"text script":function(e){b.globalEval(e);return e}}});b.ajaxPrefilter("script",function(e){if(e.cache===L){e.cache=false}if(e.crossDomain){e.type="GET";e.global=false}});b.ajaxTransport("script",function(bw){if(bw.crossDomain){var e,bv=av.head||av.getElementsByTagName("head")[0]||av.documentElement;return{send:function(bx,by){e=av.createElement("script");e.async="async";if(bw.scriptCharset){e.charset=bw.scriptCharset}e.src=bw.url;e.onload=e.onreadystatechange=function(bA,bz){if(bz||!e.readyState||/loaded|complete/.test(e.readyState)){e.onload=e.onreadystatechange=null;if(bv&&e.parentNode){bv.removeChild(e)}e=L;if(!bz){by(200,"success")}}};bv.insertBefore(e,bv.firstChild)},abort:function(){if(e){e.onload(0,1)}}}}});var B=bb.ActiveXObject?function(){for(var e in N){N[e](0,1)}}:false,y=0,N;function aL(){try{return new bb.XMLHttpRequest()}catch(bv){}}function aj(){try{return new bb.ActiveXObject("Microsoft.XMLHTTP")}catch(bv){}}b.ajaxSettings.xhr=bb.ActiveXObject?function(){return !this.isLocal&&aL()||aj()}:aL;(function(e){b.extend(b.support,{ajax:!!e,cors:!!e&&("withCredentials" in e)})})(b.ajaxSettings.xhr());if(b.support.ajax){b.ajaxTransport(function(e){if(!e.crossDomain||b.support.cors){var bv;return{send:function(bB,bw){var bA=e.xhr(),bz,by;if(e.username){bA.open(e.type,e.url,e.async,e.username,e.password)}else{bA.open(e.type,e.url,e.async)}if(e.xhrFields){for(by in e.xhrFields){bA[by]=e.xhrFields[by]}}if(e.mimeType&&bA.overrideMimeType){bA.overrideMimeType(e.mimeType)}if(!e.crossDomain&&!bB["X-Requested-With"]){bB["X-Requested-With"]="XMLHttpRequest"}try{for(by in bB){bA.setRequestHeader(by,bB[by])}}catch(bx){}bA.send((e.hasContent&&e.data)||null);bv=function(bK,bE){var bF,bD,bC,bI,bH;try{if(bv&&(bE||bA.readyState===4)){bv=L;if(bz){bA.onreadystatechange=b.noop;if(B){delete N[bz]}}if(bE){if(bA.readyState!==4){bA.abort()}}else{bF=bA.status;bC=bA.getAllResponseHeaders();bI={};bH=bA.responseXML;if(bH&&bH.documentElement){bI.xml=bH}bI.text=bA.responseText;try{bD=bA.statusText}catch(bJ){bD=""}if(!bF&&e.isLocal&&!e.crossDomain){bF=bI.text?200:404}else{if(bF===1223){bF=204}}}}}catch(bG){if(!bE){bw(-1,bG)}}if(bI){bw(bF,bD,bI,bC)}};if(!e.async||bA.readyState===4){bv()}else{bz=++y;if(B){if(!N){N={};b(bb).unload(B)}N[bz]=bv}bA.onreadystatechange=bv}},abort:function(){if(bv){bv(0,1)}}}}})}var Q={},a8,m,aB=/^(?:toggle|show|hide)$/,aT=/^([+\-]=)?([\d+.\-]+)([a-z%]*)$/i,a3,aH=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]],a4;b.fn.extend({show:function(bx,bA,bz){var bw,by;if(bx||bx===0){return this.animate(a0("show",3),bx,bA,bz)}else{for(var bv=0,e=this.length;bv<e;bv++){bw=this[bv];if(bw.style){by=bw.style.display;if(!b._data(bw,"olddisplay")&&by==="none"){by=bw.style.display=""}if(by===""&&b.css(bw,"display")==="none"){b._data(bw,"olddisplay",x(bw.nodeName))}}}for(bv=0;bv<e;bv++){bw=this[bv];if(bw.style){by=bw.style.display;if(by===""||by==="none"){bw.style.display=b._data(bw,"olddisplay")||""}}}return this}},hide:function(bx,bA,bz){if(bx||bx===0){return this.animate(a0("hide",3),bx,bA,bz)}else{var bw,by,bv=0,e=this.length;for(;bv<e;bv++){bw=this[bv];if(bw.style){by=b.css(bw,"display");if(by!=="none"&&!b._data(bw,"olddisplay")){b._data(bw,"olddisplay",by)}}}for(bv=0;bv<e;bv++){if(this[bv].style){this[bv].style.display="none"}}return this}},_toggle:b.fn.toggle,toggle:function(bw,bv,bx){var e=typeof bw==="boolean";if(b.isFunction(bw)&&b.isFunction(bv)){this._toggle.apply(this,arguments)}else{if(bw==null||e){this.each(function(){var by=e?bw:b(this).is(":hidden");b(this)[by?"show":"hide"]()})}else{this.animate(a0("toggle",3),bw,bv,bx)}}return this},fadeTo:function(e,bx,bw,bv){return this.filter(":hidden").css("opacity",0).show().end().animate({opacity:bx},e,bw,bv)},animate:function(bz,bw,by,bx){var e=b.speed(bw,by,bx);if(b.isEmptyObject(bz)){return this.each(e.complete,[false])}bz=b.extend({},bz);function bv(){if(e.queue===false){b._mark(this)}var bE=b.extend({},e),bK=this.nodeType===1,bI=bK&&b(this).is(":hidden"),bB,bF,bD,bJ,bH,bC,bG,bL,bA;bE.animatedProperties={};for(bD in bz){bB=b.camelCase(bD);if(bD!==bB){bz[bB]=bz[bD];delete bz[bD]}bF=bz[bB];if(b.isArray(bF)){bE.animatedProperties[bB]=bF[1];bF=bz[bB]=bF[0]}else{bE.animatedProperties[bB]=bE.specialEasing&&bE.specialEasing[bB]||bE.easing||"swing"}if(bF==="hide"&&bI||bF==="show"&&!bI){return bE.complete.call(this)}if(bK&&(bB==="height"||bB==="width")){bE.overflow=[this.style.overflow,this.style.overflowX,this.style.overflowY];if(b.css(this,"display")==="inline"&&b.css(this,"float")==="none"){if(!b.support.inlineBlockNeedsLayout||x(this.nodeName)==="inline"){this.style.display="inline-block"}else{this.style.zoom=1}}}}if(bE.overflow!=null){this.style.overflow="hidden"}for(bD in bz){bJ=new b.fx(this,bE,bD);bF=bz[bD];if(aB.test(bF)){bA=b._data(this,"toggle"+bD)||(bF==="toggle"?bI?"show":"hide":0);if(bA){b._data(this,"toggle"+bD,bA==="show"?"hide":"show");bJ[bA]()}else{bJ[bF]()}}else{bH=aT.exec(bF);bC=bJ.cur();if(bH){bG=parseFloat(bH[2]);bL=bH[3]||(b.cssNumber[bD]?"":"px");if(bL!=="px"){b.style(this,bD,(bG||1)+bL);bC=((bG||1)/bJ.cur())*bC;b.style(this,bD,bC+bL)}if(bH[1]){bG=((bH[1]==="-="?-1:1)*bG)+bC}bJ.custom(bC,bG,bL)}else{bJ.custom(bC,bF,"")}}}return true}return e.queue===false?this.each(bv):this.queue(e.queue,bv)},stop:function(bw,bv,e){if(typeof bw!=="string"){e=bv;bv=bw;bw=L}if(bv&&bw!==false){this.queue(bw||"fx",[])}return this.each(function(){var bx,by=false,bA=b.timers,bz=b._data(this);if(!e){b._unmark(true,this)}function bB(bE,bF,bD){var bC=bF[bD];b.removeData(bE,bD,true);bC.stop(e)}if(bw==null){for(bx in bz){if(bz[bx]&&bz[bx].stop&&bx.indexOf(".run")===bx.length-4){bB(this,bz,bx)}}}else{if(bz[bx=bw+".run"]&&bz[bx].stop){bB(this,bz,bx)}}for(bx=bA.length;bx--;){if(bA[bx].elem===this&&(bw==null||bA[bx].queue===bw)){if(e){bA[bx](true)}else{bA[bx].saveState()}by=true;bA.splice(bx,1)}}if(!(e&&by)){b.dequeue(this,bw)}})}});function bh(){setTimeout(at,0);return(a4=b.now())}function at(){a4=L}function a0(bv,e){var bw={};b.each(aH.concat.apply([],aH.slice(0,e)),function(){bw[this]=bv});return bw}b.each({slideDown:a0("show",1),slideUp:a0("hide",1),slideToggle:a0("toggle",1),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,bv){b.fn[e]=function(bw,by,bx){return this.animate(bv,bw,by,bx)}});b.extend({speed:function(bw,bx,bv){var e=bw&&typeof bw==="object"?b.extend({},bw):{complete:bv||!bv&&bx||b.isFunction(bw)&&bw,duration:bw,easing:bv&&bx||bx&&!b.isFunction(bx)&&bx};e.duration=b.fx.off?0:typeof e.duration==="number"?e.duration:e.duration in b.fx.speeds?b.fx.speeds[e.duration]:b.fx.speeds._default;if(e.queue==null||e.queue===true){e.queue="fx"}e.old=e.complete;e.complete=function(by){if(b.isFunction(e.old)){e.old.call(this)}if(e.queue){b.dequeue(this,e.queue)}else{if(by!==false){b._unmark(this)}}};return e},easing:{linear:function(bw,bx,e,bv){return e+bv*bw},swing:function(bw,bx,e,bv){return((-Math.cos(bw*Math.PI)/2)+0.5)*bv+e}},timers:[],fx:function(bv,e,bw){this.options=e;this.elem=bv;this.prop=bw;e.orig=e.orig||{}}});b.fx.prototype={update:function(){if(this.options.step){this.options.step.call(this.elem,this.now,this)}(b.fx.step[this.prop]||b.fx.step._default)(this)},cur:function(){if(this.elem[this.prop]!=null&&(!this.elem.style||this.elem.style[this.prop]==null)){return this.elem[this.prop]}var e,bv=b.css(this.elem,this.prop);return isNaN(e=parseFloat(bv))?!bv||bv==="auto"?0:bv:e},custom:function(bz,by,bx){var e=this,bw=b.fx;this.startTime=a4||bh();this.end=by;this.now=this.start=bz;this.pos=this.state=0;this.unit=bx||this.unit||(b.cssNumber[this.prop]?"":"px");function bv(bA){return e.step(bA)}bv.queue=this.options.queue;bv.elem=this.elem;bv.saveState=function(){if(e.options.hide&&b._data(e.elem,"fxshow"+e.prop)===L){b._data(e.elem,"fxshow"+e.prop,e.start)}};if(bv()&&b.timers.push(bv)&&!a3){a3=setInterval(bw.tick,bw.interval)}},show:function(){var e=b._data(this.elem,"fxshow"+this.prop);this.options.orig[this.prop]=e||b.style(this.elem,this.prop);this.options.show=true;if(e!==L){this.custom(this.cur(),e)}else{this.custom(this.prop==="width"||this.prop==="height"?1:0,this.cur())}b(this.elem).show()},hide:function(){this.options.orig[this.prop]=b._data(this.elem,"fxshow"+this.prop)||b.style(this.elem,this.prop);this.options.hide=true;this.custom(this.cur(),0)},step:function(by){var bA,bB,bv,bx=a4||bh(),e=true,bz=this.elem,bw=this.options;if(by||bx>=bw.duration+this.startTime){this.now=this.end;this.pos=this.state=1;this.update();bw.animatedProperties[this.prop]=true;for(bA in bw.animatedProperties){if(bw.animatedProperties[bA]!==true){e=false}}if(e){if(bw.overflow!=null&&!b.support.shrinkWrapBlocks){b.each(["","X","Y"],function(bC,bD){bz.style["overflow"+bD]=bw.overflow[bC]})}if(bw.hide){b(bz).hide()}if(bw.hide||bw.show){for(bA in bw.animatedProperties){b.style(bz,bA,bw.orig[bA]);b.removeData(bz,"fxshow"+bA,true);b.removeData(bz,"toggle"+bA,true)}}bv=bw.complete;if(bv){bw.complete=false;bv.call(bz)}}return false}else{if(bw.duration==Infinity){this.now=bx}else{bB=bx-this.startTime;this.state=bB/bw.duration;this.pos=b.easing[bw.animatedProperties[this.prop]](this.state,bB,0,1,bw.duration);this.now=this.start+((this.end-this.start)*this.pos)}this.update()}return true}};b.extend(b.fx,{tick:function(){var bw,bv=b.timers,e=0;for(;e<bv.length;e++){bw=bv[e];if(!bw()&&bv[e]===bw){bv.splice(e--,1)}}if(!bv.length){b.fx.stop()}},interval:13,stop:function(){clearInterval(a3);a3=null},speeds:{slow:600,fast:200,_default:400},step:{opacity:function(e){b.style(e.elem,"opacity",e.now)},_default:function(e){if(e.elem.style&&e.elem.style[e.prop]!=null){e.elem.style[e.prop]=e.now+e.unit}else{e.elem[e.prop]=e.now}}}});b.each(["width","height"],function(e,bv){b.fx.step[bv]=function(bw){b.style(bw.elem,bv,Math.max(0,bw.now)+bw.unit)}});if(b.expr&&b.expr.filters){b.expr.filters.animated=function(e){return b.grep(b.timers,function(bv){return e===bv.elem}).length}}function x(bx){if(!Q[bx]){var e=av.body,bv=b("<"+bx+">").appendTo(e),bw=bv.css("display");bv.remove();if(bw==="none"||bw===""){if(!a8){a8=av.createElement("iframe");a8.frameBorder=a8.width=a8.height=0}e.appendChild(a8);if(!m||!a8.createElement){m=(a8.contentWindow||a8.contentDocument).document;m.write((av.compatMode==="CSS1Compat"?"<!doctype html>":"")+"<html><body>");m.close()}bv=m.createElement(bx);m.body.appendChild(bv);bw=b.css(bv,"display");e.removeChild(a8)}Q[bx]=bw}return Q[bx]}var V=/^t(?:able|d|h)$/i,ad=/^(?:body|html)$/i;if("getBoundingClientRect" in av.documentElement){b.fn.offset=function(bI){var by=this[0],bB;if(bI){return this.each(function(e){b.offset.setOffset(this,bI,e)})}if(!by||!by.ownerDocument){return null}if(by===by.ownerDocument.body){return b.offset.bodyOffset(by)}try{bB=by.getBoundingClientRect()}catch(bF){}var bH=by.ownerDocument,bw=bH.documentElement;if(!bB||!b.contains(bw,by)){return bB?{top:bB.top,left:bB.left}:{top:0,left:0}}var bC=bH.body,bD=aK(bH),bA=bw.clientTop||bC.clientTop||0,bE=bw.clientLeft||bC.clientLeft||0,bv=bD.pageYOffset||b.support.boxModel&&bw.scrollTop||bC.scrollTop,bz=bD.pageXOffset||b.support.boxModel&&bw.scrollLeft||bC.scrollLeft,bG=bB.top+bv-bA,bx=bB.left+bz-bE;return{top:bG,left:bx}}}else{b.fn.offset=function(bF){var bz=this[0];if(bF){return this.each(function(bG){b.offset.setOffset(this,bF,bG)})}if(!bz||!bz.ownerDocument){return null}if(bz===bz.ownerDocument.body){return b.offset.bodyOffset(bz)}var bC,bw=bz.offsetParent,bv=bz,bE=bz.ownerDocument,bx=bE.documentElement,bA=bE.body,bB=bE.defaultView,e=bB?bB.getComputedStyle(bz,null):bz.currentStyle,bD=bz.offsetTop,by=bz.offsetLeft;while((bz=bz.parentNode)&&bz!==bA&&bz!==bx){if(b.support.fixedPosition&&e.position==="fixed"){break}bC=bB?bB.getComputedStyle(bz,null):bz.currentStyle;bD-=bz.scrollTop;by-=bz.scrollLeft;if(bz===bw){bD+=bz.offsetTop;by+=bz.offsetLeft;if(b.support.doesNotAddBorder&&!(b.support.doesAddBorderForTableAndCells&&V.test(bz.nodeName))){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}bv=bw;bw=bz.offsetParent}if(b.support.subtractsBorderForOverflowNotVisible&&bC.overflow!=="visible"){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}e=bC}if(e.position==="relative"||e.position==="static"){bD+=bA.offsetTop;by+=bA.offsetLeft}if(b.support.fixedPosition&&e.position==="fixed"){bD+=Math.max(bx.scrollTop,bA.scrollTop);by+=Math.max(bx.scrollLeft,bA.scrollLeft)}return{top:bD,left:by}}}b.offset={bodyOffset:function(e){var bw=e.offsetTop,bv=e.offsetLeft;if(b.support.doesNotIncludeMarginInBodyOffset){bw+=parseFloat(b.css(e,"marginTop"))||0;bv+=parseFloat(b.css(e,"marginLeft"))||0}return{top:bw,left:bv}},setOffset:function(bx,bG,bA){var bB=b.css(bx,"position");if(bB==="static"){bx.style.position="relative"}var bz=b(bx),bv=bz.offset(),e=b.css(bx,"top"),bE=b.css(bx,"left"),bF=(bB==="absolute"||bB==="fixed")&&b.inArray("auto",[e,bE])>-1,bD={},bC={},bw,by;if(bF){bC=bz.position();bw=bC.top;by=bC.left}else{bw=parseFloat(e)||0;by=parseFloat(bE)||0}if(b.isFunction(bG)){bG=bG.call(bx,bA,bv)}if(bG.top!=null){bD.top=(bG.top-bv.top)+bw}if(bG.left!=null){bD.left=(bG.left-bv.left)+by}if("using" in bG){bG.using.call(bx,bD)}else{bz.css(bD)}}};b.fn.extend({position:function(){if(!this[0]){return null}var bw=this[0],bv=this.offsetParent(),bx=this.offset(),e=ad.test(bv[0].nodeName)?{top:0,left:0}:bv.offset();bx.top-=parseFloat(b.css(bw,"marginTop"))||0;bx.left-=parseFloat(b.css(bw,"marginLeft"))||0;e.top+=parseFloat(b.css(bv[0],"borderTopWidth"))||0;e.left+=parseFloat(b.css(bv[0],"borderLeftWidth"))||0;return{top:bx.top-e.top,left:bx.left-e.left}},offsetParent:function(){return this.map(function(){var e=this.offsetParent||av.body;while(e&&(!ad.test(e.nodeName)&&b.css(e,"position")==="static")){e=e.offsetParent}return e})}});b.each(["Left","Top"],function(bv,e){var bw="scroll"+e;b.fn[bw]=function(bz){var bx,by;if(bz===L){bx=this[0];if(!bx){return null}by=aK(bx);return by?("pageXOffset" in by)?by[bv?"pageYOffset":"pageXOffset"]:b.support.boxModel&&by.document.documentElement[bw]||by.document.body[bw]:bx[bw]}return this.each(function(){by=aK(this);if(by){by.scrollTo(!bv?bz:b(by).scrollLeft(),bv?bz:b(by).scrollTop())}else{this[bw]=bz}})}});function aK(e){return b.isWindow(e)?e:e.nodeType===9?e.defaultView||e.parentWindow:false}b.each(["Height","Width"],function(bv,e){var bw=e.toLowerCase();b.fn["inner"+e]=function(){var bx=this[0];return bx?bx.style?parseFloat(b.css(bx,bw,"padding")):this[bw]():null};b.fn["outer"+e]=function(by){var bx=this[0];return bx?bx.style?parseFloat(b.css(bx,bw,by?"margin":"border")):this[bw]():null};b.fn[bw]=function(bz){var bA=this[0];if(!bA){return bz==null?null:this}if(b.isFunction(bz)){return this.each(function(bE){var bD=b(this);bD[bw](bz.call(this,bE,bD[bw]()))})}if(b.isWindow(bA)){var bB=bA.document.documentElement["client"+e],bx=bA.document.body;return bA.document.compatMode==="CSS1Compat"&&bB||bx&&bx["client"+e]||bB}else{if(bA.nodeType===9){return Math.max(bA.documentElement["client"+e],bA.body["scroll"+e],bA.documentElement["scroll"+e],bA.body["offset"+e],bA.documentElement["offset"+e])}else{if(bz===L){var bC=b.css(bA,bw),by=parseFloat(bC);return b.isNumeric(by)?by:bC}else{return this.css(bw,typeof bz==="string"?bz:bz+"px")}}}}});bb.jQuery=bb.$=b;if(typeof define==="function"&&define.amd&&define.amd.jQuery){define("jquery",[],function(){return b})}})(window);/*! + * jQuery UI 1.8.18 + * + * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * http://docs.jquery.com/UI + */ +(function(a,d){a.ui=a.ui||{};if(a.ui.version){return}a.extend(a.ui,{version:"1.8.18",keyCode:{ALT:18,BACKSPACE:8,CAPS_LOCK:20,COMMA:188,COMMAND:91,COMMAND_LEFT:91,COMMAND_RIGHT:93,CONTROL:17,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,INSERT:45,LEFT:37,MENU:93,NUMPAD_ADD:107,NUMPAD_DECIMAL:110,NUMPAD_DIVIDE:111,NUMPAD_ENTER:108,NUMPAD_MULTIPLY:106,NUMPAD_SUBTRACT:109,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SHIFT:16,SPACE:32,TAB:9,UP:38,WINDOWS:91}});a.fn.extend({propAttr:a.fn.prop||a.fn.attr,_focus:a.fn.focus,focus:function(e,f){return typeof e==="number"?this.each(function(){var g=this;setTimeout(function(){a(g).focus();if(f){f.call(g)}},e)}):this._focus.apply(this,arguments)},scrollParent:function(){var e;if((a.browser.msie&&(/(static|relative)/).test(this.css("position")))||(/absolute/).test(this.css("position"))){e=this.parents().filter(function(){return(/(relative|absolute|fixed)/).test(a.curCSS(this,"position",1))&&(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}else{e=this.parents().filter(function(){return(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}return(/fixed/).test(this.css("position"))||!e.length?a(document):e},zIndex:function(h){if(h!==d){return this.css("zIndex",h)}if(this.length){var f=a(this[0]),e,g;while(f.length&&f[0]!==document){e=f.css("position");if(e==="absolute"||e==="relative"||e==="fixed"){g=parseInt(f.css("zIndex"),10);if(!isNaN(g)&&g!==0){return g}}f=f.parent()}}return 0},disableSelection:function(){return this.bind((a.support.selectstart?"selectstart":"mousedown")+".ui-disableSelection",function(e){e.preventDefault()})},enableSelection:function(){return this.unbind(".ui-disableSelection")}});a.each(["Width","Height"],function(g,e){var f=e==="Width"?["Left","Right"]:["Top","Bottom"],h=e.toLowerCase(),k={innerWidth:a.fn.innerWidth,innerHeight:a.fn.innerHeight,outerWidth:a.fn.outerWidth,outerHeight:a.fn.outerHeight};function j(m,l,i,n){a.each(f,function(){l-=parseFloat(a.curCSS(m,"padding"+this,true))||0;if(i){l-=parseFloat(a.curCSS(m,"border"+this+"Width",true))||0}if(n){l-=parseFloat(a.curCSS(m,"margin"+this,true))||0}});return l}a.fn["inner"+e]=function(i){if(i===d){return k["inner"+e].call(this)}return this.each(function(){a(this).css(h,j(this,i)+"px")})};a.fn["outer"+e]=function(i,l){if(typeof i!=="number"){return k["outer"+e].call(this,i)}return this.each(function(){a(this).css(h,j(this,i,true,l)+"px")})}});function c(g,e){var j=g.nodeName.toLowerCase();if("area"===j){var i=g.parentNode,h=i.name,f;if(!g.href||!h||i.nodeName.toLowerCase()!=="map"){return false}f=a("img[usemap=#"+h+"]")[0];return !!f&&b(f)}return(/input|select|textarea|button|object/.test(j)?!g.disabled:"a"==j?g.href||e:e)&&b(g)}function b(e){return !a(e).parents().andSelf().filter(function(){return a.curCSS(this,"visibility")==="hidden"||a.expr.filters.hidden(this)}).length}a.extend(a.expr[":"],{data:function(g,f,e){return !!a.data(g,e[3])},focusable:function(e){return c(e,!isNaN(a.attr(e,"tabindex")))},tabbable:function(g){var e=a.attr(g,"tabindex"),f=isNaN(e);return(f||e>=0)&&c(g,!f)}});a(function(){var e=document.body,f=e.appendChild(f=document.createElement("div"));f.offsetHeight;a.extend(f.style,{minHeight:"100px",height:"auto",padding:0,borderWidth:0});a.support.minHeight=f.offsetHeight===100;a.support.selectstart="onselectstart" in f;e.removeChild(f).style.display="none"});a.extend(a.ui,{plugin:{add:function(f,g,j){var h=a.ui[f].prototype;for(var e in j){h.plugins[e]=h.plugins[e]||[];h.plugins[e].push([g,j[e]])}},call:function(e,g,f){var j=e.plugins[g];if(!j||!e.element[0].parentNode){return}for(var h=0;h<j.length;h++){if(e.options[j[h][0]]){j[h][1].apply(e.element,f)}}}},contains:function(f,e){return document.compareDocumentPosition?f.compareDocumentPosition(e)&16:f!==e&&f.contains(e)},hasScroll:function(h,f){if(a(h).css("overflow")==="hidden"){return false}var e=(f&&f==="left")?"scrollLeft":"scrollTop",g=false;if(h[e]>0){return true}h[e]=1;g=(h[e]>0);h[e]=0;return g},isOverAxis:function(f,e,g){return(f>e)&&(f<(e+g))},isOver:function(j,f,i,h,e,g){return a.ui.isOverAxis(j,i,e)&&a.ui.isOverAxis(f,h,g)}})})(jQuery);/*! + * jQuery UI Widget 1.8.18 + * + * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * http://docs.jquery.com/UI/Widget + */ +(function(b,d){if(b.cleanData){var c=b.cleanData;b.cleanData=function(f){for(var g=0,h;(h=f[g])!=null;g++){try{b(h).triggerHandler("remove")}catch(j){}}c(f)}}else{var a=b.fn.remove;b.fn.remove=function(e,f){return this.each(function(){if(!f){if(!e||b.filter(e,[this]).length){b("*",this).add([this]).each(function(){try{b(this).triggerHandler("remove")}catch(g){}})}}return a.call(b(this),e,f)})}}b.widget=function(f,h,e){var g=f.split(".")[0],j;f=f.split(".")[1];j=g+"-"+f;if(!e){e=h;h=b.Widget}b.expr[":"][j]=function(k){return !!b.data(k,f)};b[g]=b[g]||{};b[g][f]=function(k,l){if(arguments.length){this._createWidget(k,l)}};var i=new h();i.options=b.extend(true,{},i.options);b[g][f].prototype=b.extend(true,i,{namespace:g,widgetName:f,widgetEventPrefix:b[g][f].prototype.widgetEventPrefix||f,widgetBaseClass:j},e);b.widget.bridge(f,b[g][f])};b.widget.bridge=function(f,e){b.fn[f]=function(i){var g=typeof i==="string",h=Array.prototype.slice.call(arguments,1),j=this;i=!g&&h.length?b.extend.apply(null,[true,i].concat(h)):i;if(g&&i.charAt(0)==="_"){return j}if(g){this.each(function(){var k=b.data(this,f),l=k&&b.isFunction(k[i])?k[i].apply(k,h):k;if(l!==k&&l!==d){j=l;return false}})}else{this.each(function(){var k=b.data(this,f);if(k){k.option(i||{})._init()}else{b.data(this,f,new e(i,this))}})}return j}};b.Widget=function(e,f){if(arguments.length){this._createWidget(e,f)}};b.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",options:{disabled:false},_createWidget:function(f,g){b.data(g,this.widgetName,this);this.element=b(g);this.options=b.extend(true,{},this.options,this._getCreateOptions(),f);var e=this;this.element.bind("remove."+this.widgetName,function(){e.destroy()});this._create();this._trigger("create");this._init()},_getCreateOptions:function(){return b.metadata&&b.metadata.get(this.element[0])[this.widgetName]},_create:function(){},_init:function(){},destroy:function(){this.element.unbind("."+this.widgetName).removeData(this.widgetName);this.widget().unbind("."+this.widgetName).removeAttr("aria-disabled").removeClass(this.widgetBaseClass+"-disabled ui-state-disabled")},widget:function(){return this.element},option:function(f,g){var e=f;if(arguments.length===0){return b.extend({},this.options)}if(typeof f==="string"){if(g===d){return this.options[f]}e={};e[f]=g}this._setOptions(e);return this},_setOptions:function(f){var e=this;b.each(f,function(g,h){e._setOption(g,h)});return this},_setOption:function(e,f){this.options[e]=f;if(e==="disabled"){this.widget()[f?"addClass":"removeClass"](this.widgetBaseClass+"-disabled ui-state-disabled").attr("aria-disabled",f)}return this},enable:function(){return this._setOption("disabled",false)},disable:function(){return this._setOption("disabled",true)},_trigger:function(e,f,g){var j,i,h=this.options[e];g=g||{};f=b.Event(f);f.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase();f.target=this.element[0];i=f.originalEvent;if(i){for(j in i){if(!(j in f)){f[j]=i[j]}}}this.element.trigger(f,g);return !(b.isFunction(h)&&h.call(this.element[0],f,g)===false||f.isDefaultPrevented())}}})(jQuery);/*! + * jQuery UI Mouse 1.8.18 + * + * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * http://docs.jquery.com/UI/Mouse + * + * Depends: + * jquery.ui.widget.js + */ +(function(b,c){var a=false;b(document).mouseup(function(d){a=false});b.widget("ui.mouse",{options:{cancel:":input,option",distance:1,delay:0},_mouseInit:function(){var d=this;this.element.bind("mousedown."+this.widgetName,function(e){return d._mouseDown(e)}).bind("click."+this.widgetName,function(e){if(true===b.data(e.target,d.widgetName+".preventClickEvent")){b.removeData(e.target,d.widgetName+".preventClickEvent");e.stopImmediatePropagation();return false}});this.started=false},_mouseDestroy:function(){this.element.unbind("."+this.widgetName)},_mouseDown:function(f){if(a){return}(this._mouseStarted&&this._mouseUp(f));this._mouseDownEvent=f;var e=this,g=(f.which==1),d=(typeof this.options.cancel=="string"&&f.target.nodeName?b(f.target).closest(this.options.cancel).length:false);if(!g||d||!this._mouseCapture(f)){return true}this.mouseDelayMet=!this.options.delay;if(!this.mouseDelayMet){this._mouseDelayTimer=setTimeout(function(){e.mouseDelayMet=true},this.options.delay)}if(this._mouseDistanceMet(f)&&this._mouseDelayMet(f)){this._mouseStarted=(this._mouseStart(f)!==false);if(!this._mouseStarted){f.preventDefault();return true}}if(true===b.data(f.target,this.widgetName+".preventClickEvent")){b.removeData(f.target,this.widgetName+".preventClickEvent")}this._mouseMoveDelegate=function(h){return e._mouseMove(h)};this._mouseUpDelegate=function(h){return e._mouseUp(h)};b(document).bind("mousemove."+this.widgetName,this._mouseMoveDelegate).bind("mouseup."+this.widgetName,this._mouseUpDelegate);f.preventDefault();a=true;return true},_mouseMove:function(d){if(b.browser.msie&&!(document.documentMode>=9)&&!d.button){return this._mouseUp(d)}if(this._mouseStarted){this._mouseDrag(d);return d.preventDefault()}if(this._mouseDistanceMet(d)&&this._mouseDelayMet(d)){this._mouseStarted=(this._mouseStart(this._mouseDownEvent,d)!==false);(this._mouseStarted?this._mouseDrag(d):this._mouseUp(d))}return !this._mouseStarted},_mouseUp:function(d){b(document).unbind("mousemove."+this.widgetName,this._mouseMoveDelegate).unbind("mouseup."+this.widgetName,this._mouseUpDelegate);if(this._mouseStarted){this._mouseStarted=false;if(d.target==this._mouseDownEvent.target){b.data(d.target,this.widgetName+".preventClickEvent",true)}this._mouseStop(d)}return false},_mouseDistanceMet:function(d){return(Math.max(Math.abs(this._mouseDownEvent.pageX-d.pageX),Math.abs(this._mouseDownEvent.pageY-d.pageY))>=this.options.distance)},_mouseDelayMet:function(d){return this.mouseDelayMet},_mouseStart:function(d){},_mouseDrag:function(d){},_mouseStop:function(d){},_mouseCapture:function(d){return true}})})(jQuery);(function(c,d){c.widget("ui.resizable",c.ui.mouse,{widgetEventPrefix:"resize",options:{alsoResize:false,animate:false,animateDuration:"slow",animateEasing:"swing",aspectRatio:false,autoHide:false,containment:false,ghost:false,grid:false,handles:"e,s,se",helper:false,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:1000},_create:function(){var f=this,k=this.options;this.element.addClass("ui-resizable");c.extend(this,{_aspectRatio:!!(k.aspectRatio),aspectRatio:k.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:k.helper||k.ghost||k.animate?k.helper||"ui-resizable-helper":null});if(this.element[0].nodeName.match(/canvas|textarea|input|select|button|img/i)){this.element.wrap(c('<div class="ui-wrapper" style="overflow: hidden;"></div>').css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")}));this.element=this.element.parent().data("resizable",this.element.data("resizable"));this.elementIsWrapper=true;this.element.css({marginLeft:this.originalElement.css("marginLeft"),marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom")});this.originalElement.css({marginLeft:0,marginTop:0,marginRight:0,marginBottom:0});this.originalResizeStyle=this.originalElement.css("resize");this.originalElement.css("resize","none");this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"}));this.originalElement.css({margin:this.originalElement.css("margin")});this._proportionallyResize()}this.handles=k.handles||(!c(".ui-resizable-handle",this.element).length?"e,s,se":{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"});if(this.handles.constructor==String){if(this.handles=="all"){this.handles="n,e,s,w,se,sw,ne,nw"}var l=this.handles.split(",");this.handles={};for(var g=0;g<l.length;g++){var j=c.trim(l[g]),e="ui-resizable-"+j;var h=c('<div class="ui-resizable-handle '+e+'"></div>');if(/sw|se|ne|nw/.test(j)){h.css({zIndex:++k.zIndex})}if("se"==j){h.addClass("ui-icon ui-icon-gripsmall-diagonal-se")}this.handles[j]=".ui-resizable-"+j;this.element.append(h)}}this._renderAxis=function(q){q=q||this.element;for(var n in this.handles){if(this.handles[n].constructor==String){this.handles[n]=c(this.handles[n],this.element).show()}if(this.elementIsWrapper&&this.originalElement[0].nodeName.match(/textarea|input|select|button/i)){var o=c(this.handles[n],this.element),p=0;p=/sw|ne|nw|se|n|s/.test(n)?o.outerHeight():o.outerWidth();var m=["padding",/ne|nw|n/.test(n)?"Top":/se|sw|s/.test(n)?"Bottom":/^e$/.test(n)?"Right":"Left"].join("");q.css(m,p);this._proportionallyResize()}if(!c(this.handles[n]).length){continue}}};this._renderAxis(this.element);this._handles=c(".ui-resizable-handle",this.element).disableSelection();this._handles.mouseover(function(){if(!f.resizing){if(this.className){var i=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)}f.axis=i&&i[1]?i[1]:"se"}});if(k.autoHide){this._handles.hide();c(this.element).addClass("ui-resizable-autohide").hover(function(){if(k.disabled){return}c(this).removeClass("ui-resizable-autohide");f._handles.show()},function(){if(k.disabled){return}if(!f.resizing){c(this).addClass("ui-resizable-autohide");f._handles.hide()}})}this._mouseInit()},destroy:function(){this._mouseDestroy();var e=function(g){c(g).removeClass("ui-resizable ui-resizable-disabled ui-resizable-resizing").removeData("resizable").unbind(".resizable").find(".ui-resizable-handle").remove()};if(this.elementIsWrapper){e(this.element);var f=this.element;f.after(this.originalElement.css({position:f.css("position"),width:f.outerWidth(),height:f.outerHeight(),top:f.css("top"),left:f.css("left")})).remove()}this.originalElement.css("resize",this.originalResizeStyle);e(this.originalElement);return this},_mouseCapture:function(f){var g=false;for(var e in this.handles){if(c(this.handles[e])[0]==f.target){g=true}}return !this.options.disabled&&g},_mouseStart:function(g){var j=this.options,f=this.element.position(),e=this.element;this.resizing=true;this.documentScroll={top:c(document).scrollTop(),left:c(document).scrollLeft()};if(e.is(".ui-draggable")||(/absolute/).test(e.css("position"))){e.css({position:"absolute",top:f.top,left:f.left})}this._renderProxy();var k=b(this.helper.css("left")),h=b(this.helper.css("top"));if(j.containment){k+=c(j.containment).scrollLeft()||0;h+=c(j.containment).scrollTop()||0}this.offset=this.helper.offset();this.position={left:k,top:h};this.size=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalSize=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalPosition={left:k,top:h};this.sizeDiff={width:e.outerWidth()-e.width(),height:e.outerHeight()-e.height()};this.originalMousePosition={left:g.pageX,top:g.pageY};this.aspectRatio=(typeof j.aspectRatio=="number")?j.aspectRatio:((this.originalSize.width/this.originalSize.height)||1);var i=c(".ui-resizable-"+this.axis).css("cursor");c("body").css("cursor",i=="auto"?this.axis+"-resize":i);e.addClass("ui-resizable-resizing");this._propagate("start",g);return true},_mouseDrag:function(e){var h=this.helper,g=this.options,m={},q=this,j=this.originalMousePosition,n=this.axis;var r=(e.pageX-j.left)||0,p=(e.pageY-j.top)||0;var i=this._change[n];if(!i){return false}var l=i.apply(this,[e,r,p]),k=c.browser.msie&&c.browser.version<7,f=this.sizeDiff;this._updateVirtualBoundaries(e.shiftKey);if(this._aspectRatio||e.shiftKey){l=this._updateRatio(l,e)}l=this._respectSize(l,e);this._propagate("resize",e);h.css({top:this.position.top+"px",left:this.position.left+"px",width:this.size.width+"px",height:this.size.height+"px"});if(!this._helper&&this._proportionallyResizeElements.length){this._proportionallyResize()}this._updateCache(l);this._trigger("resize",e,this.ui());return false},_mouseStop:function(h){this.resizing=false;var i=this.options,m=this;if(this._helper){var g=this._proportionallyResizeElements,e=g.length&&(/textarea/i).test(g[0].nodeName),f=e&&c.ui.hasScroll(g[0],"left")?0:m.sizeDiff.height,k=e?0:m.sizeDiff.width;var n={width:(m.helper.width()-k),height:(m.helper.height()-f)},j=(parseInt(m.element.css("left"),10)+(m.position.left-m.originalPosition.left))||null,l=(parseInt(m.element.css("top"),10)+(m.position.top-m.originalPosition.top))||null;if(!i.animate){this.element.css(c.extend(n,{top:l,left:j}))}m.helper.height(m.size.height);m.helper.width(m.size.width);if(this._helper&&!i.animate){this._proportionallyResize()}}c("body").css("cursor","auto");this.element.removeClass("ui-resizable-resizing");this._propagate("stop",h);if(this._helper){this.helper.remove()}return false},_updateVirtualBoundaries:function(g){var j=this.options,i,h,f,k,e;e={minWidth:a(j.minWidth)?j.minWidth:0,maxWidth:a(j.maxWidth)?j.maxWidth:Infinity,minHeight:a(j.minHeight)?j.minHeight:0,maxHeight:a(j.maxHeight)?j.maxHeight:Infinity};if(this._aspectRatio||g){i=e.minHeight*this.aspectRatio;f=e.minWidth/this.aspectRatio;h=e.maxHeight*this.aspectRatio;k=e.maxWidth/this.aspectRatio;if(i>e.minWidth){e.minWidth=i}if(f>e.minHeight){e.minHeight=f}if(h<e.maxWidth){e.maxWidth=h}if(k<e.maxHeight){e.maxHeight=k}}this._vBoundaries=e},_updateCache:function(e){var f=this.options;this.offset=this.helper.offset();if(a(e.left)){this.position.left=e.left}if(a(e.top)){this.position.top=e.top}if(a(e.height)){this.size.height=e.height}if(a(e.width)){this.size.width=e.width}},_updateRatio:function(h,g){var i=this.options,j=this.position,f=this.size,e=this.axis;if(a(h.height)){h.width=(h.height*this.aspectRatio)}else{if(a(h.width)){h.height=(h.width/this.aspectRatio)}}if(e=="sw"){h.left=j.left+(f.width-h.width);h.top=null}if(e=="nw"){h.top=j.top+(f.height-h.height);h.left=j.left+(f.width-h.width)}return h},_respectSize:function(l,g){var j=this.helper,i=this._vBoundaries,r=this._aspectRatio||g.shiftKey,q=this.axis,t=a(l.width)&&i.maxWidth&&(i.maxWidth<l.width),m=a(l.height)&&i.maxHeight&&(i.maxHeight<l.height),h=a(l.width)&&i.minWidth&&(i.minWidth>l.width),s=a(l.height)&&i.minHeight&&(i.minHeight>l.height);if(h){l.width=i.minWidth}if(s){l.height=i.minHeight}if(t){l.width=i.maxWidth}if(m){l.height=i.maxHeight}var f=this.originalPosition.left+this.originalSize.width,p=this.position.top+this.size.height;var k=/sw|nw|w/.test(q),e=/nw|ne|n/.test(q);if(h&&k){l.left=f-i.minWidth}if(t&&k){l.left=f-i.maxWidth}if(s&&e){l.top=p-i.minHeight}if(m&&e){l.top=p-i.maxHeight}var n=!l.width&&!l.height;if(n&&!l.left&&l.top){l.top=null}else{if(n&&!l.top&&l.left){l.left=null}}return l},_proportionallyResize:function(){var k=this.options;if(!this._proportionallyResizeElements.length){return}var g=this.helper||this.element;for(var f=0;f<this._proportionallyResizeElements.length;f++){var h=this._proportionallyResizeElements[f];if(!this.borderDif){var e=[h.css("borderTopWidth"),h.css("borderRightWidth"),h.css("borderBottomWidth"),h.css("borderLeftWidth")],j=[h.css("paddingTop"),h.css("paddingRight"),h.css("paddingBottom"),h.css("paddingLeft")];this.borderDif=c.map(e,function(l,n){var m=parseInt(l,10)||0,o=parseInt(j[n],10)||0;return m+o})}if(c.browser.msie&&!(!(c(g).is(":hidden")||c(g).parents(":hidden").length))){continue}h.css({height:(g.height()-this.borderDif[0]-this.borderDif[2])||0,width:(g.width()-this.borderDif[1]-this.borderDif[3])||0})}},_renderProxy:function(){var f=this.element,i=this.options;this.elementOffset=f.offset();if(this._helper){this.helper=this.helper||c('<div style="overflow:hidden;"></div>');var e=c.browser.msie&&c.browser.version<7,g=(e?1:0),h=(e?2:-1);this.helper.addClass(this._helper).css({width:this.element.outerWidth()+h,height:this.element.outerHeight()+h,position:"absolute",left:this.elementOffset.left-g+"px",top:this.elementOffset.top-g+"px",zIndex:++i.zIndex});this.helper.appendTo("body").disableSelection()}else{this.helper=this.element}},_change:{e:function(g,f,e){return{width:this.originalSize.width+f}},w:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{left:i.left+f,width:g.width-f}},n:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{top:i.top+e,height:g.height-e}},s:function(g,f,e){return{height:this.originalSize.height+e}},se:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},sw:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[g,f,e]))},ne:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},nw:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[g,f,e]))}},_propagate:function(f,e){c.ui.plugin.call(this,f,[e,this.ui()]);(f!="resize"&&this._trigger(f,e,this.ui()))},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}});c.extend(c.ui.resizable,{version:"1.8.18"});c.ui.plugin.add("resizable","alsoResize",{start:function(f,g){var e=c(this).data("resizable"),i=e.options;var h=function(j){c(j).each(function(){var k=c(this);k.data("resizable-alsoresize",{width:parseInt(k.width(),10),height:parseInt(k.height(),10),left:parseInt(k.css("left"),10),top:parseInt(k.css("top"),10)})})};if(typeof(i.alsoResize)=="object"&&!i.alsoResize.parentNode){if(i.alsoResize.length){i.alsoResize=i.alsoResize[0];h(i.alsoResize)}else{c.each(i.alsoResize,function(j){h(j)})}}else{h(i.alsoResize)}},resize:function(g,i){var f=c(this).data("resizable"),j=f.options,h=f.originalSize,l=f.originalPosition;var k={height:(f.size.height-h.height)||0,width:(f.size.width-h.width)||0,top:(f.position.top-l.top)||0,left:(f.position.left-l.left)||0},e=function(m,n){c(m).each(function(){var q=c(this),r=c(this).data("resizable-alsoresize"),p={},o=n&&n.length?n:q.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];c.each(o,function(s,u){var t=(r[u]||0)+(k[u]||0);if(t&&t>=0){p[u]=t||null}});q.css(p)})};if(typeof(j.alsoResize)=="object"&&!j.alsoResize.nodeType){c.each(j.alsoResize,function(m,n){e(m,n)})}else{e(j.alsoResize)}},stop:function(e,f){c(this).removeData("resizable-alsoresize")}});c.ui.plugin.add("resizable","animate",{stop:function(i,n){var p=c(this).data("resizable"),j=p.options;var h=p._proportionallyResizeElements,e=h.length&&(/textarea/i).test(h[0].nodeName),f=e&&c.ui.hasScroll(h[0],"left")?0:p.sizeDiff.height,l=e?0:p.sizeDiff.width;var g={width:(p.size.width-l),height:(p.size.height-f)},k=(parseInt(p.element.css("left"),10)+(p.position.left-p.originalPosition.left))||null,m=(parseInt(p.element.css("top"),10)+(p.position.top-p.originalPosition.top))||null;p.element.animate(c.extend(g,m&&k?{top:m,left:k}:{}),{duration:j.animateDuration,easing:j.animateEasing,step:function(){var o={width:parseInt(p.element.css("width"),10),height:parseInt(p.element.css("height"),10),top:parseInt(p.element.css("top"),10),left:parseInt(p.element.css("left"),10)};if(h&&h.length){c(h[0]).css({width:o.width,height:o.height})}p._updateCache(o);p._propagate("resize",i)}})}});c.ui.plugin.add("resizable","containment",{start:function(f,r){var t=c(this).data("resizable"),j=t.options,l=t.element;var g=j.containment,k=(g instanceof c)?g.get(0):(/parent/.test(g))?l.parent().get(0):g;if(!k){return}t.containerElement=c(k);if(/document/.test(g)||g==document){t.containerOffset={left:0,top:0};t.containerPosition={left:0,top:0};t.parentData={element:c(document),left:0,top:0,width:c(document).width(),height:c(document).height()||document.body.parentNode.scrollHeight}}else{var n=c(k),i=[];c(["Top","Right","Left","Bottom"]).each(function(p,o){i[p]=b(n.css("padding"+o))});t.containerOffset=n.offset();t.containerPosition=n.position();t.containerSize={height:(n.innerHeight()-i[3]),width:(n.innerWidth()-i[1])};var q=t.containerOffset,e=t.containerSize.height,m=t.containerSize.width,h=(c.ui.hasScroll(k,"left")?k.scrollWidth:m),s=(c.ui.hasScroll(k)?k.scrollHeight:e);t.parentData={element:k,left:q.left,top:q.top,width:h,height:s}}},resize:function(g,q){var t=c(this).data("resizable"),i=t.options,f=t.containerSize,p=t.containerOffset,m=t.size,n=t.position,r=t._aspectRatio||g.shiftKey,e={top:0,left:0},h=t.containerElement;if(h[0]!=document&&(/static/).test(h.css("position"))){e=p}if(n.left<(t._helper?p.left:0)){t.size.width=t.size.width+(t._helper?(t.position.left-p.left):(t.position.left-e.left));if(r){t.size.height=t.size.width/i.aspectRatio}t.position.left=i.helper?p.left:0}if(n.top<(t._helper?p.top:0)){t.size.height=t.size.height+(t._helper?(t.position.top-p.top):t.position.top);if(r){t.size.width=t.size.height*i.aspectRatio}t.position.top=t._helper?p.top:0}t.offset.left=t.parentData.left+t.position.left;t.offset.top=t.parentData.top+t.position.top;var l=Math.abs((t._helper?t.offset.left-e.left:(t.offset.left-e.left))+t.sizeDiff.width),s=Math.abs((t._helper?t.offset.top-e.top:(t.offset.top-p.top))+t.sizeDiff.height);var k=t.containerElement.get(0)==t.element.parent().get(0),j=/relative|absolute/.test(t.containerElement.css("position"));if(k&&j){l-=t.parentData.left}if(l+t.size.width>=t.parentData.width){t.size.width=t.parentData.width-l;if(r){t.size.height=t.size.width/t.aspectRatio}}if(s+t.size.height>=t.parentData.height){t.size.height=t.parentData.height-s;if(r){t.size.width=t.size.height*t.aspectRatio}}},stop:function(f,n){var q=c(this).data("resizable"),g=q.options,l=q.position,m=q.containerOffset,e=q.containerPosition,i=q.containerElement;var j=c(q.helper),r=j.offset(),p=j.outerWidth()-q.sizeDiff.width,k=j.outerHeight()-q.sizeDiff.height;if(q._helper&&!g.animate&&(/relative/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}if(q._helper&&!g.animate&&(/static/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}}});c.ui.plugin.add("resizable","ghost",{start:function(g,h){var e=c(this).data("resizable"),i=e.options,f=e.size;e.ghost=e.originalElement.clone();e.ghost.css({opacity:0.25,display:"block",position:"relative",height:f.height,width:f.width,margin:0,left:0,top:0}).addClass("ui-resizable-ghost").addClass(typeof i.ghost=="string"?i.ghost:"");e.ghost.appendTo(e.helper)},resize:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost){e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})}},stop:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost&&e.helper){e.helper.get(0).removeChild(e.ghost.get(0))}}});c.ui.plugin.add("resizable","grid",{resize:function(e,m){var p=c(this).data("resizable"),h=p.options,k=p.size,i=p.originalSize,j=p.originalPosition,n=p.axis,l=h._aspectRatio||e.shiftKey;h.grid=typeof h.grid=="number"?[h.grid,h.grid]:h.grid;var g=Math.round((k.width-i.width)/(h.grid[0]||1))*(h.grid[0]||1),f=Math.round((k.height-i.height)/(h.grid[1]||1))*(h.grid[1]||1);if(/^(se|s|e)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f}else{if(/^(ne)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f}else{if(/^(sw)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.left=j.left-g}else{p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f;p.position.left=j.left-g}}}}});var b=function(e){return parseInt(e,10)||0};var a=function(e){return !isNaN(parseInt(e,10))}})(jQuery);/*! + * jQuery hashchange event - v1.3 - 7/21/2010 + * http://benalman.com/projects/jquery-hashchange-plugin/ + * + * Copyright (c) 2010 "Cowboy" Ben Alman + * Dual licensed under the MIT and GPL licenses. + * http://benalman.com/about/license/ + */ +(function($,e,b){var c="hashchange",h=document,f,g=$.event.special,i=h.documentMode,d="on"+c in e&&(i===b||i>7);function a(j){j=j||location.href;return"#"+j.replace(/^[^#]*#?(.*)$/,"$1")}$.fn[c]=function(j){return j?this.bind(c,j):this.trigger(c)};$.fn[c].delay=50;g[c]=$.extend(g[c],{setup:function(){if(d){return false}$(f.start)},teardown:function(){if(d){return false}$(f.stop)}});f=(function(){var j={},p,m=a(),k=function(q){return q},l=k,o=k;j.start=function(){p||n()};j.stop=function(){p&&clearTimeout(p);p=b};function n(){var r=a(),q=o(m);if(r!==m){l(m=r,q);$(e).trigger(c)}else{if(q!==m){location.href=location.href.replace(/#.*/,"")+q}}p=setTimeout(n,$.fn[c].delay)}$.browser.msie&&!d&&(function(){var q,r;j.start=function(){if(!q){r=$.fn[c].src;r=r&&r+a();q=$('<iframe tabindex="-1" title="empty"/>').hide().one("load",function(){r||l(a());n()}).attr("src",r||"javascript:0").insertAfter("body")[0].contentWindow;h.onpropertychange=function(){try{if(event.propertyName==="title"){q.document.title=h.title}}catch(s){}}}};j.stop=k;o=function(){return a(q.location.href)};l=function(v,s){var u=q.document,t=$.fn[c].domain;if(v!==s){u.title=h.title;u.open();t&&u.write('<script>document.domain="'+t+'"<\/script>');u.close();q.location.hash=v}}})();return j})()})(jQuery,this);(function(c){var a=c.scrollTo=function(f,e,d){c(window).scrollTo(f,e,d)};a.defaults={axis:"xy",duration:parseFloat(c.fn.jquery)>=1.3?0:1};a.window=function(d){return c(window)._scrollable()};c.fn._scrollable=function(){return this.map(function(){var e=this,d=!e.nodeName||c.inArray(e.nodeName.toLowerCase(),["iframe","#document","html","body"])!=-1;if(!d){return e}var f=(e.contentWindow||e).document||e.ownerDocument||e;return c.browser.safari||f.compatMode=="BackCompat"?f.body:f.documentElement})};c.fn.scrollTo=function(f,e,d){if(typeof e=="object"){d=e;e=0}if(typeof d=="function"){d={onAfter:d}}if(f=="max"){f=9000000000}d=c.extend({},a.defaults,d);e=e||d.speed||d.duration;d.queue=d.queue&&d.axis.length>1;if(d.queue){e/=2}d.offset=b(d.offset);d.over=b(d.over);return this._scrollable().each(function(){var l=this,j=c(l),k=f,i,g={},m=j.is("html,body");switch(typeof k){case"number":case"string":if(/^([+-]=)?\d+(\.\d+)?(px|%)?$/.test(k)){k=b(k);break}k=c(k,this);case"object":if(k.is||k.style){i=(k=c(k)).offset()}}c.each(d.axis.split(""),function(q,r){var s=r=="x"?"Left":"Top",u=s.toLowerCase(),p="scroll"+s,o=l[p],n=a.max(l,r);if(i){g[p]=i[u]+(m?0:o-j.offset()[u]);if(d.margin){g[p]-=parseInt(k.css("margin"+s))||0;g[p]-=parseInt(k.css("border"+s+"Width"))||0}g[p]+=d.offset[u]||0;if(d.over[u]){g[p]+=k[r=="x"?"width":"height"]()*d.over[u]}}else{var t=k[u];g[p]=t.slice&&t.slice(-1)=="%"?parseFloat(t)/100*n:t}if(/^\d+$/.test(g[p])){g[p]=g[p]<=0?0:Math.min(g[p],n)}if(!q&&d.queue){if(o!=g[p]){h(d.onAfterFirst)}delete g[p]}});h(d.onAfter);function h(n){j.animate(g,e,d.easing,n&&function(){n.call(this,f,d)})}}).end()};a.max=function(j,i){var h=i=="x"?"Width":"Height",e="scroll"+h;if(!c(j).is("html,body")){return j[e]-c(j)[h.toLowerCase()]()}var g="client"+h,f=j.ownerDocument.documentElement,d=j.ownerDocument.body;return Math.max(f[e],d[e])-Math.min(f[g],d[g])};function b(d){return typeof d=="object"?d:{top:d,left:d}}})(jQuery);/*! + PowerTip - v1.2.0 - 2013-04-03 + http://stevenbenner.github.com/jquery-powertip/ + Copyright (c) 2013 Steven Benner (http://stevenbenner.com/). + Released under MIT license. + https://raw.github.com/stevenbenner/jquery-powertip/master/LICENSE.txt +*/ +(function(a){if(typeof define==="function"&&define.amd){define(["jquery"],a)}else{a(jQuery)}}(function(k){var A=k(document),s=k(window),w=k("body");var n="displayController",e="hasActiveHover",d="forcedOpen",u="hasMouseMove",f="mouseOnToPopup",g="originalTitle",y="powertip",o="powertipjq",l="powertiptarget",E=180/Math.PI;var c={isTipOpen:false,isFixedTipOpen:false,isClosing:false,tipOpenImminent:false,activeHover:null,currentX:0,currentY:0,previousX:0,previousY:0,desyncTimeout:null,mouseTrackingActive:false,delayInProgress:false,windowWidth:0,windowHeight:0,scrollTop:0,scrollLeft:0};var p={none:0,top:1,bottom:2,left:4,right:8};k.fn.powerTip=function(F,N){if(!this.length){return this}if(k.type(F)==="string"&&k.powerTip[F]){return k.powerTip[F].call(this,this,N)}var O=k.extend({},k.fn.powerTip.defaults,F),G=new x(O);h();this.each(function M(){var R=k(this),Q=R.data(y),P=R.data(o),T=R.data(l),S;if(R.data(n)){k.powerTip.destroy(R)}S=R.attr("title");if(!Q&&!T&&!P&&S){R.data(y,S);R.data(g,S);R.removeAttr("title")}R.data(n,new t(R,O,G))});if(!O.manual){this.on({"mouseenter.powertip":function J(P){k.powerTip.show(this,P)},"mouseleave.powertip":function L(){k.powerTip.hide(this)},"focus.powertip":function K(){k.powerTip.show(this)},"blur.powertip":function H(){k.powerTip.hide(this,true)},"keydown.powertip":function I(P){if(P.keyCode===27){k.powerTip.hide(this,true)}}})}return this};k.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false};k.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};k.powerTip={show:function z(F,G){if(G){i(G);c.previousX=G.pageX;c.previousY=G.pageY;k(F).data(n).show()}else{k(F).first().data(n).show(true,true)}return F},reposition:function r(F){k(F).first().data(n).resetPosition();return F},hide:function D(G,F){if(G){k(G).first().data(n).hide(F)}else{if(c.activeHover){c.activeHover.data(n).hide(true)}}return G},destroy:function C(G){k(G).off(".powertip").each(function F(){var I=k(this),H=[g,n,e,d];if(I.data(g)){I.attr("title",I.data(g));H.push(y)}I.removeData(H)});return G}};k.powerTip.showTip=k.powerTip.show;k.powerTip.closeTip=k.powerTip.hide;function b(){var F=this;F.top="auto";F.left="auto";F.right="auto";F.bottom="auto";F.set=function(H,G){if(k.isNumeric(G)){F[H]=Math.round(G)}}}function t(K,N,F){var J=null;function L(P,Q){M();if(!K.data(e)){if(!P){c.tipOpenImminent=true;J=setTimeout(function O(){J=null;I()},N.intentPollInterval)}else{if(Q){K.data(d,true)}F.showTip(K)}}}function G(P){M();c.tipOpenImminent=false;if(K.data(e)){K.data(d,false);if(!P){c.delayInProgress=true;J=setTimeout(function O(){J=null;F.hideTip(K);c.delayInProgress=false},N.closeDelay)}else{F.hideTip(K)}}}function I(){var Q=Math.abs(c.previousX-c.currentX),O=Math.abs(c.previousY-c.currentY),P=Q+O;if(P<N.intentSensitivity){F.showTip(K)}else{c.previousX=c.currentX;c.previousY=c.currentY;L()}}function M(){J=clearTimeout(J);c.delayInProgress=false}function H(){F.resetPosition(K)}this.show=L;this.hide=G;this.cancel=M;this.resetPosition=H}function j(){function G(M,L,J,O,P){var K=L.split("-")[0],N=new b(),I;if(q(M)){I=H(M,K)}else{I=F(M,K)}switch(L){case"n":N.set("left",I.left-(J/2));N.set("bottom",c.windowHeight-I.top+P);break;case"e":N.set("left",I.left+P);N.set("top",I.top-(O/2));break;case"s":N.set("left",I.left-(J/2));N.set("top",I.top+P);break;case"w":N.set("top",I.top-(O/2));N.set("right",c.windowWidth-I.left+P);break;case"nw":N.set("bottom",c.windowHeight-I.top+P);N.set("right",c.windowWidth-I.left-20);break;case"nw-alt":N.set("left",I.left);N.set("bottom",c.windowHeight-I.top+P);break;case"ne":N.set("left",I.left-20);N.set("bottom",c.windowHeight-I.top+P);break;case"ne-alt":N.set("bottom",c.windowHeight-I.top+P);N.set("right",c.windowWidth-I.left);break;case"sw":N.set("top",I.top+P);N.set("right",c.windowWidth-I.left-20);break;case"sw-alt":N.set("left",I.left);N.set("top",I.top+P);break;case"se":N.set("left",I.left-20);N.set("top",I.top+P);break;case"se-alt":N.set("top",I.top+P);N.set("right",c.windowWidth-I.left);break}return N}function F(K,J){var O=K.offset(),N=K.outerWidth(),I=K.outerHeight(),M,L;switch(J){case"n":M=O.left+N/2;L=O.top;break;case"e":M=O.left+N;L=O.top+I/2;break;case"s":M=O.left+N/2;L=O.top+I;break;case"w":M=O.left;L=O.top+I/2;break;case"nw":M=O.left;L=O.top;break;case"ne":M=O.left+N;L=O.top;break;case"sw":M=O.left;L=O.top+I;break;case"se":M=O.left+N;L=O.top+I;break}return{top:L,left:M}}function H(O,K){var S=O.closest("svg")[0],N=O[0],W=S.createSVGPoint(),L=N.getBBox(),V=N.getScreenCTM(),M=L.width/2,Q=L.height/2,P=[],I=["nw","n","ne","e","se","s","sw","w"],U,X,R,T;function J(){P.push(W.matrixTransform(V))}W.x=L.x;W.y=L.y;J();W.x+=M;J();W.x+=M;J();W.y+=Q;J();W.y+=Q;J();W.x-=M;J();W.x-=M;J();W.y-=Q;J();if(P[0].y!==P[1].y||P[0].x!==P[7].x){X=Math.atan2(V.b,V.a)*E;R=Math.ceil(((X%360)-22.5)/45);if(R<1){R+=8}while(R--){I.push(I.shift())}}for(T=0;T<P.length;T++){if(I[T]===K){U=P[T];break}}return{top:U.y+c.scrollTop,left:U.x+c.scrollLeft}}this.compute=G}function x(Q){var P=new j(),O=k("#"+Q.popupId);if(O.length===0){O=k("<div/>",{id:Q.popupId});if(w.length===0){w=k("body")}w.append(O)}if(Q.followMouse){if(!O.data(u)){A.on("mousemove",M);s.on("scroll",M);O.data(u,true)}}if(Q.mouseOnToPopup){O.on({mouseenter:function L(){if(O.data(f)){if(c.activeHover){c.activeHover.data(n).cancel()}}},mouseleave:function N(){if(c.activeHover){c.activeHover.data(n).hide()}}})}function I(S){S.data(e,true);O.queue(function R(T){H(S);T()})}function H(S){var U;if(!S.data(e)){return}if(c.isTipOpen){if(!c.isClosing){K(c.activeHover)}O.delay(100).queue(function R(V){H(S);V()});return}S.trigger("powerTipPreRender");U=B(S);if(U){O.empty().append(U)}else{return}S.trigger("powerTipRender");c.activeHover=S;c.isTipOpen=true;O.data(f,Q.mouseOnToPopup);if(!Q.followMouse){G(S);c.isFixedTipOpen=true}else{M()}O.fadeIn(Q.fadeInTime,function T(){if(!c.desyncTimeout){c.desyncTimeout=setInterval(J,500)}S.trigger("powerTipOpen")})}function K(R){c.isClosing=true;c.activeHover=null;c.isTipOpen=false;c.desyncTimeout=clearInterval(c.desyncTimeout);R.data(e,false);R.data(d,false);O.fadeOut(Q.fadeOutTime,function S(){var T=new b();c.isClosing=false;c.isFixedTipOpen=false;O.removeClass();T.set("top",c.currentY+Q.offset);T.set("left",c.currentX+Q.offset);O.css(T);R.trigger("powerTipClose")})}function M(){if(!c.isFixedTipOpen&&(c.isTipOpen||(c.tipOpenImminent&&O.data(u)))){var R=O.outerWidth(),V=O.outerHeight(),U=new b(),S,T;U.set("top",c.currentY+Q.offset);U.set("left",c.currentX+Q.offset);S=m(U,R,V);if(S!==p.none){T=a(S);if(T===1){if(S===p.right){U.set("left",c.windowWidth-R)}else{if(S===p.bottom){U.set("top",c.scrollTop+c.windowHeight-V)}}}else{U.set("left",c.currentX-R-Q.offset);U.set("top",c.currentY-V-Q.offset)}}O.css(U)}}function G(S){var R,T;if(Q.smartPlacement){R=k.fn.powerTip.smartPlacementLists[Q.placement];k.each(R,function(U,W){var V=m(F(S,W),O.outerWidth(),O.outerHeight());T=W;if(V===p.none){return false}})}else{F(S,Q.placement);T=Q.placement}O.addClass(T)}function F(U,T){var R=0,S,W,V=new b();V.set("top",0);V.set("left",0);O.css(V);do{S=O.outerWidth();W=O.outerHeight();V=P.compute(U,T,S,W,Q.offset);O.css(V)}while(++R<=5&&(S!==O.outerWidth()||W!==O.outerHeight()));return V}function J(){var R=false;if(c.isTipOpen&&!c.isClosing&&!c.delayInProgress){if(c.activeHover.data(e)===false||c.activeHover.is(":disabled")){R=true}else{if(!v(c.activeHover)&&!c.activeHover.is(":focus")&&!c.activeHover.data(d)){if(O.data(f)){if(!v(O)){R=true}}else{R=true}}}if(R){K(c.activeHover)}}}this.showTip=I;this.hideTip=K;this.resetPosition=G}function q(F){return window.SVGElement&&F[0] instanceof SVGElement}function h(){if(!c.mouseTrackingActive){c.mouseTrackingActive=true;k(function H(){c.scrollLeft=s.scrollLeft();c.scrollTop=s.scrollTop();c.windowWidth=s.width();c.windowHeight=s.height()});A.on("mousemove",i);s.on({resize:function G(){c.windowWidth=s.width();c.windowHeight=s.height()},scroll:function F(){var I=s.scrollLeft(),J=s.scrollTop();if(I!==c.scrollLeft){c.currentX+=I-c.scrollLeft;c.scrollLeft=I}if(J!==c.scrollTop){c.currentY+=J-c.scrollTop;c.scrollTop=J}}})}}function i(F){c.currentX=F.pageX;c.currentY=F.pageY}function v(F){var H=F.offset(),J=F[0].getBoundingClientRect(),I=J.right-J.left,G=J.bottom-J.top;return c.currentX>=H.left&&c.currentX<=H.left+I&&c.currentY>=H.top&&c.currentY<=H.top+G}function B(I){var G=I.data(y),F=I.data(o),K=I.data(l),H,J;if(G){if(k.isFunction(G)){G=G.call(I[0])}J=G}else{if(F){if(k.isFunction(F)){F=F.call(I[0])}if(F.length>0){J=F.clone(true,true)}}else{if(K){H=k("#"+K);if(H.length>0){J=H.html()}}}}return J}function m(M,L,K){var G=c.scrollTop,J=c.scrollLeft,I=G+c.windowHeight,F=J+c.windowWidth,H=p.none;if(M.top<G||Math.abs(M.bottom-c.windowHeight)-K<G){H|=p.top}if(M.top+K>I||Math.abs(M.bottom-c.windowHeight)>I){H|=p.bottom}if(M.left<J||M.right+L>F){H|=p.left}if(M.left+L>F||M.right<J){H|=p.right}return H}function a(G){var F=0;while(G){G&=G-1;F++}return F}}));
\ No newline at end of file diff --git a/libs/sort/doc/doxygen/html/keyplusdatasample_8cpp.html b/libs/sort/doc/doxygen/html/keyplusdatasample_8cpp.html new file mode 100644 index 000000000..37005724b --- /dev/null +++ b/libs/sort/doc/doxygen/html/keyplusdatasample_8cpp.html @@ -0,0 +1,155 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/keyplusdatasample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">keyplusdatasample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html">lessthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html">rightshift</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="keyplusdatasample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/mostlysorted_8cpp.html b/libs/sort/doc/doxygen/html/mostlysorted_8cpp.html new file mode 100644 index 000000000..9f151e31d --- /dev/null +++ b/libs/sort/doc/doxygen/html/mostlysorted_8cpp.html @@ -0,0 +1,182 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/mostlysorted.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">mostlysorted.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="mostlysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a0154ebfc03900bb5789ff9a306a480a9"><td class="memItemLeft" align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="mostlysorted_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9">get_index</a> (unsigned count)</td></tr> +<tr class="separator:a0154ebfc03900bb5789ff9a306a480a9"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="mostlysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a0154ebfc03900bb5789ff9a306a480a9"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">unsigned get_index </td> + <td>(</td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>count</em></td><td>)</td> + <td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespaceboost.html b/libs/sort/doc/doxygen/html/namespaceboost.html new file mode 100644 index 000000000..ac9fa7228 --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespaceboost.html @@ -0,0 +1,104 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost Namespace Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> </div> + <div class="headertitle"> +<div class="title">boost Namespace Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespaceboost_1_1sort.html b/libs/sort/doc/doxygen/html/namespaceboost_1_1sort.html new file mode 100644 index 000000000..147df4b2d --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespaceboost_1_1sort.html @@ -0,0 +1,1534 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost::sort Namespace Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">boost::sort Namespace Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplParams" colspan="2">template<class Data_type , class Cast_type > </td></tr> +<tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplItemLeft" align="right" valign="top">Cast_type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">float_mem_cast</a> (const Data_type &data)</td></tr> +<tr class="memdesc:ac3a946e197df6cfc4968c6371ace319b"><td class="mdescLeft"> </td><td class="mdescRight">Casts a float to the specified integer type. <a href="#ac3a946e197df6cfc4968c6371ace319b">More...</a><br /></td></tr> +<tr class="separator:ac3a946e197df6cfc4968c6371ace319b"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:acbcfc139de18c5c35c0ff1744c56e211"><td class="mdescLeft"> </td><td class="mdescRight"><code>float_sort</code> with casting to the appropriate size. <a href="#acbcfc139de18c5c35c0ff1744c56e211">More...</a><br /></td></tr> +<tr class="separator:acbcfc139de18c5c35c0ff1744c56e211"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift > </td></tr> +<tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift)</td></tr> +<tr class="memdesc:ad65f9ec25686acfbd2a59683cc99be12"><td class="mdescLeft"> </td><td class="mdescRight">Floating-point sort algorithm using random access iterators with just right-shift functor. <a href="#ad65f9ec25686acfbd2a59683cc99be12">More...</a><br /></td></tr> +<tr class="separator:ad65f9ec25686acfbd2a59683cc99be12"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift , class Compare > </td></tr> +<tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)</td></tr> +<tr class="memdesc:a941746cb1461c5f4971c2cf1efb9301e"><td class="mdescLeft"> </td><td class="mdescRight">Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator. <a href="#a941746cb1461c5f4971c2cf1efb9301e">More...</a><br /></td></tr> +<tr class="separator:a941746cb1461c5f4971c2cf1efb9301e"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:ae6ffbcf932699589fd2b93879f209013"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#ae6ffbcf932699589fd2b93879f209013">More...</a><br /></td></tr> +<tr class="separator:ae6ffbcf932699589fd2b93879f209013"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift , class Compare > </td></tr> +<tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817">integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp)</td></tr> +<tr class="memdesc:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#aa4ebb2541be58f9f0fecd8d7c108b817">More...</a><br /></td></tr> +<tr class="separator:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Right_shift > </td></tr> +<tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift)</td></tr> +<tr class="memdesc:ae50349854aad811f67a540d9b3aa4d4a"><td class="mdescLeft"> </td><td class="mdescRight">Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#ae50349854aad811f67a540d9b3aa4d4a">More...</a><br /></td></tr> +<tr class="separator:ae50349854aad811f67a540d9b3aa4d4a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_integer, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting integer-type elements so call to <code>integer_sort</code>. <a href="#a4bc25fdacd4c948f631f08a3f9aa38eb">More...</a><br /></td></tr> +<tr class="separator:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< !std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_integer &&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a94a736da091bd5d3b525818399f1b272"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting float element type so call to <code>float_sort</code>. <a href="#a94a736da091bd5d3b525818399f1b272">More...</a><br /></td></tr> +<tr class="separator:a94a736da091bd5d3b525818399f1b272"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< is_same< typename std::iterator_traits< RandomAccessIter >::value_type, typename std::string >::value||is_same< typename std::iterator_traits< RandomAccessIter >::value_type, typename std::wstring >::value, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:aafdea66d9b4a7faef5604b3079b525fa"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting string element type so call to <code>string_sort</code> for <code>std::strings</code> and <code>std::wstrings</code>. <a href="#aafdea66d9b4a7faef5604b3079b525fa">More...</a><br /></td></tr> +<tr class="separator:aafdea66d9b4a7faef5604b3079b525fa"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</td></tr> +<tr class="memdesc:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads.<br /> + (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#a950a2dbbe75f048a0b343dbf7c532dc0">More...</a><br /></td></tr> +<tr class="separator:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f">string_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#a6acd5fc94521b0a5cb47dc491b6d862f">More...</a><br /></td></tr> +<tr class="separator:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Compare , class Unsigned_char_type > </td></tr> +<tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</td></tr> +<tr class="memdesc:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads. <a href="#a4ad4785d90f47d51ff1d2fac8c21bb48">More...</a><br /></td></tr> +<tr class="separator:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Compare > </td></tr> +<tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp)</td></tr> +<tr class="memdesc:afd4938835fd03aab9c42bd0653e5dbe5"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#afd4938835fd03aab9c42bd0653e5dbe5">More...</a><br /></td></tr> +<tr class="separator:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length > </td></tr> +<tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length)</td></tr> +<tr class="memdesc:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#a5143ec4f58cfe13eca2a0d6b6f6a6680">More...</a><br /></td></tr> +<tr class="separator:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="memdesc:a82c4c0d7ba9873ecce7c674631dceae2"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#a82c4c0d7ba9873ecce7c674631dceae2">More...</a><br /></td></tr> +<tr class="separator:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="memdesc:a7940f1b2a7746c083a12a4e26077096b"><td class="mdescLeft"> </td><td class="mdescRight">Reverse String sort algorithm using random access iterators. <a href="#a7940f1b2a7746c083a12a4e26077096b">More...</a><br /></td></tr> +<tr class="separator:a7940f1b2a7746c083a12a4e26077096b"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> +<div class="textblock"><p>Namespace for spreadsort sort variants for different data types. </p><dl class="section note"><dt>Note</dt><dd>Use hyperlinks (coloured) to get detailed information about functions. </dd></dl> +</div><h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="ac3a946e197df6cfc4968c6371ace319b"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Cast_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">Cast_type boost::sort::float_mem_cast </td> + <td>(</td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>data</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Casts a float to the specified integer type. </p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">Data_type</td><td>Floating-point IEEE 754/IEC559 type. </td></tr> + <tr><td class="paramname">Cast_type</td><td>Integer type (same size) to which to cast.</td></tr> + </table> + </dd> +</dl> +<dl class="section user"><dt>Example:</dt><dd><div class="fragment"><div class="line"><span class="keyword">struct </span><a class="code" href="structrightshift.html">rightshift</a> {</div> +<div class="line"> <span class="keywordtype">int</span> operator()(<span class="keyword">const</span> <a class="code" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> offset)<span class="keyword"> const </span>{</div> +<div class="line"> <span class="keywordflow">return</span> <a class="code" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">float_mem_cast</a><<a class="code" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">KEY_TYPE</a>, <a class="code" href="double_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>>(x.<a class="code" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">key</a>) >> offset;</div> +<div class="line"> }</div> +<div class="line">};</div> +</div><!-- fragment --> </dd></dl> + +</div> +</div> +<a class="anchor" id="acbcfc139de18c5c35c0ff1744c56e211"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p><code>float_sort</code> with casting to the appropriate size. </p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<p>Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_float_sort.htm">windows_float_sort</a> <br /> + <a href="../../doc/graph/osx_float_sort.htm">osx_float_sort</a></p> +<dl class="section user"><dt>A simple example of sorting some floating-point is:</dt><dd><div class="fragment"><div class="line">vector<float> vec;</div> +<div class="line">vec.push_back(1.0);</div> +<div class="line">vec.push_back(2.3);</div> +<div class="line">vec.push_back(1.3);</div> +<div class="line"><a class="code" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a>(vec.begin(), vec.end());</div> +</div><!-- fragment --> </dd></dl> +<dl class="section user"><dt>The sorted vector contains ascending values "1.0 1.3 2.3".</dt><dd></dd></dl> + +</div> +</div> +<a class="anchor" id="ad65f9ec25686acfbd2a59683cc99be12"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Right_shift > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Floating-point sort algorithm using random access iterators with just right-shift functor. </p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Right_shift</td><td>Functor for right-shift by parameter <code>shift</code> bits.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">rshift</td><td>Number of bits to right-shift (using functor). </td></tr> + </table> + </dd> +</dl> + +</div> +</div> +<a class="anchor" id="a941746cb1461c5f4971c2cf1efb9301e"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Right_shift , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator. </p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits. </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">rshift</td><td>Number of bits to right-shift (using functor). </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr> + </table> + </dd> +</dl> + +</div> +</div> +<a class="anchor" id="ae6ffbcf932699589fd2b93879f209013"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::integer_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Integer sort algorithm using random access iterators. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). </p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="aa4ebb2541be58f9f0fecd8d7c108b817"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Right_shift , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::integer_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>shift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). </p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits. </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">shift</td><td>Number of bits to right-shift (using functor). </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="ae50349854aad811f67a540d9b3aa4d4a"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Right_shift > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::integer_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>shift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). </p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> + </p><dl class="section user"><dt>Performance:</dt><dd>Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a><br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></dd></dl> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">shift</td><td>Number of bits to right-shift (using functor).</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a4ad4785d90f47d51ff1d2fac8c21bb48"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Compare , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::reverse_string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Unsigned_char_type </td> + <td class="paramname"><em>unused</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, allowing character-type overloads. </p> +<p>(All variants fall back to <code>std::sort</code> if the data size is too small, < detail::min_sort_size).</p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison. </td></tr> + <tr><td class="paramname">Unsigned_char_type</td><td>Unsigned character type used for string.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">unused</td><td>Unused ???</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="afd4938835fd03aab9c42bd0653e5dbe5"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::reverse_string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p> +<p>(All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>).</p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>Comparison functor.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a7940f1b2a7746c083a12a4e26077096b"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::reverse_string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Reverse String sort algorithm using random access iterators. </p> +<p>(All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>).</p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Get_char</td><td>???. </td></tr> + <tr><td class="paramname">Get_length</td><td>??? TODO </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">getchar</td><td>??? </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>???</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a4bc25fdacd4c948f631f08a3f9aa38eb"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< std::numeric_limits< typename std::iterator_traits<RandomAccessIter>::value_type >::is_integer, void >::type boost::sort::spreadsort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Generic <code>spreadsort</code> variant detecting integer-type elements so call to <code>integer_sort</code>. </p> +<p>If the data type provided is an integer, <code>integer_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>. </dd></dl> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl> + +</div> +</div> +<a class="anchor" id="a94a736da091bd5d3b525818399f1b272"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< !std::numeric_limits< typename std::iterator_traits<RandomAccessIter>::value_type >::is_integer && std::numeric_limits< typename std::iterator_traits<RandomAccessIter>::value_type >::is_iec559, void >::type boost::sort::spreadsort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Generic <code>spreadsort</code> variant detecting float element type so call to <code>float_sort</code>. </p> +<p>If the data type provided is a float or castable-float, <code>float_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>.</dd></dl> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl> + +</div> +</div> +<a class="anchor" id="aafdea66d9b4a7faef5604b3079b525fa"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< is_same<typename std::iterator_traits<RandomAccessIter>::value_type, typename std::string>::value || is_same<typename std::iterator_traits<RandomAccessIter>::value_type, typename std::wstring>::value, void >::type boost::sort::spreadsort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>Generic <code>spreadsort</code> variant detecting string element type so call to <code>string_sort</code> for <code>std::strings</code> and <code>std::wstrings</code>. </p> +<p>If the data type provided is a string or wstring, <code>string_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>.</dd></dl> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl> + +</div> +</div> +<a class="anchor" id="a950a2dbbe75f048a0b343dbf7c532dc0"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Unsigned_char_type </td> + <td class="paramname"><em>unused</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, allowing character-type overloads.<br /> + (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). </p> +<p><code>string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +</p><dl class="section user"><dt></dt><dd>Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> +<a href="../../doc/graph/windows_string_sort.htm">windows_string_sort</a><br /> +<a href="../../doc/graph/osx_string_sort.htm">osx_string_sort</a></dd></dl> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Unsigned_char_type</td><td>Unsigned character type used for string. </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">unused</td><td>Unused ???</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a6acd5fc94521b0a5cb47dc491b6d862f"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). </p> +<p><code>string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_string_sort.htm">windows_string_sort</a> <br /> + <a href="../../doc/graph/osx_string_sort.htm">osx_string_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a5143ec4f58cfe13eca2a0d6b6f6a6680"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Get_char , class Get_length > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p> +<p>(All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>).</p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Get_char</td><td>Bracket functor equivalent to <code>operator</code>[], taking a number corresponding to the character offset.. </td></tr> + <tr><td class="paramname">Get_length</td><td>Functor to get the length of the string in characters. TODO Check this and below and other places!!!</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">getchar</td><td>Number corresponding to the character offset from bracket functor equivalent to <code>operator</code>[]. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>Functor to get the length of the string in characters.</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator>></code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +<a class="anchor" id="a82c4c0d7ba9873ecce7c674631dceae2"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::string_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +<p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p> +<p>(All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>).</p> +<p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (>=100kB).<br /> +Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br /> +<br /> +Some performance plots of runtime vs. n and log(range) are provided:<br /> + <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br /> + <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p> +<dl class="tparams"><dt>Template Parameters</dt><dd> + <table class="tparams"> + <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr> + <tr><td class="paramname">Get_char</td><td>???. </td></tr> + <tr><td class="paramname">Get_length</td><td>??? TODO </td></tr> + <tr><td class="paramname">Comp</td><td>To provide <code>operator<</code> for user-defined comparison.</td></tr> + </table> + </dd> +</dl> +<dl class="params"><dt>Parameters</dt><dd> + <table class="params"> + <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">getchar</td><td>??? </td></tr> + <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>???</td></tr> + </table> + </dd> +</dl> +<dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd> +<dd> +<code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd></dl> +<dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl> +<dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl> +<dl class="exception"><dt>Exceptions</dt><dd> + <table class="exception"> + <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr> + </table> + </dd> +</dl> +<dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd> +<dd> +Invalid arguments cause undefined behaviour. </dd></dl> +<dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl> +<dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd> +<dd> +* N is <code>last</code> - <code>first</code>, </dd> +<dd> +* K is the log of the range in bits (32 for 32-bit integers using their full range), </dd> +<dd> +* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespaceboost_1_1sort_1_1detail.html b/libs/sort/doc/doxygen/html/namespaceboost_1_1sort_1_1detail.html new file mode 100644 index 000000000..f97fd8b8d --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespaceboost_1_1sort_1_1detail.html @@ -0,0 +1,1774 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost::sort::detail Namespace Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#enum-members">Enumerations</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">boost::sort::detail Namespace Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="enum-members"></a> +Enumerations</h2></td></tr> +<tr class="memitem:a7bbd2027f75936442318063f34953907"><td class="memItemLeft" align="right" valign="top">enum  </td><td class="memItemRight" valign="bottom">{ <br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> = 11, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> = max_splits + 1, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a> = 2, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a> = 9, +<br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a> = 31, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a> = 2, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a> = 8, +<a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a> = 4, +<br /> +  <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d">min_sort_size</a> = 1000 +<br /> + }</td></tr> +<tr class="separator:a7bbd2027f75936442318063f34953907"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a8e8308c47bd14eff1c1d0f498289de35"><td class="memTemplParams" colspan="2">template<class Cast_type , class RandomAccessIter > </td></tr> +<tr class="memitem:a8e8308c47bd14eff1c1d0f498289de35"><td class="memTemplItemLeft" align="right" valign="top">Cast_type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">cast_float_iter</a> (const RandomAccessIter &floatiter)</td></tr> +<tr class="separator:a8e8308c47bd14eff1c1d0f498289de35"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a8aaa1645892e6f6845455605b48a5d0e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a8aaa1645892e6f6845455605b48a5d0e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a> (RandomAccessIter current, RandomAccessIter last, Div_type &max, Div_type &min, Right_shift rshift)</td></tr> +<tr class="separator:a8aaa1645892e6f6845455605b48a5d0e"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type > </td></tr> +<tr class="memitem:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">inner_float_swap_loop</a> (RandomAccessIter *bins, const RandomAccessIter &nextbinstart, unsigned ii, const unsigned log_divisor, const Div_type div_min)</td></tr> +<tr class="separator:ac04e982cc9f6bcc101f6af6bcd7b36b3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a18fb49752147ebb43503428568323d37"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type > </td></tr> +<tr class="memitem:a18fb49752147ebb43503428568323d37"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">float_swap_loop</a> (RandomAccessIter *bins, RandomAccessIter &nextbinstart, unsigned ii, const size_t *bin_sizes, const unsigned log_divisor, const Div_type div_min)</td></tr> +<tr class="separator:a18fb49752147ebb43503428568323d37"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a75e908c58d77dce852027ea90c59ea8e"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Cast_type > </td></tr> +<tr class="memitem:a75e908c58d77dce852027ea90c59ea8e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a75e908c58d77dce852027ea90c59ea8e">is_sorted_or_find_extremes</a> (RandomAccessIter current, RandomAccessIter last, Cast_type &max, Cast_type &min)</td></tr> +<tr class="separator:a75e908c58d77dce852027ea90c59ea8e"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3b8a896e29139b047fb1886262d124ab"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a3b8a896e29139b047fb1886262d124ab"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">positive_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a3b8a896e29139b047fb1886262d124ab"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a6b85a606f35ef97e23c7f8aed1c655b9"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:af7cc04cc70debc73a6bdbde6552b556c"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </td></tr> +<tr class="memitem:af7cc04cc70debc73a6bdbde6552b556c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#af7cc04cc70debc73a6bdbde6552b556c">negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift)</td></tr> +<tr class="separator:af7cc04cc70debc73a6bdbde6552b556c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3936c51da0154af6003bc491b542fa12"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </td></tr> +<tr class="memitem:a3936c51da0154af6003bc491b542fa12"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a3936c51da0154af6003bc491b542fa12">negative_float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a3936c51da0154af6003bc491b542fa12"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Size_type > </td></tr> +<tr class="memitem:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a1faa4283ebb64ba23c4a73c1c0a6548a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </td></tr> +<tr class="memitem:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a85d8622f809c9c5ee535890de4aa9ff3">float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift)</td></tr> +<tr class="separator:a85d8622f809c9c5ee535890de4aa9ff3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </td></tr> +<tr class="memitem:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7b984ddce7638d78d26ea22cea08f2e7">float_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a7b984ddce7638d78d26ea22cea08f2e7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:aaa66aec0efcc4f4a7f5584886e93444b"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(boost::uint64_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#aa9667055e88a8492bac9cd1b14cc86e0">float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:aa9667055e88a8492bac9cd1b14cc86e0"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a298f19036e85ffc74dbe92d2c26eae77"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a298f19036e85ffc74dbe92d2c26eae77"><td class="memTemplItemLeft" align="right" valign="top">boost::disable_if_c< (sizeof(boost::uint64_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)||sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type))&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a298f19036e85ffc74dbe92d2c26eae77">float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="separator:a298f19036e85ffc74dbe92d2c26eae77"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memTemplItemLeft" align="right" valign="top">void::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a22be02c948faa1f93e4dbb58b03b6e42">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift)</td></tr> +<tr class="separator:a22be02c948faa1f93e4dbb58b03b6e42"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a5e85811e357edf81ed621e25407b3256"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift > </td></tr> +<tr class="memitem:a5e85811e357edf81ed621e25407b3256"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(size_t)< sizeof(Div_type)&&sizeof(boost::uintmax_t) >=sizeof(Div_type), void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a5e85811e357edf81ed621e25407b3256">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift)</td></tr> +<tr class="separator:a5e85811e357edf81ed621e25407b3256"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </td></tr> +<tr class="memitem:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memTemplItemLeft" align="right" valign="top">void::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a23494fbb0eadd6a979f0b6c9fc19ea61">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:a23494fbb0eadd6a979f0b6c9fc19ea61"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad73450f75077d802111a93f66e24a4bc"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </td></tr> +<tr class="memitem:ad73450f75077d802111a93f66e24a4bc"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< sizeof(size_t)< sizeof(Div_type)&&sizeof(boost::uintmax_t) >=sizeof(Div_type), void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad73450f75077d802111a93f66e24a4bc">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Div_type, Right_shift rshift, Compare comp)</td></tr> +<tr class="separator:ad73450f75077d802111a93f66e24a4bc"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a852a51cde62aa67347cb9b4a7350bbac"><td class="memTemplParams" colspan="2">template<typename T > </td></tr> +<tr class="memitem:a852a51cde62aa67347cb9b4a7350bbac"><td class="memTemplItemLeft" align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a> (const T &input)</td></tr> +<tr class="separator:a852a51cde62aa67347cb9b4a7350bbac"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memTemplParams" colspan="2">template<unsigned log_mean_bin_size, unsigned log_min_split_count, unsigned log_finishing_count> </td></tr> +<tr class="memitem:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memTemplItemLeft" align="right" valign="top">size_t </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a> (unsigned log_range)</td></tr> +<tr class="separator:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memTemplItemLeft" align="right" valign="top">RandomAccessIter * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a> (size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</td></tr> +<tr class="separator:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a585497946eeb8cc1d2072642d7f1da01"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a585497946eeb8cc1d2072642d7f1da01"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a> (RandomAccessIter first, RandomAccessIter finish, size_t &char_offset)</td></tr> +<tr class="separator:a585497946eeb8cc1d2072642d7f1da01"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length > </td></tr> +<tr class="memitem:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a415ebdb0c9a5e9209bbfc7d2e576374c">update_offset</a> (RandomAccessIter first, RandomAccessIter finish, size_t &char_offset, Get_char getchar, Get_length length)</td></tr> +<tr class="separator:a415ebdb0c9a5e9209bbfc7d2e576374c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:ad1655ab39e410e18b6e8b6694405e5ba"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a66be693262defeff06a4a3507155d4a3"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a66be693262defeff06a4a3507155d4a3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</td></tr> +<tr class="separator:a66be693262defeff06a4a3507155d4a3"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:af825e4484173e0b886d0b24f66ae4a64"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length > </td></tr> +<tr class="memitem:af825e4484173e0b886d0b24f66ae4a64"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#af825e4484173e0b886d0b24f66ae4a64">string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length)</td></tr> +<tr class="separator:af825e4484173e0b886d0b24f66ae4a64"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a49ccfc022cfef8a14bbbbeccd36d78ec">string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="separator:a49ccfc022cfef8a14bbbbeccd36d78ec"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ab71cd7c25eada649fa1aff16fb3549f6">reverse_string_sort_rec</a> (RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="separator:ab71cd7c25eada649fa1aff16fb3549f6"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Enumeration Type Documentation</h2> +<a class="anchor" id="a7bbd2027f75936442318063f34953907"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">anonymous enum</td> + </tr> + </table> +</div><div class="memdoc"> +<table class="fieldtable"> +<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"></a>max_splits </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"></a>max_finishing_splits </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de"></a>int_log_mean_bin_size </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf"></a>int_log_min_split_count </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27"></a>int_log_finishing_count </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33"></a>float_log_mean_bin_size </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c"></a>float_log_min_split_count </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28"></a>float_log_finishing_count </td><td class="fielddoc"> +</td></tr> +<tr><td class="fieldname"><a class="anchor" id="a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d"></a>min_sort_size </td><td class="fielddoc"> +</td></tr> +</table> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a8e8308c47bd14eff1c1d0f498289de35"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Cast_type , class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">Cast_type boost::sort::detail::cast_float_iter </td> + <td>(</td> + <td class="paramtype">const RandomAccessIter & </td> + <td class="paramname"><em>floatiter</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aaa66aec0efcc4f4a7f5584886e93444b"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< sizeof(boost::uint32_t) == sizeof(typename std::iterator_traits<RandomAccessIter>::value_type) && std::numeric_limits<typename std::iterator_traits<RandomAccessIter>::value_type>::is_iec559, void >::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa9667055e88a8492bac9cd1b14cc86e0"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< sizeof(boost::uint64_t) == sizeof(typename std::iterator_traits<RandomAccessIter>::value_type) && std::numeric_limits<typename std::iterator_traits<RandomAccessIter>::value_type>::is_iec559, void >::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a298f19036e85ffc74dbe92d2c26eae77"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::disable_if_c< (sizeof(boost::uint64_t) == sizeof(typename std::iterator_traits<RandomAccessIter>::value_type) || sizeof(boost::uint32_t) == sizeof(typename std::iterator_traits<RandomAccessIter>::value_type)) && std::numeric_limits<typename std::iterator_traits<RandomAccessIter>::value_type>::is_iec559, void >::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a22be02c948faa1f93e4dbb58b03b6e42"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a5e85811e357edf81ed621e25407b3256"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< sizeof(size_t) < sizeof(Div_type) && sizeof(boost::uintmax_t) >= sizeof(Div_type), void >::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a23494fbb0eadd6a979f0b6c9fc19ea61"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ad73450f75077d802111a93f66e24a4bc"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">boost::enable_if_c< sizeof(size_t) < sizeof(Div_type) && sizeof(boost::uintmax_t) >= sizeof(Div_type), void >::type boost::sort::detail::float_sort </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type </td> + <td class="paramname">, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a1faa4283ebb64ba23c4a73c1c0a6548a"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a85d8622f809c9c5ee535890de4aa9ff3"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a7b984ddce7638d78d26ea22cea08f2e7"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a18fb49752147ebb43503428568323d37"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::float_swap_loop </td> + <td>(</td> + <td class="paramtype">RandomAccessIter * </td> + <td class="paramname"><em>bins</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter & </td> + <td class="paramname"><em>nextbinstart</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>ii</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>log_divisor</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const Div_type </td> + <td class="paramname"><em>div_min</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a4ba5c57512d16f300c08b7a6b4e6ff23"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<unsigned log_mean_bin_size, unsigned log_min_split_count, unsigned log_finishing_count> </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t boost::sort::detail::get_min_count </td> + <td>(</td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>log_range</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ac04e982cc9f6bcc101f6af6bcd7b36b3"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::inner_float_swap_loop </td> + <td>(</td> + <td class="paramtype">RandomAccessIter * </td> + <td class="paramname"><em>bins</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const RandomAccessIter & </td> + <td class="paramname"><em>nextbinstart</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>ii</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>log_divisor</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const Div_type </td> + <td class="paramname"><em>div_min</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a8aaa1645892e6f6845455605b48a5d0e"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool boost::sort::detail::is_sorted_or_find_extremes </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>current</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type & </td> + <td class="paramname"><em>max</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Div_type & </td> + <td class="paramname"><em>min</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a75e908c58d77dce852027ea90c59ea8e"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Cast_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool boost::sort::detail::is_sorted_or_find_extremes </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>current</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Cast_type & </td> + <td class="paramname"><em>max</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Cast_type & </td> + <td class="paramname"><em>min</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a6b85a606f35ef97e23c7f8aed1c655b9"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::negative_float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="af7cc04cc70debc73a6bdbde6552b556c"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::negative_float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a3936c51da0154af6003bc491b542fa12"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Right_shift , class Compare , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::negative_float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Right_shift </td> + <td class="paramname"><em>rshift</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a3b8a896e29139b047fb1886262d124ab"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Div_type , class Size_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::positive_float_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a66be693262defeff06a4a3507155d4a3"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::reverse_string_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ab71cd7c25eada649fa1aff16fb3549f6"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::reverse_string_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a852a51cde62aa67347cb9b4a7350bbac"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<typename T > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned boost::sort::detail::rough_log_2_size </td> + <td>(</td> + <td class="paramtype">const T & </td> + <td class="paramname"><em>input</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ad5b7d31fba809eae5d17f5c2fb0a385b"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">RandomAccessIter* boost::sort::detail::size_bins </td> + <td>(</td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned & </td> + <td class="paramname"><em>cache_end</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>bin_count</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ad1655ab39e410e18b6e8b6694405e5ba"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::string_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="af825e4484173e0b886d0b24f66ae4a64"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::string_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a49ccfc022cfef8a14bbbbeccd36d78ec"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type , class Get_char , class Get_length , class Compare > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::string_sort_rec </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>last</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">std::vector< RandomAccessIter > & </td> + <td class="paramname"><em>bin_cache</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>cache_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t * </td> + <td class="paramname"><em>bin_sizes</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Compare </td> + <td class="paramname"><em>comp</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a585497946eeb8cc1d2072642d7f1da01"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::update_offset </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>finish</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t & </td> + <td class="paramname"><em>char_offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a415ebdb0c9a5e9209bbfc7d2e576374c"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class RandomAccessIter , class Get_char , class Get_length > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">void boost::sort::detail::update_offset </td> + <td>(</td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>first</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">RandomAccessIter </td> + <td class="paramname"><em>finish</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t & </td> + <td class="paramname"><em>char_offset</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_char </td> + <td class="paramname"><em>getchar</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">Get_length </td> + <td class="paramname"><em>length</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespacemembers.html b/libs/sort/doc/doxygen/html/namespacemembers.html new file mode 100644 index 000000000..dbca72a4f --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespacemembers.html @@ -0,0 +1,118 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Namespace Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li class="current"><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="namespacemembers.html"><span>All</span></a></li> + <li><a href="namespacemembers_func.html"><span>Functions</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> +<div class="textblock">Here is a list of all namespace members with links to the namespace documentation for each member:</div><ul> +<li>float_mem_cast() +: <a class="el" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">boost::sort</a> +</li> +<li>float_sort() +: <a class="el" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">boost::sort</a> +</li> +<li>integer_sort() +: <a class="el" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort</a> +</li> +<li>reverse_string_sort() +: <a class="el" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort</a> +</li> +<li>spreadsort() +: <a class="el" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">boost::sort</a> +</li> +<li>string_sort() +: <a class="el" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespacemembers_eval.html b/libs/sort/doc/doxygen/html/namespacemembers_eval.html new file mode 100644 index 000000000..f357f221f --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespacemembers_eval.html @@ -0,0 +1,128 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Namespace Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li class="current"><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="namespacemembers.html"><span>All</span></a></li> + <li><a href="namespacemembers_func.html"><span>Functions</span></a></li> + <li class="current"><a href="namespacemembers_eval.html"><span>Enumerator</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>float_log_finishing_count +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">boost::sort::detail</a> +</li> +<li>float_log_mean_bin_size +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">boost::sort::detail</a> +</li> +<li>float_log_min_split_count +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">boost::sort::detail</a> +</li> +<li>int_log_finishing_count +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">boost::sort::detail</a> +</li> +<li>int_log_mean_bin_size +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">boost::sort::detail</a> +</li> +<li>int_log_min_split_count +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">boost::sort::detail</a> +</li> +<li>max_finishing_splits +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail</a> +</li> +<li>max_splits +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail</a> +</li> +<li>min_sort_size +: <a class="el" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d">boost::sort::detail</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespacemembers_func.html b/libs/sort/doc/doxygen/html/namespacemembers_func.html new file mode 100644 index 000000000..e33332b9f --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespacemembers_func.html @@ -0,0 +1,118 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Namespace Members</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="namespaces.html"><span>Namespace List</span></a></li> + <li class="current"><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> + <div id="navrow3" class="tabs2"> + <ul class="tablist"> + <li><a href="namespacemembers.html"><span>All</span></a></li> + <li class="current"><a href="namespacemembers_func.html"><span>Functions</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="contents"> + <ul> +<li>float_mem_cast() +: <a class="el" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">boost::sort</a> +</li> +<li>float_sort() +: <a class="el" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">boost::sort</a> +</li> +<li>integer_sort() +: <a class="el" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort</a> +</li> +<li>reverse_string_sort() +: <a class="el" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort</a> +</li> +<li>spreadsort() +: <a class="el" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">boost::sort</a> +</li> +<li>string_sort() +: <a class="el" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort</a> +</li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/namespaces.html b/libs/sort/doc/doxygen/html/namespaces.html new file mode 100644 index 000000000..ff92b5602 --- /dev/null +++ b/libs/sort/doc/doxygen/html/namespaces.html @@ -0,0 +1,102 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Namespace List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li class="current"><a href="namespaces.html"><span>Namespace List</span></a></li> + <li><a href="namespacemembers.html"><span>Namespace Members</span></a></li> + </ul> + </div> +</div><!-- top --> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div class="header"> + <div class="headertitle"> +<div class="title">Namespace List</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock">Here is a list of all namespaces with brief descriptions:</div><div class="directory"> +<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory"> +<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceboost.html" target="_self">boost</a></td><td class="desc"></td></tr> +<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceboost_1_1sort.html" target="_self">sort</a></td><td class="desc"></td></tr> +</table> +</div><!-- directory --> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/nav_f.png b/libs/sort/doc/doxygen/html/nav_f.png Binary files differnew file mode 100644 index 000000000..72a58a529 --- /dev/null +++ b/libs/sort/doc/doxygen/html/nav_f.png diff --git a/libs/sort/doc/doxygen/html/nav_g.png b/libs/sort/doc/doxygen/html/nav_g.png Binary files differnew file mode 100644 index 000000000..2093a237a --- /dev/null +++ b/libs/sort/doc/doxygen/html/nav_g.png diff --git a/libs/sort/doc/doxygen/html/nav_h.png b/libs/sort/doc/doxygen/html/nav_h.png Binary files differnew file mode 100644 index 000000000..33389b101 --- /dev/null +++ b/libs/sort/doc/doxygen/html/nav_h.png diff --git a/libs/sort/doc/doxygen/html/open.png b/libs/sort/doc/doxygen/html/open.png Binary files differnew file mode 100644 index 000000000..30f75c7ef --- /dev/null +++ b/libs/sort/doc/doxygen/html/open.png diff --git a/libs/sort/doc/doxygen/html/parallelint_8cpp.html b/libs/sort/doc/doxygen/html/parallelint_8cpp.html new file mode 100644 index 000000000..c06f6353a --- /dev/null +++ b/libs/sort/doc/doxygen/html/parallelint_8cpp.html @@ -0,0 +1,217 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/parallelint.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">parallelint.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <boost/thread.hpp></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelint_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:af6d351e5a33a6614628ba40ab9776aa6"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelint_8cpp.html#af6d351e5a33a6614628ba40ab9776aa6">is_sorted</a> (const std::vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > &array)</td></tr> +<tr class="separator:af6d351e5a33a6614628ba40ab9776aa6"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:acbd0dadb301334e73befdafddd98b044"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelint_8cpp.html#acbd0dadb301334e73befdafddd98b044">sort_loop</a> (const std::vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > &base_array, bool stdSort, unsigned loopCount)</td></tr> +<tr class="separator:acbd0dadb301334e73befdafddd98b044"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelint_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="af6d351e5a33a6614628ba40ab9776aa6"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">bool is_sorted </td> + <td>(</td> + <td class="paramtype">const std::vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > & </td> + <td class="paramname"><em>array</em></td><td>)</td> + <td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="acbd0dadb301334e73befdafddd98b044"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">void sort_loop </td> + <td>(</td> + <td class="paramtype">const std::vector< <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> > & </td> + <td class="paramname"><em>base_array</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">bool </td> + <td class="paramname"><em>stdSort</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>loopCount</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/parallelstring_8cpp.html b/libs/sort/doc/doxygen/html/parallelstring_8cpp.html new file mode 100644 index 000000000..cfd5a1967 --- /dev/null +++ b/libs/sort/doc/doxygen/html/parallelstring_8cpp.html @@ -0,0 +1,166 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/parallelstring.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">parallelstring.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <boost/random/mersenne_twister.hpp></code><br /> +<code>#include <boost/random/uniform_int_distribution.hpp></code><br /> +<code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <boost/thread.hpp></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelstring_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   string</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="parallelstring_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   string</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/randomgen_8cpp.html b/libs/sort/doc/doxygen/html/randomgen_8cpp.html new file mode 100644 index 000000000..524b933e4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/randomgen_8cpp.html @@ -0,0 +1,141 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/randomgen.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">randomgen.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <boost/random/mersenne_twister.hpp></code><br /> +<code>#include <boost/random/uniform_int_distribution.hpp></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include "stdlib.h"</code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="randomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/reverseintsample_8cpp.html b/libs/sort/doc/doxygen/html/reverseintsample_8cpp.html new file mode 100644 index 000000000..a8093bef6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/reverseintsample_8cpp.html @@ -0,0 +1,175 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/reverseintsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">reverseintsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p>integer sort with a rightshift functor reverse sorting example. +<a href="#details">More...</a></p> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +<code>#include <functional></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structnegrightshift.html">negrightshift</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="reverseintsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="reverseintsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> +<div class="textblock"><p>integer sort with a rightshift functor reverse sorting example. </p> +</div><h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/reversestringfunctorsample_8cpp.html b/libs/sort/doc/doxygen/html/reversestringfunctorsample_8cpp.html new file mode 100644 index 000000000..7e0217f8f --- /dev/null +++ b/libs/sort/doc/doxygen/html/reversestringfunctorsample_8cpp.html @@ -0,0 +1,156 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/reversestringfunctorsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">reversestringfunctorsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgreaterthan.html">greaterthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html">bracket</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html">getsize</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="reversestringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/reversestringsample_8cpp.html b/libs/sort/doc/doxygen/html/reversestringsample_8cpp.html new file mode 100644 index 000000000..7542a873d --- /dev/null +++ b/libs/sort/doc/doxygen/html/reversestringsample_8cpp.html @@ -0,0 +1,163 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/reversestringsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">reversestringsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="reversestringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   string</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="reversestringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   string</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/rightshiftsample_8cpp.html b/libs/sort/doc/doxygen/html/rightshiftsample_8cpp.html new file mode 100644 index 000000000..15723ae30 --- /dev/null +++ b/libs/sort/doc/doxygen/html/rightshiftsample_8cpp.html @@ -0,0 +1,174 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/rightshiftsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">rightshiftsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p>Integer sort with a rightshift functor sorting example. +<a href="#details">More...</a></p> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html">rightshift</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="rightshiftsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="rightshiftsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> +<div class="textblock"><p>Integer sort with a rightshift functor sorting example. </p> +</div><h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/sample_8cpp.html b/libs/sort/doc/doxygen/html/sample_8cpp.html new file mode 100644 index 000000000..87ae1298d --- /dev/null +++ b/libs/sort/doc/doxygen/html/sample_8cpp.html @@ -0,0 +1,164 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/sample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">sample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <sstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="sample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   int</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="sample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_0.html b/libs/sort/doc/doxygen/html/search/all_0.html new file mode 100644 index 000000000..c491fd8f1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_0.js b/libs/sort/doc/doxygen/html/search/all_0.js new file mode 100644 index 000000000..a28a9fba5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_0.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['a',['a',['../struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54',1,'DATA_TYPE']]], + ['alr_5fthreshold',['ALR_THRESHOLD',['../alrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6',1,'ALR_THRESHOLD(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6',1,'ALR_THRESHOLD(): binaryalrbreaker.cpp']]], + ['alrbreaker_2ecpp',['alrbreaker.cpp',['../alrbreaker_8cpp.html',1,'']]], + ['alreadysorted_2ecpp',['alreadysorted.cpp',['../alreadysorted_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_1.html b/libs/sort/doc/doxygen/html/search/all_1.html new file mode 100644 index 000000000..89fd5f83d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_1.js b/libs/sort/doc/doxygen/html/search/all_1.js new file mode 100644 index 000000000..eee11c909 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_1.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['binaryalrbreaker_2ecpp',['binaryalrbreaker.cpp',['../binaryalrbreaker_8cpp.html',1,'']]], + ['birth',['birth',['../struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c',1,'DATA_TYPE']]], + ['bit_5fshift',['bit_shift',['../alrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de',1,'bit_shift(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de',1,'bit_shift(): binaryalrbreaker.cpp']]], + ['boost',['boost',['../namespaceboost.html',1,'']]], + ['boostrandomgen_2ecpp',['boostrandomgen.cpp',['../boostrandomgen_8cpp.html',1,'']]], + ['bracket',['bracket',['../structbracket.html',1,'']]], + ['sort',['sort',['../namespaceboost_1_1sort.html',1,'boost']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_10.html b/libs/sort/doc/doxygen/html/search/all_10.html new file mode 100644 index 000000000..2abed7b25 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_10.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_10.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_10.js b/libs/sort/doc/doxygen/html/search/all_10.js new file mode 100644 index 000000000..dec109c6c --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_10.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['wstringsample_2ecpp',['wstringsample.cpp',['../wstringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_2.html b/libs/sort/doc/doxygen/html/search/all_2.html new file mode 100644 index 000000000..2c23ed46a --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_2.js b/libs/sort/doc/doxygen/html/search/all_2.js new file mode 100644 index 000000000..d88fb9622 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_2.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['caseinsensitive_2ecpp',['caseinsensitive.cpp',['../caseinsensitive_8cpp.html',1,'']]], + ['cast_5ftype',['CAST_TYPE',['../double_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): double.cpp'],['../floatfunctorsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): floatfunctorsample.cpp'],['../floatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): floatsample.cpp'],['../shiftfloatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): shiftfloatsample.cpp']]], + ['charstringsample_2ecpp',['charstringsample.cpp',['../charstringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_3.html b/libs/sort/doc/doxygen/html/search/all_3.html new file mode 100644 index 000000000..7ddb0cfb1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_3.js b/libs/sort/doc/doxygen/html/search/all_3.js new file mode 100644 index 000000000..aa169d4af --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_3.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['data',['data',['../struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c',1,'DATA_TYPE']]], + ['data_5ftype',['DATA_TYPE',['../struct_d_a_t_a___t_y_p_e.html',1,'DATA_TYPE'],['../alrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): alrbreaker.cpp'],['../alreadysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): alreadysorted.cpp'],['../binaryalrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): binaryalrbreaker.cpp'],['../double_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): double.cpp'],['../floatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): floatsample.cpp'],['../int64_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): int64.cpp'],['../mostlysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): mostlysorted.cpp'],['../parallelint_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): parallelint.cpp'],['../parallelstring_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): parallelstring.cpp'],['../reverseintsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): reverseintsample.cpp'],['../reversestringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): reversestringsample.cpp'],['../rightshiftsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): rightshiftsample.cpp'],['../sample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): sample.cpp'],['../shiftfloatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): shiftfloatsample.cpp'],['../stringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): stringsample.cpp'],['../wstringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): wstringsample.cpp']]], + ['double_2ecpp',['double.cpp',['../double_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_4.html b/libs/sort/doc/doxygen/html/search/all_4.html new file mode 100644 index 000000000..eab9eb1bc --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_4.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_4.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_4.js b/libs/sort/doc/doxygen/html/search/all_4.js new file mode 100644 index 000000000..4518b0af3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_4.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['fill_5fvector',['fill_vector',['../alrbreaker_8cpp.html#a53572e34857429ae9b6d9c5f4d02b453',1,'fill_vector(vector< DATA_TYPE > &input, const DATA_TYPE base_value, unsigned remaining_bits): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#ac9ac611850049644567c33a1b01e108a',1,'fill_vector(vector< DATA_TYPE > &input, const DATA_TYPE base_value, unsigned remaining_bits, const vector< unsigned > &indices, int index): binaryalrbreaker.cpp']]], + ['first_5fname',['first_name',['../struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403',1,'DATA_TYPE']]], + ['float_5fmem_5fcast',['float_mem_cast',['../namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b',1,'boost::sort']]], + ['float_5fsort',['float_sort',['../namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last, Right_shift rshift)'],['../namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)']]], + ['float_5fsort_2ehpp',['float_sort.hpp',['../float__sort_8hpp.html',1,'']]], + ['floatfunctorsample_2ecpp',['floatfunctorsample.cpp',['../floatfunctorsample_8cpp.html',1,'']]], + ['floatsample_2ecpp',['floatsample.cpp',['../floatsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_5.html b/libs/sort/doc/doxygen/html/search/all_5.html new file mode 100644 index 000000000..4dfd1d507 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_5.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_5.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_5.js b/libs/sort/doc/doxygen/html/search/all_5.js new file mode 100644 index 000000000..05cf7d8e2 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_5.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['generalizedstruct_2ecpp',['generalizedstruct.cpp',['../generalizedstruct_8cpp.html',1,'']]], + ['get_5findex',['get_index',['../binaryalrbreaker_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9',1,'get_index(unsigned count): binaryalrbreaker.cpp'],['../mostlysorted_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9',1,'get_index(unsigned count): mostlysorted.cpp']]], + ['getsize',['getsize',['../structgetsize.html',1,'']]], + ['greaterthan',['greaterthan',['../structgreaterthan.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_6.html b/libs/sort/doc/doxygen/html/search/all_6.html new file mode 100644 index 000000000..b98d73108 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_6.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_6.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_6.js b/libs/sort/doc/doxygen/html/search/all_6.js new file mode 100644 index 000000000..24aa2dc0d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_6.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['int64_2ecpp',['int64.cpp',['../int64_8cpp.html',1,'']]], + ['integer_5fsort',['integer_sort',['../namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp)'],['../namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift)']]], + ['integer_5fsort_2ehpp',['integer_sort.hpp',['../integer__sort_8hpp.html',1,'']]], + ['is_5fsorted',['is_sorted',['../parallelint_8cpp.html#af6d351e5a33a6614628ba40ab9776aa6',1,'parallelint.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_7.html b/libs/sort/doc/doxygen/html/search/all_7.html new file mode 100644 index 000000000..ef202229b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_7.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_7.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_7.js b/libs/sort/doc/doxygen/html/search/all_7.js new file mode 100644 index 000000000..3e5e8c8d2 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_7.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['key',['key',['../struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae',1,'DATA_TYPE::key()'],['../struct_d_a_t_a___t_y_p_e.html#af18aa9620a8309d88c829d6af27824e3',1,'DATA_TYPE::key()']]], + ['key_5ftype',['KEY_TYPE',['../floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489',1,'floatfunctorsample.cpp']]], + ['keyplusdatasample_2ecpp',['keyplusdatasample.cpp',['../keyplusdatasample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_8.html b/libs/sort/doc/doxygen/html/search/all_8.html new file mode 100644 index 000000000..12e5aff1c --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_8.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_8.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_8.js b/libs/sort/doc/doxygen/html/search/all_8.js new file mode 100644 index 000000000..fa0fe45a6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_8.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['last_5fname',['last_name',['../struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43',1,'DATA_TYPE']]], + ['lessthan',['lessthan',['../structlessthan.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_9.html b/libs/sort/doc/doxygen/html/search/all_9.html new file mode 100644 index 000000000..7e100075e --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_9.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_9.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_9.js b/libs/sort/doc/doxygen/html/search/all_9.js new file mode 100644 index 000000000..bbe7edd09 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_9.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['main',['main',['../alrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1',1,'main(int, const char **): alrbreaker.cpp'],['../alreadysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): alreadysorted.cpp'],['../binaryalrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1',1,'main(int, const char **): binaryalrbreaker.cpp'],['../boostrandomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): boostrandomgen.cpp'],['../caseinsensitive_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): caseinsensitive.cpp'],['../charstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): charstringsample.cpp'],['../double_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): double.cpp'],['../floatfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): floatfunctorsample.cpp'],['../floatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): floatsample.cpp'],['../generalizedstruct_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): generalizedstruct.cpp'],['../int64_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): int64.cpp'],['../keyplusdatasample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): keyplusdatasample.cpp'],['../mostlysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): mostlysorted.cpp'],['../parallelint_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): parallelint.cpp'],['../parallelstring_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): parallelstring.cpp'],['../randomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): randomgen.cpp'],['../reverseintsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reverseintsample.cpp'],['../reversestringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reversestringfunctorsample.cpp'],['../reversestringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reversestringsample.cpp'],['../rightshiftsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): rightshiftsample.cpp'],['../sample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): sample.cpp'],['../shiftfloatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): shiftfloatsample.cpp'],['../stringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): stringfunctorsample.cpp'],['../stringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): stringsample.cpp'],['../wstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): wstringsample.cpp']]], + ['max_5fcount',['max_count',['../alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d',1,'max_count(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d',1,'max_count(): binaryalrbreaker.cpp']]], + ['mostlysorted_2ecpp',['mostlysorted.cpp',['../mostlysorted_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_a.html b/libs/sort/doc/doxygen/html/search/all_a.html new file mode 100644 index 000000000..95b4c8fc6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_a.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_a.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_a.js b/libs/sort/doc/doxygen/html/search/all_a.js new file mode 100644 index 000000000..1e4a02aab --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_a.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['negrightshift',['negrightshift',['../structnegrightshift.html',1,'']]], + ['net_5fworth',['net_worth',['../struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_b.html b/libs/sort/doc/doxygen/html/search/all_b.html new file mode 100644 index 000000000..1f1beb55a --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_b.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_b.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_b.js b/libs/sort/doc/doxygen/html/search/all_b.js new file mode 100644 index 000000000..6bebddafe --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_b.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['operator_28_29',['operator()',['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structrightshift.html#a87a59db62b9d8c90a02df98442199598',1,'rightshift::operator()()'],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()(const DATA_TYPE &x, const DATA_TYPE &y) const '],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()(const DATA_TYPE &x, const DATA_TYPE &y) const '],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structrightshift.html#a3464d6de770ac9db414271587a712d12',1,'rightshift::operator()()'],['../structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2',1,'negrightshift::operator()()'],['../structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd',1,'greaterthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structrightshift.html#a24f7c45689f1e4cd02ae7fb40b47afc4',1,'rightshift::operator()(DATA_TYPE x, unsigned offset)'],['../structrightshift.html#a87a59db62b9d8c90a02df98442199598',1,'rightshift::operator()(const DATA_TYPE &x, const unsigned offset) const '],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()']]], + ['operator_3c',['operator<',['../struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_c.html b/libs/sort/doc/doxygen/html/search/all_c.html new file mode 100644 index 000000000..ec9a0c840 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_c.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_c.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_c.js b/libs/sort/doc/doxygen/html/search/all_c.js new file mode 100644 index 000000000..280a8e694 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_c.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['parallelint_2ecpp',['parallelint.cpp',['../parallelint_8cpp.html',1,'']]], + ['parallelstring_2ecpp',['parallelstring.cpp',['../parallelstring_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_d.html b/libs/sort/doc/doxygen/html/search/all_d.html new file mode 100644 index 000000000..654d1988b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_d.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_d.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_d.js b/libs/sort/doc/doxygen/html/search/all_d.js new file mode 100644 index 000000000..886fa4ff6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_d.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['radix_5fthreshold',['radix_threshold',['../alrbreaker_8cpp.html#afc30457e398e72300f20714123913b78',1,'radix_threshold(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#afc30457e398e72300f20714123913b78',1,'radix_threshold(): binaryalrbreaker.cpp']]], + ['randomgen_2ecpp',['randomgen.cpp',['../randomgen_8cpp.html',1,'']]], + ['reverse_5fstring_5fsort',['reverse_string_sort',['../namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp)'],['../namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]], + ['reverseintsample_2ecpp',['reverseintsample.cpp',['../reverseintsample_8cpp.html',1,'']]], + ['reversestringfunctorsample_2ecpp',['reversestringfunctorsample.cpp',['../reversestringfunctorsample_8cpp.html',1,'']]], + ['reversestringsample_2ecpp',['reversestringsample.cpp',['../reversestringsample_8cpp.html',1,'']]], + ['rightshift',['rightshift',['../structrightshift.html',1,'']]], + ['rightshiftsample_2ecpp',['rightshiftsample.cpp',['../rightshiftsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_e.html b/libs/sort/doc/doxygen/html/search/all_e.html new file mode 100644 index 000000000..812aced8b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_e.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_e.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_e.js b/libs/sort/doc/doxygen/html/search/all_e.js new file mode 100644 index 000000000..ca59b6e8e --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_e.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['sample_2ecpp',['sample.cpp',['../sample_8cpp.html',1,'']]], + ['shiftfloatsample_2ecpp',['shiftfloatsample.cpp',['../shiftfloatsample_8cpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../sort_8hpp.html',1,'']]], + ['sort_5floop',['sort_loop',['../parallelint_8cpp.html#acbd0dadb301334e73befdafddd98b044',1,'parallelint.cpp']]], + ['spreadsort',['spreadsort',['../namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)']]], + ['spreadsort_2ehpp',['spreadsort.hpp',['../spreadsort_8hpp.html',1,'']]], + ['string_5fsort',['string_sort',['../namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length)'],['../namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]], + ['string_5fsort_2ehpp',['string_sort.hpp',['../string__sort_8hpp.html',1,'']]], + ['stringfunctorsample_2ecpp',['stringfunctorsample.cpp',['../stringfunctorsample_8cpp.html',1,'']]], + ['stringsample_2ecpp',['stringsample.cpp',['../stringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/all_f.html b/libs/sort/doc/doxygen/html/search/all_f.html new file mode 100644 index 000000000..c395a4749 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_f.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="all_f.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/all_f.js b/libs/sort/doc/doxygen/html/search/all_f.js new file mode 100644 index 000000000..32233d93b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/all_f.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['top_5fsplits',['top_splits',['../alrbreaker_8cpp.html#a60c4ea1dd4d297e0d2e395375e0e716c',1,'alrbreaker.cpp']]], + ['typed_5fone',['typed_one',['../alrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa',1,'typed_one(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa',1,'typed_one(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_0.html b/libs/sort/doc/doxygen/html/search/classes_0.html new file mode 100644 index 000000000..8888fa809 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_0.js b/libs/sort/doc/doxygen/html/search/classes_0.js new file mode 100644 index 000000000..47594dc6d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['bracket',['bracket',['../structbracket.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_1.html b/libs/sort/doc/doxygen/html/search/classes_1.html new file mode 100644 index 000000000..a402bbefd --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_1.js b/libs/sort/doc/doxygen/html/search/classes_1.js new file mode 100644 index 000000000..381187ab2 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['data_5ftype',['DATA_TYPE',['../struct_d_a_t_a___t_y_p_e.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_2.html b/libs/sort/doc/doxygen/html/search/classes_2.html new file mode 100644 index 000000000..003214bb2 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_2.js b/libs/sort/doc/doxygen/html/search/classes_2.js new file mode 100644 index 000000000..94222afde --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_2.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['getsize',['getsize',['../structgetsize.html',1,'']]], + ['greaterthan',['greaterthan',['../structgreaterthan.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_3.html b/libs/sort/doc/doxygen/html/search/classes_3.html new file mode 100644 index 000000000..fadcfc83b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_3.js b/libs/sort/doc/doxygen/html/search/classes_3.js new file mode 100644 index 000000000..6bfb39f48 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['lessthan',['lessthan',['../structlessthan.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_4.html b/libs/sort/doc/doxygen/html/search/classes_4.html new file mode 100644 index 000000000..6056b2036 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_4.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_4.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_4.js b/libs/sort/doc/doxygen/html/search/classes_4.js new file mode 100644 index 000000000..3d2be8f05 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['negrightshift',['negrightshift',['../structnegrightshift.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/classes_5.html b/libs/sort/doc/doxygen/html/search/classes_5.html new file mode 100644 index 000000000..ca7c947c9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_5.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="classes_5.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/classes_5.js b/libs/sort/doc/doxygen/html/search/classes_5.js new file mode 100644 index 000000000..ef452d6da --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/classes_5.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['rightshift',['rightshift',['../structrightshift.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/close.png b/libs/sort/doc/doxygen/html/search/close.png Binary files differnew file mode 100644 index 000000000..9342d3dfe --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/close.png diff --git a/libs/sort/doc/doxygen/html/search/defines_0.html b/libs/sort/doc/doxygen/html/search/defines_0.html new file mode 100644 index 000000000..27eaf8cb7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="defines_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/defines_0.js b/libs/sort/doc/doxygen/html/search/defines_0.js new file mode 100644 index 000000000..8a9168f3b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['alr_5fthreshold',['ALR_THRESHOLD',['../alrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6',1,'ALR_THRESHOLD(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a3bc09656dab629cfa24aa2ab3f44a3e6',1,'ALR_THRESHOLD(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/defines_1.html b/libs/sort/doc/doxygen/html/search/defines_1.html new file mode 100644 index 000000000..b0d10dd56 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="defines_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/defines_1.js b/libs/sort/doc/doxygen/html/search/defines_1.js new file mode 100644 index 000000000..aa1431fc7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['cast_5ftype',['CAST_TYPE',['../double_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): double.cpp'],['../floatfunctorsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): floatfunctorsample.cpp'],['../floatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): floatsample.cpp'],['../shiftfloatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c',1,'CAST_TYPE(): shiftfloatsample.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/defines_2.html b/libs/sort/doc/doxygen/html/search/defines_2.html new file mode 100644 index 000000000..89e595625 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="defines_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/defines_2.js b/libs/sort/doc/doxygen/html/search/defines_2.js new file mode 100644 index 000000000..3406fdcf3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['data_5ftype',['DATA_TYPE',['../alrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): alrbreaker.cpp'],['../alreadysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): alreadysorted.cpp'],['../binaryalrbreaker_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): binaryalrbreaker.cpp'],['../double_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): double.cpp'],['../floatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): floatsample.cpp'],['../int64_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): int64.cpp'],['../mostlysorted_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): mostlysorted.cpp'],['../parallelint_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): parallelint.cpp'],['../parallelstring_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): parallelstring.cpp'],['../reverseintsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): reverseintsample.cpp'],['../reversestringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): reversestringsample.cpp'],['../rightshiftsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): rightshiftsample.cpp'],['../sample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): sample.cpp'],['../shiftfloatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): shiftfloatsample.cpp'],['../stringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): stringsample.cpp'],['../wstringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1',1,'DATA_TYPE(): wstringsample.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/defines_3.html b/libs/sort/doc/doxygen/html/search/defines_3.html new file mode 100644 index 000000000..0d686ae6f --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="defines_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/defines_3.js b/libs/sort/doc/doxygen/html/search/defines_3.js new file mode 100644 index 000000000..6c2674c16 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/defines_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['key_5ftype',['KEY_TYPE',['../floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489',1,'floatfunctorsample.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_0.html b/libs/sort/doc/doxygen/html/search/enumvalues_0.html new file mode 100644 index 000000000..a1556a646 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="enumvalues_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_0.js b/libs/sort/doc/doxygen/html/search/enumvalues_0.js new file mode 100644 index 000000000..92c42f0fb --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_0.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['float_5flog_5ffinishing_5fcount',['float_log_finishing_count',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28',1,'boost::sort::detail']]], + ['float_5flog_5fmean_5fbin_5fsize',['float_log_mean_bin_size',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33',1,'boost::sort::detail']]], + ['float_5flog_5fmin_5fsplit_5fcount',['float_log_min_split_count',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c',1,'boost::sort::detail']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_1.html b/libs/sort/doc/doxygen/html/search/enumvalues_1.html new file mode 100644 index 000000000..76abc4573 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="enumvalues_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_1.js b/libs/sort/doc/doxygen/html/search/enumvalues_1.js new file mode 100644 index 000000000..cf66d0cfa --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_1.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['int_5flog_5ffinishing_5fcount',['int_log_finishing_count',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27',1,'boost::sort::detail']]], + ['int_5flog_5fmean_5fbin_5fsize',['int_log_mean_bin_size',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de',1,'boost::sort::detail']]], + ['int_5flog_5fmin_5fsplit_5fcount',['int_log_min_split_count',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf',1,'boost::sort::detail']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_2.html b/libs/sort/doc/doxygen/html/search/enumvalues_2.html new file mode 100644 index 000000000..c0bcb1ffb --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="enumvalues_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/enumvalues_2.js b/libs/sort/doc/doxygen/html/search/enumvalues_2.js new file mode 100644 index 000000000..2a7f0e887 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/enumvalues_2.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['max_5ffinishing_5fsplits',['max_finishing_splits',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7',1,'boost::sort::detail']]], + ['max_5fsplits',['max_splits',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9',1,'boost::sort::detail']]], + ['min_5fsort_5fsize',['min_sort_size',['../namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aff33660c3058d4e081b7d4353aae659d',1,'boost::sort::detail']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_0.html b/libs/sort/doc/doxygen/html/search/files_0.html new file mode 100644 index 000000000..04578537d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_0.js b/libs/sort/doc/doxygen/html/search/files_0.js new file mode 100644 index 000000000..b3c5c3c38 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_0.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['alrbreaker_2ecpp',['alrbreaker.cpp',['../alrbreaker_8cpp.html',1,'']]], + ['alreadysorted_2ecpp',['alreadysorted.cpp',['../alreadysorted_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_1.html b/libs/sort/doc/doxygen/html/search/files_1.html new file mode 100644 index 000000000..ce0a3a7a7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_1.js b/libs/sort/doc/doxygen/html/search/files_1.js new file mode 100644 index 000000000..3f6bc7c42 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_1.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['binaryalrbreaker_2ecpp',['binaryalrbreaker.cpp',['../binaryalrbreaker_8cpp.html',1,'']]], + ['boostrandomgen_2ecpp',['boostrandomgen.cpp',['../boostrandomgen_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_2.html b/libs/sort/doc/doxygen/html/search/files_2.html new file mode 100644 index 000000000..d188d98a5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_2.js b/libs/sort/doc/doxygen/html/search/files_2.js new file mode 100644 index 000000000..6d5e1bde0 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_2.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['caseinsensitive_2ecpp',['caseinsensitive.cpp',['../caseinsensitive_8cpp.html',1,'']]], + ['charstringsample_2ecpp',['charstringsample.cpp',['../charstringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_3.html b/libs/sort/doc/doxygen/html/search/files_3.html new file mode 100644 index 000000000..7fa556e8d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_3.js b/libs/sort/doc/doxygen/html/search/files_3.js new file mode 100644 index 000000000..00f19c796 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['double_2ecpp',['double.cpp',['../double_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_4.html b/libs/sort/doc/doxygen/html/search/files_4.html new file mode 100644 index 000000000..192383bbc --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_4.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_4.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_4.js b/libs/sort/doc/doxygen/html/search/files_4.js new file mode 100644 index 000000000..89fd331f3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_4.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['float_5fsort_2ehpp',['float_sort.hpp',['../float__sort_8hpp.html',1,'']]], + ['floatfunctorsample_2ecpp',['floatfunctorsample.cpp',['../floatfunctorsample_8cpp.html',1,'']]], + ['floatsample_2ecpp',['floatsample.cpp',['../floatsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_5.html b/libs/sort/doc/doxygen/html/search/files_5.html new file mode 100644 index 000000000..af3aaba50 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_5.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_5.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_5.js b/libs/sort/doc/doxygen/html/search/files_5.js new file mode 100644 index 000000000..b4fa82378 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_5.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['generalizedstruct_2ecpp',['generalizedstruct.cpp',['../generalizedstruct_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_6.html b/libs/sort/doc/doxygen/html/search/files_6.html new file mode 100644 index 000000000..4f7e395af --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_6.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_6.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_6.js b/libs/sort/doc/doxygen/html/search/files_6.js new file mode 100644 index 000000000..c8517af03 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_6.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['int64_2ecpp',['int64.cpp',['../int64_8cpp.html',1,'']]], + ['integer_5fsort_2ehpp',['integer_sort.hpp',['../integer__sort_8hpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_7.html b/libs/sort/doc/doxygen/html/search/files_7.html new file mode 100644 index 000000000..65578c2f8 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_7.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_7.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_7.js b/libs/sort/doc/doxygen/html/search/files_7.js new file mode 100644 index 000000000..673edec46 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_7.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['keyplusdatasample_2ecpp',['keyplusdatasample.cpp',['../keyplusdatasample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_8.html b/libs/sort/doc/doxygen/html/search/files_8.html new file mode 100644 index 000000000..105d31ded --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_8.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_8.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_8.js b/libs/sort/doc/doxygen/html/search/files_8.js new file mode 100644 index 000000000..59db00212 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_8.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['mostlysorted_2ecpp',['mostlysorted.cpp',['../mostlysorted_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_9.html b/libs/sort/doc/doxygen/html/search/files_9.html new file mode 100644 index 000000000..4233bc4b5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_9.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_9.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_9.js b/libs/sort/doc/doxygen/html/search/files_9.js new file mode 100644 index 000000000..280a8e694 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_9.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['parallelint_2ecpp',['parallelint.cpp',['../parallelint_8cpp.html',1,'']]], + ['parallelstring_2ecpp',['parallelstring.cpp',['../parallelstring_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_a.html b/libs/sort/doc/doxygen/html/search/files_a.html new file mode 100644 index 000000000..7af4acc0e --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_a.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_a.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_a.js b/libs/sort/doc/doxygen/html/search/files_a.js new file mode 100644 index 000000000..2272642d0 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_a.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['randomgen_2ecpp',['randomgen.cpp',['../randomgen_8cpp.html',1,'']]], + ['reverseintsample_2ecpp',['reverseintsample.cpp',['../reverseintsample_8cpp.html',1,'']]], + ['reversestringfunctorsample_2ecpp',['reversestringfunctorsample.cpp',['../reversestringfunctorsample_8cpp.html',1,'']]], + ['reversestringsample_2ecpp',['reversestringsample.cpp',['../reversestringsample_8cpp.html',1,'']]], + ['rightshiftsample_2ecpp',['rightshiftsample.cpp',['../rightshiftsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_b.html b/libs/sort/doc/doxygen/html/search/files_b.html new file mode 100644 index 000000000..135f82052 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_b.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_b.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_b.js b/libs/sort/doc/doxygen/html/search/files_b.js new file mode 100644 index 000000000..9358e0e4f --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_b.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['sample_2ecpp',['sample.cpp',['../sample_8cpp.html',1,'']]], + ['shiftfloatsample_2ecpp',['shiftfloatsample.cpp',['../shiftfloatsample_8cpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../sort_8hpp.html',1,'']]], + ['spreadsort_2ehpp',['spreadsort.hpp',['../spreadsort_8hpp.html',1,'']]], + ['string_5fsort_2ehpp',['string_sort.hpp',['../string__sort_8hpp.html',1,'']]], + ['stringfunctorsample_2ecpp',['stringfunctorsample.cpp',['../stringfunctorsample_8cpp.html',1,'']]], + ['stringsample_2ecpp',['stringsample.cpp',['../stringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/files_c.html b/libs/sort/doc/doxygen/html/search/files_c.html new file mode 100644 index 000000000..09a022884 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_c.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="files_c.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/files_c.js b/libs/sort/doc/doxygen/html/search/files_c.js new file mode 100644 index 000000000..dec109c6c --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/files_c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['wstringsample_2ecpp',['wstringsample.cpp',['../wstringsample_8cpp.html',1,'']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_0.html b/libs/sort/doc/doxygen/html/search/functions_0.html new file mode 100644 index 000000000..88c8a2680 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_0.js b/libs/sort/doc/doxygen/html/search/functions_0.js new file mode 100644 index 000000000..fe61c83b1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_0.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['fill_5fvector',['fill_vector',['../alrbreaker_8cpp.html#a53572e34857429ae9b6d9c5f4d02b453',1,'fill_vector(vector< DATA_TYPE > &input, const DATA_TYPE base_value, unsigned remaining_bits): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#ac9ac611850049644567c33a1b01e108a',1,'fill_vector(vector< DATA_TYPE > &input, const DATA_TYPE base_value, unsigned remaining_bits, const vector< unsigned > &indices, int index): binaryalrbreaker.cpp']]], + ['float_5fmem_5fcast',['float_mem_cast',['../namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b',1,'boost::sort']]], + ['float_5fsort',['float_sort',['../namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last, Right_shift rshift)'],['../namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e',1,'boost::sort::float_sort(RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_1.html b/libs/sort/doc/doxygen/html/search/functions_1.html new file mode 100644 index 000000000..215c1bf67 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_1.js b/libs/sort/doc/doxygen/html/search/functions_1.js new file mode 100644 index 000000000..309fbdf63 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['get_5findex',['get_index',['../binaryalrbreaker_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9',1,'get_index(unsigned count): binaryalrbreaker.cpp'],['../mostlysorted_8cpp.html#a0154ebfc03900bb5789ff9a306a480a9',1,'get_index(unsigned count): mostlysorted.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_2.html b/libs/sort/doc/doxygen/html/search/functions_2.html new file mode 100644 index 000000000..f17abffce --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_2.js b/libs/sort/doc/doxygen/html/search/functions_2.js new file mode 100644 index 000000000..6448e7b83 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_2.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['integer_5fsort',['integer_sort',['../namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp)'],['../namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a',1,'boost::sort::integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift)']]], + ['is_5fsorted',['is_sorted',['../parallelint_8cpp.html#af6d351e5a33a6614628ba40ab9776aa6',1,'parallelint.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_3.html b/libs/sort/doc/doxygen/html/search/functions_3.html new file mode 100644 index 000000000..8a4bbe14f --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_3.js b/libs/sort/doc/doxygen/html/search/functions_3.js new file mode 100644 index 000000000..d137070a6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['main',['main',['../alrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1',1,'main(int, const char **): alrbreaker.cpp'],['../alreadysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): alreadysorted.cpp'],['../binaryalrbreaker_8cpp.html#a0fc34f49b0e6eaed5e5c3accb409b1d1',1,'main(int, const char **): binaryalrbreaker.cpp'],['../boostrandomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): boostrandomgen.cpp'],['../caseinsensitive_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): caseinsensitive.cpp'],['../charstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): charstringsample.cpp'],['../double_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): double.cpp'],['../floatfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): floatfunctorsample.cpp'],['../floatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): floatsample.cpp'],['../generalizedstruct_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): generalizedstruct.cpp'],['../int64_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): int64.cpp'],['../keyplusdatasample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): keyplusdatasample.cpp'],['../mostlysorted_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): mostlysorted.cpp'],['../parallelint_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): parallelint.cpp'],['../parallelstring_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): parallelstring.cpp'],['../randomgen_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): randomgen.cpp'],['../reverseintsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reverseintsample.cpp'],['../reversestringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reversestringfunctorsample.cpp'],['../reversestringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): reversestringsample.cpp'],['../rightshiftsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): rightshiftsample.cpp'],['../sample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): sample.cpp'],['../shiftfloatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): shiftfloatsample.cpp'],['../stringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): stringfunctorsample.cpp'],['../stringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): stringsample.cpp'],['../wstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52',1,'main(int argc, const char **argv): wstringsample.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_4.html b/libs/sort/doc/doxygen/html/search/functions_4.html new file mode 100644 index 000000000..cce7ce906 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_4.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_4.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_4.js b/libs/sort/doc/doxygen/html/search/functions_4.js new file mode 100644 index 000000000..6bebddafe --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_4.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['operator_28_29',['operator()',['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structrightshift.html#a87a59db62b9d8c90a02df98442199598',1,'rightshift::operator()()'],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()(const DATA_TYPE &x, const DATA_TYPE &y) const '],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()(const DATA_TYPE &x, const DATA_TYPE &y) const '],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structrightshift.html#a3464d6de770ac9db414271587a712d12',1,'rightshift::operator()()'],['../structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2',1,'negrightshift::operator()()'],['../structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd',1,'greaterthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()'],['../structrightshift.html#a24f7c45689f1e4cd02ae7fb40b47afc4',1,'rightshift::operator()(DATA_TYPE x, unsigned offset)'],['../structrightshift.html#a87a59db62b9d8c90a02df98442199598',1,'rightshift::operator()(const DATA_TYPE &x, const unsigned offset) const '],['../structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582',1,'lessthan::operator()()'],['../structbracket.html#aa87f46d8c06444604c98138eb9a7627a',1,'bracket::operator()()'],['../structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7',1,'getsize::operator()()']]], + ['operator_3c',['operator<',['../struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_5.html b/libs/sort/doc/doxygen/html/search/functions_5.html new file mode 100644 index 000000000..e2f6e3130 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_5.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_5.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_5.js b/libs/sort/doc/doxygen/html/search/functions_5.js new file mode 100644 index 000000000..4be6e72c1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_5.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['reverse_5fstring_5fsort',['reverse_string_sort',['../namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp)'],['../namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_6.html b/libs/sort/doc/doxygen/html/search/functions_6.html new file mode 100644 index 000000000..342a07623 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_6.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_6.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_6.js b/libs/sort/doc/doxygen/html/search/functions_6.js new file mode 100644 index 000000000..4b5c9207c --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_6.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['sort_5floop',['sort_loop',['../parallelint_8cpp.html#acbd0dadb301334e73befdafddd98b044',1,'parallelint.cpp']]], + ['spreadsort',['spreadsort',['../namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)']]], + ['string_5fsort',['string_sort',['../namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length)'],['../namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_7.html b/libs/sort/doc/doxygen/html/search/functions_7.html new file mode 100644 index 000000000..04db8a64b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_7.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_7.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_7.js b/libs/sort/doc/doxygen/html/search/functions_7.js new file mode 100644 index 000000000..ed0c596bb --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_7.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['reverse_5fstring_5fsort',['reverse_string_sort',['../namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp)'],['../namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b',1,'boost::sort::reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]], + ['reverse_5fstring_5fsort_5frec',['reverse_string_sort_rec',['../namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3',1,'boost::sort::detail::reverse_string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)'],['../namespaceboost_1_1sort_1_1detail.html#ab71cd7c25eada649fa1aff16fb3549f6',1,'boost::sort::detail::reverse_string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)']]], + ['rough_5flog_5f2_5fsize',['rough_log_2_size',['../namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac',1,'boost::sort::detail']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_8.html b/libs/sort/doc/doxygen/html/search/functions_8.html new file mode 100644 index 000000000..6bab2c81c --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_8.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_8.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_8.js b/libs/sort/doc/doxygen/html/search/functions_8.js new file mode 100644 index 000000000..2f1739972 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_8.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['size_5fbins',['size_bins',['../namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b',1,'boost::sort::detail']]], + ['spreadsort',['spreadsort',['../namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa',1,'boost::sort::spreadsort(RandomAccessIter first, RandomAccessIter last)']]], + ['string_5fsort',['string_sort',['../namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)'],['../namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last)'],['../namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length)'],['../namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2',1,'boost::sort::string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)']]], + ['string_5fsort_5frec',['string_sort_rec',['../namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba',1,'boost::sort::detail::string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)'],['../namespaceboost_1_1sort_1_1detail.html#af825e4484173e0b886d0b24f66ae4a64',1,'boost::sort::detail::string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length)'],['../namespaceboost_1_1sort_1_1detail.html#a49ccfc022cfef8a14bbbbeccd36d78ec',1,'boost::sort::detail::string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes, Get_char getchar, Get_length length, Compare comp)']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/functions_9.html b/libs/sort/doc/doxygen/html/search/functions_9.html new file mode 100644 index 000000000..e32df6375 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_9.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="functions_9.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/functions_9.js b/libs/sort/doc/doxygen/html/search/functions_9.js new file mode 100644 index 000000000..7afe9d856 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/functions_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['update_5foffset',['update_offset',['../namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01',1,'boost::sort::detail::update_offset(RandomAccessIter first, RandomAccessIter finish, size_t &char_offset)'],['../namespaceboost_1_1sort_1_1detail.html#a415ebdb0c9a5e9209bbfc7d2e576374c',1,'boost::sort::detail::update_offset(RandomAccessIter first, RandomAccessIter finish, size_t &char_offset, Get_char getchar, Get_length length)']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/mag_sel.png b/libs/sort/doc/doxygen/html/search/mag_sel.png Binary files differnew file mode 100644 index 000000000..81f6040a2 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/mag_sel.png diff --git a/libs/sort/doc/doxygen/html/search/namespaces_0.html b/libs/sort/doc/doxygen/html/search/namespaces_0.html new file mode 100644 index 000000000..6d5853b61 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/namespaces_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="namespaces_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/namespaces_0.js b/libs/sort/doc/doxygen/html/search/namespaces_0.js new file mode 100644 index 000000000..5522984b9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/namespaces_0.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['boost',['boost',['../namespaceboost.html',1,'']]], + ['sort',['sort',['../namespaceboost_1_1sort.html',1,'boost']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/nomatches.html b/libs/sort/doc/doxygen/html/search/nomatches.html new file mode 100644 index 000000000..b1ded27e9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/nomatches.html @@ -0,0 +1,12 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="NoMatches">No Matches</div> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/search.css b/libs/sort/doc/doxygen/html/search/search.css new file mode 100644 index 000000000..4d7612ff6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/search.css @@ -0,0 +1,271 @@ +/*---------------- Search Box */ + +#FSearchBox { + float: left; +} + +#MSearchBox { + white-space : nowrap; + position: absolute; + float: none; + display: inline; + margin-top: 8px; + right: 0px; + width: 170px; + z-index: 102; + background-color: white; +} + +#MSearchBox .left +{ + display:block; + position:absolute; + left:10px; + width:20px; + height:19px; + background:url('search_l.png') no-repeat; + background-position:right; +} + +#MSearchSelect { + display:block; + position:absolute; + width:20px; + height:19px; +} + +.left #MSearchSelect { + left:4px; +} + +.right #MSearchSelect { + right:5px; +} + +#MSearchField { + display:block; + position:absolute; + height:19px; + background:url('search_m.png') repeat-x; + border:none; + width:111px; + margin-left:20px; + padding-left:4px; + color: #909090; + outline: none; + font: 9pt Arial, Verdana, sans-serif; +} + +#FSearchBox #MSearchField { + margin-left:15px; +} + +#MSearchBox .right { + display:block; + position:absolute; + right:10px; + top:0px; + width:20px; + height:19px; + background:url('search_r.png') no-repeat; + background-position:left; +} + +#MSearchClose { + display: none; + position: absolute; + top: 4px; + background : none; + border: none; + margin: 0px 4px 0px 0px; + padding: 0px 0px; + outline: none; +} + +.left #MSearchClose { + left: 6px; +} + +.right #MSearchClose { + right: 2px; +} + +.MSearchBoxActive #MSearchField { + color: #000000; +} + +/*---------------- Search filter selection */ + +#MSearchSelectWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #90A5CE; + background-color: #F9FAFC; + z-index: 1; + padding-top: 4px; + padding-bottom: 4px; + -moz-border-radius: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +.SelectItem { + font: 8pt Arial, Verdana, sans-serif; + padding-left: 2px; + padding-right: 12px; + border: 0px; +} + +span.SelectionMark { + margin-right: 4px; + font-family: monospace; + outline-style: none; + text-decoration: none; +} + +a.SelectItem { + display: block; + outline-style: none; + color: #000000; + text-decoration: none; + padding-left: 6px; + padding-right: 12px; +} + +a.SelectItem:focus, +a.SelectItem:active { + color: #000000; + outline-style: none; + text-decoration: none; +} + +a.SelectItem:hover { + color: #FFFFFF; + background-color: #3D578C; + outline-style: none; + text-decoration: none; + cursor: pointer; + display: block; +} + +/*---------------- Search results window */ + +iframe#MSearchResults { + width: 60ex; + height: 15em; +} + +#MSearchResultsWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #000; + background-color: #EEF1F7; +} + +/* ----------------------------------- */ + + +#SRIndex { + clear:both; + padding-bottom: 15px; +} + +.SREntry { + font-size: 10pt; + padding-left: 1ex; +} + +.SRPage .SREntry { + font-size: 8pt; + padding: 1px 5px; +} + +body.SRPage { + margin: 5px 2px; +} + +.SRChildren { + padding-left: 3ex; padding-bottom: .5em +} + +.SRPage .SRChildren { + display: none; +} + +.SRSymbol { + font-weight: bold; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRScope { + display: block; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRSymbol:focus, a.SRSymbol:active, +a.SRScope:focus, a.SRScope:active { + text-decoration: underline; +} + +span.SRScope { + padding-left: 4px; +} + +.SRPage .SRStatus { + padding: 2px 5px; + font-size: 8pt; + font-style: italic; +} + +.SRResult { + display: none; +} + +DIV.searchresults { + margin-left: 10px; + margin-right: 10px; +} + +/*---------------- External search page results */ + +.searchresult { + background-color: #F0F3F8; +} + +.pages b { + color: white; + padding: 5px 5px 3px 5px; + background-image: url("../tab_a.png"); + background-repeat: repeat-x; + text-shadow: 0 1px 1px #000000; +} + +.pages { + line-height: 17px; + margin-left: 4px; + text-decoration: none; +} + +.hl { + font-weight: bold; +} + +#searchresults { + margin-bottom: 20px; +} + +.searchpages { + margin-top: 10px; +} + diff --git a/libs/sort/doc/doxygen/html/search/search.js b/libs/sort/doc/doxygen/html/search/search.js new file mode 100644 index 000000000..dedce3bf0 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/search.js @@ -0,0 +1,791 @@ +function convertToId(search) +{ + var result = ''; + for (i=0;i<search.length;i++) + { + var c = search.charAt(i); + var cn = c.charCodeAt(0); + if (c.match(/[a-z0-9\u0080-\uFFFF]/)) + { + result+=c; + } + else if (cn<16) + { + result+="_0"+cn.toString(16); + } + else + { + result+="_"+cn.toString(16); + } + } + return result; +} + +function getXPos(item) +{ + var x = 0; + if (item.offsetWidth) + { + while (item && item!=document.body) + { + x += item.offsetLeft; + item = item.offsetParent; + } + } + return x; +} + +function getYPos(item) +{ + var y = 0; + if (item.offsetWidth) + { + while (item && item!=document.body) + { + y += item.offsetTop; + item = item.offsetParent; + } + } + return y; +} + +/* A class handling everything associated with the search panel. + + Parameters: + name - The name of the global variable that will be + storing this instance. Is needed to be able to set timeouts. + resultPath - path to use for external files +*/ +function SearchBox(name, resultsPath, inFrame, label) +{ + if (!name || !resultsPath) { alert("Missing parameters to SearchBox."); } + + // ---------- Instance variables + this.name = name; + this.resultsPath = resultsPath; + this.keyTimeout = 0; + this.keyTimeoutLength = 500; + this.closeSelectionTimeout = 300; + this.lastSearchValue = ""; + this.lastResultsPage = ""; + this.hideTimeout = 0; + this.searchIndex = 0; + this.searchActive = false; + this.insideFrame = inFrame; + this.searchLabel = label; + + // ----------- DOM Elements + + this.DOMSearchField = function() + { return document.getElementById("MSearchField"); } + + this.DOMSearchSelect = function() + { return document.getElementById("MSearchSelect"); } + + this.DOMSearchSelectWindow = function() + { return document.getElementById("MSearchSelectWindow"); } + + this.DOMPopupSearchResults = function() + { return document.getElementById("MSearchResults"); } + + this.DOMPopupSearchResultsWindow = function() + { return document.getElementById("MSearchResultsWindow"); } + + this.DOMSearchClose = function() + { return document.getElementById("MSearchClose"); } + + this.DOMSearchBox = function() + { return document.getElementById("MSearchBox"); } + + // ------------ Event Handlers + + // Called when focus is added or removed from the search field. + this.OnSearchFieldFocus = function(isActive) + { + this.Activate(isActive); + } + + this.OnSearchSelectShow = function() + { + var searchSelectWindow = this.DOMSearchSelectWindow(); + var searchField = this.DOMSearchSelect(); + + if (this.insideFrame) + { + var left = getXPos(searchField); + var top = getYPos(searchField); + left += searchField.offsetWidth + 6; + top += searchField.offsetHeight; + + // show search selection popup + searchSelectWindow.style.display='block'; + left -= searchSelectWindow.offsetWidth; + searchSelectWindow.style.left = left + 'px'; + searchSelectWindow.style.top = top + 'px'; + } + else + { + var left = getXPos(searchField); + var top = getYPos(searchField); + top += searchField.offsetHeight; + + // show search selection popup + searchSelectWindow.style.display='block'; + searchSelectWindow.style.left = left + 'px'; + searchSelectWindow.style.top = top + 'px'; + } + + // stop selection hide timer + if (this.hideTimeout) + { + clearTimeout(this.hideTimeout); + this.hideTimeout=0; + } + return false; // to avoid "image drag" default event + } + + this.OnSearchSelectHide = function() + { + this.hideTimeout = setTimeout(this.name +".CloseSelectionWindow()", + this.closeSelectionTimeout); + } + + // Called when the content of the search field is changed. + this.OnSearchFieldChange = function(evt) + { + if (this.keyTimeout) // kill running timer + { + clearTimeout(this.keyTimeout); + this.keyTimeout = 0; + } + + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==40 || e.keyCode==13) + { + if (e.shiftKey==1) + { + this.OnSearchSelectShow(); + var win=this.DOMSearchSelectWindow(); + for (i=0;i<win.childNodes.length;i++) + { + var child = win.childNodes[i]; // get span within a + if (child.className=='SelectItem') + { + child.focus(); + return; + } + } + return; + } + else if (window.frames.MSearchResults.searchResults) + { + var elem = window.frames.MSearchResults.searchResults.NavNext(0); + if (elem) elem.focus(); + } + } + else if (e.keyCode==27) // Escape out of the search field + { + this.DOMSearchField().blur(); + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.lastSearchValue = ''; + this.Activate(false); + return; + } + + // strip whitespaces + var searchValue = this.DOMSearchField().value.replace(/ +/g, ""); + + if (searchValue != this.lastSearchValue) // search value has changed + { + if (searchValue != "") // non-empty search + { + // set timer for search update + this.keyTimeout = setTimeout(this.name + '.Search()', + this.keyTimeoutLength); + } + else // empty search field + { + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.lastSearchValue = ''; + } + } + } + + this.SelectItemCount = function(id) + { + var count=0; + var win=this.DOMSearchSelectWindow(); + for (i=0;i<win.childNodes.length;i++) + { + var child = win.childNodes[i]; // get span within a + if (child.className=='SelectItem') + { + count++; + } + } + return count; + } + + this.SelectItemSet = function(id) + { + var i,j=0; + var win=this.DOMSearchSelectWindow(); + for (i=0;i<win.childNodes.length;i++) + { + var child = win.childNodes[i]; // get span within a + if (child.className=='SelectItem') + { + var node = child.firstChild; + if (j==id) + { + node.innerHTML='•'; + } + else + { + node.innerHTML=' '; + } + j++; + } + } + } + + // Called when an search filter selection is made. + // set item with index id as the active item + this.OnSelectItem = function(id) + { + this.searchIndex = id; + this.SelectItemSet(id); + var searchValue = this.DOMSearchField().value.replace(/ +/g, ""); + if (searchValue!="" && this.searchActive) // something was found -> do a search + { + this.Search(); + } + } + + this.OnSearchSelectKey = function(evt) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==40 && this.searchIndex<this.SelectItemCount()) // Down + { + this.searchIndex++; + this.OnSelectItem(this.searchIndex); + } + else if (e.keyCode==38 && this.searchIndex>0) // Up + { + this.searchIndex--; + this.OnSelectItem(this.searchIndex); + } + else if (e.keyCode==13 || e.keyCode==27) + { + this.OnSelectItem(this.searchIndex); + this.CloseSelectionWindow(); + this.DOMSearchField().focus(); + } + return false; + } + + // --------- Actions + + // Closes the results window. + this.CloseResultsWindow = function() + { + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.Activate(false); + } + + this.CloseSelectionWindow = function() + { + this.DOMSearchSelectWindow().style.display = 'none'; + } + + // Performs a search. + this.Search = function() + { + this.keyTimeout = 0; + + // strip leading whitespace + var searchValue = this.DOMSearchField().value.replace(/^ +/, ""); + + var code = searchValue.toLowerCase().charCodeAt(0); + var idxChar = searchValue.substr(0, 1).toLowerCase(); + if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair + { + idxChar = searchValue.substr(0, 2); + } + + var resultsPage; + var resultsPageWithSearch; + var hasResultsPage; + + var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar); + if (idx!=-1) + { + var hexCode=idx.toString(16); + resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html'; + resultsPageWithSearch = resultsPage+'?'+escape(searchValue); + hasResultsPage = true; + } + else // nothing available for this search term + { + resultsPage = this.resultsPath + '/nomatches.html'; + resultsPageWithSearch = resultsPage; + hasResultsPage = false; + } + + window.frames.MSearchResults.location = resultsPageWithSearch; + var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); + + if (domPopupSearchResultsWindow.style.display!='block') + { + var domSearchBox = this.DOMSearchBox(); + this.DOMSearchClose().style.display = 'inline'; + if (this.insideFrame) + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + domPopupSearchResultsWindow.style.position = 'relative'; + domPopupSearchResultsWindow.style.display = 'block'; + var width = document.body.clientWidth - 8; // the -8 is for IE :-( + domPopupSearchResultsWindow.style.width = width + 'px'; + domPopupSearchResults.style.width = width + 'px'; + } + else + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth; + var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1; + domPopupSearchResultsWindow.style.display = 'block'; + left -= domPopupSearchResults.offsetWidth; + domPopupSearchResultsWindow.style.top = top + 'px'; + domPopupSearchResultsWindow.style.left = left + 'px'; + } + } + + this.lastSearchValue = searchValue; + this.lastResultsPage = resultsPage; + } + + // -------- Activation Functions + + // Activates or deactivates the search panel, resetting things to + // their default values if necessary. + this.Activate = function(isActive) + { + if (isActive || // open it + this.DOMPopupSearchResultsWindow().style.display == 'block' + ) + { + this.DOMSearchBox().className = 'MSearchBoxActive'; + + var searchField = this.DOMSearchField(); + + if (searchField.value == this.searchLabel) // clear "Search" term upon entry + { + searchField.value = ''; + this.searchActive = true; + } + } + else if (!isActive) // directly remove the panel + { + this.DOMSearchBox().className = 'MSearchBoxInactive'; + this.DOMSearchField().value = this.searchLabel; + this.searchActive = false; + this.lastSearchValue = '' + this.lastResultsPage = ''; + } + } +} + +// ----------------------------------------------------------------------- + +// The class that handles everything on the search results page. +function SearchResults(name) +{ + // The number of matches from the last run of <Search()>. + this.lastMatchCount = 0; + this.lastKey = 0; + this.repeatOn = false; + + // Toggles the visibility of the passed element ID. + this.FindChildElement = function(id) + { + var parentElement = document.getElementById(id); + var element = parentElement.firstChild; + + while (element && element!=parentElement) + { + if (element.nodeName == 'DIV' && element.className == 'SRChildren') + { + return element; + } + + if (element.nodeName == 'DIV' && element.hasChildNodes()) + { + element = element.firstChild; + } + else if (element.nextSibling) + { + element = element.nextSibling; + } + else + { + do + { + element = element.parentNode; + } + while (element && element!=parentElement && !element.nextSibling); + + if (element && element!=parentElement) + { + element = element.nextSibling; + } + } + } + } + + this.Toggle = function(id) + { + var element = this.FindChildElement(id); + if (element) + { + if (element.style.display == 'block') + { + element.style.display = 'none'; + } + else + { + element.style.display = 'block'; + } + } + } + + // Searches for the passed string. If there is no parameter, + // it takes it from the URL query. + // + // Always returns true, since other documents may try to call it + // and that may or may not be possible. + this.Search = function(search) + { + if (!search) // get search word from URL + { + search = window.location.search; + search = search.substring(1); // Remove the leading '?' + search = unescape(search); + } + + search = search.replace(/^ +/, ""); // strip leading spaces + search = search.replace(/ +$/, ""); // strip trailing spaces + search = search.toLowerCase(); + search = convertToId(search); + + var resultRows = document.getElementsByTagName("div"); + var matches = 0; + + var i = 0; + while (i < resultRows.length) + { + var row = resultRows.item(i); + if (row.className == "SRResult") + { + var rowMatchName = row.id.toLowerCase(); + rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + + if (search.length<=rowMatchName.length && + rowMatchName.substr(0, search.length)==search) + { + row.style.display = 'block'; + matches++; + } + else + { + row.style.display = 'none'; + } + } + i++; + } + document.getElementById("Searching").style.display='none'; + if (matches == 0) // no results + { + document.getElementById("NoMatches").style.display='block'; + } + else // at least one result + { + document.getElementById("NoMatches").style.display='none'; + } + this.lastMatchCount = matches; + return true; + } + + // return the first item with index index or higher that is visible + this.NavNext = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index++; + } + return focusItem; + } + + this.NavPrev = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index--; + } + return focusItem; + } + + this.ProcessKeys = function(e) + { + if (e.type == "keydown") + { + this.repeatOn = false; + this.lastKey = e.keyCode; + } + else if (e.type == "keypress") + { + if (!this.repeatOn) + { + if (this.lastKey) this.repeatOn = true; + return false; // ignore first keypress after keydown + } + } + else if (e.type == "keyup") + { + this.lastKey = 0; + this.repeatOn = false; + } + return this.lastKey!=0; + } + + this.Nav = function(evt,itemIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + var newIndex = itemIndex-1; + var focusItem = this.NavPrev(newIndex); + if (focusItem) + { + var child = this.FindChildElement(focusItem.parentNode.parentNode.id); + if (child && child.style.display == 'block') // children visible + { + var n=0; + var tmpElem; + while (1) // search for last child + { + tmpElem = document.getElementById('Item'+newIndex+'_c'+n); + if (tmpElem) + { + focusItem = tmpElem; + } + else // found it! + { + break; + } + n++; + } + } + } + if (focusItem) + { + focusItem.focus(); + } + else // return focus to search field + { + parent.document.getElementById("MSearchField").focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = itemIndex+1; + var focusItem; + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem && elem.style.display == 'block') // children visible + { + focusItem = document.getElementById('Item'+itemIndex+'_c0'); + } + if (!focusItem) focusItem = this.NavNext(newIndex); + if (focusItem) focusItem.focus(); + } + else if (this.lastKey==39) // Right + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'block'; + } + else if (this.lastKey==37) // Left + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'none'; + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } + + this.NavChild = function(evt,itemIndex,childIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + if (childIndex>0) + { + var newIndex = childIndex-1; + document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); + } + else // already at first child, jump to parent + { + document.getElementById('Item'+itemIndex).focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = childIndex+1; + var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); + if (!elem) // last child, jump to parent next parent + { + elem = this.NavNext(itemIndex+1); + } + if (elem) + { + elem.focus(); + } + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } +} + +function setKeyActions(elem,action) +{ + elem.setAttribute('onkeydown',action); + elem.setAttribute('onkeypress',action); + elem.setAttribute('onkeyup',action); +} + +function setClassAttr(elem,attr) +{ + elem.setAttribute('class',attr); + elem.setAttribute('className',attr); +} + +function createResults() +{ + var results = document.getElementById("SRResults"); + for (var e=0; e<searchData.length; e++) + { + var id = searchData[e][0]; + var srResult = document.createElement('div'); + srResult.setAttribute('id','SR_'+id); + setClassAttr(srResult,'SRResult'); + var srEntry = document.createElement('div'); + setClassAttr(srEntry,'SREntry'); + var srLink = document.createElement('a'); + srLink.setAttribute('id','Item'+e); + setKeyActions(srLink,'return searchResults.Nav(event,'+e+')'); + setClassAttr(srLink,'SRSymbol'); + srLink.innerHTML = searchData[e][1][0]; + srEntry.appendChild(srLink); + if (searchData[e][1].length==2) // single result + { + srLink.setAttribute('href',searchData[e][1][1][0]); + if (searchData[e][1][1][1]) + { + srLink.setAttribute('target','_parent'); + } + var srScope = document.createElement('span'); + setClassAttr(srScope,'SRScope'); + srScope.innerHTML = searchData[e][1][1][2]; + srEntry.appendChild(srScope); + } + else // multiple results + { + srLink.setAttribute('href','javascript:searchResults.Toggle("SR_'+id+'")'); + var srChildren = document.createElement('div'); + setClassAttr(srChildren,'SRChildren'); + for (var c=0; c<searchData[e][1].length-1; c++) + { + var srChild = document.createElement('a'); + srChild.setAttribute('id','Item'+e+'_c'+c); + setKeyActions(srChild,'return searchResults.NavChild(event,'+e+','+c+')'); + setClassAttr(srChild,'SRScope'); + srChild.setAttribute('href',searchData[e][1][c+1][0]); + if (searchData[e][1][c+1][1]) + { + srChild.setAttribute('target','_parent'); + } + srChild.innerHTML = searchData[e][1][c+1][2]; + srChildren.appendChild(srChild); + } + srEntry.appendChild(srChildren); + } + srResult.appendChild(srEntry); + results.appendChild(srResult); + } +} + +function init_search() +{ + var results = document.getElementById("MSearchSelectWindow"); + for (var key in indexSectionLabels) + { + var link = document.createElement('a'); + link.setAttribute('class','SelectItem'); + link.setAttribute('onclick','searchBox.OnSelectItem('+key+')'); + link.href='javascript:void(0)'; + link.innerHTML='<span class="SelectionMark"> </span>'+indexSectionLabels[key]; + results.appendChild(link); + } + searchBox.OnSelectItem(0); +} + diff --git a/libs/sort/doc/doxygen/html/search/search_l.png b/libs/sort/doc/doxygen/html/search/search_l.png Binary files differnew file mode 100644 index 000000000..c872f4da4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/search_l.png diff --git a/libs/sort/doc/doxygen/html/search/search_m.png b/libs/sort/doc/doxygen/html/search/search_m.png Binary files differnew file mode 100644 index 000000000..b429a16ba --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/search_m.png diff --git a/libs/sort/doc/doxygen/html/search/search_r.png b/libs/sort/doc/doxygen/html/search/search_r.png Binary files differnew file mode 100644 index 000000000..97ee8b439 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/search_r.png diff --git a/libs/sort/doc/doxygen/html/search/searchdata.js b/libs/sort/doc/doxygen/html/search/searchdata.js new file mode 100644 index 000000000..01504e377 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/searchdata.js @@ -0,0 +1,33 @@ +var indexSectionsWithContent = +{ + 0: "abcdfgiklmnoprstw", + 1: "bdglnr", + 2: "b", + 3: "abcdfgikmprsw", + 4: "fgimors", + 5: "abdfklmnrt", + 6: "acdk" +}; + +var indexSectionNames = +{ + 0: "all", + 1: "classes", + 2: "namespaces", + 3: "files", + 4: "functions", + 5: "variables", + 6: "defines" +}; + +var indexSectionLabels = +{ + 0: "All", + 1: "Classes", + 2: "Namespaces", + 3: "Files", + 4: "Functions", + 5: "Variables", + 6: "Macros" +}; + diff --git a/libs/sort/doc/doxygen/html/search/variables_0.html b/libs/sort/doc/doxygen/html/search/variables_0.html new file mode 100644 index 000000000..2837a5748 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_0.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_0.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_0.js b/libs/sort/doc/doxygen/html/search/variables_0.js new file mode 100644 index 000000000..581f148a8 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['a',['a',['../struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_1.html b/libs/sort/doc/doxygen/html/search/variables_1.html new file mode 100644 index 000000000..6a866b1b4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_1.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_1.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_1.js b/libs/sort/doc/doxygen/html/search/variables_1.js new file mode 100644 index 000000000..6ab8ee8f5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_1.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['birth',['birth',['../struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c',1,'DATA_TYPE']]], + ['bit_5fshift',['bit_shift',['../alrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de',1,'bit_shift(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a50fb2847ba87c9bd84e0c5c8a951f9de',1,'bit_shift(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_2.html b/libs/sort/doc/doxygen/html/search/variables_2.html new file mode 100644 index 000000000..3115f99ef --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_2.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_2.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_2.js b/libs/sort/doc/doxygen/html/search/variables_2.js new file mode 100644 index 000000000..18ceea4e3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['data',['data',['../struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_3.html b/libs/sort/doc/doxygen/html/search/variables_3.html new file mode 100644 index 000000000..b2941ee6e --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_3.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_3.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_3.js b/libs/sort/doc/doxygen/html/search/variables_3.js new file mode 100644 index 000000000..9ce08a222 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['first_5fname',['first_name',['../struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_4.html b/libs/sort/doc/doxygen/html/search/variables_4.html new file mode 100644 index 000000000..e14a4ffca --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_4.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_4.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_4.js b/libs/sort/doc/doxygen/html/search/variables_4.js new file mode 100644 index 000000000..594df81af --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['key',['key',['../struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae',1,'DATA_TYPE::key()'],['../struct_d_a_t_a___t_y_p_e.html#af18aa9620a8309d88c829d6af27824e3',1,'DATA_TYPE::key()']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_5.html b/libs/sort/doc/doxygen/html/search/variables_5.html new file mode 100644 index 000000000..ee6461cb3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_5.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_5.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_5.js b/libs/sort/doc/doxygen/html/search/variables_5.js new file mode 100644 index 000000000..e3bdcc641 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_5.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['last_5fname',['last_name',['../struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_6.html b/libs/sort/doc/doxygen/html/search/variables_6.html new file mode 100644 index 000000000..9b457a200 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_6.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_6.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_6.js b/libs/sort/doc/doxygen/html/search/variables_6.js new file mode 100644 index 000000000..27ec7dfad --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_6.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['max_5fcount',['max_count',['../alrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d',1,'max_count(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a4587b2f61869f9798cb12a8ebb37387d',1,'max_count(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_7.html b/libs/sort/doc/doxygen/html/search/variables_7.html new file mode 100644 index 000000000..aae170d5d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_7.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_7.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_7.js b/libs/sort/doc/doxygen/html/search/variables_7.js new file mode 100644 index 000000000..ec62da19d --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_7.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['net_5fworth',['net_worth',['../struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621',1,'DATA_TYPE']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_8.html b/libs/sort/doc/doxygen/html/search/variables_8.html new file mode 100644 index 000000000..7d96ca325 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_8.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_8.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_8.js b/libs/sort/doc/doxygen/html/search/variables_8.js new file mode 100644 index 000000000..807a1f407 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_8.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['radix_5fthreshold',['radix_threshold',['../alrbreaker_8cpp.html#afc30457e398e72300f20714123913b78',1,'radix_threshold(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#afc30457e398e72300f20714123913b78',1,'radix_threshold(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/search/variables_9.html b/libs/sort/doc/doxygen/html/search/variables_9.html new file mode 100644 index 000000000..29d109231 --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_9.html @@ -0,0 +1,26 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html><head><title></title> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<link rel="stylesheet" type="text/css" href="search.css"/> +<script type="text/javascript" src="variables_9.js"></script> +<script type="text/javascript" src="search.js"></script> +</head> +<body class="SRPage"> +<div id="SRIndex"> +<div class="SRStatus" id="Loading">Loading...</div> +<div id="SRResults"></div> +<script type="text/javascript"><!-- +createResults(); +--></script> +<div class="SRStatus" id="Searching">Searching...</div> +<div class="SRStatus" id="NoMatches">No Matches</div> +<script type="text/javascript"><!-- +document.getElementById("Loading").style.display="none"; +document.getElementById("NoMatches").style.display="none"; +var searchResults = new SearchResults("searchResults"); +searchResults.Search(); +--></script> +</div> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/search/variables_9.js b/libs/sort/doc/doxygen/html/search/variables_9.js new file mode 100644 index 000000000..32233d93b --- /dev/null +++ b/libs/sort/doc/doxygen/html/search/variables_9.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['top_5fsplits',['top_splits',['../alrbreaker_8cpp.html#a60c4ea1dd4d297e0d2e395375e0e716c',1,'alrbreaker.cpp']]], + ['typed_5fone',['typed_one',['../alrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa',1,'typed_one(): alrbreaker.cpp'],['../binaryalrbreaker_8cpp.html#a8b984673f3b3e097d3f37508923452fa',1,'typed_one(): binaryalrbreaker.cpp']]] +]; diff --git a/libs/sort/doc/doxygen/html/shiftfloatsample_8cpp.html b/libs/sort/doc/doxygen/html/shiftfloatsample_8cpp.html new file mode 100644 index 000000000..0fa863e71 --- /dev/null +++ b/libs/sort/doc/doxygen/html/shiftfloatsample_8cpp.html @@ -0,0 +1,183 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/shiftfloatsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">shiftfloatsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <string></code><br /> +<code>#include <fstream></code><br /> +<code>#include <iostream></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html">rightshift</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="shiftfloatsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   float</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a38779bfd63dd113c9f7602664546a58c"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="shiftfloatsample_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>   int</td></tr> +<tr class="separator:a38779bfd63dd113c9f7602664546a58c"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="shiftfloatsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="a38779bfd63dd113c9f7602664546a58c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define CAST_TYPE   int</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   float</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/sort_8hpp.html b/libs/sort/doc/doxygen/html/sort_8hpp.html new file mode 100644 index 000000000..56382c1d4 --- /dev/null +++ b/libs/sort/doc/doxygen/html/sort_8hpp.html @@ -0,0 +1,103 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="spreadsort_8hpp_source.html">boost/sort/spreadsort/spreadsort.hpp</a>></code><br /> +</div> +<p><a href="sort_8hpp_source.html">Go to the source code of this file.</a></p> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/sort_8hpp_source.html b/libs/sort/doc/doxygen/html/sort_8hpp_source.html new file mode 100644 index 000000000..bd81ce7bf --- /dev/null +++ b/libs/sort/doc/doxygen/html/sort_8hpp_source.html @@ -0,0 +1,120 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// The Boost Sort library cumulative header.</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2014</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort/ for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#ifndef BOOST_SORT_HPP</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#define BOOST_SORT_HPP</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Cumulative include for the Boost Sort library</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <<a class="code" href="spreadsort_8hpp.html">boost/sort/spreadsort/spreadsort.hpp</a>></span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="spreadsort_8hpp_html"><div class="ttname"><a href="spreadsort_8hpp.html">spreadsort.hpp</a></div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/splitbar.png b/libs/sort/doc/doxygen/html/splitbar.png Binary files differnew file mode 100644 index 000000000..fe895f2c5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/splitbar.png diff --git a/libs/sort/doc/doxygen/html/spreadsort_8hpp.html b/libs/sort/doc/doxygen/html/spreadsort_8hpp.html new file mode 100644 index 000000000..1af519791 --- /dev/null +++ b/libs/sort/doc/doxygen/html/spreadsort_8hpp.html @@ -0,0 +1,137 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/spreadsort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">spreadsort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <string></code><br /> +<code>#include <limits></code><br /> +<code>#include <boost/type_traits.hpp></code><br /> +<code>#include <<a class="el" href="integer__sort_8hpp_source.html">boost/sort/spreadsort/integer_sort.hpp</a>></code><br /> +<code>#include <<a class="el" href="float__sort_8hpp_source.html">boost/sort/spreadsort/float_sort.hpp</a>></code><br /> +<code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +</div> +<p><a href="spreadsort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_integer, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">boost::sort::spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting integer-type elements so call to <code>integer_sort</code>. <a href="#a4bc25fdacd4c948f631f08a3f9aa38eb">More...</a><br /></td></tr> +<tr class="separator:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< !std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_integer &&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272">boost::sort::spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a94a736da091bd5d3b525818399f1b272"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting float element type so call to <code>float_sort</code>. <a href="#a94a736da091bd5d3b525818399f1b272">More...</a><br /></td></tr> +<tr class="separator:a94a736da091bd5d3b525818399f1b272"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c< is_same< typename std::iterator_traits< RandomAccessIter >::value_type, typename std::string >::value||is_same< typename std::iterator_traits< RandomAccessIter >::value_type, typename std::wstring >::value, void >::type </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa">boost::sort::spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:aafdea66d9b4a7faef5604b3079b525fa"><td class="mdescLeft"> </td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting string element type so call to <code>string_sort</code> for <code>std::strings</code> and <code>std::wstrings</code>. <a href="#aafdea66d9b4a7faef5604b3079b525fa">More...</a><br /></td></tr> +<tr class="separator:aafdea66d9b4a7faef5604b3079b525fa"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/spreadsort_8hpp_source.html b/libs/sort/doc/doxygen/html/spreadsort_8hpp_source.html new file mode 100644 index 000000000..0c4d862d3 --- /dev/null +++ b/libs/sort/doc/doxygen/html/spreadsort_8hpp_source.html @@ -0,0 +1,230 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/spreadsort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">spreadsort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="spreadsort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Templated generic hybrid sorting</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2009.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort/ for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">float_mem_cast fix provided by:</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Scott McMurray</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_HPP</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_HPP</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <string></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/type_traits.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="integer__sort_8hpp.html">boost/sort/spreadsort/integer_sort.hpp</a>></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <<a class="code" href="float__sort_8hpp.html">boost/sort/spreadsort/float_sort.hpp</a>></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <<a class="code" href="string__sort_8hpp.html">boost/sort/spreadsort/string_sort.hpp</a>></span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"></span></div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">/*! Namespace for spreadsort sort variants for different data types.</span></div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">\note Use hyperlinks (coloured) to get detailed information about functions.</span></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> \brief Generic @c spreadsort variant detecting integer-type elements so call to @c integer_sort.</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> \details If the data type provided is an integer, @c integer_sort is used.</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> \note Sorting other data types requires picking between @c integer_sort, @c float_sort and @c string_sort directly,</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> as @c spreadsort won't accept types that don't have the appropriate @c type_traits.</span></div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"></span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< std::numeric_limits<</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type >::is_integer,</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb"> 57</a></span>  <a class="code" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(first, last);</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"></span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> \brief Generic @c spreadsort variant detecting float element type so call to @c float_sort.</span></div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> \details If the data type provided is a float or castable-float, @c float_sort is used.</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> \note Sorting other data types requires picking between @c integer_sort, @c float_sort and @c string_sort directly,</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> as @c spreadsort won't accept types that don't have the appropriate @c type_traits.</span></div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"></span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span></div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< !std::numeric_limits<</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type >::is_integer</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  && std::numeric_limits<</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type >::is_iec559,</div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272"> 86</a></span>  <a class="code" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  {</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a>(first, last);</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"></span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> /*!</span></div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> \brief Generic @c spreadsort variant detecting string element type so call to @c string_sort for @c std::strings and @c std::wstrings.</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> \details If the data type provided is a string or wstring, @c string_sort is used.</span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> \note Sorting other data types requires picking between @c integer_sort, @c float_sort and @c string_sort directly,</span></div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> as @c spreadsort won't accept types that don't have the appropriate @c type_traits.</span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"></span></div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"></span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> */</span></div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c<</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  is_same<typename std::iterator_traits<RandomAccessIter>::value_type,</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typename</span> std::string>::value ||</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  is_same<typename std::iterator_traits<RandomAccessIter>::value_type,</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typename</span> std::wstring>::value, <span class="keywordtype">void</span> >::type</div> +<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa"> 115</a></span>  <a class="code" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  {</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(first, last);</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> } <span class="comment">// namespace sort</span></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> } <span class="comment">// namespace boost</span></div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_1_1sort_html_ae6ffbcf932699589fd2b93879f209013"><div class="ttname"><a href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort::integer_sort</a></div><div class="ttdeci">void integer_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">Integer sort algorithm using random access iterators. (All variants fall back to std::sort if the dat...</div><div class="ttdef"><b>Definition:</b> integer_sort.hpp:75</div></div> +<div class="ttc" id="integer__sort_8hpp_html"><div class="ttname"><a href="integer__sort_8hpp.html">integer_sort.hpp</a></div></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> float_sort.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a4bc25fdacd4c948f631f08a3f9aa38eb"><div class="ttname"><a href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">boost::sort::spreadsort</a></div><div class="ttdeci">boost::enable_if_c< std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_integer, void >::type spreadsort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">Generic spreadsort variant detecting integer-type elements so call to integer_sort. </div><div class="ttdef"><b>Definition:</b> spreadsort.hpp:57</div></div> +<div class="ttc" id="string__sort_8hpp_html"><div class="ttname"><a href="string__sort_8hpp.html">string_sort.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a950a2dbbe75f048a0b343dbf7c532dc0"><div class="ttname"><a href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort::string_sort</a></div><div class="ttdeci">void string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</div><div class="ttdoc">String sort algorithm using random access iterators, allowing character-type overloads. (All variants fall back to std::sort if the data size is too small, < detail::min_sort_size). </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:73</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_acbcfc139de18c5c35c0ff1744c56e211"><div class="ttname"><a href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">boost::sort::float_sort</a></div><div class="ttdeci">void float_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">float_sort with casting to the appropriate size. </div><div class="ttdef"><b>Definition:</b> float_sort.hpp:86</div></div> +<div class="ttc" id="float__sort_8hpp_html"><div class="ttname"><a href="float__sort_8hpp.html">float_sort.hpp</a></div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/spreadsort__common_8hpp.html b/libs/sort/doc/doxygen/html/spreadsort__common_8hpp.html new file mode 100644 index 000000000..ca2895341 --- /dev/null +++ b/libs/sort/doc/doxygen/html/spreadsort__common_8hpp.html @@ -0,0 +1,135 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/spreadsort_common.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">spreadsort_common.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <limits></code><br /> +<code>#include <functional></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/serialization/static_warning.hpp></code><br /> +<code>#include <<a class="el" href="constants_8hpp_source.html">boost/sort/spreadsort/detail/constants.hpp</a>></code><br /> +<code>#include <boost/cstdint.hpp></code><br /> +</div> +<p><a href="spreadsort__common_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort_1_1detail"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">boost::sort::detail</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a852a51cde62aa67347cb9b4a7350bbac"><td class="memTemplParams" colspan="2">template<typename T > </td></tr> +<tr class="memitem:a852a51cde62aa67347cb9b4a7350bbac"><td class="memTemplItemLeft" align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a> (const T &input)</td></tr> +<tr class="separator:a852a51cde62aa67347cb9b4a7350bbac"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memTemplParams" colspan="2">template<unsigned log_mean_bin_size, unsigned log_min_split_count, unsigned log_finishing_count> </td></tr> +<tr class="memitem:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memTemplItemLeft" align="right" valign="top">size_t </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a> (unsigned log_range)</td></tr> +<tr class="separator:a4ba5c57512d16f300c08b7a6b4e6ff23"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memTemplItemLeft" align="right" valign="top">RandomAccessIter * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a> (size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</td></tr> +<tr class="separator:ad5b7d31fba809eae5d17f5c2fb0a385b"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/spreadsort__common_8hpp_source.html b/libs/sort/doc/doxygen/html/spreadsort__common_8hpp_source.html new file mode 100644 index 000000000..0b4068ac9 --- /dev/null +++ b/libs/sort/doc/doxygen/html/spreadsort__common_8hpp_source.html @@ -0,0 +1,228 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/spreadsort_common.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">spreadsort_common.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="spreadsort__common_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Contains get_min_count, the core optimization of the spreadsort algorithm.</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Also has other helper functions commonly useful across variants.</span></div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> </div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <functional></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keyword">namespace </span>detail {</div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">//This only works on unsigned data types</span></div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">inline</span> <span class="keywordtype">unsigned</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac"> 34</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(<span class="keyword">const</span> T& input)</div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  {</div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">unsigned</span> result = 0;</div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">//The && is necessary on some compilers to avoid infinite loops</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">//it doesn't significantly impair performance</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">while</span> ((input >> result) && (result < (8*<span class="keyword">sizeof</span>(T)))) ++result;</div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">return</span> result;</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">//Gets the minimum size to call spreadsort on to control worst-case runtime.</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">//This is called for a set of bins, instead of bin-by-bin, to minimize</span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">//runtime overhead.</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">//This could be replaced by a lookup table of sizeof(Div_type)*8 but this</span></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">//function is more general.</span></div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">template</span><<span class="keywordtype">unsigned</span> log_mean_bin_size,</div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23"> 51</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a>(<span class="keywordtype">unsigned</span> log_range)</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  {</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> typed_one = 1;</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> min_size = log_mean_bin_size + log_min_split_count;</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">//Assuring that constants have valid settings</span></div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  BOOST_STATIC_ASSERT(log_min_split_count <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> &&</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  log_min_split_count > 0);</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  BOOST_STATIC_ASSERT(<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> > 1 &&</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> < (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>)));</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  BOOST_STATIC_ASSERT(<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> >= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> &&</div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> < (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>)));</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  BOOST_STATIC_ASSERT(log_mean_bin_size >= 0);</div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  BOOST_STATIC_ASSERT(log_finishing_count >= 0);</div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">//if we can complete in one iteration, do so</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">//This first check allows the compiler to optimize never-executed code out</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (log_finishing_count < min_size) {</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (log_range <= min_size && log_range <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>) {</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">//Return no smaller than a certain minimum limit</span></div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (log_range <= log_finishing_count)</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> typed_one << log_finishing_count;</div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> typed_one << log_range;</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_iterations = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> - log_min_split_count;</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//sum of n to n + x = ((x + 1) * (n + (n + x)))/2 + log_mean_bin_size</span></div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_range =</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  ((base_iterations + 1) * (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> + log_min_split_count))/2</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  + log_mean_bin_size;</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">//Calculating the required number of iterations, and returning</span></div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">//1 << (iteration_count + min_size)</span></div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (log_range < base_range) {</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">unsigned</span> result = log_min_split_count;</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> offset = min_size; offset < log_range;</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  offset += ++result);</div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">//Preventing overflow; this situation shouldn't occur</span></div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> ((result + log_mean_bin_size) >= (8 * <span class="keyword">sizeof</span>(size_t)))</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> typed_one << ((8 * <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)) - 1);</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> typed_one << (result + log_mean_bin_size);</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">//A quick division can calculate the worst-case runtime for larger ranges</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">unsigned</span> remainder = log_range - base_range;</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//the max_splits - 1 is used to calculate the ceiling of the division</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">unsigned</span> bit_length = ((((<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> - 1) + remainder)/<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>)</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  + base_iterations + min_size);</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">//Preventing overflow; this situation shouldn't occur</span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (bit_length >= (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)))</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> typed_one << ((8 * <span class="keyword">sizeof</span>(size_t)) - 1);</div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">//n(log_range)/max_splits + C, optimizing worst-case performance</span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> typed_one << bit_length;</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Resizes the bin cache and bin sizes, and initializes each bin size to 0.</span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// This generates the memory overhead to use in radix sorting.</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">inline</span> RandomAccessIter *</div> +<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b"> 106</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(<span class="keywordtype">size_t</span> *bin_sizes, std::vector<RandomAccessIter></div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  &bin_cache, <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">unsigned</span> &cache_end, <span class="keywordtype">unsigned</span> bin_count)</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  {</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Clear the bin sizes</span></div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = 0; u < bin_count; u++)</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  bin_sizes[u] = 0;</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">//Make sure there is space for the bins</span></div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  cache_end = cache_offset + bin_count;</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (cache_end > bin_cache.size())</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  bin_cache.resize(cache_end);</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> &(bin_cache[cache_offset]);</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> }</div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> }</div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:22</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a4ba5c57512d16f300c08b7a6b4e6ff23"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a></div><div class="ttdeci">size_t get_min_count(unsigned log_range)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:51</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a852a51cde62aa67347cb9b4a7350bbac"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a></div><div class="ttdeci">unsigned rough_log_2_size(const T &input)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:34</div></div> +<div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> +<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/string__sort_8hpp.html b/libs/sort/doc/doxygen/html/string__sort_8hpp.html new file mode 100644 index 000000000..b14c49bd8 --- /dev/null +++ b/libs/sort/doc/doxygen/html/string__sort_8hpp.html @@ -0,0 +1,152 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/string_sort.hpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#namespaces">Namespaces</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">string_sort.hpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <cstring></code><br /> +<code>#include <limits></code><br /> +<code>#include <boost/static_assert.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/constants.hpp></code><br /> +<code>#include <boost/sort/spreadsort/detail/string_sort.hpp></code><br /> +</div> +<p><a href="string__sort_8hpp_source.html">Go to the source code of this file.</a></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> +Namespaces</h2></td></tr> +<tr class="memitem:namespaceboost"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost.html">boost</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:namespaceboost_1_1sort"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html">boost::sort</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Unsigned_char_type > </td></tr> +<tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort::string_sort</a> (RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</td></tr> +<tr class="memdesc:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads.<br /> + (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#a950a2dbbe75f048a0b343dbf7c532dc0">More...</a><br /></td></tr> +<tr class="separator:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplParams" colspan="2">template<class RandomAccessIter > </td></tr> +<tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f">boost::sort::string_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr> +<tr class="memdesc:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code>std::sort</code> if the data size is too small, < <code>detail::min_sort_size</code>). <a href="#a6acd5fc94521b0a5cb47dc491b6d862f">More...</a><br /></td></tr> +<tr class="separator:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Compare , class Unsigned_char_type > </td></tr> +<tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort::reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</td></tr> +<tr class="memdesc:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads. <a href="#a4ad4785d90f47d51ff1d2fac8c21bb48">More...</a><br /></td></tr> +<tr class="separator:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Compare > </td></tr> +<tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5">boost::sort::reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp)</td></tr> +<tr class="memdesc:afd4938835fd03aab9c42bd0653e5dbe5"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#afd4938835fd03aab9c42bd0653e5dbe5">More...</a><br /></td></tr> +<tr class="separator:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length > </td></tr> +<tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680">boost::sort::string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length)</td></tr> +<tr class="memdesc:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#a5143ec4f58cfe13eca2a0d6b6f6a6680">More...</a><br /></td></tr> +<tr class="separator:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">boost::sort::string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="memdesc:a82c4c0d7ba9873ecce7c674631dceae2"><td class="mdescLeft"> </td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. <a href="#a82c4c0d7ba9873ecce7c674631dceae2">More...</a><br /></td></tr> +<tr class="separator:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplParams" colspan="2">template<class RandomAccessIter , class Get_char , class Get_length , class Compare > </td></tr> +<tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">boost::sort::reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</td></tr> +<tr class="memdesc:a7940f1b2a7746c083a12a4e26077096b"><td class="mdescLeft"> </td><td class="mdescRight">Reverse String sort algorithm using random access iterators. <a href="#a7940f1b2a7746c083a12a4e26077096b">More...</a><br /></td></tr> +<tr class="separator:a7940f1b2a7746c083a12a4e26077096b"><td class="memSeparator" colspan="2"> </td></tr> +</table> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/string__sort_8hpp_source.html b/libs/sort/doc/doxygen/html/string__sort_8hpp_source.html new file mode 100644 index 000000000..449093f5a --- /dev/null +++ b/libs/sort/doc/doxygen/html/string__sort_8hpp_source.html @@ -0,0 +1,574 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/string_sort.hpp Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">string_sort.hpp</div> </div> +</div><!--header--> +<div class="contents"> +<a href="string__sort_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//Templated hybrid string_sort</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2009.</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort/ for library home page.</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef BOOST_STRING_SORT_HPP</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define BOOST_STRING_SORT_HPP</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <cstring></span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <limits></span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/constants.hpp></span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/sort/spreadsort/detail/string_sort.hpp></span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span>sort {</div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"></span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, allowing character-type overloads.\n</span></div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"></span></div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> \details @c string_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">\par</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"><a href="../../doc/graph/windows_string_sort.htm"> windows_string_sort</a>\n</span></div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"><a href="../../doc/graph/osx_string_sort.htm"> osx_string_sort</a></span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"></span></div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> \tparam Unsigned_char_type Unsigned character type used for string.</span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> \param[in] unused Unused ???</span></div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"></span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"></span></div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"></span></div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"></span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span></div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0"> 73</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  Unsigned_char_type unused)</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  {</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">//Don't sort if it's too small to optimize</span></div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::sort(first, last);</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">detail::string_sort</a>(first, last, unused);</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"></span></div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, wraps using default of unsigned char.</span></div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"></span></div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> \details @c string_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> <a href="../../doc/graph/windows_string_sort.htm"> windows_string_sort</a></span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> <a href="../../doc/graph/osx_string_sort.htm"> osx_string_sort</a></span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"></span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"></span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"></span></div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"></span></div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span></div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"></span></div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> +<div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f"> 126</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  {</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> unused = <span class="charliteral">'\0'</span>;</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(first, last, unused);</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"></span></div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, allowing character-type overloads.</span></div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"></span></div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < detail::min_sort_size).</span></div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"></span></div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"></span></div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"></span></div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> \tparam Unsigned_char_type Unsigned character type used for string.</span></div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"></span></div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> \param[in] comp comparison functor.</span></div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> \param[in] unused Unused ???</span></div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"></span></div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"></span></div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"></span></div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"></span></div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"></span></div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Compare, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> +<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48"> 183</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first,</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  RandomAccessIter last, Compare comp, Unsigned_char_type unused)</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  {</div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">//Don't sort if it's too small to optimize.</span></div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <a class="code" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">detail::reverse_string_sort</a>(first, last, unused);</div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"></span></div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, wraps using default of @c unsigned char.</span></div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"></span></div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"></span></div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"></span></div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"></span></div> +<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"></span></div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> \param[in] comp Comparison functor.</span></div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"></span></div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"></span></div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"></span></div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"></span></div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"></span></div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Compare></div> +<div class="line"><a name="l00242"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5"> 242</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first,</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  RandomAccessIter last, Compare comp)</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  {</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> unused = <span class="charliteral">'\0'</span>;</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(first, last, comp, unused);</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"></span></div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, wraps using default of @c unsigned char.</span></div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"></span></div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"></span></div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"></span></div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"></span></div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> \tparam Get_char Bracket functor equivalent to @c operator[], taking a number corresponding to the character offset..</span></div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> \tparam Get_length Functor to get the length of the string in characters. TODO Check this and below and other places!!!</span></div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"></span></div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> \param[in] getchar Number corresponding to the character offset from bracket functor equivalent to @c operator[].</span></div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> \param[in] length Functor to get the length of the string in characters.</span></div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"></span></div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> \pre @c RandomAccessIter @c value_type supports the @c operator>>,</span></div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> which returns an integer-type right-shifted a specified number of bits.</span></div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"></span></div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"></span></div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"></span></div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"></span></div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment"></span></div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Get_<span class="keywordtype">char</span>, <span class="keyword">class</span> Get_length></div> +<div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680"> 301</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  Get_char getchar, Get_length length)</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">//Don't sort if it's too small to optimize</span></div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  std::sort(first, last);</div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">//skipping past empties, which allows us to get the character type</span></div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">//.empty() is not used so as not to require a user declaration of it</span></div> +<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">while</span> (!length(*first)) {</div> +<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (++first == last)</div> +<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">detail::string_sort</a>(first, last, getchar, length, getchar((*first), 0));</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span> </div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"></span></div> +<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment">/*! \brief String sort algorithm using random access iterators, wraps using default of @c unsigned char.</span></div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"></span></div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"></span></div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"></span></div> +<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="comment"></span></div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> \tparam Get_char ???.</span></div> +<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> \tparam Get_length ??? TODO</span></div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"></span></div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"></span></div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> \param[in] comp comparison functor.</span></div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"> \param[in] getchar ???</span></div> +<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> \param[in] length ???</span></div> +<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"></span></div> +<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"></span></div> +<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"></span></div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"></span></div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"></span></div> +<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"></span></div> +<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"></span></div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00374"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2"> 374</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> +<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  Get_char getchar, Get_length length, Compare comp)</div> +<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div> +<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">//Don't sort if it's too small to optimize</span></div> +<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">//skipping past empties, which allows us to get the character type</span></div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">//.empty() is not used so as not to require a user declaration of it</span></div> +<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">while</span> (!length(*first)) {</div> +<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (++first == last)</div> +<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  }</div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">detail::string_sort</a>(first, last, getchar, length, comp,</div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  getchar((*first), 0));</div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div> +<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div> +<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div> +<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"></span></div> +<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment">/*! \brief Reverse String sort algorithm using random access iterators.</span></div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"></span></div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> (All variants fall back to @c std::sort if the data size is too small, < @c detail::min_sort_size).</span></div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"></span></div> +<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm,</span></div> +<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment">which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n</span></div> +<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment">Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>,</span></div> +<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment">so @c integer_sort is asymptotically faster</span></div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment">than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11,</span></div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment">so its worst-case with default settings for 32-bit integers is</span></div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"><em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).\n\n</span></div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment">Some performance plots of runtime vs. n and log(range) are provided:\n</span></div> +<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> <a href="../../doc/graph/windows_integer_sort.htm"> windows_integer_sort</a></span></div> +<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> \n</span></div> +<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> <a href="../../doc/graph/osx_integer_sort.htm"> osx_integer_sort</a></span></div> +<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"></span></div> +<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"></span></div> +<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> \tparam RandomAccessIter <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></span></div> +<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"> \tparam Get_char ???.</span></div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> \tparam Get_length ??? TODO</span></div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> \tparam Comp To provide @c operator< for user-defined comparison.</span></div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"></span></div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"></span></div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> \param[in] first Iterator pointer to first element.</span></div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> \param[in] last Iterator pointing to one beyond the end of data.</span></div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> \param[in] comp comparison functor.</span></div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> \param[in] getchar ???</span></div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment"> \param[in] length ???</span></div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"></span></div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"></span></div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"> \pre [@c first, @c last) is a valid range.</span></div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is mutable.</span></div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> \pre @c RandomAccessIter @c value_type is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a></span></div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> \post The elements in the range [@c first, @c last) are sorted in ascending order.</span></div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"></span></div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> \return @c void.</span></div> +<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"></span></div> +<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves),</span></div> +<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> the right shift, subtraction of right-shifted elements, functors,</span></div> +<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> or any operations on iterators throw.</span></div> +<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"></span></div> +<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss.</span></div> +<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> \warning Invalid arguments cause undefined behaviour.</span></div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type,</span></div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> enabling faster generic-programming.</span></div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"></span></div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> \remark The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where:</span></div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> \remark * N is @c last - @c first,</span></div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> \remark * K is the log of the range in bits (32 for 32-bit integers using their full range),</span></div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size).</span></div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"></span></div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment">*/</span></div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">class </span>Compare></div> +<div class="line"><a name="l00447"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b"> 447</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first,</div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">//Don't sort if it's too small to optimize</span></div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (last - first < detail::min_sort_size)</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  std::sort(first, last, comp);</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">//skipping past empties, which allows us to get the character type</span></div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">//.empty() is not used so as not to require a user declaration of it</span></div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">while</span> (!length(*(--last))) {</div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">//If there is just one non-empty at the beginning, this is sorted</span></div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (first == last)</div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span>;</div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  }</div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">//making last just after the end of the non-empty part of the array</span></div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">detail::reverse_string_sort</a>(first, last + 1, getchar, length, comp,</div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  getchar((*last), 0));</div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  }</div> +<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div> +<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> }</div> +<div class="line"><a name="l00467"></a><span class="lineno"> 467</span> }</div> +<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="preprocessor">#endif</span></div> +<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> float_sort.hpp:27</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a82c4c0d7ba9873ecce7c674631dceae2"><div class="ttname"><a href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">boost::sort::string_sort</a></div><div class="ttdeci">void string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</div><div class="ttdoc">String sort algorithm using random access iterators, wraps using default of unsigned char...</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:374</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a950a2dbbe75f048a0b343dbf7c532dc0"><div class="ttname"><a href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort::string_sort</a></div><div class="ttdeci">void string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</div><div class="ttdoc">String sort algorithm using random access iterators, allowing character-type overloads. (All variants fall back to std::sort if the data size is too small, < detail::min_sort_size). </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:73</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a4ad4785d90f47d51ff1d2fac8c21bb48"><div class="ttname"><a href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort::reverse_string_sort</a></div><div class="ttdeci">void reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</div><div class="ttdoc">String sort algorithm using random access iterators, allowing character-type overloads. </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:183</div></div> +<div class="ttc" id="namespaceboost_1_1sort_html_a7940f1b2a7746c083a12a4e26077096b"><div class="ttname"><a href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">boost::sort::reverse_string_sort</a></div><div class="ttdeci">void reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Get_char getchar, Get_length length, Compare comp)</div><div class="ttdoc">Reverse String sort algorithm using random access iterators. </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:447</div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/stringfunctorsample_8cpp.html b/libs/sort/doc/doxygen/html/stringfunctorsample_8cpp.html new file mode 100644 index 000000000..3fd32bd64 --- /dev/null +++ b/libs/sort/doc/doxygen/html/stringfunctorsample_8cpp.html @@ -0,0 +1,161 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/stringfunctorsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#nested-classes">Classes</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">stringfunctorsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p>spreadsort string functor sorting example. +<a href="#details">More...</a></p> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a> +Classes</h2></td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html">lessthan</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html">bracket</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html">getsize</a></td></tr> +<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="stringfunctorsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> +<div class="textblock"><p>spreadsort string functor sorting example. </p> +</div><h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/stringsample_8cpp.html b/libs/sort/doc/doxygen/html/stringsample_8cpp.html new file mode 100644 index 000000000..4dfe38129 --- /dev/null +++ b/libs/sort/doc/doxygen/html/stringsample_8cpp.html @@ -0,0 +1,163 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/stringsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">stringsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="stringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   string</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="stringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   string</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e-members.html b/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e-members.html new file mode 100644 index 000000000..24c0cecdc --- /dev/null +++ b/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e-members.html @@ -0,0 +1,109 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">DATA_TYPE Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54">a</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c">birth</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr class="even"><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c">data</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403">first_name</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr class="even"><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">key</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#af18aa9620a8309d88c829d6af27824e3">key</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr class="even"><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43">last_name</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621">net_worth</a></td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"></td></tr> + <tr class="even"><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5">operator<</a>(const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e.html b/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e.html new file mode 100644 index 000000000..7d7edcd4a --- /dev/null +++ b/libs/sort/doc/doxygen/html/struct_d_a_t_a___t_y_p_e.html @@ -0,0 +1,257 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: DATA_TYPE Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="#pub-attribs">Public Attributes</a> | +<a href="struct_d_a_t_a___t_y_p_e-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">DATA_TYPE Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a6a24b4532734d210a7b3a9c71a3678f5"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a6a24b4532734d210a7b3a9c71a3678f5">operator<</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:a6a24b4532734d210a7b3a9c71a3678f5"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a> +Public Attributes</h2></td></tr> +<tr class="memitem:a0f17d79c6492cb604f3da783a5017b54"><td class="memItemLeft" align="right" valign="top">string </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a0f17d79c6492cb604f3da783a5017b54">a</a></td></tr> +<tr class="separator:a0f17d79c6492cb604f3da783a5017b54"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa28561fc8e223d84187ccfaf99953bae"><td class="memItemLeft" align="right" valign="top"><a class="el" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">KEY_TYPE</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">key</a></td></tr> +<tr class="separator:aa28561fc8e223d84187ccfaf99953bae"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ae644cc131b810b459261b3426e2c459c"><td class="memItemLeft" align="right" valign="top">std::string </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#ae644cc131b810b459261b3426e2c459c">data</a></td></tr> +<tr class="separator:ae644cc131b810b459261b3426e2c459c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a437ac9cab171cc3fff62212c65b3810c"><td class="memItemLeft" align="right" valign="top">time_t </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a437ac9cab171cc3fff62212c65b3810c">birth</a></td></tr> +<tr class="separator:a437ac9cab171cc3fff62212c65b3810c"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a2a7008d5cecd603c1aaf8ff9ed849621"><td class="memItemLeft" align="right" valign="top">float </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a2a7008d5cecd603c1aaf8ff9ed849621">net_worth</a></td></tr> +<tr class="separator:a2a7008d5cecd603c1aaf8ff9ed849621"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad2c00885d0c6afec26d51a53ae05e403"><td class="memItemLeft" align="right" valign="top">string </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#ad2c00885d0c6afec26d51a53ae05e403">first_name</a></td></tr> +<tr class="separator:ad2c00885d0c6afec26d51a53ae05e403"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a12df0589010b4a79d824dbea9326ba43"><td class="memItemLeft" align="right" valign="top">string </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#a12df0589010b4a79d824dbea9326ba43">last_name</a></td></tr> +<tr class="separator:a12df0589010b4a79d824dbea9326ba43"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:af18aa9620a8309d88c829d6af27824e3"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="struct_d_a_t_a___t_y_p_e.html#af18aa9620a8309d88c829d6af27824e3">key</a></td></tr> +<tr class="separator:af18aa9620a8309d88c829d6af27824e3"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a6a24b4532734d210a7b3a9c71a3678f5"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool DATA_TYPE::operator< </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Data Documentation</h2> +<a class="anchor" id="a0f17d79c6492cb604f3da783a5017b54"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">string DATA_TYPE::a</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a437ac9cab171cc3fff62212c65b3810c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">time_t DATA_TYPE::birth</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ae644cc131b810b459261b3426e2c459c"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">std::string DATA_TYPE::data</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ad2c00885d0c6afec26d51a53ae05e403"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">string DATA_TYPE::first_name</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="af18aa9620a8309d88c829d6af27824e3"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int DATA_TYPE::key</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa28561fc8e223d84187ccfaf99953bae"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname"><a class="el" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">KEY_TYPE</a> DATA_TYPE::key</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a12df0589010b4a79d824dbea9326ba43"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">string DATA_TYPE::last_name</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a2a7008d5cecd603c1aaf8ff9ed849621"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">float DATA_TYPE::net_worth</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following files:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="caseinsensitive_8cpp.html">caseinsensitive.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="charstringsample_8cpp.html">charstringsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="floatfunctorsample_8cpp.html">floatfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="generalizedstruct_8cpp.html">generalizedstruct.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="keyplusdatasample_8cpp.html">keyplusdatasample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="reversestringfunctorsample_8cpp.html">reversestringfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="stringfunctorsample_8cpp.html">stringfunctorsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than-members.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than-members.html new file mode 100644 index 000000000..721ef369a --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than-members.html @@ -0,0 +1,109 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length > Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a></td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a></td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td><td class="entry"></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a></td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">offset_char_less_than</a>(size_t char_offset)</td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">operator()</a>(const Data_type &x, const Data_type &y) const </td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than.html new file mode 100644 index 000000000..5e4f1e23b --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__char__less__than.html @@ -0,0 +1,234 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length > Struct Template Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="#pub-attribs">Public Attributes</a> | +<a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_char_less_than< Data_type, Get_char, Get_length > Struct Template Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p><code>#include <<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a>></code></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a0716b085964e676c8c9735bafa783007"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">offset_char_less_than</a> (size_t char_offset)</td></tr> +<tr class="separator:a0716b085964e676c8c9735bafa783007"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ad20c3572610e68d76c49dfff2eba2bf3"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">operator()</a> (const Data_type &x, const Data_type &y) const </td></tr> +<tr class="separator:ad20c3572610e68d76c49dfff2eba2bf3"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a> +Public Attributes</h2></td></tr> +<tr class="memitem:ae5ee4abf81ecfb4ff4016792b81bfbd2"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a></td></tr> +<tr class="separator:ae5ee4abf81ecfb4ff4016792b81bfbd2"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:afb5424173c237d8cd25722a02c23ab30"><td class="memItemLeft" align="right" valign="top">Get_char </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a></td></tr> +<tr class="separator:afb5424173c237d8cd25722a02c23ab30"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a8ff12c3dcf4a6ea9942b8fc1e5046936"><td class="memItemLeft" align="right" valign="top">Get_length </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a></td></tr> +<tr class="separator:a8ff12c3dcf4a6ea9942b8fc1e5046936"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Constructor & Destructor Documentation</h2> +<a class="anchor" id="a0716b085964e676c8c9735bafa783007"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Get_char , class Get_length > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a>< Data_type, Get_char, Get_length >::<a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a> </td> + <td>(</td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="ad20c3572610e68d76c49dfff2eba2bf3"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Get_char , class Get_length > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a>< Data_type, Get_char, Get_length >::operator() </td> + <td>(</td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Data Documentation</h2> +<a class="anchor" id="ae5ee4abf81ecfb4ff4016792b81bfbd2"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Get_char , class Get_length > </div> + <table class="memname"> + <tr> + <td class="memname">size_t <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a>< Data_type, Get_char, Get_length >::fchar_offset</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="afb5424173c237d8cd25722a02c23ab30"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Get_char , class Get_length > </div> + <table class="memname"> + <tr> + <td class="memname">Get_char <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a>< Data_type, Get_char, Get_length >::getchar</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a8ff12c3dcf4a6ea9942b8fc1e5046936"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Get_char , class Get_length > </div> + <table class="memname"> + <tr> + <td class="memname">Get_length <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a>< Data_type, Get_char, Get_length >::length</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following file:<ul> +<li>I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than-members.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than-members.html new file mode 100644 index 000000000..6bc8cbba7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than-members.html @@ -0,0 +1,107 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type > Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type ></a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a></td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type ></a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">offset_greater_than</a>(size_t char_offset)</td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">operator()</a>(const Data_type &x, const Data_type &y) const </td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than.html new file mode 100644 index 000000000..55bccad9b --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__greater__than.html @@ -0,0 +1,202 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type > Struct Template Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="#pub-attribs">Public Attributes</a> | +<a href="structboost_1_1sort_1_1detail_1_1offset__greater__than-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_greater_than< Data_type, Unsigned_char_type > Struct Template Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p><code>#include <<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a>></code></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a9603b8028ace4872c6e056917c7889aa"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">offset_greater_than</a> (size_t char_offset)</td></tr> +<tr class="separator:a9603b8028ace4872c6e056917c7889aa"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a2d28d7eb61a69c61c0362cfefa264d73"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">operator()</a> (const Data_type &x, const Data_type &y) const </td></tr> +<tr class="separator:a2d28d7eb61a69c61c0362cfefa264d73"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a> +Public Attributes</h2></td></tr> +<tr class="memitem:a3ce63f721a5a4453317ffc0ea61a6243"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a></td></tr> +<tr class="separator:a3ce63f721a5a4453317ffc0ea61a6243"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Constructor & Destructor Documentation</h2> +<a class="anchor" id="a9603b8028ace4872c6e056917c7889aa"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than</a>< Data_type, Unsigned_char_type >::<a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a> </td> + <td>(</td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a2d28d7eb61a69c61c0362cfefa264d73"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than</a>< Data_type, Unsigned_char_type >::operator() </td> + <td>(</td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Data Documentation</h2> +<a class="anchor" id="a3ce63f721a5a4453317ffc0ea61a6243"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> + <table class="memname"> + <tr> + <td class="memname">size_t <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than</a>< Data_type, Unsigned_char_type >::fchar_offset</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following file:<ul> +<li>I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than-members.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than-members.html new file mode 100644 index 000000000..24552fb2b --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than-members.html @@ -0,0 +1,107 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type > Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type ></a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a></td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type ></a></td><td class="entry"></td></tr> + <tr><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">offset_less_than</a>(size_t char_offset)</td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">operator()</a>(const Data_type &x, const Data_type &y) const </td><td class="entry"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than.html b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than.html new file mode 100644 index 000000000..635064bee --- /dev/null +++ b/libs/sort/doc/doxygen/html/structboost_1_1sort_1_1detail_1_1offset__less__than.html @@ -0,0 +1,202 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type > Struct Template Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort_1_1detail.html">detail</a></li><li class="navelem"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="#pub-attribs">Public Attributes</a> | +<a href="structboost_1_1sort_1_1detail_1_1offset__less__than-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">boost::sort::detail::offset_less_than< Data_type, Unsigned_char_type > Struct Template Reference</div> </div> +</div><!--header--> +<div class="contents"> + +<p><code>#include <<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a>></code></p> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a0c153f50b29e9bea224df345c5ff1e91"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">offset_less_than</a> (size_t char_offset)</td></tr> +<tr class="separator:a0c153f50b29e9bea224df345c5ff1e91"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3f2184b627e54eb990bfe2022b6f8f06"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">operator()</a> (const Data_type &x, const Data_type &y) const </td></tr> +<tr class="separator:a3f2184b627e54eb990bfe2022b6f8f06"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a> +Public Attributes</h2></td></tr> +<tr class="memitem:ae6d1402367790441b962b8cc9f066aac"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a></td></tr> +<tr class="separator:ae6d1402367790441b962b8cc9f066aac"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Constructor & Destructor Documentation</h2> +<a class="anchor" id="a0c153f50b29e9bea224df345c5ff1e91"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname"><a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than</a>< Data_type, Unsigned_char_type >::<a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a> </td> + <td>(</td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>char_offset</em></td><td>)</td> + <td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a3f2184b627e54eb990bfe2022b6f8f06"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than</a>< Data_type, Unsigned_char_type >::operator() </td> + <td>(</td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const Data_type & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Member Data Documentation</h2> +<a class="anchor" id="ae6d1402367790441b962b8cc9f066aac"></a> +<div class="memitem"> +<div class="memproto"> +<div class="memtemplate"> +template<class Data_type , class Unsigned_char_type > </div> + <table class="memname"> + <tr> + <td class="memname">size_t <a class="el" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than</a>< Data_type, Unsigned_char_type >::fchar_offset</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following file:<ul> +<li>I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/<a class="el" href="detail_2string__sort_8hpp_source.html">string_sort.hpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structbracket-members.html b/libs/sort/doc/doxygen/html/structbracket-members.html new file mode 100644 index 000000000..cddd3d6b1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structbracket-members.html @@ -0,0 +1,105 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">bracket Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structbracket.html">bracket</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a>(const DATA_TYPE &x, size_t offset) const </td><td class="entry"><a class="el" href="structbracket.html">bracket</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a>(const DATA_TYPE &x, size_t offset) const </td><td class="entry"><a class="el" href="structbracket.html">bracket</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a>(const DATA_TYPE &x, size_t offset) const </td><td class="entry"><a class="el" href="structbracket.html">bracket</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a>(const DATA_TYPE &x, size_t offset) const </td><td class="entry"><a class="el" href="structbracket.html">bracket</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a>(const DATA_TYPE &x, size_t offset) const </td><td class="entry"><a class="el" href="structbracket.html">bracket</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structbracket.html b/libs/sort/doc/doxygen/html/structbracket.html new file mode 100644 index 000000000..00a000217 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structbracket.html @@ -0,0 +1,292 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: bracket Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structbracket-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">bracket Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:aa87f46d8c06444604c98138eb9a7627a"><td class="memItemLeft" align="right" valign="top">unsigned char </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, size_t offset) const </td></tr> +<tr class="separator:aa87f46d8c06444604c98138eb9a7627a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa87f46d8c06444604c98138eb9a7627a"><td class="memItemLeft" align="right" valign="top">unsigned char </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, size_t offset) const </td></tr> +<tr class="separator:aa87f46d8c06444604c98138eb9a7627a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa87f46d8c06444604c98138eb9a7627a"><td class="memItemLeft" align="right" valign="top">unsigned char </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, size_t offset) const </td></tr> +<tr class="separator:aa87f46d8c06444604c98138eb9a7627a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa87f46d8c06444604c98138eb9a7627a"><td class="memItemLeft" align="right" valign="top">unsigned char </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, size_t offset) const </td></tr> +<tr class="separator:aa87f46d8c06444604c98138eb9a7627a"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:aa87f46d8c06444604c98138eb9a7627a"><td class="memItemLeft" align="right" valign="top">unsigned char </td><td class="memItemRight" valign="bottom"><a class="el" href="structbracket.html#aa87f46d8c06444604c98138eb9a7627a">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, size_t offset) const </td></tr> +<tr class="separator:aa87f46d8c06444604c98138eb9a7627a"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="aa87f46d8c06444604c98138eb9a7627a"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned char bracket::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa87f46d8c06444604c98138eb9a7627a"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned char bracket::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa87f46d8c06444604c98138eb9a7627a"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned char bracket::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa87f46d8c06444604c98138eb9a7627a"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned char bracket::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="aa87f46d8c06444604c98138eb9a7627a"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">unsigned char bracket::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">size_t </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following files:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="caseinsensitive_8cpp.html">caseinsensitive.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="charstringsample_8cpp.html">charstringsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="generalizedstruct_8cpp.html">generalizedstruct.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="reversestringfunctorsample_8cpp.html">reversestringfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="stringfunctorsample_8cpp.html">stringfunctorsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structgetsize-members.html b/libs/sort/doc/doxygen/html/structgetsize-members.html new file mode 100644 index 000000000..719d926a1 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structgetsize-members.html @@ -0,0 +1,105 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">getsize Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structgetsize.html">getsize</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a>(const DATA_TYPE &x) const </td><td class="entry"><a class="el" href="structgetsize.html">getsize</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a>(const DATA_TYPE &x) const </td><td class="entry"><a class="el" href="structgetsize.html">getsize</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a>(const DATA_TYPE &x) const </td><td class="entry"><a class="el" href="structgetsize.html">getsize</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a>(const DATA_TYPE &x) const </td><td class="entry"><a class="el" href="structgetsize.html">getsize</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a>(const DATA_TYPE &x) const </td><td class="entry"><a class="el" href="structgetsize.html">getsize</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structgetsize.html b/libs/sort/doc/doxygen/html/structgetsize.html new file mode 100644 index 000000000..6bc23c335 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structgetsize.html @@ -0,0 +1,242 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: getsize Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structgetsize-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">getsize Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x) const </td></tr> +<tr class="separator:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x) const </td></tr> +<tr class="separator:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x) const </td></tr> +<tr class="separator:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x) const </td></tr> +<tr class="separator:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="structgetsize.html#a0571ba8961ed6f7f2d7003509a9ca9b7">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x) const </td></tr> +<tr class="separator:a0571ba8961ed6f7f2d7003509a9ca9b7"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a0571ba8961ed6f7f2d7003509a9ca9b7"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t getsize::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0571ba8961ed6f7f2d7003509a9ca9b7"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t getsize::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0571ba8961ed6f7f2d7003509a9ca9b7"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t getsize::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0571ba8961ed6f7f2d7003509a9ca9b7"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t getsize::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a0571ba8961ed6f7f2d7003509a9ca9b7"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">size_t getsize::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em></td><td>)</td> + <td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following files:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="caseinsensitive_8cpp.html">caseinsensitive.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="charstringsample_8cpp.html">charstringsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="generalizedstruct_8cpp.html">generalizedstruct.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="reversestringfunctorsample_8cpp.html">reversestringfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="stringfunctorsample_8cpp.html">stringfunctorsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structgreaterthan-members.html b/libs/sort/doc/doxygen/html/structgreaterthan-members.html new file mode 100644 index 000000000..1cc5955c5 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structgreaterthan-members.html @@ -0,0 +1,101 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">greaterthan Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structgreaterthan.html">greaterthan</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structgreaterthan.html">greaterthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structgreaterthan.html b/libs/sort/doc/doxygen/html/structgreaterthan.html new file mode 100644 index 000000000..d44caa00b --- /dev/null +++ b/libs/sort/doc/doxygen/html/structgreaterthan.html @@ -0,0 +1,144 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: greaterthan Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structgreaterthan-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">greaterthan Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a37147ad0d885c20dc3380b366e75f7cd"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structgreaterthan.html#a37147ad0d885c20dc3380b366e75f7cd">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:a37147ad0d885c20dc3380b366e75f7cd"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a37147ad0d885c20dc3380b366e75f7cd"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool greaterthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following file:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="reversestringfunctorsample_8cpp.html">reversestringfunctorsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structlessthan-members.html b/libs/sort/doc/doxygen/html/structlessthan-members.html new file mode 100644 index 000000000..76306edfe --- /dev/null +++ b/libs/sort/doc/doxygen/html/structlessthan-members.html @@ -0,0 +1,105 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">lessthan Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structlessthan.html">lessthan</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structlessthan.html">lessthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structlessthan.html">lessthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structlessthan.html">lessthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structlessthan.html">lessthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a>(const DATA_TYPE &x, const DATA_TYPE &y) const </td><td class="entry"><a class="el" href="structlessthan.html">lessthan</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structlessthan.html b/libs/sort/doc/doxygen/html/structlessthan.html new file mode 100644 index 000000000..ca194bbbc --- /dev/null +++ b/libs/sort/doc/doxygen/html/structlessthan.html @@ -0,0 +1,292 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: lessthan Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structlessthan-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">lessthan Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structlessthan.html#ac8c76b8c1e456abd4cdd4b6ac3546582">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &y) const </td></tr> +<tr class="separator:ac8c76b8c1e456abd4cdd4b6ac3546582"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="ac8c76b8c1e456abd4cdd4b6ac3546582"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool lessthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ac8c76b8c1e456abd4cdd4b6ac3546582"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool lessthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ac8c76b8c1e456abd4cdd4b6ac3546582"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool lessthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ac8c76b8c1e456abd4cdd4b6ac3546582"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool lessthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="ac8c76b8c1e456abd4cdd4b6ac3546582"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">bool lessthan::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>y</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following files:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="caseinsensitive_8cpp.html">caseinsensitive.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="floatfunctorsample_8cpp.html">floatfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="generalizedstruct_8cpp.html">generalizedstruct.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="keyplusdatasample_8cpp.html">keyplusdatasample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="stringfunctorsample_8cpp.html">stringfunctorsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structnegrightshift-members.html b/libs/sort/doc/doxygen/html/structnegrightshift-members.html new file mode 100644 index 000000000..ed439a5e6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structnegrightshift-members.html @@ -0,0 +1,101 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">negrightshift Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structnegrightshift.html">negrightshift</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2">operator()</a>(const int &x, const unsigned offset)</td><td class="entry"><a class="el" href="structnegrightshift.html">negrightshift</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structnegrightshift.html b/libs/sort/doc/doxygen/html/structnegrightshift.html new file mode 100644 index 000000000..d5e907b6d --- /dev/null +++ b/libs/sort/doc/doxygen/html/structnegrightshift.html @@ -0,0 +1,144 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: negrightshift Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structnegrightshift-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">negrightshift Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:ae39663d02ec765fd114b68ac0be844e2"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="structnegrightshift.html#ae39663d02ec765fd114b68ac0be844e2">operator()</a> (const int &x, const unsigned offset)</td></tr> +<tr class="separator:ae39663d02ec765fd114b68ac0be844e2"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="ae39663d02ec765fd114b68ac0be844e2"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">int negrightshift::operator() </td> + <td>(</td> + <td class="paramtype">const int & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following file:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="reverseintsample_8cpp.html">reverseintsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structrightshift-members.html b/libs/sort/doc/doxygen/html/structrightshift-members.html new file mode 100644 index 000000000..fa9e05e7f --- /dev/null +++ b/libs/sort/doc/doxygen/html/structrightshift-members.html @@ -0,0 +1,104 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: Member List</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">rightshift Member List</div> </div> +</div><!--header--> +<div class="contents"> + +<p>This is the complete list of members for <a class="el" href="structrightshift.html">rightshift</a>, including all inherited members.</p> +<table class="directory"> + <tr class="even"><td class="entry"><a class="el" href="structrightshift.html#a87a59db62b9d8c90a02df98442199598">operator()</a>(const DATA_TYPE &x, const unsigned offset) const </td><td class="entry"><a class="el" href="structrightshift.html">rightshift</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structrightshift.html#a3464d6de770ac9db414271587a712d12">operator()</a>(const DATA_TYPE &x, const unsigned offset)</td><td class="entry"><a class="el" href="structrightshift.html">rightshift</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr class="even"><td class="entry"><a class="el" href="structrightshift.html#a24f7c45689f1e4cd02ae7fb40b47afc4">operator()</a>(DATA_TYPE x, unsigned offset)</td><td class="entry"><a class="el" href="structrightshift.html">rightshift</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> + <tr><td class="entry"><a class="el" href="structrightshift.html#a87a59db62b9d8c90a02df98442199598">operator()</a>(const DATA_TYPE &x, const unsigned offset) const </td><td class="entry"><a class="el" href="structrightshift.html">rightshift</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> +</table></div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/structrightshift.html b/libs/sort/doc/doxygen/html/structrightshift.html new file mode 100644 index 000000000..92d6ae5b7 --- /dev/null +++ b/libs/sort/doc/doxygen/html/structrightshift.html @@ -0,0 +1,255 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: rightshift Struct Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li class="current"><a href="annotated.html"><span>Classes</span></a></li> + <li><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="annotated.html"><span>Class List</span></a></li> + <li><a href="classes.html"><span>Class Index</span></a></li> + <li><a href="functions.html"><span>Class Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#pub-methods">Public Member Functions</a> | +<a href="structrightshift-members.html">List of all members</a> </div> + <div class="headertitle"> +<div class="title">rightshift Struct Reference</div> </div> +</div><!--header--> +<div class="contents"> +<table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> +Public Member Functions</h2></td></tr> +<tr class="memitem:a87a59db62b9d8c90a02df98442199598"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html#a87a59db62b9d8c90a02df98442199598">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const unsigned offset) const </td></tr> +<tr class="separator:a87a59db62b9d8c90a02df98442199598"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a3464d6de770ac9db414271587a712d12"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html#a3464d6de770ac9db414271587a712d12">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const unsigned offset)</td></tr> +<tr class="separator:a3464d6de770ac9db414271587a712d12"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a24f7c45689f1e4cd02ae7fb40b47afc4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html#a24f7c45689f1e4cd02ae7fb40b47afc4">operator()</a> (<a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> x, unsigned offset)</td></tr> +<tr class="separator:a24f7c45689f1e4cd02ae7fb40b47afc4"><td class="memSeparator" colspan="2"> </td></tr> +<tr class="memitem:a87a59db62b9d8c90a02df98442199598"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="structrightshift.html#a87a59db62b9d8c90a02df98442199598">operator()</a> (const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &x, const unsigned offset) const </td></tr> +<tr class="separator:a87a59db62b9d8c90a02df98442199598"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Member Function Documentation</h2> +<a class="anchor" id="a87a59db62b9d8c90a02df98442199598"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">int rightshift::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a24f7c45689f1e4cd02ae7fb40b47afc4"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">int rightshift::operator() </td> + <td>(</td> + <td class="paramtype"><a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">unsigned </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a3464d6de770ac9db414271587a712d12"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">int rightshift::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<a class="anchor" id="a87a59db62b9d8c90a02df98442199598"></a> +<div class="memitem"> +<div class="memproto"> +<table class="mlabels"> + <tr> + <td class="mlabels-left"> + <table class="memname"> + <tr> + <td class="memname">int rightshift::operator() </td> + <td>(</td> + <td class="paramtype">const <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> & </td> + <td class="paramname"><em>x</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const unsigned </td> + <td class="paramname"><em>offset</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td> const</td> + </tr> + </table> + </td> + <td class="mlabels-right"> +<span class="mlabels"><span class="mlabel">inline</span></span> </td> + </tr> +</table> +</div><div class="memdoc"> + +</div> +</div> +<hr/>The documentation for this struct was generated from the following files:<ul> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="floatfunctorsample_8cpp.html">floatfunctorsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="keyplusdatasample_8cpp.html">keyplusdatasample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="rightshiftsample_8cpp.html">rightshiftsample.cpp</a></li> +<li>I:/modular-boost/libs/sort/example/<a class="el" href="shiftfloatsample_8cpp.html">shiftfloatsample.cpp</a></li> +</ul> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/html/sync_off.png b/libs/sort/doc/doxygen/html/sync_off.png Binary files differnew file mode 100644 index 000000000..3b443fc62 --- /dev/null +++ b/libs/sort/doc/doxygen/html/sync_off.png diff --git a/libs/sort/doc/doxygen/html/sync_on.png b/libs/sort/doc/doxygen/html/sync_on.png Binary files differnew file mode 100644 index 000000000..e08320fb6 --- /dev/null +++ b/libs/sort/doc/doxygen/html/sync_on.png diff --git a/libs/sort/doc/doxygen/html/tab_a.png b/libs/sort/doc/doxygen/html/tab_a.png Binary files differnew file mode 100644 index 000000000..3b725c41c --- /dev/null +++ b/libs/sort/doc/doxygen/html/tab_a.png diff --git a/libs/sort/doc/doxygen/html/tab_b.png b/libs/sort/doc/doxygen/html/tab_b.png Binary files differnew file mode 100644 index 000000000..e2b4a8638 --- /dev/null +++ b/libs/sort/doc/doxygen/html/tab_b.png diff --git a/libs/sort/doc/doxygen/html/tab_h.png b/libs/sort/doc/doxygen/html/tab_h.png Binary files differnew file mode 100644 index 000000000..fd5cb7054 --- /dev/null +++ b/libs/sort/doc/doxygen/html/tab_h.png diff --git a/libs/sort/doc/doxygen/html/tab_s.png b/libs/sort/doc/doxygen/html/tab_s.png Binary files differnew file mode 100644 index 000000000..ab478c95b --- /dev/null +++ b/libs/sort/doc/doxygen/html/tab_s.png diff --git a/libs/sort/doc/doxygen/html/tabs.css b/libs/sort/doc/doxygen/html/tabs.css new file mode 100644 index 000000000..9cf578f23 --- /dev/null +++ b/libs/sort/doc/doxygen/html/tabs.css @@ -0,0 +1,60 @@ +.tabs, .tabs2, .tabs3 { + background-image: url('tab_b.png'); + width: 100%; + z-index: 101; + font-size: 13px; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; +} + +.tabs2 { + font-size: 10px; +} +.tabs3 { + font-size: 9px; +} + +.tablist { + margin: 0; + padding: 0; + display: table; +} + +.tablist li { + float: left; + display: table-cell; + background-image: url('tab_b.png'); + line-height: 36px; + list-style: none; +} + +.tablist a { + display: block; + padding: 0 20px; + font-weight: bold; + background-image:url('tab_s.png'); + background-repeat:no-repeat; + background-position:right; + color: #283A5D; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; + outline: none; +} + +.tabs3 .tablist a { + padding: 0 10px; +} + +.tablist a:hover { + background-image: url('tab_h.png'); + background-repeat:repeat-x; + color: #fff; + text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); + text-decoration: none; +} + +.tablist li.current a { + background-image: url('tab_a.png'); + background-repeat:repeat-x; + color: #fff; + text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +} diff --git a/libs/sort/doc/doxygen/html/wstringsample_8cpp.html b/libs/sort/doc/doxygen/html/wstringsample_8cpp.html new file mode 100644 index 000000000..9190f2c9b --- /dev/null +++ b/libs/sort/doc/doxygen/html/wstringsample_8cpp.html @@ -0,0 +1,163 @@ +<!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/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.8.9.1"/> +<title>Boost.Sort: I:/modular-boost/libs/sort/example/wstringsample.cpp File Reference</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/javascript"> + $(document).ready(function() { init_search(); }); +</script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">Boost.Sort + </div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.9.1 --> +<script type="text/javascript"> +var searchBox = new SearchBox("searchBox", "search",false,'Search'); +</script> + <div id="navrow1" class="tabs"> + <ul class="tablist"> + <li><a href="index.html"><span>Main Page</span></a></li> + <li><a href="namespaces.html"><span>Namespaces</span></a></li> + <li><a href="annotated.html"><span>Classes</span></a></li> + <li class="current"><a href="files.html"><span>Files</span></a></li> + <li> + <div id="MSearchBox" class="MSearchBoxInactive"> + <span class="left"> + <img id="MSearchSelect" src="search/mag_sel.png" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + alt=""/> + <input type="text" id="MSearchField" value="Search" accesskey="S" + onfocus="searchBox.OnSearchFieldFocus(true)" + onblur="searchBox.OnSearchFieldFocus(false)" + onkeyup="searchBox.OnSearchFieldChange(event)"/> + </span><span class="right"> + <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> + </span> + </div> + </li> + </ul> + </div> + <div id="navrow2" class="tabs2"> + <ul class="tablist"> + <li><a href="files.html"><span>File List</span></a></li> + <li><a href="globals.html"><span>File Members</span></a></li> + </ul> + </div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_cfafba98a580ce4b62f8a6fa96d7cbb0.html">example</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="summary"> +<a href="#define-members">Macros</a> | +<a href="#func-members">Functions</a> </div> + <div class="headertitle"> +<div class="title">wstringsample.cpp File Reference</div> </div> +</div><!--header--> +<div class="contents"> +<div class="textblock"><code>#include <<a class="el" href="string__sort_8hpp_source.html">boost/sort/spreadsort/string_sort.hpp</a>></code><br /> +<code>#include <time.h></code><br /> +<code>#include <stdio.h></code><br /> +<code>#include <stdlib.h></code><br /> +<code>#include <algorithm></code><br /> +<code>#include <vector></code><br /> +<code>#include <iostream></code><br /> +<code>#include <fstream></code><br /> +<code>#include <string></code><br /> +</div><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a> +Macros</h2></td></tr> +<tr class="memitem:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="wstringsample_8cpp.html#afb8c72ce35c4a1f4a2588d6573e54aa1">DATA_TYPE</a>   wstring</td></tr> +<tr class="separator:afb8c72ce35c4a1f4a2588d6573e54aa1"><td class="memSeparator" colspan="2"> </td></tr> +</table><table class="memberdecls"> +<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a> +Functions</h2></td></tr> +<tr class="memitem:a217dbf8b442f20279ea00b898af96f52"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="wstringsample_8cpp.html#a217dbf8b442f20279ea00b898af96f52">main</a> (int argc, const char **argv)</td></tr> +<tr class="separator:a217dbf8b442f20279ea00b898af96f52"><td class="memSeparator" colspan="2"> </td></tr> +</table> +<h2 class="groupheader">Macro Definition Documentation</h2> +<a class="anchor" id="afb8c72ce35c4a1f4a2588d6573e54aa1"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">#define <a class="el" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a>   wstring</td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +<h2 class="groupheader">Function Documentation</h2> +<a class="anchor" id="a217dbf8b442f20279ea00b898af96f52"></a> +<div class="memitem"> +<div class="memproto"> + <table class="memname"> + <tr> + <td class="memname">int main </td> + <td>(</td> + <td class="paramtype">int </td> + <td class="paramname"><em>argc</em>, </td> + </tr> + <tr> + <td class="paramkey"></td> + <td></td> + <td class="paramtype">const char ** </td> + <td class="paramname"><em>argv</em> </td> + </tr> + <tr> + <td></td> + <td>)</td> + <td></td><td></td> + </tr> + </table> +</div><div class="memdoc"> + +</div> +</div> +</div><!-- contents --> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.8.9.1 +</small></address> +</body> +</html> diff --git a/libs/sort/doc/doxygen/index.html b/libs/sort/doc/doxygen/index.html new file mode 100644 index 000000000..c1565336d --- /dev/null +++ b/libs/sort/doc/doxygen/index.html @@ -0,0 +1,15 @@ +<!--
+Redirection to local sort Doxygen documentation /libs/sort/doc/doxygen/html/index.html
+
+Copyright 2014 Paul A. Bristow
+Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
+<html>
+<head>
+ <meta http-equiv="refresh" content="0; URL= ./html/index.html">
+</head>
+<body>
+ Automatic redirection failed!
+</body>
+</html>
diff --git a/libs/sort/doc/doxygen/sort_doxyfile.txt b/libs/sort/doc/doxygen/sort_doxyfile.txt new file mode 100644 index 000000000..40ef50b9b --- /dev/null +++ b/libs/sort/doc/doxygen/sort_doxyfile.txt @@ -0,0 +1,2434 @@ +# Doxyfile 1.8.9.1 + +# This file describes the settings to be used by the documentation system +# doxygen (www.doxygen.org) for a project. +# +# All text after a double hash (##) is considered a comment and is placed in +# front of the TAG it is preceding. +# +# All text after a single hash (#) is considered a comment and will be ignored. +# The format is: +# TAG = value [value, ...] +# For lists, items can also be appended using: +# TAG += value [value, ...] +# Values that contain spaces should be placed between quotes (\" \"). + +#--------------------------------------------------------------------------- +# Project related configuration options +#--------------------------------------------------------------------------- + +# This tag specifies the encoding used for all characters in the config file +# that follow. The default is UTF-8 which is also the encoding used for all text +# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv +# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv +# for the list of possible encodings. +# The default value is: UTF-8. + +DOXYFILE_ENCODING = UTF-8 + +# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by +# double-quotes, unless you are using Doxywizard) that should identify the +# project for which the documentation is generated. This name is used in the +# title of most generated pages and in a few other places. +# The default value is: My Project. + +PROJECT_NAME = Boost.Sort + +# The PROJECT_NUMBER tag can be used to enter a project or revision number. This +# could be handy for archiving the generated documentation or if some version +# control system is used. + +PROJECT_NUMBER = + +# Using the PROJECT_BRIEF tag one can provide an optional one line description +# for a project that appears at the top of each page and should give viewer a +# quick idea about the purpose of the project. Keep the description short. + +PROJECT_BRIEF = + +# With the PROJECT_LOGO tag one can specify a logo or an icon that is included +# in the documentation. The maximum height of the logo should not exceed 55 +# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy +# the logo to the output directory. + +PROJECT_LOGO = + +# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path +# into which the generated documentation will be written. If a relative path is +# entered, it will be relative to the location where doxygen was started. If +# left blank the current directory will be used. + +OUTPUT_DIRECTORY = I:/modular-boost/libs/sort/doc/doxygen + +# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub- +# directories (in 2 levels) under the output directory of each output format and +# will distribute the generated files over these directories. Enabling this +# option can be useful when feeding doxygen a huge amount of source files, where +# putting all generated files in the same directory would otherwise causes +# performance problems for the file system. +# The default value is: NO. + +CREATE_SUBDIRS = NO + +# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII +# characters to appear in the names of generated files. If set to NO, non-ASCII +# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode +# U+3044. +# The default value is: NO. + +ALLOW_UNICODE_NAMES = NO + +# The OUTPUT_LANGUAGE tag is used to specify the language in which all +# documentation generated by doxygen is written. Doxygen will use this +# information to generate all constant output in the proper language. +# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese, +# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States), +# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian, +# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages), +# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian, +# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian, +# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish, +# Ukrainian and Vietnamese. +# The default value is: English. + +OUTPUT_LANGUAGE = English + +# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member +# descriptions after the members that are listed in the file and class +# documentation (similar to Javadoc). Set to NO to disable this. +# The default value is: YES. + +BRIEF_MEMBER_DESC = YES + +# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief +# description of a member or function before the detailed description +# +# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the +# brief descriptions will be completely suppressed. +# The default value is: YES. + +REPEAT_BRIEF = YES + +# This tag implements a quasi-intelligent brief description abbreviator that is +# used to form the text in various listings. Each string in this list, if found +# as the leading text of the brief description, will be stripped from the text +# and the result, after processing the whole list, is used as the annotated +# text. Otherwise, the brief description is used as-is. If left blank, the +# following values are used ($name is automatically replaced with the name of +# the entity):The $name class, The $name widget, The $name file, is, provides, +# specifies, contains, represents, a, an and the. + +ABBREVIATE_BRIEF = "The $name class" \ + "The $name widget" \ + "The $name file" \ + is \ + provides \ + specifies \ + contains \ + represents \ + a \ + an \ + the + +# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then +# doxygen will generate a detailed section even if there is only a brief +# description. +# The default value is: NO. + +ALWAYS_DETAILED_SEC = NO + +# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all +# inherited members of a class in the documentation of that class as if those +# members were ordinary class members. Constructors, destructors and assignment +# operators of the base classes will not be shown. +# The default value is: NO. + +INLINE_INHERITED_MEMB = NO + +# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path +# before files name in the file list and in the header files. If set to NO the +# shortest path that makes the file name unique will be used +# The default value is: YES. + +FULL_PATH_NAMES = YES + +# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path. +# Stripping is only done if one of the specified strings matches the left-hand +# part of the path. The tag can be used to show relative paths in the file list. +# If left blank the directory from which doxygen is run is used as the path to +# strip. +# +# Note that you can specify absolute paths here, but also relative paths, which +# will be relative from the directory where doxygen is started. +# This tag requires that the tag FULL_PATH_NAMES is set to YES. + +STRIP_FROM_PATH = + +# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the +# path mentioned in the documentation of a class, which tells the reader which +# header file to include in order to use a class. If left blank only the name of +# the header file containing the class definition is used. Otherwise one should +# specify the list of include paths that are normally passed to the compiler +# using the -I flag. + +STRIP_FROM_INC_PATH = + +# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but +# less readable) file names. This can be useful is your file systems doesn't +# support long names like on DOS, Mac, or CD-ROM. +# The default value is: NO. + +SHORT_NAMES = NO + +# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the +# first line (until the first dot) of a Javadoc-style comment as the brief +# description. If set to NO, the Javadoc-style will behave just like regular Qt- +# style comments (thus requiring an explicit @brief command for a brief +# description.) +# The default value is: NO. + +JAVADOC_AUTOBRIEF = NO + +# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first +# line (until the first dot) of a Qt-style comment as the brief description. If +# set to NO, the Qt-style will behave just like regular Qt-style comments (thus +# requiring an explicit \brief command for a brief description.) +# The default value is: NO. + +QT_AUTOBRIEF = NO + +# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a +# multi-line C++ special comment block (i.e. a block of //! or /// comments) as +# a brief description. This used to be the default behavior. The new default is +# to treat a multi-line C++ comment block as a detailed description. Set this +# tag to YES if you prefer the old behavior instead. +# +# Note that setting this tag to YES also means that rational rose comments are +# not recognized any more. +# The default value is: NO. + +MULTILINE_CPP_IS_BRIEF = NO + +# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the +# documentation from any documented member that it re-implements. +# The default value is: YES. + +INHERIT_DOCS = YES + +# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new +# page for each member. If set to NO, the documentation of a member will be part +# of the file/class/namespace that contains it. +# The default value is: NO. + +SEPARATE_MEMBER_PAGES = NO + +# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen +# uses this value to replace tabs by spaces in code fragments. +# Minimum value: 1, maximum value: 16, default value: 4. + +TAB_SIZE = 4 + +# This tag can be used to specify a number of aliases that act as commands in +# the documentation. An alias has the form: +# name=value +# For example adding +# "sideeffect=@par Side Effects:\n" +# will allow you to put the command \sideeffect (or @sideeffect) in the +# documentation, which will result in a user-defined paragraph with heading +# "Side Effects:". You can put \n's in the value part of an alias to insert +# newlines. + +ALIASES = + +# This tag can be used to specify a number of word-keyword mappings (TCL only). +# A mapping has the form "name=value". For example adding "class=itcl::class" +# will allow you to use the command class in the itcl::class meaning. + +TCL_SUBST = + +# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources +# only. Doxygen will then generate output that is more tailored for C. For +# instance, some of the names that are used will be different. The list of all +# members will be omitted, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_FOR_C = NO + +# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or +# Python sources only. Doxygen will then generate output that is more tailored +# for that language. For instance, namespaces will be presented as packages, +# qualified scopes will look different, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_JAVA = NO + +# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran +# sources. Doxygen will then generate output that is tailored for Fortran. +# The default value is: NO. + +OPTIMIZE_FOR_FORTRAN = NO + +# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL +# sources. Doxygen will then generate output that is tailored for VHDL. +# The default value is: NO. + +OPTIMIZE_OUTPUT_VHDL = NO + +# Doxygen selects the parser to use depending on the extension of the files it +# parses. With this tag you can assign which parser to use for a given +# extension. Doxygen has a built-in mapping, but you can override or extend it +# using this tag. The format is ext=language, where ext is a file extension, and +# language is one of the parsers supported by doxygen: IDL, Java, Javascript, +# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran: +# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran: +# Fortran. In the later case the parser tries to guess whether the code is fixed +# or free formatted code, this is the default for Fortran type files), VHDL. For +# instance to make doxygen treat .inc files as Fortran files (default is PHP), +# and .f files as C (default is Fortran), use: inc=Fortran f=C. +# +# Note: For files without extension you can use no_extension as a placeholder. +# +# Note that for custom extensions you also need to set FILE_PATTERNS otherwise +# the files are not read by doxygen. + +EXTENSION_MAPPING = + +# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments +# according to the Markdown format, which allows for more readable +# documentation. See http://daringfireball.net/projects/markdown/ for details. +# The output of markdown processing is further processed by doxygen, so you can +# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in +# case of backward compatibilities issues. +# The default value is: YES. + +MARKDOWN_SUPPORT = NO + +# When enabled doxygen tries to link words that correspond to documented +# classes, or namespaces to their corresponding documentation. Such a link can +# be prevented in individual cases by putting a % sign in front of the word or +# globally by setting AUTOLINK_SUPPORT to NO. +# The default value is: YES. + +AUTOLINK_SUPPORT = NO + +# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want +# to include (a tag file for) the STL sources as input, then you should set this +# tag to YES in order to let doxygen match functions declarations and +# definitions whose arguments contain STL classes (e.g. func(std::string); +# versus func(std::string) {}). This also make the inheritance and collaboration +# diagrams that involve STL classes more complete and accurate. +# The default value is: NO. + +BUILTIN_STL_SUPPORT = NO + +# If you use Microsoft's C++/CLI language, you should set this option to YES to +# enable parsing support. +# The default value is: NO. + +CPP_CLI_SUPPORT = NO + +# Set the SIP_SUPPORT tag to YES if your project consists of sip (see: +# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen +# will parse them like normal C++ but will assume all classes use public instead +# of private inheritance when no explicit protection keyword is present. +# The default value is: NO. + +SIP_SUPPORT = NO + +# For Microsoft's IDL there are propget and propput attributes to indicate +# getter and setter methods for a property. Setting this option to YES will make +# doxygen to replace the get and set methods by a property in the documentation. +# This will only work if the methods are indeed getting or setting a simple +# type. If this is not the case, or you want to show the methods anyway, you +# should set this option to NO. +# The default value is: YES. + +IDL_PROPERTY_SUPPORT = YES + +# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC +# tag is set to YES then doxygen will reuse the documentation of the first +# member in the group (if any) for the other members of the group. By default +# all members of a group must be documented explicitly. +# The default value is: NO. + +DISTRIBUTE_GROUP_DOC = NO + +# Set the SUBGROUPING tag to YES to allow class member groups of the same type +# (for instance a group of public functions) to be put as a subgroup of that +# type (e.g. under the Public Functions section). Set it to NO to prevent +# subgrouping. Alternatively, this can be done per class using the +# \nosubgrouping command. +# The default value is: YES. + +SUBGROUPING = YES + +# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions +# are shown inside the group in which they are included (e.g. using \ingroup) +# instead of on a separate page (for HTML and Man pages) or section (for LaTeX +# and RTF). +# +# Note that this feature does not work in combination with +# SEPARATE_MEMBER_PAGES. +# The default value is: NO. + +INLINE_GROUPED_CLASSES = NO + +# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions +# with only public data fields or simple typedef fields will be shown inline in +# the documentation of the scope in which they are defined (i.e. file, +# namespace, or group documentation), provided this scope is documented. If set +# to NO, structs, classes, and unions are shown on a separate page (for HTML and +# Man pages) or section (for LaTeX and RTF). +# The default value is: NO. + +INLINE_SIMPLE_STRUCTS = NO + +# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or +# enum is documented as struct, union, or enum with the name of the typedef. So +# typedef struct TypeS {} TypeT, will appear in the documentation as a struct +# with name TypeT. When disabled the typedef will appear as a member of a file, +# namespace, or class. And the struct will be named TypeS. This can typically be +# useful for C code in case the coding convention dictates that all compound +# types are typedef'ed and only the typedef is referenced, never the tag name. +# The default value is: NO. + +TYPEDEF_HIDES_STRUCT = NO + +# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This +# cache is used to resolve symbols given their name and scope. Since this can be +# an expensive process and often the same symbol appears multiple times in the +# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small +# doxygen will become slower. If the cache is too large, memory is wasted. The +# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range +# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536 +# symbols. At the end of a run doxygen will report the cache usage and suggest +# the optimal cache size from a speed point of view. +# Minimum value: 0, maximum value: 9, default value: 0. + +LOOKUP_CACHE_SIZE = 0 + +#--------------------------------------------------------------------------- +# Build related configuration options +#--------------------------------------------------------------------------- + +# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in +# documentation are documented, even if no documentation was available. Private +# class members and static file members will be hidden unless the +# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES. +# Note: This will also disable the warnings about undocumented members that are +# normally produced when WARNINGS is set to YES. +# The default value is: NO. + +EXTRACT_ALL = YES + +# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will +# be included in the documentation. +# The default value is: NO. + +EXTRACT_PRIVATE = NO + +# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal +# scope will be included in the documentation. +# The default value is: NO. + +EXTRACT_PACKAGE = NO + +# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be +# included in the documentation. +# The default value is: NO. + +EXTRACT_STATIC = NO + +# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined +# locally in source files will be included in the documentation. If set to NO, +# only classes defined in header files are included. Does not have any effect +# for Java sources. +# The default value is: YES. + +EXTRACT_LOCAL_CLASSES = YES + +# This flag is only useful for Objective-C code. If set to YES, local methods, +# which are defined in the implementation section but not in the interface are +# included in the documentation. If set to NO, only methods in the interface are +# included. +# The default value is: NO. + +EXTRACT_LOCAL_METHODS = YES + +# If this flag is set to YES, the members of anonymous namespaces will be +# extracted and appear in the documentation as a namespace called +# 'anonymous_namespace{file}', where file will be replaced with the base name of +# the file that contains the anonymous namespace. By default anonymous namespace +# are hidden. +# The default value is: NO. + +EXTRACT_ANON_NSPACES = NO + +# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all +# undocumented members inside documented classes or files. If set to NO these +# members will be included in the various overviews, but no documentation +# section is generated. This option has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_MEMBERS = YES + +# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all +# undocumented classes that are normally visible in the class hierarchy. If set +# to NO, these classes will be included in the various overviews. This option +# has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_CLASSES = NO + +# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend +# (class|struct|union) declarations. If set to NO, these declarations will be +# included in the documentation. +# The default value is: NO. + +HIDE_FRIEND_COMPOUNDS = NO + +# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any +# documentation blocks found inside the body of a function. If set to NO, these +# blocks will be appended to the function's detailed documentation block. +# The default value is: NO. + +HIDE_IN_BODY_DOCS = NO + +# The INTERNAL_DOCS tag determines if documentation that is typed after a +# \internal command is included. If the tag is set to NO then the documentation +# will be excluded. Set it to YES to include the internal documentation. +# The default value is: NO. + +INTERNAL_DOCS = NO + +# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file +# names in lower-case letters. If set to YES, upper-case letters are also +# allowed. This is useful if you have classes or files whose names only differ +# in case and if your file system supports case sensitive file names. Windows +# and Mac users are advised to set this option to NO. +# The default value is: system dependent. + +CASE_SENSE_NAMES = NO + +# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with +# their full class and namespace scopes in the documentation. If set to YES, the +# scope will be hidden. +# The default value is: NO. + +HIDE_SCOPE_NAMES = NO + +# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will +# append additional text to a page's title, such as Class Reference. If set to +# YES the compound reference will be hidden. +# The default value is: NO. + +HIDE_COMPOUND_REFERENCE= NO + +# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of +# the files that are included by a file in the documentation of that file. +# The default value is: YES. + +SHOW_INCLUDE_FILES = YES + +# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each +# grouped member an include statement to the documentation, telling the reader +# which file to include in order to use the member. +# The default value is: NO. + +SHOW_GROUPED_MEMB_INC = NO + +# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include +# files with double quotes in the documentation rather than with sharp brackets. +# The default value is: NO. + +FORCE_LOCAL_INCLUDES = NO + +# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the +# documentation for inline members. +# The default value is: YES. + +INLINE_INFO = YES + +# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the +# (detailed) documentation of file and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. +# The default value is: YES. + +SORT_MEMBER_DOCS = YES + +# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief +# descriptions of file, namespace and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. Note that +# this will also influence the order of the classes in the class list. +# The default value is: NO. + +SORT_BRIEF_DOCS = NO + +# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the +# (brief and detailed) documentation of class members so that constructors and +# destructors are listed first. If set to NO the constructors will appear in the +# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS. +# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief +# member documentation. +# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting +# detailed member documentation. +# The default value is: NO. + +SORT_MEMBERS_CTORS_1ST = NO + +# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy +# of group names into alphabetical order. If set to NO the group names will +# appear in their defined order. +# The default value is: NO. + +SORT_GROUP_NAMES = NO + +# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by +# fully-qualified names, including namespaces. If set to NO, the class list will +# be sorted only by class name, not including the namespace part. +# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. +# Note: This option applies only to the class list, not to the alphabetical +# list. +# The default value is: NO. + +SORT_BY_SCOPE_NAME = NO + +# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper +# type resolution of all parameters of a function it will reject a match between +# the prototype and the implementation of a member function even if there is +# only one candidate or it is obvious which candidate to choose by doing a +# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still +# accept a match between prototype and implementation in such cases. +# The default value is: NO. + +STRICT_PROTO_MATCHING = NO + +# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo +# list. This list is created by putting \todo commands in the documentation. +# The default value is: YES. + +GENERATE_TODOLIST = YES + +# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test +# list. This list is created by putting \test commands in the documentation. +# The default value is: YES. + +GENERATE_TESTLIST = YES + +# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug +# list. This list is created by putting \bug commands in the documentation. +# The default value is: YES. + +GENERATE_BUGLIST = YES + +# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO) +# the deprecated list. This list is created by putting \deprecated commands in +# the documentation. +# The default value is: YES. + +GENERATE_DEPRECATEDLIST= YES + +# The ENABLED_SECTIONS tag can be used to enable conditional documentation +# sections, marked by \if <section_label> ... \endif and \cond <section_label> +# ... \endcond blocks. + +ENABLED_SECTIONS = + +# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the +# initial value of a variable or macro / define can have for it to appear in the +# documentation. If the initializer consists of more lines than specified here +# it will be hidden. Use a value of 0 to hide initializers completely. The +# appearance of the value of individual variables and macros / defines can be +# controlled using \showinitializer or \hideinitializer command in the +# documentation regardless of this setting. +# Minimum value: 0, maximum value: 10000, default value: 30. + +MAX_INITIALIZER_LINES = 30 + +# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at +# the bottom of the documentation of classes and structs. If set to YES, the +# list will mention the files that were used to generate the documentation. +# The default value is: YES. + +SHOW_USED_FILES = YES + +# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This +# will remove the Files entry from the Quick Index and from the Folder Tree View +# (if specified). +# The default value is: YES. + +SHOW_FILES = YES + +# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces +# page. This will remove the Namespaces entry from the Quick Index and from the +# Folder Tree View (if specified). +# The default value is: YES. + +SHOW_NAMESPACES = YES + +# The FILE_VERSION_FILTER tag can be used to specify a program or script that +# doxygen should invoke to get the current version for each file (typically from +# the version control system). Doxygen will invoke the program by executing (via +# popen()) the command command input-file, where command is the value of the +# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided +# by doxygen. Whatever the program writes to standard output is used as the file +# version. For an example see the documentation. + +FILE_VERSION_FILTER = + +# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed +# by doxygen. The layout file controls the global structure of the generated +# output files in an output format independent way. To create the layout file +# that represents doxygen's defaults, run doxygen with the -l option. You can +# optionally specify a file name after the option, if omitted DoxygenLayout.xml +# will be used as the name of the layout file. +# +# Note that if you run doxygen from a directory containing a file called +# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE +# tag is left empty. + +LAYOUT_FILE = + +# The CITE_BIB_FILES tag can be used to specify one or more bib files containing +# the reference definitions. This must be a list of .bib files. The .bib +# extension is automatically appended if omitted. This requires the bibtex tool +# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info. +# For LaTeX the style of the bibliography can be controlled using +# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the +# search path. See also \cite for info how to create references. + +CITE_BIB_FILES = + +#--------------------------------------------------------------------------- +# Configuration options related to warning and progress messages +#--------------------------------------------------------------------------- + +# The QUIET tag can be used to turn on/off the messages that are generated to +# standard output by doxygen. If QUIET is set to YES this implies that the +# messages are off. +# The default value is: NO. + +QUIET = NO + +# The WARNINGS tag can be used to turn on/off the warning messages that are +# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES +# this implies that the warnings are on. +# +# Tip: Turn warnings on while writing the documentation. +# The default value is: YES. + +WARNINGS = YES + +# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate +# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag +# will automatically be disabled. +# The default value is: YES. + +WARN_IF_UNDOCUMENTED = YES + +# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for +# potential errors in the documentation, such as not documenting some parameters +# in a documented function, or documenting parameters that don't exist or using +# markup commands wrongly. +# The default value is: YES. + +WARN_IF_DOC_ERROR = YES + +# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that +# are documented, but have no documentation for their parameters or return +# value. If set to NO, doxygen will only warn about wrong or incomplete +# parameter documentation, but not about the absence of documentation. +# The default value is: NO. + +WARN_NO_PARAMDOC = YES + +# The WARN_FORMAT tag determines the format of the warning messages that doxygen +# can produce. The string should contain the $file, $line, and $text tags, which +# will be replaced by the file and line number from which the warning originated +# and the warning text. Optionally the format may contain $version, which will +# be replaced by the version of the file (if it could be obtained via +# FILE_VERSION_FILTER) +# The default value is: $file:$line: $text. + +WARN_FORMAT = "$file:$line: $text" + +# The WARN_LOGFILE tag can be used to specify a file to which warning and error +# messages should be written. If left blank the output is written to standard +# error (stderr). + +WARN_LOGFILE = doxywarnings.log + +#--------------------------------------------------------------------------- +# Configuration options related to the input files +#--------------------------------------------------------------------------- + +# The INPUT tag is used to specify the files and/or directories that contain +# documented source files. You may enter file names like myfile.cpp or +# directories like /usr/src/myproject. Separate the files or directories with +# spaces. +# Note: If this tag is empty the current directory is searched. + +INPUT = ../../include/boost/sort \ + ../../include/boost/sort/spreadsort \ + ../../example + +# This tag can be used to specify the character encoding of the source files +# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses +# libiconv (or the iconv built into libc) for the transcoding. See the libiconv +# documentation (see: http://www.gnu.org/software/libiconv) for the list of +# possible encodings. +# The default value is: UTF-8. + +INPUT_ENCODING = UTF-8 + +# If the value of the INPUT tag contains directories, you can use the +# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and +# *.h) to filter out the source-files in the directories. If left blank the +# following patterns are tested:*.c, *.cc, *.cxx, *.cpp, *.c++, *.java, *.ii, +# *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp, +# *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown, +# *.md, *.mm, *.dox, *.py, *.f90, *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf, +# *.qsf, *.as and *.js. + +FILE_PATTERNS = *.c \ + *.cc \ + *.cxx \ + *.cpp \ + *.c++ \ + *.java \ + *.ii \ + *.ixx \ + *.ipp \ + *.i++ \ + *.inl \ + *.idl \ + *.ddl \ + *.odl \ + *.h \ + *.hh \ + *.hxx \ + *.hpp \ + *.h++ \ + *.cs \ + *.d \ + *.php \ + *.php4 \ + *.php5 \ + *.phtml \ + *.inc \ + *.m \ + *.markdown \ + *.md \ + *.mm \ + *.dox \ + *.py \ + *.f90 \ + *.f \ + *.for \ + *.tcl \ + *.vhd \ + *.vhdl \ + *.ucf \ + *.qsf \ + *.as \ + *.js + +# The RECURSIVE tag can be used to specify whether or not subdirectories should +# be searched for input files as well. +# The default value is: NO. + +RECURSIVE = NO + +# The EXCLUDE tag can be used to specify files and/or directories that should be +# excluded from the INPUT source files. This way you can easily exclude a +# subdirectory from a directory tree whose root is specified with the INPUT tag. +# +# Note that relative paths are relative to the directory from which doxygen is +# run. + +EXCLUDE = + +# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or +# directories that are symbolic links (a Unix file system feature) are excluded +# from the input. +# The default value is: NO. + +EXCLUDE_SYMLINKS = NO + +# If the value of the INPUT tag contains directories, you can use the +# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude +# certain files from those directories. +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories for example use the pattern */test/* + +EXCLUDE_PATTERNS = + +# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names +# (namespaces, classes, functions, etc.) that should be excluded from the +# output. The symbol name can be a fully qualified name, a word, or if the +# wildcard * is used, a substring. Examples: ANamespace, AClass, +# AClass::ANamespace, ANamespace::*Test +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories use the pattern */test/* + +EXCLUDE_SYMBOLS = + +# The EXAMPLE_PATH tag can be used to specify one or more files or directories +# that contain example code fragments that are included (see the \include +# command). + +EXAMPLE_PATH = + +# If the value of the EXAMPLE_PATH tag contains directories, you can use the +# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and +# *.h) to filter out the source-files in the directories. If left blank all +# files are included. + +EXAMPLE_PATTERNS = * + +# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be +# searched for input files to be used with the \include or \dontinclude commands +# irrespective of the value of the RECURSIVE tag. +# The default value is: NO. + +EXAMPLE_RECURSIVE = NO + +# The IMAGE_PATH tag can be used to specify one or more files or directories +# that contain images that are to be included in the documentation (see the +# \image command). + +IMAGE_PATH = + +# The INPUT_FILTER tag can be used to specify a program that doxygen should +# invoke to filter for each input file. Doxygen will invoke the filter program +# by executing (via popen()) the command: +# +# <filter> <input-file> +# +# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the +# name of an input file. Doxygen will then use the output that the filter +# program writes to standard output. If FILTER_PATTERNS is specified, this tag +# will be ignored. +# +# Note that the filter must not add or remove lines; it is applied before the +# code is scanned, but not when the output code is generated. If lines are added +# or removed, the anchors will not be placed correctly. + +INPUT_FILTER = + +# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern +# basis. Doxygen will compare the file name with each pattern and apply the +# filter if there is a match. The filters are a list of the form: pattern=filter +# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how +# filters are used. If the FILTER_PATTERNS tag is empty or if none of the +# patterns match the file name, INPUT_FILTER is applied. + +FILTER_PATTERNS = + +# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using +# INPUT_FILTER) will also be used to filter the input files that are used for +# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES). +# The default value is: NO. + +FILTER_SOURCE_FILES = NO + +# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file +# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and +# it is also possible to disable source filtering for a specific pattern using +# *.ext= (so without naming a filter). +# This tag requires that the tag FILTER_SOURCE_FILES is set to YES. + +FILTER_SOURCE_PATTERNS = + +# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that +# is part of the input, its contents will be placed on the main page +# (index.html). This can be useful if you have a project on for instance GitHub +# and want to reuse the introduction page also for the doxygen output. + +USE_MDFILE_AS_MAINPAGE = + +#--------------------------------------------------------------------------- +# Configuration options related to source browsing +#--------------------------------------------------------------------------- + +# If the SOURCE_BROWSER tag is set to YES then a list of source files will be +# generated. Documented entities will be cross-referenced with these sources. +# +# Note: To get rid of all source code in the generated output, make sure that +# also VERBATIM_HEADERS is set to NO. +# The default value is: NO. + +SOURCE_BROWSER = NO + +# Setting the INLINE_SOURCES tag to YES will include the body of functions, +# classes and enums directly into the documentation. +# The default value is: NO. + +INLINE_SOURCES = NO + +# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any +# special comment blocks from generated source code fragments. Normal C, C++ and +# Fortran comments will always remain visible. +# The default value is: YES. + +STRIP_CODE_COMMENTS = NO + +# If the REFERENCED_BY_RELATION tag is set to YES then for each documented +# function all documented functions referencing it will be listed. +# The default value is: NO. + +REFERENCED_BY_RELATION = NO + +# If the REFERENCES_RELATION tag is set to YES then for each documented function +# all documented entities called/used by that function will be listed. +# The default value is: NO. + +REFERENCES_RELATION = NO + +# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set +# to YES then the hyperlinks from functions in REFERENCES_RELATION and +# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will +# link to the documentation. +# The default value is: YES. + +REFERENCES_LINK_SOURCE = YES + +# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the +# source code will show a tooltip with additional information such as prototype, +# brief description and links to the definition and documentation. Since this +# will make the HTML file larger and loading of large files a bit slower, you +# can opt to disable this feature. +# The default value is: YES. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +SOURCE_TOOLTIPS = YES + +# If the USE_HTAGS tag is set to YES then the references to source code will +# point to the HTML generated by the htags(1) tool instead of doxygen built-in +# source browser. The htags tool is part of GNU's global source tagging system +# (see http://www.gnu.org/software/global/global.html). You will need version +# 4.8.6 or higher. +# +# To use it do the following: +# - Install the latest version of global +# - Enable SOURCE_BROWSER and USE_HTAGS in the config file +# - Make sure the INPUT points to the root of the source tree +# - Run doxygen as normal +# +# Doxygen will invoke htags (and that will in turn invoke gtags), so these +# tools must be available from the command line (i.e. in the search path). +# +# The result: instead of the source browser generated by doxygen, the links to +# source code will now point to the output of htags. +# The default value is: NO. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +USE_HTAGS = NO + +# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a +# verbatim copy of the header file for each class for which an include is +# specified. Set to NO to disable this. +# See also: Section \class. +# The default value is: YES. + +VERBATIM_HEADERS = YES + +# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the +# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the +# cost of reduced performance. This can be particularly helpful with template +# rich C++ code for which doxygen's built-in parser lacks the necessary type +# information. +# Note: The availability of this option depends on whether or not doxygen was +# compiled with the --with-libclang option. +# The default value is: NO. + +CLANG_ASSISTED_PARSING = NO + +# If clang assisted parsing is enabled you can provide the compiler with command +# line options that you would normally use when invoking the compiler. Note that +# the include paths will already be set by doxygen for the files and directories +# specified with INPUT and INCLUDE_PATH. +# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES. + +CLANG_OPTIONS = + +#--------------------------------------------------------------------------- +# Configuration options related to the alphabetical class index +#--------------------------------------------------------------------------- + +# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all +# compounds will be generated. Enable this if the project contains a lot of +# classes, structs, unions or interfaces. +# The default value is: YES. + +ALPHABETICAL_INDEX = YES + +# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in +# which the alphabetical index list will be split. +# Minimum value: 1, maximum value: 20, default value: 5. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +COLS_IN_ALPHA_INDEX = 5 + +# In case all classes in a project start with a common prefix, all classes will +# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag +# can be used to specify a prefix (or a list of prefixes) that should be ignored +# while generating the index headers. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +IGNORE_PREFIX = + +#--------------------------------------------------------------------------- +# Configuration options related to the HTML output +#--------------------------------------------------------------------------- + +# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output +# The default value is: YES. + +GENERATE_HTML = YES + +# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_OUTPUT = html + +# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each +# generated HTML page (for example: .htm, .php, .asp). +# The default value is: .html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FILE_EXTENSION = .html + +# The HTML_HEADER tag can be used to specify a user-defined HTML header file for +# each generated HTML page. If the tag is left blank doxygen will generate a +# standard header. +# +# To get valid HTML the header file that includes any scripts and style sheets +# that doxygen needs, which is dependent on the configuration options used (e.g. +# the setting GENERATE_TREEVIEW). It is highly recommended to start with a +# default header using +# doxygen -w html new_header.html new_footer.html new_stylesheet.css +# YourConfigFile +# and then modify the file new_header.html. See also section "Doxygen usage" +# for information on how to generate the default header that doxygen normally +# uses. +# Note: The header is subject to change so you typically have to regenerate the +# default header when upgrading to a newer version of doxygen. For a description +# of the possible markers and block names see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_HEADER = + +# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each +# generated HTML page. If the tag is left blank doxygen will generate a standard +# footer. See HTML_HEADER for more information on how to generate a default +# footer and what special commands can be used inside the footer. See also +# section "Doxygen usage" for information on how to generate the default footer +# that doxygen normally uses. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FOOTER = + +# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style +# sheet that is used by each HTML page. It can be used to fine-tune the look of +# the HTML output. If left blank doxygen will generate a default style sheet. +# See also section "Doxygen usage" for information on how to generate the style +# sheet that doxygen normally uses. +# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as +# it is more robust and this tag (HTML_STYLESHEET) will in the future become +# obsolete. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_STYLESHEET = + +# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined +# cascading style sheets that are included after the standard style sheets +# created by doxygen. Using this option one can overrule certain style aspects. +# This is preferred over using HTML_STYLESHEET since it does not replace the +# standard style sheet and is therefore more robust against future updates. +# Doxygen will copy the style sheet files to the output directory. +# Note: The order of the extra style sheet files is of importance (e.g. the last +# style sheet in the list overrules the setting of the previous ones in the +# list). For an example see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_STYLESHEET = + +# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or +# other source files which should be copied to the HTML output directory. Note +# that these files will be copied to the base HTML output directory. Use the +# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these +# files. In the HTML_STYLESHEET file, use the file name only. Also note that the +# files will be copied as-is; there are no commands or markers available. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_FILES = + +# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen +# will adjust the colors in the style sheet and background images according to +# this color. Hue is specified as an angle on a colorwheel, see +# http://en.wikipedia.org/wiki/Hue for more information. For instance the value +# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300 +# purple, and 360 is red again. +# Minimum value: 0, maximum value: 359, default value: 220. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_HUE = 220 + +# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors +# in the HTML output. For a value of 0 the output will use grayscales only. A +# value of 255 will produce the most vivid colors. +# Minimum value: 0, maximum value: 255, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_SAT = 100 + +# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the +# luminance component of the colors in the HTML output. Values below 100 +# gradually make the output lighter, whereas values above 100 make the output +# darker. The value divided by 100 is the actual gamma applied, so 80 represents +# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not +# change the gamma. +# Minimum value: 40, maximum value: 240, default value: 80. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_GAMMA = 80 + +# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML +# page will contain the date and time when the page was generated. Setting this +# to NO can help when comparing the output of multiple runs. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_TIMESTAMP = YES + +# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML +# documentation will contain sections that can be hidden and shown after the +# page has loaded. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_DYNAMIC_SECTIONS = NO + +# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries +# shown in the various tree structured indices initially; the user can expand +# and collapse entries dynamically later on. Doxygen will expand the tree to +# such a level that at most the specified number of entries are visible (unless +# a fully collapsed tree already exceeds this amount). So setting the number of +# entries 1 will produce a full collapsed tree by default. 0 is a special value +# representing an infinite number of entries and will result in a full expanded +# tree by default. +# Minimum value: 0, maximum value: 9999, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_INDEX_NUM_ENTRIES = 100 + +# If the GENERATE_DOCSET tag is set to YES, additional index files will be +# generated that can be used as input for Apple's Xcode 3 integrated development +# environment (see: http://developer.apple.com/tools/xcode/), introduced with +# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a +# Makefile in the HTML output directory. Running make will produce the docset in +# that directory and running make install will install the docset in +# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at +# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html +# for more information. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_DOCSET = NO + +# This tag determines the name of the docset feed. A documentation feed provides +# an umbrella under which multiple documentation sets from a single provider +# (such as a company or product suite) can be grouped. +# The default value is: Doxygen generated docs. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_FEEDNAME = "Doxygen generated docs" + +# This tag specifies a string that should uniquely identify the documentation +# set bundle. This should be a reverse domain-name style string, e.g. +# com.mycompany.MyDocSet. Doxygen will append .docset to the name. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_BUNDLE_ID = org.doxygen.Project + +# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify +# the documentation publisher. This should be a reverse domain-name style +# string, e.g. com.mycompany.MyDocSet.documentation. +# The default value is: org.doxygen.Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_ID = org.doxygen.Publisher + +# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher. +# The default value is: Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_NAME = Publisher + +# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three +# additional HTML index files: index.hhp, index.hhc, and index.hhk. The +# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop +# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on +# Windows. +# +# The HTML Help Workshop contains a compiler that can convert all HTML output +# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML +# files are now used as the Windows 98 help format, and will replace the old +# Windows help format (.hlp) on all Windows platforms in the future. Compressed +# HTML files also contain an index, a table of contents, and you can search for +# words in the documentation. The HTML workshop also contains a viewer for +# compressed HTML files. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_HTMLHELP = NO + +# The CHM_FILE tag can be used to specify the file name of the resulting .chm +# file. You can add a path in front of the file if the result should not be +# written to the html output directory. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_FILE = + +# The HHC_LOCATION tag can be used to specify the location (absolute path +# including file name) of the HTML help compiler (hhc.exe). If non-empty, +# doxygen will try to run the HTML help compiler on the generated index.hhp. +# The file has to be specified with full path. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +HHC_LOCATION = + +# The GENERATE_CHI flag controls if a separate .chi index file is generated +# (YES) or that it should be included in the master .chm file (NO). +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +GENERATE_CHI = NO + +# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc) +# and project file content. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_INDEX_ENCODING = + +# The BINARY_TOC flag controls whether a binary table of contents is generated +# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it +# enables the Previous and Next buttons. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +BINARY_TOC = NO + +# The TOC_EXPAND flag can be set to YES to add extra items for group members to +# the table of contents of the HTML help documentation and to the tree view. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +TOC_EXPAND = NO + +# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and +# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that +# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help +# (.qch) of the generated HTML documentation. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_QHP = NO + +# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify +# the file name of the resulting .qch file. The path specified is relative to +# the HTML output folder. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QCH_FILE = + +# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help +# Project output. For more information please see Qt Help Project / Namespace +# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace). +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_NAMESPACE = org.doxygen.Project + +# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt +# Help Project output. For more information please see Qt Help Project / Virtual +# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual- +# folders). +# The default value is: doc. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_VIRTUAL_FOLDER = doc + +# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom +# filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom- +# filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_NAME = + +# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the +# custom filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom- +# filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_ATTRS = + +# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this +# project's filter section matches. Qt Help Project / Filter Attributes (see: +# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_SECT_FILTER_ATTRS = + +# The QHG_LOCATION tag can be used to specify the location of Qt's +# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the +# generated .qhp file. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHG_LOCATION = + +# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be +# generated, together with the HTML files, they form an Eclipse help plugin. To +# install this plugin and make it available under the help contents menu in +# Eclipse, the contents of the directory containing the HTML and XML files needs +# to be copied into the plugins directory of eclipse. The name of the directory +# within the plugins directory should be the same as the ECLIPSE_DOC_ID value. +# After copying Eclipse needs to be restarted before the help appears. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_ECLIPSEHELP = NO + +# A unique identifier for the Eclipse help plugin. When installing the plugin +# the directory name containing the HTML and XML files should also have this +# name. Each documentation set should have its own identifier. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES. + +ECLIPSE_DOC_ID = org.doxygen.Project + +# If you want full control over the layout of the generated HTML pages it might +# be necessary to disable the index and replace it with your own. The +# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top +# of each HTML page. A value of NO enables the index and the value YES disables +# it. Since the tabs in the index contain the same information as the navigation +# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +DISABLE_INDEX = NO + +# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index +# structure should be generated to display hierarchical information. If the tag +# value is set to YES, a side panel will be generated containing a tree-like +# index structure (just like the one that is generated for HTML Help). For this +# to work a browser that supports JavaScript, DHTML, CSS and frames is required +# (i.e. any modern browser). Windows users are probably better off using the +# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can +# further fine-tune the look of the index. As an example, the default style +# sheet generated by doxygen has an example that shows how to put an image at +# the root of the tree instead of the PROJECT_NAME. Since the tree basically has +# the same information as the tab index, you could consider setting +# DISABLE_INDEX to YES when enabling this option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_TREEVIEW = NO + +# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that +# doxygen will group on one line in the generated HTML documentation. +# +# Note that a value of 0 will completely suppress the enum values from appearing +# in the overview section. +# Minimum value: 0, maximum value: 20, default value: 4. +# This tag requires that the tag GENERATE_HTML is set to YES. + +ENUM_VALUES_PER_LINE = 4 + +# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used +# to set the initial width (in pixels) of the frame in which the tree is shown. +# Minimum value: 0, maximum value: 1500, default value: 250. +# This tag requires that the tag GENERATE_HTML is set to YES. + +TREEVIEW_WIDTH = 250 + +# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to +# external symbols imported via tag files in a separate window. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +EXT_LINKS_IN_WINDOW = NO + +# Use this tag to change the font size of LaTeX formulas included as images in +# the HTML documentation. When you change the font size after a successful +# doxygen run you need to manually remove any form_*.png images from the HTML +# output directory to force them to be regenerated. +# Minimum value: 8, maximum value: 50, default value: 10. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_FONTSIZE = 10 + +# Use the FORMULA_TRANPARENT tag to determine whether or not the images +# generated for formulas are transparent PNGs. Transparent PNGs are not +# supported properly for IE 6.0, but are supported on all modern browsers. +# +# Note that when changing this option you need to delete any form_*.png files in +# the HTML output directory before the changes have effect. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_TRANSPARENT = YES + +# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see +# http://www.mathjax.org) which uses client side Javascript for the rendering +# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX +# installed or if you want to formulas look prettier in the HTML output. When +# enabled you may also need to install MathJax separately and configure the path +# to it using the MATHJAX_RELPATH option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +USE_MATHJAX = NO + +# When MathJax is enabled you can set the default output format to be used for +# the MathJax output. See the MathJax site (see: +# http://docs.mathjax.org/en/latest/output.html) for more details. +# Possible values are: HTML-CSS (which is slower, but has the best +# compatibility), NativeMML (i.e. MathML) and SVG. +# The default value is: HTML-CSS. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_FORMAT = HTML-CSS + +# When MathJax is enabled you need to specify the location relative to the HTML +# output directory using the MATHJAX_RELPATH option. The destination directory +# should contain the MathJax.js script. For instance, if the mathjax directory +# is located at the same level as the HTML output directory, then +# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax +# Content Delivery Network so you can quickly see the result without installing +# MathJax. However, it is strongly recommended to install a local copy of +# MathJax from http://www.mathjax.org before deployment. +# The default value is: http://cdn.mathjax.org/mathjax/latest. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest + +# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax +# extension names that should be enabled during MathJax rendering. For example +# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_EXTENSIONS = + +# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces +# of code that will be used on startup of the MathJax code. See the MathJax site +# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an +# example see the documentation. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_CODEFILE = + +# When the SEARCHENGINE tag is enabled doxygen will generate a search box for +# the HTML output. The underlying search engine uses javascript and DHTML and +# should work on any modern browser. Note that when using HTML help +# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) +# there is already a search function so this one should typically be disabled. +# For large projects the javascript based search engine can be slow, then +# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to +# search using the keyboard; to jump to the search box use <access key> + S +# (what the <access key> is depends on the OS and browser, but it is typically +# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down +# key> to jump into the search results window, the results can be navigated +# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel +# the search. The filter options can be selected when the cursor is inside the +# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys> +# to select a filter and <Enter> or <escape> to activate or cancel the filter +# option. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +SEARCHENGINE = YES + +# When the SERVER_BASED_SEARCH tag is enabled the search engine will be +# implemented using a web server instead of a web client using Javascript. There +# are two flavors of web server based searching depending on the EXTERNAL_SEARCH +# setting. When disabled, doxygen will generate a PHP script for searching and +# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing +# and searching needs to be provided by external tools. See the section +# "External Indexing and Searching" for details. +# The default value is: NO. +# This tag requires that the tag SEARCHENGINE is set to YES. + +SERVER_BASED_SEARCH = NO + +# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP +# script for searching. Instead the search results are written to an XML file +# which needs to be processed by an external indexer. Doxygen will invoke an +# external search engine pointed to by the SEARCHENGINE_URL option to obtain the +# search results. +# +# Doxygen ships with an example indexer (doxyindexer) and search engine +# (doxysearch.cgi) which are based on the open source search engine library +# Xapian (see: http://xapian.org/). +# +# See the section "External Indexing and Searching" for details. +# The default value is: NO. +# This tag requires that the tag SEARCHENGINE is set to YES. + +EXTERNAL_SEARCH = NO + +# The SEARCHENGINE_URL should point to a search engine hosted by a web server +# which will return the search results when EXTERNAL_SEARCH is enabled. +# +# Doxygen ships with an example indexer (doxyindexer) and search engine +# (doxysearch.cgi) which are based on the open source search engine library +# Xapian (see: http://xapian.org/). See the section "External Indexing and +# Searching" for details. +# This tag requires that the tag SEARCHENGINE is set to YES. + +SEARCHENGINE_URL = + +# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed +# search data is written to a file for indexing by an external tool. With the +# SEARCHDATA_FILE tag the name of this file can be specified. +# The default file is: searchdata.xml. +# This tag requires that the tag SEARCHENGINE is set to YES. + +SEARCHDATA_FILE = searchdata.xml + +# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the +# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is +# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple +# projects and redirect the results back to the right project. +# This tag requires that the tag SEARCHENGINE is set to YES. + +EXTERNAL_SEARCH_ID = + +# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen +# projects other than the one defined by this configuration file, but that are +# all added to the same external search index. Each project needs to have a +# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of +# to a relative location where the documentation can be found. The format is: +# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ... +# This tag requires that the tag SEARCHENGINE is set to YES. + +EXTRA_SEARCH_MAPPINGS = + +#--------------------------------------------------------------------------- +# Configuration options related to the LaTeX output +#--------------------------------------------------------------------------- + +# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output. +# The default value is: YES. + +GENERATE_LATEX = NO + +# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: latex. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_OUTPUT = latex + +# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be +# invoked. +# +# Note that when enabling USE_PDFLATEX this option is only used for generating +# bitmaps for formulas in the HTML output, but not in the Makefile that is +# written to the output directory. +# The default file is: latex. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_CMD_NAME = latex + +# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate +# index for LaTeX. +# The default file is: makeindex. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +MAKEINDEX_CMD_NAME = makeindex + +# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX +# documents. This may be useful for small projects and may help to save some +# trees in general. +# The default value is: NO. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +COMPACT_LATEX = NO + +# The PAPER_TYPE tag can be used to set the paper type that is used by the +# printer. +# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x +# 14 inches) and executive (7.25 x 10.5 inches). +# The default value is: a4. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +PAPER_TYPE = a4 + +# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names +# that should be included in the LaTeX output. To get the times font for +# instance you can specify +# EXTRA_PACKAGES=times +# If left blank no extra packages will be included. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +EXTRA_PACKAGES = + +# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the +# generated LaTeX document. The header should contain everything until the first +# chapter. If it is left blank doxygen will generate a standard header. See +# section "Doxygen usage" for information on how to let doxygen write the +# default header to a separate file. +# +# Note: Only use a user-defined header if you know what you are doing! The +# following commands have a special meaning inside the header: $title, +# $datetime, $date, $doxygenversion, $projectname, $projectnumber, +# $projectbrief, $projectlogo. Doxygen will replace $title with the empty +# string, for the replacement values of the other commands the user is referred +# to HTML_HEADER. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_HEADER = + +# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the +# generated LaTeX document. The footer should contain everything after the last +# chapter. If it is left blank doxygen will generate a standard footer. See +# LATEX_HEADER for more information on how to generate a default footer and what +# special commands can be used inside the footer. +# +# Note: Only use a user-defined footer if you know what you are doing! +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_FOOTER = + +# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined +# LaTeX style sheets that are included after the standard style sheets created +# by doxygen. Using this option one can overrule certain style aspects. Doxygen +# will copy the style sheet files to the output directory. +# Note: The order of the extra style sheet files is of importance (e.g. the last +# style sheet in the list overrules the setting of the previous ones in the +# list). +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_EXTRA_STYLESHEET = + +# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or +# other source files which should be copied to the LATEX_OUTPUT output +# directory. Note that the files will be copied as-is; there are no commands or +# markers available. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_EXTRA_FILES = + +# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is +# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will +# contain links (just like the HTML output) instead of page references. This +# makes the output suitable for online browsing using a PDF viewer. +# The default value is: YES. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +PDF_HYPERLINKS = YES + +# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate +# the PDF file directly from the LaTeX files. Set this option to YES, to get a +# higher quality PDF documentation. +# The default value is: YES. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +USE_PDFLATEX = YES + +# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode +# command to the generated LaTeX files. This will instruct LaTeX to keep running +# if errors occur, instead of asking the user for help. This option is also used +# when generating formulas in HTML. +# The default value is: NO. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_BATCHMODE = NO + +# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the +# index chapters (such as File Index, Compound Index, etc.) in the output. +# The default value is: NO. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_HIDE_INDICES = NO + +# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source +# code with syntax highlighting in the LaTeX output. +# +# Note that which sources are shown also depends on other settings such as +# SOURCE_BROWSER. +# The default value is: NO. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_SOURCE_CODE = NO + +# The LATEX_BIB_STYLE tag can be used to specify the style to use for the +# bibliography, e.g. plainnat, or ieeetr. See +# http://en.wikipedia.org/wiki/BibTeX and \cite for more info. +# The default value is: plain. +# This tag requires that the tag GENERATE_LATEX is set to YES. + +LATEX_BIB_STYLE = plain + +#--------------------------------------------------------------------------- +# Configuration options related to the RTF output +#--------------------------------------------------------------------------- + +# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The +# RTF output is optimized for Word 97 and may not look too pretty with other RTF +# readers/editors. +# The default value is: NO. + +GENERATE_RTF = NO + +# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: rtf. +# This tag requires that the tag GENERATE_RTF is set to YES. + +RTF_OUTPUT = rtf + +# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF +# documents. This may be useful for small projects and may help to save some +# trees in general. +# The default value is: NO. +# This tag requires that the tag GENERATE_RTF is set to YES. + +COMPACT_RTF = NO + +# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will +# contain hyperlink fields. The RTF file will contain links (just like the HTML +# output) instead of page references. This makes the output suitable for online +# browsing using Word or some other Word compatible readers that support those +# fields. +# +# Note: WordPad (write) and others do not support links. +# The default value is: NO. +# This tag requires that the tag GENERATE_RTF is set to YES. + +RTF_HYPERLINKS = NO + +# Load stylesheet definitions from file. Syntax is similar to doxygen's config +# file, i.e. a series of assignments. You only have to provide replacements, +# missing definitions are set to their default value. +# +# See also section "Doxygen usage" for information on how to generate the +# default style sheet that doxygen normally uses. +# This tag requires that the tag GENERATE_RTF is set to YES. + +RTF_STYLESHEET_FILE = + +# Set optional variables used in the generation of an RTF document. Syntax is +# similar to doxygen's config file. A template extensions file can be generated +# using doxygen -e rtf extensionFile. +# This tag requires that the tag GENERATE_RTF is set to YES. + +RTF_EXTENSIONS_FILE = + +# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code +# with syntax highlighting in the RTF output. +# +# Note that which sources are shown also depends on other settings such as +# SOURCE_BROWSER. +# The default value is: NO. +# This tag requires that the tag GENERATE_RTF is set to YES. + +RTF_SOURCE_CODE = NO + +#--------------------------------------------------------------------------- +# Configuration options related to the man page output +#--------------------------------------------------------------------------- + +# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for +# classes and files. +# The default value is: NO. + +GENERATE_MAN = NO + +# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. A directory man3 will be created inside the directory specified by +# MAN_OUTPUT. +# The default directory is: man. +# This tag requires that the tag GENERATE_MAN is set to YES. + +MAN_OUTPUT = man + +# The MAN_EXTENSION tag determines the extension that is added to the generated +# man pages. In case the manual section does not start with a number, the number +# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is +# optional. +# The default value is: .3. +# This tag requires that the tag GENERATE_MAN is set to YES. + +MAN_EXTENSION = .3 + +# The MAN_SUBDIR tag determines the name of the directory created within +# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by +# MAN_EXTENSION with the initial . removed. +# This tag requires that the tag GENERATE_MAN is set to YES. + +MAN_SUBDIR = + +# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it +# will generate one additional man file for each entity documented in the real +# man page(s). These additional files only source the real man page, but without +# them the man command would be unable to find the correct page. +# The default value is: NO. +# This tag requires that the tag GENERATE_MAN is set to YES. + +MAN_LINKS = NO + +#--------------------------------------------------------------------------- +# Configuration options related to the XML output +#--------------------------------------------------------------------------- + +# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that +# captures the structure of the code including all documentation. +# The default value is: NO. + +GENERATE_XML = NO + +# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: xml. +# This tag requires that the tag GENERATE_XML is set to YES. + +XML_OUTPUT = xml + +# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program +# listings (including syntax highlighting and cross-referencing information) to +# the XML output. Note that enabling this will significantly increase the size +# of the XML output. +# The default value is: YES. +# This tag requires that the tag GENERATE_XML is set to YES. + +XML_PROGRAMLISTING = YES + +#--------------------------------------------------------------------------- +# Configuration options related to the DOCBOOK output +#--------------------------------------------------------------------------- + +# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files +# that can be used to generate PDF. +# The default value is: NO. + +GENERATE_DOCBOOK = NO + +# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in +# front of it. +# The default directory is: docbook. +# This tag requires that the tag GENERATE_DOCBOOK is set to YES. + +DOCBOOK_OUTPUT = docbook + +# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the +# program listings (including syntax highlighting and cross-referencing +# information) to the DOCBOOK output. Note that enabling this will significantly +# increase the size of the DOCBOOK output. +# The default value is: NO. +# This tag requires that the tag GENERATE_DOCBOOK is set to YES. + +DOCBOOK_PROGRAMLISTING = NO + +#--------------------------------------------------------------------------- +# Configuration options for the AutoGen Definitions output +#--------------------------------------------------------------------------- + +# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an +# AutoGen Definitions (see http://autogen.sf.net) file that captures the +# structure of the code including all documentation. Note that this feature is +# still experimental and incomplete at the moment. +# The default value is: NO. + +GENERATE_AUTOGEN_DEF = NO + +#--------------------------------------------------------------------------- +# Configuration options related to the Perl module output +#--------------------------------------------------------------------------- + +# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module +# file that captures the structure of the code including all documentation. +# +# Note that this feature is still experimental and incomplete at the moment. +# The default value is: NO. + +GENERATE_PERLMOD = NO + +# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary +# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI +# output from the Perl module output. +# The default value is: NO. +# This tag requires that the tag GENERATE_PERLMOD is set to YES. + +PERLMOD_LATEX = NO + +# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely +# formatted so it can be parsed by a human reader. This is useful if you want to +# understand what is going on. On the other hand, if this tag is set to NO, the +# size of the Perl module output will be much smaller and Perl will parse it +# just the same. +# The default value is: YES. +# This tag requires that the tag GENERATE_PERLMOD is set to YES. + +PERLMOD_PRETTY = YES + +# The names of the make variables in the generated doxyrules.make file are +# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful +# so different doxyrules.make files included by the same Makefile don't +# overwrite each other's variables. +# This tag requires that the tag GENERATE_PERLMOD is set to YES. + +PERLMOD_MAKEVAR_PREFIX = + +#--------------------------------------------------------------------------- +# Configuration options related to the preprocessor +#--------------------------------------------------------------------------- + +# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all +# C-preprocessor directives found in the sources and include files. +# The default value is: YES. + +ENABLE_PREPROCESSING = YES + +# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names +# in the source code. If set to NO, only conditional compilation will be +# performed. Macro expansion can be done in a controlled way by setting +# EXPAND_ONLY_PREDEF to YES. +# The default value is: NO. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +MACRO_EXPANSION = NO + +# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then +# the macro expansion is limited to the macros specified with the PREDEFINED and +# EXPAND_AS_DEFINED tags. +# The default value is: NO. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +EXPAND_ONLY_PREDEF = NO + +# If the SEARCH_INCLUDES tag is set to YES, the include files in the +# INCLUDE_PATH will be searched if a #include is found. +# The default value is: YES. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +SEARCH_INCLUDES = YES + +# The INCLUDE_PATH tag can be used to specify one or more directories that +# contain include files that are not input files but should be processed by the +# preprocessor. +# This tag requires that the tag SEARCH_INCLUDES is set to YES. + +INCLUDE_PATH = + +# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard +# patterns (like *.h and *.hpp) to filter out the header-files in the +# directories. If left blank, the patterns specified with FILE_PATTERNS will be +# used. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +INCLUDE_FILE_PATTERNS = + +# The PREDEFINED tag can be used to specify one or more macro names that are +# defined before the preprocessor is started (similar to the -D option of e.g. +# gcc). The argument of the tag is a list of macros of the form: name or +# name=definition (no spaces). If the definition and the "=" are omitted, "=1" +# is assumed. To prevent a macro definition from being undefined via #undef or +# recursively expanded use the := operator instead of the = operator. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +PREDEFINED = + +# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this +# tag can be used to specify a list of macro names that should be expanded. The +# macro definition that is found in the sources will be used. Use the PREDEFINED +# tag if you want to use a different macro definition that overrules the +# definition found in the source code. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +EXPAND_AS_DEFINED = + +# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will +# remove all references to function-like macros that are alone on a line, have +# an all uppercase name, and do not end with a semicolon. Such function macros +# are typically used for boiler-plate code, and will confuse the parser if not +# removed. +# The default value is: YES. +# This tag requires that the tag ENABLE_PREPROCESSING is set to YES. + +SKIP_FUNCTION_MACROS = YES + +#--------------------------------------------------------------------------- +# Configuration options related to external references +#--------------------------------------------------------------------------- + +# The TAGFILES tag can be used to specify one or more tag files. For each tag +# file the location of the external documentation should be added. The format of +# a tag file without this location is as follows: +# TAGFILES = file1 file2 ... +# Adding location for the tag files is done as follows: +# TAGFILES = file1=loc1 "file2 = loc2" ... +# where loc1 and loc2 can be relative or absolute paths or URLs. See the +# section "Linking to external documentation" for more information about the use +# of tag files. +# Note: Each tag file must have a unique name (where the name does NOT include +# the path). If a tag file is not located in the directory in which doxygen is +# run, you must also specify the path to the tagfile here. + +TAGFILES = + +# When a file name is specified after GENERATE_TAGFILE, doxygen will create a +# tag file that is based on the input files it reads. See section "Linking to +# external documentation" for more information about the usage of tag files. + +GENERATE_TAGFILE = + +# If the ALLEXTERNALS tag is set to YES, all external class will be listed in +# the class index. If set to NO, only the inherited external classes will be +# listed. +# The default value is: NO. + +ALLEXTERNALS = NO + +# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed +# in the modules index. If set to NO, only the current project's groups will be +# listed. +# The default value is: YES. + +EXTERNAL_GROUPS = YES + +# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in +# the related pages index. If set to NO, only the current project's pages will +# be listed. +# The default value is: YES. + +EXTERNAL_PAGES = YES + +# The PERL_PATH should be the absolute path and name of the perl script +# interpreter (i.e. the result of 'which perl'). +# The default file (with absolute path) is: /usr/bin/perl. + +PERL_PATH = /usr/bin/perl + +#--------------------------------------------------------------------------- +# Configuration options related to the dot tool +#--------------------------------------------------------------------------- + +# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram +# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to +# NO turns the diagrams off. Note that this option also works with HAVE_DOT +# disabled, but it is recommended to install and use dot, since it yields more +# powerful graphs. +# The default value is: YES. + +CLASS_DIAGRAMS = YES + +# You can define message sequence charts within doxygen comments using the \msc +# command. Doxygen will then run the mscgen tool (see: +# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the +# documentation. The MSCGEN_PATH tag allows you to specify the directory where +# the mscgen tool resides. If left empty the tool is assumed to be found in the +# default search path. + +MSCGEN_PATH = + +# You can include diagrams made with dia in doxygen documentation. Doxygen will +# then run dia to produce the diagram and insert it in the documentation. The +# DIA_PATH tag allows you to specify the directory where the dia binary resides. +# If left empty dia is assumed to be found in the default search path. + +DIA_PATH = + +# If set to YES the inheritance and collaboration graphs will hide inheritance +# and usage relations if the target is undocumented or is not a class. +# The default value is: YES. + +HIDE_UNDOC_RELATIONS = YES + +# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is +# available from the path. This tool is part of Graphviz (see: +# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent +# Bell Labs. The other options in this section have no effect if this option is +# set to NO +# The default value is: NO. + +HAVE_DOT = NO + +# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed +# to run in parallel. When set to 0 doxygen will base this on the number of +# processors available in the system. You can set it explicitly to a value +# larger than 0 to get control over the balance between CPU load and processing +# speed. +# Minimum value: 0, maximum value: 32, default value: 0. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_NUM_THREADS = 0 + +# When you want a differently looking font in the dot files that doxygen +# generates you can specify the font name using DOT_FONTNAME. You need to make +# sure dot is able to find the font, which can be done by putting it in a +# standard location or by setting the DOTFONTPATH environment variable or by +# setting DOT_FONTPATH to the directory containing the font. +# The default value is: Helvetica. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_FONTNAME = Helvetica + +# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of +# dot graphs. +# Minimum value: 4, maximum value: 24, default value: 10. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_FONTSIZE = 10 + +# By default doxygen will tell dot to use the default font as specified with +# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set +# the path where dot can find it using this tag. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_FONTPATH = + +# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for +# each documented class showing the direct and indirect inheritance relations. +# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +CLASS_GRAPH = YES + +# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a +# graph for each documented class showing the direct and indirect implementation +# dependencies (inheritance, containment, and class references variables) of the +# class with other documented classes. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +COLLABORATION_GRAPH = YES + +# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for +# groups, showing the direct groups dependencies. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +GROUP_GRAPHS = YES + +# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and +# collaboration diagrams in a style similar to the OMG's Unified Modeling +# Language. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +UML_LOOK = NO + +# If the UML_LOOK tag is enabled, the fields and methods are shown inside the +# class node. If there are many fields or methods and many nodes the graph may +# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the +# number of items for each type to make the size more manageable. Set this to 0 +# for no limit. Note that the threshold may be exceeded by 50% before the limit +# is enforced. So when you set the threshold to 10, up to 15 fields may appear, +# but if the number exceeds 15, the total amount of fields shown is limited to +# 10. +# Minimum value: 0, maximum value: 100, default value: 10. +# This tag requires that the tag HAVE_DOT is set to YES. + +UML_LIMIT_NUM_FIELDS = 10 + +# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and +# collaboration graphs will show the relations between templates and their +# instances. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +TEMPLATE_RELATIONS = NO + +# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to +# YES then doxygen will generate a graph for each documented file showing the +# direct and indirect include dependencies of the file with other documented +# files. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +INCLUDE_GRAPH = YES + +# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are +# set to YES then doxygen will generate a graph for each documented file showing +# the direct and indirect include dependencies of the file with other documented +# files. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +INCLUDED_BY_GRAPH = YES + +# If the CALL_GRAPH tag is set to YES then doxygen will generate a call +# dependency graph for every global function or class method. +# +# Note that enabling this option will significantly increase the time of a run. +# So in most cases it will be better to enable call graphs for selected +# functions only using the \callgraph command. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +CALL_GRAPH = NO + +# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller +# dependency graph for every global function or class method. +# +# Note that enabling this option will significantly increase the time of a run. +# So in most cases it will be better to enable caller graphs for selected +# functions only using the \callergraph command. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +CALLER_GRAPH = NO + +# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical +# hierarchy of all classes instead of a textual one. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +GRAPHICAL_HIERARCHY = YES + +# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the +# dependencies a directory has on other directories in a graphical way. The +# dependency relations are determined by the #include relations between the +# files in the directories. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +DIRECTORY_GRAPH = YES + +# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images +# generated by dot. +# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order +# to make the SVG files visible in IE 9+ (other browsers do not have this +# requirement). +# Possible values are: png, jpg, gif and svg. +# The default value is: png. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_IMAGE_FORMAT = png + +# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to +# enable generation of interactive SVG images that allow zooming and panning. +# +# Note that this requires a modern browser other than Internet Explorer. Tested +# and working are Firefox, Chrome, Safari, and Opera. +# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make +# the SVG files visible. Older versions of IE do not have SVG support. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +INTERACTIVE_SVG = NO + +# The DOT_PATH tag can be used to specify the path where the dot tool can be +# found. If left blank, it is assumed the dot tool can be found in the path. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_PATH = + +# The DOTFILE_DIRS tag can be used to specify one or more directories that +# contain dot files that are included in the documentation (see the \dotfile +# command). +# This tag requires that the tag HAVE_DOT is set to YES. + +DOTFILE_DIRS = + +# The MSCFILE_DIRS tag can be used to specify one or more directories that +# contain msc files that are included in the documentation (see the \mscfile +# command). + +MSCFILE_DIRS = + +# The DIAFILE_DIRS tag can be used to specify one or more directories that +# contain dia files that are included in the documentation (see the \diafile +# command). + +DIAFILE_DIRS = + +# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the +# path where java can find the plantuml.jar file. If left blank, it is assumed +# PlantUML is not used or called during a preprocessing step. Doxygen will +# generate a warning when it encounters a \startuml command in this case and +# will not generate output for the diagram. + +PLANTUML_JAR_PATH = + +# When using plantuml, the specified paths are searched for files specified by +# the !include statement in a plantuml block. + +PLANTUML_INCLUDE_PATH = + +# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes +# that will be shown in the graph. If the number of nodes in a graph becomes +# larger than this value, doxygen will truncate the graph, which is visualized +# by representing a node as a red box. Note that doxygen if the number of direct +# children of the root node in a graph is already larger than +# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that +# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. +# Minimum value: 0, maximum value: 10000, default value: 50. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_GRAPH_MAX_NODES = 50 + +# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs +# generated by dot. A depth value of 3 means that only nodes reachable from the +# root by following a path via at most 3 edges will be shown. Nodes that lay +# further from the root node will be omitted. Note that setting this option to 1 +# or 2 may greatly reduce the computation time needed for large code bases. Also +# note that the size of a graph can be further restricted by +# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. +# Minimum value: 0, maximum value: 1000, default value: 0. +# This tag requires that the tag HAVE_DOT is set to YES. + +MAX_DOT_GRAPH_DEPTH = 0 + +# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent +# background. This is disabled by default, because dot on Windows does not seem +# to support this out of the box. +# +# Warning: Depending on the platform used, enabling this option may lead to +# badly anti-aliased labels on the edges of a graph (i.e. they become hard to +# read). +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_TRANSPARENT = NO + +# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output +# files in one run (i.e. multiple -o and -T options on the command line). This +# makes dot run faster, but since only newer versions of dot (>1.8.10) support +# this, this feature is disabled by default. +# The default value is: NO. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_MULTI_TARGETS = NO + +# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page +# explaining the meaning of the various boxes and arrows in the dot generated +# graphs. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +GENERATE_LEGEND = YES + +# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot +# files that are used to generate the various graphs. +# The default value is: YES. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_CLEANUP = YES diff --git a/libs/sort/doc/entropy.png b/libs/sort/doc/entropy.png Binary files differnew file mode 100644 index 000000000..7d0516102 --- /dev/null +++ b/libs/sort/doc/entropy.png diff --git a/libs/sort/doc/equation/Thumbs.db b/libs/sort/doc/equation/Thumbs.db Binary files differnew file mode 100644 index 000000000..443d09230 --- /dev/null +++ b/libs/sort/doc/equation/Thumbs.db diff --git a/libs/sort/doc/equation/asymptote.png b/libs/sort/doc/equation/asymptote.png Binary files differnew file mode 100644 index 000000000..da78e1258 --- /dev/null +++ b/libs/sort/doc/equation/asymptote.png diff --git a/libs/sort/doc/equation/bigm.png b/libs/sort/doc/equation/bigm.png Binary files differnew file mode 100644 index 000000000..9ab88f800 --- /dev/null +++ b/libs/sort/doc/equation/bigm.png diff --git a/libs/sort/doc/equation/bin_limit.png b/libs/sort/doc/equation/bin_limit.png Binary files differnew file mode 100644 index 000000000..91a20f1cc --- /dev/null +++ b/libs/sort/doc/equation/bin_limit.png diff --git a/libs/sort/doc/equation/bins.png b/libs/sort/doc/equation/bins.png Binary files differnew file mode 100644 index 000000000..6b9d054d9 --- /dev/null +++ b/libs/sort/doc/equation/bins.png diff --git a/libs/sort/doc/equation/comp_sub.png b/libs/sort/doc/equation/comp_sub.png Binary files differnew file mode 100644 index 000000000..da8c98b3c --- /dev/null +++ b/libs/sort/doc/equation/comp_sub.png diff --git a/libs/sort/doc/equation/compare_asymptote.png b/libs/sort/doc/equation/compare_asymptote.png Binary files differnew file mode 100644 index 000000000..8fb8388f1 --- /dev/null +++ b/libs/sort/doc/equation/compare_asymptote.png diff --git a/libs/sort/doc/equation/compare_combined.png b/libs/sort/doc/equation/compare_combined.png Binary files differnew file mode 100644 index 000000000..4a5e5ef9d --- /dev/null +++ b/libs/sort/doc/equation/compare_combined.png diff --git a/libs/sort/doc/equation/compare_simplified.png b/libs/sort/doc/equation/compare_simplified.png Binary files differnew file mode 100644 index 000000000..c8094a11e --- /dev/null +++ b/libs/sort/doc/equation/compare_simplified.png diff --git a/libs/sort/doc/equation/fallback.png b/libs/sort/doc/equation/fallback.png Binary files differnew file mode 100644 index 000000000..6ccf57704 --- /dev/null +++ b/libs/sort/doc/equation/fallback.png diff --git a/libs/sort/doc/equation/gt_smin.png b/libs/sort/doc/equation/gt_smin.png Binary files differnew file mode 100644 index 000000000..23ba92d07 --- /dev/null +++ b/libs/sort/doc/equation/gt_smin.png diff --git a/libs/sort/doc/equation/gte_2k.png b/libs/sort/doc/equation/gte_2k.png Binary files differnew file mode 100644 index 000000000..ec68dcf1b --- /dev/null +++ b/libs/sort/doc/equation/gte_2k.png diff --git a/libs/sort/doc/equation/incr_compare.png b/libs/sort/doc/equation/incr_compare.png Binary files differnew file mode 100644 index 000000000..66c5a2184 --- /dev/null +++ b/libs/sort/doc/equation/incr_compare.png diff --git a/libs/sort/doc/equation/introsort.png b/libs/sort/doc/equation/introsort.png Binary files differnew file mode 100644 index 000000000..2cb098722 --- /dev/null +++ b/libs/sort/doc/equation/introsort.png diff --git a/libs/sort/doc/equation/iter_combined.png b/libs/sort/doc/equation/iter_combined.png Binary files differnew file mode 100644 index 000000000..8fb8388f1 --- /dev/null +++ b/libs/sort/doc/equation/iter_combined.png diff --git a/libs/sort/doc/equation/k1.png b/libs/sort/doc/equation/k1.png Binary files differnew file mode 100644 index 000000000..b52f293df --- /dev/null +++ b/libs/sort/doc/equation/k1.png diff --git a/libs/sort/doc/equation/k_1.png b/libs/sort/doc/equation/k_1.png Binary files differnew file mode 100644 index 000000000..3f17b580c --- /dev/null +++ b/libs/sort/doc/equation/k_1.png diff --git a/libs/sort/doc/equation/k_2.png b/libs/sort/doc/equation/k_2.png Binary files differnew file mode 100644 index 000000000..12ea13a7b --- /dev/null +++ b/libs/sort/doc/equation/k_2.png diff --git a/libs/sort/doc/equation/k_m.png b/libs/sort/doc/equation/k_m.png Binary files differnew file mode 100644 index 000000000..0a15d6ea7 --- /dev/null +++ b/libs/sort/doc/equation/k_m.png diff --git a/libs/sort/doc/equation/k_remaining.png b/libs/sort/doc/equation/k_remaining.png Binary files differnew file mode 100644 index 000000000..f0cae9600 --- /dev/null +++ b/libs/sort/doc/equation/k_remaining.png diff --git a/libs/sort/doc/equation/k_smax.png b/libs/sort/doc/equation/k_smax.png Binary files differnew file mode 100644 index 000000000..756248252 --- /dev/null +++ b/libs/sort/doc/equation/k_smax.png diff --git a/libs/sort/doc/equation/k_smax_final.png b/libs/sort/doc/equation/k_smax_final.png Binary files differnew file mode 100644 index 000000000..1a6bd53ec --- /dev/null +++ b/libs/sort/doc/equation/k_smax_final.png diff --git a/libs/sort/doc/equation/k_start.png b/libs/sort/doc/equation/k_start.png Binary files differnew file mode 100644 index 000000000..ffa03fc17 --- /dev/null +++ b/libs/sort/doc/equation/k_start.png diff --git a/libs/sort/doc/equation/kincr.png b/libs/sort/doc/equation/kincr.png Binary files differnew file mode 100644 index 000000000..b99611c19 --- /dev/null +++ b/libs/sort/doc/equation/kincr.png diff --git a/libs/sort/doc/equation/km.png b/libs/sort/doc/equation/km.png Binary files differnew file mode 100644 index 000000000..22452a812 --- /dev/null +++ b/libs/sort/doc/equation/km.png diff --git a/libs/sort/doc/equation/ktop.png b/libs/sort/doc/equation/ktop.png Binary files differnew file mode 100644 index 000000000..4dfa019c6 --- /dev/null +++ b/libs/sort/doc/equation/ktop.png diff --git a/libs/sort/doc/equation/lsd.png b/libs/sort/doc/equation/lsd.png Binary files differnew file mode 100644 index 000000000..eee2f5d82 --- /dev/null +++ b/libs/sort/doc/equation/lsd.png diff --git a/libs/sort/doc/equation/lsd_offset.png b/libs/sort/doc/equation/lsd_offset.png Binary files differnew file mode 100644 index 000000000..7856776c6 --- /dev/null +++ b/libs/sort/doc/equation/lsd_offset.png diff --git a/libs/sort/doc/equation/lt_smin.png b/libs/sort/doc/equation/lt_smin.png Binary files differnew file mode 100644 index 000000000..c42f04387 --- /dev/null +++ b/libs/sort/doc/equation/lt_smin.png diff --git a/libs/sort/doc/equation/lte_smin.png b/libs/sort/doc/equation/lte_smin.png Binary files differnew file mode 100644 index 000000000..b8feafac3 --- /dev/null +++ b/libs/sort/doc/equation/lte_smin.png diff --git a/libs/sort/doc/equation/m_limit.png b/libs/sort/doc/equation/m_limit.png Binary files differnew file mode 100644 index 000000000..bb8f40dd8 --- /dev/null +++ b/libs/sort/doc/equation/m_limit.png diff --git a/libs/sort/doc/equation/min1_comparison.png b/libs/sort/doc/equation/min1_comparison.png Binary files differnew file mode 100644 index 000000000..88cc62339 --- /dev/null +++ b/libs/sort/doc/equation/min1_comparison.png diff --git a/libs/sort/doc/equation/min_comparison.png b/libs/sort/doc/equation/min_comparison.png Binary files differnew file mode 100644 index 000000000..614c639b0 --- /dev/null +++ b/libs/sort/doc/equation/min_comparison.png diff --git a/libs/sort/doc/equation/min_n.png b/libs/sort/doc/equation/min_n.png Binary files differnew file mode 100644 index 000000000..29f625ee4 --- /dev/null +++ b/libs/sort/doc/equation/min_n.png diff --git a/libs/sort/doc/equation/min_n_orig.png b/libs/sort/doc/equation/min_n_orig.png Binary files differnew file mode 100644 index 000000000..5f867d208 --- /dev/null +++ b/libs/sort/doc/equation/min_n_orig.png diff --git a/libs/sort/doc/equation/mrange.png b/libs/sort/doc/equation/mrange.png Binary files differnew file mode 100644 index 000000000..ccd6b0cc5 --- /dev/null +++ b/libs/sort/doc/equation/mrange.png diff --git a/libs/sort/doc/equation/msum.png b/libs/sort/doc/equation/msum.png Binary files differnew file mode 100644 index 000000000..2e5f2947b --- /dev/null +++ b/libs/sort/doc/equation/msum.png diff --git a/libs/sort/doc/equation/n_gt_smin.png b/libs/sort/doc/equation/n_gt_smin.png Binary files differnew file mode 100644 index 000000000..6d9986c34 --- /dev/null +++ b/libs/sort/doc/equation/n_gt_smin.png diff --git a/libs/sort/doc/equation/nincr.png b/libs/sort/doc/equation/nincr.png Binary files differnew file mode 100644 index 000000000..f68b80426 --- /dev/null +++ b/libs/sort/doc/equation/nincr.png diff --git a/libs/sort/doc/equation/radix_iters.png b/libs/sort/doc/equation/radix_iters.png Binary files differnew file mode 100644 index 000000000..66351ca31 --- /dev/null +++ b/libs/sort/doc/equation/radix_iters.png diff --git a/libs/sort/doc/equation/s_diff.png b/libs/sort/doc/equation/s_diff.png Binary files differnew file mode 100644 index 000000000..4c3c82a0a --- /dev/null +++ b/libs/sort/doc/equation/s_diff.png diff --git a/libs/sort/doc/equation/s_max.png b/libs/sort/doc/equation/s_max.png Binary files differnew file mode 100644 index 000000000..fc90db758 --- /dev/null +++ b/libs/sort/doc/equation/s_max.png diff --git a/libs/sort/doc/equation/s_max_iters.png b/libs/sort/doc/equation/s_max_iters.png Binary files differnew file mode 100644 index 000000000..fb3e632cd --- /dev/null +++ b/libs/sort/doc/equation/s_max_iters.png diff --git a/libs/sort/doc/equation/s_min.png b/libs/sort/doc/equation/s_min.png Binary files differnew file mode 100644 index 000000000..bc1702e03 --- /dev/null +++ b/libs/sort/doc/equation/s_min.png diff --git a/libs/sort/doc/equation/smax_total_iters.png b/libs/sort/doc/equation/smax_total_iters.png Binary files differnew file mode 100644 index 000000000..7856776c6 --- /dev/null +++ b/libs/sort/doc/equation/smax_total_iters.png diff --git a/libs/sort/doc/equation/smean.png b/libs/sort/doc/equation/smean.png Binary files differnew file mode 100644 index 000000000..c466bfd8d --- /dev/null +++ b/libs/sort/doc/equation/smean.png diff --git a/libs/sort/doc/equation/smin1.png b/libs/sort/doc/equation/smin1.png Binary files differnew file mode 100644 index 000000000..5ad1d78d2 --- /dev/null +++ b/libs/sort/doc/equation/smin1.png diff --git a/libs/sort/doc/equation/smin_lbs.png b/libs/sort/doc/equation/smin_lbs.png Binary files differnew file mode 100644 index 000000000..80e0428e0 --- /dev/null +++ b/libs/sort/doc/equation/smin_lbs.png diff --git a/libs/sort/doc/equation/sminlbs1.png b/libs/sort/doc/equation/sminlbs1.png Binary files differnew file mode 100644 index 000000000..cbf69b298 --- /dev/null +++ b/libs/sort/doc/equation/sminlbs1.png diff --git a/libs/sort/doc/equation/srange.png b/libs/sort/doc/equation/srange.png Binary files differnew file mode 100644 index 000000000..b621f2784 --- /dev/null +++ b/libs/sort/doc/equation/srange.png diff --git a/libs/sort/doc/equation/string_sort.png b/libs/sort/doc/equation/string_sort.png Binary files differnew file mode 100644 index 000000000..13be7ef3e --- /dev/null +++ b/libs/sort/doc/equation/string_sort.png diff --git a/libs/sort/doc/equation/worst.png b/libs/sort/doc/equation/worst.png Binary files differnew file mode 100644 index 000000000..b80b59e31 --- /dev/null +++ b/libs/sort/doc/equation/worst.png diff --git a/libs/sort/doc/equation/worst1.png b/libs/sort/doc/equation/worst1.png Binary files differnew file mode 100644 index 000000000..33087338c --- /dev/null +++ b/libs/sort/doc/equation/worst1.png diff --git a/libs/sort/doc/equation/x2plus1.png b/libs/sort/doc/equation/x2plus1.png Binary files differnew file mode 100644 index 000000000..b52f293df --- /dev/null +++ b/libs/sort/doc/equation/x2plus1.png diff --git a/libs/sort/doc/graph/boost-no-inspect b/libs/sort/doc/graph/boost-no-inspect new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/libs/sort/doc/graph/boost-no-inspect diff --git a/libs/sort/doc/graph/osx_float_sort.htm b/libs/sort/doc/graph/osx_float_sort.htm new file mode 100644 index 000000000..7ce0b9ec2 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort.htm @@ -0,0 +1,358 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="osx_float_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="osx_float_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="osx_float_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-07-27T05:12:41Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="osx_float_sort_files/chart001.htm">
+<link id="shLink" href="osx_float_sort_files/chart002.htm">
+<link id="shLink" href="osx_float_sort_files/sheet001.htm">
+<link id="shLink" href="osx_float_sort_files/sheet002.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=4;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Ranges";
+ c_rgszSh[1] = "Runtimes";
+ c_rgszSh[2] = "RangeData";
+ c_rgszSh[3] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[0].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Ranges</x:Name>
+ <x:WorksheetSource HRef="osx_float_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="osx_float_sort_files/chart002.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>RangeData</x:Name>
+ <x:WorksheetSource HRef="osx_float_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="osx_float_sort_files/sheet002.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="osx_float_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="osx_float_sort_files/chart001.htm" name="frSheet">
+ <frame src="osx_float_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/osx_float_sort_files/chart001.htm b/libs/sort/doc/graph/osx_float_sort_files/chart001.htm new file mode 100644 index 000000000..e4ced5f30 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/chart001.htm @@ -0,0 +1,316 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:Selected/>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Ranges</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime vs. range for 10 million elements with MAX_SPLITS 11</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>14</x:ColorIndex>
+ <x:BGColorIndex>Neutral</x:BGColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>float_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$2:$B$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$2:$C$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Range (bits)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (seconds)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtime vs. range for 10 million elements with MAX_SPLITS 11"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_float_sort_files/chart002.htm b/libs/sort/doc/graph/osx_float_sort_files/chart002.htm new file mode 100644 index 000000000..ad94c46c3 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/chart002.htm @@ -0,0 +1,318 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on 32-bit Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>float_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image002.gif
+alt="Runtimes vs. Size on 32-bit Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_float_sort_files/filelist.xml b/libs/sort/doc/graph/osx_float_sort_files/filelist.xml new file mode 100644 index 000000000..e68341bff --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/filelist.xml @@ -0,0 +1,12 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../osx_float_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="chart002.htm"/>
+ <o:File HRef="image002.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="sheet002.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/osx_float_sort_files/image001.gif b/libs/sort/doc/graph/osx_float_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..8ed583a6f --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/image001.gif diff --git a/libs/sort/doc/graph/osx_float_sort_files/image002.gif b/libs/sort/doc/graph/osx_float_sort_files/image002.gif Binary files differnew file mode 100644 index 000000000..dc3ded008 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/image002.gif diff --git a/libs/sort/doc/graph/osx_float_sort_files/sheet001.htm b/libs/sort/doc/graph/osx_float_sort_files/sheet001.htm new file mode 100644 index 000000000..3c1b109c1 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/sheet001.htm @@ -0,0 +1,283 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(2);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>5</x:ActiveRow>
+ <x:ActiveCol>3</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=355 style='border-collapse:
+ collapse;table-layout:fixed;width:267pt'>
+ <col width=98 style='mso-width-source:userset;mso-width-alt:3584;width:74pt'>
+ <col width=76 style='mso-width-source:userset;mso-width-alt:2779;width:57pt'>
+ <col width=53 style='mso-width-source:userset;mso-width-alt:1938;width:40pt'>
+ <col width=64 span=2 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=98 style='height:12.75pt;width:74pt'>Range (bits)</td>
+ <td width=76 style='width:57pt'>float_sort</td>
+ <td width=53 style='width:40pt'>std::sort</td>
+ <td colspan=2 width=128 style='mso-ignore:colspan;width:96pt'>1E7 elements</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>0</td>
+ <td align=right x:num>0.14</td>
+ <td align=right x:num>2.05</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2+1">1</td>
+ <td align=right x:num>0.53</td>
+ <td align=right x:num>2.14</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3+1">2</td>
+ <td align=right x:num>0.54</td>
+ <td align=right x:num>2.17</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4+1">3</td>
+ <td align=right x:num>0.55</td>
+ <td align=right x:num>2.21</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5+1">4</td>
+ <td align=right x:num>0.55</td>
+ <td align=right x:num>2.29</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6+1">5</td>
+ <td align=right x:num>0.54</td>
+ <td align=right x:num>2.35</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7+1">6</td>
+ <td align=right x:num>0.57</td>
+ <td align=right x:num>2.43</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8+1">7</td>
+ <td align=right x:num>0.57</td>
+ <td align=right x:num>2.48</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9+1">8</td>
+ <td align=right x:num>0.63</td>
+ <td align=right x:num>2.43</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10+1">9</td>
+ <td align=right x:num>0.68</td>
+ <td align=right x:num>2.53</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A11+1">10</td>
+ <td align=right x:num>0.76</td>
+ <td align=right x:num>2.51</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A12+1">11</td>
+ <td align=right x:num>0.93</td>
+ <td align=right x:num>2.64</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A13+1">12</td>
+ <td align=right x:num>1.7</td>
+ <td align=right x:num>2.62</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A14+1">13</td>
+ <td align=right x:num>1.33</td>
+ <td align=right x:num>2.67</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A15+1">14</td>
+ <td align=right x:num>1.29</td>
+ <td align=right x:num>2.86</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A16+1">15</td>
+ <td align=right x:num>1.33</td>
+ <td align=right x:num>2.75</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A17+1">16</td>
+ <td align=right x:num>1.28</td>
+ <td align=right x:num>2.75</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A18+1">17</td>
+ <td align=right x:num>1.28</td>
+ <td align=right x:num>2.87</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A19+1">18</td>
+ <td align=right x:num>1.33</td>
+ <td align=right x:num>2.86</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A20+1">19</td>
+ <td align=right x:num>1.27</td>
+ <td align=right x:num>2.93</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A21+1">20</td>
+ <td align=right x:num>1.28</td>
+ <td align=right x:num>3.07</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A22+1">21</td>
+ <td align=right x:num>1.32</td>
+ <td align=right x:num>3.17</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A23+1">22</td>
+ <td align=right x:num>1.37</td>
+ <td align=right x:num>3.1</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A24+1">23</td>
+ <td align=right x:num>1.44</td>
+ <td align=right x:num>3.09</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A25+1">24</td>
+ <td align=right x:num>2.25</td>
+ <td align=right x:num>3.15</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A26+1">25</td>
+ <td align=right x:num>2.06</td>
+ <td align=right x:num>3.22</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A27+1">26</td>
+ <td align=right x:num>1.86</td>
+ <td align=right x:num>3.09</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A28+1">27</td>
+ <td align=right x:num>1.77</td>
+ <td align=right x:num>3.19</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A29+1">28</td>
+ <td align=right x:num>1.75</td>
+ <td align=right x:num>3.12</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A30+1">29</td>
+ <td align=right x:num>1.81</td>
+ <td align=right x:num>3.11</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A31+1">30</td>
+ <td align=right x:num>2</td>
+ <td align=right x:num>3.12</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A32+1">31</td>
+ <td align=right x:num>1.98</td>
+ <td align=right x:num>3.19</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A33+1">32</td>
+ <td align=right x:num>2</td>
+ <td align=right x:num>3.13</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=98 style='width:74pt'></td>
+ <td width=76 style='width:57pt'></td>
+ <td width=53 style='width:40pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_float_sort_files/sheet002.htm b/libs/sort/doc/graph/osx_float_sort_files/sheet002.htm new file mode 100644 index 000000000..9c27aa0c7 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/sheet002.htm @@ -0,0 +1,160 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(3);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>7</x:ActiveRow>
+ <x:ActiveCol>6</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>float_sort</td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>4000</td>
+ <td align=right x:num="4.6000000000000001E-4">0.00046</td>
+ <td align=right x:num="4.8000000000000001E-4">0.00048</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">8000</td>
+ <td align=right x:num="8.8000000000000003E-4">0.00088</td>
+ <td align=right x:num="9.7999999999999997E-4">0.00098</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">16000</td>
+ <td align=right x:num="1.6999999999999999E-3">0.0017</td>
+ <td align=right x:num="2.2499999999999998E-3">0.00225</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">32000</td>
+ <td align=right x:num="3.3E-3">0.0033</td>
+ <td align=right x:num="4.7999999999999996E-3">0.0048</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">64000</td>
+ <td align=right x:num="8.8000000000000005E-3">0.0088</td>
+ <td align=right x:num="1.0200000000000001E-2">0.0102</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">128000</td>
+ <td align=right x:num="1.7999999999999999E-2">0.018</td>
+ <td align=right x:num="2.5499999999999998E-2">0.0255</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">256000</td>
+ <td align=right x:num="4.2000000000000003E-2">0.042</td>
+ <td align=right x:num="5.3999999999999999E-2">0.054</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8*2">512000</td>
+ <td align=right x:num="9.6000000000000002E-2">0.096</td>
+ <td align=right x:num>0.11</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9*2">1024000</td>
+ <td align=right x:num="0.20499999999999999">0.205</td>
+ <td align=right x:num="0.255">0.255</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10*2">2048000</td>
+ <td align=right x:num>0.44</td>
+ <td align=right x:num>0.54</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A11*2">4096000</td>
+ <td align=right x:num>0.92</td>
+ <td align=right x:num>1.18</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A12*2">8192000</td>
+ <td align=right x:num>1.9</td>
+ <td align=right x:num>2.59</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A13*2">16384000</td>
+ <td align=right x:num>3.44</td>
+ <td align=right x:num>5.48</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A14*2">32768000</td>
+ <td align=right x:num>6.74</td>
+ <td align=right x:num>11.93</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="65536000"
+ x:fmla="=A15*2">65536000</td>
+ <td align=right x:num>13.97</td>
+ <td align=right x:num>25.41</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_float_sort_files/stylesheet.css b/libs/sort/doc/graph/osx_float_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/osx_float_sort_files/tabstrip.htm b/libs/sort/doc/graph/osx_float_sort_files/tabstrip.htm new file mode 100644 index 000000000..3c870b678 --- /dev/null +++ b/libs/sort/doc/graph/osx_float_sort_files/tabstrip.htm @@ -0,0 +1,35 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_float_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Ranges</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart002.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">RangeData</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet002.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort.htm b/libs/sort/doc/graph/osx_integer_sort.htm new file mode 100644 index 000000000..0aef4296f --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort.htm @@ -0,0 +1,358 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="osx_integer_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="osx_integer_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="osx_integer_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-07-27T04:48:55Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="osx_integer_sort_files/chart001.htm">
+<link id="shLink" href="osx_integer_sort_files/chart002.htm">
+<link id="shLink" href="osx_integer_sort_files/sheet001.htm">
+<link id="shLink" href="osx_integer_sort_files/sheet002.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=4;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Ranges";
+ c_rgszSh[1] = "Runtimes";
+ c_rgszSh[2] = "RangeData";
+ c_rgszSh[3] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[0].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Ranges</x:Name>
+ <x:WorksheetSource HRef="osx_integer_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="osx_integer_sort_files/chart002.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>RangeData</x:Name>
+ <x:WorksheetSource HRef="osx_integer_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="osx_integer_sort_files/sheet002.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="osx_integer_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="osx_integer_sort_files/chart001.htm" name="frSheet">
+ <frame src="osx_integer_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/chart001.htm b/libs/sort/doc/graph/osx_integer_sort_files/chart001.htm new file mode 100644 index 000000000..f02581dec --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/chart001.htm @@ -0,0 +1,316 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:Selected/>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Ranges</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime vs. range for 10 million elements with MAX_SPLITS 11</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>14</x:ColorIndex>
+ <x:BGColorIndex>Neutral</x:BGColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>integer_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$2:$B$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$2:$C$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Range (bits)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (seconds)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtime vs. range for 10 million elements with MAX_SPLITS 11"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/chart002.htm b/libs/sort/doc/graph/osx_integer_sort_files/chart002.htm new file mode 100644 index 000000000..56870756b --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/chart002.htm @@ -0,0 +1,318 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on 32-bit Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>integer_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image002.gif
+alt="Runtimes vs. Size on 32-bit Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/filelist.xml b/libs/sort/doc/graph/osx_integer_sort_files/filelist.xml new file mode 100644 index 000000000..1d47b1fd2 --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/filelist.xml @@ -0,0 +1,12 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../osx_integer_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="chart002.htm"/>
+ <o:File HRef="image002.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="sheet002.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/osx_integer_sort_files/image001.gif b/libs/sort/doc/graph/osx_integer_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..b2768eed0 --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/image001.gif diff --git a/libs/sort/doc/graph/osx_integer_sort_files/image002.gif b/libs/sort/doc/graph/osx_integer_sort_files/image002.gif Binary files differnew file mode 100644 index 000000000..bf71f1e8d --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/image002.gif diff --git a/libs/sort/doc/graph/osx_integer_sort_files/sheet001.htm b/libs/sort/doc/graph/osx_integer_sort_files/sheet001.htm new file mode 100644 index 000000000..18e175d1d --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/sheet001.htm @@ -0,0 +1,283 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(2);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>28</x:ActiveRow>
+ <x:ActiveCol>3</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=355 style='border-collapse:
+ collapse;table-layout:fixed;width:267pt'>
+ <col width=98 style='mso-width-source:userset;mso-width-alt:3584;width:74pt'>
+ <col width=76 style='mso-width-source:userset;mso-width-alt:2779;width:57pt'>
+ <col width=53 style='mso-width-source:userset;mso-width-alt:1938;width:40pt'>
+ <col width=64 span=2 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=98 style='height:12.75pt;width:74pt'>Range (bits)</td>
+ <td width=76 style='width:57pt'>integer_sort</td>
+ <td width=53 style='width:40pt'>std::sort</td>
+ <td colspan=2 width=128 style='mso-ignore:colspan;width:96pt'>1E7 elements</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>0</td>
+ <td align=right x:num>0.13</td>
+ <td align=right x:num>1.9</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2+1">1</td>
+ <td align=right x:num>0.52</td>
+ <td align=right x:num>1.94</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3+1">2</td>
+ <td align=right x:num>0.51</td>
+ <td align=right x:num>2</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4+1">3</td>
+ <td align=right x:num>0.51</td>
+ <td align=right x:num>1.99</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5+1">4</td>
+ <td align=right x:num>0.5</td>
+ <td align=right x:num>2.05</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6+1">5</td>
+ <td align=right x:num>0.5</td>
+ <td align=right x:num>2.12</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7+1">6</td>
+ <td align=right x:num>0.53</td>
+ <td align=right x:num>2.19</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8+1">7</td>
+ <td align=right x:num>0.55</td>
+ <td align=right x:num>2.2</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9+1">8</td>
+ <td align=right x:num>0.6</td>
+ <td align=right x:num>2.15</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10+1">9</td>
+ <td align=right x:num>0.67</td>
+ <td align=right x:num>2.25</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A11+1">10</td>
+ <td align=right x:num>0.77</td>
+ <td align=right x:num>2.2</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A12+1">11</td>
+ <td align=right x:num>0.95</td>
+ <td align=right x:num>2.33</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A13+1">12</td>
+ <td align=right x:num>1.67</td>
+ <td align=right x:num>2.3</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A14+1">13</td>
+ <td align=right x:num>1.27</td>
+ <td align=right x:num>2.34</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A15+1">14</td>
+ <td align=right x:num>1.26</td>
+ <td align=right x:num>2.48</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A16+1">15</td>
+ <td align=right x:num>1.3</td>
+ <td align=right x:num>2.35</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A17+1">16</td>
+ <td align=right x:num>1.34</td>
+ <td align=right x:num>2.33</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A18+1">17</td>
+ <td align=right x:num>1.36</td>
+ <td align=right x:num>2.46</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A19+1">18</td>
+ <td align=right x:num>1.41</td>
+ <td align=right x:num>2.41</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A20+1">19</td>
+ <td align=right x:num>1.39</td>
+ <td align=right x:num>2.46</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A21+1">20</td>
+ <td align=right x:num>1.39</td>
+ <td align=right x:num>2.57</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A22+1">21</td>
+ <td align=right x:num>1.4</td>
+ <td align=right x:num>2.64</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A23+1">22</td>
+ <td align=right x:num>1.45</td>
+ <td align=right x:num>2.56</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A24+1">23</td>
+ <td align=right x:num>1.49</td>
+ <td align=right x:num>2.55</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A25+1">24</td>
+ <td align=right x:num>1.93</td>
+ <td align=right x:num>2.63</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A26+1">25</td>
+ <td align=right x:num>1.94</td>
+ <td align=right x:num>2.56</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A27+1">26</td>
+ <td align=right x:num>1.93</td>
+ <td align=right x:num>2.56</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A28+1">27</td>
+ <td align=right x:num>1.94</td>
+ <td align=right x:num>2.61</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A29+1">28</td>
+ <td align=right x:num>1.94</td>
+ <td align=right x:num>2.63</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A30+1">29</td>
+ <td align=right x:num>1.95</td>
+ <td align=right x:num>2.67</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A31+1">30</td>
+ <td align=right x:num>1.95</td>
+ <td align=right x:num>2.57</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A32+1">31</td>
+ <td align=right x:num>1.96</td>
+ <td align=right x:num>2.58</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A33+1">32</td>
+ <td align=right x:num>1.96</td>
+ <td align=right x:num>2.67</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=98 style='width:74pt'></td>
+ <td width=76 style='width:57pt'></td>
+ <td width=53 style='width:40pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/sheet002.htm b/libs/sort/doc/graph/osx_integer_sort_files/sheet002.htm new file mode 100644 index 000000000..5d31500de --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/sheet002.htm @@ -0,0 +1,160 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(3);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../osx_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>10</x:ActiveRow>
+ <x:ActiveCol>4</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>integer_so<span style='display:none'>rt</span></td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>4000</td>
+ <td align=right x:num="3.5E-4">0.00035</td>
+ <td align=right x:num="3.3E-4">0.00033</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">8000</td>
+ <td align=right x:num="6.6E-4">0.00066</td>
+ <td align=right x:num="6.9999999999999999E-4">0.0007</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">16000</td>
+ <td align=right x:num="1.5E-3">0.0015</td>
+ <td align=right x:num="1.6999999999999999E-3">0.0017</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">32000</td>
+ <td align=right x:num="2.5000000000000001E-3">0.0025</td>
+ <td align=right x:num="3.5000000000000001E-3">0.0035</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">64000</td>
+ <td align=right x:num="6.1999999999999998E-3">0.0062</td>
+ <td align=right x:num="7.1999999999999998E-3">0.0072</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">128000</td>
+ <td align=right x:num="1.2500000000000001E-2">0.0125</td>
+ <td align=right x:num="1.7999999999999999E-2">0.018</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">256000</td>
+ <td align=right x:num="3.5999999999999997E-2">0.036</td>
+ <td align=right x:num="4.2000000000000003E-2">0.042</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8*2">512000</td>
+ <td align=right x:num="7.8E-2">0.078</td>
+ <td align=right x:num="9.1999999999999998E-2">0.092</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9*2">1024000</td>
+ <td align=right x:num>0.17</td>
+ <td align=right x:num>0.2</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10*2">2048000</td>
+ <td align=right x:num>0.35</td>
+ <td align=right x:num>0.44</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A11*2">4096000</td>
+ <td align=right x:num>0.76</td>
+ <td align=right x:num>1</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A12*2">8192000</td>
+ <td align=right x:num>1.55</td>
+ <td align=right x:num>2.02</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A13*2">16384000</td>
+ <td align=right x:num>3.18</td>
+ <td align=right x:num>4.37</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A14*2">32768000</td>
+ <td align=right x:num>5.92</td>
+ <td align=right x:num>9.98</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="65536000"
+ x:fmla="=A15*2">65536000</td>
+ <td align=right x:num>12.37</td>
+ <td align=right x:num>20.63</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/stylesheet.css b/libs/sort/doc/graph/osx_integer_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/osx_integer_sort_files/tabstrip.htm b/libs/sort/doc/graph/osx_integer_sort_files/tabstrip.htm new file mode 100644 index 000000000..65193b96b --- /dev/null +++ b/libs/sort/doc/graph/osx_integer_sort_files/tabstrip.htm @@ -0,0 +1,35 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../osx_integer_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Ranges</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart002.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">RangeData</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet002.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/graph/osx_string_sort.htm b/libs/sort/doc/graph/osx_string_sort.htm new file mode 100644 index 000000000..907b036b9 --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort.htm @@ -0,0 +1,346 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="osx_string_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="osx_string_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="osx_string_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-02-02T05:53:30Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="osx_string_sort_files/chart001.htm">
+<link id="shLink" href="osx_string_sort_files/sheet001.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=2;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Runtimes";
+ c_rgszSh[1] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[1].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="osx_string_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="osx_string_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="osx_string_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ActiveSheet>1</x:ActiveSheet>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="osx_string_sort_files/sheet001.htm" name="frSheet">
+ <frame src="osx_string_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/osx_string_sort_files/chart001.htm b/libs/sort/doc/graph/osx_string_sort_files/chart001.htm new file mode 100644 index 000000000..eb47a7ccf --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/chart001.htm @@ -0,0 +1,314 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../OSXstring_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../OSXstring_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>string_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtimes vs. Size on Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_string_sort_files/filelist.xml b/libs/sort/doc/graph/osx_string_sort_files/filelist.xml new file mode 100644 index 000000000..b994a8608 --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/filelist.xml @@ -0,0 +1,9 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../OSXstring_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/osx_string_sort_files/image001.gif b/libs/sort/doc/graph/osx_string_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..a3d0254a0 --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/image001.gif diff --git a/libs/sort/doc/graph/osx_string_sort_files/sheet001.htm b/libs/sort/doc/graph/osx_string_sort_files/sheet001.htm new file mode 100644 index 000000000..34d829904 --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/sheet001.htm @@ -0,0 +1,155 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../OSXstring_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../OSXstring_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Selected/>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>7</x:ActiveRow>
+ <x:ActiveCol>4</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>string_sort</td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>4000</td>
+ <td align=right x:num="5.9999999999999995E-4">0.0006</td>
+ <td align=right x:num="5.9999999999999995E-4">0.0006</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">8000</td>
+ <td align=right x:num="1E-3">0.001</td>
+ <td align=right x:num="1.1999999999999999E-3">0.0012</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">16000</td>
+ <td align=right x:num="2.5000000000000001E-3">0.0025</td>
+ <td align=right x:num="2.5000000000000001E-3">0.0025</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">32000</td>
+ <td align=right x:num="5.0000000000000001E-3">0.005</td>
+ <td align=right x:num="5.0000000000000001E-3">0.005</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">64000</td>
+ <td align=right x:num="1.2E-2">0.012</td>
+ <td align=right x:num="1.7999999999999999E-2">0.018</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">128000</td>
+ <td align=right x:num>0.02</td>
+ <td align=right x:num>0.03</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">256000</td>
+ <td align=right x:num>0.04</td>
+ <td align=right x:num>0.08</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8*2">512000</td>
+ <td align=right x:num>0.1</td>
+ <td align=right x:num>0.19</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9*2">1024000</td>
+ <td align=right x:num>0.18</td>
+ <td align=right x:num>0.46</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10*2">2048000</td>
+ <td align=right x:num>0.42</td>
+ <td align=right x:num>1.02</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A11*2">4096000</td>
+ <td align=right x:num>1.01</td>
+ <td align=right x:num>2.44</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A12*2">8192000</td>
+ <td align=right x:num>2.31</td>
+ <td align=right x:num>5.32</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A13*2">16384000</td>
+ <td align=right x:num>5.03</td>
+ <td align=right x:num>11.78</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A14*2">32768000</td>
+ <td align=right x:num>10.55</td>
+ <td align=right x:num>26.43</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/osx_string_sort_files/stylesheet.css b/libs/sort/doc/graph/osx_string_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/osx_string_sort_files/tabstrip.htm b/libs/sort/doc/graph/osx_string_sort_files/tabstrip.htm new file mode 100644 index 000000000..7a7e2594c --- /dev/null +++ b/libs/sort/doc/graph/osx_string_sort_files/tabstrip.htm @@ -0,0 +1,33 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../OSXstring_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort.htm b/libs/sort/doc/graph/windows_float_sort.htm new file mode 100644 index 000000000..2d6a6592f --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort.htm @@ -0,0 +1,358 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="windows_float_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="windows_float_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="windows_float_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-07-27T01:30:00Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="windows_float_sort_files/chart001.htm">
+<link id="shLink" href="windows_float_sort_files/chart002.htm">
+<link id="shLink" href="windows_float_sort_files/sheet001.htm">
+<link id="shLink" href="windows_float_sort_files/sheet002.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=4;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Ranges";
+ c_rgszSh[1] = "Runtimes";
+ c_rgszSh[2] = "RangeData";
+ c_rgszSh[3] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[0].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Ranges</x:Name>
+ <x:WorksheetSource HRef="windows_float_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="windows_float_sort_files/chart002.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>RangeData</x:Name>
+ <x:WorksheetSource HRef="windows_float_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="windows_float_sort_files/sheet002.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="windows_float_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="windows_float_sort_files/chart001.htm" name="frSheet">
+ <frame src="windows_float_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort_files/chart001.htm b/libs/sort/doc/graph/windows_float_sort_files/chart001.htm new file mode 100644 index 000000000..aad12f956 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/chart001.htm @@ -0,0 +1,316 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:Selected/>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Ranges</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime vs. range for 10 million elements and MAX_SPLITS 11</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>14</x:ColorIndex>
+ <x:BGColorIndex>Neutral</x:BGColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>float_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$2:$B$34</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$2:$C$34</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Range (bits)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (seconds)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtime vs. range for 10 million elements and MAX_SPLITS 11"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort_files/chart002.htm b/libs/sort/doc/graph/windows_float_sort_files/chart002.htm new file mode 100644 index 000000000..561544914 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/chart002.htm @@ -0,0 +1,313 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on 32-bit Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>float_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image002.gif
+alt="Runtimes vs. Size on 32-bit Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort_files/filelist.xml b/libs/sort/doc/graph/windows_float_sort_files/filelist.xml new file mode 100644 index 000000000..d3b022fcb --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/filelist.xml @@ -0,0 +1,12 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../windows_float_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="chart002.htm"/>
+ <o:File HRef="image002.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="sheet002.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/windows_float_sort_files/image001.gif b/libs/sort/doc/graph/windows_float_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..160db5021 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/image001.gif diff --git a/libs/sort/doc/graph/windows_float_sort_files/image002.gif b/libs/sort/doc/graph/windows_float_sort_files/image002.gif Binary files differnew file mode 100644 index 000000000..d0b6e4b58 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/image002.gif diff --git a/libs/sort/doc/graph/windows_float_sort_files/sheet001.htm b/libs/sort/doc/graph/windows_float_sort_files/sheet001.htm new file mode 100644 index 000000000..abaa3dcdd --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/sheet001.htm @@ -0,0 +1,283 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(2);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>8</x:ActiveRow>
+ <x:ActiveCol>4</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=355 style='border-collapse:
+ collapse;table-layout:fixed;width:267pt'>
+ <col width=98 style='mso-width-source:userset;mso-width-alt:3584;width:74pt'>
+ <col width=76 style='mso-width-source:userset;mso-width-alt:2779;width:57pt'>
+ <col width=53 style='mso-width-source:userset;mso-width-alt:1938;width:40pt'>
+ <col width=64 span=2 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=98 style='height:12.75pt;width:74pt'>Range (bits)</td>
+ <td width=76 style='width:57pt'>float_sort</td>
+ <td width=53 style='width:40pt'>std::sort</td>
+ <td colspan=2 width=128 style='mso-ignore:colspan;width:96pt'>1E7 elements</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>0</td>
+ <td align=right x:num="6.2E-2">0.062</td>
+ <td align=right x:num="2.5000000000000001E-2">0.025</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2+1">1</td>
+ <td align=right x:num="0.29199999999999998">0.292</td>
+ <td align=right x:num="0.11899999999999999">0.119</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3+1">2</td>
+ <td align=right x:num="0.28599999999999998">0.286</td>
+ <td align=right x:num="0.184">0.184</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4+1">3</td>
+ <td align=right x:num="0.27400000000000002">0.274</td>
+ <td align=right x:num>0.26</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5+1">4</td>
+ <td align=right x:num="0.26700000000000002">0.267</td>
+ <td align=right x:num="0.34100000000000003">0.341</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6+1">5</td>
+ <td align=right x:num="0.29099999999999998">0.291</td>
+ <td align=right x:num="0.41399999999999998">0.414</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7+1">6</td>
+ <td align=right x:num="0.309">0.309</td>
+ <td align=right x:num="0.54100000000000004">0.541</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8+1">7</td>
+ <td align=right x:num="0.29399999999999998">0.294</td>
+ <td align=right x:num="0.59299999999999997">0.593</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9+1">8</td>
+ <td align=right x:num="0.32700000000000001">0.327</td>
+ <td align=right x:num="0.73199999999999998">0.732</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10+1">9</td>
+ <td align=right x:num="0.373">0.373</td>
+ <td align=right x:num>0.85</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A11+1">10</td>
+ <td align=right x:num="0.46800000000000003">0.468</td>
+ <td align=right x:num="0.91900000000000004">0.919</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A12+1">11</td>
+ <td align=right x:num>0.5</td>
+ <td align=right x:num="1.0289999999999999">1.029</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A13+1">12</td>
+ <td align=right x:num="0.52600000000000002">0.526</td>
+ <td align=right x:num="1.0640000000000001">1.064</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A14+1">13</td>
+ <td align=right x:num="0.79800000000000004">0.798</td>
+ <td align=right x:num="1.2709999999999999">1.271</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A15+1">14</td>
+ <td align=right x:num="0.72699999999999998">0.727</td>
+ <td align=right x:num="1.2789999999999999">1.279</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A16+1">15</td>
+ <td align=right x:num="0.73599999999999999">0.736</td>
+ <td align=right x:num="1.4339999999999999">1.434</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A17+1">16</td>
+ <td align=right x:num="0.77700000000000002">0.777</td>
+ <td align=right x:num="1.4370000000000001">1.437</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A18+1">17</td>
+ <td align=right x:num="0.73699999999999999">0.737</td>
+ <td align=right x:num="1.5620000000000001">1.562</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A19+1">18</td>
+ <td align=right x:num="0.73599999999999999">0.736</td>
+ <td align=right x:num="1.6639999999999999">1.664</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A20+1">19</td>
+ <td align=right x:num="0.72499999999999998">0.725</td>
+ <td align=right x:num="1.8140000000000001">1.814</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A21+1">20</td>
+ <td align=right x:num>0.74</td>
+ <td align=right x:num="1.954">1.954</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A22+1">21</td>
+ <td align=right x:num="0.76600000000000001">0.766</td>
+ <td align=right x:num="2.0219999999999998">2.022</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A23+1">22</td>
+ <td align=right x:num="0.874">0.874</td>
+ <td align=right x:num="2.1989999999999998">2.199</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A24+1">23</td>
+ <td align=right x:num="1.0880000000000001">1.088</td>
+ <td align=right x:num="2.1120000000000001">2.112</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A25+1">24</td>
+ <td align=right x:num="1.377">1.377</td>
+ <td align=right x:num="2.1560000000000001">2.156</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A26+1">25</td>
+ <td align=right x:num="1.1839999999999999">1.184</td>
+ <td align=right x:num="2.2469999999999999">2.247</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A27+1">26</td>
+ <td align=right x:num>1.09</td>
+ <td align=right x:num="2.1459999999999999">2.146</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A28+1">27</td>
+ <td align=right x:num="0.96199999999999997">0.962</td>
+ <td align=right x:num="2.2690000000000001">2.269</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A29+1">28</td>
+ <td align=right x:num="0.98199999999999998">0.982</td>
+ <td align=right x:num="2.165">2.165</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A30+1">29</td>
+ <td align=right x:num="1.026">1.026</td>
+ <td align=right x:num="2.2759999999999998">2.276</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A31+1">30</td>
+ <td align=right x:num="1.202">1.202</td>
+ <td align=right x:num="2.1349999999999998">2.135</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A32+1">31</td>
+ <td align=right x:num="1.1930000000000001">1.193</td>
+ <td align=right x:num="2.2589999999999999">2.259</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A33+1">32</td>
+ <td align=right x:num="1.1819999999999999">1.182</td>
+ <td align=right x:num="2.2389999999999999">2.239</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=98 style='width:74pt'></td>
+ <td width=76 style='width:57pt'></td>
+ <td width=53 style='width:40pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort_files/sheet002.htm b/libs/sort/doc/graph/windows_float_sort_files/sheet002.htm new file mode 100644 index 000000000..d70894ead --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/sheet002.htm @@ -0,0 +1,160 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_float_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(3);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_float_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>15</x:ActiveRow>
+ <x:ActiveCol>2</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>float_sort</td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>4000</td>
+ <td align=right x:num="2.41E-4">0.000241</td>
+ <td align=right x:num="4.4000000000000002E-4">0.00044</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">8000</td>
+ <td align=right x:num="5.0799999999999999E-4">0.000508</td>
+ <td align=right x:num="9.68E-4">0.000968</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">16000</td>
+ <td align=right x:num="1.0250000000000001E-3">0.001025</td>
+ <td align=right x:num="2.1299999999999999E-3">0.00213</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">32000</td>
+ <td align=right x:num="2.14E-3">0.00214</td>
+ <td align=right x:num="4.6100000000000004E-3">0.00461</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">64000</td>
+ <td align=right x:num="4.9199999999999999E-3">0.00492</td>
+ <td align=right x:num="9.4999999999999998E-3">0.0095</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">128000</td>
+ <td align=right x:num="1.5049999999999999E-2">0.01505</td>
+ <td align=right x:num="2.0799999999999999E-2">0.0208</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">256000</td>
+ <td align=right x:num="2.6599999999999999E-2">0.0266</td>
+ <td align=right x:num="4.3400000000000001E-2">0.0434</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8*2">512000</td>
+ <td align=right x:num="5.74E-2">0.0574</td>
+ <td align=right x:num="9.1800000000000007E-2">0.0918</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9*2">1024000</td>
+ <td align=right x:num="0.1255">0.1255</td>
+ <td align=right x:num="0.1915">0.1915</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10*2">2048000</td>
+ <td align=right x:num="0.28199999999999997">0.282</td>
+ <td align=right x:num="0.39700000000000002">0.397</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A11*2">4096000</td>
+ <td align=right x:num="0.60399999999999998">0.604</td>
+ <td align=right x:num="0.83399999999999996">0.834</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A12*2">8192000</td>
+ <td align=right x:num="1.2629999999999999">1.263</td>
+ <td align=right x:num="1.752">1.752</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A13*2">16384000</td>
+ <td align=right x:num="1.732">1.732</td>
+ <td align=right x:num="3.766">3.766</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A14*2">32768000</td>
+ <td align=right x:num="3.5310000000000001">3.531</td>
+ <td align=right x:num="7.548">7.548</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="65536000"
+ x:fmla="=A15*2">65536000</td>
+ <td align=right x:num="7.2510000000000003">7.251</td>
+ <td align=right x:num="15.632999999999999">15.633</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_float_sort_files/stylesheet.css b/libs/sort/doc/graph/windows_float_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/windows_float_sort_files/tabstrip.htm b/libs/sort/doc/graph/windows_float_sort_files/tabstrip.htm new file mode 100644 index 000000000..abcbfb229 --- /dev/null +++ b/libs/sort/doc/graph/windows_float_sort_files/tabstrip.htm @@ -0,0 +1,35 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_float_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Ranges</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart002.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">RangeData</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet002.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort.htm b/libs/sort/doc/graph/windows_integer_sort.htm new file mode 100644 index 000000000..3d9a7a154 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort.htm @@ -0,0 +1,359 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="windows_integer_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="windows_integer_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="windows_integer_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-07-28T14:34:29Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="windows_integer_sort_files/chart001.htm">
+<link id="shLink" href="windows_integer_sort_files/chart002.htm">
+<link id="shLink" href="windows_integer_sort_files/sheet001.htm">
+<link id="shLink" href="windows_integer_sort_files/sheet002.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=4;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Ranges";
+ c_rgszSh[1] = "Runtimes";
+ c_rgszSh[2] = "RangeData";
+ c_rgszSh[3] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[1].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Ranges</x:Name>
+ <x:WorksheetSource HRef="windows_integer_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="windows_integer_sort_files/chart002.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>RangeData</x:Name>
+ <x:WorksheetSource HRef="windows_integer_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="windows_integer_sort_files/sheet002.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="windows_integer_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ActiveSheet>1</x:ActiveSheet>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="windows_integer_sort_files/chart002.htm" name="frSheet">
+ <frame src="windows_integer_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/chart001.htm b/libs/sort/doc/graph/windows_integer_sort_files/chart001.htm new file mode 100644 index 000000000..4a6b507c6 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/chart001.htm @@ -0,0 +1,315 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Ranges</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime vs. range for 10 million elements with MAX_SPLITS 11</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>14</x:ColorIndex>
+ <x:BGColorIndex>Neutral</x:BGColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>integer_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$B$2:$B$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$A$2:$A$34</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>RangeData!$C$2:$C$33</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Range (bits)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (seconds)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtime vs. range for 10 million elements with MAX_SPLITS 11"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/chart002.htm b/libs/sort/doc/graph/windows_integer_sort_files/chart002.htm new file mode 100644 index 000000000..5628f17eb --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/chart002.htm @@ -0,0 +1,319 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:Selected/>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on 32-bit Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>integer_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$16</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$16</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image002.gif
+alt="Runtimes vs. Size on 32-bit Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/filelist.xml b/libs/sort/doc/graph/windows_integer_sort_files/filelist.xml new file mode 100644 index 000000000..09d0bb7bf --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/filelist.xml @@ -0,0 +1,12 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../windows_integer_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="chart002.htm"/>
+ <o:File HRef="image002.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="sheet002.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/windows_integer_sort_files/image001.gif b/libs/sort/doc/graph/windows_integer_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..0d5d50eba --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/image001.gif diff --git a/libs/sort/doc/graph/windows_integer_sort_files/image002.gif b/libs/sort/doc/graph/windows_integer_sort_files/image002.gif Binary files differnew file mode 100644 index 000000000..55506c109 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/image002.gif diff --git a/libs/sort/doc/graph/windows_integer_sort_files/sheet001.htm b/libs/sort/doc/graph/windows_integer_sort_files/sheet001.htm new file mode 100644 index 000000000..ef46bb5a2 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/sheet001.htm @@ -0,0 +1,283 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(2);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>32</x:ActiveRow>
+ <x:ActiveCol>3</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=355 style='border-collapse:
+ collapse;table-layout:fixed;width:267pt'>
+ <col width=98 style='mso-width-source:userset;mso-width-alt:3584;width:74pt'>
+ <col width=76 style='mso-width-source:userset;mso-width-alt:2779;width:57pt'>
+ <col width=53 style='mso-width-source:userset;mso-width-alt:1938;width:40pt'>
+ <col width=64 span=2 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=98 style='height:12.75pt;width:74pt'>Range (bits)</td>
+ <td width=76 style='width:57pt'>integer_sort</td>
+ <td width=53 style='width:40pt'>std::sort</td>
+ <td colspan=2 width=128 style='mso-ignore:colspan;width:96pt'>1E7 elements</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>0</td>
+ <td align=right x:num="0.10199999999999999">0.102</td>
+ <td align=right x:num="1.7000000000000001E-2">0.017</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2+1">1</td>
+ <td align=right x:num="0.377">0.377</td>
+ <td align=right x:num="9.2999999999999999E-2">0.093</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3+1">2</td>
+ <td align=right x:num="0.36899999999999999">0.369</td>
+ <td align=right x:num="0.14799999999999999">0.148</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4+1">3</td>
+ <td align=right x:num="0.32300000000000001">0.323</td>
+ <td align=right x:num="0.21199999999999999">0.212</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5+1">4</td>
+ <td align=right x:num="0.33400000000000002">0.334</td>
+ <td align=right x:num="0.27300000000000002">0.273</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6+1">5</td>
+ <td align=right x:num="0.35399999999999998">0.354</td>
+ <td align=right x:num="0.34100000000000003">0.341</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7+1">6</td>
+ <td align=right x:num="0.34599999999999997">0.346</td>
+ <td align=right x:num>0.43</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8+1">7</td>
+ <td align=right x:num>0.34</td>
+ <td align=right x:num="0.50700000000000001">0.507</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9+1">8</td>
+ <td align=right x:num="0.34300000000000003">0.343</td>
+ <td align=right x:num="0.57099999999999995">0.571</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10+1">9</td>
+ <td align=right x:num>0.4</td>
+ <td align=right x:num="0.75700000000000001">0.757</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A11+1">10</td>
+ <td align=right x:num="0.54100000000000004">0.541</td>
+ <td align=right x:num="0.74099999999999999">0.741</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A12+1">11</td>
+ <td align=right x:num>0.59</td>
+ <td align=right x:num="0.80900000000000005">0.809</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A13+1">12</td>
+ <td align=right x:num="0.64600000000000002">0.646</td>
+ <td align=right x:num="1.008">1.008</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A14+1">13</td>
+ <td align=right x:num="0.89800000000000002">0.898</td>
+ <td align=right x:num="1.0760000000000001">1.076</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A15+1">14</td>
+ <td align=right x:num="0.94499999999999995">0.945</td>
+ <td align=right x:num="1.2110000000000001">1.211</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A16+1">15</td>
+ <td align=right x:num="0.94299999999999995">0.943</td>
+ <td align=right x:num="1.286">1.286</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A17+1">16</td>
+ <td align=right x:num="0.89500000000000002">0.895</td>
+ <td align=right x:num="1.371">1.371</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A18+1">17</td>
+ <td align=right x:num="0.93300000000000005">0.933</td>
+ <td align=right x:num="1.4850000000000001">1.485</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A19+1">18</td>
+ <td align=right x:num="0.93899999999999995">0.939</td>
+ <td align=right x:num="1.5860000000000001">1.586</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A20+1">19</td>
+ <td align=right x:num="0.93500000000000005">0.935</td>
+ <td align=right x:num="1.7450000000000001">1.745</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A21+1">20</td>
+ <td align=right x:num="0.874">0.874</td>
+ <td align=right x:num="1.7569999999999999">1.757</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A22+1">21</td>
+ <td align=right x:num="0.86099999999999999">0.861</td>
+ <td align=right x:num="1.931">1.931</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A23+1">22</td>
+ <td align=right x:num="0.89500000000000002">0.895</td>
+ <td align=right x:num="1.752">1.752</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A24+1">23</td>
+ <td align=right x:num="1.0640000000000001">1.064</td>
+ <td align=right x:num="1.802">1.802</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A25+1">24</td>
+ <td align=right x:num="1.294">1.294</td>
+ <td align=right x:num>1.79</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A26+1">25</td>
+ <td align=right x:num="1.115">1.115</td>
+ <td align=right x:num="1.8160000000000001">1.816</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A27+1">26</td>
+ <td align=right x:num="1.127">1.127</td>
+ <td align=right x:num="2.069">2.069</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A28+1">27</td>
+ <td align=right x:num="1.2709999999999999">1.271</td>
+ <td align=right x:num="1.9870000000000001">1.987</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A29+1">28</td>
+ <td align=right x:num="1.272">1.272</td>
+ <td align=right x:num="1.796">1.796</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A30+1">29</td>
+ <td align=right x:num="1.147">1.147</td>
+ <td align=right x:num="1.8049999999999999">1.805</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A31+1">30</td>
+ <td align=right x:num="1.2370000000000001">1.237</td>
+ <td align=right x:num="1.8220000000000001">1.822</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A32+1">31</td>
+ <td align=right x:num="1.1479999999999999">1.148</td>
+ <td align=right x:num="1.9670000000000001">1.967</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A33+1">32</td>
+ <td align=right x:num="1.147">1.147</td>
+ <td align=right x:num>1.82</td>
+ <td colspan=2 style='mso-ignore:colspan'></td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=98 style='width:74pt'></td>
+ <td width=76 style='width:57pt'></td>
+ <td width=53 style='width:40pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/sheet002.htm b/libs/sort/doc/graph/windows_integer_sort_files/sheet002.htm new file mode 100644 index 000000000..9b47c7739 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/sheet002.htm @@ -0,0 +1,160 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_integer_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(3);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_integer_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>14</x:ActiveRow>
+ <x:ActiveCol>3</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>integer_so<span style='display:none'>rt</span></td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>4000</td>
+ <td align=right x:num="2.41E-4">0.000241</td>
+ <td align=right x:num="3.7800000000000003E-4">0.000378</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">8000</td>
+ <td align=right x:num="5.44E-4">0.000544</td>
+ <td align=right x:num="7.9000000000000001E-4">0.00079</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">16000</td>
+ <td align=right x:num="1.0499999999999999E-3">0.00105</td>
+ <td align=right x:num="1.7600000000000001E-3">0.00176</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">32000</td>
+ <td align=right x:num="2.0200000000000001E-3">0.00202</td>
+ <td align=right x:num="3.81E-3">0.00381</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">64000</td>
+ <td align=right x:num="4.5799999999999999E-3">0.00458</td>
+ <td align=right x:num="8.2400000000000008E-3">0.00824</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">128000</td>
+ <td align=right x:num="1.0500000000000001E-2">0.0105</td>
+ <td align=right x:num="1.7399999999999999E-2">0.0174</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">256000</td>
+ <td align=right x:num="2.3E-2">0.023</td>
+ <td align=right x:num="3.73E-2">0.0373</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A8*2">512000</td>
+ <td align=right x:num="5.16E-2">0.0516</td>
+ <td align=right x:num="7.7600000000000002E-2">0.0776</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A9*2">1024000</td>
+ <td align=right x:num="0.114">0.114</td>
+ <td align=right x:num="0.157">0.157</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A10*2">2048000</td>
+ <td align=right x:num="0.247">0.247</td>
+ <td align=right x:num="0.33200000000000002">0.332</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A11*2">4096000</td>
+ <td align=right x:num="0.54700000000000004">0.547</td>
+ <td align=right x:num="0.70599999999999996">0.706</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A12*2">8192000</td>
+ <td align=right x:num="1.155">1.155</td>
+ <td align=right x:num="1.5029999999999999">1.503</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A13*2">16384000</td>
+ <td align=right x:num="1.792">1.792</td>
+ <td align=right x:num="3.0609999999999999">3.061</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A14*2">32768000</td>
+ <td align=right x:num="3.6219999999999999">3.622</td>
+ <td align=right x:num="6.3559999999999999">6.356</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="65536000"
+ x:fmla="=A15*2">65536000</td>
+ <td align=right x:num>7.4</td>
+ <td align=right x:num>13.12</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/stylesheet.css b/libs/sort/doc/graph/windows_integer_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/windows_integer_sort_files/tabstrip.htm b/libs/sort/doc/graph/windows_integer_sort_files/tabstrip.htm new file mode 100644 index 000000000..3f2fd90bb --- /dev/null +++ b/libs/sort/doc/graph/windows_integer_sort_files/tabstrip.htm @@ -0,0 +1,35 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_integer_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Ranges</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart002.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">RangeData</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet002.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/graph/windows_string_sort.htm b/libs/sort/doc/graph/windows_string_sort.htm new file mode 100644 index 000000000..46c29304a --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort.htm @@ -0,0 +1,345 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta name="Excel Workbook Frameset">
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link rel=File-List href="windows_string_sort_files/filelist.xml">
+<link rel=Edit-Time-Data href="windows_string_sort_files/editdata.mso">
+<link rel=OLE-Object-Data href="windows_string_sort_files/oledata.mso">
+<!--[if gte mso 9]><xml>
+ <o:DocumentProperties>
+ <o:Author>Steve</o:Author>
+ <o:LastAuthor>Steve</o:LastAuthor>
+ <o:Created>2009-02-02T02:13:19Z</o:Created>
+ <o:LastSaved>2009-05-03T18:30:26Z</o:LastSaved>
+ <o:Company>Home</o:Company>
+ <o:Version>10.2625</o:Version>
+ </o:DocumentProperties>
+ <o:OfficeDocumentSettings>
+ <o:DownloadComponents/>
+ <o:LocationOfComponents HRef="file:///D:\"/>
+ </o:OfficeDocumentSettings>
+</xml><![endif]--><![if !supportTabStrip]>
+<link id="shLink" href="windows_string_sort_files/chart001.htm">
+<link id="shLink" href="windows_string_sort_files/sheet001.htm">
+
+<link id="shLink">
+
+<script language="JavaScript">
+<!--
+ var c_lTabs=2;
+
+ var c_rgszSh=new Array(c_lTabs);
+ c_rgszSh[0] = "Runtimes";
+ c_rgszSh[1] = "Runtime Data";
+
+
+
+ var c_rgszClr=new Array(8);
+ c_rgszClr[0]="window";
+ c_rgszClr[1]="buttonface";
+ c_rgszClr[2]="windowframe";
+ c_rgszClr[3]="windowtext";
+ c_rgszClr[4]="threedlightshadow";
+ c_rgszClr[5]="threedhighlight";
+ c_rgszClr[6]="threeddarkshadow";
+ c_rgszClr[7]="threedshadow";
+
+ var g_iShCur;
+ var g_rglTabX=new Array(c_lTabs);
+
+function fnGetIEVer()
+{
+ var ua=window.navigator.userAgent
+ var msie=ua.indexOf("MSIE")
+ if (msie>0 && window.navigator.platform=="Win32")
+ return parseInt(ua.substring(msie+5,ua.indexOf(".", msie)));
+ else
+ return 0;
+}
+
+function fnBuildFrameset()
+{
+ var szHTML="<frameset rows=\"*,18\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\""+document.all.item("shLink")[0].href+"\" name=\"frSheet\" noresize>"+
+ "<frameset cols=\"54,*\" border=0 width=0 frameborder=no framespacing=0>"+
+ "<frame src=\"\" name=\"frScroll\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "<frame src=\"\" name=\"frTabs\" marginwidth=0 marginheight=0 scrolling=no>"+
+ "</frameset></frameset><plaintext>";
+
+ with (document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ fnBuildTabStrip();
+}
+
+function fnBuildTabStrip()
+{
+ var szHTML=
+ "<html><head><style>.clScroll {font:8pt Courier New;color:"+c_rgszClr[6]+";cursor:default;line-height:10pt;}"+
+ ".clScroll2 {font:10pt Arial;color:"+c_rgszClr[6]+";cursor:default;line-height:11pt;}</style></head>"+
+ "<body onclick=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" onselectstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+" topmargin=0 leftmargin=0><table cellpadding=0 cellspacing=0 width=100%>"+
+ "<tr><td colspan=6 height=1 bgcolor="+c_rgszClr[2]+"></td></tr>"+
+ "<tr><td style=\"font:1pt\"> <td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(0);\" onmouseout=\"parent.fnMouseOutScroll(0);\"><a>«</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(0);\" ondblclick=\"parent.fnScrollTabs(0);\" onmouseover=\"parent.fnMouseOverScroll(1);\" onmouseout=\"parent.fnMouseOutScroll(1);\"><a><</a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll2\" onclick=\"parent.fnScrollTabs(1);\" ondblclick=\"parent.fnScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(2);\" onmouseout=\"parent.fnMouseOutScroll(2);\"><a>></a></td>"+
+ "<td valign=top id=tdScroll class=\"clScroll\" onclick=\"parent.fnFastScrollTabs(1);\" onmouseover=\"parent.fnMouseOverScroll(3);\" onmouseout=\"parent.fnMouseOutScroll(3);\"><a>»</a></td>"+
+ "<td style=\"font:1pt\"> <td></tr></table></body></html>";
+
+ with (frames['frScroll'].document) {
+ open("text/html","replace");
+ write(szHTML);
+ close();
+ }
+
+ szHTML =
+ "<html><head>"+
+ "<style>A:link,A:visited,A:active {text-decoration:none;"+"color:"+c_rgszClr[3]+";}"+
+ ".clTab {cursor:hand;background:"+c_rgszClr[1]+";font:9pt Arial;padding-left:3px;padding-right:3px;text-align:center;}"+
+ ".clBorder {background:"+c_rgszClr[2]+";font:1pt;}"+
+ "</style></head><body onload=\"parent.fnInit();\" onselectstart=\"event.returnValue=false;\" ondragstart=\"event.returnValue=false;\" bgcolor="+c_rgszClr[4]+
+ " topmargin=0 leftmargin=0><table id=tbTabs cellpadding=0 cellspacing=0>";
+
+ var iCellCount=(c_lTabs+1)*2;
+
+ var i;
+ for (i=0;i<iCellCount;i+=2)
+ szHTML+="<col width=1><col>";
+
+ var iRow;
+ for (iRow=0;iRow<6;iRow++) {
+
+ szHTML+="<tr>";
+
+ if (iRow==5)
+ szHTML+="<td colspan="+iCellCount+"></td>";
+ else {
+ if (iRow==0) {
+ for(i=0;i<iCellCount;i++)
+ szHTML+="<td height=1 class=\"clBorder\"></td>";
+ } else if (iRow==1) {
+ for(i=0;i<c_lTabs;i++) {
+ szHTML+="<td height=1 nowrap class=\"clBorder\"> </td>";
+ szHTML+=
+ "<td id=tdTab height=1 nowrap class=\"clTab\" onmouseover=\"parent.fnMouseOverTab("+i+");\" onmouseout=\"parent.fnMouseOutTab("+i+");\">"+
+ "<a href=\""+document.all.item("shLink")[i].href+"\" target=\"frSheet\" id=aTab> "+c_rgszSh[i]+" </a></td>";
+ }
+ szHTML+="<td id=tdTab height=1 nowrap class=\"clBorder\"><a id=aTab> </a></td><td width=100%></td>";
+ } else if (iRow==2) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1></td><td height=1 class=\"clBorder\"></td>";
+ szHTML+="<td height=1></td><td height=1></td>";
+ } else if (iRow==3) {
+ for (i=0;i<iCellCount;i++)
+ szHTML+="<td height=1></td>";
+ } else if (iRow==4) {
+ for (i=0;i<c_lTabs;i++)
+ szHTML+="<td height=1 width=1></td><td height=1></td>";
+ szHTML+="<td height=1 width=1></td><td></td>";
+ }
+ }
+ szHTML+="</tr>";
+ }
+
+ szHTML+="</table></body></html>";
+ with (frames['frTabs'].document) {
+ open("text/html","replace");
+ charset=document.charset;
+ write(szHTML);
+ close();
+ }
+}
+
+function fnInit()
+{
+ g_rglTabX[0]=0;
+ var i;
+ for (i=1;i<=c_lTabs;i++)
+ with (frames['frTabs'].document.all.tbTabs.rows[1].cells[fnTabToCol(i-1)])
+ g_rglTabX[i]=offsetLeft+offsetWidth-6;
+}
+
+function fnTabToCol(iTab)
+{
+ return 2*iTab+1;
+}
+
+function fnNextTab(fDir)
+{
+ var iNextTab=-1;
+ var i;
+
+ with (frames['frTabs'].document.body) {
+ if (fDir==0) {
+ if (scrollLeft>0) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i-1;
+ }
+ } else {
+ if (g_rglTabX[c_lTabs]+6>offsetWidth+scrollLeft) {
+ for (i=0;i<c_lTabs&&g_rglTabX[i]<=scrollLeft;i++);
+ if (i<c_lTabs)
+ iNextTab=i;
+ }
+ }
+ }
+ return iNextTab;
+}
+
+function fnScrollTabs(fDir)
+{
+ var iNextTab=fnNextTab(fDir);
+
+ if (iNextTab>=0) {
+ frames['frTabs'].scroll(g_rglTabX[iNextTab],0);
+ return true;
+ } else
+ return false;
+}
+
+function fnFastScrollTabs(fDir)
+{
+ if (c_lTabs>16)
+ frames['frTabs'].scroll(g_rglTabX[fDir?c_lTabs-1:0],0);
+ else
+ if (fnScrollTabs(fDir)>0) window.setTimeout("fnFastScrollTabs("+fDir+");",5);
+}
+
+function fnSetTabProps(iTab,fActive)
+{
+ var iCol=fnTabToCol(iTab);
+ var i;
+
+ if (iTab>=0) {
+ with (frames['frTabs'].document.all) {
+ with (tbTabs) {
+ for (i=0;i<=4;i++) {
+ with (rows[i]) {
+ if (i==0)
+ cells[iCol].style.background=c_rgszClr[fActive?0:2];
+ else if (i>0 && i<4) {
+ if (fActive) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[0];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ if (i==1) {
+ cells[iCol-1].style.background=c_rgszClr[2];
+ cells[iCol].style.background=c_rgszClr[1];
+ cells[iCol+1].style.background=c_rgszClr[2];
+ } else {
+ cells[iCol-1].style.background=c_rgszClr[4];
+ cells[iCol].style.background=c_rgszClr[(i==2)?2:4];
+ cells[iCol+1].style.background=c_rgszClr[4];
+ }
+ }
+ } else
+ cells[iCol].style.background=c_rgszClr[fActive?2:4];
+ }
+ }
+ }
+ with (aTab[iTab].style) {
+ cursor=(fActive?"default":"hand");
+ color=c_rgszClr[3];
+ }
+ }
+ }
+}
+
+function fnMouseOverScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[7];
+}
+
+function fnMouseOutScroll(iCtl)
+{
+ frames['frScroll'].document.all.tdScroll[iCtl].style.color=c_rgszClr[6];
+}
+
+function fnMouseOverTab(iTab)
+{
+ if (iTab!=g_iShCur) {
+ var iCol=fnTabToCol(iTab);
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[5];
+ }
+ }
+}
+
+function fnMouseOutTab(iTab)
+{
+ if (iTab>=0) {
+ var elFrom=frames['frTabs'].event.srcElement;
+ var elTo=frames['frTabs'].event.toElement;
+
+ if ((!elTo) ||
+ (elFrom.tagName==elTo.tagName) ||
+ (elTo.tagName=="A" && elTo.parentElement!=elFrom) ||
+ (elFrom.tagName=="A" && elFrom.parentElement!=elTo)) {
+
+ if (iTab!=g_iShCur) {
+ with (frames['frTabs'].document.all) {
+ tdTab[iTab].style.background=c_rgszClr[1];
+ }
+ }
+ }
+ }
+}
+
+function fnSetActiveSheet(iSh)
+{
+ if (iSh!=g_iShCur) {
+ fnSetTabProps(g_iShCur,false);
+ fnSetTabProps(iSh,true);
+ g_iShCur=iSh;
+ }
+}
+
+ window.g_iIEVer=fnGetIEVer();
+ if (window.g_iIEVer>=4)
+ fnBuildFrameset();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:ExcelWorkbook>
+ <x:ExcelWorksheets>
+ <x:ExcelWorksheet>
+ <x:Name>Runtimes</x:Name>
+ <x:WorksheetSource HRef="windows_string_sort_files/chart001.htm"/>
+ <x:WorksheetType>Chart</x:WorksheetType>
+ </x:ExcelWorksheet>
+ <x:ExcelWorksheet>
+ <x:Name>Runtime Data</x:Name>
+ <x:WorksheetSource HRef="windows_string_sort_files/sheet001.htm"/>
+ </x:ExcelWorksheet>
+ </x:ExcelWorksheets>
+ <x:Stylesheet HRef="windows_string_sort_files/stylesheet.css"/>
+ <x:WindowHeight>8700</x:WindowHeight>
+ <x:WindowWidth>10395</x:WindowWidth>
+ <x:WindowTopX>360</x:WindowTopX>
+ <x:WindowTopY>135</x:WindowTopY>
+ <x:ProtectStructure>False</x:ProtectStructure>
+ <x:ProtectWindows>False</x:ProtectWindows>
+ </x:ExcelWorkbook>
+</xml><![endif]-->
+</head>
+
+<frameset rows="*,39" border=0 width=0 frameborder=no framespacing=0>
+ <frame src="windows_string_sort_files/chart001.htm" name="frSheet">
+ <frame src="windows_string_sort_files/tabstrip.htm" name="frTabs" marginwidth=0 marginheight=0>
+ <noframes>
+ <body>
+ <p>This page uses frames, but your browser doesn't support them.</p>
+ </body>
+ </noframes>
+</frameset>
+</html>
diff --git a/libs/sort/doc/graph/windows_string_sort_files/chart001.htm b/libs/sort/doc/graph/windows_string_sort_files/chart001.htm new file mode 100644 index 000000000..54af9b6ed --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/chart001.htm @@ -0,0 +1,320 @@ +<html xmlns:v="urn:schemas-microsoft-com:vml"
+xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_string_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<!--[if !mso]>
+<style>
+v\:* {behavior:url(#default#VML);}
+o\:* {behavior:url(#default#VML);}
+x\:* {behavior:url(#default#VML);}
+.shape {behavior:url(#default#VML);}
+</style>
+<![endif]-->
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;
+ mso-page-orientation:landscape;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(0);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_string_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Zoom>93</x:Zoom>
+ <x:Selected/>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:Print>
+ <x:ValidPrinterInfo/>
+ <x:HorizontalResolution>600</x:HorizontalResolution>
+ <x:VerticalResolution>600</x:VerticalResolution>
+ </x:Print>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body>
+<!--[if gte mso 9]><xml>
+ <x:WebChart>
+ <x:Palette>
+ <x:Entry>#000000</x:Entry>
+ <x:Entry>#FFFFFF</x:Entry>
+ <x:Entry>#FF0000</x:Entry>
+ <x:Entry>#00FF00</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008000</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#808000</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#C0C0C0</x:Entry>
+ <x:Entry>#808080</x:Entry>
+ <x:Entry>#9999FF</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#FFFFCC</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#660066</x:Entry>
+ <x:Entry>#FF8080</x:Entry>
+ <x:Entry>#0066CC</x:Entry>
+ <x:Entry>#CCCCFF</x:Entry>
+ <x:Entry>#000080</x:Entry>
+ <x:Entry>#FF00FF</x:Entry>
+ <x:Entry>#FFFF00</x:Entry>
+ <x:Entry>#00FFFF</x:Entry>
+ <x:Entry>#800080</x:Entry>
+ <x:Entry>#800000</x:Entry>
+ <x:Entry>#008080</x:Entry>
+ <x:Entry>#0000FF</x:Entry>
+ <x:Entry>#00CCFF</x:Entry>
+ <x:Entry>#CCFFFF</x:Entry>
+ <x:Entry>#CCFFCC</x:Entry>
+ <x:Entry>#FFFF99</x:Entry>
+ <x:Entry>#99CCFF</x:Entry>
+ <x:Entry>#FF99CC</x:Entry>
+ <x:Entry>#CC99FF</x:Entry>
+ <x:Entry>#FFCC99</x:Entry>
+ <x:Entry>#3366FF</x:Entry>
+ <x:Entry>#33CCCC</x:Entry>
+ <x:Entry>#99CC00</x:Entry>
+ <x:Entry>#FFCC00</x:Entry>
+ <x:Entry>#FF9900</x:Entry>
+ <x:Entry>#FF6600</x:Entry>
+ <x:Entry>#666699</x:Entry>
+ <x:Entry>#969696</x:Entry>
+ <x:Entry>#003366</x:Entry>
+ <x:Entry>#339966</x:Entry>
+ <x:Entry>#003300</x:Entry>
+ <x:Entry>#333300</x:Entry>
+ <x:Entry>#993300</x:Entry>
+ <x:Entry>#993366</x:Entry>
+ <x:Entry>#333399</x:Entry>
+ <x:Entry>#333333</x:Entry>
+ </x:Palette>
+ <x:Scaling>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ </x:Scaling>
+ <x:Scaling>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Orientation>MinMax</x:Orientation>
+ <x:LogBase>10</x:LogBase>
+ </x:Scaling>
+ <x:Chart>
+ <x:Name>Runtimes</x:Name>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtimes vs. Size on Random Data</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>12</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:PageSetup>
+ <x:ChartSize>FullPage</x:ChartSize>
+ </x:PageSetup>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Left>0</x:Left>
+ <x:Top>0</x:Top>
+ <x:Width>13660.7958984375</x:Width>
+ <x:Height>9340.7958984375</x:Height>
+ <x:ChartGrowth>
+ <x:HorzGrowth>1</x:HorzGrowth>
+ <x:VertGrowth>1</x:VertGrowth>
+ </x:ChartGrowth>
+ <x:PlotArea>
+ <x:Border>
+ <x:ColorIndex>15</x:ColorIndex>
+ <x:LineStyle>Solid</x:LineStyle>
+ <x:Weight>Narrow</x:Weight>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Graph>
+ <x:Type>Line</x:Type>
+ <x:SubType>Standard</x:SubType>
+ <x:SubType>Marker</x:SubType>
+ <x:ScaleID>0</x:ScaleID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:Series>
+ <x:Index>0</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$1</x:Data>
+ </x:Caption>
+ <x:Name>string_sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$13</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$B$2:$B$13</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:Series>
+ <x:Index>1</x:Index>
+ <x:Caption>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$1</x:Data>
+ </x:Caption>
+ <x:Name>std::sort</x:Name>
+ <x:Category>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$A$2:$A$13</x:Data>
+ </x:Category>
+ <x:Value>
+ <x:DataSource>0</x:DataSource>
+ <x:Data>'Runtime Data'!$C$2:$C$13</x:Data>
+ </x:Value>
+ </x:Series>
+ <x:PlotVisible/>
+ </x:Graph>
+ <x:Axis>
+ <x:Placement>Bottom</x:Placement>
+ <x:AxisID>0</x:AxisID>
+ <x:ScaleID>0</x:ScaleID>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Element Count</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>1</x:CrossingAxis>
+ <x:CrossesAt>1E-4</x:CrossesAt>
+ <x:LabelOffset>0</x:LabelOffset>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:TickLabelSkip>1</x:TickLabelSkip>
+ <x:TickMarkSkip>1</x:TickMarkSkip>
+ <x:Type>Automatic</x:Type>
+ </x:Axis>
+ <x:Axis>
+ <x:Placement>Left</x:Placement>
+ <x:AxisID>1</x:AxisID>
+ <x:ScaleID>1</x:ScaleID>
+ <x:MajorGridlines/>
+ <x:Title>
+ <x:Caption>
+ <x:DataSource>-1</x:DataSource>
+ <x:Data>"<x:B>Runtime (s)</x:B>"</x:Data>
+ </x:Caption>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:B/>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Border>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Border>
+ <x:Interior>
+ <x:ColorIndex>None</x:ColorIndex>
+ </x:Interior>
+ </x:Title>
+ <x:CrossingAxis>0</x:CrossingAxis>
+ <x:CrossesAt>Minimum</x:CrossesAt>
+ <x:CrossBetween>MidCategory</x:CrossBetween>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ <x:Number>
+ <x:SourceLinked/>
+ <x:BuiltInFormat>0</x:BuiltInFormat>
+ </x:Number>
+ <x:Type>Value</x:Type>
+ </x:Axis>
+ </x:PlotArea>
+ <x:Legend>
+ <x:Placement>Right</x:Placement>
+ <x:Font>
+ <x:FontName>Arial</x:FontName>
+ <x:Size>10</x:Size>
+ <x:AutoScale/>
+ </x:Font>
+ </x:Legend>
+ </x:Chart>
+ </x:WebChart>
+</xml><![endif]--><![if !supportChartImage]><img src=image001.gif
+alt="Runtimes vs. Size on Random Data"><![endif]>
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_string_sort_files/filelist.xml b/libs/sort/doc/graph/windows_string_sort_files/filelist.xml new file mode 100644 index 000000000..c9448f279 --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/filelist.xml @@ -0,0 +1,9 @@ +<xml xmlns:o="urn:schemas-microsoft-com:office:office">
+ <o:MainFile HRef="../windows_string_sort.htm"/>
+ <o:File HRef="stylesheet.css"/>
+ <o:File HRef="tabstrip.htm"/>
+ <o:File HRef="chart001.htm"/>
+ <o:File HRef="image001.gif"/>
+ <o:File HRef="sheet001.htm"/>
+ <o:File HRef="filelist.xml"/>
+</xml>
\ No newline at end of file diff --git a/libs/sort/doc/graph/windows_string_sort_files/image001.gif b/libs/sort/doc/graph/windows_string_sort_files/image001.gif Binary files differnew file mode 100644 index 000000000..1fc8c0550 --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/image001.gif diff --git a/libs/sort/doc/graph/windows_string_sort_files/sheet001.htm b/libs/sort/doc/graph/windows_string_sort_files/sheet001.htm new file mode 100644 index 000000000..68eb90fb3 --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/sheet001.htm @@ -0,0 +1,145 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office"
+xmlns:x="urn:schemas-microsoft-com:office:excel"
+xmlns="http://www.w3.org/TR/REC-html40">
+
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_string_sort.htm">
+<link rel=File-List href=filelist.xml>
+<link rel=Edit-Time-Data href=editdata.mso>
+<link rel=Stylesheet href=stylesheet.css>
+<style>
+<!--table
+ {mso-displayed-decimal-separator:"\.";
+ mso-displayed-thousand-separator:"\,";}
+@page
+ {margin:1.0in .75in 1.0in .75in;
+ mso-header-margin:.5in;
+ mso-footer-margin:.5in;}
+-->
+</style>
+<![if !supportTabStrip]><script language="JavaScript">
+<!--
+function fnUpdateTabs()
+ {
+ if (parent.window.g_iIEVer>=4) {
+ if (parent.document.readyState=="complete"
+ && parent.frames['frTabs'].document.readyState=="complete")
+ parent.fnSetActiveSheet(1);
+ else
+ window.setTimeout("fnUpdateTabs();",150);
+ }
+}
+
+if (window.name!="frSheet")
+ window.location.replace("../windows_string_sort.htm");
+else
+ fnUpdateTabs();
+//-->
+</script>
+<![endif]><!--[if gte mso 9]><xml>
+ <x:WorksheetOptions>
+ <x:Panes>
+ <x:Pane>
+ <x:Number>3</x:Number>
+ <x:ActiveRow>15</x:ActiveRow>
+ <x:ActiveCol>2</x:ActiveCol>
+ </x:Pane>
+ </x:Panes>
+ <x:ProtectContents>False</x:ProtectContents>
+ <x:ProtectObjects>False</x:ProtectObjects>
+ <x:ProtectScenarios>False</x:ProtectScenarios>
+ </x:WorksheetOptions>
+</xml><![endif]-->
+</head>
+
+<body link=blue vlink=purple>
+
+<table x:str border=0 cellpadding=0 cellspacing=0 width=192 style='border-collapse:
+ collapse;table-layout:fixed;width:144pt'>
+ <col width=64 span=3 style='width:48pt'>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 width=64 style='height:12.75pt;width:48pt'>Element C<span
+ style='display:none'>ount</span></td>
+ <td width=64 style='width:48pt'>string_sort</td>
+ <td width=64 style='width:48pt'>std::sort</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num>32000</td>
+ <td align=right x:num="1.4999999999999999E-2">0.015</td>
+ <td align=right x:num="1.4999999999999999E-2">0.015</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A2*2">64000</td>
+ <td align=right x:num="3.1E-2">0.031</td>
+ <td align=right x:num="4.7E-2">0.047</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A3*2">128000</td>
+ <td align=right x:num="4.7E-2">0.047</td>
+ <td align=right x:num="6.2E-2">0.062</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A4*2">256000</td>
+ <td align=right x:num="6.2E-2">0.062</td>
+ <td align=right x:num="9.4E-2">0.094</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A5*2">512000</td>
+ <td align=right x:num="7.8E-2">0.078</td>
+ <td align=right x:num="0.187">0.187</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A6*2">1024000</td>
+ <td align=right x:num="9.4E-2">0.094</td>
+ <td align=right x:num="0.40500000000000003">0.405</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num x:fmla="=A7*2">2048000</td>
+ <td align=right x:num="0.28100000000000003">0.281</td>
+ <td align=right x:num="0.85799999999999998">0.858</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="4096000"
+ x:fmla="=A8*2">4096000</td>
+ <td align=right x:num>0.78</td>
+ <td align=right x:num="1.8260000000000001">1.826</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="8192000"
+ x:fmla="=A9*2">8192000</td>
+ <td align=right x:num>1.84</td>
+ <td align=right x:num="4.024">4.024</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="16384000"
+ x:fmla="=A10*2">16384000</td>
+ <td align=right x:num="4.165">4.165</td>
+ <td align=right x:num="8.6110000000000007">8.611</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="32768000"
+ x:fmla="=A11*2">32768000</td>
+ <td align=right x:num="8.5169999999999995">8.517</td>
+ <td align=right x:num="17.315999999999999">17.316</td>
+ </tr>
+ <tr height=17 style='height:12.75pt'>
+ <td height=17 align=right style='height:12.75pt' x:num="65536000"
+ x:fmla="=A12*2">65536000</td>
+ <td align=right x:num>13.26</td>
+ <td align=right x:num="38.125999999999998">38.126</td>
+ </tr>
+ <![if supportMisalignedColumns]>
+ <tr height=0 style='display:none'>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ <td width=64 style='width:48pt'></td>
+ </tr>
+ <![endif]>
+</table>
+
+</body>
+
+</html>
diff --git a/libs/sort/doc/graph/windows_string_sort_files/stylesheet.css b/libs/sort/doc/graph/windows_string_sort_files/stylesheet.css new file mode 100644 index 000000000..f03e91892 --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/stylesheet.css @@ -0,0 +1,49 @@ +tr
+ {mso-height-source:auto;}
+col
+ {mso-width-source:auto;}
+br
+ {mso-data-placement:same-cell;}
+.style0
+ {mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ white-space:nowrap;
+ mso-rotate:0;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ border:none;
+ mso-protection:locked visible;
+ mso-style-name:Normal;
+ mso-style-id:0;}
+td
+ {mso-style-parent:style0;
+ padding-top:1px;
+ padding-right:1px;
+ padding-left:1px;
+ mso-ignore:padding;
+ color:windowtext;
+ font-size:10.0pt;
+ font-weight:400;
+ font-style:normal;
+ text-decoration:none;
+ font-family:Arial;
+ mso-generic-font-family:auto;
+ mso-font-charset:0;
+ mso-number-format:General;
+ text-align:general;
+ vertical-align:bottom;
+ border:none;
+ mso-background-source:auto;
+ mso-pattern:auto;
+ mso-protection:locked visible;
+ white-space:nowrap;
+ mso-rotate:0;}
diff --git a/libs/sort/doc/graph/windows_string_sort_files/tabstrip.htm b/libs/sort/doc/graph/windows_string_sort_files/tabstrip.htm new file mode 100644 index 000000000..83516df90 --- /dev/null +++ b/libs/sort/doc/graph/windows_string_sort_files/tabstrip.htm @@ -0,0 +1,33 @@ +<html>
+<head>
+<meta http-equiv=Content-Type content="text/html; charset=windows-1252">
+<meta name=ProgId content=Excel.Sheet>
+<meta name=Generator content="Microsoft Excel 10">
+<link id=Main-File rel=Main-File href="../windows_string_sort.htm">
+
+<script language="JavaScript">
+<!--
+if (window.name!="frTabs")
+ window.location.replace(document.all.item("Main-File").href);
+//-->
+</script>
+<style>
+<!--
+A {
+ text-decoration:none;
+ color:#000000;
+ font-size:9pt;
+}
+-->
+</style>
+</head>
+<body topmargin=0 leftmargin=0 bgcolor="#808080">
+<table border=0 cellspacing=1>
+ <tr>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="chart001.htm" target="frSheet"><font face="Arial" color="#000000">Runtimes</font></a> </small></small></b></td>
+ <td bgcolor="#FFFFFF" nowrap><b><small><small> <a href="sheet001.htm" target="frSheet"><font face="Arial" color="#000000">Runtime Data</font></a> </small></small></b></td>
+
+ </tr>
+</table>
+</body>
+</html>
diff --git a/libs/sort/doc/html/boost/sort/spreadsort/float_mem_cast.html b/libs/sort/doc/html/boost/sort/spreadsort/float_mem_cast.html new file mode 100644 index 000000000..2ecf63107 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/float_mem_cast.html @@ -0,0 +1,91 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template float_mem_cast</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"> +<link rel="prev" href="../../../boost_sort_c___reference.html" title="Boost.Sort C++ Reference"> +<link rel="next" href="float_sort_idp47034528.html" title="Function template float_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost_sort_c___reference.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp47034528.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.float_mem_cast"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template float_mem_cast</span></h2> +<p>boost::sort::spreadsort::float_mem_cast — Casts a float to the specified integer type. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>">boost/sort/spreadsort/float_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Data_type<span class="special">,</span> <span class="keyword">typename</span> Cast_type<span class="special">></span> + <span class="identifier">Cast_type</span> <span class="identifier">float_mem_cast</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Data_type</span> <span class="special">&</span> data<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92747136"></a><h2>Description</h2> +<p> +</p> +<p><b>Example: </b></p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">rightshift</span> <span class="special">{</span> + <span class="keyword">int</span> <span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">unsigned</span> <span class="identifier">offset</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">float_mem_cast</span><span class="special"><</span><span class="identifier">KEY_TYPE</span><span class="special">,</span> <span class="identifier">CAST_TYPE</span><span class="special">></span><span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">key</span><span class="special">)</span> <span class="special">>></span> <span class="identifier">offset</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span><span class="special">;</span> +</pre> +<p> </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Template Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">Cast_type</code></span></p></td> +<td><p>Integer type (same size) to which to cast.</p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">Data_type</code></span></p></td> +<td><p>Floating-point IEEE 754/IEC559 type. </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost_sort_c___reference.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp47034528.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41281952.html b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41281952.html new file mode 100644 index 000000000..38df51b86 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41281952.html @@ -0,0 +1,86 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template float_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"> +<link rel="prev" href="float_sort_idp47034528.html" title="Function template float_sort"> +<link rel="next" href="float_sort_idp41288368.html" title="Function template float_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort_idp47034528.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp41288368.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.float_sort_idp41281952"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template float_sort</span></h2> +<p>boost::sort::spreadsort::float_sort — Floating-point sort algorithm using random access iterators with just right-shift functor. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>">boost/sort/spreadsort/float_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">float_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Right_shift</span> rshift<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92838384"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">rshift</code></span></p></td> +<td><p>Functor that returns the result of shifting the value_type right a specified number of bits. </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort_idp47034528.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp41288368.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41288368.html b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41288368.html new file mode 100644 index 000000000..b4bf47072 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp41288368.html @@ -0,0 +1,90 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template float_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"> +<link rel="prev" href="float_sort_idp41281952.html" title="Function template float_sort"> +<link rel="next" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort_idp41281952.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.float_sort_idp41288368"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template float_sort</span></h2> +<p>boost::sort::spreadsort::float_sort — Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>">boost/sort/spreadsort/float_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">float_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Right_shift</span> rshift<span class="special">,</span> <span class="identifier">Compare</span> comp<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92861728"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">rshift</code></span></p></td> +<td><p>Functor that returns the result of shifting the value_type right a specified number of bits. </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort_idp41281952.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp47034528.html b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp47034528.html new file mode 100644 index 000000000..8fe2b9137 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/float_sort_idp47034528.html @@ -0,0 +1,96 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template float_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"> +<link rel="prev" href="float_mem_cast.html" title="Function template float_mem_cast"> +<link rel="next" href="float_sort_idp41281952.html" title="Function template float_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_mem_cast.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp41281952.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.float_sort_idp47034528"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template float_sort</span></h2> +<p>boost::sort::spreadsort::float_sort — <code class="computeroutput">float_sort</code> with casting to the appropriate size. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>">boost/sort/spreadsort/float_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">float_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92788368"></a><h2>Description</h2> +<p> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_float_sort.htm" target="_top">windows_float_sort</a> <br> + <a href="../../../../../doc/graph/osx_float_sort.htm" target="_top">osx_float_sort</a></p> +<p><b>A simple example of sorting some floating-point is: </b></p> +<pre class="programlisting"><span class="identifier">vector</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">.</span><span class="number">0</span><span class="special">)</span><span class="special">;</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">.</span><span class="number">3</span><span class="special">)</span><span class="special">;</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">.</span><span class="number">3</span><span class="special">)</span><span class="special">;</span> +<span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span> +</pre> +<p> </p> +<p> +</p> +<p><b>The sorted vector contains ascending values "1.0 1.3 2.3". </b></p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_mem_cast.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort_idp41281952.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp41299456.html b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp41299456.html new file mode 100644 index 000000000..e37a5fab8 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp41299456.html @@ -0,0 +1,158 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template integer_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"> +<link rel="prev" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"> +<link rel="next" href="integer_sort_idp47906960.html" title="Function template integer_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="integer_sort_idp47906960.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.integer_sort_idp41299456"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template integer_sort</span></h2> +<p>boost::sort::spreadsort::integer_sort — Integer sort algorithm using random access iterators. (All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>). </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>">boost/sort/spreadsort/integer_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92924688"></a><h2>Description</h2> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="integer_sort_idp47906960.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47906960.html b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47906960.html new file mode 100644 index 000000000..3ed8cad12 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47906960.html @@ -0,0 +1,162 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template integer_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"> +<link rel="prev" href="integer_sort_idp41299456.html" title="Function template integer_sort"> +<link rel="next" href="integer_sort_idp47931200.html" title="Function template integer_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort_idp41299456.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="integer_sort_idp47931200.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.integer_sort_idp47906960"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template integer_sort</span></h2> +<p>boost::sort::spreadsort::integer_sort — Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>). </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>">boost/sort/spreadsort/integer_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Right_shift</span> shift<span class="special">,</span> <span class="identifier">Compare</span> comp<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp92976016"></a><h2>Description</h2> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order.</p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">shift</code></span></p></td> +<td><p>Functor that returns the result of shifting the value_type right a specified number of bits. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort_idp41299456.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="integer_sort_idp47931200.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47931200.html b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47931200.html new file mode 100644 index 000000000..f8bac4f3b --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/integer_sort_idp47931200.html @@ -0,0 +1,160 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template integer_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"> +<link rel="prev" href="integer_sort_idp47906960.html" title="Function template integer_sort"> +<link rel="next" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort_idp47906960.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.integer_sort_idp47931200"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template integer_sort</span></h2> +<p>boost::sort::spreadsort::integer_sort — Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>). </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>">boost/sort/spreadsort/integer_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Right_shift</span> shift<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93022688"></a><h2>Description</h2> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> + </p> +<p><b>Performance: </b>Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a><br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">shift</code></span></p></td> +<td><p>A functor that returns the result of shifting the value_type right a specified number of bits.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort_idp47906960.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/integer_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48055200.html b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48055200.html new file mode 100644 index 000000000..21610082a --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48055200.html @@ -0,0 +1,194 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template reverse_string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="string_sort_idp48031648.html" title="Function template string_sort"> +<link rel="next" href="reverse_string_idp48083936.html" title="Function template reverse_string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48031648.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48083936.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.reverse_string_idp48055200"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template reverse_string_sort</span></h2> +<p>boost::sort::spreadsort::reverse_string_sort — String sort algorithm using random access iterators, allowing character-type overloads. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">,</span> + <span class="keyword">typename</span> Unsigned_char_type<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">reverse_string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Compare</span> comp<span class="special">,</span> <span class="identifier">Unsigned_char_type</span> unused<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93544032"></a><h2>Description</h2> +<p>(All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < detail::min_sort_size).</p> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">unused</code></span></p></td> +<td><p>value with the same type as the result of the [] operator, defining the Unsigned_char_type. The actual value is unused.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Template Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">RandomAccessIter</code></span></p></td> +<td><p><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/" target="_top">Random access iterator</a> </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">Unsigned_char_type</code></span></p></td> +<td><p>Unsigned character type used for string.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48031648.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48083936.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48083936.html b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48083936.html new file mode 100644 index 000000000..33c4df765 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48083936.html @@ -0,0 +1,169 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template reverse_string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="reverse_string_idp48055200.html" title="Function template reverse_string_sort"> +<link rel="next" href="string_sort_idp48110368.html" title="Function template string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="reverse_string_idp48055200.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48110368.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.reverse_string_idp48083936"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template reverse_string_sort</span></h2> +<p>boost::sort::spreadsort::reverse_string_sort — String sort algorithm using random access iterators, wraps using default of <code class="computeroutput">unsigned</code> char. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">reverse_string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Compare</span> comp<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93600832"></a><h2>Description</h2> +<p>(All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>).</p> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order.</p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="reverse_string_idp48055200.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48110368.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48167040.html b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48167040.html new file mode 100644 index 000000000..c10f70208 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/reverse_string_idp48167040.html @@ -0,0 +1,173 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template reverse_string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="string_sort_idp48138640.html" title="Function template string_sort"> +<link rel="next" href="../../../index/s09.html" title="Function Index"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48138640.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../index/s09.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.reverse_string_idp48167040"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template reverse_string_sort</span></h2> +<p>boost::sort::spreadsort::reverse_string_sort — Reverse String sort algorithm using random access iterators. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> <span class="keyword">typename</span> Get_length<span class="special">,</span> + <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">reverse_string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Get_char</span> getchar<span class="special">,</span> <span class="identifier">Get_length</span> length<span class="special">,</span> <span class="identifier">Compare</span> comp<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93772672"></a><h2>Description</h2> +<p>(All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>).</p> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order.</p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">getchar</code></span></p></td> +<td><p>Bracket functor equivalent to <code class="computeroutput">operator</code>[], taking a number corresponding to the character offset. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">length</code></span></p></td> +<td><p>Functor to get the length of the string in characters. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48138640.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../index/s09.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47957744.html b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47957744.html new file mode 100644 index 000000000..0e6036fd0 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47957744.html @@ -0,0 +1,118 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template spreadsort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"> +<link rel="prev" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"> +<link rel="next" href="spreadsort_idp47972192.html" title="Function template spreadsort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spreadsort_idp47972192.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.spreadsort_idp47957744"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template spreadsort</span></h2> +<p>boost::sort::spreadsort::spreadsort — Generic <code class="computeroutput">spreadsort</code> variant detecting integer-type elements so call to <code class="computeroutput">integer_sort</code>. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>">boost/sort/spreadsort/spreadsort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_integer</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93182560"></a><h2>Description</h2> +<p>If the data type provided is an integer, <code class="computeroutput">integer_sort</code> is used. </p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Sorting other data types requires picking between <code class="computeroutput">integer_sort</code>, <code class="computeroutput">float_sort</code> and <code class="computeroutput">string_sort</code> directly, as <code class="computeroutput">spreadsort</code> won't accept types that don't have the appropriate <code class="computeroutput">type_traits</code>. </p></td></tr> +</table></div> +<p> + + + + + + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order. </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spreadsort_idp47972192.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47972192.html b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47972192.html new file mode 100644 index 000000000..1604e0b97 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47972192.html @@ -0,0 +1,118 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template spreadsort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"> +<link rel="prev" href="spreadsort_idp47957744.html" title="Function template spreadsort"> +<link rel="next" href="spreadsort_idp47986816.html" title="Function template spreadsort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="spreadsort_idp47957744.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spreadsort_idp47986816.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.spreadsort_idp47972192"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template spreadsort</span></h2> +<p>boost::sort::spreadsort::spreadsort — Generic <code class="computeroutput">spreadsort</code> variant detecting float element type so call to <code class="computeroutput">float_sort</code>. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>">boost/sort/spreadsort/spreadsort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="special">!</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_integer</span> <span class="special">&&</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_iec559</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93242576"></a><h2>Description</h2> +<p>If the data type provided is a float or castable-float, <code class="computeroutput">float_sort</code> is used. </p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Sorting other data types requires picking between <code class="computeroutput">integer_sort</code>, <code class="computeroutput">float_sort</code> and <code class="computeroutput">string_sort</code> directly, as <code class="computeroutput">spreadsort</code> won't accept types that don't have the appropriate <code class="computeroutput">type_traits</code>.</p></td></tr> +</table></div> +<p> + + + + + + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order. </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="spreadsort_idp47957744.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spreadsort_idp47986816.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47986816.html b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47986816.html new file mode 100644 index 000000000..5ce8441b0 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/spreadsort_idp47986816.html @@ -0,0 +1,118 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template spreadsort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"> +<link rel="prev" href="spreadsort_idp47972192.html" title="Function template spreadsort"> +<link rel="next" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="spreadsort_idp47972192.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.spreadsort_idp47986816"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template spreadsort</span></h2> +<p>boost::sort::spreadsort::spreadsort — Generic <code class="computeroutput">spreadsort</code> variant detecting string element type so call to <code class="computeroutput">string_sort</code> for <code class="computeroutput">std::strings</code> and <code class="computeroutput">std::wstrings</code>. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>">boost/sort/spreadsort/spreadsort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="identifier">is_same</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">||</span><span class="identifier">is_same</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">wstring</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93307168"></a><h2>Description</h2> +<p>If the data type provided is a string or wstring, <code class="computeroutput">string_sort</code> is used. </p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Sorting other data types requires picking between <code class="computeroutput">integer_sort</code>, <code class="computeroutput">float_sort</code> and <code class="computeroutput">string_sort</code> directly, as <code class="computeroutput">spreadsort</code> won't accept types that don't have the appropriate <code class="computeroutput">type_traits</code>.</p></td></tr> +</table></div> +<p> + + + + + + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order. </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="spreadsort_idp47972192.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/spreadsort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48004640.html b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48004640.html new file mode 100644 index 000000000..87f12474e --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48004640.html @@ -0,0 +1,186 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="next" href="string_sort_idp48031648.html" title="Function template string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48031648.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.string_sort_idp48004640"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template string_sort</span></h2> +<p>boost::sort::spreadsort::string_sort — String sort algorithm using random access iterators, allowing character-type overloads.<br> + (All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>). </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Unsigned_char_type<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Unsigned_char_type</span> unused<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93442832"></a><h2>Description</h2> +<p><code class="computeroutput">string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +</p> +<p><b> </b>Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> +<a href="../../../../../doc/graph/windows_string_sort.htm" target="_top">windows_string_sort</a><br> +<a href="../../../../../doc/graph/osx_string_sort.htm" target="_top">osx_string_sort</a></p> +<p> + + + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">unused</code></span></p></td> +<td><p>value with the same type as the result of the [] operator, defining the Unsigned_char_type. The actual value is unused.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Template Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">RandomAccessIter</code></span></p></td> +<td><p><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/" target="_top">Random access iterator</a> </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">Unsigned_char_type</code></span></p></td> +<td><p>Unsigned character type used for string. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48031648.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48031648.html b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48031648.html new file mode 100644 index 000000000..5a3adcdfe --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48031648.html @@ -0,0 +1,158 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="string_sort_idp48004640.html" title="Function template string_sort"> +<link rel="next" href="reverse_string_idp48055200.html" title="Function template reverse_string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48004640.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48055200.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.string_sort_idp48031648"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template string_sort</span></h2> +<p>boost::sort::spreadsort::string_sort — String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>). </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93494304"></a><h2>Description</h2> +<p><code class="computeroutput">string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_string_sort.htm" target="_top">windows_string_sort</a> <br> + <a href="../../../../../doc/graph/osx_string_sort.htm" target="_top">osx_string_sort</a></p> +<p> + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48004640.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48055200.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48110368.html b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48110368.html new file mode 100644 index 000000000..d7826411d --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48110368.html @@ -0,0 +1,173 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="reverse_string_idp48083936.html" title="Function template reverse_string_sort"> +<link rel="next" href="string_sort_idp48138640.html" title="Function template string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="reverse_string_idp48083936.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48138640.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.string_sort_idp48110368"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template string_sort</span></h2> +<p>boost::sort::spreadsort::string_sort — String sort algorithm using random access iterators, wraps using default of <code class="computeroutput">unsigned</code> char. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> <span class="keyword">typename</span> Get_length<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Get_char</span> getchar<span class="special">,</span> <span class="identifier">Get_length</span> length<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93655728"></a><h2>Description</h2> +<p>(All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>).</p> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">getchar</code></span></p></td> +<td><p>Bracket functor equivalent to <code class="computeroutput">operator</code>[], taking a number corresponding to the character offset. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">length</code></span></p></td> +<td><p>Functor to get the length of the string in characters.</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> supports the <code class="computeroutput">operator>></code>, which returns an integer-type right-shifted a specified number of bits. </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="reverse_string_idp48083936.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort_idp48138640.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48138640.html b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48138640.html new file mode 100644 index 000000000..4ddeefc14 --- /dev/null +++ b/libs/sort/doc/html/boost/sort/spreadsort/string_sort_idp48138640.html @@ -0,0 +1,173 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template string_sort</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"> +<link rel="prev" href="string_sort_idp48110368.html" title="Function template string_sort"> +<link rel="next" href="reverse_string_idp48167040.html" title="Function template reverse_string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48110368.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48167040.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.sort.spreadsort.string_sort_idp48138640"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template string_sort</span></h2> +<p>boost::sort::spreadsort::string_sort — String sort algorithm using random access iterators, wraps using default of <code class="computeroutput">unsigned</code> char. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>">boost/sort/spreadsort/string_sort.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> <span class="keyword">typename</span> Get_length<span class="special">,</span> + <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span> first<span class="special">,</span> <span class="identifier">RandomAccessIter</span> last<span class="special">,</span> + <span class="identifier">Get_char</span> getchar<span class="special">,</span> <span class="identifier">Get_length</span> length<span class="special">,</span> <span class="identifier">Compare</span> comp<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp93715280"></a><h2>Description</h2> +<p>(All variants fall back to <code class="computeroutput">std::sort</code> if the data size is too small, < <code class="computeroutput">detail::min_sort_size</code>).</p> +<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (>=100kB).<br> +Worst-case performance is <span class="emphasis"><em> O(N * (lg(range)/s + s)) </em></span>, so <code class="computeroutput">integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code class="computeroutput">s</code> is <code class="computeroutput">max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <span class="emphasis"><em> O(N * ((32/11) </em></span> slow radix-based iterations fast comparison-based iterations).<br> +<br> +Some performance plots of runtime vs. n and log(range) are provided:<br> + <a href="../../../../../doc/graph/windows_integer_sort.htm" target="_top">windows_integer_sort</a> <br> + <a href="../../../../../doc/graph/osx_integer_sort.htm" target="_top">osx_integer_sort</a></p> +<p> + + + + + + +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </p></td></tr> +</table></div> +<p> +</p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p>Invalid arguments cause undefined behaviour. </p></td></tr> +</table></div> +<p> +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p><code class="computeroutput">spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</p></td></tr> +</table></div> +<p> +</p> +<p>The lesser of <span class="emphasis"><em> O(N*log(N)) </em></span> comparisons and <span class="emphasis"><em> O(N*log(K/S + S)) </em></span>operations worst-case, where: </p> +<p> +</p> +<p>* N is <code class="computeroutput">last</code> - <code class="computeroutput">first</code>, </p> +<p> +</p> +<p>* K is the log of the range in bits (32 for 32-bit integers using their full range), </p> +<p> +</p> +<p>* S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </p> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">comp</code></span></p></td> +<td><p>A binary functor that returns whether the first element passed to it should go before the second in order.</p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>Iterator pointer to first element. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">getchar</code></span></p></td> +<td><p>Bracket functor equivalent to <code class="computeroutput">operator</code>[], taking a number corresponding to the character offset. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>Iterator pointing to one beyond the end of data. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">length</code></span></p></td> +<td><p>Functor to get the length of the string in characters. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p>[<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) is a valid range. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is mutable. </p></td> +</tr> +<tr> +<td><p><span class="term">Requires:</span></p></td> +<td><p><code class="computeroutput">RandomAccessIter</code> <code class="computeroutput">value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable" target="_top">LessThanComparable</a> </p></td> +</tr> +<tr> +<td><p><span class="term">Postconditions:</span></p></td> +<td><p>The elements in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) are sorted in ascending order.</p></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p><code class="computeroutput">void</code>.</p></td> +</tr> +<tr> +<td><p><span class="term">Throws:</span></p></td> +<td>std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort_idp48110368.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../header/boost/sort/spreadsort/string_sort_hpp.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_string_idp48167040.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/boost_sort_c___reference.html b/libs/sort/doc/html/boost_sort_c___reference.html new file mode 100644 index 000000000..5fd9fed33 --- /dev/null +++ b/libs/sort/doc/html/boost_sort_c___reference.html @@ -0,0 +1,72 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Boost.Sort C++ Reference</title> +<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="index.html" title="Boost.Sort"> +<link rel="up" href="index.html" title="Boost.Sort"> +<link rel="prev" href="sort/history.html" title="History"> +<link rel="next" href="boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> +<td align="center"><a href="../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="sort/history.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost/sort/spreadsort/float_mem_cast.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="boost_sort_c___reference"></a>Boost.Sort C++ Reference</h2></div></div></div> +<div class="toc"><dl class="toc"> +<dt><span class="section"><a href="boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp">Header <boost/sort/spreadsort/float_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/integer_sort_hpp.html">Header <boost/sort/spreadsort/integer_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/spreadsort_hpp.html">Header <boost/sort/spreadsort/spreadsort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/string_sort_hpp.html">Header <boost/sort/spreadsort/string_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.sort.spreadsort.float_sort_hpp"></a>Header <<a href="../../../../boost/sort/spreadsort/float_sort.hpp" target="_top">boost/sort/spreadsort/float_sort.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">sort</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">spreadsort</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Data_type<span class="special">,</span> <span class="keyword">typename</span> Cast_type<span class="special">></span> + <span class="identifier">Cast_type</span> <a class="link" href="boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="identifier">float_mem_cast</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Data_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="identifier">float_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="boost/sort/spreadsort/float_sort_idp41281952.html" title="Function template float_sort"><span class="identifier">float_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Right_shift</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">,</span> + <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="boost/sort/spreadsort/float_sort_idp41288368.html" title="Function template float_sort"><span class="identifier">float_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Right_shift</span><span class="special">,</span> + <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="sort/history.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost/sort/spreadsort/float_mem_cast.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/header/boost/sort/spreadsort/integer_sort_hpp.html b/libs/sort/doc/html/header/boost/sort/spreadsort/integer_sort_hpp.html new file mode 100644 index 000000000..fa5365ed3 --- /dev/null +++ b/libs/sort/doc/html/header/boost/sort/spreadsort/integer_sort_hpp.html @@ -0,0 +1,56 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/sort/spreadsort/integer_sort.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../../boost_sort_c___reference.html" title="Boost.Sort C++ Reference"> +<link rel="prev" href="../../../../boost/sort/spreadsort/float_sort_idp41288368.html" title="Function template float_sort"> +<link rel="next" href="../../../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/float_sort_idp41288368.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/integer_sort_idp41299456.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.sort.spreadsort.integer_sort_hpp"></a>Header <<a href="../../../../../../../../boost/sort/spreadsort/integer_sort.hpp" target="_top">boost/sort/spreadsort/integer_sort.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">sort</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">spreadsort</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="identifier">integer_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">,</span> + <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/integer_sort_idp47906960.html" title="Function template integer_sort"><span class="identifier">integer_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Right_shift</span><span class="special">,</span> + <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Right_shift<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/integer_sort_idp47931200.html" title="Function template integer_sort"><span class="identifier">integer_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Right_shift</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/float_sort_idp41288368.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/integer_sort_idp41299456.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/header/boost/sort/spreadsort/spreadsort_hpp.html b/libs/sort/doc/html/header/boost/sort/spreadsort/spreadsort_hpp.html new file mode 100644 index 000000000..c32199919 --- /dev/null +++ b/libs/sort/doc/html/header/boost/sort/spreadsort/spreadsort_hpp.html @@ -0,0 +1,57 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/sort/spreadsort/spreadsort.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../../boost_sort_c___reference.html" title="Boost.Sort C++ Reference"> +<link rel="prev" href="../../../../boost/sort/spreadsort/integer_sort_idp47931200.html" title="Function template integer_sort"> +<link rel="next" href="../../../../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/integer_sort_idp47931200.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/spreadsort_idp47957744.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.sort.spreadsort.spreadsort_hpp"></a>Header <<a href="../../../../../../../../boost/sort/spreadsort/spreadsort.hpp" target="_top">boost/sort/spreadsort/spreadsort.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">sort</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">spreadsort</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_integer</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="identifier">spreadsort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="special">!</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_integer</span> <span class="special">&&</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">is_iec559</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/sort/spreadsort/spreadsort_idp47972192.html" title="Function template spreadsort"><span class="identifier">spreadsort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if_c</span><span class="special"><</span> <span class="identifier">is_same</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">||</span><span class="identifier">is_same</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandomAccessIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">wstring</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">void</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/sort/spreadsort/spreadsort_idp47986816.html" title="Function template spreadsort"><span class="identifier">spreadsort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/integer_sort_idp47931200.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/spreadsort_idp47957744.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/header/boost/sort/spreadsort/string_sort_hpp.html b/libs/sort/doc/html/header/boost/sort/spreadsort/string_sort_hpp.html new file mode 100644 index 000000000..a92a62d0b --- /dev/null +++ b/libs/sort/doc/html/header/boost/sort/spreadsort/string_sort_hpp.html @@ -0,0 +1,71 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/sort/spreadsort/string_sort.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../../index.html" title="Boost.Sort"> +<link rel="up" href="../../../../boost_sort_c___reference.html" title="Boost.Sort C++ Reference"> +<link rel="prev" href="../../../../boost/sort/spreadsort/spreadsort_idp47986816.html" title="Function template spreadsort"> +<link rel="next" href="../../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/spreadsort_idp47986816.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/string_sort_idp48004640.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.sort.spreadsort.string_sort_hpp"></a>Header <<a href="../../../../../../../../boost/sort/spreadsort/string_sort.hpp" target="_top">boost/sort/spreadsort/string_sort.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">sort</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">spreadsort</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Unsigned_char_type<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="identifier">string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> + <span class="identifier">Unsigned_char_type</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/string_sort_idp48031648.html" title="Function template string_sort"><span class="identifier">string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">,</span> + <span class="keyword">typename</span> Unsigned_char_type<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="identifier">reverse_string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> + <span class="identifier">Unsigned_char_type</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/reverse_string_idp48083936.html" title="Function template reverse_string_sort"><span class="identifier">reverse_string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> + <span class="keyword">typename</span> Get_length<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/string_sort_idp48110368.html" title="Function template string_sort"><span class="identifier">string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Get_char</span><span class="special">,</span> + <span class="identifier">Get_length</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> + <span class="keyword">typename</span> Get_length<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/string_sort_idp48138640.html" title="Function template string_sort"><span class="identifier">string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Get_char</span><span class="special">,</span> + <span class="identifier">Get_length</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> RandomAccessIter<span class="special">,</span> <span class="keyword">typename</span> Get_char<span class="special">,</span> + <span class="keyword">typename</span> Get_length<span class="special">,</span> <span class="keyword">typename</span> Compare<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/sort/spreadsort/reverse_string_idp48167040.html" title="Function template reverse_string_sort"><span class="identifier">reverse_string_sort</span></a><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Get_char</span><span class="special">,</span> + <span class="identifier">Get_length</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/sort/spreadsort/spreadsort_idp47986816.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../boost_sort_c___reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/sort/spreadsort/string_sort_idp48004640.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/index.html b/libs/sort/doc/html/index.html new file mode 100644 index 000000000..7fd9278c0 --- /dev/null +++ b/libs/sort/doc/html/index.html @@ -0,0 +1,668 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Boost.Sort</title> +<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="index.html" title="Boost.Sort"> +<link rel="next" href="sort/sort_hpp.html" title="Spreadsort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> +<td align="center"><a href="../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"><a accesskey="n" href="sort/sort_hpp.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div> +<div class="chapter"> +<div class="titlepage"><div> +<div><h2 class="title"> +<a name="sort"></a>Boost.Sort</h2></div> +<div><div class="author"><h3 class="author"> +<span class="firstname">Steven</span> <span class="surname">Ross</span> +</h3></div></div> +<div><p class="copyright">Copyright © 2014 Steven Ross</p></div> +<div><div class="legalnotice"> +<a name="sort.legal"></a><p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></div> +</div></div> +<div class="toc"> +<p><b>Table of Contents</b></p> +<dl class="toc"> +<dt><span class="section"><a href="index.html#sort.overview">Overview</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="index.html#sort.overview.intro">Introduction</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.overloading">Overloading</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.performance">Performance</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.tuning">Tuning</a></span></dt> +</dl></dd> +<dt><span class="section"><a href="sort/sort_hpp.html">Spreadsort</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="sort/sort_hpp.html#sort.sort_hpp.header_spreadsort">Header <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">sort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code></a></span></dt> +<dd><dl><dt><span class="section"><a href="sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples">Spreadsort + Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort/sort_hpp/integer_sort.html">Integer Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples">Integer + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort/sort_hpp/float_sort.html">Float Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples">Float + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort/sort_hpp/string_sort.html">String Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples">String + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort/sort_hpp/rationale.html">Rationale</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="sort/sort_hpp/rationale.html#sort.sort_hpp.rationale.radix_sorting">Radix Sorting</a></span></dt> +<dt><span class="section"><a href="sort/sort_hpp/rationale/hybrid_radix.html">Hybrid Radix</a></span></dt> +<dt><span class="section"><a href="sort/sort_hpp/rationale/why_spreadsort.html">Why spreadsort?</a></span></dt> +<dt><span class="section"><a href="sort/sort_hpp/rationale/unstable_sort.html">Unstable Sorting</a></span></dt> +<dt><span class="section"><a href="sort/sort_hpp/rationale/optimization.html">Unused X86 optimization</a></span></dt> +<dt><span class="section"><a href="sort/sort_hpp/rationale/lookup.html">Lookup Table?</a></span></dt> +</dl></dd> +</dl></dd> +<dt><span class="section"><a href="sort/definitions.html">Definitions</a></span></dt> +<dt><span class="section"><a href="sort/faq.html">Frequently Asked Questions</a></span></dt> +<dt><span class="section"><a href="sort/acks.html">Acknowledgements</a></span></dt> +<dt><span class="section"><a href="sort/bibliog.html">Bibliography</a></span></dt> +<dt><span class="section"><a href="sort/history.html">History</a></span></dt> +<dt><span class="section"><a href="boost_sort_c___reference.html">Boost.Sort C++ Reference</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp">Header <boost/sort/spreadsort/float_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/integer_sort_hpp.html">Header <boost/sort/spreadsort/integer_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/spreadsort_hpp.html">Header <boost/sort/spreadsort/spreadsort.hpp></a></span></dt> +<dd><dl></dl></dd> +<dt><span class="section"><a href="header/boost/sort/spreadsort/string_sort_hpp.html">Header <boost/sort/spreadsort/string_sort.hpp></a></span></dt> +<dd><dl></dl></dd> +</dl></dd> +<dt><span class="section"><a href="index/s09.html">Function Index</a></span></dt> +<dt><span class="section"><a href="index/s10.html">Index</a></span></dt> +</dl> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.overview"></a><a class="link" href="index.html#sort.overview" title="Overview">Overview</a> +</h2></div></div></div> +<div class="toc"><dl class="toc"> +<dt><span class="section"><a href="index.html#sort.overview.intro">Introduction</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.overloading">Overloading</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.performance">Performance</a></span></dt> +<dt><span class="section"><a href="index.html#sort.overview.tuning">Tuning</a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.overview.intro"></a><a class="link" href="index.html#sort.overview.intro" title="Introduction">Introduction</a> +</h3></div></div></div> +<p> + The Boost.Sort library provides a generic implementation of high-speed sorting + algorithms that outperform those in the C++ standard in both average and + worst case performance when there are over 1000 elements in the list to sort. + </p> +<p> + They fall back to <a href="http://www.cplusplus.com/reference/algorithm/sort/" target="_top">STL + std::sort</a> on small data sets. + </p> +<div class="warning"><table border="0" summary="Warning"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/src/images/warning.png"></td> +<th align="left">Warning</th> +</tr> +<tr><td align="left" valign="top"><p> + These algorithms all only work on <a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/" target="_top">random + access iterators</a>. + </p></td></tr> +</table></div> +<p> + They are hybrids using both radix and comparison-based sorting, specialized + to sorting common data types, such as integers, floats, and strings. + </p> +<p> + These algorithms are encoded in a generic fashion and accept functors, enabling + them to sort any object that can be processed like these basic data types. + In the case of <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code>, + this includes anything with a defined strict-weak-ordering that <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + can sort, but writing efficient functors for some complex key types may not + be worth the additional effort relative to just using <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>, + depending on how important speed is to your application. Sample usages are + available in the example directory. + </p> +<p> + Unlike many radix-based algorithms, the underlying <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + algorithm is designed around <span class="bold"><strong>worst-case performance</strong></span>. + It performs better on chunky data (where it is not widely distributed), so + that on real data it can perform substantially better than on random data. + Conceptually, <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + can sort any data for which an absolute ordering can be determined, and + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is sufficiently flexible that this should be possible. + </p> +<p> + Situations where <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + is fastest relative to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>: + </p> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"> + Large number of elements to sort (<span class="emphasis"><em>N</em></span> >= 10000). + </li> +<li class="listitem"> + Slow comparison function (such as floating-point numbers on x86 processors + or strings). + </li> +<li class="listitem"> + Large data elements (such as key + data sorted on a key). + </li> +<li class="listitem"> + Completely sorted data when <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + has an optimization to quit early in this case. + </li> +</ol></div> +<p> + Situations where <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + is slower than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>: + </p> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"> + Data sorted in reverse order. Both <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + are faster on reverse-ordered data than randomized data, but <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + speeds up more in this special case. + </li> +<li class="listitem"> + Very small amounts of data (< 1000 elements). For this reason there + is a fallback in <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + if the input size is less than 1000, so performance is identical for + small amounts of data in practice. + </li> +</ol></div> +<p> + These functions are defined in <code class="computeroutput"><span class="keyword">namespace</span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">::</span><span class="identifier">spreadsort</span></code>. + </p> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.overview.overloading"></a><a class="link" href="index.html#sort.overview.overloading" title="Overloading">Overloading</a> +</h3></div></div></div> +<div class="tip"><table border="0" summary="Tip"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../doc/src/images/tip.png"></td> +<th align="left">Tip</th> +</tr> +<tr><td align="left" valign="top"><p> + In the Boost.Sort C++ Reference section, click on the appropriate overload, + for example <code class="computeroutput"><span class="identifier">float_sort</span><span class="special">(</span><span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">RandomAccessIter</span><span class="special">,</span> <span class="identifier">Right_shift</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">);</span></code> to get full details of that overload. + </p></td></tr> +</table></div> +<p> + Each of <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>, + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + have 3 main versions: The base version, which takes a first iterator and + a last iterator, just like <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>: + </p> +<pre class="programlisting"><span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> +<span class="identifier">float_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> +<span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> +</pre> +<p> + The version with an overridden shift functor, providing flexibility in case + the <code class="computeroutput"><span class="keyword">operator</span><span class="special">>></span></code> + already does something other than a bitshift. The rightshift functor takes + two args, first the data type, and second a natural number of bits to shift + right. + </p> +<p> + For <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + this variant is slightly different; it needs a bracket functor equivalent + to <code class="computeroutput"><span class="keyword">operator</span></code>[], taking a number + corresponding to the character offset, along with a second <code class="computeroutput"><span class="identifier">getlength</span></code> functor to get the length of + the string in characters. In all cases, this operator must return an integer + type that compares with the <code class="computeroutput"><span class="keyword">operator</span><span class="special"><</span></code> to provide the intended order (integers + can be negated to reverse their order). + </p> +<p> + In other words: + </p> +<pre class="programlisting"><span class="identifier">rightshift</span><span class="special">(</span><span class="identifier">A</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="special"><</span> <span class="identifier">rightshift</span><span class="special">(</span><span class="identifier">B</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="special">-></span> <span class="identifier">A</span> <span class="special"><</span> <span class="identifier">B</span> +</pre> +<pre class="programlisting"><span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">rightshift</span><span class="special">());</span> +</pre> +<pre class="programlisting"><span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">bracket</span><span class="special">(),</span> <span class="identifier">getsize</span><span class="special">());</span> +</pre> +<p> + See <a href="../../example/rightshiftsample.cpp" target="_top">rightshiftsample.cpp</a> + for a working example of integer sorting with a rightshift functor. + </p> +<p> + And a version with a comparison functor for maximum flexibility. This functor + must provide the same sorting order as the integers returned by the rightshift: + </p> +<pre class="programlisting"><span class="identifier">rightshift</span><span class="special">(</span><span class="identifier">A</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="special"><</span> <span class="identifier">rightshift</span><span class="special">(</span><span class="identifier">B</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="special">-></span> <span class="identifier">compare</span><span class="special">(</span><span class="identifier">A</span><span class="special">,</span> <span class="identifier">B</span><span class="special">)</span> +</pre> +<pre class="programlisting"><span class="identifier">integer_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">negrightshift</span><span class="special">(),</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">greater</span><span class="special"><</span><span class="identifier">DATA_TYPE</span><span class="special">>());</span> +</pre> +<p> + Examples of functors are: + </p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">lessthan</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">y</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">a</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">bracket</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">unsigned</span> <span class="keyword">char</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">size_t</span> <span class="identifier">offset</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span><span class="special">[</span><span class="identifier">offset</span><span class="special">];</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">getsize</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="identifier">size_t</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span><span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> <span class="special">}</span> +<span class="special">};</span> +</pre> +<p> + and these functors are used thus: + </p> +<pre class="programlisting"><span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">bracket</span><span class="special">(),</span> <span class="identifier">getsize</span><span class="special">(),</span> <span class="identifier">lessthan</span><span class="special">());</span> +</pre> +<p> + See <a href="../../example/stringfunctorsample.cpp" target="_top">stringfunctorsample.cpp</a> + for a working example of sorting strings with all functors. + </p> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.overview.performance"></a><a class="link" href="index.html#sort.overview.performance" title="Performance">Performance</a> +</h3></div></div></div> +<p> + The <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + algorithm is a hybrid algorithm; when the number of elements being sorted + is below a certain number, comparison-based sorting is used. Above it, radix + sorting is used. The radix-based algorithm will thus cut up the problem into + small pieces, and either completely sort the data based upon its radix if + the data is clustered, or finish sorting the cut-down pieces with comparison-based + sorting. + </p> +<p> + The Spreadsort algorithm dynamically chooses either comparison-based or radix-based + sorting when recursing, whichever provides better worst-case performance. + This way worst-case performance is guaranteed to be the better of <span class="emphasis"><em>𝑶(N⋅log2(N))</em></span> + comparisons and <span class="emphasis"><em>𝑶(N⋅log2(K/S + S))</em></span> operations where + </p> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + <span class="emphasis"><em>N</em></span> is the number of elements being sorted, + </li> +<li class="listitem"> + <span class="emphasis"><em>K</em></span> is the length in bits of the key, and + </li> +<li class="listitem"> + <span class="emphasis"><em>S</em></span> is a constant. + </li> +</ul></div> +<p> + This results in substantially improved performance for large <span class="emphasis"><em>N</em></span>; + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + tends to be 50% to 2X faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>, + while <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + and _string_sort are roughly 2X faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>. + </p> +<p> + Performance graphs are provided for <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>, + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + in their description. + </p> +<p> + Runtime Performance comparisons and graphs were made on a Core 2 Duo laptop + running Windows Vista 64 with MSVC 8.0, and an old G4 laptop running Mac + OSX with gcc. <a href="http://www.boost.org/build/doc/html/" target="_top">Boost bjam/b2</a> + was used to control compilation. + </p> +<p> + Direct performance comparisons on a newer x86 system running Ubuntu, with + the fallback to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + at lower input sizes disabled are below. + </p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p> + The fallback to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + for smaller input sizes prevents the worse performance seen on the left + sides of the first two graphs. + </p></td></tr> +</table></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + starts to become faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + at about 1000 integers (4000 bytes), and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + becomes faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + at slightly fewer bytes (as few as 30 strings). + </p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p> + The 4-threaded graph has 4 threads doing <span class="bold"><strong>separate + sorts simultaneously</strong></span> (not splitting up a single sort) as a test + for thread cache collision and other multi-threaded performance issues. + </p></td></tr> +</table></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + times are very similar to <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + times. + </p> +<p> + <span class="inlinemediaobject"><img src="../images/single_threaded.png"></span> + <span class="inlinemediaobject"><img src="../images/4_threaded.png"></span> + <span class="inlinemediaobject"><img src="../images/entropy.png"></span> + <span class="inlinemediaobject"><img src="../images/bits_per_byte.png"></span> + </p> +<p> + Histogramming with a fixed maximum number of splits is used because it reduces + the number of cache misses, thus improving performance relative to the approach + described in detail in the <a href="http://en.wikipedia.org/wiki/Spreadsort" target="_top">original + SpreadSort publication</a>. + </p> +<p> + The importance of cache-friendly histogramming is described in <a href="http://www.nik.no/2002/Maus.pdf" target="_top">Arne + Maus, Adaptive Left Reflex</a>, though without the worst-case handling + described below. + </p> +<p> + The time taken per radix iteration is: + </p> +<p> + <span class="emphasis"><em>𝑶(N)</em></span> iterations over the data + </p> +<p> + <span class="emphasis"><em>𝑶(N)</em></span> integer-type comparisons (even for _float_sort and + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code>) + </p> +<p> + <span class="emphasis"><em>𝑶(N)</em></span> swaps + </p> +<p> + <span class="emphasis"><em>𝑶(2<sup>S</sup>)</em></span> bin operations. + </p> +<p> + To obtain <span class="emphasis"><em>𝑶(N)</em></span> worst-case performance per iteration, + the restriction <span class="emphasis"><em>S <= log2(N)</em></span> is applied, and <span class="emphasis"><em>𝑶(2<sup>S</sup>)</em></span> + becomes <span class="emphasis"><em>𝑶(N)</em></span>. For each such iteration, the number of + unsorted bits log2(range) (referred to as <span class="emphasis"><em>K</em></span>) per element + is reduced by <span class="emphasis"><em>S</em></span>. As <span class="emphasis"><em>S</em></span> decreases + depending upon the amount of elements being sorted, it can drop from a maximum + of <span class="emphasis"><em>S<sub>max</sub></em></span> to the minimum of <span class="emphasis"><em>S<sub>min</sub></em></span>. + </p> +<p> + Assumption: <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + is assumed to be <span class="emphasis"><em>𝑶(N*log2(N))</em></span>, as <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + exists and is commonly used. (If you have a quibble with this please take + it up with the implementor of your <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>; + you're welcome to replace the recursive calls to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + to calls to <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + if your <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + library call is poorly implemented). + </p> +<p> + <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">Introsort</a> is + not included with this algorithm for simplicity and because the implementor + of the <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + call is assumed to know what they're doing. + </p> +<p> + To maintain a minimum value for <span class="emphasis"><em>S (S<sub>min</sub>)</em></span>, comparison-based + sorting has to be used to sort when <span class="emphasis"><em>n <= log2(meanbinsize)</em></span>, + where <span class="emphasis"><em>log2(meanbinsize) (lbs)</em></span> is a small constant, usually + between 0 and 4, used to minimize bin overhead per element. There is a small + corner-case where if <span class="emphasis"><em>K < S<sub>min</sub></em></span> and <span class="emphasis"><em>n >= + 2^K</em></span>, then the data can be sorted in a single radix-based iteration + with an <span class="emphasis"><em>S = K</em></span> (this bucketsorting special case is by + default only applied to <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>). + So for the final recursion, worst-case performance is: + </p> +<p> + 1 radix-based iteration if <span class="emphasis"><em>K <= S<sub>min</sub></em></span>, + </p> +<p> + or <span class="emphasis"><em>S<sub>min</sub> + lbs</em></span> comparison-based iterations if <span class="emphasis"><em>K + > S<sub>min</sub></em></span> but <span class="emphasis"><em>n <= 2<sup>(S<sub>min</sub> + lbs)</sup></em></span>. + </p> +<p> + So for the final iteration, worst-case runtime is <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + lbs))</em></span> + but if <span class="emphasis"><em>K > S<sub>min</sub></em></span> and <span class="emphasis"><em>N > 2<sup>(S<sub>min</sub> + lbs)</sup></em></span> + then more than 1 radix recursion will be required. + </p> +<p> + For the second to last iteration, <span class="emphasis"><em>K <= S<sub>min</sub> * 2 + 1</em></span> + can be handled, (if the data is divided into <span class="emphasis"><em>2<sup>(S<sub>min</sub> + 1)</sup></em></span> + pieces) or if <span class="emphasis"><em>N < 2<sup>(S<sub>min</sub> + lbs + 1)</sup></em></span>, then it is faster + to fallback to <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>. + </p> +<p> + In the case of a radix-based sort plus recursion, it will take <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + + lbs)) + 𝑶(N) = 𝑶(N*(S<sub>min</sub> + lbs + 1))</em></span> worst-case time, as <span class="emphasis"><em>K_remaining + = K_start - (S<sub>min</sub> + 1)</em></span>, and <span class="emphasis"><em>K_start <= S<sub>min</sub> * 2 + 1</em></span>. + </p> +<p> + Alternatively, comparison-based sorting is used if <span class="emphasis"><em>N < 2<sup>(S<sub>min</sub> + + lbs + 1)</sup></em></span>, which will take <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + lbs + 1))</em></span> + time. + </p> +<p> + So either way <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + lbs + 1))</em></span> is the worst-case + time for the second to last iteration, which occurs if <span class="emphasis"><em>K <= + S<sub>min</sub> * 2 + </em></span>1 or <span class="emphasis"><em>N < 2<sup>(S<sub>min</sub> + lbs + 1)</sup></em></span>. + </p> +<p> + This continues as long as <span class="emphasis"><em>S<sub>min</sub> <= S <= S<sub>max</sub></em></span>, so + that for <span class="emphasis"><em>K_m <= K_(m-1) + S<sub>min</sub> + m</em></span> where <span class="emphasis"><em>m</em></span> + is the maximum number of iterations after this one has finished, or where + <span class="emphasis"><em>N < 2<sup>(S<sub>min</sub> + lbs + m)</sup></em></span>, then the worst-case runtime + is <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + lbs + m))</em></span>. + </p> +<p> +    <span class="emphasis"><em>K_m</em></span> at <span class="emphasis"><em>m <= (S<sub>max</sub> - S<sub>min</sub>)</em></span> works + out to: + </p> +<p> +    <span class="emphasis"><em>K_1 <= (S<sub>min</sub>) + S<sub>min</sub> + 1 <= 2S<sub>min</sub> + 1</em></span> + </p> +<p> +    <span class="emphasis"><em>K_2 <= (2S<sub>min</sub> + 1) + S<sub>min</sub> + 2</em></span> + </p> +<p> + as the sum from 0 to <span class="emphasis"><em>m</em></span> is <span class="emphasis"><em>m(m + 1)/2</em></span> + </p> +<p> +    <span class="emphasis"><em>K_m <= (m + 1)S<sub>min</sub> + m(m + 1)/2 <= (S<sub>min</sub> + m/2)(m + 1)</em></span> + </p> +<p> + substituting in S<sub>max</sub> - S<sub>min</sub> for m + </p> +<p> +    <span class="emphasis"><em>K_(S<sub>max</sub> - S<sub>min</sub>) <= (S<sub>min</sub> + (S<sub>max</sub> - S<sub>min</sub>)/2)*(S<sub>max</sub> - S<sub>min</sub> + 1)</em></span> + </p> +<p> +    <span class="emphasis"><em>K_(S<sub>max</sub> - S<sub>min</sub>) <= (S<sub>min</sub> + S<sub>max</sub>) * (S<sub>max</sub> - S<sub>min</sub> + 1)/2</em></span> + </p> +<p> + Since this involves <span class="emphasis"><em>S<sub>max</sub> - S<sub>min</sub> + 1</em></span> iterations, this works + out to dividing <span class="emphasis"><em>K</em></span> into an average <span class="emphasis"><em>(S<sub>min</sub> + S<sub>max</sub>)</em></span>/2 + pieces per iteration. + </p> +<p> + To finish the problem from this point takes <span class="emphasis"><em>𝑶(N * (S<sub>max</sub> - S<sub>min</sub>))</em></span> + for <span class="emphasis"><em>m</em></span> iterations, plus the worst-case of <span class="emphasis"><em>𝑶(N*(S<sub>min</sub> + + lbs))</em></span> for the last iteration, for a total of <span class="emphasis"><em>𝑶(N *(S<sub>max</sub> + + lbs))</em></span> time. + </p> +<p> + When <span class="emphasis"><em>m > S<sub>max</sub> - S<sub>min</sub></em></span>, the problem is divided into + <span class="emphasis"><em>S<sub>max</sub></em></span> pieces per iteration, or <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + is called if <span class="emphasis"><em>N < 2^(m + S<sub>min</sub> + lbs)</em></span>. For this range: + </p> +<p> +    <span class="emphasis"><em>K_m <= K_(m - 1) + S<sub>max</sub></em></span>, providing runtime of + </p> +<p> +    <span class="emphasis"><em>𝑶(N *((K - K_(S<sub>max</sub> - S<sub>min</sub>))/S<sub>max</sub> + S<sub>max</sub> + lbs))</em></span> if recursive, + </p> +<p> + or <span class="emphasis"><em>𝑶(N * log(2^(m + S<sub>min</sub> + lbs)))</em></span> if comparison-based, + </p> +<p> + which simplifies to <span class="emphasis"><em>𝑶(N * (m + S<sub>min</sub> + lbs))</em></span>, which substitutes + to <span class="emphasis"><em>𝑶(N * ((m - (S<sub>max</sub> - S<sub>min</sub>)) + S<sub>max</sub> + lbs))</em></span>, which given + that <span class="emphasis"><em>m - (S<sub>max</sub> - S<sub>min</sub>) <= (K - K_(S<sub>max</sub> - S<sub>min</sub>))/S<sub>max</sub></em></span> + (otherwise a lesser number of radix-based iterations would be used) + </p> +<p> + also comes out to <span class="emphasis"><em>𝑶(N *((K - K_(S<sub>max</sub> - S<sub>min</sub>))/S<sub>max</sub> + S<sub>max</sub> + lbs))</em></span>. + </p> +<p> + Asymptotically, for large <span class="emphasis"><em>N</em></span> and large <span class="emphasis"><em>K</em></span>, + this simplifies to: + </p> +<p> +    <span class="emphasis"><em>𝑶(N * (K/S<sub>max</sub> + S<sub>max</sub> + lbs))</em></span>, + </p> +<p> + simplifying out the constants related to the <span class="emphasis"><em>S<sub>max</sub> - S<sub>min</sub></em></span> + range, providing an additional <span class="emphasis"><em>𝑶(N * (S<sub>max</sub> + lbs))</em></span> runtime + on top of the <span class="emphasis"><em>𝑶(N * (K/S))</em></span> performance of LSD <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix sort</a>, but without + the <span class="emphasis"><em>𝑶(N)</em></span> memory overhead. For simplicity, because <span class="emphasis"><em>lbs</em></span> + is a small constant (0 can be used, and performs reasonably), it is ignored + when summarizing the performance in further discussions. By checking whether + comparison-based sorting is better, Spreadsort is also <span class="emphasis"><em>𝑶(N*log(N))</em></span>, + whichever is better, and unlike LSD <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix + sort</a>, can perform much better than the worst-case if the data is + either evenly distributed or highly clustered. + </p> +<p> + This analysis was for <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>. + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + differs in that <span class="emphasis"><em>S<sub>min</sub> = S<sub>max</sub> = sizeof(Char_type) * 8</em></span>, + <span class="emphasis"><em>lbs</em></span> is 0, and that <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>'s + comparison is not a constant-time operation, so strictly speaking <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + runtime is + </p> +<p> +    <span class="emphasis"><em>𝑶(N * (K/S<sub>max</sub> + (S<sub>max</sub> comparisons)))</em></span>. + </p> +<p> + Worst-case, this ends up being <span class="emphasis"><em>𝑶(N * K)</em></span> (where <span class="emphasis"><em>K</em></span> + is the mean string length in bytes), as described for <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American + flag sort</a>, which is better than the + </p> +<p> +    <span class="emphasis"><em>𝑶(N * K * log(N))</em></span> + </p> +<p> + worst-case for comparison-based sorting. + </p> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.overview.tuning"></a><a class="link" href="index.html#sort.overview.tuning" title="Tuning">Tuning</a> +</h3></div></div></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + have tuning constants that control how the radix-sorting portion of those + algorithms work. The ideal constant values for <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + vary depending on the platform, compiler, and data being sorted. By far the + most important constant is <span class="emphasis"><em>max_splits</em></span>, which defines + how many pieces the radix-sorting portion splits the data into per iteration. + </p> +<p> + The ideal value of <span class="emphasis"><em>max_splits</em></span> depends upon the size + of the L1 processor cache, and is between 10 and 13 on many systems. A default + value of 11 is used. For mostly-sorted data, a much larger value is better, + as swaps (and thus cache misses) are rare, but this hurts runtime severely + for unsorted data, so is not recommended. + </p> +<p> + On some x86 systems, when the total number of elements being sorted is small + ( less than 1 million or so), the ideal <span class="emphasis"><em>max_splits</em></span> can + be substantially larger, such as 17. This is suspected to be because all + the data fits into the L2 cache, and misses from L1 cache to L2 cache do + not impact performance as severely as misses to main memory. Modifying tuning + constants other than <span class="emphasis"><em>max_splits</em></span> is not recommended, + as the performance improvement for changing other constants is usually minor. + </p> +<p> + If you can afford to let it run for a day, and have at least 1GB of free + memory, the perl command: <code class="computeroutput"><span class="special">./</span><span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> + <span class="special">-</span><span class="identifier">large</span> + <span class="special">-</span><span class="identifier">tune</span></code> + (UNIX) or <code class="computeroutput"><span class="identifier">perl</span> <span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="special">-</span><span class="identifier">large</span> <span class="special">-</span><span class="identifier">tune</span> <span class="special">-</span><span class="identifier">windows</span></code> (Windows) can be used to automatically + tune these constants. This should be run from the <code class="computeroutput"><span class="identifier">libs</span><span class="special">/</span><span class="identifier">sort</span> <span class="identifier">directory</span></code> inside the boost home directory. + This will work to identify the <code class="computeroutput"><span class="identifier">ideal</span> + <span class="identifier">constants</span><span class="special">.</span><span class="identifier">hpp</span></code> settings for your system, testing on + various distributions in a 20 million element (80MB) file, and additionally + verifies that all sorting routines sort correctly across various data distributions. + Alternatively, you can test with the file size you're most concerned with + <code class="computeroutput"><span class="special">./</span><span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="identifier">number</span> + <span class="special">-</span><span class="identifier">tune</span></code> + (UNIX) or <code class="computeroutput"><span class="identifier">perl</span> <span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="identifier">number</span> + <span class="special">-</span><span class="identifier">tune</span> + <span class="special">-</span><span class="identifier">windows</span></code> + (Windows). Substitute the number of elements you want to test with for <code class="computeroutput"><span class="identifier">number</span></code>. Otherwise, just use the options + it comes with, they're decent. With default settings <code class="computeroutput"><span class="special">./</span><span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> + <span class="special">-</span><span class="identifier">tune</span></code> + (UNIX) <code class="computeroutput"><span class="identifier">perl</span> <span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="special">-</span><span class="identifier">tune</span> <span class="special">-</span><span class="identifier">windows</span></code> (Windows), the script will take + hours to run (less than a day), but may not pick the correct <span class="emphasis"><em>max_splits</em></span> + if it is over 10. Alternatively, you can add the <code class="computeroutput"><span class="special">-</span><span class="identifier">small</span></code> option to make it take just a few + minutes, tuning for smaller vector sizes (one hundred thousand elements), + but the resulting constants may not be good for large files (see above note + about <span class="emphasis"><em>max_splits</em></span> on Windows). + </p> +<p> + The tuning script can also be used just to verify that sorting works correctly + on your system, and see how much of a speedup it gets, by omiting the "-tune" + option. This runs at the end of tuning runs. Default args will take about + an hour to run and give accurate results on decent-sized test vectors. <code class="computeroutput"><span class="special">./</span><span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="special">-</span><span class="identifier">small</span></code> (UNIX) <code class="computeroutput"><span class="identifier">perl</span> + <span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span> <span class="special">-</span><span class="identifier">small</span> + <span class="special">-</span><span class="identifier">windows</span></code> + (Windows) is a faster option, that tests on smaller vectors and isn't as + accurate. + </p> +<p> + If any differences are encountered during tuning, please call <code class="computeroutput"><span class="identifier">tune</span><span class="special">.</span><span class="identifier">pl</span></code> + with <code class="computeroutput"><span class="special">-</span><span class="identifier">debug</span> + <span class="special">></span> <span class="identifier">log_file_name</span></code>. + If the resulting log file contains compilation or permissions issues, it + is likely an issue with your setup. If some other type of error is encountered + (or result differences), please send them to the library author at spreadsort@gmail.com. + Including the zipped <code class="computeroutput"><span class="identifier">input</span><span class="special">.</span><span class="identifier">txt</span></code> that + was being used is also helpful. + </p> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"><p><small>Last revised: April 07, 2015 at 22:47:04 GMT</small></p></td> +<td align="right"><div class="copyright-footer"></div></td> +</tr></table> +<hr> +<div class="spirit-nav"><a accesskey="n" href="sort/sort_hpp.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div> +</body> +</html> diff --git a/libs/sort/doc/html/index/s09.html b/libs/sort/doc/html/index/s09.html new file mode 100644 index 000000000..788865d2d --- /dev/null +++ b/libs/sort/doc/html/index/s09.html @@ -0,0 +1,104 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function Index</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="../boost/sort/spreadsort/reverse_string_idp48167040.html" title="Function template reverse_string_sort"> +<link rel="next" href="s10.html" title="Index"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../boost/sort/spreadsort/reverse_string_idp48167040.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s10.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="idp93810144"></a>Function Index</h2></div></div></div> +<p><a class="link" href="s09.html#idx_id_5">F</a> <a class="link" href="s09.html#idx_id_8">I</a> <a class="link" href="s09.html#idx_id_14">R</a> <a class="link" href="s09.html#idx_id_15">S</a></p> +<div class="variablelist"><dl class="variablelist"> +<dt> +<a name="idx_id_5"></a><span class="term">F</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">float_mem_cast</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/float_sort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">float_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">Function template float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/float_sort.hpp ></span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_8"></a><span class="term">I</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">integer_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/integer_sort.hpp ></span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_14"></a><span class="term">R</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">reverse_string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/string_sort.hpp ></span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_15"></a><span class="term">S</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">spreadsort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">Function template spreadsort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/spreadsort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/string_sort.hpp ></span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +</dl></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../boost/sort/spreadsort/reverse_string_idp48167040.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s10.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/index/s10.html b/libs/sort/doc/html/index/s10.html new file mode 100644 index 000000000..3c318e6f5 --- /dev/null +++ b/libs/sort/doc/html/index/s10.html @@ -0,0 +1,540 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Index</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="s09.html" title="Function Index"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="s09.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="idp93851440"></a>Index</h2></div></div></div> +<p><a class="link" href="s10.html#idx_id_19">A</a> <a class="link" href="s10.html#idx_id_20">B</a> <a class="link" href="s10.html#idx_id_21">C</a> <a class="link" href="s10.html#idx_id_22">D</a> <a class="link" href="s10.html#idx_id_23">E</a> <a class="link" href="s10.html#idx_id_24">F</a> <a class="link" href="s10.html#idx_id_25">G</a> <a class="link" href="s10.html#idx_id_26">H</a> <a class="link" href="s10.html#idx_id_27">I</a> <a class="link" href="s10.html#idx_id_28">K</a> <a class="link" href="s10.html#idx_id_29">L</a> <a class="link" href="s10.html#idx_id_30">M</a> <a class="link" href="s10.html#idx_id_31">O</a> <a class="link" href="s10.html#idx_id_32">P</a> <a class="link" href="s10.html#idx_id_33">R</a> <a class="link" href="s10.html#idx_id_34">S</a> <a class="link" href="s10.html#idx_id_35">T</a> <a class="link" href="s10.html#idx_id_36">U</a> <a class="link" href="s10.html#idx_id_37">W</a></p> +<div class="variablelist"><dl class="variablelist"> +<dt> +<a name="idx_id_19"></a><span class="term">A</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">ALR_THRESHOLD</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li></ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_20"></a><span class="term">B</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Bibliography</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/bibliog.html" title="Bibliography"><span class="index-entry-level-1">data</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">bracket</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_21"></a><span class="term">C</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">CAST_TYPE</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">container</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">Function template float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">Spreadsort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">Tuning</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_22"></a><span class="term">D</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">data</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/bibliog.html" title="Bibliography"><span class="index-entry-level-1">Bibliography</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">Float Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">Function template float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">Function template spreadsort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">Header < boost / sort / spreadsort / spreadsort . hpp ></span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/hybrid_radix.html" title="Hybrid Radix"><span class="index-entry-level-1">Hybrid Radix</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.intro" title="Introduction"><span class="index-entry-level-1">Introduction</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">Performance</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale.html#sort.sort_hpp.rationale.radix_sorting" title="Radix Sorting"><span class="index-entry-level-1">Radix Sorting</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html" title="String Sort"><span class="index-entry-level-1">String Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">Tuning</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/unstable_sort.html" title="Unstable Sorting"><span class="index-entry-level-1">Unstable Sorting</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">DATA_TYPE</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">Integer Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">Spreadsort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_23"></a><span class="term">E</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">example</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">Function template float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">Integer Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.intro" title="Introduction"><span class="index-entry-level-1">Introduction</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">Spreadsort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_24"></a><span class="term">F</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Float Sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Float Sort Examples</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">CAST_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">KEY_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">lessthan</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">rightshift</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">float_mem_cast</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/float_sort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">float_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">Function template float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/float_sort.hpp ></span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template float_mem_cast</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">CAST_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">KEY_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">rightshift</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template float_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">container</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort"><span class="index-entry-level-1">float_sort</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template integer_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template reverse_string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template spreadsort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">scaling</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">spreadsort</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Function template string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">scaling</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">string_sort</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_25"></a><span class="term">G</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">getsize</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_26"></a><span class="term">H</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Header < boost / sort / spreadsort / spreadsort . hpp ></span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Header < boost/sort/spreadsort/float_sort.hpp ></span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost_sort_c___reference.html#header.boost.sort.spreadsort.float_sort_hpp" title="Header <boost/sort/spreadsort/float_sort.hpp>"><span class="index-entry-level-1">float_sort</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Header < boost/sort/spreadsort/integer_sort.hpp ></span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"><span class="index-entry-level-1">integer_sort</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Header < boost/sort/spreadsort/spreadsort.hpp ></span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">spreadsort</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Header < boost/sort/spreadsort/string_sort.hpp ></span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">string_sort</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Hybrid Radix</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/hybrid_radix.html" title="Hybrid Radix"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/hybrid_radix.html" title="Hybrid Radix"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_27"></a><span class="term">I</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Integer Sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html" title="Integer Sort"><span class="index-entry-level-1">maximum</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Integer Sort Examples</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">rightshift</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">integer_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/integer_sort_hpp.html" title="Header <boost/sort/spreadsort/integer_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/integer_sort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Introduction</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.intro" title="Introduction"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.intro" title="Introduction"><span class="index-entry-level-1">example</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_28"></a><span class="term">K</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">KEY_TYPE</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_29"></a><span class="term">L</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">lessthan</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">String Sort Examples</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Lookup Table?</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/lookup.html" title="Lookup Table?"><span class="index-entry-level-1">minimum</span></a></p></li></ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_30"></a><span class="term">M</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">maximum</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">Float Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html" title="Integer Sort"><span class="index-entry-level-1">Integer Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">Overloading</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">Performance</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">Tuning</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/optimization.html" title="Unused X86 optimization"><span class="index-entry-level-1">Unused X86 optimization</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">minimum</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/lookup.html" title="Lookup Table?"><span class="index-entry-level-1">Lookup Table?</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">Performance</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">Tuning</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_31"></a><span class="term">O</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Overloading</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">bracket</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">float_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">getsize</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">lessthan</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.overloading" title="Overloading"><span class="index-entry-level-1">maximum</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_32"></a><span class="term">P</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Performance</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_33"></a><span class="term">R</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Radix Sorting</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale.html#sort.sort_hpp.rationale.radix_sorting" title="Radix Sorting"><span class="index-entry-level-1">data</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">reverse_string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/string_sort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">rightshift</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples"><span class="index-entry-level-1">Float Sort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/float_mem_cast.html" title="Function template float_mem_cast"><span class="index-entry-level-1">Function template float_mem_cast</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples"><span class="index-entry-level-1">Integer Sort Examples</span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_34"></a><span class="term">S</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">scaling</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/float_sort.html" title="Float Sort"><span class="index-entry-level-1">Float Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort"><span class="index-entry-level-1">Function template integer_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/reverse_string_idp48055200.html" title="Function template reverse_string_sort"><span class="index-entry-level-1">Function template reverse_string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">Function template spreadsort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">Header < boost / sort / spreadsort / spreadsort . hpp ></span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/hybrid_radix.html" title="Hybrid Radix"><span class="index-entry-level-1">Hybrid Radix</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.performance" title="Performance"><span class="index-entry-level-1">Performance</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">Spreadsort Examples</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html" title="String Sort"><span class="index-entry-level-1">String Sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">Tuning</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">Why spreadsort?</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">spreadsort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort"><span class="index-entry-level-1">Function template spreadsort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/spreadsort_hpp.html" title="Header <boost/sort/spreadsort/spreadsort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/spreadsort.hpp ></span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Spreadsort Examples</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">container</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">String Sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html" title="String Sort"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html" title="String Sort"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">String Sort Examples</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">bracket</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">DATA_TYPE</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">getsize</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples"><span class="index-entry-level-1">lessthan</span></a></p></li> +</ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">string_sort</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort"><span class="index-entry-level-1">Function template string_sort</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../header/boost/sort/spreadsort/string_sort_hpp.html" title="Header <boost/sort/spreadsort/string_sort.hpp>"><span class="index-entry-level-1">Header < boost/sort/spreadsort/string_sort.hpp ></span></a></p></li> +</ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_35"></a><span class="term">T</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Tuning</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">container</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../index.html#sort.overview.tuning" title="Tuning"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li></ul></div></dd> +<dt> +<a name="idx_id_36"></a><span class="term">U</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Unstable Sorting</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/unstable_sort.html" title="Unstable Sorting"><span class="index-entry-level-1">data</span></a></p></li></ul></div> +</li> +<li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Unused X86 optimization</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/optimization.html" title="Unused X86 optimization"><span class="index-entry-level-1">maximum</span></a></p></li></ul></div> +</li> +</ul></div></dd> +<dt> +<a name="idx_id_37"></a><span class="term">W</span> +</dt> +<dd><div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"> +<p><span class="index-entry-level-0">Why spreadsort?</span></p> +<div class="index"><ul class="index" style="list-style-type: none; "> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">ALR_THRESHOLD</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">data</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">example</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">maximum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">minimum</span></a></p></li> +<li class="listitem" style="list-style-type: none"><p><a class="link" href="../sort/sort_hpp/rationale/why_spreadsort.html" title="Why spreadsort?"><span class="index-entry-level-1">scaling</span></a></p></li> +</ul></div> +</li></ul></div></dd> +</dl></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="s09.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/acks.html b/libs/sort/doc/html/sort/acks.html new file mode 100644 index 000000000..3ec18da91 --- /dev/null +++ b/libs/sort/doc/html/sort/acks.html @@ -0,0 +1,67 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Acknowledgements</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="faq.html" title="Frequently Asked Questions"> +<link rel="next" href="bibliog.html" title="Bibliography"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="faq.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bibliog.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.acks"></a><a class="link" href="acks.html" title="Acknowledgements">Acknowledgements</a> +</h2></div></div></div> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + The author would like to thank his wife Mary for her patience and support + during the long process of converting this from a piece of C code to a + template library. + </li> +<li class="listitem"> + The author would also like to thank Phil Endecott and Frank Gennari for + the improvements they've suggested and for testing. Without them this would + have taken longer to develop or performed worse. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">float_mem_cast</span></code> was fixed + to be safe and fast thanks to Scott McMurray. That fix was critical for + a high-performance cross-platform <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>. + </li> +<li class="listitem"> + Thanks also for multiple helpful suggestions provided by Steven Watanabe, + Edouard Alligand, and others. + </li> +<li class="listitem"> + Initial documentation was refactored to use Quickbook by Paul A. Bristow. + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="faq.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bibliog.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/bibliog.html b/libs/sort/doc/html/sort/bibliog.html new file mode 100644 index 000000000..9e0ad0a95 --- /dev/null +++ b/libs/sort/doc/html/sort/bibliog.html @@ -0,0 +1,121 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Bibliography</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="acks.html" title="Acknowledgements"> +<link rel="next" href="history.html" title="History"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="acks.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.bibliog"></a><a class="link" href="bibliog.html" title="Bibliography">Bibliography</a> +</h2></div></div></div> +<h5> +<a name="sort.bibliog.h0"></a> + <span class="phrase"><a name="sort.bibliog.standard_template_library_sort_a"></a></span><a class="link" href="bibliog.html#sort.bibliog.standard_template_library_sort_a">Standard + Template Library Sort Algorithms</a> + </h5> +<p> + <a href="http://www.cplusplus.com/reference/algorithm/sort/" target="_top">C++ STL sort + algorithms</a>. + </p> +<h5> +<a name="sort.bibliog.h1"></a> + <span class="phrase"><a name="sort.bibliog.radix_sort"></a></span><a class="link" href="bibliog.html#sort.bibliog.radix_sort">Radix + Sort</a> + </h5> +<p> + A type of algorithm that sorts based upon distribution instead of by comparison. + Wikipedia has an article about Radix Sorting. A more detailed description of + various Radix Sorting algorithms is provided here: + </p> +<p> + Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, + Second Edition. Addison-Wesley, 1998. ISBN 0-201-89685-0. Section 5.2.5: Sorting + by Distribution, pp.168-179. + </p> +<h5> +<a name="sort.bibliog.h2"></a> + <span class="phrase"><a name="sort.bibliog.introsort"></a></span><a class="link" href="bibliog.html#sort.bibliog.introsort">Introsort</a> + </h5> +<p> + A high-speed comparison-based sorting algorithm that takes <span class="emphasis"><em>𝑶(N * log(N))</em></span> + time. See <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + and Musser, David R. (1997). "Introspective Sorting and Selection Algorithms", + Software: Practice and Experience (Wiley) 27 (8), pp 983-993, available at + <a href="http://www.cs.rpi.edu/~musser/gp/introsort.ps" target="_top">Musser Introsort</a>. + </p> +<h5> +<a name="sort.bibliog.h3"></a> + <span class="phrase"><a name="sort.bibliog.american_flag_sort"></a></span><a class="link" href="bibliog.html#sort.bibliog.american_flag_sort">American + Flag Sort</a> + </h5> +<p> + A high-speed hybrid string sorting algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is partially based upon. See <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American + flag sort</a> and Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy. Engineering + Radix Sort, Computing Systems 1993. + </p> +<h5> +<a name="sort.bibliog.h4"></a> + <span class="phrase"><a name="sort.bibliog.adaptive_left_radix_arl"></a></span><a class="link" href="bibliog.html#sort.bibliog.adaptive_left_radix_arl">Adaptive + Left Radix (ARL)</a> + </h5> +<p> + ARL (Adaptive Left Radix) is a hybrid cache-friendly integer sorting algorithm + with comparable speed on random data to <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + but does not have the optimizations for worst-case performance, causing it + to perform poorly on certain types of unevenly distributed data. + </p> +<p> + Arne Maus, <a href="http://www.nik.no/2002/Maus.pdf" target="_top">ARL, a faster in-place, + cache friendly sorting algorithm</a>, presented at NIK2002, Norwegian Informatics + Conference, Kongsberg, 2002. Tapir, ISBN 82-91116-45-8. + </p> +<h5> +<a name="sort.bibliog.h5"></a> + <span class="phrase"><a name="sort.bibliog.original_spreadsort"></a></span><a class="link" href="bibliog.html#sort.bibliog.original_spreadsort">Original + Spreadsort</a> + </h5> +<p> + The algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + was originally based on. <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + uses a smaller number of key bits at a time for better cache efficiency than + the method described in the paper. The importance of cache efficiency grew + as CPU clock speeds increased while main memory latency stagnated. See Steven + J. Ross, The Spreadsort High-performance General-case Sorting Algorithm, Parallel + and Distributed Processing Techniques and Applications, Volume 3, pp.1100-1106. + Las Vegas Nevada. 2002. See <a href="../../../doc/papers/original_spreadsort06_2002.pdf" target="_top">Steven + Ross spreadsort_2002</a>. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="acks.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/definitions.html b/libs/sort/doc/html/sort/definitions.html new file mode 100644 index 000000000..4789f83af --- /dev/null +++ b/libs/sort/doc/html/sort/definitions.html @@ -0,0 +1,55 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Definitions</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="sort_hpp/rationale/lookup.html" title="Lookup Table?"> +<link rel="next" href="faq.html" title="Frequently Asked Questions"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="sort_hpp/rationale/lookup.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.definitions"></a><a class="link" href="definitions.html" title="Definitions">Definitions</a> +</h2></div></div></div> +<h5> +<a name="sort.definitions.h0"></a> + <span class="phrase"><a name="sort.definitions.stable_sort"></a></span><a class="link" href="definitions.html#sort.definitions.stable_sort">stable + sort</a> + </h5> +<p> + A sorting approach that preserves pre-existing order. If there are two elements + with identical keys in a list that is later stably sorted, whichever came first + in the initial list will come first in a stably sorted list. The algorithms + provided here provide no such guarantee; items with identical keys will have + arbitrary resulting order relative to each other. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="sort_hpp/rationale/lookup.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/faq.html b/libs/sort/doc/html/sort/faq.html new file mode 100644 index 000000000..e3bf2bcb7 --- /dev/null +++ b/libs/sort/doc/html/sort/faq.html @@ -0,0 +1,46 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Frequently Asked Questions</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="definitions.html" title="Definitions"> +<link rel="next" href="acks.html" title="Acknowledgements"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="definitions.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acks.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.faq"></a><a class="link" href="faq.html" title="Frequently Asked Questions">Frequently Asked Questions</a> +</h2></div></div></div> +<p> + There are no FAQs yet. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="definitions.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acks.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/history.html b/libs/sort/doc/html/sort/history.html new file mode 100644 index 000000000..03cd6161b --- /dev/null +++ b/libs/sort/doc/html/sort/history.html @@ -0,0 +1,52 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>History</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="bibliog.html" title="Bibliography"> +<link rel="next" href="../boost_sort_c___reference.html" title="Boost.Sort C++ Reference"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="bibliog.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_sort_c___reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.history"></a><a class="link" href="history.html" title="History">History</a> +</h2></div></div></div> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + First release following review in Boost 1.58. + </li> +<li class="listitem"> + <a href="http://permalink.gmane.org/gmane.comp.lib.boost.devel/255194" target="_top">Review + of Boost.Sort/Spreadsort library</a> + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="bibliog.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_sort_c___reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp.html b/libs/sort/doc/html/sort/sort_hpp.html new file mode 100644 index 000000000..5efc81c1c --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp.html @@ -0,0 +1,158 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Spreadsort</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../index.html" title="Boost.Sort"> +<link rel="up" href="../index.html" title="Boost.Sort"> +<link rel="prev" href="../index.html" title="Boost.Sort"> +<link rel="next" href="sort_hpp/integer_sort.html" title="Integer Sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort_hpp/integer_sort.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="sort.sort_hpp"></a><a class="link" href="sort_hpp.html" title="Spreadsort">Spreadsort</a> +</h2></div></div></div> +<div class="toc"><dl class="toc"> +<dt><span class="section"><a href="sort_hpp.html#sort.sort_hpp.header_spreadsort">Header <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">sort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code></a></span></dt> +<dd><dl><dt><span class="section"><a href="sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples">Spreadsort + Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort_hpp/integer_sort.html">Integer Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort_hpp/integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples">Integer + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort_hpp/float_sort.html">Float Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort_hpp/float_sort.html#sort.sort_hpp.float_sort.floatsort_examples">Float + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort_hpp/string_sort.html">String Sort</a></span></dt> +<dd><dl><dt><span class="section"><a href="sort_hpp/string_sort.html#sort.sort_hpp.string_sort.stringsort_examples">String + Sort Examples</a></span></dt></dl></dd> +<dt><span class="section"><a href="sort_hpp/rationale.html">Rationale</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="sort_hpp/rationale.html#sort.sort_hpp.rationale.radix_sorting">Radix Sorting</a></span></dt> +<dt><span class="section"><a href="sort_hpp/rationale/hybrid_radix.html">Hybrid Radix</a></span></dt> +<dt><span class="section"><a href="sort_hpp/rationale/why_spreadsort.html">Why spreadsort?</a></span></dt> +<dt><span class="section"><a href="sort_hpp/rationale/unstable_sort.html">Unstable Sorting</a></span></dt> +<dt><span class="section"><a href="sort_hpp/rationale/optimization.html">Unused X86 optimization</a></span></dt> +<dt><span class="section"><a href="sort_hpp/rationale/lookup.html">Lookup Table?</a></span></dt> +</dl></dd> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.sort_hpp.header_spreadsort"></a><a class="link" href="sort_hpp.html#sort.sort_hpp.header_spreadsort" title="Header <boost/sort/spreadsort/spreadsort.hpp>">Header <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">sort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">/</span><span class="identifier">spreadsort</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code></a> +</h3></div></div></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + checks whether the data-type provided is an integer, castable float, string, + or wstring. + </p> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + If data-type is an integer, <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + is used. + </li> +<li class="listitem"> + If data-type is a float, <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + is used. + </li> +<li class="listitem"> + If data-type is a string or wstring, <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is used. + </li> +<li class="listitem"> + Sorting other data-types requires picking between <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + directly, as <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + won't accept types that don't have the appropriate type traits. + </li> +</ul></div> +<p> + Overloading variants are provided that permit use of user-defined right-shift + functors and comparison functors. + </p> +<p> + Each function is optimized for its set of arguments; default functors are + not provided to avoid the risk of any reduction of performance. + </p> +<p> + See <a class="link" href="../index.html#sort.overview.overloading" title="Overloading">overloading</a> section. + </p> +<h6> +<a name="sort.sort_hpp.header_spreadsort.h0"></a> + <span class="phrase"><a name="sort.sort_hpp.header_spreadsort.rationale"></a></span><a class="link" href="sort_hpp.html#sort.sort_hpp.header_spreadsort.rationale">Rationale:</a> + </h6> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + function provides a wrapper that calls the fastest sorting algorithm available + for a data-type, enabling faster generic programming. + </p> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.header_spreadsort.spreadsort_examples"></a><a class="link" href="sort_hpp.html#sort.sort_hpp.header_spreadsort.spreadsort_examples" title="Spreadsort Examples">Spreadsort + Examples</a> +</h4></div></div></div> +<p> + See <a href="../../../example/" target="_top">example</a> folder for all examples. + </p> +<p> + See <a href="../../../example/sample.cpp" target="_top">sample.cpp</a> for a simple + working example. + </p> +<p> + For an example of 64-bit integer sorting, see <a href="../../../example/int64.cpp" target="_top">int64.cpp</a>. + </p> +<p> + This example sets the element type of a vector to 64-bit integer + </p> +<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">DATA_TYPE</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">int64_t</span> +</pre> +<p> + and calls the sort + </p> +<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">::</span><span class="identifier">spreadsort</span><span class="special">::</span><span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> +</pre> +<p> + For a simple example sorting <code class="computeroutput"><span class="keyword">float</span></code>s, + </p> +<pre class="programlisting"><span class="identifier">vector</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1.0</span><span class="special">);</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2.3</span><span class="special">);</span> +<span class="identifier">vec</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1.3</span><span class="special">);</span> +<span class="special">...</span> +<span class="identifier">spreadsort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> +<span class="comment">//The sorted vector contains "1.0 1.3 2.3 ..."</span> +</pre> +<p> + See also <a href="../../../example/floatsample.cpp" target="_top">floatsample.cpp</a> + which checks for abnormal values. + </p> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort_hpp/integer_sort.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/float_sort.html b/libs/sort/doc/html/sort/sort_hpp/float_sort.html new file mode 100644 index 000000000..bc2f43d5b --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/float_sort.html @@ -0,0 +1,132 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Float Sort</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="Boost.Sort"> +<link rel="up" href="../sort_hpp.html" title="Spreadsort"> +<link rel="prev" href="integer_sort.html" title="Integer Sort"> +<link rel="next" href="string_sort.html" title="String Sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.sort_hpp.float_sort"></a><a class="link" href="float_sort.html" title="Float Sort">Float Sort</a> +</h3></div></div></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + is a fast templated in-place hybrid radix/comparison algorithm much like + <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + but sorts IEEE floating-point numbers (positive, zero, NaN, and negative) + into ascending order by casting them to integers. This works because positive + IEEE floating-point numbers sort like integers with the same bits, and negative + IEEE floating-point numbers sort in the reverse order of integers with the + same bits. float_sort is roughly 2X as fast as std::sort. + </p> +<p> + -0.0 vs. 0.0 and NaN are given definitive ordered positions by the radix-based + portion of this algorithm, where comparison-based sorting does not guarantee + their relative position. The included tests avoid creating NaN and -0.0 so + that results match std::sort, which is not consistent in how it handles these + numbers, as they compare as equal to numbers with different values. + </p> +<p> + float_sort checks the size of the data type and whether it is castable, picking + an integer type to cast to, if a casting functor isn't provided by the user. + </p> +<p> + float_mem_cast casts IEEE floating-point numbers (positive, zero, NaN, and + negative) into integers. This is an essential utility for creating a custom + rightshift functor for float_sort, when one is needed. Only IEEE floating-point + numbers of the same size as the integer type being cast to should be used + in this specialized method call. Worst-case performance is <span class="emphasis"><em>𝑶(N * + (log2(range)/s + s))</em></span>, so <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + is asymptotically faster than pure comparison-based algorithms. <span class="emphasis"><em>s</em></span> + is <span class="emphasis"><em>max_splits</em></span>, which defaults to 11, so its worst-case + with default settings for 32-bit integers is <span class="emphasis"><em>𝑶(N * ((32/11)</em></span> + slow radix-based iterations + 11 fast comparison-based iterations). + </p> +<p> + Some performance plots of runtime vs. n and log2(range) are provided below: + </p> +<p> + <a href="../../../../doc/graph/windows_float_sort.htm" target="_top">Windows Float Sort</a> + </p> +<p> + <a href="../../../../doc/graph/osx_float_sort.htm" target="_top">OSX Float Sort</a> + </p> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.float_sort.floatsort_examples"></a><a class="link" href="float_sort.html#sort.sort_hpp.float_sort.floatsort_examples" title="Float Sort Examples">Float + Sort Examples</a> +</h4></div></div></div> +<p> + See <a href="../../../../example/floatfunctorsample.cpp" target="_top">floatfunctorsample.cpp</a> + for a working example of how to sort structs with a float key: + </p> +<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">CAST_TYPE</span> <span class="keyword">int</span> +<span class="preprocessor">#define</span> <span class="identifier">KEY_TYPE</span> <span class="keyword">float</span> +</pre> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">DATA_TYPE</span> <span class="special">{</span> + <span class="identifier">KEY_TYPE</span> <span class="identifier">key</span><span class="special">;</span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">data</span><span class="special">;</span> +<span class="special">};</span> +</pre> +<p> + Right-shift functor: + </p> +<pre class="programlisting"><span class="comment">// Casting to an integer before bitshifting</span> +<span class="keyword">struct</span> <span class="identifier">rightshift</span> <span class="special">{</span> + <span class="keyword">int</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">unsigned</span> <span class="identifier">offset</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">float_mem_cast</span><span class="special"><</span><span class="identifier">KEY_TYPE</span><span class="special">,</span> <span class="identifier">CAST_TYPE</span><span class="special">>(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">key</span><span class="special">)</span> <span class="special">>></span> <span class="identifier">offset</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<p> + Comparison lessthan <code class="computeroutput"><span class="keyword">operator</span><span class="special"><</span></code> functor: + </p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">lessthan</span> <span class="special">{</span> + <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">y</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">key</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">key</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<p> + Other examples: + </p> +<p> + <a href="../../../../example/double.cpp" target="_top">Sort doubles.</a> + </p> +<p> + <a href="../../../../example/shiftfloatsample.cpp" target="_top">Sort floats using a rightshift + functor.</a> + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="integer_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_sort.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/integer_sort.html b/libs/sort/doc/html/sort/sort_hpp/integer_sort.html new file mode 100644 index 000000000..1ff2552ce --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/integer_sort.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Integer Sort</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="Boost.Sort"> +<link rel="up" href="../sort_hpp.html" title="Spreadsort"> +<link rel="prev" href="../sort_hpp.html" title="Spreadsort"> +<link rel="next" href="float_sort.html" title="Float Sort"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.sort_hpp.integer_sort"></a><a class="link" href="integer_sort.html" title="Integer Sort">Integer Sort</a> +</h3></div></div></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + is a fast templated in-place hybrid radix/comparison algorithm, which in + testing tends to be roughly 50% to 2X faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + for large tests (>=100kB). Worst-case performance is <span class="emphasis"><em>𝑶(N * (log2(range)/s + + s))</em></span>, so <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + is asymptotically faster than pure comparison-based algorithms. <span class="emphasis"><em>s</em></span> + is <span class="emphasis"><em>max_splits</em></span>, which defaults to 11, so its worst-case + with default settings for 32-bit integers is <span class="emphasis"><em>𝑶(N * ((32/11)</em></span> + slow radix-based iterations + 11 fast comparison-based iterations). + </p> +<p> + Some performance plots of runtime vs. n and log2(range) are provided below: + </p> +<p> + <a href="../../../../doc/graph/windows_integer_sort.htm" target="_top">Windows Integer Sort</a> + </p> +<p> + <a href="../../../../doc/graph/osx_integer_sort.htm" target="_top">OSX integer Sort</a> + </p> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.integer_sort.integersort_examples"></a><a class="link" href="integer_sort.html#sort.sort_hpp.integer_sort.integersort_examples" title="Integer Sort Examples">Integer + Sort Examples</a> +</h4></div></div></div> +<p> + See <a href="../../../../example/rightshiftsample.cpp" target="_top">rightshiftsample.cpp</a> + for a working example of using rightshift, using a user-defined functor: + </p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">rightshift</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">int</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">DATA_TYPE</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">unsigned</span> <span class="identifier">offset</span><span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">>></span> <span class="identifier">offset</span><span class="special">;</span> <span class="special">}</span> +<span class="special">};</span> +</pre> +<p> + Other examples: + </p> +<p> + <a href="../../../../example/keyplusdatasample.cpp" target="_top">Sort structs using an + integer key.</a> + </p> +<p> + <a href="../../../../example/reverseintsample.cpp" target="_top">Sort integers in reverse + order.</a> + </p> +<p> + <a href="../../../../example/mostlysorted.cpp" target="_top">Simple sorting of integers; + this case is a performance test for integers that are already mostly sorted.</a> + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_sort.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale.html b/libs/sort/doc/html/sort/sort_hpp/rationale.html new file mode 100644 index 000000000..785dfe3b0 --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale.html @@ -0,0 +1,56 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Rationale</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="Boost.Sort"> +<link rel="up" href="../sort_hpp.html" title="Spreadsort"> +<link rel="prev" href="string_sort.html" title="String Sort"> +<link rel="next" href="rationale/hybrid_radix.html" title="Hybrid Radix"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/hybrid_radix.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.sort_hpp.rationale"></a><a class="link" href="rationale.html" title="Rationale">Rationale</a> +</h3></div></div></div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.radix_sorting"></a><a class="link" href="rationale.html#sort.sort_hpp.rationale.radix_sorting" title="Radix Sorting">Radix Sorting</a> +</h4></div></div></div> +<p> + Radix-based sorting allows the data to be divided up into more than 2 pieces + per iteration, and for cache-friendly versions, it normally cuts the data + up into around a thousand pieces per iteration. This allows many fewer + iterations to be used to complete sorting the data, enabling performance + superior to the <span class="emphasis"><em>𝑶(N*log(N))</em></span> comparison-based sorting + limit. + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/hybrid_radix.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale/hybrid_radix.html b/libs/sort/doc/html/sort/sort_hpp/rationale/hybrid_radix.html new file mode 100644 index 000000000..b30b4a0e0 --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale/hybrid_radix.html @@ -0,0 +1,104 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Hybrid Radix</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../rationale.html" title="Rationale"> +<link rel="prev" href="../rationale.html" title="Rationale"> +<link rel="next" href="why_spreadsort.html" title="Why spreadsort?"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../rationale.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="why_spreadsort.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.hybrid_radix"></a><a class="link" href="hybrid_radix.html" title="Hybrid Radix">Hybrid Radix</a> +</h4></div></div></div> +<p> + There a two primary types of radix-based sorting: + </p> +<p> + Most-significant-digit Radix sorting (MSD) divides the data recursively + based upon the top-most unsorted bits. This approach is efficient for even + distributions that divide nicely, and can be done in-place (limited additional + memory used). There is substantial constant overhead for each iteration + to deal with the splitting structure. The algorithms provided here use + MSD Radix Sort for their radix-sorting portion. The main disadvantage of + MSD Radix sorting is that when the data is cut up into small pieces, the + overhead for additional recursive calls starts to dominate runtime, and + this makes worst-case behavior substantially worse than <span class="emphasis"><em>𝑶(N*log(N))</em></span>. + </p> +<p> + By contrast, <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code>, + <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>, + and <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + all check to see whether Radix-based or Comparison-based sorting have better + worst-case runtime, and make the appropriate recursive call. Because Comparison-based + sorting algorithms are efficient on small pieces, the tendency of MSD + <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix sort</a> + to cut the problem up small is turned into an advantage by these hybrid + sorts. It is hard to conceive of a common usage case where pure MSD <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix sort</a> would + have any significant advantage over hybrid algorithms. + </p> +<p> + Least-significant-digit <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix + sort</a> (LSD) sorts based upon the least-significant bits first. This + requires a complete copy of the data being sorted, using substantial additional + memory. The main advantage of LSD Radix Sort is that aside from some constant + overhead and the memory allocation, it uses a fixed amount of time per + element to sort, regardless of distribution or size of the list. This amount + of time is proportional to the length of the radix. The other advantage + of LSD Radix Sort is that it is a stable sorting algorithm, so elements + with the same key will retain their original order. + </p> +<p> + One disadvantage is that LSD Radix Sort uses the same amount of time to + sort "easy" sorting problems as "hard" sorting problems, + and this time spent may end up being greater than an efficient <span class="emphasis"><em>𝑶(N*log(N))</em></span> + algorithm such as <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + spends sorting "hard" problems on large data sets, depending + on the length of the datatype, and relative speed of comparisons, memory + allocation, and random accesses. + </p> +<p> + The other main disadvantage of LSD Radix Sort is its memory overhead. It's + only faster for large data sets, but large data sets use significant memory, + which LSD Radix Sort needs to duplicate. LSD Radix Sort doesn't make sense + for items of variable length, such as strings; it could be implemented + by starting at the end of the longest element, but would be extremely inefficient. + </p> +<p> + All that said, there are places where LSD Radix Sort is the appropriate + and fastest solution, so it would be appropriate to create a templated + LSD Radix Sort similar to <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code>. + This would be most appropriate in cases where comparisons are extremely + slow. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../rationale.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="why_spreadsort.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale/lookup.html b/libs/sort/doc/html/sort/sort_hpp/rationale/lookup.html new file mode 100644 index 000000000..b19c31e4e --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale/lookup.html @@ -0,0 +1,55 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Lookup Table?</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../rationale.html" title="Rationale"> +<link rel="prev" href="optimization.html" title="Unused X86 optimization"> +<link rel="next" href="../../definitions.html" title="Definitions"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="optimization.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../definitions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.lookup"></a><a class="link" href="lookup.html" title="Lookup Table?">Lookup Table?</a> +</h4></div></div></div> +<p> + The ideal way to optimize the constants would be to have a carefully-tuned + lookup-table instead of the <code class="computeroutput"><span class="identifier">get_max_count</span></code> + function, but 4 tuning variables is simpler, <code class="computeroutput"><span class="identifier">get_max_count</span></code> + enforces worst-case performance minimization rules, and such a lookup table + would be difficult to optimize for cross-platform performance. + </p> +<p> + Alternatively, <code class="computeroutput"><span class="identifier">get_max_count</span></code> + could be used to generate a static lookup table. This hasn't been done + due to concerns about cross-platform compatibility and flexibility. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="optimization.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../definitions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale/optimization.html b/libs/sort/doc/html/sort/sort_hpp/rationale/optimization.html new file mode 100644 index 000000000..13e511174 --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale/optimization.html @@ -0,0 +1,54 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Unused X86 optimization</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../rationale.html" title="Rationale"> +<link rel="prev" href="unstable_sort.html" title="Unstable Sorting"> +<link rel="next" href="lookup.html" title="Lookup Table?"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unstable_sort.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lookup.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.optimization"></a><a class="link" href="optimization.html" title="Unused X86 optimization">Unused X86 optimization</a> +</h4></div></div></div> +<p> + Though the ideal <span class="emphasis"><em>max_splits</em></span> for <code class="computeroutput"><span class="identifier">n</span> + <span class="special"><</span> <span class="number">1</span> + <span class="identifier">million</span></code> (or so) on x86 <span class="emphasis"><em>seems</em></span> + to be substantially larger, enabling a roughly 15% speedup for such tests, + this optimization isn't general, and doesn't apply for <code class="computeroutput"><span class="identifier">n</span> + <span class="special">></span> <span class="number">1</span> + <span class="identifier">million</span></code>. A too large <span class="emphasis"><em>max_splits</em></span> + can cause sort to take more than twice as long, so it should be set on + the low end of the reasonable range, where it is right now. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unstable_sort.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lookup.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale/unstable_sort.html b/libs/sort/doc/html/sort/sort_hpp/rationale/unstable_sort.html new file mode 100644 index 000000000..850604c2f --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale/unstable_sort.html @@ -0,0 +1,54 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Unstable Sorting</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../rationale.html" title="Rationale"> +<link rel="prev" href="why_spreadsort.html" title="Why spreadsort?"> +<link rel="next" href="optimization.html" title="Unused X86 optimization"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="why_spreadsort.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="optimization.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.unstable_sort"></a><a class="link" href="unstable_sort.html" title="Unstable Sorting">Unstable Sorting</a> +</h4></div></div></div> +<p> + Making a <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix sort</a> + stable requires the usage of an external copy of the data. A stable hybrid + algorithm also requires a stable comparison-based algorithm, and these + are generally slow. LSD <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix + sort</a> uses an external copy of the data, and provides stability, + along with likely being faster (than a stable hybrid sort), so that's probably + a better way to go for integer and floating-point types. It might make + sense to make a stable version of <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + using external memory, but for simplicity this has been left out for now. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="why_spreadsort.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="optimization.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/rationale/why_spreadsort.html b/libs/sort/doc/html/sort/sort_hpp/rationale/why_spreadsort.html new file mode 100644 index 000000000..bb611fc9d --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/rationale/why_spreadsort.html @@ -0,0 +1,154 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Why spreadsort?</title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../../index.html" title="Boost.Sort"> +<link rel="up" href="../rationale.html" title="Rationale"> +<link rel="prev" href="hybrid_radix.html" title="Hybrid Radix"> +<link rel="next" href="unstable_sort.html" title="Unstable Sorting"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hybrid_radix.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unstable_sort.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.rationale.why_spreadsort"></a><a class="link" href="why_spreadsort.html" title="Why spreadsort?">Why spreadsort?</a> +</h4></div></div></div> +<p> + The <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/spreadsort_idp47957744.html" title="Function template spreadsort">spreadsort</a></code></code> + algorithm used in this library is designed to provide best possible worst-case + performance, while still being cache-friendly. It provides the better of + <span class="emphasis"><em>𝑶(N*log(K/S + S))</em></span> and <span class="emphasis"><em>𝑶(N*log(N))</em></span> + worst-case time, where <span class="emphasis"><em>K</em></span> is the log of the range. + The log of the range is normally the length in bits of the data type; 32 + for a 32-bit integer. + </p> +<p> + <code class="computeroutput"><span class="identifier">flash_sort</span></code> (another hybrid + algorithm), by comparison is <span class="emphasis"><em>𝑶(N)</em></span> for evenly distributed + lists. The problem is, <code class="computeroutput"><span class="identifier">flash_sort</span></code> + is merely an MSD <a href="http://en.wikipedia.org/wiki/Radix_sort" target="_top">radix + sort</a> combined with <span class="emphasis"><em>𝑶(N*N)</em></span> insertion sort to + deal with small subsets where the MSD Radix Sort is inefficient, so it + is inefficient with chunks of data around the size at which it switches + to <code class="computeroutput"><span class="identifier">insertion_sort</span></code>, and + ends up operating as an enhanced MSD Radix Sort. For uneven distributions + this makes it especially inefficient. + </p> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer_sort_idp41299456.html" title="Function template integer_sort">integer_sort</a></code></code> + and <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/float_sort_idp47034528.html" title="Function template float_sort">float_sort</a></code></code> + use <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + instead, which provides <span class="emphasis"><em>𝑶(N*log(N))</em></span> performance for + these medium-sized pieces. Also, <code class="computeroutput"><span class="identifier">flash_sort</span></code>'s + <span class="emphasis"><em>𝑶(N)</em></span> performance for even distributions comes at the + cost of cache misses, which on modern architectures are extremely expensive, + and in testing on modern systems ends up being slower than cutting up the + data in multiple, cache-friendly steps. Also worth noting is that on most + modern computers, <code class="computeroutput"><span class="identifier">log2</span><span class="special">(</span><span class="identifier">available</span> + <span class="identifier">RAM</span><span class="special">)/</span><span class="identifier">log2</span><span class="special">(</span><span class="identifier">L1</span> <span class="identifier">cache</span> + <span class="identifier">size</span><span class="special">)</span></code> + is around 3, where a cache miss takes more than 3 times as long as an in-cache + random-access, and the size of <span class="emphasis"><em>max_splits</em></span> is tuned + to the size of the cache. On a computer where cache misses aren't this + expensive, <span class="emphasis"><em>max_splits</em></span> could be increased to a large + value, or eliminated entirely, and <code class="computeroutput"><span class="identifier">integer_sort</span><span class="special">/</span><span class="identifier">float_sort</span></code> + would have the same <span class="emphasis"><em>𝑶(N)</em></span> performance on even distributions. + </p> +<p> + Adaptive Left Radix (ALR) is similar to <code class="computeroutput"><span class="identifier">flash_sort</span></code>, + but more cache-friendly. It still uses insertion_sort. Because ALR uses + <span class="emphasis"><em>𝑶(N*N)</em></span> <code class="computeroutput"><span class="identifier">insertion_sort</span></code>, + it isn't efficient to use the comparison-based fallback sort on large lists, + and if the data is clustered in small chunks just over the fallback size + with a few outliers, radix-based sorting iterates many times doing little + sorting with high overhead. Asymptotically, ALR is still <span class="emphasis"><em>𝑶(N*log(K/S + + S))</em></span>, but with a very small <span class="emphasis"><em>S</em></span> (about 2 + in the worst case), which compares unfavorably with the 11 default value + of <span class="emphasis"><em>max_splits</em></span> for Spreadsort. + </p> +<p> + ALR also does not have the <span class="emphasis"><em>𝑶(N*log(N))</em></span> fallback, so + for small lists that are not evenly distributed it is extremely inefficient. + See the <code class="computeroutput"><span class="identifier">alrbreaker</span></code> and + <code class="computeroutput"><span class="identifier">binaryalrbreaker</span></code> testcases + for examples; either replace the call to sort with a call to ALR and update + the ALR_THRESHOLD at the top, or as a quick comparison make <code class="computeroutput"><span class="identifier">get_max_count</span> <span class="keyword">return</span> + <span class="identifier">ALR_THRESHOLD</span></code> (20 by default + based upon the paper). These small tests take 4-10 times as long with ALR + as <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + in the author's testing, depending on the test system, because they are + trying to sort a highly uneven distribution. Normal Spreadsort does much + better with them, because <code class="computeroutput"><span class="identifier">get_max_count</span></code> + is designed around minimizing worst-case runtime. + </p> +<p> + <code class="computeroutput"><span class="identifier">burst_sort</span></code> is an efficient + hybrid algorithm for strings that uses substantial additional memory. + </p> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + uses minimal additional memory by comparison. Speed comparisons between + the two haven't been made, but the better memory efficiency makes <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + more general. + </p> +<p> + <code class="computeroutput"><span class="identifier">postal_sort</span></code> and <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + are similar. A direct performance comparison would be welcome, but an efficient + version of <code class="computeroutput"><span class="identifier">postal_sort</span></code> + was not found in a search for source. + </p> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is most similar to the <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American + flag sort</a> algorithm. The main difference is that it doesn't bother + trying to optimize how empty buckets/piles are handled, instead just checking + to see if all characters at the current index are equal. Other differences + are using <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + as the fallback algorithm, and a larger fallback size (256 vs. 16), which + makes empty pile handling less important. + </p> +<p> + Another difference is not applying the stack-size restriction. Because + of the equality check in <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code>, + it would take <span class="emphasis"><em>m*m</em></span> memory worth of strings to force + <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + to create a stack of depth <span class="emphasis"><em>m</em></span>. This problem isn't a + realistic one on modern systems with multi-megabyte stacksize limits, where + main memory would be exhausted holding the long strings necessary to exceed + the stacksize limit. <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + can be thought of as modernizing <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American + flag sort</a> to take advantage of <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a> + as a fallback algorithm. In the author's testing, <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American + flag sort</a> (on <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">strings</span></code>) + had comparable runtime to <a href="http://en.wikipedia.org/wiki/Introsort" target="_top">introsort</a>, + but making a hybrid of the two allows reduced overhead and substantially + superior performance. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hybrid_radix.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unstable_sort.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/sort/sort_hpp/string_sort.html b/libs/sort/doc/html/sort/sort_hpp/string_sort.html new file mode 100644 index 000000000..8a4dde2ba --- /dev/null +++ b/libs/sort/doc/html/sort/sort_hpp/string_sort.html @@ -0,0 +1,234 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>String Sort</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="Boost.Sort"> +<link rel="up" href="../sort_hpp.html" title="Spreadsort"> +<link rel="prev" href="float_sort.html" title="Float Sort"> +<link rel="next" href="rationale.html" title="Rationale"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="sort.sort_hpp.string_sort"></a><a class="link" href="string_sort.html" title="String Sort">String Sort</a> +</h3></div></div></div> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is a hybrid radix-based/comparison-based algorithm that sorts strings of + characters (or arrays of binary data) in ascending order. + </p> +<p> + The simplest version (no functors) sorts strings of items that can cast to + an unsigned data type (such as an unsigned char), have a &lt; operator, + have a size function, and have a data() function that returns a pointer to + an array of characters, such as a std::string. The functor version can sort + any data type that has a strict weak ordering, via templating, but requires + definitions of a get_char (acts like x[offset] on a string or a byte array), + get_length (returns length of the string being sorted), and a comparison + functor. Individual characters returned by get_char must support the != operator + and have an unsigned value that defines their lexicographical order. + </p> +<p> + This algorithm is not efficient for character types larger than 2 bytes each, + and is optimized for one-byte character strings. For this reason, <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> will + be called instead if the character type is of size > 2. + </p> +<p> + <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + has a special optimization for identical substrings. This adds some overhead + on random data, but identical substrings are common in real strings. + </p> +<p> + reverse_string_sort sorts strings in reverse (decending) order, but is otherwise + identical. <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp48004640.html" title="Function template string_sort">string_sort</a></code></code> + is sufficiently flexible that it should sort any data type that <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a> + can, assuming the user provides appropriate functors that index into a key. + </p> +<p> + <a href="../../../../doc/graph/windows_string_sort.htm" target="_top">Windows String Sort</a> + </p> +<p> + <a href="../../../../doc/graph/osx_string_sort.htm" target="_top">OSX String Sort</a> + </p> +<div class="section"> +<div class="titlepage"><div><div><h4 class="title"> +<a name="sort.sort_hpp.string_sort.stringsort_examples"></a><a class="link" href="string_sort.html#sort.sort_hpp.string_sort.stringsort_examples" title="String Sort Examples">String + Sort Examples</a> +</h4></div></div></div> +<p> + See <a href="../../../../example/stringfunctorsample.cpp" target="_top">stringfunctorsample.cpp</a> + for an example of how to sort structs using a string key and all functors: + </p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">lessthan</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">y</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">a</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">bracket</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">unsigned</span> <span class="keyword">char</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">size_t</span> <span class="identifier">offset</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span><span class="special">[</span><span class="identifier">offset</span><span class="special">];</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">getsize</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="identifier">size_t</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span><span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">a</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> <span class="special">}</span> +<span class="special">};</span> +</pre> +<p> + and these functors are used thus: + </p> +<pre class="programlisting"><span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">bracket</span><span class="special">(),</span> <span class="identifier">getsize</span><span class="special">(),</span> <span class="identifier">lessthan</span><span class="special">());</span> +</pre> +<p> + See <a href="../../../../example/generalizedstruct.cpp" target="_top">generalizedstruct.cpp</a> + for a working example of a generalized approach to sort structs by a sequence + of integer, float, and multiple string keys using string_sort: + </p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">DATA_TYPE</span> <span class="special">{</span> + <span class="identifier">time_t</span> <span class="identifier">birth</span><span class="special">;</span> + <span class="keyword">float</span> <span class="identifier">net_worth</span><span class="special">;</span> + <span class="identifier">string</span> <span class="identifier">first_name</span><span class="special">;</span> + <span class="identifier">string</span> <span class="identifier">last_name</span><span class="special">;</span> +<span class="special">};</span> + +<span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">birth_size</span> <span class="special">=</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">time_t</span><span class="special">);</span> +<span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">first_name_offset</span> <span class="special">=</span> <span class="identifier">birth_size</span> <span class="special">+</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="keyword">float</span><span class="special">);</span> +<span class="keyword">static</span> <span class="keyword">const</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uint64_t</span> <span class="identifier">base_mask</span> <span class="special">=</span> <span class="number">0xff</span><span class="special">;</span> + +<span class="keyword">struct</span> <span class="identifier">lessthan</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">y</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">birth</span> <span class="special">!=</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">birth</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">birth</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">birth</span><span class="special">;</span> + <span class="special">}</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">net_worth</span> <span class="special">!=</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">net_worth</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">net_worth</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">net_worth</span><span class="special">;</span> + <span class="special">}</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">first_name</span> <span class="special">!=</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">first_name</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first_name</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">first_name</span><span class="special">;</span> + <span class="special">}</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last_name</span> <span class="special"><</span> <span class="identifier">y</span><span class="special">.</span><span class="identifier">last_name</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">};</span> + +<span class="keyword">struct</span> <span class="identifier">bracket</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="keyword">unsigned</span> <span class="keyword">char</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">size_t</span> <span class="identifier">offset</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="comment">// Sort date as a signed int, returning the appropriate byte.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special"><</span> <span class="identifier">birth_size</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">bit_shift</span> <span class="special">=</span> <span class="number">8</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">birth_size</span> <span class="special">-</span> <span class="identifier">offset</span> <span class="special">-</span> <span class="number">1</span><span class="special">);</span> + <span class="keyword">unsigned</span> <span class="keyword">char</span> <span class="identifier">result</span> <span class="special">=</span> <span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">birth</span> <span class="special">&</span> <span class="special">(</span><span class="identifier">base_mask</span> <span class="special"><<</span> <span class="identifier">bit_shift</span><span class="special">))</span> <span class="special">>></span> <span class="identifier">bit_shift</span><span class="special">;</span> + <span class="comment">// Handling the sign bit. Unnecessary if the data is always positive.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special">==</span> <span class="number">0</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">result</span> <span class="special">^</span> <span class="number">128</span><span class="special">;</span> + <span class="special">}</span> + + <span class="keyword">return</span> <span class="identifier">result</span><span class="special">;</span> + <span class="special">}</span> + + <span class="comment">// Sort a signed float. This requires reversing the order of negatives</span> + <span class="comment">// because of the way floats are represented in bits.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special"><</span> <span class="identifier">first_name_offset</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">bit_shift</span> <span class="special">=</span> <span class="number">8</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">first_name_offset</span> <span class="special">-</span> <span class="identifier">offset</span> <span class="special">-</span> <span class="number">1</span><span class="special">);</span> + <span class="keyword">unsigned</span> <span class="identifier">key</span> <span class="special">=</span> <span class="identifier">float_mem_cast</span><span class="special"><</span><span class="keyword">float</span><span class="special">,</span> <span class="keyword">unsigned</span><span class="special">>(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">net_worth</span><span class="special">);</span> + <span class="keyword">unsigned</span> <span class="keyword">char</span> <span class="identifier">result</span> <span class="special">=</span> <span class="special">(</span><span class="identifier">key</span> <span class="special">&</span> <span class="special">(</span><span class="identifier">base_mask</span> <span class="special"><<</span> <span class="identifier">bit_shift</span><span class="special">))</span> <span class="special">>></span> <span class="identifier">bit_shift</span><span class="special">;</span> + <span class="comment">// Handling the sign.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">x</span><span class="special">.</span><span class="identifier">net_worth</span> <span class="special"><</span> <span class="number">0</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="number">255</span> <span class="special">-</span> <span class="identifier">result</span><span class="special">;</span> + <span class="special">}</span> + <span class="comment">// Increasing positives so they are higher than negatives.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special">==</span> <span class="identifier">birth_size</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="number">128</span> <span class="special">+</span> <span class="identifier">result</span><span class="special">;</span> + <span class="special">}</span> + + <span class="keyword">return</span> <span class="identifier">result</span><span class="special">;</span> + <span class="special">}</span> + + <span class="comment">// Sort a string that is before the end. This approach supports embedded</span> + <span class="comment">// nulls. If embedded nulls are not required, then just delete the "* 2"</span> + <span class="comment">// and the inside of the following if just becomes:</span> + <span class="comment">// return x.first_name[offset - first_name_offset];</span> + <span class="keyword">const</span> <span class="keyword">unsigned</span> <span class="identifier">first_name_end_offset</span> <span class="special">=</span> + <span class="identifier">first_name_offset</span> <span class="special">+</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first_name</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">*</span> <span class="number">2</span><span class="special">;</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special"><</span> <span class="identifier">first_name_end_offset</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">int</span> <span class="identifier">char_offset</span> <span class="special">=</span> <span class="identifier">offset</span> <span class="special">-</span> <span class="identifier">first_name_offset</span><span class="special">;</span> + <span class="comment">// This signals that the string continues.</span> + <span class="keyword">if</span> <span class="special">(!(</span><span class="identifier">char_offset</span> <span class="special">&</span> <span class="number">1</span><span class="special">))</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="number">1</span><span class="special">;</span> + <span class="special">}</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first_name</span><span class="special">[</span><span class="identifier">char_offset</span> <span class="special">>></span> <span class="number">1</span><span class="special">];</span> + <span class="special">}</span> + + <span class="comment">// This signals that the string has ended, so that shorter strings come</span> + <span class="comment">// before longer ones.</span> + <span class="keyword">if</span> <span class="special">(</span><span class="identifier">offset</span> <span class="special">==</span> <span class="identifier">first_name_end_offset</span><span class="special">)</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span> + <span class="special">}</span> + + <span class="comment">// The final string needs no special consideration.</span> + <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last_name</span><span class="special">[</span><span class="identifier">offset</span> <span class="special">-</span> <span class="identifier">first_name_end_offset</span> <span class="special">-</span> <span class="number">1</span><span class="special">];</span> + <span class="special">}</span> +<span class="special">};</span> + +<span class="keyword">struct</span> <span class="identifier">getsize</span> <span class="special">{</span> + <span class="keyword">inline</span> <span class="identifier">size_t</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">DATA_TYPE</span> <span class="special">&</span><span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> + <span class="keyword">return</span> <span class="identifier">first_name_offset</span> <span class="special">+</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first_name</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">*</span> <span class="number">2</span> <span class="special">+</span> <span class="number">1</span> <span class="special">+</span> + <span class="identifier">x</span><span class="special">.</span><span class="identifier">last_name</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> + <span class="special">}</span> +<span class="special">};</span> +</pre> +<pre class="programlisting"><span class="identifier">string_sort</span><span class="special">(</span><span class="identifier">array</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">array</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">bracket</span><span class="special">(),</span> <span class="identifier">getsize</span><span class="special">(),</span> <span class="identifier">lessthan</span><span class="special">());</span> +</pre> +<p> + Other examples: + </p> +<p> + <a href="../../../../example/stringsample.cpp" target="_top">String sort.</a> + </p> +<p> + <a href="../../../../example/reversestringsample.cpp" target="_top">Reverse string sort.</a> + </p> +<p> + <a href="../../../../example/wstringsample.cpp" target="_top">Wide character string sort.</a> + </p> +<p> + <a href="../../../../example/caseinsensitive.cpp" target="_top">Case insensitive string + sort.</a> + </p> +<p> + <a href="../../../../example/charstringsample.cpp" target="_top">Sort structs using a string + key and indexing functors.</a> + </p> +<p> + <a href="../../../../example/reversestringfunctorsample.cpp" target="_top">Sort structs + using a string keynd all functors in reverse order.</a> + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2014 Steven Ross<p> + Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost + Software License, Version 1.0</a>. + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="float_sort.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sort_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/sort/doc/html/standalone_HTML.manifest b/libs/sort/doc/html/standalone_HTML.manifest new file mode 100644 index 000000000..322ead3b7 --- /dev/null +++ b/libs/sort/doc/html/standalone_HTML.manifest @@ -0,0 +1,39 @@ +index.html +sort/sort_hpp.html +sort/sort_hpp/integer_sort.html +sort/sort_hpp/float_sort.html +sort/sort_hpp/string_sort.html +sort/sort_hpp/rationale.html +sort/sort_hpp/rationale/hybrid_radix.html +sort/sort_hpp/rationale/why_spreadsort.html +sort/sort_hpp/rationale/unstable_sort.html +sort/sort_hpp/rationale/optimization.html +sort/sort_hpp/rationale/lookup.html +sort/definitions.html +sort/faq.html +sort/acks.html +sort/bibliog.html +sort/history.html +boost_sort_c___reference.html +boost/sort/spreadsort/float_mem_cast.html +boost/sort/spreadsort/float_sort_idp47034528.html +boost/sort/spreadsort/float_sort_idp41281952.html +boost/sort/spreadsort/float_sort_idp41288368.html +header/boost/sort/spreadsort/integer_sort_hpp.html +boost/sort/spreadsort/integer_sort_idp41299456.html +boost/sort/spreadsort/integer_sort_idp47906960.html +boost/sort/spreadsort/integer_sort_idp47931200.html +header/boost/sort/spreadsort/spreadsort_hpp.html +boost/sort/spreadsort/spreadsort_idp47957744.html +boost/sort/spreadsort/spreadsort_idp47972192.html +boost/sort/spreadsort/spreadsort_idp47986816.html +header/boost/sort/spreadsort/string_sort_hpp.html +boost/sort/spreadsort/string_sort_idp48004640.html +boost/sort/spreadsort/string_sort_idp48031648.html +boost/sort/spreadsort/reverse_string_idp48055200.html +boost/sort/spreadsort/reverse_string_idp48083936.html +boost/sort/spreadsort/string_sort_idp48110368.html +boost/sort/spreadsort/string_sort_idp48138640.html +boost/sort/spreadsort/reverse_string_idp48167040.html +index/s09.html +index/s10.html diff --git a/libs/sort/doc/html4_symbols.qbk b/libs/sort/doc/html4_symbols.qbk new file mode 100644 index 000000000..8a13f937b --- /dev/null +++ b/libs/sort/doc/html4_symbols.qbk @@ -0,0 +1,226 @@ +[/ Symbols and Greek letters (about 120) from HTML4.]
+[/ File HTML4_symbols.qbk]
+[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]
+[/ See also http://en.wikipedia.org/wiki/List_of_XML_and_HTML_character_entity_references]
+[/ http://www.alanwood.net/demos/ent4_frame.html]
+[/ http://www.unicode.org/charts/PDF/U2200.pdf and others]
+[/ All (except 2 angle brackets) show OK on Firefox 2.0 and higher]
+
+[/ See also Latin-1 aka Western (ISO-8859-1) in latin1_symbols.qbk]
+[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html]
+[/Unicode Latin extended http://www.unicode.org/charts/U0080.pdf]
+
+[/ Also some miscellaneous math characters added to this list - see the end.]
+[/ For others see also math_toolkit.symbols.qbk]
+
+[/ To use, enclose the template name in square brackets, for example: [pi]]
+
+[template fnof[]'''ƒ'''] [/ ƒ Latin small f with hook = function = florin]
+[/ Capital Greek start with capital letter, lower case all small.]
+[template Alpha[]'''Α'''] [/ ? Greek capital letter alpha]
+[template Beta[]'''Β'''] [/ ? Greek capital letter beta]
+[template Gamma[]'''Γ'''] [/ G Greek capital letter gamma]
+[template Delta[]'''Δ'''] [/ ? Greek capital letter delta]
+[template Epsilon[]'''Ε'''] [/ ? Greek capital letter epsilon]
+[template Zeta[]'''Ζ'''] [/ ? Greek capital letter zeta]
+[template Eta[]'''Η'''] [/ ? Greek capital letter eta]
+[template Theta[]'''Θ'''] [/ T Greek capital letter theta]
+[template Iota[]'''Ι'''] [/ ? Greek capital letter iota]
+[template Kappa[]'''Κ'''] [/ ? Greek capital letter kappa]
+[template Lambda[]'''Λ'''] [/ ? Greek capital letter lambda]
+[template Mu[]'''Μ'''] [/ ? Greek capital letter mu]
+[template Nu[]'''Ν'''] [/ ? Greek capital letter nu]
+[template Xi[]'''Ξ'''] [/ ? Greek capital letter xi]
+[template Omicron[]'''Ο'''] [/ ? Greek capital letter omicron]
+[template Pi[]'''Π'''] [/ ? Greek capital letter pi]
+[template Rho[]'''Ρ'''] [/ ? Greek capital letter rho]
+[template Sigma[]'''Σ'''] [/ S Greek capital letter sigma]
+[template Tau[]'''Τ'''] [/ ? Greek capital letter tau]
+[template Upsilon[]'''Υ'''] [/ ? Greek capital letter upsilon]
+[template Phi[]'''Φ'''] [/ F Greek capital letter phi]
+[template Chi[]'''Χ'''] [/ ? Greek capital letter chi]
+[template Psi[]'''Ψ'''] [/ ? Greek capital letter psi]
+[template Omega[]'''Ω'''] [/ O Greek capital letter omega]
+[template alpha[]'''α'''] [/ a Greek small letter alpha]
+[template beta[]'''β'''] [/ ß Greek small letter beta]
+[template gamma[]'''γ'''] [/ ? Greek small letter gamma]
+[template delta[]'''δ'''] [/ d Greek small letter delta]
+[template epsilon[]'''ε'''] [/ e Greek small letter epsilon]
+[template zeta[]'''ζ'''] [/ ? Greek small letter zeta]
+[template eta[]'''η'''] [/ ? Greek small letter eta]
+[template theta[]'''θ'''] [/ ? Greek small letter theta]
+[template iota[]'''ι'''] [/ ? Greek small letter iota]
+[template kappa[]'''κ'''] [/ ? Greek small letter kappa]
+[template lambda[]'''λ'''] [/ ? Greek small letter lambda]
+[template mu[]'''μ'''] [/ µ Greek small letter mu]
+[template nu[]'''ν'''] [/ ? Greek small letter nu]
+[template xi[]'''ξ'''] [/ ? Greek small letter xi]
+[template omicron[]'''ο'''] [/ ? Greek small letter omicron]
+[template pi[]'''π'''] [/ p Greek small letter pi]
+[template rho[]'''ρ'''] [/ ? Greek small letter rho]
+[template sigmaf[]'''ς'''] [/ ? Greek small letter final sigma]
+[template sigma[]'''σ'''] [/ s Greek small letter sigma]
+[template tau[]'''τ'''] [/ t Greek small letter tau]
+[template upsilon[]'''υ'''] [/ ? Greek small letter upsilon]
+[template phi[]'''φ'''] [/ f Greek small letter phi]
+[template chi[]'''χ'''] [/ ? Greek small letter chi]
+[template psi[]'''ψ'''] [/ ? Greek small letter psi]
+[template omega[]'''ω'''] [/ ? Greek small letter omega]
+[template thetasym[]'''ϑ'''] [/ ? Greek small letter theta symbol]
+[template upsih[]'''ϒ'''] [/ ? Greek upsilon with hook symbol]
+[template piv[]'''ϖ'''] [/ ? Greek pi symbol]
+
+[template bull[]'''•'''] [/ • bullet = black small circle]
+[template hellip[]'''…'''] [/ … horizontal ellipsis = three dot leader]
+[template prime[]'''′'''] [/ ' prime = minutes = feet]
+[template Prime[]'''″'''] [/ ? double prime = seconds = inches]
+[template oline[]'''‾'''] [/ ? overline = spacing overscore]
+[template frasl[]'''⁄'''] [/ / fraction slash]
+[template weierp[]'''℘'''] [/ P script capital P = power set = Weierstrass p]
+[template image[]'''ℑ'''] [/ I blackletter capital I = imaginary part]
+[template real[]'''ℜ'''] [/ R blackletter capital R = real part math symbol]
+[template bigo[]'''𝑶'''] [/ O blackletter capital O = big O symbol]
+[template negative[]'''ℕ'''] [/ N blackletter capital N = Negative number math symbol]
+[template trade[]'''™'''] [/ ™ trade mark sign]
+[template alefsym[]'''ℵ'''] [/ ? alef symbol = first transfinite cardinal]
+[template larr[]'''←'''] [/ ? leftwards arrow]
+[template uarr[]'''↑'''] [/ ? upwards arrow]
+[template rarr[]'''→'''] [/ ? rightwards arrow]
+[template darr[]'''↓'''] [/ ? downwards arrow]
+[template harr[]'''↔'''] [/ ? left right arrow]
+[template crarr[]'''↵'''] [/ ? downwards arrow with corner leftwards = CR]
+[template lArr[]'''⇐'''] [/ ? leftwards double arrow]
+[template uArr[]'''⇑'''] [/ ? upwards double arrow]
+[template rArr[]'''⇒'''] [/ ? rightwards double arrow]
+[template dArr[]'''⇓'''] [/ ? downwards double arrow]
+[template hArr[]'''⇔'''] [/ ? left right double arrow]
+[template forall[]'''∀'''] [/ ? for all]
+[template part[]'''∂'''] [/ ? partial differential]
+[template exist[]'''∃'''] [/ ? there exists]
+[template empty[]'''∅'''] [/ Ø empty set = null set = diameter]
+[template nabla[]'''∇'''] [/ ? nabla = backward difference]
+[template isin[]'''∈'''] [/ ? element of]
+[template notin[]'''∉'''] [/ ? not an element of]
+[template ni[]'''∋'''] [/ ? contains as member]
+[template prod[]'''∏'''] [/ ? n-ary product = product sign]
+[template sum[]'''∑'''] [/ ? n-ary sumation]
+[template minus[]'''−'''] [/ - minus sign]
+[template lowast[]'''∗'''] [/ * asterisk operator]
+[template radic[]'''√'''] [/ v square root = radical sign]
+[template prop[]'''∝'''] [/ ? proportional to]
+[template infin[]'''∞'''] [/ 8 infinity]
+[template ang[]'''∠'''] [/ ? angle]
+[template and[]'''∧'''] [/ ? logical and = wedge]
+[template or[]'''∨'''] [/ ? logical or = vee]
+[template cap[]'''∩'''] [/ n intersection = cap]
+[template cup[]'''∪'''] [/ ? union = cup]
+[template int[]'''∫'''] [/ ? integral]
+[template there4[]'''∴'''] [/ ? therefore]
+[template sim[]'''∼'''] [/ ~ tilde operator = varies with = similar to]
+[template cong[]'''≅'''] [/ ? approximately equal to]
+[template approx[]'''≈'''] [/ ? ~~ very approximately equal to]
+[template asymp[]'''≈'''] [/ ˜ almost equal to = asymptotic to]
+[template ne[]'''≠'''] [/ ? not equal to]
+[template equiv[]'''≡'''] [/ = identical to]
+[template le[]'''≤'''] [/ = less-than or equal to]
+[template ge[]'''≥'''] [/ = greater-than or equal to]
+[template subset[]'''⊂'''] [/ ? subset of]
+[template superset[]'''⊃'''] [/ ? superset of]
+[template nsubset[]'''⊄'''] [/ ? not a subset of]
+[template sube[]'''⊆'''] [/ ? subset of or equal to]
+[template supe[]'''⊇'''] [/ ? superset of or equal to]
+[template oplus[]'''⊕'''] [/ ? circled plus = direct sum]
+[template otimes[]'''⊗'''] [/ ? circled times = vector product]
+[template perp[]'''⊥'''] [/ ? up tack = orthogonal to = perpendicular]
+[template sdot[]'''⋅'''] [/ · dot operator]
+[template lceil[]'''⌈'''] [/ ? left ceiling = APL upstile]
+[template rceil[]'''⌉'''] [/ ? right ceiling]
+[template lfloor[]'''⌊'''] [/ ? left floor = APL downstile]
+[template rfloor[]'''⌋'''] [/ ? right floor]
+[template lang[]'''〈'''] [/ < left-pointing angle bracket = bra (Firefox shows ?)]
+[template rang[]'''〉'''] [/ > right-pointing angle bracket = ket (Firefox shows ?)]
+[template loz[]'''◊'''] [/ ? lozenge]
+[template spades[]'''♠'''] [/ ? black spade suit]
+[template clubs[]'''♣'''] [/ ? black club suit = shamrock]
+[template hearts[]'''♥'''] [/ ? black heart suit = valentine]
+[template diams[]'''♦'''] [/ ? black diamond suit]
+[template euro[]'''€'''] [/ ? Euro currency symbol]
+[template lchev[]'''⟨'''] [/ ? left chevron]
+[template rchev[]'''⟩'''] [/ right chevron]
+[template rflat[]'''⟮'''] [/ right flat bracket Misc Math Symbol A]
+[template lflat[]'''⟮'''] [/ left flat bracket]
+[/ U2000.pdf punctuation]
+[template endash[]'''–'''] [/ em width dash]
+[template emdash[]'''—'''] [/ en width dash]
+[template hbar[]'''―'''] [/ ? horizontal bar - introducing quoted text]
+[template vert2bar[]'''‖'''] [/ ? double vertical bar]
+[template line2[]'''‖'''] [/ ? double low line bar]
+[template dagger[]'''†'''] [/ ? dagger]
+[template dagger2[]'''‡'''] [/ ? double dagger]
+[template dot[]'''․'''] [/ dot leader]
+[template dot2[]'''‥'''] [/ ? dots leader]
+[template ellipsis[]'''…'''] [/ horizontal ellipsis]
+[template sect[]'''§'''] [/ ? section or paragraph sign]
+
+[template dotover[]'''̇'''] [/ dot over symbol]
+[template recur[]''' ̇'''] [/ math recurring symbol, eg after 0.333]
+[/ Note use of a thin space before digit, so that dot isn't placed directly over the digit.]
+[/ Use:1[recur]]
+
+[/ Other symbols, not in the HTML4 list:]
+[template enquad[] ''' '''] [/ en quad space]
+[template emquad[] ''' '''] [/ em quad space]
+[template enspace[] ''' '''] [/ em half en space]
+[template emspace[] ''' '''] [/ em space type size in points]
+[template thickspace[] ''' '''] [/ 3 per em space]
+[template midspace[] ''' '''] [/ 4 per em space]
+[template sixemspace[] ''' '''] [/ 6 em space]
+[template figspace[] ''' '''] [/ space = width fixed font digit]
+[template punctspace[] ''' '''] [/ space = width punctuation]
+[template thin[] ''' '''] [/ thin space ]
+[template hair[] ''' '''] [/ hair space]
+[template nbsp[] ''' '''] [/ non-breaking space]
+[template space[] ''' '''] [/ plain non-breaking space]
+
+[template nospace[] '''​'''] [/ zero width space]
+[template wordjoin[] '''⁠'''] [/ word joiner - no line break either side]
+[template narrownbsp[] ''' '''] [/ narrow non-breaking space]
+[template hyphen[] '''‐'''] [/ soft hyphen]
+[template nbhyphen[] '''‑'''] [/ non-breaking hyphen]
+
+[template plusminus[]'''±'''] [/ ? plus or minus sign]
+[template sqrt[]'''√'''] [/ ? square root sqrt symbol]
+[/template pow2[]'''⁳'''] [/ 2073 is NOT superscript 2 and 3 characters]
+[template pow2[]'''²'''] [/ superscript 2 character]
+[template pow3[]'''³'''] [/ superscript 3 character]
+[/ Unicode 2070 to 209F has super and subscript digits and characters, unicode.org/charts/PDF/U2070.pdf]
+[template pow4[]'''⁴'''] [/ superscript 4 character]
+[template pown[]'''ⁿ'''] [/ superscript n character]
+[template frac12[]'''½'''] [/ fraction half]
+[template frac13[]'''⅓'''] [/ fraction third]
+[template frac14[]'''¼'''] [/ fraction quarter]
+[template frac34[]'''¾'''] [/ fraction three quarter]
+[template frac23[]'''⅔'''] [/ fraction two third]
+[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]
+[template sup2[]'''²'''] [/ superscript two = superscript digit two = squared ]
+[template supminus[]'''⁻'''] [/ superscript minus]
+[template supplus[]'''⁺'''] [/ superscript plus]
+
+[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]
+[template macron[]'''¯'''] [/ macron = spacing macron = overline = APL overbar ]
+[template deg[]'''°'''] [/ degree sign ]
+[template plusmn[]'''±'''] [/ plus-minus sign = plus-or-minus sign ]
+[template micro[]'''µ'''] [/ micro sign ]
+[template cedil[]'''¸'''] [/ cedilla = spacing cedilla ]
+[template ordm[]'''º'''] [/ masculine ordinal indicator ]
+[template ordf[]'''ª'''] [/ feminine ordinal indicator ]
+[template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ]
+[template raquo[]'''»'''] [/ right-pointing double angle quotation mark = right pointing guillemet ]
+
+[/
+Copyright 2007, 2010, 2012, 2014 Paul A. Bristow.
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt).
+]
+
diff --git a/libs/sort/doc/images/4_threaded.png b/libs/sort/doc/images/4_threaded.png Binary files differnew file mode 100644 index 000000000..b06d32492 --- /dev/null +++ b/libs/sort/doc/images/4_threaded.png diff --git a/libs/sort/doc/images/Thumbs.db b/libs/sort/doc/images/Thumbs.db Binary files differnew file mode 100644 index 000000000..7572ba63e --- /dev/null +++ b/libs/sort/doc/images/Thumbs.db diff --git a/libs/sort/doc/images/bits_per_byte.png b/libs/sort/doc/images/bits_per_byte.png Binary files differnew file mode 100644 index 000000000..9106e3b7a --- /dev/null +++ b/libs/sort/doc/images/bits_per_byte.png diff --git a/libs/sort/doc/images/entropy.png b/libs/sort/doc/images/entropy.png Binary files differnew file mode 100644 index 000000000..7d0516102 --- /dev/null +++ b/libs/sort/doc/images/entropy.png diff --git a/libs/sort/doc/images/single_threaded.png b/libs/sort/doc/images/single_threaded.png Binary files differnew file mode 100644 index 000000000..8b60a441d --- /dev/null +++ b/libs/sort/doc/images/single_threaded.png diff --git a/libs/sort/doc/papers/original_spreadsort06_2002.pdf b/libs/sort/doc/papers/original_spreadsort06_2002.pdf Binary files differnew file mode 100644 index 000000000..823531f0d --- /dev/null +++ b/libs/sort/doc/papers/original_spreadsort06_2002.pdf diff --git a/libs/sort/doc/single_threaded.png b/libs/sort/doc/single_threaded.png Binary files differnew file mode 100644 index 000000000..8b60a441d --- /dev/null +++ b/libs/sort/doc/single_threaded.png diff --git a/libs/sort/doc/sort.idx b/libs/sort/doc/sort.idx new file mode 100644 index 000000000..449274363 --- /dev/null +++ b/libs/sort/doc/sort.idx @@ -0,0 +1,37 @@ +# sort.idx for Boost.Sort/Spreadsort Quickbook, Doxygen and Auto-index.
+
+# Note needs more customization to be useful in practice! TODO?
+
+#!debug "\<\w*\>"
+
+# Sort Header files.
+#!scan-path "/boost/sort/" ".*\.*pp" true
+!scan-path "../include/boost/sort" ".*\.hpp" false
+!scan-path "../include/boost/sort/spreadsort" ".*\.hpp" false
+
+# All example source files, assuming no sub-folders.
+# sort example files.
+!scan-path "../example" ".*\.cpp" true
+
+# Allow alternative spellings colour | color, and plurals etc.
+color \<\w*(colour|color)\w*\>
+container \<contain\w*\>
+data
+deque \<deque\w*\>
+example \<example\w*\>
+font \<font\w*\>
+greek
+quartile \<quartile\w*\>
+histogram
+ioflags
+origin
+outlier
+maximum \<max\w*\>
+minimum \<min\w*\>
+precision
+range \<\w*\range\w*\>
+scaling \<\w*\scal\w*\>
+tick \<\w*\tick\w*\>
+title
+Unicode \<unicode\w*\>
+vector \<\w*\vector\w*\>
diff --git a/libs/sort/doc/sort.pdf b/libs/sort/doc/sort.pdf Binary files differnew file mode 100644 index 000000000..c1465ec02 --- /dev/null +++ b/libs/sort/doc/sort.pdf diff --git a/libs/sort/doc/sort.qbk b/libs/sort/doc/sort.qbk new file mode 100644 index 000000000..73087c02e --- /dev/null +++ b/libs/sort/doc/sort.qbk @@ -0,0 +1,930 @@ +[library Boost.Sort
+ [quickbook 1.7]
+ [id sort]
+ [copyright 2014 Steven Ross]
+ [authors [Ross, Steven]]
+ [dirname sort]
+ [license Distributed under the
+ [@http://boost.org/LICENSE_1_0.txt Boost Software License, Version 1.0].
+ ]
+]
+
+[/ Some composite templates]
+[template super[x]'''<superscript>'''[x]'''</superscript>''']
+[template sub[x]'''<subscript>'''[x]'''</subscript>''']
+[template floor[x]'''⌊'''[x]'''⌋''']
+[template floorlr[x][lfloor][x][rfloor]]
+[template ceil[x] '''⌈'''[x]'''⌉''']
+
+[/ Required for autoindexing]
+[import ../../../tools/auto_index/include/auto_index_helpers.qbk]
+[/ Must be first included file!]
+
+[/Files containing quickbook snippets]
+[import ../example/charstringsample.cpp]
+[import ../example/stringfunctorsample.cpp]
+[import ../example/reverseintsample.cpp]
+[import ../example/rightshiftsample.cpp]
+[import ../example/int64.cpp]
+[import ../example/floatfunctorsample.cpp]
+[import ../example/generalizedstruct.cpp]
+
+[import html4_symbols.qbk] [/ Provides various useful squiggles.]
+
+[def __spreadsort [@http://en.wikipedia.org/wiki/Spreadsort spreadsort]]
+[def __introsort [@http://en.wikipedia.org/wiki/Introsort introsort]]
+[def __stl_sort [@http://www.cplusplus.com/reference/algorithm/sort/ STL std::sort]]
+[def __big_o [@http://en.wikipedia.org/wiki/Big_O_notation Big O notation]]
+[def __radix_sort[@http://en.wikipedia.org/wiki/Radix_sort radix sort]]
+[def __adaptive_left_reflex [@http://www.nik.no/2002/Maus.pdf Arne Maus, Adaptive Left Reflex]]
+[def __american_flag [@http://en.wikipedia.org/wiki/American_flag_sort American flag sort]]
+[def __overloading [link sort.overview.overloading overloading]]
+[def __lookup [link sort.rationale.lookup lookup]]
+[def __random_access_iter [@http://en.cppreference.com/w/cpp/concept/RandomAccessIterator RandomAccessIterator]]
+[def __strictweakordering [@http://en.wikipedia.org/wiki/Weak_ordering#Strict_weak_orderings strict weak ordering]]
+
+[/ Links to functions for use in text]
+[def __integer_sort [^[funcref boost::sort::spreadsort::integer_sort integer_sort]]]
+[def __float_sort [^[funcref boost::sort::spreadsort::float_sort float_sort]]]
+[def __string_sort [^[funcref boost::sort::spreadsort::string_sort string_sort]]]
+[def __spreadsort [^[funcref boost::sort::spreadsort::spreadsort spreadsort]]] [/Note diff from Wiki link __spreadsort]
+[def __std_sort [@http://en.cppreference.com/w/cpp/algorithm/sort std::sort]]
+
+[section:overview Overview]
+
+[section:intro Introduction]
+
+The Boost.Sort library provides a generic implementation of high-speed sorting algorithms
+that outperform those in the C++ standard in both average and worst case performance
+when there are over 1000 elements in the list to sort.
+
+They fall back to __stl_sort on small data sets.
+
+[warning These algorithms all only work on
+[@http://www.cplusplus.com/reference/iterator/RandomAccessIterator/ random access iterators].]
+
+They are hybrids using both radix and comparison-based sorting,
+specialized to sorting common data types, such as integers, floats, and strings.
+
+These algorithms are encoded in a generic fashion and accept functors,
+enabling them to sort any object that can be processed like these basic data types.
+In the case of __string_sort, this includes anything
+with a defined strict-weak-ordering that __std_sort can sort,
+but writing efficient functors for some complex key types
+may not be worth the additional effort relative to just using __std_sort,
+depending on how important speed is to your application.
+Sample usages are available in the example directory.
+
+Unlike many radix-based algorithms,
+the underlying __spreadsort algorithm is designed around [*worst-case performance].
+It performs better on chunky data (where it is not widely distributed),
+so that on real data it can perform substantially better than on random data.
+Conceptually, __spreadsort can sort any data for which an absolute ordering can be determined,
+and __string_sort is sufficiently flexible that this should be possible.
+
+Situations where __spreadsort is fastest relative to __std_sort:
+
+# Large number of elements to sort (['N] >= 10000).
+
+# Slow comparison function (such as floating-point numbers on x86 processors or strings).
+
+# Large data elements (such as key + data sorted on a key).
+
+# Completely sorted data when __spreadsort has an optimization to quit early in this case.
+
+Situations where __spreadsort is slower than __std_sort:
+
+# Data sorted in reverse order. Both __std_sort and __spreadsort are faster
+on reverse-ordered data than randomized data,
+but __std_sort speeds up more in this special case.
+
+# Very small amounts of data (< 1000 elements).
+For this reason there is a fallback in __spreadsort to __std_sort
+if the input size is less than 1000,
+so performance is identical for small amounts of data in practice.
+
+These functions are defined in `namespace boost::sort::spreadsort`.
+
+[endsect] [/section Introduction]
+
+[section:overloading Overloading]
+
+[tip In the Boost.Sort C++ Reference section, click on the appropriate overload, for example `float_sort(RandomAccessIter, RandomAccessIter, Right_shift, Compare);` to get full details of that overload.]
+
+Each of __integer_sort, __float_sort, and __string_sort have 3 main versions:
+The base version, which takes a first iterator and a last iterator, just like __std_sort:
+
+ integer_sort(array.begin(), array.end());
+ float_sort(array.begin(), array.end());
+ string_sort(array.begin(), array.end());
+
+The version with an overridden shift functor, providing flexibility
+in case the `operator>>` already does something other than a bitshift.
+The rightshift functor takes two args, first the data type,
+and second a natural number of bits to shift right.
+
+For __string_sort this variant is slightly different;
+it needs a bracket functor equivalent to `operator`\[\],
+taking a number corresponding to the character offset,
+along with a second `getlength` functor to get the length of the string in characters.
+In all cases, this operator must return an integer type that compares with the
+`operator<` to provide the intended order
+(integers can be negated to reverse their order).
+
+In other words:
+
+ rightshift(A, n) < rightshift(B, n) -> A < B
+
+[rightshift_1]
+[bracket_1]
+
+See [@../../example/rightshiftsample.cpp rightshiftsample.cpp] for a working example of integer sorting with a rightshift functor.
+
+And a version with a comparison functor for maximum flexibility.
+This functor must provide the same sorting order as the integers returned by the rightshift:
+
+ rightshift(A, n) < rightshift(B, n) -> compare(A, B)
+
+[reverse_int_2]
+
+Examples of functors are:
+
+[lessthan_functor]
+
+[bracket_functor]
+
+[getsize_functor]
+
+and these functors are used thus:
+
+[stringsort_functors_call]
+
+See [@../../example/stringfunctorsample.cpp stringfunctorsample.cpp] for a working example of sorting strings with all functors.
+
+[endsect] [/section:overloading Overloading]
+
+[section:performance Performance]
+
+The __spreadsort algorithm is a hybrid algorithm;
+when the number of elements being sorted is below a certain number,
+comparison-based sorting is used. Above it, radix sorting is used.
+The radix-based algorithm will thus cut up the problem into small pieces,
+and either completely sort the data based upon its radix if the data is clustered,
+or finish sorting the cut-down pieces with comparison-based sorting.
+
+The Spreadsort algorithm dynamically chooses
+either comparison-based or radix-based sorting when recursing,
+whichever provides better worst-case performance.
+This way worst-case performance is guaranteed to be the better of
+['[bigo](N[sdot]log2(N))] comparisons and ['[bigo](N[sdot]log2(K/S + S))] operations where
+
+* ['N] is the number of elements being sorted,
+* ['K] is the length in bits of the key, and
+* ['S] is a constant.
+
+This results in substantially improved performance for large [' N];
+__integer_sort tends to be 50% to 2X faster than __std_sort,
+while __float_sort and _string_sort are roughly 2X faster than __std_sort.
+
+Performance graphs are provided for __integer_sort, __float_sort, and __string_sort in their description.
+
+Runtime Performance comparisons and graphs were made on a Core 2 Duo laptop
+running Windows Vista 64 with MSVC 8.0,
+and an old G4 laptop running Mac OSX with gcc.
+[@http://www.boost.org/build/doc/html/ Boost bjam/b2] was used to control compilation.
+
+Direct performance comparisons on a newer x86 system running Ubuntu,
+with the fallback to __std_sort at lower input sizes disabled are below.
+
+[note The fallback to __std_sort for smaller input sizes prevents
+the worse performance seen on the left sides of the first two graphs.]
+
+__integer_sort starts to become faster than __std_sort at about 1000 integers (4000 bytes),
+and __string_sort becomes faster than __std_sort at slightly fewer bytes (as few as 30 strings).
+
+[note The 4-threaded graph has 4 threads doing [*separate sorts simultaneously]
+(not splitting up a single sort)
+as a test for thread cache collision and other multi-threaded performance issues.]
+
+__float_sort times are very similar to __integer_sort times.
+
+[/ These provide links to the images, but currently graphs are shown - see below]
+[/@../../doc/images/single_threaded.png single_threaded.png] [/file:///I:/modular-boost/libs/sort/doc/images/single_threaded.png]
+[/@../../doc/images/4_threaded.png 4_threaded.png]
+[/@../../doc/images/entropy.png entropy.png]
+[/@../../doc/images/bits_per_byte.png bits_per_byte.png]
+
+[$../images/single_threaded.png] [/<img src="../images/single_threaded.png"> == file:///I:/modular-boost/libs/sort/doc/images/single_threaded.png]
+[$../images/4_threaded.png]
+[$../images/entropy.png]
+[$../images/bits_per_byte.png]
+
+Histogramming with a fixed maximum number of splits is used
+because it reduces the number of cache misses,
+thus improving performance relative to the approach described in detail
+in the [@http://en.wikipedia.org/wiki/Spreadsort original SpreadSort publication].
+
+The importance of cache-friendly histogramming is described
+in __adaptive_left_reflex,
+though without the worst-case handling described below.
+
+The time taken per radix iteration is:
+
+['[bigo](N)] iterations over the data
+
+['[bigo](N)] integer-type comparisons (even for _float_sort and __string_sort)
+
+['[bigo](N)] swaps
+
+['[bigo](2[super S])] bin operations.
+
+To obtain ['[bigo](N)] worst-case performance per iteration,
+the restriction ['S <= log2(N)] is applied, and ['[bigo](2[super S])] becomes ['[bigo](N)].
+For each such iteration, the number of unsorted bits log2(range)
+(referred to as ['K]) per element is reduced by ['S].
+As ['S] decreases depending upon the amount of elements being sorted,
+it can drop from a maximum of ['S[sub max]] to the minimum of ['S[sub min]].
+
+Assumption: __std_sort is assumed to be ['[bigo](N*log2(N))],
+as __introsort exists and is commonly used.
+(If you have a quibble with this please take it up with the implementor of your __std_sort;
+you're welcome to replace the recursive calls to __std_sort to calls
+to __introsort if your __std_sort library call is poorly implemented).
+
+[@http://en.wikipedia.org/wiki/Introsort Introsort] is not included with this algorithm for simplicity and
+because the implementor of the __std_sort call
+is assumed to know what they're doing.
+
+To maintain a minimum value for ['S (S[sub min])],
+comparison-based sorting has to be used to sort when
+['n <= log2(meanbinsize)], where ['log2(meanbinsize) (lbs)] is a small constant,
+usually between 0 and 4, used to minimize bin overhead per element.
+There is a small corner-case where if ['K < S[sub min]] and ['n >= 2^K],
+then the data can be sorted in a single radix-based iteration with an ['S = K]
+(this bucketsorting special case is by default only applied to __float_sort).
+So for the final recursion, worst-case performance is:
+
+1 radix-based iteration if ['K <= S[sub min]],
+
+or ['S[sub min] + lbs] comparison-based iterations if ['K > S[sub min]] but ['n <= 2[super (S[sub min] + lbs)]].
+
+So for the final iteration, worst-case runtime is ['[bigo](N*(S[sub min] + lbs))] but
+if ['K > S[sub min]] and ['N > 2[super (S[sub min] + lbs)]]
+then more than 1 radix recursion will be required.
+
+For the second to last iteration, ['K <= S[sub min] * 2 + 1] can be handled,
+(if the data is divided into ['2[super (S[sub min] + 1)]] pieces)
+or if ['N < 2[super (S[sub min] + lbs + 1)]],
+then it is faster to fallback to __std_sort.
+
+In the case of a radix-based sort plus recursion, it will take
+['[bigo](N*(S[sub min] + lbs)) + [bigo](N) = [bigo](N*(S[sub min] + lbs + 1))] worst-case time,
+as
+['K_remaining = K_start - (S[sub min] + 1)], and ['K_start <= S[sub min] * 2 + 1].
+
+Alternatively, comparison-based sorting is used if ['N < 2[super (S[sub min] + lbs + 1)]],
+which will take ['[bigo](N*(S[sub min] + lbs + 1))] time.
+
+So either way ['[bigo](N*(S[sub min] + lbs + 1))] is the worst-case time for the second to last iteration,
+which occurs if ['K <= S[sub min] * 2 + ]1 or ['N < 2[super (S[sub min] + lbs + 1)]].
+
+This continues as long as ['S[sub min] <= S <= S[sub max]],
+so that for ['K_m <= K_(m-1) + S[sub min] + m] where ['m]
+is the maximum number of iterations after this one has finished,
+or where ['N < 2[super (S[sub min] + lbs + m)]],
+then the worst-case runtime is ['[bigo](N*(S[sub min] + lbs + m))].
+
+[space][space]['K_m] at ['m <= (S[sub max] - S[sub min])] works out to:
+
+[space][space]['K_1 <= (S[sub min]) + S[sub min] + 1 <= 2S[sub min] + 1]
+
+[space][space]['K_2 <= (2S[sub min] + 1) + S[sub min] + 2]
+
+as the sum from 0 to ['m] is ['m(m + 1)/2]
+
+[space][space]['K_m <= (m + 1)S[sub min] + m(m + 1)/2 <= (S[sub min] + m/2)(m + 1)]
+
+substituting in S[sub max] - S[sub min] for m
+
+[space][space]['K_(S[sub max] - S[sub min]) <= (S[sub min] + (S[sub max] - S[sub min])/2)*(S[sub max] - S[sub min] + 1)]
+
+[space][space]['K_(S[sub max] - S[sub min]) <= (S[sub min] + S[sub max]) * (S[sub max] - S[sub min] + 1)/2]
+
+Since this involves ['S[sub max] - S[sub min] + 1] iterations,
+this works out to dividing ['K] into an average ['(S[sub min] + S[sub max])]/2
+pieces per iteration.
+
+To finish the problem from this point takes ['[bigo](N * (S[sub max] - S[sub min]))] for ['m] iterations,
+plus the worst-case of ['[bigo](N*(S[sub min] + lbs))] for the last iteration,
+for a total of ['[bigo](N *(S[sub max] + lbs))] time.
+
+When ['m > S[sub max] - S[sub min]], the problem is divided into ['S[sub max]] pieces per iteration,
+or __std_sort is called if ['N < 2^(m + S[sub min] + lbs)]. For this range:
+
+[space][space]['K_m <= K_(m - 1) + S[sub max]], providing runtime of
+
+[space][space]['[bigo](N *((K - K_(S[sub max] - S[sub min]))/S[sub max] + S[sub max] + lbs))] if recursive,
+
+or ['[bigo](N * log(2^(m + S[sub min] + lbs)))] if comparison-based,
+
+which simplifies to ['[bigo](N * (m + S[sub min] + lbs))],
+which substitutes to ['[bigo](N * ((m - (S[sub max] - S[sub min])) + S[sub max] + lbs))],
+which given that ['m - (S[sub max] - S[sub min]) <= (K - K_(S[sub max] - S[sub min]))/S[sub max]]
+(otherwise a lesser number of radix-based iterations would be used)
+
+also comes out to ['[bigo](N *((K - K_(S[sub max] - S[sub min]))/S[sub max] + S[sub max] + lbs))].
+
+Asymptotically, for large ['N] and large ['K], this simplifies to:
+
+[space][space]['[bigo](N * (K/S[sub max] + S[sub max] + lbs))],
+
+simplifying out the constants related to the ['S[sub max] - S[sub min]] range,
+providing an additional ['[bigo](N * (S[sub max] + lbs))] runtime on top of the
+['[bigo](N * (K/S))] performance of LSD __radix_sort,
+but without the ['[bigo](N)] memory overhead.
+For simplicity, because ['lbs] is a small constant
+(0 can be used, and performs reasonably),
+it is ignored when summarizing the performance in further discussions.
+By checking whether comparison-based sorting is better,
+Spreadsort is also ['[bigo](N*log(N))], whichever is better,
+and unlike LSD __radix_sort, can perform much better than the worst-case
+if the data is either evenly distributed or highly clustered.
+
+This analysis was for __integer_sort and __float_sort.
+__string_sort differs in that ['S[sub min] = S[sub max] = sizeof(Char_type) * 8],
+['lbs] is 0, and that __std_sort's comparison is not a constant-time operation,
+so strictly speaking __string_sort runtime is
+
+[space][space]['[bigo](N * (K/S[sub max] + (S[sub max] comparisons)))].
+
+Worst-case, this ends up being ['[bigo](N * K)]
+(where ['K] is the mean string length in bytes),
+as described for __american_flag, which is better than the
+
+[space][space]['[bigo](N * K * log(N))]
+
+worst-case for comparison-based sorting.
+
+[endsect] [/section:performance Performance]
+
+[section:tuning Tuning]
+__integer_sort and __float_sort have tuning constants that control
+how the radix-sorting portion of those algorithms work.
+The ideal constant values for __integer_sort and __float_sort vary depending on
+the platform, compiler, and data being sorted.
+By far the most important constant is ['max_splits],
+which defines how many pieces the radix-sorting portion splits
+the data into per iteration.
+
+The ideal value of ['max_splits] depends upon the size of the L1 processor cache,
+and is between 10 and 13 on many systems.
+A default value of 11 is used. For mostly-sorted data, a much larger value is better,
+as swaps (and thus cache misses) are rare,
+but this hurts runtime severely for unsorted data, so is not recommended.
+
+On some x86 systems, when the total number of elements being sorted is small
+( less than 1 million or so), the ideal ['max_splits] can be substantially larger,
+such as 17. This is suspected to be because all the data fits into the L2 cache,
+and misses from L1 cache to L2 cache do not impact performance
+as severely as misses to main memory.
+Modifying tuning constants other than ['max_splits] is not recommended,
+as the performance improvement for changing other constants is usually minor.
+
+If you can afford to let it run for a day, and have at least 1GB of free memory,
+the perl command: `./tune.pl -large -tune` (UNIX)
+or `perl tune.pl -large -tune -windows` (Windows)
+can be used to automatically tune these constants.
+This should be run from the `libs/sort directory` inside the boost home directory.
+This will work to identify the `ideal constants.hpp` settings for your system,
+testing on various distributions in a 20 million element (80MB) file,
+and additionally verifies that all sorting routines sort correctly
+across various data distributions.
+Alternatively, you can test with the file size you're most concerned with
+`./tune.pl number -tune` (UNIX) or `perl tune.pl number -tune -windows` (Windows).
+Substitute the number of elements you want to test with for `number`.
+Otherwise, just use the options it comes with, they're decent.
+With default settings `./tune.pl -tune` (UNIX) `perl tune.pl -tune -windows` (Windows),
+the script will take hours to run (less than a day),
+but may not pick the correct ['max_splits] if it is over 10.
+Alternatively, you can add the `-small` option to make it take just a few minutes,
+tuning for smaller vector sizes (one hundred thousand elements),
+but the resulting constants may not be good for large files
+(see above note about ['max_splits] on Windows).
+
+The tuning script can also be used just to verify that sorting works correctly
+on your system, and see how much of a speedup it gets,
+by omiting the "-tune" option. This runs at the end of tuning runs.
+Default args will take about an hour to run and give accurate results
+on decent-sized test vectors. `./tune.pl -small` (UNIX) `perl tune.pl -small -windows` (Windows)
+is a faster option, that tests on smaller vectors and isn't as accurate.
+
+If any differences are encountered during tuning, please call `tune.pl` with `-debug > log_file_name`.
+If the resulting log file contains compilation or permissions issues,
+it is likely an issue with your setup.
+If some other type of error is encountered (or result differences),
+please send them to the library author at spreadsort@gmail.com.
+Including the zipped `input.txt` that was being used is also helpful.
+
+[endsect] [/section:tuning Tuning]
+
+[endsect] [/section Overview]
+
+[section:sort_hpp Spreadsort]
+
+[section:header_spreadsort Header `<boost/sort/spreadsort/spreadsort.hpp>`]
+
+__spreadsort checks whether the data-type provided is an integer,
+castable float, string, or wstring.
+
+* If data-type is an integer, __integer_sort is used.
+* If data-type is a float, __float_sort is used.
+* If data-type is a string or wstring, __string_sort is used.
+* Sorting other data-types requires picking between
+__integer_sort, __float_sort and __string_sort directly,
+as __spreadsort won't accept types that don't have the appropriate type traits.
+
+Overloading variants are provided that permit use of user-defined right-shift functors and comparison functors.
+
+Each function is optimized for its set of arguments; default functors are not provided to avoid the risk of any reduction of performance.
+
+See __overloading section.
+
+[h5 Rationale:]
+
+__spreadsort function provides a wrapper that calls the fastest sorting algorithm
+available for a data-type, enabling faster generic programming.
+
+[section:spreadsort_examples Spreadsort Examples]
+
+See [@../../example/ example] folder for all examples.
+
+See [@../../example/sample.cpp sample.cpp] for a simple working example.
+
+For an example of 64-bit integer sorting, see [@../../example/int64.cpp int64.cpp].
+
+This example sets the element type of a vector to 64-bit integer
+
+[int64bit_1]
+
+and calls the sort
+
+[int64bit_2]
+
+For a simple example sorting `float`s,
+
+ vector<float> vec;
+ vec.push_back(1.0);
+ vec.push_back(2.3);
+ vec.push_back(1.3);
+ ...
+ spreadsort(vec.begin(), vec.end());
+ //The sorted vector contains "1.0 1.3 2.3 ..."
+
+See also [@../../example/floatsample.cpp floatsample.cpp] which checks for abnormal values.
+
+[endsect] [/section:spreadsort_examples Spreadsort Examples]
+
+[endsect] [/section:header_spreadsort Header `<boost/sort/spreadsort/spreadsort.hpp>`]
+
+[section:integer_sort Integer Sort]
+
+__integer_sort is a fast templated in-place hybrid radix/comparison algorithm,
+which in testing tends to be roughly 50% to 2X faster than
+__std_sort for large tests (>=100kB).
+Worst-case performance is ['[bigo](N * (log2(range)/s + s))],
+so __integer_sort is asymptotically faster than pure comparison-based algorithms.
+['s] is ['max_splits], which defaults to 11,
+so its worst-case with default settings for 32-bit integers is ['[bigo](N * ((32/11)]
+slow radix-based iterations + 11 fast comparison-based iterations).
+
+Some performance plots of runtime vs. n and log2(range) are provided below:
+
+[@../../doc/graph/windows_integer_sort.htm Windows Integer Sort]
+
+[@../../doc/graph/osx_integer_sort.htm OSX integer Sort]
+
+[section:integersort_examples Integer Sort Examples]
+
+See [@../../example/rightshiftsample.cpp rightshiftsample.cpp] for a working example of using rightshift, using a user-defined functor:
+
+[rightshift_int_functor]
+
+Other examples:
+
+[@../../example/keyplusdatasample.cpp Sort structs using an integer key.]
+
+[@../../example/reverseintsample.cpp Sort integers in reverse order.]
+
+[@../../example/mostlysorted.cpp Simple sorting of integers; this case is a performance test for integers that are already mostly sorted.]
+
+[endsect] [/section:integersort_examples Integer Sort Examples]
+
+[endsect] [/section:integer_sort Integer Sort]
+
+[section:float_sort Float Sort]
+
+__float_sort is a fast templated in-place hybrid radix/comparison algorithm much like __integer_sort, but sorts IEEE floating-point numbers (positive, zero, NaN, and negative) into ascending order by casting them to integers. This works because positive IEEE floating-point numbers sort like integers with the same bits, and negative IEEE floating-point numbers sort in the reverse order of integers with the same bits. float_sort is roughly 2X as fast as std::sort.
+
+-0.0 vs. 0.0 and NaN are given definitive ordered positions by the radix-based portion of this algorithm, where comparison-based sorting does not guarantee their relative position. The included tests avoid creating NaN and -0.0 so that results match std::sort, which is not consistent in how it handles these numbers, as they compare as equal to numbers with different values.
+
+float_sort checks the size of the data type and whether it is castable, picking
+ an integer type to cast to, if a casting functor isn't provided by the user.
+
+float_mem_cast casts IEEE floating-point numbers (positive, zero, NaN, and negative) into integers. This is an essential utility for creating a custom rightshift functor for float_sort, when one is needed. Only IEEE floating-point numbers of the same size as the integer type being cast to should be used in this specialized method call.
+Worst-case performance is ['[bigo](N * (log2(range)/s + s))],
+so __float_sort is asymptotically faster than pure comparison-based algorithms.
+['s] is ['max_splits], which defaults to 11,
+so its worst-case with default settings for 32-bit integers is ['[bigo](N * ((32/11)]
+slow radix-based iterations + 11 fast comparison-based iterations).
+
+Some performance plots of runtime vs. n and log2(range) are provided below:
+
+[@../../doc/graph/windows_float_sort.htm Windows Float Sort]
+
+[@../../doc/graph/osx_float_sort.htm OSX Float Sort]
+
+[section:floatsort_examples Float Sort Examples]
+
+See [@../../example/floatfunctorsample.cpp floatfunctorsample.cpp] for a working example of how to sort structs with a float key:
+
+[float_functor_types]
+
+[float_functor_datatypes]
+
+Right-shift functor:
+
+[float_functor_rightshift]
+
+Comparison lessthan `operator<` functor:
+
+[float_functor_lessthan]
+
+Other examples:
+
+[@../../example/double.cpp Sort doubles.]
+
+[@../../example/shiftfloatsample.cpp Sort floats using a rightshift functor.]
+
+[endsect] [/section:floatsort_examples Float Sort Examples]
+
+[endsect] [/section:float_sort Float Sort]
+
+[section:string_sort String Sort]
+__string_sort is a hybrid radix-based/comparison-based algorithm that sorts strings of characters (or arrays of binary data) in ascending order.
+
+The simplest version (no functors) sorts strings of items that can cast to an unsigned data type (such as an unsigned char), have a < operator, have a size function, and have a data() function that returns a pointer to an array of characters, such as a std::string. The functor version can sort any data type that has a strict weak ordering, via templating, but requires definitions of a get_char (acts like x[offset] on a string or a byte array), get_length (returns length of the string being sorted), and a comparison functor. Individual characters returned by get_char must support the != operator and have an unsigned value that defines their lexicographical order.
+
+This algorithm is not efficient for character types larger than 2 bytes each, and is optimized for one-byte character strings. For this reason, __std_sort will be called instead if the character type is of size > 2.
+
+__string_sort has a special optimization for identical substrings. This adds some overhead on random data, but identical substrings are common in real strings.
+
+reverse_string_sort sorts strings in reverse (decending) order, but is otherwise identical. __string_sort is sufficiently flexible that it should sort any data type that __std_sort can, assuming the user provides appropriate functors that index into a key.
+
+[@../../doc/graph/windows_string_sort.htm Windows String Sort]
+
+[@../../doc/graph/osx_string_sort.htm OSX String Sort]
+
+
+
+[section:stringsort_examples String Sort Examples]
+
+See [@../../example/stringfunctorsample.cpp stringfunctorsample.cpp] for an example of how to sort structs using a string key and all functors:
+
+[lessthan_functor]
+
+[bracket_functor]
+
+[getsize_functor]
+
+and these functors are used thus:
+
+[stringsort_functors_call]
+
+
+See [@../../example/generalizedstruct.cpp generalizedstruct.cpp] for a working example of a generalized approach to sort structs by a sequence of integer, float, and multiple string keys using string_sort:
+
+[generalized_functors]
+
+[generalized_functors_call]
+
+Other examples:
+
+[@../../example/stringsample.cpp String sort.]
+
+[@../../example/reversestringsample.cpp Reverse string sort.]
+
+[@../../example/wstringsample.cpp Wide character string sort.]
+
+[@../../example/caseinsensitive.cpp Case insensitive string sort.]
+
+[@../../example/charstringsample.cpp Sort structs using a string key and indexing functors.]
+
+[@../../example/reversestringfunctorsample.cpp Sort structs using a string keynd all functors in reverse order.]
+
+[endsect] [/section:stringsort_examples String Sort Examples]
+
+[endsect] [/section:string_sort String Sort]
+
+[section:rationale Rationale]
+
+[section:radix_sorting Radix Sorting]
+Radix-based sorting allows the data to be divided up into more than 2 pieces per iteration,
+and for cache-friendly versions, it normally cuts the data up into around a thousand pieces per iteration.
+This allows many fewer iterations to be used to complete sorting the data,
+enabling performance superior to the ['[bigo](N*log(N))] comparison-based sorting limit.
+[endsect] [/section:radix_sorting Radix Sorting]
+
+[section:hybrid_radix Hybrid Radix]
+
+There a two primary types of radix-based sorting:
+
+Most-significant-digit Radix sorting (MSD) divides the data recursively
+based upon the top-most unsorted bits.
+This approach is efficient for even distributions that divide nicely,
+and can be done in-place (limited additional memory used).
+There is substantial constant overhead for each iteration to deal
+with the splitting structure.
+The algorithms provided here use MSD Radix Sort for their radix-sorting portion.
+The main disadvantage of MSD Radix sorting is that when the data is cut up into small
+pieces, the overhead for additional recursive calls starts to dominate runtime,
+and this makes worst-case behavior substantially worse than ['[bigo](N*log(N))].
+
+By contrast, __integer_sort, __float_sort, and __string_sort all check to see
+whether Radix-based or Comparison-based sorting have better worst-case runtime,
+and make the appropriate recursive call.
+Because Comparison-based sorting algorithms are efficient on small pieces,
+the tendency of MSD __radix_sort to cut the problem up small is turned into
+an advantage by these hybrid sorts. It is hard to conceive of a common usage case
+where pure MSD __radix_sort would have any significant advantage
+over hybrid algorithms.
+
+Least-significant-digit __radix_sort (LSD) sorts based upon
+the least-significant bits first. This requires a complete copy of the data being sorted,
+using substantial additional memory. The main advantage of LSD Radix Sort
+is that aside from some constant overhead and the memory allocation,
+it uses a fixed amount of time per element to sort, regardless of distribution or
+size of the list. This amount of time is proportional to the length of the radix.
+The other advantage of LSD Radix Sort is that it is a stable sorting algorithm,
+so elements with the same key will retain their original order.
+
+One disadvantage is that LSD Radix Sort uses the same amount of time
+to sort "easy" sorting problems as "hard" sorting problems,
+and this time spent may end up being greater than an efficient ['[bigo](N*log(N))]
+algorithm such as __introsort spends sorting "hard" problems on large data sets,
+depending on the length of the datatype, and relative speed of comparisons,
+memory allocation, and random accesses.
+
+The other main disadvantage of LSD Radix Sort is its memory overhead.
+It's only faster for large data sets, but large data sets use significant memory,
+which LSD Radix Sort needs to duplicate. LSD Radix Sort doesn't make sense for items
+of variable length, such as strings; it could be implemented by starting at the end
+of the longest element, but would be extremely inefficient.
+
+All that said, there are places where LSD Radix Sort is the appropriate and
+fastest solution, so it would be appropriate to create a templated LSD Radix Sort
+similar to __integer_sort and __float_sort. This would be most appropriate in cases where
+comparisons are extremely slow.
+
+[endsect] [/section:hybrid_radix Hybrid Radix]
+
+[section:why_spreadsort Why spreadsort?]
+
+The __spreadsort algorithm used in this library is designed to provide best possible
+worst-case performance, while still being cache-friendly.
+It provides the better of ['[bigo](N*log(K/S + S))] and ['[bigo](N*log(N))] worst-case time,
+where ['K] is the log of the range. The log of the range is normally the length in bits
+of the data type; 32 for a 32-bit integer.
+
+`flash_sort` (another hybrid algorithm), by comparison is ['[bigo](N)]
+for evenly distributed lists. The problem is, `flash_sort` is merely an MSD __radix_sort
+combined with ['[bigo](N*N)] insertion sort to deal with small subsets where
+the MSD Radix Sort is inefficient, so it is inefficient with chunks of data
+around the size at which it switches to `insertion_sort`, and ends up operating
+as an enhanced MSD Radix Sort.
+For uneven distributions this makes it especially inefficient.
+
+__integer_sort and __float_sort use __introsort instead, which provides ['[bigo](N*log(N))]
+performance for these medium-sized pieces. Also, `flash_sort`'s ['[bigo](N)]
+performance for even distributions comes at the cost of cache misses,
+which on modern architectures are extremely expensive, and in testing
+on modern systems ends up being slower than cutting up the data in multiple,
+cache-friendly steps. Also worth noting is that on most modern computers,
+`log2(available RAM)/log2(L1 cache size)` is around 3,
+where a cache miss takes more than 3 times as long as an in-cache random-access,
+and the size of ['max_splits] is tuned to the size of the cache.
+On a computer where cache misses aren't this expensive, ['max_splits]
+could be increased to a large value, or eliminated entirely,
+and `integer_sort/float_sort` would have the same ['[bigo](N)] performance
+on even distributions.
+
+Adaptive Left Radix (ALR) is similar to `flash_sort`, but more cache-friendly.
+It still uses insertion_sort. Because ALR uses ['[bigo](N*N)] `insertion_sort`,
+it isn't efficient to use the comparison-based fallback sort on large lists,
+and if the data is clustered in small chunks just over the fallback size
+with a few outliers, radix-based sorting iterates many times doing little sorting
+with high overhead. Asymptotically, ALR is still ['[bigo](N*log(K/S + S))],
+but with a very small ['S] (about 2 in the worst case),
+which compares unfavorably with the 11 default value of ['max_splits] for
+Spreadsort.
+
+ALR also does not have the ['[bigo](N*log(N))] fallback, so for small lists
+that are not evenly distributed it is extremely inefficient.
+See the `alrbreaker` and `binaryalrbreaker` testcases for examples;
+either replace the call to sort with a call to ALR and update the ALR_THRESHOLD
+at the top, or as a quick comparison make `get_max_count return ALR_THRESHOLD`
+(20 by default based upon the paper).
+These small tests take 4-10 times as long with ALR as __std_sort
+in the author's testing, depending on the test system,
+because they are trying to sort a highly uneven distribution.
+Normal Spreadsort does much better with them, because `get_max_count`
+is designed around minimizing worst-case runtime.
+
+`burst_sort` is an efficient hybrid algorithm for strings that
+uses substantial additional memory.
+
+__string_sort uses minimal additional memory by comparison.
+Speed comparisons between the two haven't been made,
+but the better memory efficiency makes __string_sort more general.
+
+`postal_sort` and __string_sort are similar. A direct performance comparison
+would be welcome, but an efficient version of `postal_sort` was not found
+in a search for source.
+
+__string_sort is most similar to the __american_flag algorithm.
+The main difference is that it doesn't bother trying to optimize how empty
+buckets/piles are handled, instead just checking to see if all characters
+at the current index are equal. Other differences are using __std_sort
+as the fallback algorithm, and a larger fallback size (256 vs. 16),
+which makes empty pile handling less important.
+
+Another difference is not applying the stack-size restriction.
+Because of the equality check in __string_sort, it would take ['m*m] memory
+worth of strings to force __string_sort to create a stack of depth ['m].
+This problem isn't a realistic one on modern systems with multi-megabyte stacksize
+limits, where main memory would be exhausted holding the long strings necessary
+to exceed the stacksize limit. __string_sort can be thought of as modernizing
+__american_flag to take advantage of __introsort as a fallback algorithm.
+In the author's testing, __american_flag (on `std::strings`) had comparable runtime
+to __introsort, but making a hybrid of the two allows reduced overhead and
+substantially superior performance.
+
+[endsect] [/section:why_spreadsort]
+
+[section:unstable_sort Unstable Sorting]
+
+Making a __radix_sort stable requires the usage of an external copy of the data.
+A stable hybrid algorithm also requires a stable comparison-based algorithm,
+and these are generally slow. LSD __radix_sort uses an external copy of the data,
+and provides stability, along with likely being faster (than a stable hybrid sort),
+so that's probably a better way to go for integer and floating-point types.
+It might make sense to make a stable version of __string_sort using external memory,
+but for simplicity this has been left out for now.
+
+[endsect] [/section:unstable_sort Unstable Sorting]
+
+[section:optimization Unused X86 optimization]
+
+Though the ideal ['max_splits] for `n < 1 million` (or so) on x86
+['seems] to be substantially larger, enabling a roughly 15% speedup for such tests,
+this optimization isn't general, and doesn't apply for `n > 1 million`.
+A too large ['max_splits] can cause sort to take more than twice as long,
+so it should be set on the low end of the reasonable range, where it is right now.
+
+[endsect] [/section:optimization Unused X86 optimization]
+
+[section:lookup Lookup Table?]
+
+The ideal way to optimize the constants would be to have a carefully-tuned
+lookup-table instead of the `get_max_count` function, but 4 tuning variables
+is simpler, `get_max_count` enforces worst-case performance minimization rules,
+and such a lookup table would be difficult to optimize
+for cross-platform performance.
+
+Alternatively, `get_max_count` could be used to generate a static lookup table.
+This hasn't been done due to concerns about cross-platform compatibility
+and flexibility.
+
+[endsect] [/section:lookup]
+
+[endsect] [/section:rationale Rationale]
+
+[endsect] [/section:sort_hpp Spreadsort]
+
+[section:definitions Definitions]
+
+[h4 stable sort]
+
+A sorting approach that preserves pre-existing order.
+If there are two elements with identical keys in a list that is later stably sorted,
+whichever came first in the initial list will come first in a stably sorted list.
+The algorithms provided here provide no such guarantee; items with identical keys
+will have arbitrary resulting order relative to each other.
+
+[endsect] [/section:definitions Definitions]
+
+[section:faq Frequently Asked Questions]
+
+There are no FAQs yet.
+
+[endsect] [/section:faq Frequently asked Questions]
+
+[section:acks Acknowledgements]
+
+* The author would like to thank his wife Mary for her patience and support
+during the long process of converting this from a piece of C code
+to a template library.
+
+* The author would also like to thank Phil Endecott and Frank Gennari
+for the improvements they've suggested and for testing.
+Without them this would have taken longer to develop or performed worse.
+
+* `float_mem_cast` was fixed to be safe and fast thanks to Scott McMurray.
+That fix was critical for a high-performance cross-platform __float_sort.
+
+* Thanks also for multiple helpful suggestions provided by Steven Watanabe,
+Edouard Alligand, and others.
+
+* Initial documentation was refactored to use Quickbook by Paul A. Bristow.
+
+[endsect] [/section:acknowledgements Acknowledgements]
+
+[section:bibliog Bibliography]
+
+[h4 Standard Template Library Sort Algorithms]
+
+[@http://www.cplusplus.com/reference/algorithm/sort/ C++ STL sort algorithms].
+
+[h4 Radix Sort]
+
+A type of algorithm that sorts based upon distribution instead of by comparison.
+Wikipedia has an article about Radix Sorting.
+A more detailed description of various Radix Sorting algorithms is provided here:
+
+Donald Knuth. The Art of Computer Programming,
+Volume 3: Sorting and Searching, Second Edition. Addison-Wesley, 1998.
+ISBN 0-201-89685-0. Section 5.2.5: Sorting by Distribution, pp.168-179.
+
+[h4 Introsort]
+
+A high-speed comparison-based sorting algorithm that takes ['[bigo](N * log(N))] time.
+See __introsort and
+Musser, David R. (1997). "Introspective Sorting and Selection Algorithms",
+Software: Practice and Experience (Wiley) 27 (8), pp 983-993,
+available at [@http://www.cs.rpi.edu/~musser/gp/introsort.ps Musser Introsort].
+
+[h4 American Flag Sort]
+
+A high-speed hybrid string sorting algorithm that __string_sort is partially based
+upon. See __american_flag and Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy. Engineering Radix Sort, Computing Systems 1993.
+
+[h4 Adaptive Left Radix (ARL)]
+
+ARL (Adaptive Left Radix) is a hybrid cache-friendly integer sorting algorithm
+with comparable speed on random data to __integer_sort,
+but does not have the optimizations for worst-case performance,
+causing it to perform poorly on certain types of unevenly distributed data.
+
+Arne Maus, [@http://www.nik.no/2002/Maus.pdf ARL, a faster in-place, cache friendly sorting algorithm],
+presented at NIK2002, Norwegian Informatics Conference, Kongsberg, 2002. Tapir, ISBN 82-91116-45-8.
+
+[h4 Original Spreadsort]
+
+The algorithm that __integer_sort was originally based on.
+__integer_sort uses a smaller number of key bits at a time for better cache efficiency
+than the method described in the paper.
+The importance of cache efficiency grew as CPU clock speeds increased
+while main memory latency stagnated.
+See Steven J. Ross,
+The Spreadsort High-performance General-case Sorting Algorithm,
+Parallel and Distributed Processing Techniques and Applications, Volume 3, pp.1100-1106. Las Vegas Nevada. 2002. See
+[@../../doc/papers/original_spreadsort06_2002.pdf Steven Ross spreadsort_2002].
+
+[endsect] [/section:bibliography Bibliography]
+
+[section:history History]
+
+* First release following review in Boost 1.58.
+
+* [@http://permalink.gmane.org/gmane.comp.lib.boost.devel/255194 Review of Boost.Sort/Spreadsort library]
+
+[endsect] [/section:history]
+
+[xinclude autodoc.xml] [/ Using Doxygen reference documentation.]
+
+[/Include the indexes (class, function and everything) ]
+'''
+ <index type="function_name">
+ <title>Function Index</title>
+ </index>
+
+ <index/>
+
+'''
+
+[/
+ Copyright (c) 2014 Steven Ross
+ Distributed under the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt
+ or copy at http://boost.org/LICENSE_1_0.txt)
+]
+
diff --git a/libs/sort/example/alrbreaker.cpp b/libs/sort/example/alrbreaker.cpp new file mode 100644 index 000000000..ab766db9f --- /dev/null +++ b/libs/sort/example/alrbreaker.cpp @@ -0,0 +1,78 @@ +// a sorting example that uses the worst-case for conventional MSD radix sorts.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+using namespace std;
+
+#define DATA_TYPE boost::uint64_t
+
+#define ALR_THRESHOLD 3
+
+const unsigned max_count = ALR_THRESHOLD - 1;
+const unsigned bit_shift = detail::rough_log_2_size(max_count) -
+ detail::int_log_mean_bin_size;
+const unsigned radix_threshold = detail::rough_log_2_size(max_count) + 1;
+//Increase this size if too fast to test accurately
+const unsigned top_splits = 12;
+
+const DATA_TYPE typed_one = 1;
+
+void
+fill_vector(vector<DATA_TYPE> & input, const DATA_TYPE base_value,
+ unsigned remaining_bits)
+{
+ if (remaining_bits >= radix_threshold) {
+ input.push_back((base_value << remaining_bits) +
+ ((typed_one << remaining_bits) - 1));
+ fill_vector(input, base_value << bit_shift, remaining_bits - bit_shift);
+ }
+ else {
+ for (unsigned u = 0; u < max_count; ++u)
+ input.push_back((base_value << remaining_bits) +
+ (rand() % (1 << remaining_bits)));
+ }
+}
+
+//Tests spreadsort on the worst-case distribution for standard MSD radix sorts.
+int main(int, const char **) {
+ vector<DATA_TYPE> input;
+ for (int ii = (1 << top_splits) - 1; ii >= 0; --ii)
+ fill_vector(input, ii, (sizeof(DATA_TYPE) * 8) - top_splits);
+
+ //Run both std::sort and spreadsort
+ for (unsigned u = 0; u < 2; ++u) {
+ vector<DATA_TYPE> array = input;
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (u)
+ std::sort(array.begin(), array.end());
+ else
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (u)
+ printf("std::sort elapsed time %f\n", elapsed / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", elapsed / CLOCKS_PER_SEC);
+ array.clear();
+ }
+ return 0;
+}
diff --git a/libs/sort/example/alreadysorted.cpp b/libs/sort/example/alreadysorted.cpp new file mode 100644 index 000000000..f0c756726 --- /dev/null +++ b/libs/sort/example/alreadysorted.cpp @@ -0,0 +1,91 @@ +// spreadsort fully sorted data example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ //Sorts the data once, then times sorting of already-sorted data
+ loopCount += 1;
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) // EOF or failure stops the reading
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else {
+ printf("call\n");
+ //integer_sort(&(array[0]), &(array[0]) + uCount);
+ integer_sort(array.begin(), array.end());
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ if (u)
+ total += elapsed;
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/binaryalrbreaker.cpp b/libs/sort/example/binaryalrbreaker.cpp new file mode 100644 index 000000000..15ac54629 --- /dev/null +++ b/libs/sort/example/binaryalrbreaker.cpp @@ -0,0 +1,108 @@ +// a sorting example that uses the worst-case distribution for spreadsort.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+using namespace std;
+
+#define DATA_TYPE boost::uint64_t
+
+#define ALR_THRESHOLD 3
+
+const unsigned max_count = ALR_THRESHOLD - 1;
+const unsigned bit_shift = detail::rough_log_2_size(max_count) -
+ detail::int_log_mean_bin_size;
+const unsigned radix_threshold = detail::rough_log_2_size(max_count) + 1;
+
+const DATA_TYPE typed_one = 1;
+
+void
+fill_vector(vector<DATA_TYPE> & input, const DATA_TYPE base_value,
+ unsigned remaining_bits, const vector<unsigned> & indices,
+ int index)
+{
+ if (index < 0) {
+ for (unsigned u = 0; u < max_count; ++u)
+ input.push_back((base_value << remaining_bits) +
+ (rand() % (1 << remaining_bits)));
+ }
+ else {
+ unsigned shift = indices[index];
+ fill_vector(input, (base_value << shift) + ((1 << shift) - 1),
+ remaining_bits - shift, indices, index - 1);
+ fill_vector(input, base_value << shift, remaining_bits - shift, indices,
+ index - 1);
+ }
+}
+
+//Generates a random index from 0 up to but not including count.
+unsigned
+get_index(unsigned count)
+{
+ unsigned result = unsigned((rand() % (1 << 16))*uint64_t(count)/(1 << 16));
+ if (result >= count)
+ return count - 1;
+ return result;
+}
+
+//Tests std::sort vs boost::sort::spreadsort on boost::sort's worst distribution.
+int main(int, const char **) {
+ unsigned total_length = sizeof(DATA_TYPE) * 8;
+ double std_sort_time = 0;
+ double spreadsort_time = 0;
+ for (int repetition = 0; repetition < 10; ++repetition) {
+ vector<DATA_TYPE> input;
+ vector<unsigned> offsets;
+ unsigned bit_length = total_length - radix_threshold;
+ unsigned bit_offset = bit_shift;
+ for (; bit_length >= ++bit_offset; bit_length -= bit_offset)
+ offsets.push_back(bit_offset);
+ for (int ii = (1 << bit_length) - 1; ii >= 0; --ii)
+ fill_vector(input, ii, total_length - bit_length,
+ offsets, offsets.size() - 1);
+
+ //Randomize the inputs slightly so they aren't in reverse-sorted order, for
+ //which std::sort is very fast.
+ for (unsigned u = 0; u < input.size() / 10; ++u)
+ std::swap(input[get_index(input.size())], input[get_index(input.size())]);
+
+ //Run both std::sort and boost::sort::spreadsort.
+ for (unsigned u = 0; u < 2; ++u) {
+ vector<DATA_TYPE> array = input;
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (u)
+ std::sort(array.begin(), array.end());
+ else
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (u)
+ std_sort_time += elapsed / CLOCKS_PER_SEC;
+ else
+ spreadsort_time += elapsed / CLOCKS_PER_SEC;
+ array.clear();
+ }
+ }
+
+ printf("std::sort elapsed time %f\n", std_sort_time);
+ printf("spreadsort elapsed time %f\n", spreadsort_time);
+ return 0;
+}
diff --git a/libs/sort/example/boostrandomgen.cpp b/libs/sort/example/boostrandomgen.cpp new file mode 100644 index 000000000..75e455757 --- /dev/null +++ b/libs/sort/example/boostrandomgen.cpp @@ -0,0 +1,69 @@ +// a random number generator supporting different distributions.
+//
+// Copyright Steven Ross 2009.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <stdio.h>
+#include "stdlib.h"
+#include <fstream>
+#include <iostream>
+#include <vector>
+#include <string>
+#include <boost/random.hpp>
+
+using namespace std;
+using namespace boost;
+
+int main(int argc, const char ** argv) {
+ //Always seed with the same value, to get the same results
+ srand(1);
+ //defaults
+ int mod_shift = 32;
+ unsigned count = 1000000;
+ //Reading in user arguments
+ if (argc > 2)
+ count = atoi(argv[2]);
+ if (argc > 1)
+ mod_shift = atoi(argv[1]) - 1;
+ std::ofstream ofile;
+ ofile.open("input.txt", std::ios_base::out | std::ios_base::binary |
+ std::ios_base::trunc);
+ if (ofile.bad()) {
+ printf("could not open input.txt for writing!\n");
+ return 1;
+ }
+ int min_int = (numeric_limits<int>::min)();
+ int max_int = (numeric_limits<int>::max)();
+ if (mod_shift < 31 && mod_shift >= 0) {
+ max_int %= 1 << mod_shift;
+ if (-max_int > min_int)
+ min_int = -max_int;
+ }
+ std::vector<int> result;
+ result.resize(count);
+ mt19937 rng;
+ if (argc > 3 && (string(argv[3]) == "-normal")) {
+ normal_distribution<> everything(0, max_int/4);
+ variate_generator<mt19937&,normal_distribution<> > gen(rng, everything);
+ generate(result.begin(), result.end(), gen);
+ }
+ else if (argc > 3 && (string(argv[3]) == "-lognormal")) {
+ lognormal_distribution<> everything(max_int/2, max_int/4);
+ variate_generator<mt19937&,lognormal_distribution<> > gen(rng, everything);
+ generate(result.begin(), result.end(), gen);
+ }
+ else {
+ uniform_int<> everything(min_int, max_int);
+ variate_generator<mt19937&,uniform_int<> > gen(rng, everything);
+ generate(result.begin(), result.end(), gen);
+ }
+ ofile.write(reinterpret_cast<char *>(&(result[0])), result.size() *
+ sizeof(int));
+ ofile.close();
+ return 0;
+}
diff --git a/libs/sort/example/caseinsensitive.cpp b/libs/sort/example/caseinsensitive.cpp new file mode 100644 index 000000000..63a785b10 --- /dev/null +++ b/libs/sort/example/caseinsensitive.cpp @@ -0,0 +1,101 @@ +// Example of sorting a struct using a case-insensitive string key.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/algorithm/string.hpp>
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+struct DATA_TYPE {
+ string a;
+};
+
+struct lessthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return boost::algorithm::ilexicographical_compare(x.a, y.a);
+ }
+};
+
+struct bracket {
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
+ return toupper(x.a[offset]);
+ }
+};
+
+struct getsize {
+ inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }
+};
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ indata >> inval.a;
+ while (!indata.eof() ) {
+ array.push_back(inval);
+ indata >> inval.a;
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end(), lessthan());
+ else
+ string_sort(array.begin(), array.end(), bracket(), getsize(), lessthan());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort)
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u].a << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/charstringsample.cpp b/libs/sort/example/charstringsample.cpp new file mode 100644 index 000000000..2ea864922 --- /dev/null +++ b/libs/sort/example/charstringsample.cpp @@ -0,0 +1,101 @@ +// Example of sorting structs with a string key and indexing functors.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+struct DATA_TYPE {
+ string a;
+ inline bool operator<(const DATA_TYPE &y) const { return a < y.a;}
+};
+
+
+struct bracket {
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
+ return x.a[offset];
+ }
+};
+
+struct getsize {
+ inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }
+};
+
+
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ indata >> inval.a;
+ while (!indata.eof() ) {
+ array.push_back(inval);
+ indata >> inval.a;
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort) {
+ std::sort(array.begin(), array.end());
+ } else {
+//[bracket_1
+ string_sort(array.begin(), array.end(), bracket(), getsize());
+//] [/bracket_1]
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ ofile << array[u].a << "\n";
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/double.cpp b/libs/sort/example/double.cpp new file mode 100644 index 000000000..81f236ca8 --- /dev/null +++ b/libs/sort/example/double.cpp @@ -0,0 +1,105 @@ +// spreadsort double sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE double
+#define CAST_TYPE boost::int64_t
+
+//Pass in an argument to test std::sort
+//Note that this converts NaNs and -0.0 to 0.0, so that sorting results are
+//identical every time
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Using this to support compilers that don't support 64-bit constants
+ CAST_TYPE exponent_mask = 0x7ff00000;
+ exponent_mask <<= 32;
+ CAST_TYPE top_exponent_bit = 0x40000000;
+ top_exponent_bit <<= 32;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) {
+ input.read(reinterpret_cast<char *>(&(array[v])), uSize );
+ //Checking for denormalized numbers
+ if (!(float_mem_cast<DATA_TYPE, CAST_TYPE>(array[v]) & exponent_mask)) {
+ //Make the top exponent bit high
+ CAST_TYPE temp = top_exponent_bit |
+ float_mem_cast<DATA_TYPE, CAST_TYPE>(array[v]);
+ memcpy(&(array[v]), &temp, sizeof(DATA_TYPE));
+ }
+ //Testcase doesn't sort NaNs; they just cause confusion
+ if (!(array[v] < 0.0) && !(0.0 < array[v]))
+ array[v] = 0.0;
+ ++v;
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //float_sort(&(array[0]), &(array[0]) + uCount);
+ float_sort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/floatfunctorsample.cpp b/libs/sort/example/floatfunctorsample.cpp new file mode 100644 index 000000000..461f6b9f0 --- /dev/null +++ b/libs/sort/example/floatfunctorsample.cpp @@ -0,0 +1,138 @@ +// spreadsort float functor sorting example.
+//
+// Copyright Steven Ross 2009.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+// Caution: this file contains Quickbook markup as well as code
+// and comments, don't change any of the special comment markups!
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+
+using namespace boost::sort::spreadsort;
+
+//[float_functor_types
+#define CAST_TYPE int
+#define KEY_TYPE float
+//] [/float_functor_types]
+
+
+//[float_functor_datatypes
+struct DATA_TYPE {
+ KEY_TYPE key;
+ std::string data;
+};
+//] [/float_functor_datatypes]
+
+
+//[float_functor_rightshift
+// Casting to an integer before bitshifting
+struct rightshift {
+ int operator()(const DATA_TYPE &x, const unsigned offset) const {
+ return float_mem_cast<KEY_TYPE, CAST_TYPE>(x.key) >> offset;
+ }
+};
+//] [/float_functor_rightshift]
+
+//[float_functor_lessthan
+struct lessthan {
+ bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return x.key < y.key;
+ }
+};
+//] [/float_functor_lessthan]
+
+// Pass in an argument to test std::sort
+// Note that this converts NaNs and -0.0 to 0.0, so that sorting results are
+// identical every time
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) {
+ input.read(reinterpret_cast<char *>(&(array[v].key)),
+ sizeof(array[v].key));
+ //Checking for denormalized numbers; float_sort looks too fast on them.
+ if (!(float_mem_cast<KEY_TYPE, CAST_TYPE>(array[v].key) & 0x7f800000)) {
+ //Make the top exponent bit high
+ CAST_TYPE temp = 0x40000000 |
+ float_mem_cast<KEY_TYPE, CAST_TYPE>(array[v].key);
+ memcpy(&(array[v].key), &temp, sizeof(KEY_TYPE));
+ }
+ //Testcase doesn't sort NaNs; they just cause confusion
+ if (!(array[v].key < 0.0) && !(0.0 < array[v].key))
+ array[v].key = 0.0;
+ //Adding the data, in this case a string
+ std::stringstream intstr;
+ intstr << array[v].key;
+ array[v].data = intstr.str();
+ ++v;
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end(), lessthan());
+ else
+ float_sort(array.begin(), array.end(), rightshift(), lessthan());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v].key)),
+ sizeof(array[v].key));
+ ofile << array[v].data;
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/floatsample.cpp b/libs/sort/example/floatsample.cpp new file mode 100644 index 000000000..1243117f9 --- /dev/null +++ b/libs/sort/example/floatsample.cpp @@ -0,0 +1,100 @@ +// spreadsort float sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE float
+#define CAST_TYPE int
+
+//Pass in an argument to test std::sort
+//Note that this converts NaNs and -0.0 to 0.0, so that sorting results are
+//identical every time
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) {
+ input.read(reinterpret_cast<char *>(&(array[v])), uSize );
+ //Checking for denormalized numbers
+ if (!(float_mem_cast<float, int>(array[v]) & 0x7f800000)) {
+ //Make the top exponent bit high
+ CAST_TYPE temp = 0x40000000 | float_mem_cast<float, int>(array[v]);
+ memcpy(&(array[v]), &temp, sizeof(DATA_TYPE));
+ }
+ //Testcase doesn't sort NaNs; they just cause confusion
+ if (!(array[v] < 0.0) && !(0.0 < array[v]))
+ array[v] = 0.0;
+ ++v;
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //boost::sort::spreadsort::spreadsort(&(array[0]), &(array[0]) + uCount);
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ input.close();
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/generalizedstruct.cpp b/libs/sort/example/generalizedstruct.cpp new file mode 100644 index 000000000..a8d4bd789 --- /dev/null +++ b/libs/sort/example/generalizedstruct.cpp @@ -0,0 +1,192 @@ +// This example shows how to sort structs using complex multiple part keys using
+// string_sort.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <boost/sort/spreadsort/float_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+//[generalized_functors
+struct DATA_TYPE {
+ time_t birth;
+ float net_worth;
+ string first_name;
+ string last_name;
+};
+
+static const int birth_size = sizeof(time_t);
+static const int first_name_offset = birth_size + sizeof(float);
+static const boost::uint64_t base_mask = 0xff;
+
+struct lessthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ if (x.birth != y.birth) {
+ return x.birth < y.birth;
+ }
+ if (x.net_worth != y.net_worth) {
+ return x.net_worth < y.net_worth;
+ }
+ if (x.first_name != y.first_name) {
+ return x.first_name < y.first_name;
+ }
+ return x.last_name < y.last_name;
+ }
+};
+
+struct bracket {
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
+ // Sort date as a signed int, returning the appropriate byte.
+ if (offset < birth_size) {
+ const int bit_shift = 8 * (birth_size - offset - 1);
+ unsigned char result = (x.birth & (base_mask << bit_shift)) >> bit_shift;
+ // Handling the sign bit. Unnecessary if the data is always positive.
+ if (offset == 0) {
+ return result ^ 128;
+ }
+
+ return result;
+ }
+
+ // Sort a signed float. This requires reversing the order of negatives
+ // because of the way floats are represented in bits.
+ if (offset < first_name_offset) {
+ const int bit_shift = 8 * (first_name_offset - offset - 1);
+ unsigned key = float_mem_cast<float, unsigned>(x.net_worth);
+ unsigned char result = (key & (base_mask << bit_shift)) >> bit_shift;
+ // Handling the sign.
+ if (x.net_worth < 0) {
+ return 255 - result;
+ }
+ // Increasing positives so they are higher than negatives.
+ if (offset == birth_size) {
+ return 128 + result;
+ }
+
+ return result;
+ }
+
+ // Sort a string that is before the end. This approach supports embedded
+ // nulls. If embedded nulls are not required, then just delete the "* 2"
+ // and the inside of the following if just becomes:
+ // return x.first_name[offset - first_name_offset];
+ const unsigned first_name_end_offset =
+ first_name_offset + x.first_name.size() * 2;
+ if (offset < first_name_end_offset) {
+ int char_offset = offset - first_name_offset;
+ // This signals that the string continues.
+ if (!(char_offset & 1)) {
+ return 1;
+ }
+ return x.first_name[char_offset >> 1];
+ }
+
+ // This signals that the string has ended, so that shorter strings come
+ // before longer ones.
+ if (offset == first_name_end_offset) {
+ return 0;
+ }
+
+ // The final string needs no special consideration.
+ return x.last_name[offset - first_name_end_offset - 1];
+ }
+};
+
+struct getsize {
+ inline size_t operator()(const DATA_TYPE &x) const {
+ return first_name_offset + x.first_name.size() * 2 + 1 +
+ x.last_name.size();
+ }
+};
+//] [/generalized_functors]
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+
+ // Read in the data.
+ DATA_TYPE inval;
+ while (!indata.eof() ) {
+ indata >> inval.first_name;
+ indata >> inval.last_name;
+ indata.read(reinterpret_cast<char *>(&(inval.birth)), birth_size);
+ indata.read(reinterpret_cast<char *>(&(inval.net_worth)), sizeof(float));
+ // Handling nan.
+ if (inval.net_worth != inval.net_worth) {
+ inval.net_worth = 0;
+ }
+ if (indata.eof())
+ break;
+ array.push_back(inval);
+ }
+ indata.close();
+
+ // Sort the data.
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort) {
+ std::sort(array.begin(), array.end(), lessthan());
+ } else {
+//[generalized_functors_call
+ string_sort(array.begin(), array.end(), bracket(), getsize(), lessthan());
+//] [/generalized_functors_call]
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort) {
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ } else {
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ }
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u].birth << " " << array[u].net_worth << " "
+ << array[u].first_name << " " << array[u].last_name << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort) {
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ } else {
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ }
+ return 0;
+}
diff --git a/libs/sort/example/int64.cpp b/libs/sort/example/int64.cpp new file mode 100644 index 000000000..272fd66ff --- /dev/null +++ b/libs/sort/example/int64.cpp @@ -0,0 +1,93 @@ +// spreadsort 64-bit integer sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+//[int64bit_1
+#define DATA_TYPE boost::int64_t
+//] [/int64bit_1]
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount)
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ if (v < uCount)
+ array.resize(v);
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //boost::sort::spreadsort::spreadsort(&(array[0]), &(array[0]) + uCount);
+//[int64bit_2
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+//] [/int64bit_2]
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ input.close();
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/keyplusdatasample.cpp b/libs/sort/example/keyplusdatasample.cpp new file mode 100644 index 000000000..d5d819374 --- /dev/null +++ b/libs/sort/example/keyplusdatasample.cpp @@ -0,0 +1,107 @@ +// spreadsort key and data sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+struct DATA_TYPE {
+ int key;
+ std::string data;
+ };
+//functor example
+struct lessthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return x.key < y.key;
+ }
+};
+
+struct rightshift {
+ inline int operator()(const DATA_TYPE &x, const unsigned offset) {
+ return x.key >> offset;
+ }
+};
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uSize = sizeof(int);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ array.reserve(length/uSize);
+ unsigned uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ unsigned v = 0;
+ while (input.good() && v++ < uCount) { // EOF or failure stops the reading
+ DATA_TYPE element;
+ input.read(reinterpret_cast<char *>(&(element.key)), sizeof(element.key));
+ std::stringstream intstr;
+ intstr << element.key;
+ element.data = intstr.str();
+ array.push_back(element);
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end(), lessthan());
+ else
+ integer_sort(array.begin(), array.end(), rightshift(), lessthan());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v].key)),
+ sizeof(array[v].key));
+ ofile << array[v].data;
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ input.close();
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/mostlysorted.cpp b/libs/sort/example/mostlysorted.cpp new file mode 100644 index 000000000..34e6e87ed --- /dev/null +++ b/libs/sort/example/mostlysorted.cpp @@ -0,0 +1,100 @@ +// spreadsort on a mostly sorted array example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+unsigned
+get_index(unsigned count)
+{
+ unsigned result = unsigned((rand() % (1 << 16))*uint64_t(count)/(1 << 16));
+ if (result >= count || result < 0)
+ result = count - 1;
+ return result;
+}
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ srand(1);
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ //Sorts the data once, then times sorting of already-sorted data
+ loopCount += 1;
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) // EOF or failure stops the reading
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ for (unsigned v = 0; v < uCount/10; ++v)
+ std::swap(array[get_index(uCount)], array[get_index(uCount)]);
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //integer_sort(&(array[0]), &(array[0]) + uCount);
+ integer_sort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ if (u)
+ total += elapsed;
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/parallelint.cpp b/libs/sort/example/parallelint.cpp new file mode 100644 index 000000000..b925f494f --- /dev/null +++ b/libs/sort/example/parallelint.cpp @@ -0,0 +1,115 @@ +// Benchmark for integer sorting speed across parallel threads.
+//
+// Copyright Steven Ross 2014
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <boost/thread.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+bool is_sorted(const std::vector<DATA_TYPE> &array) {
+ for (unsigned u = 0; u + 1 < array.size(); ++u) {
+ if (array[u] > array[u + 1]) {
+ return false;
+ }
+ }
+ return true;
+}
+
+void sort_loop(const std::vector<DATA_TYPE> &base_array, bool stdSort,
+ unsigned loopCount) {
+ std::vector<DATA_TYPE> array(base_array);
+ for (unsigned u = 0; u < loopCount; ++u) {
+ for (unsigned v = 0; v < base_array.size(); ++v) {
+ array[v] = base_array[v];
+ }
+ if (stdSort)
+ std::sort(array.begin(), array.end());
+ else
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ if (!is_sorted(array)) {
+ fprintf(stderr, "sort failed!\n");
+ exit(1);
+ }
+ }
+}
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ int threadCount = -1;
+ unsigned loopCount = 0;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else if(threadCount < 0)
+ threadCount = atoi(argv[u]);
+ else
+ loopCount = atoi(argv[u]);
+ }
+ if (!loopCount) {
+ loopCount = 1;
+ }
+ printf("threads: %d loops: %d\n", threadCount, loopCount);
+
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ std::vector<DATA_TYPE> base_array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ base_array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount)
+ input.read(reinterpret_cast<char *>(&(base_array[v++])), uSize );
+ input.close();
+ if (v < uCount)
+ base_array.resize(v);
+ //Run multiple loops, if requested
+ clock_t start, end;
+ double elapsed;
+ std::vector<boost::thread *> workers;
+ start = clock();
+ if (threadCount == 0) {
+ sort_loop(base_array, stdSort, loopCount);
+ } else {
+ for (int i = 0; i < threadCount; ++i) {
+ workers.push_back(new boost::thread(sort_loop, base_array, stdSort,
+ loopCount));
+ }
+ for (int i = 0; i < threadCount; ++i) {
+ workers[i]->join();
+ delete workers[i];
+ }
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+
+ if (stdSort)
+ printf("std::sort clock time %lf\n", elapsed/CLOCKS_PER_SEC/threadCount);
+ else
+ printf("spreadsort clock time %lf\n", elapsed/CLOCKS_PER_SEC/threadCount);
+ return 0;
+}
diff --git a/libs/sort/example/parallelstring.cpp b/libs/sort/example/parallelstring.cpp new file mode 100644 index 000000000..f710802bf --- /dev/null +++ b/libs/sort/example/parallelstring.cpp @@ -0,0 +1,143 @@ +// Benchmark for integer sorting speed across parallel threads.
+//
+// Copyright Steven Ross 2014
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/random/mersenne_twister.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <boost/thread.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE string
+
+static bool is_sorted(const std::vector<DATA_TYPE> &array) {
+ for (unsigned u = 0; u + 1 < array.size(); ++u) {
+ if (array[u] > array[u + 1]) {
+ return false;
+ }
+ }
+ return true;
+}
+
+static void sort_core(std::vector<DATA_TYPE> &array, bool stdSort,
+ unsigned loopCount) {
+ if (stdSort)
+ std::sort(array.begin(), array.end());
+ else
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ if (!is_sorted(array)) {
+ fprintf(stderr, "sort failed!\n");
+ exit(1);
+ }
+}
+
+static void sort_loop(const std::vector<DATA_TYPE> &base_array, bool stdSort,
+ unsigned loopCount) {
+ std::vector<DATA_TYPE> array(base_array);
+ for (unsigned u = 0; u < loopCount; ++u) {
+ for (unsigned v = 0; v < base_array.size(); ++v) {
+ array[v] = base_array[v];
+ }
+ sort_core(array, stdSort, loopCount);
+ }
+}
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ int constant_to_random_ratio = -1;
+ int threadCount = -1;
+ unsigned loopCount = 0;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else if(threadCount < 0)
+ threadCount = atoi(argv[u]);
+ else if (!loopCount)
+ loopCount = atoi(argv[u]);
+ else
+ constant_to_random_ratio = atoi(argv[u]);
+ }
+ if (!loopCount) {
+ loopCount = 1;
+ }
+ printf("threads: %d loops: %d\n", threadCount, loopCount);
+
+ std::vector<DATA_TYPE> base_array;
+ if (constant_to_random_ratio >= 0) {
+ //Test for random data with gaps of identical data.
+ random::mt19937 generator;
+ random::uniform_int_distribution<int> distribution(0,255);
+ const int constant_to_random_count = 1000000;
+ const int string_length = 1000;
+ for (int i = 0; i < constant_to_random_count; ++i) {
+ DATA_TYPE temp(string_length, 'x'); // fill with default character.
+ for (int j = constant_to_random_ratio; j < string_length;) {
+ int val = distribution(generator);
+ temp[j] = val;
+ j += (val * constant_to_random_ratio)/128 + 1;
+ }
+ base_array.push_back(temp);
+ }
+ } else {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ while (!indata.eof() ) {
+ indata >> inval;
+ base_array.push_back(inval);
+ }
+ }
+
+ // Sort the input
+ clock_t start, end;
+ double elapsed;
+ std::vector<boost::thread *> workers;
+ start = clock();
+ if (threadCount == 0) {
+ if (loopCount > 1) {
+ sort_loop(base_array, stdSort, loopCount);
+ } else {
+ sort_core(base_array, stdSort, loopCount);
+ }
+ threadCount = 1;
+ } else {
+ for (int i = 0; i < threadCount; ++i) {
+ workers.push_back(new boost::thread(sort_loop, base_array, stdSort,
+ loopCount));
+ }
+ for (int i = 0; i < threadCount; ++i) {
+ workers[i]->join();
+ delete workers[i];
+ }
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+
+ printf("for %lu strings\n", base_array.size());
+ if (stdSort)
+ printf("std::sort clock time %lf\n", elapsed/CLOCKS_PER_SEC/threadCount);
+ else
+ printf("spreadsort clock time %lf\n", elapsed/CLOCKS_PER_SEC/threadCount);
+ return 0;
+}
diff --git a/libs/sort/example/randomgen.cpp b/libs/sort/example/randomgen.cpp new file mode 100644 index 000000000..661435ecf --- /dev/null +++ b/libs/sort/example/randomgen.cpp @@ -0,0 +1,69 @@ +// flexible random number generator providing multiple distributions.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/random/mersenne_twister.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <stdio.h>
+#include "stdlib.h"
+#include <fstream>
+#include <iostream>
+using namespace boost;
+
+int main(int argc, const char ** argv) {
+ random::mt19937 generator;
+ random::uniform_int_distribution<unsigned> distribution;
+ //defaults
+ unsigned high_shift = 16;
+ unsigned low_shift = 16;
+ unsigned count = 1000000;
+ //Reading in user arguments
+ if (argc > 1)
+ high_shift = atoi(argv[1]);
+ if (argc > 2)
+ low_shift = atoi(argv[2]);
+ if (argc > 3)
+ count = atoi(argv[3]);
+ if (high_shift > 16)
+ high_shift = 16;
+ if (low_shift > 16)
+ low_shift = 16;
+ std::ofstream ofile;
+ ofile.open("input.txt", std::ios_base::out | std::ios_base::binary |
+ std::ios_base::trunc);
+ if (ofile.bad()) {
+ printf("could not open input.txt for writing!\n");
+ return 1;
+ }
+ //buffering file output for speed
+ unsigned uDivideFactor = 1000;
+ //Skipping buffering for small files
+ if (count < uDivideFactor * 100)
+ uDivideFactor = count;
+ unsigned * pNumbers = static_cast<unsigned *>(malloc(uDivideFactor *
+ sizeof(unsigned)));
+ //Generating semirandom numbers
+ unsigned mask = 0;
+ unsigned one = 1;
+ for (unsigned u = 0; u < low_shift; ++u) {
+ mask += one << u;
+ }
+ for (unsigned u = 0; u < high_shift; ++u) {
+ mask += one << (16 + u);
+ }
+ for (unsigned u = 0; u < count/uDivideFactor; ++u) {
+ unsigned i = 0;
+ for (; i< uDivideFactor; ++i) {
+ pNumbers[i] = distribution(generator) & mask;
+ }
+ ofile.write(reinterpret_cast<char *>(pNumbers), uDivideFactor * 4 );
+ }
+ ofile.close();
+ return 0;
+}
diff --git a/libs/sort/example/reverseintsample.cpp b/libs/sort/example/reverseintsample.cpp new file mode 100644 index 000000000..fe31edf8c --- /dev/null +++ b/libs/sort/example/reverseintsample.cpp @@ -0,0 +1,101 @@ +//! \file
+//! \brief integer sort with a rightshift functor reverse sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+// Caution: this file contains Quickbook markup as well as code
+// and comments, don't change any of the special comment markups!
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <iostream>
+#include <functional>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+struct negrightshift {
+ inline int operator()(const int &x, const unsigned offset) {
+ return -(x >> offset);
+ }
+};
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount)
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ if (v < uCount)
+ array.resize(v);
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+
+//[reverse_int_1
+ std::sort(array.begin(), array.end(), std::greater<DATA_TYPE>());
+//] [/reverse_int_1]
+ else
+//[reverse_int_2
+ integer_sort(array.begin(), array.end(), negrightshift(), std::greater<DATA_TYPE>());
+//] [/reverse_int_2]
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]));
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/reversestringfunctorsample.cpp b/libs/sort/example/reversestringfunctorsample.cpp new file mode 100644 index 000000000..62c6c9491 --- /dev/null +++ b/libs/sort/example/reversestringfunctorsample.cpp @@ -0,0 +1,112 @@ +// spreadsort string functor reverse sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+struct DATA_TYPE {
+ string a;
+ };
+
+struct greaterthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return x.a > y.a;
+ }
+};
+
+struct bracket {
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
+ return x.a[offset];
+ }
+};
+
+struct getsize {
+ inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }
+};
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (!indata) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ indata >> inval.a;
+ while (!indata.eof() ) {
+ array.push_back(inval);
+ //Inserting embedded nulls and empty strings
+ if (!(array.size() % 100)) {
+ if (inval.a.empty() || !(array.size() % 1000)) {
+ inval.a = "";
+ array.push_back(inval);
+ }
+ else {
+ inval.a[0] = '\0';
+ array.push_back(inval);
+ }
+ }
+ indata >> inval.a;
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end(), greaterthan());
+ else
+ reverse_string_sort(array.begin(), array.end(), bracket(), getsize(),
+ greaterthan());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort)
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u].a << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/reversestringsample.cpp b/libs/sort/example/reversestringsample.cpp new file mode 100644 index 000000000..89cf9c1e8 --- /dev/null +++ b/libs/sort/example/reversestringsample.cpp @@ -0,0 +1,98 @@ +// spreadsort reverse string sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE string
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (!indata) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ indata >> inval;
+ while (!indata.eof() ) {
+ //testing substrings
+ if (!(array.size() % 2))
+ inval = "prefix" + inval;
+ else
+ inval += "suffix";
+ array.push_back(inval);
+ //Inserting embedded nulls and empty strings
+ if (!(array.size() % 100)) {
+ if (inval.empty() || !(array.size() % 1000))
+ array.push_back("");
+ else {
+ inval[0] = '\0';
+ array.push_back(inval);
+ }
+ }
+ indata >> inval;
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end(), std::greater<string>());
+ else
+ //string_sort(&(array[0]), &(array[0]) + uCount);
+ reverse_string_sort(array.begin(), array.end(), std::greater<string>());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort)
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u] << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/rightshiftsample.cpp b/libs/sort/example/rightshiftsample.cpp new file mode 100644 index 000000000..91cebc31c --- /dev/null +++ b/libs/sort/example/rightshiftsample.cpp @@ -0,0 +1,98 @@ +//! \brief Integer sort with a rightshift functor sorting example.
+//! \file
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+// Caution: this file contains Quickbook markup as well as code
+// and comments, don't change any of the special comment markups!
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+//[rightshift_int_functor
+struct rightshift {
+ inline int operator()(DATA_TYPE x, unsigned offset) { return x >> offset; }
+};
+//] [/rightshift_int_functor]
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount)
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ if (v < uCount)
+ array.resize(v);
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort) {
+ std::sort(array.begin(), array.end());
+ } else {
+//[rightshift_1
+ integer_sort(array.begin(), array.end(), rightshift());
+//] [/rightshift_1]
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/sample.cpp b/libs/sort/example/sample.cpp new file mode 100644 index 000000000..9d7b75189 --- /dev/null +++ b/libs/sort/example/sample.cpp @@ -0,0 +1,88 @@ +// spreadsort sorting example
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE int
+
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount)
+ input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
+ if (v < uCount)
+ array.resize(v);
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end());
+ else
+ boost::sort::spreadsort::spreadsort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ input.close();
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/shiftfloatsample.cpp b/libs/sort/example/shiftfloatsample.cpp new file mode 100644 index 000000000..5488688c9 --- /dev/null +++ b/libs/sort/example/shiftfloatsample.cpp @@ -0,0 +1,107 @@ +// float_sort rightshift functor sorting example
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <iostream>
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE float
+#define CAST_TYPE int
+
+//Casting to an integer before bitshifting
+struct rightshift {
+ inline int operator()(const DATA_TYPE &x, const unsigned offset) const {
+ return float_mem_cast<DATA_TYPE, int>(x) >> offset;
+ }
+};
+
+
+//Pass in an argument to test std::sort
+//Note that this converts NaNs and -0.0 to 0.0, so that sorting results are
+//identical every time
+int main(int argc, const char ** argv) {
+ size_t uCount,uSize=sizeof(DATA_TYPE);
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (input.fail()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ //Conversion to a vector
+ array.resize(uCount);
+ unsigned v = 0;
+ while (input.good() && v < uCount) {
+ input.read(reinterpret_cast<char *>(&(array[v])), uSize );
+ //Testcase doesn't sort NaNs; they just cause confusion
+ if (!(array[v] < 0.0) && !(0.0 < array[v]))
+ array[v] = 0.0;
+ //Checking for denormalized numbers
+ if (!(float_mem_cast<float, int>(array[v]) & 0x7f800000)) {
+ //Make the top exponent bit high
+ CAST_TYPE temp = 0x40000000 | float_mem_cast<float, int>(array[v]);
+ memcpy(&(array[v]), &temp, sizeof(DATA_TYPE));
+ }
+ ++v;
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //float_sort(&(array[0]), &(array[0]) + uCount, rightshift());
+ float_sort(array.begin(), array.end(), rightshift());
+ end = clock();
+ elapsed = static_cast<double>(end - start) ;
+ std::ofstream ofile;
+ if (stdSort)
+ ofile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ ofile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (ofile.good()) {
+ for (unsigned v = 0; v < array.size(); ++v) {
+ ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/example/stringfunctorsample.cpp b/libs/sort/example/stringfunctorsample.cpp new file mode 100644 index 000000000..d785814b5 --- /dev/null +++ b/libs/sort/example/stringfunctorsample.cpp @@ -0,0 +1,127 @@ +//! \brief spreadsort string functor sorting example.
+//! \file
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+// Caution: this file contains Quickbook markup as well as code
+// and comments, don't change any of the special comment markups!
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+struct DATA_TYPE {
+ string a;
+};
+
+//[lessthan_functor
+
+struct lessthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return x.a < y.a;
+ }
+};
+//] [/lessthan_functor]
+
+//[bracket_functor
+struct bracket {
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
+ return x.a[offset];
+ }
+};
+//] [/bracket_functor]
+
+//[getsize_functor
+struct getsize {
+ inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }
+};
+//] [/getsize_functor]
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ indata >> inval.a;
+ while (!indata.eof() ) {
+ array.push_back(inval);
+ //Inserting embedded nulls and empty strings
+ if (!(array.size() % 100)) {
+ if (inval.a.empty() || !(array.size() % 1000)) {
+ inval.a = "";
+ array.push_back(inval);
+ }
+ else {
+ inval.a[0] = '\0';
+ array.push_back(inval);
+ }
+ }
+ indata >> inval.a;
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort) {
+ std::sort(array.begin(), array.end(), lessthan());
+ } else {
+//[stringsort_functors_call
+ string_sort(array.begin(), array.end(), bracket(), getsize(), lessthan());
+//] [/stringsort_functors_call]
+ }
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort) {
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ } else {
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ }
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u].a << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort) {
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ } else {
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ }
+ return 0;
+}
diff --git a/libs/sort/example/stringsample.cpp b/libs/sort/example/stringsample.cpp new file mode 100644 index 000000000..17299d113 --- /dev/null +++ b/libs/sort/example/stringsample.cpp @@ -0,0 +1,85 @@ +// spreadsort string sorting example.
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::string;
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE string
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ DATA_TYPE inval;
+ while (!indata.eof() ) {
+ indata >> inval;
+ array.push_back(inval);
+ }
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //string_sort(&(array[0]), &(array[0]) + uCount);
+ string_sort(array.begin(), array.end());
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort)
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u)
+ outfile << array[u] << "\n";
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
+
+
diff --git a/libs/sort/example/wstringsample.cpp b/libs/sort/example/wstringsample.cpp new file mode 100644 index 000000000..064bc9ace --- /dev/null +++ b/libs/sort/example/wstringsample.cpp @@ -0,0 +1,96 @@ +// spreadsort wstring sorting example
+//
+// Copyright Steven Ross 2009-2014.
+//
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <algorithm>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <string>
+using std::wstring;
+using namespace boost::sort::spreadsort;
+
+#define DATA_TYPE wstring
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ std::ifstream indata;
+ std::ofstream outfile;
+ bool stdSort = false;
+ unsigned loopCount = 1;
+ for (int u = 1; u < argc; ++u) {
+ if (std::string(argv[u]) == "-std")
+ stdSort = true;
+ else
+ loopCount = atoi(argv[u]);
+ }
+ double total = 0.0;
+ //Run multiple loops, if requested
+ std::vector<DATA_TYPE> array;
+ for (unsigned u = 0; u < loopCount; ++u) {
+ indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
+ if (indata.bad()) {
+ printf("input.txt could not be opened\n");
+ return 1;
+ }
+ unsigned short inval;
+ DATA_TYPE current;
+ while (indata.good()) {
+ indata.read(reinterpret_cast<char *>(&inval), sizeof(inval));
+ current.push_back(inval);
+ //32 characters is a moderately long string
+ if (static_cast<int>(current.size()) > inval || current.size() >= 32) {
+ array.push_back(current);
+ current.clear();
+ }
+ }
+ //adding the last string
+ if (!current.empty())
+ array.push_back(current);
+
+ indata.close();
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ wchar_t cast_type = 0;
+ if (stdSort)
+ //std::sort(&(array[0]), &(array[0]) + uCount);
+ std::sort(array.begin(), array.end());
+ else
+ //string_sort(&(array[0]), &(array[0]) + uCount, cast_type);
+ string_sort(array.begin(), array.end(), cast_type);
+ end = clock();
+ elapsed = static_cast<double>(end - start);
+ if (stdSort)
+ outfile.open("standard_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ else
+ outfile.open("boost_sort_out.txt", std::ios_base::out |
+ std::ios_base::binary | std::ios_base::trunc);
+ if (outfile.good()) {
+ for (unsigned u = 0; u < array.size(); ++u){
+ for (unsigned v = 0; v < array[u].size(); ++v)
+ outfile << array[u][v];
+ outfile << "\n";
+ }
+ outfile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ if (stdSort)
+ printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ else
+ printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
+ return 0;
+}
diff --git a/libs/sort/index.html b/libs/sort/index.html new file mode 100644 index 000000000..c285ee5de --- /dev/null +++ b/libs/sort/index.html @@ -0,0 +1,15 @@ +<!-- Automatic redirection to Quickbook/Doxygen version of documentation. -->
+<html>
+<head>
+<meta http-equiv="refresh" content="0; URL=doc/html/index.html">
+</head>
+<body>
+Automatic redirection failed, please go to
+<a href="doc/html/index.html">doc/html/index.html</a>
+ <hr>
+<p>© Copyright Steven Ross 2009-2014</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+</body>
+</html>
diff --git a/libs/sort/meta/libraries.json b/libs/sort/meta/libraries.json new file mode 100644 index 000000000..18c676de2 --- /dev/null +++ b/libs/sort/meta/libraries.json @@ -0,0 +1,17 @@ +[ + { + "key": "sort", + "name": "Sort", + "authors": [ + "Steven Ross" + ], + "maintainers": [ + "Steven Ross <spreadsort -at- gmail.com>" + ], + "description": + "High-performance templated sort functions.", + "category": [ + "Algorithms" + ] + } +] diff --git a/libs/sort/test/Jamfile.v2 b/libs/sort/test/Jamfile.v2 new file mode 100644 index 000000000..32c1815c7 --- /dev/null +++ b/libs/sort/test/Jamfile.v2 @@ -0,0 +1,25 @@ +# Boost sorting_algo library test suite Jamfile ----------------------------
+#
+# Copyright Steven Ross 2009. Use, modification and
+# distribution is subject to the Boost Software License, Version
+# 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+#
+# See http://www.boost.org/libs/sort for library home page.
+
+import testing ;
+
+{
+ test-suite "sort"
+ : [ run integer_sort_test.cpp
+ : : : : integer_sort ]
+ [ run float_sort_test.cpp
+ : : : : float_sort ]
+ [ run string_sort_test.cpp
+ : : : : string_sort ]
+ [ run sort_detail_test.cpp
+ : : : : sort_detail ]
+
+
+ ;
+}
diff --git a/libs/sort/test/float_sort_test.cpp b/libs/sort/test/float_sort_test.cpp new file mode 100644 index 000000000..2e0f92a96 --- /dev/null +++ b/libs/sort/test/float_sort_test.cpp @@ -0,0 +1,126 @@ +// Boost Sort library float_sort_test.cpp file -----------------------------//
+
+// Copyright Steven Ross 2014. Use, modification and
+// distribution is subject to the Boost Software License, Version
+// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/spreadsort.hpp>
+// Include unit test framework
+#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/test_tools.hpp>
+#include <vector>
+
+
+using namespace std;
+using namespace boost::sort::spreadsort;
+
+//Casting to an integer before bitshifting
+struct rightshift {
+ int operator()(const float &x, const unsigned offset) const {
+ return float_mem_cast<float, int>(x) >> offset;
+ }
+};
+
+struct rightshift_64 {
+ boost::int64_t operator()(const double &x, const boost::uint64_t offset) const
+ {
+ return float_mem_cast<double, boost::int64_t>(x) >> offset;
+ }
+};
+
+boost::int32_t
+rand_32(bool sign = true) {
+ boost::int32_t result = rand() | (rand()<< 16);
+ if (rand() % 2)
+ result |= 1 << 15;
+ //Adding the sign bit
+ if (sign && (rand() % 2))
+ result *= -1;
+ return result;
+}
+
+static const unsigned input_count = 100000;
+
+void float_test()
+{
+ // Prepare inputs
+ vector<float> base_vec;
+
+ //Generating semirandom numbers that will work for basic testing
+ for (unsigned u = 0; u < input_count; ++u) {
+ float val = float(rand_32());
+ //As std::sort gives arbitrary results for NaNs and 0.0 vs. -0.0, treat all
+ //those as just 0.0 for testing
+ if (!(val < 0.0) && !(0.0 < val))
+ base_vec.push_back(0.0);
+ else
+ base_vec.push_back(val);
+ }
+ vector<float> sorted_vec = base_vec;
+ vector<float> test_vec = base_vec;
+ std::sort(sorted_vec.begin(), sorted_vec.end());
+ //Testing boost::sort::spreadsort version
+ test_vec = base_vec;
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //One functor
+ test_vec = base_vec;
+ float_sort(test_vec.begin(), test_vec.end(), rightshift());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //Both functors
+ test_vec = base_vec;
+ float_sort(test_vec.begin(), test_vec.end(), rightshift(), less<float>());
+ BOOST_CHECK(test_vec == sorted_vec);
+}
+
+void double_test() {
+ vector<double> long_base_vec;
+ for (unsigned u = 0; u < input_count; ++u) {
+ double val = double
+ ((((boost::int64_t)rand_32()) << ((8 * sizeof(int)) -1)) + rand_32(false));
+ //As std::sort gives arbitrary results for NaNs and 0.0 vs. -0.0,
+ //treat all those as just 0.0 for testing
+ if (!(val < 0.0) && !(0.0 < val))
+ long_base_vec.push_back(0.0);
+ else
+ long_base_vec.push_back(val);
+ }
+ vector<double> long_sorted_vec = long_base_vec;
+ vector<double> long_test_vec = long_base_vec;
+ float_sort(long_test_vec.begin(), long_test_vec.end());
+ std::sort(long_sorted_vec.begin(), long_sorted_vec.end());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+ //One functor
+ long_test_vec = long_base_vec;
+ float_sort(long_test_vec.begin(), long_test_vec.end(), rightshift_64());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+ //Both functors
+ long_test_vec = long_base_vec;
+ float_sort(long_test_vec.begin(), long_test_vec.end(), rightshift_64(),
+ less<double>());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+}
+
+// Verify that 0 and 1 elements work correctly.
+void corner_test() {
+ vector<float> test_vec;
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ const float test_value = -0.0;
+ test_vec.push_back(test_value);
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec.size() == 1);
+ BOOST_CHECK(test_vec[0] == test_value);
+}
+
+// test main
+int test_main( int, char*[] )
+{
+ srand(1);
+ float_test();
+ double_test();
+ corner_test();
+ return 0;
+}
diff --git a/libs/sort/test/integer_sort_test.cpp b/libs/sort/test/integer_sort_test.cpp new file mode 100644 index 000000000..69f510b17 --- /dev/null +++ b/libs/sort/test/integer_sort_test.cpp @@ -0,0 +1,131 @@ +// Boost Sort library int_test.cpp file ------------------------------------//
+
+// Copyright Steven Ross 2009-2014. Use, modification and
+// distribution is subject to the Boost Software License, Version
+// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/cstdint.hpp>
+#include <boost/sort/spreadsort/spreadsort.hpp>
+// Include unit test framework
+#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/test_tools.hpp>
+#include <vector>
+
+#include <iostream>
+
+
+using namespace std;
+using namespace boost::sort::spreadsort;
+
+struct rightshift {
+ int operator()(int x, unsigned offset) { return x >> offset; }
+};
+
+struct rightshift_max {
+ boost::intmax_t operator()(const boost::intmax_t &x, unsigned offset) {
+ return x >> offset;
+ }
+};
+
+struct negrightshift {
+ int operator()(const int &x, const unsigned offset) { return -(x >> offset); }
+};
+
+struct negrightshift_max {
+ boost::intmax_t operator()(const boost::intmax_t &x, const unsigned offset) {
+ return -(x >> offset);
+ }
+};
+
+boost::int32_t
+rand_32(bool sign = true) {
+ boost::int32_t result = rand() | (rand()<< 16);
+ if (rand() % 2)
+ result |= 1 << 15;
+ //Adding the sign bit
+ if (sign && (rand() % 2))
+ result *= -1;
+ return result;
+}
+
+void int_test()
+{
+ // Prepare inputs
+ vector<int> base_vec;
+ unsigned count = 100000;
+ srand(1);
+ //Generating semirandom numbers
+ for (unsigned u = 0; u < count; ++u)
+ base_vec.push_back(rand_32());
+ vector<int> sorted_vec = base_vec;
+ vector<int> test_vec = base_vec;
+ std::sort(sorted_vec.begin(), sorted_vec.end());
+ //Testing basic call
+ integer_sort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //boost::sort::spreadsort variant
+ test_vec = base_vec;
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //One functor
+ test_vec = base_vec;
+ integer_sort(test_vec.begin(), test_vec.end(), rightshift());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //Both functors
+ test_vec = base_vec;
+ integer_sort(test_vec.begin(), test_vec.end(), rightshift(), less<int>());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //reverse order
+ std::sort(sorted_vec.begin(), sorted_vec.end(), greater<int>());
+ integer_sort(test_vec.begin(), test_vec.end(), negrightshift(),
+ greater<int>());
+ BOOST_CHECK(test_vec == sorted_vec);
+
+ //Making sure we're correctly sorting boost::intmax_ts; should use std::sort
+ vector<boost::intmax_t> long_base_vec;
+ for (unsigned u = 0; u < base_vec.size(); ++u)
+ long_base_vec.push_back((((boost::intmax_t)rand_32()) <<
+ ((8 * sizeof(int)) -1)) + rand_32(false));
+ vector<boost::intmax_t> long_sorted_vec = long_base_vec;
+ vector<boost::intmax_t> long_test_vec = long_base_vec;
+ integer_sort(long_test_vec.begin(), long_test_vec.end());
+ std::sort(long_sorted_vec.begin(), long_sorted_vec.end());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+ //One functor
+ long_test_vec = long_base_vec;
+ integer_sort(long_test_vec.begin(), long_test_vec.end(), rightshift_max());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+ //Both functors
+ long_test_vec = long_base_vec;
+ integer_sort(long_test_vec.begin(), long_test_vec.end(), rightshift_max(),
+ less<boost::intmax_t>());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+ //reverse order
+ std::sort(long_sorted_vec.begin(), long_sorted_vec.end(),
+ greater<boost::intmax_t>());
+ integer_sort(long_test_vec.begin(), long_test_vec.end(), negrightshift_max(),
+ greater<boost::intmax_t>());
+ BOOST_CHECK(long_test_vec == long_sorted_vec);
+}
+
+// Verify that 0 and 1 elements work correctly.
+void corner_test() {
+ vector<int> test_vec;
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ const int test_value = 42;
+ test_vec.push_back(test_value);
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec.size() == 1);
+ BOOST_CHECK(test_vec[0] == test_value);
+}
+
+// test main
+int test_main( int, char*[] )
+{
+ int_test();
+ corner_test();
+ return 0;
+}
diff --git a/libs/sort/test/sort_detail_test.cpp b/libs/sort/test/sort_detail_test.cpp new file mode 100644 index 000000000..0d989bce5 --- /dev/null +++ b/libs/sort/test/sort_detail_test.cpp @@ -0,0 +1,294 @@ +// Boost Sort library tests for integer_sort and float_sort details.
+
+// Copyright Steven Ross 2014. Use, modification and
+// distribution is subject to the Boost Software License, Version
+// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/cstdint.hpp>
+#include <boost/sort/spreadsort/detail/spreadsort_common.hpp>
+#include <boost/sort/spreadsort/detail/integer_sort.hpp>
+#include <boost/sort/spreadsort/detail/float_sort.hpp>
+#include <boost/sort/spreadsort/detail/string_sort.hpp>
+#include <boost/sort/spreadsort/float_sort.hpp>
+// Include unit test framework
+#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/test_tools.hpp>
+#include <vector>
+
+#include <iostream>
+
+
+using namespace std;
+using namespace boost::sort::spreadsort;
+using namespace boost::sort::spreadsort::detail;
+
+namespace {
+
+struct int_right_shift {
+ int operator()(const int x, const unsigned offset) const {
+ return x >> offset;
+ }
+};
+
+struct float_right_shift {
+ int operator()(const float x, const unsigned offset) const {
+ return float_mem_cast<float, int>(x) >> offset;
+ }
+};
+
+const int max_int_bits = sizeof(boost::uintmax_t) * 8;
+const int max_size_bits = sizeof(size_t) * 8;
+const boost::uintmax_t one = 1;
+
+// spreadsort won't recurse for inputs smaller than min_count.
+const int int_min_log_count =
+ (std::min)((int)int_log_finishing_count,
+ (int)int_log_mean_bin_size + int_log_min_split_count);
+const int float_min_log_count =
+ (std::min)((int)float_log_finishing_count,
+ (int)float_log_mean_bin_size + float_log_min_split_count);
+const unsigned absolute_min_count = (std::min)(1 << int_min_log_count,
+ 1 << float_min_log_count);
+
+// Verify that roughlog2 is floor(log base 2) + 1.
+void roughlog2_test()
+{
+ for (boost::uintmax_t i = 0; i < max_int_bits; ++i) {
+ BOOST_CHECK(detail::rough_log_2_size(one << i) == i + 1);
+ BOOST_CHECK(detail::rough_log_2_size((one << i) - 1) == i);
+ }
+}
+
+// Test the worst-case performance handling, and assure that is using the
+// correct formula for the worst-case number of radix iterations.
+template<unsigned log_mean_bin_size, unsigned log_min_split_count,
+ unsigned log_finishing_count>
+void get_min_count_test()
+{
+ const unsigned min_log_size = log_mean_bin_size + log_min_split_count;
+ size_t prev_min_count = absolute_min_count;
+ for (int log_range = 0; log_range <= max_int_bits; ++log_range) {
+ size_t min_count = get_min_count<log_mean_bin_size, log_min_split_count,
+ log_finishing_count>(log_range);
+ BOOST_CHECK(min_count >= prev_min_count);
+ prev_min_count = min_count;
+ // When the range is really small, the radix sort will complete in one
+ // iteration and worst-case handling doesn't apply. The code below
+ // guarantees the worst-case number of radix sorting iteration.
+ if (log_range > min_log_size) {
+ BOOST_CHECK(min_count >= (1 << min_log_size));
+ int iterations = rough_log_2_size(min_count) - min_log_size;
+ BOOST_CHECK(iterations >= 1);
+ int base_iterations = max_splits - log_min_split_count;
+ int covered_log_range = 0;
+ if (iterations > base_iterations) {
+ covered_log_range += max_splits * (iterations - base_iterations);
+ } else {
+ base_iterations = iterations;
+ }
+ // sum of n to n + x = ((x + 1) * (n + (n + x)))/2 + log_mean_bin_size
+ covered_log_range +=
+ (base_iterations * (log_min_split_count * 2 + base_iterations - 1))/2 +
+ log_mean_bin_size;
+ BOOST_CHECK(covered_log_range >= log_range);
+ BOOST_CHECK(covered_log_range - max_splits < log_range);
+ }
+ }
+}
+
+// Test the decision of how many pieces to split up the radix sort into
+// (roughly 2^(log_range - log_divisor)) to make sure the results are logical.
+void get_log_divisor_test()
+{
+ for (int log_range = 0; log_range <= max_int_bits; ++log_range) {
+ int prev_log_divisor = max_int_bits +
+ (std::max)((int)int_log_mean_bin_size, (int)float_log_mean_bin_size);
+ for (int log_count = 0; log_count < max_size_bits; ++log_count) {
+ size_t count = (one << log_count) - 1;
+ BOOST_CHECK(rough_log_2_size(count) == (unsigned)log_count);
+ int log_divisor =
+ get_log_divisor<int_log_mean_bin_size>(count, log_range);
+ // Only process counts >= int_log_finishing_count in this function.
+ if (count >= absolute_min_count)
+ BOOST_CHECK(log_divisor <= log_range);
+ // More pieces should be used the larger count is.
+ BOOST_CHECK(log_divisor <= prev_log_divisor);
+ prev_log_divisor = log_divisor;
+ BOOST_CHECK(log_divisor >= 0);
+ if (log_range > log_count) {
+ BOOST_CHECK(log_range - log_divisor <= max_splits);
+ } else if (log_range <= max_finishing_splits) {
+ BOOST_CHECK(log_divisor == 0);
+ }
+ }
+ }
+}
+
+// Verify that is_sorted_or_find_extremes returns true if the data is sorted,
+// and otherwise returns the actual min and max.
+void is_sorted_or_find_extremes_test()
+{
+ vector<int> input;
+ input.push_back(3);
+ input.push_back(5);
+ input.push_back(1);
+ // Test a sorted input.
+ vector<int> sorted_input(input);
+ std::sort(sorted_input.begin(), sorted_input.end());
+ vector<int>::iterator max, min;
+ BOOST_CHECK(detail::is_sorted_or_find_extremes(sorted_input.begin(),
+ sorted_input.end(), max, min));
+ // Test an unsorted input.
+ BOOST_CHECK(!detail::is_sorted_or_find_extremes(input.begin(), input.end(),
+ max, min));
+ BOOST_CHECK(*min == 1);
+ BOOST_CHECK(*max == 5);
+ // Test the comparison function version.
+ BOOST_CHECK(detail::is_sorted_or_find_extremes(sorted_input.begin(),
+ sorted_input.end(), max, min,
+ std::less<int>()));
+ BOOST_CHECK(!detail::is_sorted_or_find_extremes(sorted_input.begin(),
+ sorted_input.end(),
+ max, min,
+ std::greater<int>()));
+ BOOST_CHECK(*min == 5);
+ BOOST_CHECK(*max == 1);
+
+ // Test with floats
+ vector<float> float_input;
+ float_input.push_back(.3f);
+ float_input.push_back(4.0f);
+ float_input.push_back(.1f);
+ vector<float> sorted_float_input(float_input);
+ std::sort(sorted_float_input.begin(), sorted_float_input.end());
+ // Test cast_float_iter
+ int cast_min = detail::cast_float_iter<int, vector<float>::iterator>(
+ sorted_float_input.begin());
+ int cast_max = detail::cast_float_iter<int, vector<float>::iterator>(
+ sorted_float_input.end() - 1);
+ BOOST_CHECK(cast_min == float_right_shift()(.1f, 0));
+ BOOST_CHECK(cast_max == float_right_shift()(4.0f, 0));
+ // Test a sorted input
+ int div_max, div_min;
+ BOOST_CHECK(detail::is_sorted_or_find_extremes(sorted_float_input.begin(),
+ sorted_float_input.end(),
+ div_max, div_min));
+ // Test an unsorted input.
+ BOOST_CHECK(!detail::is_sorted_or_find_extremes(float_input.begin(),
+ float_input.end(),
+ div_max, div_min));
+ BOOST_CHECK(div_min == cast_min);
+ BOOST_CHECK(div_max == cast_max);
+
+ // Test with a right_shift functor.
+ BOOST_CHECK(detail::is_sorted_or_find_extremes(sorted_float_input.begin(),
+ sorted_float_input.end(),
+ div_max, div_min,
+ float_right_shift()));
+ // Test an unsorted input.
+ BOOST_CHECK(!detail::is_sorted_or_find_extremes(float_input.begin(),
+ float_input.end(), div_max,
+ div_min,
+ float_right_shift()));
+ BOOST_CHECK(div_min == float_right_shift()(.1f, 0));
+ BOOST_CHECK(div_max == float_right_shift()(4.0f, 0));
+}
+
+// Make sure bins are created correctly.
+void size_bins_test() {
+ size_t bin_sizes[1 << detail::max_finishing_splits];
+ bin_sizes[0] = 1;
+ bin_sizes[2] = 7;
+ const int old_bin_value = 7;
+ std::vector<int> old_bins;
+ old_bins.push_back(old_bin_value);
+ std::vector<vector<int>::iterator> bin_cache;
+ bin_cache.push_back(old_bins.begin());
+ unsigned cache_offset = 1;
+ unsigned cache_end;
+ const unsigned bin_count = 2;
+ std::vector<int>::iterator *new_cache_start =
+ size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);
+ BOOST_CHECK((new_cache_start - &bin_cache[0]) == cache_offset);
+ BOOST_CHECK(bin_sizes[0] == 0);
+ BOOST_CHECK(bin_sizes[1] == 0);
+ BOOST_CHECK(bin_sizes[2] == 7); // shouldn't modify past bin_count
+ BOOST_CHECK(cache_end == 3);
+ BOOST_CHECK(bin_cache.size() == cache_end);
+ BOOST_CHECK(old_bins[0] == old_bin_value);
+}
+
+// Test the specialized 3-way swap loops.
+void swap_loop_test() {
+ size_t bin_sizes[1 << detail::max_finishing_splits];
+ bin_sizes[0] = bin_sizes[1] = 2;
+ bin_sizes[2] = 1;
+
+ // test integer swap loop
+ vector<int> ints;
+ const int int_div_min = 3;
+ const int int_log_divisor = 1;
+ const unsigned int_offset = int_div_min << int_log_divisor;
+ ints.push_back(2 + int_offset);
+ ints.push_back(1 + int_offset); // stays in place
+ ints.push_back(4 + int_offset);
+ ints.push_back(3 + int_offset);
+ ints.push_back(0 + int_offset);
+ vector<vector<int>::iterator> int_bin_vector;
+ int_bin_vector.push_back(ints.begin());
+ int_bin_vector.push_back(int_bin_vector[0] + bin_sizes[0]);
+ int_bin_vector.push_back(int_bin_vector[1] + bin_sizes[1]);
+ vector<int>::iterator next_int_bin_start = int_bin_vector[0];
+ vector<int>::iterator *int_bins = &int_bin_vector[0];
+ int_right_shift integer_right_shift;
+ swap_loop(int_bins, next_int_bin_start, 0, integer_right_shift, bin_sizes,
+ int_log_divisor, int_div_min);
+ for (unsigned i = 0; i < ints.size(); ++i) {
+ BOOST_CHECK(ints[i] == int(int_offset + i));
+ }
+ BOOST_CHECK(next_int_bin_start == ints.begin() + bin_sizes[0]);
+
+ // test float swap loop
+ vector<float> floats;
+ const int float_four_as_int = float_mem_cast<float, int>(4.0f);
+ const int float_log_divisor =
+ rough_log_2_size(float_mem_cast<float, int>(5.0f) - float_four_as_int);
+ const int float_div_min = float_four_as_int >> float_log_divisor;
+ floats.push_back(6.0f);
+ floats.push_back(5.0f); // stays in place
+ floats.push_back(8.0f);
+ floats.push_back(7.0f);
+ floats.push_back(4.0f);
+ vector<vector<float>::iterator> float_bin_vector;
+ float_bin_vector.push_back(floats.begin());
+ float_bin_vector.push_back(float_bin_vector[0] + bin_sizes[0]);
+ float_bin_vector.push_back(float_bin_vector[1] + bin_sizes[1]);
+ vector<float>::iterator next_float_bin_start = float_bin_vector[0];
+ vector<float>::iterator *float_bins = &float_bin_vector[0];
+ float_swap_loop(float_bins, next_float_bin_start, 0, bin_sizes,
+ float_log_divisor, float_div_min);
+ for (unsigned i = 0; i < floats.size(); ++i) {
+ BOOST_CHECK(floats[i] == 4.0f + i);
+ }
+ BOOST_CHECK(next_float_bin_start == floats.begin() + bin_sizes[0]);
+}
+
+} // end anonymous namespace
+
+// test main
+int test_main( int, char*[] )
+{
+ roughlog2_test();
+ get_min_count_test<int_log_mean_bin_size, int_log_min_split_count,
+ int_log_finishing_count>();
+ get_min_count_test<float_log_mean_bin_size, float_log_min_split_count,
+ float_log_finishing_count>();
+ get_log_divisor_test();
+ is_sorted_or_find_extremes_test();
+ size_bins_test();
+ swap_loop_test();
+ return 0;
+}
diff --git a/libs/sort/test/string_sort_test.cpp b/libs/sort/test/string_sort_test.cpp new file mode 100644 index 000000000..b4dcaa8ca --- /dev/null +++ b/libs/sort/test/string_sort_test.cpp @@ -0,0 +1,150 @@ +// Boost Sort library string_sort_test.cpp file ----------------------------//
+
+// Copyright Steven Ross 2009. Use, modification and
+// distribution is subject to the Boost Software License, Version
+// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/sort for library home page.
+
+#include <boost/sort/spreadsort/detail/string_sort.hpp>
+#include <boost/sort/spreadsort/string_sort.hpp>
+#include <boost/sort/spreadsort/spreadsort.hpp>
+// Include unit test framework
+#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/test_tools.hpp>
+#include <vector>
+#include <string>
+
+
+using namespace std;
+using namespace boost::sort::spreadsort;
+using boost::sort::spreadsort::detail::offset_less_than;
+using boost::sort::spreadsort::detail::offset_greater_than;
+using boost::sort::spreadsort::detail::update_offset;
+
+struct bracket {
+ unsigned char operator()(const string &x, size_t offset) const {
+ return x[offset];
+ }
+};
+
+struct get_size {
+ size_t operator()(const string &x) const{ return x.size(); }
+};
+
+static const unsigned input_count = 100000;
+
+// Test that update_offset finds the first character with a difference.
+void update_offset_test() {
+ vector<string> input;
+ input.push_back("test1");
+ input.push_back("test2");
+ size_t char_offset = 1;
+ update_offset<vector<string>::iterator, unsigned char>(input.begin(),
+ input.end(),
+ char_offset);
+ BOOST_CHECK(char_offset == 4);
+
+ // Functor version
+ char_offset = 1;
+ update_offset(input.begin(), input.end(), char_offset, bracket(), get_size());
+ BOOST_CHECK(char_offset == 4);
+}
+
+// Test that offset comparison operators only look after the offset.
+void offset_comparison_test() {
+ string input1 = "ab";
+ string input2 = "ba";
+ string input3 = "aba";
+ offset_less_than<string, unsigned char> less_than(0);
+ offset_greater_than<string, unsigned char> greater_than(0);
+ BOOST_CHECK(less_than(input1, input2));
+ BOOST_CHECK(less_than(input1, input3));
+ BOOST_CHECK(!less_than(input2, input1));
+ BOOST_CHECK(!less_than(input1, input1));
+ BOOST_CHECK(!greater_than(input1, input2));
+ BOOST_CHECK(!greater_than(input1, input3));
+ BOOST_CHECK(greater_than(input2, input1));
+ BOOST_CHECK(!greater_than(input1, input1));
+
+ // Offset comparisons only check after the specified offset.
+ offset_less_than<string, unsigned char> offset_less(1);
+ offset_greater_than<string, unsigned char> offset_greater(1);
+ BOOST_CHECK(!offset_less(input1, input2));
+ BOOST_CHECK(offset_less(input1, input3));
+ BOOST_CHECK(offset_less(input2, input1));
+ BOOST_CHECK(!offset_less(input1, input1));
+ BOOST_CHECK(offset_greater(input1, input2));
+ BOOST_CHECK(!offset_greater(input1, input3));
+ BOOST_CHECK(!offset_greater(input2, input1));
+ BOOST_CHECK(!offset_greater(input1, input1));
+}
+
+void string_test()
+{
+ // Prepare inputs
+ vector<string> base_vec;
+ const unsigned max_length = 32;
+ srand(1);
+ //Generating semirandom numbers
+ for (unsigned u = 0; u < input_count; ++u) {
+ unsigned length = rand() % max_length;
+ string result;
+ for (unsigned u = 0; u < length; ++u)
+ result.push_back(rand() % 256);
+ base_vec.push_back(result);
+ }
+ vector<string> sorted_vec = base_vec;
+ vector<string> test_vec = base_vec;
+ std::sort(sorted_vec.begin(), sorted_vec.end());
+ //Testing basic call
+ string_sort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //Testing boost::sort::spreadsort wrapper
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //Character functors
+ test_vec = base_vec;
+ string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //All functors
+ test_vec = base_vec;
+ string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size(),
+ less<string>());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //reverse order
+ std::sort(sorted_vec.begin(), sorted_vec.end(), greater<string>());
+ reverse_string_sort(test_vec.begin(), test_vec.end(), greater<string>());
+ BOOST_CHECK(test_vec == sorted_vec);
+ //reverse order with functors
+ test_vec = base_vec;
+ reverse_string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size(),
+ greater<string>());
+ BOOST_CHECK(test_vec == sorted_vec);
+}
+
+// Verify that 0, 1, and input_count empty strings all sort correctly.
+void corner_test() {
+ vector<string> test_vec;
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ test_vec.resize(1);
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec[0].empty());
+ test_vec.resize(input_count);
+ boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end());
+ BOOST_CHECK(test_vec.size() == input_count);
+ for (unsigned i = 0; i < test_vec.size(); ++i) {
+ BOOST_CHECK(test_vec[i].empty());
+ }
+}
+
+// test main
+int test_main( int, char*[] )
+{
+ update_offset_test();
+ offset_comparison_test();
+ string_test();
+ corner_test();
+ return 0;
+}
diff --git a/libs/sort/test/test.log b/libs/sort/test/test.log new file mode 100644 index 000000000..89e65bcf1 --- /dev/null +++ b/libs/sort/test/test.log @@ -0,0 +1,37 @@ +
+Performing configuration checks
+
+ - symlinks supported : yes (cached)
+...patience...
+...patience...
+...found 2544 targets...
+...updating 20 targets...
+compile-c-c++ ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_sort_test.obj
+integer_sort_test.cpp
+msvc.link ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_sort.exe
+msvc.manifest ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_sort.exe
+testing.capture-output ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_sort.run
+ 1 file(s) copied.
+**passed** ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_sort.test
+compile-c-c++ ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort_test.obj
+float_sort_test.cpp
+msvc.link ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort.exe
+msvc.manifest ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort.exe
+testing.capture-output ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort.run
+ 1 file(s) copied.
+**passed** ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort.test
+compile-c-c++ ..\..\..\bin.v2\libs\sort\test\string_sort.test\msvc-12.0\debug\threading-multi\string_sort_test.obj
+string_sort_test.cpp
+msvc.link ..\..\..\bin.v2\libs\sort\test\string_sort.test\msvc-12.0\debug\threading-multi\string_sort.exe
+msvc.manifest ..\..\..\bin.v2\libs\sort\test\string_sort.test\msvc-12.0\debug\threading-multi\string_sort.exe
+testing.capture-output ..\..\..\bin.v2\libs\sort\test\string_sort.test\msvc-12.0\debug\threading-multi\string_sort.run
+ 1 file(s) copied.
+**passed** ..\..\..\bin.v2\libs\sort\test\string_sort.test\msvc-12.0\debug\threading-multi\string_sort.test
+compile-c-c++ ..\..\..\bin.v2\libs\sort\test\sort_detail.test\msvc-12.0\debug\threading-multi\sort_detail_test.obj
+sort_detail_test.cpp
+msvc.link ..\..\..\bin.v2\libs\sort\test\sort_detail.test\msvc-12.0\debug\threading-multi\sort_detail.exe
+msvc.manifest ..\..\..\bin.v2\libs\sort\test\sort_detail.test\msvc-12.0\debug\threading-multi\sort_detail.exe
+testing.capture-output ..\..\..\bin.v2\libs\sort\test\sort_detail.test\msvc-12.0\debug\threading-multi\sort_detail.run
+ 1 file(s) copied.
+**passed** ..\..\..\bin.v2\libs\sort\test\sort_detail.test\msvc-12.0\debug\threading-multi\sort_detail.test
+...updated 20 targets...
diff --git a/libs/sort/tune.pl b/libs/sort/tune.pl new file mode 100755 index 000000000..220454598 --- /dev/null +++ b/libs/sort/tune.pl @@ -0,0 +1,359 @@ +#!/usr/bin/perl -w
+# Copyright Steven J. Ross 2008 - 2014
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+#
+# See http://www.boost.org/libs/sort for library home page.
+
+# A speed and accuracy testing and automated parameter tuning script.
+
+$usage = "usage: tune.pl [-tune] [-real] [-tune_verify] [-verbose] [-multiple_iterations] [-large] [-small] [-windows] [fileSize]\n";
+# testing sorting on 40 million elements by default
+# don't test on below 2^22 (4 million) elements as that is the minimum
+# for max_splits of 11 to be efficient
+use File::Compare;
+$defFileSize = 5000000;
+$loopCount = 1;
+$realtimes = 0;
+$verifycorrect = 0;
+$verbose = 0;
+$exename = "spreadsort";
+$makename = "b2 \-\-tune";
+$all = "";
+$iter_count = 1;
+$debug = 0;
+$log = "> .tunelog";
+$log2 = "> .tunelog 2>&1";
+$diffopt = "-q";
+$tune = 0;
+# have to change the path for UNIX
+$prev_path = $ENV{'PATH'};
+$ENV{'PATH'} = '.:'.$prev_path;
+
+for (my $ii = 0; $ii < @ARGV; $ii++) {
+ my $currArg = $ARGV[$ii];
+ if ($currArg =~ /^-help$/) {
+ print STDERR $usage;
+ exit(0);
+ }
+ # verification roughly doubles the runtime of this script,
+ # but it does make sure that results are correct during tuning
+ # verification always runs during speed comparisons with std::sort
+ if ($currArg =~ /^-tune_verify$/) {
+ $verifycorrect = 1;
+ # use real times only, don't use weighting and special-case tests
+ # this saves about 5/6 of the script runtime but results are different
+ } elsif ($currArg =~ /^-real$/) {
+ $realtimes = 1;
+ } elsif ($currArg =~ /^-verbose$/) {
+ $verbose = 1;
+ # runs until we converge on a precise set of values
+ # defaults off because of runtime
+ } elsif ($currArg =~ /^-multiple_iterations$/) {
+ $iter_count = 4;
+ } elsif ($currArg =~ /^-debug$/) {
+ $debug = 1;
+ $log = "";
+ $diffopt = "";
+ } elsif ($currArg =~ /^-large$/) {
+ $defFileSize = 20000000;
+ } elsif ($currArg =~ /^-small$/) {
+ $defFileSize = 100000;
+ } elsif ($currArg =~ /^-tune$/) {
+ $tune = 1;
+ } elsif ($currArg =~ /^-windows$/) {
+ $makename = "..\\..\\".$makename;
+ } elsif ($currArg =~ /^-/) {
+ print STDERR $usage;
+ exit(0);
+ } else {
+ $defFileSize = $currArg;
+ }
+}
+$fileSize = $defFileSize;
+
+print STDOUT "Tuning variables for $exename on vectors with $defFileSize elements\n";
+
+# these are reasonable values
+$max_splits = 11;
+$log_finishing_count = 31;
+$log_min_size = 11;
+$log_mean_bin_size = 2;
+$float_log_min_size = 10;
+$float_log_mean_bin_size = 2;
+$float_log_finishing_count = 4;
+
+# this value is a minimum to obtain decent file I/O performance
+$min_sort_size = 1000;
+$std = "";
+
+print STDOUT "building randomgen\n";
+system("$makename randomgen $log");
+# Tuning to get convergence, maximum of 4 iterations with multiple iterations
+# option set
+$changed = 1;
+my $ii = 0;
+if ($tune) {
+ for ($ii = 0; $changed and $ii < $iter_count; $ii++) {
+ $changed = 0;
+ # Tuning max_splits is not recommended.
+ #print STDOUT "Tuning max_splits\n";
+ #TuneVariable(\$max_splits, $log_min_size - $log_mean_bin_size, 17);
+ print STDOUT "Tuning log of the minimum count for recursion\n";
+ TuneVariable(\$log_min_size, $log_mean_bin_size + 1, $max_splits + $log_mean_bin_size);
+ print STDOUT "Tuning log_mean_bin_size\n";
+ TuneVariable(\$log_mean_bin_size, 0, $log_min_size - 1);
+ print STDOUT "Tuning log_finishing_size\n";
+ TuneVariable(\$log_finishing_count, 1, $log_min_size);
+ # tuning variables for floats
+ $exename = "floatsort";
+ print STDOUT "Tuning log of the minimum count for recursion for floats\n";
+ TuneVariable(\$float_log_min_size, $float_log_mean_bin_size + 1, $max_splits + $float_log_mean_bin_size);
+ print STDOUT "Tuning float_log_mean_bin_size\n";
+ TuneVariable(\$float_log_mean_bin_size, 0, $float_log_min_size - 1);
+ print STDOUT "Tuning float_log_finishing_size\n";
+ TuneVariable(\$float_log_finishing_count, 1, $float_log_min_size);
+ $exename = "spreadsort";
+ }
+
+ # After optimizations for large datasets are complete, see how small of a
+ # dataset can be sped up
+ print STDOUT "Tuning minimum sorting size\n";
+ TuneMinSize();
+ print STDOUT "Writing results\n";
+}
+
+# Doing a final run with final settings to compare sort times
+# also verifying correctness of results
+$verifycorrect = 1;
+$loopCount = 1;
+$fileSize = $defFileSize;
+system("$makename $all $log");
+$std = "";
+PerfTest("Verifying integer_sort", "spreadsort");
+PerfTest("Verifying float_sort", "floatsort");
+PerfTest("Verifying string_sort", "stringsort");
+PerfTest("Verifying integer_sort with mostly-sorted data", "mostlysorted");
+PerfTest("Timing integer_sort on already-sorted data", "alreadysorted");
+PerfTest("Verifying integer_sort with rightshift", "rightshift");
+PerfTest("Verifying integer_sort with 64-bit integers", "int64");
+PerfTest("Verifying integer_sort with separate key and data", "keyplusdata");
+PerfTest("Verifying reverse integer_sort", "reverseintsort");
+PerfTest("Verifying float_sort with doubles", "double");
+PerfTest("Verifying float_sort with shift functor", "shiftfloatsort");
+PerfTest("Verifying float_sort with functors", "floatfunctorsort");
+PerfTest("Verifying string_sort with indexing functors", "charstringsort");
+PerfTest("Verifying string_sort with all functors", "stringfunctorsort");
+PerfTest("Verifying reverse_string_sort", "reversestringsort");
+PerfTest("Verifying reverse_string_sort with functors",
+ "reversestringfunctorsort");
+PerfTest("Verifying generalized string_sort with multiple keys of different types",
+ "generalizedstruct");
+PerfTest("Verifying boost::sort on its custom-built worst-case distribution",
+ "binaryalrbreaker");
+# clean up once we finish
+system("$makename clean $log");
+# WINDOWS
+system("del spread_sort_out.txt $log2");
+system("del standard_sort_out.txt $log2");
+system("del input.txt $log2");
+system("del *.rsp $log2");
+system("del *.manifest $log2");
+system("del time.txt $log2");
+# UNIX
+system("rm -f time.txt $log2");
+system("rm -f spread_sort_out.txt $log2");
+system("rm -f standard_sort_out.txt $log2");
+system("rm -f input.txt $log2");
+
+$ENV{'PATH'} = $prev_path;
+
+# A simple speed test comparing std::sort to
+sub PerfTest {
+ my ($message, $local_exe) = @_;
+ $exename = $local_exe;
+ print STDOUT "$message\n";
+ $lastTime = SumTimes();
+ print STDOUT "runtime: $lastTime\n";
+ print STDOUT "std::sort time: $baseTime\n";
+ $speedup = (($baseTime/$lastTime) - 1) * 100;
+ print STDOUT "speedup: ".sprintf("%.2f", $speedup)."%\n";
+}
+
+# Write an updated constants file as part of tuning.
+sub WriteConstants {
+ # deleting the file
+ $const_file = 'include/boost/sort/spreadsort/detail/constants.hpp';
+ @cannot = grep {not unlink} $const_file;
+ print "$0: could not unlink @cannot\n" if @cannot;
+
+ # writing the results back to the original file name
+ unless(open(CONSTANTS, ">$const_file")) {
+ print STDERR "Can't open output file: $const_file: $!\n";
+ exit;
+ }
+ print CONSTANTS "//constant definitions for the Boost Sort library\n\n";
+ print CONSTANTS "// Copyright Steven J. Ross 2001 - 2014\n";
+ print CONSTANTS "// Distributed under the Boost Software License, Version 1.0.\n";
+ print CONSTANTS "// (See accompanying file LICENSE_1_0.txt or copy at\n";
+ print CONSTANTS "// http://www.boost.org/LICENSE_1_0.txt)\n\n";
+ print CONSTANTS "// See http://www.boost.org/libs/sort for library home page.\n";
+ print CONSTANTS "#ifndef BOOST_SORT_SPREADSORT_DETAIL_CONSTANTS\n";
+ print CONSTANTS "#define BOOST_SORT_SPREADSORT_DETAIL_CONSTANTS\n";
+ print CONSTANTS "namespace boost {\n";
+ print CONSTANTS "namespace sort {\n";
+ print CONSTANTS "namespace spreadsort {\n";
+ print CONSTANTS "namespace detail {\n";
+ print CONSTANTS "//Tuning constants\n";
+ print CONSTANTS "//This should be tuned to your processor cache;\n";
+ print CONSTANTS "//if you go too large you get cache misses on bins\n";
+ print CONSTANTS "//The smaller this number, the less worst-case memory usage.\n";
+ print CONSTANTS "//If too small, too many recursions slow down spreadsort\n";
+ print CONSTANTS "enum { max_splits = $max_splits,\n";
+ print CONSTANTS "//It's better to have a few cache misses and finish sorting\n";
+ print CONSTANTS "//than to run another iteration\n";
+ print CONSTANTS "max_finishing_splits = max_splits + 1,\n";
+ print CONSTANTS "//Sets the minimum number of items per bin.\n";
+ print CONSTANTS "int_log_mean_bin_size = $log_mean_bin_size,\n";
+ print CONSTANTS "//Used to force a comparison-based sorting for small bins, if it's faster.\n";
+ print CONSTANTS "//Minimum value 1\n";
+ $log_min_split_count = $log_min_size - $log_mean_bin_size;
+ print CONSTANTS "int_log_min_split_count = $log_min_split_count,\n";
+ print CONSTANTS "//This is the minimum split count to use spreadsort when it will finish in one\n";
+ print CONSTANTS "//iteration. Make this larger the faster std::sort is relative to integer_sort.\n";
+ print CONSTANTS "int_log_finishing_count = $log_finishing_count,\n";
+ print CONSTANTS "//Sets the minimum number of items per bin for floating point.\n";
+ print CONSTANTS "float_log_mean_bin_size = $float_log_mean_bin_size,\n";
+ print CONSTANTS "//Used to force a comparison-based sorting for small bins, if it's faster.\n";
+ print CONSTANTS "//Minimum value 1\n";
+ $float_log_min_split_count = $float_log_min_size - $float_log_mean_bin_size;
+ print CONSTANTS "float_log_min_split_count = $float_log_min_split_count,\n";
+ print CONSTANTS "//This is the minimum split count to use spreadsort when it will finish in one\n";
+ print CONSTANTS "//iteration. Make this larger the faster std::sort is relative to float_sort.\n";
+ print CONSTANTS "float_log_finishing_count = $float_log_finishing_count,\n";
+ print CONSTANTS "//There is a minimum size below which it is not worth using spreadsort\n";
+ print CONSTANTS "min_sort_size = $min_sort_size };\n";
+ print CONSTANTS "}\n}\n}\n}\n#endif\n";
+ close CONSTANTS;
+ system("$makename $exename $log");
+}
+
+# Sort the file with both std::sort and boost::sort, verify the results are the
+# same, update stdtime with std::sort time, and return boost::sort time.
+sub CheckTime {
+ my $sort_time = 0.0;
+ my $time_file = "time.txt";
+ # use the line below on systems that can't overwrite.
+ #system("rm -f $time_file");
+ system("$exename $loopCount $std > $time_file");
+ unless(open(CODE, $time_file)) {
+ print STDERR "Could not open file: $time_file: $!\n";
+ exit;
+ }
+ while ($line = <CODE>) {
+ @parts = split("time", $line);
+ if (@parts > 1) {
+ $sort_time = $parts[1];
+ last;
+ }
+ }
+ close(CODE);
+ # verifying correctness
+ if (not $std and $verifycorrect) {
+ system("$exename $loopCount -std > $time_file");
+ unless(open(CODE, $time_file)) {
+ print STDERR "Could not open file: $time_file: $!\n";
+ exit;
+ }
+ die "Difference in results\n" unless (compare("boost_sort_out.txt","standard_sort_out.txt") == 0) ;
+ while ($line = <CODE>) {
+ @parts = split("time", $line);
+ if (@parts > 1) {
+ $stdsingle = $parts[1];
+ last;
+ }
+ }
+ close(CODE);
+ }
+ return $sort_time;
+}
+
+# Sum up times for different data distributions. If realtimes is not set,
+# larger ranges are given a larger weight.
+sub SumTimes {
+ my $time = 0;
+ $baseTime = 0.0;
+ $stdsingle = 0.0;
+ my $ii = 1;
+ # if we're only using real times, don't bother with the corner-cases
+ if ($realtimes) {
+ $ii = 8;
+ }
+ for (; $ii <= 16; $ii++) {
+ system("randomgen $ii $ii $fileSize");
+ if ($realtimes) {
+ $time += CheckTime();
+ $baseTime += $stdsingle;
+ } else {
+ # tests with higher levels of randomness are given
+ # higher priority in timing results
+ print STDOUT "trying $ii $ii\n" if $debug;
+ $time += 2 * $ii * CheckTime();
+ $baseTime += 2 * $ii * $stdsingle;
+ if ($ii > 1) {
+ print STDOUT "trying 1 $ii\n" if $debug;
+ system("randomgen 1 $ii $fileSize");
+ $time += $ii * CheckTime();
+ $baseTime += $ii * $stdsingle;
+ print STDOUT "trying $ii 1\n" if $debug;
+ system("randomgen $ii 1 $fileSize");
+ $time += $ii * CheckTime();
+ $baseTime += $ii * $stdsingle;
+ }
+ }
+ }
+ if ($time == 0.0) {
+ $time = 0.01;
+ }
+ return $time;
+}
+
+# Tests a range of potential values for a variable, and sets it to the fastest.
+sub TuneVariable {
+ my ($tunevar, $beginval, $endval) = @_;
+ my $best_val = $$tunevar;
+ my $besttime = 0;
+ my $startval = $$tunevar;
+ for ($$tunevar = $beginval; $$tunevar <= $endval; $$tunevar++) {
+ WriteConstants();
+ $sumtime = SumTimes();
+ # If this value is better, use it. If this is the start value
+ # and it's just as good, use the startval
+ if (not $besttime or ($sumtime < $besttime) or (($besttime == $sumtime) and ($$tunevar == $startval))) {
+ $besttime = $sumtime;
+ $best_val = $$tunevar;
+ }
+ print STDOUT "Value: $$tunevar Time: $sumtime\n" if $verbose;
+ }
+ $$tunevar = $best_val;
+ print STDOUT "Best Value: $best_val\n";
+ if ($best_val != $startval) {
+ $changed = 1;
+ }
+}
+
+# Determine the cutoff size below which std::sort is faster.
+sub TuneMinSize {
+ for (; $min_sort_size <= $defFileSize; $min_sort_size *= 2) {
+ $loopCount = ($defFileSize/$min_sort_size)/10;
+ $fileSize = $min_sort_size;
+ WriteConstants();
+ $std = "";
+ $sumtime = SumTimes();
+ $std = "-std";
+ $stdtime = SumTimes();
+ print STDOUT "Size: $min_sort_size boost::sort Time: $sumtime std::sort Time: $stdtime\n";
+ last if ($stdtime > $sumtime);
+ }
+}
|
