| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/ |
| IDNAConformanceTest.java | 204 char[] chars = str.toCharArray(); local
206 for (int i = 0; i < chars.length; i++) {
207 if ('<' == chars[i]) {
209 while ('>' != chars[i + 1]) {
210 sbTemp.append(chars[++i]);
226 } else if ('>' == chars[i]) {//end when met with '>'
229 result.append(chars[i]);
|
| /bionic/tests/ |
| wchar_test.cpp | 116 const wchar_t chars[] = { L'h', L'e', L'l', L'l', L'o', 0 }; local
122 EXPECT_EQ(5U, wcstombs(NULL, chars, 0));
123 EXPECT_EQ(5U, wcstombs(NULL, chars, 4));
124 EXPECT_EQ(5U, wcstombs(NULL, chars, 256));
125 src = chars;
127 EXPECT_EQ(&chars[0], src);
128 src = chars;
130 EXPECT_EQ(&chars[0], src);
131 src = chars;
133 EXPECT_EQ(&chars[0], src)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| StringRef.h | 295 /// Find the first character in the string that is in \p Chars, or npos if
298 /// Complexity: O(size() + Chars.size())
299 size_t find_first_of(StringRef Chars, size_t From = 0) const;
306 /// \p Chars, or npos if not found.
308 /// Complexity: O(size() + Chars.size())
309 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
320 /// Complexity: O(size() + Chars.size())
321 size_t find_last_of(StringRef Chars, size_t From = npos) const;
327 /// Find the last character in the string that is not in \p Chars, or
330 /// Complexity: O(size() + Chars.size()
[all...] |
| /external/icu/icu4c/source/layout/ |
| OpenTypeLayoutEngine.cpp | 282 le_int32 OpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
312 CanonShaping::reorderMarks(&chars[offset], count, rightToLeft, outChars, glyphStorage);
331 le_int32 OpenTypeLayoutEngine::glyphProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
338 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
343 mapCharsToGlyphs(chars, offset, count, rightToLeft, rightToLeft, glyphStorage, success);
403 le_int32 OpenTypeLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success)
413 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
418 outCharCount = characterProcessing(chars, offset, count, max, rightToLeft, outChars, fakeGlyphStorage, success);
431 glyphProcessing(chars, offset, count, max, rightToLeft, fakeGlyphStorage, success);
432 //adjustGlyphs(chars, offset, count, rightToLeft, fakeGlyphs, fakeGlyphCount)
[all...] |
| ArabicShaping.cpp | 28 shaping array holds types for Arabic chars between 0610 and 0700
125 void ArabicShaping::shape(const LEUnicode *chars, le_int32 offset, le_int32 charCount, le_int32 charMax,
148 rightType = getShapeType(chars[i]);
156 leftType = getShapeType(chars[i]);
176 LEUnicode c = chars[in];
|
| GXLayoutEngine.h | 90 * @param chars - the input character context
104 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
119 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
|
| GXLayoutEngine2.h | 89 * @param chars - the input character context
103 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
118 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
|
| TibetanReordering.cpp | 299 le_int32 TibetanReordering::findSyllable(const TibetanClassTable *classTable, const LEUnicode *chars, le_int32 prev, le_int32 charCount)
305 TibetanClassTable::CharClass charClass = (classTable->getCharClass(chars[cursor]) & TibetanClassTable::CF_CLASS_MASK);
322 le_int32 TibetanReordering::reorder(const LEUnicode *chars, le_int32 charCount, le_int32,
334 le_int32 syllable = findSyllable(classTable, chars, prev, charCount);
342 if (classTable->getCharClass(chars[prev]) & TibetanClassTable::CF_DOTTED_CIRCLE) {
348 charClass = classTable->getCharClass(chars[i]);
351 && ( classTable->getCharClass(chars[i+1]) & TibetanClassTable::CF_PREDIGIT))
354 output.writeChar(chars[i], i+1 , tagPref);
363 output.writeChar(chars[i], i, tagAbvf);
367 output.writeChar(chars[i], i, tagPstf)
[all...] |
| /libcore/luni/src/test/java/libcore/io/ |
| Base64Test.java | 48 + "//////////w=="; // 84 chars
160 // Table 1 chars
165 // Table 2 chars.
223 char[] chars = new char[charsBuffer.remaining()]; local
224 charsBuffer.get(chars, 0, chars.length);
225 return new String(chars);
235 char[] chars = string.toCharArray(); local
240 CharBuffer charsBuffer = CharBuffer.wrap(chars);
|
| /art/runtime/ |
| utf.h | 49 size_t CountUtf8Bytes(const uint16_t* chars, size_t char_count);
83 int32_t ComputeUtf16Hash(mirror::CharArray* chars, int32_t offset, size_t char_count)
85 int32_t ComputeUtf16Hash(const uint16_t* chars, size_t char_count);
89 // uint32_t and hashes individual chars instead of codepoint words.
90 uint32_t ComputeModifiedUtf8Hash(const char* chars);
|
| /external/caliper/examples/src/main/java/examples/ |
| StringBuilderBenchmark.java | 52 char[] chars = "chars".toCharArray(); local
56 sb.append(chars);
62 CharSequence cs = "chars";
122 String s = "chars";
|
| /external/guava/guava/src/com/google/common/base/ |
| SmallCharMatcher.java | 90 static CharMatcher from(BitSet chars, String description) {
93 int size = chars.cardinality();
94 boolean containsZero = chars.get(0);
98 for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) {
|
| Ascii.java | 441 char[] chars = string.toCharArray(); local
443 char c = chars[i];
445 chars[i] = (char) (c ^ 0x20);
448 return String.valueOf(chars);
461 public static String toLowerCase(CharSequence chars) {
462 if (chars instanceof String) {
463 return toLowerCase((String) chars);
465 int length = chars.length();
468 builder.append(toLowerCase(chars.charAt(i)));
490 char[] chars = string.toCharArray() local
[all...] |
| /external/guava/guava/src/com/google/common/io/ |
| GwtWorkarounds.java | 70 static CharInput asCharInput(final CharSequence chars) {
71 checkNotNull(chars);
77 if (index < chars.length()) {
78 return chars.charAt(index++);
86 index = chars.length();
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| ReplaceableString.java | 144 * @param chars the text to replace characters <code>start</code>
146 * @param charsStart the beginning index into <code>chars</code>,
148 * @param charsLen the number of characters of <code>chars</code>.
150 public void replace(int start, int limit, char[] chars,
153 buf.insert(start, chars, charsStart, charsLen);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| ReplaceableString.java | 153 * @param chars the text to replace characters <code>start</code>
155 * @param charsStart the beginning index into <code>chars</code>,
157 * @param charsLen the number of characters of <code>chars</code>.
160 public void replace(int start, int limit, char[] chars,
163 buf.insert(start, chars, charsStart, charsLen);
|
| /external/jarjar/src/main/com/tonicsystems/jarjar/ |
| Wildcard.java | 54 char[] chars = result.toCharArray(); local
56 for (int i = 0, mark = 0, state = 0, len = chars.length; i < len + 1; i++) {
57 char ch = (i == len) ? '@' : chars[i];
60 parts.add(new String(chars, mark, i - mark));
72 int n = Integer.parseInt(new String(chars, mark, i - mark));
|
| /external/libxml2/ |
| testHTML.c | 415 * receiving some chars from the parser.
436 * receiving some cdata chars from the parser.
637 char chars[4096]; local
642 res = fread(chars, 1, 4, f);
645 chars, res, filename, XML_CHAR_ENCODING_NONE);
646 while ((res = fread(chars, 1, size, f)) > 0) {
647 htmlParseChunk(ctxt, chars, res, 0);
649 htmlParseChunk(ctxt, chars, 0, 1);
667 char chars[4096]; local
672 res = fread(chars, 1, 4, f)
731 char chars[4096]; local
[all...] |
| /frameworks/opt/telephony/tests/telephonytests/src/com/android/internal/telephony/ |
| SmsMessageBodyTest.java | 45 // ASCII chars in the GSM 7 bit default alphabet
49 // Unicode chars in the GSM 7 bit default alphabet and both locking shift tables
53 // Unicode chars in the GSM 7 bit default table and Turkish locking shift tables
57 // Unicode chars in the GSM 7 bit default table but not the locking shift tables
61 // ASCII chars in the GSM default extension table
64 // chars in GSM default extension table and Portuguese locking shift table
80 // chars in Turkish single shift and locking shift tables
83 // chars in Spanish single shift table and Portuguese single and locking shift tables
87 // chars in all national language tables but not in the standard GSM alphabets
90 // chars in Portuguese single shift and locking shift table
[all...] |
| /libcore/luni/src/test/java/libcore/java/lang/ |
| IntegerTest.java | 65 Integer.parseInt("--1", 10); // multiple sign chars
70 Integer.parseInt("++1", 10); // multiple sign chars
92 Integer.decode("--1"); // multiple sign chars
97 Integer.decode("++1"); // multiple sign chars
102 Integer.decode("-+1"); // multiple sign chars
|
| LongTest.java | 94 Long.parseLong("--1", 10); // multiple sign chars
99 Long.parseLong("++1", 10); // multiple sign chars
121 Long.decode("--1"); // multiple sign chars
126 Long.decode("++1"); // multiple sign chars
131 Long.decode("+-1"); // multiple sign chars
|
| /libcore/ojluni/src/main/java/java/nio/ |
| CharBuffer.java | 48 * single chars; </p></li>
51 * methods that transfer contiguous sequences of chars from this buffer
55 * methods that transfer contiguous sequences of chars from a
145 * @param capacity The new buffer's capacity, in chars
298 * will be the number of chars remaining in this buffer, and its mark
414 * <p> This method transfers chars from this buffer into the given
415 * destination array. If there are fewer chars remaining in the
418 * chars are transferred and a {@link BufferUnderflowException} is
421 * <p> Otherwise, this method copies <tt>length</tt> chars from this
434 * except that it first checks that there are sufficient chars i
1067 public IntStream chars() { method in class:CharBuffer
[all...] |
| /external/guava/guava-tests/test/com/google/common/base/ |
| CharMatcherTest.java | 468 // Try replacement chars that both do and do not change the value.
670 private static BitSet bitSet(String chars) {
671 return bitSet(chars.toCharArray());
675 private static BitSet bitSet(char[] chars) {
677 for (int i = 0; i < chars.length; i++) {
678 tmp.set(chars[i]);
712 char[] chars = randomChars(rand, rand.nextInt(63) + 1); local
713 CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars));
714 checkExactMatches(m, chars);
729 Set<Character> chars = new HashSet<Character>(size); local
[all...] |
| /external/llvm/lib/Support/ |
| StringRef.cpp | 202 /// Chars, or npos if not found.
204 /// Note: O(size() + Chars.size())
205 StringRef::size_type StringRef::find_first_of(StringRef Chars,
208 for (size_type i = 0; i != Chars.size(); ++i)
209 CharBits.set((unsigned char)Chars[i]);
227 /// in the string \arg Chars, or npos if not found.
229 /// Note: O(size() + Chars.size())
230 StringRef::size_type StringRef::find_first_not_of(StringRef Chars,
233 for (size_type i = 0; i != Chars.size(); ++i)
234 CharBits.set((unsigned char)Chars[i])
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| UnicodeChart.java | 83 char[] chars = mChars; local
86 chars[i] = (char)unichar;
91 canvas.drawPosText(chars, 0, 256, mPos, mBigCharPaint);
|
