| /packages/apps/Email/src/com/beetstra/jutf7/ |
| Base64Util.java | 57 private final char[] alphabet;
field in class:Base64Util
61 * Initializes the class with the specified encoding/decoding alphabet.
63 * @param alphabet
64 * @throws IllegalArgumentException if alphabet is not 64 characters long or
67 Base64Util(final String alphabet) {
68 this.alphabet = alphabet.toCharArray();
69 if (alphabet.length() != ALPHABET_LENGTH)
70 throw new IllegalArgumentException("alphabet has incorrect length (should be 64, not "
71 + alphabet.length() + ")");
[all...] |
| UTF7StyleCharset.java | 50 * First the base 64 alphabet used; in modified UTF-7 a slightly different
51 * alphabet is used. Additionally, it should be specified if encoders and
60 * @param alphabet The base 64 alphabet used
63 protected UTF7StyleCharset(String canonicalName, String[] aliases, String alphabet,
66 this.base64 = new Base64Util(alphabet);
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| exhaustive2_test.cc | 24 vector<string> alphabet = Explode("()*+?{}[]\\^$."); local
25 vector<string> escaped = alphabet;
29 2, alphabet, "", "");
|
| exhaustive_tester.h | 17 // then generate all strings of a given length over a given alphabet,
28 const vector<string>& alphabet,
34 : RegexpGenerator(maxatoms, maxops, alphabet, ops),
71 const vector<string>& alphabet,
79 void EgrepTest(int maxatoms, int maxops, const string& alphabet,
|
| random_test.cc | 22 const vector<string>& alphabet,
34 ExhaustiveTester t(maxatoms, maxops, alphabet, ops,
90 vector<string> alphabet = Explode("abc123\001\002\003\t\r\n\v\f\a"); local
91 RandomTest(10, 10, atoms, ops, 20, alphabet, "");
|
| string_generator_test.cc | 26 // * strings of the same length are sorted in alphabet order.
31 // Assumes that the alphabet is sorted, so that the generated
33 static void RunTest(int len, string alphabet, bool donull) {
34 StringGenerator g(len, Explode(alphabet));
52 // Check that all characters in s appear in alphabet.
56 EXPECT_TRUE(utfrune(alphabet.c_str(), r) != NULL);
73 int alpha = utflen(alphabet.c_str());
|
| string_generator.h | 22 StringGenerator(int maxlen, const vector<string>& alphabet);
42 vector<string> alphabet_; // Alphabet, one string per letter.
48 vector<int> digits_; // Alphabet indices for next string.
|
| string_generator.cc | 16 StringGenerator::StringGenerator(int maxlen, const vector<string>& alphabet)
17 : maxlen_(maxlen), alphabet_(alphabet),
|
| exhaustive_tester.cc | 7 // Each test picks an alphabet (e.g., "abc"), a maximum string length,
146 const vector<string>& alphabet,
159 ExhaustiveTester t(maxatoms, maxops, alphabet, ops,
172 void EgrepTest(int maxatoms, int maxops, const string& alphabet,
179 Split("", alphabet),
|
| /external/regex-re2/re2/testing/ |
| exhaustive2_test.cc | 24 vector<string> alphabet = Explode("()*+?{}[]\\^$."); local
25 vector<string> escaped = alphabet;
29 2, alphabet, "", "");
|
| exhaustive_tester.h | 17 // then generate all strings of a given length over a given alphabet,
28 const vector<string>& alphabet,
34 : RegexpGenerator(maxatoms, maxops, alphabet, ops),
71 const vector<string>& alphabet,
79 void EgrepTest(int maxatoms, int maxops, const string& alphabet,
|
| random_test.cc | 22 const vector<string>& alphabet,
34 ExhaustiveTester t(maxatoms, maxops, alphabet, ops,
90 vector<string> alphabet = Explode("abc123\001\002\003\t\r\n\v\f\a"); local
91 RandomTest(10, 10, atoms, ops, 20, alphabet, "");
|
| string_generator_test.cc | 26 // * strings of the same length are sorted in alphabet order.
31 // Assumes that the alphabet is sorted, so that the generated
33 static void RunTest(int len, string alphabet, bool donull) {
34 StringGenerator g(len, Explode(alphabet));
52 // Check that all characters in s appear in alphabet.
56 EXPECT_TRUE(utfrune(alphabet.c_str(), r) != NULL);
73 int alpha = utflen(alphabet.c_str());
|
| string_generator.h | 22 StringGenerator(int maxlen, const vector<string>& alphabet);
42 vector<string> alphabet_; // Alphabet, one string per letter.
48 vector<int> digits_; // Alphabet indices for next string.
|
| string_generator.cc | 16 StringGenerator::StringGenerator(int maxlen, const vector<string>& alphabet)
17 : maxlen_(maxlen), alphabet_(alphabet),
|
| exhaustive_tester.cc | 7 // Each test picks an alphabet (e.g., "abc"), a maximum string length,
146 const vector<string>& alphabet,
159 ExhaustiveTester t(maxatoms, maxops, alphabet, ops,
172 void EgrepTest(int maxatoms, int maxops, const string& alphabet,
179 Split("", alphabet),
|
| /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/ |
| Base64.java | 18 static final char[] alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".toCharArray(); field in class:Base64
41 cw.write(alphabet[x >> 18]);
42 cw.write(alphabet[(x >> 12) & 0x3f]);
43 cw.write(alphabet[(x >> 6) & 0x3f]);
44 cw.write(alphabet[x & 0x3f]);
52 cw.write(alphabet[x >> 18]);
53 cw.write(alphabet[(x >> 12) & 0x3f]);
60 cw.write(alphabet[x >> 18]);
61 cw.write(alphabet[(x >> 12) & 0x3f]);
62 cw.write(alphabet[(x >> 6) & 0x3f])
[all...] |
| /frameworks/base/core/java/android/util/ |
| Base64.java | 179 * Base64 alphabet.
239 final private int[] alphabet; field in class:Base64.Decoder
244 alphabet = ((flags & URL_SAFE) == 0) ? DECODE : DECODE_WEBSAFE;
271 // the loop. (Even alphabet makes a measurable
278 final int[] alphabet = this.alphabet; local
297 (value = ((alphabet[input[p] & 0xff] << 18) |
298 (alphabet[input[p+1] & 0xff] << 12) |
299 (alphabet[input[p+2] & 0xff] << 6) |
300 (alphabet[input[p+3] & 0xff]))) >= 0)
579 final private byte[] alphabet; field in class:Base64.Encoder
[all...] |
| /packages/apps/Music/src/com/android/music/ |
| MusicAlphabetIndexer.java | 30 public MusicAlphabetIndexer(Cursor cursor, int sortedColumnIndex, CharSequence alphabet) {
31 super(cursor, sortedColumnIndex, alphabet);
|
| /external/smack/src/org/xbill/DNS/utils/ |
| base32.java | 17 public static class Alphabet {
18 private Alphabet() {}
26 private String alphabet; field in class:base32
31 * @param alphabet Which alphabet should be used
34 * default parameters (The standard base32 alphabet, no padding, uppercase)
37 base32(String alphabet, boolean padding, boolean lowercase) {
38 this.alphabet = alphabet;
125 char c = alphabet.charAt(t[j])
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-semaphore.cc | 107 static const char alphabet[] = "XKOAD"; variable
108 static const int kAlphabetSize = sizeof(alphabet) - 1;
109 static const int kBufferSize = 4096; // GCD(buffer size, alphabet size) = 1
125 buffer[n % kBufferSize] = alphabet[n % kAlphabetSize];
140 ASSERT_EQ(static_cast<int>(alphabet[n % kAlphabetSize]),
|
| /packages/apps/Dialer/tests/src/com/android/dialer/database/ |
| SmartDialPrefixTest.java | 173 final ContactNumber alphabet = constructNewContactWithDummyIds(contactCursor, nameCursor, local
189 assertTrue(getLooseMatchesFromDb("22233344455566677778889999").contains(alphabet));
190 assertTrue(getLooseMatchesFromDb("33344455566677778889999").contains(alphabet));
191 assertTrue(getLooseMatchesFromDb("44455566677778889999").contains(alphabet));
192 assertTrue(getLooseMatchesFromDb("55566677778889999").contains(alphabet));
193 assertTrue(getLooseMatchesFromDb("66677778889999").contains(alphabet));
194 assertTrue(getLooseMatchesFromDb("77778889999").contains(alphabet));
195 assertTrue(getLooseMatchesFromDb("8889999").contains(alphabet));
196 assertTrue(getLooseMatchesFromDb("9999").contains(alphabet));
199 assertTrue(getLooseMatchesFromDb("12345678").contains(alphabet));
306 final ContactNumber alphabet = constructNewContactWithDummyIds(contactCursor, nameCursor, local
335 final ContactNumber alphabet = constructNewContactWithDummyIds(contactCursor, nameCursor, local
[all...] |
| /frameworks/base/core/java/android/widget/ |
| AlphabetIndexer.java | 25 * If the items in the adapter are sorted by simple alphabet-based sorting, then
32 * index of a given section (alphabet).
52 * Cached length of the alphabet array.
68 * The section array converted from the alphabet string.
77 * @param alphabet string containing the alphabet, with space as the first character.
80 * characters in the alphabet will show up as preview letters.
82 public AlphabetIndexer(Cursor cursor, int sortedColumnIndex, CharSequence alphabet) {
85 mAlphabet = alphabet;
86 mAlphabetLength = alphabet.length()
[all...] |
| /libcore/benchmarks/src/benchmarks/regression/ |
| StringCaseMappingBenchmark.java | 65 private static String makeString(int length, String alphabet) {
68 sb.append(alphabet.charAt(i % alphabet.length()));
|
| /frameworks/base/core/java/android/content/pm/ |
| VerifierDeviceIdentity.java | 104 final char[] alphabet = ENCODE; local
130 encoded[--index] = alphabet[group];
146 * This essentially does the reverse of the ENCODED alphabet above
|
