Searched refs:distance (Results 226 - 250 of 454) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
H A D3d-raytrace.js228 var distance = lengthVector(toLight);
229 scaleVector(toLight, 1.0/distance);
230 distance -= 0.0001;
231 if (this.blocked(hit, toLight, distance))
/external/chromium_org/third_party/WebKit/Source/core/svg/
H A DSVGAnimatedColor.cpp109 return ColorDistance(from, to).distance();
H A DSVGAnimatedTransformList.cpp147 // Paced animations assume a notion of distance between the various animation values defined by the ‘to’, ‘from’, ‘by’ and ‘values’ attributes.
149 return SVGTransformDistance(fromTransformList[0], toTransformList[0]).distance();
H A DSVGAnimationElement.cpp403 float distance = calculateDistance(m_values[n], m_values[n + 1]); local
404 if (distance < 0)
406 totalDistance += distance;
407 keyTimesForPaced.append(distance);
/external/chromium_org/third_party/re2/util/
H A Dsparse_array_test.cc55 ASSERT_EQ(0, distance(set.begin(), set.end()));
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp313 // OPTIMIZE: using calcMask value permits skipping some distance calcuations
508 double distance = dx * dx + dy * dy; local
509 if (dist[index] <= distance) {
516 if (dist[outer] < distance) {
521 dist[index] = distance;
H A DSkPathOpsCubic.cpp83 double distance = lineParameters.controlPtDistance(*this, 1); local
84 if (!approximately_zero(distance)) {
87 distance = lineParameters.controlPtDistance(*this, 2);
88 return approximately_zero(distance);
/external/llvm/unittests/Support/
H A DYAMLParserTest.cpp189 EXPECT_EQ(6, std::distance(Array->begin(), Array->end()));
/external/openfst/src/include/fst/
H A Dfstlib.h90 #include <fst/shortest-distance.h>
/external/regex-re2/util/
H A Dsparse_array_test.cc55 ASSERT_EQ(0, distance(set.begin(), set.end()));
/external/skia/src/pathops/
H A DSkDQuadIntersection.cpp313 // OPTIMIZE: using calcMask value permits skipping some distance calcuations
508 double distance = dx * dx + dy * dy; local
509 if (dist[index] <= distance) {
516 if (dist[outer] < distance) {
521 dist[index] = distance;
H A DSkPathOpsCubic.cpp83 double distance = lineParameters.controlPtDistance(*this, 1); local
84 if (!approximately_zero(distance)) {
87 distance = lineParameters.controlPtDistance(*this, 2);
88 return approximately_zero(distance);
/external/stlport/stlport/stl/
H A D_iterator_base.h361 distance(_InputIterator __first, _InputIterator __last) function in struct:iterator_traits
366 inline void _STLP_CALL distance(const _InputIterator& __first, function in struct:iterator_traits
368 { __n += _STLP_STD::distance(__first, __last); }
375 { __n += _STLP_STD::distance(__first, __last); }
/external/chromium/chrome/browser/ui/gtk/
H A Dstatus_bubble_gtk.cc217 int distance = std::max(ltr ? local
221 y_offset_ = std::min(-1 * distance, requisition.height);
/external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/
H A Dvec3.js226 * Calculates the euclidian distance between two vec3's
230 * @returns {Number} distance between a and b
232 vec3.distance = function(a, b) {
240 * Alias for {@link vec3.distance}
243 vec3.dist = vec3.distance;
246 * Calculates the squared euclidian distance between two vec3's
250 * @returns {Number} squared distance between a and b
H A Dvec4.js240 * Calculates the euclidian distance between two vec4's
244 * @returns {Number} distance between a and b
246 vec4.distance = function(a, b) {
255 * Alias for {@link vec4.distance}
258 vec4.dist = vec4.distance;
261 * Calculates the squared euclidian distance between two vec4's
265 * @returns {Number} squared distance between a and b
/external/chromium_org/android_webview/java/src/org/chromium/android_webview/
H A DAwScrollOffsetManager.java320 int distance = Math.max(Math.abs(dx), Math.abs(dy));
321 int duration = distance * 1000 / STD_SCROLL_ANIMATION_SPEED_PIX_PER_SEC;
/external/chromium_org/chrome/browser/ui/gtk/
H A Dstatus_bubble_gtk.cc230 int distance = std::max(ltr ? local
234 y_offset_ = std::min(-1 * distance, requisition.height);
/external/chromium_org/content/browser/
H A Dsession_history_browsertest.cc81 // Navigate session history using history.go(distance).
82 void JavascriptGo(std::string distance) { argument
83 GURL url("javascript:history.go('" + distance + "')");
/external/chromium_org/ui/events/gestures/
H A Dgesture_sequence.cc861 double distance = (p1.x() - p2.x()) * (p1.x() - p2.x()) + local
863 if (distance < max_distance * max_distance)
1001 // Remove the extra distance added by the last scroll prediction and add
1323 float distance = BoundingBoxDiagonal(bounding_box_); local
1325 if (abs(distance - pinch_distance_current_) >=
1328 distance / pinch_distance_current_, gestures);
1329 pinch_distance_current_ = distance;
1344 float distance = BoundingBoxDiagonal(bounding_box_); local
1346 distance / pinch_distance_start_, gestures);
/external/llvm/include/llvm/Support/
H A DCFG.h205 int distance = idx - x.idx; local
206 return distance;
/external/lzma/CS/7zip/Compress/LZ/
H A DLzBinTree.cs74 public new UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit) argument
75 { return base.GetMatchLen(index, distance, limit); }
/external/replicaisland/src/com/replica/replicaisland/
H A DPatrolComponent.java233 closeEnough = true; // If no distance has been set, don't worry about
263 public void setupAttack(float distance, float duration, float delay, boolean stopMovement) { argument
265 mAttackAtDistance = distance;
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DHeapSnapshotGridNodes.js388 this._distance = node.distance;
487 data["distance"] = this._distance;
566 this._distance = edge.distance;
628 distance: ["distance", sortAscending, "_name", true]
657 data["distance"] = this._distance;
722 distance: ["distance", sortAscending, "retainedSize", false],
770 this._distance = aggregate.distance;
855 distance
[all...]
/external/openfst/src/include/fst/extensions/pdt/
H A Dshortest-path.h113 SearchData() : distance(Weight::Zero()),
118 Weight distance; // Distance to this state from PDT 'start' state member in struct:fst::PdtShortestPathData::SearchData
150 return data->distance;
155 return data->distance;
180 data->distance = w;
185 data->distance = w;
524 // Computes the shortest distance stored in a recursive way. Each
595 // shortest distance to them.
683 // since the shortest distance is stored recursively.

Completed in 630 milliseconds

1234567891011>>