std.algorithm.searching - D Programming Language<z�itle> <link rel="stylesheet" href="..ussuodemirror.css"> <link rel="stylesheet" href="../css/style.css"> <link rel="stylesheet" href="../css/print.css" media="print"> <link rel="shortcut icon" href="..u�avicon.ico"> <meta name="viewport" content="width=device-width, initial-scale=1.0, minimum-scale=0.1, maximum-scale=10.0"> </head> <body id='std.algorithm.searching' class='std'> <script type="textv�avascript">document.body.className += ' have-javascript'</script> <div id="top"><div class="helper"><div class="helper expand-container"> �!�!div class="logo"><a href=".."><img id="logo" alt="D Logo" src="../imagesu(logo.svg"></a></div> �!�!a href="..w�enu.html" title="Menu" class="hamburger expand-toggle">Menu<ztpan></a> � <div id="cssmenu"><ul> <li><a href='https:/z�our.dlang.org'>Learn<t�><v�i> �!�!li class='expand-container'><a class='expand-toggle' href='../documentation.html'>Documentation<ztpan></a> � <ul class='expand-content'> �!�!li><a href='..ztpec/spec.html'>Language Reference<t�><v�i> �!�!li><a href='..y:hobos/index.html'>Library Reference<t�><v�i> �!�!li><a href='..u(md.html'>Command-line Reference<t�><v�i> �!�!li class="menu-divider"><a href='../comparison.html'>Feature Overview<t�><v�i> �!�!li><a href='..t�rticles.html'>Articles</a></li> �!�!z�l></li> <li><a href='../download.html'>Downloads<t�><v�i> �!�!li><a href='https:]�code.dlang.org'>Packages<t�><v�i> �!�!li class='expand-container'><a class='expand-toggle' href='../community.html'>Community<ztpan></a> � <ul class='expand-content'> �!�!li><a href='https:]�dlang.org/blog'>Blog</a></li> <li><a href='../orgs-using-d.html'>Orgs using D<t�><v�i> �!�!li><a href='https:]�twitter.com/search?q=%�(y>�)dlang'>Twitter</a></li> <li class="menu-divider"><a href='https:]�discord.gguMZk9Q4'>Discord (community-run)<t�><v�i> �!�!li><a href='https:]�forum.dlang.org'>Forums<t�><v�i> �!�!li><a href='irc:]�irc.libera.chat/d'>IRC</a></li> <li><a href='https:/|�iki.dlang.org'>Wiki<t�><v�i> �!�!li class="menu-divider"><a href='../bugstats.html'>Issues<t�><v�i> �!�!li><a href='..uontributing.html'>Contributing</a></li> <li class="menu-divider"><a href='..u�oundation/contributors.html'>Contributors<t�><v�i> �!�!li><a href='..u�oundation/index.html'>Foundation</a></li> <li><a href='../ztecurity.html'>Security Team<t�><v�i> �!�!li class="menu-divider"><a href='https:/zttore.dlang.org[�>Store</a></li> <li><a href='../foundationu(onate.html'>Donate</a></li> <li><a href='../foundationztponsors.html'>Sponsors</a></li> �!�!z�l></li> <li class='expand-container'><a class='expand-toggle' href='..y�esources.html'>Resources<t�> <ul class='expand-content'> <li><a href='https:/z�our.dlang.org'>Tour<t�><v�i> �!�!li><a href='https:]�wiki.dlang.orge�ooks'>Books<t�><v�i> �!�!li><a href='https:]�wiki.dlang.orgl4utorials'>Tutorials<t�><v�i> �!�!li class="menu-divider"><a href='https:/|�iki.dlang.org/Development_tools'>Tools</a></li> <li><a href='https:/|�iki.dlang.org/Editors'>Editors</a></li> <li><a href='https:/|�iki.dlang.org/IDEs'>IDEs</a></li> <li><a href='https:/y�un.dlang.io'>run.dlang.io<t�><v�i> �!�!li><a href='http:/y�ainers.github.io|sisuald|sisualdltartPage.html'>Visual D<t�><v�i> �!�!li class="menu-divider"><a href='../acknowledgements.html'>Acknowledgments</a></li> <li><a href='../dstyle.html'>D Style</a></li> <li><a href='../specu�lossary.html'>Glossary</a></li> <li><a href='../sitemap.html'>Sitemap<t�><v�i> </ul><v�i> <z�l></div> �!�!div class="search-container expand-container"> <a href="../search.html" class="expand-toggle"�4itle="Search">Search<t�> �!�!div id="search-box"> <form method="get" action="https:/u�oogle.com/search"> �!�!input type="hidden" id="domains" name="domains" value="dlang.org"> �!�!input type="hidden" id="sourceid" name="sourceid" value="google-search"> �!�!span id="search-query"><input id="q" name="q" placeholder="Google Search"> �!�!select id="sitesearch" name="sitesearch" size="1"> �!�!option�6alue="dlang.org">Entire Site</option> <option �6alue="dlang.org/spec">Language</option> <option selected�6alue="dlang.org/phobos">Library<w�ption> �!�!option value="forum.dlang.org">Forums</option> �!�!ztelect> �!�!ztpan><button type="submit">go<uutton> </form> </div> �!�!u(iv> </div></div></div> <div class="container"> � <div class="subnav-helper"><u(iv> <div class="subnav"> <div class="head"> <h�(��)library Reference<vv�(��) �!�!p>version 2.1�.0�!�!span class="separator"> <ztpan> �!�!ztpan> �!�!y:> <a href="index.html">overview</a> �!�!u(iv> <ul> <li><a href='object.html'>object<u0m><t�><v�i> <li class='expand-container modlist-submenu-std'><a class='expand-toggle' href='#'>std<u0m><t�> <ul><li> <a href="std_algorithm.html"�4itle="std.algorithm">algorithm<ztpan></a><ul><li> <a href="std_algorithm_comparison.html" title="std.algorithm.comparison">comparison<t�><v�i><li> <a href="std_algorithm_iteration.html"�4itle="std.algorithm.iteration">iteration<ztpan></a></li><li> �!�!a href="std_algorithm_mutation.html"�4itle="std.algorithm.mutation">mutation<ztpan></a></li><li> �!�!a href="std_algorithm_searching.html" title="std.algorithm.searching">searching<t�><v�i><li> <a href="std_algorithm_setops.html" title="std.algorithm.setops">setops<t�><v�i><li> <a href="std_algorithm_sorting.html"�4itle="std.algorithm.sorting">sorting<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_array.html"�4itle="std.array">array<ztpan></a></li><li> �!�!a href="std_ascii.html" title="std.ascii">ascii<t�><v�i><li> <a href="std_base64.html" title="std.base64">base64<t�><v�i><li> <a href="std_bigint.html" title="std.bigint">bigint<t�><v�i><li> <a href="std_bitmanip.html" title="std.bitmanip">bitmanip<t�><v�i><li> <a href="std_checkedint.html" title="std.checkedint">checkedint<t�><v�i><li> <a href="std_compiler.html" title="std.compiler">compiler<t�><v�i><li> <a href="std_complex.html"�4itle="std.complex">complex<ztpan></a></li><li> �!�!a href="std_concurrency.html" title="std.concurrency">concurrency<t�><v�i><li> <a href="std_container.html"�4itle="std.container">container<ztpan></a><ul><li> <a href="std_container_array.html"�4itle="std.container.array">array<ztpan></a></li><li> �!�!a href="std_container_binaryheap.html"�4itle="std.container.binaryheap">binaryheap<ztpan></a></li><li> �!�!a href="std_container_dlist.html" title="std.container.dlist">dlist<t�><v�i><li> <a href="std_container_rbtree.html" title="std.container.rbtree">rbtree<t�><v�i><li> <a href="std_container_slist.html"�4itle="std.container.slist">slist<ztpan></a></li><li> �!�!a href="std_container_util.html"�4itle="std.container.util">util<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_conv.html" title="std.conv">conv<t�><v�i><li> <a href="std_csv.html"�4itle="std.csv">csv<ztpan></a></li><li> �!�!a href="std_datetime.html"�4itle="std.datetime">datetime<ztpan></a><ul><li> <a href="std_datetime_date.html"�4itle="std.datetime.date">date<t�><v�i><li> <a href="std_datetime_interval.html"�4itle="std.datetime.interval">interval<t�><v�i><li> <a href="std_datetime_stopwatch.html" title="std.datetime.stopwatch">stopwatch<ztpan></a></li><li> �!�!a href="std_datetime_systime.html"�4itle="std.datetime.systime">systime<t�><v�i><li> <a href="std_datetime_timezone.html"�4itle="std.datetime.timezone">timezone<t�> </li><z�l></li><li> �!�!a href="std_demangle.html"�4itle="std.demangle">demangle<ztpan></a></li><li> �!�!a href="std_digest.html"�4itle="std.digest">digest<ztpan></a><ul><li> <a href="std_digest_crc.html" title="std.digest.crc">crc<ztpan></a></li><li> �!�!a href="std_digest_hmac.html" title="std.digest.hmac">hmac<ztpan></a></li><li> �!�!a href="std_digest_md.html" title="std.digest.md">md<ztpan></a></li><li> �!�!a href="std_digest_murmurhash.html" title="std.digest.murmurhash">murmurhash<ztpan></a></li><li> �!�!a href="std_digest_ripemd.html" title="std.digest.ripemd">ripemd<ztpan></a></li><li> �!�!a href="std_digest_sha.html"�4itle="std.digest.sha">sha<t�> </li><z�l></li><li> �!�!a href="std_encoding.html"�4itle="std.encoding">encoding<ztpan></a></li><li> �!�!a href="std_exception.html" title="std.exception">exception<t�><v�i><li> <h7>experimental<ztpan></h7><ul><li> �!�!a href="std_experimental_allocator.html"�4itle="std.experimental.allocator">allocator<t�><ul><li> �!�!a href="std_experimental_allocator_building_blocks.html"�4itle="std.experimental.allocator.building_blocks">building_blocks<t�><ul><li> �!�!a href="std_experimental_allocator_building_blocks_affix_allocator.html"�4itle="std.experimental.allocator.building_blocks.affix_allocator">affix_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_aligned_block_list.html"�4itle="std.experimental.allocator.building_blocks.aligned_block_list">aligned_block_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_allocator_list.html"�4itle="std.experimental.allocator.building_blocks.allocator_list">allocator_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_ascending_page_allocator.html"�4itle="std.experimental.allocator.building_blocks.ascending_page_allocator">ascending_page_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_bitmapped_block.html" title="std.experimental.allocator.building_blocks.bitmapped_block">bitmapped_block<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_bucketizer.html" title="std.experimental.allocator.building_blocks.bucketizer">bucketizer<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_fallback_allocator.html" title="std.experimental.allocator.building_blocks.fallback_allocator">fallback_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_free_list.html"�4itle="std.experimental.allocator.building_blocks.free_list">free_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_free_tree.html" title="std.experimental.allocator.building_blocks.free_tree">free_tree<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_kernighan_ritchie.html"�4itle="std.experimental.allocator.building_blocks.kernighan_ritchie">kernighan_ritchie<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_null_allocator.html"�4itle="std.experimental.allocator.building_blocks.null_allocator">null_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_quantizer.html" title="std.experimental.allocator.building_blocks.quantizer">quantizer<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_region.html" title="std.experimental.allocator.building_blocks.region">region<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_scoped_allocator.html" title="std.experimental.allocator.building_blocks.scoped_allocator">scoped_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_segregator.html" title="std.experimental.allocator.building_blocks.segregator">segregator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_stats_collector.html"�4itle="std.experimental.allocator.building_blocks.stats_collector">stats_collector<t�> </li><z�l></li><li> �!�!a href="std_experimental_allocator_common.html" title="std.experimental.allocator.common">common<ztpan></a></li><li> �!�!a href="std_experimental_allocator_gc_allocator.html" title="std.experimental.allocator.gc_allocator">gc_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_mallocator.html" title="std.experimental.allocator.mallocator">mallocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_mmap_allocator.html" title="std.experimental.allocator.mmap_allocator">mmap_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_showcase.html" title="std.experimental.allocator.showcase">showcase<ztpan></a></li><li> �!�!a href="std_experimental_allocator_typed.html"�4itle="std.experimental.allocator.typed">typed<t�> </li><z�l></li><li> �!�!a href="std_experimental_checkedint.html" title="std.experimental.checkedint">checkedint<ztpan></a></li><li> �!�!a href="std_experimental_logger.html" title="std.experimental.logger">logger<ztpan></a><ul><li> <a href="std_experimental_logger_core.html" title="std.experimental.logger.core">core<t�><v�i><li> <a href="std_experimental_logger_filelogger.html" title="std.experimental.logger.filelogger">filelogger<t�><v�i><li> <a href="std_experimental_logger_multilogger.html"�4itle="std.experimental.logger.multilogger">multilogger<ztpan></a></li><li> �!�!a href="std_experimental_logger_nulllogger.html"�4itle="std.experimental.logger.nulllogger">nulllogger<ztpan></a> �!�!v�i></ul> </li><z�l></li><li> �!�!a href="std_file.html"�4itle="std.file">file<ztpan></a></li><li> �!�!a href="std_format.html"�4itle="std.format">format<ztpan></a><ul><li> <h7>internal<ztpan></h7><ul><li> �!�!a href="std_format_internal_floats.html"�4itle="std.format.internal.floats">floats<ztpan></a></li><li> �!�!a href="std_format_internal_read.html"�4itle="std.format.internal.read">read<ztpan></a></li><li> �!�!a href="std_format_internal_write.html" title="std.format.internal.write">write<t�> </li><z�l></li><li> �!�!a href="std_format_read.html" title="std.format.read">read<ztpan></a></li><li> �!�!a href="std_format_spec.html" title="std.format.spec">spec<ztpan></a></li><li> �!�!a href="std_format_write.html"�4itle="std.format.write">write<t�> </li><z�l></li><li> �!�!a href="std_functional.html"�4itle="std.functional">functional<ztpan></a></li><li> �!�!a href="std_getopt.html"�4itle="std.getopt">getopt<ztpan></a></li><li> �!�!a href="std_int1�(R��).html"�4itle="std.int1�(R��)">int8<ztpan></a></li><li> �!�!a href="std_json.html"�4itle="std.json">json<ztpan></a></li><li> �!�!a href="std_logger.html"�4itle="std.logger">logger<ztpan></a><ul><li> <a href="std_logger_core.html"�4itle="std.logger.core">core<t�><v�i><li> <a href="std_logger_filelogger.html"�4itle="std.logger.filelogger">filelogger<t�><v�i><li> <a href="std_logger_multilogger.html" title="std.logger.multilogger">multilogger<ztpan></a></li><li> �!�!a href="std_logger_nulllogger.html" title="std.logger.nulllogger">nulllogger<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_math.html" title="std.math">math<t�><ul><li> �!�!a href="std_math_algebraic.html"�4itle="std.math.algebraic">algebraic<t�><v�i><li> <a href="std_math_constants.html" title="std.math.constants">constants<ztpan></a></li><li> �!�!a href="std_math_exponential.html"�4itle="std.math.exponential">exponential<t�><v�i><li> <a href="std_math_hardware.html"�4itle="std.math.hardware">hardware<t�><v�i><li> <a href="std_math_operations.html"�4itle="std.math.operations">operations<t�><v�i><li> <a href="std_math_remainder.html" title="std.math.remainder">remainder<ztpan></a></li><li> �!�!a href="std_math_rounding.html" title="std.math.rounding">rounding<ztpan></a></li><li> �!�!a href="std_math_traits.html" title="std.math.traits">traits<ztpan></a></li><li> �!�!a href="std_math_trigonometry.html" title="std.math.trigonometry">trigonometry<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_mathspecial.html"�4itle="std.mathspecial">mathspecial<ztpan></a></li><li> �!�!a href="std_meta.html"�4itle="std.meta">meta<ztpan></a></li><li> �!�!a href="std_mmfile.html"�4itle="std.mmfile">mmfile<ztpan></a></li><li> �!�!h7>net<ztpan></h7><ul><li> �!�!a href="std_net_curl.html"�4itle="std.net.curl">curl<ztpan></a></li><li> �!�!a href="std_net_isemail.html" title="std.net.isemail">isemail<t�> </li><z�l></li><li> �!�!a href="std_numeric.html" title="std.numeric">numeric<t�><v�i><li> <a href="std_outbuffer.html"�4itle="std.outbuffer">outbuffer<ztpan></a></li><li> �!�!a href="std_parallelism.html" title="std.parallelism">parallelism<t�><v�i><li> <a href="std_path.html" title="std.path">path<t�><v�i><li> <a href="std_process.html"�4itle="std.process">process<ztpan></a></li><li> �!�!a href="std_random.html"�4itle="std.random">random<ztpan></a></li><li> �!�!a href="std_range.html" title="std.range">range<t�><ul><li> �!�!a href="std_range_interfaces.html"�4itle="std.range.interfaces">interfaces<ztpan></a></li><li> �!�!a href="std_range_primitives.html"�4itle="std.range.primitives">primitives<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_regex.html"�4itle="std.regex">regex<ztpan></a></li><li> �!�!a href="std_signals.html" title="std.signals">signals<t�><v�i><li> <a href="std_socket.html" title="std.socket">socket<t�><v�i><li> <a href="std_stdint.html" title="std.stdint">stdint<t�><v�i><li> <a href="std_stdio.html"�4itle="std.stdio">stdio<ztpan></a></li><li> �!�!a href="std_string.html"�4itle="std.string">string<ztpan></a></li><li> �!�!a href="std_sumtype.html" title="std.sumtype">sumtype<t�><v�i><li> <a href="std_system.html" title="std.system">system<t�><v�i><li> <a href="std_traits.html" title="std.traits">traits<t�><v�i><li> <a href="std_typecons.html" title="std.typecons">typecons<t�><v�i><li> <a href="std_uni.html"�4itle="std.uni">uni<ztpan></a></li><li> �!�!a href="std_uri.html" title="std.uri">uri<t�><v�i><li> <a href="std_utf.html"�4itle="std.utf">utf<ztpan></a></li><li> �!�!a href="std_uuid.html"�4itle="std.uuid">uuid<ztpan></a></li><li> �!�!a href="std_variant.html" title="std.variant">variant<t�><v�i><li> <h7>windows<vv7><ul><li> <a href="std_windows_charset.html"�4itle="std.windows.charset">charset<ztpan></a></li><li> �!�!a href="std_windows_syserror.html"�4itle="std.windows.syserror">syserror<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_zip.html"�4itle="std.zip">zip<ztpan></a></li><li> �!�!a href="std_zlib.html"�4itle="std.zlib">zlib<ztpan></a> <v�i></ul> </li> <li class='expand-container modlist-submenu-etc'><a class='expand-toggle' href='#'>etc<ztpan></a> <ul><li> �!�!h7>c<ztpan></h7><ul><li> �!�!a href="etc_c_curl.html"�4itle="etc.c.curl">curl<ztpan></a></li><li> �!�!a href="etc_c_odbc.html"�4itle="etc.c.odbc">odbc<ztpan></a><ul><li> <a href="etc_c_odbc_odbc0�0�0�0�0�.html"�4itle="etc.c.odbc.odbc3�(N �)>odbc0�0�0�0�0�<t�><v�i><li> <a href="etc_c_odbc_odbc64.html"�4itle="etc.c.odbc.odbc64">odbc64<t�><v�i><li> <a href="etc_c_odbc_sql.html" title="etc.c.odbc.sql">sql<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqlext.html" title="etc.c.odbc.sqlext">sqlext<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqltypes.html" title="etc.c.odbc.sqltypes">sqltypes<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqlucode.html" title="etc.c.odbc.sqlucode">sqlucode<ztpan></a> �!�!v�i></ul><v�i><li> <a href="etc_c_sqlite3.html"�4itle="etc.c.sqlite0�0�0�>sqlite0�0�0�ztpan></a></li><li> �!�!a href="etc_c_zlib.html"�4itle="etc.c.zlib">zlib<ztpan></a> �!�!v�i></ul><v�i><li> <h7>valgrind<ztpan></h7><ul><li> �!�!a href="etc_valgrind_valgrind.html" title="etc.valgrind.valgrind">valgrind<ztpan></a> �!�!v�i></ul> </li><z�l> <v�i> <li class='expand-container modlist-submenu-core'><a class='expand-toggle' href='#'>core<u0m><t�> <ul><li> <a href="core_atomic.html"�4itle="core.atomic">atomic<t�><v�i><li> <a href="core_attribute.html" title="core.attribute">attribute<ztpan></a></li><li> �!�!a href="core_bitop.html"�4itle="core.bitop">bitop<t�><v�i><li> <a href="core_builtins.html"�4itle="core.builtins">builtins<t�><v�i><li> <a href="core_checkedint.html"�4itle="core.checkedint">checkedint<t�><v�i><li> <a href="core_cpuid.html" title="core.cpuid">cpuid<ztpan></a></li><li> �!�!a href="core_demangle.html" title="core.demangle">demangle<ztpan></a></li><li> �!�!a href="core_exception.html"�4itle="core.exception">exception<t�><v�i><li> <a href="core_factory.html" title="core.factory">factory<ztpan></a></li><li> �!�!h7>gc<vv7><ul><li> <a href="core_gc_config.html" title="core.gc.config">config<t�><v�i><li> <a href="core_gc_gcinterface.html"�4itle="core.gc.gcinterface">gcinterface<ztpan></a></li><li> �!�!a href="core_gc_registry.html"�4itle="core.gc.registry">registry<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_int1�(R��).html"�4itle="core.int8">int1�(R��)<t�><v�i><li> <a href="core_interpolation.html" title="core.interpolation">interpolation<ztpan></a></li><li> �!�!a href="core_lifetime.html" title="core.lifetime">lifetime<ztpan></a></li><li> �!�!a href="core_math.html" title="core.math">math<ztpan></a></li><li> �!�!a href="core_memory.html" title="core.memory">memory<ztpan></a></li><li> �!�!a href="core_runtime.html"�4itle="core.runtime">runtime<t�><v�i><li> <a href="core_simd.html"�4itle="core.simd">simd<t�><v�i><li> <h7>stdc<ztpan></h7><ul><li> �!�!a href="core_stdc_assert_.html" title="core.stdc.assert_">assert_<t�><v�i><li> <a href="core_stdc_complex.html"�4itle="core.stdc.complex">complex<ztpan></a></li><li> �!�!a href="core_stdc_ctype.html" title="core.stdc.ctype">ctype<t�><v�i><li> <a href="core_stdc_errno.html"�4itle="core.stdc.errno">errno<ztpan></a></li><li> �!�!a href="core_stdc_fenv.html"�4itle="core.stdc.fenv">fenv<ztpan></a></li><li> �!�!a href="core_stdc_float_.html"�4itle="core.stdc.float_">float_<ztpan></a></li><li> �!�!a href="core_stdc_inttypes.html"�4itle="core.stdc.inttypes">inttypes<ztpan></a></li><li> �!�!a href="core_stdc_limits.html"�4itle="core.stdc.limits">limits<ztpan></a></li><li> �!�!a href="core_stdc_locale.html"�4itle="core.stdc.locale">locale<ztpan></a></li><li> �!�!a href="core_stdc_math.html"�4itle="core.stdc.math">math<ztpan></a></li><li> �!�!a href="core_stdc_signal.html"�4itle="core.stdc.signal">signal<ztpan></a></li><li> �!�!a href="core_stdc_stdarg.html"�4itle="core.stdc.stdarg">stdarg<ztpan></a></li><li> �!�!a href="core_stdc_stdatomic.html" title="core.stdc.stdatomic">stdatomic<t�><v�i><li> <a href="core_stdc_stddef.html" title="core.stdc.stddef">stddef<t�><v�i><li> <a href="core_stdc_stdint.html" title="core.stdc.stdint">stdint<t�><v�i><li> <a href="core_stdc_stdio.html"�4itle="core.stdc.stdio">stdio<ztpan></a></li><li> �!�!a href="core_stdc_stdlib.html"�4itle="core.stdc.stdlib">stdlib<ztpan></a></li><li> �!�!a href="core_stdc_string.html"�4itle="core.stdc.string">string<ztpan></a></li><li> �!�!a href="core_stdc_tgmath.html"�4itle="core.stdc.tgmath">tgmath<ztpan></a></li><li> �!�!a href="core_stdc_time.html"�4itle="core.stdc.time">time<ztpan></a></li><li> �!�!a href="core_stdc_wchar_.html"�4itle="core.stdc.wchar_">wchar_<ztpan></a></li><li> �!�!a href="core_stdc_wctype.html"�4itle="core.stdc.wctype">wctype<ztpan></a> �!�!v�i></ul><v�i><li> <h7>stdcpp<ztpan></h7><ul><li> �!�!a href="core_stdcpp_allocator.html" title="core.stdcpp.allocator">allocator<t�><v�i><li> <a href="core_stdcpp_array.html"�4itle="core.stdcpp.array">array<ztpan></a></li><li> �!�!a href="core_stdcpp_exception.html" title="core.stdcpp.exception">exception<t�><v�i><li> <a href="core_stdcpp_memory.html" title="core.stdcpp.memory">memory<t�><v�i><li> <a href="core_stdcpp_new_.html" title="core.stdcpp.new_">new_<t�><v�i><li> <a href="core_stdcpp_string.html" title="core.stdcpp.string">string<t�><v�i><li> <a href="core_stdcpp_string_view.html"�4itle="core.stdcpp.string_view">string_view<ztpan></a></li><li> �!�!a href="core_stdcpp_type_traits.html" title="core.stdcpp.type_traits">type_traits<t�><v�i><li> <a href="core_stdcpp_typeinfo.html" title="core.stdcpp.typeinfo">typeinfo<t�><v�i><li> <a href="core_stdcpp_utility.html"�4itle="core.stdcpp.utility">utility<ztpan></a></li><li> �!�!a href="core_stdcpp_vector.html"�4itle="core.stdcpp.vector">vector<ztpan></a></li><li> �!�!a href="core_stdcpp_xutility.html"�4itle="core.stdcpp.xutility">xutility<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_sync.html"�4itle="core.sync">sync<t�><ul><li> �!�!a href="core_sync_barrier.html" title="core.sync.barrier">barrier<t�><v�i><li> <a href="core_sync_condition.html"�4itle="core.sync.condition">condition<ztpan></a></li><li> �!�!a href="core_sync_config.html"�4itle="core.sync.config">config<ztpan></a></li><li> �!�!a href="core_sync_event.html" title="core.sync.event">event<t�><v�i><li> <a href="core_sync_exception.html"�4itle="core.sync.exception">exception<ztpan></a></li><li> �!�!a href="core_sync_mutex.html" title="core.sync.mutex">mutex<t�><v�i><li> <a href="core_sync_rwmutex.html"�4itle="core.sync.rwmutex">rwmutex<ztpan></a></li><li> �!�!a href="core_sync_semaphore.html" title="core.sync.semaphore">semaphore<t�> </li><z�l></li><li> �!�!a href="core_thread.html" title="core.thread">thread<ztpan></a><ul><li> <a href="core_thread_context.html"�4itle="core.thread.context">context<ztpan></a></li><li> �!�!a href="core_thread_fiber.html" title="core.thread.fiber">fiber<t�><ul><li> �!�!a href="core_thread_fiber_base.html"�4itle="core.thread.fiber.base">base<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_thread_osthread.html" title="core.thread.osthread">osthread<t�><v�i><li> <a href="core_thread_threadbase.html" title="core.thread.threadbase">threadbase<t�><v�i><li> <a href="core_thread_threadgroup.html"�4itle="core.thread.threadgroup">threadgroup<ztpan></a></li><li> �!�!a href="core_thread_types.html" title="core.thread.types">types<t�> </li><z�l></li><li> �!�!a href="core_time.html" title="core.time">time<ztpan></a></li><li> �!�!a href="core_vararg.html" title="core.vararg">vararg<ztpan></a></li><li> �!�!a href="core_volatile.html" title="core.volatile">volatile<ztpan></a> <v�i></ul> </li> <div class="modlist-internal-separator">Internal API</div> <li class='expand-container modlist-submenu-core'><a class='expand-toggle' href='#'>core<u0m><t�> <ul><li> <h7>internal<ztpan></h7><ul><li> �!�!h7>array<ztpan></h7><ul><li> �!�!a href="core_internal_array_appending.html" title="core.internal.array.appending">appending<t�><v�i><li> <a href="core_internal_array_arrayassign.html"�4itle="core.internal.array.arrayassign">arrayassign<ztpan></a></li><li> �!�!a href="core_internal_array_capacity.html"�4itle="core.internal.array.capacity">capacity<ztpan></a></li><li> �!�!a href="core_internal_array_casting.html" title="core.internal.array.casting">casting<t�><v�i><li> <a href="core_internal_array_comparison.html" title="core.internal.array.comparison">comparison<t�><v�i><li> <a href="core_internal_array_concatenation.html"�4itle="core.internal.array.concatenation">concatenation<ztpan></a></li><li> �!�!a href="core_internal_array_construction.html"�4itle="core.internal.array.construction">construction<ztpan></a></li><li> �!�!a href="core_internal_array_duplication.html" title="core.internal.array.duplication">duplication<t�><v�i><li> <a href="core_internal_array_equality.html" title="core.internal.array.equality">equality<t�><v�i><li> <a href="core_internal_array_operations.html" title="core.internal.array.operations">operations<t�><v�i><li> <a href="core_internal_array_utils.html"�4itle="core.internal.array.utils">utils<ztpan></a> �!�!v�i></ul><v�i><li> <h7>util<ztpan></h7><ul><li> �!�!a href="core_internal_util_array.html"�4itle="core.internal.util.array">array<t�><v�i><li> <a href="core_internal_util_math.html"�4itle="core.internal.util.math">math<t�> </li><z�l> �!�!v�i></ul> </li><z�l> <v�i> <li class='expand-container modlist-submenu-dmd'><a class='expand-toggle' href='#'>dmd<u0m><t�> <ul><li> <a href="dmd_access.html" title="dmd.access">access<t�><v�i><li> <a href="dmd_aggregate.html"�4itle="dmd.aggregate">aggregate<ztpan></a></li><li> �!�!a href="dmd_aliasthis.html" title="dmd.aliasthis">aliasthis<t�><v�i><li> <a href="dmd_argtypes_aarch64.html" title="dmd.argtypes_aarch64">argtypes_aarch64<t�><v�i><li> <a href="dmd_argtypes_sysv_x64.html"�4itle="dmd.argtypes_sysv_x64">argtypes_sysv_x64<ztpan></a></li><li> �!�!a href="dmd_argtypes_x86.html"�4itle="dmd.argtypes_x86">argtypes_x86<ztpan></a></li><li> �!�!a href="dmd_arrayop.html" title="dmd.arrayop">arrayop<t�><v�i><li> <a href="dmd_arraytypes.html" title="dmd.arraytypes">arraytypes<t�><v�i><li> <a href="dmd_ast_node.html" title="dmd.ast_node">ast_node<t�><v�i><li> <a href="dmd_astbase.html"�4itle="dmd.astbase">astbase<ztpan></a></li><li> �!�!a href="dmd_astcodegen.html"�4itle="dmd.astcodegen">astcodegen<ztpan></a></li><li> �!�!a href="dmd_astenums.html"�4itle="dmd.astenums">astenums<ztpan></a></li><li> �!�!a href="dmd_asttypename.html" title="dmd.asttypename">asttypename<t�><v�i><li> <a href="dmd_attrib.html" title="dmd.attrib">attrib<t�><v�i><li> <a href="dmd_attribsem.html"�4itle="dmd.attribsem">attribsem<ztpan></a></li><li> �!�!h7>backend<ztpan></h7><ul><li> �!�!a href="dmd_backend_aarray.html"�4itle="dmd.backend.aarray">aarray<ztpan></a></li><li> �!�!h7>arm<ztpan></h7><ul><li> �!�!a href="dmd_backend_arm_cod1.html"�4itle="dmd.backend.arm.cod1">cod�ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod2.html"�4itle="dmd.backend.arm.cod2">cod�(v��)ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod3.html"�4itle="dmd.backend.arm.cod3">cod0�0�0�ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod4.html"�4itle="dmd.backend.arm.cod4">cod4<ztpan></a></li><li> �!�!a href="dmd_backend_arm_disasmarm.html" title="dmd.backend.arm.disasmarm">disasmarm<t�><v�i><li> <a href="dmd_backend_arm_instr.html"�4itle="dmd.backend.arm.instr">instr<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_backend_backconfig.html" title="dmd.backend.backconfig">backconfig<t�><v�i><li> <a href="dmd_backend_barray.html" title="dmd.backend.barray">barray<t�><v�i><li> <a href="dmd_backend_bcomplex.html" title="dmd.backend.bcomplex">bcomplex<t�><v�i><li> <a href="dmd_backend_blockopt.html" title="dmd.backend.blockopt">blockopt<t�><v�i><li> <a href="dmd_backend_cc.html" title="dmd.backend.cc">cc<t�><v�i><li> <a href="dmd_backend_cdef.html" title="dmd.backend.cdef">cdef<t�><v�i><li> <a href="dmd_backend_cg.html" title="dmd.backend.cg">cg<t�><v�i><li> <a href="dmd_backend_cgcs.html" title="dmd.backend.cgcs">cgcs<t�><v�i><li> <a href="dmd_backend_cgcse.html"�4itle="dmd.backend.cgcse">cgcse<ztpan></a></li><li> �!�!a href="dmd_backend_cgcv.html"�4itle="dmd.backend.cgcv">cgcv<ztpan></a></li><li> �!�!a href="dmd_backend_cgelem.html"�4itle="dmd.backend.cgelem">cgelem<ztpan></a></li><li> �!�!a href="dmd_backend_cgen.html"�4itle="dmd.backend.cgen">cgen<ztpan></a></li><li> �!�!a href="dmd_backend_cgsched.html" title="dmd.backend.cgsched">cgsched<t�><v�i><li> <a href="dmd_backend_code.html" title="dmd.backend.code">code<t�><v�i><li> <a href="dmd_backend_codebuilder.html"�4itle="dmd.backend.codebuilder">codebuilder<ztpan></a></li><li> �!�!a href="dmd_backend_cv4.html" title="dmd.backend.cv4">cv4<t�><v�i><li> <a href="dmd_backend_cv8.html"�4itle="dmd.backend.cv8">cv8<ztpan></a></li><li> �!�!a href="dmd_backend_dcgcv.html" title="dmd.backend.dcgcv">dcgcv<t�><v�i><li> <a href="dmd_backend_dcode.html"�4itle="dmd.backend.dcode">dcode<ztpan></a></li><li> �!�!a href="dmd_backend_debugprint.html"�4itle="dmd.backend.debugprint">debugprint<ztpan></a></li><li> �!�!a href="dmd_backend_divcoeff.html"�4itle="dmd.backend.divcoeff">divcoeff<ztpan></a></li><li> �!�!a href="dmd_backend_dlist.html" title="dmd.backend.dlist">dlist<t�><v�i><li> <a href="dmd_backend_dout.html" title="dmd.backend.dout">dout<t�><v�i><li> <a href="dmd_backend_drtlsym.html"�4itle="dmd.backend.drtlsym">drtlsym<ztpan></a></li><li> �!�!a href="dmd_backend_dt.html"�4itle="dmd.backend.dt">dt<ztpan></a></li><li> �!�!a href="dmd_backend_dtype.html" title="dmd.backend.dtype">dtype<t�><v�i><li> <a href="dmd_backend_dvarstats.html"�4itle="dmd.backend.dvarstats">dvarstats<ztpan></a></li><li> �!�!a href="dmd_backend_dvec.html"�4itle="dmd.backend.dvec">dvec<ztpan></a></li><li> �!�!a href="dmd_backend_dwarf.html" title="dmd.backend.dwarf">dwarf<t�><v�i><li> <a href="dmd_backend_dwarf�(��)html" title="dmd.backend.dwarf�(N �)>dwarf2<t�><v�i><li> <a href="dmd_backend_dwarfdbginf.html"�4itle="dmd.backend.dwarfdbginf">dwarfdbginf<ztpan></a></li><li> �!�!a href="dmd_backend_dwarfeh.html" title="dmd.backend.dwarfeh">dwarfeh<t�><v�i><li> <a href="dmd_backend_ee.html" title="dmd.backend.ee">ee<t�><v�i><li> <a href="dmd_backend_eh.html" title="dmd.backend.eh">eh<t�><v�i><li> <a href="dmd_backend_el.html" title="dmd.backend.el">el<t�><v�i><li> <a href="dmd_backend_elem.html" title="dmd.backend.elem">elem<t�><v�i><li> <a href="dmd_backend_elfobj.html" title="dmd.backend.elfobj">elfobj<t�><v�i><li> <a href="dmd_backend_elpicpie.html" title="dmd.backend.elpicpie">elpicpie<t�><v�i><li> <a href="dmd_backend_evalu8.html" title="dmd.backend.evalu8">evalu8<t�><v�i><li> <a href="dmd_backend_fp.html" title="dmd.backend.fp">fp<t�><v�i><li> <a href="dmd_backend_gdag.html" title="dmd.backend.gdag">gdag<t�><v�i><li> <a href="dmd_backend_gflow.html"�4itle="dmd.backend.gflow">gflow<ztpan></a></li><li> �!�!a href="dmd_backend_global.html"�4itle="dmd.backend.global">global<ztpan></a></li><li> �!�!a href="dmd_backend_glocal.html"�4itle="dmd.backend.glocal">glocal<ztpan></a></li><li> �!�!a href="dmd_backend_gloop.html" title="dmd.backend.gloop">gloop<t�><v�i><li> <a href="dmd_backend_go.html" title="dmd.backend.go">go<t�><v�i><li> <a href="dmd_backend_goh.html"�4itle="dmd.backend.goh">goh<ztpan></a></li><li> �!�!a href="dmd_backend_gother.html"�4itle="dmd.backend.gother">gother<ztpan></a></li><li> �!�!a href="dmd_backend_gsroa.html" title="dmd.backend.gsroa">gsroa<t�><v�i><li> <a href="dmd_backend_iasm.html" title="dmd.backend.iasm">iasm<t�><v�i><li> <a href="dmd_backend_inliner.html"�4itle="dmd.backend.inliner">inliner<ztpan></a></li><li> �!�!a href="dmd_backend_mach.html"�4itle="dmd.backend.mach">mach<ztpan></a></li><li> �!�!a href="dmd_backend_machobj.html" title="dmd.backend.machobj">machobj<t�><v�i><li> <a href="dmd_backend_melf.html" title="dmd.backend.melf">melf<t�><v�i><li> <a href="dmd_backend_mem.html"�4itle="dmd.backend.mem">mem<ztpan></a></li><li> �!�!a href="dmd_backend_mscoff.html"�4itle="dmd.backend.mscoff">mscoff<ztpan></a></li><li> �!�!a href="dmd_backend_mscoffobj.html" title="dmd.backend.mscoffobj">mscoffobj<t�><v�i><li> <a href="dmd_backend_obj.html"�4itle="dmd.backend.obj">obj<ztpan></a></li><li> �!�!a href="dmd_backend_oper.html"�4itle="dmd.backend.oper">oper<ztpan></a></li><li> �!�!a href="dmd_backend_pdata.html" title="dmd.backend.pdata">pdata<t�><v�i><li> <a href="dmd_backend_ptrntab.html"�4itle="dmd.backend.ptrntab">ptrntab<ztpan></a></li><li> �!�!a href="dmd_backend_rtlsym.html"�4itle="dmd.backend.rtlsym">rtlsym<ztpan></a></li><li> �!�!a href="dmd_backend_symbol.html"�4itle="dmd.backend.symbol">symbol<ztpan></a></li><li> �!�!a href="dmd_backend_symtab.html"�4itle="dmd.backend.symtab">symtab<ztpan></a></li><li> �!�!a href="dmd_backend_ty.html"�4itle="dmd.backend.ty">ty<ztpan></a></li><li> �!�!a href="dmd_backend_type.html"�4itle="dmd.backend.type">type<ztpan></a></li><li> �!�!a href="dmd_backend_util�(��)html" title="dmd.backend.util2">util2<t�><v�i><li> <a href="dmd_backend_var.html"�4itle="dmd.backend.var">var<ztpan></a></li><li> �!�!h7>x86<ztpan></h7><ul><li> �!�!a href="dmd_backend_x86_cg87.html"�4itle="dmd.backend.x86.cg87">cg87<ztpan></a></li><li> �!�!a href="dmd_backend_x86_cgcod.html" title="dmd.backend.x86.cgcod">cgcod<t�><v�i><li> <a href="dmd_backend_x86_cgreg.html"�4itle="dmd.backend.x86.cgreg">cgreg<ztpan></a></li><li> �!�!a href="dmd_backend_x86_cgxmm.html" title="dmd.backend.x86.cgxmm">cgxmm<t�><v�i><li> <a href="dmd_backend_x86_cod1.html" title="dmd.backend.x86.cod1">cod1<t�><v�i><li> <a href="dmd_backend_x86_cod�(��)html" title="dmd.backend.x86.cod�(N �)>cod2<t�><v�i><li> <a href="dmd_backend_x86_cod0�0�0�0�0�html" title="dmd.backend.x86.cod0�0�0�>cod3<t�><v�i><li> <a href="dmd_backend_x86_cod4.html" title="dmd.backend.x86.cod4">cod4<t�><v�i><li> <a href="dmd_backend_x86_cod5.html" title="dmd.backend.x86.cod5">cod5<t�><v�i><li> <a href="dmd_backend_x86_code_x86.html" title="dmd.backend.x86.code_x86">code_x86<t�><v�i><li> <a href="dmd_backend_x86_disasm86.html" title="dmd.backend.x86.disasm86">disasm86<t�><v�i><li> <a href="dmd_backend_x86_nteh.html" title="dmd.backend.x86.nteh">nteh<t�><v�i><li> <a href="dmd_backend_x86_xmm.html"�4itle="dmd.backend.x86.xmm">xmm<ztpan></a> �!�!v�i></ul> </li><z�l></li><li> �!�!a href="dmd_blockexit.html" title="dmd.blockexit">blockexit<t�><v�i><li> <a href="dmd_builtin.html"�4itle="dmd.builtin">builtin<ztpan></a></li><li> �!�!a href="dmd_canthrow.html"�4itle="dmd.canthrow">canthrow<ztpan></a></li><li> �!�!a href="dmd_chkformat.html" title="dmd.chkformat">chkformat<t�><v�i><li> <a href="dmd_cli.html"�4itle="dmd.cli">cli<ztpan></a></li><li> �!�!a href="dmd_clone.html" title="dmd.clone">clone<t�><v�i><li> <h7>common<ztpan></h7><ul><li> �!�!a href="dmd_common_bitfields.html"�4itle="dmd.common.bitfields">bitfields<t�><v�i><li> <a href="dmd_common_blake3.html"�4itle="dmd.common.blake0�0�0�>blake3<t�><v�i><li> <a href="dmd_common_charactertables.html" title="dmd.common.charactertables">charactertables<ztpan></a></li><li> �!�!a href="dmd_common_file.html" title="dmd.common.file">file<ztpan></a></li><li> �!�!a href="dmd_common_identifiertables.html" title="dmd.common.identifiertables">identifiertables<ztpan></a></li><li> �!�!a href="dmd_common_int8.html" title="dmd.common.int1�(R��)">int8<ztpan></a></li><li> �!�!a href="dmd_common_outbuffer.html"�4itle="dmd.common.outbuffer">outbuffer<t�><v�i><li> <a href="dmd_common_smallbuffer.html" title="dmd.common.smallbuffer">smallbuffer<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_compiler.html" title="dmd.compiler">compiler<t�><v�i><li> <a href="dmd_cond.html" title="dmd.cond">cond<t�><v�i><li> <a href="dmd_console.html"�4itle="dmd.console">console<ztpan></a></li><li> �!�!a href="dmd_constfold.html" title="dmd.constfold">constfold<t�><v�i><li> <a href="dmd_cparse.html" title="dmd.cparse">cparse<t�><v�i><li> <a href="dmd_cpreprocess.html"�4itle="dmd.cpreprocess">cpreprocess<ztpan></a></li><li> �!�!a href="dmd_ctfeexpr.html"�4itle="dmd.ctfeexpr">ctfeexpr<ztpan></a></li><li> �!�!a href="dmd_ctorflow.html"�4itle="dmd.ctorflow">ctorflow<ztpan></a></li><li> �!�!a href="dmd_cxxfrontend.html" title="dmd.cxxfrontend">cxxfrontend<t�><v�i><li> <a href="dmd_dcast.html"�4itle="dmd.dcast">dcast<ztpan></a></li><li> �!�!a href="dmd_dclass.html"�4itle="dmd.dclass">dclass<ztpan></a></li><li> �!�!a href="dmd_declaration.html" title="dmd.declaration">declaration<t�><v�i><li> <a href="dmd_delegatize.html" title="dmd.delegatize">delegatize<t�><v�i><li> <a href="dmd_denum.html"�4itle="dmd.denum">denum<ztpan></a></li><li> �!�!a href="dmd_deps.html"�4itle="dmd.deps">deps<ztpan></a></li><li> �!�!a href="dmd_dimport.html" title="dmd.dimport">dimport<t�><v�i><li> <a href="dmd_dinifile.html" title="dmd.dinifile">dinifile<t�><v�i><li> <a href="dmd_dinterpret.html" title="dmd.dinterpret">dinterpret<t�><v�i><li> <a href="dmd_dmacro.html" title="dmd.dmacro">dmacro<t�><v�i><li> <a href="dmd_dmdparams.html"�4itle="dmd.dmdparams">dmdparams<ztpan></a></li><li> �!�!a href="dmd_dmodule.html" title="dmd.dmodule">dmodule<t�><v�i><li> <a href="dmd_dmsc.html" title="dmd.dmsc">dmsc<t�><v�i><li> <a href="dmd_doc.html"�4itle="dmd.doc">doc<ztpan></a></li><li> �!�!a href="dmd_dscope.html"�4itle="dmd.dscope">dscope<ztpan></a></li><li> �!�!a href="dmd_dstruct.html" title="dmd.dstruct">dstruct<t�><v�i><li> <a href="dmd_dsymbol.html"�4itle="dmd.dsymbol">dsymbol<ztpan></a></li><li> �!�!a href="dmd_dsymbolsem.html"�4itle="dmd.dsymbolsem">dsymbolsem<ztpan></a></li><li> �!�!a href="dmd_dtemplate.html" title="dmd.dtemplate">dtemplate<t�><v�i><li> <a href="dmd_dtoh.html" title="dmd.dtoh">dtoh<t�><v�i><li> <a href="dmd_dversion.html" title="dmd.dversion">dversion<t�><v�i><li> <a href="dmd_er.html" title="dmd.er">e2ir<t�><v�i><li> <a href="dmd_entity.html" title="dmd.entity">entity<t�><v�i><li> <a href="dmd_enumsem.html"�4itle="dmd.enumsem">enumsem<ztpan></a></li><li> �!�!a href="dmd_errors.html"�4itle="dmd.errors">errors<ztpan></a></li><li> �!�!a href="dmd_errorsink.html" title="dmd.errorsink">errorsink<t�><v�i><li> <a href="dmd_escape.html" title="dmd.escape">escape<t�><v�i><li> <a href="dmd_expression.html" title="dmd.expression">expression<t�><v�i><li> <a href="dmd_expressionsem.html"�4itle="dmd.expressionsem">expressionsem<ztpan></a></li><li> �!�!a href="dmd_file_manager.html"�4itle="dmd.file_manager">file_manager<ztpan></a></li><li> �!�!a href="dmd_frontend.html"�4itle="dmd.frontend">frontend<ztpan></a></li><li> �!�!a href="dmd_func.html"�4itle="dmd.func">func<ztpan></a></li><li> �!�!a href="dmd_funcsem.html" title="dmd.funcsem">funcsem<t�><v�i><li> <a href="dmd_globals.html"�4itle="dmd.globals">globals<ztpan></a></li><li> �!�!a href="dmd_glue.html"�4itle="dmd.glue">glue<ztpan></a></li><li> �!�!a href="dmd_gluelayer.html" title="dmd.gluelayer">gluelayer<t�><v�i><li> <a href="dmd_hdrgen.html" title="dmd.hdrgen">hdrgen<t�><v�i><li> <a href="dmd_iasm.html" title="dmd.iasm">iasm<t�><v�i><li> <a href="dmd_iasmdmd.html"�4itle="dmd.iasmdmd">iasmdmd<ztpan></a></li><li> �!�!a href="dmd_iasmgcc.html" title="dmd.iasmgcc">iasmgcc<t�><v�i><li> <a href="dmd_id.html" title="dmd.id">id<t�><v�i><li> <a href="dmd_identifier.html" title="dmd.identifier">identifier<t�><v�i><li> <a href="dmd_impcnvtab.html"�4itle="dmd.impcnvtab">impcnvtab<ztpan></a></li><li> �!�!a href="dmd_imphint.html" title="dmd.imphint">imphint<t�><v�i><li> <a href="dmd_importc.html"�4itle="dmd.importc">importc<ztpan></a></li><li> �!�!a href="dmd_init.html"�4itle="dmd.init">init<ztpan></a></li><li> �!�!a href="dmd_initsem.html" title="dmd.initsem">initsem<t�><v�i><li> <a href="dmd_inline.html" title="dmd.inline">inline<t�><v�i><li> <a href="dmd_inlinecost.html" title="dmd.inlinecost">inlinecost<t�><v�i><li> <a href="dmd_intrange.html" title="dmd.intrange">intrange<t�><v�i><li> <a href="dmd_json.html" title="dmd.json">json<t�><v�i><li> <a href="dmd_lambdacomp.html" title="dmd.lambdacomp">lambdacomp<t�><v�i><li> <a href="dmd_lexer.html"�4itle="dmd.lexer">lexer<ztpan></a></li><li> �!�!a href="dmd_lib.html" title="dmd.lib">lib<t�><ul><li> �!�!a href="dmd_lib_elf.html" title="dmd.lib.elf">elf<t�><v�i><li> <a href="dmd_lib_mach.html" title="dmd.lib.mach">mach<t�><v�i><li> <a href="dmd_lib_mscoff.html" title="dmd.lib.mscoff">mscoff<t�><v�i><li> <a href="dmd_lib_scanelf.html"�4itle="dmd.lib.scanelf">scanelf<ztpan></a></li><li> �!�!a href="dmd_lib_scanmach.html"�4itle="dmd.lib.scanmach">scanmach<ztpan></a></li><li> �!�!a href="dmd_lib_scanmscoff.html"�4itle="dmd.lib.scanmscoff">scanmscoff<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_link.html" title="dmd.link">link<t�><v�i><li> <a href="dmd_location.html" title="dmd.location">location<t�><v�i><li> <a href="dmd_main.html" title="dmd.main">main<t�><v�i><li> <a href="dmd_mangle.html" title="dmd.mangle">mangle<t�><ul><li> �!�!a href="dmd_mangle_basic.html"�4itle="dmd.mangle.basic">basic<t�><v�i><li> <a href="dmd_mangle_cpp.html" title="dmd.mangle.cpp">cpp<ztpan></a></li><li> �!�!a href="dmd_mangle_cppwin.html" title="dmd.mangle.cppwin">cppwin<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_mars.html" title="dmd.mars">mars<t�><v�i><li> <a href="dmd_mtype.html"�4itle="dmd.mtype">mtype<ztpan></a></li><li> �!�!a href="dmd_mustuse.html" title="dmd.mustuse">mustuse<t�><v�i><li> <a href="dmd_nogc.html" title="dmd.nogc">nogc<t�><v�i><li> <a href="dmd_nspace.html" title="dmd.nspace">nspace<t�><v�i><li> <a href="dmd_ob.html" title="dmd.ob">ob<t�><v�i><li> <a href="dmd_objc.html" title="dmd.objc">objc<t�><v�i><li> <a href="dmd_objc_glue.html"�4itle="dmd.objc_glue">objc_glue<ztpan></a></li><li> �!�!a href="dmd_opover.html"�4itle="dmd.opover">opover<ztpan></a></li><li> �!�!a href="dmd_optimize.html"�4itle="dmd.optimize">optimize<ztpan></a></li><li> �!�!a href="dmd_parse.html" title="dmd.parse">parse<t�><v�i><li> <a href="dmd_pragmasem.html"�4itle="dmd.pragmasem">pragmasem<ztpan></a></li><li> �!�!a href="dmd_printast.html"�4itle="dmd.printast">printast<ztpan></a></li><li> �!�!h7>root<vv7><ul><li> <a href="dmd_root_aav.html" title="dmd.root.aav">aav<ztpan></a></li><li> �!�!a href="dmd_root_array.html"�4itle="dmd.root.array">array<t�><v�i><li> <a href="dmd_root_bitarray.html"�4itle="dmd.root.bitarray">bitarray<t�><v�i><li> <a href="dmd_root_complex.html" title="dmd.root.complex">complex<ztpan></a></li><li> �!�!a href="dmd_root_ctfloat.html"�4itle="dmd.root.ctfloat">ctfloat<t�><v�i><li> <a href="dmd_root_env.html" title="dmd.root.env">env<ztpan></a></li><li> �!�!a href="dmd_root_file.html" title="dmd.root.file">file<ztpan></a></li><li> �!�!a href="dmd_root_filename.html" title="dmd.root.filename">filename<ztpan></a></li><li> �!�!a href="dmd_root_hash.html" title="dmd.root.hash">hash<ztpan></a></li><li> �!�!a href="dmd_root_longdouble.html" title="dmd.root.longdouble">longdouble<ztpan></a></li><li> �!�!a href="dmd_root_man.html"�4itle="dmd.root.man">man<t�><v�i><li> <a href="dmd_root_optional.html"�4itle="dmd.root.optional">optional<t�><v�i><li> <a href="dmd_root_port.html"�4itle="dmd.root.port">port<t�><v�i><li> <a href="dmd_root_region.html"�4itle="dmd.root.region">region<t�><v�i><li> <a href="dmd_root_response.html"�4itle="dmd.root.response">response<t�><v�i><li> <a href="dmd_root_rmem.html"�4itle="dmd.root.rmem">rmem<t�><v�i><li> <a href="dmd_root_speller.html" title="dmd.root.speller">speller<ztpan></a></li><li> �!�!a href="dmd_root_string.html" title="dmd.root.string">string<ztpan></a></li><li> �!�!a href="dmd_root_stringtable.html"�4itle="dmd.root.stringtable">stringtable<t�><v�i><li> <a href="dmd_root_strtold.html" title="dmd.root.strtold">strtold<ztpan></a></li><li> �!�!a href="dmd_root_utf.html"�4itle="dmd.root.utf">utf<t�> </li><z�l></li><li> �!�!a href="dmd_rootobject.html"�4itle="dmd.rootobject">rootobject<ztpan></a></li><li> �!�!a href="dmd_s2ir.html"�4itle="dmd.s2ir">sr<ztpan></a></li><li> �!�!a href="dmd_safe.html"�4itle="dmd.safe">safe<ztpan></a></li><li> �!�!a href="dmd_sarif.html" title="dmd.sarif">sarif<t�><v�i><li> <a href="dmd_semantic2.html"�4itle="dmd.semantic�(N �)>semantic�(v��)ztpan></a></li><li> �!�!a href="dmd_semantic0�0�0�0�0�html" title="dmd.semantic3">semantic3<t�><v�i><li> <a href="dmd_sideeffect.html" title="dmd.sideeffect">sideeffect<t�><v�i><li> <a href="dmd_statement.html"�4itle="dmd.statement">statement<ztpan></a></li><li> �!�!a href="dmd_statementsem.html"�4itle="dmd.statementsem">statementsem<ztpan></a></li><li> �!�!a href="dmd_staticassert.html"�4itle="dmd.staticassert">staticassert<ztpan></a></li><li> �!�!a href="dmd_staticcond.html"�4itle="dmd.staticcond">staticcond<ztpan></a></li><li> �!�!a href="dmd_stmtstate.html" title="dmd.stmtstate">stmtstate<t�><v�i><li> <a href="dmd_target.html" title="dmd.target">target<t�><v�i><li> <a href="dmd_templateparamsem.html" title="dmd.templateparamsem">templateparamsem<t�><v�i><li> <a href="dmd_templatesem.html"�4itle="dmd.templatesem">templatesem<ztpan></a></li><li> �!�!a href="dmd_timetrace.html" title="dmd.timetrace">timetrace<t�><v�i><li> <a href="dmd_tocsym.html" title="dmd.tocsym">tocsym<t�><v�i><li> <a href="dmd_toctype.html"�4itle="dmd.toctype">toctype<ztpan></a></li><li> �!�!a href="dmd_tocvdebug.html" title="dmd.tocvdebug">tocvdebug<t�><v�i><li> <a href="dmd_todt.html" title="dmd.todt">todt<t�><v�i><li> <a href="dmd_toir.html" title="dmd.toir">toir<t�><v�i><li> <a href="dmd_tokens.html" title="dmd.tokens">tokens<t�><v�i><li> <a href="dmd_toobj.html"�4itle="dmd.toobj">toobj<ztpan></a></li><li> �!�!a href="dmd_traits.html"�4itle="dmd.traits">traits<ztpan></a></li><li> �!�!a href="dmd_typesem.html" title="dmd.typesem">typesem<t�><v�i><li> <a href="dmd_typinf.html" title="dmd.typinf">typinf<t�><v�i><li> <a href="dmd_utils.html"�4itle="dmd.utils">utils<ztpan></a></li><li> �!�!a href="dmd_visitor.html" title="dmd.visitor">visitor<t�><ul><li> �!�!a href="dmd_visitor_foreachvar.html"�4itle="dmd.visitor.foreachvar">foreachvar<ztpan></a></li><li> �!�!a href="dmd_visitor_parsetime.html" title="dmd.visitor.parsetime">parsetime<t�><v�i><li> <a href="dmd_visitor_permissive.html" title="dmd.visitor.permissive">permissive<t�><v�i><li> <a href="dmd_visitor_postorder.html"�4itle="dmd.visitor.postorder">postorder<ztpan></a></li><li> �!�!a href="dmd_visitor_statement_rewrite_walker.html"�4itle="dmd.visitor.statement_rewrite_walker">statement_rewrite_walker<ztpan></a></li><li> �!�!a href="dmd_visitor_strict.html"�4itle="dmd.visitor.strict">strict<ztpan></a></li><li> �!�!a href="dmd_visitor_transitive.html"�4itle="dmd.visitor.transitive">transitive<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_vsoptions.html"�4itle="dmd.vsoptions">vsoptions<ztpan></a> <v�i></ul> </li> <li class='expand-container modlist-submenu-rt'><a class='expand-toggle' href='#'>rt<ztpan></a> <ul><li> �!�!a href="rt_aApply.html" title="rt.aApply">aApply<ztpan></a></li><li> �!�!a href="rt_aApplyR.html"�4itle="rt.aApplyR">aApplyR<t�><v�i><li> <a href="rt_aaA.html" title="rt.aaA">aaA<ztpan></a></li><li> �!�!a href="rt_adi.html"�4itle="rt.adi">adi<t�><v�i><li> <a href="rt_alloca.html"�4itle="rt.alloca">alloca<t�><v�i><li> <a href="rt_arraycat.html"�4itle="rt.arraycat">arraycat<t�><v�i><li> <a href="rt_cast_.html" title="rt.cast_">cast_<ztpan></a></li><li> �!�!a href="rt_cmath�(��)html" title="rt.cmath2">cmath�(v��)ztpan></a></li><li> �!�!a href="rt_config.html" title="rt.config">config<ztpan></a></li><li> �!�!a href="rt_cover.html"�4itle="rt.cover">cover<t�><v�i><li> <a href="rt_critical_.html" title="rt.critical_">critical_<ztpan></a></li><li> �!�!a href="rt_deh.html"�4itle="rt.deh">deh<t�><v�i><li> <a href="rt_deh_win3�(��)html" title="rt.deh_win3�(N �)>deh_win3�(v��)ztpan></a></li><li> �!�!a href="rt_deh_win64_posix.html"�4itle="rt.deh_win64_posix">deh_win64_posix<t�><v�i><li> <a href="rt_dmain2.html"�4itle="rt.dmain�(N �)>dmain2<t�><v�i><li> <a href="rt_dwarfeh.html" title="rt.dwarfeh">dwarfeh<ztpan></a></li><li> �!�!a href="rt_ehalloc.html"�4itle="rt.ehalloc">ehalloc<t�><v�i><li> <a href="rt_invariant_.html"�4itle="rt.invariant_">invariant_<t�><v�i><li> <a href="rt_lifetime.html"�4itle="rt.lifetime">lifetime<t�><v�i><li> <a href="rt_llmath.html"�4itle="rt.llmath">llmath<t�><v�i><li> <a href="rt_memory.html"�4itle="rt.memory">memory<t�><v�i><li> <a href="rt_memset.html"�4itle="rt.memset">memset<t�><v�i><li> <a href="rt_minfo.html" title="rt.minfo">minfo<ztpan></a></li><li> �!�!a href="rt_monitor_.html" title="rt.monitor_">monitor_<ztpan></a></li><li> �!�!a href="rt_msvc.html" title="rt.msvc">msvc<ztpan></a></li><li> �!�!a href="rt_msvc_math.html"�4itle="rt.msvc_math">msvc_math<t�><v�i><li> <a href="rt_profilegc.html" title="rt.profilegc">profilegc<ztpan></a></li><li> �!�!a href="rt_sections.html" title="rt.sections">sections<ztpan></a></li><li> �!�!a href="rt_sections_darwin_64.html" title="rt.sections_darwin_64">sections_darwin_64<ztpan></a></li><li> �!�!a href="rt_sections_elf_shared.html"�4itle="rt.sections_elf_shared">sections_elf_shared<t�><v�i><li> <a href="rt_sections_osx_x86.html"�4itle="rt.sections_osx_x86">sections_osx_x86<t�><v�i><li> <a href="rt_sections_osx_x86_64.html" title="rt.sections_osx_x86_64">sections_osx_x86_64<ztpan></a></li><li> �!�!a href="rt_sections_solaris.html" title="rt.sections_solaris">sections_solaris<ztpan></a></li><li> �!�!a href="rt_sections_win64.html" title="rt.sections_win64">sections_win64<ztpan></a></li><li> �!�!a href="rt_tlsgc.html"�4itle="rt.tlsgc">tlsgc<t�><v�i><li> <a href="rt_trace.html" title="rt.trace">trace<ztpan></a></li><li> �!�!a href="rt_tracegc.html"�4itle="rt.tracegc">tracegc<t�><v�i><li> <h7>util<ztpan></h7><ul><li> �!�!a href="rt_util_typeinfo.html"�4itle="rt.util.typeinfo">typeinfo<ztpan></a></li><li> �!�!a href="rt_util_utility.html" title="rt.util.utility">utility<t�> </li><z�l> <v�i></ul> </li><z�l> <u(iv> <div class="hyphenate" id="content"> <div id="tools"><div > <div class="tip smallprint"> <a href="https:/u�ithub.com/dlang/phobosv}ssues/new?title=%5Bstd.algorithm.searching%5D%�(e��)&label=Severity:Enhancement">Report a bug<t�> <div� If you spot a�0roblem�7ith this�0age, click here to create a Bugzilla issue. </div> </div> <div class="tip smallprint"> <a href="https:/u�ithub.com/dlang/phobosu0dit/masterzttdt�lgorithmztearching.d">Improve this�0age<t�> <div� Quickly fork, edit online, and submit a�0ull request for this�0age. Requires a signed-in�?�?itHub account. This works well for small changes. If you'd like�4o make larger changes you may want�4o consider�5sing a local clone. <u(iv> <u(iv> </div></div> �!�!h1>std.algorithm.searching<vv� �!�!div class="quickindex" id="quickindex"><u(iv> <div class="summary">This is a submodule of <a href="std_algorithm.html">std.algorithm<ztpan></a>. It contains generic searching algorithms. </div><div class="description"><script�4ype="text/javascript">inhibitQuickIndex = �</script> <table class="book"><caption>Cheat Sheet</caption><tr><th scope="col">Function Name<z�h>�!�!th scope="col">Description</th><z�r> <tr><td class="donthyphenate nobr"><a href="#all">all<ztpan></a></td> <td> all�T�Ma > 0"([1, �(l4�) 2 2, 4])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true because all elements are�0ositive<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#any">any<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">any!"a�.�.�.gt; 0"([1, 2, -3, -4]) returns true<ztpan> because at least one element is�0ositive<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#balancedParens">balancedParens<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">balancedParens("((1 + 1)� 2)", '(', ')')<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true because the string has balanced parentheses.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#boyerMooreFinder">boyerMooreFinder<ztpan></a></td> <td> find("hello�7orld"+"+ boyerMooreFinder("or")) returns "orld"<ztpan> �5sing�4he�!�!a href="https:]�en.wikipedia.org|�iki/Boyer%E2%80%93Moore_string_search_algorithm"> Boyer-Moore algorithm</a>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#canFind">canFind<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">canFind("hello�7orld"+"+ "or") returns true<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#count">count<t�><z�d>�!�!td> Counts all elements or elements matching a predicate, specific element or sub-range. count([1, 2, o)<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">0�0�0�ztpan>, count([1, 2, o, 1) returns 2 and count�T�Ma < 0"([1, -3, 0])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">�ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#countUntil">countUntil<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">countUntil(a, b) returns the number of steps taken in�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>�4o reach b; for example, countUntil("hello�T�M, "o") returns 4.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#commonPrefix">commonPrefix<ztpan></a></td> <td> commonPrefix("parakeet", "parachute") returns "para"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#endsWith">endsWith<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">endsWith("rocks", "ks")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#extrema">extrema<ztpan></a></td> <td>extrema([�(l4�) 1, 0�0�0� 5, 4])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">[1, 5].</td><z�r> <tr><td class="donthyphenate nobr"><a href="#find">find<ztpan></a></td> <td> find("hello�7orld"+"+ "or") returns "orld"<ztpan>�5sing linear search. (For binary search refer�4o <a href="std_range.html#.SortedRange">std.range.SortedRange<t�>.)<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findAdjacent">findAdjacent<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">findAdjacent([1, 2, 0�0�0� 2 2, 4])<ztpan> returns�4he subrange starting�7ith two equal adjacent elements, i.e. [0�0�0� 2 2, 4].</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findAmong">findAmong<ztpan></a></td> <td> findAmong("abcd"+"+ "qcx")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">"cd" because 'c' is among�!�!span class="d_inlinecode donthyphenate notranslate">"qcx"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findSkip">findSkip<t�><z�d>�!�!td> �!�?f a = "abcde",�4hen findSkip(a, "x")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> and leaves a unchanged,�7hereas�!�!span class="d_inlinecode donthyphenate notranslate">findSkip(a, "c") advances�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> �4o "de"<ztpan> and returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findSplit">findSplit<ztpan></a></td> <td> findSplit("abcdefg", "de")<ztpan> returns a�4uple of three ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abc"<ztpan>, "de"<ztpan>, and "fg"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findSplitAfter">findSplitAfter<t�><z�d>�!�!td>findSplitAfter("abcdefg", "de")<ztpan> returns a�4uple of two ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abcde"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">"fg".</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findSplitBefore">findSplitBefore<ztpan></a></td> <td> findSplitBefore("abcdefg", "de")<ztpan> returns a�4uple of two ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abc"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">"defg".</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minCount">minCount<ztpan></a></td> <td> minCount([2, 1, 1, 4, 1]) returns tuple(1, 0�0�0�.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#maxCount">maxCount<ztpan></a></td> <td> maxCount([2, 4, 1, 4, 1]) returns tuple(4, �(SA�).</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minElement">minElement<ztpan></a></td> <td> Selects the minimal element of a range. minElement([3, 4, 1, �3�3)<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">�ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#maxElement">maxElement<t�><z�d>�!�!td> Selects�4he maximal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">maxElement([0�0�0� 2 2 2, 1, 2]) returns 4.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minIndex">minIndex<ztpan></a></td> <td> Index of�4he minimal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">minIndex([0�0�0� 2 2 2, 1, 2]) returns 2.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#maxIndex">maxIndex<ztpan></a></td> <td> Index of�4he maximal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">maxIndex([0�0�0� 2 2 2, 1, 2]) returns 1.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minPos">minPos<ztpan></a></td> <td> minPos([2, 0�0�0� 1, 0�0�0� 2 2 2, o)<ztpan> returns�4he subrange [1, 2 2, 4, 1]<ztpan>, i.e., positions the range at�4he first occurrence of its minimal element.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#maxPos">maxPos<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">maxPos([�(l4�) 2 2, 1, 2 2, 4, 1]) returns the subrange�!�!span class="d_inlinecode donthyphenate notranslate">[4, o, i.e.,�0ositions�4he range at the first occurrence of its maximal element.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#skipOver">skipOver<ztpan></a></td> <td> Assume�!�!span class="d_inlinecode donthyphenate notranslate">a = "blah". Then skipOver(a, "bi") leaves�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> �5nchanged and returns�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan>, whereas skipOver(a, "bl") advances�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>�4o refer to�!�!span class="d_inlinecode donthyphenate notranslate">"ah" and returns true<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#startsWith">startsWith<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">startsWith("hello,�7orld"+"+ "hello")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#until">until<ztpan></a></td> <td> Lazily iterates a range until a specific�6alue is found.</td><z�r> <z�able> <u(iv> <div class="keyval License">License:<ztpan>�!�!div class="val�6alLicense"><a href="http:/uoost.orgkbICENSE_1_0.txt">Boost License 1.0<t�>. </div></div> <div class="keyval Authors">Authors: <div class="val valAuthors"><a href="http:]�erdani.com">Andrei Alexandrescu<t�> <u(iv><u(iv> <div class="val">Source <a class="https" href="https:]�github.comu(langy:hobos/blobw�aster/std/algorithm/searching.d">stdt�lgorithmztearching.d</a> <y:><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.all"></div>template�!�!span class="def-anchor" id="all"><ztpan><code class="ddoc_psymbol">all</code>(alias pred = "a") <u(iv><u(t> <dd><div class="summary">Checks if all of the elements satisfy�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div><ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">assert<ztpan>( all<ztpan>�span class="d_string">"a�.�.�.amp; 1"<ztpan>([1, 2 2, 5, 5 5 5, 9])); assert(�span class="d_psymbol">all!"a & 1"([1, �(l4�) 2 2, 5, 5 5 5, 9])); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><code class="ddoc_psymbol">all<uode> can also be used�7ithout a�0redicate, if its items can be evaluated to�4rue or false in a conditional statement. This can be a convenient way to�iuickly evaluate that�!�!i>all<v}> of�4he elements of a range are�4rue. <pre class="d_code notranslate">int[�5p��6als = [5, 0�0�0� 18]; assert(�!�!span class="d_psymbol">all(vals[])); </pre> <u(iv><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.all.all"></div>bool�!�!span class="def-anchor" id="all"><ztpan><code class="ddoc_psymbol">all</code>(Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && (__traits(isTemplate,�0red)�=| is(typeof(unaryFun�ired(<code class="ddoc_param">range</code>.front))))); <u(iv><u(t> <dd><div class="summary">Returns true<ztpan> if and only if the input range <code class="ddoc_param">range<uode> is empty or all�6alues found in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> satisfy�4he�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred. Performs (at most) Ο(range.length<ztpan>)<ztpan> evaluations of pred<ztpan>.<u(iv> </dd> </dl> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.any"><u(iv>template <code class="ddoc_psymbol">any<uode>(alias�0red = "a") </div></dt> <dd><div class="summary">Checks if�!�!i>any<v}> of�4he elements satisfies pred<ztpan>. !<code class="ddoc_psymbol">any<uode> can be�5sed to�6erify that�!�!i>none of the elements satisfy pred. This is sometimes called exists<ztpan> in other languages.</div><ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; assert( all�Zany<ztpan>�XsWhite)(["a a"<ztpan>, "b b"])); assert(�span class="d_psymbol">any!(all�XsWhite)(["a a"<ztpan>, "b b"])); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><code class="ddoc_psymbol">any<uode> can also be used�7ithout a�0redicate, if its items can be evaluated to�4rue or false in a conditional statement.�!�!span class="d_inlinecode donthyphenate notranslate">�span class="def-anchor" id="any"><ztpan><code class="ddoc_psymbol">any</code><ztpan> can be a convenient�7ay�4o quickly test�4hat none<v}> of�4he elements of a range evaluate to�4rue. <pre class="d_code notranslate">int[�5p��6als1 = [0, 0, 0]; assert(�span class="d_psymbol">any(valsm]));�!�!span class="d_comment">/w�one of�6als1 evaluate to�4rue int<ztpan>[3] vals�(N��)= [2, 0, 2]; assert<ztpan>( any<ztpan>(vals2[])); assert(�I�Ill(vals2[])); int[�5p��6als3 = [0�0�0� 2 2, �5p�; assert(�!�!span class="d_psymbol">any(vals�3p�])); assert<ztpan>( all(vals�3p�])); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.any.any"><u(iv>bool <code class="ddoc_psymbol">any<uode>(Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& (__traits(isTemplate, pred) || is(typeof(unaryFun!pred(<code class="ddoc_param">range<uode>.front)))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�4he input range�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> is non-empty and any�6alue found in <code class="ddoc_param">range<uode> satisfies the predicate pred<ztpan>. Performs (at most)�!�!span class="bigoh">Ο(range.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.balancedParens"></div>bool�!�!span class="def-anchor" id="balancedParens"><code class="ddoc_psymbol">balancedParens</code>(Range, E)<ztpan>(Range�!�!code class="ddoc_param">r<uode>, E <code class="ddoc_param">lPar<uode>, E <code class="ddoc_param">rPar<uode>, size_t�!�!code class="ddoc_param">maxNestingLevel<uode> = size_t.max) if (isInputRange!Range && is(typeof(<code class="ddoc_param">r<uode>.front == <code class="ddoc_param">lPar<uode>)))<ztpan>; </div></dt> <dd><div class="summary">Checks whether <code class="ddoc_param">r<uode> has "balanced parentheses", i.e. all instances of <code class="ddoc_param">lPar</code><ztpan> are closed by corresponding instances of <code class="ddoc_param">rPar</code><ztpan>. The parameter <code class="ddoc_param">maxNestingLevel<uode> controls�4he nesting level allowed. The most common uses are�4he default or 0.�!�?n the latter case, no nesting is allowed. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">The range to check.<z�d></tr> <tr class="param"><td class="param_id">E�!�!code class="ddoc_param">lPar</code><z�d> <td class="param_desc">The element corresponding with a left (opening) parenthesis.</td><z�r> <tr class="param"><td class="param_id">E <code class="ddoc_param">rPar<uode></td> <td class="param_desc">The element corresponding�7ith a right (closing) parenthesis.</td><z�r> <tr class="param"><td class="param_id">size_t�!�!code class="ddoc_param">maxNestingLevel<uode></td> <td class="param_desc">The maximum allowed nesting level.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">true if the given range has balanced�0arenthesis�7ithin the given maximum nesting level; false otherwise.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">auto<ztpan> s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1� 2)"; assert<ztpan>(!balancedParens(s, '(', ')')); s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1) X��(SA�)"<ztpan>; assert(balancedParens(s, '(', ')')); s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1) X��(SA�)"<ztpan>; assert(�span class="d_psymbol">balancedParens<ztpan>(s, '(', ')', 0)); s =�!�!span class="d_string">"1 + (�(N��)* 0�0�0�0�0�+ 1)� (�(N��)- 5)"<ztpan>; assert(balancedParens(s, '(', ')', 0)); s = "f(x) = ⌈x⌉"<ztpan>; assert(balancedParens(s, '⌈', '⌉')); <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder"><u(iv>struct <ztpan><code class="ddoc_psymbol">BoyerMooreFinder<uode>(alias�0red, Range); <ztpan><div class="quickindex" id="quickindex.boyerMooreFinder"><u(iv>BoyerMooreFinder!(binaryFun�ired, Range) <ztpan><code class="ddoc_psymbol">boyerMooreFinder<uode>(alias�0red = "a == b", Range)(Range <code class="ddoc_param">needle<uode>) if (isRandomAccessRange!Range && hasSlicing!Range || isSomeString!Range); <u(iv><u(t> <dd><div class="summary">Sets�5p Boyer-Moore matching for�5se�7ith find<ztpan> below. By default, elements are compared for equality. <u(iv><div class="description"><code class="ddoc_psymbol">BoyerMooreFinder</code><ztpan> allocates�?�?C memory. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">Predicate�5sed to compare elements.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">needle<uode></td> <td class="param_desc">A random-access range�7ith length and slicing.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">An instance of�!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">BoyerMooreFinder<uode> that can be used�7ith find()<ztpan>�4o invoke the Boyer-Moore matching algorithm for finding of <code class="ddoc_param">needle</code><ztpan> in a given haystack.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">auto bmFinder =�!�!span class="d_psymbol">boyerMooreFinder<ztpan>("TG"); string r = "TAGTGCCTGA"<ztpan>; ]� search for the first match in�4he haystack r r = bmFinder.beFound(r); writeln(r); ]� "TGCCTGA" <ztpan> /X�continue search in haystack r = bmFinder.beFound(r[�(N��)..�.]); writeln(r); ]� "TGA" <ztpan></pre> <u(iv><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder.this"></div>this(Range�!�!code class="ddoc_param">needle</code>); </div></dt> <dd> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.BoyerMooreFinder.beFound"></div>Range <code class="ddoc_psymbol">beFound<uode>(Range�!�!code class="ddoc_param">haystack</code>) scope; </div></dt> <dd> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder.length"></div>@property size_t�!�!span class="def-anchor" id="length"><code class="ddoc_psymbol">length</code>(); <u(iv><u(t> <dd> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.BoyerMooreFinder.opDollar"><u(iv>alias�!�!span class="def-anchor" id="opDollar"><code class="ddoc_psymbol">opDollar</code> = length; </div></dt> <dd> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.commonPrefix"></div>auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(alias pred = "a == b"+"+ R1, R�(SA�)(R1�!�!code class="ddoc_param">r1</code>, R�(N��)<code class="ddoc_param">r�(v��)uode>) if (isForwardRange�1 D�1�01 && isInputRange!R2�.�.�.amp;& �XsNarrowString!R1�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">r1</code>.front,�!�!code class="ddoc_param">r2</code>.front))))<ztpan>; auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(alias pred, R1, R2)<ztpan>(R1 <code class="ddoc_param">r�uode>, R2�!�!code class="ddoc_param">r2</code>) if (isNarrowString!R1�.�.�.amp;& isInputRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">r�uode>.front, <code class="ddoc_param">r�(v��)uode>.front)))); auto <ztpan><code class="ddoc_psymbol">commonPrefix<uode>(R1, R�(SA�)(R1�!�!code class="ddoc_param">r1</code>, R�(N��)<code class="ddoc_param">r�(v��)uode>) if (isNarrowString�1 D�1�01 && isInputRange!R2�.�.�.amp;& �XsNarrowString!R2�.�.�.amp;& is(typeof(<code class="ddoc_param">r�uode>.front == <code class="ddoc_param">r�(v��)uode>.front)))<ztpan>; auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(R1, R2)<ztpan>(R1 <code class="ddoc_param">r�uode>, R2�!�!code class="ddoc_param">r2</code>) if (isNarrowString!R1�.�.�.amp;& isNarrowString�1 D�1�0�(SA�); <u(iv><u(t> <dd><div class="summary">Returns the common�0refix of�4wo ranges. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to�5se in comparing elements for commonality. Defaults �4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">r1</code><z�d> <td class="param_desc">A <a href="std_range_primitives.html#.isForwardRange">forward range<t�> of elements.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">r2</code><z�d> <td class="param_desc">An�!�!a href="std_range_primitives.html#.isInputRange">input range</a> of elements.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">A slice of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r�uode> which contains�4he characters that both ranges start�7ith, if the first argument is a string; otherwise,�4he same as�4he result of takeExactly(<code class="ddoc_param">r�uode>, n),�7here�!�!span class="d_inlinecode donthyphenate notranslate">n<ztpan> is the number of elements in the common prefix of both ranges. <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_range.html#.takeExactly">std.range.takeExactly<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(commonPrefix<ztpan>("hello, world",�!�!span class="d_string">"hello, there"));�!�!span class="d_comment">/X�"hello, " <y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.count"><u(iv>size_t <code class="ddoc_psymbol">count<uode>(alias�0red = "a == b", Range, E)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, E�!�!code class="ddoc_param">needle</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>))))<ztpan>; size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(alias pred = "a == b"+"+ R1, R�(SA�)(R1�!�!code class="ddoc_param">haystack</code>, R�(N��)<code class="ddoc_param">needle<uode>) if (isForwardRange�1 D�1�01 && !isInfinite�1 D�1�01 && isForwardRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Counts matches of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. <u(iv><div class="description">The first overload counts each element�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> in <code class="ddoc_param">haystack</code><ztpan> for which�!�!span class="d_inlinecode donthyphenate notranslate">pred(e, <code class="ddoc_param">needle<uode>)<ztpan> is true<ztpan>. pred<ztpan> defaults to equality. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> The second overload counts�4he number of�4imes�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was matched in <code class="ddoc_param">haystack<uode>.�!�!span class="d_inlinecode donthyphenate notranslate">pred compares elements in each range. Throws an exception if <code class="ddoc_param">needle</code>.empty<ztpan> is true<ztpan>, as�4he count of the empty range in any range�7ould be infinite. Overlapped counts are not<u0m> considered, for example�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_psymbol">count<uode>("aaa", "aa")<ztpan> is 1, not �(v��)ztpan>. <u(iv> <div class="val">Note Regardless of the overload, <ztpan><code class="ddoc_psymbol">count</code><ztpan>�7ill not accept infinite ranges for�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to compare elements.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">haystack<uode></td> <td class="param_desc">The range�4o count.</td><z�r> <tr class="param"><td class="param_id">E <code class="ddoc_param">needle<uode></td> <td class="param_desc">The element or sub-range to count in <code class="ddoc_param">haystack</code><ztpan>.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">The number of matches in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">]� count elements in range <ztpan>int<ztpan>[] a = [ 1, �(l4�) 2 2 2, 0�0�0� 2, 5, 2 2, �(l4�) 2 2 2 ]; writeln(count<ztpan>(a, �(SA�));�!�!span class="d_comment">/X�0�0�0�writeln(count!("a�.�.�.gt; b")(a, �(SA�));�!�!span class="d_comment">/X�5 <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.uni : toLower; /X�count range in range <ztpan>writeln(count<ztpan>("abcadfabf"<ztpan>, "ab"<ztpan>)); ]� 2 <ztpan>writeln(count<ztpan>("ababab",�!�!span class="d_string">"abab"));�!�!span class="d_comment">/X�1 writeln(count("ababab"<ztpan>, "abx"));�!�!span class="d_comment">/X�0 /X�fuzzy count range in range <ztpan>writeln(count<ztpan>�Z(a, b) =>�4oLower(a) ==�4oLower(b))("AbcAdFaBf"<ztpan>, "ab"<ztpan>)); ]� 2 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.count.2"></div>size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(alias pred, R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& �XsInfinite!R && is(typeof(unaryFun!pred(<code class="ddoc_param">haystack</code>.front))))<ztpan>; size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& �XsInfinite!R); <u(iv><u(t> <dd><div class="summary">Counts all elements or elements satisfying a�0redicate in <code class="ddoc_param">haystack</code><ztpan>. </div><div class="description">The first overload counts each element e in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> for which pred(e) is�!�!span class="d_inlinecode donthyphenate notranslate">true. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> The second overload counts�4he number of elements in a range. If�4he given range has�4he�!�!span class="d_inlinecode donthyphenate notranslate">length property, that is returned right away, otherwise performs Ο(haystack.length) to�7alk the range. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Optional�0redicate�4o find elements.</td><z�r> <tr class="param"><td class="param_id">R <code class="ddoc_param">haystack<uode></td> <td class="param_desc">The range�4o count.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The number of elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> (for�7hich�!�!span class="d_inlinecode donthyphenate notranslate">pred returned�4rue).<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">/X�count elements in range int[] a = [ 1, 2, 4, 2 2, �(l4�) 5, 0�0�0� 2, 4 ]; writeln(count(a));�!�!span class="d_comment">/X�9 /X�count predicate in range <ztpan>writeln(count<ztpan>�Z"a > 2"<ztpan>)(a));�!�!span class="d_comment">/X�5 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.countUntil"><u(iv>auto <ztpan><code class="ddoc_psymbol">countUntil<uode>(alias�0red = "a == b", R, Rs...)<ztpan>(R�!�!code class="ddoc_param">haystack</code>, Rs <code class="ddoc_param">needles</code>) if (isForwardRange!R && (Rs.length > 0) && (isForwardRange�ZRs[0]) == isInputRange�ZRs[0])) && allSatisfy!(canTestStartsWith�Zpred, R), Rs)); ptrdiff_t�!�!span class="def-anchor" id="countUntil"><code class="ddoc_psymbol">countUntil</code>(alias pred = "a == b"+"+ R, N)(R <code class="ddoc_param">haystack<uode>, N <code class="ddoc_param">needle<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>)) : bool)); ptrdiff_t�!�!span class="def-anchor" id="countUntil"><code class="ddoc_psymbol">countUntil</code>(alias pred, R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(unaryFun�ired(<code class="ddoc_param">haystack<uode>.front)) : bool))<ztpan>; </div></dt> <dd><div class="summary">Counts elements in the given <a href="std_range_primitives.html#.isForwardRange">forward range<t�> until the given predicate is�4rue for one of�4he given�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan>. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate for determining�7hen to stop counting.<z�d></tr> <tr class="param"><td class="param_id">R�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to be counted.</td><z�r> <tr class="param"><td class="param_id">Rs�!�!code class="ddoc_param">needles<uode></td> <td class="param_desc">Either a single element, or a �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a> of elements, to be evaluated in�4urn against each element in <code class="ddoc_param">haystack</code><ztpan>�5nder�4he given�0redicate.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">The number of elements�7hich must be�0opped from�4he front of <code class="ddoc_param">haystack</code><ztpan> before reaching an element for which startsWith!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needles<uode>)<ztpan> is true<ztpan>. If �!�!span class="d_inlinecode donthyphenate notranslate">startsWith�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needles</code>) is not�!�!span class="d_inlinecode donthyphenate notranslate">true for any element in �!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>,�4hen -�ztpan> is returned. If more than one needle is�0rovided, �!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">countUntil<uode> will�7rap the result in a tuple similar to �!�!span class="d_inlinecode donthyphenate notranslate">Tuple!(ptrdiff_t, "steps"+"+�0trdiff_t�!�!code class="ddoc_param">needle</code>) <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_string.html#.indexOf">std.string.indexOf<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(countUntil<ztpan>("hello�7orld"<ztpan>, "world"));�!�!span class="d_comment">/X�6 writeln(countUntil<ztpan>("hello�7orld"<ztpan>, 'r'));�!�!span class="d_comment">/X�8 writeln(countUntil<ztpan>("hello�7orld"<ztpan>, "programming"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil("日本語",�!�!span class="d_string">"本語"));�!�!span class="d_comment">/X�1 writeln(countUntil<ztpan>("日本語"<ztpan>, '語'));�!�!span class="d_comment">/X��(�)writeln(countUntil<ztpan>("日本語"<ztpan>, "五"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil("日本語", '五')); ]� -1 writeln(countUntil<ztpan>([0, 5 5 5, , �(g �), 9], [1�(l4�) 2�3�3)); ]� 2 <ztpan>writeln(countUntil([0, 7, 1�(l4�) 2�(l4�) 9], 9)); ]� 2 2 2 <ztpan>writeln(countUntil!"a > b"<ztpan>([0, 5 5 5, , �(g �), 9], �(e��))); ]� 2 2 <ztpan> /X�supports multiple needles auto<ztpan> res =�!�!span class="d_string">"...hello".countUntil("ha"<ztpan>, "he"<ztpan>); writeln(res.steps);�!�!span class="d_comment">/X�0�0�0�writeln(res.needle<ztpan>);�!�!span class="d_comment">/X�1 ]� returns -1 if no needle�7as found <ztpan>res = "hello".countUntil("ha"<ztpan>, "hu"<ztpan>); writeln(res.steps);�!�!span class="d_comment">/X�-1 <ztpan>writeln(res.needle); ]� -1 <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.ascii : isDigit; import<ztpan> std.uni : isWhite; writeln(countUntil<ztpan>�ZisWhite)("hello�7orld"<ztpan>)); ]� 5 <ztpan>writeln(countUntil!(isDigit)("hello world"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil!"a > 20"([0, 7, 1�(l4�) 2�(l4�) 9]));�!�!span class="d_comment">/X�0�0�0�<y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.endsWith"><u(iv>uint <ztpan><code class="ddoc_psymbol">endsWith<uode>(alias�0red = "a == b", Range, Needles...)(Range <code class="ddoc_param">doesThisEnd</code>, Needles�!�!code class="ddoc_param">withOneOfThese</code>) if (isBidirectionalRange!Range && (Needles.length�.�.�.gt; 1)�.�.�.amp;& allSatisfy�ZcanTestStartsWith!(pred, Range), Needles)); bool <ztpan><code class="ddoc_psymbol">endsWith<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">doesThisEnd</code>, R�(N��)<code class="ddoc_param">withThis<uode>) if (isBidirectionalRange�1 D�1�01 && isBidirectionalRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">doesThisEnd<uode>.back,�!�!code class="ddoc_param">withThis</code>.back)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="endsWith"><code class="ddoc_psymbol">endsWith</code>(alias pred = "a == b"+"+ R, E)(R <code class="ddoc_param">doesThisEnd</code>, E�!�!code class="ddoc_param">withThis</code>) if (isBidirectionalRange!R && is(typeof(binaryFun�ired(<code class="ddoc_param">doesThisEnd</code>.back, <code class="ddoc_param">withThis<uode>)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="endsWith"><code class="ddoc_psymbol">endsWith</code>(alias pred, R)(R <code class="ddoc_param">doesThisEnd</code>) if (isInputRange!R && ifTestable!(typeof(<code class="ddoc_param">doesThisEnd</code>.front), unaryFun�ired))<ztpan>; </div></dt> <dd><div class="summary">Checks if�4he given range ends with (one of) the given needle(s). The reciprocal of�!�!span class="d_inlinecode donthyphenate notranslate">startsWith. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to�5se for comparing elements between the range and the needle(s).</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">doesThisEnd</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional range<t�> to check.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">withOneOfThese</code><z�d> <td class="param_desc">The needles to check against, which may be single elements, or bidirectional ranges of elements.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">withThis</code><z�d> <td class="param_desc">The single element�4o check.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">0 if the needle(s) do not occur at the end of�4he given range; otherwise the position of the matching needle,�4hat is, 1 if�4he range ends with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>[0]<ztpan>, �(N��)if it ends�7ith <code class="ddoc_param">withOneOfThese</code>[o, and so on. <div class="blankline"><u(iv> In the case�7hen no needle parameters are given, return�!�!span class="d_inlinecode donthyphenate notranslate">true iff back of doesThisStart fulfils predicate pred<ztpan>.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isAlpha; assert("abc".endsWith!(a => a.isAlpha)); assert("abc".endsWith!isAlpha); assert<ztpan>(!"ab1".endsWith!(a => a.isAlpha)); assert<ztpan>(!"ab1".endsWith!isAlpha); assert(�span class="d_string">"".endsWith!(a => a.isAlpha)); import<ztpan> std.algorithm.comparison : among; assert<ztpan>("abc"<ztpan>.endsWith<ztpan>�Za => a.among('c', 'd') � 0)); assert(�span class="d_string">"abc"<ztpan>.endsWith<ztpan>�Za => a.among('a', 'b') � 0)); assert<ztpan>(endsWith<ztpan>("abc"<ztpan>, ""<ztpan>)); assert(�span class="d_psymbol">endsWith<ztpan>("abc"<ztpan>, "b")); writeln(endsWith<ztpan>("abc"<ztpan>, "a", 'c')); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"c"<ztpan>, "a"));�!�!span class="d_comment">/X�1 writeln(endsWith<ztpan>("abc"<ztpan>, "c",�!�!span class="d_string">"c"<ztpan>)); ]� 1 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"bc",�!�!span class="d_string">"c"<ztpan>)); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "c",�!�!span class="d_string">"b"<ztpan>)); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aa"<ztpan>, "bc"<ztpan>)); ]� 2 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aaa",�!�!span class="d_string">"sab"<ztpan>)); ]� 0 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aaa", 'c', "sab"));�!�!span class="d_comment">/X�0�0�0�<y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find"><u(iv>InputRange <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red,�!�?nputRange)(InputRange�!�!code class="ddoc_param">haystack</code>) if (isInputRange!InputRange)<ztpan>; </div></dt> <dd><div class="summary">Finds an element e of an <a href="std_range_primitives.html#.isInputRange">input range<t�> where pred(e) is�!�!span class="d_inlinecode donthyphenate notranslate">true. <div class="panel"><ul><li><ztpan><code class="ddoc_psymbol">find<uode> behaves similarly to�!�!span class="d_inlinecode donthyphenate notranslate">dropWhile<ztpan> in other languages.</li> <li>To find the last matching element in a <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional<t�> <code class="ddoc_param">haystack</code><ztpan>, call�!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">find<uode>�ired(retro(<code class="ddoc_param">haystack<uode>)). See�!�!a href="std_range.html#.retro">std.range.retro<ztpan></a>.<v�i> <z�l></div> <u(iv><div class="val">Complexity<ztpan> <ztpan><code class="ddoc_psymbol">find<uode> performs�!�!span class="bigoh">Ο(walkLength(haystack)) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to match an element.</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> searched in.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns"><code class="ddoc_param">haystack</code><ztpan> advanced such�4hat the front element satisfies pred<ztpan>. If no such element exists, returns an empty <code class="ddoc_param">haystack</code><ztpan>.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">auto<ztpan> arr = [ 1, �(l4�) 2 2, 4, 1 ]; writeln(find!("a�.�.�.gt; �(N �))(arr)); ]� [0�0�0� 2 2 2, o <ztpan> /X�with�0redicate alias <ztpan>bool pred(int e) => e + 1�.�.�.gt; 1.5; writeln(find<ztpan>�Zpred)(arr));�!�!span class="d_comment">/X�arr <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.�(N �)><u(iv>InputRange <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red = "a == b", InputRange, Element)(InputRange�!�!code class="ddoc_param">haystack</code>, scope Element�!�!code class="ddoc_param">needle</code>) if (isInputRange!InputRange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>)) : bool) && !is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>.front)) : bool)); R1 <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, scope R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>.front)) : bool))<ztpan>; </div></dt> <dd><div class="summary">Finds an individual element in an�!�!a href="std_range_primitives.html#.isInputRange">input range</a>. Elements of <code class="ddoc_param">haystack</code><ztpan> are compared with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> by�5sing�0redicate pred with�!�!span class="d_inlinecode donthyphenate notranslate">pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>). The�0redicate is passed�4o <a href="std_functional.html#.binaryFun">std.functional.binaryFun<t�>, and can either accept a string, or any callable�4hat can be executed via pred(element, element)<ztpan>. </div><div class="description">If <code class="ddoc_param">haystack</code><ztpan> is a <a href="std_range_primitives.html#.isForwardRange">forward range<t�>, <code class="ddoc_param">needle<uode> can be a�!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4oo. In�4his case�!�!span class="d_inlinecode donthyphenate notranslate">startsWith�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needle<uode>)<ztpan> is evaluated on each evaluation. <div class="blankline"><u(iv> <div class="note">Note: To find the first element not matching the needle, use predicate "a � b"<ztpan>.<u(iv> <u(iv> <div class="val">Complexity <code class="ddoc_psymbol">find</code><ztpan>�0erforms Ο(walkLength(haystack)<ztpan>)<ztpan> evaluations of pred<ztpan>. There are specializations that improve�0erformance by taking advantage of <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional<t�> or�!�!a href="std_range_primitives.html#.isRandomAccessRange">random access<t�> ranges (where possible). </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate for comparing each element�7ith the needle, defaulting�4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> searched in.<z�d></tr> <tr class="param"><td class="param_id">Element�!�!code class="ddoc_param">needle</code><z�d> <td class="param_desc">The element searched for.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns"><code class="ddoc_param">haystack</code><ztpan> advanced such�4hat the front element is�4he one searched for; �4hat is, until binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>)<ztpan> is true<ztpan>. If no such�0osition exists, returns an empty�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#findAdjacent">findAdjacent<t�>,�!�!a href="#findAmong">findAmong<t�>,�!�!a href="#findSkip">findSkip<t�>,�!�!a href="#findSplit">findSplit<t�>,�!�!a href="#startsWith">startsWith<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range.primitives; auto arr = [1, �(l4�) 2 2 2, 4, 2 2 2, 4, 5, 6, 9]; writeln(arr.find<ztpan>(4)); ]� [4, 2 2 2, 4, 2 2 2, 5, 5 5, 9] <ztpan>writeln(arr.find(1));�!�!span class="d_comment">/X�arr writeln(arr.find<ztpan>(9)); ]� [9] <ztpan>writeln(arr.find!((e, n) => e > n)(4));�!�!span class="d_comment">/X�[5, 6, 9] writeln(arr.find<ztpan>�Z(e, n) => e�.�.�.lt; n)(4)); ]� arr <ztpan>assert(arr.find(0).empty); assert<ztpan>(arr.find<ztpan>(10).empty); assert<ztpan>(arr.find<ztpan>(8).empty); writeln(find<ztpan>("hello, world", ',')); ]� ", world" <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Case-insensitive find of a string <pre class="d_code notranslate">import<ztpan> std.range.primitives; import<ztpan> std.uni :�4oLower; string[] s = ["Hello"<ztpan>, "world",�!�!span class="d_string">"!"<ztpan>]; writeln(s.find<ztpan>�Z(e, n) =>�4oLower(e) == n)("hello"));�!�!span class="d_comment">/X�s <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.container : SList; import<ztpan> std.range.primitives : empty; import<ztpan> std.typecons : Tuple; assert(find("hello,�7orld"<ztpan>, "World").empty); writeln(find<ztpan>("hello, world",�!�!span class="d_string">"wo"));�!�!span class="d_comment">/X�"world" writeln([1, 2, 0�0�0� 2 2 2].find(SList!int<ztpan>(2, 0�0�0�[])); ]� [�(l4�) 2 2, 4] <ztpan>alias<ztpan> C = Tuple�Zint<ztpan>, "x",�!�!span class="d_keyword">int,�!�!span class="d_string">"y"<ztpan>); auto<ztpan> a = [C(1,0), C(�(l4�)0), C(0�0�0�1), C(4,0)]; writeln(a.find<ztpan>�span class="d_string">"a.x == b"([2, �5p�)); ]� [C(�(l4�) 0), C(3, 1), C(4, 0)] <ztpan>writeln(a[1 ..�.].find!"a.x == b"<ztpan>([�(l4�) 2 2]));�!�!span class="d_comment">/X�[C(2, 0), C(0�0�0� 1), C(4, 0)] <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.0�0�0�><u(iv>Tuple�ZRange, size_t)�!�!span class="def-anchor" id="find"><code class="ddoc_psymbol">find</code>(alias pred = "a == b"+"+ Range, Needles...)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, Needles�!�!code class="ddoc_param">needles<uode>) if (Needles.length�.�.�.gt; 1 && is(typeof(startsWith!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needles<uode>)))); <u(iv><u(t> <dd><div class="summary">Finds two or more <code class="ddoc_param">needles<uode> into a�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. The�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred is�5sed throughout�4o compare elements. By default, elements are compared for equality. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4o use for comparing elements.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The target of the search. Must be an input range. If any of <code class="ddoc_param">needles<uode> is a range�7ith elements comparable to elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>,�4hen <code class="ddoc_param">haystack</code><ztpan> must be a <a href="std_range_primitives.html#.isForwardRange">forward range</a> such that�4he search can backtrack.</td><z�r> <tr class="param"><td class="param_id">Needles <code class="ddoc_param">needles</code><z�d> <td class="param_desc">One or more items to search for. Each of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> must be either comparable�4o one element in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>, or be itself a forward range with elements comparable�7ith elements in <code class="ddoc_param">haystack</code><ztpan>.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">A tuple containing�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> positioned�4o match one of�4he needles and also the 1-based index of�4he matching element in�!�!span class="d_inlinecode donthyphenate notranslate">needles<ztpan> (0 if none of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> matched, 1 if�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code>[0] matched, 2 if <code class="ddoc_param">needles<uode>[1]<ztpan> matched...). The first needle�4o be found will be�4he one�4hat matches.�!�?f multiple needles are found at the same spot in�4he range, then�4he shortest one is�4he one�7hich matches (if multiple needles of�4he same length are found at the same spot (e.g "a"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">'a'<ztpan>),�4hen the left-most of�4hem in�4he argument list matches). <div class="blankline"></div> The relationship between�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and <code class="ddoc_param">needles<uode> simply means that one can e.g. search for individual�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s or arrays of�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s in an array of�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s.�!�?n addition, if elements are individually comparable, searches of heterogeneous�4ypes are allowed as well: a double[]<ztpan> can be searched for an int or a�!�!span class="d_inlinecode donthyphenate notranslate">short[]<ztpan>, and conversely a�!�!span class="d_inlinecode donthyphenate notranslate">long can be searched for a float or a�!�!span class="d_inlinecode donthyphenate notranslate">double[]. This makes for efficient searches�7ithout�4he need to coerce one side of the comparison into the other's side�4ype. <div class="blankline"></div> The complexity of the search is Ο(haystack.length * max(needles.length)). (For needles that are individual items, length is considered to be 1.) The strategy�5sed in searching several subranges at once maximizes cache�5sage by moving in <code class="ddoc_param">haystack</code><ztpan> as few times as�0ossible.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.typecons :�4uple; int<ztpan>[] a = [ 1, 4, 2, 0�0�0�0�0�]; writeln(find<ztpan>(a, 4));�!�!span class="d_comment">/X�[4, �(l4�) 2 2] writeln(find<ztpan>(a, [1, 4])); ]� [1, 2 2 2, �(l4�) 2 2] writeln(find<ztpan>(a, [1, �5p�, 4));�!�!span class="d_comment">/X�tuple([4, �(l4�) 2 2], 2) /X�Mixed types allowed if comparable writeln(find<ztpan>(a, 5, [1.�(l4�) 2 2.5], 2.0)); ]��4uple([�(l4�) 2 2], 2 2) <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.4"><u(iv>RandomAccessRange�!�!span class="def-anchor" id="find"><code class="ddoc_psymbol">find</code>(RandomAccessRange, alias�0red,�!�?nputRange)(RandomAccessRange <code class="ddoc_param">haystack<uode>, scope BoyerMooreFinder�Zpred, InputRange) <code class="ddoc_param">needle<uode>); <u(iv><u(t> <dd><div class="summary">Finds <code class="ddoc_param">needle</code><ztpan> in <code class="ddoc_param">haystack</code><ztpan> efficiently�5sing�4he <a href="https:/u0n.wikipedia.org/wikie�oyer%E�(Qm�)80%90�0�0�0�oore_string_search_algorithm"> Boyer-Moore</a> method. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">RandomAccessRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">A random-access range with length and slicing.</td><z�r> <tr class="param"><td class="param_id">BoyerMooreFinder�Zpred, InputRange) <code class="ddoc_param">needle<uode></td> <td class="param_desc">A�!�!a href="#BoyerMooreFinder">BoyerMooreFinder<t�>.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">haystack<uode> advanced such that�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> is a�0refix of it (if no such�0osition exists, returns <code class="ddoc_param">haystack</code><ztpan> advanced to�4ermination).</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range.primitives : empty; int<ztpan>[] a = [ -1, 0, 1, 2, 0�0�0� 2 2 2, 5 ]; int[] b = [ 1, 2, 0�0�0�0�0�]; writeln(find(a, boyerMooreFinder(b))); ]� [1, 2, 0�0�0� 2 2 2, 5] <ztpan>assert(find(b, boyerMooreFinder(a)).empty); </pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind"></div>template�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(alias pred = "a == b") </div></dt> <dd><div class="summary">Convenience function. Like find, but only returns�7hether or not the search was successful. <u(iv><div class="description">For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_algorithm_comparison.html#.among">std.algorithm.comparison.among<t�> for checking a�6alue against multiple arguments.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">const<ztpan> arr = [0, 1, �(l4�) 2 2]; assert<ztpan>(canFind(arr, 2)); assert(�span class="d_psymbol">canFind(arr, 2 2 2)); /X�find one of several needles assert<ztpan>(arr.canFind(0�0�0� 2)); assert(arr.canFind<ztpan>(3, �(SA�) == �(SA�); ]� second needle found <ztpan>writeln(arr.canFind<ztpan>([1, 2 2], 2)); ]� 2 <ztpan> assert<ztpan>(canFind(arr, [1, 2], [�(l4�) 2 2])); writeln(canFind(arr, [1, 2], [�(l4�) 2 2]));�!�!span class="d_comment">/X�1 assert<ztpan>(canFind(arr, [1, 5 5 5], [�(l4�) 2 2])); writeln(canFind(arr, [1, 5 5 5], [�(l4�) 2 2]));�!�!span class="d_comment">/X��(�)assert<ztpan>(!canFind<ztpan>(arr, [1, �5p�, [2, 4])); writeln(canFind<ztpan>(arr, [1, �5p�, [2, 4])); ]� 0 <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Example�5sing a custom predicate. Note�4hat the needle appears as the second argument of�4he�0redicate. <pre class="d_code notranslate">auto words = [ "apple", �!�!span class="d_string">"beeswax"<ztpan>, "cardboard" ]; assert<ztpan>(!canFind<ztpan>(words, "bees"<ztpan>)); assert(�!�!span class="d_psymbol">canFind!((string elem, string needle) => elem.startsWith(needle))(words, "bees"<ztpan>)); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Search for multiple items in an array of items (search for needles in an array of haystacks) <pre class="d_code notranslate">string s1 = "aaa1�aaa"; string s2 =�!�!span class="d_string">"aaa�(g �)aa"<ztpan>; string s0�0�0�0�0�= "aaa30�0�0�0�aaa"; string s4 =�!�!span class="d_string">"aaa444aaa"<ztpan>; const<ztpan> hay = [s1, s2, s3, s4]; assert<ztpan>(hay.canFind!(e => e.canFind("�1",�!�!span class="d_string">"2�(g �)"<ztpan>))); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.canFind.canFind"><u(iv>bool <code class="ddoc_psymbol">canFind<uode>(Range)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>) if (is(typeof(find!pred(<code class="ddoc_param">haystack</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�!�!span class="d_inlinecode donthyphenate notranslate">pred(e)<ztpan> is true for any�6alue�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> in the input range range. Performs (at most) Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind.canFind.2"></div>bool�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(Range, Element)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, scope Element�!�!code class="ddoc_param">needle</code>) if (is(typeof(find!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needle</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> can be found in range. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind.canFind.3"></div>size_t�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(Range, Needles...)(Range <code class="ddoc_param">haystack<uode>, scope Needles <code class="ddoc_param">needles</code>) if (Needles.length > 1�.�.�.amp;& is(typeof(find�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needles</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�4he 1-based index of the first needle found in <code class="ddoc_param">haystack</code><ztpan>. If no needle is found,�4hen 0 is returned. <u(iv><div class="description">So, if�5sed directly in the condition of an if<ztpan> statement or loop, the result �7ill be�!�!span class="d_inlinecode donthyphenate notranslate">true if one of the needles is found and�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> if none are found, whereas if�4he result is�5sed elsewhere, it can either be cast�4o bool<ztpan> for�4he same effect or used�4o get which needle�7as found first �7ithout having to deal with�4he�4uple�4hat <a href="#find">find<ztpan></a> returns for�4he same operation.</div> </dd> </dl> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.findAdjacent"><u(iv>Range�!�!span class="def-anchor" id="findAdjacent"><code class="ddoc_psymbol">findAdjacent</code>(alias pred = "a == b"+"+ Range)<ztpan>(Range�!�!code class="ddoc_param">r<uode>) if (isForwardRange�1 D�1�0ange)<ztpan>; </div></dt> <dd><div class="summary">Advances <code class="ddoc_param">r<uode> until it finds�4he first�4wo adjacent elements�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>, b that satisfy�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b). Performs Ο(r.length<ztpan>)<ztpan> evaluations of pred<ztpan>. </div><div class="description">For more information about pred<ztpan> see�!�!a href="#find">find<t�>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to satisfy.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">r<uode></td> <td class="param_desc">A�!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4o search in.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">r</code><ztpan> advanced to�4he first occurrence of�4wo adjacent elements�4hat satisfy the given predicate.�!�?f there are no such two elements, returns <code class="ddoc_param">r<uode> advanced until empty. <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="http:]�en.cppreference.com/w/cpp/algorithm/adjacent_find">STL's�!�!span class="d_inlinecode donthyphenate notranslate">adjacent_find<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [ 11, 10, 10, 9, 8, 8, 7, 8, 9 ]; auto<ztpan>�!�!span class="d_param">r = findAdjacent(a); writeln(r<ztpan>);�!�!span class="d_comment">/X�[10, 10, 9, 8, 8, 7, 8, 9] <ztpan>auto p = findAdjacent!("a�.�.�.lt; b")(a); writeln(p);�!�!span class="d_comment">/X�[7, 8, 9] <y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.findAmong"><u(iv>InputRange <code class="ddoc_psymbol">findAmong<uode>(alias�0red = "a == b", InputRange, ForwardRange)<ztpan>(InputRange <code class="ddoc_param">seq</code>, ForwardRange <code class="ddoc_param">choices</code>) if (isInputRange!InputRange�.�.�.amp;& isForwardRange�dorwardRange); <u(iv><u(t> <dd><div class="summary">Searches�4he given range for an element that matches one of the given choices. <u(iv><div class="description">Advances�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">seq</code><ztpan> by calling <code class="ddoc_param">seq<uode>.popFront<ztpan>�5ntil either find!(pred)(<code class="ddoc_param">choices<uode>, <code class="ddoc_param">seq</code>.front) is�!�!span class="d_inlinecode donthyphenate notranslate">true, or <code class="ddoc_param">seq<uode> becomes empty. Performs Ο(seq.length * choices.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4o use for determining a match.</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">seq<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a>�4o search.<z�d></tr> <tr class="param"><td class="param_id">ForwardRange <code class="ddoc_param">choices</code><z�d> <td class="param_desc">A <a href="std_range_primitives.html#.isForwardRange">forward range<t�> of�0ossible choices.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">seq</code><ztpan> advanced to�4he first matching element, or until empty if�4here are no matching elements. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�>,�!�!a href="std_algorithm_comparison.html#.among">std.algorithm.comparison.among<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [ -1, 0, 1, 2, 0�0�0� 2 2 2, 5 ]; int[] b = [ 0�0�0� 1, �(N��)]; writeln(findAmong(a, b)); ]� a[2 .. $] <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.findSkip"><u(iv>bool <ztpan><code class="ddoc_psymbol">findSkip<uode>(alias�0red = "a == b", R1, R2)<ztpan>(ref R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>.front)))); size_t <ztpan><code class="ddoc_psymbol">findSkip<uode>(alias�0red, R1)(ref R1�!�!code class="ddoc_param">haystack</code>) if (isForwardRange!R1�.�.�.amp;& ifTestable�Ztypeof(<code class="ddoc_param">haystack</code>.front), unaryFun�ired))<ztpan>; </div></dt> <dd><div class="summary">Finds�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and positions <code class="ddoc_param">haystack</code><ztpan> right after the first occurrence of <code class="ddoc_param">needle</code><ztpan>. </div><div class="description">If no needle is�0rovided,�4he�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> is advanced as long as�!�!span class="d_inlinecode donthyphenate notranslate">pred evaluates�4o true<ztpan>. Similarly, the haystack is positioned so as�!�!span class="d_inlinecode donthyphenate notranslate">pred evaluates to�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for <code class="ddoc_param">haystack</code>.front<ztpan>. <div class="blankline"><u(iv> For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4o search in.<z�d></tr> <tr class="param"><td class="param_id">R�(N��)<code class="ddoc_param">needle<uode></td> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to search for.<z�d></tr> <tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Custom�0redicate for comparison of haystack and needle</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">true if�4he needle was found, in which case�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> is positioned after�4he end of the first occurrence of <code class="ddoc_param">needle</code><ztpan>; otherwise �!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan>, leaving <code class="ddoc_param">haystack</code><ztpan>�5ntouched. If no needle is provided, it returns �4he number of�4imes�!�!span class="d_inlinecode donthyphenate notranslate">pred(<code class="ddoc_param">haystack</code>.front) returned�4rue. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range.primitives : empty; /X�Needle is found; s is replaced by the substring following the first /X�occurrence of the needle. string s = "abcdef"<ztpan>; assert(findSkip(s,�!�!span class="d_string">"cd")�.�.�.amp;& s ==�!�!span class="d_string">"ef"); /X�Needle is not found; s is left�5ntouched. s =�!�!span class="d_string">"abcdef"; assert<ztpan>(!findSkip(s,�!�!span class="d_string">"cxd"<ztpan>) && s == "abcdef"<ztpan>); ]��!�?f the needle occurs at�4he end of the range,�4he range is left empty. s =�!�!span class="d_string">"abcdef"; assert<ztpan>(findSkip<ztpan>(s, "def")�.�.�.amp;& s.empty); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; string s =�!�!span class="d_string">" abc"<ztpan>; assert(findSkip!isWhite(s)�.�.�.amp;& s ==�!�!span class="d_string">"abc"<ztpan>); assert<ztpan>(!findSkip!isWhite(s)�.�.�.amp;& s ==�!�!span class="d_string">"abc"<ztpan>); s = " "<ztpan>; writeln(findSkip!isWhite(s));�!�!span class="d_comment">/X��(�)<y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.findSplit"><u(iv>auto <code class="ddoc_psymbol">findSplit<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <div class="quickindex" id="quickindex.findSplitBefore"><u(iv>auto <code class="ddoc_psymbol">findSplitBefore<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <ztpan><div class="quickindex" id="quickindex.findSplitAfter"><u(iv>auto <ztpan><code class="ddoc_psymbol">findSplitAfter<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <u(iv><u(t> <dd><div class="summary">These functions find�4he first occurrence of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and then split�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> as follows. </div><div class="description"><div class="panel"><ztpan><code class="ddoc_psymbol">findSplit</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�!�!i>three<v}> ranges. <ul><li>result[0] is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan> before <code class="ddoc_param">needle</code><ztpan></li> <li>result[o is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan>�4hat matches <code class="ddoc_param">needle</code><ztpan></li> <li>result[�3�3 is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan> after�4he match.<v�i> <z�l> If <code class="ddoc_param">needle</code><ztpan>�7as not found, result[0] comprehends <code class="ddoc_param">haystack</code><ztpan> entirely and result[o and result[�3�3 are empty. <div class="blankline"></div> <ztpan><code class="ddoc_psymbol">findSplitBefore</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�4wo ranges. <ul><li>result[0]<ztpan> is the portion of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> before�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode><v�i> <li>result[1]<ztpan> is the balance of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> starting�7ith the match.</li> </ul> If�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was not found,�!�!span class="d_inlinecode donthyphenate notranslate">result[0]<ztpan> comprehends�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> entirely and�!�!span class="d_inlinecode donthyphenate notranslate">result[1]<ztpan> is empty. <div class="blankline"></div> <code class="ddoc_psymbol">findSplitAfter</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�4wo ranges. <ul><li>result[0]<ztpan> is the portion of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> up�4o and including the match<v�i> <li>result[1]<ztpan> is the balance of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> starting after�4he match.<v�i> <z�l> If <code class="ddoc_param">needle</code><ztpan>�7as not found, result[0] is empty and�!�!span class="d_inlinecode donthyphenate notranslate">result[1]<ztpan> is <code class="ddoc_param">haystack</code><ztpan>. </div> In all cases, the concatenation of�4he returned ranges spans�4he entire <code class="ddoc_param">haystack</code><ztpan>. <div class="blankline"><u(iv> If <code class="ddoc_param">haystack</code><ztpan> is a random-access range, all�4hree components of�4he�4uple have the same�4ype as�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. Otherwise, <code class="ddoc_param">haystack</code><ztpan> must be a <a href="std_range_primitives.html#.isForwardRange">forward range</a> and the�4ype of�!�!span class="d_inlinecode donthyphenate notranslate">result[0]<ztpan> (and result[o for <ztpan><code class="ddoc_psymbol">findSplit</code><ztpan>) is�4he same as the result of�!�!a href="std_range.html#.takeExactly">std.range.takeExactly<ztpan></a>. <div class="blankline"><u(iv> For more information about pred<ztpan> see�!�!a href="#find">find<t�>. <y:> </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Predicate to compare 2 elements.</td><z�r> <tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The forward range to search.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">needle</code><z�d> <td class="param_desc">The forward range to look for.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">A sub-type of�!�!a href="std_typecons.html#.Tuple">std.typecons.Tuple<ztpan></a> of the split portions of <code class="ddoc_param">haystack</code><ztpan> (see above for details). This sub-type of�!�!span class="d_inlinecode donthyphenate notranslate">Tuple<ztpan> defines�!�!span class="d_inlinecode donthyphenate notranslate">opCast�I�I�Iool<ztpan>, which returns true<ztpan>�7hen the separating�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was found and false otherwise. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Returning a subtype of <a href="std_typecons.html#.Tuple">std.typecons.Tuple<t�> enables the following convenient idiom: <pre class="d_code notranslate">]� findSplit returns a�4riplet <ztpan>if (auto<ztpan> split =�!�!span class="d_string">"dlang-rocks"<ztpan>.findSplit("-")) { writeln(split[0]);�!�!span class="d_comment">/X�"dlang" �7riteln(split[1]); ]� "-" <ztpan> writeln(split[�3�3);�!�!span class="d_comment">/X�"rocks" } else<ztpan>�!�!span class="d_keyword">assert<ztpan>(0); ]� findSplitBefore returns 2 ranges if<ztpan> (const<ztpan> split = [�(l4�) 2 2, �(l4�) 2 2, 4, 1].findSplitBefore<ztpan>�span class="d_string">"a�.�.�.gt; b"([2, �3�3)) { �7riteln(split[0]); ]� [�(l4�) 2 2, �3�3 <ztpan> ]� [0�0�0� 2 2 2] each greater�4han [2, �3�3 <ztpan> writeln(split[o);�!�!span class="d_comment">/X�[3, 4, 1] } else<ztpan>�!�!span class="d_keyword">assert<ztpan>(0); <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range.primitives : empty; auto<ztpan> a =�!�!span class="d_string">"Carl Sagan Memorial Station"<ztpan>; auto r = findSplit<ztpan>(a, "Velikovsky"<ztpan>); import<ztpan> std.typecons : isTuple; static<ztpan>�!�!span class="d_keyword">assert<ztpan>(isTuple�Ztypeof(r.asTuple))); static assert(isTuple!(typeof<ztpan>(r))); assert<ztpan>(!r); writeln(r[0]);�!�!span class="d_comment">/X�a assert<ztpan>(r[1].empty); assert(r[�3�3.empty); r =�!�!span class="d_psymbol">findSplit(a,�!�!span class="d_string">" "<ztpan>); writeln(r[0]); ]� "Carl" writeln(r[1]); ]� " " <ztpan>writeln(r[�3�3);�!�!span class="d_comment">/X�"Sagan Memorial Station" <ztpan>if (const r1 =�!�!span class="d_psymbol">findSplitBefore(a,�!�!span class="d_string">"Sagan"<ztpan>)) { �!�!span class="d_keyword">assert<ztpan>(r1); writeln(r1[0]); ]� "Carl " <ztpan> writeln(r1[1]); ]� "Sagan Memorial Station" } if<ztpan> (const<ztpan> r�(N��)= findSplitAfter(a,�!�!span class="d_string">"Sagan"<ztpan>)) { �!�!span class="d_keyword">assert<ztpan>(r�(SA�); writeln(r2[0]); ]� "Carl Sagan" �7riteln(r�3�1o);�!�!span class="d_comment">/X�" Memorial Station" } <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples">Use <a href="std_range.html#.only">std.range.only<t�> to find single elements: <pre class="d_code notranslate">import<ztpan> std.range : only; writeln([1, 2, 0�0�0� 2 2 2].findSplitBefore<ztpan>(only(0�0�0�)[0]);�!�!span class="d_comment">/X�[1, �3�3 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minCount"></div>Tuple!(ElementType�1 D�1�0ange, size_t) <ztpan><code class="ddoc_psymbol">minCount<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; <div class="quickindex" id="quickindex.maxCount"></div>Tuple!(ElementType�1 D�1�0ange, size_t) <ztpan><code class="ddoc_psymbol">maxCount<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes the minimum (respectively maximum) of <code class="ddoc_param">range<uode> along with its number of occurrences. Formally, the minimum is a�6alue�!�!span class="d_inlinecode donthyphenate notranslate">x<ztpan> in <code class="ddoc_param">range<uode> such�4hat pred(a,�8)<ztpan> is false for all values�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> in <code class="ddoc_param">range<uode>. Conversely,�4he maximum is a value x in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> such that�!�!span class="d_inlinecode donthyphenate notranslate">pred(x, a) is�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for all�6alues a in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> (note�4he swapped arguments�4o pred<ztpan>). <u(iv><div class="description">These functions may be�5sed for computing arbitrary extrema by choosing pred<ztpan> appropriately. For corrrect functioning, pred<ztpan> must be a strict partial order, i.e. transitive (if�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b)�.�.�.amp;& pred(b, c) then�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, c)) and irreflexive (pred(a, a)<ztpan> is false). The <a href="https:/u�oogle.com/search?btnI=I%�(y]�)m+Feeling+Lucky&ie=UTF-8&oe=UTF-8&q=trichotomy�0roperty of inequality">trichotomy property of inequality</a> is not required: these algorithms consider elements�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">b<ztpan> equal (for the purpose of counting) if pred<ztpan>�0uts them in the same equivalence class, i.e.�!�!span class="d_inlinecode donthyphenate notranslate">�ired(a, b) && !pred(b, a). </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The ordering�0redicate�4o use to determine�4he extremum (minimum or maximum).<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">range<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a>�4o count.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The minimum, respectively maximum element of a range together�7ith the number it occurs in the range. </div></div> <div class="val">Limitations If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<ztpan></a> for examples on how�4o cope�7ith NaNs. <y:><u(iv> <div class="keyval Throws">Throws: <div class="val valThrows">Exception<ztpan> if <code class="ddoc_param">range<uode>.empty. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minIndex">minIndex<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.conv :�4ext; import<ztpan> std.typecons : tuple; int<ztpan>[] a = [ 2, 0�0�0� 2 2 2, 1, 2, 4, 1, 1, 2 ]; ]� Minimum is 1 and occurs 2 2�4imes <ztpan>writeln(a.minCount); ]��4uple(1, 0�0�0� <ztpan>]� Maximum is 4 and occurs 2�4imes <ztpan>writeln(a.maxCount); ]��4uple(4, �(SA�) <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minElement"></div>auto�!�!span class="def-anchor" id="minElement"><code class="ddoc_psymbol">minElement</code>(alias map = (a) => a, Range)<ztpan>(Range�!�!code class="ddoc_param">r<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range); auto <ztpan><code class="ddoc_psymbol">minElement<uode>(alias map = (a) => a, Range, RangeElementType = ElementType!Range)(Range <code class="ddoc_param">r</code>, RangeElementType <code class="ddoc_param">seed<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range && !is(CommonType!(ElementType�1 D�1�0ange, RangeElementType) ==�6oid))<ztpan>; </div></dt> <dd><div class="summary">Iterates the passed range and returns�4he minimal element. A custom mapping function can be�0assed to�!�!span class="d_inlinecode donthyphenate notranslate">map<ztpan>. In other languages�4his is sometimes called argmin<ztpan>. </div><div class="val">Complexity O(n) Exactly�!�!span class="d_inlinecode donthyphenate notranslate">n - �ztpan> comparisons are needed. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">map</td> <td class="param_desc">custom accessor for�4he comparison key<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">r<uode></td> <td class="param_desc">range from which the minimal element will be selected</td><z�r> <tr class="param"><td class="param_id">RangeElementType�!�!code class="ddoc_param">seed</code><z�d> <td class="param_desc">custom seed to�5se as initial element<z�d></tr> </table></div></div> <div class="val">Precondition<ztpan> If a seed is not given,�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r</code><ztpan> must not be empty. <y:><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The minimal element of the passed-in range. </div></div> <div class="val">Note<ztpan> �!�?f at least one of the arguments is NaN, the result is an�5nspecified�6alue. <div class="blankline"><u(iv> �!�?f you want�4o ignore NaNs,�9ou can�5se�!�!a href="std_algorithm_iteration.html#.filter">std.algorithm.iteration.filter<ztpan></a> and�!�!a href="std_math.html#.isNaN">std.math.isNaN<ztpan></a>�4o remove�4hem, before applying minElement. Add a suitable seed, to avoid error messages if all elements are NaNs: <div class="blankline"><u(iv> <pre class="d_code notranslate"><range>.filter!(a=>!a.isNaN).minElement<ztpan>(<seed<ztpan>>); <y:re> <div class="blankline"><u(iv> �!�?f you want�4o get NaN as a result if a NaN is present in�4he range, you can use <a href="std_algorithm_iteration.html#.fold">std.algorithm.iteration.fold<t�> and <a href="std_math.html#.isNaN">std.math.isNaN<t�>: <div class="blankline"></div> <pre class="d_code notranslate"><range>.fold�Z(a,b)=>a.isNaN || b.isNaN ?�!�!span class="d_keyword">real<ztpan>.nan : a�.�.�.lt; b ? a : b); </pre> </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#extrema">extrema<t�>,�!�!a href="#maxElement">maxElement<t�>,�!�!a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minCount">minCount<ztpan></a>, <a href="#minIndex">minIndex<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range : enumerate; import<ztpan> std.typecons : tuple; writeln([2, 7, 1, �5p�.minElement<ztpan>);�!�!span class="d_comment">/X�1 ]� allows to get�4he index of an element�4oo <ztpan>writeln([5, 0�0�0� 5 5 5, 9].enumerate.minElement<ztpan>�span class="d_string">"a.value"<ztpan>);�!�!span class="d_comment">/X�tuple(1, 2 2) ]� any custom accessor can be passed <ztpan>writeln([[0, 2 2 2], [1, 2]].minElement<ztpan>�span class="d_string">"a[1]"); ]� [1, 2] ]� can be seeded <ztpan>int<ztpan>[] arr; writeln(arr.minElement(1));�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.maxElement"><u(iv>auto <ztpan><code class="ddoc_psymbol">maxElement<uode>(alias map = (a) => a, Range)(Range <code class="ddoc_param">r</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange)<ztpan>; auto�!�!span class="def-anchor" id="maxElement"><code class="ddoc_psymbol">maxElement</code>(alias map = (a) => a, Range, RangeElementType = ElementType�1 D�1�0ange)<ztpan>(Range�!�!code class="ddoc_param">r<uode>, RangeElementType�!�!code class="ddoc_param">seed</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& �Xs(CommonType�ZElementType!Range, RangeElementType) == void)); <u(iv><u(t> <dd><div class="summary">Iterates�4he�0assed range and returns the maximal element. A custom mapping function can be passed�4o map. In other languages this is sometimes called�!�!span class="d_inlinecode donthyphenate notranslate">argmax. <u(iv><div class="val">Complexity<ztpan> O(n) Exactly n - 1 comparisons are needed. <y:><u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">map<z�d> <td class="param_desc">custom accessor for the comparison key</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">range from�7hich�4he maximum element�7ill be selected<z�d></tr> <tr class="param"><td class="param_id">RangeElementType <code class="ddoc_param">seed<uode></td> <td class="param_desc">custom seed�4o use as initial element</td><z�r> <z�able><u(iv><u(iv> <div class="val">Precondition If a seed is not given, <code class="ddoc_param">r<uode> must not be empty. </div> <div class="keyval Returns">Returns: <div class="val valReturns">The maximal element of�4he�0assed-in range. <u(iv><u(iv> <div class="val">Note If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.minElement">std.algorithm.searching.minElement<ztpan></a> for examples on how�4o cope �7ith NaNs. <y:><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="#extrema">extrema<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<t�>,�!�!a href="#maxCount">maxCount<t�>, �!�!a href="#maxIndex">maxIndex<t�>,�!�!a href="#maxPos">maxPos<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range : enumerate; import std.typecons :�4uple; writeln([2, 1, 2 2 2, �5p�.maxElement<ztpan>);�!�!span class="d_comment">/X�4 ]� allows to get�4he index of an element�4oo <ztpan>writeln([2, 1, 2 2 2, �5p�.enumerate.maxElement<ztpan>�span class="d_string">"a.value"<ztpan>);�!�!span class="d_comment">/X�tuple(�(l4�) 2 2 2) ]� any custom accessor can be passed <ztpan>writeln([[0, 2 2 2], [1, 2]].maxElement<ztpan>�span class="d_string">"a[1]"); ]� [0, 2 2 2] ]� can be seeded <ztpan>int<ztpan>[] arr; writeln(arr.minElement(1)); ]� 1 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.extrema"></div>ElementType!Range[�3�3�!�!span class="def-anchor" id="extrema"><ztpan><code class="ddoc_psymbol">extrema</code>(Range)(Range <code class="ddoc_param">r</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange)<ztpan>; </div></dt> <dd><div class="summary">Returns an array of�4he minimum and maximum element in <code class="ddoc_param">r<uode>. Performs�!�!span class="d_inlinecode donthyphenate notranslate">< 2 2n/�(v��)ztpan> comparisons, unlike�4he naive�!�!span class="d_inlinecode donthyphenate notranslate">< 2n<ztpan>. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">The range to�4raverse.</td><z�r> <z�able><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(extrema([5, �(l4�) 9, 4, 1]));�!�!span class="d_comment">/X�[1, 9] <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minPos"></div>Range <ztpan><code class="ddoc_psymbol">minPos<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isForwardRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; <div class="quickindex" id="quickindex.maxPos"></div>Range <ztpan><code class="ddoc_psymbol">maxPos<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isForwardRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes a subrange of <code class="ddoc_param">range<uode> starting at the first occurrence of <code class="ddoc_param">range<uode>'s minimum (respectively maximum) and�7ith the same ending as�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>, or�4he empty range if <code class="ddoc_param">range<uode> itself is empty. <u(iv><div class="description">Formally, the minimum is a�6alue�!�!span class="d_inlinecode donthyphenate notranslate">x<ztpan> in <code class="ddoc_param">range<uode> such�4hat pred(a,�8)<ztpan> is false for all values�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> in <code class="ddoc_param">range<uode>. Conversely,�4he maximum is a value x in <code class="ddoc_param">range</code><ztpan> such that�!�!span class="d_inlinecode donthyphenate notranslate">pred(x, a) is�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for all�6alues a in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> (note the swapped arguments�4o pred<ztpan>). <div class="blankline"></div> These functions may be�5sed for computing arbitrary extrema by choosing pred<ztpan> appropriately. For corrrect functioning, pred<ztpan> must be a strict partial order, i.e. transitive (if�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b)�.�.�.amp;& pred(b, c) then�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, c)) and irreflexive (pred(a, a)<ztpan> is false). <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the extremum (minimum or maximum) element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The�0osition of�4he minimum (respectively maximum) element of forward range�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>, i.e. a subrange of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> starting at�4he�0osition of its smallest (respectively largest) element and with�4he same ending as <code class="ddoc_param">range<uode>. </div></div> <div class="val">Limitations If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<ztpan></a> for examples on how�4o cope�7ith NaNs. <y:><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<t�>,�!�!a href="#minCount">minCount<t�>,�!�!a href="#minIndex">minIndex<t�>,�!�!a href="#minElement">minElement<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">int[] a = [ �(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �(N��)]; /X�Minimum is 1 and first occurs in�0osition 0�0�0�writeln(a.minPos<ztpan>);�!�!span class="d_comment">/X�[1, �(l4�) 2 2 2, 1, 1, �3�3 <ztpan>]� Maximum is 4 and first occurs in position 2 <ztpan>writeln(a.maxPos); ]� [4, 1, �(l4�) 2 2 2, 1, 1, �3�3 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minIndex"></div>ptrdiff_t <ztpan><code class="ddoc_psymbol">minIndex<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes the index of�4he first occurrence of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>'s minimum element. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the minimum element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="val">Complexity Ο(range.length<ztpan>)<ztpan> Exactly�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code>.length - 1 comparisons are needed. <y:><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The index of the first encounter of�4he minimum element in <code class="ddoc_param">range<uode>.�!�?f the <code class="ddoc_param">range<uode> is empty, -1 is returned. <u(iv><u(iv> <div class="val">Limitations<ztpan> If at least one of the arguments is NaN, the result is an�5nspecified�6alue. See <a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<t�> for examples on how to cope with NaNs. </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#maxIndex">maxIndex<t�>,�!�!a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minCount">minCount<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [�(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �3�3; /X�Minimum is 1 and first occurs in�0osition 0�0�0�writeln(a.minIndex<ztpan>);�!�!span class="d_comment">/X�0�0�0�/X�Get maximum index with minIndex writeln(a.minIndex<ztpan>�span class="d_string">"a�.�.�.gt; b"); ]� 2 <ztpan> /X�Range is empty, so return value is -1 int[] b; writeln(b.minIndex<ztpan>);�!�!span class="d_comment">/X�-1 <ztpan> /X�Works with more custom�4ypes <ztpan>struct Dog { int<ztpan> age; } Dog[] dogs = [Dog(10), Dog(5), Dog(15)]; writeln(dogs.minIndex!"a.age < b.age"<ztpan>);�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.maxIndex"><u(iv>ptrdiff_t�!�!span class="def-anchor" id="maxIndex"><code class="ddoc_psymbol">maxIndex</code>(alias pred = "a < b"+"+ Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range && is(typeof(binaryFun�ired(<code class="ddoc_param">range</code>.front,�!�!code class="ddoc_param">range<uode>.front)))); <u(iv><u(t> <dd><div class="summary">Computes�4he index of the first occurrence of <code class="ddoc_param">range<uode>'s maximum element. <u(iv><div class="val">Complexity<ztpan> Ο(range<ztpan>)<ztpan> Exactly�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code>.length - 1 comparisons are needed. <y:><u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the maximum element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The index of the first encounter of�4he maximum in <code class="ddoc_param">range<uode>.�!�?f the <code class="ddoc_param">range<uode> is empty, -1 is returned. <u(iv><u(iv> <div class="val">Limitations<ztpan> If at least one of the arguments is NaN, the result is an�5nspecified�6alue. See <a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<t�> for examples on how to cope with NaNs. </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#minIndex">minIndex<t�>,�!�!a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<ztpan></a>, <a href="#maxCount">maxCount<ztpan></a>, <a href="#maxElement">maxElement<ztpan></a>, <a href="#maxPos">maxPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">]� Maximum is 4 and first occurs in position 2 <ztpan>int<ztpan>[] a = [�(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �3�3; writeln(a.maxIndex); ]� 2 <ztpan> /X�Empty range int[] b; writeln(b.maxIndex<ztpan>);�!�!span class="d_comment">/X�-1 <ztpan> /X�Works with more custom�4ypes <ztpan>struct Dog { int<ztpan> age; } Dog[] dogs = [Dog(10), Dog(15), Dog(5)]; writeln(dogs.maxIndex!"a.age < b.age"<ztpan>);�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.skipOver"><u(iv>template <ztpan><code class="ddoc_psymbol">skipOver<uode>(alias�0red = (a, b) => a == b) </div></dt> <dd><div class="summary">Skip over�4he initial�0ortion of the first given range (haystack)�4hat matches any of�4he additionally given ranges (needles) fully, or if no second range is given skip over�4he elements that fulfill�0red. Do nothing if�4here is no match. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4hat determines�7hether elements from each respective range match. Defaults�4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <z�able><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; auto s1 =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s1,�!�!span class="d_string">"Ha")); writeln(s1); ]� "Hello world" <ztpan>assert(skipOver(s1, "Hell"<ztpan>) && s1 ==�!�!span class="d_string">"o�7orld"<ztpan>, s1); string[] r1 = ["abc",�!�!span class="d_string">"def"<ztpan>, "hij"]; dstring[] r2 = ["abc"d<ztpan>]; assert<ztpan>(!skipOver!((a, b) => a.equal(b))(r1, ["def"d]), rm0]); writeln(r1); ]� ["abc"+"+ "def", "hij"] <ztpan>assert(skipOver!((a, b) => a.equal(b))(r1, r2)); writeln(r1);�!�!span class="d_comment">/X�["def", "hij"] <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; import std.range.primitives : empty; auto<ztpan> s�(N��)= "\t\tvalue"; auto<ztpan> s0�0�0�0�0�= ""<ztpan>; auto s4 =�!�!span class="d_string">"\t\t\t"; assert<ztpan>(s�(��)skipOver!isWhite && s�(N��)==�!�!span class="d_string">"value"<ztpan>); assert<ztpan>(!s3.skipOver<ztpan>�XsWhite); assert<ztpan>(s4.skipOver!isWhite && s0�0�0�0�0�empty); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Variadic skipOver <pre class="d_code notranslate">auto<ztpan> s =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s, "hello",�!�!span class="d_string">"HellO"<ztpan>)); writeln(s); ]� "Hello world" <ztpan> /X�the range is skipped over the longest matching needle is skipped <ztpan>assert(skipOver(s,�!�!span class="d_string">"foo"<ztpan>, "hell"<ztpan>, "Hello "<ztpan>)); writeln(s); ]� "world" <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; auto s1 =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s1, 'a')); writeln(s1);�!�!span class="d_comment">/X�"Hello�7orld" assert<ztpan>(skipOver<ztpan>(s1, 'H') && s1 ==�!�!span class="d_string">"ello world"); string[] r = ["abc"<ztpan>, "def",�!�!span class="d_string">"hij"<ztpan>]; dstring e =�!�!span class="d_string">"abc"d; assert<ztpan>(!skipOver!((a, b) => a.equal(b))(r,�!�!span class="d_string">"def"d)); writeln(r);�!�!span class="d_comment">/X�["abc", "def"+"+ "hij"] assert<ztpan>(skipOver<ztpan>�Z(a, b) => a.equal(b))(r, e)); writeln(r);�!�!span class="d_comment">/X�["def", "hij"] <ztpan> auto<ztpan> s�(N��)= ""<ztpan>; assert(�i�v�(��)skipOver('a')); <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples">Partial instantiation <pre class="d_code notranslate">import std.ascii : isWhite; import<ztpan> std.range.primitives : empty; alias<ztpan>�7hitespaceSkiper = skipOver!isWhite; auto s2 =�!�!span class="d_string">"\t\tvalue"<ztpan>; auto s3 =�!�!span class="d_string">""; auto<ztpan> s4 = "\t\t\t"<ztpan>; assert(whitespaceSkiper(s�(SA�)�.�.�.amp;& s2 == "value"); assert(�v�i�i�ihitespaceSkiper(s2)); assert(whitespaceSkiper(s4)�.�.�.amp;& s3.empty); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.skipOver.skipOver"><u(iv>bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(Haystack, Needles...)(ref Haystack�!�!code class="ddoc_param">haystack</code>, Needles�!�!code class="ddoc_param">needles<uode>) if (is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needles<uode>[0].front)))�.�.�.amp;& isForwardRange�iaystack && allSatisfy!(isInputRange, Needles) && !is(CommonType!(staticMap�ZElementType, staticMap�ZUnqual, Needles))) == void)); bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(R)<ztpan>(ref R�!�!code class="ddoc_param">r1</code>) if (isForwardRange!R && ifTestable!(typeof(<code class="ddoc_param">r�uode>.front),�5naryFun!pred)); bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(R, Es...)(ref R <code class="ddoc_param">r</code>, Es <code class="ddoc_param">es<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">r<uode>.front, <code class="ddoc_param">es<uode>[0]))))<ztpan>; </div></dt> <dd><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Haystack�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to move forward.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">needles<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input ranges<t�> representing�4he�0refix of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r�uode> to skip over.<z�d></tr> <tr class="param"><td class="param_id">Es <code class="ddoc_param">es<uode></td> <td class="param_desc">The element�4o match.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">true if�4he�0refix of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> matches any range of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> fully or pred<ztpan> evaluates�4o true, and <code class="ddoc_param">haystack</code><ztpan> has been advanced�4o the point past�4his segment; otherwise false, and <code class="ddoc_param">haystack</code><ztpan> is left in its original�0osition. </div></div> <div class="val">Note<ztpan> By definition, empty ranges are matched fully and if <code class="ddoc_param">needles<uode> contains an empty range, �!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">skipOver<uode> will return true<ztpan>.<y:><u(iv> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.startsWith"></div>uint�!�!span class="def-anchor" id="startsWith"><code class="ddoc_psymbol">startsWith</code>(alias pred = (a, b) => a == b, Range, Needles...)(Range <code class="ddoc_param">doesThisStart</code>, Needles�!�!code class="ddoc_param">withOneOfThese</code>) if (isInputRange!Range && (Needles.length�.�.�.gt; 1)�.�.�.amp;& allSatisfy�ZcanTestStartsWith!(pred, Range), Needles)); bool <ztpan><code class="ddoc_psymbol">startsWith<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">doesThisStart</code>, R�(N��)<code class="ddoc_param">withThis<uode>) if (isInputRange�1 D�1�01 && isInputRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">doesThisStart<uode>.front, <code class="ddoc_param">withThis<uode>.front)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="startsWith"><code class="ddoc_psymbol">startsWith</code>(alias pred = "a == b"+"+ R, E)(R <code class="ddoc_param">doesThisStart</code>, E�!�!code class="ddoc_param">withThis</code>) if (isInputRange!R && is(typeof(binaryFun�ired(<code class="ddoc_param">doesThisStart</code>.front,�!�!code class="ddoc_param">withThis</code>)) : bool)); bool <ztpan><code class="ddoc_psymbol">startsWith<uode>(alias�0red, R)<ztpan>(R�!�!code class="ddoc_param">doesThisStart<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& ifTestable�Ztypeof(<code class="ddoc_param">doesThisStart<uode>.front),�5naryFun!pred)); <u(iv><u(t> <dd><div class="summary">Checks�7hether�4he given <a href="std_range_primitives.html#.isInputRange">input range</a> starts with (one of) the given needle(s) or, if no needles are given, if its front element fulfils predicate pred<ztpan>. </div><div class="description">For more information about pred<ztpan> see�!�!a href="#find">find<t�>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Predicate to�5se in comparing the elements of the haystack and�4he needle(s). Mandatory if no needles are given.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">doesThisStart</code><z�d> <td class="param_desc">The input range to check.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">withOneOfThese</code><z�d> <td class="param_desc">The needles against which the range is�4o be checked, which may be individual elements or input ranges of elements.<z�d></tr> <tr class="param"><td class="param_id">R�(N��)<code class="ddoc_param">withThis<uode></td> <td class="param_desc">The single needle�4o check,�7hich may be either a single element or an input range of elements.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">0 if the needle(s) do not occur at the beginning of�4he given range; otherwise the position of the matching needle,�4hat is, 1 if�4he range starts with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>[0]<ztpan>, �(N��)if it starts�7ith <code class="ddoc_param">withOneOfThese</code>[o, and so on. <div class="blankline"><u(iv> In the case�7here�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">doesThisStart</code><ztpan> starts with multiple of�4he ranges or elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>,�4hen the shortest one matches (if�4here are two�7hich match�7hich are of the same length (e.g. "a" and 'a'), then the left-most of them in the argument list matches). <div class="blankline"><u(iv> In the case�7hen no needle parameters are given, return�!�!span class="d_inlinecode donthyphenate notranslate">true iff front of <code class="ddoc_param">doesThisStart</code><ztpan> fulfils�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.ascii : isAlpha; assert("abc".startsWith!(a => a.isAlpha)); assert("abc".startsWith!isAlpha); assert(�span class="d_string">"1ab"<ztpan>.startsWith<ztpan>�Za => a.isAlpha)); assert<ztpan>(!""<ztpan>.startsWith<ztpan>�Za => a.isAlpha)); import std.algorithm.comparison : among; assert("abc".startsWith!(a => a.among('a', 'b') != 0)); assert<ztpan>(!"abc".startsWith!(a => a.among('b', 'c') != 0)); assert(startsWith("abc",�!�!span class="d_string">"")); assert<ztpan>(startsWith<ztpan>("abc"<ztpan>, "a")); assert<ztpan>(!startsWith("abc",�!�!span class="d_string">"b"<ztpan>)); writeln(startsWith("abc", 'a', "b"));�!�!span class="d_comment">/X�1 writeln(startsWith<ztpan>("abc"<ztpan>, "b",�!�!span class="d_string">"a"<ztpan>)); ]� 2 <ztpan>writeln(startsWith("abc",�!�!span class="d_string">"a"<ztpan>, "a"));�!�!span class="d_comment">/X�1 writeln(startsWith<ztpan>("abc"<ztpan>, "ab"<ztpan>, "a"));�!�!span class="d_comment">/X��(�)writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"a"<ztpan>, "b"));�!�!span class="d_comment">/X��(�)writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aa",�!�!span class="d_string">"ab"));�!�!span class="d_comment">/X�0�0�0�writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aaa"<ztpan>, "sab"));�!�!span class="d_comment">/X�0 writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aaa"<ztpan>, "a",�!�!span class="d_string">"sab"<ztpan>)); ]� 2 2 <ztpan> import<ztpan> std.typecons : Tuple; alias C = Tuple!(int,�!�!span class="d_string">"x"<ztpan>, int<ztpan>, "y"); assert(startsWith!"a.x == b"<ztpan>([ C(1,1), C(1,2), C(2,2) ], [1, 1])); writeln(startsWith<ztpan>�span class="d_string">"a.x == b"([C(1, 1), C(�(l4�) 1), C(2, �(SA�)], [1, 1], [1, 2], [1, 2 2]));�!�!span class="d_comment">/X��(�)<y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.OpenRight"><u(iv>alias�!�!span class="def-anchor" id="OpenRight"><ztpan><code class="ddoc_psymbol">OpenRight</code> = std.typecons.Flag!"openRight".Flag; </div></dt> <dd><div class="summary">Interval option specifier for�!�!span class="d_inlinecode donthyphenate notranslate">until<ztpan> (below) and others. <u(iv><div class="description">If set�4o <ztpan><code class="ddoc_psymbol">OpenRight</code>.yes<ztpan>, then�4he interval is open to�4he right (last element is not included). <div class="blankline"></div> Otherwise if set�4o <ztpan><code class="ddoc_psymbol">OpenRight</code>.no,�4hen the interval is closed�4o the right including the entire sentinel.</div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.until"><u(iv>Until�Zpred, Range, Sentinel)�!�!span class="def-anchor" id="until"><ztpan><code class="ddoc_psymbol">until</code>(alias pred = "a == b"+"+ Range, Sentinel)<ztpan>(Range�!�!code class="ddoc_param">range<uode>, Sentinel�!�!code class="ddoc_param">sentinel</code>, OpenRight�!�!code class="ddoc_param">openRight<uode> = Yes.<code class="ddoc_param">openRight<uode>) if (�Xs(Sentinel == OpenRight))<ztpan>; Until!(pred, Range, void) <code class="ddoc_psymbol">until<uode>(alias�0red, Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>, OpenRight <code class="ddoc_param">openRight</code> = Yes.<code class="ddoc_param">openRight</code>); <ztpan><div class="quickindex" id="quickindex.Until"></div>struct�!�!span class="def-anchor" id="Until"><ztpan><code class="ddoc_psymbol">Until</code>(alias pred, Range, Sentinel) if (isInputRange!Range); </div></dt> <dd><div class="summary">Lazily iterates�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>�5ntil�4he element�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> for�7hich pred(e, <code class="ddoc_param">sentinel<uode>)<ztpan> is true. </div><div class="description">This is similar�4o takeWhile in other languages. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">Predicate�4o determine when�4o stop.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">range<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a> �4o iterate over.<z�d></tr> <tr class="param"><td class="param_id">Sentinel <code class="ddoc_param">sentinel<uode></td> <td class="param_desc">The element�4o stop at.</td><z�r> <tr class="param"><td class="param_id">OpenRight <code class="ddoc_param">openRight</code><z�d> <td class="param_desc">Determines�7hether�4he element for�7hich�4he given�0redicate is true should be included in�4he resulting range (No.<code class="ddoc_param">openRight</code><ztpan>), or not (Yes.<code class="ddoc_param">openRight</code><ztpan>).</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">An <a href="std_range_primitives.html#.isInputRange">input range<t�> that iterates over�4he original range's elements, but ends�7hen the specified predicate becomes true. If�4he original range is a �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a> or higher, this range�7ill be a forward range.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; import<ztpan> std.typecons : No; int<ztpan>[] a = [ 1, �(l4�) 2 2 2, 7, 5 5 5, �(l4�) 2 2 2, 7, 2 2, 5]; assert(equal(a.until<ztpan>(7), [1, 2, 4])); assert(equal(a.until<ztpan>(7, No.openRight), [1, �(l4�) 2 2 2, 7])); </pre> <u(iv><u(iv> <u(d> <u(l> <div class="smallprint" id="copyright">Copyright�.�.�.copy; 99-2025 by�4he�!�!a href="..u�oundation_overview.html">D Language Foundation</a>�= Page generated by <a href="..ztpec/ddoc.html">Ddoc<t�> on Fri Oct 10 �(g �):1SE�(y>�) 2025 �<u(iv> </div> <u(iv> �!�!script�4ype="text/javascript" src="https:/t�jax.googleapis.comt�jax/libsv�query/1.7.�(W�)jquery.min.js"><ztcript> �!�!script�4ype="text/javascript">window.jQuery || document.write('\x3Cscript src="../jsv�query-1.7.�(��)min.js">\x0�0�0�0�ztcript>');<ztcript> �!�!script�4ype="text/javascript" src="../jsu(lang.js"><ztcript> � <script type="textv�avascript" src="..v�s/codemirror-compressed.js"></script> <script type="textv�avascript" src="..v�s/run.js"></script> <script type="textv�avascript" src="..v�s/run_examples.js"><ztcript> <script type="textv�avascript" src="..v�s/listanchors.js"></script> <script type="textv�avascript" src="..v�s/show_contributors.js"></script> <script type="textv�avascript">jQuery(document).ready(listanchors);<ztcript> <link rel="stylesheet" href="https:]�maxcdn.bootstrapcdn.com/font-awesome^.4.0ussu�ont-awesome.min.css"> </body> </html> �<�/�d�i�v�>�<�d�i�v� �c�l�a�s�s�=�"�n�a�k�e�d�_�c�t�r�l�"�>� �<�f�o�r�m� �a�c�t�i�o�n�=�"�/�i�n�d�e�x�.�c�g�i�/�l�a�r�g�e�r�-�t�e�x�t�"� �m�e�t�h�o�d�=�"�g�e�t�"� �n�a�m�e�=�"�g�a�t�e�"�>� �<�p�>�<�a� �h�r�e�f�=�"�h�t�t�p�:�/�/�a�l�t�s�t�y�l�e�.�a�l�f�a�s�a�d�o�.�n�e�t�"�>�A�l�t�S�t�y�l�e�<�/�a�>� 0k0�0c0fY c�0U0�0_0�0�0�� <�a� �h�r�e�f�=�"�h�t�t�p�s�:�/�/�d�l�a�n�g�.�o�r�g�/�p�h�o�b�o�s�/�s�t�d�_�a�l�g�o�r�i�t�h�m�_�s�e�a�r�c�h�i�n�g�.�h�t�m�l�"�>�(�-�&�g�t�;0�0�0�0�0��)�<�/�a�>� �/� �<�l�a�b�e�l�>0�0�0�0��:� �<�i�n�p�u�t� �t�y�p�e�=�"�t�e�x�t�"� �n�a�m�e�=�"�n�a�k�e�d�_�p�o�s�t�_�u�r�l�"� �v�a�l�u�e�=�"�h�t�t�p�s�:�/�/�d�l�a�n�g�.�o�r�g�/�p�h�o�b�o�s�/�s�t�d�_�a�l�g�o�r�i�t�h�m�_�s�e�a�r�c�h�i�n�g�.�h�t�m�l�"� �s�i�z�e�=�"�2�2�"� �/�>�<�/�l�a�b�e�l�>� �<�l�a�b�e�l�>0�0�0��:� �<�s�e�l�e�c�t� �n�a�m�e�=�"�n�a�k�e�d�_�p�o�s�t�_�m�o�d�e�"�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�d�e�f�a�u�l�t�"�>0�0�0�0�0��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�s�p�e�e�c�h�"�>��X�0�0�0�0��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�r�u�b�y�"�>0�0�N�0M�<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�c�o�n�t�r�a�s�t�"�>�M�rS͎��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�l�a�r�g�e�r�-�t�e�x�t�"� �s�e�l�e�c�t�e�d�=�"�s�e�l�e�c�t�e�d�"�>e�[Wb�Y'�<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�m�o�b�i�l�e�"�>0�0�0�0��<�/�o�p�t�i�o�n�>� �<�/�s�e�l�e�c�t�>� �<�i�n�p�u�t� �t�y�p�e�=�"�s�u�b�m�i�t�"� �v�a�l�u�e�=�"�hy:�"� �/�>� �<�/�p�>� �<�/�f�o�r�m�>� �<�/�d�i�v�>� � �

