Konstantin Shegunov wrote: > (a static array should serve you perfectly fine).
Yes, true. Presuming the enum values assigned by the compiler and thus 0-based and incremented by 1. > It would mean the binary tree to be degenerate, and > ultimately you'd get a rebalancing with each insert. I didn't read the algorithmic complexity section and wasn't encumbered with a particular amount of relevant background on the container classes either. Thus, the claim that "With QMap, the items are always sorted by key" made it seem somewhat more appropriate for a case where you get the keys in sorted order simply by copy/paste. R. _______________________________________________ Interest mailing list Interest@qt-project.org http://lists.qt-project.org/mailman/listinfo/interest
