public static <I, D> int findRivestSchapire(Query<I, D> ceQuery,
                                                AccessSequenceTransformer<I> asTransformer,
                                                SuffixOutput<I, D> hypOutput,
                                                MembershipOracle<I, D> oracle) {

        return AcexLocalSuffixFinder.findSuffixIndex(AcexAnalyzers.BINARY_SEARCH_BWD,
                                                     true,
                                                     ceQuery,
                                                     asTransformer,
                                                     hypOutput,
                                                     oracle);
    }
public static < I , D > int findRivestSchapire ( Query < I , D > ceQuery , AccessSequenceTransformer < I > asTransformer , SuffixOutput < I , D > hypOutput , MembershipOracle < I , D > oracle ) { return AcexLocalSuffixFinder . findSuffixIndex ( AcexAnalyzers . BINARY_SEARCH_BWD , true , ceQuery , asTransformer , hypOutput , oracle ) ; }
Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations
using a binary search, as proposed by Rivest &amp; Schapire.

@param ceQuery
the initial counterexample query
@param asTransformer
the access sequence transformer
@param hypOutput
interface to the hypothesis output, for checking whether the oracle output contradicts the hypothesis
@param oracle
interface to the SUL

@return the index of the respective suffix, or {@code -1} if no counterexample could be found

@see LocalSuffixFinder