Re: [rules-users] some pointers for solution

There are a couple of ways to do this. I'm sure there's a bit more clean way than the example I'm providing, but this should get you in the right direction. It's not 100% rules, because it involves a bit of java collections trickery. (See attached project, collection_DroolsCriteriaMatch.tar.gz) The heart of it is a single rule: rule "Match" when d : Data() q : Query( size <= d.size ) Number( intValue == q.size ) from accumulate( Criteria( this memberOf d, this memberOf q ), init( int total = 0; ), action( total ++; ), reverse( total --; ), result( total ) ) then System.out.println("Match: " + d + " and " + q) ; end The Data object holds data to be queried, Query objects are asserted to match the Data, and Criteria objects can be contained in either. (With the aforementioned collections trickery that if a Criteria is contained in a Query it can be found in a Data object, but the reverse isn't true. See the Query.contains(Object) method for how that's implemented.) So the rule above basically says "There's a Data object, and all of the Query objects Criteria are contained in the Data object." There's an alternate way of doing this using eval and a bit more java fu. See the eval_DroolsCriteriaMatch.tar.gz project attached. This one's probably not optimal, though, as it's basically a brute force check of all Data objects against the asserted Query. I tried for a while to get a solution working with different criteria types from both Data and Query objects being asserted into working memory, but I couldn't get the accumulate syntax right. Anyone know of a way to do that? (I figure that would get a "pure rules" solution.) --- On Sat, 11/7/09, Wishing Carebear <wishing.carebear(a)gmail.com&gt; wrote: