/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | Comparator.java | 21 * A {@code Comparator} is used to compare two objects to determine their ordering with 24 * to be <i>consistent with equals</i>, its {code #compare(Object, Object)} 38 * <li>{@code compare(a,a)} returns zero for all {@code a}</li> 39 * <li>the sign of {@code compare(a,b)} must be the opposite of the sign of {@code 40 * compare(b,a)} for all pairs of (a,b)</li> 41 * <li>From {@code compare(a,b) > 0} and {@code compare(b,c) > 0} it must 42 * follow {@code compare(a,c) > 0} for all possible combinations of {@code 49 * a second {@code Object} to compare with {@code object1}. 55 public int compare( method in interface:Comparator [all...] |
H A D | PriorityQueue.java | 249 if (0 == this.compare((E) o, elements[targetIndex])) { 353 private int compare(E o1, E o2) { method in class:PriorityQueue 355 return comparator.compare(o1, o2); 366 if (compare(parent, target) <= 0) { 380 && compare(elements[childIndex + 1], elements[childIndex]) < 0) { 383 if (compare(target, elements[childIndex]) <= 0) {
|
H A D | TimSort.java | 261 if (c.compare(pivot, a[mid]) < 0) 320 if (c.compare(a[runHi++], a[lo]) < 0) { // Descending 321 while(runHi < hi && c.compare(a[runHi], a[runHi - 1]) < 0) 325 while (runHi < hi && c.compare(a[runHi], a[runHi - 1]) >= 0) 507 if (c.compare(key, a[base + hint]) > 0) { 510 while (ofs < maxOfs && c.compare(key, a[base + hint + ofs]) > 0) { 525 while (ofs < maxOfs && c.compare(key, a[base + hint - ofs]) <= 0) { 550 if (c.compare(key, a[base + m]) > 0) 578 if (c.compare(key, a[base + hint]) < 0) { 581 while (ofs < maxOfs && c.compare(ke [all...] |
/dalvik/vm/compiler/template/armv5te/ |
H A D | TEMPLATE_CMP_LONG.S | 17 * instruction epilogue code. The multi-compare approach below needs 22 cmp r1, r3 @ compare (vBB+1, vCC+1) 23 blt .L${opcode}_less @ signed compare on high part 27 bhi .L${opcode}_greater @ unsigned compare on low part
|
/dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
H A D | CollatorTest.java | 52 * @tests java.text.Collator#compare(java.lang.Object, java.lang.Object) 58 method = "compare", 75 assertTrue("a) Failed on primary difference", c.compare(o, o2) < 0); 78 assertTrue("a) Failed on secondary difference", c.compare(o, o2) < 0); 81 assertTrue("a) Failed on tertiary difference", c.compare(o, o2) < 0); 84 assertTrue("a) Failed on identical", c.compare(o, o2) < 0); 87 assertEquals("a) Failed on equivalence", 0, c.compare(o, o2)); 89 c.compare("\u01db", "v") < 0); 94 assertTrue("b) Failed on primary difference", c.compare(o, o2) < 0); 97 assertTrue("b) Failed on secondary difference", c.compare( 501 public int compare(String source, String target) { method in class:CollatorTest.TestCollator [all...] |
H A D | DecimalFormatTest.java | 1495 private void compare(String testName, String format, String expected) { method in class:DecimalFormatTest 1500 private boolean compare(int count, String format, String expected) { method in class:DecimalFormatTest 1529 compare("00.0#E0: 0.0", df.format(0.0), "00.0E0"); 1530 compare("00.0#E0: 1.0", df.format(1.0), "10.0E-1"); 1531 compare("00.0#E0: 12.0", df.format(12.0), "12.0E0"); 1532 compare("00.0#E0: 123.0", df.format(123.0), "12.3E1"); 1533 compare("00.0#E0: 1234.0", df.format(1234.0), "12.34E2"); 1534 compare("00.0#E0: 12346.0", df.format(12346.0), "12.35E3"); 1535 compare("00.0#E0: 99999.0", df.format(99999.0), "10.0E4"); 1536 compare("00. [all...] |
H A D | RuleBasedCollatorTest.java | 171 * Class under test for int compare(java.lang.String, java.lang.String) 176 method = "compare", 182 assertEquals(-1, coll.compare("c", "a")); 183 assertEquals(-1, coll.compare("a", "d")); 184 assertEquals(1, coll.compare("3", "1")); 185 assertEquals(1, coll.compare("A", "1")); 186 assertEquals(0, coll.compare("A", "A")); 204 assertTrue(coll.compare(source, source2) > 0); 397 assertEquals(-1, coll.compare(obj1, obj2)); 455 * @tests java.text.RuleBasedCollator.compare(jav [all...] |
/dalvik/vm/mterp/x86/ |
H A D | zcmp.S | 4 * Generic one-operand compare-and-branch operation. Provide a "revcmp" 12 cmpl $$0,(rFP,%ecx,4) # compare (vA, 0)
|
H A D | bincmp.S | 4 * Generic two-operand compare-and-branch operation. Provide a "revcmp" 15 cmpl (rFP,rINST_FULL,4),%eax # compare (vA, vB)
|
/dalvik/vm/mterp/armv5te/ |
H A D | OP_CMP_LONG.S | 21 * instruction epilogue code. The multi-compare approach below needs 34 cmp r1, r3 @ compare (vBB+1, vCC+1) 35 blt .L${opcode}_less @ signed compare on high part 38 bhi .L${opcode}_greater @ unsigned compare on low part
|
H A D | OP_APUT_OBJECT.S | 20 cmp r0, r3 @ compare unsigned index, length
|
H A D | OP_AGET.S | 21 cmp r1, r3 @ compare unsigned index, length
|
/dalvik/dx/src/com/android/dx/dex/code/ |
H A D | CatchTable.java | 77 int compare = thisEntry.compareTo(otherEntry); 78 if (compare != 0) { 79 return compare;
|
H A D | CatchHandlerList.java | 149 int compare = thisEntry.compareTo(otherEntry); 150 if (compare != 0) { 151 return compare;
|
/dalvik/dx/src/com/android/dx/rop/cst/ |
H A D | CstArray.java | 123 int compare = thisItem.compareTo(otherItem); 124 if (compare != 0) { 125 return compare;
|
/dalvik/vm/mterp/x86-atom/ |
H A D | OP_CMP_LONG.S | 35 cmp 4(rFP, %edx, 4), %eax # compare vCChi and vBBhi 39 cmp (rFP, %edx, 4), %eax # compare vCClo and vBBlo
|
H A D | bincmp.S | 37 cmp (rFP, %eax, 4), rINST # compare vA and vB
|
H A D | OP_AGET_WIDE.S | 38 cmp offArrayObject_length(%ecx), %edx # compare index to arrayObj->length
|
H A D | OP_APUT.S | 44 cmp offArrayObject_length(%ecx), %edx # compare index to arrayObj->length
|
H A D | OP_APUT_WIDE.S | 38 cmp offArrayObject_length(%ecx), %edx # compare index to arrayObj->length
|
H A D | zcmp.S | 32 cmp $$0, (rFP, rINST, 4) # compare vAA with zero
|
/dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/text/ |
H A D | NativeCollation.java | 73 static native int compare(int collatoraddress, String source, method in class:NativeCollation
|
H A D | Collator.java | 28 * if (myCollator.compare("abc", "ABC") < 0) { 52 * if (usCollator.compare("abc", "ABC") == 0) { 56 * For comparing Strings exactly once, the compare method provides the best 58 * When sorting a list of Strings however, it is generally necessary to compare 247 return (compare(source, target) == RESULT_EQUAL); 276 * . int result = myCollation.compare("abc", "ABC",3); 280 * . int result = myCollation.compare("abc", "ABC",3); 288 public abstract int compare(String source, String target); method in class:Collator 345 * . int result = myCollation->compare("abc", "ABC"); 364 * . int result = myCollation->compare("\\u30C [all...] |
/dalvik/libcore/text/src/main/java/java/text/ |
H A D | RuleBasedCollator.java | 135 * This allows you to use a RuleBasedCollator to compare accented strings even 397 * {@code RuleBasedCollator.compare(String, String)} has better performance. 408 public int compare(String source, String target) { method in class:RuleBasedCollator 413 return this.icuColl.compare(source, target); 446 * the object to compare with this object.
|
/dalvik/libcore/xml/src/main/java/javax/xml/datatype/ |
H A D | XMLGregorianCalendar.java | 160 * <li>partial order relation comparator method, {@link #compare(XMLGregorianCalendar xmlGregorianCalendar)}</li> 161 * <li>{@link #equals(Object)} defined relative to {@link #compare(XMLGregorianCalendar xmlGregorianCalendar)}.</li> 631 * @param xmlGregorianCalendar Instance of <code>XMLGregorianCalendar</code> to compare 642 public abstract int compare(XMLGregorianCalendar xmlGregorianCalendar); method in class:XMLGregorianCalendar 657 * @param obj to compare. 660 * and {@link #compare(XMLGregorianCalendar obj)} returns {@link DatatypeConstants#EQUAL}, otherwise <code>false</code>. 667 return compare((XMLGregorianCalendar) obj) == DatatypeConstants.EQUAL; 679 // Following two dates compare to EQUALS since in different timezones.
|