Home
last modified time | relevance | path

Searched refs:intersect (Results 1 - 25 of 204) sorted by relevance

123456789

/third_party/skia/tests/
H A DGrClipStackTest.cpp108 ElementsBuilder& intersect() { fOp = SkClipOp::kIntersect; return *this; } in intersect() function in __anon19011::ElementsBuilder
249 bool intersect = (e.fOp == SkClipOp::kIntersect && !e.fShape.inverted()) || in getOptimalBounds() local
254 if (intersect) { in getOptimalBounds()
517 SkAssertResult(fracIntersect.intersect(fracRect1, fracRect2)); in DEF_TEST()
519 SkAssertResult(alignedIntersect.intersect(pixelAligned, fracRect1)); in DEF_TEST()
523 .actual().aa().intersect() in DEF_TEST()
526 .expect().aa().intersect().rect(fracIntersect).finishElements() in DEF_TEST()
532 .actual().nonAA().intersect() in DEF_TEST()
535 .expect().nonAA().intersect().rect(fracIntersect).finishElements() in DEF_TEST()
541 .actual().intersect() in DEF_TEST()
639 SkRRect intersect = SkRRectPriv::ConservativeIntersect(r1, r2); DEF_TEST() local
[all...]
H A DPathOpsThreeWayTest.cpp59 i->intersect(oLine, iLine); in testSetTest()
61 i->intersect(iCurve, oLine); in testSetTest()
63 i->intersect(oCurve, iLine); in testSetTest()
65 i->intersect(oCurve, iCurve); in testSetTest()
/third_party/skia/src/pathops/
H A DSkIntersections.h79 return intersect(conic, line); in conicLine()
103 return intersect(cubic, line); in cubicLine()
152 return intersect(aLine, bLine); in lineLine()
188 return intersect(quad, line); in quadLine()
258 int intersect(const SkDLine&, const SkDLine&);
259 int intersect(const SkDQuad&, const SkDLine&);
260 int intersect(const SkDQuad&, const SkDQuad&);
261 int intersect(const SkDConic&, const SkDLine&);
262 int intersect(const SkDConic&, const SkDQuad&);
263 int intersect(cons
[all...]
H A DSkAddIntersections.cpp19 SkDebugf("%s no intersect " LINE_DEBUG_STR " " LINE_DEBUG_STR "\n", in debugShowLineIntersection()
40 SkDebugf("%s no intersect " QUAD_DEBUG_STR " " LINE_DEBUG_STR "\n", in debugShowQuadLineIntersection()
60 SkDebugf("%s no intersect " QUAD_DEBUG_STR " " QUAD_DEBUG_STR "\n", in debugShowQuadIntersection()
80 SkDebugf("%s no intersect " CONIC_DEBUG_STR " " LINE_DEBUG_STR "\n", in debugShowConicLineIntersection()
100 SkDebugf("%s no intersect " CONIC_DEBUG_STR " " QUAD_DEBUG_STR "\n", in debugShowConicQuadIntersection()
120 SkDebugf("%s no intersect " CONIC_DEBUG_STR " " CONIC_DEBUG_STR "\n", in debugShowConicIntersection()
141 SkDebugf("%s no intersect " CUBIC_DEBUG_STR " " LINE_DEBUG_STR "\n", in debugShowCubicLineIntersection()
161 SkDebugf("%s no intersect " CUBIC_DEBUG_STR " " QUAD_DEBUG_STR "\n", in debugShowCubicQuadIntersection()
181 SkDebugf("%s no intersect " CUBIC_DEBUG_STR " " CONIC_DEBUG_STR "\n", in debugShowCubicConicIntersection()
201 SkDebugf("%s no intersect " CUBIC_DEBUG_ST in debugShowCubicIntersection()
[all...]
/third_party/skia/src/gpu/
H A DGrScissorState.h31 return this->intersect(rect); in set()
34 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& rect) { in intersect() function in GrScissorState
35 if (!fRect.intersect(rect)) { in intersect()
72 // added that did not intersect with the render target or prior scissor.
H A DGrFixedClip.h36 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& irect) { in intersect() function in final
37 return fScissorState.intersect(irect); in intersect()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DDisjointRangeMap.java98 * <li>No ranges assigned to any other category value will intersect with the given ranges.
112 RangeTree overlap = assignedRanges.intersect(ranges); in assign()
167 DisjointRangeMap<T> intersect(RangeTree bounds) { in intersect() method in DisjointRangeMap
169 column, transformValues(map, r -> r.intersect(bounds)), assignedRanges.intersect(bounds)); in intersect()
/third_party/skia/src/effects/imagefilters/
H A DSkCropImageFilter.cpp91 if (!cropBounds.intersect(context.desiredOutput())) { in onFilterImage()
123 if (!requiredInput.intersect(desiredOutput)) { in onGetInputLayerBounds()
145 if (output.intersect(childOutput)) { in onGetOutputLayerBounds()
170 if (!inputBounds.intersect(SkRect(fCropRect))) { in computeFastBounds()
/third_party/mesa3d/src/gallium/drivers/zink/
H A Dzink_blit.c432 struct u_rect intersect = {0, width, 0, height}; in zink_blit_region_fills() local
440 if (!u_rect_test_intersection(&r, &intersect)) in zink_blit_region_fills()
444 u_rect_find_intersection(&r, &intersect); in zink_blit_region_fills()
445 if (intersect.x0 != 0 || intersect.y0 != 0 || in zink_blit_region_fills()
446 intersect.x1 != width || intersect.y1 != height) in zink_blit_region_fills()
467 struct u_rect intersect; in zink_blit_region_covers() local
471 u_rect_union(&intersect, &r, &c); in zink_blit_region_covers()
472 return intersect in zink_blit_region_covers()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeTest.java145 assertThat(a.intersect(a)).isEqualTo(a); in testIntersection()
146 assertThat(a.intersect(RangeTree.empty())).isSameInstanceAs(RangeTree.empty()); in testIntersection()
147 assertThat(RangeTree.empty().intersect(a)).isSameInstanceAs(RangeTree.empty()); in testIntersection()
150 assertThat(a.intersect(b)).containsExactly("1234", "456xx"); in testIntersection()
151 assertThat(b.intersect(a)).containsExactly("1234", "456xx"); in testIntersection()
192 RangeTree intAB = a.intersect(b); in testVennDiagram()
197 assertThat(subAB.intersect(intAB)).isSameInstanceAs(RangeTree.empty()); in testVennDiagram()
198 assertThat(subBA.intersect(intAB)).isSameInstanceAs(RangeTree.empty()); in testVennDiagram()
199 assertThat(subAB.intersect(subBA)).isSameInstanceAs(RangeTree.empty()); in testVennDiagram()
202 assertThat(subAB.union(subBA).intersect(intA in testVennDiagram()
[all...]
H A DPrefixTreeTest.java130 assertThat(prefixes("1234").intersect(prefixes("12"))).containsExactly("1234"); in testIntersection()
132 assertThat(prefixes("12").intersect(prefixes("12"))).containsExactly("12"); in testIntersection()
134 assertThat(prefixes("123").intersect(prefixes("124"))).isEmpty(); in testIntersection()
136 assertThat(prefixes("1234", "45x", "800").intersect(prefixes("12x", "4x67"))) in testIntersection()
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/p2p/
H A Dp2p_group.c1098 struct p2p_channels intersect, res; in p2p_group_get_common_freqs() local
1104 os_memset(&intersect, 0, sizeof(intersect)); in p2p_group_get_common_freqs()
1107 p2p_channels_union(&intersect, &group->p2p->cfg->channels, in p2p_group_get_common_freqs()
1108 &intersect); in p2p_group_get_common_freqs()
1112 &intersect); in p2p_group_get_common_freqs()
1121 p2p_channels_intersect(&intersect, &dev->channels, &res); in p2p_group_get_common_freqs()
1122 intersect = res; in p2p_group_get_common_freqs()
1125 p2p_channels_dump(group->p2p, "Group common channels", &intersect); in p2p_group_get_common_freqs()
1128 *num = p2p_channels_to_freqs(&intersect, common_freq in p2p_group_get_common_freqs()
[all...]
/third_party/skia/src/core/
H A DSkMaskFilter.cpp54 if (r.intersect(bounds, clipR)) { in blitClippedMask()
61 if (r.intersect(rect, clipR)) { in blitClippedRect()
144 if (r.intersect(clipR)) { in draw_nine_clipped()
157 if (r.intersect(clipR)) { in draw_nine_clipped()
170 if (r.intersect(clipR)) { in draw_nine_clipped()
181 if (r.intersect(clipR)) { in draw_nine_clipped()
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.cpp74 if (bisector1.intersect(bisector2, &p, &alpha)) { in makeEvent()
99 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in makeEvent()
440 if (!prevEdge->fLine.nearParallel(e->fLine) && prevInner.intersect(inner, &innerPoint) && in strokeBoundary()
441 prevOuter.intersect(outer, &outerPoint)) { in strokeBoundary()
460 if (!innerTangent.intersect(prevInner, &innerPoint1) || in strokeBoundary()
461 !innerTangent.intersect(inner, &innerPoint2) || in strokeBoundary()
462 !outerTangent.intersect(bisector, &outerPoint)) { in strokeBoundary()
470 bisector.intersect(prevTangent, &outerPoint); in strokeBoundary()
473 bisector.intersect(nextTangent, &outerPoint); in strokeBoundary()
478 if (!outerTangent.intersect(prevOute in strokeBoundary()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h496 // Then intersect the preserved set so that invalidation of module in run()
498 PA.intersect(std::move(PassPA)); in run()
625 PA.intersect(std::move(PassPA)); in run()
684 PA.intersect(std::move(PassPA)); in run()
694 PA.intersect(std::move(PassPA)); in run()
706 // Update the analysis manager with each run and intersect the total set in run()
709 PA.intersect(std::move(PassPA)); in run()
891 // Then intersect the preserved set so that invalidation of module in run()
893 // Also intersect with the cross-SCC preserved set to capture any in run()
895 UR.CrossSCCPA.intersect(PassP in run()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dscriptset.h52 ScriptSet &intersect(const ScriptSet &other);
53 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
H A Dscriptset.cpp107 ScriptSet &ScriptSet::intersect(const ScriptSet &other) { in intersect() function in ScriptSet
114 ScriptSet &ScriptSet::intersect(UScriptCode script, UErrorCode &status) { in intersect() function in ScriptSet
118 this->intersect(t); in intersect()
134 t.intersect(other); in contains()
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_dominance.c36 intersect(struct ir3_block *b1, struct ir3_block *b2) in intersect() function
62 new_idom = intersect(pred, new_idom); in calc_dominance()
/third_party/node/deps/icu-small/source/i18n/
H A Dscriptset.h52 ScriptSet &intersect(const ScriptSet &other);
53 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
H A Dscriptset.cpp107 ScriptSet &ScriptSet::intersect(const ScriptSet &other) { in intersect() function in ScriptSet
114 ScriptSet &ScriptSet::intersect(UScriptCode script, UErrorCode &status) { in intersect() function in ScriptSet
118 this->intersect(t); in intersect()
134 t.intersect(other); in contains()
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dscriptset.h52 ScriptSet &intersect(const ScriptSet &other);
53 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
H A Dscriptset.cpp107 ScriptSet &ScriptSet::intersect(const ScriptSet &other) { in intersect() function in ScriptSet
114 ScriptSet &ScriptSet::intersect(UScriptCode script, UErrorCode &status) { in intersect() function in ScriptSet
118 this->intersect(t); in intersect()
134 t.intersect(other); in contains()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLoopPassManager.cpp54 PA.intersect(std::move(PassPA)); in run()
69 // Finally, we intersect the final preserved analyses to compute the in run()
71 PA.intersect(std::move(PassPA)); in run()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_dominance.c55 intersect(nir_block *b1, nir_block *b2) in intersect() function
81 new_idom = intersect(pred, new_idom); in calc_dominance()
235 return intersect(b1, b2); in nir_dominance_lca()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTree.java84 * This means that it may not always be true that {@code minimal(A, B).intersect(minimal(B, A))}
88 checkArgument(include.intersect(exclude).isEmpty(), "ranges must be disjoint"); in minimal()
195 * range tree {@code R}, the intersection {@code P = p1.intersect(p2)} is defined such that:
197 * P.retainFrom(R) = p1.retainFrom(R).intersect(p2.retainFrom(R))
199 * If prefixes are the same length this is equivalent to {@link RangeTree#intersect(RangeTree)},
202 public PrefixTree intersect(PrefixTree other) { in intersect() method in PrefixTree
203 return SetOperations.INSTANCE.intersect(this, other); in intersect()

Completed in 16 milliseconds

123456789