| /prebuilts/misc/windows/sdl2/test/ |
| testautomation_rect.c | 25 "Check for correct intersection result: expected %s, got %s intersecting rect (%d,%d,%d,%d) with line (%d,%d - %d,%d)",
313 "Check intersection result: expected %s, got %s intersecting A (%d,%d,%d,%d) with B (%d,%d,%d,%d)",
468 * \brief Tests SDL_IntersectRect() with B partially intersecting A
572 /* intersecting pixels */
582 /* non-intersecting pixels cases */
760 * \brief Tests SDL_HasIntersection() with B partially intersecting A
841 /* intersecting pixels */
851 /* non-intersecting pixels cases */
[all...] |
| /external/skia/src/gpu/ |
| GrReducedClip.cpp | 215 // Intersecting an inverse shape is the same as differencing the non-inverse shape.
245 // intersecting with the empty set yields the empty set
|
| GrTessellator.cpp | 30 * 4) Simplify the mesh by inserting new vertices at intersecting edges (simplify()).
276 LOG("intersecting %g -> %g with %g -> %g\n",
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| MultiType.java | 31 * {@link Type#isAssignableFrom(Type)}, as well as removing non-intersecting
|
| /external/skia/src/pathops/ |
| SkOpEdgeBuilder.cpp | 202 // split self-intersecting cubics in two before proceeding
|
| SkOpSegment.h | 418 int fCount; // number of spans (one for a non-intersecting segment)
|
| /art/compiler/optimizing/ |
| register_allocator_test.cc | 79 // Test with two non-intersecting intervals.
94 // Test with two non-intersecting intervals, with one with a lifetime hole.
109 // Test with intersecting intervals.
[all...] |
| gvn.cc | 142 // Updates this set by intersecting with instructions in a predecessor's set.
|
| /external/chromium-trace/catapult/tracing/tracing/base/ |
| interval_tree.html | 145 * @return {Array} All [begin, end] pairs inside intersecting intervals.
|
| sorted_array_utils.html | 197 * @param {function():*} cb The function to run for intersecting intervals.
|
| /external/chromium-trace/catapult/tracing/tracing/ui/tracks/ |
| ruler_track.html | 349 * Adds items intersecting the given range to a selection.
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| GeometryUtils.java | 140 /** Returns the centroid for the specified non-self-intersecting polygon. */
|
| /external/opencv3/doc/tutorials/imgproc/imgtrans/hough_lines/ |
| hough_lines.markdown | 67 finding the number of intersections between curves.The more curves intersecting means that the
|
| /external/skia/gm/ |
| concavepaths.cpp | 113 // Star test (self-intersecting)
|
| /external/llvm/test/Transforms/InstCombine/ |
| add2.ll | 315 ; Intersecting these ranges, we know the value returned is in [0, 8).
334 ; [0, 32). Intersecting these ranges, we know the value returned is in
|
| /external/skia/include/core/ |
| SkImageFilter.h | 400 * initial bounds, and intersecting the result with the context's clip
401 * bounds. "srcBounds" (if non-null) are computed by intersecting the
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| bitmap.h | 413 /* If we're at the same index, then we have some intersecting bits. */
565 /* Advance to the next nonzero bit of an intersecting pair of
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| onepass.go | 144 // mergeRuneSets merges two non-intersecting runesets, and returns the merged result,
148 // The code assumes that both inputs contain ordered and non-intersecting rune pairs.
|
| /prebuilts/go/linux-x86/src/regexp/ |
| onepass.go | 144 // mergeRuneSets merges two non-intersecting runesets, and returns the merged result,
148 // The code assumes that both inputs contain ordered and non-intersecting rune pairs.
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_linux_libcdep.cc | 395 // If stack and tls intersect, make them non-intersecting.
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 192 /** \returns true if the box \a b is intersecting the box \c *this.
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/collision/ |
| BoundingBox.java | 279 /** Returns whether the given bounding box is intersecting this bounding box (at least one point in).
|
| /frameworks/base/packages/PrintSpooler/src/com/android/printspooler/util/ |
| PageRangeUtils.java | 88 // which is they contain monotonically increasing non-intersecting
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| BinPacker.java | 41 * they are intersecting the newly placed rectangle.
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btBoxBoxDetector.cpp | 402 // find a point pa on the intersecting edge of box 1
411 // find a point pb on the intersecting edge of box 2
|
