Home
last modified time | relevance | path

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

1234

/external/mesa3d/src/mesa/drivers/dri/radeon/
Dradeon_sanity.c326 struct reg_names *closest; member
349 regs[i].closest = &reg_names[i]; in init_regs()
356 scalars[i].closest = tmp; in init_regs()
363 vectors[i].closest = tmp; in init_regs()
409 if (reg->idx == reg->closest->idx) in get_reg_name()
410 return reg->closest->name; in get_reg_name()
414 if (reg->idx/4 != reg->closest->idx) in get_reg_name()
416 reg->closest->name, in get_reg_name()
417 (reg->idx/4) - reg->closest->idx, in get_reg_name()
420 sprintf(tmp, "%s[%d]", reg->closest->name, reg->idx%4); in get_reg_name()
[all …]
/external/mesa3d/src/mesa/drivers/dri/r200/
Dr200_sanity.c604 struct reg_names *closest; member
627 regs[i].closest = &reg_names[i]; in init_regs()
634 scalars[i].closest = tmp; in init_regs()
641 vectors[i].closest = tmp; in init_regs()
687 if (reg->idx == reg->closest->idx) in get_reg_name()
688 return reg->closest->name; in get_reg_name()
692 if (reg->idx/4 != reg->closest->idx) in get_reg_name()
694 reg->closest->name, in get_reg_name()
695 (reg->idx/4) - reg->closest->idx, in get_reg_name()
698 sprintf(tmp, "%s[%d]", reg->closest->name, reg->idx%4); in get_reg_name()
[all …]
/external/skia/tests/
DPathOpsTSectDebug.h38 const SkTSpan<TCurve, OppCurve>* closest = nullptr; in debugT() local
47 closest = test; in debugT()
50 SkASSERT(closest); in debugT()
51 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.h428 double closest = FLT_MAX; in closestBoundedT() local
433 if (closest > startDist) { in closestBoundedT()
434 closest = startDist; in closestBoundedT()
438 if (closest > endDist) { in closestBoundedT()
439 closest = endDist; in closestBoundedT()
1373 double closest = DBL_MAX; in linesIntersect() local
1385 if (closest > distSq) { in linesIntersect()
1386 closest = distSq; in linesIntersect()
1392 if (closest == DBL_MAX) { in linesIntersect()
2199 SkClosestSect<TCurve, OppCurve> closest; in BinarySearch() local
[all …]
/external/libchrome/base/test/
Dtrace_event_analyzer.cc925 size_t closest = events.size(); in FindClosest() local
930 if (closest == events.size()) { in FindClosest()
931 closest = i; in FindClosest()
935 fabs(events.at(closest)->timestamp - events.at(position)->timestamp)) { in FindClosest()
936 second_closest = closest; in FindClosest()
937 closest = i; in FindClosest()
943 if (closest < events.size() && in FindClosest()
945 *return_closest = closest; in FindClosest()
/external/skia/src/core/
DSkEdgeClipper.cpp238 SkScalar closest = SK_ScalarMax; in mono_cubic_closestT() local
242 if (closest > dist) { in mono_cubic_closestT()
243 closest = dist; in mono_cubic_closestT()
249 } while (closest > 0.25f && lastT != t); in mono_cubic_closestT()
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/
DbtSimplexSolverInterface.h41 virtual bool closest(btVector3& v) = 0;
DbtVoronoiSimplexSolver.h153 bool closest(btVector3& v); in ATTRIBUTE_ALIGNED16()
DbtSubSimplexConvexCast.cpp121 if (m_simplexSolver->closest(v)) in calcTimeOfImpact()
/external/fio/
Dparse.c1118 struct fio_option *o, *closest; in show_cmd_help() local
1126 closest = NULL; in show_cmd_help()
1148 closest = o; in show_cmd_help()
1179 if (closest && best_dist < 3) { in show_cmd_help()
1181 log_info("%20s: %s\n", closest->name, closest->help); in show_cmd_help()
1182 show_option_help(closest, 0); in show_cmd_help()
/external/autotest/client/site_tests/touch_TouchscreenScroll/
DREADME11 side of the screen closest to hinges up to the oposite side of the screen.
/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/opencv3/doc/tutorials/features2d/akaze_matching/
Dakaze_matching.markdown82 If the closest match is *ratio* closer than the second closest one, then the match is correct.
/external/skia/src/ports/
DSkFontMgr_custom.cpp162 SkTypeface_Custom* closest = fStyles[0]; in matchStyle() local
175 closest = fStyles[i]; in matchStyle()
179 return SkRef(closest); in matchStyle()
DSkFontMgr_android.cpp240 SkTypeface_AndroidSystem* closest = fStyles[0]; in matchStyle() local
246 closest = fStyles[i]; in matchStyle()
250 return SkRef(closest); in matchStyle()
/external/opencv3/doc/tutorials/features2d/akaze_tracking/
Dakaze_tracking.markdown88 If the closest match is *nn_match_ratio* closer than the second closest one, then it's a
/external/ImageMagick/www/js/
Dmagick.js6 …closest(".alert")),g.trigger(b=a.Event("close.bs.alert")),b.isDefaultPrevented()||(g.removeClass("…
7 …closest("li.dropdown").addClass("active")),d.trigger("activate.bs.scrollspy")},b.prototype.clear=f…
/external/opencv3/doc/tutorials/features2d/detection_of_planar_objects/
Ddetection_of_planar_objects.markdown24 - Now, find the closest matches between descriptors from the first image to the second: :
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/
DUtils.java148 static int closest(RGB[] rgbs, int n, RGB rgb) { in closest() method in Utils
233 pixels[x] = closest(rgbs, n, rgb); in downSample()
/external/opencv3/doc/py_tutorials/py_feature2d/py_sift_intro/
Dpy_sift_intro.markdown100 the second closest-match may be very near to the first. It may happen due to noise or some other
101 reasons. In that case, ratio of closest-distance to second-closest distance is taken. If it is
/external/opencv3/doc/tutorials/ml/introduction_to_svm/
Dintroduction_to_svm.markdown64 where \f$x\f$ symbolizes the training examples closest to the hyperplane. In general, the training
65 examples that are closest to the hyperplane are called **support vectors**. This representation is
79 distance to the closest examples:
/external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
Dgraphutil.rst55 closest upstream node that is not in *removes*.
/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.js6 …closest('[data-toggle="buttons-radio"]');e&&e.find(".active").removeClass("active"),this.$element.…

1234