merge(3p/immer): Subtree merge at 'ad3e3556d' as 'third_party/immer' r/1299

Change-Id: I9636a41ad44b4218293833fd3e9456d9b07c731b

1 files changed, 142 insertions, 0 deletions

diff --git a/third_party/immer/benchmark/vector/drop.hpp b/third_party/immer/benchmark/vector/drop.hpp
new file mode 100644
index 000000000000..0a525f67a50a
--- /dev/null
+++ b/third_party/immer/benchmark/vector/drop.hpp
@@ -0,0 +1,142 @@
+//
+// immer: immutable data structures for C++
+// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
+//
+// This software is distributed under the Boost Software License, Version 1.0.
+// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
+//
+
+#pragma once
+
+#include "benchmark/vector/common.hpp"
+
+namespace {
+
+template <typename Vektor,
+          typename PushFn=push_back_fn>
+auto benchmark_drop()
+{
+    return [] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+
+        auto v = Vektor{};
+        for (auto i = 0u; i < n; ++i)
+            v = PushFn{}(std::move(v), i);
+
+        measure(meter, [&] {
+            for (auto i = 0u; i < n; ++i)
+                (void) v.drop(i);
+        });
+    };
+}
+
+template <typename Vektor,
+          typename PushFn=push_back_fn>
+auto benchmark_drop_lin()
+{
+    return [] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+
+        auto v = Vektor{};
+        for (auto i = 0u; i < n; ++i)
+            v = PushFn{}(std::move(v), i);
+
+        measure(meter, [&] {
+            auto r = v;
+            for (auto i = 0u; i < n; ++i)
+                r = r.drop(1);
+            return r;
+        });
+    };
+}
+
+template <typename Vektor,
+          typename PushFn=push_back_fn>
+auto benchmark_drop_move()
+{
+    return [] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+
+        auto v = Vektor{};
+        for (auto i = 0u; i < n; ++i)
+            v = PushFn{}(std::move(v), i);
+
+        measure(meter, [&] {
+            auto r = v;
+            for (auto i = 0u; i < n; ++i)
+                r = std::move(r).drop(1);
+            return r;
+        });
+    };
+}
+
+template <typename Vektor,
+          typename PushFn=push_back_fn>
+auto benchmark_drop_mut()
+{
+    return [] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+
+        auto vv = Vektor{};
+        for (auto i = 0u; i < n; ++i)
+            vv = PushFn{}(std::move(vv), i);
+
+        measure(meter, [&] {
+            auto v = vv.transient();
+            for (auto i = 0u; i < n; ++i)
+                (void) v.drop(1);
+        });
+    };
+}
+
+template <typename Fn>
+auto benchmark_drop_librrb(Fn make)
+{
+    return [=] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+        auto v = make(n);
+        measure(meter, [&] {
+                for (auto i = 0u; i < n; ++i)
+                    rrb_slice(v, i, n);
+            });
+    };
+}
+
+template <typename Fn>
+auto benchmark_drop_lin_librrb(Fn make)
+{
+    return [=] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+        auto v = make(n);
+        measure(meter, [&] {
+                auto r = v;
+                for (auto i = 0u; i < n; ++i)
+                    r = rrb_slice(r, 1, n);
+                return r;
+            });
+    };
+}
+
+template <typename Fn>
+auto benchmark_drop_mut_librrb(Fn make)
+{
+    return [=] (nonius::chronometer meter)
+    {
+        auto n = meter.param<N>();
+        auto v = make(n);
+        measure(meter, [&] {
+                auto r = rrb_to_transient(v);
+                for (auto i = 0u; i < n; ++i)
+                    r = transient_rrb_slice(r, 1, n);
+                return r;
+            });
+    };
+}
+
+} // anonymous namespace