ntroduce a @FullTextFilterDef.enableCachingWrapperFilter
whose value could be AUTOMATIC, TRUE, FALSE
HSearch could then use it's own implementation of CachingWrapperFilter
AUTOMATIC would use a wrapper when cache=true is used, and not use one when cache=false
This solution is my favorite so far, I think I will introduce it in 3.1
About caching key: it should be cached by "all elements" in a way. This is probably possible by storing an HashMap as a value containing all readers having their first elements as key.
Emmanuel Bernard added a comment - 20/Mar/08 06:06 PM ntroduce a @FullTextFilterDef.enableCachingWrapperFilter
whose value could be AUTOMATIC, TRUE, FALSE
HSearch could then use it's own implementation of CachingWrapperFilter
AUTOMATIC would use a wrapper when cache=true is used, and not use one when cache=false
This solution is my favorite so far, I think I will introduce it in 3.1
About caching key: it should be cached by "all elements" in a way. This is probably possible by storing an HashMap as a value containing all readers having their first elements as key.
New Feature
Closed
Major
Improve transparent filter caching by wrapping filters into our own CachingWrapperFilter
ntroduce a @FullTextFilterDef.enableCachingWrapperFilter
whose value could be AUTOMATIC, TRUE, FALSE
HSearch could then use it's own implementation of CachingWrapperFilter
AUTOMATIC would use a wrapper when cache=true is used, and not use one when cache=false
This solution is my favorite so far, I think I will introduce it in 3.1
About caching key: it should be cached by "all elements" in a way. This is probably possible by storing an HashMap as a value containing all readers having their first elements as key.