/external/skia/src/effects/ |
SkTileImageFilter.cpp | 27 if (!ir.intersect(srcRect)) { 49 if (!dstRect.intersect(SkRect::Make(ctx.clipBounds()))) {
|
SkMergeImageFilter.cpp | 96 if (!bounds.intersect(ctx.clipBounds())) {
|
/frameworks/support/compat/api21/android/support/v4/view/ |
ViewCompatLollipop.java | 200 // If the view currently does not currently intersect the parent (and is therefore 209 // The view has now been offset, so let's intersect the Rect and invalidate where 211 if (needInvalidateWorkaround && parentRect.intersect(view.getLeft(), view.getTop(), 225 // If the view currently does not currently intersect the parent (and is therefore 234 // The view has now been offset, so let's intersect the Rect and invalidate where 236 if (needInvalidateWorkaround && parentRect.intersect(view.getLeft(), view.getTop(),
|
/packages/apps/Camera2/src/com/android/camera/ui/ |
ZoomView.java | 94 visibleRect.intersect(0, 0, mViewportWidth - 1, mViewportHeight - 1); 116 region.intersect(0, 0, imageSize.x - 1, imageSize.y - 1);
|
/external/skia/src/gpu/ |
GrDrawTarget.cpp | 153 if (!copyRect.intersect(drawIBounds)) { 368 if (!clippedRect.intersect(rtRect)) { 426 template <class Left, class Right> static bool intersect(const Left& a, const Right& b) { function 438 // 2) intersect with something 468 if (intersect(candidate->bounds(), batch->bounds())) { 513 if (!ibounds.intersect(scissor->rect())) {
|
GrClipMaskManager.cpp | 215 // Fallthrough, handled same as intersect. 307 SkIRect intersect; local 308 devRect.roundOut(&intersect); 309 if (intersect.intersect(clip.irect())) { 310 *out = GrClip(intersect); 361 if (scissor.intersect(clipSpaceRTIBounds)) { 375 if (!clipSpaceReduceQueryBounds.intersect(clipSpaceRTIBounds, devIBounds)) { [all...] |
GrLayerHoister.cpp | 104 if (!srcIR->intersect(clipBounds)) { 160 if (!layerRect.intersect(query)) { 203 // Find and prepare for hoisting all the layers that intersect the query rect 213 if (!layerRect.intersect(query)) {
|
GrSoftwarePathRenderer.cpp | 56 if (!devPathBounds->intersect(pathIBounds)) {
|
/external/skia/include/core/ |
SkRect.h | 283 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& r) { 284 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); 287 /** If rectangles a and b intersect, return true and set this rectangle to 291 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { 305 /** If rectangles a and b intersect, return true and set this rectangle to 330 bool SK_WARN_UNUSED_RESULT intersect(int32_t left, int32_t top, 343 /** Returns true if a and b are not empty, and they intersect 352 * Returns true if a and b intersect. debug-asserts that neither are empty. 678 bool SK_WARN_UNUSED_RESULT intersect(const SkRect& r); 685 bool SK_WARN_UNUSED_RESULT intersect(SkScalar left, SkScalar top, [all...] |
/external/skia/tests/ |
PathOpsAngleIdeas.cpp | 49 i.intersect(arc, quad); 58 i.intersect(arc, quad); 62 i.intersect(arc, quad); 472 // continue end point rays and see if they intersect the opposite curve 476 SkIntersections intersect[2]; 491 intersect[index].intersectRay(q, rays[index]); 492 const SkIntersections& i = intersect[index]; 588 i.intersect(quad1, quad2); 618 i.intersect(quad1, quad2); 661 If the hulls overlap, and have the same general direction, then intersect the shorter end point ra [all...] |
PathOpsConicLineIntersectionTest.cpp | 52 intersections.intersect(conic, line);
|
PathOpsCubicIntersectionTest.cpp | 41 tIntersections.intersect(cubic1, cubic2); 395 intersections.intersect(cubic1, cubic2); 494 int newIntersects = intersections2.intersect(cubic1, cubic2); 643 int result = i.intersect(chopped[0], chopped[1]);
|
PathOpsQuadLineIntersectionTest.cpp | 52 intersections.intersect(quad, line);
|
PathOpsQuadLineIntersectionThreadedTest.cpp | 35 intersections.intersect(quad, line);
|
/external/skia/src/pathops/ |
SkDConicLineIntersection.cpp | 96 int intersect() { function in class:LineConicIntersections 340 int SkIntersections::intersect(const SkDConic& conic, const SkDLine& line) { function in class:SkIntersections 343 return c.intersect();
|
SkDCubicLineIntersection.cpp | 146 int intersect() { function in class:LineCubicIntersections 414 int SkIntersections::intersect(const SkDCubic& cubic, const SkDLine& line) { function in class:SkIntersections 417 return c.intersect();
|
SkDQuadLineIntersection.cpp | 168 int intersect() { function in class:LineQuadraticIntersections 421 int SkIntersections::intersect(const SkDQuad& quad, const SkDLine& line) { function in class:SkIntersections 424 return q.intersect();
|
/frameworks/base/graphics/java/android/graphics/ |
Rect.java | 422 * @return true if the specified rectangle and this rectangle intersect 427 public boolean intersect(int left, int top, int right, int bottom) { method in class:Rect 445 * @return true if the specified rectangle and this rectangle intersect 450 public boolean intersect(Rect r) { method in class:Rect 451 return intersect(r.left, r.top, r.right, r.bottom); 455 * If rectangles a and b intersect, return true and set this rectangle to 462 * @return true iff the two specified rectangles intersect. If they do, set 481 * if either rectangle is empty. To record the intersection, use intersect() 497 * Returns true iff the two specified rectangles intersect. In no event are 499 * use {@link #intersect(Rect)} or {@link #setIntersect(Rect, Rect)} [all...] |
/cts/tests/tests/graphics/src/android/graphics/cts/ |
RectFTest.java | 144 assertTrue(mRectF.intersect(5, 5, 15, 15)); 151 assertFalse(mRectF.intersect(15, 15, 25, 25)); 165 assertTrue(mRectF.intersect(rectF)); 173 assertFalse(mRectF.intersect(rectF));
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
Label.java | 361 public static boolean intersect(Label label, Label edgeLabel) { method in class:Label
|
/external/clang/include/clang/Analysis/Analyses/ |
Consumed.h | 165 void intersect(const ConsumedStateMap &Other);
|
/external/libvpx/libvpx/tools/ |
ftfy.sh | 131 # Intersect the two diffs 132 "${dirname_self}"/intersect-diffs.py \
|
/external/llvm/include/llvm/IR/ |
PassManager.h | 106 /// \brief Intersect this set with another in place. 110 void intersect(const PreservedAnalyses &Arg) { function in class:llvm::PreservedAnalyses 122 /// \brief Intersect this set with a temporary other set in place. 126 void intersect(PreservedAnalyses &&Arg) { function in class:llvm::PreservedAnalyses 219 // Finally, we intersect the final preserved analyses to compute the 221 PA.intersect(std::move(PassPA)); 807 // Then intersect the preserved set so that invalidation of module 809 PA.intersect(std::move(PassPA)); [all...] |
/external/webrtc/webrtc/modules/audio_coding/neteq/test/delay_tool/ |
plot_neteq_delay.m | 139 use_ix = intersect(cng_ix,... % use those that are not CNG/SID frames... 140 intersect(find(isfinite(s.decode)),... % ... that did arrive ...
|
/frameworks/base/core/java/android/hardware/camera2/legacy/ |
ParameterUtils.java | 389 if (!actualCrop.intersect(activeArray)) { [all...] |