HomeSort by relevance Sort by last modified time
    Searched refs:letters (Results 1 - 25 of 35) sorted by null

1 2

  /external/stlport/test/unit/
search_test.cpp 76 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);
sort_test.cpp 66 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 );
  /ndk/tests/device/test-gnustl-full/unit/
search_test.cpp 76 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);
sort_test.cpp 66 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 );
  /ndk/tests/device/test-stlport/unit/
search_test.cpp 76 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);
sort_test.cpp 66 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 );
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
NameNormalizer.java 69 * Returns a string containing just the letters from the original string.
72 char[] letters = name.toCharArray(); local
74 for (int i = 0; i < letters.length; i++) {
75 final char c = letters[i];
77 letters[length++] = c;
81 if (length != letters.length) {
82 return new String(letters, 0, length);
  /frameworks/ex/common/tools/
make-iana-tld-pattern.py 33 self.letters=[]
36 if (len(self.words) == 0) and (len(self.letters) == 0):
40 self.letters.sort()
68 if len(self.words) > 0 and len(self.letters) > 0:
71 if len(self.letters) == 1:
72 output += '%c%c' % (self.base, self.letters[0])
73 elif len(self.letters) > 0:
76 for letter in self.letters:
97 self.letters.append(line[1:2])
  /external/webkit/WebCore/rendering/
RenderListMarker.cpp 57 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[lettersSize - ++length] = sequence[numberShadow % sequenceSize]
180 UChar letters[lettersSize]; local
243 UChar letters[lettersSize]; local
258 UChar letters[lettersSize]; local
    [all...]
  /external/webkit/SunSpider/tests/sunspider-0.9/
string-validate-input.js 0 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];
date-format-tofte.js 76 // A textual representation of a day, three letters
141 // A short textual representation of a month, three letters
  /external/webkit/SunSpider/tests/sunspider-0.9.1/
string-validate-input.js 0 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];
date-format-tofte.js 76 // A textual representation of a day, three letters
141 // A short textual representation of a month, three letters
  /external/bluetooth/glib/glib/
gfileutils.c 1152 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
    [all...]
  /external/srec/seti/sltsEngine/include/
lts_seq_internal.h 112 char *letters; member in struct:LM
  /external/openssl/ssl/
ssltest.c 1817 unsigned int *letters = local
2154 unsigned int letters[26]; \/* only used with proxy_auth *\/ local
    [all...]
  /external/icu4c/samples/ucnv/
convsamp.cpp 293 "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, total)
    [all...]
  /external/dbus/dbus/
dbus-sysdeps.c 783 static const char letters[] = local
796 letters[_dbus_string_get_byte (str, i) %
797 (sizeof (letters) - 1)]);
  /external/srec/seti/sltsEngine/src/
run_seq_lts.c 270 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;
    [all...]
  /external/v8/test/mjsunit/
cyrillic.js 122 // A range that covers the lower case greek letters and the upper case cyrillic
123 // letters.
string-indexof-1.js 57 // Random greek letters
date-parse.js 76 // If the three first letters of the month is a
  /external/chromium/third_party/icu/source/test/intltest/
ssearch.cpp 2090 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2227 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
    [all...]
  /external/icu4c/test/intltest/
ssearch.cpp 2185 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
2322 USet *letters = uset_openPattern(letter_pattern, 39, &status); local
    [all...]
  /external/webkit/JavaScriptCore/tests/mozilla/Getopt/
Mixed.pm 688 The string should consist only of letters. Upper case letters are

Completed in 1116 milliseconds

1 2