From: Markus S. <mar...@gm...> - 2007-02-26 16:40:50
|
On 2/25/07, Andy Heninger <and...@gm...> wrote: > I'm kind of uneasy about having the smallish size limitations on the > strings. While I was never a huge fan of strings in sets in the first > place, it seems to me that if we are going to have them, that they > ought to be reasonably free of arbitrary limits. I am coming around to this. My current thinking is to make something work, but slowly, for all kinds of sets, and then optimize for "sane" sets with sane numbers and lengths of strings. I am also trying to collect known and reasonable use cases for strings in UnicodeSet. > As for matching algorithms, the one that Deborah found in a regexp > paper would be a good fit for this application, I think. > http://swtch.com/~rsc/regexp/regexp1.html Thanks, I will read that. markus |