| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/ |
| SectionHelper.java | 299 final DefaultInformationControl ic = new DefaultInformationControl(control.getShell()); local
300 ic.setInformation(tooltip);
301 Point sz = ic.computeSizeHint();
302 ic.setSize(sz.x, sz.y);
303 ic.setVisible(false); // initially hidden
312 ic.setVisible(false);
317 ic.setLocation(control.toDisplay(10, 25)); // same offset as in PDETextHover
318 ic.setVisible(true);
324 ic.dispose();
|
| /system/core/libcutils/ |
| strdup8to16.c | 71 int ic; local
74 while ((ic = *utf8Str++) != '\0') {
78 if ((ic & 0xc0) == 0x80) {
89 expected = UTF8_SEQ_LENGTH(ic) - 1;
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mips-elf/ |
| compressed-plt-1a.s | 1 # Define a function with all "compressed" (dc and ic) references.
19 .if (\types) & IC
|
| /external/ltp/tools/pounder21/test_scripts/ |
| ramsnake | 53 NEW_ERRORS=`egrep -ic "(segmentation|fault|error|illegal)" $LOGFILE`
|
| /external/testng/src/main/java/org/testng/internal/ |
| TestNGClassFinder.java | 127 IClass ic= findOrCreateIClass(m_testContext, cls, cim.getXmlClass(cls), thisInstance, local
129 if(null != ic) {
130 Object[] theseInstances = ic.getInstances(false);
132 theseInstances = ic.getInstances(true);
135 putIClass(cls, ic);
198 } // null != ic
211 IClass ic= getIClass(clazz); local
212 if(null != ic) {
213 ic.addInstance(instance);
|
| /packages/apps/Settings/src/com/android/settings/widget/ |
| ImeAwareEditText.java | 60 final InputConnection ic = super.onCreateInputConnection(editorInfo); local
65 return ic;
|
| /development/samples/SoftKeyboard/src/com/example/android/softkeyboard/ |
| SoftKeyboard.java | 286 InputConnection ic = getCurrentInputConnection(); local
287 if (ic != null) {
288 ic.finishComposingText();
326 InputConnection ic = getCurrentInputConnection(); local
327 if (c == 0 || ic == null) {
395 InputConnection ic = getCurrentInputConnection(); local
396 if (ic != null) {
399 ic.clearMetaKeyStates(KeyEvent.META_ALT_ON);
542 InputConnection ic = getCurrentInputConnection(); local
543 if (ic == null) return
[all...] |
| /build/make/tools/acp/ |
| acp.c | 175 int ic, retVal; local
184 ic = getopt(argc, argv, "defprtuv");
185 if (ic < 0)
188 switch (ic) {
214 fprintf(stderr, "Unexpected arg -%c\n", ic);
|
| /cts/hostsidetests/inputmethodservice/deviceside/lib/src/android/inputmethodservice/cts/ime/ |
| CtsBaseInputMethod.java | 156 executeOnInputConnection(ic -> {
158 ic.commitText(text, newCursorPosition);
173 final InputConnection ic = getCurrentInputConnection(); local
174 // TODO: Check and log whether {@code ic} is null or equals to
176 if (ic != null) {
177 consumer.accept(ic);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 44 const int ic[] = {0, 0}; local
45 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
47 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
|
| /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]); ((void)sc);
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]); ((void)sc);
45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
|
| /frameworks/av/media/libaaudio/examples/loopback/src/ |
| LoopbackAnalyzer.h | 104 for (int ic = 0; ic < numCorrelations; ic++) {
105 double correlation = calculateCorrelation(&haystack[ic], needle, needleSize);
106 results[ic] = correlation;
120 int ic; local
128 for (ic = 0; ic < numCorrelations; ic++) {
129 double correlation = calculateCorrelation(&haystack[ic], needle, needleSize)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 44 const int ic[] = {0, 0}; local
45 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
47 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
|
| /prebuilts/ndk/r11/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>()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 44 const int ic[] = {0, 0}; local
45 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
47 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/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]); ((void)sc);
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]); ((void)sc);
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.difference/ |
| set_difference.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);
44 Iter2(ia), Iter2(ia+sa), OutIter(ic));
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| /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);
|
