/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | LookaheadSet.java | 76 public LookaheadSet intersection(LookaheadSet s) { method in class:LookaheadSet 78 LookaheadSet intersection = new LookaheadSet(i); 79 return intersection;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Interval.java | 115 public Interval intersection(Interval other) { method in class:Interval
|
/external/chromium_org/components/invalidation/ |
H A D | invalidator_registrar.cc | 44 std::vector<invalidation::ObjectId> intersection; local 48 std::inserter(intersection, intersection.end()), 50 CHECK(intersection.empty()) 52 << ObjectIdToString(*intersection.begin()) << " for "
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | ClipRect.h | 77 inline ClipRect intersection(const ClipRect& a, const ClipRect& b) function in namespace:blink
|
/external/chromium_org/third_party/WebKit/Source/web/resources/ |
H A D | pickerCommon.js | 79 Rectangle.intersection = function(rect1, rect2) {
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.hpp | 56 C intersection (const C& s1, const C& s2) function in namespace:de
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | 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
|
H A D | Hyperplane.h | 162 /** \returns the intersection of *this with \a other. 168 VectorType intersection(const Hyperplane& other) function in class:Eigen::Hyperplane
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ContiguousSet.java | 87 * {@link Sets#intersection} for {@link ContiguousSet} instances. 89 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); method in class:ContiguousSet
|
H A D | EmptyContiguousSet.java | 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
H A D | 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( 313 public Range<C> intersection(Range<C> other) { method in class:Range [all...] |
H A D | 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 in class:RegularContiguousSet
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | AttributeScope.java | 172 public Set intersection(AttributeScope other) { method in class:AttributeScope
|
/external/chromium_org/chrome/browser/sync/ |
H A D | backend_migrator.cc | 157 const ModelTypeSet intersection = local 159 // This intersection check is to determine if our disable request 161 if (state_ == DISABLING_TYPES && !intersection.Empty()) {
|
/external/chromium_org/extensions/common/ |
H A D | url_pattern_set_unittest.cc | 140 URLPatternSet intersection; local 141 URLPatternSet::CreateIntersection(result, set2, &intersection); 142 EXPECT_TRUE(intersection.is_empty());
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPoint.cpp | 109 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection) argument 123 intersection.setX(p1.x() + param * pxLength); 124 intersection.setY(p1.y() + param * pyLength);
|
H A D | IntRect.h | 174 inline IntRect intersection(const IntRect& a, const IntRect& b) function in namespace:blink
|
/external/chromium_org/third_party/angle/src/libGLESv2/ |
H A D | angletypes.cpp | 55 bool ClipRectangle(const Rectangle &source, const Rectangle &clip, Rectangle *intersection) argument 67 if (intersection) 69 intersection->x = minSourceX; 70 intersection->y = maxSourceY; 71 intersection->width = maxSourceX - minSourceX; 72 intersection->height = maxSourceY - minSourceY; 79 if (intersection) 81 intersection->x = std::max(minSourceX, minClipX); 82 intersection->y = std::max(minSourceY, minClipY); 83 intersection [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | 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
|
H A D | Hyperplane.h | 173 /** \returns the intersection of *this with \a other. 179 VectorType intersection(const Hyperplane& other) const function in class:Eigen::Hyperplane
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | EmptyContiguousSet.java | 47 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
H A D | 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 in class:RegularContiguousSet
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
H A D | 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/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_index.cc | 298 NodeSet intersection; local 301 std::inserter(intersection, intersection.begin())); 302 if (intersection.empty()) { 306 match->nodes.swap(intersection); 317 NodeSet intersection; local 320 std::inserter(intersection, intersection.begin())); 321 if (!intersection.empty()) { 326 combined_match.nodes.swap(intersection); [all...] |
/external/chromium_org/pdf/ |
H A D | paint_aggregator.cc | 168 pp::Rect intersection = local 172 pp::Rect leftover = rect.Subtract(intersection); 181 update_.paint_rects[i] = ScrollPaintRect(intersection, amount);
|