Some checks failed
Docker. / Ubuntu (push) Has been cancelled
User-agent updater. / User-agent (push) Failing after 15s
Lock Threads / lock (push) Failing after 10s
Waiting for answer. / waiting-for-answer (push) Failing after 22s
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
Close stale issues and PRs / stale (push) Has been cancelled
163 lines
13 KiB
HTML
163 lines
13 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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=11"/>
|
|
<meta name="generator" content="Doxygen 1.9.4"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Range-v3: range/v3/algorithm/permutation.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="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.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">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function() { init_search(); });
|
|
/* @license-end */
|
|
</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 id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">Range-v3
|
|
</div>
|
|
<div id="projectbrief">Range algorithms, views, and actions for the Standard Library</div>
|
|
</td>
|
|
<td> <div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.svg"
|
|
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.svg" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.4 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('permutation_8hpp.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- 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="summary">
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">permutation.hpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:ga78a1e313c5e8d45926c1b1b3e541bea2"><td class="memTemplParams" colspan="2">
|
|
template<typename I1 , typename S1 , typename I2 , typename C = equal_to, typename P1 = identity, typename P2 = identity> <br />
|
|
requires forward_iterator<I1> && sentinel_for<S1, I1> && forward_iterator<I2> && indirectly_comparable<I1, I2, C, P1, P2></td></tr>
|
|
<tr class="memitem:ga78a1e313c5e8d45926c1b1b3e541bea2"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_permutation</b> (I1 begin1, S1 end1, I2 begin2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})</td></tr>
|
|
<tr class="memdesc:ga78a1e313c5e8d45926c1b1b3e541bea2"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>is_permutation</code> <br /></td></tr>
|
|
<tr class="separator:ga78a1e313c5e8d45926c1b1b3e541bea2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga3e54464768ae85c2039c8cf54564cf82"><td class="memTemplParams" colspan="2">
|
|
template<typename I1 , typename S1 , typename I2 , typename S2 , typename C = equal_to, typename P1 = identity, typename P2 = identity> <br />
|
|
requires forward_iterator<I1> && sentinel_for<S1, I1> && forward_iterator<I2> && sentinel_for<S2, I2> && indirectly_comparable<I1, I2, C, P1, P2></td></tr>
|
|
<tr class="memitem:ga3e54464768ae85c2039c8cf54564cf82"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_permutation</b> (I1 begin1, S1 end1, I2 begin2, S2 end2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})</td></tr>
|
|
<tr class="memdesc:ga3e54464768ae85c2039c8cf54564cf82"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:ga3e54464768ae85c2039c8cf54564cf82"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gab7684ead8bee9cb9c563075ae1740892"><td class="memTemplParams" colspan="2">
|
|
template<typename <a class="el" href="classRng1.html">Rng1</a> , typename I2Ref , typename C = equal_to, typename P1 = identity, typename P2 = identity> <br />
|
|
requires forward_range<<a class="el" href="classRng1.html">Rng1</a>> && forward_iterator<uncvref_t<I2Ref>> && indirectly_comparable<iterator_t<<a class="el" href="classRng1.html">Rng1</a>>, uncvref_t<I2Ref>, C, P1, P2></td></tr>
|
|
<tr class="memitem:gab7684ead8bee9cb9c563075ae1740892"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_permutation</b> (<a class="el" href="classRng1.html">Rng1</a> &&rng1, I2Ref &&begin2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})</td></tr>
|
|
<tr class="memdesc:gab7684ead8bee9cb9c563075ae1740892"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:gab7684ead8bee9cb9c563075ae1740892"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga2f506bcd59dba886af57ef842a7b6def"><td class="memTemplParams" colspan="2">
|
|
template<typename <a class="el" href="classRng1.html">Rng1</a> , typename <a class="el" href="classRng2.html">Rng2</a> , typename C = equal_to, typename P1 = identity, typename P2 = identity> <br />
|
|
requires forward_range<<a class="el" href="classRng1.html">Rng1</a>> && forward_range<<a class="el" href="classRng2.html">Rng2</a>> && indirectly_comparable<iterator_t<<a class="el" href="classRng1.html">Rng1</a>>, iterator_t<<a class="el" href="classRng2.html">Rng2</a>>, C, P1, P2></td></tr>
|
|
<tr class="memitem:ga2f506bcd59dba886af57ef842a7b6def"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_permutation</b> (<a class="el" href="classRng1.html">Rng1</a> &&rng1, <a class="el" href="classRng2.html">Rng2</a> &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})</td></tr>
|
|
<tr class="memdesc:ga2f506bcd59dba886af57ef842a7b6def"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:ga2f506bcd59dba886af57ef842a7b6def"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga8fe88fbbc4eff4c6afdf5c0de2180769"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires bidirectional_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:ga8fe88fbbc4eff4c6afdf5c0de2180769"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::next_permutation</b> (I first, S end_, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga8fe88fbbc4eff4c6afdf5c0de2180769"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>next_permutation</code> <br /></td></tr>
|
|
<tr class="separator:ga8fe88fbbc4eff4c6afdf5c0de2180769"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga5df00bb09ce44ad908e408b2ddc0151e"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires bidirectional_range<Rng> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:ga5df00bb09ce44ad908e408b2ddc0151e"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::next_permutation</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga5df00bb09ce44ad908e408b2ddc0151e"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:ga5df00bb09ce44ad908e408b2ddc0151e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga72e46bae67c88ccae773aa1673d47833"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires bidirectional_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:ga72e46bae67c88ccae773aa1673d47833"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::prev_permutation</b> (I first, S end_, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga72e46bae67c88ccae773aa1673d47833"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>prev_permutation</code> <br /></td></tr>
|
|
<tr class="separator:ga72e46bae67c88ccae773aa1673d47833"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gafc8702ce0c79ea7d93439643a70f0bdb"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires bidirectional_range<Rng> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:gafc8702ce0c79ea7d93439643a70f0bdb"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::prev_permutation</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gafc8702ce0c79ea7d93439643a70f0bdb"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:gafc8702ce0c79ea7d93439643a70f0bdb"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_f242af8a7c2c0148e408c78222f177e1.html">range</a></li><li class="navelem"><a class="el" href="dir_b72dce760dba076c3008801bbd43e21d.html">v3</a></li><li class="navelem"><a class="el" href="dir_3bcb3f19c2c8a89df408efd863ca1956.html">algorithm</a></li><li class="navelem"><a class="el" href="permutation_8hpp.html">permutation.hpp</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.4 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|