|determining which bin contains which string firstname.lastname@example.org (Partha Saha) (2002-08-04)|
|Re: determining which bin contains which string email@example.com (VBDis) (2002-08-10)|
|Re: determining which bin contains which string firstname.lastname@example.org (Ralph Corderoy) (2002-08-14)|
|Re: determining which bin contains which string email@example.com (Grzegorz Jakacki) (2002-08-23)|
|From:||"Grzegorz Jakacki" <firstname.lastname@example.org>|
|Date:||23 Aug 2002 11:01:35 -0400|
|Posted-Date:||23 Aug 2002 11:01:35 EDT|
"Partha Saha" <email@example.com> wrote
> I have strings of length 12, the alphabets are 0-9,a,b,c,d,e,f (i.e.,
> they are "hexadecimal" strings).
> Instead of keeping a table of N rows where each row has a mapping of
> string to bin number, I am wondering if I could design a finite state
You may want to have a look at data structures for storing sets of strings.
Try googling "Patricia Trie". :-)
Return to the
Search the comp.compilers archives again.