Home
last modified time | relevance | path

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

1234567

/external/skqp/src/core/
DSkTSort.h44 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftUp() argument
49 if (j < bottom && lessThan(array[j-1], array[j])) { in SkTHeapSort_SiftUp()
58 if (lessThan(array[j-1], x)) { in SkTHeapSort_SiftUp()
78 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftDown() argument
82 if (child < bottom && lessThan(array[child-1], array[child])) { in SkTHeapSort_SiftDown()
85 if (lessThan(x, array[child-1])) { in SkTHeapSort_SiftDown()
103 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) { in SkTHeapSort() argument
105 SkTHeapSort_SiftDown(array, i, count, lessThan); in SkTHeapSort()
111 SkTHeapSort_SiftUp(array, 1, i, lessThan); in SkTHeapSort()
123 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
[all …]
/external/skia/src/core/
DSkTSort.h44 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftUp() argument
49 if (j < bottom && lessThan(array[j-1], array[j])) { in SkTHeapSort_SiftUp()
58 if (lessThan(array[j-1], x)) { in SkTHeapSort_SiftUp()
78 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) { in SkTHeapSort_SiftDown() argument
82 if (child < bottom && lessThan(array[child-1], array[child])) { in SkTHeapSort_SiftDown()
85 if (lessThan(x, array[child-1])) { in SkTHeapSort_SiftDown()
103 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) { in SkTHeapSort() argument
105 SkTHeapSort_SiftDown(array, i, count, lessThan); in SkTHeapSort()
111 SkTHeapSort_SiftUp(array, 1, i, lessThan); in SkTHeapSort()
123 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
[all …]
/external/hamcrest/hamcrest-library/src/test/java/org/hamcrest/comparator/
DComparatorMatcherBuilderTest.java41 assertDescription("a value less than <1>", integerComparatorMatcherBuilder.lessThan(1)); in testDescription()
47 …n compared by <backwards integer comparator>", comparedBy(backwardsIntegerComparator).lessThan(1)); in testDescription()
53 …ertMismatchDescription("<1> was greater than <0>", integerComparatorMatcherBuilder.lessThan(0), 1); in testMismatchDescriptions()
54 … assertMismatchDescription("<2> was equal to <2>", integerComparatorMatcherBuilder.lessThan(2), 2); in testMismatchDescriptions()
58 …ompared by <backwards integer comparator>", comparedBy(backwardsIntegerComparator).lessThan(1), 0); in testMismatchDescriptions()
59 …ompared by <backwards integer comparator>", comparedBy(backwardsIntegerComparator).lessThan(2), 2); in testMismatchDescriptions()
68 assertThat(2, integerComparatorMatcherBuilder.lessThan(3)); in testComparesObjectsForLessThan()
69 assertThat(0, integerComparatorMatcherBuilder.lessThan(1)); in testComparesObjectsForLessThan()
95 …ustomInt(5), ComparatorMatcherBuilder.<CustomInt>usingNaturalOrdering().lessThan(new CustomInt(10)… in testComparesCustomTypesWhoseCompareToReturnsValuesGreaterThatOne()
99 assertThat(5, comparedBy(backwardsIntegerComparator).lessThan(4)); in testComparesByCustomComparator()
[all …]
DComparatorMatcherTest.java30 assertDescription("a value less than <1>", lessThan(1));
36 assertMismatchDescription("<1> was greater than <0>", lessThan(0), 1);
37 assertMismatchDescription("<2> was equal to <2>", lessThan(2), 2);
46 assertThat(2, lessThan(3));
47 assertThat(0, lessThan(1));
73 assertThat(new CustomInt(5), lessThan(new CustomInt(10)));
/external/hamcrest/hamcrest-library/src/test/java/org/hamcrest/number/
DOrderingComparisonTest.java24 assertDescription("a value less than <1>", lessThan(1)); in testDescription()
30 assertMismatchDescription("<1> was greater than <0>", lessThan(0), 1); in testMismatchDescriptions()
31 assertMismatchDescription("<2> was equal to <2>", lessThan(2), 2); in testMismatchDescriptions()
40 assertThat(2, lessThan(3)); in testComparesObjectsForLessThan()
41 assertThat(0, lessThan(1)); in testComparesObjectsForLessThan()
67 assertThat(new CustomInt(5), lessThan(new CustomInt(10))); in testComparesCustomTypesWhoseCompareToReturnsValuesGreaterThatOne()
/external/deqp-deps/glslang/Test/
Dspv.subgroupQuad.comp40 data[invocation].i4.xy = ivec2(subgroupQuadBroadcast(lessThan(data[1].i4.xy, ivec2(0)), 1));
41 data[invocation].i4.xyz = ivec3(subgroupQuadBroadcast(lessThan(data[1].i4.xyz, ivec3(0)), 1));
42 data[invocation].i4 = ivec4(subgroupQuadBroadcast(lessThan(data[1].i4, ivec4(0)), 1));
65 data[invocation].i4.xy = ivec2(subgroupQuadSwapHorizontal(lessThan(data[1].i4.xy, ivec2(0))));
66 data[invocation].i4.xyz = ivec3(subgroupQuadSwapHorizontal(lessThan(data[1].i4.xyz, ivec3(0))));
67 data[invocation].i4 = ivec4(subgroupQuadSwapHorizontal(lessThan(data[1].i4, ivec4(0))));
90 data[invocation].i4.xy = ivec2(subgroupQuadSwapVertical(lessThan(data[1].i4.xy, ivec2(0))));
91 data[invocation].i4.xyz = ivec3(subgroupQuadSwapVertical(lessThan(data[1].i4.xyz, ivec3(0))));
92 data[invocation].i4 = ivec4(subgroupQuadSwapVertical(lessThan(data[1].i4, ivec4(0))));
115 data[invocation].i4.xy = ivec2(subgroupQuadSwapDiagonal(lessThan(data[1].i4.xy, ivec2(0))));
[all …]
Dspv.vulkan100.subgroupArithmetic.comp110 data[invocation].i4.xy = ivec2(subgroupAnd(lessThan(data[1].i4.xy, ivec2(0))));
111 data[invocation].i4.xyz = ivec3(subgroupAnd(lessThan(data[1].i4.xyz, ivec3(0))));
112 data[invocation].i4 = ivec4(subgroupAnd(lessThan(data[1].i4, ivec4(0))));
125 data[invocation].i4.xy = ivec2(subgroupOr(lessThan(data[1].i4.xy, ivec2(0))));
126 data[invocation].i4.xyz = ivec3(subgroupOr(lessThan(data[1].i4.xyz, ivec3(0))));
127 data[invocation].i4 = ivec4(subgroupOr(lessThan(data[1].i4, ivec4(0))));
140 data[invocation].i4.xy = ivec2(subgroupXor(lessThan(data[1].i4.xy, ivec2(0))));
141 data[invocation].i4.xyz = ivec3(subgroupXor(lessThan(data[1].i4.xyz, ivec3(0))));
142 data[invocation].i4 = ivec4(subgroupXor(lessThan(data[1].i4, ivec4(0))));
235 data[invocation].i4.xy = ivec2(subgroupInclusiveAnd(lessThan(data[1].i4.xy, ivec2(0))));
[all …]
Dspv.subgroupArithmetic.comp110 data[invocation].i4.xy = ivec2(subgroupAnd(lessThan(data[1].i4.xy, ivec2(0))));
111 data[invocation].i4.xyz = ivec3(subgroupAnd(lessThan(data[1].i4.xyz, ivec3(0))));
112 data[invocation].i4 = ivec4(subgroupAnd(lessThan(data[1].i4, ivec4(0))));
125 data[invocation].i4.xy = ivec2(subgroupOr(lessThan(data[1].i4.xy, ivec2(0))));
126 data[invocation].i4.xyz = ivec3(subgroupOr(lessThan(data[1].i4.xyz, ivec3(0))));
127 data[invocation].i4 = ivec4(subgroupOr(lessThan(data[1].i4, ivec4(0))));
140 data[invocation].i4.xy = ivec2(subgroupXor(lessThan(data[1].i4.xy, ivec2(0))));
141 data[invocation].i4.xyz = ivec3(subgroupXor(lessThan(data[1].i4.xyz, ivec3(0))));
142 data[invocation].i4 = ivec4(subgroupXor(lessThan(data[1].i4, ivec4(0))));
235 data[invocation].i4.xy = ivec2(subgroupInclusiveAnd(lessThan(data[1].i4.xy, ivec2(0))));
[all …]
Dspv.vulkan100.subgroupPartitioned.comp137 …data[invocation].i4.xy = ivec2(subgroupPartitionedAndNV(lessThan(data[1].i4.xy, ivec2(0)), ballot…
138 …data[invocation].i4.xyz = ivec3(subgroupPartitionedAndNV(lessThan(data[1].i4.xyz, ivec3(0)), ballo…
139 … data[invocation].i4 = ivec4(subgroupPartitionedAndNV(lessThan(data[1].i4, ivec4(0)), ballot));
152 …data[invocation].i4.xy = ivec2(subgroupPartitionedOrNV(lessThan(data[1].i4.xy, ivec2(0)), ballot)…
153 …data[invocation].i4.xyz = ivec3(subgroupPartitionedOrNV(lessThan(data[1].i4.xyz, ivec3(0)), ballot…
154 … data[invocation].i4 = ivec4(subgroupPartitionedOrNV(lessThan(data[1].i4, ivec4(0)), ballot));
167 …data[invocation].i4.xy = ivec2(subgroupPartitionedXorNV(lessThan(data[1].i4.xy, ivec2(0)), ballot…
168 …data[invocation].i4.xyz = ivec3(subgroupPartitionedXorNV(lessThan(data[1].i4.xyz, ivec3(0)), ballo…
169 … data[invocation].i4 = ivec4(subgroupPartitionedXorNV(lessThan(data[1].i4, ivec4(0)), ballot));
262 …data[invocation].i4.xy = ivec2(subgroupPartitionedInclusiveAndNV(lessThan(data[1].i4.xy, ivec2(0)…
[all …]
Dspv.subgroupPartitioned.comp137 …data[invocation].i4.xy = ivec2(subgroupPartitionedAndNV(lessThan(data[1].i4.xy, ivec2(0)), ballot…
138 …data[invocation].i4.xyz = ivec3(subgroupPartitionedAndNV(lessThan(data[1].i4.xyz, ivec3(0)), ballo…
139 … data[invocation].i4 = ivec4(subgroupPartitionedAndNV(lessThan(data[1].i4, ivec4(0)), ballot));
152 …data[invocation].i4.xy = ivec2(subgroupPartitionedOrNV(lessThan(data[1].i4.xy, ivec2(0)), ballot)…
153 …data[invocation].i4.xyz = ivec3(subgroupPartitionedOrNV(lessThan(data[1].i4.xyz, ivec3(0)), ballot…
154 … data[invocation].i4 = ivec4(subgroupPartitionedOrNV(lessThan(data[1].i4, ivec4(0)), ballot));
167 …data[invocation].i4.xy = ivec2(subgroupPartitionedXorNV(lessThan(data[1].i4.xy, ivec2(0)), ballot…
168 …data[invocation].i4.xyz = ivec3(subgroupPartitionedXorNV(lessThan(data[1].i4.xyz, ivec3(0)), ballo…
169 … data[invocation].i4 = ivec4(subgroupPartitionedXorNV(lessThan(data[1].i4, ivec4(0)), ballot));
262 …data[invocation].i4.xy = ivec2(subgroupPartitionedInclusiveAndNV(lessThan(data[1].i4.xy, ivec2(0)…
[all …]
Dspv.subgroupShuffle.comp40 … data[invocation].i4.xy = ivec2(subgroupShuffle(lessThan(data[1].i4.xy, ivec2(0)), invocation));
41 … data[invocation].i4.xyz = ivec3(subgroupShuffle(lessThan(data[1].i4.xyz, ivec3(0)), invocation));
42 … data[invocation].i4 = ivec4(subgroupShuffle(lessThan(data[1].i4, ivec4(0)), invocation));
65 …data[invocation].i4.xy = ivec2(subgroupShuffleXor(lessThan(data[1].i4.xy, ivec2(0)), invocation)…
66 …data[invocation].i4.xyz = ivec3(subgroupShuffleXor(lessThan(data[1].i4.xyz, ivec3(0)), invocation)…
67 …data[invocation].i4 = ivec4(subgroupShuffleXor(lessThan(data[1].i4, ivec4(0)), invocation)…
Dspv.subgroupShuffleRelative.comp40 …data[invocation].i4.xy = ivec2(subgroupShuffleUp(lessThan(data[1].i4.xy, ivec2(0)), invocation));
41 …data[invocation].i4.xyz = ivec3(subgroupShuffleUp(lessThan(data[1].i4.xyz, ivec3(0)), invocation));
42 …data[invocation].i4 = ivec4(subgroupShuffleUp(lessThan(data[1].i4, ivec4(0)), invocation));
65 …data[invocation].i4.xy = ivec2(subgroupShuffleDown(lessThan(data[1].i4.xy, ivec2(0)), invocation…
66 …data[invocation].i4.xyz = ivec3(subgroupShuffleDown(lessThan(data[1].i4.xyz, ivec3(0)), invocation…
67 …data[invocation].i4 = ivec4(subgroupShuffleDown(lessThan(data[1].i4, ivec4(0)), invocation…
Dspv.subgroupBallot.comp55 data[invocation].i4.xy = ivec2(subgroupBroadcast(lessThan(data[1].i4.xy, ivec2(0)), 1));
56 data[invocation].i4.xyz = ivec3(subgroupBroadcast(lessThan(data[1].i4.xyz, ivec3(0)), 1));
57 data[invocation].i4 = ivec4(subgroupBroadcast(lessThan(data[1].i4, ivec4(0)), 1));
82 data[invocation].i4.xy = ivec2(subgroupBroadcastFirst(lessThan(data[1].i4.xy, ivec2(0))));
83 data[invocation].i4.xyz = ivec3(subgroupBroadcastFirst(lessThan(data[1].i4.xyz, ivec3(0))));
84 data[invocation].i4 = ivec4(subgroupBroadcastFirst(lessThan(data[1].i4, ivec4(0))));
Dspv.subgroupClustered.comp110 data[invocation].i4.xy = ivec2(subgroupClusteredAnd(lessThan(data[1].i4.xy, ivec2(0)), 1));
111 data[invocation].i4.xyz = ivec3(subgroupClusteredAnd(lessThan(data[1].i4.xyz, ivec3(0)), 1));
112 data[invocation].i4 = ivec4(subgroupClusteredAnd(lessThan(data[1].i4, ivec4(0)), 1));
125 data[invocation].i4.xy = ivec2(subgroupClusteredOr(lessThan(data[1].i4.xy, ivec2(0)), 1));
126 data[invocation].i4.xyz = ivec3(subgroupClusteredOr(lessThan(data[1].i4.xyz, ivec3(0)), 1));
127 data[invocation].i4 = ivec4(subgroupClusteredOr(lessThan(data[1].i4, ivec4(0)), 1));
140 data[invocation].i4.xy = ivec2(subgroupClusteredXor(lessThan(data[1].i4.xy, ivec2(0)), 1));
141 data[invocation].i4.xyz = ivec3(subgroupClusteredXor(lessThan(data[1].i4.xyz, ivec3(0)), 1));
142 data[invocation].i4 = ivec4(subgroupClusteredXor(lessThan(data[1].i4, ivec4(0)), 1));
Dspv.subgroupVote.comp45 data[invocation].r = int(ivec2(subgroupAllEqual(lessThan(data[1].i4.xy, ivec2(0)))));
46 data[invocation].r = int(ivec3(subgroupAllEqual(lessThan(data[1].i4.xyz, ivec3(0)))));
47 data[invocation].r = int(ivec4(subgroupAllEqual(lessThan(data[1].i4, ivec4(0)))));
/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 …]
/external/icu/icu4c/source/common/
Dstringtriebuilder.cpp137 int32_t lessThan[kMaxSplitBranchLevels]; in writeBranchSubNode() local
145 lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2); in writeBranchSubNode()
198 writeDeltaTo(lessThan[ltLength]); in writeBranchSubNode()
266 Node *lessThan[kMaxSplitBranchLevels]; in makeBranchSubNode() local
274 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode); in makeBranchSubNode()
313 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode); in makeBranchSubNode()
562 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in operator ==()
570 offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
578 lessThan->writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual->getOffset(), builder); in write()
582 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 …]
/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()
/external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/number/
DOrderingComparison.java62 public static <T extends Comparable<T>> Matcher<T> lessThan(T value) { in lessThan() method in OrderingComparison
63 return ComparatorMatcherBuilder.<T>usingNaturalOrdering().lessThan(value); in lessThan()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DStringTrieBuilder.java722 lessThan=lessThanNode; in SplitBranchNode()
734 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in equals()
745 offset=edgeNumber=lessThan.markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
752 … lessThan.writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual.getOffset(), builder); in write()
756 assert(lessThan.getOffset()>0); in write()
757 builder.writeDeltaTo(lessThan.getOffset()); // less-than in write()
762 private Node lessThan; field in StringTrieBuilder.SplitBranchNode
/external/icu/android_icu4j/src/main/java/android/icu/util/
DStringTrieBuilder.java721 lessThan=lessThanNode; in SplitBranchNode()
733 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual; in equals()
744 offset=edgeNumber=lessThan.markRightEdgesFirst(edgeNumber-1); in markRightEdgesFirst()
751 … lessThan.writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual.getOffset(), builder); in write()
755 assert(lessThan.getOffset()>0); in write()
756 builder.writeDeltaTo(lessThan.getOffset()); // less-than in write()
761 private Node lessThan; field in StringTrieBuilder.SplitBranchNode
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/
DPeriodTest.java43 p = p.lessThan(); in testMoreLessThan()
50 p = Period.lessThan(1, TimeUnit.YEAR); in testMoreLessThan()
99 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()
102 Period.lessThan(-1, TimeUnit.YEAR); in testInvalidCount()

1234567