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

12

/external/skia/src/gpu/
H A DGrReorderCommandBuilder.cpp10 static bool intersect(const SkRect& a, const SkRect& b) { function
20 // 2) intersect with something
34 if (intersect(previous->fBatch->bounds(), batch->bounds())) {
/external/skia/src/pathops/
H A DSkPathOpsTSect.cpp10 int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) { function in class:SkIntersections
17 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { function in class:SkIntersections
24 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) { function in class:SkIntersections
31 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { function in class:SkIntersections
38 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { function in class:SkIntersections
45 int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) { function in class:SkIntersections
H A DSkDLineIntersection.cpp75 int SkIntersections::intersect(const SkDLine& a, const SkDLine& b) { function in class:SkIntersections
77 // see if end points intersect the opposite line
90 Return FALSE if the lines don't intersect
198 // see if end points intersect the opposite line
274 // see if end points intersect the opposite line
H A DSkDConicLineIntersection.cpp96 int intersect() { function in class:LineConicIntersections
340 int SkIntersections::intersect(const SkDConic& conic, const SkDLine& line) { function in class:SkIntersections
343 return c.intersect();
H A DSkDCubicLineIntersection.cpp146 int intersect() { function in class:LineCubicIntersections
414 int SkIntersections::intersect(const SkDCubic& cubic, const SkDLine& line) { function in class:SkIntersections
417 return c.intersect();
H A DSkDQuadLineIntersection.cpp168 int intersect() { function in class:LineQuadraticIntersections
421 int SkIntersections::intersect(const SkDQuad& quad, const SkDLine& line) { function in class:SkIntersections
424 return q.intersect();
/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
H A DPKIXNameConstraintValidator.java135 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
1118 intersectEmail(String email1, String email2, Set intersect) argument
1288 intersectURI(String email1, String email2, Set intersect) argument
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/bounding/
H A DIntersection.java81 public static boolean intersect(BoundingBox bbox, Vector3f v1, Vector3f v2, Vector3f v3) { method in class:Intersection
/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/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/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);
H A DRegisterSpec.java429 * @param other {@code null-ok;} instance to intersect with (or {@code null})
436 public RegisterSpec intersect(RegisterSpec other, boolean localPrimary) { method in class:RegisterSpec
/external/guava/guava/src/com/google/common/collect/
H A DGeneralRange.java170 GeneralRange<T> intersect(GeneralRange<T> other) { method in class:GeneralRange
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DOctree.java150 public void intersect(Ray r, float farPlane, Geometry[] geoms, CollisionResults results){ method in class:Octree
/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/src/core/
H A DSkRect.cpp113 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { function in class:SkRect
119 bool SkRect::intersect(const SkRect& r) { function in class:SkRect
120 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
123 bool SkRect::intersect(const SkRect& a, const SkRect& b) { function in class:SkRect
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DLabel.java361 public static boolean intersect(Label label, Label edgeLabel) { method in class:Label
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DFeatureSpecificTestSuiteBuilder.java256 if (intersect(features, requirements.getAbsentFeatures())) {
270 private static boolean intersect(Set<?> a, Set<?> b) { method in class:FeatureSpecificTestSuiteBuilder
/external/icu/icu4c/source/i18n/
H A Dscriptset.cpp111 ScriptSet &ScriptSet::intersect(const ScriptSet &other) { function in class:ScriptSet
118 ScriptSet &ScriptSet::intersect(UScriptCode script, UErrorCode &status) { function in class:ScriptSet
122 this->intersect(t);
138 t.intersect(other);
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/
H A DUtil.java254 public static <T> T[] intersect(Class<T> arrayType, T[] first, T[] second) { method in class:Util
255 List<T> result = intersect(first, second);
263 private static <T> List<T> intersect(T[] first, T[] second) { method in class:Util
/external/llvm/include/llvm/IR/
H A DPassManager.h110 void intersect(const PreservedAnalyses &Arg) { function in class:llvm::PreservedAnalyses
126 void intersect(PreservedAnalyses &&Arg) { function in class:llvm::PreservedAnalyses
218 // Finally, we intersect the final preserved analyses to compute the
220 PA.intersect(std::move(PassPA));
806 // Then intersect the preserved set so that invalidation of module
808 PA.intersect(std::move(PassPA));
/external/fonttools/Lib/fontTools/
H A Dsubset.py46 def intersect(self, glyphs): function
58 indices = self.intersect(glyphs)
68 def intersect(self, glyphs): function
115 indices = self.Coverage.intersect(cur_glyphs)
167 indices = self.Coverage.intersect(cur_glyphs)
169 not all(c.intersect(s.glyphs)
559 indices = c.Coverage(self).intersect(s.glyphs)
590 indices = ClassDef.intersect(cur_glyphs)
616 if not all(x.intersect(s.glyphs) for x in c.RuleData(self)):
673 indices = getattr(self, c.ClassDef).intersect(sel
[all...]
/external/fonttools/Tools/fontTools/
H A Dsubset.py46 def intersect(self, glyphs): function
58 indices = self.intersect(glyphs)
68 def intersect(self, glyphs): function
115 indices = self.Coverage.intersect(cur_glyphs)
167 indices = self.Coverage.intersect(cur_glyphs)
169 not all(c.intersect(s.glyphs)
559 indices = c.Coverage(self).intersect(s.glyphs)
590 indices = ClassDef.intersect(cur_glyphs)
616 if not all(x.intersect(s.glyphs) for x in c.RuleData(self)):
673 indices = getattr(self, c.ClassDef).intersect(sel
[all...]

Completed in 682 milliseconds

12