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

1 2 3 4 5 6

  /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/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...]
  /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...]
  /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/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/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/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/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...]
  /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/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/webkit/Tools/Scripts/
webkit-patch 48 if set(["-v", "--verbose"]).intersection(set(sys.argv)):
  /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/wpa_supplicant_8/src/p2p/
p2p_invitation.c 164 struct p2p_channels intersection, *channels = NULL; local
251 &intersection);
252 if (!p2p_channels_includes(&intersection, reg_class, channel))
262 channels = &intersection;
269 &intersection);
288 p2p_channels_includes(&intersection,
304 if (!p2p_channels_includes(&intersection, p2p->op_reg_class,
308 "channel %d) not in channel intersection - try "
311 p2p_reselect_channel(p2p, &intersection);
316 if (!p2p_channels_includes(&intersection,
412 struct p2p_channels intersection, *channels = NULL; local
    [all...]
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) {
337 * @intersection: Support channel list intersection from local and peer
346 struct p2p_channels *intersection)
356 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
359 "intersection", op_reg_class, op_channel)
468 struct p2p_channels intersection; local
    [all...]
  /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/eigen/Eigen/src/Eigen2Support/Geometry/
ParametrizedLine.h 85 Scalar intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane);
132 /** \returns the parameter value of the intersection between \c *this and the given hyperplane
135 inline _Scalar ParametrizedLine<_Scalar, _AmbientDim>::intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane) function in class:Eigen::ParametrizedLine
  /external/webkit/Source/WebKit2/UIProcess/qt/
TiledDrawingAreaTileQt.cpp 82 IntRect tileDirtyRect = intersection(dirtyRect, m_rect);
111 IntRect target = intersection(rect, m_rect);
  /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
EmptyContiguousSet.java 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
  /external/webkit/Tools/Scripts/webkitpy/common/net/
failuremap.py 69 if revision_set.intersection(
  /external/webkit/Source/WebCore/platform/graphics/qt/
TileQt.cpp 87 IntRect tileDirtyRect = intersection(dirtyRect, m_rect);
147 IntRect target = intersection(rect, m_rect);
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
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/
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;

Completed in 641 milliseconds

1 2 3 4 5 6