Skip to content

feat: update benchmark #77

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yusuf601 merged 1 commit into from
Oct 7, 2025
Merged

feat: update benchmark #77

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions .github/workflows/c_test.yaml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,14 @@ jobs:
run: |
sudo apt-get update
sudo apt-get install -y cmake ninja-build g++ clang
- name: Install Google Benchmark
run: |
git clone https://github.com/google/benchmark.git
cd benchmark
cmake -E make_directory build
cmake -S . -B build -DCMAKE_BUILD_TYPE=Release -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON
cmake --build build --config Release
sudo cmake --install build

- name: Configure (CMake)
run: cmake -S . -B build -G Ninja -DCMAKE_BUILD_TYPE=Release
Expand Down
38 changes: 37 additions & 1 deletion benchmarking/benchmarking.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,6 +43,42 @@ static void BM_stl_single_push(benchmark::State& state){
benchmark::DoNotOptimize(list);
state.SetComplexityN(state.iterations());
}
}
BENCHMARK(BM_stl_single_push)->Arg(1000)->Arg(100000)->Complexity();

static void BM_My_Insert_afterI(benchmark::State& state){
for(auto _ : state){
forward_lists<int>list;
std::vector<int>v;
for(int i = 0;i < state.range(0);i++){
list.push_front(i);
}
auto pos = list.begin();
for(int i = 0;i < 1000;i++){
list.insert_after(pos,i);
}
state.SetComplexityN(state.iterations());
benchmark::DoNotOptimize(list);
}
}
BENCHMARK(BM_My_Insert_afterI)->Arg(1000)->Arg(10000)->Arg(50000)->Complexity();

BENCHMARK(BM_stl_single_push)->Arg(1000)->Arg(100000)->Complexity();

static void BM_stl_Insert_afterI(benchmark::State& state){
for(auto _ : state){
std::forward_list<int>list;
std::vector<int>v;
for(int i = 0;i < state.range(0);i++){
list.push_front(i);
}
auto pos = list.begin();
for(int i = 0;i < 1000;i++){
list.insert_after(pos,i);
}
state.SetComplexityN(state.iterations());
benchmark::DoNotOptimize(list);
}
}
BENCHMARK(BM_stl_single_push)->Arg(1000)->Arg(100000)->Complexity();
BENCHMARK(BM_stl_Insert_afterI)->Arg(1000)->Arg(10000)->Arg(50000)->Complexity();
BENCHMARK_MAIN();