I would do so, it's really simple, you can even do it in an anonymous inner class.
----- 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: [email protected] > -----Original Message----- > From: Raffaella Ventaglio [mailto:[email protected]] > Sent: Sunday, February 08, 2009 9:47 AM > To: [email protected] > 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: [email protected] For additional commands, e-mail: [email protected]
