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

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	FlowGraphFilters.EdgeTypeMatchesBuilder	Builder for a filter that applies constraints to the edge types of flow graph edges.

Method Summary

Modifier and Type	Method	Description
static FlowGraphFilters.EdgeTypeMatchesBuilder	edgeTypeMatches()	Creates a builder for configuring a generic filter that applies constraints on edge types.
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 Object

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

Method Details

edgeTypeMatches

public static FlowGraphFilters.EdgeTypeMatchesBuilder edgeTypeMatches()

Creates a builder for configuring a generic filter that applies constraints on edge types. Initially, no constraints are present in the builder. Building an empty builder is equivalent to matchAll().

See FlowGraphConnectionType for the bit flags of the edge types.

Returns:

A builder for configuring a filter that applies constraints to the edge types of flow graph edges.

Since:

8.1.0

See Also:

• FlowGraphConnectionType

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.

Formally speaking, the error result predecessors of a node N is the 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, and does not allow any backwards edges owned by any parent of node N.

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.

Formally speaking, the success result predecessors of a node N is the 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 (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, and does not allow any backwards edges owned by any parent of node N.

Returns:

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