<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>More examples — Boost.HigherOrderFunctions 0.6 documentation</title>
<link rel="stylesheet" href="../../_static/boostbook.css" type="text/css" />
<link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
<script type="text/javascript">
var DOCUMENTATION_OPTIONS = {
URL_ROOT: '../../',
VERSION: '0.6',
COLLAPSE_INDEX: false,
FILE_SUFFIX: '.html',
HAS_SOURCE: true,
SOURCELINK_SUFFIX: '.txt'
};
</script>
<script type="text/javascript" src="../../_static/jquery.js"></script>
<script type="text/javascript" src="../../_static/underscore.js"></script>
<script type="text/javascript" src="../../_static/doctools.js"></script>
<link rel="index" title="Index" href="../../genindex.html" />
<link rel="search" title="Search" href="../../search.html" />
<link rel="next" title="Point-free style programming" href="point_free.html" />
<link rel="prev" title="Polymorphic constructors" href="example_polymorphic_constructors.html" />
</head>
<body role="document">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86"src="../../_static/boost.png"></td>
</tr></table>
<div class="spirit-nav">
<a accesskey="p" href="example_polymorphic_constructors.html"><img src="../../_static/prev.png" alt="Prev"></a>
<a accesskey="u" href="intro.html"><img src="../../_static/up.png" alt="Up"></a>
<a accesskey="h" href="../index.html"><img src="../../_static/home.png" alt="Home"></a>
<a accesskey="n" href="point_free.html"><img src="../../_static/next.png" alt="Next"></a>
</div>
<div class="document">
<div class="chapter">
<div class="body" role="main">
<!-- Copyright 2018 Paul Fultz II
Distributed under the Boost Software License, Version 1.0.
(http://www.boost.org/LICENSE_1_0.txt)
--><div class="section" id="more-examples">
<h1>More examples<a class="headerlink" href="#more-examples" title="Permalink to this headline">¶</a></h1>
<p>As Boost.HigherOrderFunctions is a collection of generic utilities
related to functions, there is many useful cases with the library, but a key
point of many of these utilities is that they can solve these problems with
much simpler constructs than whats traditionally been done with
metaprogramming. Lets take look at some of the use cases for using Boost.HigherOrderFunctions.</p>
<div class="section" id="initialization">
<h2>Initialization<a class="headerlink" href="#initialization" title="Permalink to this headline">¶</a></h2>
<p>The <a class="reference internal" href="../../include/boost/hof/function.html"><span class="doc">BOOST_HOF_STATIC_FUNCTION</span></a> will help initialize function objects at
global scope, and will ensure that it is initialized at compile-time and (on
platforms that support it) will have a unique address across translation
units, thereby reducing executable bloat and potential ODR violations.</p>
<p>In addition, <a class="reference internal" href="../../include/boost/hof/lambda.html"><span class="doc">BOOST_HOF_STATIC_LAMBDA</span></a> allows initializing a lambda
in the same manner. This allows for simple and compact function definitions
when working with generic lambdas and function adaptors.</p>
<p>Of course, the library can still be used without requiring global function
objects for those who prefer to avoid them will still find the library useful.</p>
</div>
<div class="section" id="projections">
<h2>Projections<a class="headerlink" href="#projections" title="Permalink to this headline">¶</a></h2>
<p>Instead of writing the projection multiple times in algorithms:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="n">std</span><span class="o">::</span><span class="n">sort</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">begin</span><span class="p">(</span><span class="n">people</span><span class="p">),</span> <span class="n">std</span><span class="o">::</span><span class="n">end</span><span class="p">(</span><span class="n">people</span><span class="p">),</span>
<span class="p">[](</span><span class="k">const</span> <span class="n">Person</span><span class="o">&</span> <span class="n">a</span><span class="p">,</span> <span class="k">const</span> <span class="n">Person</span><span class="o">&</span> <span class="n">b</span><span class="p">)</span> <span class="p">{</span>
<span class="k">return</span> <span class="n">a</span><span class="p">.</span><span class="n">year_of_birth</span> <span class="o"><</span> <span class="n">b</span><span class="p">.</span><span class="n">year_of_birth</span><span class="p">;</span>
<span class="p">});</span>
</pre></div>
</div>
<p>We can use the <code class="docutils literal"><span class="pre">proj</span></code> adaptor to project <code class="docutils literal"><span class="pre">year_of_birth</span></code> on the comparison
operator:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="n">std</span><span class="o">::</span><span class="n">sort</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">begin</span><span class="p">(</span><span class="n">people</span><span class="p">),</span> <span class="n">std</span><span class="o">::</span><span class="n">end</span><span class="p">(</span><span class="n">people</span><span class="p">),</span>
<span class="n">proj</span><span class="p">(</span><span class="o">&</span><span class="n">Person</span><span class="o">::</span><span class="n">year_of_birth</span><span class="p">,</span> <span class="n">_</span> <span class="o"><</span> <span class="n">_</span><span class="p">));</span>
</pre></div>
</div>
</div>
<div class="section" id="ordering-evaluation-of-arguments">
<h2>Ordering evaluation of arguments<a class="headerlink" href="#ordering-evaluation-of-arguments" title="Permalink to this headline">¶</a></h2>
<p>When we write <code class="docutils literal"><span class="pre">f(foo(),</span> <span class="pre">bar())</span></code>, the standard does not guarantee the order in
which the <code class="docutils literal"><span class="pre">foo()</span></code> and <code class="docutils literal"><span class="pre">bar()</span></code> arguments are evaluated. So with <code class="docutils literal"><span class="pre">apply_eval</span></code> we
can order them from left-to-right:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="n">apply_eval</span><span class="p">(</span><span class="n">f</span><span class="p">,</span> <span class="p">[</span><span class="o">&</span><span class="p">]{</span> <span class="k">return</span> <span class="n">foo</span><span class="p">();</span> <span class="p">},</span> <span class="p">[</span><span class="o">&</span><span class="p">]{</span> <span class="k">return</span> <span class="n">bar</span><span class="p">();</span> <span class="p">});</span>
</pre></div>
</div>
</div>
<div class="section" id="extension-methods">
<h2>Extension methods<a class="headerlink" href="#extension-methods" title="Permalink to this headline">¶</a></h2>
<p>Chaining many functions together, like what is done for range based libraries,
can make things hard to read:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="k">auto</span> <span class="n">r</span> <span class="o">=</span> <span class="n">transform</span><span class="p">(</span>
<span class="n">filter</span><span class="p">(</span>
<span class="n">numbers</span><span class="p">,</span>
<span class="p">[](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">></span> <span class="mi">2</span><span class="p">;</span> <span class="p">}</span>
<span class="p">),</span>
<span class="p">[](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span><span class="p">;</span> <span class="p">}</span>
<span class="p">);</span>
</pre></div>
</div>
<p>It would be nice to write this:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="k">auto</span> <span class="n">r</span> <span class="o">=</span> <span class="n">numbers</span>
<span class="p">.</span><span class="n">filter</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">></span> <span class="mi">2</span><span class="p">;</span> <span class="p">})</span>
<span class="p">.</span><span class="n">transform</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span><span class="p">;</span> <span class="p">});</span>
</pre></div>
</div>
<p>The proposal <a class="reference external" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4165.pdf">N4165</a>
for Unified Call Syntax(UFCS) would have allowed a function call of <code class="docutils literal"><span class="pre">x.f(y)</span></code> to become
<code class="docutils literal"><span class="pre">f(x,</span> <span class="pre">y)</span></code>. However, this was rejected by the comittee. So instead pipable functions can be
used to achieve extension methods. So it can be written like this:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="k">auto</span> <span class="n">r</span> <span class="o">=</span> <span class="n">numbers</span>
<span class="o">|</span> <span class="n">filter</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">></span> <span class="mi">2</span><span class="p">;</span> <span class="p">})</span>
<span class="o">|</span> <span class="n">transform</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span><span class="p">;</span> <span class="p">});</span>
</pre></div>
</div>
<p>Now, if some users feel a little worried about overloading the <em>bitwise or</em>
operator, pipable functions can also be used with <a class="reference internal" href="../../include/boost/hof/flow.html"><span class="doc">flow</span></a> like this:</p>
<div class="highlight-cpp"><div class="highlight"><pre><span></span><span class="k">auto</span> <span class="n">r</span> <span class="o">=</span> <span class="n">flow</span><span class="p">(</span>
<span class="n">filter</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">></span> <span class="mi">2</span><span class="p">;</span> <span class="p">}),</span>
<span class="n">transform</span><span class="p">([](</span><span class="kt">int</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span><span class="p">;</span> <span class="p">})</span>
<span class="p">)(</span><span class="n">numbers</span><span class="p">);</span>
</pre></div>
</div>
<p>No fancy or confusing operating overloading and everything is still quite
readable.</p>
</div>
</div>
</div>
</div>
<div class="clearer"></div>
</div>
<div class="footer" role="contentinfo">
<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 2016, Paul Fultz II.
Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.5.6.
<p>Distributed under the Boost Software License, Version 1.0.
(See accompanying file <code class="filename">LICENSE_1_0.txt</code> or copy at
<a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>
</div></td>
</tr></table>
</div>
</body>
</html>
