Package de.learnlib.acex

Class AcexAnalysisAlgorithms

java.lang.Object

de.learnlib.acex.AcexAnalysisAlgorithms

public final class AcexAnalysisAlgorithms
extends Object

Method Summary

Modifier and Type	Method	Description
static <E> int	binarySearchLeft(AbstractCounterexample<E> acex, int low, int high)
static <E> int	binarySearchRight(AbstractCounterexample<E> acex, int low, int high)	Search for a suffix index using a binary search.
static <E> int	exponentialSearchBwd(AbstractCounterexample<E> acex, int low, int high)	Search for a suffix index using an exponential search.
static <E> int	exponentialSearchFwd(AbstractCounterexample<E> acex, int low, int high)
static <E> int	linearSearchBwd(AbstractCounterexample<E> acex, int low, int high)	Scan linearly through the counterexample in descending order.
static <E> int	linearSearchFwd(AbstractCounterexample<E> acex, int low, int high)	Scan linearly through the counterexample in ascending order.

Methods inherited from class java.lang.Object

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

Method Detail

linearSearchFwd

public static <E> int linearSearchFwd(AbstractCounterexample<E> acex,
                                      int low,
                                      int high)

Scan linearly through the counterexample in ascending order.

Parameters:

acex - the abstract counterexample

low - the lower bound of the search range

high - the upper bound of the search range

Returns:

an index i such that acex.testEffect(i) != acex.testEffect(i+1)

linearSearchBwd

public static <E> int linearSearchBwd(AbstractCounterexample<E> acex,
                                      int low,
                                      int high)

Scan linearly through the counterexample in descending order.

Parameters:

acex - the abstract counterexample

low - the lower bound of the search range

high - the upper bound of the search range

Returns:

an index i such that acex.testEffect(i) != acex.testEffect(i+1)

exponentialSearchBwd

public static <E> int exponentialSearchBwd(AbstractCounterexample<E> acex,
                                           int low,
                                           int high)

Search for a suffix index using an exponential search.

Parameters:

acex - the abstract counterexample

low - the lower bound of the search range

high - the upper bound of the search range

Returns:

an index i such that acex.testEffect(i) != acex.testEffect(i+1)

binarySearchRight

public static <E> int binarySearchRight(AbstractCounterexample<E> acex,
                                        int low,
                                        int high)

Search for a suffix index using a binary search.

Parameters:

acex - the abstract counterexample

low - the lower bound of the search range

high - the upper bound of the search range

Returns:

an index i such that acex.testEffect(i) != acex.testEffect(i+1)

exponentialSearchFwd

public static <E> int exponentialSearchFwd(AbstractCounterexample<E> acex,
                                           int low,
                                           int high)

binarySearchLeft

public static <E> int binarySearchLeft(AbstractCounterexample<E> acex,
                                       int low,
                                       int high)