| /frameworks/base/media/mca/filterfw/native/core/ |
| geometry.cpp | 40 float Point::Distance(const Point& p0, const Point& p1) {
|
| /frameworks/base/media/mca/filterpacks/native/base/ |
| geometry.cpp | 39 float Point::Distance(const Point& p0, const Point& p1) {
|
| /external/chromium_org/chrome/browser/extensions/api/location/ |
| location_manager.cc | 53 // A policy that controls sending an update below a distance threshold.
64 Distance(position.latitude,
79 // Calculates the distance between two latitude and longitude points.
80 static double Distance(const double latitude1,
96 // The Haversine Formula determines the great circle distance
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkPoint.h | 210 /** Return the euclidian distance from (0,0) to the point
390 /** Returns the euclidian distance from (0,0) to (x,y)
405 /** Returns the euclidian distance between a and b
407 static SkScalar Distance(const SkPoint& a, const SkPoint& b) {
452 * Returns the squared distance to the infinite line between two pts. Also
461 * Returns the distance to the infinite line between two pts. Also
472 * Returns the squared distance to the line segment between pts a and b
478 * Returns the distance to the line segment between pts a and b.
|
| /external/skia/include/core/ |
| SkPoint.h | 210 /** Return the euclidian distance from (0,0) to the point
390 /** Returns the euclidian distance from (0,0) to (x,y)
405 /** Returns the euclidian distance between a and b
407 static SkScalar Distance(const SkPoint& a, const SkPoint& b) {
452 * Returns the squared distance to the infinite line between two pts. Also
461 * Returns the distance to the infinite line between two pts. Also
472 * Returns the squared distance to the line segment between pts a and b
478 * Returns the distance to the line segment between pts a and b.
|
| /external/clang/lib/Basic/ |
| DiagnosticIDs.cpp | 590 unsigned Distance = i->getName().edit_distance(Group, true, BestDistance);
591 if (Distance == BestDistance) {
592 // Two matches with the same distance, don't prefer one over the other.
594 } else if (Distance < BestDistance) {
597 BestDistance = Distance;
|
| /external/llvm/include/llvm/Analysis/ |
| DependenceAnalysis.h | 80 /// Dependence::DVEntry - Each level in the distance/direction vector
82 /// perhaps a distance.
97 const SCEV *Distance; // NULL implies no distance available.
99 PeelLast(false), Splitable(false), Distance(NULL) { }
155 /// getDistance - Returns the distance (or NULL) associated with a
249 /// getDistance - Returns the distance (or NULL) associated with a
380 /// 3) Distance - The value d of the dependence distance;
386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 133 /// matching this pattern at the start of \arg Buffer; a distance of zero
528 // match distance and the number of lines skipped to get to this match.
529 unsigned Distance = ComputeMatchDistance(Buffer.substr(i), VariableTable);
530 double Quality = Distance + (NumLinesForward / 100.);
[all...] |
| /external/jhead/ |
| jhead.h | 94 float Distance;
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| expand.h | 327 // shortest-distance information computed using a reverse
448 Weight Distance(StateId s) const;
471 vector<Weight> distance_; // Distance from initial state in efst_/ofst
472 vector<Weight> fdistance_; // Distance to final states in efst_/ofst
494 // the shortest-distance from '(s, current_stack_id_)' to the final
551 << reverse_shortest_path_->GetShortestPathData().Distance(s);
552 return reverse_shortest_path_->GetShortestPathData().Distance(s);
570 // Returns the shortest distance from the initial state to 's' in 'ofst_'.
572 typename A::Weight PrunedExpand<A>::Distance(StateId s) const {
576 // Sets the shortest distance from the initial state to 's' in 'ofst_' to 'w'
[all...] |
| shortest-path.h | 51 // tree info 'Distance()', Parent(), and ArcParent() information keyed
57 // (b) the Distance() is from this 'start' state to the search state.
62 // (a) the Distance() is from the Parent() 'start' state to the
113 SearchData() : distance(Weight::Zero()),
118 Weight distance; // Distance to this state from PDT 'start' state member in struct:fst::PdtShortestPathData::SearchData
148 Weight Distance(SearchState s) const {
150 return data->distance;
153 Weight Distance(const ParenSpec &paren) const {
155 return data->distance;
[all...] |
| /external/chromium_org/v8/src/ |
| assembler.h | 157 enum Distance {
200 void link_to(int pos, Distance distance = kFar) {
201 if (distance == kNear) {
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 244 // Returns the distance (or NULL) associated with a particular level.
247 return DV[Level - 1].Distance;
305 assert((Kind == Line || Kind == Distance) &&
306 "Kind should be Line (or Distance)");
314 assert((Kind == Line || Kind == Distance) &&
315 "Kind should be Line (or Distance)");
323 assert((Kind == Line || Kind == Distance) &&
324 "Kind should be Line (or Distance)");
329 // If constraint is a distance, returns D.
332 assert(Kind == Distance && "Kind should be Distance")
[all...] |
| /external/llvm/lib/Support/ |
| CommandLine.cpp | 230 unsigned Distance = StringRef(Name).edit_distance(
232 if (!Best || Distance < BestDistance) {
234 BestDistance = Distance;
[all...] |
| /external/v8/src/ |
| assembler.h | 83 enum Distance {
126 void link_to(int pos, Distance distance = kFar) {
127 if (distance == kNear) {
|
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| box2d.js | 73 function(){};W.Distance=function(b,e,f){++W.b2_gjkCalls;var m=f.proxyA,r=f.proxyB,s=f.transformA,v=f.transformB,t=W.s_simplex;t.ReadCache(e,m,s,r,v);var x=t.m_vertices,C=W.s_saveA,J=W.s_saveB,T=0;t.GetClosestPoint().LengthSquared();for(var P=0,X,$=0;$<20;){T=t.m_count;for(P=0;P<T;P++){C[P]=x[P].indexA;J[P]=x[P].indexB}switch(t.m_count){case 1:break;case 2:t.Solve2();break;case 3:t.Solve3();break;default:y.b2Assert(false)}if(t.m_count==3)break;X=t.GetClosestPoint();X.LengthSquared();P=t.GetSearchDirection();
74 if(P.LengthSquared()<Number.MIN_VALUE*Number.MIN_VALUE)break;X=x[t.m_count];X.indexA=m.GetSupport(w.MulTMV(s.R,P.GetNegative()));X.wA=w.MulX(s,m.GetVertex(X.indexA));X.indexB=r.GetSupport(w.MulTMV(v.R,P));X.wB=w.MulX(v,r.GetVertex(X.indexB));X.w=w.SubtractVV(X.wB,X.wA);++$;++W.b2_gjkIters;var ba=false;for(P=0;P<T;P++)if(X.indexA==C[P]&&X.indexB==J[P]){ba=true;break}if(ba)break;++t.m_count}W.b2_gjkMaxIters=w.Max(W.b2_gjkMaxIters,$);t.GetWitnessPoints(b.pointA,b.pointB);b.distance=w.SubtractVV(b.pointA,
75 b.pointB).Length();b.iterations=$;t.WriteCache(e);if(f.useRadii){e=m.m_radius;r=r.m_radius;if(b.distance>e+r&&b.distance>Number.MIN_VALUE){b.distance-=e+r;f=w.SubtractVV(b.pointB,b.pointA);f.Normalize();b.pointA.x+=e*f.x;b.pointA.y+=e*f.y;b.pointB.x-=r*f.x;b.pointB.y-=r*f.y}else{X=new p;X.x=0.5*(b.pointA.x+b.pointB.x);X.y=0.5*(b.pointA.y+b.pointB.y);b.pointA.x=b.pointB.x=X.x;b.pointA.y=b.pointB.y=X.y;b.distance=0}}};Box2D.postDefs.push(function(){Box2D.Collision.b2Distance.s_simplex=new h;Box2D.Collision.b2Distance.s_saveA=
[all...] |
