Home
last modified time | relevance | path

Searched refs:lessThan (Results 1 - 25 of 57) sorted by relevance

123

/third_party/skia/src/core/
H A DSkTSort.h34 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, const C& lessThan) { in SkTHeapSort_SiftUp() argument
39 if (j < bottom && lessThan(array[j-1], array[j])) { in SkTHeapSort_SiftUp()
48 if (lessThan(array[j-1], x)) { in SkTHeapSort_SiftUp()
68 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, const C& lessThan) { in SkTHeapSort_SiftDown() argument
72 if (child < bottom && lessThan(array[child-1], array[child])) { in SkTHeapSort_SiftDown()
75 if (lessThan(x, array[child-1])) { in SkTHeapSort_SiftDown()
86 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
91 * @param lessThan a functor with bool operator()(T a, T b) which returns true if a comes before b.
93 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, const C& lessThan) { in SkTHeapSort() argument
95 SkTHeapSort_SiftDown(array, i, count, lessThan); in SkTHeapSort()
114 SkTInsertionSort(T* left, int count, const C& lessThan) SkTInsertionSort() argument
133 SkTQSort_Partition(T* left, int count, T* pivot, const C& lessThan) SkTQSort_Partition() argument
163 SkTIntroSort(int depth, T* left, int count, const C& lessThan) SkTIntroSort() argument
194 SkTQSort(T* begin, T* end, const C& lessThan) SkTQSort() argument
[all...]
/third_party/icu/icu4c/source/common/
H A 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 in write()
[all...]
/third_party/node/deps/icu-small/source/common/
H A 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 in write()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A 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 in write()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A 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
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A 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
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/
H A DPeriodTest.java43 p = p.lessThan(); in testMoreLessThan()
50 p = Period.lessThan(1, TimeUnit.YEAR); in testMoreLessThan()
99 Period.lessThan(-1, TimeUnit.YEAR); in testInvalidCount()
100 fail("lessThan -1"); in testInvalidCount()
H A DLanguageTestFmwk.java350 p = p.lessThan(); in testLimitedUnits()
390 p = p.lessThan(); in testLimitedUnits()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/duration/
H A DPeriodTest.java46 p = p.lessThan(); in testMoreLessThan()
53 p = Period.lessThan(1, TimeUnit.YEAR); in testMoreLessThan()
102 Period.lessThan(-1, TimeUnit.YEAR); in testInvalidCount()
103 fail("lessThan -1"); in testInvalidCount()
H A DLanguageTestFmwk.java351 p = p.lessThan(); in testLimitedUnits()
391 p = p.lessThan(); in testLimitedUnits()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
H A DPeriod.java65 public static Period lessThan(float count, TimeUnit unit) { in lessThan() method in Period
119 public Period lessThan() { in lessThan() method in Period
H A DBasicPeriodBuilderFactory.java175 return Period.lessThan(eml/1000f, emu).inPast(inPast); in createLimited()
344 ts = Period.lessThan(1, settings.effectiveMinUnit()).inPast(inPast); in createWithReferenceDate()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/duration/
H A DPeriod.java67 public static Period lessThan(float count, TimeUnit unit) { in lessThan() method in Period
121 public Period lessThan() { in lessThan() method in Period
H A DBasicPeriodBuilderFactory.java176 return Period.lessThan(eml/1000f, emu).inPast(inPast); in createLimited()
345 ts = Period.lessThan(1, settings.effectiveMinUnit()).inPast(inPast); in createWithReferenceDate()
/third_party/skia/third_party/externals/oboe/samples/RhythmGame/third_party/glm/detail/
H A Dfunc_vector_relational.hpp30 /// @see <a href="http://www.opengl.org/sdk/docs/manglsl/xhtml/lessThan.xml">GLSL lessThan man page</a>
33 GLM_FUNC_DECL vecType<bool, P> lessThan(vecType<T, P> const & x, vecType<T, P> const & y);
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h378 unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {} in SplitBranchNode()
384 Node *lessThan; member in StringTrieBuilder::SplitBranchNode
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h378 unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {} in SplitBranchNode()
384 Node *lessThan; member in StringTrieBuilder::SplitBranchNode
/third_party/skia/src/codec/
H A DSkIcoCodec.cpp157 EntryLessThan lessThan; in MakeFromStream() local
158 SkTQSort(directoryEntries, directoryEntries + numImages, lessThan); in MakeFromStream()
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h378 unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {} in SplitBranchNode()
384 Node *lessThan; member in StringTrieBuilder::SplitBranchNode
/third_party/skia/src/sksl/
H A DSkSLIntrinsicList.h59 SKSL_INTRINSIC(lessThan) \
/third_party/skia/src/utils/
H A DSkPolyUtils.cpp659 bool lessThan(const ActiveEdge* that) const { in lessThan() function
1025 SkASSERT(tree->fAbove->lessThan(tree)); in VerifyTree()
1029 SkASSERT(tree->lessThan(tree->fBelow)); in VerifyTree()
1033 if ((left && tree->lessThan(left)) || (right && right->lessThan(tree))) { in VerifyTree()
/third_party/jerryscript/tests/jerry/
H A Dregression-test-issue-3114.js56 var id_84 = id_85.lessThan;
/third_party/vk-gl-cts/framework/common/
H A DtcuVectorUtil.hpp100 template<typename T> inline bool lessThan (T a, T b) { return (a < b); } in lessThan() function
244 inline Vector<bool, Size> lessThan (const Vector<T, Size>& a, const Vector<T, Size>& b) in lessThan() function
/third_party/vk-gl-cts/modules/gles31/functional/
H A Des31fSRGBDecodeTests.cpp158 " if ( all(lessThan(abs(texelSRGBAConverted - texelLinear), epsilonErr)) || all(equal(texelSRGBAConverted, texelLinear)) ) \n" in getFunctionDefinitionSRGBToLinearCheck()
178 " if ( all(lessThan(abs(colorA - colorB), epsilonErr)) || all(equal(colorA, colorB)) ) \n" in getFunctionDefinitionEqualCheck()
1443 if ( (tcu::boolAll(tcu::lessThan(tcu::abs(pixelConverted - pixelReference), m_epsilonError))) || (tcu::boolAll(tcu::equal(pixelConverted, pixelReference))) ) in verifyResult()
1514 if ( (tcu::boolAll(tcu::lessThan(tcu::abs(pixelConverted - pixelReference), m_epsilonError))) || (tcu::boolAll(tcu::equal(pixelConverted, pixelReference))) ) in verifyResult()
1582 if ( (tcu::boolAll(tcu::lessThan(tcu::abs(pixelResultList[0] - pixelReference), m_epsilonError))) || (tcu::boolAll(tcu::equal(pixelResultList[0], pixelReference))) ) in verifyResult()
1964 if ( (tcu::boolAll(tcu::lessThan(tcu::abs(pixelConverted - pixelReference), m_epsilonError))) || (tcu::boolAll(tcu::equal(pixelConverted, pixelReference))) ) in verifyResult()
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/texture/
H A DvktTextureConversionTests.cpp206 if (tcu::boolAny(tcu::lessThan(px, tcu::Vec4(-1.0f))) || tcu::boolAny(tcu::greaterThan(px, tcu::Vec4(+1.0f)))) in verifyPixels()

Completed in 24 milliseconds

123