Searched defs:chars (Results 1 - 25 of 105) sorted by relevance

12345

/external/bluetooth/glib/glib/
H A Dgscripttable.h2748 guint16 chars; member in struct:__anon520
/external/icu4c/common/unicode/
H A Dstrenum.h220 char *chars; member in class:StringEnumeration
222 * Capacity of chars, for use with default implementations and subclasses.
234 * Ensures that chars is at least as large as the requested capacity.
/external/webkit/WebCore/platform/text/
H A DTextBoundaries.cpp39 int findNextWordFromIndex(const UChar* chars, int len, int position, bool forward) argument
41 TextBreakIterator* it = wordBreakIterator(chars, len);
48 if (position < len && isAlphanumeric(chars[position - 1]))
60 if (position > 0 && isAlphanumeric(chars[position]))
70 void findWordBoundary(const UChar* chars, int len, int position, int* start, int* end) argument
72 TextBreakIterator* it = wordBreakIterator(chars, len);
/external/icu4c/layout/
H A DGXLayoutEngine.cpp31 le_int32 GXLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
37 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
42 mapCharsToGlyphs(chars, offset, count, FALSE, rightToLeft, glyphStorage, success);
54 void GXLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool /*reverse*/, argument
61 if (chars == NULL || offset < 0 || count < 0) {
H A DKhmerLayoutEngine.cpp44 le_int32 KhmerOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
51 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
75 le_int32 outCharCount = KhmerReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage);
H A DThaiLayoutEngine.cpp59 le_int32 ThaiLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
65 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
90 glyphCount = ThaiShaping::compose(chars, offset, count, fGlyphSet, fErrorChar, outChars, glyphStorage);
100 void ThaiLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool /*reverse*/, argument
107 if (chars == NULL || offset < 0 || count < 0) {
H A DTibetanLayoutEngine.cpp50 le_int32 TibetanOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
57 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
81 le_int32 outCharCount = TibetanReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage);
H A DHanLayoutEngine.cpp54 le_int32 HanOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/, argument
61 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
H A DIndicLayoutEngine.cpp56 le_int32 IndicOpenTypeLayoutEngine::glyphProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
63 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
68 le_int32 retCount = OpenTypeLayoutEngine::glyphProcessing(chars, offset, count, max, rightToLeft, glyphStorage, success);
87 le_int32 IndicOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
94 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
121 outCharCount = IndicReordering::v2process(&chars[offset], count, fScriptCode, outChars, glyphStorage);
123 outCharCount = IndicReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage, &fMPreFixups, success);
H A DArabicLayoutEngine.cpp66 le_int32 ArabicOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
73 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
93 CanonShaping::reorderMarks(&chars[offset], count, rightToLeft, outChars, glyphStorage);
98 ArabicShaping::shape(chars, offset, count, max, rightToLeft, glyphStorage);
103 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, argument
110 if (chars == NULL || offset < 0 || count < 0) {
116 OpenTypeLayoutEngine::adjustGlyphPositions(chars, offset, count, reverse, glyphStorage, success);
125 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
174 void UnicodeArabicOpenTypeLayoutEngine::mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool /*mirror*/, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
180 if (chars
199 adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
[all...]
H A DLEFontInstance.cpp33 const LEFontInstance *LEFontInstance::getSubFont(const LEUnicode chars[], le_int32 *offset, le_int32 limit, argument
40 if (chars == NULL || *offset < 0 || limit < 0 || *offset >= limit || script < 0 || script >= scriptCodeCount) {
49 void LEFontInstance::mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, argument
60 LEUnicode16 high = chars[i];
64 LEUnicode16 low = chars[i + 1];
H A Dloengine.cpp40 const LEUnicode chars[],
56 return le->layoutChars(chars, offset, count, max, rightToLeft, x, y, *success);
39 le_layoutChars(le_engine *engine, const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, float x, float y, LEErrorCode *success) argument
/external/speex/include/speex/
H A Dspeex_bits.h50 char *chars; /**< "raw" data */ member in struct:SpeexBits
54 int owner; /**< Does the struct "own" the "raw" buffer (member "chars") */
/external/stlport/test/unit/
H A Distmit_test.cpp89 string chars; local
91 2, back_inserter(chars)).first,
92 2, back_inserter(chars)).first;
93 CPPUNIT_ASSERT( chars == "aabb" );
94 copy_n(ite, 2, back_inserter(chars));
95 CPPUNIT_ASSERT( chars == "aabbcd" );
H A Dalg_test.cpp277 char chars[] = {1, 2}; local
286 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
291 unsigned char chars[] = {1, 2, 255}; local
300 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
305 signed char chars[] = {93, 2, -101, 13}; local
315 first = find_first_of(intv.begin(), intv.end(), chars, char
320 char chars[] = {1, 2}; local
[all...]
H A Dequal_test.cpp92 char chars[] = "aabbccddggghhklllmqqqqssyyzz"; local
94 const unsigned count = sizeof(chars) - 1;
95 pair<char*, char*> range = equal_range((char*)chars, (char*)chars + count, 'q', less<char>());
96 CPPUNIT_ASSERT( (range.first - chars) == 18 );
97 CPPUNIT_ASSERT( (range.second - chars) == 22 );
101 range = equal_range((char*)chars, (char*)chars + count, 'm', less<char>());
/external/bluetooth/glib/tests/
H A Dfile-test.c58 char chars[62]; local
80 i = read (fd, chars, sizeof (chars));
84 chars[i] = 0;
85 g_assert (strcmp (chars, hello) == 0 && "read() didn't get same string back");
H A Dtree-test.c77 char chars[] = variable
115 for (i = 0; chars[i]; i++)
116 g_tree_insert (tree, &chars[i], &chars[i]);
120 g_assert (g_tree_nnodes (tree) == strlen (chars));
123 p = chars;
128 removed = g_tree_remove (tree, &chars[i + 10]);
145 g_tree_insert (tree, &chars[i + 10], &chars[i + 10]);
147 p = chars;
[all...]
/external/emma/core/java12/com/vladium/util/
H A DWCMatcher.java25 final char [] chars = pattern.toCharArray (); // is this faster than using charAt()?
26 final int charsLength = chars.length;
37 final char ch = chars [c];
44 chars [patternLength ++] = '*';
51 chars [patternLength ++] = ch;
61 else if (chars [0] == '*')
62 return new EndsWithMatcher (chars, patternLength);
63 else if (chars [patternLength - 1] == '*')
64 return new StartsWithMatcher (chars, patternLength);
67 return new PatternMatcher (chars, patternLengt
72 matches(char [] chars) argument
125 matches(final char [] chars) argument
144 matches(final char [] chars) argument
163 matches(final char [] chars) argument
201 matches(final char [] chars) argument
[all...]
/external/icu4c/samples/layout/
H A DScriptCompositeFontInstance.cpp63 const LEFontInstance *ScriptCompositeFontInstance::getSubFont(const LEUnicode chars[], le_int32 *offset, le_int32 limit, le_int32 script, LEErrorCode &success) const argument
69 if (chars == NULL || *offset < 0 || limit < 0 || *offset >= limit || script < 0 || script >= scriptCodeCount) {
/external/webkit/JavaScriptCore/API/
H A DJSStringRef.cpp36 JSStringRef JSStringCreateWithCharacters(const JSChar* chars, size_t numChars) argument
39 return OpaqueJSString::create(chars, numChars).releaseRef();
/external/webkit/WebKitTools/simplejson/
H A D_speedups.c9 ascii_escape_char(Py_UNICODE c, char *output, Py_ssize_t chars);
28 ascii_escape_char(Py_UNICODE c, char *output, Py_ssize_t chars) { argument
30 output[chars++] = '\\';
32 case '/': output[chars++] = (char)c; break;
33 case '\\': output[chars++] = (char)c; break;
34 case '"': output[chars++] = (char)c; break;
35 case '\b': output[chars++] = 'b'; break;
36 case '\f': output[chars++] = 'f'; break;
37 case '\n': output[chars++] = 'n'; break;
38 case '\r': output[chars
77 Py_ssize_t chars; local
125 Py_ssize_t chars; local
[all...]
/external/icu4c/common/
H A Dunistr_case.cpp60 const UChar *chars = getArrayStart(); local
62 chars += start;
65 if(chars != srcChars) {
67 int32_t result=u_strcmpFold(chars, length, srcChars, srcLength,
/external/icu4c/extra/scrptrun/
H A Dscrptrun.h38 ScriptRun(const UChar chars[], int32_t length);
40 ScriptRun(const UChar chars[], int32_t start, int32_t length);
46 void reset(const UChar chars[], int32_t start, int32_t length);
105 inline ScriptRun::ScriptRun(const UChar chars[], int32_t length) argument
107 reset(chars, 0, length);
110 inline ScriptRun::ScriptRun(const UChar chars[], int32_t start, int32_t length) argument
112 reset(chars, start, length);
146 inline void ScriptRun::reset(const UChar chars[], int32_t start, int32_t length) argument
148 charArray = chars;
/external/webkit/WebKit/android/benchmark/
H A DIntercept.cpp94 const char* chars = str.data(); local
97 char c = chars[i];
101 in.append(chars[i]);

Completed in 253 milliseconds

12345