public interface IProgram extends IStep
Modifier and Type | Method and Description |
---|---|
boolean |
isClosure()
true iff the fixed point closure of the IProgram
should be computed. |
boolean |
isParallel()
true iff the steps() MAY be executed in parallel. |
int |
stepCount()
The #of steps in the program (non-recursive).
|
Iterator<IStep> |
steps()
The sequence of sub-program
IStep s. |
IStep[] |
toArray()
An array containing the steps in the program (non-recursive).
|
getName, getQueryOptions, isRule, toString
boolean isParallel()
true
iff the steps()
MAY be executed in parallel.
When false
the steps WILL be executed sequentially and
(for mutation) the buffered writes will be flushed after each step.
Note: Sequential execution of a program makes a multi-IRule
program MUCH easier to debug as the rules are executed one by one and the
buffer is flushed after each rule so you can directly see the #of
elements consider by the IRule
for each IPredicate
in the
tail and the #of ISolution
s generated by the IRule
.
boolean isClosure()
true
iff the fixed point closure of the IProgram
should be computed.
Note: Closure is computed in rounds. The rounds continue until the
IMutableRelation
(s) on which the steps are writing reach a fixed
point (no new solutions are added to the relation(s) within a given
round). If a program has a fixed point, then the same closure will be
obtained by either sequential or parallel execution of the steps within
each round and in general parallel execution of the steps is perferred as
it has better performance. However, the steps MAY be executed
sequentially to facilitate debugging.
int stepCount()
IStep[] toArray()
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.