HomeSort by relevance Sort by last modified time
    Searched defs:LengthSquared (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/ui/gfx/geometry/
vector2d.cc 27 int64 Vector2d::LengthSquared() const {
32 return static_cast<float>(std::sqrt(static_cast<double>(LengthSquared())));
vector2d_f.cc 31 double Vector2dF::LengthSquared() const {
36 return static_cast<float>(std::sqrt(LengthSquared()));
vector3d_f.cc 51 double Vector3dF::LengthSquared() const {
57 return static_cast<float>(std::sqrt(LengthSquared()));
  /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,
    [all...]

Completed in 112 milliseconds