| 211 | // (we could also use random data) |
| 212 | template <typename Vector, typename T = typename Vector::value_type> |
| 213 | ARROW_NOINLINE void BenchmarkShortVectorInsert(benchmark::State& state, |
| 214 | const std::vector<T>& src) { |
| 215 | constexpr int kNumIters = 1000; |
| 216 | |
| 217 | for (auto _ : state) { |
| 218 | int64_t dummy = 0; |
| 219 | for (int i = 0; i < kNumIters; ++i) { |
| 220 | Vector vec; |
| 221 | vec.reserve(4); |
| 222 | vec.insert(vec.begin(), src.begin(), src.begin() + 2); |
| 223 | vec.insert(vec.begin(), src.begin() + 2, src.end()); |
| 224 | dummy += reinterpret_cast<intptr_t>(vec.data()); |
| 225 | benchmark::ClobberMemory(); |
| 226 | } |
| 227 | benchmark::DoNotOptimize(dummy); |
| 228 | } |
| 229 | |
| 230 | state.SetItemsProcessed(state.iterations() * kNumIters * 4); |
| 231 | } |
| 232 | |
| 233 | template <typename Vector> |
| 234 | void ShortVectorInsert(benchmark::State& state) { |