| /third_party/flutter/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = SkTMax(largest, -tiniest); in nearPoint()
54 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint()
58 *unequal = (float) largest != (float) (largest + dist); in nearPoint()
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = SkTMax(largest, -tiniest); in nearRay()
78 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay()
108 double largest = SkTMax(SkTMax(y, left), right); in NearPointH() local
109 largest = SkTMax(largest, -tiniest); in NearPointH()
110 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH()
[all …]
|
| D | SkPathOpsPoint.h | 164 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
165 largest = SkTMax(largest, -tiniest); in approximatelyDEqual()
166 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyDEqual()
184 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local
185 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
186 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
207 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
208 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
209 return AlmostDequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
245 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in roughlyEqual() local
[all …]
|
| D | SkPathOpsCurve.cpp | 48 double largest = SkTMax(SkTMax(maxX, maxY), -SkTMin(minX, minY)); in nearPoint() local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance? in nearPoint()
|
| /third_party/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 52 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = std::max(largest, -tiniest); in nearPoint()
54 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint()
58 *unequal = (float) largest != (float) (largest + dist); in nearPoint()
76 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = std::max(largest, -tiniest); in nearRay()
78 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay()
108 double largest = std::max(std::max(y, left), right); in NearPointH() local
109 largest = std::max(largest, -tiniest); in NearPointH()
110 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH()
[all …]
|
| D | SkPathOpsPoint.h | 164 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
165 largest = std::max(largest, -tiniest); in approximatelyDEqual()
166 return AlmostDequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyDEqual()
184 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in approximatelyEqual() local
185 largest = std::max(largest, -tiniest); in approximatelyEqual()
186 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual()
207 float largest = std::max(std::max(std::max(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
208 largest = std::max(largest, -tiniest); in ApproximatelyEqual()
209 return AlmostDequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual()
245 double largest = std::max(std::max(std::max(fX, a.fX), fY), a.fY); in roughlyEqual() local
[all …]
|
| D | SkPathOpsCurve.cpp | 48 double largest = std::max(std::max(maxX, maxY), -std::min(minX, minY)); in nearPoint() local
49 if (!AlmostEqualUlps_Pin(largest, largest + minDist)) { // is distance within ULPS tolerance? in nearPoint()
|
| /third_party/skia/docs/examples/ |
| D | Rect_isFinite.cpp | 7 SkRect largest = { SK_ScalarMin, SK_ScalarMin, SK_ScalarMax, SK_ScalarMax }; in draw() local
8 SkDebugf("largest is finite: %s\n", largest.isFinite() ? "true" : "false"); in draw()
9 SkDebugf("large width %g\n", largest.width()); in draw()
10 SkRect widest = SkRect::MakeWH(largest.width(), largest.height()); in draw()
|
| /third_party/flutter/skia/docs/examples/ |
| D | Rect_isFinite.cpp | 7 SkRect largest = { SK_ScalarMin, SK_ScalarMin, SK_ScalarMax, SK_ScalarMax }; in draw() local
8 SkDebugf("largest is finite: %s\n", largest.isFinite() ? "true" : "false"); in draw()
9 SkDebugf("large width %g\n", largest.width()); in draw()
10 SkRect widest = SkRect::MakeWH(largest.width(), largest.height()); in draw()
|
| /third_party/uboot/u-boot-2020.01/arch/x86/cpu/intel_common/ |
| D | mrc.c | 30 struct memory_area *largest = NULL; in mrc_common_board_get_usable_ram_top() local
40 if (!largest || area->size > largest->size) in mrc_common_board_get_usable_ram_top()
41 largest = area; in mrc_common_board_get_usable_ram_top()
45 assert(largest); in mrc_common_board_get_usable_ram_top()
46 if (!largest || largest->size < (2 << 20)) in mrc_common_board_get_usable_ram_top()
49 dest_addr = largest->start + largest->size; in mrc_common_board_get_usable_ram_top()
|
| /third_party/uboot/u-boot-2020.01/arch/x86/cpu/efi/ |
| D | payload.c | 33 struct efi_mem_desc *largest = NULL; in board_get_usable_ram_top() local
55 if (!largest || desc->num_pages > largest->num_pages) in board_get_usable_ram_top()
56 largest = desc; in board_get_usable_ram_top()
60 assert(largest); in board_get_usable_ram_top()
61 if (!largest || (largest->num_pages << EFI_PAGE_SHIFT) < (2 << 20)) in board_get_usable_ram_top()
64 dest_addr = largest->physical_start + (largest->num_pages << in board_get_usable_ram_top()
|
| /third_party/curl/tests/libtest/ |
| D | lib1556.c | 29 size_t largest; member
38 if(headersize > info->largest) in header()
40 info->largest = headersize; in header()
70 printf("Max: %ld\n", (long)info.largest); in test()
|
| /third_party/boost/libs/hana/example/ |
| D | minimum.cpp | 21 auto largest = hana::minimum(hana::tuple_c<int, -1, 0, 2, -4, 6, 9>, [](auto x, auto y) { in main() local
24 BOOST_HANA_CONSTANT_CHECK(largest == hana::int_c<9>); in main()
|
| /third_party/ffmpeg/libavcodec/tests/ |
| D | celp_math.c | 27 float largest = (absb > absa) ? absb : absa; in IsAlmostEqual() local
28 av_assert0(diff <= largest * epsilon); in IsAlmostEqual()
|
| /third_party/flutter/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
186 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST()
189 if (largest <= 1) { in DEF_TEST()
203 frexp(largest, &largeBits); in DEF_TEST()
|
| /third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 184 double largest = std::max(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local
186 largest = std::max(largest, fabs(allRoots[2])); in DEF_TEST()
189 if (largest <= 1) { in DEF_TEST()
203 frexp(largest, &largeBits); in DEF_TEST()
|
| /third_party/node/test/parallel/ |
| D | test-priority-queue.js | 92 const largest = { value: 15, position: null }; variable
93 queue.insert(largest);
96 assert.strictEqual(largest.position, 5);
|
| /third_party/flutter/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/glx/ |
| D | PbufferSurfaceGLX.cpp | 21 bool largest, in PbufferSurfaceGLX() argument
27 mLargest(largest), in PbufferSurfaceGLX()
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/glx/ |
| D | PbufferSurfaceGLX.cpp | 21 bool largest, in PbufferSurfaceGLX() argument
27 mLargest(largest), in PbufferSurfaceGLX()
|
| /third_party/ffmpeg/libavcodec/ |
| D | dvenc.c | 639 int largest = size[0] % 5; /* 'random' number */ in dv_guess_qnos_hd() local
645 if (qlevels[i] < qlevels[largest]) in dv_guess_qnos_hd()
646 largest = i; in dv_guess_qnos_hd()
649 i = largest; in dv_guess_qnos_hd()
651 largest = (largest+1) % 5; in dv_guess_qnos_hd()
681 int largest = size[0] % 5; /* 'random' number */ in dv_guess_qnos_hd() local
691 if (qlevels[i] > min_qlevel[i] && qlevels[i] > qlevels[largest]) in dv_guess_qnos_hd()
692 largest = i; in dv_guess_qnos_hd()
695 i = largest; in dv_guess_qnos_hd()
698 largest = (largest+1) % 5; in dv_guess_qnos_hd()
|
| /third_party/openGLES/extensions/ATI/ |
| D | ATI_meminfo.txt | 84 largest pool available, total auxilliary pool available, and largest
135 param[1] - largest available free block in the pool
137 param[3] - largest auxiliary free block
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/ATI/ |
| D | ATI_meminfo.txt | 84 largest pool available, total auxilliary pool available, and largest
135 param[1] - largest available free block in the pool
137 param[3] - largest auxiliary free block
|
| /third_party/boost/libs/range/doc/reference/algorithm/ |
| D | pop_heap.qbk | 26 …` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is a…
|
| /third_party/flutter/skia/third_party/externals/piex/ |
| D | README | 1 The Preview Image Extractor (PIEX) is designed to find and extract the largest
|
| /third_party/skia/third_party/externals/piex/ |
| D | README | 1 The Preview Image Extractor (PIEX) is designed to find and extract the largest
|
| /third_party/boost/libs/math/doc/fp_utilities/ |
| D | float_comparison.qbk | 60 * If either of ['a] or ['b] is a NaN, then returns the largest representable value for T: for examp…
62 * If ['a] and ['b] differ in sign then returns the largest representable value for T.
64 * If just one of ['a] and ['b] is an infinity, then returns the largest representable value for T.
107 but a good starting point would be machine epsilon multiplied by the largest
108 of the values being summed. In the example above, the largest value returned
|