afb81b8278
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
Close stale issues and PRs / stale (push) Successful in 13s
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
428 lines
34 KiB
HTML
428 lines
34 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: Query/Search</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('group__query.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="#groups">Modules</a> |
|
|
<a href="#typedef-members">Typedefs</a> </div>
|
|
<div class="headertitle"><div class="title">Query/Search<div class="ingroups"><a class="el" href="group__meta.html">Meta</a> » <a class="el" href="group__algorithm.html">Algorithms</a></div></div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Query and search algorithms.
|
|
<a href="#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="groups" name="groups"></a>
|
|
Modules</h2></td></tr>
|
|
<tr class="memitem:group__lazy__query"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__lazy__query.html">lazy</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 id="typedef-members" name="typedef-members"></a>
|
|
Typedefs</h2></td></tr>
|
|
<tr class="memitem:gae65ae2955249d7b8322e1135f680103b"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:gae65ae2955249d7b8322e1135f680103b"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#gae65ae2955249d7b8322e1135f680103b">meta::all_of</a> = <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a>< <a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a>< L, <a class="el" href="group__trait.html#gad54adef1c420be333e5027f7c63dc5db">not_fn</a>< Fn > > ></td></tr>
|
|
<tr class="memdesc:gae65ae2955249d7b8322e1135f680103b"><td class="mdescLeft"> </td><td class="mdescRight">A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>true</code> for all elements <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. <a href="group__query.html#gae65ae2955249d7b8322e1135f680103b">More...</a><br /></td></tr>
|
|
<tr class="separator:gae65ae2955249d7b8322e1135f680103b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga458c0596c85f41edc60b5230e76087e1"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:ga458c0596c85f41edc60b5230e76087e1"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga458c0596c85f41edc60b5230e76087e1">meta::any_of</a> = <a class="el" href="group__logical.html#ga72884249179b0b22a27cc0709b75f23b">not_</a>< <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a>< <a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a>< L, Fn > > ></td></tr>
|
|
<tr class="memdesc:ga458c0596c85f41edc60b5230e76087e1"><td class="mdescLeft"> </td><td class="mdescRight">A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>true</code> for any element <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. <a href="group__query.html#ga458c0596c85f41edc60b5230e76087e1">More...</a><br /></td></tr>
|
|
<tr class="separator:ga458c0596c85f41edc60b5230e76087e1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga8a395b36c7a028e67cf7cbaa28ab3ccc"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:ga8a395b36c7a028e67cf7cbaa28ab3ccc"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga8a395b36c7a028e67cf7cbaa28ab3ccc">meta::count</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< <a class="el" href="structmeta_1_1detail_1_1count__.html">detail::count_</a>< L, T > ></td></tr>
|
|
<tr class="memdesc:ga8a395b36c7a028e67cf7cbaa28ab3ccc"><td class="mdescLeft"> </td><td class="mdescRight">Count the number of times a type <code>T</code> appears in the list <code>L</code>. <a href="group__query.html#ga8a395b36c7a028e67cf7cbaa28ab3ccc">More...</a><br /></td></tr>
|
|
<tr class="separator:ga8a395b36c7a028e67cf7cbaa28ab3ccc"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga665bd44f6d231438a3200df8030f593a"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:ga665bd44f6d231438a3200df8030f593a"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga665bd44f6d231438a3200df8030f593a">meta::count_if</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< <a class="el" href="structmeta_1_1detail_1_1count__if__.html">detail::count_if_</a>< L, Fn > ></td></tr>
|
|
<tr class="memdesc:ga665bd44f6d231438a3200df8030f593a"><td class="mdescLeft"> </td><td class="mdescRight">Count the number of times the predicate <code>Fn</code> evaluates to true for all the elements in the list <code>L</code>. <a href="group__query.html#ga665bd44f6d231438a3200df8030f593a">More...</a><br /></td></tr>
|
|
<tr class="separator:ga665bd44f6d231438a3200df8030f593a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga4e7b439f707e529f3df7745ff7e2eb19"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:ga4e7b439f707e529f3df7745ff7e2eb19"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga4e7b439f707e529f3df7745ff7e2eb19">meta::find</a> = <a class="el" href="group__transformation.html#ga4883188d34dd23dc949f737c17a1a317">drop</a>< L, min< <a class="el" href="group__query.html#ga613514a0b471a7a1eecabfe6c2e8963c">find_index</a>< L, T >, <a class="el" href="group__list.html#ga82704ab3563d63460b7ac1be6c9876c9">size</a>< L > > ></td></tr>
|
|
<tr class="memdesc:ga4e7b439f707e529f3df7745ff7e2eb19"><td class="mdescLeft"> </td><td class="mdescRight">Return the tail of the list <code>L</code> starting at the first occurrence of <code>T</code>, if any such element exists; the empty list, otherwise. <a href="group__query.html#ga4e7b439f707e529f3df7745ff7e2eb19">More...</a><br /></td></tr>
|
|
<tr class="separator:ga4e7b439f707e529f3df7745ff7e2eb19"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gaf33139f1b442de0272477e126d6d66a7"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:gaf33139f1b442de0272477e126d6d66a7"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">meta::find_if</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< detail::find_if_< L, Fn > ></td></tr>
|
|
<tr class="memdesc:gaf33139f1b442de0272477e126d6d66a7"><td class="mdescLeft"> </td><td class="mdescRight">Return the tail of the list <code>L</code> starting at the first element <code>A</code> such that <code>invoke<Fn, A>::value</code> is <code>true</code>, if any such element exists; the empty list, otherwise. <a href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">More...</a><br /></td></tr>
|
|
<tr class="separator:gaf33139f1b442de0272477e126d6d66a7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga613514a0b471a7a1eecabfe6c2e8963c"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:ga613514a0b471a7a1eecabfe6c2e8963c"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga613514a0b471a7a1eecabfe6c2e8963c">meta::find_index</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< detail::find_index_< L, T > ></td></tr>
|
|
<tr class="memdesc:ga613514a0b471a7a1eecabfe6c2e8963c"><td class="mdescLeft"> </td><td class="mdescRight">Finds the index of the first occurrence of the type <code>T</code> within the list <code>L</code>. Returns <code>#<a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> if the type <code>T</code> was not found. <a href="group__query.html#ga613514a0b471a7a1eecabfe6c2e8963c">More...</a><br /></td></tr>
|
|
<tr class="separator:ga613514a0b471a7a1eecabfe6c2e8963c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga7e59a2a7df311e0d88e2781f753e5a9a"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:ga7e59a2a7df311e0d88e2781f753e5a9a"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga7e59a2a7df311e0d88e2781f753e5a9a">meta::in</a> = <a class="el" href="group__logical.html#ga72884249179b0b22a27cc0709b75f23b">not_</a>< <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a>< <a class="el" href="group__query.html#ga4e7b439f707e529f3df7745ff7e2eb19">find</a>< L, T > > ></td></tr>
|
|
<tr class="memdesc:ga7e59a2a7df311e0d88e2781f753e5a9a"><td class="mdescLeft"> </td><td class="mdescRight">A Boolean integral constant wrapper around <code>true</code> if there is at least one occurrence of <code>T</code> in <code>L</code>. <a href="group__query.html#ga7e59a2a7df311e0d88e2781f753e5a9a">More...</a><br /></td></tr>
|
|
<tr class="separator:ga7e59a2a7df311e0d88e2781f753e5a9a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga0722ed3a3840cbeffd4d49876abbd7d8"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:ga0722ed3a3840cbeffd4d49876abbd7d8"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga0722ed3a3840cbeffd4d49876abbd7d8">meta::none_of</a> = <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a>< <a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a>< L, Fn > ></td></tr>
|
|
<tr class="memdesc:ga0722ed3a3840cbeffd4d49876abbd7d8"><td class="mdescLeft"> </td><td class="mdescRight">A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>false</code> for all elements <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. <a href="group__query.html#ga0722ed3a3840cbeffd4d49876abbd7d8">More...</a><br /></td></tr>
|
|
<tr class="separator:ga0722ed3a3840cbeffd4d49876abbd7d8"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gaf9fc68d4879145b2e75be42224ae1571"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:gaf9fc68d4879145b2e75be42224ae1571"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#gaf9fc68d4879145b2e75be42224ae1571">meta::reverse_find</a> = <a class="el" href="group__transformation.html#ga4883188d34dd23dc949f737c17a1a317">drop</a>< L, min< <a class="el" href="group__query.html#ga6a29ed9ce437db81ee3a046e368e942f">reverse_find_index</a>< L, T >, <a class="el" href="group__list.html#ga82704ab3563d63460b7ac1be6c9876c9">size</a>< L > > ></td></tr>
|
|
<tr class="memdesc:gaf9fc68d4879145b2e75be42224ae1571"><td class="mdescLeft"> </td><td class="mdescRight">Return the tail of the list <code>L</code> starting at the last occurrence of <code>T</code>, if any such element exists; the empty list, otherwise. <a href="group__query.html#gaf9fc68d4879145b2e75be42224ae1571">More...</a><br /></td></tr>
|
|
<tr class="separator:gaf9fc68d4879145b2e75be42224ae1571"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gabbb3ce2f521f38bcceb821a8eda51d5f"><td class="memTemplParams" colspan="2">template<list_like L, invocable Fn> </td></tr>
|
|
<tr class="memitem:gabbb3ce2f521f38bcceb821a8eda51d5f"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#gabbb3ce2f521f38bcceb821a8eda51d5f">meta::reverse_find_if</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< detail::reverse_find_if_< L, Fn > ></td></tr>
|
|
<tr class="memdesc:gabbb3ce2f521f38bcceb821a8eda51d5f"><td class="mdescLeft"> </td><td class="mdescRight">Return the tail of the list <code>L</code> starting at the last element <code>A</code> such that <code>invoke<Fn, A>::value</code> is <code>true</code>, if any such element exists; the empty list, otherwise. <a href="group__query.html#gabbb3ce2f521f38bcceb821a8eda51d5f">More...</a><br /></td></tr>
|
|
<tr class="separator:gabbb3ce2f521f38bcceb821a8eda51d5f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga6a29ed9ce437db81ee3a046e368e942f"><td class="memTemplParams" colspan="2">template<list_like L, typename T > </td></tr>
|
|
<tr class="memitem:ga6a29ed9ce437db81ee3a046e368e942f"><td class="memTemplItemLeft" align="right" valign="top">using </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__query.html#ga6a29ed9ce437db81ee3a046e368e942f">meta::reverse_find_index</a> = <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a>< detail::reverse_find_index_< L, T > ></td></tr>
|
|
<tr class="memdesc:ga6a29ed9ce437db81ee3a046e368e942f"><td class="mdescLeft"> </td><td class="mdescRight">Finds the index of the last occurrence of the type <code>T</code> within the list <code>L</code>. Returns <code>#<a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> if the type <code>T</code> was not found. <a href="group__query.html#ga6a29ed9ce437db81ee3a046e368e942f">More...</a><br /></td></tr>
|
|
<tr class="separator:ga6a29ed9ce437db81ee3a046e368e942f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<p >Query and search algorithms. </p>
|
|
<h2 class="groupheader">Typedef Documentation</h2>
|
|
<a id="gae65ae2955249d7b8322e1135f680103b" name="gae65ae2955249d7b8322e1135f680103b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gae65ae2955249d7b8322e1135f680103b">◆ </a></span>all_of</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#gae65ae2955249d7b8322e1135f680103b">meta::all_of</a> = typedef <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a><<a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a><L, <a class="el" href="group__trait.html#gad54adef1c420be333e5027f7c63dc5db">not_fn</a><Fn> >></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>true</code> for all elements <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga458c0596c85f41edc60b5230e76087e1" name="ga458c0596c85f41edc60b5230e76087e1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga458c0596c85f41edc60b5230e76087e1">◆ </a></span>any_of</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga458c0596c85f41edc60b5230e76087e1">meta::any_of</a> = typedef <a class="el" href="group__logical.html#ga72884249179b0b22a27cc0709b75f23b">not_</a><<a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a><<a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a><L, Fn> >></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>true</code> for any element <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga8a395b36c7a028e67cf7cbaa28ab3ccc" name="ga8a395b36c7a028e67cf7cbaa28ab3ccc"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga8a395b36c7a028e67cf7cbaa28ab3ccc">◆ </a></span>count</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga8a395b36c7a028e67cf7cbaa28ab3ccc">meta::count</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><<a class="el" href="structmeta_1_1detail_1_1count__.html">detail::count_</a><L, T> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Count the number of times a type <code>T</code> appears in the list <code>L</code>. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga665bd44f6d231438a3200df8030f593a" name="ga665bd44f6d231438a3200df8030f593a"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga665bd44f6d231438a3200df8030f593a">◆ </a></span>count_if</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga665bd44f6d231438a3200df8030f593a">meta::count_if</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><<a class="el" href="structmeta_1_1detail_1_1count__if__.html">detail::count_if_</a><L, Fn> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Count the number of times the predicate <code>Fn</code> evaluates to true for all the elements in the list <code>L</code>. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga4e7b439f707e529f3df7745ff7e2eb19" name="ga4e7b439f707e529f3df7745ff7e2eb19"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga4e7b439f707e529f3df7745ff7e2eb19">◆ </a></span>find</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga4e7b439f707e529f3df7745ff7e2eb19">meta::find</a> = typedef <a class="el" href="group__transformation.html#ga4883188d34dd23dc949f737c17a1a317">drop</a><L, min<<a class="el" href="group__query.html#ga613514a0b471a7a1eecabfe6c2e8963c">find_index</a><L, T>, <a class="el" href="group__list.html#ga82704ab3563d63460b7ac1be6c9876c9">size</a><L> >></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Return the tail of the list <code>L</code> starting at the first occurrence of <code>T</code>, if any such element exists; the empty list, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="gaf33139f1b442de0272477e126d6d66a7" name="gaf33139f1b442de0272477e126d6d66a7"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gaf33139f1b442de0272477e126d6d66a7">◆ </a></span>find_if</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">meta::find_if</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><detail::find_if_<L, Fn> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Return the tail of the list <code>L</code> starting at the first element <code>A</code> such that <code>invoke<Fn, A>::value</code> is <code>true</code>, if any such element exists; the empty list, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga613514a0b471a7a1eecabfe6c2e8963c" name="ga613514a0b471a7a1eecabfe6c2e8963c"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga613514a0b471a7a1eecabfe6c2e8963c">◆ </a></span>find_index</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga613514a0b471a7a1eecabfe6c2e8963c">meta::find_index</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><detail::find_index_<L, T> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Finds the index of the first occurrence of the type <code>T</code> within the list <code>L</code>. Returns <code>#<a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> if the type <code>T</code> was not found. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>.</dd></dl>
|
|
<dl class="section see"><dt>See also</dt><dd><code><a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga7e59a2a7df311e0d88e2781f753e5a9a" name="ga7e59a2a7df311e0d88e2781f753e5a9a"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga7e59a2a7df311e0d88e2781f753e5a9a">◆ </a></span>in</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga7e59a2a7df311e0d88e2781f753e5a9a">meta::in</a> = typedef <a class="el" href="group__logical.html#ga72884249179b0b22a27cc0709b75f23b">not_</a><<a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a><<a class="el" href="group__query.html#ga4e7b439f707e529f3df7745ff7e2eb19">find</a><L, T> >></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>A Boolean integral constant wrapper around <code>true</code> if there is at least one occurrence of <code>T</code> in <code>L</code>. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga0722ed3a3840cbeffd4d49876abbd7d8" name="ga0722ed3a3840cbeffd4d49876abbd7d8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga0722ed3a3840cbeffd4d49876abbd7d8">◆ </a></span>none_of</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga0722ed3a3840cbeffd4d49876abbd7d8">meta::none_of</a> = typedef <a class="el" href="group__list.html#gae64f0978e680ad1a96438c0756b4644d">empty</a><<a class="el" href="group__query.html#gaf33139f1b442de0272477e126d6d66a7">find_if</a><L, Fn> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>A Boolean integral constant wrapper around <code>true</code> if <code>invoke<Fn, A>::value</code> is <code>false</code> for all elements <code>A</code> in <code><a class="el" href="structmeta_1_1list.html" title="A list of types.">meta::list</a></code> <code>L</code>; <code>false</code>, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="gaf9fc68d4879145b2e75be42224ae1571" name="gaf9fc68d4879145b2e75be42224ae1571"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gaf9fc68d4879145b2e75be42224ae1571">◆ </a></span>reverse_find</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#gaf9fc68d4879145b2e75be42224ae1571">meta::reverse_find</a> = typedef <a class="el" href="group__transformation.html#ga4883188d34dd23dc949f737c17a1a317">drop</a><L, min<<a class="el" href="group__query.html#ga6a29ed9ce437db81ee3a046e368e942f">reverse_find_index</a><L, T>, <a class="el" href="group__list.html#ga82704ab3563d63460b7ac1be6c9876c9">size</a><L> >></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Return the tail of the list <code>L</code> starting at the last occurrence of <code>T</code>, if any such element exists; the empty list, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="gabbb3ce2f521f38bcceb821a8eda51d5f" name="gabbb3ce2f521f38bcceb821a8eda51d5f"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gabbb3ce2f521f38bcceb821a8eda51d5f">◆ </a></span>reverse_find_if</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, invocable Fn> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#gabbb3ce2f521f38bcceb821a8eda51d5f">meta::reverse_find_if</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><detail::reverse_find_if_<L, Fn> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Return the tail of the list <code>L</code> starting at the last element <code>A</code> such that <code>invoke<Fn, A>::value</code> is <code>true</code>, if any such element exists; the empty list, otherwise. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>. </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga6a29ed9ce437db81ee3a046e368e942f" name="ga6a29ed9ce437db81ee3a046e368e942f"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga6a29ed9ce437db81ee3a046e368e942f">◆ </a></span>reverse_find_index</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<list_like L, typename T > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">using <a class="el" href="group__query.html#ga6a29ed9ce437db81ee3a046e368e942f">meta::reverse_find_index</a> = typedef <a class="el" href="group__invocation.html#ga08e2193149605769f6052795ff0a87b1">_t</a><detail::reverse_find_index_<L, T> ></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><code>#include <<a class="el" href="meta_8hpp.html">meta/meta.hpp</a>></code></p>
|
|
|
|
<p>Finds the index of the last occurrence of the type <code>T</code> within the list <code>L</code>. Returns <code>#<a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> if the type <code>T</code> was not found. </p>
|
|
<dl class="section user"><dt>Complexity</dt><dd><code>O(N)</code>.</dd></dl>
|
|
<dl class="section see"><dt>See also</dt><dd><code>#<a class="el" href="group__list.html#gac6b96d77cd4223043591fe6e5819ecf8" title="A special value used to indicate no matches. It equals the maximum value representable by std::size_t...">meta::npos</a></code> </dd></dl>
|
|
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<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>
|