Thank you for your answers. I tried this approach (which yields much more elegant rules), but i'm afraid it does not perform very well. If I insert 10000 Offers and then 1 bid, it takes too much time to execute. If understand correctly it's because of the "not Offer(creationTimestamp < $ct)" clause in the LHS, which forces a comparison of every matching Offer against every other Offer.
The motivation for my original post was to find a way of achieving the results of an accumulator without having to sort all the matching Offers by creationTimestamp. Going back to that first approach (using an accumulator), I found that Drools feeds the accumulator with the matching Offers in reverse order (ie, newest first, LIFO). Is this a natural consequence of the way facts are stored in the working memory or is there a way of changing this behaviour (so that oldest are feeded first, FIFO)? Thanks again - Andres -- View this message in context: http://drools-java-rules-engine.46999.n3.nabble.com/Rule-using-accumulate-tp757311p761181.html Sent from the Drools - User mailing list archive at Nabble.com. _______________________________________________ rules-users mailing list rules-users@lists.jboss.org https://lists.jboss.org/mailman/listinfo/rules-users
