/ndk/tests/device/test-gnustl-full/unit/ |
H A D | binsert_test.cpp | 33 vector<const char*> names; local 34 back_insert_iterator<vector<const char*> > bit(names); 37 CPPUNIT_ASSERT(!strcmp(names[0],array[0])); 38 CPPUNIT_ASSERT(!strcmp(names[1],array[1])); 39 CPPUNIT_ASSERT(!strcmp(names[2],array[2])); 42 CPPUNIT_ASSERT(!strcmp(names[3],array[0])); 43 CPPUNIT_ASSERT(!strcmp(names[4],array[1])); 44 CPPUNIT_ASSERT(!strcmp(names[5],array[2])); 49 vector<const char*> names; local 50 copy(array, array + 3, back_inserter(names)); [all...] |
H A D | finsert_test.cpp | 34 deque<char const*> names; local 35 front_insert_iterator<deque<char const*> > fit(names); 36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); 38 CPPUNIT_ASSERT(names[0]==array[2]); 39 CPPUNIT_ASSERT(names[1]==array[1]); 40 CPPUNIT_ASSERT(names[2]==array[0]); 43 CPPUNIT_ASSERT(names[3]==array[2]); 44 CPPUNIT_ASSERT(names[4]==array[1]); 45 CPPUNIT_ASSERT(names[5]==array[0]); 52 deque<char const*> names; local [all...] |
H A D | includes_test.cpp | 66 char const* names[] = { "Todd", "Mike", "Graham", "Jack", "Brett"}; local 68 const unsigned nameSize = sizeof(names)/sizeof(names[0]); 71 v1[i] = names[i];
|
H A D | max_test.cpp | 59 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 61 const unsigned namesCt = sizeof(names) / sizeof(names[0]); 62 const char** r = max_element((const char**)names, (const char**)names + namesCt, str_compare);
|
H A D | min_test.cpp | 57 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 59 const unsigned namesCt = sizeof(names) / sizeof(names[0]); 60 const char** r = min_element((const char**)names, (const char**)names + namesCt, str_compare);
|
H A D | partial_test.cpp | 99 char const* names[] = { "aa", "ff", "dd", "ee", "cc", "bb" }; local 101 const unsigned nameSize = sizeof(names) / sizeof(names[0]); 104 v1[i] = names[i]; 110 CPPUNIT_ASSERT( v1[0] == names[0] ); 112 CPPUNIT_ASSERT( v1[1] == names[5] ); 114 CPPUNIT_ASSERT( v1[2] == names[4] ); 116 CPPUNIT_ASSERT( v1[3] == names[1] ); 118 CPPUNIT_ASSERT( v1[4] == names[3] ); 120 CPPUNIT_ASSERT( v1[5] == names[ 155 char const* names[] = { "aa", "ff", "dd", "ee", "cc", "bb" }; local [all...] |
H A D | adj_test.cpp | 70 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 72 const int nameCount = sizeof(names)/sizeof(names[0]); 75 v[i] = names[i];
|
/ndk/tests/device/test-stlport/unit/ |
H A D | binsert_test.cpp | 33 vector<const char*> names; local 34 back_insert_iterator<vector<const char*> > bit(names); 37 CPPUNIT_ASSERT(!strcmp(names[0],array[0])); 38 CPPUNIT_ASSERT(!strcmp(names[1],array[1])); 39 CPPUNIT_ASSERT(!strcmp(names[2],array[2])); 42 CPPUNIT_ASSERT(!strcmp(names[3],array[0])); 43 CPPUNIT_ASSERT(!strcmp(names[4],array[1])); 44 CPPUNIT_ASSERT(!strcmp(names[5],array[2])); 49 vector<const char*> names; local 50 copy(array, array + 3, back_inserter(names)); [all...] |
H A D | finsert_test.cpp | 34 deque<char const*> names; local 35 front_insert_iterator<deque<char const*> > fit(names); 36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); 38 CPPUNIT_ASSERT(names[0]==array[2]); 39 CPPUNIT_ASSERT(names[1]==array[1]); 40 CPPUNIT_ASSERT(names[2]==array[0]); 43 CPPUNIT_ASSERT(names[3]==array[2]); 44 CPPUNIT_ASSERT(names[4]==array[1]); 45 CPPUNIT_ASSERT(names[5]==array[0]); 52 deque<char const*> names; local [all...] |
H A D | includes_test.cpp | 66 char const* names[] = { "Todd", "Mike", "Graham", "Jack", "Brett"}; local 68 const unsigned nameSize = sizeof(names)/sizeof(names[0]); 71 v1[i] = names[i];
|
H A D | max_test.cpp | 59 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 61 const unsigned namesCt = sizeof(names) / sizeof(names[0]); 62 const char** r = max_element((const char**)names, (const char**)names + namesCt, str_compare);
|
H A D | min_test.cpp | 57 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 59 const unsigned namesCt = sizeof(names) / sizeof(names[0]); 60 const char** r = min_element((const char**)names, (const char**)names + namesCt, str_compare);
|
H A D | partial_test.cpp | 99 char const* names[] = { "aa", "ff", "dd", "ee", "cc", "bb" }; local 101 const unsigned nameSize = sizeof(names) / sizeof(names[0]); 104 v1[i] = names[i]; 110 CPPUNIT_ASSERT( v1[0] == names[0] ); 112 CPPUNIT_ASSERT( v1[1] == names[5] ); 114 CPPUNIT_ASSERT( v1[2] == names[4] ); 116 CPPUNIT_ASSERT( v1[3] == names[1] ); 118 CPPUNIT_ASSERT( v1[4] == names[3] ); 120 CPPUNIT_ASSERT( v1[5] == names[ 155 char const* names[] = { "aa", "ff", "dd", "ee", "cc", "bb" }; local [all...] |
H A D | adj_test.cpp | 70 const char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 72 const int nameCount = sizeof(names)/sizeof(names[0]); 75 v[i] = names[i];
|
/ndk/sources/android/support/src/musl-ctype/ |
H A D | iswctype.c | 54 static const char names[] = local 59 for (i=1, p=names; *p; i++, p+=6)
|
/ndk/sources/host-tools/nawk-20071023/ |
H A D | maketab.c | 26 * this program makes the table to link function names 111 char *names[SIZE]; variable 126 names[i] = ""; 152 names[tok-FIRSTTOKEN] = (char *) malloc(strlen(name)+1); 153 strcpy(names[tok-FIRSTTOKEN], name); 164 printf("\tnullproc,\t/* %s */\n", names[i]); 166 printf("\t%s,\t/* %s */\n", table[i], names[i]);
|
/ndk/sources/host-tools/make-3.81/ |
H A D | ar.c | 59 /* Parse the archive-member reference NAME into the archive and member names. 272 char **names; 295 /* Now put the names into a vector for sorting. */ 296 names = (char **) alloca (state.n * sizeof (char *)); 299 names[i++] = n->name; 302 qsort ((char *) names, i, sizeof (*names), alpha_compare); 307 n->name = names[i++]; 269 char **names; local
|
H A D | rule.c | 167 char **names, **percents; 192 names = (char **) xmalloc (2 * sizeof (char *)); 194 names[0] = targname; 196 names[1] = percents[1] = 0; 211 create_pattern_rule (names, percents, 0, deps, cmds, 0); 164 char **names, **percents; local
|
/ndk/sources/host-tools/make-3.81/glob/ |
H A D | glob.c | 445 points past the final }. We will accumulate result names from 511 file names, we can safely assume that wherever it 920 names followed by the filename. */ 1025 /* Append slashes to directory names. */ 1227 struct globlink *names = NULL; 1278 names = (struct globlink *) __alloca (sizeof (struct globlink)); 1279 names->name = (char *) malloc (1); 1280 if (names->name == NULL) 1282 names->name[0] = '\0'; 1283 names 1226 struct globlink *names = NULL; local [all...] |
/ndk/sources/cxx-stl/stlport/src/c_locale_win32/ |
H A D | c_locale_win32.c | 1265 const char **names = (const char**)ltime->month; local 1266 return names[month]; 1270 const char **names = (const char**)ltime->abbrev_month; local 1271 return names[month]; 1275 const char **names = (const char**)ltime->dayofweek; local 1276 return names[day]; 1280 const char **names = (const char**)ltime->abbrev_dayofweek; local 1281 return names[day];
|