| /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/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamTerrainPicker.java | 99 final Vector3f intersection = new Vector3f(); local
104 checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit);
105 float distance = worldPickRay.origin.distance(intersection);
106 CollisionResult cr = new CollisionResult(intersection, distance);
110 return intersection;
119 // check the triangles of main square for intersection.
121 if (checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit)) {
122 // we found an intersection, so return that!
123 float distance = worldPickRay.origin.distance(intersection);
124 CollisionResult cr = new CollisionResult(intersection, distance)
[all...] |
| /external/chromium-trace/trace-viewer/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/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/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.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| intersection.py | 3 Generators for random intersection graphs.
21 """Return a uniform random intersection graph.
40 .. [1] K.B. Singer-Cohen, Random Intersection Graphs, 1995,
43 Random intersection graphs when m = !(n):
51 """Return a intersection graph with randomly chosen attribute sets for
72 Two models of random intersection graphs and their applications.
83 """Return a random intersection graph with independent probabilities
105 in general random intersection graphs. In ICALP (2004), J. Dī?az,
|
| __init__.py | 19 from networkx.generators.intersection import *
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| 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/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/skia/src/pathops/ |
| SkConicLineIntersection.cpp | 18 i->setMax(3); // allow short partial coincidence plus discrete intersection
|
| /external/skia/tests/ |
| PathOpsConicIntersectionTest.cpp | 13 manually compute the intersection of a pair of circles and see if the conic intersection matches
|
| /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) {
367 * @intersection: Support channel list intersection from local and peer
376 struct p2p_channels *intersection)
389 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
390 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
500 struct p2p_channels tmp, intersection; local
[all...] |
| p2p_invitation.c | 183 struct p2p_channels all_channels, intersection, *channels = NULL; local
250 &intersection);
251 p2p_channels_dump(p2p, "intersection", &intersection);
257 &go, group_bssid, &op_freq, persistent, &intersection,
263 &intersection);
264 p2p_channels_dump(p2p, "intersection(GO)", &intersection);
265 if (intersection.reg_classes == 0) {
282 if (!p2p_channels_includes(&intersection, reg_class, channel)
427 struct p2p_channels intersection, *channels = NULL; local
[all...] |
| /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/jmonkeyengine/engine/src/test/jme3test/terrain/ |
| TerrainTestModifyHeight.java | 105 Vector3f intersection = getWorldIntersection(); local
106 updateHintText(intersection);
110 if (intersection != null) {
111 adjustHeight(intersection, 64, tpf * 60);
114 if (intersection != null) {
115 adjustHeight(intersection, 64, -tpf * 60);
119 if (terrain != null && intersection != null) {
120 float h = terrain.getHeight(new Vector2f(intersection.x, intersection.z));
122 marker.setLocalTranslation(tl.add(new Vector3f(intersection.x, h, intersection.z)) )
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Ray.java | 112 * stores the point of intersection in the given loc vector
126 * intersection in the given loc vector.
147 * intersection in the given loc vector as t, u, v where t is the distance
148 * from the origin to the point of intersection and u,v is the intersection
164 * intersection in the given loc vector as t, u, v where t is the distance
165 * from the origin to the point of intersection and u,v is the intersection
185 * <code>intersects</code> does the actual intersection work.
194 * storage vector - if null, no intersection is calc'
[all...] |
| /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/eigen/Eigen/src/Geometry/ |
| ParametrizedLine.h | 102 Scalar intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const;
162 /** \returns the parameter value of the intersection between \c *this and the given \a hyperplane
174 * \returns the parameter value of the intersection between \c *this and the given \a hyperplane
178 inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const function in class:Eigen::ParametrizedLine
183 /** \returns the point of the intersection between \c *this and the given hyperplane
|
| /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/skia/samplecode/ |
| SampleConcavePaths.cpp | 70 // Bowtie (intersection)
82 // "fake" bowtie (concave, but no intersection)
96 // Fish test (intersection/concave)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| distance_regular.py | 64 """Return global parameters for a given intersection array.
73 intersection array [b_0,b_1,.....b_{d-1};c_1,c_2,.....c_d]
112 """Returns the intersection array of a distance-regular graph.
138 .. [1] Weisstein, Eric W. "Intersection Array."
159 bint = {} # 'b' intersection array
160 cint = {} # 'c' intersection array
|
| /external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/editor/structure/property/ |
| PropertyListIntersector.java | 22 * Helper for computing intersection of {@link Property} arrays.
36 * Updates intersection by intersecting with new given array.
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| FeatureUtil.java | 234 intersection(allPresentFeatures, allAbsentFeatures);
279 conflictingFeatures = intersection(newFeatures, earlierFeatures);
290 * Construct a new {@link java.util.Set} that is the intersection
295 public static <T> Set<T> intersection( method in class:FeatureUtil
297 return intersection(new Set[] {set1, set2});
301 * Construct a new {@link java.util.Set} that is the intersection
304 * @return the intersection of the sets
308 public static <T> Set<T> intersection(Set<? extends T> ... sets) { method in class:FeatureUtil
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_rect.h | 51 /* Find the intersection of two rectangles known to intersect.
57 /* Caller should verify intersection exists before calling.
|
