| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_surface.c | 331 * A function to calculate the intersection of two rectangles:
335 SDL_bool SDL_IntersectRect(const SDL_Rect *A, const SDL_Rect *B, SDL_Rect *intersection)
339 /* Horizontal intersection */
346 intersection->x = Amin;
349 intersection->w = Amax - Amin > 0 ? Amax - Amin : 0;
351 /* Vertical intersection */
358 intersection->y = Amin;
361 intersection->h = Amax - Amin > 0 ? Amax - Amin : 0;
363 return (intersection->w && intersection->h)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXCertPathValidatorSpi.java | 451 PKIXPolicyNode intersection = RFC3280CertPathUtilities.wrapupCertG(certPath, paramsPKIX, userInitialPolicySet, local
454 if ((explicitPolicy > 0) || (intersection != null))
456 return new PKIXCertPathValidatorResult(trust, intersection, cert.getPublicKey());
|
| /external/chromium_org/extensions/common/ |
| url_pattern_set_unittest.cc | 110 URLPatternSet intersection; local
111 URLPatternSet::CreateIntersection(result, set2, &intersection);
112 EXPECT_TRUE(intersection.is_empty());
122 // Intersection with an empty set.
131 // Intersection with a real set.
|
| /frameworks/base/test-runner/src/android/test/ |
| MoreAsserts.java | 197 Set<Object> intersection = new HashSet<Object>(expected); local
198 intersection.retainAll(actual);
203 + "\nIntersection: " + intersection);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sets.py | 4 ignored. The usual operations (union, intersection, deletion, etc.)
169 # Standard set operations: union, intersection, both differences.
197 """Return the intersection of two sets as a new set.
203 return self.intersection(other)
205 def intersection(self, other): member in class:BaseSet
206 """Return the intersection of two sets as a new set.
423 # In-place union, intersection, differences.
439 """Update a set with the intersection of itself and another."""
445 """Update a set with the intersection of itself and another."""
449 self._data = (self.intersection(other))._dat
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sets.py | 4 ignored. The usual operations (union, intersection, deletion, etc.)
169 # Standard set operations: union, intersection, both differences.
197 """Return the intersection of two sets as a new set.
203 return self.intersection(other)
205 def intersection(self, other): member in class:BaseSet
206 """Return the intersection of two sets as a new set.
423 # In-place union, intersection, differences.
439 """Update a set with the intersection of itself and another."""
445 """Update a set with the intersection of itself and another."""
449 self._data = (self.intersection(other))._dat
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| AttributeScope.java | 172 public Set intersection(AttributeScope other) { method in class:AttributeScope
|
| /external/chromium_org/chrome/browser/devtools/ |
| devtools_file_system_indexer.cc | 201 set<FileId> intersection; local
206 std::inserter(intersection, intersection.begin()));
207 file_ids.swap(intersection);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerTest.java | 170 assertTrue(Sets.intersection(map.keySet(), removalNotifications.keySet()).isEmpty());
|
| MultisetsTest.java | 158 ASSERT.that(Multisets.intersection(ms1, ms2)).hasContentsInOrder();
164 ASSERT.that(Multisets.intersection(ms1, ms2)).hasContentsInOrder();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| IncludeOverlay.java | 112 Rectangle h = hole.intersection(r);
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| ScrollbarTheme.cpp | 304 context->fillRect(intersection(horizontalOverhangRect, dirtyRect));
306 context->fillRect(intersection(verticalOverhangRect, dirtyRect));
|
| /external/chromium_org/third_party/WebKit/Source/web/painting/ |
| PaintAggregator.cpp | 74 // Subtracts out the intersection of |a| and |b| from |a|, assuming |b| fully
91 // complete intersection in the y-direction
97 // complete intersection in the x-direction
156 return intersection(scrollRect, damagedRect);
300 result = intersection(m_update.scrollRect, result);
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/tool/servers/ |
| rebaselineserver.py | 87 extensions_to_move = current_extensions.intersection(
90 if extensions_to_move.intersection(
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_set.py | 101 i = self.s.intersection(self.otherword)
106 self.assertRaises(PassThru, self.s.intersection, check_pass_thru())
108 self.assertEqual(self.thetype('abcba').intersection(C('cdc')), set('cc'))
109 self.assertEqual(self.thetype('abcba').intersection(C('efgfe')), set(''))
110 self.assertEqual(self.thetype('abcba').intersection(C('ccb')), set('bc'))
111 self.assertEqual(self.thetype('abcba').intersection(C('ef')), set(''))
112 self.assertEqual(self.thetype('abcba').intersection(C('cbcf'), C('bag')), set('b'))
114 z = s.intersection()
123 return not set(s1).intersection(s2)
135 i = self.s.intersection(self.otherword
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_set.py | 101 i = self.s.intersection(self.otherword)
106 self.assertRaises(PassThru, self.s.intersection, check_pass_thru())
108 self.assertEqual(self.thetype('abcba').intersection(C('cdc')), set('cc'))
109 self.assertEqual(self.thetype('abcba').intersection(C('efgfe')), set(''))
110 self.assertEqual(self.thetype('abcba').intersection(C('ccb')), set('bc'))
111 self.assertEqual(self.thetype('abcba').intersection(C('ef')), set(''))
112 self.assertEqual(self.thetype('abcba').intersection(C('cbcf'), C('bag')), set('b'))
114 z = s.intersection()
123 return not set(s1).intersection(s2)
135 i = self.s.intersection(self.otherword
[all...] |
| /external/chromium_org/ui/gfx/ |
| render_text_win.cc | 390 // Add a Rect for each run/selection intersection.
394 ui::Range intersection = run->range.Intersect(layout_range); local
395 if (intersection.IsValid()) {
396 DCHECK(!intersection.is_reversed());
397 ui::Range range_x(GetGlyphXBoundary(run, intersection.start(), false),
398 GetGlyphXBoundary(run, intersection.end(), false));
[all...] |
| /external/chromium_org/chrome/browser/chromeos/extensions/file_manager/ |
| file_browser_handlers.cc | 540 // If there is nothing to do for one file, the intersection of handlers
549 // For all additional files, find intersection between the accumulated and
551 FileBrowserHandlerList intersection; local
554 std::back_inserter(intersection));
555 common_handlers = intersection;
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| TouchAdjustment.cpp | 316 // This returns quotient of the target area and its intersection with the touch area.
317 // This will prioritize largest intersection and smallest area, while balancing the two against each other.
328 IntRect intersection = rect;
329 intersection.intersect(touchArea);
331 // Return the quotient of the intersection.
332 return rect.size().area() / (float)intersection.size().area();
409 // will fail to adjust the point to somewhere in the intersection.
434 // Distance functions could for instance be distance squared or area of intersection.
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| treemixin.py | 52 * __and__(other) <==> T & other, intersection
127 * intersection(t1, t2, ...) -> Tree with keys *common* to all trees
133 * isdisjoint(S) -> True if T has a null intersection with S
177 return self.intersection(other)
593 def intersection(self, *trees): member in class:TreeMixin
594 """ x.intersection(t1, t2, ...) -> Tree, with keys *common* to all trees
598 rkeys = thiskeys.intersection(*sets)
635 """ x.isdisjoint(S) -> True if x has a null intersection with tree """
|
| /external/opencv/cvaux/src/ |
| cv3dtracker.cpp | 65 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1,
476 // find the intersection of the two lines (or the points of closest
478 if (!intersection(p1a, p1b, p2a, p2b, r1, r2))
518 // Find the intersection of two lines, or if they don't intersect,
523 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1, function
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAState.java | 272 /** Add label uniquely and disjointly; intersection with
326 intersection.toString(dfa.nfa.grammar));
336 // Replace existing s_i with intersection since we
339 IntSet intersection = s_i.and(t); local
340 reachableLabels.set(i, new Label(intersection));
|
| /external/chromium_org/chrome/tools/ |
| check_grd_for_unused_strings.py | 105 missing = ids_left.intersection(file_ids)
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| Caret.cpp | 251 LayoutRect caret = intersection(drawingRect, clipRect);
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| FloatPoint.h | 240 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection);
|
