This is a follow-up to my post on code optimization. Today I did some experimenting with hashes and binary-search-trees, specifically playing with QHash and QMap in C++. According to the Qt containers algorithmic complexity documentation, QHash provides “significantly faster lookups” than QMap. Your intuition may confirm this, because you’ve heard that QHash uses a constant-time […]