Package de.xima.fc.workflow

Class FlowGraphFilters

java.lang.Object

de.xima.fc.workflow.FlowGraphFilters

public final class FlowGraphFilters
extends Object

Contains some common implementations of flow graph filters.

Since:

8.0.0

Author:

XIMA MEDIA GmbH

Method Summary

Modifier and Type	Method	Description
static FlowGraphFilter.Backward	errorResultPredecessors()	A filter for the predecessors of a node N that can provide error or soft error results to that node N.
static FlowGraphFilter.Generic	matchAll()
static FlowGraphFilter.Generic	matchNone()
static FlowGraphFilter.Backward	successResultPredecessors()	A filter for the predecessors of a node N that can provide success results to that node N.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

errorResultPredecessors

public static FlowGraphFilter.Backward errorResultPredecessors()

A filter for the predecessors of a node N that can provide error or soft error results to that node N.

Informally speaking, this is set of nodes {P}, such that, if P completes abruptly, a path to N exists, but excludes those nodes P that are only reachable by backtracking loops (as results from another node in the same loop are always resolved to the latest result from that loop iteration).

Constrains the initial edge to be a throwing completion edge.

Returns:

A filter for computing the normal completion predecessors of a node that are reachable without backwards edges.

matchAll

public static FlowGraphFilter.Generic matchAll()

Returns:

A filter that does not impose any constraints and allows all edges and nodes.

matchNone

public static FlowGraphFilter.Generic matchNone()

Returns:

A filter that does not allow any edges and nodes.

successResultPredecessors

public static FlowGraphFilter.Backward successResultPredecessors()

A filter for the predecessors of a node N that can provide success results to that node N.

Informally speaking, this is set of nodes {P}, such that, if P completes normally, a path to N exists, but excludes those nodes P that are only reachable by backtracking loops (as results from another node in the same loop are always resolved to the latest result from that loop iteration).

Constrains the initial edge to be a normal completion edge.

Returns:

A filter for computing the normal completion predecessors of a node that are reachable without backwards edges.