<table border="1" cellspacing="0" cellpadding="8">
    <tr>
        <th>Issue</th>
        <td>
            <a href=https://github.com/llvm/llvm-project/issues/129326>129326</a>
        </td>
    </tr>

    <tr>
        <th>Summary</th>
        <td>
            [libc++] Optimize `std::search`
        </td>
    </tr>

    <tr>
      <th>Labels</th>
      <td>
            libc++,
            performance
      </td>
    </tr>

    <tr>
      <th>Assignees</th>
      <td>
      </td>
    </tr>

    <tr>
      <th>Reporter</th>
      <td>
          ldionne
      </td>
    </tr>
</table>

<pre>
    It seems easy to use `std::find` to find the first matching element in `std::search`, and we might be able to use `std::mismatch` afterwards.
</pre>
<img width="1" height="1" alt="" src="http://email.email.llvm.org/o/eJxskd2K3yAQxZ9Gb2SDmXxfeLEfBHrVZ9A4SSxq_jiTXbZPXxIW2sKCoHiY3-GcsURhy4hGdC-ie5P25P0oJvpw5IzSHf7T_GBFiIkUWvpUfKiTUIleE3vRPIvmeQ3Zi15f0vVUvKNaQyFWyfKyh7wpjJgwswr5v0lCW5Zd9FrAq7LZqw9UKWw7K4fKuojf2aVAN_eytCtj-bDFUyW9afzUTFaiqYdWD8M4NK3czbK4yVvo3NpNOLTTqFH7pYW6ccPa-0EGAxo6DTBC3YxdW1l0Vg9uBICpHsZatBqTDbGK8T1VR9lkIDrR1DA10MtoHUa6KwSIwS0CXu4DAl4FwAPLepRk84LXX_cmi7lIT-7cSLQ6BmL6y-bA8V7IP6juTf18cEjhN35foDxLNDvzgy4BZgHzFng_XbUcScB80b-up0c5fuHCAuY7BgmYv5K8G_gTAAD__-xjpUo">