[libcxx-commits] [libcxx] [libc++] Refactor and add benchmarks from [alg.nonmodifying] (PR #128206)

[Nikolas Klauser via libcxx-commits]

================
@@ -0,0 +1,82 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+#include <algorithm>
+#include <cstddef>
+#include <deque>
+#include <iterator>
+#include <list>
+#include <vector>
+
+#include <benchmark/benchmark.h>
+
+int main(int argc, char** argv) {
+  // Benchmark ranges::contains_subrange where we find our target starting at 25% of the elements
----------------
philnik777 wrote:

We probably also want to have a case where
- the subrange almost matches a bunch of times 
- the two ranges are the same length and are equal
- when the subrange is just a single element

https://github.com/llvm/llvm-project/pull/128206