Package tools.refinery.interpreter.matchers.psystem.basicenumerables
package tools.refinery.interpreter.matchers.psystem.basicenumerables
-
ClassDescriptionFor a binary base pattern over an enumerable universe type, computes the reflexive transitive closure (base)*For a binary base pattern, computes the irreflexive transitive closure (base)+Represents an enumerable type constraint that asserts that values substituted for the given tuple of variables form a tuple that belongs to an enumerable extensional relation identified by an
IInputKey
.