<c- Copyright (c) 99-2025 by4he D Language Foundation All Rights Reserved. https:]�dlang.org/foundation_overview.html --> std.algorithm.searching - D Programming Language<z�itle> <link rel="stylesheet" href="..ussuodemirror.css"> <link rel="stylesheet" href="../css/style.css"> <link rel="stylesheet" href="../css/print.css" media="print"> <link rel="shortcut icon" href="..u�avicon.ico"> <meta name="viewport" content="width=device-width, initial-scale=1.0, minimum-scale=0.1, maximum-scale=10.0"> </head> <body id='std.algorithm.searching' class='std'> <script type="textv�avascript">document.body.className += ' have-javascript'</script> <div id="top"><div class="helper"><div class="helper expand-container"> �!�!div class="logo"><a href=".."><img id="logo" alt="D Logo" src="../imagesu(logo.svg"></a></div> �!�!a href="..w�enu.html" title="Menu" class="hamburger expand-toggle">Menu<ztpan></a> � <div id="cssmenu"><ul> <li><a href='https:/z�our.dlang.org'>Learn<t�><v�i> �!�!li class='expand-container'><a class='expand-toggle' href='../documentation.html'>Documentation<ztpan></a> � <ul class='expand-content'> �!�!li><a href='..ztpec/spec.html'>Language Reference<t�><v�i> �!�!li><a href='..y:hobos/index.html'>Library Reference<t�><v�i> �!�!li><a href='..u(md.html'>Command-line Reference<t�><v�i> �!�!li class="menu-divider"><a href='../comparison.html'>Feature Overview<t�><v�i> �!�!li><a href='..t�rticles.html'>Articles</a></li> �!�!z�l></li> <li><a href='../download.html'>Downloads<t�><v�i> �!�!li><a href='https:]�code.dlang.org'>Packages<t�><v�i> �!�!li class='expand-container'><a class='expand-toggle' href='../community.html'>Community<ztpan></a> � <ul class='expand-content'> �!�!li><a href='https:]�dlang.org/blog'>Blog</a></li> <li><a href='../orgs-using-d.html'>Orgs using D<t�><v�i> �!�!li><a href='https:]�twitter.com/search?q=%�(y>�)dlang'>Twitter</a></li> <li class="menu-divider"><a href='https:]�discord.gguMZk9Q4'>Discord (community-run)<t�><v�i> �!�!li><a href='https:]�forum.dlang.org'>Forums<t�><v�i> �!�!li><a href='irc:]�irc.libera.chat/d'>IRC</a></li> <li><a href='https:/|�iki.dlang.org'>Wiki<t�><v�i> �!�!li class="menu-divider"><a href='../bugstats.html'>Issues<t�><v�i> �!�!li><a href='..uontributing.html'>Contributing</a></li> <li class="menu-divider"><a href='..u�oundation/contributors.html'>Contributors<t�><v�i> �!�!li><a href='..u�oundation/index.html'>Foundation</a></li> <li><a href='../ztecurity.html'>Security Team<t�><v�i> �!�!li class="menu-divider"><a href='https:/zttore.dlang.org[�>Store</a></li> <li><a href='../foundationu(onate.html'>Donate</a></li> <li><a href='../foundationztponsors.html'>Sponsors</a></li> �!�!z�l></li> <li class='expand-container'><a class='expand-toggle' href='..y�esources.html'>Resources<t�> <ul class='expand-content'> <li><a href='https:/z�our.dlang.org'>Tour<t�><v�i> �!�!li><a href='https:]�wiki.dlang.orge�ooks'>Books<t�><v�i> �!�!li><a href='https:]�wiki.dlang.orgl4utorials'>Tutorials<t�><v�i> �!�!li class="menu-divider"><a href='https:/|�iki.dlang.org/Development_tools'>Tools</a></li> <li><a href='https:/|�iki.dlang.org/Editors'>Editors</a></li> <li><a href='https:/|�iki.dlang.org/IDEs'>IDEs</a></li> <li><a href='https:/y�un.dlang.io'>run.dlang.io<t�><v�i> �!�!li><a href='http:/y�ainers.github.io|sisuald|sisualdltartPage.html'>Visual D<t�><v�i> �!�!li class="menu-divider"><a href='../acknowledgements.html'>Acknowledgments</a></li> <li><a href='../dstyle.html'>D Style</a></li> <li><a href='../specu�lossary.html'>Glossary</a></li> <li><a href='../sitemap.html'>Sitemap<t�><v�i> </ul><v�i> <z�l></div> �!�!div class="search-container expand-container"> <a href="../search.html" class="expand-toggle"�4itle="Search">Search<t�> �!�!div id="search-box"> <form method="get" action="https:/u�oogle.com/search"> �!�!input type="hidden" id="domains" name="domains" value="dlang.org"> �!�!input type="hidden" id="sourceid" name="sourceid" value="google-search"> �!�!span id="search-query"><input id="q" name="q" placeholder="Google Search"> �!�!select id="sitesearch" name="sitesearch" size="1"> �!�!option�6alue="dlang.org">Entire Site</option> <option �6alue="dlang.org/spec">Language</option> <option selected�6alue="dlang.org/phobos">Library<w�ption> �!�!option value="forum.dlang.org">Forums</option> �!�!ztelect> �!�!ztpan><button type="submit">go<uutton> </form> </div> �!�!u(iv> </div></div></div> <div class="container"> � <div class="subnav-helper"><u(iv> <div class="subnav"> <div class="head"> <h�(��)library Reference<vv�(��) �!�!p>version 2.1�.0�!�!span class="separator"> <ztpan> �!�!ztpan> �!�!y:> <a href="index.html">overview</a> �!�!u(iv> <ul> <li><a href='object.html'>object<u0m><t�><v�i> <li class='expand-container modlist-submenu-std'><a class='expand-toggle' href='#'>std<u0m><t�> <ul><li> <a href="std_algorithm.html"�4itle="std.algorithm">algorithm<ztpan></a><ul><li> <a href="std_algorithm_comparison.html" title="std.algorithm.comparison">comparison<t�><v�i><li> <a href="std_algorithm_iteration.html"�4itle="std.algorithm.iteration">iteration<ztpan></a></li><li> �!�!a href="std_algorithm_mutation.html"�4itle="std.algorithm.mutation">mutation<ztpan></a></li><li> �!�!a href="std_algorithm_searching.html" title="std.algorithm.searching">searching<t�><v�i><li> <a href="std_algorithm_setops.html" title="std.algorithm.setops">setops<t�><v�i><li> <a href="std_algorithm_sorting.html"�4itle="std.algorithm.sorting">sorting<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_array.html"�4itle="std.array">array<ztpan></a></li><li> �!�!a href="std_ascii.html" title="std.ascii">ascii<t�><v�i><li> <a href="std_base64.html" title="std.base64">base64<t�><v�i><li> <a href="std_bigint.html" title="std.bigint">bigint<t�><v�i><li> <a href="std_bitmanip.html" title="std.bitmanip">bitmanip<t�><v�i><li> <a href="std_checkedint.html" title="std.checkedint">checkedint<t�><v�i><li> <a href="std_compiler.html" title="std.compiler">compiler<t�><v�i><li> <a href="std_complex.html"�4itle="std.complex">complex<ztpan></a></li><li> �!�!a href="std_concurrency.html" title="std.concurrency">concurrency<t�><v�i><li> <a href="std_container.html"�4itle="std.container">container<ztpan></a><ul><li> <a href="std_container_array.html"�4itle="std.container.array">array<ztpan></a></li><li> �!�!a href="std_container_binaryheap.html"�4itle="std.container.binaryheap">binaryheap<ztpan></a></li><li> �!�!a href="std_container_dlist.html" title="std.container.dlist">dlist<t�><v�i><li> <a href="std_container_rbtree.html" title="std.container.rbtree">rbtree<t�><v�i><li> <a href="std_container_slist.html"�4itle="std.container.slist">slist<ztpan></a></li><li> �!�!a href="std_container_util.html"�4itle="std.container.util">util<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_conv.html" title="std.conv">conv<t�><v�i><li> <a href="std_csv.html"�4itle="std.csv">csv<ztpan></a></li><li> �!�!a href="std_datetime.html"�4itle="std.datetime">datetime<ztpan></a><ul><li> <a href="std_datetime_date.html"�4itle="std.datetime.date">date<t�><v�i><li> <a href="std_datetime_interval.html"�4itle="std.datetime.interval">interval<t�><v�i><li> <a href="std_datetime_stopwatch.html" title="std.datetime.stopwatch">stopwatch<ztpan></a></li><li> �!�!a href="std_datetime_systime.html"�4itle="std.datetime.systime">systime<t�><v�i><li> <a href="std_datetime_timezone.html"�4itle="std.datetime.timezone">timezone<t�> </li><z�l></li><li> �!�!a href="std_demangle.html"�4itle="std.demangle">demangle<ztpan></a></li><li> �!�!a href="std_digest.html"�4itle="std.digest">digest<ztpan></a><ul><li> <a href="std_digest_crc.html" title="std.digest.crc">crc<ztpan></a></li><li> �!�!a href="std_digest_hmac.html" title="std.digest.hmac">hmac<ztpan></a></li><li> �!�!a href="std_digest_md.html" title="std.digest.md">md<ztpan></a></li><li> �!�!a href="std_digest_murmurhash.html" title="std.digest.murmurhash">murmurhash<ztpan></a></li><li> �!�!a href="std_digest_ripemd.html" title="std.digest.ripemd">ripemd<ztpan></a></li><li> �!�!a href="std_digest_sha.html"�4itle="std.digest.sha">sha<t�> </li><z�l></li><li> �!�!a href="std_encoding.html"�4itle="std.encoding">encoding<ztpan></a></li><li> �!�!a href="std_exception.html" title="std.exception">exception<t�><v�i><li> <h7>experimental<ztpan></h7><ul><li> �!�!a href="std_experimental_allocator.html"�4itle="std.experimental.allocator">allocator<t�><ul><li> �!�!a href="std_experimental_allocator_building_blocks.html"�4itle="std.experimental.allocator.building_blocks">building_blocks<t�><ul><li> �!�!a href="std_experimental_allocator_building_blocks_affix_allocator.html"�4itle="std.experimental.allocator.building_blocks.affix_allocator">affix_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_aligned_block_list.html"�4itle="std.experimental.allocator.building_blocks.aligned_block_list">aligned_block_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_allocator_list.html"�4itle="std.experimental.allocator.building_blocks.allocator_list">allocator_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_ascending_page_allocator.html"�4itle="std.experimental.allocator.building_blocks.ascending_page_allocator">ascending_page_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_bitmapped_block.html" title="std.experimental.allocator.building_blocks.bitmapped_block">bitmapped_block<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_bucketizer.html" title="std.experimental.allocator.building_blocks.bucketizer">bucketizer<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_fallback_allocator.html" title="std.experimental.allocator.building_blocks.fallback_allocator">fallback_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_free_list.html"�4itle="std.experimental.allocator.building_blocks.free_list">free_list<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_free_tree.html" title="std.experimental.allocator.building_blocks.free_tree">free_tree<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_kernighan_ritchie.html"�4itle="std.experimental.allocator.building_blocks.kernighan_ritchie">kernighan_ritchie<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_null_allocator.html"�4itle="std.experimental.allocator.building_blocks.null_allocator">null_allocator<t�><v�i><li> <a href="std_experimental_allocator_building_blocks_quantizer.html" title="std.experimental.allocator.building_blocks.quantizer">quantizer<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_region.html" title="std.experimental.allocator.building_blocks.region">region<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_scoped_allocator.html" title="std.experimental.allocator.building_blocks.scoped_allocator">scoped_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_segregator.html" title="std.experimental.allocator.building_blocks.segregator">segregator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_building_blocks_stats_collector.html"�4itle="std.experimental.allocator.building_blocks.stats_collector">stats_collector<t�> </li><z�l></li><li> �!�!a href="std_experimental_allocator_common.html" title="std.experimental.allocator.common">common<ztpan></a></li><li> �!�!a href="std_experimental_allocator_gc_allocator.html" title="std.experimental.allocator.gc_allocator">gc_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_mallocator.html" title="std.experimental.allocator.mallocator">mallocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_mmap_allocator.html" title="std.experimental.allocator.mmap_allocator">mmap_allocator<ztpan></a></li><li> �!�!a href="std_experimental_allocator_showcase.html" title="std.experimental.allocator.showcase">showcase<ztpan></a></li><li> �!�!a href="std_experimental_allocator_typed.html"�4itle="std.experimental.allocator.typed">typed<t�> </li><z�l></li><li> �!�!a href="std_experimental_checkedint.html" title="std.experimental.checkedint">checkedint<ztpan></a></li><li> �!�!a href="std_experimental_logger.html" title="std.experimental.logger">logger<ztpan></a><ul><li> <a href="std_experimental_logger_core.html" title="std.experimental.logger.core">core<t�><v�i><li> <a href="std_experimental_logger_filelogger.html" title="std.experimental.logger.filelogger">filelogger<t�><v�i><li> <a href="std_experimental_logger_multilogger.html"�4itle="std.experimental.logger.multilogger">multilogger<ztpan></a></li><li> �!�!a href="std_experimental_logger_nulllogger.html"�4itle="std.experimental.logger.nulllogger">nulllogger<ztpan></a> �!�!v�i></ul> </li><z�l></li><li> �!�!a href="std_file.html"�4itle="std.file">file<ztpan></a></li><li> �!�!a href="std_format.html"�4itle="std.format">format<ztpan></a><ul><li> <h7>internal<ztpan></h7><ul><li> �!�!a href="std_format_internal_floats.html"�4itle="std.format.internal.floats">floats<ztpan></a></li><li> �!�!a href="std_format_internal_read.html"�4itle="std.format.internal.read">read<ztpan></a></li><li> �!�!a href="std_format_internal_write.html" title="std.format.internal.write">write<t�> </li><z�l></li><li> �!�!a href="std_format_read.html" title="std.format.read">read<ztpan></a></li><li> �!�!a href="std_format_spec.html" title="std.format.spec">spec<ztpan></a></li><li> �!�!a href="std_format_write.html"�4itle="std.format.write">write<t�> </li><z�l></li><li> �!�!a href="std_functional.html"�4itle="std.functional">functional<ztpan></a></li><li> �!�!a href="std_getopt.html"�4itle="std.getopt">getopt<ztpan></a></li><li> �!�!a href="std_int1�(R��).html"�4itle="std.int1�(R��)">int8<ztpan></a></li><li> �!�!a href="std_json.html"�4itle="std.json">json<ztpan></a></li><li> �!�!a href="std_logger.html"�4itle="std.logger">logger<ztpan></a><ul><li> <a href="std_logger_core.html"�4itle="std.logger.core">core<t�><v�i><li> <a href="std_logger_filelogger.html"�4itle="std.logger.filelogger">filelogger<t�><v�i><li> <a href="std_logger_multilogger.html" title="std.logger.multilogger">multilogger<ztpan></a></li><li> �!�!a href="std_logger_nulllogger.html" title="std.logger.nulllogger">nulllogger<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_math.html" title="std.math">math<t�><ul><li> �!�!a href="std_math_algebraic.html"�4itle="std.math.algebraic">algebraic<t�><v�i><li> <a href="std_math_constants.html" title="std.math.constants">constants<ztpan></a></li><li> �!�!a href="std_math_exponential.html"�4itle="std.math.exponential">exponential<t�><v�i><li> <a href="std_math_hardware.html"�4itle="std.math.hardware">hardware<t�><v�i><li> <a href="std_math_operations.html"�4itle="std.math.operations">operations<t�><v�i><li> <a href="std_math_remainder.html" title="std.math.remainder">remainder<ztpan></a></li><li> �!�!a href="std_math_rounding.html" title="std.math.rounding">rounding<ztpan></a></li><li> �!�!a href="std_math_traits.html" title="std.math.traits">traits<ztpan></a></li><li> �!�!a href="std_math_trigonometry.html" title="std.math.trigonometry">trigonometry<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_mathspecial.html"�4itle="std.mathspecial">mathspecial<ztpan></a></li><li> �!�!a href="std_meta.html"�4itle="std.meta">meta<ztpan></a></li><li> �!�!a href="std_mmfile.html"�4itle="std.mmfile">mmfile<ztpan></a></li><li> �!�!h7>net<ztpan></h7><ul><li> �!�!a href="std_net_curl.html"�4itle="std.net.curl">curl<ztpan></a></li><li> �!�!a href="std_net_isemail.html" title="std.net.isemail">isemail<t�> </li><z�l></li><li> �!�!a href="std_numeric.html" title="std.numeric">numeric<t�><v�i><li> <a href="std_outbuffer.html"�4itle="std.outbuffer">outbuffer<ztpan></a></li><li> �!�!a href="std_parallelism.html" title="std.parallelism">parallelism<t�><v�i><li> <a href="std_path.html" title="std.path">path<t�><v�i><li> <a href="std_process.html"�4itle="std.process">process<ztpan></a></li><li> �!�!a href="std_random.html"�4itle="std.random">random<ztpan></a></li><li> �!�!a href="std_range.html" title="std.range">range<t�><ul><li> �!�!a href="std_range_interfaces.html"�4itle="std.range.interfaces">interfaces<ztpan></a></li><li> �!�!a href="std_range_primitives.html"�4itle="std.range.primitives">primitives<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_regex.html"�4itle="std.regex">regex<ztpan></a></li><li> �!�!a href="std_signals.html" title="std.signals">signals<t�><v�i><li> <a href="std_socket.html" title="std.socket">socket<t�><v�i><li> <a href="std_stdint.html" title="std.stdint">stdint<t�><v�i><li> <a href="std_stdio.html"�4itle="std.stdio">stdio<ztpan></a></li><li> �!�!a href="std_string.html"�4itle="std.string">string<ztpan></a></li><li> �!�!a href="std_sumtype.html" title="std.sumtype">sumtype<t�><v�i><li> <a href="std_system.html" title="std.system">system<t�><v�i><li> <a href="std_traits.html" title="std.traits">traits<t�><v�i><li> <a href="std_typecons.html" title="std.typecons">typecons<t�><v�i><li> <a href="std_uni.html"�4itle="std.uni">uni<ztpan></a></li><li> �!�!a href="std_uri.html" title="std.uri">uri<t�><v�i><li> <a href="std_utf.html"�4itle="std.utf">utf<ztpan></a></li><li> �!�!a href="std_uuid.html"�4itle="std.uuid">uuid<ztpan></a></li><li> �!�!a href="std_variant.html" title="std.variant">variant<t�><v�i><li> <h7>windows<vv7><ul><li> <a href="std_windows_charset.html"�4itle="std.windows.charset">charset<ztpan></a></li><li> �!�!a href="std_windows_syserror.html"�4itle="std.windows.syserror">syserror<ztpan></a> �!�!v�i></ul><v�i><li> <a href="std_zip.html"�4itle="std.zip">zip<ztpan></a></li><li> �!�!a href="std_zlib.html"�4itle="std.zlib">zlib<ztpan></a> <v�i></ul> </li> <li class='expand-container modlist-submenu-etc'><a class='expand-toggle' href='#'>etc<ztpan></a> <ul><li> �!�!h7>c<ztpan></h7><ul><li> �!�!a href="etc_c_curl.html"�4itle="etc.c.curl">curl<ztpan></a></li><li> �!�!a href="etc_c_odbc.html"�4itle="etc.c.odbc">odbc<ztpan></a><ul><li> <a href="etc_c_odbc_odbc0�0�0�0�0�.html"�4itle="etc.c.odbc.odbc3�(N �)>odbc0�0�0�0�0�<t�><v�i><li> <a href="etc_c_odbc_odbc64.html"�4itle="etc.c.odbc.odbc64">odbc64<t�><v�i><li> <a href="etc_c_odbc_sql.html" title="etc.c.odbc.sql">sql<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqlext.html" title="etc.c.odbc.sqlext">sqlext<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqltypes.html" title="etc.c.odbc.sqltypes">sqltypes<ztpan></a></li><li> �!�!a href="etc_c_odbc_sqlucode.html" title="etc.c.odbc.sqlucode">sqlucode<ztpan></a> �!�!v�i></ul><v�i><li> <a href="etc_c_sqlite3.html"�4itle="etc.c.sqlite0�0�0�>sqlite0�0�0�ztpan></a></li><li> �!�!a href="etc_c_zlib.html"�4itle="etc.c.zlib">zlib<ztpan></a> �!�!v�i></ul><v�i><li> <h7>valgrind<ztpan></h7><ul><li> �!�!a href="etc_valgrind_valgrind.html" title="etc.valgrind.valgrind">valgrind<ztpan></a> �!�!v�i></ul> </li><z�l> <v�i> <li class='expand-container modlist-submenu-core'><a class='expand-toggle' href='#'>core<u0m><t�> <ul><li> <a href="core_atomic.html"�4itle="core.atomic">atomic<t�><v�i><li> <a href="core_attribute.html" title="core.attribute">attribute<ztpan></a></li><li> �!�!a href="core_bitop.html"�4itle="core.bitop">bitop<t�><v�i><li> <a href="core_builtins.html"�4itle="core.builtins">builtins<t�><v�i><li> <a href="core_checkedint.html"�4itle="core.checkedint">checkedint<t�><v�i><li> <a href="core_cpuid.html" title="core.cpuid">cpuid<ztpan></a></li><li> �!�!a href="core_demangle.html" title="core.demangle">demangle<ztpan></a></li><li> �!�!a href="core_exception.html"�4itle="core.exception">exception<t�><v�i><li> <a href="core_factory.html" title="core.factory">factory<ztpan></a></li><li> �!�!h7>gc<vv7><ul><li> <a href="core_gc_config.html" title="core.gc.config">config<t�><v�i><li> <a href="core_gc_gcinterface.html"�4itle="core.gc.gcinterface">gcinterface<ztpan></a></li><li> �!�!a href="core_gc_registry.html"�4itle="core.gc.registry">registry<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_int1�(R��).html"�4itle="core.int8">int1�(R��)<t�><v�i><li> <a href="core_interpolation.html" title="core.interpolation">interpolation<ztpan></a></li><li> �!�!a href="core_lifetime.html" title="core.lifetime">lifetime<ztpan></a></li><li> �!�!a href="core_math.html" title="core.math">math<ztpan></a></li><li> �!�!a href="core_memory.html" title="core.memory">memory<ztpan></a></li><li> �!�!a href="core_runtime.html"�4itle="core.runtime">runtime<t�><v�i><li> <a href="core_simd.html"�4itle="core.simd">simd<t�><v�i><li> <h7>stdc<ztpan></h7><ul><li> �!�!a href="core_stdc_assert_.html" title="core.stdc.assert_">assert_<t�><v�i><li> <a href="core_stdc_complex.html"�4itle="core.stdc.complex">complex<ztpan></a></li><li> �!�!a href="core_stdc_ctype.html" title="core.stdc.ctype">ctype<t�><v�i><li> <a href="core_stdc_errno.html"�4itle="core.stdc.errno">errno<ztpan></a></li><li> �!�!a href="core_stdc_fenv.html"�4itle="core.stdc.fenv">fenv<ztpan></a></li><li> �!�!a href="core_stdc_float_.html"�4itle="core.stdc.float_">float_<ztpan></a></li><li> �!�!a href="core_stdc_inttypes.html"�4itle="core.stdc.inttypes">inttypes<ztpan></a></li><li> �!�!a href="core_stdc_limits.html"�4itle="core.stdc.limits">limits<ztpan></a></li><li> �!�!a href="core_stdc_locale.html"�4itle="core.stdc.locale">locale<ztpan></a></li><li> �!�!a href="core_stdc_math.html"�4itle="core.stdc.math">math<ztpan></a></li><li> �!�!a href="core_stdc_signal.html"�4itle="core.stdc.signal">signal<ztpan></a></li><li> �!�!a href="core_stdc_stdarg.html"�4itle="core.stdc.stdarg">stdarg<ztpan></a></li><li> �!�!a href="core_stdc_stdatomic.html" title="core.stdc.stdatomic">stdatomic<t�><v�i><li> <a href="core_stdc_stddef.html" title="core.stdc.stddef">stddef<t�><v�i><li> <a href="core_stdc_stdint.html" title="core.stdc.stdint">stdint<t�><v�i><li> <a href="core_stdc_stdio.html"�4itle="core.stdc.stdio">stdio<ztpan></a></li><li> �!�!a href="core_stdc_stdlib.html"�4itle="core.stdc.stdlib">stdlib<ztpan></a></li><li> �!�!a href="core_stdc_string.html"�4itle="core.stdc.string">string<ztpan></a></li><li> �!�!a href="core_stdc_tgmath.html"�4itle="core.stdc.tgmath">tgmath<ztpan></a></li><li> �!�!a href="core_stdc_time.html"�4itle="core.stdc.time">time<ztpan></a></li><li> �!�!a href="core_stdc_wchar_.html"�4itle="core.stdc.wchar_">wchar_<ztpan></a></li><li> �!�!a href="core_stdc_wctype.html"�4itle="core.stdc.wctype">wctype<ztpan></a> �!�!v�i></ul><v�i><li> <h7>stdcpp<ztpan></h7><ul><li> �!�!a href="core_stdcpp_allocator.html" title="core.stdcpp.allocator">allocator<t�><v�i><li> <a href="core_stdcpp_array.html"�4itle="core.stdcpp.array">array<ztpan></a></li><li> �!�!a href="core_stdcpp_exception.html" title="core.stdcpp.exception">exception<t�><v�i><li> <a href="core_stdcpp_memory.html" title="core.stdcpp.memory">memory<t�><v�i><li> <a href="core_stdcpp_new_.html" title="core.stdcpp.new_">new_<t�><v�i><li> <a href="core_stdcpp_string.html" title="core.stdcpp.string">string<t�><v�i><li> <a href="core_stdcpp_string_view.html"�4itle="core.stdcpp.string_view">string_view<ztpan></a></li><li> �!�!a href="core_stdcpp_type_traits.html" title="core.stdcpp.type_traits">type_traits<t�><v�i><li> <a href="core_stdcpp_typeinfo.html" title="core.stdcpp.typeinfo">typeinfo<t�><v�i><li> <a href="core_stdcpp_utility.html"�4itle="core.stdcpp.utility">utility<ztpan></a></li><li> �!�!a href="core_stdcpp_vector.html"�4itle="core.stdcpp.vector">vector<ztpan></a></li><li> �!�!a href="core_stdcpp_xutility.html"�4itle="core.stdcpp.xutility">xutility<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_sync.html"�4itle="core.sync">sync<t�><ul><li> �!�!a href="core_sync_barrier.html" title="core.sync.barrier">barrier<t�><v�i><li> <a href="core_sync_condition.html"�4itle="core.sync.condition">condition<ztpan></a></li><li> �!�!a href="core_sync_config.html"�4itle="core.sync.config">config<ztpan></a></li><li> �!�!a href="core_sync_event.html" title="core.sync.event">event<t�><v�i><li> <a href="core_sync_exception.html"�4itle="core.sync.exception">exception<ztpan></a></li><li> �!�!a href="core_sync_mutex.html" title="core.sync.mutex">mutex<t�><v�i><li> <a href="core_sync_rwmutex.html"�4itle="core.sync.rwmutex">rwmutex<ztpan></a></li><li> �!�!a href="core_sync_semaphore.html" title="core.sync.semaphore">semaphore<t�> </li><z�l></li><li> �!�!a href="core_thread.html" title="core.thread">thread<ztpan></a><ul><li> <a href="core_thread_context.html"�4itle="core.thread.context">context<ztpan></a></li><li> �!�!a href="core_thread_fiber.html" title="core.thread.fiber">fiber<t�><ul><li> �!�!a href="core_thread_fiber_base.html"�4itle="core.thread.fiber.base">base<ztpan></a> �!�!v�i></ul><v�i><li> <a href="core_thread_osthread.html" title="core.thread.osthread">osthread<t�><v�i><li> <a href="core_thread_threadbase.html" title="core.thread.threadbase">threadbase<t�><v�i><li> <a href="core_thread_threadgroup.html"�4itle="core.thread.threadgroup">threadgroup<ztpan></a></li><li> �!�!a href="core_thread_types.html" title="core.thread.types">types<t�> </li><z�l></li><li> �!�!a href="core_time.html" title="core.time">time<ztpan></a></li><li> �!�!a href="core_vararg.html" title="core.vararg">vararg<ztpan></a></li><li> �!�!a href="core_volatile.html" title="core.volatile">volatile<ztpan></a> <v�i></ul> </li> <div class="modlist-internal-separator">Internal API</div> <li class='expand-container modlist-submenu-core'><a class='expand-toggle' href='#'>core<u0m><t�> <ul><li> <h7>internal<ztpan></h7><ul><li> �!�!h7>array<ztpan></h7><ul><li> �!�!a href="core_internal_array_appending.html" title="core.internal.array.appending">appending<t�><v�i><li> <a href="core_internal_array_arrayassign.html"�4itle="core.internal.array.arrayassign">arrayassign<ztpan></a></li><li> �!�!a href="core_internal_array_capacity.html"�4itle="core.internal.array.capacity">capacity<ztpan></a></li><li> �!�!a href="core_internal_array_casting.html" title="core.internal.array.casting">casting<t�><v�i><li> <a href="core_internal_array_comparison.html" title="core.internal.array.comparison">comparison<t�><v�i><li> <a href="core_internal_array_concatenation.html"�4itle="core.internal.array.concatenation">concatenation<ztpan></a></li><li> �!�!a href="core_internal_array_construction.html"�4itle="core.internal.array.construction">construction<ztpan></a></li><li> �!�!a href="core_internal_array_duplication.html" title="core.internal.array.duplication">duplication<t�><v�i><li> <a href="core_internal_array_equality.html" title="core.internal.array.equality">equality<t�><v�i><li> <a href="core_internal_array_operations.html" title="core.internal.array.operations">operations<t�><v�i><li> <a href="core_internal_array_utils.html"�4itle="core.internal.array.utils">utils<ztpan></a> �!�!v�i></ul><v�i><li> <h7>util<ztpan></h7><ul><li> �!�!a href="core_internal_util_array.html"�4itle="core.internal.util.array">array<t�><v�i><li> <a href="core_internal_util_math.html"�4itle="core.internal.util.math">math<t�> </li><z�l> �!�!v�i></ul> </li><z�l> <v�i> <li class='expand-container modlist-submenu-dmd'><a class='expand-toggle' href='#'>dmd<u0m><t�> <ul><li> <a href="dmd_access.html" title="dmd.access">access<t�><v�i><li> <a href="dmd_aggregate.html"�4itle="dmd.aggregate">aggregate<ztpan></a></li><li> �!�!a href="dmd_aliasthis.html" title="dmd.aliasthis">aliasthis<t�><v�i><li> <a href="dmd_argtypes_aarch64.html" title="dmd.argtypes_aarch64">argtypes_aarch64<t�><v�i><li> <a href="dmd_argtypes_sysv_x64.html"�4itle="dmd.argtypes_sysv_x64">argtypes_sysv_x64<ztpan></a></li><li> �!�!a href="dmd_argtypes_x86.html"�4itle="dmd.argtypes_x86">argtypes_x86<ztpan></a></li><li> �!�!a href="dmd_arrayop.html" title="dmd.arrayop">arrayop<t�><v�i><li> <a href="dmd_arraytypes.html" title="dmd.arraytypes">arraytypes<t�><v�i><li> <a href="dmd_ast_node.html" title="dmd.ast_node">ast_node<t�><v�i><li> <a href="dmd_astbase.html"�4itle="dmd.astbase">astbase<ztpan></a></li><li> �!�!a href="dmd_astcodegen.html"�4itle="dmd.astcodegen">astcodegen<ztpan></a></li><li> �!�!a href="dmd_astenums.html"�4itle="dmd.astenums">astenums<ztpan></a></li><li> �!�!a href="dmd_asttypename.html" title="dmd.asttypename">asttypename<t�><v�i><li> <a href="dmd_attrib.html" title="dmd.attrib">attrib<t�><v�i><li> <a href="dmd_attribsem.html"�4itle="dmd.attribsem">attribsem<ztpan></a></li><li> �!�!h7>backend<ztpan></h7><ul><li> �!�!a href="dmd_backend_aarray.html"�4itle="dmd.backend.aarray">aarray<ztpan></a></li><li> �!�!h7>arm<ztpan></h7><ul><li> �!�!a href="dmd_backend_arm_cod1.html"�4itle="dmd.backend.arm.cod1">cod�ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod2.html"�4itle="dmd.backend.arm.cod2">cod�(v��)ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod3.html"�4itle="dmd.backend.arm.cod3">cod0�0�0�ztpan></a></li><li> �!�!a href="dmd_backend_arm_cod4.html"�4itle="dmd.backend.arm.cod4">cod4<ztpan></a></li><li> �!�!a href="dmd_backend_arm_disasmarm.html" title="dmd.backend.arm.disasmarm">disasmarm<t�><v�i><li> <a href="dmd_backend_arm_instr.html"�4itle="dmd.backend.arm.instr">instr<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_backend_backconfig.html" title="dmd.backend.backconfig">backconfig<t�><v�i><li> <a href="dmd_backend_barray.html" title="dmd.backend.barray">barray<t�><v�i><li> <a href="dmd_backend_bcomplex.html" title="dmd.backend.bcomplex">bcomplex<t�><v�i><li> <a href="dmd_backend_blockopt.html" title="dmd.backend.blockopt">blockopt<t�><v�i><li> <a href="dmd_backend_cc.html" title="dmd.backend.cc">cc<t�><v�i><li> <a href="dmd_backend_cdef.html" title="dmd.backend.cdef">cdef<t�><v�i><li> <a href="dmd_backend_cg.html" title="dmd.backend.cg">cg<t�><v�i><li> <a href="dmd_backend_cgcs.html" title="dmd.backend.cgcs">cgcs<t�><v�i><li> <a href="dmd_backend_cgcse.html"�4itle="dmd.backend.cgcse">cgcse<ztpan></a></li><li> �!�!a href="dmd_backend_cgcv.html"�4itle="dmd.backend.cgcv">cgcv<ztpan></a></li><li> �!�!a href="dmd_backend_cgelem.html"�4itle="dmd.backend.cgelem">cgelem<ztpan></a></li><li> �!�!a href="dmd_backend_cgen.html"�4itle="dmd.backend.cgen">cgen<ztpan></a></li><li> �!�!a href="dmd_backend_cgsched.html" title="dmd.backend.cgsched">cgsched<t�><v�i><li> <a href="dmd_backend_code.html" title="dmd.backend.code">code<t�><v�i><li> <a href="dmd_backend_codebuilder.html"�4itle="dmd.backend.codebuilder">codebuilder<ztpan></a></li><li> �!�!a href="dmd_backend_cv4.html" title="dmd.backend.cv4">cv4<t�><v�i><li> <a href="dmd_backend_cv8.html"�4itle="dmd.backend.cv8">cv8<ztpan></a></li><li> �!�!a href="dmd_backend_dcgcv.html" title="dmd.backend.dcgcv">dcgcv<t�><v�i><li> <a href="dmd_backend_dcode.html"�4itle="dmd.backend.dcode">dcode<ztpan></a></li><li> �!�!a href="dmd_backend_debugprint.html"�4itle="dmd.backend.debugprint">debugprint<ztpan></a></li><li> �!�!a href="dmd_backend_divcoeff.html"�4itle="dmd.backend.divcoeff">divcoeff<ztpan></a></li><li> �!�!a href="dmd_backend_dlist.html" title="dmd.backend.dlist">dlist<t�><v�i><li> <a href="dmd_backend_dout.html" title="dmd.backend.dout">dout<t�><v�i><li> <a href="dmd_backend_drtlsym.html"�4itle="dmd.backend.drtlsym">drtlsym<ztpan></a></li><li> �!�!a href="dmd_backend_dt.html"�4itle="dmd.backend.dt">dt<ztpan></a></li><li> �!�!a href="dmd_backend_dtype.html" title="dmd.backend.dtype">dtype<t�><v�i><li> <a href="dmd_backend_dvarstats.html"�4itle="dmd.backend.dvarstats">dvarstats<ztpan></a></li><li> �!�!a href="dmd_backend_dvec.html"�4itle="dmd.backend.dvec">dvec<ztpan></a></li><li> �!�!a href="dmd_backend_dwarf.html" title="dmd.backend.dwarf">dwarf<t�><v�i><li> <a href="dmd_backend_dwarf�(��)html" title="dmd.backend.dwarf�(N �)>dwarf2<t�><v�i><li> <a href="dmd_backend_dwarfdbginf.html"�4itle="dmd.backend.dwarfdbginf">dwarfdbginf<ztpan></a></li><li> �!�!a href="dmd_backend_dwarfeh.html" title="dmd.backend.dwarfeh">dwarfeh<t�><v�i><li> <a href="dmd_backend_ee.html" title="dmd.backend.ee">ee<t�><v�i><li> <a href="dmd_backend_eh.html" title="dmd.backend.eh">eh<t�><v�i><li> <a href="dmd_backend_el.html" title="dmd.backend.el">el<t�><v�i><li> <a href="dmd_backend_elem.html" title="dmd.backend.elem">elem<t�><v�i><li> <a href="dmd_backend_elfobj.html" title="dmd.backend.elfobj">elfobj<t�><v�i><li> <a href="dmd_backend_elpicpie.html" title="dmd.backend.elpicpie">elpicpie<t�><v�i><li> <a href="dmd_backend_evalu8.html" title="dmd.backend.evalu8">evalu8<t�><v�i><li> <a href="dmd_backend_fp.html" title="dmd.backend.fp">fp<t�><v�i><li> <a href="dmd_backend_gdag.html" title="dmd.backend.gdag">gdag<t�><v�i><li> <a href="dmd_backend_gflow.html"�4itle="dmd.backend.gflow">gflow<ztpan></a></li><li> �!�!a href="dmd_backend_global.html"�4itle="dmd.backend.global">global<ztpan></a></li><li> �!�!a href="dmd_backend_glocal.html"�4itle="dmd.backend.glocal">glocal<ztpan></a></li><li> �!�!a href="dmd_backend_gloop.html" title="dmd.backend.gloop">gloop<t�><v�i><li> <a href="dmd_backend_go.html" title="dmd.backend.go">go<t�><v�i><li> <a href="dmd_backend_goh.html"�4itle="dmd.backend.goh">goh<ztpan></a></li><li> �!�!a href="dmd_backend_gother.html"�4itle="dmd.backend.gother">gother<ztpan></a></li><li> �!�!a href="dmd_backend_gsroa.html" title="dmd.backend.gsroa">gsroa<t�><v�i><li> <a href="dmd_backend_iasm.html" title="dmd.backend.iasm">iasm<t�><v�i><li> <a href="dmd_backend_inliner.html"�4itle="dmd.backend.inliner">inliner<ztpan></a></li><li> �!�!a href="dmd_backend_mach.html"�4itle="dmd.backend.mach">mach<ztpan></a></li><li> �!�!a href="dmd_backend_machobj.html" title="dmd.backend.machobj">machobj<t�><v�i><li> <a href="dmd_backend_melf.html" title="dmd.backend.melf">melf<t�><v�i><li> <a href="dmd_backend_mem.html"�4itle="dmd.backend.mem">mem<ztpan></a></li><li> �!�!a href="dmd_backend_mscoff.html"�4itle="dmd.backend.mscoff">mscoff<ztpan></a></li><li> �!�!a href="dmd_backend_mscoffobj.html" title="dmd.backend.mscoffobj">mscoffobj<t�><v�i><li> <a href="dmd_backend_obj.html"�4itle="dmd.backend.obj">obj<ztpan></a></li><li> �!�!a href="dmd_backend_oper.html"�4itle="dmd.backend.oper">oper<ztpan></a></li><li> �!�!a href="dmd_backend_pdata.html" title="dmd.backend.pdata">pdata<t�><v�i><li> <a href="dmd_backend_ptrntab.html"�4itle="dmd.backend.ptrntab">ptrntab<ztpan></a></li><li> �!�!a href="dmd_backend_rtlsym.html"�4itle="dmd.backend.rtlsym">rtlsym<ztpan></a></li><li> �!�!a href="dmd_backend_symbol.html"�4itle="dmd.backend.symbol">symbol<ztpan></a></li><li> �!�!a href="dmd_backend_symtab.html"�4itle="dmd.backend.symtab">symtab<ztpan></a></li><li> �!�!a href="dmd_backend_ty.html"�4itle="dmd.backend.ty">ty<ztpan></a></li><li> �!�!a href="dmd_backend_type.html"�4itle="dmd.backend.type">type<ztpan></a></li><li> �!�!a href="dmd_backend_util�(��)html" title="dmd.backend.util2">util2<t�><v�i><li> <a href="dmd_backend_var.html"�4itle="dmd.backend.var">var<ztpan></a></li><li> �!�!h7>x86<ztpan></h7><ul><li> �!�!a href="dmd_backend_x86_cg87.html"�4itle="dmd.backend.x86.cg87">cg87<ztpan></a></li><li> �!�!a href="dmd_backend_x86_cgcod.html" title="dmd.backend.x86.cgcod">cgcod<t�><v�i><li> <a href="dmd_backend_x86_cgreg.html"�4itle="dmd.backend.x86.cgreg">cgreg<ztpan></a></li><li> �!�!a href="dmd_backend_x86_cgxmm.html" title="dmd.backend.x86.cgxmm">cgxmm<t�><v�i><li> <a href="dmd_backend_x86_cod1.html" title="dmd.backend.x86.cod1">cod1<t�><v�i><li> <a href="dmd_backend_x86_cod�(��)html" title="dmd.backend.x86.cod�(N �)>cod2<t�><v�i><li> <a href="dmd_backend_x86_cod0�0�0�0�0�html" title="dmd.backend.x86.cod0�0�0�>cod3<t�><v�i><li> <a href="dmd_backend_x86_cod4.html" title="dmd.backend.x86.cod4">cod4<t�><v�i><li> <a href="dmd_backend_x86_cod5.html" title="dmd.backend.x86.cod5">cod5<t�><v�i><li> <a href="dmd_backend_x86_code_x86.html" title="dmd.backend.x86.code_x86">code_x86<t�><v�i><li> <a href="dmd_backend_x86_disasm86.html" title="dmd.backend.x86.disasm86">disasm86<t�><v�i><li> <a href="dmd_backend_x86_nteh.html" title="dmd.backend.x86.nteh">nteh<t�><v�i><li> <a href="dmd_backend_x86_xmm.html"�4itle="dmd.backend.x86.xmm">xmm<ztpan></a> �!�!v�i></ul> </li><z�l></li><li> �!�!a href="dmd_blockexit.html" title="dmd.blockexit">blockexit<t�><v�i><li> <a href="dmd_builtin.html"�4itle="dmd.builtin">builtin<ztpan></a></li><li> �!�!a href="dmd_canthrow.html"�4itle="dmd.canthrow">canthrow<ztpan></a></li><li> �!�!a href="dmd_chkformat.html" title="dmd.chkformat">chkformat<t�><v�i><li> <a href="dmd_cli.html"�4itle="dmd.cli">cli<ztpan></a></li><li> �!�!a href="dmd_clone.html" title="dmd.clone">clone<t�><v�i><li> <h7>common<ztpan></h7><ul><li> �!�!a href="dmd_common_bitfields.html"�4itle="dmd.common.bitfields">bitfields<t�><v�i><li> <a href="dmd_common_blake3.html"�4itle="dmd.common.blake0�0�0�>blake3<t�><v�i><li> <a href="dmd_common_charactertables.html" title="dmd.common.charactertables">charactertables<ztpan></a></li><li> �!�!a href="dmd_common_file.html" title="dmd.common.file">file<ztpan></a></li><li> �!�!a href="dmd_common_identifiertables.html" title="dmd.common.identifiertables">identifiertables<ztpan></a></li><li> �!�!a href="dmd_common_int8.html" title="dmd.common.int1�(R��)">int8<ztpan></a></li><li> �!�!a href="dmd_common_outbuffer.html"�4itle="dmd.common.outbuffer">outbuffer<t�><v�i><li> <a href="dmd_common_smallbuffer.html" title="dmd.common.smallbuffer">smallbuffer<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_compiler.html" title="dmd.compiler">compiler<t�><v�i><li> <a href="dmd_cond.html" title="dmd.cond">cond<t�><v�i><li> <a href="dmd_console.html"�4itle="dmd.console">console<ztpan></a></li><li> �!�!a href="dmd_constfold.html" title="dmd.constfold">constfold<t�><v�i><li> <a href="dmd_cparse.html" title="dmd.cparse">cparse<t�><v�i><li> <a href="dmd_cpreprocess.html"�4itle="dmd.cpreprocess">cpreprocess<ztpan></a></li><li> �!�!a href="dmd_ctfeexpr.html"�4itle="dmd.ctfeexpr">ctfeexpr<ztpan></a></li><li> �!�!a href="dmd_ctorflow.html"�4itle="dmd.ctorflow">ctorflow<ztpan></a></li><li> �!�!a href="dmd_cxxfrontend.html" title="dmd.cxxfrontend">cxxfrontend<t�><v�i><li> <a href="dmd_dcast.html"�4itle="dmd.dcast">dcast<ztpan></a></li><li> �!�!a href="dmd_dclass.html"�4itle="dmd.dclass">dclass<ztpan></a></li><li> �!�!a href="dmd_declaration.html" title="dmd.declaration">declaration<t�><v�i><li> <a href="dmd_delegatize.html" title="dmd.delegatize">delegatize<t�><v�i><li> <a href="dmd_denum.html"�4itle="dmd.denum">denum<ztpan></a></li><li> �!�!a href="dmd_deps.html"�4itle="dmd.deps">deps<ztpan></a></li><li> �!�!a href="dmd_dimport.html" title="dmd.dimport">dimport<t�><v�i><li> <a href="dmd_dinifile.html" title="dmd.dinifile">dinifile<t�><v�i><li> <a href="dmd_dinterpret.html" title="dmd.dinterpret">dinterpret<t�><v�i><li> <a href="dmd_dmacro.html" title="dmd.dmacro">dmacro<t�><v�i><li> <a href="dmd_dmdparams.html"�4itle="dmd.dmdparams">dmdparams<ztpan></a></li><li> �!�!a href="dmd_dmodule.html" title="dmd.dmodule">dmodule<t�><v�i><li> <a href="dmd_dmsc.html" title="dmd.dmsc">dmsc<t�><v�i><li> <a href="dmd_doc.html"�4itle="dmd.doc">doc<ztpan></a></li><li> �!�!a href="dmd_dscope.html"�4itle="dmd.dscope">dscope<ztpan></a></li><li> �!�!a href="dmd_dstruct.html" title="dmd.dstruct">dstruct<t�><v�i><li> <a href="dmd_dsymbol.html"�4itle="dmd.dsymbol">dsymbol<ztpan></a></li><li> �!�!a href="dmd_dsymbolsem.html"�4itle="dmd.dsymbolsem">dsymbolsem<ztpan></a></li><li> �!�!a href="dmd_dtemplate.html" title="dmd.dtemplate">dtemplate<t�><v�i><li> <a href="dmd_dtoh.html" title="dmd.dtoh">dtoh<t�><v�i><li> <a href="dmd_dversion.html" title="dmd.dversion">dversion<t�><v�i><li> <a href="dmd_er.html" title="dmd.er">e2ir<t�><v�i><li> <a href="dmd_entity.html" title="dmd.entity">entity<t�><v�i><li> <a href="dmd_enumsem.html"�4itle="dmd.enumsem">enumsem<ztpan></a></li><li> �!�!a href="dmd_errors.html"�4itle="dmd.errors">errors<ztpan></a></li><li> �!�!a href="dmd_errorsink.html" title="dmd.errorsink">errorsink<t�><v�i><li> <a href="dmd_escape.html" title="dmd.escape">escape<t�><v�i><li> <a href="dmd_expression.html" title="dmd.expression">expression<t�><v�i><li> <a href="dmd_expressionsem.html"�4itle="dmd.expressionsem">expressionsem<ztpan></a></li><li> �!�!a href="dmd_file_manager.html"�4itle="dmd.file_manager">file_manager<ztpan></a></li><li> �!�!a href="dmd_frontend.html"�4itle="dmd.frontend">frontend<ztpan></a></li><li> �!�!a href="dmd_func.html"�4itle="dmd.func">func<ztpan></a></li><li> �!�!a href="dmd_funcsem.html" title="dmd.funcsem">funcsem<t�><v�i><li> <a href="dmd_globals.html"�4itle="dmd.globals">globals<ztpan></a></li><li> �!�!a href="dmd_glue.html"�4itle="dmd.glue">glue<ztpan></a></li><li> �!�!a href="dmd_gluelayer.html" title="dmd.gluelayer">gluelayer<t�><v�i><li> <a href="dmd_hdrgen.html" title="dmd.hdrgen">hdrgen<t�><v�i><li> <a href="dmd_iasm.html" title="dmd.iasm">iasm<t�><v�i><li> <a href="dmd_iasmdmd.html"�4itle="dmd.iasmdmd">iasmdmd<ztpan></a></li><li> �!�!a href="dmd_iasmgcc.html" title="dmd.iasmgcc">iasmgcc<t�><v�i><li> <a href="dmd_id.html" title="dmd.id">id<t�><v�i><li> <a href="dmd_identifier.html" title="dmd.identifier">identifier<t�><v�i><li> <a href="dmd_impcnvtab.html"�4itle="dmd.impcnvtab">impcnvtab<ztpan></a></li><li> �!�!a href="dmd_imphint.html" title="dmd.imphint">imphint<t�><v�i><li> <a href="dmd_importc.html"�4itle="dmd.importc">importc<ztpan></a></li><li> �!�!a href="dmd_init.html"�4itle="dmd.init">init<ztpan></a></li><li> �!�!a href="dmd_initsem.html" title="dmd.initsem">initsem<t�><v�i><li> <a href="dmd_inline.html" title="dmd.inline">inline<t�><v�i><li> <a href="dmd_inlinecost.html" title="dmd.inlinecost">inlinecost<t�><v�i><li> <a href="dmd_intrange.html" title="dmd.intrange">intrange<t�><v�i><li> <a href="dmd_json.html" title="dmd.json">json<t�><v�i><li> <a href="dmd_lambdacomp.html" title="dmd.lambdacomp">lambdacomp<t�><v�i><li> <a href="dmd_lexer.html"�4itle="dmd.lexer">lexer<ztpan></a></li><li> �!�!a href="dmd_lib.html" title="dmd.lib">lib<t�><ul><li> �!�!a href="dmd_lib_elf.html" title="dmd.lib.elf">elf<t�><v�i><li> <a href="dmd_lib_mach.html" title="dmd.lib.mach">mach<t�><v�i><li> <a href="dmd_lib_mscoff.html" title="dmd.lib.mscoff">mscoff<t�><v�i><li> <a href="dmd_lib_scanelf.html"�4itle="dmd.lib.scanelf">scanelf<ztpan></a></li><li> �!�!a href="dmd_lib_scanmach.html"�4itle="dmd.lib.scanmach">scanmach<ztpan></a></li><li> �!�!a href="dmd_lib_scanmscoff.html"�4itle="dmd.lib.scanmscoff">scanmscoff<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_link.html" title="dmd.link">link<t�><v�i><li> <a href="dmd_location.html" title="dmd.location">location<t�><v�i><li> <a href="dmd_main.html" title="dmd.main">main<t�><v�i><li> <a href="dmd_mangle.html" title="dmd.mangle">mangle<t�><ul><li> �!�!a href="dmd_mangle_basic.html"�4itle="dmd.mangle.basic">basic<t�><v�i><li> <a href="dmd_mangle_cpp.html" title="dmd.mangle.cpp">cpp<ztpan></a></li><li> �!�!a href="dmd_mangle_cppwin.html" title="dmd.mangle.cppwin">cppwin<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_mars.html" title="dmd.mars">mars<t�><v�i><li> <a href="dmd_mtype.html"�4itle="dmd.mtype">mtype<ztpan></a></li><li> �!�!a href="dmd_mustuse.html" title="dmd.mustuse">mustuse<t�><v�i><li> <a href="dmd_nogc.html" title="dmd.nogc">nogc<t�><v�i><li> <a href="dmd_nspace.html" title="dmd.nspace">nspace<t�><v�i><li> <a href="dmd_ob.html" title="dmd.ob">ob<t�><v�i><li> <a href="dmd_objc.html" title="dmd.objc">objc<t�><v�i><li> <a href="dmd_objc_glue.html"�4itle="dmd.objc_glue">objc_glue<ztpan></a></li><li> �!�!a href="dmd_opover.html"�4itle="dmd.opover">opover<ztpan></a></li><li> �!�!a href="dmd_optimize.html"�4itle="dmd.optimize">optimize<ztpan></a></li><li> �!�!a href="dmd_parse.html" title="dmd.parse">parse<t�><v�i><li> <a href="dmd_pragmasem.html"�4itle="dmd.pragmasem">pragmasem<ztpan></a></li><li> �!�!a href="dmd_printast.html"�4itle="dmd.printast">printast<ztpan></a></li><li> �!�!h7>root<vv7><ul><li> <a href="dmd_root_aav.html" title="dmd.root.aav">aav<ztpan></a></li><li> �!�!a href="dmd_root_array.html"�4itle="dmd.root.array">array<t�><v�i><li> <a href="dmd_root_bitarray.html"�4itle="dmd.root.bitarray">bitarray<t�><v�i><li> <a href="dmd_root_complex.html" title="dmd.root.complex">complex<ztpan></a></li><li> �!�!a href="dmd_root_ctfloat.html"�4itle="dmd.root.ctfloat">ctfloat<t�><v�i><li> <a href="dmd_root_env.html" title="dmd.root.env">env<ztpan></a></li><li> �!�!a href="dmd_root_file.html" title="dmd.root.file">file<ztpan></a></li><li> �!�!a href="dmd_root_filename.html" title="dmd.root.filename">filename<ztpan></a></li><li> �!�!a href="dmd_root_hash.html" title="dmd.root.hash">hash<ztpan></a></li><li> �!�!a href="dmd_root_longdouble.html" title="dmd.root.longdouble">longdouble<ztpan></a></li><li> �!�!a href="dmd_root_man.html"�4itle="dmd.root.man">man<t�><v�i><li> <a href="dmd_root_optional.html"�4itle="dmd.root.optional">optional<t�><v�i><li> <a href="dmd_root_port.html"�4itle="dmd.root.port">port<t�><v�i><li> <a href="dmd_root_region.html"�4itle="dmd.root.region">region<t�><v�i><li> <a href="dmd_root_response.html"�4itle="dmd.root.response">response<t�><v�i><li> <a href="dmd_root_rmem.html"�4itle="dmd.root.rmem">rmem<t�><v�i><li> <a href="dmd_root_speller.html" title="dmd.root.speller">speller<ztpan></a></li><li> �!�!a href="dmd_root_string.html" title="dmd.root.string">string<ztpan></a></li><li> �!�!a href="dmd_root_stringtable.html"�4itle="dmd.root.stringtable">stringtable<t�><v�i><li> <a href="dmd_root_strtold.html" title="dmd.root.strtold">strtold<ztpan></a></li><li> �!�!a href="dmd_root_utf.html"�4itle="dmd.root.utf">utf<t�> </li><z�l></li><li> �!�!a href="dmd_rootobject.html"�4itle="dmd.rootobject">rootobject<ztpan></a></li><li> �!�!a href="dmd_s2ir.html"�4itle="dmd.s2ir">sr<ztpan></a></li><li> �!�!a href="dmd_safe.html"�4itle="dmd.safe">safe<ztpan></a></li><li> �!�!a href="dmd_sarif.html" title="dmd.sarif">sarif<t�><v�i><li> <a href="dmd_semantic2.html"�4itle="dmd.semantic�(N �)>semantic�(v��)ztpan></a></li><li> �!�!a href="dmd_semantic0�0�0�0�0�html" title="dmd.semantic3">semantic3<t�><v�i><li> <a href="dmd_sideeffect.html" title="dmd.sideeffect">sideeffect<t�><v�i><li> <a href="dmd_statement.html"�4itle="dmd.statement">statement<ztpan></a></li><li> �!�!a href="dmd_statementsem.html"�4itle="dmd.statementsem">statementsem<ztpan></a></li><li> �!�!a href="dmd_staticassert.html"�4itle="dmd.staticassert">staticassert<ztpan></a></li><li> �!�!a href="dmd_staticcond.html"�4itle="dmd.staticcond">staticcond<ztpan></a></li><li> �!�!a href="dmd_stmtstate.html" title="dmd.stmtstate">stmtstate<t�><v�i><li> <a href="dmd_target.html" title="dmd.target">target<t�><v�i><li> <a href="dmd_templateparamsem.html" title="dmd.templateparamsem">templateparamsem<t�><v�i><li> <a href="dmd_templatesem.html"�4itle="dmd.templatesem">templatesem<ztpan></a></li><li> �!�!a href="dmd_timetrace.html" title="dmd.timetrace">timetrace<t�><v�i><li> <a href="dmd_tocsym.html" title="dmd.tocsym">tocsym<t�><v�i><li> <a href="dmd_toctype.html"�4itle="dmd.toctype">toctype<ztpan></a></li><li> �!�!a href="dmd_tocvdebug.html" title="dmd.tocvdebug">tocvdebug<t�><v�i><li> <a href="dmd_todt.html" title="dmd.todt">todt<t�><v�i><li> <a href="dmd_toir.html" title="dmd.toir">toir<t�><v�i><li> <a href="dmd_tokens.html" title="dmd.tokens">tokens<t�><v�i><li> <a href="dmd_toobj.html"�4itle="dmd.toobj">toobj<ztpan></a></li><li> �!�!a href="dmd_traits.html"�4itle="dmd.traits">traits<ztpan></a></li><li> �!�!a href="dmd_typesem.html" title="dmd.typesem">typesem<t�><v�i><li> <a href="dmd_typinf.html" title="dmd.typinf">typinf<t�><v�i><li> <a href="dmd_utils.html"�4itle="dmd.utils">utils<ztpan></a></li><li> �!�!a href="dmd_visitor.html" title="dmd.visitor">visitor<t�><ul><li> �!�!a href="dmd_visitor_foreachvar.html"�4itle="dmd.visitor.foreachvar">foreachvar<ztpan></a></li><li> �!�!a href="dmd_visitor_parsetime.html" title="dmd.visitor.parsetime">parsetime<t�><v�i><li> <a href="dmd_visitor_permissive.html" title="dmd.visitor.permissive">permissive<t�><v�i><li> <a href="dmd_visitor_postorder.html"�4itle="dmd.visitor.postorder">postorder<ztpan></a></li><li> �!�!a href="dmd_visitor_statement_rewrite_walker.html"�4itle="dmd.visitor.statement_rewrite_walker">statement_rewrite_walker<ztpan></a></li><li> �!�!a href="dmd_visitor_strict.html"�4itle="dmd.visitor.strict">strict<ztpan></a></li><li> �!�!a href="dmd_visitor_transitive.html"�4itle="dmd.visitor.transitive">transitive<ztpan></a> �!�!v�i></ul><v�i><li> <a href="dmd_vsoptions.html"�4itle="dmd.vsoptions">vsoptions<ztpan></a> <v�i></ul> </li> <li class='expand-container modlist-submenu-rt'><a class='expand-toggle' href='#'>rt<ztpan></a> <ul><li> �!�!a href="rt_aApply.html" title="rt.aApply">aApply<ztpan></a></li><li> �!�!a href="rt_aApplyR.html"�4itle="rt.aApplyR">aApplyR<t�><v�i><li> <a href="rt_aaA.html" title="rt.aaA">aaA<ztpan></a></li><li> �!�!a href="rt_adi.html"�4itle="rt.adi">adi<t�><v�i><li> <a href="rt_alloca.html"�4itle="rt.alloca">alloca<t�><v�i><li> <a href="rt_arraycat.html"�4itle="rt.arraycat">arraycat<t�><v�i><li> <a href="rt_cast_.html" title="rt.cast_">cast_<ztpan></a></li><li> �!�!a href="rt_cmath�(��)html" title="rt.cmath2">cmath�(v��)ztpan></a></li><li> �!�!a href="rt_config.html" title="rt.config">config<ztpan></a></li><li> �!�!a href="rt_cover.html"�4itle="rt.cover">cover<t�><v�i><li> <a href="rt_critical_.html" title="rt.critical_">critical_<ztpan></a></li><li> �!�!a href="rt_deh.html"�4itle="rt.deh">deh<t�><v�i><li> <a href="rt_deh_win3�(��)html" title="rt.deh_win3�(N �)>deh_win3�(v��)ztpan></a></li><li> �!�!a href="rt_deh_win64_posix.html"�4itle="rt.deh_win64_posix">deh_win64_posix<t�><v�i><li> <a href="rt_dmain2.html"�4itle="rt.dmain�(N �)>dmain2<t�><v�i><li> <a href="rt_dwarfeh.html" title="rt.dwarfeh">dwarfeh<ztpan></a></li><li> �!�!a href="rt_ehalloc.html"�4itle="rt.ehalloc">ehalloc<t�><v�i><li> <a href="rt_invariant_.html"�4itle="rt.invariant_">invariant_<t�><v�i><li> <a href="rt_lifetime.html"�4itle="rt.lifetime">lifetime<t�><v�i><li> <a href="rt_llmath.html"�4itle="rt.llmath">llmath<t�><v�i><li> <a href="rt_memory.html"�4itle="rt.memory">memory<t�><v�i><li> <a href="rt_memset.html"�4itle="rt.memset">memset<t�><v�i><li> <a href="rt_minfo.html" title="rt.minfo">minfo<ztpan></a></li><li> �!�!a href="rt_monitor_.html" title="rt.monitor_">monitor_<ztpan></a></li><li> �!�!a href="rt_msvc.html" title="rt.msvc">msvc<ztpan></a></li><li> �!�!a href="rt_msvc_math.html"�4itle="rt.msvc_math">msvc_math<t�><v�i><li> <a href="rt_profilegc.html" title="rt.profilegc">profilegc<ztpan></a></li><li> �!�!a href="rt_sections.html" title="rt.sections">sections<ztpan></a></li><li> �!�!a href="rt_sections_darwin_64.html" title="rt.sections_darwin_64">sections_darwin_64<ztpan></a></li><li> �!�!a href="rt_sections_elf_shared.html"�4itle="rt.sections_elf_shared">sections_elf_shared<t�><v�i><li> <a href="rt_sections_osx_x86.html"�4itle="rt.sections_osx_x86">sections_osx_x86<t�><v�i><li> <a href="rt_sections_osx_x86_64.html" title="rt.sections_osx_x86_64">sections_osx_x86_64<ztpan></a></li><li> �!�!a href="rt_sections_solaris.html" title="rt.sections_solaris">sections_solaris<ztpan></a></li><li> �!�!a href="rt_sections_win64.html" title="rt.sections_win64">sections_win64<ztpan></a></li><li> �!�!a href="rt_tlsgc.html"�4itle="rt.tlsgc">tlsgc<t�><v�i><li> <a href="rt_trace.html" title="rt.trace">trace<ztpan></a></li><li> �!�!a href="rt_tracegc.html"�4itle="rt.tracegc">tracegc<t�><v�i><li> <h7>util<ztpan></h7><ul><li> �!�!a href="rt_util_typeinfo.html"�4itle="rt.util.typeinfo">typeinfo<ztpan></a></li><li> �!�!a href="rt_util_utility.html" title="rt.util.utility">utility<t�> </li><z�l> <v�i></ul> </li><z�l> <u(iv> <div class="hyphenate" id="content"> <div id="tools"><div > <div class="tip smallprint"> <a href="https:/u�ithub.com/dlang/phobosv}ssues/new?title=%5Bstd.algorithm.searching%5D%�(e��)&label=Severity:Enhancement">Report a bug<t�> <div� If you spot a�0roblem�7ith this�0age, click here to create a Bugzilla issue. </div> </div> <div class="tip smallprint"> <a href="https:/u�ithub.com/dlang/phobosu0dit/masterzttdt�lgorithmztearching.d">Improve this�0age<t�> <div� Quickly fork, edit online, and submit a�0ull request for this�0age. Requires a signed-in�?�?itHub account. This works well for small changes. If you'd like�4o make larger changes you may want�4o consider�5sing a local clone. <u(iv> <u(iv> </div></div> �!�!h1>std.algorithm.searching<vv� �!�!div class="quickindex" id="quickindex"><u(iv> <div class="summary">This is a submodule of <a href="std_algorithm.html">std.algorithm<ztpan></a>. It contains generic searching algorithms. </div><div class="description"><script�4ype="text/javascript">inhibitQuickIndex = �</script> <table class="book"><caption>Cheat Sheet</caption><tr><th scope="col">Function Name<z�h>�!�!th scope="col">Description</th><z�r> <tr><td class="donthyphenate nobr"><a href="#all">all<ztpan></a></td> <td> all�T�Ma > 0"([1, �(l4�) 2 2, 4])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true because all elements are�0ositive<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#any">any<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">any!"a�.�.�.gt; 0"([1, 2, -3, -4]) returns true<ztpan> because at least one element is�0ositive<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#balancedParens">balancedParens<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">balancedParens("((1 + 1)� 2)", '(', ')')<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true because the string has balanced parentheses.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#boyerMooreFinder">boyerMooreFinder<ztpan></a></td> <td> find("hello�7orld"+"+ boyerMooreFinder("or")) returns "orld"<ztpan> �5sing�4he�!�!a href="https:]�en.wikipedia.org|�iki/Boyer%E2%80%93Moore_string_search_algorithm"> Boyer-Moore algorithm</a>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#canFind">canFind<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">canFind("hello�7orld"+"+ "or") returns true<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#count">count<t�><z�d>�!�!td> Counts all elements or elements matching a predicate, specific element or sub-range. count([1, 2, o)<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">0�0�0�ztpan>, count([1, 2, o, 1) returns 2 and count�T�Ma < 0"([1, -3, 0])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">�ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#countUntil">countUntil<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">countUntil(a, b) returns the number of steps taken in�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>�4o reach b; for example, countUntil("hello�T�M, "o") returns 4.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#commonPrefix">commonPrefix<ztpan></a></td> <td> commonPrefix("parakeet", "parachute") returns "para"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#endsWith">endsWith<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">endsWith("rocks", "ks")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#extrema">extrema<ztpan></a></td> <td>extrema([�(l4�) 1, 0�0�0� 5, 4])<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">[1, 5].</td><z�r> <tr><td class="donthyphenate nobr"><a href="#find">find<ztpan></a></td> <td> find("hello�7orld"+"+ "or") returns "orld"<ztpan>�5sing linear search. (For binary search refer�4o <a href="std_range.html#.SortedRange">std.range.SortedRange<t�>.)<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findAdjacent">findAdjacent<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">findAdjacent([1, 2, 0�0�0� 2 2, 4])<ztpan> returns�4he subrange starting�7ith two equal adjacent elements, i.e. [0�0�0� 2 2, 4].</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findAmong">findAmong<ztpan></a></td> <td> findAmong("abcd"+"+ "qcx")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">"cd" because 'c' is among�!�!span class="d_inlinecode donthyphenate notranslate">"qcx"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findSkip">findSkip<t�><z�d>�!�!td> �!�?f a = "abcde",�4hen findSkip(a, "x")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> and leaves a unchanged,�7hereas�!�!span class="d_inlinecode donthyphenate notranslate">findSkip(a, "c") advances�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> �4o "de"<ztpan> and returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findSplit">findSplit<ztpan></a></td> <td> findSplit("abcdefg", "de")<ztpan> returns a�4uple of three ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abc"<ztpan>, "de"<ztpan>, and "fg"<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#findSplitAfter">findSplitAfter<t�><z�d>�!�!td>findSplitAfter("abcdefg", "de")<ztpan> returns a�4uple of two ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abcde"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">"fg".</td><z�r> <tr><td class="donthyphenate nobr"><a href="#findSplitBefore">findSplitBefore<ztpan></a></td> <td> findSplitBefore("abcdefg", "de")<ztpan> returns a�4uple of two ranges�!�!span class="d_inlinecode donthyphenate notranslate">"abc"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">"defg".</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minCount">minCount<ztpan></a></td> <td> minCount([2, 1, 1, 4, 1]) returns tuple(1, 0�0�0�.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#maxCount">maxCount<ztpan></a></td> <td> maxCount([2, 4, 1, 4, 1]) returns tuple(4, �(SA�).</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minElement">minElement<ztpan></a></td> <td> Selects the minimal element of a range. minElement([3, 4, 1, �3�3)<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">�ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#maxElement">maxElement<t�><z�d>�!�!td> Selects�4he maximal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">maxElement([0�0�0� 2 2 2, 1, 2]) returns 4.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minIndex">minIndex<ztpan></a></td> <td> Index of�4he minimal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">minIndex([0�0�0� 2 2 2, 1, 2]) returns 2.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#maxIndex">maxIndex<ztpan></a></td> <td> Index of�4he maximal element of a range. �!�!span class="d_inlinecode donthyphenate notranslate">maxIndex([0�0�0� 2 2 2, 1, 2]) returns 1.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#minPos">minPos<ztpan></a></td> <td> minPos([2, 0�0�0� 1, 0�0�0� 2 2 2, o)<ztpan> returns�4he subrange [1, 2 2, 4, 1]<ztpan>, i.e., positions the range at�4he first occurrence of its minimal element.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#maxPos">maxPos<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">maxPos([�(l4�) 2 2, 1, 2 2, 4, 1]) returns the subrange�!�!span class="d_inlinecode donthyphenate notranslate">[4, o, i.e.,�0ositions�4he range at the first occurrence of its maximal element.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#skipOver">skipOver<ztpan></a></td> <td> Assume�!�!span class="d_inlinecode donthyphenate notranslate">a = "blah". Then skipOver(a, "bi") leaves�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> �5nchanged and returns�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan>, whereas skipOver(a, "bl") advances�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>�4o refer to�!�!span class="d_inlinecode donthyphenate notranslate">"ah" and returns true<ztpan>.<z�d></tr> <tr><td class="donthyphenate nobr"><a href="#startsWith">startsWith<t�><z�d>�!�!td> �!�!span class="d_inlinecode donthyphenate notranslate">startsWith("hello,�7orld"+"+ "hello")<ztpan> returns�!�!span class="d_inlinecode donthyphenate notranslate">true.</td><z�r> <tr><td class="donthyphenate nobr"><a href="#until">until<ztpan></a></td> <td> Lazily iterates a range until a specific�6alue is found.</td><z�r> <z�able> <u(iv> <div class="keyval License">License:<ztpan>�!�!div class="val�6alLicense"><a href="http:/uoost.orgkbICENSE_1_0.txt">Boost License 1.0<t�>. </div></div> <div class="keyval Authors">Authors: <div class="val valAuthors"><a href="http:]�erdani.com">Andrei Alexandrescu<t�> <u(iv><u(iv> <div class="val">Source <a class="https" href="https:]�github.comu(langy:hobos/blobw�aster/std/algorithm/searching.d">stdt�lgorithmztearching.d</a> <y:><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.all"></div>template�!�!span class="def-anchor" id="all"><ztpan><code class="ddoc_psymbol">all</code>(alias pred = "a") <u(iv><u(t> <dd><div class="summary">Checks if all of the elements satisfy�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div><ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">assert<ztpan>( all<ztpan>�span class="d_string">"a�.�.�.amp; 1"<ztpan>([1, 2 2, 5, 5 5 5, 9])); assert(�span class="d_psymbol">all!"a & 1"([1, �(l4�) 2 2, 5, 5 5 5, 9])); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><code class="ddoc_psymbol">all<uode> can also be used�7ithout a�0redicate, if its items can be evaluated to�4rue or false in a conditional statement. This can be a convenient way to�iuickly evaluate that�!�!i>all<v}> of�4he elements of a range are�4rue. <pre class="d_code notranslate">int[�5p��6als = [5, 0�0�0� 18]; assert(�!�!span class="d_psymbol">all(vals[])); </pre> <u(iv><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.all.all"></div>bool�!�!span class="def-anchor" id="all"><ztpan><code class="ddoc_psymbol">all</code>(Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && (__traits(isTemplate,�0red)�=| is(typeof(unaryFun�ired(<code class="ddoc_param">range</code>.front))))); <u(iv><u(t> <dd><div class="summary">Returns true<ztpan> if and only if the input range <code class="ddoc_param">range<uode> is empty or all�6alues found in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> satisfy�4he�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred. Performs (at most) Ο(range.length<ztpan>)<ztpan> evaluations of pred<ztpan>.<u(iv> </dd> </dl> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.any"><u(iv>template <code class="ddoc_psymbol">any<uode>(alias�0red = "a") </div></dt> <dd><div class="summary">Checks if�!�!i>any<v}> of�4he elements satisfies pred<ztpan>. !<code class="ddoc_psymbol">any<uode> can be�5sed to�6erify that�!�!i>none of the elements satisfy pred. This is sometimes called exists<ztpan> in other languages.</div><ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; assert( all�Zany<ztpan>�XsWhite)(["a a"<ztpan>, "b b"])); assert(�span class="d_psymbol">any!(all�XsWhite)(["a a"<ztpan>, "b b"])); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><code class="ddoc_psymbol">any<uode> can also be used�7ithout a�0redicate, if its items can be evaluated to�4rue or false in a conditional statement.�!�!span class="d_inlinecode donthyphenate notranslate">�span class="def-anchor" id="any"><ztpan><code class="ddoc_psymbol">any</code><ztpan> can be a convenient�7ay�4o quickly test�4hat none<v}> of�4he elements of a range evaluate to�4rue. <pre class="d_code notranslate">int[�5p��6als1 = [0, 0, 0]; assert(�span class="d_psymbol">any(valsm]));�!�!span class="d_comment">/w�one of�6als1 evaluate to�4rue int<ztpan>[3] vals�(N��)= [2, 0, 2]; assert<ztpan>( any<ztpan>(vals2[])); assert(�I�Ill(vals2[])); int[�5p��6als3 = [0�0�0� 2 2, �5p�; assert(�!�!span class="d_psymbol">any(vals�3p�])); assert<ztpan>( all(vals�3p�])); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.any.any"><u(iv>bool <code class="ddoc_psymbol">any<uode>(Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& (__traits(isTemplate, pred) || is(typeof(unaryFun!pred(<code class="ddoc_param">range<uode>.front)))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�4he input range�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> is non-empty and any�6alue found in <code class="ddoc_param">range<uode> satisfies the predicate pred<ztpan>. Performs (at most)�!�!span class="bigoh">Ο(range.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.balancedParens"></div>bool�!�!span class="def-anchor" id="balancedParens"><code class="ddoc_psymbol">balancedParens</code>(Range, E)<ztpan>(Range�!�!code class="ddoc_param">r<uode>, E <code class="ddoc_param">lPar<uode>, E <code class="ddoc_param">rPar<uode>, size_t�!�!code class="ddoc_param">maxNestingLevel<uode> = size_t.max) if (isInputRange!Range && is(typeof(<code class="ddoc_param">r<uode>.front == <code class="ddoc_param">lPar<uode>)))<ztpan>; </div></dt> <dd><div class="summary">Checks whether <code class="ddoc_param">r<uode> has "balanced parentheses", i.e. all instances of <code class="ddoc_param">lPar</code><ztpan> are closed by corresponding instances of <code class="ddoc_param">rPar</code><ztpan>. The parameter <code class="ddoc_param">maxNestingLevel<uode> controls�4he nesting level allowed. The most common uses are�4he default or 0.�!�?n the latter case, no nesting is allowed. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">The range to check.<z�d></tr> <tr class="param"><td class="param_id">E�!�!code class="ddoc_param">lPar</code><z�d> <td class="param_desc">The element corresponding with a left (opening) parenthesis.</td><z�r> <tr class="param"><td class="param_id">E <code class="ddoc_param">rPar<uode></td> <td class="param_desc">The element corresponding�7ith a right (closing) parenthesis.</td><z�r> <tr class="param"><td class="param_id">size_t�!�!code class="ddoc_param">maxNestingLevel<uode></td> <td class="param_desc">The maximum allowed nesting level.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">true if the given range has balanced�0arenthesis�7ithin the given maximum nesting level; false otherwise.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">auto<ztpan> s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1� 2)"; assert<ztpan>(!balancedParens(s, '(', ')')); s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1) X��(SA�)"<ztpan>; assert(balancedParens(s, '(', ')')); s =�!�!span class="d_string">"1 + (�(N��)* (3 + 1) X��(SA�)"<ztpan>; assert(�span class="d_psymbol">balancedParens<ztpan>(s, '(', ')', 0)); s =�!�!span class="d_string">"1 + (�(N��)* 0�0�0�0�0�+ 1)� (�(N��)- 5)"<ztpan>; assert(balancedParens(s, '(', ')', 0)); s = "f(x) = ⌈x⌉"<ztpan>; assert(balancedParens(s, '⌈', '⌉')); <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder"><u(iv>struct <ztpan><code class="ddoc_psymbol">BoyerMooreFinder<uode>(alias�0red, Range); <ztpan><div class="quickindex" id="quickindex.boyerMooreFinder"><u(iv>BoyerMooreFinder!(binaryFun�ired, Range) <ztpan><code class="ddoc_psymbol">boyerMooreFinder<uode>(alias�0red = "a == b", Range)(Range <code class="ddoc_param">needle<uode>) if (isRandomAccessRange!Range && hasSlicing!Range || isSomeString!Range); <u(iv><u(t> <dd><div class="summary">Sets�5p Boyer-Moore matching for�5se�7ith find<ztpan> below. By default, elements are compared for equality. <u(iv><div class="description"><code class="ddoc_psymbol">BoyerMooreFinder</code><ztpan> allocates�?�?C memory. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">Predicate�5sed to compare elements.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">needle<uode></td> <td class="param_desc">A random-access range�7ith length and slicing.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">An instance of�!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">BoyerMooreFinder<uode> that can be used�7ith find()<ztpan>�4o invoke the Boyer-Moore matching algorithm for finding of <code class="ddoc_param">needle</code><ztpan> in a given haystack.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">auto bmFinder =�!�!span class="d_psymbol">boyerMooreFinder<ztpan>("TG"); string r = "TAGTGCCTGA"<ztpan>; ]� search for the first match in�4he haystack r r = bmFinder.beFound(r); writeln(r); ]� "TGCCTGA" <ztpan> /X�continue search in haystack r = bmFinder.beFound(r[�(N��)..�.]); writeln(r); ]� "TGA" <ztpan></pre> <u(iv><u(iv> <dl><dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder.this"></div>this(Range�!�!code class="ddoc_param">needle</code>); </div></dt> <dd> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.BoyerMooreFinder.beFound"></div>Range <code class="ddoc_psymbol">beFound<uode>(Range�!�!code class="ddoc_param">haystack</code>) scope; </div></dt> <dd> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.BoyerMooreFinder.length"></div>@property size_t�!�!span class="def-anchor" id="length"><code class="ddoc_psymbol">length</code>(); <u(iv><u(t> <dd> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.BoyerMooreFinder.opDollar"><u(iv>alias�!�!span class="def-anchor" id="opDollar"><code class="ddoc_psymbol">opDollar</code> = length; </div></dt> <dd> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.commonPrefix"></div>auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(alias pred = "a == b"+"+ R1, R�(SA�)(R1�!�!code class="ddoc_param">r1</code>, R�(N��)<code class="ddoc_param">r�(v��)uode>) if (isForwardRange�1 D�1�01 && isInputRange!R2�.�.�.amp;& �XsNarrowString!R1�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">r1</code>.front,�!�!code class="ddoc_param">r2</code>.front))))<ztpan>; auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(alias pred, R1, R2)<ztpan>(R1 <code class="ddoc_param">r�uode>, R2�!�!code class="ddoc_param">r2</code>) if (isNarrowString!R1�.�.�.amp;& isInputRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">r�uode>.front, <code class="ddoc_param">r�(v��)uode>.front)))); auto <ztpan><code class="ddoc_psymbol">commonPrefix<uode>(R1, R�(SA�)(R1�!�!code class="ddoc_param">r1</code>, R�(N��)<code class="ddoc_param">r�(v��)uode>) if (isNarrowString�1 D�1�01 && isInputRange!R2�.�.�.amp;& �XsNarrowString!R2�.�.�.amp;& is(typeof(<code class="ddoc_param">r�uode>.front == <code class="ddoc_param">r�(v��)uode>.front)))<ztpan>; auto�!�!span class="def-anchor" id="commonPrefix"><code class="ddoc_psymbol">commonPrefix</code>(R1, R2)<ztpan>(R1 <code class="ddoc_param">r�uode>, R2�!�!code class="ddoc_param">r2</code>) if (isNarrowString!R1�.�.�.amp;& isNarrowString�1 D�1�0�(SA�); <u(iv><u(t> <dd><div class="summary">Returns the common�0refix of�4wo ranges. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to�5se in comparing elements for commonality. Defaults �4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">r1</code><z�d> <td class="param_desc">A <a href="std_range_primitives.html#.isForwardRange">forward range<t�> of elements.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">r2</code><z�d> <td class="param_desc">An�!�!a href="std_range_primitives.html#.isInputRange">input range</a> of elements.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">A slice of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r�uode> which contains�4he characters that both ranges start�7ith, if the first argument is a string; otherwise,�4he same as�4he result of takeExactly(<code class="ddoc_param">r�uode>, n),�7here�!�!span class="d_inlinecode donthyphenate notranslate">n<ztpan> is the number of elements in the common prefix of both ranges. <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_range.html#.takeExactly">std.range.takeExactly<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(commonPrefix<ztpan>("hello, world",�!�!span class="d_string">"hello, there"));�!�!span class="d_comment">/X�"hello, " <y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.count"><u(iv>size_t <code class="ddoc_psymbol">count<uode>(alias�0red = "a == b", Range, E)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, E�!�!code class="ddoc_param">needle</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>))))<ztpan>; size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(alias pred = "a == b"+"+ R1, R�(SA�)(R1�!�!code class="ddoc_param">haystack</code>, R�(N��)<code class="ddoc_param">needle<uode>) if (isForwardRange�1 D�1�01 && !isInfinite�1 D�1�01 && isForwardRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Counts matches of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. <u(iv><div class="description">The first overload counts each element�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> in <code class="ddoc_param">haystack</code><ztpan> for which�!�!span class="d_inlinecode donthyphenate notranslate">pred(e, <code class="ddoc_param">needle<uode>)<ztpan> is true<ztpan>. pred<ztpan> defaults to equality. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> The second overload counts�4he number of�4imes�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was matched in <code class="ddoc_param">haystack<uode>.�!�!span class="d_inlinecode donthyphenate notranslate">pred compares elements in each range. Throws an exception if <code class="ddoc_param">needle</code>.empty<ztpan> is true<ztpan>, as�4he count of the empty range in any range�7ould be infinite. Overlapped counts are not<u0m> considered, for example�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_psymbol">count<uode>("aaa", "aa")<ztpan> is 1, not �(v��)ztpan>. <u(iv> <div class="val">Note Regardless of the overload, <ztpan><code class="ddoc_psymbol">count</code><ztpan>�7ill not accept infinite ranges for�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to compare elements.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">haystack<uode></td> <td class="param_desc">The range�4o count.</td><z�r> <tr class="param"><td class="param_id">E <code class="ddoc_param">needle<uode></td> <td class="param_desc">The element or sub-range to count in <code class="ddoc_param">haystack</code><ztpan>.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">The number of matches in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">]� count elements in range <ztpan>int<ztpan>[] a = [ 1, �(l4�) 2 2 2, 0�0�0� 2, 5, 2 2, �(l4�) 2 2 2 ]; writeln(count<ztpan>(a, �(SA�));�!�!span class="d_comment">/X�0�0�0�writeln(count!("a�.�.�.gt; b")(a, �(SA�));�!�!span class="d_comment">/X�5 <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.uni : toLower; /X�count range in range <ztpan>writeln(count<ztpan>("abcadfabf"<ztpan>, "ab"<ztpan>)); ]� 2 <ztpan>writeln(count<ztpan>("ababab",�!�!span class="d_string">"abab"));�!�!span class="d_comment">/X�1 writeln(count("ababab"<ztpan>, "abx"));�!�!span class="d_comment">/X�0 /X�fuzzy count range in range <ztpan>writeln(count<ztpan>�Z(a, b) =>�4oLower(a) ==�4oLower(b))("AbcAdFaBf"<ztpan>, "ab"<ztpan>)); ]� 2 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.count.2"></div>size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(alias pred, R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& �XsInfinite!R && is(typeof(unaryFun!pred(<code class="ddoc_param">haystack</code>.front))))<ztpan>; size_t�!�!span class="def-anchor" id="count"><ztpan><code class="ddoc_psymbol">count</code>(R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& �XsInfinite!R); <u(iv><u(t> <dd><div class="summary">Counts all elements or elements satisfying a�0redicate in <code class="ddoc_param">haystack</code><ztpan>. </div><div class="description">The first overload counts each element e in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> for which pred(e) is�!�!span class="d_inlinecode donthyphenate notranslate">true. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> The second overload counts�4he number of elements in a range. If�4he given range has�4he�!�!span class="d_inlinecode donthyphenate notranslate">length property, that is returned right away, otherwise performs Ο(haystack.length) to�7alk the range. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Optional�0redicate�4o find elements.</td><z�r> <tr class="param"><td class="param_id">R <code class="ddoc_param">haystack<uode></td> <td class="param_desc">The range�4o count.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The number of elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> (for�7hich�!�!span class="d_inlinecode donthyphenate notranslate">pred returned�4rue).<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">/X�count elements in range int[] a = [ 1, 2, 4, 2 2, �(l4�) 5, 0�0�0� 2, 4 ]; writeln(count(a));�!�!span class="d_comment">/X�9 /X�count predicate in range <ztpan>writeln(count<ztpan>�Z"a > 2"<ztpan>)(a));�!�!span class="d_comment">/X�5 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.countUntil"><u(iv>auto <ztpan><code class="ddoc_psymbol">countUntil<uode>(alias�0red = "a == b", R, Rs...)<ztpan>(R�!�!code class="ddoc_param">haystack</code>, Rs <code class="ddoc_param">needles</code>) if (isForwardRange!R && (Rs.length > 0) && (isForwardRange�ZRs[0]) == isInputRange�ZRs[0])) && allSatisfy!(canTestStartsWith�Zpred, R), Rs)); ptrdiff_t�!�!span class="def-anchor" id="countUntil"><code class="ddoc_psymbol">countUntil</code>(alias pred = "a == b"+"+ R, N)(R <code class="ddoc_param">haystack<uode>, N <code class="ddoc_param">needle<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>)) : bool)); ptrdiff_t�!�!span class="def-anchor" id="countUntil"><code class="ddoc_psymbol">countUntil</code>(alias pred, R)(R <code class="ddoc_param">haystack<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(unaryFun�ired(<code class="ddoc_param">haystack<uode>.front)) : bool))<ztpan>; </div></dt> <dd><div class="summary">Counts elements in the given <a href="std_range_primitives.html#.isForwardRange">forward range<t�> until the given predicate is�4rue for one of�4he given�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan>. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate for determining�7hen to stop counting.<z�d></tr> <tr class="param"><td class="param_id">R�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to be counted.</td><z�r> <tr class="param"><td class="param_id">Rs�!�!code class="ddoc_param">needles<uode></td> <td class="param_desc">Either a single element, or a �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a> of elements, to be evaluated in�4urn against each element in <code class="ddoc_param">haystack</code><ztpan>�5nder�4he given�0redicate.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">The number of elements�7hich must be�0opped from�4he front of <code class="ddoc_param">haystack</code><ztpan> before reaching an element for which startsWith!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needles<uode>)<ztpan> is true<ztpan>. If �!�!span class="d_inlinecode donthyphenate notranslate">startsWith�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needles</code>) is not�!�!span class="d_inlinecode donthyphenate notranslate">true for any element in �!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>,�4hen -�ztpan> is returned. If more than one needle is�0rovided, �!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">countUntil<uode> will�7rap the result in a tuple similar to �!�!span class="d_inlinecode donthyphenate notranslate">Tuple!(ptrdiff_t, "steps"+"+�0trdiff_t�!�!code class="ddoc_param">needle</code>) <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_string.html#.indexOf">std.string.indexOf<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(countUntil<ztpan>("hello�7orld"<ztpan>, "world"));�!�!span class="d_comment">/X�6 writeln(countUntil<ztpan>("hello�7orld"<ztpan>, 'r'));�!�!span class="d_comment">/X�8 writeln(countUntil<ztpan>("hello�7orld"<ztpan>, "programming"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil("日本語",�!�!span class="d_string">"本語"));�!�!span class="d_comment">/X�1 writeln(countUntil<ztpan>("日本語"<ztpan>, '語'));�!�!span class="d_comment">/X��(�)writeln(countUntil<ztpan>("日本語"<ztpan>, "五"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil("日本語", '五')); ]� -1 writeln(countUntil<ztpan>([0, 5 5 5, , �(g �), 9], [1�(l4�) 2�3�3)); ]� 2 <ztpan>writeln(countUntil([0, 7, 1�(l4�) 2�(l4�) 9], 9)); ]� 2 2 2 <ztpan>writeln(countUntil!"a > b"<ztpan>([0, 5 5 5, , �(g �), 9], �(e��))); ]� 2 2 <ztpan> /X�supports multiple needles auto<ztpan> res =�!�!span class="d_string">"...hello".countUntil("ha"<ztpan>, "he"<ztpan>); writeln(res.steps);�!�!span class="d_comment">/X�0�0�0�writeln(res.needle<ztpan>);�!�!span class="d_comment">/X�1 ]� returns -1 if no needle�7as found <ztpan>res = "hello".countUntil("ha"<ztpan>, "hu"<ztpan>); writeln(res.steps);�!�!span class="d_comment">/X�-1 <ztpan>writeln(res.needle); ]� -1 <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.ascii : isDigit; import<ztpan> std.uni : isWhite; writeln(countUntil<ztpan>�ZisWhite)("hello�7orld"<ztpan>)); ]� 5 <ztpan>writeln(countUntil!(isDigit)("hello world"));�!�!span class="d_comment">/X�-1 <ztpan>writeln(countUntil!"a > 20"([0, 7, 1�(l4�) 2�(l4�) 9]));�!�!span class="d_comment">/X�0�0�0�<y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.endsWith"><u(iv>uint <ztpan><code class="ddoc_psymbol">endsWith<uode>(alias�0red = "a == b", Range, Needles...)(Range <code class="ddoc_param">doesThisEnd</code>, Needles�!�!code class="ddoc_param">withOneOfThese</code>) if (isBidirectionalRange!Range && (Needles.length�.�.�.gt; 1)�.�.�.amp;& allSatisfy�ZcanTestStartsWith!(pred, Range), Needles)); bool <ztpan><code class="ddoc_psymbol">endsWith<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">doesThisEnd</code>, R�(N��)<code class="ddoc_param">withThis<uode>) if (isBidirectionalRange�1 D�1�01 && isBidirectionalRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">doesThisEnd<uode>.back,�!�!code class="ddoc_param">withThis</code>.back)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="endsWith"><code class="ddoc_psymbol">endsWith</code>(alias pred = "a == b"+"+ R, E)(R <code class="ddoc_param">doesThisEnd</code>, E�!�!code class="ddoc_param">withThis</code>) if (isBidirectionalRange!R && is(typeof(binaryFun�ired(<code class="ddoc_param">doesThisEnd</code>.back, <code class="ddoc_param">withThis<uode>)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="endsWith"><code class="ddoc_psymbol">endsWith</code>(alias pred, R)(R <code class="ddoc_param">doesThisEnd</code>) if (isInputRange!R && ifTestable!(typeof(<code class="ddoc_param">doesThisEnd</code>.front), unaryFun�ired))<ztpan>; </div></dt> <dd><div class="summary">Checks if�4he given range ends with (one of) the given needle(s). The reciprocal of�!�!span class="d_inlinecode donthyphenate notranslate">startsWith. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to�5se for comparing elements between the range and the needle(s).</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">doesThisEnd</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional range<t�> to check.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">withOneOfThese</code><z�d> <td class="param_desc">The needles to check against, which may be single elements, or bidirectional ranges of elements.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">withThis</code><z�d> <td class="param_desc">The single element�4o check.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">0 if the needle(s) do not occur at the end of�4he given range; otherwise the position of the matching needle,�4hat is, 1 if�4he range ends with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>[0]<ztpan>, �(N��)if it ends�7ith <code class="ddoc_param">withOneOfThese</code>[o, and so on. <div class="blankline"><u(iv> In the case�7hen no needle parameters are given, return�!�!span class="d_inlinecode donthyphenate notranslate">true iff back of doesThisStart fulfils predicate pred<ztpan>.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isAlpha; assert("abc".endsWith!(a => a.isAlpha)); assert("abc".endsWith!isAlpha); assert<ztpan>(!"ab1".endsWith!(a => a.isAlpha)); assert<ztpan>(!"ab1".endsWith!isAlpha); assert(�span class="d_string">"".endsWith!(a => a.isAlpha)); import<ztpan> std.algorithm.comparison : among; assert<ztpan>("abc"<ztpan>.endsWith<ztpan>�Za => a.among('c', 'd') � 0)); assert(�span class="d_string">"abc"<ztpan>.endsWith<ztpan>�Za => a.among('a', 'b') � 0)); assert<ztpan>(endsWith<ztpan>("abc"<ztpan>, ""<ztpan>)); assert(�span class="d_psymbol">endsWith<ztpan>("abc"<ztpan>, "b")); writeln(endsWith<ztpan>("abc"<ztpan>, "a", 'c')); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"c"<ztpan>, "a"));�!�!span class="d_comment">/X�1 writeln(endsWith<ztpan>("abc"<ztpan>, "c",�!�!span class="d_string">"c"<ztpan>)); ]� 1 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"bc",�!�!span class="d_string">"c"<ztpan>)); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "c",�!�!span class="d_string">"b"<ztpan>)); ]� 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aa"<ztpan>, "bc"<ztpan>)); ]� 2 2 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aaa",�!�!span class="d_string">"sab"<ztpan>)); ]� 0 <ztpan>writeln(endsWith("abc",�!�!span class="d_string">"x"<ztpan>, "aaa", 'c', "sab"));�!�!span class="d_comment">/X�0�0�0�<y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find"><u(iv>InputRange <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red,�!�?nputRange)(InputRange�!�!code class="ddoc_param">haystack</code>) if (isInputRange!InputRange)<ztpan>; </div></dt> <dd><div class="summary">Finds an element e of an <a href="std_range_primitives.html#.isInputRange">input range<t�> where pred(e) is�!�!span class="d_inlinecode donthyphenate notranslate">true. <div class="panel"><ul><li><ztpan><code class="ddoc_psymbol">find<uode> behaves similarly to�!�!span class="d_inlinecode donthyphenate notranslate">dropWhile<ztpan> in other languages.</li> <li>To find the last matching element in a <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional<t�> <code class="ddoc_param">haystack</code><ztpan>, call�!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">find<uode>�ired(retro(<code class="ddoc_param">haystack<uode>)). See�!�!a href="std_range.html#.retro">std.range.retro<ztpan></a>.<v�i> <z�l></div> <u(iv><div class="val">Complexity<ztpan> <ztpan><code class="ddoc_psymbol">find<uode> performs�!�!span class="bigoh">Ο(walkLength(haystack)) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to match an element.</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> searched in.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns"><code class="ddoc_param">haystack</code><ztpan> advanced such�4hat the front element satisfies pred<ztpan>. If no such element exists, returns an empty <code class="ddoc_param">haystack</code><ztpan>.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">auto<ztpan> arr = [ 1, �(l4�) 2 2, 4, 1 ]; writeln(find!("a�.�.�.gt; �(N �))(arr)); ]� [0�0�0� 2 2 2, o <ztpan> /X�with�0redicate alias <ztpan>bool pred(int e) => e + 1�.�.�.gt; 1.5; writeln(find<ztpan>�Zpred)(arr));�!�!span class="d_comment">/X�arr <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.�(N �)><u(iv>InputRange <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red = "a == b", InputRange, Element)(InputRange�!�!code class="ddoc_param">haystack</code>, scope Element�!�!code class="ddoc_param">needle</code>) if (isInputRange!InputRange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>)) : bool) && !is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>.front)) : bool)); R1 <ztpan><code class="ddoc_psymbol">find<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, scope R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>.front)) : bool))<ztpan>; </div></dt> <dd><div class="summary">Finds an individual element in an�!�!a href="std_range_primitives.html#.isInputRange">input range</a>. Elements of <code class="ddoc_param">haystack</code><ztpan> are compared with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> by�5sing�0redicate pred with�!�!span class="d_inlinecode donthyphenate notranslate">pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needle</code>). The�0redicate is passed�4o <a href="std_functional.html#.binaryFun">std.functional.binaryFun<t�>, and can either accept a string, or any callable�4hat can be executed via pred(element, element)<ztpan>. </div><div class="description">If <code class="ddoc_param">haystack</code><ztpan> is a <a href="std_range_primitives.html#.isForwardRange">forward range<t�>, <code class="ddoc_param">needle<uode> can be a�!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4oo. In�4his case�!�!span class="d_inlinecode donthyphenate notranslate">startsWith�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needle<uode>)<ztpan> is evaluated on each evaluation. <div class="blankline"><u(iv> <div class="note">Note: To find the first element not matching the needle, use predicate "a � b"<ztpan>.<u(iv> <u(iv> <div class="val">Complexity <code class="ddoc_psymbol">find</code><ztpan>�0erforms Ο(walkLength(haystack)<ztpan>)<ztpan> evaluations of pred<ztpan>. There are specializations that improve�0erformance by taking advantage of <a href="std_range_primitives.html#.isBidirectionalRange">bidirectional<t�> or�!�!a href="std_range_primitives.html#.isRandomAccessRange">random access<t�> ranges (where possible). </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate for comparing each element�7ith the needle, defaulting�4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> searched in.<z�d></tr> <tr class="param"><td class="param_id">Element�!�!code class="ddoc_param">needle</code><z�d> <td class="param_desc">The element searched for.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns"><code class="ddoc_param">haystack</code><ztpan> advanced such�4hat the front element is�4he one searched for; �4hat is, until binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>)<ztpan> is true<ztpan>. If no such�0osition exists, returns an empty�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#findAdjacent">findAdjacent<t�>,�!�!a href="#findAmong">findAmong<t�>,�!�!a href="#findSkip">findSkip<t�>,�!�!a href="#findSplit">findSplit<t�>,�!�!a href="#startsWith">startsWith<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range.primitives; auto arr = [1, �(l4�) 2 2 2, 4, 2 2 2, 4, 5, 6, 9]; writeln(arr.find<ztpan>(4)); ]� [4, 2 2 2, 4, 2 2 2, 5, 5 5, 9] <ztpan>writeln(arr.find(1));�!�!span class="d_comment">/X�arr writeln(arr.find<ztpan>(9)); ]� [9] <ztpan>writeln(arr.find!((e, n) => e > n)(4));�!�!span class="d_comment">/X�[5, 6, 9] writeln(arr.find<ztpan>�Z(e, n) => e�.�.�.lt; n)(4)); ]� arr <ztpan>assert(arr.find(0).empty); assert<ztpan>(arr.find<ztpan>(10).empty); assert<ztpan>(arr.find<ztpan>(8).empty); writeln(find<ztpan>("hello, world", ',')); ]� ", world" <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Case-insensitive find of a string <pre class="d_code notranslate">import<ztpan> std.range.primitives; import<ztpan> std.uni :�4oLower; string[] s = ["Hello"<ztpan>, "world",�!�!span class="d_string">"!"<ztpan>]; writeln(s.find<ztpan>�Z(e, n) =>�4oLower(e) == n)("hello"));�!�!span class="d_comment">/X�s <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.container : SList; import<ztpan> std.range.primitives : empty; import<ztpan> std.typecons : Tuple; assert(find("hello,�7orld"<ztpan>, "World").empty); writeln(find<ztpan>("hello, world",�!�!span class="d_string">"wo"));�!�!span class="d_comment">/X�"world" writeln([1, 2, 0�0�0� 2 2 2].find(SList!int<ztpan>(2, 0�0�0�[])); ]� [�(l4�) 2 2, 4] <ztpan>alias<ztpan> C = Tuple�Zint<ztpan>, "x",�!�!span class="d_keyword">int,�!�!span class="d_string">"y"<ztpan>); auto<ztpan> a = [C(1,0), C(�(l4�)0), C(0�0�0�1), C(4,0)]; writeln(a.find<ztpan>�span class="d_string">"a.x == b"([2, �5p�)); ]� [C(�(l4�) 0), C(3, 1), C(4, 0)] <ztpan>writeln(a[1 ..�.].find!"a.x == b"<ztpan>([�(l4�) 2 2]));�!�!span class="d_comment">/X�[C(2, 0), C(0�0�0� 1), C(4, 0)] <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.0�0�0�><u(iv>Tuple�ZRange, size_t)�!�!span class="def-anchor" id="find"><code class="ddoc_psymbol">find</code>(alias pred = "a == b"+"+ Range, Needles...)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, Needles�!�!code class="ddoc_param">needles<uode>) if (Needles.length�.�.�.gt; 1 && is(typeof(startsWith!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needles<uode>)))); <u(iv><u(t> <dd><div class="summary">Finds two or more <code class="ddoc_param">needles<uode> into a�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. The�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred is�5sed throughout�4o compare elements. By default, elements are compared for equality. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4o use for comparing elements.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The target of the search. Must be an input range. If any of <code class="ddoc_param">needles<uode> is a range�7ith elements comparable to elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>,�4hen <code class="ddoc_param">haystack</code><ztpan> must be a <a href="std_range_primitives.html#.isForwardRange">forward range</a> such that�4he search can backtrack.</td><z�r> <tr class="param"><td class="param_id">Needles <code class="ddoc_param">needles</code><z�d> <td class="param_desc">One or more items to search for. Each of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> must be either comparable�4o one element in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>, or be itself a forward range with elements comparable�7ith elements in <code class="ddoc_param">haystack</code><ztpan>.<z�d></tr> </table></div></div> <div class="keyval Returns">Returns: <div class="val valReturns">A tuple containing�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> positioned�4o match one of�4he needles and also the 1-based index of�4he matching element in�!�!span class="d_inlinecode donthyphenate notranslate">needles<ztpan> (0 if none of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> matched, 1 if�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code>[0] matched, 2 if <code class="ddoc_param">needles<uode>[1]<ztpan> matched...). The first needle�4o be found will be�4he one�4hat matches.�!�?f multiple needles are found at the same spot in�4he range, then�4he shortest one is�4he one�7hich matches (if multiple needles of�4he same length are found at the same spot (e.g "a"<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">'a'<ztpan>),�4hen the left-most of�4hem in�4he argument list matches). <div class="blankline"></div> The relationship between�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and <code class="ddoc_param">needles<uode> simply means that one can e.g. search for individual�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s or arrays of�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s in an array of�!�!span class="d_inlinecode donthyphenate notranslate">int<ztpan>s.�!�?n addition, if elements are individually comparable, searches of heterogeneous�4ypes are allowed as well: a double[]<ztpan> can be searched for an int or a�!�!span class="d_inlinecode donthyphenate notranslate">short[]<ztpan>, and conversely a�!�!span class="d_inlinecode donthyphenate notranslate">long can be searched for a float or a�!�!span class="d_inlinecode donthyphenate notranslate">double[]. This makes for efficient searches�7ithout�4he need to coerce one side of the comparison into the other's side�4ype. <div class="blankline"></div> The complexity of the search is Ο(haystack.length * max(needles.length)). (For needles that are individual items, length is considered to be 1.) The strategy�5sed in searching several subranges at once maximizes cache�5sage by moving in <code class="ddoc_param">haystack</code><ztpan> as few times as�0ossible.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.typecons :�4uple; int<ztpan>[] a = [ 1, 4, 2, 0�0�0�0�0�]; writeln(find<ztpan>(a, 4));�!�!span class="d_comment">/X�[4, �(l4�) 2 2] writeln(find<ztpan>(a, [1, 4])); ]� [1, 2 2 2, �(l4�) 2 2] writeln(find<ztpan>(a, [1, �5p�, 4));�!�!span class="d_comment">/X�tuple([4, �(l4�) 2 2], 2) /X�Mixed types allowed if comparable writeln(find<ztpan>(a, 5, [1.�(l4�) 2 2.5], 2.0)); ]��4uple([�(l4�) 2 2], 2 2) <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.find.4"><u(iv>RandomAccessRange�!�!span class="def-anchor" id="find"><code class="ddoc_psymbol">find</code>(RandomAccessRange, alias�0red,�!�?nputRange)(RandomAccessRange <code class="ddoc_param">haystack<uode>, scope BoyerMooreFinder�Zpred, InputRange) <code class="ddoc_param">needle<uode>); <u(iv><u(t> <dd><div class="summary">Finds <code class="ddoc_param">needle</code><ztpan> in <code class="ddoc_param">haystack</code><ztpan> efficiently�5sing�4he <a href="https:/u0n.wikipedia.org/wikie�oyer%E�(Qm�)80%90�0�0�0�oore_string_search_algorithm"> Boyer-Moore</a> method. <u(iv><div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">RandomAccessRange�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">A random-access range with length and slicing.</td><z�r> <tr class="param"><td class="param_id">BoyerMooreFinder�Zpred, InputRange) <code class="ddoc_param">needle<uode></td> <td class="param_desc">A�!�!a href="#BoyerMooreFinder">BoyerMooreFinder<t�>.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">haystack<uode> advanced such that�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> is a�0refix of it (if no such�0osition exists, returns <code class="ddoc_param">haystack</code><ztpan> advanced to�4ermination).</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range.primitives : empty; int<ztpan>[] a = [ -1, 0, 1, 2, 0�0�0� 2 2 2, 5 ]; int[] b = [ 1, 2, 0�0�0�0�0�]; writeln(find(a, boyerMooreFinder(b))); ]� [1, 2, 0�0�0� 2 2 2, 5] <ztpan>assert(find(b, boyerMooreFinder(a)).empty); </pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind"></div>template�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(alias pred = "a == b") </div></dt> <dd><div class="summary">Convenience function. Like find, but only returns�7hether or not the search was successful. <u(iv><div class="description">For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_algorithm_comparison.html#.among">std.algorithm.comparison.among<t�> for checking a�6alue against multiple arguments.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">const<ztpan> arr = [0, 1, �(l4�) 2 2]; assert<ztpan>(canFind(arr, 2)); assert(�span class="d_psymbol">canFind(arr, 2 2 2)); /X�find one of several needles assert<ztpan>(arr.canFind(0�0�0� 2)); assert(arr.canFind<ztpan>(3, �(SA�) == �(SA�); ]� second needle found <ztpan>writeln(arr.canFind<ztpan>([1, 2 2], 2)); ]� 2 <ztpan> assert<ztpan>(canFind(arr, [1, 2], [�(l4�) 2 2])); writeln(canFind(arr, [1, 2], [�(l4�) 2 2]));�!�!span class="d_comment">/X�1 assert<ztpan>(canFind(arr, [1, 5 5 5], [�(l4�) 2 2])); writeln(canFind(arr, [1, 5 5 5], [�(l4�) 2 2]));�!�!span class="d_comment">/X��(�)assert<ztpan>(!canFind<ztpan>(arr, [1, �5p�, [2, 4])); writeln(canFind<ztpan>(arr, [1, �5p�, [2, 4])); ]� 0 <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Example�5sing a custom predicate. Note�4hat the needle appears as the second argument of�4he�0redicate. <pre class="d_code notranslate">auto words = [ "apple", �!�!span class="d_string">"beeswax"<ztpan>, "cardboard" ]; assert<ztpan>(!canFind<ztpan>(words, "bees"<ztpan>)); assert(�!�!span class="d_psymbol">canFind!((string elem, string needle) => elem.startsWith(needle))(words, "bees"<ztpan>)); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Search for multiple items in an array of items (search for needles in an array of haystacks) <pre class="d_code notranslate">string s1 = "aaa1�aaa"; string s2 =�!�!span class="d_string">"aaa�(g �)aa"<ztpan>; string s0�0�0�0�0�= "aaa30�0�0�0�aaa"; string s4 =�!�!span class="d_string">"aaa444aaa"<ztpan>; const<ztpan> hay = [s1, s2, s3, s4]; assert<ztpan>(hay.canFind!(e => e.canFind("�1",�!�!span class="d_string">"2�(g �)"<ztpan>))); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.canFind.canFind"><u(iv>bool <code class="ddoc_psymbol">canFind<uode>(Range)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>) if (is(typeof(find!pred(<code class="ddoc_param">haystack</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�!�!span class="d_inlinecode donthyphenate notranslate">pred(e)<ztpan> is true for any�6alue�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> in the input range range. Performs (at most) Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind.canFind.2"></div>bool�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(Range, Element)<ztpan>(Range�!�!code class="ddoc_param">haystack</code>, scope Element�!�!code class="ddoc_param">needle</code>) if (is(typeof(find!pred(<code class="ddoc_param">haystack</code>,�!�!code class="ddoc_param">needle</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�!�!span class="d_inlinecode donthyphenate notranslate">true if and only if�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> can be found in range. Performs Ο(haystack.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.canFind.canFind.3"></div>size_t�!�!span class="def-anchor" id="canFind"><ztpan><code class="ddoc_psymbol">canFind</code>(Range, Needles...)(Range <code class="ddoc_param">haystack<uode>, scope Needles <code class="ddoc_param">needles</code>) if (Needles.length > 1�.�.�.amp;& is(typeof(find�ired(<code class="ddoc_param">haystack<uode>, <code class="ddoc_param">needles</code>))))<ztpan>; </div></dt> <dd><div class="summary">Returns�4he 1-based index of the first needle found in <code class="ddoc_param">haystack</code><ztpan>. If no needle is found,�4hen 0 is returned. <u(iv><div class="description">So, if�5sed directly in the condition of an if<ztpan> statement or loop, the result �7ill be�!�!span class="d_inlinecode donthyphenate notranslate">true if one of the needles is found and�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> if none are found, whereas if�4he result is�5sed elsewhere, it can either be cast�4o bool<ztpan> for�4he same effect or used�4o get which needle�7as found first �7ithout having to deal with�4he�4uple�4hat <a href="#find">find<ztpan></a> returns for�4he same operation.</div> </dd> </dl> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.findAdjacent"><u(iv>Range�!�!span class="def-anchor" id="findAdjacent"><code class="ddoc_psymbol">findAdjacent</code>(alias pred = "a == b"+"+ Range)<ztpan>(Range�!�!code class="ddoc_param">r<uode>) if (isForwardRange�1 D�1�0ange)<ztpan>; </div></dt> <dd><div class="summary">Advances <code class="ddoc_param">r<uode> until it finds�4he first�4wo adjacent elements�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan>, b that satisfy�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b). Performs Ο(r.length<ztpan>)<ztpan> evaluations of pred<ztpan>. </div><div class="description">For more information about pred<ztpan> see�!�!a href="#find">find<t�>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The predicate to satisfy.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">r<uode></td> <td class="param_desc">A�!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4o search in.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">r</code><ztpan> advanced to�4he first occurrence of�4wo adjacent elements�4hat satisfy the given predicate.�!�?f there are no such two elements, returns <code class="ddoc_param">r<uode> advanced until empty. <u(iv><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="http:]�en.cppreference.com/w/cpp/algorithm/adjacent_find">STL's�!�!span class="d_inlinecode donthyphenate notranslate">adjacent_find<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [ 11, 10, 10, 9, 8, 8, 7, 8, 9 ]; auto<ztpan>�!�!span class="d_param">r = findAdjacent(a); writeln(r<ztpan>);�!�!span class="d_comment">/X�[10, 10, 9, 8, 8, 7, 8, 9] <ztpan>auto p = findAdjacent!("a�.�.�.lt; b")(a); writeln(p);�!�!span class="d_comment">/X�[7, 8, 9] <y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.findAmong"><u(iv>InputRange <code class="ddoc_psymbol">findAmong<uode>(alias�0red = "a == b", InputRange, ForwardRange)<ztpan>(InputRange <code class="ddoc_param">seq</code>, ForwardRange <code class="ddoc_param">choices</code>) if (isInputRange!InputRange�.�.�.amp;& isForwardRange�dorwardRange); <u(iv><u(t> <dd><div class="summary">Searches�4he given range for an element that matches one of the given choices. <u(iv><div class="description">Advances�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">seq</code><ztpan> by calling <code class="ddoc_param">seq<uode>.popFront<ztpan>�5ntil either find!(pred)(<code class="ddoc_param">choices<uode>, <code class="ddoc_param">seq</code>.front) is�!�!span class="d_inlinecode donthyphenate notranslate">true, or <code class="ddoc_param">seq<uode> becomes empty. Performs Ο(seq.length * choices.length) evaluations of�!�!span class="d_inlinecode donthyphenate notranslate">pred. <div class="blankline"></div> For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4o use for determining a match.</td><z�r> <tr class="param"><td class="param_id">InputRange�!�!code class="ddoc_param">seq<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a>�4o search.<z�d></tr> <tr class="param"><td class="param_id">ForwardRange <code class="ddoc_param">choices</code><z�d> <td class="param_desc">A <a href="std_range_primitives.html#.isForwardRange">forward range<t�> of�0ossible choices.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns"><code class="ddoc_param">seq</code><ztpan> advanced to�4he first matching element, or until empty if�4here are no matching elements. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�>,�!�!a href="std_algorithm_comparison.html#.among">std.algorithm.comparison.among<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [ -1, 0, 1, 2, 0�0�0� 2 2 2, 5 ]; int[] b = [ 0�0�0� 1, �(N��)]; writeln(findAmong(a, b)); ]� a[2 .. $] <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.findSkip"><u(iv>bool <ztpan><code class="ddoc_psymbol">findSkip<uode>(alias�0red = "a == b", R1, R2)<ztpan>(ref R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(N��)&& is(typeof(binaryFun�ired(<code class="ddoc_param">haystack<uode>.front, <code class="ddoc_param">needle<uode>.front)))); size_t <ztpan><code class="ddoc_psymbol">findSkip<uode>(alias�0red, R1)(ref R1�!�!code class="ddoc_param">haystack</code>) if (isForwardRange!R1�.�.�.amp;& ifTestable�Ztypeof(<code class="ddoc_param">haystack</code>.front), unaryFun�ired))<ztpan>; </div></dt> <dd><div class="summary">Finds�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and positions <code class="ddoc_param">haystack</code><ztpan> right after the first occurrence of <code class="ddoc_param">needle</code><ztpan>. </div><div class="description">If no needle is�0rovided,�4he�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> is advanced as long as�!�!span class="d_inlinecode donthyphenate notranslate">pred evaluates�4o true<ztpan>. Similarly, the haystack is positioned so as�!�!span class="d_inlinecode donthyphenate notranslate">pred evaluates to�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for <code class="ddoc_param">haystack</code>.front<ztpan>. <div class="blankline"><u(iv> For more information about�!�!span class="d_inlinecode donthyphenate notranslate">pred see <a href="#find">find<ztpan></a>. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a>�4o search in.<z�d></tr> <tr class="param"><td class="param_id">R�(N��)<code class="ddoc_param">needle<uode></td> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to search for.<z�d></tr> <tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Custom�0redicate for comparison of haystack and needle</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">true if�4he needle was found, in which case�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> is positioned after�4he end of the first occurrence of <code class="ddoc_param">needle</code><ztpan>; otherwise �!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan>, leaving <code class="ddoc_param">haystack</code><ztpan>�5ntouched. If no needle is provided, it returns �4he number of�4imes�!�!span class="d_inlinecode donthyphenate notranslate">pred(<code class="ddoc_param">haystack</code>.front) returned�4rue. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range.primitives : empty; /X�Needle is found; s is replaced by the substring following the first /X�occurrence of the needle. string s = "abcdef"<ztpan>; assert(findSkip(s,�!�!span class="d_string">"cd")�.�.�.amp;& s ==�!�!span class="d_string">"ef"); /X�Needle is not found; s is left�5ntouched. s =�!�!span class="d_string">"abcdef"; assert<ztpan>(!findSkip(s,�!�!span class="d_string">"cxd"<ztpan>) && s == "abcdef"<ztpan>); ]��!�?f the needle occurs at�4he end of the range,�4he range is left empty. s =�!�!span class="d_string">"abcdef"; assert<ztpan>(findSkip<ztpan>(s, "def")�.�.�.amp;& s.empty); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; string s =�!�!span class="d_string">" abc"<ztpan>; assert(findSkip!isWhite(s)�.�.�.amp;& s ==�!�!span class="d_string">"abc"<ztpan>); assert<ztpan>(!findSkip!isWhite(s)�.�.�.amp;& s ==�!�!span class="d_string">"abc"<ztpan>); s = " "<ztpan>; writeln(findSkip!isWhite(s));�!�!span class="d_comment">/X��(�)<y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.findSplit"><u(iv>auto <code class="ddoc_psymbol">findSplit<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <div class="quickindex" id="quickindex.findSplitBefore"><u(iv>auto <code class="ddoc_psymbol">findSplitBefore<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <ztpan><div class="quickindex" id="quickindex.findSplitAfter"><u(iv>auto <ztpan><code class="ddoc_psymbol">findSplitAfter<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">haystack<uode>, R2�!�!code class="ddoc_param">needle</code>) if (isForwardRange!R1�.�.�.amp;& isForwardRange�1 D�1�0�(SA�); <u(iv><u(t> <dd><div class="summary">These functions find�4he first occurrence of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> and then split�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> as follows. </div><div class="description"><div class="panel"><ztpan><code class="ddoc_psymbol">findSplit</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�!�!i>three<v}> ranges. <ul><li>result[0] is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan> before <code class="ddoc_param">needle</code><ztpan></li> <li>result[o is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan>�4hat matches <code class="ddoc_param">needle</code><ztpan></li> <li>result[�3�3 is�4he�0ortion of <code class="ddoc_param">haystack</code><ztpan> after�4he match.<v�i> <z�l> If <code class="ddoc_param">needle</code><ztpan>�7as not found, result[0] comprehends <code class="ddoc_param">haystack</code><ztpan> entirely and result[o and result[�3�3 are empty. <div class="blankline"></div> <ztpan><code class="ddoc_psymbol">findSplitBefore</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�4wo ranges. <ul><li>result[0]<ztpan> is the portion of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> before�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode><v�i> <li>result[1]<ztpan> is the balance of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> starting�7ith the match.</li> </ul> If�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was not found,�!�!span class="d_inlinecode donthyphenate notranslate">result[0]<ztpan> comprehends�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> entirely and�!�!span class="d_inlinecode donthyphenate notranslate">result[1]<ztpan> is empty. <div class="blankline"></div> <code class="ddoc_psymbol">findSplitAfter</code><ztpan> returns a�4uple�!�!span class="d_inlinecode donthyphenate notranslate">result containing�4wo ranges. <ul><li>result[0]<ztpan> is the portion of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> up�4o and including the match<v�i> <li>result[1]<ztpan> is the balance of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> starting after�4he match.<v�i> <z�l> If <code class="ddoc_param">needle</code><ztpan>�7as not found, result[0] is empty and�!�!span class="d_inlinecode donthyphenate notranslate">result[1]<ztpan> is <code class="ddoc_param">haystack</code><ztpan>. </div> In all cases, the concatenation of�4he returned ranges spans�4he entire <code class="ddoc_param">haystack</code><ztpan>. <div class="blankline"><u(iv> If <code class="ddoc_param">haystack</code><ztpan> is a random-access range, all�4hree components of�4he�4uple have the same�4ype as�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode>. Otherwise, <code class="ddoc_param">haystack</code><ztpan> must be a <a href="std_range_primitives.html#.isForwardRange">forward range</a> and the�4ype of�!�!span class="d_inlinecode donthyphenate notranslate">result[0]<ztpan> (and result[o for <ztpan><code class="ddoc_psymbol">findSplit</code><ztpan>) is�4he same as the result of�!�!a href="std_range.html#.takeExactly">std.range.takeExactly<ztpan></a>. <div class="blankline"><u(iv> For more information about pred<ztpan> see�!�!a href="#find">find<t�>. <y:> </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Predicate to compare 2 elements.</td><z�r> <tr class="param"><td class="param_id">R1�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The forward range to search.</td><z�r> <tr class="param"><td class="param_id">R2�!�!code class="ddoc_param">needle</code><z�d> <td class="param_desc">The forward range to look for.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">A sub-type of�!�!a href="std_typecons.html#.Tuple">std.typecons.Tuple<ztpan></a> of the split portions of <code class="ddoc_param">haystack</code><ztpan> (see above for details). This sub-type of�!�!span class="d_inlinecode donthyphenate notranslate">Tuple<ztpan> defines�!�!span class="d_inlinecode donthyphenate notranslate">opCast�I�I�Iool<ztpan>, which returns true<ztpan>�7hen the separating�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needle<uode> was found and false otherwise. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#find">find<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Returning a subtype of <a href="std_typecons.html#.Tuple">std.typecons.Tuple<t�> enables the following convenient idiom: <pre class="d_code notranslate">]� findSplit returns a�4riplet <ztpan>if (auto<ztpan> split =�!�!span class="d_string">"dlang-rocks"<ztpan>.findSplit("-")) { writeln(split[0]);�!�!span class="d_comment">/X�"dlang" �7riteln(split[1]); ]� "-" <ztpan> writeln(split[�3�3);�!�!span class="d_comment">/X�"rocks" } else<ztpan>�!�!span class="d_keyword">assert<ztpan>(0); ]� findSplitBefore returns 2 ranges if<ztpan> (const<ztpan> split = [�(l4�) 2 2, �(l4�) 2 2, 4, 1].findSplitBefore<ztpan>�span class="d_string">"a�.�.�.gt; b"([2, �3�3)) { �7riteln(split[0]); ]� [�(l4�) 2 2, �3�3 <ztpan> ]� [0�0�0� 2 2 2] each greater�4han [2, �3�3 <ztpan> writeln(split[o);�!�!span class="d_comment">/X�[3, 4, 1] } else<ztpan>�!�!span class="d_keyword">assert<ztpan>(0); <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range.primitives : empty; auto<ztpan> a =�!�!span class="d_string">"Carl Sagan Memorial Station"<ztpan>; auto r = findSplit<ztpan>(a, "Velikovsky"<ztpan>); import<ztpan> std.typecons : isTuple; static<ztpan>�!�!span class="d_keyword">assert<ztpan>(isTuple�Ztypeof(r.asTuple))); static assert(isTuple!(typeof<ztpan>(r))); assert<ztpan>(!r); writeln(r[0]);�!�!span class="d_comment">/X�a assert<ztpan>(r[1].empty); assert(r[�3�3.empty); r =�!�!span class="d_psymbol">findSplit(a,�!�!span class="d_string">" "<ztpan>); writeln(r[0]); ]� "Carl" writeln(r[1]); ]� " " <ztpan>writeln(r[�3�3);�!�!span class="d_comment">/X�"Sagan Memorial Station" <ztpan>if (const r1 =�!�!span class="d_psymbol">findSplitBefore(a,�!�!span class="d_string">"Sagan"<ztpan>)) { �!�!span class="d_keyword">assert<ztpan>(r1); writeln(r1[0]); ]� "Carl " <ztpan> writeln(r1[1]); ]� "Sagan Memorial Station" } if<ztpan> (const<ztpan> r�(N��)= findSplitAfter(a,�!�!span class="d_string">"Sagan"<ztpan>)) { �!�!span class="d_keyword">assert<ztpan>(r�(SA�); writeln(r2[0]); ]� "Carl Sagan" �7riteln(r�3�1o);�!�!span class="d_comment">/X�" Memorial Station" } <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples">Use <a href="std_range.html#.only">std.range.only<t�> to find single elements: <pre class="d_code notranslate">import<ztpan> std.range : only; writeln([1, 2, 0�0�0� 2 2 2].findSplitBefore<ztpan>(only(0�0�0�)[0]);�!�!span class="d_comment">/X�[1, �3�3 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minCount"></div>Tuple!(ElementType�1 D�1�0ange, size_t) <ztpan><code class="ddoc_psymbol">minCount<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; <div class="quickindex" id="quickindex.maxCount"></div>Tuple!(ElementType�1 D�1�0ange, size_t) <ztpan><code class="ddoc_psymbol">maxCount<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes the minimum (respectively maximum) of <code class="ddoc_param">range<uode> along with its number of occurrences. Formally, the minimum is a�6alue�!�!span class="d_inlinecode donthyphenate notranslate">x<ztpan> in <code class="ddoc_param">range<uode> such�4hat pred(a,�8)<ztpan> is false for all values�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> in <code class="ddoc_param">range<uode>. Conversely,�4he maximum is a value x in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> such that�!�!span class="d_inlinecode donthyphenate notranslate">pred(x, a) is�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for all�6alues a in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> (note�4he swapped arguments�4o pred<ztpan>). <u(iv><div class="description">These functions may be�5sed for computing arbitrary extrema by choosing pred<ztpan> appropriately. For corrrect functioning, pred<ztpan> must be a strict partial order, i.e. transitive (if�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b)�.�.�.amp;& pred(b, c) then�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, c)) and irreflexive (pred(a, a)<ztpan> is false). The <a href="https:/u�oogle.com/search?btnI=I%�(y]�)m+Feeling+Lucky&ie=UTF-8&oe=UTF-8&q=trichotomy�0roperty of inequality">trichotomy property of inequality</a> is not required: these algorithms consider elements�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> and�!�!span class="d_inlinecode donthyphenate notranslate">b<ztpan> equal (for the purpose of counting) if pred<ztpan>�0uts them in the same equivalence class, i.e.�!�!span class="d_inlinecode donthyphenate notranslate">�ired(a, b) && !pred(b, a). </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">The ordering�0redicate�4o use to determine�4he extremum (minimum or maximum).<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">range<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a>�4o count.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The minimum, respectively maximum element of a range together�7ith the number it occurs in the range. </div></div> <div class="val">Limitations If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<ztpan></a> for examples on how�4o cope�7ith NaNs. <y:><u(iv> <div class="keyval Throws">Throws: <div class="val valThrows">Exception<ztpan> if <code class="ddoc_param">range<uode>.empty. </div></div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minIndex">minIndex<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.conv :�4ext; import<ztpan> std.typecons : tuple; int<ztpan>[] a = [ 2, 0�0�0� 2 2 2, 1, 2, 4, 1, 1, 2 ]; ]� Minimum is 1 and occurs 2 2�4imes <ztpan>writeln(a.minCount); ]��4uple(1, 0�0�0� <ztpan>]� Maximum is 4 and occurs 2�4imes <ztpan>writeln(a.maxCount); ]��4uple(4, �(SA�) <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minElement"></div>auto�!�!span class="def-anchor" id="minElement"><code class="ddoc_psymbol">minElement</code>(alias map = (a) => a, Range)<ztpan>(Range�!�!code class="ddoc_param">r<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range); auto <ztpan><code class="ddoc_psymbol">minElement<uode>(alias map = (a) => a, Range, RangeElementType = ElementType!Range)(Range <code class="ddoc_param">r</code>, RangeElementType <code class="ddoc_param">seed<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range && !is(CommonType!(ElementType�1 D�1�0ange, RangeElementType) ==�6oid))<ztpan>; </div></dt> <dd><div class="summary">Iterates the passed range and returns�4he minimal element. A custom mapping function can be�0assed to�!�!span class="d_inlinecode donthyphenate notranslate">map<ztpan>. In other languages�4his is sometimes called argmin<ztpan>. </div><div class="val">Complexity O(n) Exactly�!�!span class="d_inlinecode donthyphenate notranslate">n - �ztpan> comparisons are needed. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">map</td> <td class="param_desc">custom accessor for�4he comparison key<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">r<uode></td> <td class="param_desc">range from which the minimal element will be selected</td><z�r> <tr class="param"><td class="param_id">RangeElementType�!�!code class="ddoc_param">seed</code><z�d> <td class="param_desc">custom seed to�5se as initial element<z�d></tr> </table></div></div> <div class="val">Precondition<ztpan> If a seed is not given,�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r</code><ztpan> must not be empty. <y:><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The minimal element of the passed-in range. </div></div> <div class="val">Note<ztpan> �!�?f at least one of the arguments is NaN, the result is an�5nspecified�6alue. <div class="blankline"><u(iv> �!�?f you want�4o ignore NaNs,�9ou can�5se�!�!a href="std_algorithm_iteration.html#.filter">std.algorithm.iteration.filter<ztpan></a> and�!�!a href="std_math.html#.isNaN">std.math.isNaN<ztpan></a>�4o remove�4hem, before applying minElement. Add a suitable seed, to avoid error messages if all elements are NaNs: <div class="blankline"><u(iv> <pre class="d_code notranslate"><range>.filter!(a=>!a.isNaN).minElement<ztpan>(<seed<ztpan>>); <y:re> <div class="blankline"><u(iv> �!�?f you want�4o get NaN as a result if a NaN is present in�4he range, you can use <a href="std_algorithm_iteration.html#.fold">std.algorithm.iteration.fold<t�> and <a href="std_math.html#.isNaN">std.math.isNaN<t�>: <div class="blankline"></div> <pre class="d_code notranslate"><range>.fold�Z(a,b)=>a.isNaN || b.isNaN ?�!�!span class="d_keyword">real<ztpan>.nan : a�.�.�.lt; b ? a : b); </pre> </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#extrema">extrema<t�>,�!�!a href="#maxElement">maxElement<t�>,�!�!a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minCount">minCount<ztpan></a>, <a href="#minIndex">minIndex<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.range : enumerate; import<ztpan> std.typecons : tuple; writeln([2, 7, 1, �5p�.minElement<ztpan>);�!�!span class="d_comment">/X�1 ]� allows to get�4he index of an element�4oo <ztpan>writeln([5, 0�0�0� 5 5 5, 9].enumerate.minElement<ztpan>�span class="d_string">"a.value"<ztpan>);�!�!span class="d_comment">/X�tuple(1, 2 2) ]� any custom accessor can be passed <ztpan>writeln([[0, 2 2 2], [1, 2]].minElement<ztpan>�span class="d_string">"a[1]"); ]� [1, 2] ]� can be seeded <ztpan>int<ztpan>[] arr; writeln(arr.minElement(1));�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.maxElement"><u(iv>auto <ztpan><code class="ddoc_psymbol">maxElement<uode>(alias map = (a) => a, Range)(Range <code class="ddoc_param">r</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange)<ztpan>; auto�!�!span class="def-anchor" id="maxElement"><code class="ddoc_psymbol">maxElement</code>(alias map = (a) => a, Range, RangeElementType = ElementType�1 D�1�0ange)<ztpan>(Range�!�!code class="ddoc_param">r<uode>, RangeElementType�!�!code class="ddoc_param">seed</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& �Xs(CommonType�ZElementType!Range, RangeElementType) == void)); <u(iv><u(t> <dd><div class="summary">Iterates�4he�0assed range and returns the maximal element. A custom mapping function can be passed�4o map. In other languages this is sometimes called�!�!span class="d_inlinecode donthyphenate notranslate">argmax. <u(iv><div class="val">Complexity<ztpan> O(n) Exactly n - 1 comparisons are needed. <y:><u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">map<z�d> <td class="param_desc">custom accessor for the comparison key</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">range from�7hich�4he maximum element�7ill be selected<z�d></tr> <tr class="param"><td class="param_id">RangeElementType <code class="ddoc_param">seed<uode></td> <td class="param_desc">custom seed�4o use as initial element</td><z�r> <z�able><u(iv><u(iv> <div class="val">Precondition If a seed is not given, <code class="ddoc_param">r<uode> must not be empty. </div> <div class="keyval Returns">Returns: <div class="val valReturns">The maximal element of�4he�0assed-in range. <u(iv><u(iv> <div class="val">Note If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.minElement">std.algorithm.searching.minElement<ztpan></a> for examples on how�4o cope �7ith NaNs. <y:><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="#extrema">extrema<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<t�>,�!�!a href="#maxCount">maxCount<t�>, �!�!a href="#maxIndex">maxIndex<t�>,�!�!a href="#maxPos">maxPos<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.range : enumerate; import std.typecons :�4uple; writeln([2, 1, 2 2 2, �5p�.maxElement<ztpan>);�!�!span class="d_comment">/X�4 ]� allows to get�4he index of an element�4oo <ztpan>writeln([2, 1, 2 2 2, �5p�.enumerate.maxElement<ztpan>�span class="d_string">"a.value"<ztpan>);�!�!span class="d_comment">/X�tuple(�(l4�) 2 2 2) ]� any custom accessor can be passed <ztpan>writeln([[0, 2 2 2], [1, 2]].maxElement<ztpan>�span class="d_string">"a[1]"); ]� [0, 2 2 2] ]� can be seeded <ztpan>int<ztpan>[] arr; writeln(arr.minElement(1)); ]� 1 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <ztpan><div class="quickindex" id="quickindex.extrema"></div>ElementType!Range[�3�3�!�!span class="def-anchor" id="extrema"><ztpan><code class="ddoc_psymbol">extrema</code>(Range)(Range <code class="ddoc_param">r</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange)<ztpan>; </div></dt> <dd><div class="summary">Returns an array of�4he minimum and maximum element in <code class="ddoc_param">r<uode>. Performs�!�!span class="d_inlinecode donthyphenate notranslate">< 2 2n/�(v��)ztpan> comparisons, unlike�4he naive�!�!span class="d_inlinecode donthyphenate notranslate">< 2n<ztpan>. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Range <code class="ddoc_param">r</code><z�d> <td class="param_desc">The range to�4raverse.</td><z�r> <z�able><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">writeln(extrema([5, �(l4�) 9, 4, 1]));�!�!span class="d_comment">/X�[1, 9] <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minPos"></div>Range <ztpan><code class="ddoc_psymbol">minPos<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isForwardRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; <div class="quickindex" id="quickindex.maxPos"></div>Range <ztpan><code class="ddoc_psymbol">maxPos<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isForwardRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes a subrange of <code class="ddoc_param">range<uode> starting at the first occurrence of <code class="ddoc_param">range<uode>'s minimum (respectively maximum) and�7ith the same ending as�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>, or�4he empty range if <code class="ddoc_param">range<uode> itself is empty. <u(iv><div class="description">Formally, the minimum is a�6alue�!�!span class="d_inlinecode donthyphenate notranslate">x<ztpan> in <code class="ddoc_param">range<uode> such�4hat pred(a,�8)<ztpan> is false for all values�!�!span class="d_inlinecode donthyphenate notranslate">a<ztpan> in <code class="ddoc_param">range<uode>. Conversely,�4he maximum is a value x in <code class="ddoc_param">range</code><ztpan> such that�!�!span class="d_inlinecode donthyphenate notranslate">pred(x, a) is�!�!span class="d_inlinecode donthyphenate notranslate">false<ztpan> for all�6alues a in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> (note the swapped arguments�4o pred<ztpan>). <div class="blankline"></div> These functions may be�5sed for computing arbitrary extrema by choosing pred<ztpan> appropriately. For corrrect functioning, pred<ztpan> must be a strict partial order, i.e. transitive (if�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, b)�.�.�.amp;& pred(b, c) then�!�!span class="d_inlinecode donthyphenate notranslate">pred(a, c)) and irreflexive (pred(a, a)<ztpan> is false). <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the extremum (minimum or maximum) element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The�0osition of�4he minimum (respectively maximum) element of forward range�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>, i.e. a subrange of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan> starting at�4he�0osition of its smallest (respectively largest) element and with�4he same ending as <code class="ddoc_param">range<uode>. </div></div> <div class="val">Limitations If at least one of�4he arguments is NaN,�4he result is an unspecified value. See�!�!a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<ztpan></a> for examples on how�4o cope�7ith NaNs. <y:><u(iv> <div class="keyval SeeAlso">See Also: <div class="val valSeeAlso"><a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<t�>,�!�!a href="#minCount">minCount<t�>,�!�!a href="#minIndex">minIndex<t�>,�!�!a href="#minElement">minElement<t�><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">int[] a = [ �(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �(N��)]; /X�Minimum is 1 and first occurs in�0osition 0�0�0�writeln(a.minPos<ztpan>);�!�!span class="d_comment">/X�[1, �(l4�) 2 2 2, 1, 1, �3�3 <ztpan>]� Maximum is 4 and first occurs in position 2 <ztpan>writeln(a.maxPos); ]� [4, 1, �(l4�) 2 2 2, 1, 1, �3�3 <ztpan></pre> <u(iv><u(iv> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.minIndex"></div>ptrdiff_t <ztpan><code class="ddoc_psymbol">minIndex<uode>(alias�0red = "a�.�.�.lt; b", Range)(Range <code class="ddoc_param">range</code>) if (isInputRange!Range && !isInfinite�1 D�1�0ange�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">range<uode>.front, <code class="ddoc_param">range</code>.front))))<ztpan>; </div></dt> <dd><div class="summary">Computes the index of�4he first occurrence of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>'s minimum element. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the minimum element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="val">Complexity Ο(range.length<ztpan>)<ztpan> Exactly�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code>.length - 1 comparisons are needed. <y:><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The index of the first encounter of�4he minimum element in <code class="ddoc_param">range<uode>.�!�?f the <code class="ddoc_param">range<uode> is empty, -1 is returned. <u(iv><u(iv> <div class="val">Limitations<ztpan> If at least one of the arguments is NaN, the result is an�5nspecified�6alue. See <a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<t�> for examples on how to cope with NaNs. </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#maxIndex">maxIndex<t�>,�!�!a href="std_algorithm_comparison.html#.min">std.algorithm.comparison.min<ztpan></a>, <a href="#minCount">minCount<ztpan></a>, <a href="#minElement">minElement<ztpan></a>, <a href="#minPos">minPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">int<ztpan>[] a = [�(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �3�3; /X�Minimum is 1 and first occurs in�0osition 0�0�0�writeln(a.minIndex<ztpan>);�!�!span class="d_comment">/X�0�0�0�/X�Get maximum index with minIndex writeln(a.minIndex<ztpan>�span class="d_string">"a�.�.�.gt; b"); ]� 2 <ztpan> /X�Range is empty, so return value is -1 int[] b; writeln(b.minIndex<ztpan>);�!�!span class="d_comment">/X�-1 <ztpan> /X�Works with more custom�4ypes <ztpan>struct Dog { int<ztpan> age; } Dog[] dogs = [Dog(10), Dog(5), Dog(15)]; writeln(dogs.minIndex!"a.age < b.age"<ztpan>);�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.maxIndex"><u(iv>ptrdiff_t�!�!span class="def-anchor" id="maxIndex"><code class="ddoc_psymbol">maxIndex</code>(alias pred = "a < b"+"+ Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>) if (isInputRange�1 D�1�0ange�.�.�.amp;& �XsInfinite!Range && is(typeof(binaryFun�ired(<code class="ddoc_param">range</code>.front,�!�!code class="ddoc_param">range<uode>.front)))); <u(iv><u(t> <dd><div class="summary">Computes�4he index of the first occurrence of <code class="ddoc_param">range<uode>'s maximum element. <u(iv><div class="val">Complexity<ztpan> Ο(range<ztpan>)<ztpan> Exactly�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code>.length - 1 comparisons are needed. <y:><u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The ordering predicate to�5se�4o determine the maximum element.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">range</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isInputRange">input range<t�> to search.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">The index of the first encounter of�4he maximum in <code class="ddoc_param">range<uode>.�!�?f the <code class="ddoc_param">range<uode> is empty, -1 is returned. <u(iv><u(iv> <div class="val">Limitations<ztpan> If at least one of the arguments is NaN, the result is an�5nspecified�6alue. See <a href="std_algorithm_searching.html#.maxElement">std.algorithm.searching.maxElement<t�> for examples on how to cope with NaNs. </div> <div class="keyval SeeAlso">See Also:<ztpan>�!�!div class="val�6alSeeAlso"><a href="#minIndex">minIndex<t�>,�!�!a href="std_algorithm_comparison.html#.max">std.algorithm.comparison.max<ztpan></a>, <a href="#maxCount">maxCount<ztpan></a>, <a href="#maxElement">maxElement<ztpan></a>, <a href="#maxPos">maxPos<ztpan></a></div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">]� Maximum is 4 and first occurs in position 2 <ztpan>int<ztpan>[] a = [�(l4�) 2 2, 4, 1, �(l4�) 2 2 2, 1, 1, �3�3; writeln(a.maxIndex); ]� 2 <ztpan> /X�Empty range int[] b; writeln(b.maxIndex<ztpan>);�!�!span class="d_comment">/X�-1 <ztpan> /X�Works with more custom�4ypes <ztpan>struct Dog { int<ztpan> age; } Dog[] dogs = [Dog(10), Dog(15), Dog(5)]; writeln(dogs.maxIndex!"a.age < b.age"<ztpan>);�!�!span class="d_comment">/X�1 <y:re> </div></div> </dd> <dt class="d_decl"><div ><ztpan><div class="quickindex" id="quickindex.skipOver"><u(iv>template <ztpan><code class="ddoc_psymbol">skipOver<uode>(alias�0red = (a, b) => a == b) </div></dt> <dd><div class="summary">Skip over�4he initial�0ortion of the first given range (haystack)�4hat matches any of�4he additionally given ranges (needles) fully, or if no second range is given skip over�4he elements that fulfill�0red. Do nothing if�4here is no match. </div><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">The�0redicate�4hat determines�7hether elements from each respective range match. Defaults�4o equality�!�!span class="d_inlinecode donthyphenate notranslate">"a == b".</td><z�r> <z�able><u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; auto s1 =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s1,�!�!span class="d_string">"Ha")); writeln(s1); ]� "Hello world" <ztpan>assert(skipOver(s1, "Hell"<ztpan>) && s1 ==�!�!span class="d_string">"o�7orld"<ztpan>, s1); string[] r1 = ["abc",�!�!span class="d_string">"def"<ztpan>, "hij"]; dstring[] r2 = ["abc"d<ztpan>]; assert<ztpan>(!skipOver!((a, b) => a.equal(b))(r1, ["def"d]), rm0]); writeln(r1); ]� ["abc"+"+ "def", "hij"] <ztpan>assert(skipOver!((a, b) => a.equal(b))(r1, r2)); writeln(r1);�!�!span class="d_comment">/X�["def", "hij"] <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.ascii : isWhite; import std.range.primitives : empty; auto<ztpan> s�(N��)= "\t\tvalue"; auto<ztpan> s0�0�0�0�0�= ""<ztpan>; auto s4 =�!�!span class="d_string">"\t\t\t"; assert<ztpan>(s�(��)skipOver!isWhite && s�(N��)==�!�!span class="d_string">"value"<ztpan>); assert<ztpan>(!s3.skipOver<ztpan>�XsWhite); assert<ztpan>(s4.skipOver!isWhite && s0�0�0�0�0�empty); </pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples">Variadic skipOver <pre class="d_code notranslate">auto<ztpan> s =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s, "hello",�!�!span class="d_string">"HellO"<ztpan>)); writeln(s); ]� "Hello world" <ztpan> /X�the range is skipped over the longest matching needle is skipped <ztpan>assert(skipOver(s,�!�!span class="d_string">"foo"<ztpan>, "hell"<ztpan>, "Hello "<ztpan>)); writeln(s); ]� "world" <ztpan></pre> <u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; auto s1 =�!�!span class="d_string">"Hello�7orld"<ztpan>; assert(�span class="d_psymbol">skipOver<ztpan>(s1, 'a')); writeln(s1);�!�!span class="d_comment">/X�"Hello�7orld" assert<ztpan>(skipOver<ztpan>(s1, 'H') && s1 ==�!�!span class="d_string">"ello world"); string[] r = ["abc"<ztpan>, "def",�!�!span class="d_string">"hij"<ztpan>]; dstring e =�!�!span class="d_string">"abc"d; assert<ztpan>(!skipOver!((a, b) => a.equal(b))(r,�!�!span class="d_string">"def"d)); writeln(r);�!�!span class="d_comment">/X�["abc", "def"+"+ "hij"] assert<ztpan>(skipOver<ztpan>�Z(a, b) => a.equal(b))(r, e)); writeln(r);�!�!span class="d_comment">/X�["def", "hij"] <ztpan> auto<ztpan> s�(N��)= ""<ztpan>; assert(�i�v�(��)skipOver('a')); <y:re> </div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples">Partial instantiation <pre class="d_code notranslate">import std.ascii : isWhite; import<ztpan> std.range.primitives : empty; alias<ztpan>�7hitespaceSkiper = skipOver!isWhite; auto s2 =�!�!span class="d_string">"\t\tvalue"<ztpan>; auto s3 =�!�!span class="d_string">""; auto<ztpan> s4 = "\t\t\t"<ztpan>; assert(whitespaceSkiper(s�(SA�)�.�.�.amp;& s2 == "value"); assert(�v�i�i�ihitespaceSkiper(s2)); assert(whitespaceSkiper(s4)�.�.�.amp;& s3.empty); <y:re> </div></div> <dl><dt class="d_decl"><div ><div class="quickindex" id="quickindex.skipOver.skipOver"><u(iv>bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(Haystack, Needles...)(ref Haystack�!�!code class="ddoc_param">haystack</code>, Needles�!�!code class="ddoc_param">needles<uode>) if (is(typeof(binaryFun!pred(<code class="ddoc_param">haystack</code>.front,�!�!code class="ddoc_param">needles<uode>[0].front)))�.�.�.amp;& isForwardRange�iaystack && allSatisfy!(isInputRange, Needles) && !is(CommonType!(staticMap�ZElementType, staticMap�ZUnqual, Needles))) == void)); bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(R)<ztpan>(ref R�!�!code class="ddoc_param">r1</code>) if (isForwardRange!R && ifTestable!(typeof(<code class="ddoc_param">r�uode>.front),�5naryFun!pred)); bool <ztpan><code class="ddoc_psymbol">skipOver<uode>(R, Es...)(ref R <code class="ddoc_param">r</code>, Es <code class="ddoc_param">es<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">r<uode>.front, <code class="ddoc_param">es<uode>[0]))))<ztpan>; </div></dt> <dd><div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">Haystack�!�!code class="ddoc_param">haystack</code><z�d> <td class="param_desc">The <a href="std_range_primitives.html#.isForwardRange">forward range<t�> to move forward.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">needles<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input ranges<t�> representing�4he�0refix of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">r�uode> to skip over.<z�d></tr> <tr class="param"><td class="param_id">Es <code class="ddoc_param">es<uode></td> <td class="param_desc">The element�4o match.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">true if�4he�0refix of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">haystack<uode> matches any range of�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">needles</code><ztpan> fully or pred<ztpan> evaluates�4o true, and <code class="ddoc_param">haystack</code><ztpan> has been advanced�4o the point past�4his segment; otherwise false, and <code class="ddoc_param">haystack</code><ztpan> is left in its original�0osition. </div></div> <div class="val">Note<ztpan> By definition, empty ranges are matched fully and if <code class="ddoc_param">needles<uode> contains an empty range, �!�!span class="d_inlinecode donthyphenate notranslate"><ztpan><code class="ddoc_psymbol">skipOver<uode> will return true<ztpan>.<y:><u(iv> <u(d> <u(l> <u(d> <dt class="d_decl"><div� <div class="quickindex" id="quickindex.startsWith"></div>uint�!�!span class="def-anchor" id="startsWith"><code class="ddoc_psymbol">startsWith</code>(alias pred = (a, b) => a == b, Range, Needles...)(Range <code class="ddoc_param">doesThisStart</code>, Needles�!�!code class="ddoc_param">withOneOfThese</code>) if (isInputRange!Range && (Needles.length�.�.�.gt; 1)�.�.�.amp;& allSatisfy�ZcanTestStartsWith!(pred, Range), Needles)); bool <ztpan><code class="ddoc_psymbol">startsWith<uode>(alias�0red = "a == b", R1, R2)<ztpan>(R1 <code class="ddoc_param">doesThisStart</code>, R�(N��)<code class="ddoc_param">withThis<uode>) if (isInputRange�1 D�1�01 && isInputRange!R2�.�.�.amp;& is(typeof(binaryFun!pred(<code class="ddoc_param">doesThisStart<uode>.front, <code class="ddoc_param">withThis<uode>.front)) : bool))<ztpan>; bool�!�!span class="def-anchor" id="startsWith"><code class="ddoc_psymbol">startsWith</code>(alias pred = "a == b"+"+ R, E)(R <code class="ddoc_param">doesThisStart</code>, E�!�!code class="ddoc_param">withThis</code>) if (isInputRange!R && is(typeof(binaryFun�ired(<code class="ddoc_param">doesThisStart</code>.front,�!�!code class="ddoc_param">withThis</code>)) : bool)); bool <ztpan><code class="ddoc_psymbol">startsWith<uode>(alias�0red, R)<ztpan>(R�!�!code class="ddoc_param">doesThisStart<uode>) if (isInputRange�1 D�1�0�.�.�.amp;& ifTestable�Ztypeof(<code class="ddoc_param">doesThisStart<uode>.front),�5naryFun!pred)); <u(iv><u(t> <dd><div class="summary">Checks�7hether�4he given <a href="std_range_primitives.html#.isInputRange">input range</a> starts with (one of) the given needle(s) or, if no needles are given, if its front element fulfils predicate pred<ztpan>. </div><div class="description">For more information about pred<ztpan> see�!�!a href="#find">find<t�>. </div> <div class="keyval Parameters">Parameters:<ztpan>�!�!div class="val�6alParameters"><table class="params"><tr class="param"><td class="param_id">pred<z�d> <td class="param_desc">Predicate to�5se in comparing the elements of the haystack and�4he needle(s). Mandatory if no needles are given.</td><z�r> <tr class="param"><td class="param_id">Range <code class="ddoc_param">doesThisStart</code><z�d> <td class="param_desc">The input range to check.<z�d></tr> <tr class="param"><td class="param_id">Needles�!�!code class="ddoc_param">withOneOfThese</code><z�d> <td class="param_desc">The needles against which the range is�4o be checked, which may be individual elements or input ranges of elements.<z�d></tr> <tr class="param"><td class="param_id">R�(N��)<code class="ddoc_param">withThis<uode></td> <td class="param_desc">The single needle�4o check,�7hich may be either a single element or an input range of elements.</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">0 if the needle(s) do not occur at the beginning of�4he given range; otherwise the position of the matching needle,�4hat is, 1 if�4he range starts with�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>[0]<ztpan>, �(N��)if it starts�7ith <code class="ddoc_param">withOneOfThese</code>[o, and so on. <div class="blankline"><u(iv> In the case�7here�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">doesThisStart</code><ztpan> starts with multiple of�4he ranges or elements in�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">withOneOfThese<uode>,�4hen the shortest one matches (if�4here are two�7hich match�7hich are of the same length (e.g. "a" and 'a'), then the left-most of them in the argument list matches). <div class="blankline"><u(iv> In the case�7hen no needle parameters are given, return�!�!span class="d_inlinecode donthyphenate notranslate">true iff front of <code class="ddoc_param">doesThisStart</code><ztpan> fulfils�0redicate�!�!span class="d_inlinecode donthyphenate notranslate">pred.</div></div> <div class="keyval Examples">Examples:<ztpan>�!�!div class="val�6alExamples"><pre class="d_code notranslate">import std.ascii : isAlpha; assert("abc".startsWith!(a => a.isAlpha)); assert("abc".startsWith!isAlpha); assert(�span class="d_string">"1ab"<ztpan>.startsWith<ztpan>�Za => a.isAlpha)); assert<ztpan>(!""<ztpan>.startsWith<ztpan>�Za => a.isAlpha)); import std.algorithm.comparison : among; assert("abc".startsWith!(a => a.among('a', 'b') != 0)); assert<ztpan>(!"abc".startsWith!(a => a.among('b', 'c') != 0)); assert(startsWith("abc",�!�!span class="d_string">"")); assert<ztpan>(startsWith<ztpan>("abc"<ztpan>, "a")); assert<ztpan>(!startsWith("abc",�!�!span class="d_string">"b"<ztpan>)); writeln(startsWith("abc", 'a', "b"));�!�!span class="d_comment">/X�1 writeln(startsWith<ztpan>("abc"<ztpan>, "b",�!�!span class="d_string">"a"<ztpan>)); ]� 2 <ztpan>writeln(startsWith("abc",�!�!span class="d_string">"a"<ztpan>, "a"));�!�!span class="d_comment">/X�1 writeln(startsWith<ztpan>("abc"<ztpan>, "ab"<ztpan>, "a"));�!�!span class="d_comment">/X��(�)writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"a"<ztpan>, "b"));�!�!span class="d_comment">/X��(�)writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aa",�!�!span class="d_string">"ab"));�!�!span class="d_comment">/X�0�0�0�writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aaa"<ztpan>, "sab"));�!�!span class="d_comment">/X�0 writeln(startsWith<ztpan>("abc"<ztpan>, "x",�!�!span class="d_string">"aaa"<ztpan>, "a",�!�!span class="d_string">"sab"<ztpan>)); ]� 2 2 <ztpan> import<ztpan> std.typecons : Tuple; alias C = Tuple!(int,�!�!span class="d_string">"x"<ztpan>, int<ztpan>, "y"); assert(startsWith!"a.x == b"<ztpan>([ C(1,1), C(1,2), C(2,2) ], [1, 1])); writeln(startsWith<ztpan>�span class="d_string">"a.x == b"([C(1, 1), C(�(l4�) 1), C(2, �(SA�)], [1, 1], [1, 2], [1, 2 2]));�!�!span class="d_comment">/X��(�)<y:re> </div></div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.OpenRight"><u(iv>alias�!�!span class="def-anchor" id="OpenRight"><ztpan><code class="ddoc_psymbol">OpenRight</code> = std.typecons.Flag!"openRight".Flag; </div></dt> <dd><div class="summary">Interval option specifier for�!�!span class="d_inlinecode donthyphenate notranslate">until<ztpan> (below) and others. <u(iv><div class="description">If set�4o <ztpan><code class="ddoc_psymbol">OpenRight</code>.yes<ztpan>, then�4he interval is open to�4he right (last element is not included). <div class="blankline"></div> Otherwise if set�4o <ztpan><code class="ddoc_psymbol">OpenRight</code>.no,�4hen the interval is closed�4o the right including the entire sentinel.</div> </dd> <dt class="d_decl"><div ><div class="quickindex" id="quickindex.until"><u(iv>Until�Zpred, Range, Sentinel)�!�!span class="def-anchor" id="until"><ztpan><code class="ddoc_psymbol">until</code>(alias pred = "a == b"+"+ Range, Sentinel)<ztpan>(Range�!�!code class="ddoc_param">range<uode>, Sentinel�!�!code class="ddoc_param">sentinel</code>, OpenRight�!�!code class="ddoc_param">openRight<uode> = Yes.<code class="ddoc_param">openRight<uode>) if (�Xs(Sentinel == OpenRight))<ztpan>; Until!(pred, Range, void) <code class="ddoc_psymbol">until<uode>(alias�0red, Range)<ztpan>(Range�!�!code class="ddoc_param">range<uode>, OpenRight <code class="ddoc_param">openRight</code> = Yes.<code class="ddoc_param">openRight</code>); <ztpan><div class="quickindex" id="quickindex.Until"></div>struct�!�!span class="def-anchor" id="Until"><ztpan><code class="ddoc_psymbol">Until</code>(alias pred, Range, Sentinel) if (isInputRange!Range); </div></dt> <dd><div class="summary">Lazily iterates�!�!span class="d_inlinecode donthyphenate notranslate"><code class="ddoc_param">range</code><ztpan>�5ntil�4he element�!�!span class="d_inlinecode donthyphenate notranslate">e<ztpan> for�7hich pred(e, <code class="ddoc_param">sentinel<uode>)<ztpan> is true. </div><div class="description">This is similar�4o takeWhile in other languages. <u(iv> <div class="keyval Parameters">Parameters: <div class="val valParameters"><table class="params"><tr class="param"><td class="param_id">pred</td> <td class="param_desc">Predicate�4o determine when�4o stop.<z�d></tr> <tr class="param"><td class="param_id">Range�!�!code class="ddoc_param">range<uode></td> <td class="param_desc">The�!�!a href="std_range_primitives.html#.isInputRange">input range</a> �4o iterate over.<z�d></tr> <tr class="param"><td class="param_id">Sentinel <code class="ddoc_param">sentinel<uode></td> <td class="param_desc">The element�4o stop at.</td><z�r> <tr class="param"><td class="param_id">OpenRight <code class="ddoc_param">openRight</code><z�d> <td class="param_desc">Determines�7hether�4he element for�7hich�4he given�0redicate is true should be included in�4he resulting range (No.<code class="ddoc_param">openRight</code><ztpan>), or not (Yes.<code class="ddoc_param">openRight</code><ztpan>).</td><z�r> <z�able><u(iv><u(iv> <div class="keyval Returns">Returns:<ztpan>�!�!div class="val�6alReturns">An <a href="std_range_primitives.html#.isInputRange">input range<t�> that iterates over�4he original range's elements, but ends�7hen the specified predicate becomes true. If�4he original range is a �!�!a href="std_range_primitives.html#.isForwardRange">forward range</a> or higher, this range�7ill be a forward range.<u(iv><u(iv> <ztpan><div class="keyval Examples">Examples: <div class="val valExamples"><pre class="d_code notranslate">import<ztpan> std.algorithm.comparison : equal; import<ztpan> std.typecons : No; int<ztpan>[] a = [ 1, �(l4�) 2 2 2, 7, 5 5 5, �(l4�) 2 2 2, 7, 2 2, 5]; assert(equal(a.until<ztpan>(7), [1, 2, 4])); assert(equal(a.until<ztpan>(7, No.openRight), [1, �(l4�) 2 2 2, 7])); </pre> <u(iv><u(iv> <u(d> <u(l> <div class="smallprint" id="copyright">Copyright�.�.�.copy; 99-2025 by�4he�!�!a href="..u�oundation_overview.html">D Language Foundation</a>�= Page generated by <a href="..ztpec/ddoc.html">Ddoc<t�> on Fri Oct 10 �(g �):1SE�(y>�) 2025 �<u(iv> </div> <u(iv> �!�!script�4ype="text/javascript" src="https:/t�jax.googleapis.comt�jax/libsv�query/1.7.�(W�)jquery.min.js"><ztcript> �!�!script�4ype="text/javascript">window.jQuery || document.write('\x3Cscript src="../jsv�query-1.7.�(��)min.js">\x0�0�0�0�ztcript>');<ztcript> �!�!script�4ype="text/javascript" src="../jsu(lang.js"><ztcript> � <script type="textv�avascript" src="..v�s/codemirror-compressed.js"></script> <script type="textv�avascript" src="..v�s/run.js"></script> <script type="textv�avascript" src="..v�s/run_examples.js"><ztcript> <script type="textv�avascript" src="..v�s/listanchors.js"></script> <script type="textv�avascript" src="..v�s/show_contributors.js"></script> <script type="textv�avascript">jQuery(document).ready(listanchors);<ztcript> <link rel="stylesheet" href="https:]�maxcdn.bootstrapcdn.com/font-awesome^.4.0ussu�ont-awesome.min.css"> </body> </html> �<�/�d�i�v�>�<�d�i�v� �c�l�a�s�s�=�"�n�a�k�e�d�_�c�t�r�l�"�>� �<�f�o�r�m� �a�c�t�i�o�n�=�"�/�i�n�d�e�x�.�c�g�i�/�l�a�r�g�e�r�-�t�e�x�t�"� �m�e�t�h�o�d�=�"�g�e�t�"� �n�a�m�e�=�"�g�a�t�e�"�>� �<�p�>�<�a� �h�r�e�f�=�"�h�t�t�p�:�/�/�a�l�t�s�t�y�l�e�.�a�l�f�a�s�a�d�o�.�n�e�t�"�>�A�l�t�S�t�y�l�e�<�/�a�>� 0k0�0c0fY c�0U0�0_0�0�0�� <�a� �h�r�e�f�=�"�h�t�t�p�s�:�/�/�d�l�a�n�g�.�o�r�g�/�p�h�o�b�o�s�/�s�t�d�_�a�l�g�o�r�i�t�h�m�_�s�e�a�r�c�h�i�n�g�.�h�t�m�l�"�>�(�-�&�g�t�;0�0�0�0�0��)�<�/�a�>� �/� �<�l�a�b�e�l�>0�0�0�0��:� �<�i�n�p�u�t� �t�y�p�e�=�"�t�e�x�t�"� �n�a�m�e�=�"�n�a�k�e�d�_�p�o�s�t�_�u�r�l�"� �v�a�l�u�e�=�"�h�t�t�p�s�:�/�/�d�l�a�n�g�.�o�r�g�/�p�h�o�b�o�s�/�s�t�d�_�a�l�g�o�r�i�t�h�m�_�s�e�a�r�c�h�i�n�g�.�h�t�m�l�"� �s�i�z�e�=�"�2�2�"� �/�>�<�/�l�a�b�e�l�>� �<�l�a�b�e�l�>0�0�0��:� �<�s�e�l�e�c�t� �n�a�m�e�=�"�n�a�k�e�d�_�p�o�s�t�_�m�o�d�e�"�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�d�e�f�a�u�l�t�"�>0�0�0�0�0��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�s�p�e�e�c�h�"�>��X�0�0�0�0��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�r�u�b�y�"�>0�0�N�0M�<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�c�o�n�t�r�a�s�t�"�>�M�rS͎��<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�l�a�r�g�e�r�-�t�e�x�t�"� �s�e�l�e�c�t�e�d�=�"�s�e�l�e�c�t�e�d�"�>e�[Wb�Y'�<�/�o�p�t�i�o�n�>� �<�o�p�t�i�o�n� �v�a�l�u�e�=�"�m�o�b�i�l�e�"�>0�0�0�0��<�/�o�p�t�i�o�n�>� �<�/�s�e�l�e�c�t�>� �<�i�n�p�u�t� �t�y�p�e�=�"�s�u�b�m�i�t�"� �v�a�l�u�e�=�"�hy:�"� �/�>� �<�/�p�>� �<�/�f�o�r�m�>� �<�/�d�i�v�>� � �