Package | Description |
---|---|
de.learnlib.acex | |
de.learnlib.acex.analyzers | |
de.learnlib.acex.impl | |
de.learnlib.counterexamples.prefixtransform |
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 int |
AcexAnalysisAlgorithms.binarySearch(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using a binary search.
|
static int |
AcexAnalysisAlgorithms.exponentialSearchBwd(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using an exponential search.
|
static int |
AcexAnalysisAlgorithms.exponentialSearchFwd(AbstractCounterexample acex,
int low,
int high) |
static int |
AcexAnalysisAlgorithms.linearSearchBwd(AbstractCounterexample acex,
int low,
int high)
Scan linearly through the counterexample in descending order.
|
static int |
AcexAnalysisAlgorithms.linearSearchFwd(AbstractCounterexample acex,
int low,
int high)
Scan linearly through the counterexample in ascending order.
|
static int |
AcexAnalysisAlgorithms.partitionSearchBwd(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using a partition search
|
static int |
AcexAnalysisAlgorithms.partitionSearchFwd(AbstractCounterexample acex,
int low,
int high) |
Modifier and Type | Class and Description |
---|---|
class |
BaseAbstractCounterexample
Base class for abstract counterexamples.
|
Modifier and Type | Class and Description |
---|---|
class |
PrefixTransformAcex<I,O>
An abstract counterexample whose data is derived from prefix transformation.
|
Copyright © 2015. All rights reserved.