| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2006, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2004, 2006, 2008 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| (...skipping 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 72 ContainerNode* highestEditableRoot(const PositionInFlatTree&, EditableType = Con
tentIsEditable); | 72 ContainerNode* highestEditableRoot(const PositionInFlatTree&, EditableType = Con
tentIsEditable); |
| 73 | 73 |
| 74 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), | 74 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), |
| 75 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
nullptr); | 75 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
nullptr); |
| 76 Node* highestNodeToRemoveInPruning(Node*, Node* excludeNode = nullptr); | 76 Node* highestNodeToRemoveInPruning(Node*, Node* excludeNode = nullptr); |
| 77 | 77 |
| 78 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); | 78 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); |
| 79 CORE_EXPORT Element* enclosingBlock(const Position&, EditingBoundaryCrossingRule
); | 79 CORE_EXPORT Element* enclosingBlock(const Position&, EditingBoundaryCrossingRule
); |
| 80 CORE_EXPORT Element* enclosingBlock(const PositionInFlatTree&, EditingBoundaryCr
ossingRule); | 80 CORE_EXPORT Element* enclosingBlock(const PositionInFlatTree&, EditingBoundaryCr
ossingRule); |
| 81 Element* enclosingBlockFlowElement(const Node&); // Deprecated, use enclosingBlo
ck instead. | 81 Element* enclosingBlockFlowElement(const Node&); // Deprecated, use enclosingBlo
ck instead. |
| 82 bool inSameContainingBlockFlowElement(Node*, Node*); | |
| 83 Element* enclosingTableCell(const Position&); | 82 Element* enclosingTableCell(const Position&); |
| 84 Element* associatedElementOf(const Position&); | 83 Element* associatedElementOf(const Position&); |
| 85 Node* enclosingEmptyListItem(const VisiblePosition&); | 84 Node* enclosingEmptyListItem(const VisiblePosition&); |
| 86 Element* enclosingAnchorElement(const Position&); | 85 Element* enclosingAnchorElement(const Position&); |
| 87 // Returns the lowest ancestor with the specified QualifiedName. If the | 86 // Returns the lowest ancestor with the specified QualifiedName. If the |
| 88 // specified Position is editable, this function returns an editable | 87 // specified Position is editable, this function returns an editable |
| 89 // Element. Otherwise, editability doesn't matter. | 88 // Element. Otherwise, editability doesn't matter. |
| 90 Element* enclosingElementWithTag(const Position&, const QualifiedName&); | 89 Element* enclosingElementWithTag(const Position&, const QualifiedName&); |
| 91 CORE_EXPORT Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(cons
t Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); | 90 CORE_EXPORT Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(cons
t Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); |
| 92 CORE_EXPORT Node* enclosingNodeOfType(const PositionInFlatTree&, bool (*nodeIsOf
Type)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); | 91 CORE_EXPORT Node* enclosingNodeOfType(const PositionInFlatTree&, bool (*nodeIsOf
Type)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); |
| (...skipping 233 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 326 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. | 325 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. |
| 327 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; | 326 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; |
| 328 } | 327 } |
| 329 | 328 |
| 330 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); | 329 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); |
| 331 const String& nonBreakingSpaceString(); | 330 const String& nonBreakingSpaceString(); |
| 332 | 331 |
| 333 } // namespace blink | 332 } // namespace blink |
| 334 | 333 |
| 335 #endif | 334 #endif |
| OLD | NEW |