Index: third_party/WebKit/Source/core/layout/svg/SVGLayoutSupport.cpp |
diff --git a/third_party/WebKit/Source/core/layout/svg/SVGLayoutSupport.cpp b/third_party/WebKit/Source/core/layout/svg/SVGLayoutSupport.cpp |
index 32073042bd914cd8999f8fd2c593feade0f70a23..4acf406a4ee64d50a06dcfa8f177e6b6dd8c09e4 100644 |
--- a/third_party/WebKit/Source/core/layout/svg/SVGLayoutSupport.cpp |
+++ b/third_party/WebKit/Source/core/layout/svg/SVGLayoutSupport.cpp |
@@ -44,6 +44,18 @@ |
namespace blink { |
+struct SearchCandidate { |
+public: |
+ SearchCandidate() {} |
+ SearchCandidate(LayoutObject* layoutObject, float dist) |
+ : candidateLayoutObject(layoutObject) |
+ , distance(dist) |
+ { |
+ } |
+ LayoutObject* candidateLayoutObject; |
+ float distance; |
+}; |
+ |
static inline LayoutRect adjustedEnclosingIntRect(const FloatRect& rect, |
const AffineTransform& rootTransform, float strokeWidthForHairlinePadding) |
{ |
@@ -476,4 +488,64 @@ float SVGLayoutSupport::calculateScreenFontSizeScalingFactor(const LayoutObject* |
return narrowPrecisionToFloat(sqrt((pow(ctm.xScale(), 2) + pow(ctm.yScale(), 2)) / 2)); |
} |
+static inline bool compareCandidateDistance(const SearchCandidate& r1, const SearchCandidate& r2) |
+{ |
+ return r1.distance < r2.distance; |
+} |
+ |
+LayoutObject* SVGLayoutSupport::findClosestLayoutSVGText(LayoutObject* layoutObject, const FloatPoint& point) |
+{ |
+ // Try to search closest LayoutSVGText on sub-tree of |layoutObject|. |
fs
2016/01/21 15:32:02
Comments could use some touch-up. (I'd prefer not
|
+ // On this level of tree, try to find the closest LayoutSVGText. If not find this level, try to search |
+ // next level which is candidates. |
+ LayoutObject* closestLayoutObject = nullptr; |
+ float closestDistance = std::numeric_limits<float>::max(); |
+ Vector<SearchCandidate> candidates; |
+ for (LayoutObject* child = layoutObject->slowLastChild(); child; child = child->previousSibling()) { |
+ if (child->isSVGHiddenContainer()) |
+ continue; |
+ if (!child->localToParentTransform().isInvertible()) |
fs
2016/01/21 15:32:02
This still makes us do work for example for shapes
|
+ continue; |
+ |
+ FloatRect boundingBox = child->objectBoundingBox(); |
+ FloatPoint childLocalPoint = child->localToParentTransform().inverse().mapPoint(point); |
+ float distance = boundingBox.squaredDistanceTo(childLocalPoint); |
+ |
+ if (child->isSVGText()) { |
+ if (distance >= closestDistance) |
+ continue; |
+ candidates.clear(); |
+ closestLayoutObject = child; |
+ closestDistance = distance; |
+ continue; |
+ } |
+ |
+ if (child->isSVGContainer()) { |
+ if (distance > closestDistance) |
+ continue; |
+ candidates.append(SearchCandidate(child, distance)); |
+ } |
+ } |
+ |
+ // If find LayoutSVGText this level of tree, return it. |
+ if (closestLayoutObject && closestLayoutObject->isSVGText()) |
+ return closestLayoutObject; |
+ |
+ // Sort using the distance between the mouse point and a candidate. |
+ // Because if the distance is close, It is high priority to search LayoutSVGText. |
+ std::stable_sort(candidates.begin(), candidates.end(), compareCandidateDistance); |
+ |
+ // If not find LayoutSVGText on this level of tree, try to search it on sub-tree of |condidate|. |
+ // This vector called |candidates| is the sort in order of distance from the mouse point. |
+ // If can not find the LayoutSVGText on |candidates|, after all return nullptr. |
+ for (SearchCandidate& searchCandidate : candidates) { |
+ LayoutObject* candidateLayoutObject = searchCandidate.candidateLayoutObject; |
+ FloatPoint candidateLocalPoint = candidateLayoutObject->localToParentTransform().inverse().mapPoint(point); |
+ if (LayoutObject* result = findClosestLayoutSVGText(candidateLayoutObject, candidateLocalPoint)) |
fs
2016/01/21 15:32:02
Should this be considering all candidates with equ
|
+ return result; |
+ } |
+ |
+ return nullptr; |
+} |
+ |
} |