public final class TSCopy extends Object
Modifier and Type | Method and Description |
---|---|
static <S1,I1,T1,SP,TP,S2,I2,T2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP,? super TP> out,
Function<? super I1,? extends I2> inputsMapping)
Copies a
UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties. |
static <S1,I1,T1,SP,TP,S2,I2,T2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP,? super TP> out,
Function<? super I1,? extends I2> inputsMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies a
UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties. |
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform)
Copies a
UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies a
UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I,T1,SP,TP,S2,T2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP,? super TP> out)
Copies a
UniversalAutomaton with compatible input alphabets and properties. |
static <S1,I,T1,SP,TP,S2,T2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP,? super TP> out,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies a
UniversalAutomaton with compatible input alphabets and properties. |
static <S1,I,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform)
Copies a
UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly
heterogeneous properties. |
static <S1,I,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies a
UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly
heterogeneous properties. |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I1,T1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state
and transition properties. |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I1,T1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies an
TransitionSystem to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I,T1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly
heterogeneous state and transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I,T1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly
heterogeneous state and transition properties. |
public static <S1,I1,T1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I1,T1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)
Automaton
to a MutableAutomaton
with possibly heterogeneous input alphabets and state
and transition properties. State and transitions will not be filtered.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- the transformation for input symbolsspMapping
- the function for obtaining state propertiestpMapping
- the function for obtaining transition propertiespublic static <S1,I1,T1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I1,T1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
TransitionSystem
to a MutableAutomaton
with possibly heterogeneous input alphabets and
state and transition properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- the transformation for input symbolsspMapping
- the function for obtaining state propertiestpMapping
- the function for obtaining transition propertiesstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionspublic static <S1,I,T1,S2,T2,SP2,TP2> Mapping<S1,S2> rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I,T1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)
Automaton
to a MutableAutomaton
with a compatible input alphabet, but possibly
heterogeneous state and transition properties. States and transitions will not be filtered.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonspMapping
- the function for obtaining state propertiestpMapping
- the function for obtaining transition propertiespublic static <S1,I,T1,S2,T2,SP2,TP2> Mapping<S1,S2> rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I,T1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Automaton
to a MutableAutomaton
with a compatible input alphabet, but possibly
heterogeneous state and transition properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonspMapping
- the function for obtaining state propertiestpMapping
- the function for obtaining transition propertiesstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionspublic static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform)
UniversalAutomaton
to a MutableAutomaton
with possibly heterogeneous input alphabets and
state and transition properties. States and transitions will not be filteredmethod
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- the transformation for input symbolsspTransform
- the transformation for state propertiestpTransform
- the transformation for transition propertiespublic static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
UniversalAutomaton
to a MutableAutomaton
with possibly heterogeneous input alphabets and
state and transition properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- the transformation for input symbolsspTransform
- the transformation for state propertiestpTransform
- the transformation for transition propertiesstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionspublic static <S1,I,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform)
UniversalAutomaton
to a MutableAutomaton
with compatible input alphabets, but possibly
heterogeneous properties. States and transitions will not be filtered.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonspTransform
- the transformation for state propertiestpTransform
- the transformation for transition propertiespublic static <S1,I,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
UniversalAutomaton
to a MutableAutomaton
with compatible input alphabets, but possibly
heterogeneous properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonspTransform
- the transformation for state propertiestpTransform
- the transformation for transition propertiesstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionspublic static <S1,I1,T1,SP,TP,S2,I2,T2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP,? super TP> out, Function<? super I1,? extends I2> inputsMapping)
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties.
States and transitions will not be filteredmethod
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- a mapping from inputs in the input automaton to inputs in the output automatonpublic static <S1,I1,T1,SP,TP,S2,I2,T2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP,? super TP> out, Function<? super I1,? extends I2> inputsMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatoninputsMapping
- the transformation for input symbolsstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionspublic static <S1,I,T1,SP,TP,S2,T2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP,? super TP> out)
UniversalAutomaton
with compatible input alphabets and properties. States and transitions will
not be filtered.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonpublic static <S1,I,T1,SP,TP,S2,T2> Mapping<S1,S2> copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP,? super TP> out, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
UniversalAutomaton
with compatible input alphabets and properties.method
- the traversal method to usein
- the input transition systemlimit
- the traversal limit, a value less than 0 means no limitinputs
- the inputs to considerout
- the output automatonstateFilter
- the filter predicate for statestransFilter
- the filter predicate for transitionsCopyright © 2018. All rights reserved.