| /art/test/046-reflect/src/ |
| Main.java | 64 String one, two, three, four; local
71 two = (String) field.get(instance);
76 System.out.println(" ::: " + one + ":" + two + ":" + three);
|
| /dalvik/tests/046-reflect/src/ |
| Main.java | 50 String one, two, three, four; local
57 two = (String) field.get(instance);
62 System.out.println(" ::: " + one + ":" + two + ":" + three);
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| IdentityHashMap2Test.java | 386 String two = "two"; local
387 String alsoTwo = new String(two); // use the new operator to ensure a
390 mapOne.put(one, two);
391 mapFour.put(one, two);
393 // these two are not equal to the above two
394 mapTwo.put(alsoOne, two);
398 assertTrue("failure of non-equality of IdentityHashMaps one and two",
402 assertTrue("failure of non-equality of IdentityHashMaps two and three"
[all...] |
| /external/chromium_org/third_party/codesighs/ |
| codesighs.c | 191 const ModuleStats* two = (const ModuleStats*)in2; local
193 unsigned long twoSize = two->mSize.mCode + two->mSize.mData;
[all...] |
| maptsvdifftool.c | 211 ModuleStats* two = (ModuleStats*)in2; local
214 int twoSize = (two->mSize.mCode + two->mSize.mData);
226 retval = strcmp(one->mModule, two->mModule);
245 SegmentStats* two = (SegmentStats*)in2; local
247 if(one->mSize < two->mSize)
251 else if(one->mSize > two->mSize)
257 retval = strcmp(one->mSegment, two->mSegment);
258 if(0 > one->mSize && 0 > two->mSize)
276 ObjectStats* two = (ObjectStats*)in2 local
307 SymbolStats* two = (SymbolStats*)in2; local
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 286 not normally significantly slower. On x86 machines the difference is normally a factor of two when performing modular
321 The last two codes listed are not actually ``return'ed'' by a function. They are placed in an integer (the caller must
594 Within the mp\_int structure are two parameters which control the limitations of the array of digits that represent
641 Setting mp\_ints to small constants is a relatively common operation. To accomodate these instances there are two
739 To both initialize and set small constants the following two functions are available.
804 In figure \ref{fig:CMP} two integers $a$ and $b$ are being compared. In this case $a$ is said to be ``to the left'' of
810 mp\_int structures. This is analogous to an absolute comparison. The function mp\_cmp\_mag() will compare two
867 To compare two mp\_int variables based on their signed value the mp\_cmp() function is provided.
874 This will compare $a$ to the left of $b$. It will first compare the signs of the two mp\_int variables. If they
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ComputingConcurrentHashMapTest.java | 236 Object two = map.getOrCompute(key); local
237 assertNotSame(one, two);
269 final Object two = new Object(); local
290 map.put(one, two);
|
| /external/stlport/test/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
763 string s("one two three one two three");
765 CPPUNIT_ASSERT( s.rfind("two") == 18 );
766 CPPUNIT_ASSERT( s.rfind("two", 0) == string::npos );
767 CPPUNIT_ASSERT( s.rfind("two", 11) == 4 );
784 string s("one two three one two three");
802 string s("one two three one two three")
958 one == two; local
959 one != two; local
[all...] |
| /hardware/invensense/65xx/libsensors_iio/software/core/mllite/ |
| ml_math_func.c | 728 * iteration works best. Corresponding square root of the power of two is returned.
815 // Two-variable NR iteration:
872 * iteration works best. Corresponding multiplier power of two is returned.
884 long two, xx;
local
897 two = 2147483647L;
939 xx = (two - x0) + 1; // Note 2 will overflow so the computation (2-x) is done with "two" == (2^30-1)
941 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 );
944 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 );
947 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 )
[all...] |
| /libcore/harmony-tests/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 33 BigInteger two = new BigInteger("2", 10); field in class:BigIntegerTest
46 BigInteger twoToTheSeventy = two.pow(70);
98 "Two random numbers in a row are the same (might not be a bug but it very likely is)",
111 .setBit(16).subtract(two)));
125 .setBit(16).subtract(two)));
128 .setBit(16).subtract(two).negate()));
232 assertTrue("Smaller number returned >= 0", one.compareTo(two) < 0);
233 assertTrue("Larger number returned >= 0", two.compareTo(one) > 0);
236 two.negate().compareTo(one) < 0);
245 assertTrue("Incorrect intValue for 2", two.intValue() == 2)
[all...] |
| /libcore/luni/src/test/java/tests/api/java/io/ |
| SerializationTestClass.java | 103 public int two; field in class:SerializationTestClass.TestFieldsTwoPublic
114 private int two; field in class:SerializationTestClass.TestFieldsTwoPrivate
123 protected int two; field in class:SerializationTestClass.TestFieldsTwoProtected
132 static int two; field in class:SerializationTestClass.TestFieldsTwoStatic
141 final int two = 0; field in class:SerializationTestClass.TestFieldsTwoFinal
150 volatile int two; field in class:SerializationTestClass.TestFieldsTwoVolatile
159 transient int two; field in class:SerializationTestClass.TestFieldsTwoTransient
|
| /libcore/luni/src/test/java/tests/api/java/util/ |
| IdentityHashMapTest.java | 382 String two = "two"; local
383 String alsoTwo = new String(two); // use the new operator to ensure a
386 mapOne.put(one, two);
387 mapFour.put(one, two);
389 // these two are not equal to the above two
390 mapTwo.put(alsoOne, two);
394 assertTrue("failure of non-equality of IdentityHashMaps one and two",
398 assertTrue("failure of non-equality of IdentityHashMaps two and three"
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
763 string s("one two three one two three");
765 CPPUNIT_ASSERT( s.rfind("two") == 18 );
766 CPPUNIT_ASSERT( s.rfind("two", 0) == string::npos );
767 CPPUNIT_ASSERT( s.rfind("two", 11) == 4 );
784 string s("one two three one two three");
802 string s("one two three one two three")
958 one == two; local
959 one != two; local
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
763 string s("one two three one two three");
765 CPPUNIT_ASSERT( s.rfind("two") == 18 );
766 CPPUNIT_ASSERT( s.rfind("two", 0) == string::npos );
767 CPPUNIT_ASSERT( s.rfind("two", 11) == 4 );
784 string s("one two three one two three");
802 string s("one two three one two three")
958 one == two; local
959 one != two; local
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/ |
| URITest.java | 1634 URI two = new URI("file:\/C:\/test\/ws"); local
[all...] |
| /external/chromium/third_party/libevent/test/ |
| regress.c | 707 * make two bases to catch signals, use both of them. this only works
1228 struct test_pri_event one, two; local
1237 memset(&two, 0, sizeof(two));
1245 timeout_set(&two.ev, test_priorities_cb, &two);
1246 if (event_priority_set(&two.ev, npriorities - 1) == -1) {
1255 if (event_add(&two.ev, &tv) == -1)
1261 event_del(&two.ev);
1264 if (one.count == 3 && two.count == 3
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| icusvtst.cpp | 362 // get a list of the factories, should be two
973 SimpleListener two(this, "two");
980 ls.addListener(&two, status);
992 ls.removeListener(&two, status);
1005 ls.addListener(&two, status);
1100 UnicodeString* two = new UnicodeString("two\/de_US"); local
[all...] |
| /external/chromium_org/third_party/libevent/test/ |
| regress.c | 707 * make two bases to catch signals, use both of them. this only works
1228 struct test_pri_event one, two; local
1237 memset(&two, 0, sizeof(two));
1245 timeout_set(&two.ev, test_priorities_cb, &two);
1246 if (event_priority_set(&two.ev, npriorities - 1) == -1) {
1255 if (event_add(&two.ev, &tv) == -1)
1261 event_del(&two.ev);
1264 if (one.count == 3 && two.count == 3
[all...] |
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| JSR166TestCase.java | 93 * a simple sentence or two describing the property that the testcase
605 public static final Integer two = new Integer(2); field in class:JSR166TestCase
[all...] |
| /external/icu4c/test/intltest/ |
| icusvtst.cpp | 362 // get a list of the factories, should be two
973 SimpleListener two(this, "two");
980 ls.addListener(&two, status);
992 ls.removeListener(&two, status);
1005 ls.addListener(&two, status);
1100 UnicodeString* two = new UnicodeString("two\/de_US"); local
[all...] |
| /external/skia/tests/ |
| PathOpsOpTest.cpp | 358 SkPath one, two; local
360 two.addRect(3, 3, 9, 9, SkPath::kCW_Direction);
361 testPathOp(reporter, one, two, kIntersect_PathOp);
365 SkPath one, two; local
367 two.addRect(3, 3, 9, 9, SkPath::kCW_Direction);
368 testPathOp(reporter, one, two, kUnion_PathOp);
372 SkPath one, two; local
374 two.addRect(3, 3, 9, 9, SkPath::kCW_Direction);
375 testPathOp(reporter, one, two, kDifference_PathOp);
379 SkPath one, two; local
386 SkPath one, two; local
393 SkPath one, two; local
400 SkPath one, two; local
407 SkPath one, two; local
[all...] |
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_feature_detection.cpp | 382 /*Filter g of length 128 in place with 14641. Output is shifted two steps
400 paddd mm0,mm6 /*2 Add 1* behind two steps*/
401 movq mm2,mm6 /*3 Start with 1* in front two steps*/
406 pshufw mm6,mm6,4Eh /*8 Swap the two double-words using bitmask 01001110=4Eh*/
415 /*Warming iteration two 17-32********************/
417 paddd mm0,mm4 /*18 Add 1* behind two steps*/
418 movq mm2,mm4 /*19 Start with 1* in front two steps*/
423 pshufw mm4,mm4,4Eh /*24 Swap the two double-words using bitmask 01001110=4Eh*/
438 paddd mm0,mm6 /*34 Add 1* behind two steps*/
439 movq mm2,mm6 /*35 Start with 1* in front two steps*
1339 float *two[4]; local
[all...] |
| /packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
| db_feature_detection.cpp | 382 /*Filter g of length 128 in place with 14641. Output is shifted two steps
400 paddd mm0,mm6 /*2 Add 1* behind two steps*/
401 movq mm2,mm6 /*3 Start with 1* in front two steps*/
406 pshufw mm6,mm6,4Eh /*8 Swap the two double-words using bitmask 01001110=4Eh*/
415 /*Warming iteration two 17-32********************/
417 paddd mm0,mm4 /*18 Add 1* behind two steps*/
418 movq mm2,mm4 /*19 Start with 1* in front two steps*/
423 pshufw mm4,mm4,4Eh /*24 Swap the two double-words using bitmask 01001110=4Eh*/
438 paddd mm0,mm6 /*34 Add 1* behind two steps*/
439 movq mm2,mm6 /*35 Start with 1* in front two steps*
1339 float *two[4]; local
[all...] |
| /packages/apps/Email/tests/src/com/android/emailcommon/utility/ |
| UtilityUnitTests.java | 267 final long[] two = Utility.toPrimitiveLongArray(createLongCollection(3, 4)); local
268 assertEquals(2, two.length);
269 assertEquals(3, two[0]);
270 assertEquals(4, two[1]);
280 final Set<Long> two = Utility.toLongSet(new long[] {1, 2}); local
281 assertEquals(2, two.size());
282 assertTrue(two.contains(1L));
283 assertTrue(two.contains(2L));
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_feature_detection.cpp | 382 /*Filter g of length 128 in place with 14641. Output is shifted two steps
400 paddd mm0,mm6 /*2 Add 1* behind two steps*/
401 movq mm2,mm6 /*3 Start with 1* in front two steps*/
406 pshufw mm6,mm6,4Eh /*8 Swap the two double-words using bitmask 01001110=4Eh*/
415 /*Warming iteration two 17-32********************/
417 paddd mm0,mm4 /*18 Add 1* behind two steps*/
418 movq mm2,mm4 /*19 Start with 1* in front two steps*/
423 pshufw mm4,mm4,4Eh /*24 Swap the two double-words using bitmask 01001110=4Eh*/
438 paddd mm0,mm6 /*34 Add 1* behind two steps*/
439 movq mm2,mm6 /*35 Start with 1* in front two steps*
1339 float *two[4]; local
[all...] |
