Home
last modified time | relevance | path

Searched refs:intersection (Results 1 – 25 of 148) sorted by relevance

123456

/external/chromium/chrome/browser/autofill/
Dform_group.cc44 FieldTypeSet a, b, intersection; in IntersectionOfTypesHasEqualValues() local
49 std::inserter(intersection, intersection.begin())); in IntersectionOfTypesHasEqualValues()
52 if (intersection.empty()) in IntersectionOfTypesHasEqualValues()
55 for (FieldTypeSet::const_iterator iter = intersection.begin(); in IntersectionOfTypesHasEqualValues()
56 iter != intersection.end(); ++iter) { in IntersectionOfTypesHasEqualValues()
66 FieldTypeSet a, b, intersection; in MergeWith() local
71 std::inserter(intersection, intersection.begin())); in MergeWith()
73 for (FieldTypeSet::const_iterator iter = intersection.begin(); in MergeWith()
74 iter != intersection.end(); ++iter) { in MergeWith()
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/
DBresenhamTerrainPicker.java99 final Vector3f intersection = new Vector3f(); in getTerrainIntersection() local
104 checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit); in getTerrainIntersection()
105 float distance = worldPickRay.origin.distance(intersection); in getTerrainIntersection()
106 CollisionResult cr = new CollisionResult(intersection, distance); in getTerrainIntersection()
110 return intersection; in getTerrainIntersection()
121 if (checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit)) { in getTerrainIntersection()
123 float distance = worldPickRay.origin.distance(intersection); in getTerrainIntersection()
124 CollisionResult cr = new CollisionResult(intersection, distance); in getTerrainIntersection()
128 return intersection; in getTerrainIntersection()
149 if (checkTriangles(loc.x + dx, loc.y + dz, workRay, intersection, patch, hit)) { in getTerrainIntersection()
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DRangeTest.java342 assertEquals(range, range.intersection(range)); in testIntersection_empty()
345 range.intersection(Ranges.open(3, 5)); in testIntersection_empty()
350 range.intersection(Ranges.closed(0, 2)); in testIntersection_empty()
358 assertEquals(range, range.intersection(range)); in testIntersection_deFactoEmpty()
361 range.intersection(Ranges.atMost(3))); in testIntersection_deFactoEmpty()
363 range.intersection(Ranges.atLeast(4))); in testIntersection_deFactoEmpty()
366 range.intersection(Ranges.lessThan(3)); in testIntersection_deFactoEmpty()
371 range.intersection(Ranges.greaterThan(4)); in testIntersection_deFactoEmpty()
378 range.intersection(Ranges.greaterThan(4))); in testIntersection_deFactoEmpty()
383 assertEquals(range, range.intersection(range)); in testIntersection_singleton()
[all …]
DSetOperationsTest.java132 return Sets.intersection( in suite()
143 return Sets.intersection( in suite()
154 return Sets.intersection( in suite()
165 return Sets.intersection( in suite()
176 return Sets.intersection( in suite()
284 Set<String> frenemies = Sets.intersection(friends, enemies); in testIntersection()
288 = Sets.intersection(friends, enemies).immutableCopy(); in testIntersection()
290 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>()); in testIntersection()
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
DPolygonShape.cpp143 FloatPoint intersection; in computeShapePaddingBounds() local
151 if (prevOffsetEdge.intersection(thisOffsetEdge, intersection)) in computeShapePaddingBounds()
152 paddedVertices->append(intersection); in computeShapePaddingBounds()
164 FloatPoint intersection; in computeShapeMarginBounds() local
172 if (prevOffsetEdge.intersection(thisOffsetEdge, intersection)) in computeShapeMarginBounds()
173 marginVertices->append(intersection); in computeShapeMarginBounds()
206 static inline bool getVertexIntersectionVertices(const EdgeIntersection& intersection, FloatPoint& … in getVertexIntersectionVertices() argument
208 if (intersection.type != VertexMinY && intersection.type != VertexMaxY) in getVertexIntersectionVertices()
211 ASSERT(intersection.edge && intersection.edge->polygon()); in getVertexIntersectionVertices()
212 const FloatPolygon& polygon = *(intersection.edge->polygon()); in getVertexIntersectionVertices()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
DIntervalSet.java410 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/jmonkeyengine/engine/src/test/jme3test/terrain/
DTerrainTestModifyHeight.java105 Vector3f intersection = getWorldIntersection(); in simpleUpdate() local
106 updateHintText(intersection); in simpleUpdate()
110 if (intersection != null) { in simpleUpdate()
111 adjustHeight(intersection, 64, tpf * 60); in simpleUpdate()
114 if (intersection != null) { in simpleUpdate()
115 adjustHeight(intersection, 64, -tpf * 60); in simpleUpdate()
119 if (terrain != null && intersection != null) { in simpleUpdate()
120 float h = terrain.getHeight(new Vector2f(intersection.x, intersection.z)); in simpleUpdate()
122 marker.setLocalTranslation(tl.add(new Vector3f(intersection.x, h, intersection.z)) ); in simpleUpdate()
123 … markerNormal.setLocalTranslation(tl.add(new Vector3f(intersection.x, h, intersection.z)) ); in simpleUpdate()
[all …]
/external/chromium/chrome/browser/bookmarks/
Dbookmark_index.cc207 NodeSet intersection; in CombineMatchesInPlace() local
210 std::inserter(intersection, intersection.begin())); in CombineMatchesInPlace()
211 if (intersection.empty()) { in CombineMatchesInPlace()
215 match->nodes.swap(intersection); in CombineMatchesInPlace()
226 NodeSet intersection; in CombineMatches() local
229 std::inserter(intersection, intersection.begin())); in CombineMatches()
230 if (!intersection.empty()) { in CombineMatches()
235 combined_match.nodes.swap(intersection); in CombineMatches()
/external/chromium_org/chrome/browser/bookmarks/
Dbookmark_index.cc215 NodeSet intersection; in CombineMatchesInPlace() local
218 std::inserter(intersection, intersection.begin())); in CombineMatchesInPlace()
219 if (intersection.empty()) { in CombineMatchesInPlace()
223 match->nodes.swap(intersection); in CombineMatchesInPlace()
234 NodeSet intersection; in CombineMatches() local
237 std::inserter(intersection, intersection.begin())); in CombineMatches()
238 if (!intersection.empty()) { in CombineMatches()
243 combined_match.nodes.swap(intersection); in CombineMatches()
/external/wpa_supplicant_8/src/p2p/
Dp2p_go_neg.c40 struct p2p_channels intersection; in p2p_peer_channels_check() local
76 p2p_channels_intersect(own, &dev->channels, &intersection); in p2p_peer_channels_check()
80 (int) intersection.reg_classes); in p2p_peer_channels_check()
81 if (intersection.reg_classes == 0) { in p2p_peer_channels_check()
336 struct p2p_channels *intersection) in p2p_reselect_channel() argument
346 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
357 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
368 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
372 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
381 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
[all …]
Dp2p_invitation.c164 struct p2p_channels intersection, *channels = NULL; in p2p_process_invitation_req() local
225 &intersection); in p2p_process_invitation_req()
231 &go, group_bssid, &op_freq, persistent, &intersection); in p2p_process_invitation_req()
244 if (!p2p_channels_includes(&intersection, reg_class, channel)) in p2p_process_invitation_req()
253 channels = &intersection; in p2p_process_invitation_req()
272 p2p_channels_includes(&intersection, in p2p_process_invitation_req()
284 if (!p2p_channels_includes(&intersection, p2p->op_reg_class, in p2p_process_invitation_req()
288 p2p_reselect_channel(p2p, &intersection); in p2p_process_invitation_req()
291 if (!p2p_channels_includes(&intersection, in p2p_process_invitation_req()
303 p2p_reselect_channel(p2p, &intersection); in p2p_process_invitation_req()
[all …]
/external/chromium_org/sync/notifier/
Dinvalidator_registrar.cc45 std::vector<invalidation::ObjectId> intersection; in UpdateRegisteredIds() local
49 std::inserter(intersection, intersection.end()), in UpdateRegisteredIds()
51 CHECK(intersection.empty()) in UpdateRegisteredIds()
53 << ObjectIdToString(*intersection.begin()) << " for " in UpdateRegisteredIds()
/external/chromium_org/ui/views/
Drect_based_targeting_utils.cc17 gfx::Rect intersection(rect_1); in PercentCoveredBy() local
18 intersection.Intersect(rect_2); in PercentCoveredBy()
19 int intersect_area = intersection.size().GetArea(); in PercentCoveredBy()
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/models/
Dtest_configuration.py165 return reduce(set.intersection, matching_sets.values())
186 if macro_set.intersection(specifier_set) == macro_set:
223 return reduce(set.intersection, [set(specifiers) for specifiers in combination])
228 intersection = iterable[0]
231 intersection = intersection.intersection(item)
232 return union - intersection
/external/chromium_org/third_party/WebKit/Source/core/frame/
DImageBitmap.cpp31 IntRect intersectRect = intersection(IntRect(IntPoint(), image->size()), cropRect); in cropImage()
45 IntRect srcRect = intersection(cropRect, IntRect(0, 0, image->width(), image->height())); in ImageBitmap()
63 IntRect srcRect = intersection(cropRect, videoRect); in ImageBitmap()
88 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), canvas->size())); in ImageBitmap()
100 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), data->size())); in ImageBitmap()
121 IntRect srcRect = intersection(cropRect, oldBitmapRect); in ImageBitmap()
139 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), image->size())); in ImageBitmap()
/external/chromium_org/third_party/WebKit/Source/core/rendering/
DRenderLayerClipper.cpp178 … clipRects.setOverflowClipRect(intersection(newOverflowClip, clipRects.overflowClipRect())); in calculateClipRects()
180 clipRects.setPosClipRect(intersection(newOverflowClip, clipRects.posClipRect())); in calculateClipRects()
184 clipRects.setPosClipRect(intersection(newPosClip, clipRects.posClipRect())); in calculateClipRects()
185 clipRects.setOverflowClipRect(intersection(newPosClip, clipRects.overflowClipRect())); in calculateClipRects()
186 clipRects.setFixedClipRect(intersection(newPosClip, clipRects.fixedClipRect())); in calculateClipRects()
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DLookaheadSet.java76 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/chromium/chrome/browser/sync/
Dbackend_migrator.cc117 ModelTypeSet intersection; in Observe() local
120 std::inserter(intersection, intersection.end())); in Observe()
129 (state_ == DISABLING_TYPES && !intersection.empty())) { in Observe()
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
DFeatureUtil.java236 intersection(allPresentFeatures, allAbsentFeatures); in buildTesterRequirements()
281 conflictingFeatures = intersection(newFeatures, earlierFeatures); in checkConflict()
297 public static <T> Set<T> intersection( in intersection() method in FeatureUtil
299 return intersection(new Set[] {set1, set2}); in intersection()
310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { in intersection() method in FeatureUtil
/external/eigen/unsupported/Eigen/
DBVH32 …* 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-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DRegularContiguousSet.java44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive))) in headSetImpl()
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive))) in tailSetImpl()
128 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { in intersection() method
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
DFloatPoint.cpp123 …nt& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection) in findIntersection() argument
137 intersection.setX(p1.x() + param * pxLength); in findIntersection()
138 intersection.setY(p1.y() + param * pyLength); in findIntersection()
/external/chromium_org/third_party/freetype/src/cff/
Dcf2hints.c1090 FT_Vector* intersection ) in cf2_glyphpath_computeIntersection() argument
1137 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); in cf2_glyphpath_computeIntersection()
1138 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); in cf2_glyphpath_computeIntersection()
1150 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1151 intersection->x = u1->x; in cf2_glyphpath_computeIntersection()
1153 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1154 intersection->y = u1->y; in cf2_glyphpath_computeIntersection()
1157 cf2_fixedAbs( intersection->x - v1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1158 intersection->x = v1->x; in cf2_glyphpath_computeIntersection()
1160 cf2_fixedAbs( intersection->y - v1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
[all …]
/external/freetype/src/cff/
Dcf2hints.c1090 FT_Vector* intersection ) in cf2_glyphpath_computeIntersection() argument
1137 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); in cf2_glyphpath_computeIntersection()
1138 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); in cf2_glyphpath_computeIntersection()
1150 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1151 intersection->x = u1->x; in cf2_glyphpath_computeIntersection()
1153 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1154 intersection->y = u1->y; in cf2_glyphpath_computeIntersection()
1157 cf2_fixedAbs( intersection->x - v1->x ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
1158 intersection->x = v1->x; in cf2_glyphpath_computeIntersection()
1160 cf2_fixedAbs( intersection->y - v1->y ) < glyphpath->snapThreshold ) in cf2_glyphpath_computeIntersection()
[all …]
/external/guava/guava/src/com/google/common/collect/
DRegularContiguousSet.java46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive))) in headSetImpl()
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive))) in tailSetImpl()
130 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { in intersection() method

123456