| /external/guava/guava/src/com/google/common/collect/ |
| RegularContiguousSet.java | 46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
130 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method
|
| ContiguousSet.java | 87 * {@link Sets#intersection} for {@link ContiguousSet} instances.
89 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); method in class:ContiguousSet
|
| EmptyContiguousSet.java | 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
| /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
|
| EmptyContiguousSet.java | 47 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
| /external/openfst/src/include/fst/ |
| intersect.h | 19 // Class to compute the intersection of two FSAs
47 // Computes the intersection (Hadamard product) of two FSAs. This
132 // Computes the intersection (Hadamard product) of two FSAs. This
133 // version writes the intersection to an output MurableFst. Only
|
| /external/qemu/distrib/sdl-1.2.15/docs/man3/ |
| SDL_FillRect.3 | 15 If there is a clip rectangle set on the destination (set via \fISDL_SetClipRect\fR) then this function will clip based on the intersection of the clip rectangle and the \fBdstrect\fR rectangle and the dstrect rectangle will be modified to represent the area actually filled\&.
|
| /external/skia/third_party/glu/libtess/ |
| geom.c | 213 /* Given edges (o1,d1) and (o2,d2), compute their point of intersection.
214 * The computed point is guaranteed to lie in the intersection of the
220 /* This is certainly not the most efficient way to find the intersection
224 * and interpolate the intersection s-value from these. Then repeat
225 * using the TransLeq ordering to find the intersection t-value.
233 /* Technically, no intersection -- do our best */
256 /* Technically, no intersection -- do our best */
|
| alg-outline | 86 that computed intersection points will be as close as possible to
103 The edge dictionary describes the current intersection of the sweep
106 intersection. For each pair of edges, we store some information about
117 be created as vertices are merged and intersection points are
146 - checking any newly adjacent edges for intersection and/or merging.
210 intersection calculations -- for sufficiently degenerate inputs,
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| CollisionVolume.java | 23 * Volumes can be tested for intersection against other volumes, and can be grown to contain a set
26 * a parameter of the intersection test. This means that a single instance of a CollisionVolume and
|
| CollisionParameters.java | 24 // react differently to the intersection depending on the hit type.
|
| CollisionSystem.java | 38 * of each tile visited with the ray and searches for points of intersection.
103 * @param hitPoint The point of intersection between a ray and a surface, if one is found.
104 * @param hitNormal The normal of the intersecting surface if an intersection is found.
272 * @param hitPoint Set to the intersection coordinates if an intersection is found.
273 * @param hitNormal Set to the normal of the intersecting surface if an intersection is found.
275 * @return The index of the tile that intersected the ray, or -1 if no intersection was found.
325 * @param hitPoint Set to the intersection coordinates if an intersection is found.
326 * @param hitNormal Set to the normal of the intersecting surface if an intersection is found
[all...] |
| /external/webkit/Source/WebCore/page/ |
| SpatialNavigation.h | 54 // 1) Fully aligned: There is a full intersection between the rects, either
68 // 2) Partially aligned: There is a partial intersection between the rects, either
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| ReasonsMask.java | 72 * @return The intersection of this and teh given mask.
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| TerrainPicker.java | 47 * Ask for the point of intersection between the given ray and the terrain.
|
| /dalvik/dexgen/src/com/android/dexgen/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;
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| RegisterSpec.java | 409 * Returns an instance that is the intersection between this instance
410 * and the given one, if any. The intersection is defined as follows:
415 * <li>If the register numbers don't match, then the intersection
417 * intersection is the same as the one in the two instances.</li>
419 * {@code equals()}, then the intersection is null.</li>
421 * are {@code equals()}, then the intersection's type bearer
422 * is the one from this instance. Otherwise, the intersection's
425 * of the intersection is the local info of this instance. Otherwise,
426 * the local info of the intersection is {@code null}.</li>
431 * intersection; if {@code true}, then the only non-nul
[all...] |
| RegisterSpecSet.java | 310 * instance. The intersection consists of the pairwise
316 * the intersection; if {@code true}, then the only non-null
336 RegisterSpec intersection = local
338 if (intersection != spec) {
339 specs[i] = intersection;
|
| /external/chromium/chrome/browser/ui/ |
| window_sizer_mac.mm | 72 gfx::Rect intersection = monitor_area.Intersect(match_rect);
73 int area = intersection.width() * intersection.height();
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| RegisterSpec.java | 409 * Returns an instance that is the intersection between this instance
410 * and the given one, if any. The intersection is defined as follows:
415 * <li>If the register numbers don't match, then the intersection
417 * intersection is the same as the one in the two instances.</li>
419 * {@code equals()}, then the intersection is null.</li>
421 * are {@code equals()}, then the intersection's type bearer
422 * is the one from this instance. Otherwise, the intersection's
425 * of the intersection is the local info of this instance. Otherwise,
426 * the local info of the intersection is {@code null}.</li>
431 * intersection; if {@code true}, then the only non-nul
[all...] |
| RegisterSpecSet.java | 310 * instance. The intersection consists of the pairwise
316 * the intersection; if {@code true}, then the only non-null
336 RegisterSpec intersection = local
338 if (intersection != spec) {
339 specs[i] = intersection;
|
| /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...] |
| /dalvik/vm/ |
| PointerSet.h | 83 * Compute the intersection of the set and the array of pointers passed in.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntSet.java | 52 /** Return the intersection of this set with the argument, creating
|
