/external/chromium/chrome/browser/autofill/ |
H A D | 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 [all...] |
/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/chrome/browser/sync/ |
H A D | 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/chromium_org/sync/notifier/ |
H A D | invalidator_registrar.cc | 45 std::vector<invalidation::ObjectId> intersection; local 49 std::inserter(intersection, intersection.end()), 51 CHECK(intersection.empty()) 53 << ObjectIdToString(*intersection.begin()) << " for "
|
/external/chromium_org/third_party/WebKit/Source/web/resources/ |
H A D | pickerCommon.js | 79 Rectangle.intersection = function(rect1, rect2) {
|
/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...] |
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
H A D | BresenhamTerrainPicker.java | 99 final Vector3f intersection = new Vector3f(); 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, distanc 166 checkTriangles(float gridX, float gridY, Ray pick, Vector3f intersection, TerrainPatch patch, Triangle store) argument [all...] |
/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 | 110 URLPatternSet intersection; local 111 URLPatternSet::CreateIntersection(result, set2, &intersection); 112 EXPECT_TRUE(intersection.is_empty());
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPoint.cpp | 123 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection) argument 137 intersection.setX(p1.x() + param * pxLength); 138 intersection.setY(p1.y() + param * pyLength);
|
H A D | IntRect.h | 170 inline IntRect intersection(const IntRect& a, const IntRect& b) function in namespace:WebCore
|
/external/chromium_org/ui/compositor/ |
H A D | layer_animation_sequence.cc | 188 LayerAnimationElement::AnimatableProperties intersection; local 190 intersection, intersection.begin()); 194 return (intersection.size() > 0);
|
/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/chrome/browser/bookmarks/ |
H A D | 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_org/chrome/browser/bookmarks/ |
H A D | bookmark_index.cc | 215 NodeSet intersection; local 218 std::inserter(intersection, intersection.begin())); 219 if (intersection.empty()) { 223 match->nodes.swap(intersection); 234 NodeSet intersection; local 237 std::inserter(intersection, intersection.begin())); 238 if (!intersection.empty()) { 243 combined_match.nodes.swap(intersection); [all...] |