1/* GENERATED SOURCE. DO NOT MODIFY. */
2// © 2016 and later: Unicode, Inc. and others.
3// License & terms of use: http://www.unicode.org/copyright.html#License
4/*
5 *******************************************************************************
6 * Copyright (C) 2009-2014, International Business Machines Corporation and    *
7 * others. All Rights Reserved.                                                *
8 *******************************************************************************
9 */
10
11package android.icu.text;
12
13/**
14 * Used by RBNF to leniently parse a string.
15 *
16 * @deprecated ICU 54
17 * @hide Only a subset of ICU is exposed in Android
18 */
19@Deprecated
20public interface RbnfLenientScanner {
21    /**
22     * Returns true if a string consists entirely of ignorable
23     * characters.
24     * @param s The string to test
25     * @return true if the string is empty or consists entirely of
26     * characters that are ignorable.
27     * @deprecated ICU 54
28     */
29    @Deprecated
30    boolean allIgnorable(String s);
31
32    /**
33     * Matches characters in a string against a prefix and return
34     * the number of chars that matched, or 0 if no match.  Only
35     * primary-order differences are significant in determining
36     * whether there's a match.  This means that the returned
37     * value need not be the same as the length of the prefix.
38     *
39     * @param str The string being tested
40     * @param prefix The text we're hoping to see at the beginning of "str"
41     * @return the number of characters in "str" that were matched
42     * @deprecated ICU 54
43     */
44    @Deprecated
45    int prefixLength(String str, String prefix);
46
47    /**
48     * Searches a string for another string.  This might use a
49     * Collator to compare strings, or just do a simple match.
50     * @param str The string to search
51     * @param key The string to search "str" for
52     * @param startingAt The index into "str" where the search is to
53     * begin
54     * @return A two-element array of ints.  Element 0 is the position
55     * of the match, or -1 if there was no match.  Element 1 is the
56     * number of characters in "str" that matched (which isn't necessarily
57     * the same as the length of "key")
58     * @deprecated ICU 54
59     */
60    @Deprecated
61    int[] findText(String str, String key, int startingAt);
62}