[libcxx-commits] [libcxx] [libc++] Fold deque iterator benchmarks into algorithm benchmarks (PR #212279)

[Nikolas Klauser via libcxx-commits]

================
@@ -42,9 +42,11 @@ int main(int argc, char** argv) {
         }
       })->Range(8, 1 << 20);
     };
-    bm.operator()<std::vector<int>>("std::copy(vector<int>)", std_copy);
-    bm.operator()<std::deque<int>>("std::copy(deque<int>)", std_copy);
-    bm.operator()<std::list<int>>("std::copy(list<int>)", std_copy);
+    bm.operator()<std::vector<int>, std::vector<int>>("std::copy(vector<int>) -> std::vector<int>", std_copy);
----------------
philnik777 wrote:

I think this is ambiguous if we want to also benchmark something like `back_inserter(std::vector<int>)`, which I expect we want at some point. Maybe `-> std::vector<int>::iterator`?

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