/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | thingsToDo.txt | 7 add unit test for quadratic horizontal intersection 8 add unit test for cubic horizontal intersection with left/right 13 add code to promote quad to cubic, or add quad/cubic intersection 130 the normal intersection engine. If it is possible to get from the T values to 167 about how far to move away in T before doing the intersection for the remainder
|
/external/chromium_org/third_party/skia/experimental/StrokePathRenderer/ |
H A D | GrStrokePathRenderer.cpp | 24 static IntersectionType intersection(const SkPoint& p1, const SkPoint& p2, function 33 // If d is zero, there is no intersection 41 // Compute the point of intersection 181 if (intersection(*pt0, pt2, *pt1, pt3, miterPt[0]) != 218 // another line intersection check here if the
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | MultisetsTest.java | 158 ASSERT.that(Multisets.intersection(ms1, ms2)).hasContentsInOrder(); 164 ASSERT.that(Multisets.intersection(ms1, ms2)).hasContentsInOrder();
|
H A D | MultisetCollectionTest.java | 230 return Multisets.intersection(multiset1, multiset2);
|
/external/skia/experimental/Intersection/ |
H A D | thingsToDo.txt | 7 add unit test for quadratic horizontal intersection 8 add unit test for cubic horizontal intersection with left/right 13 add code to promote quad to cubic, or add quad/cubic intersection 130 the normal intersection engine. If it is possible to get from the T values to 167 about how far to move away in T before doing the intersection for the remainder
|
/external/skia/experimental/StrokePathRenderer/ |
H A D | GrStrokePathRenderer.cpp | 24 static IntersectionType intersection(const SkPoint& p1, const SkPoint& p2, function 33 // If d is zero, there is no intersection 41 // Compute the point of intersection 181 if (intersection(*pt0, pt2, *pt1, pt3, miterPt[0]) != 218 // another line intersection check here if the
|
/external/chromium_org/ui/gfx/ |
H A D | render_text_win.cc | 707 // Add a Range for each run/selection intersection. 711 Range intersection = run->range.Intersect(layout_range); local 712 if (intersection.IsValid()) { 713 DCHECK(!intersection.is_reversed()); 714 Range range_x(GetGlyphXBoundary(run, intersection.start(), false), 715 GetGlyphXBoundary(run, intersection.end(), false)); 872 const Range intersection = local 874 const Range colored_glyphs = CharRangeToGlyphRange(*run, intersection);
|
/external/chromium_org/third_party/WebKit/Source/core/page/ |
H A D | TouchAdjustment.cpp | 331 // This returns quotient of the target area and its intersection with the touch area. 332 // This will prioritize largest intersection and smallest area, while balancing the two against each other. 343 IntRect intersection = rect; 344 intersection.intersect(touchArea); 346 // Return the quotient of the intersection. 347 return rect.size().area() / (float)intersection.size().area(); 424 // will fail to adjust the point to somewhere in the intersection. 449 // Distance functions could for instance be distance squared or area of intersection.
|
/external/opencv/cvaux/src/ |
H A D | cv3dtracker.cpp | 65 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1, 476 // find the intersection of the two lines (or the points of closest 478 if (!intersection(p1a, p1b, p2a, p2b, r1, r2)) 518 // Find the intersection of two lines, or if they don't intersect, 523 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1, function
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFAState.java | 272 /** Add label uniquely and disjointly; intersection with 326 intersection.toString(dfa.nfa.grammar)); 336 // Replace existing s_i with intersection since we 339 IntSet intersection = s_i.and(t); 340 reachableLabels.set(i, new Label(intersection));
|
/external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/ |
H A D | FEComposite.cpp | 250 // 'in' has output only in the intersection of both inputs. 251 affectedRect = intersection(input1Rect, inputEffect(0)->determineAbsolutePaintRect(input1Rect)); 274 // Just k1 is positive. Use intersection. 275 affectedRect = intersection(input1Rect, input0Rect);
|
/external/chromium_org/third_party/WebKit/Source/platform/scroll/ |
H A D | ScrollbarTheme.cpp | 221 context->fillRect(intersection(horizontalOverhangRect, dirtyRect)); 223 context->fillRect(intersection(verticalOverhangRect, dirtyRect));
|
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | Caret.cpp | 271 LayoutRect caret = intersection(drawingRect, clipRect);
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPoint.h | 244 PLATFORM_EXPORT bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection);
|
H A D | FloatPolygon.cpp | 202 bool VertexPair::intersection(const VertexPair& other, FloatPoint& point) const 214 // when 0 <= u <= 1. We're computing the values of u for each line at their intersection point.
|
H A D | FloatRect.h | 187 inline FloatRect intersection(const FloatRect& a, const FloatRect& b) function in namespace:blink
|
H A D | IntRect.h | 174 inline IntRect intersection(const IntRect& a, const IntRect& 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/chromium_org/third_party/angle/src/libGLESv2/ |
H A D | angletypes.h | 55 bool ClipRectangle(const Rectangle &source, const Rectangle &clip, Rectangle *intersection);
|
/external/chromium_org/tools/ |
H A D | check_grd_for_unused_strings.py | 105 missing = ids_left.intersection(file_ids)
|
/external/chromium_org/tools/deep_memory_profiler/ |
H A D | accumulate.py | 64 matched_units = set(match['units']).intersection(target_units)
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
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/eigen/Eigen/src/Geometry/ |
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/eigen/test/eigen2/ |
H A D | eigen2_hyperplane.cpp | 103 Vector result = line_u.intersection(line_v);
|
/external/eigen/test/ |
H A D | geo_hyperplane.cpp | 104 Vector result = line_u.intersection(line_v);
|