HomeSort by relevance Sort by last modified time
    Searched refs:newT (Results 1 - 25 of 31) sorted by null

1 2

  /prebuilts/go/darwin-x86/test/fixedbugs/
issue21048.go 28 func newT() T {
49 t := newT()
60 t := newT()
  /prebuilts/go/linux-x86/test/fixedbugs/
issue21048.go 28 func newT() T {
49 t := newT()
60 t := newT()
  /external/skia/tests/
PathOpsCubicLineIntersectionIdeas.cpp 221 double newT = binary_search(cubic, step, pt, t, &iters);
222 if (newT >= 0) {
223 diff = fabs(t - newT);
269 double newT = binary_search(cubic, 0.1, pt, t, &iters);
270 return newT;
277 double newT = testOneFailure(failure);
278 SkASSERT_RELEASE(newT >= 0);
285 double newT = testOneFailure(failure);
286 SkASSERT_RELEASE(newT >= 0);
PathOpsTestCommon.cpp 56 double newT = start + (index / parts) * (end - start);
57 if (newT > 0 && newT < 1) {
58 ts->push_back(newT);
  /external/skqp/tests/
PathOpsCubicLineIntersectionIdeas.cpp 221 double newT = binary_search(cubic, step, pt, t, &iters);
222 if (newT >= 0) {
223 diff = fabs(t - newT);
269 double newT = binary_search(cubic, 0.1, pt, t, &iters);
270 return newT;
277 double newT = testOneFailure(failure);
278 SkASSERT_RELEASE(newT >= 0);
285 double newT = testOneFailure(failure);
286 SkASSERT_RELEASE(newT >= 0);
PathOpsTestCommon.cpp 56 double newT = start + (index / parts) * (end - start);
57 if (newT > 0 && newT < 1) {
58 ts->push_back(newT);
  /external/skia/include/private/
SkTArray.h 179 void* newT = this->push_back_raw(1);
180 return *new (newT) T;
187 void* newT = this->push_back_raw(1);
188 return *new (newT) T(t);
195 void* newT = this->push_back_raw(1);
196 return *new (newT) T(std::move(t));
203 void* newT = this->push_back_raw(1);
204 return *new (newT) T(std::forward<Args>(args)...);
  /external/skqp/include/private/
SkTArray.h 179 void* newT = this->push_back_raw(1);
180 return *new (newT) T;
187 void* newT = this->push_back_raw(1);
188 return *new (newT) T(t);
195 void* newT = this->push_back_raw(1);
196 return *new (newT) T(std::move(t));
203 void* newT = this->push_back_raw(1);
204 return *new (newT) T(std::forward<Args>(args)...);
  /external/skia/tools/
sk_tool_utils.cpp 272 SkScalar newL = r.fLeft, newT = r.fTop, newR = r.fRight, newB = r.fBottom;
279 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
287 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
306 return SkRect::MakeLTRB(newL, newT, newR, newB);
  /external/skqp/tools/
sk_tool_utils.cpp 332 SkScalar newL = r.fLeft, newT = r.fTop, newR = r.fRight, newB = r.fBottom;
339 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
347 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
366 return SkRect::MakeLTRB(newL, newT, newR, newB);
  /external/skia/src/pathops/
SkOpSegment.cpp 224 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) {
225 if (this->contains(newT)) {
229 FAIL_IF(!between(0, newT, 1));
230 SkOpPtT* newPtT = this->addT(newT);
235 newPtT->fPt = this->ptAtT(newT);
466 bool SkOpSegment::contains(double newT) const {
469 if (spanBase->ptT()->contains(this, newT)) {
    [all...]
SkPathOpsCubic.cpp 357 double newT = binarySearch(min, max, axisIntercept, xAxis);
358 if (newT >= 0) {
362 validRoots[validCount++] = newT;
SkOpSegment.h 69 bool addExpanded(double newT, const SkOpSpanBase* test, bool* startOver);
  /external/skqp/src/pathops/
SkOpSegment.cpp 224 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) {
225 if (this->contains(newT)) {
229 FAIL_IF(!between(0, newT, 1));
230 SkOpPtT* newPtT = this->addT(newT);
235 newPtT->fPt = this->ptAtT(newT);
466 bool SkOpSegment::contains(double newT) const {
469 if (spanBase->ptT()->contains(this, newT)) {
    [all...]
SkPathOpsCubic.cpp 357 double newT = binarySearch(min, max, axisIntercept, xAxis);
358 if (newT >= 0) {
362 validRoots[validCount++] = newT;
SkOpSegment.h 69 bool addExpanded(double newT, const SkOpSpanBase* test, bool* startOver);
  /prebuilts/go/darwin-x86/src/text/template/parse/
parse.go 285 newT := New("definition") // name will be updated once we know it.
286 newT.text = t.text
287 newT.ParseName = t.ParseName
288 newT.startParse(t.funcs, t.lex, t.treeSet)
289 newT.parseDefinition()
  /prebuilts/go/linux-x86/src/text/template/parse/
parse.go 285 newT := New("definition") // name will be updated once we know it.
286 newT.text = t.text
287 newT.ParseName = t.ParseName
288 newT.startParse(t.funcs, t.lex, t.treeSet)
289 newT.parseDefinition()
  /external/clang/lib/Sema/
SemaDeclObjC.cpp 622 ObjCObjectPointerTypeLoc newT
624 newT.setStarLoc(starLoc);
    [all...]
  /prebuilts/tools/common/m2/repository/io/netty/netty-transport/4.1.0.CR3/
netty-transport-4.1.0.CR3.jar 
  /prebuilts/tools/common/m2/repository/io/netty/netty-transport/4.1.3.Final/
netty-transport-4.1.3.Final.jar 
  /prebuilts/misc/common/icu4j/
icu4j.jar 
  /prebuilts/misc/common/robolectric/3.1.1/lib/
icu4j-53.1.jar 
  /prebuilts/misc/common/robolectric/3.4.2/lib/
icu4j-53.1.jar 
  /prebuilts/misc/common/robolectric/3.5.1/lib/
icu4j-53.1.jar 

Completed in 1353 milliseconds

1 2