Home
last modified time | relevance | path

Searched defs:newT (Results 1 – 8 of 8) sorted by relevance

/external/skia/tests/
DPathOpsCubicLineIntersectionIdeas.cpp219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
265 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
273 double newT = testOneFailure(failure); in DEF_TEST() local
281 double newT = testOneFailure(failure); in DEF_TEST() local
DPathOpsTestCommon.cpp56 double newT = start + (index / parts) * (end - start); in addTs() local
/external/jmonkeyengine/engine/src/core/com/jme3/collision/
DSweepSphere.java154 float newT = getLowestRoot(a, b, c, t); in collideWithVertex() local
187 float newT = getLowestRoot(a, b, c, t); in collideWithSegment() local
296 float newT; in collideWithTriangle() local
/external/skia/include/private/
DSkTArray.h144 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
153 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
162 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in emplace_back() local
/external/skia/src/pathops/
DSkOpCoincidence.cpp111 double newT = oStartPtT->fT + oStartRange * startPart; in addExpanded() local
119 double newT = startPtT->fT + startRange * oStartPart; in addExpanded() local
DSkPathOpsDebug.cpp1149 double newT = oStartPtT->fT + oStartRange * startPart; in debugAddExpanded() local
1153 double newT = startPtT->fT + startRange * oStartPart; in debugAddExpanded() local
DSkPathOpsCubic.cpp321 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
/external/clang/lib/Sema/
DSemaDeclObjC.cpp623 ObjCObjectPointerTypeLoc newT in actOnObjCTypeParam() local