HomeSort by relevance Sort by last modified time
    Searched defs:ic (Results 1 - 25 of 178) sorted by null

1 2 3 4 5 6 7 8

  /ndk/sources/cxx-stl/llvm-libc++/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++/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 196 InputConnection ic = mInputConnection.get(); local
197 if (ic == null || !isActive()) {
202 args.callback.setTextAfterCursor(ic.getTextAfterCursor(
212 InputConnection ic = mInputConnection.get(); local
213 if (ic == null || !isActive()) {
218 args.callback.setTextBeforeCursor(ic.getTextBeforeCursor(
228 InputConnection ic = mInputConnection.get(); local
229 if (ic == null || !isActive()) {
234 args.callback.setSelectedText(ic.getSelectedText(
244 InputConnection ic = mInputConnection.get() local
260 InputConnection ic = mInputConnection.get(); local
274 InputConnection ic = mInputConnection.get(); local
283 InputConnection ic = mInputConnection.get(); local
292 InputConnection ic = mInputConnection.get(); local
301 InputConnection ic = mInputConnection.get(); local
310 InputConnection ic = mInputConnection.get(); local
319 InputConnection ic = mInputConnection.get(); local
328 InputConnection ic = mInputConnection.get(); local
337 InputConnection ic = mInputConnection.get(); local
346 InputConnection ic = mInputConnection.get(); local
359 InputConnection ic = mInputConnection.get(); local
368 InputConnection ic = mInputConnection.get(); local
377 InputConnection ic = mInputConnection.get(); local
386 InputConnection ic = mInputConnection.get(); local
395 InputConnection ic = mInputConnection.get(); local
404 InputConnection ic = mInputConnection.get(); local
413 InputConnection ic = mInputConnection.get(); local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/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);
reverse_copy.pass.cpp 42 const int ic[] = {0, 1, 2}; local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
  /ndk/sources/cxx-stl/llvm-libc++/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++/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);
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);
  /ndk/sources/cxx-stl/llvm-libc++/test/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);
  /ndk/sources/cxx-stl/llvm-libc++/test/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);
  /ndk/tests/device/test-stlport_shared-exception/jni/
new5.cpp 14 Inner * ic = new (std::nothrow) Inner[1]; // SegFault here local
  /ndk/tests/device/test-stlport_static-exception/jni/
new5.cpp 14 Inner * ic = new (std::nothrow) Inner[1]; // SegFault here local
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
RichInputConnectionTests.java 141 final RichInputConnection ic = new RichInputConnection(mockInputMethodService); local
147 ic.beginBatchEdit();
149 r = ic.getWordRangeAtCursor(" ", 0);
153 r = ic.getWordRangeAtCursor(" ", 1);
155 ic.endBatchEdit();
159 ic.beginBatchEdit();
160 r = ic.getWordRangeAtCursor("\t", 1);
161 ic.endBatchEdit();
166 ic.beginBatchEdit();
167 r = ic.getWordRangeAtCursor("\t", 1)
    [all...]
  /frameworks/base/core/java/com/android/internal/statusbar/
StatusBarIconList.java 58 StatusBarIcon ic = mIcons[i]; local
59 if (ic == null) {
63 ic.writeToParcel(out, flags);
  /external/jmonkeyengine/engine/src/core/com/jme3/audio/
AudioKey.java 132 InputCapsule ic = im.getCapsule(this); local
133 stream = ic.readBoolean("do_stream", false);
134 streamCache = ic.readBoolean("use_stream_cache", false);
  /external/jmonkeyengine/engine/src/core/com/jme3/font/
Kerning.java 70 InputCapsule ic = im.getCapsule(this); local
71 second = ic.readInt("second", 0);
72 amount = ic.readInt("amount", 0);
  /external/jmonkeyengine/engine/src/core-effects/com/jme3/post/filters/
ColorOverlayFilter.java 108 InputCapsule ic = im.getCapsule(this); local
109 color = (ColorRGBA) ic.readSavable("color", ColorRGBA.White);
  /external/webkit/Source/WebKit/chromium/src/
WebDevToolsFrontendImpl.cpp 95 InspectorController* ic = m_webViewImpl->page()->inspectorController(); local
96 ic->setInspectorFrontendClient(new InspectorFrontendClientImpl(m_webViewImpl->page(), m_client, this));
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.rotate/
rotate.pass.cpp 55 int ic[] = {0, 1, 2}; local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc));
58 assert(base(r) == ic+sc);
59 assert(ic[0] == 0);
60 assert(ic[1] == 1);
61 assert(ic[2] == 2)
253 std::unique_ptr<int> ic[3]; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.search/
search_pred.pass.cpp 77 int ic[] = {1}; local
78 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1));

Completed in 316 milliseconds

1 2 3 4 5 6 7 8