https://github.com/thephd/vlm_performance
vector versus list versus map performance for ordered list implementation
https://github.com/thephd/vlm_performance
Last synced: 6 months ago
JSON representation
vector versus list versus map performance for ordered list implementation
- Host: GitHub
- URL: https://github.com/thephd/vlm_performance
- Owner: ThePhD
- Created: 2016-02-27T13:50:22.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2016-03-03T08:27:49.000Z (almost 10 years ago)
- Last Synced: 2025-01-09T05:47:19.507Z (about 1 year ago)
- Language: HTML
- Size: 237 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Vector/List/Set performance for positional delete and unique insertion
Results are HTML graphs. Open with your favorite web browser, or compile/run the code.
Three macros control the tests that get run:
- `VLM_SIZE` => define to an integer. Default 1,000,000 (warning: takes a long time)
- `VLM_INSERTION` => define to test unique insertion time
- `VLM_DELETION` => define to test positional delete
Example compilation command:
- `g++ -std=c++14 -I"vendor/" -I"vendor\nonius\deps\nonius.deps\include" -O3 -o vlm_performance -DVLM_SIZE=1000 -DVLM_INSERTION`
You can then pass arguments to the executable.
- `-s` => number of samples to generate (should be small for high VLM_SIZE)
- `-r` => reporter type. Takes html, junit, or csv
- `-o` => output file
- For more ways to call the compiled executable, see: https://nonius.io/
Example run command:
- `main.cpp ./vlm_performance -s 10 -r html -o "vlm_performance - x64 Bench.html"`