| Index: third_party/WebKit/Source/core/layout/HitTestResult.h
|
| diff --git a/third_party/WebKit/Source/core/layout/HitTestResult.h b/third_party/WebKit/Source/core/layout/HitTestResult.h
|
| index 156f2fda6e0bf6c983b3c989ea2d1ff5018c9ea8..75a820b414da6952f500999b07c5dea1fccb3844 100644
|
| --- a/third_party/WebKit/Source/core/layout/HitTestResult.h
|
| +++ b/third_party/WebKit/Source/core/layout/HitTestResult.h
|
| @@ -47,11 +47,19 @@ class Image;
|
| class KURL;
|
| class Node;
|
| class LayoutObject;
|
| +class Region;
|
| class Scrollbar;
|
|
|
| +// List-based hit test testing can continue even after a hit has been found.
|
| +// This is used to support fuzzy matching with rect-based hit tests as well as
|
| +// penetrating tests which collect all nodes (see: HitTestRequest::RequestType).
|
| +enum ListBasedHitTestBehavior {
|
| + ContinueHitTesting,
|
| + StopHitTesting
|
| +};
|
| +
|
| class CORE_EXPORT HitTestResult {
|
| DISALLOW_NEW_EXCEPT_PLACEMENT_NEW();
|
| -
|
| public:
|
| typedef WillBeHeapListHashSet<RefPtrWillBeMember<Node>> NodeSet;
|
|
|
| @@ -137,8 +145,9 @@ public:
|
| bool isCacheable() const { return m_cacheable; }
|
| void setCacheable(bool cacheable) { m_cacheable = cacheable; }
|
|
|
| - // Return true if the test is a list-based test and we should continue testing.
|
| - bool addNodeToListBasedTestResult(Node*, const HitTestLocation& pointInContainer, const LayoutRect& = LayoutRect());
|
| + ListBasedHitTestBehavior addNodeToListBasedTestResult(Node*, const HitTestLocation&, const LayoutRect& = LayoutRect());
|
| + ListBasedHitTestBehavior addNodeToListBasedTestResult(Node*, const HitTestLocation&, const Region&);
|
| +
|
| void append(const HitTestResult&);
|
|
|
| // If m_listBasedTestResult is 0 then set it to a new NodeSet. Return *m_listBasedTestResult. Lazy allocation makes
|
|
|