Comparing various implementations of sorted STL containers.
(C++11, Boost) * (sizes: 25, 100, 250) * (random, forward, reverse) * (10000 run) :
- filling
- full copy
- 1000 random find
- (futur) 10 random insertion
- (futur) 10 random removal
Copyright (c) 2013 SĂ©bastien Rombauts (sebastien.rombauts@gmail.com)
### Get Google Test submodule
git submodule init
git submodule update
### Typical generic build (see also "build.bat" or "./build.sh")
mkdir build
cd build
cmake .. # cmake .. -G "Visual Studio 10" # for Visual Studio 2010
cmake --build . # make
ctest . # make test
### Debug build
mkdir Debug
cd Debug
cmake .. -G "Unix Makefiles" -DCMAKE_BUILD_TYPE=Debug
cmake --build . # make
ctest . # make test
### Release build
mkdir Release
cd Release
cmake .. -G "Unix Makefiles" -DCMAKE_BUILD_TYPE=Release
cmake --build . # make
ctest . # make test
### Continuous Integration
This project is continuously tested under Ubuntu Linux with the gcc and clang compilers using the Travis CI community service with the above CMake building and testing procedure.
Detailed results can be seen online: https://travis-ci.org/SRombauts/sorted-vector