/external/stlport/test/unit/ |
H A D | 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);
|
H A D | 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 );
|
/external/guava/guava-tests/test/com/google/common/base/ |
H A D | SplitterTest.java | 53 Iterable<String> letters = COMMA_SPLITTER.split(simple); 54 ASSERT.that(letters).hasContentsInOrder("a", "b", "c"); 59 Iterable<String> letters = Splitter.on('.').split(simple); 60 ASSERT.that(letters).hasContentsInOrder("a,b,c"); 65 Iterable<String> letters = COMMA_SPLITTER.split(doubled); 66 ASSERT.that(letters).hasContentsInOrder("a", "", "b", "c"); 71 Iterable<String> letters = COMMA_SPLITTER.split(doubled); 72 ASSERT.that(letters).hasContentsInOrder("a", "", " b", "c"); 77 Iterable<String> letters = COMMA_SPLITTER.split(trailing); 78 ASSERT.that(letters) [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | 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];
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | 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];
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
H A D | 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];
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderListMarker.cpp | 52 LChar letters[lettersSize]; local 63 letters[lettersSize - ++length] = digits[d]; 65 letters[lettersSize - ++length] = digits[d + 1]; 67 letters[lettersSize - ++length] = digits[d + 2]; 69 letters[lettersSize - ++length] = digits[d]; 75 return String(&letters[lettersSize - length], length); 89 CharacterType letters[lettersSize]; local 100 letters[lettersSize - 1] = sequence[numberShadow % sequenceSize]; 106 letters[lettersSize - ++length] = sequence[numberShadow % sequenceSize]; 110 letters[lettersSiz 128 StringBuilder letters; local 166 toHebrewUnder1000(int number, UChar letters[5]) argument 205 UChar letters[lettersSize]; local 221 toArmenianUnder10000(int number, bool upper, bool addCircumflex, UChar letters[9]) argument 266 UChar letters[lettersSize]; local 280 UChar letters[lettersSize]; local [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
H A D | lexer.py | 94 ident_chars0 = string.letters+"_" 95 ident_chars1 = string.letters+string.digits+"_" 125 ident_chars0 = string.letters+"_" 126 ident_chars1 = string.letters+string.digits+"_"
|
/external/srec/seti/sltsEngine/include/ |
H A D | lts_seq_internal.h | 112 char *letters; member in struct:LM
|
/external/openssl/ssl/ |
H A D | ssltest.c | 1914 unsigned int *letters = local 1918 if (letters) 1937 letters[i] = 0; 1954 of `letters'. What we need to do is 1958 to all the elements whose letters 1966 through `letters' and keep the 1978 letters[c - 'A']++; 1982 if (letters[i] < 2) 1983 letters[i] = 0; 1985 letters[ 2031 process_proxy_cond_val(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument 2110 process_proxy_cond_multipliers(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument 2176 process_proxy_cond_adders(unsigned int letters[26], const char *cond, const char **cond_end, int *pos, int indent) argument 2240 process_proxy_cond(unsigned int letters[26], const char *cond, const char **cond_end) argument 2251 unsigned int letters[26]; /* only used with proxy_auth */ local [all...] |
/external/wpa_supplicant_8/hostapd/src/p2p/ |
H A D | p2p_utils.c | 28 u8 letters = 'Z' - 'A' + 1; local 36 val %= 2 * letters + numbers; 37 if (val < letters) 39 else if (val < 2 * letters) 40 buf[i] = 'a' + (val - letters); 42 buf[i] = '0' + (val - 2 * letters);
|
/external/wpa_supplicant_8/src/p2p/ |
H A D | p2p_utils.c | 28 u8 letters = 'Z' - 'A' + 1; local 36 val %= 2 * letters + numbers; 37 if (val < letters) 39 else if (val < 2 * letters) 40 buf[i] = 'a' + (val - letters); 42 buf[i] = '0' + (val - 2 * letters);
|
/external/wpa_supplicant_8/wpa_supplicant/src/p2p/ |
H A D | p2p_utils.c | 28 u8 letters = 'Z' - 'A' + 1; local 36 val %= 2 * letters + numbers; 37 if (val < letters) 39 else if (val < 2 * letters) 40 buf[i] = 'a' + (val - letters); 42 buf[i] = '0' + (val - 2 * letters);
|
/external/chromium_org/third_party/icu/source/samples/ucnv/ |
H A D | convsamp.cpp | 288 "Sample 05: C: count the number of letters in a UTF-8 document\n"); 302 uint32_t letters=0, total=0; local 359 letters++; 365 printf("%d letters out of %d total UChars.\n", letters, total); 388 "Sample 06: C: frequency distribution of letters in a UTF-8 document\n"); 398 uint32_t letters=0, total=0; local 457 letters++; 481 printf("%d letters out of %d total UChars.\n", letters, tota [all...] |
/external/icu/icu4c/source/samples/ucnv/ |
H A D | convsamp.cpp | 288 "Sample 05: C: count the number of letters in a UTF-8 document\n"); 302 uint32_t letters=0, total=0; local 359 letters++; 365 printf("%d letters out of %d total UChars.\n", letters, total); 388 "Sample 06: C: frequency distribution of letters in a UTF-8 document\n"); 398 uint32_t letters=0, total=0; local 457 letters++; 481 printf("%d letters out of %d total UChars.\n", letters, tota [all...] |
/external/ltrace/testsuite/lib/ |
H A D | ltrace.exp | 290 set letters "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789" 291 set numLetters [string length $letters] 309 append randstr [string index $letters $r]
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_common_interceptors_format.inc | 235 // letters s, S or [. 277 // POSIX %a followed by s, S or [ letters).
|
/external/markdown/markdown/ |
H A D | inlinepatterns.py | 363 letters = [codepoint2name(ord(letter)) for letter in email] 364 el.text = markdown.AtomicString(''.join(letters))
|
/external/srec/seti/sltsEngine/src/ |
H A D | 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; 1254 pfprintf(PSTDOUT,"dp %c ", lm->letters[dp->letter]); 1257 pfprintf(PSTDOUT,"%c", lm->letters[wor [all...] |
/external/chromium_org/third_party/markdown/ |
H A D | inlinepatterns.py | 507 letters = [codepoint2name(ord(letter)) for letter in email] 508 el.text = util.AtomicString(''.join(letters))
|
/external/chromium_org/third_party/WebKit/Source/platform/text/ |
H A D | UnicodeUtilities.cpp | 118 // ICU's search ignores the distinction between small kana letters and ones 133 // Hiragana letters. 137 // Katakana letters. 143 // Halfwidth katakana letters. 317 // This function returns kNotFound if |first| and |second| contain different Kana letters. 358 // of matches of kana letters with other kana letters. 365 // reached the end of both; both should have the same number of kana letters. 370 // Check that single Kana letters in |a| and |b| are the same. 396 // reached the end of both; both should have the same number of kana letters [all...] |
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | ssearch.cpp | 1379 USet *letters = uset_openPattern(letter_pattern, 39, &status); local 1380 SetMonkey letterMonkey(letters); 1489 uset_close(letters);
|
/external/icu/icu4c/source/test/intltest/ |
H A D | ssearch.cpp | 1376 USet *letters = uset_openPattern(letter_pattern, 39, &status); local 1377 SetMonkey letterMonkey(letters); 1486 uset_close(letters);
|
/external/chromium_org/third_party/icu/source/tools/tzcode/ |
H A D | zic.c | 139 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/icu/icu4c/source/tools/tzcode/ |
H A D | zic.c | 139 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);
|