Searched refs:intersection (Results 1 - 25 of 164) sorted by relevance

1234567

/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/Android.mk
19 test_name := algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp
23 test_name := algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection
/external/chromium_org/ui/views/
H A Drect_based_targeting_utils.cc17 gfx::Rect intersection(rect_1);
18 intersection.Intersect(rect_2);
19 int intersect_area = intersection.size().GetArea();
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DLookaheadSet.java76 public LookaheadSet intersection(LookaheadSet s) { method in class:LookaheadSet
78 LookaheadSet intersection = new LookaheadSet(i);
79 return intersection;
/external/chromium_org/third_party/skia/platform_tools/android/tests/
H A Dvar_dict_tests.py71 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/skia/platform_tools/android/tests/
H A Dvar_dict_tests.py71 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/chromium_org/third_party/angle/src/libGLESv2/
H A Dangletypes.cpp55 bool ClipRectangle(const Rectangle &source, const Rectangle &clip, Rectangle *intersection) argument
67 if (intersection)
69 intersection->x = minSourceX;
70 intersection->y = maxSourceY;
71 intersection->width = maxSourceX - minSourceX;
72 intersection->height = maxSourceY - minSourceY;
79 if (intersection)
81 intersection->x = std::max(minSourceX, minClipX);
82 intersection->y = std::max(minSourceY, minClipY);
83 intersection
[all...]
/external/chromium_org/third_party/skia/platform_tools/android/gyp_gen/
H A Dvars_dict_lib.py133 """Compute intersection of VarsDicts.
135 Find the intersection of a list of VarsDicts and trim each input to its
145 intersection = VarsDict()
155 # If item is in all lists, add to intersection, and remove from all.
162 intersection[key].add(item)
165 return intersection
/external/skia/platform_tools/android/gyp_gen/
H A Dvars_dict_lib.py133 """Compute intersection of VarsDicts.
135 Find the intersection of a list of VarsDicts and trim each input to its
145 intersection = VarsDict()
155 # If item is in all lists, add to intersection, and remove from all.
162 intersection[key].add(item)
165 return intersection
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DIntervalSet.java263 // will be ignored since we are doing this & ~other. The intersection
398 /** Return a new set with the intersection of this set with other. Because
410 IntervalSet intersection = null;
429 // overlap, add intersection, get next theirs
430 if ( intersection==null ) {
431 intersection = new IntervalSet();
433 intersection.add(mine.intersection(theirs));
437 // overlap, add intersection, get next mine
438 if ( intersection
[all...]
/external/chromium_org/components/invalidation/
H A Dinvalidator_registrar.cc44 std::vector<invalidation::ObjectId> intersection; local
48 std::inserter(intersection, intersection.end()),
50 CHECK(intersection.empty())
52 << ObjectIdToString(*intersection.begin()) << " for "
/external/guava/guava-tests/test/com/google/common/collect/
H A DRangeTest.java342 assertEquals(range, range.intersection(range));
345 range.intersection(Ranges.open(3, 5));
350 range.intersection(Ranges.closed(0, 2));
358 assertEquals(range, range.intersection(range));
361 range.intersection(Ranges.atMost(3)));
363 range.intersection(Ranges.atLeast(4)));
366 range.intersection(Ranges.lessThan(3));
371 range.intersection(Ranges.greaterThan(4));
378 range.intersection(Ranges.greaterThan(4)));
383 assertEquals(range, range.intersection(rang
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DFloatPoint.cpp109 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection) argument
123 intersection.setX(p1.x() + param * pxLength);
124 intersection.setY(p1.y() + param * pyLength);
/external/chromium_org/tools/sheriffing/
H A Dfailureinfo.js6 * Return the range of intersection between the two lists. Ranges are sets of
95 var intersection = intersections[j];
98 var low = intersection[0][0];
99 var high = intersection[0][1];
105 truncateStatusText(intersection[1].join(', '));
116 // calculate the intersection of blamelists of the first time it failed on
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DRegularContiguousSet.java44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
128 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:RegularContiguousSet
/external/chromium_org/third_party/WebKit/Source/core/frame/
H A DImageBitmap.cpp29 IntRect intersectRect = intersection(IntRect(IntPoint(), image->size()), cropRect);
43 IntRect srcRect = intersection(cropRect, IntRect(0, 0, image->width(), image->height()));
64 IntRect srcRect = intersection(cropRect, videoRect);
87 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), canvas->size()));
97 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), data->size()));
116 IntRect srcRect = intersection(cropRect, oldBitmapRect);
132 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), image->size()));
204 FloatRect intersectRect = intersection(m_bitmapRect, *srcRect);
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/models/
H A 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/wpa_supplicant_8/hostapd/src/p2p/
H A Dp2p_invitation.c177 struct p2p_channels intersection, *channels = NULL; local
240 &intersection);
241 p2p_channels_dump(p2p, "intersection", &intersection);
247 &go, group_bssid, &op_freq, persistent, &intersection,
261 if (!p2p_channels_includes(&intersection, reg_class, channel))
270 channels = &intersection;
289 p2p_channels_includes(&intersection,
303 !p2p_channels_includes(&intersection, p2p->op_reg_class,
305 p2p_dbg(p2p, "Initially selected channel (op_class %d channel %d) not in channel intersection
406 struct p2p_channels intersection, *channels = NULL; local
[all...]
H A Dp2p_go_neg.c41 struct p2p_channels intersection; local
77 p2p_channels_intersect(own, &dev->channels, &intersection);
78 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
81 (int) intersection.reg_classes);
82 if (intersection.reg_classes == 0) {
359 * @intersection: Support channel list intersection from local and peer
368 struct p2p_channels *intersection)
381 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
382 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
367 p2p_reselect_channel(struct p2p_data *p2p, struct p2p_channels *intersection) argument
492 struct p2p_channels tmp, intersection; local
[all...]
/external/wpa_supplicant_8/src/p2p/
H A Dp2p_invitation.c177 struct p2p_channels intersection, *channels = NULL; local
240 &intersection);
241 p2p_channels_dump(p2p, "intersection", &intersection);
247 &go, group_bssid, &op_freq, persistent, &intersection,
261 if (!p2p_channels_includes(&intersection, reg_class, channel))
270 channels = &intersection;
289 p2p_channels_includes(&intersection,
303 !p2p_channels_includes(&intersection, p2p->op_reg_class,
305 p2p_dbg(p2p, "Initially selected channel (op_class %d channel %d) not in channel intersection
406 struct p2p_channels intersection, *channels = NULL; local
[all...]
H A Dp2p_go_neg.c41 struct p2p_channels intersection; local
77 p2p_channels_intersect(own, &dev->channels, &intersection);
78 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
81 (int) intersection.reg_classes);
82 if (intersection.reg_classes == 0) {
359 * @intersection: Support channel list intersection from local and peer
368 struct p2p_channels *intersection)
381 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
382 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
367 p2p_reselect_channel(struct p2p_data *p2p, struct p2p_channels *intersection) argument
492 struct p2p_channels tmp, intersection; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/p2p/
H A Dp2p_invitation.c177 struct p2p_channels intersection, *channels = NULL; local
240 &intersection);
241 p2p_channels_dump(p2p, "intersection", &intersection);
247 &go, group_bssid, &op_freq, persistent, &intersection,
261 if (!p2p_channels_includes(&intersection, reg_class, channel))
270 channels = &intersection;
289 p2p_channels_includes(&intersection,
303 !p2p_channels_includes(&intersection, p2p->op_reg_class,
305 p2p_dbg(p2p, "Initially selected channel (op_class %d channel %d) not in channel intersection
406 struct p2p_channels intersection, *channels = NULL; local
[all...]
H A Dp2p_go_neg.c41 struct p2p_channels intersection; local
77 p2p_channels_intersect(own, &dev->channels, &intersection);
78 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
81 (int) intersection.reg_classes);
82 if (intersection.reg_classes == 0) {
359 * @intersection: Support channel list intersection from local and peer
368 struct p2p_channels *intersection)
381 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
382 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
367 p2p_reselect_channel(struct p2p_data *p2p, struct p2p_channels *intersection) argument
492 struct p2p_channels tmp, intersection; local
[all...]
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_index.cc298 NodeSet intersection; local
301 std::inserter(intersection, intersection.begin()));
302 if (intersection.empty()) {
306 match->nodes.swap(intersection);
317 NodeSet intersection; local
320 std::inserter(intersection, intersection.begin()));
321 if (!intersection.empty()) {
326 combined_match.nodes.swap(intersection);
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java236 intersection(allPresentFeatures, allAbsentFeatures);
281 conflictingFeatures = intersection(newFeatures, earlierFeatures);
292 * Construct a new {@link java.util.Set} that is the intersection
297 public static <T> Set<T> intersection( method in class:FeatureUtil
299 return intersection(new Set[] {set1, set2});
303 * Construct a new {@link java.util.Set} that is the intersection
306 * @return the intersection of the sets
310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { method in class:FeatureUtil
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DScrollAlignment.cpp64 LayoutUnit intersectWidth = intersection(visibleRect, exposeRectX).width();
106 LayoutUnit intersectHeight = intersection(visibleRect, exposeRectY).height();

Completed in 654 milliseconds

1234567