From: <jbo...@li...> - 2006-05-05 05:15:21
|
Author: mic...@jb... Date: 2006-05-05 00:33:58 -0400 (Fri, 05 May 2006) New Revision: 4098 Modified: labs/jbossrules/trunk/documentation/manual/en/Chapter-Rule_Engine/Section-Leaps_Algorithm.xml Log: some minor editing Modified: labs/jbossrules/trunk/documentation/manual/en/Chapter-Rule_Engine/Section-Leaps_Algorithm.xml =================================================================== --- labs/jbossrules/trunk/documentation/manual/en/Chapter-Rule_Engine/Section-Leaps_Algorithm.xml 2006-05-05 03:17:34 UTC (rev 4097) +++ labs/jbossrules/trunk/documentation/manual/en/Chapter-Rule_Engine/Section-Leaps_Algorithm.xml 2006-05-05 04:33:58 UTC (rev 4098) @@ -2,11 +2,11 @@ <section> <title>Leaps Algorithm</title> - <para>Leaps algorithm for production systems uses "lazy" approach to - condition evaluations. Modification of this algorithm, implemented as part - of Drools v3, makes attempt to take the best features of both Leaps and Rete + <para>Leaps algorithm for production systems uses a "lazy" approach to + condition evaluations. A modified version of this algorithm, implemented as part + of Drools v3, attempts to take the best features of both Leaps and Rete approaches in processing facts in the working memory. Leaps is not being - described here in details but only relevant sections to described how + described here in detail but only some relevant sections to described how current implementation deviates from "classical" leaps algorithm.</para> <para>The "classical" Leaps approach puts all incoming (asserted) facts on |