| /external/oss-fuzz/infra/ |
| D | bisector_test.py | 24 import bisector
47 bisector.bisect(self.BISECT_TYPE, test_repo.old_commit,
60 result = bisector.bisect(self.BISECT_TYPE, test_repo.old_commit,
|
| /external/toolchain-utils/binary_search_tool/ |
| D | run_bisect.py | 286 def Run(bisector): argument
290 ret = bisector.PreRun()
295 ret = bisector.Run()
300 ret = bisector.PostRun()
391 bisector = subcmd(options, overrides)
392 return Run(bisector)
|
| D | MAINTENANCE | 35 the bisector to triage in order to test each bisector.
104 last two? Imagine if the Android bisector set --prune=True as a default
|
| D | README.bisect.md | 235 Example 2 (do package bisector system test instead of interactive test, this
|
| /external/skqp/src/gpu/ops/ |
| D | GrAAConvexTessellator.cpp | 339 const SkVector& bisector, in computePtAlongBisector() argument
348 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm); in computePtAlongBisector()
354 newP = bisector; in computePtAlongBisector()
362 SkScalar dot = bisector.dot(norm); in computePtAlongBisector()
364 *result = bisector; in computePtAlongBisector()
555 SkPoint miter = previousRing.bisector(cur); in createOuterRing()
575 SkPoint miter = previousRing.bisector(cur); in createOuterRing()
678 bool result = intersect(this->point(lastRing.index(cur)), lastRing.bisector(cur), in createInsetRing()
679 this->point(lastRing.index(next)), lastRing.bisector(next), in createInsetRing()
686 SkScalar dist = -t * lastRing.norm(cur).dot(lastRing.bisector(cur)); in createInsetRing()
[all …]
|
| D | GrAAConvexTessellator.h | 154 const SkPoint& bisector(int index) const { return fPts[index].fBisector; } in bisector() function
212 bool computePtAlongBisector(int startIdx, const SkPoint& bisector,
|
| /external/skia/src/gpu/ops/ |
| D | GrAAConvexTessellator.cpp | 348 const SkVector& bisector, in computePtAlongBisector() argument
357 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm); in computePtAlongBisector()
363 newP = bisector; in computePtAlongBisector()
371 SkScalar dot = bisector.dot(norm); in computePtAlongBisector()
373 *result = bisector; in computePtAlongBisector()
571 SkPoint miter = previousRing.bisector(cur); in createOuterRing()
591 SkPoint miter = previousRing.bisector(cur); in createOuterRing()
694 bool result = intersect(this->point(lastRing.index(cur)), lastRing.bisector(cur), in createInsetRing()
695 this->point(lastRing.index(next)), lastRing.bisector(next), in createInsetRing()
702 SkScalar dist = -t * lastRing.norm(cur).dot(lastRing.bisector(cur)); in createInsetRing()
[all …]
|
| D | GrAAConvexTessellator.h | 154 const SkPoint& bisector(int index) const { return fPts[index].fBisector; } in bisector() function
212 bool computePtAlongBisector(int startIdx, const SkPoint& bisector,
|
| /external/skia/src/gpu/ |
| D | GrAATriangulator.cpp | 96 Edge bisector(v, v->fPartner, 1, EdgeType::kConnector); in makeEvent() local
99 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in makeEvent()
447 Line bisector(innerPoint, outerPoint); in strokeBoundary() local
448 Line tangent(v->fPoint, v->fPoint + SkPoint::Make(bisector.fA, bisector.fB)); in strokeBoundary()
462 !outerTangent.intersect(bisector, &outerPoint)) { in strokeBoundary()
470 bisector.intersect(prevTangent, &outerPoint); in strokeBoundary()
473 bisector.intersect(nextTangent, &outerPoint); in strokeBoundary()
487 bisector.intersect(prevTangent, &innerPoint); in strokeBoundary()
490 bisector.intersect(nextTangent, &innerPoint); in strokeBoundary()
|
| /external/skia/src/gpu/tessellate/ |
| D | GrStrokeHardwareTessellator.cpp | 539 SkPoint bisector = SkFindBisector(tan0, tan1); in internalJoinTo() local
549 bisector = (junctionPoint + bisector) - (junctionPoint - bisector); in internalJoinTo()
550 c0 = junctionPoint + bisector; in internalJoinTo()
551 c1 = junctionPoint - bisector; in internalJoinTo()
|
| /external/skia/src/core/ |
| D | SkGeometry.cpp | 219 SkVector bisector = SkFindBisector(tan0, -tan1); in SkFindQuadMidTangent() local
232 float T = sk_ieee_float_divide(tan0.dot(bisector), (tan0 - tan1).dot(bisector)); in SkFindQuadMidTangent()
618 SkVector bisector = SkFindBisector(tan0, -tan1); in SkFindCubicMidTangent() local
638 Sk4f coeffs = C_x * bisector.x() + C_y * bisector.y(); in SkFindCubicMidTangent()
1523 SkVector bisector = SkFindBisector(tan0, -tan1); in findMidTangent() local
1546 float a = bisector.dot(A); in findMidTangent()
1547 float b = bisector.dot(B); in findMidTangent()
1548 float c = bisector.dot(C); in findMidTangent()
|
| /external/toolchain-utils/binary_search_tool/ndk/ |
| D | README.md | 84 bisector should help you.
|
| /external/skqp/src/gpu/ |
| D | GrTessellator.cpp | 1904 Line bisector(innerPoint, outerPoint); in stroke_boundary() local
1905 Line tangent(v->fPoint, v->fPoint + SkPoint::Make(bisector.fA, bisector.fB)); in stroke_boundary()
1919 !outerTangent.intersect(bisector, &outerPoint)) { in stroke_boundary()
1927 bisector.intersect(prevTangent, &outerPoint); in stroke_boundary()
1930 bisector.intersect(nextTangent, &outerPoint); in stroke_boundary()
1944 bisector.intersect(prevTangent, &innerPoint); in stroke_boundary()
1947 bisector.intersect(nextTangent, &innerPoint); in stroke_boundary()
|
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | ospd.txt.gz | |
| /external/cldr/tools/java/org/unicode/cldr/util/data/transforms/ |
| D | internal_raw_IPA-old.txt | 20624 bisector baɪsˈɛktər
|
| D | internal_raw_IPA.txt | 17552 bisector %34151 baɪsˈɛktər
|