From: DrDiettrich1@aol.com   
      
   Hans-Peter Diettrich schrieb:   
      
   > A string tree might give the best lookup performance.   
      
   > [If there's a lot of strings, a patricia trie might be faster than   
   > hashing or binary search since it doesn't require repeated scans of   
   > the string during the match process. -John]   
      
   Thanks for the "patricia trie" term :-)   
   Wikipedia redirects it to "Radix tree".   
      
   This is what I meant with "string tree".   
      
   DoDi   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)