| /external/chromium/chrome/browser/autofill/ |
| form_group.cc | 44 FieldTypeSet a, b, intersection; local
49 std::inserter(intersection, intersection.begin()));
51 // An empty intersection can't have equal values.
52 if (intersection.empty())
55 for (FieldTypeSet::const_iterator iter = intersection.begin();
56 iter != intersection.end(); ++iter) {
66 FieldTypeSet a, b, intersection; local
71 std::inserter(intersection, intersection.begin()))
[all...] |
| form_group.h | 51 // Returns true if the values of the intersection of the available field types
52 // are equal. If the intersection is empty, the method returns false.
|
| /sdk/emulator/opengl/host/libs/Translator/GLcommon/ |
| RangeManip.cpp | 78 Range intersection;
82 // if there is intersection
83 if (r.rangeIntersection(list[i],intersection)) {
88 if (intersection!=old) { // otherwise split:
89 //intersection on right side
90 if(old.getStart() != intersection.getStart()) {
91 list.insert(list.begin(),Range(old.getStart(),intersection.getStart() - old.getStart()));
94 //intersection on left side
95 if(old.getEnd() != intersection.getEnd()) {
96 list.insert(list.begin(),Range(intersection.getEnd(),old.getEnd() - intersection.getEnd()))
[all...] |
| /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/webkit/Source/WebCore/platform/graphics/ |
| FloatPoint.cpp | 88 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection)
100 intersection.setX(p1.x());
101 intersection.setY(dSlope * intersection.x() + dOffset);
105 intersection.setX(d1.x());
106 intersection.setY(pSlope * intersection.x() + pOffset);
110 // Find x at intersection, where ys overlap; x = (c' - c) / (m - m')
111 intersection.setX((dOffset - pOffset) / (pSlope - dSlope));
112 intersection.setY(pSlope * intersection.x() + pOffset)
[all...] |
| /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/guava/guava-tests/test/com/google/common/collect/ |
| RangeTest.java | 342 assertEquals(range, range.intersection(range));
345 range.intersection(Ranges.open(3, 5));
350 range.intersection(Ranges.closed(0, 2));
358 assertEquals(range, range.intersection(range));
361 range.intersection(Ranges.atMost(3)));
363 range.intersection(Ranges.atLeast(4)));
366 range.intersection(Ranges.lessThan(3));
371 range.intersection(Ranges.greaterThan(4));
378 range.intersection(Ranges.greaterThan(4)));
383 assertEquals(range, range.intersection(range))
[all...] |
| SetOperationsTest.java | 36 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and
132 return Sets.intersection(
143 return Sets.intersection(
154 return Sets.intersection(
158 .named("intersection of disjoint")
165 return Sets.intersection(
176 return Sets.intersection(
181 .named("intersection with overlap of one")
284 Set<String> frenemies = Sets.intersection(friends, enemies);
288 = Sets.intersection(friends, enemies).immutableCopy()
[all...] |
| /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
|
| /external/wpa_supplicant_8/src/p2p/ |
| p2p_go_neg.c | 40 struct p2p_channels intersection; local
78 p2p_channels_intersect(own, &dev->channels, &intersection);
80 "peer reg_classes %d intersection reg_classes %d",
83 (int) intersection.reg_classes);
84 if (intersection.reg_classes == 0) {
342 struct p2p_channels *intersection)
359 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
361 "channel (reg_class %u channel %u) from intersection",
371 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
373 "channel (reg_class %u channel %u) from intersection",
625 struct p2p_channels intersection; local
1027 struct p2p_channels intersection; local
[all...] |
| p2p_invitation.c | 161 struct p2p_channels intersection, *channels = NULL; local
248 &intersection);
249 if (!p2p_channels_includes(&intersection, reg_class, channel))
259 channels = &intersection;
266 &intersection);
285 p2p_channels_includes(&intersection,
301 if (!p2p_channels_includes(&intersection, p2p->op_reg_class,
305 "channel %d) not in channel intersection - try "
308 p2p_reselect_channel(p2p, &intersection);
313 if (!p2p_channels_includes(&intersection,
[all...] |
| /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/chromium/chrome/browser/bookmarks/ |
| bookmark_index.cc | 207 NodeSet intersection; local
210 std::inserter(intersection, intersection.begin()));
211 if (intersection.empty()) {
215 match->nodes.swap(intersection);
226 NodeSet intersection; local
229 std::inserter(intersection, intersection.begin()));
230 if (!intersection.empty()) {
235 combined_match.nodes.swap(intersection);
[all...] |
| bookmark_index.h | 100 // intersection of the Match's current nodes and the nodes at |index_i|.
101 // If the intersection is empty, the Match is removed.
107 // Iterates over |current_matches| calculating the intersection between the
108 // Match's nodes and the nodes at |index_i|. If the intersection between the
111 // This differs from CombineMatchesInPlace in that if the intersection is
|
| /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/chromium/chrome/browser/sync/ |
| backend_migrator.cc | 117 ModelTypeSet intersection; local
120 std::inserter(intersection, intersection.end()));
122 // The intersection check is to determine if our disable request was
129 (state_ == DISABLING_TYPES && !intersection.empty())) {
|
| /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)
|
| /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 | 236 intersection(allPresentFeatures, allAbsentFeatures);
281 conflictingFeatures = intersection(newFeatures, earlierFeatures);
292 * Construct a new {@link java.util.Set} that is the intersection
297 public static <T> Set<T> intersection( method in class:FeatureUtil
299 return intersection(new Set[] {set1, set2});
303 * Construct a new {@link java.util.Set} that is the intersection
306 * @return the intersection of the sets
310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { method in class:FeatureUtil
|
| /external/llvm/unittests/Support/ |
| IntegersSubsetTest.cpp | 211 Mapping LExclude, Intersection;
213 LHSMapping.diff(&LExclude, &Intersection, 0, RHSMapping);
226 EXPECT_EQ(Intersection.size(), IntersectResSize);
229 for (Mapping::RangeIterator ii = Intersection.begin(),
230 e = Intersection.end(); ii != e; ++ii, ++i)
233 EXPECT_TRUE(Intersection.empty());
236 Intersection.clear();
237 RHSMapping.diff(0, &Intersection, &LExclude, LHSMapping);
|
| /external/guava/guava/src/com/google/common/collect/ |
| Range.java | 94 * the definition of {@link #intersection}.
290 * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is
295 * <p>Generally, the intersection exists if and only if this range and
298 * <p>The intersection operation has the following properties:
301 * <li>commutative: {@code a.intersection(b)} produces the same result as
302 * {@code b.intersection(a)}
303 * <li>associative: {@code a.intersection(b).intersection(c)} produces the
304 * same result as {@code a.intersection(b.intersection(c))
313 public Range<C> intersection(Range<C> other) { method in class:Range
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Rect.java | 364 * rectangle, return true and set this rectangle to that intersection,
367 * intersection, use {@link #intersects(Rect, Rect)}.
377 * (and this rectangle is then set to that intersection) else
393 * this rectangle to that intersection, otherwise return false and do not
395 * is empty. To just test for intersection, use intersects()
399 * (and this rectangle is then set to that intersection) else
408 * that intersection, otherwise return false and do not change this
410 * To just test for intersection, use intersects()
415 * this rectangle to that intersection. If they do not, return
432 * if either rectangle is empty. To record the intersection, use intersect(
[all...] |
| RectF.java | 329 * rectangle, return true and set this rectangle to that intersection,
332 * intersection, use intersects()
342 * (and this rectangle is then set to that intersection) else
367 * this rectangle to that intersection, otherwise return false and do not
369 * is empty. To just test for intersection, use intersects()
373 * (and this rectangle is then set to that intersection) else
382 * that intersection, otherwise return false and do not change this
384 * To just test for intersection, use intersects()
389 * this rectangle to that intersection. If they do not, return
407 * if either rectangle is empty. To record the intersection, use intersect(
[all...] |
