Introduce nextPositionOf() for VisiblePosition

Source/core/editing/serializers/StyledMarkupSerializer.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009, 2010, 2011 Google Inc. All rights reserved.
  * Copyright (C) 2011 Igalia S.L.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
@@ skipping 118 matching lines @@
     , m_shouldResolveURLs(shouldResolveURLs)
     , m_shouldAnnotate(shouldAnnotate)
     , m_highestNodeToBeSerialized(highestNodeToBeSerialized)
     , m_convertBlocksToInlines(convertBlocksToInlines)
     , m_lastClosed(highestNodeToBeSerialized)
 {
 }
 
 static bool needInterchangeNewlineAfter(const VisiblePosition& v)
 {
-    VisiblePosition next = v.next();
+    VisiblePosition next = nextPositionOf(v);
     Node* upstreamNode = mostBackwardCaretPosition(next.deepEquivalent()).anchorNode();
     Node* downstreamNode = mostForwardCaretPosition(v.deepEquivalent()).anchorNode();
     // Add an interchange newline if a paragraph break is selected and a br won't already be added to the markup to represent it.
     return isEndOfParagraph(v) && isStartOfParagraph(next) && !(isHTMLBRElement(*upstreamNode) && upstreamNode == downstreamNode);
 }
 
 static bool needInterchangeNewlineAt(const VisiblePosition& v)
 {
     // TODO(yosin) |previousPositionOf(v)| works on a DOM tree. We need to fix
     // this to work on a composed tree.
@@ skipping 25 matching lines @@
     Node* pastEnd = m_end.nodeAsRangePastLastNode();
 
     Node* firstNode = m_start.nodeAsRangeFirstNode();
     VisiblePosition visibleStart(m_start);
     VisiblePosition visibleEnd(m_end);
     if (shouldAnnotate() && needInterchangeNewlineAfter(visibleStart)) {
         markupAccumulator.appendInterchangeNewline();
         if (visibleStart.deepEquivalent() == previousPositionOf(visibleEnd).deepEquivalent())
             return markupAccumulator.takeResults();
 
-        firstNode = visibleStart.next().deepEquivalent().anchorNode();
+        firstNode = nextPositionOf(visibleStart).deepEquivalent().anchorNode();
 
         if (pastEnd && PositionAlgorithm<Strategy>::beforeNode(firstNode).compareTo(PositionAlgorithm<Strategy>::beforeNode(pastEnd)) >= 0) {
             // This condition hits in editing/pasteboard/copy-display-none.html.
             return markupAccumulator.takeResults();
         }
     }
 
     if (!m_lastClosed)
         m_lastClosed = StyledMarkupTraverser<Strategy>().traverse(firstNode, pastEnd);
     StyledMarkupTraverser<Strategy> traverser(&markupAccumulator, m_lastClosed);
@@ skipping 279 matching lines @@
     if (element.isHTMLElement() && shouldAnnotate())
         inlineStyle->mergeStyleFromRulesForSerialization(&toHTMLElement(element));
 
     return inlineStyle;
 }
 
 template class StyledMarkupSerializer<EditingStrategy>;
 template class StyledMarkupSerializer<EditingInComposedTreeStrategy>;
 
 } // namespace blink