Home
last modified time | relevance | path

Searched refs:closest (Results 1 – 25 of 78) sorted by relevance

1234

/external/mesa3d/src/mesa/drivers/dri/radeon/
Dradeon_sanity.c324 struct reg_names *closest; member
347 regs[i].closest = &reg_names[i]; in init_regs()
354 scalars[i].closest = tmp; in init_regs()
361 vectors[i].closest = tmp; in init_regs()
406 if (reg->idx == reg->closest->idx) in get_reg_name()
407 return reg->closest->name; in get_reg_name()
411 if (reg->idx/4 != reg->closest->idx) in get_reg_name()
413 reg->closest->name, in get_reg_name()
414 (reg->idx/4) - reg->closest->idx, in get_reg_name()
417 sprintf(tmp, "%s[%d]", reg->closest->name, reg->idx%4); in get_reg_name()
[all …]
/external/mesa3d/src/mesa/drivers/dri/r200/
Dr200_sanity.c602 struct reg_names *closest; member
625 regs[i].closest = &reg_names[i]; in init_regs()
632 scalars[i].closest = tmp; in init_regs()
639 vectors[i].closest = tmp; in init_regs()
684 if (reg->idx == reg->closest->idx) in get_reg_name()
685 return reg->closest->name; in get_reg_name()
689 if (reg->idx/4 != reg->closest->idx) in get_reg_name()
691 reg->closest->name, in get_reg_name()
692 (reg->idx/4) - reg->closest->idx, in get_reg_name()
695 sprintf(tmp, "%s[%d]", reg->closest->name, reg->idx%4); in get_reg_name()
[all …]
/external/skqp/tests/
DPathOpsTSectDebug.h40 const SkTSpan<TCurve, OppCurve>* closest = nullptr; in debugT() local
49 closest = test; in debugT()
52 SkASSERT(closest); in debugT()
53 return closest; in debugT()
/external/skia/tests/
DPathOpsTSectDebug.h40 const SkTSpan<TCurve, OppCurve>* closest = nullptr; in debugT() local
49 closest = test; in debugT()
52 SkASSERT(closest); in debugT()
53 return closest; in debugT()
/external/skia/src/pathops/
DSkIntersections.cpp12 int closest = -1; in closestTo() local
22 closest = index; in closestTo()
25 return closest; in closestTo()
DSkPathOpsTSect.h451 double closest = DBL_MAX; in closestBoundedT() local
456 if (closest > startDist) { in closestBoundedT()
457 closest = startDist; in closestBoundedT()
461 if (closest > endDist) { in closestBoundedT()
462 closest = endDist; in closestBoundedT()
1460 double closest = DBL_MAX; in linesIntersect() local
1472 if (closest > distSq) { in linesIntersect()
1473 closest = distSq; in linesIntersect()
1479 if (closest == DBL_MAX) { in linesIntersect()
2387 SkClosestSect<TCurve, OppCurve> closest; in BinarySearch() local
[all …]
/external/skqp/src/pathops/
DSkIntersections.cpp12 int closest = -1; in closestTo() local
22 closest = index; in closestTo()
25 return closest; in closestTo()
DSkPathOpsTSect.h451 double closest = DBL_MAX; in closestBoundedT() local
456 if (closest > startDist) { in closestBoundedT()
457 closest = startDist; in closestBoundedT()
461 if (closest > endDist) { in closestBoundedT()
462 closest = endDist; in closestBoundedT()
1460 double closest = DBL_MAX; in linesIntersect() local
1472 if (closest > distSq) { in linesIntersect()
1473 closest = distSq; in linesIntersect()
1479 if (closest == DBL_MAX) { in linesIntersect()
2387 SkClosestSect<TCurve, OppCurve> closest; in BinarySearch() local
[all …]
/external/libchrome/base/test/
Dtrace_event_analyzer.cc983 size_t closest = events.size(); in FindClosest() local
988 if (closest == events.size()) { in FindClosest()
989 closest = i; in FindClosest()
993 fabs(events.at(closest)->timestamp - events.at(position)->timestamp)) { in FindClosest()
994 second_closest = closest; in FindClosest()
995 closest = i; in FindClosest()
1001 if (closest < events.size() && in FindClosest()
1003 *return_closest = closest; in FindClosest()
/external/trappy/trappy/plotter/js/
DILinePlot.js145 .closest(".output_subarea").width() / t_info.per_line
155 .closest(".output_subarea").width() / t_info.per_line
/external/doclava/res/assets/templates-sdk/assets/design/
Ddefault.js34 $selListItem = $selNavLink.closest('li');
37 $selListItem.closest('li>ul').addClass('expanded');
/external/fio/
Dparse.c1187 struct fio_option *o, *closest; in show_cmd_help() local
1195 closest = NULL; in show_cmd_help()
1217 closest = o; in show_cmd_help()
1248 if (closest && best_dist < 3) { in show_cmd_help()
1250 log_info("%20s: %s\n", closest->name, closest->help); in show_cmd_help()
1251 show_option_help(closest, 0); in show_cmd_help()
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_Rint.pbtxt3 summary: "Returns element-wise integer closest to x."
/external/skia/src/core/
DSkEdgeClipper.cpp255 SkScalar closest = SK_ScalarMax; in mono_cubic_closestT() local
259 if (closest > dist) { in mono_cubic_closestT()
260 closest = dist; in mono_cubic_closestT()
266 } while (closest > 0.25f && lastT != t); in mono_cubic_closestT()
/external/skqp/src/core/
DSkEdgeClipper.cpp255 SkScalar closest = SK_ScalarMax; in mono_cubic_closestT() local
259 if (closest > dist) { in mono_cubic_closestT()
260 closest = dist; in mono_cubic_closestT()
266 } while (closest > 0.25f && lastT != t); in mono_cubic_closestT()
/external/eigen/unsupported/Eigen/
DBVH48 …* - Find the intersection between a ray and a triangle mesh closest to the ray origin (function …
49 * - Given a polyline and a query point, determine the closest point on the polyline to the query
82 …t complete example for how to use the BVH to accelerate the search for a closest red-blue point pa…
/external/autotest/client/site_tests/touch_TouchscreenScroll/
DREADME11 side of the screen closest to hinges up to the oposite side of the screen.
/external/python/cpython2/Demo/tkinter/guido/
Dsolitaire.py597 closest = None
604 closest = stack
606 return closest
/external/ImageMagick/www/js/
Dmagick.js6closest(".alert")),g.trigger(b=a.Event("close.bs.alert")),b.isDefaultPrevented()||(g.removeClass("…
7closest("li.dropdown").addClass("active")),d.trigger("activate.bs.scrollspy")},b.prototype.clear=f…
/external/doclava/res/assets/templates-sdk/assets/js/
Ddocs.js72 $selListItem = $selNavLink.closest('li');
222 $lessons = $(this).closest('li').find('ul li a');
323 var section = $(el).closest('li.nav-section');
328 section.closest('li').removeClass('expanded');
334 var $others = $('li.nav-section.expanded', $(el).closest('ul')).not('.sticky');
338 section.closest('li').addClass('expanded');
362 $selListItem = $selNavLink.closest('li');
519 var div = $(obj).closest(".toggle-content");
1612 var $widget = $(this).closest('.resource-flow-layout');
2608 this.group = this.el.closest('.dac-form-input-group');
[all …]
/external/tensorflow/tensorflow/contrib/factorization/g3doc/
Dkmeans.md10 where each iteration involves assigning each input point to its closest cluster,
/external/okhttp/website/static/
Djquery.smooth-scroll.min.js7 …&m&&p){for(;h&&c.length>a;)s.is(t(c[a++]))&&(h=!1);for(;h&&i.length>f;)s.closest(i[f++]).length&&(…
Dbootstrap.min.js6closest('[data-toggle="buttons-radio"]');e&&e.find(".active").removeClass("active"),this.$element.…
/external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/bench/
Dbootstrap.js244 if (!$btn.hasClass('btn')) $btn = $btn.closest('.btn')
1372 active = active.closest('li.dropdown').addClass('active')
1449 , $ul = $this.closest('ul:not(.dropdown-menu)')
1505 element.closest('li.dropdown').addClass('active')
/external/eigen/doc/
DLeastSquares.dox7 vector \a x which is closest to being a solution, in the sense that the difference \a Ax - \a b is

1234