This document is a work in progress. This page documents results obtained for the performance tests located at Legend hot: hot_set<int> with tombstone -1 hoc: hoc_set<int, -1> uno: unordered_set<int> set: set<int> Test 1: simple insertion test Test 2: insert, query, and conditionally erase

Experiments in partition and remove

The C++ Standard Library exposes dozens of powerful algorithms for use in everyday software. Two of these algorithms, partition and remove_if, provide similar functionality for segregating data. If we dig carefully into implementations of these algorithms, a certain symmetry is exposed. This exploration will lead us to the discovery of useful algorithms that we can […]