From: jupitercuso4@googlemail.com   
      
   { Please limit your text to fit within 80 columns, preferably around 70,   
     so that readers don't have to scroll horizontally to read each line.   
     This article has been reformatted manually by the moderator. -mod }   
      
   I just noticed that C++0x includes unordered_map/set based on hash table.   
   They allow users to specify their own hash and compare functions. However,   
   it seems that they also include some default implementations of those   
   functions, as compilers do not complain even if I don't provide them.   
      
   My questions are   
   1. How are the performance of the default hash functions?   
   2. If I use a class defined by myself as a key, how does the default   
   hash function know how to hash my type?   
   3. Have the default functions been optimized for certain built-in types?   
   If so, what are they?   
      
   Thanks,   
   TS   
      
      
   --   
         [ See http://www.gotw.ca/resources/clcm.htm for info about ]   
         [ comp.lang.c++.moderated.    First time posters: Do this! ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)