| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/unicode/bidi/ |
| example_test.go | 75 // and render the intersections -
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/bidi/ |
| example_test.go | 75 // and render the intersections -
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| BackgroundCollisionComponent.java | 127 * vertical intersections. Perform another ray test, this time from the top of the
216 // This time we will just check the inside of the bounding box for intersections.
|
| /external/skia/include/core/ |
| SkPaint.h | [all...] |
| /external/skqp/include/core/ |
| SkPaint.h | [all...] |
| /external/tensorflow/tensorflow/examples/android/src/org/tensorflow/demo/tracking/ |
| MultiBoxTracker.java | 328 // Look for intersections that will be overridden by this object or an intersection that would
363 // If we're already tracking the max object and no intersections were found to bump off,
|
| /external/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 258 // combine t values when multiple intersections occur on some segments but not others
|
| SkPathOpsOp.cpp | 278 // find all intersections between segments
|
| /external/skqp/src/pathops/ |
| SkPathOpsCommon.cpp | 258 // combine t values when multiple intersections occur on some segments but not others
|
| SkPathOpsOp.cpp | 278 // find all intersections between segments
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| msinkaut.h | [all...] |
| /external/skia/src/utils/ |
| SkInsetConvexPolygon.cpp | 272 // store all the valid intersections that aren't nearly coincident
|
| /external/skia/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 158 // skip answers with no intersections (although note the bug!) or two, or more
|
| TessellatingPathRendererTests.cpp | 40 // Intersections which fall exactly on the current vertex, and require
351 // A path which contains out-of-range colinear intersections.
|
| /external/skqp/src/utils/ |
| SkInsetConvexPolygon.cpp | 272 // store all the valid intersections that aren't nearly coincident
|
| /external/skqp/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 158 // skip answers with no intersections (although note the bug!) or two, or more
|
| TessellatingPathRendererTests.cpp | 40 // Intersections which fall exactly on the current vertex, and require
351 // A path which contains out-of-range colinear intersections.
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| ConstantRange.h | 162 /// intersections with the same set size, A.intersectWith(B) might not
|
| /external/freetype/docs/ |
| raster.txt | 538 have to compute the intersections of arcs with the profile's
545 compute its intersections with the
|
| /external/skia/src/gpu/ccpr/ |
| GrCCGeometry.cpp | 332 // 3. The section between the two inflections/intersections, with padding.
339 // Sections 2 & 4 must be approximated. For loop intersections we render them with
|
| /external/skqp/src/gpu/ccpr/ |
| GrCCGeometry.cpp | 332 // 3. The section between the two inflections/intersections, with padding.
339 // Sections 2 & 4 must be approximated. For loop intersections we render them with
|
| /external/opencv/cvaux/src/ |
| cvlee.cpp | 667 // Computation of intersections of bisectors //
683 : -1, if edges have no intersections
705 : -1, if edges have no intersections
727 : -1, if edges have no intersections
[all...] |
| /external/skia/tools/ |
| pathops_sorter.htm | 844 var intersections = intersect[intersectIndex];
845 for (var i in intersections) {
846 var intersection = intersections[i];
[all...] |
| /external/skqp/tools/ |
| pathops_sorter.htm | 850 var intersections = intersect[intersectIndex];
851 for (var i in intersections) {
852 var intersection = intersections[i];
[all...] |
| /external/deqp/framework/randomshaders/ |
| rsgVariableManager.cpp | 443 // Speed up computing intersections.
|
