comments on KDE performance tips

[kde-optimize@mail.kde.org]

> b. Use hashes of key strings within the red-black tree context for 
> first-try comparisons, only resorting to string comparisons in case of  a 
> tie (doesn't kjs use a technique like that?) 
 
Has anyone ever played with STL maps or a Qt equivalent?  gcc's STL 
implementation uses red-black trees IIRC...  Should function similarly to a 
"dictionary", "associative array" or a "hash" depending on your favorite of 
Perl/Python whatever. 
 
Insertion time might suck rocks compared to a list but its an interesting 
option... unless you really hate STL :). 
 
Dave