| /external/opencv3/modules/imgproc/src/ |
| D | intersection.cpp | 57 std::vector <Point2f> intersection; in rotatedRectangleIntersection() local
79 intersection.resize(4); in rotatedRectangleIntersection()
83 intersection[i] = pts1[i]; in rotatedRectangleIntersection()
86 Mat(intersection).copyTo(intersectingRegion); in rotatedRectangleIntersection()
134 intersection.push_back(Point2f(xi,yi)); in rotatedRectangleIntersection()
139 if( !intersection.empty() ) in rotatedRectangleIntersection()
178 intersection.push_back(pts1[i]); in rotatedRectangleIntersection()
216 intersection.push_back(pts2[i]); in rotatedRectangleIntersection()
221 for( int i = 0; i < (int)intersection.size()-1; i++ ) in rotatedRectangleIntersection()
223 for( size_t j = i+1; j < intersection.size(); j++ ) in rotatedRectangleIntersection()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | RangeTest.java | 346 assertEquals(range, range.intersection(range)); in testIntersection_empty()
349 range.intersection(Range.open(3, 5)); in testIntersection_empty()
354 range.intersection(Range.closed(0, 2)); in testIntersection_empty()
362 assertEquals(range, range.intersection(range)); in testIntersection_deFactoEmpty()
365 range.intersection(Range.atMost(3))); in testIntersection_deFactoEmpty()
367 range.intersection(Range.atLeast(4))); in testIntersection_deFactoEmpty()
370 range.intersection(Range.lessThan(3)); in testIntersection_deFactoEmpty()
375 range.intersection(Range.greaterThan(4)); in testIntersection_deFactoEmpty()
382 range.intersection(Range.greaterThan(4))); in testIntersection_deFactoEmpty()
387 assertEquals(range, range.intersection(range)); in testIntersection_singleton()
[all …]
|
| D | ImmutableRangeMapTest.java | 87 range1.isConnected(range2) && !range1.intersection(range2).isEmpty(); in testOverlapRejection()
103 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testGet()
141 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testSpanTwoRanges()
153 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testGetEntry()
186 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testAsMapOfRanges()
206 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testSubRangeMap()
216 && !entry.getKey().intersection(subRange).isEmpty()) { in testSubRangeMap()
217 expectedBuilder.put(entry.getKey().intersection(subRange), entry.getValue()); in testSubRangeMap()
|
| D | SetOperationsTest.java | 134 return Sets.intersection( in suite()
145 return Sets.intersection( in suite()
156 return Sets.intersection( in suite()
167 return Sets.intersection( in suite()
178 return Sets.intersection( in suite()
286 Set<String> frenemies = Sets.intersection(friends, enemies); in testIntersection()
290 = Sets.intersection(friends, enemies).immutableCopy(); in testIntersection()
292 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>()); in testIntersection()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | IntervalSet.java | 410 IntervalSet intersection = null; in and() local
430 if ( intersection==null ) { in and()
431 intersection = new IntervalSet(); in and()
433 intersection.add(mine.intersection(theirs)); in and()
438 if ( intersection==null ) { in and()
439 intersection = new IntervalSet(); in and()
441 intersection.add(mine.intersection(theirs)); in and()
446 if ( intersection==null ) { in and()
447 intersection = new IntervalSet(); in and()
449 intersection.add(mine.intersection(theirs)); in and()
[all …]
|
| /external/skia/platform_tools/android/tests/ |
| D | var_dict_tests.py | 71 intersection = vars_dict_lib.intersect(v_dict_list)
73 self.assert_consistency(intersection)
75 for key in intersection.keys():
77 self.assertEqual(len(intersection[key]), 1)
78 for item in intersection[key]:
|
| /external/wpa_supplicant_8/src/p2p/ |
| D | p2p_invitation.c | 186 struct p2p_channels all_channels, intersection, *channels = NULL; in p2p_process_invitation_req() local
253 &intersection); in p2p_process_invitation_req()
254 p2p_channels_dump(p2p, "intersection", &intersection); in p2p_process_invitation_req()
260 &go, group_bssid, &op_freq, persistent, &intersection, in p2p_process_invitation_req()
266 &intersection); in p2p_process_invitation_req()
267 p2p_channels_dump(p2p, "intersection(GO)", &intersection); in p2p_process_invitation_req()
268 if (intersection.reg_classes == 0) { in p2p_process_invitation_req()
285 if (!p2p_channels_includes(&intersection, reg_class, channel)) in p2p_process_invitation_req()
294 channels = &intersection; in p2p_process_invitation_req()
313 p2p_channels_includes(&intersection, in p2p_process_invitation_req()
[all …]
|
| D | p2p_go_neg.c | 42 struct p2p_channels intersection; in p2p_peer_channels_check() local
78 p2p_channels_intersect(own, &dev->channels, &intersection); in p2p_peer_channels_check()
82 (int) intersection.reg_classes); in p2p_peer_channels_check()
83 if (intersection.reg_classes == 0) { in p2p_peer_channels_check()
379 struct p2p_channels *intersection) in p2p_reselect_channel() argument
392 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
403 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
414 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
418 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
427 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
[all …]
|
| /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/subcomponent/ |
| D | SubcomponentTest.java | 26 import static com.google.common.collect.Sets.intersection;
81 assertThat(intersection(parentObjectSet, childObjectSet)).hasSize(1); in multibindingContributions()
82 assertThat(intersection(parentObjectSet, grandchildObjectSet)).hasSize(1); in multibindingContributions()
83 assertThat(intersection(childObjectSet, grandchildObjectSet)).hasSize(1); in multibindingContributions()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | LookaheadSet.java | 76 public LookaheadSet intersection(LookaheadSet s) { in intersection() method in LookaheadSet
78 LookaheadSet intersection = new LookaheadSet(i); in intersection() local
79 return intersection; in intersection()
|
| /external/skia/platform_tools/android/gyp_gen/ |
| D | vars_dict_lib.py | 145 intersection = VarsDict()
162 intersection[key].add(item)
165 return intersection
|
| /external/eigen/unsupported/Eigen/ |
| D | BVH | 32 …* of the two basic algorithms over a BVH: intersection of a query object against all objects in th…
33 …* of a function over the objects in the hierarchy. It also provides intersection and minimization…
34 …* two BVH's. A BVH accelerates intersection by using the fact that if a query object does not int…
38 * Some sample queries that can be written in terms of intersection are:
48 …* - Find the intersection between a ray and a triangle mesh closest to the ray origin (function …
72 …* For an intersection query on a single BVH, the intersector encapsulates the query and must provi…
75 …bool intersectObject(const Object &object) //returns true if the intersection search should termin…
80 …* The cartesian product intersection and the BVMinimize queries are similar--see their individual …
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| D | FeatureUtil.java | 234 intersection(allPresentFeatures, allAbsentFeatures); in buildTesterRequirements()
279 conflictingFeatures = intersection(newFeatures, earlierFeatures); in checkConflict()
295 public static <T> Set<T> intersection( in intersection() method in FeatureUtil
297 return intersection(new Set[] {set1, set2}); in intersection()
308 public static <T> Set<T> intersection(Set<? extends T> ... sets) { in intersection() method in FeatureUtil
|
| /external/opencv3/3rdparty/openexr/Imath/ |
| D | ImathSphere.h | 91 bool intersect(const Line3<T> &l, Vec3<T> &intersection) const;
159 bool Sphere3<T>::intersect(const Line3<T> &line, Vec3<T> &intersection) const in intersect() argument
165 intersection = line(t); in intersect()
|
| /external/pdfium/third_party/freetype/src/cff/ |
| D | cf2hints.c | 1123 FT_Vector* intersection ) in cf2_glyphpath_computeIntersection() argument
1170 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); in cf2_glyphpath_computeIntersection()
1171 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); in cf2_glyphpath_computeIntersection()
1183 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1184 intersection->x = u1->x; in cf2_glyphpath_computeIntersection()
1186 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1187 intersection->y = u1->y; in cf2_glyphpath_computeIntersection()
1190 cf2_fixedAbs( intersection->x - v1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1191 intersection->x = v1->x; in cf2_glyphpath_computeIntersection()
1193 cf2_fixedAbs( intersection->y - v1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
[all …]
|
| /external/freetype/src/cff/ |
| D | cf2hints.c | 1123 FT_Vector* intersection ) in cf2_glyphpath_computeIntersection() argument
1170 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); in cf2_glyphpath_computeIntersection()
1171 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); in cf2_glyphpath_computeIntersection()
1183 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1184 intersection->x = u1->x; in cf2_glyphpath_computeIntersection()
1186 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1187 intersection->y = u1->y; in cf2_glyphpath_computeIntersection()
1190 cf2_fixedAbs( intersection->x - v1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1191 intersection->x = v1->x; in cf2_glyphpath_computeIntersection()
1193 cf2_fixedAbs( intersection->y - v1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
[all …]
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | ContiguousSet.java | 56 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); in create()
59 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); in create()
114 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); in intersection() method in ContiguousSet
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ContiguousSet.java | 59 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); in create()
62 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); in create()
145 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); in intersection() method in ContiguousSet
|
| D | TreeRangeSet.java | 264 return new RangesByUpperBound<C>(rangesByLowerBound, window.intersection(upperBoundWindow)); in subMap()
426 subWindow = subWindow.intersection(complementLowerBoundWindow);
650 lowerBoundWindow.intersection(window), restriction, rangesByLowerBound);
695 return candidate.intersection(restriction);
700 return result.intersection(restriction);
739 nextRange = nextRange.intersection(restriction);
767 nextRange = nextRange.intersection(restriction);
801 return enclosing != null && !enclosing.intersection(restriction).isEmpty();
813 return (result == null) ? null : result.intersection(restriction);
826 TreeRangeSet.this.remove(rangeToRemove.intersection(restriction));
[all …]
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| D | SetOperationsTest.java | 62 Set<String> frenemies = Sets.intersection(friends, enemies); in testIntersection()
66 = Sets.intersection(friends, enemies).immutableCopy(); in testIntersection()
68 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>()); in testIntersection()
|
| D | ContiguousSetTest.java | 267 assertEquals(ImmutableSet.of(), set.intersection(emptySet)); in testIntersection_empty()
268 assertEquals(ImmutableSet.of(), emptySet.intersection(set)); in testIntersection_empty()
270 ContiguousSet.create(Range.closed(-5, -1), integers()).intersection( in testIntersection_empty()
277 ContiguousSet.create(Range.open(-1, 4), integers()).intersection(set)); in testIntersection()
279 set.intersection(ContiguousSet.create(Range.open(-1, 4), integers()))); in testIntersection()
|
| /external/v8/src/crankshaft/ |
| D | hydrogen-check-elimination.cc | 393 MapSet intersection = instr->maps()->Intersect( in ReduceCheckMaps() local
395 if (intersection->size() == 0) { in ReduceCheckMaps()
402 entry->maps_ = intersection; in ReduceCheckMaps()
408 if (intersection->size() != instr->maps()->size()) { in ReduceCheckMaps()
420 check->set_maps(intersection); in ReduceCheckMaps()
428 instr->set_maps(intersection); in ReduceCheckMaps()
593 MapSet intersection = le->maps_->Intersect(re->maps_, zone()); in ReduceCompareObjectEqAndBranch() local
594 if (intersection->size() > 0) return; in ReduceCompareObjectEqAndBranch()
616 MapSet intersection = entry->maps_->Intersect(string_maps(), zone()); in ReduceIsStringAndBranch() local
617 if (intersection->size() > 0) return; in ReduceIsStringAndBranch()
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| D | RegisterSpecSet.java | 336 RegisterSpec intersection = in intersect() local
338 if (intersection != spec) { in intersect()
339 specs[i] = intersection; in intersect()
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| D | ParametrizedLine.h | 85 Scalar intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane);
135 inline _Scalar ParametrizedLine<_Scalar, _AmbientDim>::intersection(const Hyperplane<_Scalar, _Ambi… in intersection() function
|
| /external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/ |
| D | cv_util.py | 47 intersection = np.add(line2p0, np.dot(F, h))
50 return intersect, intersection
|