Modifier and Type | Method and Description |
---|---|
default int |
AcexAnalyzer.analyzeAbstractCounterexample(AbstractCounterexample<?> acex)
Analyzes an abstract counterexample.
|
default int |
AcexAnalyzer.analyzeAbstractCounterexample(AbstractCounterexample<?> acex,
int low) |
int |
AcexAnalyzer.analyzeAbstractCounterexample(AbstractCounterexample<?> acex,
int low,
int high) |
Modifier and Type | Method and Description |
---|---|
static <E> int |
AcexAnalysisAlgorithms.binarySearchLeft(AbstractCounterexample<E> acex,
int low,
int high) |
static <E> int |
AcexAnalysisAlgorithms.binarySearchRight(AbstractCounterexample<E> acex,
int low,
int high)
Search for a suffix index using a binary search.
|
static <E> int |
AcexAnalysisAlgorithms.exponentialSearchBwd(AbstractCounterexample<E> acex,
int low,
int high)
Search for a suffix index using an exponential search.
|
static <E> int |
AcexAnalysisAlgorithms.exponentialSearchFwd(AbstractCounterexample<E> acex,
int low,
int high) |
static <E> int |
AcexAnalysisAlgorithms.linearSearchBwd(AbstractCounterexample<E> acex,
int low,
int high)
Scan linearly through the counterexample in descending order.
|
static <E> int |
AcexAnalysisAlgorithms.linearSearchFwd(AbstractCounterexample<E> acex,
int low,
int high)
Scan linearly through the counterexample in ascending order.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractBaseCounterexample<E> |
Modifier and Type | Class and Description |
---|---|
protected class |
DTLearnerVPDA.PrefixTransformAcex |
Modifier and Type | Class and Description |
---|---|
protected class |
KearnsVaziraniDFA.KVAbstractCounterexample |
Modifier and Type | Class and Description |
---|---|
protected class |
KearnsVaziraniMealy.KVAbstractCounterexample |
Modifier and Type | Class and Description |
---|---|
class |
ClassicPrefixTransformAcex<I,D>
An abstract counterexample based on prefix transformations.
|
class |
MealyOutInconsPrefixTransformAcex<I,O> |
class |
OutInconsPrefixTransformAcex<I,D>
An abstract counterexample for output inconsistencies, based on prefix transformations.
|
Copyright © 2018. All rights reserved.