/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
D | PKIXNameConstraintValidator.java | 135 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/skia/src/pathops/ |
D | SkIntersections.h | 75 return intersect(conic, line); in conicLine() 99 return intersect(cubic, line); in cubicLine() 139 return intersect(aLine, bLine); in lineLine() 176 return intersect(quad, line); in quadLine() 245 int intersect(const SkDLine&, const SkDLine&); 246 int intersect(const SkDQuad&, const SkDLine&); 247 int intersect(const SkDQuad&, const SkDQuad&); 248 int intersect(const SkDConic&, const SkDLine&); 249 int intersect(const SkDConic&, const SkDQuad&); 250 int intersect(const SkDConic&, const SkDConic&); [all …]
|
D | SkPathOpsTSect.cpp | 10 int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) { in intersect() function in SkIntersections 17 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { in intersect() function in SkIntersections 24 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) { in intersect() function in SkIntersections 31 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { in intersect() function in SkIntersections 38 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { in intersect() function in SkIntersections 45 int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) { in intersect() function in SkIntersections
|
D | SkAddIntersections.cpp | 403 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs() 409 pts = ts.intersect(conic2.set(wn.pts(), wn.weight()), in AddIntersectTs() 416 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts())); in AddIntersectTs() 441 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()), in AddIntersectTs() 447 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()), in AddIntersectTs() 454 pts = ts.intersect(cubic2.set(wn.pts()), in AddIntersectTs() 478 pts = ts.intersect(cubic1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs() 483 pts = ts.intersect(cubic1.set(wt.pts()), in AddIntersectTs() 489 pts = ts.intersect(cubic1.set(wt.pts()), cubic2.set(wn.pts())); in AddIntersectTs()
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
D | GeneralRangeTest.java | 134 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/guava/guava-tests/test/com/google/common/collect/ |
D | GeneralRangeTest.java | 136 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/skia/tests/ |
D | PathOpsThreeWayTest.cpp | 55 i->intersect(oLine, iLine); in testSetTest() 57 i->intersect(iTest.curve, oLine); in testSetTest() 59 i->intersect(oTest.curve, iLine); in testSetTest() 61 i->intersect(oTest.curve, iTest.curve); in testSetTest()
|
D | PathOpsQuadIntersectionTest.cpp | 36 intersections.intersect(quad1, quad2); in standardTestCases() 331 intersections.intersect(quad1, quad2); in oneOffTest1() 379 intersections2.intersect(quad1, quad2); in coincidentTestOne() 523 (void) intersections.intersect(quad1, quad2); in DEF_TEST() 533 (void) intersections.intersect(quad1, quad2); in DEF_TEST()
|
D | PathOpsCubicLineIntersectionTest.cpp | 46 int roots = i.intersect(cubic, line); in testFail() 119 intersections.intersect(cubic, line); in doIntersect() 196 i.intersect(cubic, line); in DEF_TEST()
|
D | PathOpsAngleIdeas.cpp | 49 i.intersect(arc, quad); in testArc() 58 i.intersect(arc, quad); in testArc() 62 i.intersect(arc, quad); in testArc() 476 SkIntersections intersect[2]; in testQuadAngles() local 491 intersect[index].intersectRay(q, rays[index]); in testQuadAngles() 492 const SkIntersections& i = intersect[index]; in testQuadAngles() 588 i.intersect(quad1, quad2); in DEF_TEST() 618 i.intersect(quad1, quad2); in DEF_TEST() 804 i.intersect(quad1, quad2); in DEF_TEST()
|
D | PathOpsLineIntersectionTest.cpp | 113 int pts = i.intersect(line1, line2); in testOne() 156 int pts = ts.intersect(line1, line2); in testOneCoincident() 218 int pts = ts.intersect(line1, line2); in DEF_TEST()
|
D | PathOpsCubicIntersectionTest.cpp | 39 tIntersections.intersect(cubic1, cubic2); in standardTestCases() 393 intersections.intersect(cubic1, cubic2); in oneOff() 486 int newIntersects = intersections2.intersect(cubic1, cubic2); in CubicIntersection_RandTest() 636 int result = i.intersect(chopped[0], chopped[1]); in selfOneOff()
|
/external/skia/src/core/ |
D | SkRect.cpp | 113 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { in intersect() function in SkRect 119 bool SkRect::intersect(const SkRect& r) { in intersect() function in SkRect 120 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect() 123 bool SkRect::intersect(const SkRect& a, const SkRect& b) { in intersect() function in SkRect
|
D | SkMaskFilter.cpp | 55 if (r.intersect(bounds, clipR)) { in blitClippedMask() 62 if (r.intersect(rect, clipR)) { in blitClippedRect() 145 if (r.intersect(clipR)) { in draw_nine_clipped() 158 if (r.intersect(clipR)) { in draw_nine_clipped() 171 if (r.intersect(clipR)) { in draw_nine_clipped() 182 if (r.intersect(clipR)) { in draw_nine_clipped()
|
D | SkClipStack.cpp | 234 if (!fFiniteBound.intersect(prevFinite)) { in combineBoundsDiff() 293 if (!fFiniteBound.intersect(prevFinite)) { in combineBoundsUnion() 339 if (!fFiniteBound.intersect(prevFinite)) { in combineBoundsIntersection() 361 if (!fFiniteBound.intersect(prevFinite)) { in combineBoundsRevDiff() 688 if (!isectRect.intersect(prior->getRect(), element.getRect())) { in pushElement() 834 if (!devBounds->intersect(temp)) { in getConservativeBounds()
|
/external/skia/src/gpu/ |
D | GrRenderTarget.cpp | 30 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) { in flagAsNeedingResolve() 44 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) { in overrideResolveRect()
|
D | GrReorderCommandBuilder.cpp | 10 static bool intersect(const SkRect& a, const SkRect& b) { in intersect() function 34 if (intersect(previous->fBatch->bounds(), batch->bounds())) { in recordDrawBatch()
|
/external/junit/src/org/junit/runner/manipulation/ |
D | Filter.java | 36 public Filter intersect(Filter second) { 96 public Filter intersect(final Filter second) {
|
/external/icu/icu4c/source/i18n/ |
D | scriptset.h | 47 ScriptSet &intersect(const ScriptSet &other); 48 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
|
D | scriptset.cpp | 111 ScriptSet &ScriptSet::intersect(const ScriptSet &other) { in intersect() function in ScriptSet 118 ScriptSet &ScriptSet::intersect(UScriptCode script, UErrorCode &status) { in intersect() function in ScriptSet 122 this->intersect(t); in intersect() 138 t.intersect(other); in contains()
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
D | ShadowRect.java | 99 public boolean intersect(Rect r) { in intersect() method in ShadowRect 104 public boolean intersect(int left, int top, int right, int bottom) { in intersect() method in ShadowRect 105 return intersect(new Rect(left, top, right, bottom)); in intersect()
|
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/ |
D | Util.java | 254 public static <T> T[] intersect(Class<T> arrayType, T[] first, T[] second) { 255 List<T> result = intersect(first, second); 263 private static <T> List<T> intersect(T[] first, T[] second) {
|
/external/skia/include/core/ |
D | SkRect.h | 283 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& r) { in intersect() function 284 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect() 291 bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { in intersect() function 330 bool SK_WARN_UNUSED_RESULT intersect(int32_t left, int32_t top, in intersect() function 679 bool SK_WARN_UNUSED_RESULT intersect(const SkRect& r); 686 bool SK_WARN_UNUSED_RESULT intersect(SkScalar left, SkScalar top, 694 bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b);
|
/external/skia/platform_tools/android/bin/ |
D | gyp_to_android.py | 128 common = vars_dict_lib.intersect(var_dict_list) 173 arm_var_dict = vars_dict_lib.intersect([arm_var_dict, arm_neon_var_dict])
|
/external/skia/src/effects/ |
D | SkPictureImageFilter.cpp | 103 if (!bounds.intersect(ctx.clipBounds())) { in onFilterImage() 151 if (!localBounds.intersect(fCropRect)) in drawPictureAtLocalResolution()
|