1 /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /*
3 * Copyright 2017 Couchbase, Inc
4 *
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17
18 /*
19 * Benchmarks relating to the Item class.
20 */
21
22 #include "item.h"
23
24 #include <benchmark/benchmark.h>
25
26 #include <algorithm>
27
BM_CompareQueuedItemsBySeqnoAndKey(benchmark::State& state)28 static void BM_CompareQueuedItemsBySeqnoAndKey(benchmark::State& state) {
29 std::vector<queued_item> items;
30 // Populate with N items with distinct keys
31 for (size_t i = 0; i < 10000; i++) {
32 auto key = std::string("key_") + std::to_string(i);
33 items.emplace_back(
34 new Item(DocKey(key, DocNamespace::DefaultCollection),
35 {},
36 {},
37 "data",
38 4));
39 }
40 CompareQueuedItemsBySeqnoAndKey cq;
41 while (state.KeepRunning()) {
42 // shuffle (while timing paused)
43 state.PauseTiming();
44 std::random_shuffle(items.begin(), items.end());
45 state.ResumeTiming();
46
47 // benchmark
48 std::sort(items.begin(), items.end(), cq);
49 }
50 }
51 // Register the function as a benchmark
52 BENCHMARK(BM_CompareQueuedItemsBySeqnoAndKey);
53