Home
last modified time | relevance | path

Searched refs:lessThan (Results 1 – 25 of 77) sorted by relevance

1234

/external/skia/src/core/
DSkTSort.h43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftUp() argument
48 if (j < bottom && lessThan(array[j-1], array[j])) { in SkTHeapSort_SiftUp()
57 if (lessThan(array[j-1], x)) { in SkTHeapSort_SiftUp()
77 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftDown() argument
81 if (child < bottom && lessThan(array[child-1], array[child])) { in SkTHeapSort_SiftDown()
84 if (lessThan(x, array[child-1])) { in SkTHeapSort_SiftDown()
102 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) { in SkTHeapSort() argument
104 SkTHeapSort_SiftDown(array, i, count, lessThan); in SkTHeapSort()
109 SkTHeapSort_SiftUp(array, 1, i, lessThan); in SkTHeapSort()
121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
[all …]
/external/javassist/src/main/javassist/bytecode/
DCodeAttribute.java485 private static void shiftIndex(CodeIterator ci, int lessThan, int delta) throws BadBytecode { in shiftIndex() argument
493 shiftIndex8(ci, index, opcode, lessThan, delta); in shiftIndex()
497 shiftIndex0(ci, index, opcode, lessThan, delta, ILOAD_0, ILOAD); in shiftIndex()
503 shiftIndex8(ci, index, opcode, lessThan, delta); in shiftIndex()
507 shiftIndex0(ci, index, opcode, lessThan, delta, ISTORE_0, ISTORE); in shiftIndex()
512 if (var < lessThan) in shiftIndex()
528 shiftIndex8(ci, index, opcode, lessThan, delta); in shiftIndex()
531 if (var < lessThan) in shiftIndex()
540 int lessThan, int delta) in shiftIndex8() argument
544 if (var < lessThan) in shiftIndex8()
[all …]
DLocalVariableAttribute.java138 public void shiftIndex(int lessThan, int delta) { in shiftIndex() argument
142 if (org >= lessThan) in shiftIndex()
/external/proguard/src/proguard/evaluation/value/
DIntegerValue.java209 public abstract int lessThan(IntegerValue other); in lessThan() method in IntegerValue
245 return -lessThan(other); in greaterThanOrEqual()
445 public int lessThan(UnknownIntegerValue other) in lessThan() method in IntegerValue
447 return lessThan((IntegerValue)other); in lessThan()
489 return -lessThan(other); in greaterThanOrEqual()
689 public int lessThan(SpecificIntegerValue other) in lessThan() method in IntegerValue
691 return lessThan((IntegerValue)other); in lessThan()
733 return -lessThan(other); in greaterThanOrEqual()
933 public int lessThan(ParticularIntegerValue other) in lessThan() method in IntegerValue
935 return lessThan((SpecificIntegerValue)other); in lessThan()
[all …]
DSpecificIntegerValue.java184 public int lessThan(IntegerValue other) in lessThan() method in SpecificIntegerValue
322 public int lessThan(SpecificIntegerValue other) in lessThan() method in SpecificIntegerValue
DParticularIntegerValue.java216 public int lessThan(IntegerValue other) in lessThan() method in ParticularIntegerValue
344 public int lessThan(ParticularIntegerValue other) in lessThan() method in ParticularIntegerValue
/external/icu/icu4c/source/common/
Dstringtriebuilder.cpp135 int32_t lessThan[kMaxSplitBranchLevels]; in writeBranchSubNode() local
143 lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2); in writeBranchSubNode()
196 writeDeltaTo(lessThan[ltLength]); in writeBranchSubNode()
264 Node *lessThan[kMaxSplitBranchLevels]; in makeBranchSubNode() local
272 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode); in makeBranchSubNode()
311 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode); in makeBranchSubNode()
560 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in operator ==()
568 offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
576 lessThan->writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual->getOffset(), builder); in write()
580 U_ASSERT(lessThan->getOffset()>0); in write()
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DTreeRangeSetTest.java294 .has().exactly(Range.lessThan(1), Range.atLeast(6)).inOrder(); in testMergesConnectedWithOverlap()
304 .has().exactly(Range.lessThan(1), Range.atLeast(6)).inOrder(); in testMergesConnectedDisjoint()
314 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testIgnoresSmallerSharingNoBound()
324 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testIgnoresSmallerSharingLowerBound()
334 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testIgnoresSmallerSharingUpperBound()
344 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testIgnoresEqual()
354 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testExtendSameLowerBound()
364 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testExtendSameUpperBound()
374 .has().exactly(Range.lessThan(1), Range.greaterThan(6)).inOrder(); in testExtendBothDirections()
393 .has().exactly(Range.lessThan(1), Range.atLeast(6)).inOrder(); in testFillHoleExactly()
[all …]
DRangeTest.java187 Range<Integer> range = Range.lessThan(5); in testLessThan()
283 Cut<Integer> a = Range.lessThan(0).lowerBound; in testOrderingCuts()
321 assertFalse(range.encloses(Range.lessThan(3))); in testEncloses_open()
338 assertFalse(range.encloses(Range.lessThan(3))); in testEncloses_closed()
370 range.intersection(Range.lessThan(3)); in testIntersection_deFactoEmpty()
395 range.intersection(Range.lessThan(3))); in testIntersection_singleton()
473 assertEquals(Range.atMost(8), range.span(Range.lessThan(4))); in testSpan_general()
568 Range.lessThan(0).canonical(integers())); in testCanonical()
578 assertEquals(Range.lessThan(0), Range.lessThan(0).canonical(UNBOUNDED_DOMAIN)); in testCanonical_unboundedDomain()
579 assertEquals(Range.lessThan(1), Range.atMost(0).canonical(UNBOUNDED_DOMAIN)); in testCanonical_unboundedDomain()
[all …]
DImmutableRangeSetTest.java46 Range.lessThan(2),
179 expectedComplement.add(Range.lessThan(1)); in testSingleBoundedRange()
208 assertTrue(rangeSet.encloses(Range.lessThan(1))); in testSingleBoundedAboveRange()
232 .add(Range.lessThan(1)) in testMultipleBoundedRanges()
253 .add(Range.lessThan(1)) in testMultipleBoundedBelowRanges()
341 Range.lessThan(2), in testExhaustive()
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/
DPeriodTest.java42 p = p.lessThan(); in testMoreLessThan()
49 p = Period.lessThan(1, TimeUnit.YEAR); in testMoreLessThan()
95 Period.lessThan(-1, TimeUnit.YEAR); in testInvalidCount()
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/duration/
DPeriodTest.java46 p = p.lessThan(); in testMoreLessThan()
53 p = Period.lessThan(1, TimeUnit.YEAR); in testMoreLessThan()
99 Period.lessThan(-1, TimeUnit.YEAR); in testInvalidCount()
/external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/
DDfpMath.java324 if (a.equals(a.getZero()) || a.lessThan(a.getZero()) || a.isNaN()) { in log()
570 if (x.lessThan(zero)) { in pow()
584 if (x.lessThan(one) && y.classify() == Dfp.INFINITE) { in pow()
634 if (y.lessThan(x.newInstance(100000000)) && y.greaterThan(x.newInstance(-100000000))) { in pow()
744 if (x.lessThan(zero)) { in sin()
758 if (x.lessThan(pi.divide(4))) { in sin()
795 if (x.lessThan(zero)) { in cos()
809 if (x.lessThan(pi.divide(4))) { in cos()
889 if (x.lessThan(zero)) { in atan()
954 if (a.lessThan(a.getZero())) { in acos()
DDfpDec.java310 if (this.lessThan(x)) { in nextAfter()
318 if (lessThan(getZero())) { in nextAfter()
/external/icu/android_icu4j/src/main/java/android/icu/util/
DStringTrieBuilder.java718 lessThan=lessThanNode; in SplitBranchNode()
730 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in equals()
741 offset=edgeNumber=lessThan.markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
748lessThan.writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual.getOffset(), builder); in write()
752 assert(lessThan.getOffset()>0); in write()
753 builder.writeDeltaTo(lessThan.getOffset()); // less-than in write()
758 private Node lessThan; field in StringTrieBuilder.SplitBranchNode
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DStringTrieBuilder.java720 lessThan=lessThanNode; in SplitBranchNode()
732 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in equals()
743 offset=edgeNumber=lessThan.markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
750lessThan.writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual.getOffset(), builder); in write()
754 assert(lessThan.getOffset()>0); in write()
755 builder.writeDeltaTo(lessThan.getOffset()); // less-than in write()
760 private Node lessThan; field in StringTrieBuilder.SplitBranchNode
/external/mesa3d/src/glsl/builtins/profiles/
D100.glsl229 bvec2 lessThan( vec2 x, vec2 y);
230 bvec3 lessThan( vec3 x, vec3 y);
231 bvec4 lessThan( vec4 x, vec4 y);
232 bvec2 lessThan(ivec2 x, ivec2 y);
233 bvec3 lessThan(ivec3 x, ivec3 y);
234 bvec4 lessThan(ivec4 x, ivec4 y);
D110.glsl230 bvec2 lessThan( vec2 x, vec2 y);
231 bvec3 lessThan( vec3 x, vec3 y);
232 bvec4 lessThan( vec4 x, vec4 y);
233 bvec2 lessThan(ivec2 x, ivec2 y);
234 bvec3 lessThan(ivec3 x, ivec3 y);
235 bvec4 lessThan(ivec4 x, ivec4 y);
D120.glsl262 bvec2 lessThan( vec2 x, vec2 y);
263 bvec3 lessThan( vec3 x, vec3 y);
264 bvec4 lessThan( vec4 x, vec4 y);
265 bvec2 lessThan(ivec2 x, ivec2 y);
266 bvec3 lessThan(ivec3 x, ivec3 y);
267 bvec4 lessThan(ivec4 x, ivec4 y);
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
DPeriod.java63 public static Period lessThan(float count, TimeUnit unit) { in lessThan() method in Period
117 public Period lessThan() { in lessThan() method in Period
/external/icu/android_icu4j/src/main/java/android/icu/impl/duration/
DPeriod.java65 public static Period lessThan(float count, TimeUnit unit) { in lessThan() method in Period
119 public Period lessThan() { in lessThan() method in Period
/external/vulkan-validation-layers/libs/glm/gtc/
Depsilon.inl91 return lessThan(abs(x - y), vecType<T, P>(epsilon));
102 return lessThan(abs(x - y), vecType<T, P>(epsilon));
136 return lessThan(abs(v), detail::tvec4<T, P>(epsilon));
/external/apache-xml/src/main/java/org/apache/xpath/operations/
DLt.java47 return left.lessThan(right) ? XBoolean.S_TRUE : XBoolean.S_FALSE; in operate()
/external/hamcrest/library/src/org/hamcrest/number/
DOrderingComparisons.java26 public static <T extends Comparable<T>> Matcher<T> lessThan(T value) { in lessThan() method in OrderingComparisons
/external/libgdx/extensions/gdx-bullet/jni/src/extras/Serialize/BulletFileLoader/
DbDNA.h69 bool lessThan(bDNA* other);

1234