Searched refs:letters (Results 1 - 20 of 20) sorted by relevance

/external/stlport/test/unit/
H A Dsearch_test.cpp76 char const* letters[] = { "Q", "E", "D" }; local
78 const unsigned letterCount = sizeof(letters) / sizeof(letters[0]);
79 char const** location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
83 copy((char const**)grades + 1, (char const**)grades + 1 + letterCount, (char const**)letters);
84 location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
H A Dsort_test.cpp66 char const* letters[6] = {"bb", "aa", "ll", "dd", "qq", "cc" }; local
67 stable_sort(letters, letters + 6, string_less);
69 CPPUNIT_ASSERT( strcmp(letters[0], "aa") == 0 );
70 CPPUNIT_ASSERT( strcmp(letters[1], "bb") == 0 );
71 CPPUNIT_ASSERT( strcmp(letters[2], "cc") == 0 );
72 CPPUNIT_ASSERT( strcmp(letters[3], "dd") == 0 );
73 CPPUNIT_ASSERT( strcmp(letters[4], "ll") == 0 );
74 CPPUNIT_ASSERT( strcmp(letters[5], "qq") == 0 );
/external/webkit/WebCore/rendering/
H A DRenderListMarker.cpp57 UChar letters[lettersSize]; local
68 letters[lettersSize - ++length] = digits[d];
70 letters[lettersSize - ++length] = digits[d + 1];
72 letters[lettersSize - ++length] = digits[d + 2];
74 letters[lettersSize - ++length] = digits[d];
80 return String(&letters[lettersSize - length], length);
89 UChar letters[lettersSize]; local
100 letters[lettersSize - 1] = sequence[numberShadow % sequenceSize];
105 letters[lettersSize - ++length] = sequence[numberShadow % sequenceSize - 1];
108 letters[lettersSiz
140 toHebrewUnder1000(int number, UChar letters[5]) argument
180 UChar letters[lettersSize]; local
196 toArmenianUnder10000(int number, bool upper, bool addCircumflex, UChar letters[9]) argument
243 UChar letters[lettersSize]; local
258 UChar letters[lettersSize]; local
[all...]
/external/webkit/SunSpider/tests/sunspider-0.9/
H A Dstring-validate-input.js0 letters = new Array("a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z");
44 r = zip + " contains letters.";
68 tmp += letters[l];
/external/webkit/SunSpider/tests/sunspider-0.9.1/
H A Dstring-validate-input.js0 letters = new Array("a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z");
44 r = zip + " contains letters.";
68 tmp += letters[l];
/external/bluetooth/glib/glib/
H A Dgfileutils.c1152 static const char letters[] = local
1154 static const int NLETTERS = sizeof (letters) - 1;
1177 XXXXXX[0] = letters[v % NLETTERS];
1179 XXXXXX[1] = letters[v % NLETTERS];
1181 XXXXXX[2] = letters[v % NLETTERS];
1183 XXXXXX[3] = letters[v % NLETTERS];
1185 XXXXXX[4] = letters[v % NLETTERS];
1187 XXXXXX[5] = letters[v % NLETTERS];
1879 static const char letters[] = local
1881 static const int NLETTERS = sizeof (letters)
[all...]
/external/srec/seti/sltsEngine/include/
H A Dlts_seq_internal.h112 char *letters; member in struct:LM
/external/openssl/ssl/
H A Dssltest.c1817 unsigned int *letters = local
1821 if (letters)
1840 letters[i] = 0;
1857 of `letters'. What we need to do is
1861 to all the elements whose letters
1869 through `letters' and keep the
1881 letters[c - 'A']++;
1885 if (letters[i] < 2)
1886 letters[i] = 0;
1888 letters[
1934 process_proxy_cond_val(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument
2013 process_proxy_cond_multipliers(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument
2079 process_proxy_cond_adders(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument
2143 process_proxy_cond(unsigned int letters[26], const char *cond, const char **cond_end) argument
2154 unsigned int letters[26]; /* only used with proxy_auth */ local
[all...]
/external/icu4c/samples/ucnv/
H A Dconvsamp.cpp293 "Sample 05: C: count the number of letters in a UTF-8 document\n");
307 uint32_t letters=0, total=0; local
364 letters++;
370 printf("%d letters out of %d total UChars.\n", letters, total);
393 "Sample 06: C: frequency distribution of letters in a UTF-8 document\n");
404 uint32_t letters=0, total=0; local
465 letters++;
486 printf("%d letters out of %d total UChars.\n", letters, tota
[all...]
/external/dbus/dbus/
H A Ddbus-sysdeps.c783 static const char letters[] = local
796 letters[_dbus_string_get_byte (str, i) %
797 (sizeof (letters) - 1)]);
/external/srec/seti/sltsEngine/src/
H A Drun_seq_lts.c270 lm->letters = (char*) lts_alloc(len, sizeof(char));
271 if (lm->letters == NULL) {
282 PORT_FREAD_CHAR(lm->letters, sizeof(char), len, fp);
292 char letter = toupper(lm->letters[i]);
293 lm->letters[i] = letter;
311 if (lm->letters) {
312 FREE(lm->letters);
313 lm->letters = NULL;
1254 pfprintf(PSTDOUT,"dp %c ", lm->letters[dp->letter]);
1257 pfprintf(PSTDOUT,"%c", lm->letters[wor
[all...]
/external/chromium/third_party/icu/source/test/intltest/
H A Dssearch.cpp2090 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2091 SetMonkey letterMonkey(letters);
2200 uset_close(letters);
2227 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2228 SetMonkey letterMonkey(letters);
2352 uset_close(letters);
/external/icu4c/test/intltest/
H A Dssearch.cpp2185 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2186 SetMonkey letterMonkey(letters);
2295 uset_close(letters);
2322 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2323 SetMonkey letterMonkey(letters);
2447 uset_close(letters);
/external/chromium/third_party/icu/source/tools/tzcode/
H A Dzic.c139 const char * letters, int isdst, int doquotes);
1875 doabbr(abbr, format, letters, isdst, doquotes)
1878 const char * const letters;
1888 if (letters == NULL)
1890 else (void) sprintf(abbr, format, letters);
/external/icu4c/tools/tzcode/
H A Dzic.c139 const char * letters, int isdst, int doquotes);
1875 doabbr(abbr, format, letters, isdst, doquotes)
1878 const char * const letters;
1888 if (letters == NULL)
1890 else (void) sprintf(abbr, format, letters);
/external/webkit/JavaScriptCore/tests/mozilla/Getopt/
H A DMixed.pm688 The string should consist only of letters. Upper case letters are
/external/grub/docs/
H A Dtexinfo.tex1584 % In order for the font changes to affect most math symbols and letters,
2535 \errmessage{No more lowercase letters in @enumerate; get a bigger
2548 \errmessage{No more uppercase letters in @enumerate; get a bigger
3134 % words, not control letters, because the \space would be incorrect
3138 % For control letters, we have \definedummyletter, which omits the
3191 % Non-English letters.
3255 % Control letters and accents.
3320 % We can just ignore other control letters.
3339 % Non-English letters.
3894 % This counter is funny since it counts through charcodes of letters
[all...]
/external/v8/src/
H A Djsregexp.cc1231 unibrow::uchar* letters) {
1232 int length = uncanonicalize.get(character, '\0', letters);
1236 letters[0] = character;
1268 // Only emits non-letters (things that don't have case). Only used for case
1348 // Only emits letters (things that have case). Only used for case independent
1229 GetCaseIndependentLetters(uc16 character, bool ascii_subject, unibrow::uchar* letters) argument
/external/e2fsprogs/lib/et/
H A Dtexinfo.tex1016 % This counter is funny since it counts through charcodes of letters A, B, ...
/external/iproute2/doc/
H A Dip-cref.tex150 letters. The shortcuts are convenient when \verb|ip| is used interactively,

Completed in 232 milliseconds