From: julien.bessaguet@googlemail.com   
      
   { Your article lacks the context of what it's referring to.   
     Please include some quoting to establish the context. -mod }   
      
   Thanks for helping!   
      
   Indeed, I noticed that I was timing the output part, and you're right   
   that makes the processing part fall to about 2 microseconds. Now that's   
   for about 50 entries in my vector, which means that more entries is   
   going to affect significantly this value.   
      
   Hence I'm wondering if someone had something different in mind (like   
   some indexed container) which would allow to implement a similar   
   mechanism and scale the performances with an increased number of entries...   
      
      
   --   
         [ 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)