| org.ofbiz.rules.engine |
|
| Java Source File Name | Type | Comment |
| Anonymous.java | Class | Title: Anonymous Variable
Description: None
Copyright (c) 1999 Steven J. |
| ArithmeticOperator.java | Class | Title: Arithmetic Operator
Description: None
Copyright (c) 1999 Steven J. |
| ArithmeticTerm.java | Interface | Title: Arithmetic Term
Description: None
Copyright (c) 1999 Steven J. |
| Atom.java | Class | Title: Atom
Description: None
Copyright (c) 1999 Steven J. |
| Axiom.java | Interface | Title: Axiom
Description: None
Copyright (c) 1999 Steven J. |
| AxiomEnumeration.java | Interface | Title: Axiom Enumeration
Description: None
Copyright (c) 1999 Steven J. |
| AxiomSource.java | Interface | Title: Axiom Source
Description: None
Copyright (c) 1999 Steven J. |
| BooleanFact.java | Class | Title: Boolean Fact
Description: None
Copyright (c) 1999 Steven J. |
| BooleanTerm.java | Interface | Title: Boolean Term
Description: None
Copyright (c) 1999 Steven J. |
| Comparison.java | Class | Title: Comparison
Description: None
Copyright (c) 1999 Steven J. |
| ComparisonTerm.java | Interface | Title: Comparison Term
Description: None
Copyright (c) 1999 Steven J. |
| ConsultingNot.java | Class | Title: Consulting Not
Description: None
Copyright (c) 1999 Steven J. |
| ConsultingStructure.java | Class | A ConsultingStructure is structure that can prove itself against an axiom source supplied with the constructor.
When a rule creates a dynamic version of itself, a normal
structure will create a ConsultingStructure counterpart
that uses the rule's scope, and that consults a given
axiom source (such as a Program).
The primary behavior that a ConsultingStructure adds
is the ability to prove itself.
author:
Steven J. |
| DynamicAxiom.java | Interface | Title: Dynamic Axiom
Description: None
Copyright (c) 1999 Steven J. |
| DynamicRule.java | Class | Title: Dynamic Rule
Description: None
Copyright (c) 1999 Steven J. |
| EmptyList.java | Class | Title: Empty List
Description: None
Copyright (c) 1999 Steven J. |
| Evaluation.java | Class | An Evaluation unifies a term with the value of another term.
For example,
NumberFact two = new NumberFact(2);
ArithmeticOperator x, y;
x = new ArithmeticOperator('*', two, two);
y = new ArithmeticOperator('+', x, two);
Variable result = new Variable("Result");
Evaluation e = new Evaluation(result, y);
System.out.println(e);
System.out.println(e.canFindNextProof());
System.out.println(result);
prints out:
#(Result, +(*(2.0, 2.0), 2.0))
true
6.0
Since an Evaluation unifies the first term with the
arithmetic value, the second term may have a value before
the Evaluation proves itself. |
| EvaluationException.java | Class | Title: Evaluation Exception
Description: None
Copyright (c) 1999 Steven J. |
| Fact.java | Class | Title: Fact
Description: None
Copyright (c) 1999 Steven J. |
| Gateway.java | Class | Title: Gateway
Description: None
Copyright (c) 1999 Steven J. |
| Not.java | Class | Title: Not
Description: None
Copyright (c) 1999 Steven J. |
| NumberFact.java | Class | Title: Number Fact
Description: None
Copyright (c) 1999 Steven J. |
| Program.java | Class | Title: Program
Description: None
Copyright (c) 1999 Steven J. |
| ProgramEnumerator.java | Class | Title: Program Enumerator
Description: None
Copyright (c) 1999 Steven J. |
| Query.java | Class | Title: Query
Description: None
Copyright (c) 1999 Steven J. |
| Rule.java | Class | Title: Rule
Description: None
Copyright (c) 1999 Steven J. |
| Scope.java | Class | Title: Scope
Description: None
Copyright (c) 1999 Steven J. |
| Structure.java | Class | Title: Structure
Description: None
Copyright (c) 1999 Steven J. |
| Term.java | Interface | Title: Term
Description: None
Copyright (c) 1999 Steven J. |
| Unification.java | Class | Title: Unification
Description: None
Copyright (c) 1999 Steven J. |
| Variable.java | Class | Title: Variable
Description: None
Copyright (c) 1999 Steven J. |