public class AcexAnalysisAlgorithms extends Object
All of the algorithms contained in this class takes as arguments:
BaseAbstractCounterexample
acex
,low
, andhigh
.
i
such that acex.testEffect(i) != acex.testEffect(i+1)
.
The input is valid iff high > low
, acex.testEffect(low) == 0
,
and acex.testEffect(high) == 1
.Constructor and Description |
---|
AcexAnalysisAlgorithms() |
Modifier and Type | Method and Description |
---|---|
static int |
binarySearch(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using a binary search.
|
static int |
exponentialSearchBwd(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using an exponential search.
|
static int |
exponentialSearchFwd(AbstractCounterexample acex,
int low,
int high) |
static int |
linearSearchBwd(AbstractCounterexample acex,
int low,
int high)
Scan linearly through the counterexample in descending order.
|
static int |
linearSearchFwd(AbstractCounterexample acex,
int low,
int high)
Scan linearly through the counterexample in ascending order.
|
static int |
partitionSearchBwd(AbstractCounterexample acex,
int low,
int high)
Search for a suffix index using a partition search
|
static int |
partitionSearchFwd(AbstractCounterexample acex,
int low,
int high) |
public static int linearSearchFwd(AbstractCounterexample acex, int low, int high)
acex
- the abstract counterexamplelow
- the lower bound of the search rangehigh
- the upper bound of the search rangei
such that
acex.testEffect(i) != acex.testEffect(i+1)
public static int linearSearchBwd(AbstractCounterexample acex, int low, int high)
acex
- the abstract counterexamplelow
- the lower bound of the search rangehigh
- the upper bound of the search rangei
such that
acex.testEffect(i) != acex.testEffect(i+1)
public static int exponentialSearchBwd(AbstractCounterexample acex, int low, int high)
acex
- the abstract counterexamplelow
- the lower bound of the search rangehigh
- the upper bound of the search rangei
such that
acex.testEffect(i) != acex.testEffect(i+1)
public static int exponentialSearchFwd(AbstractCounterexample acex, int low, int high)
public static int binarySearch(AbstractCounterexample acex, int low, int high)
acex
- the abstract counterexamplelow
- the lower bound of the search rangehigh
- the upper bound of the search rangei
such that
acex.testEffect(i) != acex.testEffect(i+1)
public static int partitionSearchBwd(AbstractCounterexample acex, int low, int high)
acex
- the abstract counterexamplelow
- the lower bound of the search rangehigh
- the upper bound of the search rangei
such that
acex.testEffect(i) != acex.testEffect(i+1)
public static int partitionSearchFwd(AbstractCounterexample acex, int low, int high)
Copyright © 2015. All rights reserved.