Introduce composed tree version of enclosingNodeOfType()

Source/core/editing/EditingUtilities.h

 /*
  * Copyright (C) 2004, 2006, 2008 Apple Inc. 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
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 60 matching lines @@
 Element* lowestEditableAncestor(Node*);
 
 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingBoundary);
 Element* enclosingBlockFlowElement(Node&); // Deprecated, use enclosingBlock instead.
 bool inSameContainingBlockFlowElement(Node*, Node*);
 Element* enclosingTableCell(const Position&);
 Element* associatedElementOf(const Position&);
 Node* enclosingEmptyListItem(const VisiblePosition&);
 Element* enclosingAnchorElement(const Position&);
 Element* enclosingElementWithTag(const Position&, const QualifiedName&);
-Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary);
+CORE_EXPORT Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary);
+CORE_EXPORT Node* enclosingNodeOfType(const PositionInComposedTree&, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary);
 
 HTMLSpanElement* tabSpanElement(const Node*);
 Element* isLastPositionBeforeTable(const VisiblePosition&);
 Element* isFirstPositionAfterTable(const VisiblePosition&);
 
 // Returns the next leaf node or nullptr if there are no more.
 // Delivers leaf nodes as if the whole DOM tree were a linear chain of its leaf nodes.
 Node* nextAtomicLeafNode(const Node& start);
 
 // Returns the previous leaf node or nullptr if there are no more.
@@ skipping 29 matching lines @@
 {
     return EditingStrategy::editingIgnoresContent(node);
 }
 
 inline bool canHaveChildrenForEditing(const Node* node)
 {
     return !node->isTextNode() && node->canContainRangeEndPoint();
 }
 
 bool isAtomicNode(const Node*);
-bool isBlock(const Node*);
+CORE_EXPORT bool isBlock(const Node*);

[hajimehoshi, 2015/08/26 04:50:53]

Is this a global function? I guess the name isBlock is too general. How about
renaming in another CL?

[yosin_UTC9, 2015/08/26 04:53:13]

Good catch. I'll rename it to another name, e.g. isBlockElement(Node*).
Still short?

[hajimehoshi, 2015/08/26 04:55:28]

isBlockElement would be much better (as long as an element named 'block' doesn't
exist).

 bool isInline(const Node*);
 bool isTabHTMLSpanElement(const Node*);
 bool isTabHTMLSpanElementTextNode(const Node*);
 bool isMailHTMLBlockquoteElement(const Node*);
 bool isRenderedTableElement(const Node*);
 bool isRenderedHTMLTableElement(const Node*);
 bool isTableCell(const Node*);
 bool isEmptyTableCell(const Node*);
 bool isTableStructureNode(const Node*);
 bool isHTMLListElement(Node*);
@@ skipping 164 matching lines @@
     // FIXME: this is required until 6853027 is fixed and text checking can do this for us.
     return character == '\'' || character == rightSingleQuotationMarkCharacter || character == hebrewPunctuationGershayimCharacter;
 }
 
 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagraph, bool endIsEndOfParagraph);
 const String& nonBreakingSpaceString();
 
 }
 
 #endif