Geoff Hutchison writes:
> At 9:29 AM +0200 4/17/00, Loic Dachary wrote:
> > I recently implemented a search algorithm (in the current mifluz package
> >from CVS file mifluz/test/search.cc) and found that it was convinient that
>
> I'll take a look. I'm not entirely sure you really want all the
> WordList methods in a ParseTree though. I can see that you might want
> the interior data (e.g. word records) available as a WordList. But I
> don't see when you would want the entire tree to look this way.
It's not the WordList it's the WordSearchDescription class (the cursor
that walks the WordList).
> I mean, as I'm envisioning it, the ParseTree will hold not only the
> WordReferences (temporarily), but the lists of results. This way the
> class could cache either set (or both), either the individual
> queries, or up at the top of the tree, the entire user query.
It makes sense.
Cheers,
--
Loic Dachary
24 av Secretan
75019 Paris
Tel: 33 1 42 45 09 16
e-mail: [EMAIL PROTECTED]
URL: http://www.senga.org/
------------------------------------
To unsubscribe from the htdig3-dev mailing list, send a message to
[EMAIL PROTECTED]
You will receive a message to confirm this.
