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

1 2 3 4 5 6 7 8 91011>>

  /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/opencv3/modules/imgproc/src/
intersection.cpp 57 std::vector <Point2f> intersection; local
79 intersection.resize(4);
83 intersection[i] = pts1[i];
86 Mat(intersection).copyTo(intersectingRegion);
103 // Line test - test all line combos for intersection
134 intersection.push_back(Point2f(xi,yi));
139 if( !intersection.empty() )
149 // then there's an intersection
178 intersection.push_back(pts1[i]);
187 // then there's an intersection
    [all...]
  /external/chromium-trace/catapult/tracing/tracing/base/
interval_tree_test.html 40 function sortSimpleResults(intersection) {
41 intersection.sort(function(a, b) {
50 var intersection = tree.findIntersection(2, 4);
51 sortSimpleResults(intersection);
54 assert.equal(intersection.length, 6);
55 assert.deepEqual(intersection, expected);
60 var intersection = tree.findIntersection(2, 2);
61 sortSimpleResults(intersection);
64 assert.equal(intersection.length, 2);
65 assert.deepEqual(intersection, expected)
    [all...]
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
Intersector.java 29 /** Class offering various static methods for intersection testing between different geometric objects.
85 public static boolean intersectSegmentPlane (Vector3 start, Vector3 end, Plane plane, Vector3 intersection) {
91 intersection.set(start).add(dir.scl(t));
152 /** Intersects two resulting polygons with the same winding and sets the overlap polygon resulting from the intersection.
157 * @param overlap The intersection of the two polygons (optional)
285 * @return The displacement or Float.POSITIVE_INFINITY if no intersection is present */
302 /** Intersect two 2D Rays and return the scalar parameter of the first ray at the intersection point. You can get the
303 * intersection point by: Vector2 point(direction1).scl(scalar).add(start1); For more information, check:
309 * @return scalar parameter on the first ray describing the point where the intersection happens. May be negative. In case the
323 /** Intersects a {@link Ray} and a {@link Plane}. The intersection point is stored in intersection in case an intersection i
    [all...]
  /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/vulkan-validation-layers/libs/glm/gtx/
intersect.hpp 34 /// @brief Add intersection functions
55 //! Compute the intersection of a ray and a triangle.
64 //! Compute the intersection of a ray and a triangle.
72 //! Compute the intersection of a line and a triangle.
80 //! Compute the intersection distance of a ray and a sphere.
89 //! Compute the intersection of a ray and a sphere.
97 //! Compute the intersection of a line and a sphere.
  /external/chromium-trace/catapult/trace_processor/experimental/mappers/scheduling/
map_input_blockers.html 56 var intersection = queueRange.findIntersection(eventRange);
57 if (intersection.isEmpty || intersection.duration === 0)
61 inputBlockers[intersectingEvent.title].push(intersection.duration);
  /prebuilts/misc/windows/sdl2/test/
testautomation_rect.c 19 SDL_bool intersection, SDL_bool expectedIntersection,
24 SDLTest_AssertCheck(intersection == expectedIntersection,
25 "Check for correct intersection result: expected %s, got %s intersecting rect (%d,%d,%d,%d) with line (%d,%d - %d,%d)",
27 (intersection == SDL_TRUE) ? "SDL_TRUE" : "SDL_FALSE",
287 SDLTest_AssertCheck(intersected == SDL_TRUE, "Check that intersection result was SDL_TRUE");
309 SDL_bool intersection, SDL_bool expectedIntersection,
312 SDLTest_AssertCheck(intersection == expectedIntersection,
313 "Check intersection result: expected %s, got %s intersecting A (%d,%d,%d,%d) with B (%d,%d,%d,%d)",
315 (intersection == SDL_TRUE) ? "SDL_TRUE" : "SDL_FALSE",
332 SDL_bool intersection, SDL_bool expectedIntersection
424 SDL_bool intersection; local
452 SDL_bool intersection; local
481 SDL_bool intersection; local
569 SDL_bool intersection; local
616 SDL_bool intersection; local
686 SDL_bool intersection; local
717 SDL_bool intersection; local
744 SDL_bool intersection; local
771 SDL_bool intersection; local
838 SDL_bool intersection; local
884 SDL_bool intersection; local
940 SDL_bool intersection; local
    [all...]
  /external/eigen/unsupported/Eigen/
BVH 32 * of the two basic algorithms over a BVH: intersection of a query object against all objects in the hierarchy and minimization
33 * of a function over the objects in the hierarchy. It also provides intersection and minimization over a cartesian product of
34 * two BVH's. A BVH accelerates intersection by using the fact that if a query object does not intersect a volume, then it cannot
38 * Some sample queries that can be written in terms of intersection are:
48 * - Find the intersection between a ray and a triangle mesh closest to the ray origin (function is infinite off the ray)
72 * For an intersection query on a single BVH, the intersector encapsulates the query and must provide two functions:
75 bool intersectObject(const Object &object) //returns true if the intersection search should terminate immediately
80 * The cartesian product intersection and the BVMinimize queries are similar--see their individual documentation.
  /external/guava/guava-tests/test/com/google/common/collect/
ImmutableRangeMapTest.java 87 range1.isConnected(range2) && !range1.intersection(range2).isEmpty();
103 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) {
141 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) {
153 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) {
186 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) {
206 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) {
216 && !entry.getKey().intersection(subRange).isEmpty()) {
217 expectedBuilder.put(entry.getKey().intersection(subRange), entry.getValue());
RangeTest.java 346 assertEquals(range, range.intersection(range));
349 range.intersection(Range.open(3, 5));
354 range.intersection(Range.closed(0, 2));
362 assertEquals(range, range.intersection(range));
365 range.intersection(Range.atMost(3)));
367 range.intersection(Range.atLeast(4)));
370 range.intersection(Range.lessThan(3));
375 range.intersection(Range.greaterThan(4));
382 range.intersection(Range.greaterThan(4)));
387 assertEquals(range, range.intersection(range))
    [all...]
SetOperationsTest.java 37 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and
134 return Sets.intersection(
145 return Sets.intersection(
156 return Sets.intersection(
160 .named("intersection of disjoint")
167 return Sets.intersection(
178 return Sets.intersection(
183 .named("intersection with overlap of one")
286 Set<String> frenemies = Sets.intersection(friends, enemies);
290 = Sets.intersection(friends, enemies).immutableCopy()
    [all...]
  /external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/
cv_util.py 29 """If the line segments intersect, returns True and their intersection.
30 Otherwise, returns False and the intersection of the line segments if they
34 # currently intersect. We use h to compute their intersection.
47 intersection = np.add(line2p0, np.dot(F, h))
50 return intersect, intersection
  /external/opencv3/modules/imgproc/test/
test_intersection.cpp 74 // See pics/intersection.png for the scenarios we are testing
77 // 1 - no intersection
78 // 2 - partial intersection, rectangle translated
79 // 3 - partial intersection, rectangle rotated 45 degree on the corner, forms a triangle intersection
80 // 4 - full intersection, rectangles of same size directly on top of each other
81 // 5 - partial intersection, rectangle on top rotated 45 degrees
82 // 6 - partial intersection, rectangle on top of different size
83 // 7 - full intersection, rectangle fully enclosed in the other
84 // 8 - partial intersection, rectangle corner just touching. point contac
    [all...]
  /prebuilts/misc/darwin-x86_64/sdl2/include/SDL2/
SDL_rect.h 89 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
95 * \brief Calculate the intersection of two rectangles.
97 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
121 * \brief Calculate the intersection of a rectangle and line segment.
123 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
  /prebuilts/misc/windows/sdl2/i686-w64-mingw32/include/SDL2/
SDL_rect.h 89 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
95 * \brief Calculate the intersection of two rectangles.
97 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
121 * \brief Calculate the intersection of a rectangle and line segment.
123 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
  /prebuilts/misc/windows/sdl2/include/
SDL_rect.h 89 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
95 * \brief Calculate the intersection of two rectangles.
97 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
121 * \brief Calculate the intersection of a rectangle and line segment.
123 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
  /prebuilts/misc/windows/sdl2/x86_64-w64-mingw32/include/SDL2/
SDL_rect.h 89 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
95 * \brief Calculate the intersection of two rectangles.
97 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
121 * \brief Calculate the intersection of a rectangle and line segment.
123 * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
  /external/chromium-trace/catapult/devil/devil/android/tools/
script_common.py 26 for d in available.intersection(requested))
  /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/subcomponent/
SubcomponentTest.java 26 import static com.google.common.collect.Sets.intersection;
81 assertThat(intersection(parentObjectSet, childObjectSet)).hasSize(1);
82 assertThat(intersection(parentObjectSet, grandchildObjectSet)).hasSize(1);
83 assertThat(intersection(childObjectSet, grandchildObjectSet)).hasSize(1);
  /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
SetOperationsTest.java 27 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and
62 Set<String> frenemies = Sets.intersection(friends, enemies);
66 = Sets.intersection(friends, enemies).immutableCopy();
68 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>());
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/
RayCastCallback.java 34 * @param point the point of initial intersection
35 * @param normal the normal vector at the point of intersection
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/
RayCastCallback.java 34 * @param point the point of initial intersection
35 * @param normal the normal vector at the point of intersection
  /toolchain/binutils/binutils-2.25/gprof/
hist.h 54 If no intersection is found, *P_LOWPC and *P_HIGHPC will be set to
55 one unspecified value. If more that one intersection is found,
  /external/wpa_supplicant_8/src/p2p/
p2p_go_neg.c 42 struct p2p_channels intersection; local
78 p2p_channels_intersect(own, &dev->channels, &intersection);
79 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
82 (int) intersection.reg_classes);
83 if (intersection.reg_classes == 0) {
370 * @intersection: Support channel list intersection from local and peer
379 struct p2p_channels *intersection)
392 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
393 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
503 struct p2p_channels tmp, intersection; local
    [all...]

Completed in 3299 milliseconds

1 2 3 4 5 6 7 8 91011>>