algorithm_mnemonics.xml

<!--

Copyright (c) 2016, Tommy Bennett
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright
   notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
   notice, this list of conditions and the following disclaimer in the
   documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
   must display the following acknowledgement:
   This product includes software developed by the <organization>.
4. Neither the name of the <organization> nor the
   names of its contributors may be used to endorse or promote products
   derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ''AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-->

<!-- Algorithm Mnemonics: Increase Productivity with STL Algorithms

     In the algorithm mnemonic text, the following placeholders
     are provided:

     %\c     Recommended places where the cursor should appear after the
             mnemonic expansion.  It is also recommended to allow the user to
             tab through each place where %\c appears.
     %\m C%  This is where the container should appear after mnemonic expansion.

-->

<algorithm-mnemonics>
	<p n="ihp" en="is_heap">
		<text>
			if (std::is_heap(std::begin(%\m C%), std::end(%\m C%))) {
			  %\c
			}
		</text>
	</p>
	<p n="mme" en="minmax_element">
		<text>
			auto minmax = std::minmax_element(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="ihu" en="is_heap_until">
		<text>
			auto pos = std::is_heap_until(std::begin(%\m C%), std::end(%\m C%));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="acl" en="accumulate">
		<text>
			auto sum = std::accumulate(std::begin(%\m C%), std::end(%\m C%), 0, [](int total, %\c) {
			  %\c
			});
		</text>
	</p>
	<p n="eql" en="equal">
		<text>
			if (std::equal(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c))) {
			  %\c
			}
		</text>
	</p>
	<p n="acm" en="accumulate">
		<text>
			auto sum = std::accumulate(std::begin(%\m C%), std::end(%\m C%), 0);
		</text>
	</p>
	<p n="ucp" en="unique_copy">
		<text>
			std::unique_copy(std::begin(%\m C%), std::end(%\m C%),
			  std::ostream_iterator&lt;string&gt;(std::cout, "\n"));
		</text>
	</p>
	<p n="ita" en="iota">
		<text>
			std::iota(std::begin(%\m C%), std::end(%\m C%), %\c);
		</text>
	</p>
	<p n="iss" en="is_sorted">
		<text>
			if (std::is_sorted(std::begin(%\m C%), std::end(%\m C%))) {
			  %\c
			}
		</text>
	</p>
	<p n="rpc" en="replace_copy">
		<text>
			std::replace_copy(std::begin(%\m C%), std::end(%\m C%), std::begin(%\m C%), %\c, %\c);
		</text>
	</p>
	<p n="isu" en="is_sorted_until">
		<text>
			auto pos = std::is_sorted_until(std::begin(%\m C%), std::end(%\m C%));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="rmv" en="remove">
		<text>
			auto pos = std::remove(std::begin(%\m C%), std::end(%\m C%), %\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="nth" en="nth_element">
		<text>
			std::nth_element(std::begin(%\m C%), std::end(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="rpi" en="replace_if">
		<text>
			std::replace_if(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			%\c
			}, %\c);
		</text>
	</p>
	<p n="rpl" en="replace">
		<text>
			std::replace(std::begin(%\m C%), std::end(%\m C%), %\c, %\c);
		</text>
	</p>
	<p n="erm" en="erase">
		<text>
			%\m C%.erase(std::remove(std::begin(%\m C%), std::end(%\m C%), %\c), std::end(%\m C%));
		</text>
	</p>
	<p n="tfm" en="transform">
		<text>
			std::transform(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\m C%), [](%\c) {
			%\c%
			});
		</text>
	</p>
	<p n="fln" en="fill_n">
		<text>
			std::fill_n(std::begin(%\m C%), %\c, %\c);
		</text>
	</p>
	<p n="alo" en="all_of">
		<text>
			if (std::all_of(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			})) {
			  %\c
			}
		</text>
	</p>
	<p n="prp" en="prev_permutation">
		<text>
			if (std::prev_permutation(std::begin(%\m C%), std::end(%\m C%))) {
			  %\c
			}
		</text>
	</p>
	<p n="ltr" en="string_trim_left">
		<text>
			%\m C%.erase(0, %\m C%.find_first_not_of(" \t\n\r"));
		</text>
	</p>
	<p n="upr" en="string_upper">
		<text>
			std::transform(std::begin(%\m C%), std::end(%\m C%), std::begin(%\m C%), [](char c) {
			return std::toupper(c);
			});
			%\c
		</text>
	</p>
	<p n="psc" en="partial_sort_copy">
		<text>
			std::partial_sort_copy(std::begin(%\m C%), std::end(%\m C%),
			                  std::begin(%\c), std::end(%\c));
		</text>
	</p>
	<p n="ppt" en="partition_point">
		<text>
			auto pos = std::partition_point(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="cnt" en="count">
		<text>
			auto n = std::count(std::begin(%\m C%), std::end(%\m C%), %\c);
		</text>
	</p>
	<p n="uqe" en="unique">
		<text>
			auto pos = std::unique(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="sti" en="cin">
		<text>
			std::cin &gt;&gt;
		</text>
	</p>
	<p n="cpy" en="copy">
		<text>
			std::copy(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c));
		</text>
	</p>
	<p n="sto" en="cout">
		<text>
			std::cout &lt;&lt;
		</text>
	</p>
	<p n="cpb" en="copy_backward">
		<text>
			std::copy_backward(std::begin(%\m C%), std::end(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="swr" en="swap_ranges">
		<text>
			std::swap_ranges(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c));
		</text>
	</p>
	<p n="rtc" en="rotate_copy">
		<text>
			std::rotate_copy(std::begin(%\m C%), std::begin(%\c), std::end(%\m C%),
			  std::begin(%\c));
		</text>
	</p>
	<p n="mxe" en="max_element">
		<text>
			auto pos = std::max_element(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="rte" en="rotate">
		<text>
			std::rotate(std::begin(%\m C%), std::begin(%\c), std::end(%\m C%));
		</text>
	</p>
	<p n="stv" en="vector">
		<text>
			std::vector&lt;%\c&gt; %\c
		</text>
	</p>
	<p n="cpi" en="copy_if">
		<text>
			std::copy_if(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c),
			[](%\c) {
			  %\c
			});
		</text>
	</p>
	<p n="cni" en="count_if">
		<text>
			auto n = std::count_if(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
		</text>
	</p>
	<p n="cpn" en="copy_n">
		<text>
			std::copy_n(std::begin(%\m C%), %\c, std::end(%\m C%));
		</text>
	</p>
	<p n="srt" en="sort">
		<text>
			std::sort(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="spt" en="stable_partition">
		<text>
			auto pos = std::stable_partition(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="msm" en="mismatch">
		<text>
			auto values = std::mismatch(std::begin(%\m C%), std::end(%\m C%), std::begin(%\m C%));
			if (values.first == std::end(%\m C%)) {
			  %\c
			} else {
			  %\c
			}
		</text>
	</p>
	<p n="ptc" en="partition_copy">
		<text>
			std::partition_copy(std::begin(%\m C%), std::end(%\m C%),
			                  std::begin(%\c), std::end(%\c));
		</text>
	</p>
	<p n="pst" en="partial_sort">
		<text>
			std::partial_sort(std::begin(%\m C%), std::end(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="fnd" en="find">
		<text>
			auto pos = std::find(std::begin(%\m C%), std::end(%\m C%), %\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="fre" en="for_each">
		<text>
			std::for_each(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
		</text>
	</p>
	<p n="mne" en="min_element">
		<text>
			auto pos = std::min_element(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="fne" en="find_end">
		<text>
			auto pos = std::find_std::end(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="mrg" en="merge">
		<text>
			std::merge(std::begin(%\m C%), std::end(%\m C%),
			std::begin(%\c), std::end(%\c), std::begin(%\c));
		</text>
	</p>
	<p n="srh" en="search">
		<text>
			auto pos = std::search(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="fni" en="find_if">
		<text>
			auto pos = std::find_if(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="ptn" en="partition">
		<text>
			auto pos = std::partition(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="srn" en="search_n">
		<text>
			auto pos = std::search_n(std::begin(%\m C%), std::end(%\m C%),%\c,%\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="ano" en="any_of">
		<text>
			if (std::any_of(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			})) {
			  %\c
			}
		</text>
	</p>
	<p n="nxp" en="next_permutation">
		<text>
			if (std::next_permutation(std::begin(%\m C%), std::end(%\m C%))) {
			  %\c
			}
		</text>
	</p>
	<p n="rvr" en="reverse">
		<text>
			std::reverse(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="rmc" en="remove_copy">
		<text>
			std::remove_copy(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\m C%), %\c);
		</text>
	</p>
	<p n="sts" en="stable_sort">
		<text>
			std::stable_sort(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="rmf" en="remove_copy_if">
		<text>
			std::remove_copy_if(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\m C%), [](%\c) {
			    %\c
			});
		</text>
	</p>
	<p n="rci" en="replace_copy_if">
		<text>
			std::replace_copy_if(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\m C%), [](%\c) {
			  %\c
			  }, %\c);
		</text>
	</p>
	<p n="rmi" en="remove_if">
		<text>
			auto pos = std::remove_if(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="rvc" en="reverse_copy">
		<text>
			std::reverse_copy(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c));
		</text>
	</p>
	<p n="oit" en="copy">
		<text>
			std::copy(std::begin(%\m C%), std::end(%\m C%), std::ostream_iterator&lt;%\c&gt;{
			%\istd::cout, "%\c"
			});
		</text>
	</p>
	<p n="sth" en="sort_heap">
		<text>
			std::sort_heap(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="phh" en="push_heap">
		<text>
			std::push_heap(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="ffo" en="find_first_of">
		<text>
			auto pos = std::find_first_of(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="gnr" en="generate">
		<text>
			std::generate(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			});
		</text>
	</p>
	<p n="ipr" en="is_permutation">
		<text>
			if (std::is_permutation(std::begin(%\m C%), std::end(%\m C%), std::begin(%\c))) {
			  %\c
			}
		</text>
	</p>
	<p n="ipt" en="is_partitioned">
		<text>
			if (std::is_partitioned(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			  })) {
			  %\c
			}
		</text>
	</p>
	<p n="mkh" en="make_heap">
		<text>
			std::make_heap(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="fil" en="fill">
		<text>
			std::fill(std::begin(%\m C%), std::end(%\m C%), %\c);
		</text>
	</p>
	<p n="fin" en="find_if_not">
		<text>
			auto pos = std::find_if_not(std::begin(%\m C%), std::end(%\m C%),[](%\c) {
			  %\c
			});
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="lwr" en="string_lower">
		<text>
			std::transform(std::begin(%\m C%), std::end(%\m C%), std::begin(%\m C%), [](char c) {
			return std::tolower(c); });
		</text>
	</p>
	<p n="lxc" en="lexigraphical_compare">
		<text>
			if (std::lexigraphical_compare(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c)) {
			  %\c
			}
		</text>
	</p>
	<p n="shf" en="random_shuffle">
		<text>
			std::random_shuffle(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="ajf" en="adjacent_find">
		<text>
			auto pos = std::adjacent_find(std::begin(%\m C%), std::end(%\m C%));
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="trm" en="string_trim_right">
		<text>
			%\m C%.erase(%\m C%.find_last_not_of(" \t\n\r") + 1);
		</text>
	</p>
	<p n="gnn" en="generate_n">
		<text>
			std::generate_n(std::begin(%\m C%), %\c, [](%\c) {
			  %\c
			});
		</text>
	</p>
	<p n="nno" en="none_of">
		<text>
			if (std::none_of(std::begin(%\m C%), std::end(%\m C%), [](%\c) {
			  %\c
			})) {
			  %\c
			}
		</text>
	</p>
	<p n="pph" en="pop_heap">
		<text>
			std::pop_heap(std::begin(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="bns" en="binary_search">
		<text>
			auto pos = std::binary_search(std::begin(%\m C%), std::end(%\m C%), %\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="inc" en="includes">
		<text>
			if (std::includes(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c))) {
			    %\c
			}
		</text>
	</p>
	<p n="lwb" en="lower_bound">
		<text>
			auto pos = std::lower_bound(std::begin(%\m C%), std::end(%\m C%), %\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="upb" en="upper_bound">
		<text>
			auto pos = std::upper_bound(std::begin(%\m C%), std::end(%\m C%), %\c);
			if (pos != std::end(%\m C%)) {
			  %\c
			}
		</text>
	</p>
	<p n="eqr" en="equal_range">
		<text>
			auto bounds = std::equal_range(std::begin(%\m C%), std::end(%\m C%), %\c);
		</text>
	</p>
	<p n="erl" en="equal_range">
		<text>
			auto bounds = std::equal_range(std::begin(%\m C%), std::end(%\m C%), %\c,
			  [](%\c,%\c) { %\c });
		</text>
	</p>
	<p n="stu" en="set_union">
		<text>
			auto pos = std::set_union(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c), std::begin(%\c));
		</text>
	</p>
	<p n="stn" en="set_intersection">
		<text>
			auto pos = std::set_intersection(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c), std::begin(%\c));
		</text>
	</p>
	<p n="std" en="set_difference">
		<text>
			auto pos = std::set_difference(std::begin(%\m C%), std::end(%\m C%),
			  std::begin(%\c), std::end(%\c), std::begin(%\c));
		</text>
	</p>
	<p n="ssd" en="set_symmetric_difference">
		<text>
			auto pos = std::set_symmetric_difference(std::begin(%\m C%),
			  std::end(%\m C%), std::begin(%\c), std::end(%\c), std::begin(%\c));
		</text>
	</p>
	<p n="ipm" en="inplace_merge">
		<text>
			std::inplace_merge(std::begin(%\m C%), std::end(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="mov" en="move">
		<text>
			std::move(std::begin(%\m C%), std::end(%\m C%), std::begin(%\m C%));
		</text>
	</p>
	<p n="mvb" en="move_backward">
		<text>
			std::move_backward(std::begin(%\m C%), std::end(%\m C%), std::end(%\m C%));
		</text>
	</p>
	<p n="swp" en="swap">
		<text>
			std::swap(%\m C%, %\c);
		</text>
	</p>
</algorithm-mnemonics>