A C++ template library for embedded applications
Designed and maintained by
Aster Consulting Ltd

Benchmarks

The output graphs show the relative performance, with the slowest results normalised to 1.0
Two data types have been used. The first is a simple 'int', the second, a class with non-trivial constructor, copy
constructor and assignment operator.

In the graphs, lower is better.

Forward List

The benchmarks for list comprise of the following.

Push back 10,000 items. Repeat 100 times.
Erase a list of 10,000 items. Repeat 100 times.
Reverse a list of 10,000 items. Repeat 100 times.
Insert 10,000 items to a list. Repeat 100 times.

List

The benchmarks for list comprise of the following.

Push back 10,000 items. Repeat 100 times.
Erase a list of 10,000 items. Repeat 100 times.
Reverse a list of 10,000 items. Repeat 100 times.
Insert 10,000 items to a list. Repeat 100 times.

Vector


The benchmarks for vector comprise of the following.

Resize to 10,000 items. Repeat 100 times.
Push back 10,000 items. Repeat 100 times.
Erase a list of 10,000 items. Repeat 100 times.
Reverse a list of 10,000 items. Repeat 100 times.
Insert 10,000 items to a list. Repeat 100 times.