On Sunday 08 February 2009 09:53:00 Uwe Schindler wrote: > I would do so, it's really simple, you can even do it in an anonymous inner > class.
It is indeed simple, but it might also help to take a look at the source code of the Lucene classes involved. Regards, Paul Elschot > > ----- > UWE SCHINDLER > Webserver/Middleware Development > PANGAEA - Publishing Network for Geoscientific and Environmental Data > MARUM - University of Bremen > Room 2500, Leobener Str., D-28359 Bremen > Tel.: +49 421 218 65595 > Fax: +49 421 218 65505 > http://www.pangaea.de/ > E-mail: uschind...@pangaea.de > > > -----Original Message----- > > From: Raffaella Ventaglio [mailto:r.ventag...@gmail.com] > > Sent: Sunday, February 08, 2009 9:47 AM > > To: java-user@lucene.apache.org > > Subject: Re: Faceted search with OpenBitSet/SortedVIntList > > > > Hi Paul, > > > > One way to implement that would be to use one of the boolean combination > > > filters in contrib, BooleanFilter or ChainedFilter, and simply count > > the > > > the number of times next() returns true on the result. > > > > > > I am sorry, but I cannot understand: how can I create a BooleanFilter or a > > ChainedFilter starting from two SortedVIntList objects? > > I have not found any filter that takes an existing "DocIdSet" in its > > constructor... > > > > However I have seen that Filter interface is very easy to implement. > > Should I create a custom Filter that wraps my SortedVIntList and than use > > these filters to create a BooleanFilter? > > > > Thanks, > > Raf > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org > For additional commands, e-mail: java-user-h...@lucene.apache.org > >
