Michael Neale wrote: > Hi Andreas. > > The Combination monster strikes again ! > A monster indeed ;-)
> Add this as your first condition: > <java:condition>System.identityHashCode(Y) > > System.identityHashCode (X)</java:condition> > > This will ensure that only "useful" combinations are added. When I add that, > 9 tuples took about 14milliseconds, and 20 took about 1 second (!) - your > mileage may vary. Before that I was getting worse times then you (my machine > in more humble, it would seem?). Perhaps you can confirm that this is what > you need? Personally, I doubt it. Its a difficult question to answar what are the useful combinations. In constraint programming this translates in the question of what to propagate. There is a lot of knowledge that can be derived from a given knowledge base, but infering it all is in general not a very good idea. Indeed, *every* rule that fires in this particular test introduces redundant information. The extra constraints you are posing on the information infered by simple transitivity here is based on their identity hash-codes? How can that be a measure of usefulness? Besides, every run of your program will give different (indeterministic) results... But hey, that's just my idea... Chears, Pé
