| Index: Source/core/editing/VisiblePosition.cpp
|
| diff --git a/Source/core/editing/VisiblePosition.cpp b/Source/core/editing/VisiblePosition.cpp
|
| index a48f8e175ad2e6f2c0e9c294b1511020896346ef..a5ec11bf2d5d76146cbab5f419b8de9404ac786b 100644
|
| --- a/Source/core/editing/VisiblePosition.cpp
|
| +++ b/Source/core/editing/VisiblePosition.cpp
|
| @@ -457,7 +457,7 @@ VisiblePosition VisiblePosition::honorEditingBoundaryAtOrBefore(const VisiblePos
|
| if (pos.isNull())
|
| return pos;
|
|
|
| - Node* highestRoot = highestEditableRoot(deepEquivalent());
|
| + ContainerNode* highestRoot = highestEditableRoot(deepEquivalent());
|
|
|
| // Return empty position if pos is not somewhere inside the editable region containing this position
|
| if (highestRoot && !pos.deepEquivalent().deprecatedNode()->isDescendantOf(highestRoot))
|
| @@ -483,7 +483,7 @@ VisiblePosition VisiblePosition::honorEditingBoundaryAtOrAfter(const VisiblePosi
|
| if (pos.isNull())
|
| return pos;
|
|
|
| - Node* highestRoot = highestEditableRoot(deepEquivalent());
|
| + ContainerNode* highestRoot = highestEditableRoot(deepEquivalent());
|
|
|
| // Return empty position if pos is not somewhere inside the editable region containing this position
|
| if (highestRoot && !pos.deepEquivalent().deprecatedNode()->isDescendantOf(highestRoot))
|
| @@ -509,8 +509,8 @@ VisiblePosition VisiblePosition::skipToStartOfEditingBoundary(const VisiblePosit
|
| if (pos.isNull())
|
| return pos;
|
|
|
| - Node* highestRoot = highestEditableRoot(deepEquivalent());
|
| - Node* highestRootOfPos = highestEditableRoot(pos.deepEquivalent());
|
| + ContainerNode* highestRoot = highestEditableRoot(deepEquivalent());
|
| + ContainerNode* highestRootOfPos = highestEditableRoot(pos.deepEquivalent());
|
|
|
| // Return pos itself if the two are from the very same editable region, or both are non-editable.
|
| if (highestRootOfPos == highestRoot)
|
| @@ -529,8 +529,8 @@ VisiblePosition VisiblePosition::skipToEndOfEditingBoundary(const VisiblePositio
|
| if (pos.isNull())
|
| return pos;
|
|
|
| - Node* highestRoot = highestEditableRoot(deepEquivalent());
|
| - Node* highestRootOfPos = highestEditableRoot(pos.deepEquivalent());
|
| + ContainerNode* highestRoot = highestEditableRoot(deepEquivalent());
|
| + ContainerNode* highestRootOfPos = highestEditableRoot(pos.deepEquivalent());
|
|
|
| // Return pos itself if the two are from the very same editable region, or both are non-editable.
|
| if (highestRootOfPos == highestRoot)
|
|
|