Home
last modified time | relevance | path

Searched refs:labels (Results 1 – 9 of 9) sorted by relevance

/ndk/tests/device/test-gnustl-full/unit/
Dunique_test.cpp52 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in unique2() local
54 const unsigned count = sizeof(labels) / sizeof(labels[0]); in unique2()
56 unique((const char**)labels, (const char**)labels + count, str_equal); in unique2()
59 CPPUNIT_ASSERT(*labels[0] == 'Q'); in unique2()
60 CPPUNIT_ASSERT(*labels[1] == 'W'); in unique2()
61 CPPUNIT_ASSERT(*labels[2] == 'E'); in unique2()
62 CPPUNIT_ASSERT(*labels[3] == 'R'); in unique2()
63 CPPUNIT_ASSERT(*labels[4] == 'T'); in unique2()
64 CPPUNIT_ASSERT(*labels[5] == 'Y'); in unique2()
88 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in uniqcpy2() local
[all …]
Dbsearch_test.cpp40 char const* labels[] = { "aa", "dd", "ff", "jj", "ss", "zz" }; in bsearch2() local
41 const unsigned count = sizeof(labels) / sizeof(labels[0]); in bsearch2()
44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare)); in bsearch2()
/ndk/tests/device/test-stlport/unit/
Dunique_test.cpp52 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in unique2() local
54 const unsigned count = sizeof(labels) / sizeof(labels[0]); in unique2()
56 unique((const char**)labels, (const char**)labels + count, str_equal); in unique2()
59 CPPUNIT_ASSERT(*labels[0] == 'Q'); in unique2()
60 CPPUNIT_ASSERT(*labels[1] == 'W'); in unique2()
61 CPPUNIT_ASSERT(*labels[2] == 'E'); in unique2()
62 CPPUNIT_ASSERT(*labels[3] == 'R'); in unique2()
63 CPPUNIT_ASSERT(*labels[4] == 'T'); in unique2()
64 CPPUNIT_ASSERT(*labels[5] == 'Y'); in unique2()
88 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in uniqcpy2() local
[all …]
Dbsearch_test.cpp40 char const* labels[] = { "aa", "dd", "ff", "jj", "ss", "zz" }; in bsearch2() local
41 const unsigned count = sizeof(labels) / sizeof(labels[0]); in bsearch2()
44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare)); in bsearch2()
/ndk/sources/host-tools/sed-4.2.1/sed/
Dcompile.c115 static struct sed_label *labels = NULL; variable
1197 labels = setup_label(labels, vector->v_length, read_label(), NULL);
1655 for (lbl = labels; lbl; lbl = lbl->next)
1671 for (lbl = labels; lbl; lbl = release_label(lbl))
1673 labels = NULL;
/ndk/sources/host-tools/sed-4.2.1/testsuite/
Dbsd.sh242 echo Testing labels and branching
Dbsd.good1047 Testing labels and branching
/ndk/sources/host-tools/make-3.81/config/
Dtexinfo.tex2615 % An @enumerate whose labels are integers. The starting integer is
6611 % labels (which have a completely different output format) from
6612 % node and anchor labels. And \xrdef uses it to construct the
6795 % Figures without xref labels will not be included in the list (since
/ndk/sources/host-tools/sed-4.2.1/build-aux/
Dtexinfo.tex3514 % An @enumerate whose labels are integers. The starting integer is
7786 % labels (which have a completely different output format) from
7787 % node and anchor labels. And \xrdef uses it to construct the
7970 % Figures without xref labels will not be included in the list (since