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

1 2

  /external/junit/src/org/junit/experimental/theories/suppliers/
TestedOn.java 12 int[] ints(); method in interface:TestedOn
TestedOnSupplier.java 17 int[] ints = testedOn.ints(); local
18 for (final int i : ints) {
19 list.add(PotentialAssignment.forValue(Arrays.asList(ints).toString(), i));
  /dalvik/dexgen/src/com/android/dexgen/util/
ListIntSet.java 27 final IntList ints; field in class:ListIntSet
33 ints = new IntList();
34 ints.sort();
39 int index = ints.binarysearch(value);
42 ints.insert(-(index + 1), value);
48 int index = ints.indexOf(value);
51 ints.removeIndex(index);
57 return ints.indexOf(value) >= 0;
64 int szThis = ints.size();
65 int szOther = o.ints.size()
    [all...]
  /dalvik/dx/src/com/android/dx/util/
ListIntSet.java 27 final IntList ints; field in class:ListIntSet
33 ints = new IntList();
34 ints.sort();
39 int index = ints.binarysearch(value);
42 ints.insert(-(index + 1), value);
48 int index = ints.indexOf(value);
51 ints.removeIndex(index);
57 return ints.indexOf(value) >= 0;
64 int szThis = ints.size();
65 int szOther = o.ints.size()
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/util/
ListIntSet.java 27 final IntList ints; field in class:ListIntSet
33 ints = new IntList();
34 ints.sort();
39 int index = ints.binarysearch(value);
42 ints.insert(-(index + 1), value);
48 int index = ints.indexOf(value);
51 ints.removeIndex(index);
57 return ints.indexOf(value) >= 0;
64 int szThis = ints.size();
65 int szOther = o.ints.size()
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Utils.java 35 static Integer[] ints = new Integer[INTEGER_POOL_MAX_VALUE+1]; field in class:Utils
46 if ( ints[x]==null ) {
47 ints[x] = new Integer(x);
49 return ints[x];
  /external/stlport/test/unit/
istmit_test.cpp 100 vector<int> ints; local
103 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
104 CPPUNIT_ASSERT( ints.size() == 2 );
105 CPPUNIT_ASSERT( ints[0] == 11 );
106 CPPUNIT_ASSERT( ints[1] == 22 );
107 ints.clear();
122 * as in this current test when you extract int and string (when you extract ints
125 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
126 CPPUNIT_ASSERT( ints.size() == 2 );
127 CPPUNIT_ASSERT( ints[0] == 33 )
139 vector<int> ints; local
    [all...]
alg_test.cpp 123 int ints[] = {0, 1, 2, 3, 3, 4, 4, 4, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5}; local
129 slist<int> slint(ints, ints + ARRAY_SIZE(ints));
139 list<int> lint(ints, ints + ARRAY_SIZE(ints));
149 deque<int> dint(ints, ints + ARRAY_SIZE(ints));
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
istmit_test.cpp 100 vector<int> ints; local
103 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
104 CPPUNIT_ASSERT( ints.size() == 2 );
105 CPPUNIT_ASSERT( ints[0] == 11 );
106 CPPUNIT_ASSERT( ints[1] == 22 );
107 ints.clear();
122 * as in this current test when you extract int and string (when you extract ints
125 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
126 CPPUNIT_ASSERT( ints.size() == 2 );
127 CPPUNIT_ASSERT( ints[0] == 33 )
139 vector<int> ints; local
    [all...]
alg_test.cpp 123 int ints[] = {0, 1, 2, 3, 3, 4, 4, 4, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5}; local
129 slist<int> slint(ints, ints + ARRAY_SIZE(ints));
139 list<int> lint(ints, ints + ARRAY_SIZE(ints));
149 deque<int> dint(ints, ints + ARRAY_SIZE(ints));
    [all...]
  /ndk/tests/device/test-stlport/unit/
istmit_test.cpp 100 vector<int> ints; local
103 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
104 CPPUNIT_ASSERT( ints.size() == 2 );
105 CPPUNIT_ASSERT( ints[0] == 11 );
106 CPPUNIT_ASSERT( ints[1] == 22 );
107 ints.clear();
122 * as in this current test when you extract int and string (when you extract ints
125 copy_n(istream_int_ite(istr), 2, back_inserter(ints));
126 CPPUNIT_ASSERT( ints.size() == 2 );
127 CPPUNIT_ASSERT( ints[0] == 33 )
139 vector<int> ints; local
    [all...]
alg_test.cpp 123 int ints[] = {0, 1, 2, 3, 3, 4, 4, 4, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5}; local
129 slist<int> slint(ints, ints + ARRAY_SIZE(ints));
139 list<int> lint(ints, ints + ARRAY_SIZE(ints));
149 deque<int> dint(ints, ints + ARRAY_SIZE(ints));
    [all...]
  /external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.type/dcl.spec.auto/
p5.cpp 59 int ints[] = {1, 2, 3}; variable
60 template <const auto (*a)[3] = &ints> class D { }; // expected-error{{'auto' not allowed in template parameter}}
  /dalvik/tests/003-omnibus-opcodes/src/
Array.java 33 static void checkInts(int[] ints) {
34 assert(ints[0] == 70000);
35 assert(ints[1] == 70001);
36 assert(ints[2] == 70002);
37 assert(ints[3] == 70003);
38 assert(ints[4] == 70004);
72 static void checkRange32(int[] ints, int[] empty, int negVal1, int negVal2){
76 assert(ints.length == 5);
79 i = ints[5]; // exact bound
85 ints[5] = i; // exact boun
177 int[] ints; local
    [all...]
  /dalvik/tests/083-jit-regressions/src/
Main.java 88 Integer[] ints = (Integer[]) q.toArray(new Integer[5]); local
  /external/skia/include/utils/
SkJSON.h 196 * Creates an array of ints, initialized by copying the specified
252 int32_t* ints() const { function in class:SkJSON::Array
  /external/clang/test/Sema/
compare.c 10 int ints(long a, unsigned long b) { function
  /external/skia/src/core/
SkMemory_stdlib.cpp 88 size_t ints = size > 4 ? 4 : size; local
90 for (index = 0; index < ints; index++)
93 for (index = 0; index < ints; index++)
95 if (ints > 0)
  /libcore/luni/src/test/java/libcore/java/lang/reflect/
ArrayTest.java 28 private static int[] ints; field in class:ArrayTest
39 ints = new int[] { 0xffffffff };
50 try { Array.getBoolean(ints, 0); fail(); } catch (IllegalArgumentException expected) {}
62 try { Array.getByte(ints, 0); fail(); } catch (IllegalArgumentException expected) {}
74 try { Array.getChar(ints, 0); fail(); } catch (IllegalArgumentException expected) {}
86 assertEquals((double) ints[0], Array.getDouble(ints, 0));
98 assertEquals((float) ints[0], Array.getFloat(ints, 0));
110 assertEquals(ints[0], Array.getInt(ints, 0))
    [all...]
  /frameworks/base/telephony/java/com/android/internal/telephony/cdma/
CdmaLteServiceStateTracker.java 59 int[] ints; local
452 int[] ints = (int[])ar.result; local
461 int cdmaDbm = (ints[offset] > 0) ? -ints[offset] : -120;
462 int cdmaEcio = (ints[offset + 1] > 0) ? -ints[offset + 1] : -160;
463 int evdoRssi = (ints[offset + 2] > 0) ? -ints[offset + 2] : -120;
464 int evdoEcio = (ints[offset + 3] > 0) ? -ints[offset + 3] : -1
    [all...]
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/io/
SerializationStressTest1.java 451 int[] ints = { 0, 1, 2, 3 }; local
452 objToSave = ints;
    [all...]
  /external/chromium/base/metrics/
histogram.cc 587 uint16 ints[sizeof(Histogram::Sample) / 2]; member in union:base::__anon2719
591 sum += converter.ints[0];
592 sum = (sum << 16) ^ sum ^ (static_cast<uint32>(converter.ints[1]) << 11);
    [all...]
  /external/javassist/src/test/test/javassist/convert/
ArrayAccessReplaceTest.java 284 private int[] ints; field in class:ArrayAccessReplaceTest.Simple
322 return ints[pos];
366 ints[pos] = value;
  /external/valgrind/main/mpi/
libmpiwrap.c 670 int* ints = NULL; local
752 ints = malloc(n_ints * sizeof(int));
753 assert(ints);
765 ints, addrs, dtys );
772 walk_type_array( f, base, dtys[0], ints[0] );
781 (int)ints[0], (int)ints[1], (int)ints[2]);
782 for (i = 0; i < ints[0]; i++) {
783 walk_type_array( f, base + i * ints[2]/*stride*/ * ex
    [all...]
  /frameworks/base/core/java/android/text/
DynamicLayout.java 322 int[] ints; local
325 ints = new int[COLUMNS_ELLIPSIZE];
326 ints[ELLIPSIS_START] = ELLIPSIS_UNDEFINED;
328 ints = new int[COLUMNS_NORMAL];
334 ints[START] = reflowed.getLineStart(i) |
341 ints[TOP] = top;
347 ints[DESCENT] = desc;
351 ints[ELLIPSIS_START] = reflowed.getEllipsisStart(i);
352 ints[ELLIPSIS_COUNT] = reflowed.getEllipsisCount(i);
355 mInts.insertAt(startline + i, ints);
    [all...]

Completed in 746 milliseconds

1 2