| /external/skia/src/core/ |
| SkTSort.h | 43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
48 if (j < bottom && lessThan(array[j-1], array[j])) {
57 if (lessThan(array[j-1], x)) {
77 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) {
81 if (child < bottom && lessThan(array[child-1], array[child])) {
84 if (lessThan(x, array[child-1])) {
95 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
100 * @param lessThan a functor with bool operator()(T a, T b) which returns true if a comes before b.
102 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) {
104 SkTHeapSort_SiftDown(array, i, count, lessThan);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| Lt.java | 47 return left.lessThan(right) ? XBoolean.S_TRUE : XBoolean.S_FALSE;
|
| /external/javassist/src/main/javassist/bytecode/ |
| CodeAttribute.java | 479 * @param lessThan If the index of the local variable is
485 private static void shiftIndex(CodeIterator ci, int lessThan, int delta) throws BadBytecode {
493 shiftIndex8(ci, index, opcode, lessThan, delta);
497 shiftIndex0(ci, index, opcode, lessThan, delta, ILOAD_0, ILOAD);
503 shiftIndex8(ci, index, opcode, lessThan, delta);
507 shiftIndex0(ci, index, opcode, lessThan, delta, ISTORE_0, ISTORE);
512 if (var < lessThan)
528 shiftIndex8(ci, index, opcode, lessThan, delta);
531 if (var < lessThan)
540 int lessThan, int delta
[all...] |
| LocalVariableAttribute.java | 135 * @param lessThan the index does not change if it
138 public void shiftIndex(int lessThan, int delta) {
142 if (org >= lessThan)
|
| /external/proguard/src/proguard/evaluation/value/ |
| IntegerValue.java | 209 public abstract int lessThan(IntegerValue other);
245 return -lessThan(other);
445 public int lessThan(UnknownIntegerValue other)
447 return lessThan((IntegerValue)other);
489 return -lessThan(other);
689 public int lessThan(SpecificIntegerValue other)
691 return lessThan((IntegerValue)other);
733 return -lessThan(other);
933 public int lessThan(ParticularIntegerValue other)
935 return lessThan((SpecificIntegerValue)other)
[all...] |
| UnknownIntegerValue.java | 186 public int lessThan(IntegerValue other)
|
| ParticularIntegerValue.java | 216 public int lessThan(IntegerValue other)
344 public int lessThan(ParticularIntegerValue other)
|
| SpecificIntegerValue.java | 184 public int lessThan(IntegerValue other)
322 public int lessThan(SpecificIntegerValue other)
|
| /external/icu/icu4c/source/common/ |
| stringtriebuilder.cpp | 135 int32_t lessThan[kMaxSplitBranchLevels];
143 lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2);
196 writeDeltaTo(lessThan[ltLength]);
264 Node *lessThan[kMaxSplitBranchLevels];
272 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode);
311 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode);
560 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual;
568 offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1);
576 lessThan->writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual->getOffset(), builder)
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/ |
| PeriodTest.java | 42 p = p.lessThan();
49 p = Period.lessThan(1, TimeUnit.YEAR);
95 Period.lessThan(-1, TimeUnit.YEAR);
96 fail("lessThan -1");
|
| /external/hamcrest/library/src/org/hamcrest/number/ |
| OrderingComparisons.java | 26 public static <T extends Comparable<T>> Matcher<T> lessThan(T value) {
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
| Period.java | 63 public static Period lessThan(float count, TimeUnit unit) {
117 public Period lessThan() {
|
| BasicPeriodBuilderFactory.java | 173 return Period.lessThan(eml/1000f, emu).inPast(inPast);
327 ts = Period.lessThan(1, settings.effectiveMinUnit()).inPast(inPast);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 720 lessThan=lessThanNode;
732 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual;
743 offset=edgeNumber=lessThan.markRightEdgesFirst(edgeNumber-1);
750 lessThan.writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual.getOffset(), builder);
754 assert(lessThan.getOffset()>0);
755 builder.writeDeltaTo(lessThan.getOffset()); // less-than
760 private Node lessThan;
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| RangeTest.java | 187 Range<Integer> range = Range.lessThan(5);
283 Cut<Integer> a = Range.lessThan(0).lowerBound;
321 assertFalse(range.encloses(Range.lessThan(3)));
338 assertFalse(range.encloses(Range.lessThan(3)));
370 range.intersection(Range.lessThan(3));
395 range.intersection(Range.lessThan(3)));
473 assertEquals(Range.atMost(8), range.span(Range.lessThan(4)));
568 Range.lessThan(0).canonical(integers()));
578 assertEquals(Range.lessThan(0), Range.lessThan(0).canonical(UNBOUNDED_DOMAIN))
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/ |
| DfpMath.java | 324 if (a.equals(a.getZero()) || a.lessThan(a.getZero()) || a.isNaN()) {
570 if (x.lessThan(zero)) {
584 if (x.lessThan(one) && y.classify() == Dfp.INFINITE) {
634 if (y.lessThan(x.newInstance(100000000)) && y.greaterThan(x.newInstance(-100000000))) {
744 if (x.lessThan(zero)) {
758 if (x.lessThan(pi.divide(4))) {
795 if (x.lessThan(zero)) {
809 if (x.lessThan(pi.divide(4))) {
889 if (x.lessThan(zero)) {
954 if (a.lessThan(a.getZero()))
[all...] |
| DfpDec.java | 310 if (this.lessThan(x)) {
318 if (lessThan(getZero())) {
|
| Dfp.java | 154 /** Name for traps triggered by lessThan. */
155 private static final String LESS_THAN_TRAP = "lessThan";
750 public boolean lessThan(final Dfp x) {
848 return greaterThan(x) || lessThan(x);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XObject.java | 537 public boolean lessThan(XObject obj2)
595 return obj2.lessThan(this);
|
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 358 unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {}
364 Node *lessThan;
|
| /external/skia/src/codec/ |
| SkCodec_libico.cpp | 107 EntryLessThan lessThan;
109 lessThan);
|
| /external/guava/guava/src/com/google/common/collect/ |
| Range.java | 61 * <tr><td>{@code (-?..b)} <td>{@code {x | x < b}} <td>{@link Range#lessThan lessThan}
238 public static <C extends Comparable<?>> Range<C> lessThan(C endpoint) {
262 return lessThan(endpoint);
|
| /external/hamcrest/library/src/org/hamcrest/ |
| Matchers.java | 237 public static <T extends java.lang.Comparable<T>> org.hamcrest.Matcher<T> lessThan(T value) {
238 return org.hamcrest.number.OrderingComparisons.lessThan(value);
|
| /prebuilts/tools/common/m2/repository/org/hamcrest/hamcrest-library/1.1/ |
| hamcrest-library-1.1.jar | |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| ContiguousSetTest.java | 84 Range<Integer> range = Range.lessThan(0);
103 ContiguousSet.create(Range.lessThan(Integer.MIN_VALUE), integers()));
|
