| 239 | |
| 240 | template <typename Vector> |
| 241 | ARROW_NOINLINE void BenchmarkVectorInsertAtEnd(benchmark::State& state, |
| 242 | const int nitems) { |
| 243 | using T = typename Vector::value_type; |
| 244 | constexpr int kNumIters = 1000; |
| 245 | |
| 246 | ARROW_CHECK_LE(static_cast<size_t>(nitems), Vector{}.max_size()); |
| 247 | ARROW_CHECK_EQ(nitems % 2, 0); |
| 248 | |
| 249 | std::vector<T> src; |
| 250 | for (int j = 0; j < nitems / 2; ++j) { |
| 251 | src.push_back(ValueInitializer<T>(j)); |
| 252 | } |
| 253 | |
| 254 | for (auto _ : state) { |
| 255 | int64_t dummy = 0; |
| 256 | for (int i = 0; i < kNumIters; ++i) { |
| 257 | Vector vec; |
| 258 | vec.reserve(nitems); |
| 259 | vec.insert(vec.end(), src.begin(), src.end()); |
| 260 | vec.insert(vec.end(), src.begin(), src.end()); |
| 261 | dummy += reinterpret_cast<intptr_t>(vec.data()); |
| 262 | benchmark::ClobberMemory(); |
| 263 | } |
| 264 | benchmark::DoNotOptimize(dummy); |
| 265 | } |
| 266 | |
| 267 | state.SetItemsProcessed(state.iterations() * kNumIters * nitems); |
| 268 | } |
| 269 | |
| 270 | template <typename Vector> |
| 271 | void ShortVectorInsertAtEnd(benchmark::State& state) { |