Home
last modified time | relevance | path

Searched refs:smaller (Results 1 - 25 of 44) sorted by relevance

12

/third_party/curl/lib/
H A Dsplay.c32 * negative value: when i is smaller than j
49 N.smaller = N.larger = NULL; in Curl_splay()
55 if(!t->smaller) in Curl_splay()
57 if(compare(i, t->smaller->key) < 0) { in Curl_splay()
58 y = t->smaller; /* rotate smaller */ in Curl_splay()
59 t->smaller = y->larger; in Curl_splay()
62 if(!t->smaller) in Curl_splay()
65 r->smaller = t; /* link smaller */ in Curl_splay()
[all...]
H A Dsplay.h30 struct Curl_tree *smaller; /* smaller node */ member
/third_party/skia/tests/
H A DPDFJpegEmbedTest.cpp17 static bool is_subset_of(SkData* smaller, SkData* larger) { in is_subset_of() argument
18 SkASSERT(smaller && larger); in is_subset_of()
19 if (smaller->size() > larger->size()) { in is_subset_of()
22 size_t size = smaller->size(); in is_subset_of()
25 if (0 == memcmp(larger->bytes() + i, smaller->bytes(), size)) { in is_subset_of()
H A DPathOpsAngleIdeas.cpp609 double smaller = SK_Scalar1;
637 if (smaller > min) {
641 smaller = min;
/third_party/skia/src/codec/
H A DSkAndroidCodec.cpp243 auto smaller = this->getSampledDimensions(sampleSize + 1); in computeSampleSize() local
244 if (smaller == *desiredSize) { in computeSampleSize()
247 if (smaller == computedSize || smaller_than(smaller, *desiredSize)) { in computeSampleSize()
248 // Cannot get any smaller without being smaller than desired. in computeSampleSize()
254 computedSize = smaller; in computeSampleSize()
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/
H A DPeriodBuilderFactoryTest.java41 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
49 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
55 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/duration/
H A DPeriodBuilderFactoryTest.java44 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
52 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
58 for (TimeUnit unit = YEAR; unit != null; unit = unit.smaller()) { in testSetAvailableUnitRange()
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128_test.cc738 absl::int128 smaller; in TEST() member
748 SCOPED_TRACE(::testing::Message() << "pair.smaller = " << pair.smaller in TEST()
751 EXPECT_TRUE(pair.smaller == pair.smaller); // NOLINT(readability/check) in TEST()
753 EXPECT_FALSE(pair.smaller == pair.larger); // NOLINT(readability/check) in TEST()
755 EXPECT_TRUE(pair.smaller != pair.larger); // NOLINT(readability/check) in TEST()
756 EXPECT_FALSE(pair.smaller != pair.smaller); // NOLINT(readability/check) in TEST()
759 EXPECT_TRUE(pair.smaller < pai in TEST()
[all...]
/third_party/cJSON/
H A DcJSON_Utils.c537 cJSON *smaller = NULL; in sort_list() local
540 smaller = first; in sort_list()
544 smaller = second; in sort_list()
549 /* start merged list with the smaller element */ in sort_list()
550 result_tail = smaller; in sort_list()
551 result = smaller; in sort_list()
555 /* add smaller element to the list */ in sort_list()
556 result_tail->next = smaller; in sort_list()
557 smaller->prev = result_tail; in sort_list()
558 result_tail = smaller; in sort_list()
[all...]
/third_party/python/Lib/test/
H A Dtest_dict.py630 smaller = fn({1:1, 2:2})
635 self.assertTrue(smaller < larger)
636 self.assertTrue(smaller <= larger)
637 self.assertTrue(larger > smaller)
638 self.assertTrue(larger >= smaller)
640 self.assertFalse(smaller >= larger)
641 self.assertFalse(smaller > larger)
642 self.assertFalse(larger <= smaller)
643 self.assertFalse(larger < smaller)
645 self.assertFalse(smaller < larger
[all...]
H A Dtest_struct.py360 # smaller <- largest representable float less than base.
364 smaller = base - delta
366 packed = struct.pack("<f", smaller)
371 bigpacked = struct.pack(">f", smaller)
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
H A DTimeUnit.java63 /** Returns the next smaller time unit, or null if this is the smallest. */
64 public TimeUnit smaller() { in smaller() method in TimeUnit
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/duration/
H A DTimeUnit.java65 /** Returns the next smaller time unit, or null if this is the smallest. */
66 public TimeUnit smaller() { in smaller() method in TimeUnit
/third_party/mesa3d/src/gallium/frontends/lavapipe/
H A Dlvp_pipeline.c712 const struct lvp_pipeline_layout *smaller = dst->layout->vk.set_count < src->vk.set_count ? dst->layout : src; in merge_layouts() local
713 const struct lvp_pipeline_layout *bigger = smaller == dst->layout ? src : dst->layout; in merge_layouts()
714 for (unsigned i = 0; i < smaller->vk.set_count; i++) { in merge_layouts()
715 if (!smaller->vk.set_layouts[i] || !bigger->vk.set_layouts[i] || in merge_layouts()
716 smaller->vk.set_layouts[i] == bigger->vk.set_layouts[i]) in merge_layouts()
720 vk_to_lvp_descriptor_set_layout(smaller->vk.set_layouts[i]); in merge_layouts()
/third_party/icu/tools/colprobe/
H A Dcolprobe.cpp368 UBool trySwamped(Line **smaller, Line **greater, UChar chars[2], CompareFn comparer) { in trySwamped() argument
369 u_strcpy(gSource->name, (*smaller)->name); in trySwamped()
370 gSource->name[(*smaller)->len] = separatorChar; in trySwamped()
371 gSource->name[(*smaller)->len+1] = chars[0]; in trySwamped()
372 gSource->name[(*smaller)->len+2] = 0; in trySwamped()
373 gSource->len = (*smaller)->len+2; in trySwamped()
388 UBool trySwamps(Line **smaller, Line **greater, UChar chars[2], CompareFn comparer) { in trySwamps() argument
391 u_strcpy(gSource->name+2, (*smaller)->name); in trySwamps()
392 gSource->len = (*smaller)->len+2; in trySwamps()
645 // the elements before it are already smaller in positionExpansions()
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsTSect.cpp1259 SkTSpan* smaller = nullptr; in mergeCoincidence() local
1268 if (smaller && smaller->fEndT < test->fStartT) { in mergeCoincidence()
1271 smaller = test; in mergeCoincidence()
1273 if (!smaller) { in mergeCoincidence()
1276 smallLimit = smaller->fEndT; in mergeCoincidence()
1283 if (test->fStartT < smaller->fEndT) { in mergeCoincidence()
1286 SkOPASSERT(test->fStartT != smaller->fEndT); in mergeCoincidence()
1297 double midT = (smaller->fEndT + larger->fStartT) / 2; in mergeCoincidence()
1302 smaller in mergeCoincidence()
[all...]
/third_party/curl/tests/unit/
H A Dunit1309.c68 splayprint(t->smaller, d + 1, output); in splayprint()
/third_party/musl/dist/
H A Dconfig.mak26 # Uncomment for smaller code size.
/third_party/ffmpeg/tools/
H A Dpatcheck174 arrays fitting in smaller types
/third_party/skia/src/core/
H A DSkStroke.cpp341 // is preserved and don't add the smaller one. in finishContour()
554 this table shows the index of the smaller of the remaining points:
564 If outer_1 == 0 and outer_2 == 1, the smaller of the remaining indices (2 and 3) is 2.
1009 SkVector smaller = quad[1] - quad[0];
1011 SkScalar smallerLen = SkPointPriv::LengthSqd(smaller);
1015 swap(smaller, larger);
1018 if (!smaller.setLength(largerLen)) {
1021 SkScalar dot = smaller.dot(larger);
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/htmldiff/
H A Dhtmldiff.pl306 font-size: smaller;
/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c441 #define smaller(tree, n, m, depth) \ macro
448 * when the heap property is re-established (each father smaller than its
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
464 /* Exit if v is smaller than both sons */
465 if (smaller(tree, v, s->heap[j], s->depth)) break;
/third_party/node/deps/zlib/
H A Dtrees.c497 #define smaller(tree, n, m, depth) \ macro
504 * when the heap property is re-established (each father smaller than its
513 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) { in pqdownheap()
516 /* Exit if v is smaller than both sons */ in pqdownheap()
517 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c449 #define smaller(tree, n, m, depth) \ macro
456 * when the heap property is re-established (each father smaller than its
469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
472 /* Exit if v is smaller than both sons */
473 if (smaller(tree, v, s->heap[j], s->depth)) break;
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c441 #define smaller(tree, n, m, depth) \ macro
448 * when the heap property is re-established (each father smaller than its
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
464 /* Exit if v is smaller than both sons */
465 if (smaller(tree, v, s->heap[j], s->depth)) break;

Completed in 36 milliseconds

12