| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| Android.mk | 17 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/ |
| rect_based_targeting_utils.cc | 17 gfx::Rect intersection(rect_1);
18 intersection.Intersect(rect_2);
19 int intersect_area = intersection.size().GetArea();
|
| /external/chromium_org/third_party/angle/src/libGLESv2/ |
| angletypes.cpp | 37 bool ClipRectangle(const Rectangle &source, const Rectangle &clip, Rectangle *intersection)
49 if (intersection)
51 intersection->x = minSourceX;
52 intersection->y = maxSourceY;
53 intersection->width = maxSourceX - minSourceX;
54 intersection->height = maxSourceY - minSourceY;
61 if (intersection)
63 intersection->x = std::max(minSourceX, minClipX);
64 intersection->y = std::max(minSourceY, minClipY);
65 intersection->width = std::min(maxSourceX, maxClipX) - std::max(minSourceX, minClipX)
[all...] |
| /sdk/emulator/opengl/host/libs/Translator/GLcommon/ |
| RangeManip.cpp | 79 Range intersection;
83 // if there is intersection
84 if (r.rangeIntersection(list[i],intersection)) {
89 if (intersection!=old) { // otherwise split:
90 //intersection on right side
91 if(old.getStart() != intersection.getStart()) {
92 list.insert(list.begin(),Range(old.getStart(),intersection.getStart() - old.getStart()));
95 //intersection on left side
96 if(old.getEnd() != intersection.getEnd()) {
97 list.insert(list.begin(),Range(intersection.getEnd(),old.getEnd() - intersection.getEnd()))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LookaheadSet.java | 76 public LookaheadSet intersection(LookaheadSet s) { method in class:LookaheadSet
78 LookaheadSet intersection = new LookaheadSet(i); local
79 return intersection;
|
| /external/chromium_org/third_party/skia/platform_tools/android/tests/ |
| 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/skia/platform_tools/android/tests/ |
| 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/chromium_org/third_party/skia/platform_tools/android/gyp_gen/ |
| vars_dict_lib.py | 133 """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/ |
| vars_dict_lib.py | 133 """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/ |
| IntervalSet.java | 263 // 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; local
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==null )
[all...] |
| /external/chromium_org/chrome/renderer/resources/extensions/enterprise_platform_keys/ |
| utils.js | 5 // Returns the intersection of the arrays |a| and |b|, which do not have to be
|
| /external/chromium_org/components/invalidation/ |
| invalidator_registrar.cc | 45 std::vector<invalidation::ObjectId> intersection; local
49 std::inserter(intersection, intersection.end()),
51 CHECK(intersection.empty())
53 << ObjectIdToString(*intersection.begin()) << " for "
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| RangeTest.java | 342 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(range))
[all...] |
| SetOperationsTest.java | 36 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and
132 return Sets.intersection(
143 return Sets.intersection(
154 return Sets.intersection(
158 .named("intersection of disjoint")
165 return Sets.intersection(
176 return Sets.intersection(
181 .named("intersection with overlap of one")
284 Set<String> frenemies = Sets.intersection(friends, enemies);
288 = Sets.intersection(friends, enemies).immutableCopy()
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| FloatPoint.cpp | 109 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection)
123 intersection.setX(p1.x() + param * pxLength);
124 intersection.setY(p1.y() + param * pyLength);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| RegularContiguousSet.java | 44 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
|
| /external/chromium_org/third_party/WebKit/Source/core/frame/ |
| ImageBitmap.cpp | 29 IntRect intersectRect = intersection(IntRect(IntPoint(), image->size()), cropRect);
43 IntRect srcRect = intersection(cropRect, IntRect(0, 0, image->width(), image->height()));
66 IntRect srcRect = intersection(cropRect, videoRect);
91 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), canvas->size()));
103 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), data->size()));
124 IntRect srcRect = intersection(cropRect, oldBitmapRect);
142 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), image->size()));
216 FloatRect intersectRect = intersection(m_bitmapRect, *srcRect);
|
| /external/wpa_supplicant_8/src/p2p/ |
| p2p_invitation.c | 177 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 - try to reselect"
406 struct p2p_channels intersection, *channels = NULL; local
[all...] |
| p2p_go_neg.c | 41 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",
492 struct p2p_channels tmp, intersection; local
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_index.cc | 308 NodeSet intersection; local
311 std::inserter(intersection, intersection.begin()));
312 if (intersection.empty()) {
316 match->nodes.swap(intersection);
327 NodeSet intersection; local
330 std::inserter(intersection, intersection.begin()));
331 if (!intersection.empty()) {
336 combined_match.nodes.swap(intersection);
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| FeatureUtil.java | 236 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/tools/sheriffing/ |
| failureinfo.js | 6 * 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/chromium_org/third_party/WebKit/Source/core/rendering/ |
| ScrollAlignment.cpp | 64 LayoutUnit intersectWidth = intersection(visibleRect, exposeRectX).width();
106 LayoutUnit intersectHeight = intersection(visibleRect, exposeRectY).height();
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/models/ |
| test_configuration.py | 165 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/eigen/Eigen/src/Eigen2Support/Geometry/ |
| ParametrizedLine.h | 85 Scalar intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane);
132 /** \returns the parameter value of the intersection between \c *this and the given hyperplane
135 inline _Scalar ParametrizedLine<_Scalar, _AmbientDim>::intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane) function in class:Eigen::ParametrizedLine
|
