| /libcore/jsr166-tests/src/test/java/jsr166/ |
| TreeSubSetTest.java | 64 q.add(two);
342 assertEquals(two, e1);
503 SortedSet sm = set.subSet(two, four);
504 assertEquals(two, sm.first());
508 assertTrue(sm.contains(two));
515 assertEquals(two, k);
522 assertFalse(set.contains(two));
534 SortedSet sm = set.subSet(two, three);
536 assertEquals(two, sm.first());
537 assertEquals(two, sm.last())
[all...] |
| ConcurrentSkipListSubMapTest.java | 44 map.put(two, "B");
165 assertTrue(s.contains(two));
255 (e.getKey().equals(two) && e.getValue().equals("B")) ||
271 assertTrue(empty.containsKey(two));
363 assertEquals(two, e1.getKey());
438 assertEquals(two, e.getKey());
472 map.remove(two);
624 SortedMap sm = map.subMap(two, four);
625 assertEquals(two, sm.firstKey());
629 assertTrue(sm.containsKey(two));
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Type.java | 154 * will occupy two positions on the local variable table or stack.
391 private static CtClass findCommonSuperClass(CtClass one, CtClass two) throws NotFoundException {
393 CtClass shallow = two;
576 static boolean eq(CtClass one, CtClass two) {
577 return one == two || (one != null && two != null && one.getName().equals(two.getName()));
|
| /external/javassist/src/test/test/javassist/convert/ |
| ArrayAccessReplaceTest.java | 275 public void setMultiFoo(int one, int two, int three, Foo foo);
276 public Foo getMultiFoo(int one, int two, int three);
337 public Foo getMultiFoo(int one, int two, int three) {
338 return multi[one][two][three];
381 public void setMultiFoo(int one, int two, int three, Foo foo) {
382 multi[one][two][three] = foo;
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/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...] |
| /cts/hostsidetests/shortcuts/deviceside/multiuser/ |
| Android.mk | 15 # We build two APKs from the same source files, each with a different set of resources.
|
| /development/ndk/samples/two-libs/jni/ |
| Android.mk | 17 # generate two distinct shared libraries and have them both
|
| /external/bison/build-aux/ |
| git-version-gen | 21 # It may be run two ways:
27 # In order to use intra-version strings in your project, you will need two
169 : git describe is older two part flavor
|
| /external/clang/test/SemaCXX/ |
| undefined-internal.cpp | 96 static const int two = 2; member in struct:test6::A
109 a.value = A<Internal>::two;
|
| /external/eigen/blas/f2c/ |
| drotm.c | 21 static doublereal two = 2.; local
96 if (*n <= 0 || dflag + two == zero) {
|
| drotmg.c | 22 static doublereal two = 2.; local
113 dflag = -two;
|
| srotm.c | 21 static real two = 2.f; local
97 if (*n <= 0 || sflag + two == zero) {
|
| srotmg.c | 22 static real two = 2.f; local
115 sflag = -two;
|
| /external/skia/src/pathops/ |
| SkPathOpsCubic.h | 132 /* Given the set [0, 1, 2, 3], and two of the four members, compute an XOR mask
133 that computes the other two. Note that:
135 one ^ two == 3 for (0, 3), (1, 2)
136 one ^ two < 3 for (0, 1), (0, 2), (1, 3), (2, 3)
137 3 - (one ^ two) is either 0, 1, or 2
138 1 >> (3 - (one ^ two)) is either 0 or 1
146 inline int other_two(int one, int two) {
147 return 1 >> (3 - (one ^ two)) ^ 3;
|
| /external/strace/ |
| git-version-gen | 21 # It may be run two ways:
27 # In order to use intra-version strings in your project, you will need two
173 : git describe is older two part flavor
|
| /external/v8/test/mjsunit/ |
| call-counts.js | 11 // the two calls made from bar();
|
| /external/valgrind/none/tests/s390x/ |
| op_exception.stderr.exp | 6 did not recognise. There are two possible reasons for this.
19 did not recognise. There are two possible reasons for this.
32 did not recognise. There are two possible reasons for this.
45 did not recognise. There are two possible reasons for this.
|
| /frameworks/base/libs/hwui/tests/unit/ |
| LinearAllocatorTests.cpp | 27 int two = 2; member in struct:SimplePair
42 EXPECT_EQ(2, pair->two);
|
| /frameworks/rs/api/ |
| rs_quaternion.spec | 28 summary: Add two quaternions
30 Adds two quaternions, i.e. <code>*q += *rhs;</code>
58 summary: Dot product of two quaternions
60 Returns the dot product of two quaternions.
241 summary: Spherical linear interpolation between two quaternions
243 Performs spherical linear interpolation between two quaternions.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/armv6/ |
| vp8_variance8x8_armv6.asm | 57 uxtb16 r7, r8 ; byte (two pixels) to halfwords
58 uxtb16 r10, r8, ror #8 ; another two pixels to halfwords
83 uxtb16 r7, r8 ; byte (two pixels) to halfwords
84 uxtb16 r10, r8, ror #8 ; another two pixels to halfwords
|
| /prebuilts/go/darwin-x86/misc/cgo/gmp/ |
| fib.go | 7 // Compute Fibonacci numbers with two goroutines
|
| /prebuilts/go/darwin-x86/misc/cgo/stdio/ |
| fib.go | 9 // Compute Fibonacci numbers with two goroutines
|
| /prebuilts/go/darwin-x86/misc/cgo/test/ |
| issue9400_linux.go | 25 // We synchronize through a shared variable, so we need two procs
|
| /prebuilts/go/darwin-x86/src/bytes/ |
| bytes_decl.go | 21 // Compare returns an integer comparing two byte slices lexicographically.
|
| /prebuilts/go/darwin-x86/src/os/user/ |
| lookup_plan9.go | 16 // The latter two would require parsing /adm/users.
|
