libcore|Record: Use hash-based member tables for efficient lookups
Previously these used QMap, but since there is no promise of themembers being ordered, it is better to use the more efficient QHashthat has O(1) lookups.
View differences
Added by skyjake about 9 years ago
Added by
libcore|Record: Use hash-based member tables for efficient lookups
Previously these used QMap, but since there is no promise of the
members being ordered, it is better to use the more efficient QHash
that has O(1) lookups.