Home
last modified time | relevance | path

Searched refs:intersect (Results 1 – 25 of 370) sorted by relevance

12345678910>>...15

/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jce/provider/
DPKIXNameConstraintValidator.java139 Set intersect = new HashSet(); in intersectDN() local
148 intersect.add(dn); in intersectDN()
160 intersect.add(dn); in intersectDN()
164 intersect.add(subtree); in intersectDN()
169 return intersect; in intersectDN()
186 Set intersect = new HashSet(); in unionDN() local
195 intersect.add(subtree); in unionDN()
199 intersect.add(dn); in unionDN()
203 intersect.add(subtree); in unionDN()
204 intersect.add(dn); in unionDN()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
DPKIXNameConstraintValidator.java135 Set intersect = new HashSet(); in intersectDN() local
144 intersect.add(dn); in intersectDN()
156 intersect.add(dn); in intersectDN()
160 intersect.add(subtree); in intersectDN()
165 return intersect; in intersectDN()
182 Set intersect = new HashSet(); in unionDN() local
191 intersect.add(subtree); in unionDN()
195 intersect.add(dn); in unionDN()
199 intersect.add(subtree); in unionDN()
200 intersect.add(dn); in unionDN()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
DPKIXNameConstraintValidator.java456 Set intersect = new HashSet(); in intersectDN() local
465 intersect.add(dn); in intersectDN()
477 intersect.add(dn); in intersectDN()
481 intersect.add(subtree); in intersectDN()
486 return intersect; in intersectDN()
503 Set intersect = new HashSet(); in unionDN() local
512 intersect.add(subtree); in unionDN()
516 intersect.add(dn); in unionDN()
520 intersect.add(subtree); in unionDN()
521 intersect.add(dn); in unionDN()
[all …]
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/asn1/x509/
DPKIXNameConstraintValidator.java460 Set intersect = new HashSet(); in intersectDN() local
469 intersect.add(dn); in intersectDN()
481 intersect.add(dn); in intersectDN()
485 intersect.add(subtree); in intersectDN()
490 return intersect; in intersectDN()
507 Set intersect = new HashSet(); in unionDN() local
516 intersect.add(subtree); in unionDN()
520 intersect.add(dn); in unionDN()
524 intersect.add(subtree); in unionDN()
525 intersect.add(dn); in unionDN()
[all …]
/external/skia/src/pathops/
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(const SkDConic&, const SkDConic&);
[all …]
/external/skqp/src/pathops/
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(const SkDConic&, const SkDConic&);
[all …]
/external/grpc-grpc/tools/mkowners/
Dmkowners.py171 intersect = files_have.intersection(files_add)
172 if intersect:
174 if f not in intersect:
191 intersect = files_parent.intersection(files_child)
193 if intersect:
196 if f not in intersect:
226 intersect = files.intersection(files1) variable
227 if files == intersect:
231 elif intersect:
/external/guava/guava-tests/test/com/google/common/collect/
DGeneralRangeTest.java136 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 4, CLOSED)));
143 range.intersect(GeneralRange.range(ORDERING, null, OPEN, 5, CLOSED)));
146 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 5, CLOSED)));
149 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 4, OPEN)));
155 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 4, CLOSED)));
161 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 5, CLOSED)));
163 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 3, OPEN)));
168 assertTrue(range.intersect(GeneralRange.range(ORDERING, 5, CLOSED, 6, CLOSED)).isEmpty());
169 assertTrue(range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 2, OPEN)).isEmpty());
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
DGeneralRangeTest.java134 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 4, CLOSED)));
141 range.intersect(GeneralRange.range(ORDERING, null, OPEN, 5, CLOSED)));
144 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 5, CLOSED)));
147 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 4, OPEN)));
153 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 4, CLOSED)));
159 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 5, CLOSED)));
161 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 3, OPEN)));
166 assertTrue(range.intersect(GeneralRange.range(ORDERING, 5, CLOSED, 6, CLOSED)).isEmpty());
167 assertTrue(range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 2, OPEN)).isEmpty());
/external/skia/tests/
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()
DPathOpsQuadIntersectionTest.cpp40 intersections.intersect(quad1, quad2); in standardTestCases()
345 intersections.intersect(quad1, quad2); in oneOffTest1()
397 intersections2.intersect(quad1, quad2); in coincidentTestOne()
545 (void) intersections.intersect(quad1, quad2); in DEF_TEST()
558 (void) intersections.intersect(quad1, quad2); in DEF_TEST()
/external/skqp/tests/
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()
DPathOpsQuadIntersectionTest.cpp40 intersections.intersect(quad1, quad2); in standardTestCases()
345 intersections.intersect(quad1, quad2); in oneOffTest1()
397 intersections2.intersect(quad1, quad2); in coincidentTestOne()
545 (void) intersections.intersect(quad1, quad2); in DEF_TEST()
558 (void) intersections.intersect(quad1, quad2); in DEF_TEST()
/external/mesa3d/src/gallium/drivers/swr/rasterizer/core/
Drasterizer_impl.h994 OSALIGNSIMD(SWR_RECT) intersect;
995 intersect.xmin = std::max(bbox.xmin, scissorInFixedPoint.xmin);
996 intersect.xmax = std::min(bbox.xmax - 1, scissorInFixedPoint.xmax);
997 intersect.ymin = std::max(bbox.ymin, scissorInFixedPoint.ymin);
998 intersect.ymax = std::min(bbox.ymax - 1, scissorInFixedPoint.ymax);
1010 intersect.xmin = std::max(intersect.xmin, macroBoxLeft);
1011 intersect.ymin = std::max(intersect.ymin, macroBoxTop);
1012 intersect.xmax = std::min(intersect.xmax, macroBoxRight);
1013 intersect.ymax = std::min(intersect.ymax, macroBoxBottom);
1015 …(intersect.xmin <= intersect.xmax && intersect.ymin <= intersect.ymax && intersect.xmin >= 0 && in…
[all …]
/external/tensorflow/tensorflow/lite/java/ovic/src/main/java/org/tensorflow/ovic/
DBoundingBox.java48 public float intersect(BoundingBox bbx) { in intersect() method in BoundingBox
55 return bbx.getArea() + this.getArea() - this.intersect(bbx); in union()
66 return (float) (this.intersect(bbx) * 1.0 / this.union(bbx)); in computeIoU()
/external/skia/src/core/
DSkRect.cpp96 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { in intersect() function in SkRect
102 bool SkRect::intersect(const SkRect& r) { in intersect() function in SkRect
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
106 bool SkRect::intersect(const SkRect& a, const SkRect& b) { in intersect() function in SkRect
/external/skqp/src/core/
DSkRect.cpp96 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { in intersect() function in SkRect
102 bool SkRect::intersect(const SkRect& r) { in intersect() function in SkRect
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
106 bool SkRect::intersect(const SkRect& a, const SkRect& b) { in intersect() function in SkRect
/external/skia/src/gpu/
DGrScissorState.h19 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& rect) { in intersect() function
24 return fRect.intersect(rect); in intersect()
DGrFixedClip.h32 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& irect) { in intersect() function
33 return fScissorState.intersect(irect); in intersect()
/external/skqp/src/gpu/
DGrScissorState.h19 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& rect) { in intersect() function
24 return fRect.intersect(rect); in intersect()
DGrFixedClip.h32 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& irect) { in intersect() function
33 return fScissorState.intersect(irect); in intersect()
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DPassManagerTest.cpp281 Intersected.intersect(PA1); in TEST()
290 Intersected.intersect(PreservedAnalyses::all()); in TEST()
299 Intersected.intersect(PA2); in TEST()
309 Intersected.intersect(PA1); in TEST()
318 Intersected.intersect(PreservedAnalyses::none()); in TEST()
328 Intersected.intersect(PA3); in TEST()
339 Intersected.intersect(std::move(Tmp)); in TEST()
349 Intersected.intersect(std::move(Tmp2)); in TEST()
358 Intersected.intersect(std::move(Tmp3)); in TEST()
/external/skqp/include/core/
DSkRect.h530 bool intersect(const SkIRect& r) { in intersect() function
531 return this->intersect(*this, r); in intersect()
567 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { in intersect() function
588 bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) { in intersect() function
589 return this->intersect(*this, {left, top, right, bottom}); in intersect()
601 return dummy.intersect(a, b); in Intersects()
1243 bool intersect(const SkRect& r);
1259 bool intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
1270 bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b);
/external/skia/include/core/
DSkRect.h530 bool intersect(const SkIRect& r) { in intersect() function
531 return this->intersect(*this, r); in intersect()
567 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { in intersect() function
588 bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) { in intersect() function
589 return this->intersect(*this, {left, top, right, bottom}); in intersect()
601 return dummy.intersect(a, b); in Intersects()
1243 bool intersect(const SkRect& r);
1259 bool intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
1270 bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b);
/external/skia/docs/
DSkIRect_Reference.bmh829 IRects intersect when they enclose a common area. To intersect, each of the pair
1037 #Method bool intersect(const SkIRect& r)
1047 be before or after the call to intersect.
1051 SkDebugf("%s intersection: ", leftRect.intersect(rightRect) ? "" : "no ");
1059 #SeeAlso Intersects intersectNoEmptyCheck join SkRect::intersect
1065 #Method bool intersect(const SkIRect& a, const SkIRect& b)
1072 bool intersected = result.intersect({ 10, 40, 50, 80 }, { 30, 60, 70, 90 });
1080 #SeeAlso Intersects intersectNoEmptyCheck join SkRect::intersect
1103 #SeeAlso Intersects intersect join SkRect::intersect
1109 #Method bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom)
[all …]

12345678910>>...15