| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| LayerFragment.h | 58 void intersect(const LayoutRect& rect) function in struct:blink::LayerFragment
60 backgroundRect.intersect(rect);
61 foregroundRect.intersect(rect);
62 outlineRect.intersect(rect);
|
| ClipRect.h | 57 void intersect(const LayoutRect& other) { m_rect.intersect(other); } function in class:blink::ClipRect
58 void intersect(const ClipRect& other) function in class:blink::ClipRect
60 m_rect.intersect(other.rect());
80 c.intersect(b);
|
| /external/chromium_org/chrome/renderer/resources/extensions/enterprise_platform_keys/ |
| utils.js | 7 function intersect(a, b) { function
16 exports.intersect = intersect;
|
| key_pair.js | 6 var intersect = require('enterprise.platformKeys.utils').intersect; variable
24 intersect([KeyUsage.verify], usages),
29 intersect([KeyUsage.sign], usages),
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| RedEyeCandidate.java | 43 public boolean intersect(RectF rect) { method in class:RedEyeCandidate
44 return mRect.intersect(rect);
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| LineIntersection.h | 16 int intersect(const _Line& a, const _Line& b, Intersections&);
|
| 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...] |
| 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& );
|
| LineIntersection_Test.cpp | 43 int pts = intersect(line1, line2, ts);
67 int pts = intersect(line1, line2, ts);
|
| /external/skia/experimental/Intersection/ |
| LineIntersection.h | 16 int intersect(const _Line& a, const _Line& b, Intersections&);
|
| 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...] |
| 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& );
|
| 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/ |
| 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(const SkDQuad&, const SkDLine&)
[all...] |
| /external/skia/src/pathops/ |
| 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(const SkDQuad&, const SkDLine&)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXNameConstraintValidator.java | 135 Set intersect = new HashSet(); local
144 intersect.add(dn);
156 intersect.add(dn);
160 intersect.add(subtree);
165 return intersect;
182 Set intersect = new HashSet(); local
191 intersect.add(subtree);
195 intersect.add(dn);
199 intersect.add(subtree);
200 intersect.add(dn)
210 Set intersect = new HashSet(); local
276 Set intersect = new HashSet(); local
1032 Set intersect = new HashSet(); local
1231 Set intersect = new HashSet(); local
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| DiscretePathEffectTest.java | 74 int intersect = 0; local
87 intersect += 1;
100 assertTrue(intersect < lineLength);
102 assertTrue(intersect >= lineLength / SEGMENT_LENGTH);
|
| /cts/tests/tests/media/src/android/media/cts/ |
| CodecImage.java | 145 cropRect.intersect(0, 0, getWidth(), getHeight());
|
| /frameworks/base/cmds/uiautomator/library/core-src/com/android/uiautomator/core/ |
| AccessibilityNodeInfoHelper.java | 49 nodeRect.intersect(displayRect);
|
| /frameworks/base/media/java/android/media/ |
| Image.java | 151 cropRect.intersect(0, 0, getWidth(), getHeight());
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| scriptset.h | 47 ScriptSet &intersect(const ScriptSet &other);
48 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
|
| /external/icu/icu4c/source/i18n/ |
| scriptset.h | 47 ScriptSet &intersect(const ScriptSet &other);
48 ScriptSet &intersect(UScriptCode script, UErrorCode &status);
|
| /external/junit/src/org/junit/runner/manipulation/ |
| Filter.java | 36 public Filter intersect(Filter second) {
96 public Filter intersect(final Filter second) {
|
| /external/skia/src/core/ |
| 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/ |
| 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());
|
