Searched defs:intersect (Results 1 - 25 of 90) sorted by relevance

1234

/external/chromium_org/chrome/renderer/resources/extensions/enterprise_platform_keys/
H A Dutils.js7 function intersect(a, b) { function
16 exports.intersect = intersect;
H A Dkey_pair.js6 var intersect = require('enterprise.platformKeys.utils').intersect; variable
24 intersect([KeyUsage.verify], usages),
29 intersect([KeyUsage.sign], usages),
H A Dsubtle_crypto.js7 var intersect = require('enterprise.platformKeys.utils').intersect; variable
93 if (intersect(keyUsages, [KeyUsage.sign, KeyUsage.verify]).length !=
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
H A DReasonsMask.java71 * @param mask The mask to intersect with.
74 ReasonsMask intersect(ReasonsMask mask) method in class:ReasonsMask
/external/junit/src/org/junit/runner/manipulation/
H A DFilter.java36 public Filter intersect(Filter second) {
96 public Filter intersect(final Filter second) { method in class:Filter
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A D3d-raytrace.js160 Triangle.prototype.intersect = function(orig, dir, near, far) {
189 Scene.prototype.intersect = function(origin, dir, near, far) {
193 var d = triangle.intersect(origin, dir, near, far);
219 reflected = this.intersect(hit, reflection, 0.0001, 1000000);
249 var d = triangle.intersect(O, D, near, far);
299 var l = scene.intersect(origin, dir);
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A D3d-raytrace.js160 Triangle.prototype.intersect = function(orig, dir, near, far) {
189 Scene.prototype.intersect = function(origin, dir, near, far) {
193 var d = triangle.intersect(origin, dir, near, far);
219 reflected = this.intersect(hit, reflection, 0.0001, 1000000);
249 var d = triangle.intersect(O, D, near, far);
299 var l = scene.intersect(origin, dir);
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
H A D3d-raytrace.js160 Triangle.prototype.intersect = function(orig, dir, near, far) {
189 Scene.prototype.intersect = function(origin, dir, near, far) {
193 var d = triangle.intersect(origin, dir, near, far);
219 reflected = this.intersect(hit, reflection, 0.0001, 1000000);
249 var d = triangle.intersect(O, D, near, far);
299 var l = scene.intersect(origin, dir);
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DLayerFragment.h58 void intersect(const LayoutRect& rect) function in struct:blink::LayerFragment
60 backgroundRect.intersect(rect);
61 foregroundRect.intersect(rect);
62 outlineRect.intersect(rect);
H A DClipRect.h57 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/third_party/skia/platform_tools/android/gyp_gen/
H A Dvars_dict_lib.py132 def intersect(var_dict_list): function
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/editor/structure/property/
H A DPropertyListIntersector.java38 public void intersect(Property[] properties) { method in class:PropertyListIntersector
/external/skia/platform_tools/android/gyp_gen/
H A Dvars_dict_lib.py132 def intersect(var_dict_list): function
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DLayoutRect.cpp61 void LayoutRect::intersect(const LayoutRect& other) function in class:blink::LayoutRect
H A DRegion.h47 void intersect(const Region&);
144 static inline Region intersect(const Region& a, const Region& b) function in namespace:blink
147 result.intersect(b);
H A DIntRect.cpp63 void IntRect::intersect(const IntRect& other) function in class:blink::IntRect
/external/chromium_org/third_party/skia/src/core/
H A DSkRect.cpp102 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, function in class:SkRect
116 bool SkRect::intersect(const SkRect& r) { function in class:SkRect
117 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
135 bool SkRect::intersect(const SkRect& a, const SkRect& b) { function in class:SkRect
/external/skia/src/core/
H A DSkRect.cpp102 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, function in class:SkRect
116 bool SkRect::intersect(const SkRect& r) { function in class:SkRect
118 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
137 bool SkRect::intersect(const SkRect& a, const SkRect& b) { function in class:SkRect
H A DSkQuadTree.cpp35 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/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicConvexHull.cpp27 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...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDCubicIntersection.cpp62 i.intersect(simple1, simple2);
64 i.intersect((const SkDLine&) simple1, (const SkDLine&) simple2);
66 i.intersect(simple1, (const SkDLine&) simple2);
69 i.intersect(simple2, (const SkDLine&) simple1);
76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, function
168 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
210 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
236 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
242 // intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
256 // if two ends intersect, chec
[all...]
/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DRegisterSpecSet.java311 * {@link RegisterSpec#intersect} of corresponding elements from
314 * @param other {@code non-null;} set to intersect with
320 public void intersect(RegisterSpecSet other, boolean localPrimary) { method in class:RegisterSpecSet
337 spec.intersect(otherSpecs[i], localPrimary);
/external/guava/guava/src/com/google/common/collect/
H A DGeneralRange.java170 GeneralRange<T> intersect(GeneralRange<T> other) { method in class:GeneralRange
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowRect.java99 public boolean intersect(Rect r) { method in class:ShadowRect
104 public boolean intersect(int left, int top, int right, int bottom) { method in class:ShadowRect
105 return intersect(new Rect(left, top, right, bottom));
/external/skia/experimental/Intersection/
H A DCubicConvexHull.cpp27 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...]

Completed in 418 milliseconds

1234