HomeSort by relevance Sort by last modified time
    Searched full:intersection (Results 1 - 25 of 140) sorted by null

1 2 3 4 5 6

  /external/jsr305/ri/src/main/java/javax/annotation/meta/
When.java 18 /** S intersection T is non empty and S - T is nonempty */
20 /** S intersection T is empty */
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
intersect.h 17 // Class to compute the intersection of two FSAs
30 // Computes the intersection (Hadamard product) of two FSAs. This
107 // Computes the intersection (Hadamard product) of two FSAs. This
108 // version writes the intersection to an output MurableFst. Only
  /frameworks/base/graphics/java/android/graphics/
Rect.java 351 * rectangle, return true and set this rectangle to that intersection,
354 * intersection, use intersects()
364 * (and this rectangle is then set to that intersection) else
389 * this rectangle to that intersection, otherwise return false and do not
391 * is empty. To just test for intersection, use intersects()
395 * (and this rectangle is then set to that intersection) else
404 * that intersection, otherwise return false and do not change this
406 * To just test for intersection, use intersects()
411 * this rectangle to that intersection. If they do not, return
429 * if either rectangle is empty. To record the intersection, use intersect(
    [all...]
RectF.java 272 * rectangle, return true and set this rectangle to that intersection,
275 * intersection, use intersects()
285 * (and this rectangle is then set to that intersection) else
310 * this rectangle to that intersection, otherwise return false and do not
312 * is empty. To just test for intersection, use intersects()
316 * (and this rectangle is then set to that intersection) else
325 * that intersection, otherwise return false and do not change this
327 * To just test for intersection, use intersects()
332 * this rectangle to that intersection. If they do not, return
350 * if either rectangle is empty. To record the intersection, use intersect(
    [all...]
  /dalvik/dx/src/com/android/dx/rop/code/
RegisterSpec.java 404 * Returns an instance that is the intersection between this instance
405 * and the given one, if any. The intersection is defined as follows:
410 * <li>If the register numbers don't match, then the intersection
412 * intersection is the same as the one in the two instances.</li>
414 * {@code equals()}, then the intersection is null.</li>
416 * are {@code equals()}, then the intersection's type bearer
417 * is the one from this instance. Otherwise, the intersection's
420 * of the intersection is the local info of this instance. Otherwise,
421 * the local info of the intersection is {@code null}.</li>
426 * intersection; if {@code true}, then the only non-nul
    [all...]
RegisterSpecSet.java 311 * instance. The intersection consists of the pairwise
317 * the intersection; if {@code true}, then the only non-null
337 RegisterSpec intersection = local
339 if (intersection != spec) {
340 specs[i] = intersection;
  /external/qemu/distrib/sdl-1.2.12/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...]
  /dalvik/vm/
PointerSet.h 84 * Compute the intersection of the set and the array of pointers passed in.
  /external/skia/include/core/
SkDevice.h 64 device. If sect is not NULL and there is an intersection, sect returns
65 the intersection.
SkRect.h 136 intersection, otherwise return false and do not change this rectangle.
145 that intersection, otherwise return false and do not change this
164 that intersection, otherwise return false and do not change this
185 return true and set this rectangle to that intersection,
334 intersection, otherwise return false and do not change this rectangle.
340 return true and set this rectangle to that intersection, otherwise return false
353 // now check for intersection
  /external/skia/src/core/
SkLineClipper.cpp 3 // return X coordinate of intersection with horizontal line at Y
14 // return Y coordinate of intersection with vertical line at X
  /external/guava/javadoc/com/google/common/collect/
Multisets.html 152 <TD><CODE><B><A HREF="../../../../com/google/common/collect/Multisets.html#intersection(com.google.common.collect.Multiset, com.google.common.collect.Multiset)">intersection</A></B>(<A HREF="../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt;&nbsp;multiset1,
156 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an unmodifiable <b>view</b> of the intersection of two multisets.</TD>
234 <A NAME="intersection(com.google.common.collect.Multiset, com.google.common.collect.Multiset)"><!-- --></A><H3>
235 intersection</H3>
237 public static &lt;E&gt; <A HREF="../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt; <B>intersection</B>(<A HREF="../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt;&nbsp;multiset1,
240 <DD>Returns an unmodifiable <b>view</b> of the intersection of two multisets.
  /external/guava/javadoc/com/google/common/collect/class-use/
Multiset.html 198 <TD><CODE><B>Multisets.</B><B><A HREF="../../../../../com/google/common/collect/Multisets.html#intersection(com.google.common.collect.Multiset, com.google.common.collect.Multiset)">intersection</A></B>(<A HREF="../../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt;&nbsp;multiset1,
202 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an unmodifiable <b>view</b> of the intersection of two multisets.</TD>
261 <TD><CODE><B>Multisets.</B><B><A HREF="../../../../../com/google/common/collect/Multisets.html#intersection(com.google.common.collect.Multiset, com.google.common.collect.Multiset)">intersection</A></B>(<A HREF="../../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt;&nbsp;multiset1,
265 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an unmodifiable <b>view</b> of the intersection of two multisets.</TD>
277 <TD><CODE><B>Multisets.</B><B><A HREF="../../../../../com/google/common/collect/Multisets.html#intersection(com.google.common.collect.Multiset, com.google.common.collect.Multiset)">intersection</A></B>(<A HREF="../../../../../com/google/common/collect/Multiset.html" title="interface in com.google.common.collect">Multiset</A>&lt;E&gt;&nbsp;multiset1,
281 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an unmodifiable <b>view</b> of the intersection of two multisets.</TD>
Sets.SetView.html 140 <TD><CODE><B>Sets.</B><B><A HREF="../../../../../com/google/common/collect/Sets.html#intersection(java.util.Set, java.util.Set)">intersection</A></B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</A>&lt;E&gt;&nbsp;set1,
144 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an unmodifiable <b>view</b> of the intersection of two sets.</TD>
  /external/iproute2/tc/
q_hfsc.c 49 " d : x-coordinate of intersection\n"
373 * intersection is at dmax
380 * convex curve, slope of first segment is 0, intersection
  /external/qemu/android/skin/
composer.c 277 * then we do an opaque blit of 'intersection(updated,region)', then removing it from 'updated'
279 * after that, we make a DSTOVER blit of 'intersection(drawn,region)'
280 * if the plate is not opaque, we add this intersection to 'drawn'
  /external/guava/src/com/google/common/collect/
MapDifference.java 53 * maps; that is, the intersection of the two maps.
Multisets.java 327 * Returns an unmodifiable <b>view</b> of the intersection of two multisets.
339 public static <E> Multiset<E> intersection(
351 return Sets.intersection(
  /external/webkit/WebKit/android/jni/
WebFrameView.cpp 78 // Grab the intersection of transRect and the frame's bounds.
  /packages/apps/Gallery3D/src/com/cooliris/media/
ArrayUtils.java 36 // Build the intersection array.
  /external/icu4c/i18n/
regexcmp.h 223 setIntersection2 = 3 << 16 | 5, // '&&' set intersection operator
226 setIntersection1 = 4 << 16 | 8 // '&', single amp intersection op, for compatibility with old UnicodeSet.
  /frameworks/base/awt/java/awt/
Rectangle.java 562 * Returns the intersection of the original rectangle with the specified
574 return intersection((Rectangle)r);
582 * Returns the intersection of the original rectangle with the specified
583 * rectangle. An empty rectangle is returned if there is no intersection.
590 public Rectangle intersection(Rectangle r) { method in class:Rectangle
607 return !intersection(r).isEmpty();
  /frameworks/base/awt/java/awt/image/
BufferedImage.java 625 Rectangle intersection = to.intersection(from); local
627 int minX = intersection.x;
628 int minY = intersection.y;
629 int w = intersection.width;
630 int h = intersection.height;
  /frameworks/base/awt/org/apache/harmony/awt/gl/
MultiRectAreaOp.java 248 * Intersection class provides intersection of two MultiRectAre aobjects
250 static class Intersection {
367 Rectangle bounds3 = bounds1.intersection(bounds2);
548 Rectangle bounds3 = bounds1.intersection(bounds2);
823 Rectangle bounds3 = bounds1.intersection(bounds2);
  /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);

Completed in 131 milliseconds

1 2 3 4 5 6