Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:ic (Results 1 - 25 of 256) sorted by null

1 2 3 4 5 6 7 8 91011

/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
find_first_of.pass.cpp	33 int ic[] = {7}; local 36 forward_iterator<const int*>(ic), 37 forward_iterator<const int*>(ic + 1)) == 41 forward_iterator<const int*>(ic), 42 forward_iterator<const int*>(ic)) == 46 forward_iterator<const int*>(ic), 47 forward_iterator<const int*>(ic+1)) ==
find_first_of_pred.pass.cpp	36 int ic[] = {7}; local 39 forward_iterator<const int*>(ic), 40 forward_iterator<const int*>(ic + 1), 45 forward_iterator<const int*>(ic), 46 forward_iterator<const int*>(ic), 51 forward_iterator<const int*>(ic), 52 forward_iterator<const int*>(ic+1),
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/
merge.pass.cpp	34 int* ic = new int[2*N]; local 40 InIter2(ib), InIter2(ib+N), OutIter(ic)); 41 assert(base(r) == ic+2*N); 42 assert(ic[0] == 0); 43 assert(ic[2*N-1] == 2*N-1); 44 assert(std::is_sorted(ic, ic+2*N)); 45 delete [] ic; 53 int* ic = new int[2*N]; local 55 ic[i] = i     [all...]
merge_comp.pass.cpp	38 int* ic = new int[2*N]; local 47 InIter2(ib), InIter2(ib+N), OutIter(ic), pred); 48 assert(base(r) == ic+2*N); 49 assert(ic[0] == 2*N-1); 50 assert(ic[2*N-1] == 0); 51 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); 53 delete [] ic; 61 int* ic = new int[2*N]; local 63 ic[i] = i     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/
find_first_of.pass.cpp	33 int ic[] = {7}; local 36 forward_iterator<const int*>(ic), 37 forward_iterator<const int*>(ic + 1)) == 41 forward_iterator<const int*>(ic), 42 forward_iterator<const int*>(ic)) == 46 forward_iterator<const int*>(ic), 47 forward_iterator<const int*>(ic+1)) ==
find_first_of_pred.pass.cpp	36 int ic[] = {7}; local 39 forward_iterator<const int*>(ic), 40 forward_iterator<const int*>(ic + 1), 45 forward_iterator<const int*>(ic), 46 forward_iterator<const int*>(ic), 51 forward_iterator<const int*>(ic), 52 forward_iterator<const int*>(ic+1),
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/
merge.pass.cpp	32 int* ic = new int[2*N]; local 38 InIter2(ib), InIter2(ib+N), OutIter(ic)); 39 assert(base(r) == ic+2*N); 40 assert(ic[0] == 0); 41 assert(ic[2*N-1] == 2*N-1); 42 assert(std::is_sorted(ic, ic+2*N)); 43 delete [] ic; 51 int* ic = new int[2*N]; local 53 ic[i] = i     [all...]
merge_comp.pass.cpp	35 int* ic = new int[2*N]; local 43 InIter2(ib), InIter2(ib+N), OutIter(ic), std::greater<int>()); 44 assert(base(r) == ic+2*N); 45 assert(ic[0] == 2*N-1); 46 assert(ic[2*N-1] == 0); 47 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); 48 delete [] ic; 56 int* ic = new int[2*N]; local 58 ic[i] = i     [all...]
/frameworks/base/core/java/com/android/internal/view/
IInputConnectionWrapper.java	203 InputConnection ic = mInputConnection.get(); local 204 if (ic == null || !isActive()) { 209 args.callback.setTextAfterCursor(ic.getTextAfterCursor( 219 InputConnection ic = mInputConnection.get(); local 220 if (ic == null || !isActive()) { 225 args.callback.setTextBeforeCursor(ic.getTextBeforeCursor( 235 InputConnection ic = mInputConnection.get(); local 236 if (ic == null || !isActive()) { 241 args.callback.setSelectedText(ic.getSelectedText( 251 InputConnection ic = mInputConnection.get() local 267 InputConnection ic = mInputConnection.get(); local 281 InputConnection ic = mInputConnection.get(); local 290 InputConnection ic = mInputConnection.get(); local 299 InputConnection ic = mInputConnection.get(); local 308 InputConnection ic = mInputConnection.get(); local 317 InputConnection ic = mInputConnection.get(); local 326 InputConnection ic = mInputConnection.get(); local 335 InputConnection ic = mInputConnection.get(); local 344 InputConnection ic = mInputConnection.get(); local 353 InputConnection ic = mInputConnection.get(); local 366 InputConnection ic = mInputConnection.get(); local 375 InputConnection ic = mInputConnection.get(); local 384 InputConnection ic = mInputConnection.get(); local 393 InputConnection ic = mInputConnection.get(); local 402 InputConnection ic = mInputConnection.get(); local 411 InputConnection ic = mInputConnection.get(); local 420 InputConnection ic = mInputConnection.get(); local 433 InputConnection ic = mInputConnection.get(); local     [all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
reverse.pass.cpp	39 int ic[] = {0, 1, 2}; local 40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 41 std::reverse(Iter(ic), Iter(ic+sc)); 42 assert(ic[0] == 2); 43 assert(ic[1] == 1); 44 assert(ic[2] == 0);
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp	60 int ic[] = {0, 0, 0}; local 61 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 62 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); 63 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); 64 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic))     [all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
includes.pass.cpp	31 int ic[] = {1, 2}; local 32 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2)));
includes_comp.pass.cpp	32 int ic[] = {1, 2}; local 33 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
set_intersection.pass.cpp	34 int ic[20]; local 38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); 39 assert(base(ce) - ic == sr); 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 42 Iter2(ia), Iter2(ia+sa), OutIter(ic)); 43 assert(base(ce) - ic == sr); 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_intersection_comp.pass.cpp	36 int ic[20]; local 40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>()); 41 assert(base(ce) - ic == sr); 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>()); 45 assert(base(ce) - ic == sr); 46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
set_symmetric_difference.pass.cpp	35 int ic[20]; local 39 Iter2(ib), Iter2(ib+sb), OutIter(ic)); 40 assert(base(ce) - ic == sr); 41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 43 Iter2(ia), Iter2(ia+sa), OutIter(ic)); 44 assert(base(ce) - ic == sr); 45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_symmetric_difference_comp.pass.cpp	37 int ic[20]; local 42 OutIter(ic), std::less<int>()); 43 assert(base(ce) - ic == sr); 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 47 OutIter(ic), std::less<int>()); 48 assert(base(ce) - ic == sr); 49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/
set_union.pass.cpp	34 int ic[20]; local 38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); 39 assert(base(ce) - ic == sr); 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 42 Iter2(ia), Iter2(ia+sa), OutIter(ic)); 43 assert(base(ce) - ic == sr); 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_union_comp.pass.cpp	36 int ic[20]; local 40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>()); 41 assert(base(ce) - ic == sr); 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>()); 45 assert(base(ce) - ic == sr); 46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/pdfium/third_party/freetype/src/base/
ftcid.c	69 FT_Bool ic = 0; local 80 error = service->get_is_cid( face, &ic); 84 *is_cid = ic;
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/
reverse.pass.cpp	39 int ic[] = {0, 1, 2}; local 40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 41 std::reverse(Iter(ic), Iter(ic+sc)); 42 assert(ic[0] == 2); 43 assert(ic[1] == 1); 44 assert(ic[2] == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp	59 int ic[] = {0, 0, 0}; local 60 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 61 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); 62 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); 63 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic))     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/
includes.pass.cpp	31 int ic[] = {1, 2}; local 32 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2)));
includes_comp.pass.cpp	32 int ic[] = {1, 2}; local 33 const unsigned sc = sizeof(ic)/sizeof(ic[0]); 45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/
set_intersection.pass.cpp	34 int ic[20]; local 38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); 39 assert(base(ce) - ic == sr); 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); 42 Iter2(ia), Iter2(ia+sa), OutIter(ic)); 43 assert(base(ce) - ic == sr); 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);

Completed in 233 milliseconds

1 2 3 4 5 6 7 8 91011