Frame in the LPInterpreter's control stack used to represent matching
to the results of a tabled predicate. Conventionally the system state which
finds and tables the goal results is called the generator and states which
require those results are called consumers.
This is used in the inner loop of the interpreter and so is a pure data structure
not an abstract data type and assumes privileged access to the interpreter state.
author: Dave Reynolds version: $Revision: 1.12 $ on $Date: 2008/01/02 12:06:16 $
Constructor.
Parameters: interpreter - the parent interpreter whose state is to be preserved here, its arg stackdefines the parameters for the target goal
Initialize the choice point state.
Parameters: interpreter - the parent interpreter whose state is to be preserved here, its arg stackdefines the parameters for the target goal
Find the next result triple and bind the result vars appropriately.
Parameters: interpreter - the calling interpreter whose trail should be used FAIL if there are no more matches and the generator is closed, SUSPEND ifthere are no more matches but the generator could generate more, SATISFIED ifa match has been found.