Hi,
I've put up version 0.2 of my jboss-jeops rule engine integration at
http://home.earthlink.net/~davidjencks/
This version incorporates support for storage of partial results within the
rule engine, and supplying the return value of an ejb method from the rule
engine rather than the ejb method itself. These features are used in an
example of computing transitive closure and set intersection. In less
fancy words, from a parent-child relationship we compute ancestor and
descendant (transitive closure), and from these we compute the relatives
between two starting points. (ancestor of one, descendant of other).
In ejb terms, we have an ejb Classification, with finder methods returning
subClasses and superClasses as collections. These are implemented through
normal finder methods/queries. We define findAncestors(Classification c),
but its finder only returns the supplied bean c. The rule engine
intercepts this finder call and applies a recursive rule, which has the
effect of calling findSuperClasses on successive results until no new data
is found. The results associated with the original Classification c are
then pu into a collection, which is returned as the result of the original
finder method call. Between is computed as the intersection of answers
from the Ancestor and Descendant problems.
I'm still hoping for more good, specific, real world examples of rule
engine use.
Thanks
David Jencks
_______________________________________________
Jboss-development mailing list
[EMAIL PROTECTED]
http://lists.sourceforge.net/lists/listinfo/jboss-development
