/external/chromium_org/chrome/renderer/resources/extensions/enterprise_platform_keys/ |
H A D | utils.js | 7 function intersect(a, b) { function 16 exports.intersect = intersect;
|
H A D | key_pair.js | 6 var intersect = require('enterprise.platformKeys.utils').intersect; variable 24 intersect([KeyUsage.verify], usages), 29 intersect([KeyUsage.sign], usages),
|
H A D | subtle_crypto.js | 7 var intersect = require('enterprise.platformKeys.utils').intersect; variable 93 if (intersect(keyUsages, [KeyUsage.sign, KeyUsage.verify]).length !=
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | LineIntersection.h | 16 int intersect(const _Line& a, const _Line& b, Intersections&);
|
H A D | CubicConvexHull.cpp | 27 bool intersect() { function in class:CubicIntersections 51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { function in class:CubicIntersections 66 if (!::intersect(smallLine, largeLine, lineTs)) { 135 intersect(minT1, middle1, minT2, maxT2); 136 intersect(middle1, maxT1, minT2, maxT2); 139 intersect(minT1, maxT1, minT2, middle2); 140 intersect(minT1, maxT1, middle2, maxT2); 147 bool result = intersect(minT1, maxT1, minT2, maxT2); 162 bool intersect(const Cubic& c1, const Cubic& c2, Intersections& i) { function 164 return c.intersect(); [all...] |
H A D | CurveIntersection.h | 52 bool intersect(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 57 int intersect(const Cubic& cubic, Intersections& i); // return true if cubic self-intersects 58 int intersect(const Cubic& cubic, const Quadratic& quad, Intersections& ); 59 int intersect(const Cubic& cubic, const _Line& line, Intersections& ); 61 bool intersect(const Quadratic& q1, const Quadratic& q2, Intersections& ); 62 int intersect(const Quadratic& quad, const _Line& line, Intersections& );
|
H A D | LineIntersection_Test.cpp | 43 int pts = intersect(line1, line2, ts); 67 int pts = intersect(line1, line2, ts);
|
/external/skia/experimental/Intersection/ |
H A D | LineIntersection.h | 16 int intersect(const _Line& a, const _Line& b, Intersections&);
|
H A D | CubicConvexHull.cpp | 27 bool intersect() { function in class:CubicIntersections 51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { function in class:CubicIntersections 66 if (!::intersect(smallLine, largeLine, lineTs)) { 135 intersect(minT1, middle1, minT2, maxT2); 136 intersect(middle1, maxT1, minT2, maxT2); 139 intersect(minT1, maxT1, minT2, middle2); 140 intersect(minT1, maxT1, middle2, maxT2); 147 bool result = intersect(minT1, maxT1, minT2, maxT2); 162 bool intersect(const Cubic& c1, const Cubic& c2, Intersections& i) { function 164 return c.intersect(); [all...] |
H A D | CurveIntersection.h | 52 bool intersect(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 57 int intersect(const Cubic& cubic, Intersections& i); // return true if cubic self-intersects 58 int intersect(const Cubic& cubic, const Quadratic& quad, Intersections& ); 59 int intersect(const Cubic& cubic, const _Line& line, Intersections& ); 61 bool intersect(const Quadratic& q1, const Quadratic& q2, Intersections& ); 62 int intersect(const Quadratic& quad, const _Line& line, Intersections& );
|
H A D | LineIntersection_Test.cpp | 43 int pts = intersect(line1, line2, ts); 67 int pts = intersect(line1, line2, ts);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkIntersections.h | 49 fMax = 1; // self intersect 50 return intersect(cubic); 59 return intersect(aCubic, bCubic); 83 return intersect(cubic, line); 92 return intersect(cubic, quad); 132 return intersect(aLine, bLine); 169 return intersect(quad, line); 178 return intersect(aQuad, bQuad); 236 int intersect(const SkDLine&, const SkDLine&); 237 int intersect(cons [all...] |
/external/skia/src/pathops/ |
H A D | SkIntersections.h | 49 fMax = 1; // self intersect 50 return intersect(cubic); 59 return intersect(aCubic, bCubic); 83 return intersect(cubic, line); 92 return intersect(cubic, quad); 132 return intersect(aLine, bLine); 169 return intersect(quad, line); 178 return intersect(aQuad, bQuad); 236 int intersect(const SkDLine&, const SkDLine&); 237 int intersect(cons [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
H A D | PKIXNameConstraintValidator.java | 135 Set intersect = new HashSet(); 144 intersect.add(dn); 156 intersect.add(dn); 160 intersect.add(subtree); 165 return intersect; 182 Set intersect = new HashSet(); 191 intersect.add(subtree); 195 intersect.add(dn); 199 intersect.add(subtree); 200 intersect 1114 intersectEmail(String email1, String email2, Set intersect) argument 1284 intersectURI(String email1, String email2, Set intersect) argument [all...] |
H A D | ReasonsMask.java | 71 * @param mask The mask to intersect with. 74 ReasonsMask intersect(ReasonsMask mask) method in class:ReasonsMask
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | ClipRect.h | 63 void intersect(const LayoutRect& other) { m_rect.intersect(other); } function in class:WebCore::ClipRect 64 void intersect(const ClipRect& other) function in class:WebCore::ClipRect 66 m_rect.intersect(other.rect()); 86 c.intersect(b); 256 void intersect(const LayoutRect& rect) function in struct:WebCore::LayerFragment 258 backgroundRect.intersect(rect); 259 foregroundRect.intersect(rect); 260 outlineRect.intersect(rect);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkQuadTree.cpp | 35 U8CPU intersect = 0xf; local 37 intersect &= ~kMaskRight; 39 intersect &= ~kMaskLeft; 42 intersect &= ~kMaskBottom; 44 intersect &= ~kMaskTop; 46 return intersect; 124 U8CPU intersect = child_intersect(query, node->fSplitPoint); local 126 if (intersect & (1 << index)) {
|
/external/icu/icu4c/source/i18n/ |
H A D | scriptset.h | 47 ScriptSet &intersect(const ScriptSet &other); 48 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
|
/external/junit/src/org/junit/runner/manipulation/ |
H A D | Filter.java | 36 public Filter intersect(Filter second) { 96 public Filter intersect(final Filter second) { method in class:Filter
|
/external/skia/src/core/ |
H A D | SkQuadTree.cpp | 35 U8CPU intersect = 0xf; local 37 intersect &= ~kMaskRight; 39 intersect &= ~kMaskLeft; 42 intersect &= ~kMaskBottom; 44 intersect &= ~kMaskTop; 46 return intersect; 124 U8CPU intersect = child_intersect(query, node->fSplitPoint); local 126 if (intersect & (1 << index)) {
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | GeneralRangeTest.java | 137 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 4, CLOSED))); 144 range.intersect(GeneralRange.range(ORDERING, null, OPEN, 5, CLOSED))); 147 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 5, CLOSED))); 150 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 4, OPEN))); 156 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 4, CLOSED))); 162 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 5, CLOSED))); 164 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 3, OPEN))); 169 assertTrue(range.intersect(GeneralRange.range(ORDERING, 5, CLOSED, 6, CLOSED)).isEmpty()); 170 assertTrue(range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 2, OPEN)).isEmpty());
|
/external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/ |
H A D | SourceGraphic.cpp | 46 srcRect.intersect(requestedRect);
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrRenderTarget.cpp | 84 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) { 98 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) {
|
/external/skia/src/gpu/ |
H A D | GrRenderTarget.cpp | 84 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) { 98 if (!fResolveRect.intersect(0, 0, this->width(), this->height())) {
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | Region.h | 47 void intersect(const Region&); 144 static inline Region intersect(const Region& a, const Region& b) function in namespace:WebCore 147 result.intersect(b);
|