| 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 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 64 | 64 |
| 65 CORE_EXPORT ContainerNode* highestEditableRoot(const Position&, EditableType = C
ontentIsEditable); | 65 CORE_EXPORT ContainerNode* highestEditableRoot(const Position&, EditableType = C
ontentIsEditable); |
| 66 ContainerNode* highestEditableRoot(const PositionInComposedTree&, EditableType =
ContentIsEditable); | 66 ContainerNode* highestEditableRoot(const PositionInComposedTree&, EditableType =
ContentIsEditable); |
| 67 | 67 |
| 68 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), | 68 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), |
| 69 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
nullptr); | 69 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
nullptr); |
| 70 Node* highestNodeToRemoveInPruning(Node*, Node* excludeNode = nullptr); | 70 Node* highestNodeToRemoveInPruning(Node*, Node* excludeNode = nullptr); |
| 71 Element* lowestEditableAncestor(Node*); | 71 Element* lowestEditableAncestor(Node*); |
| 72 | 72 |
| 73 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); | 73 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); |
| 74 Element* enclosingBlock(const Position&, EditingBoundaryCrossingRule); | 74 CORE_EXPORT Element* enclosingBlock(const Position&, EditingBoundaryCrossingRule
); |
| 75 CORE_EXPORT Element* enclosingBlock(const PositionInComposedTree&, EditingBounda
ryCrossingRule); |
| 75 Element* enclosingBlockFlowElement(Node&); // Deprecated, use enclosingBlock ins
tead. | 76 Element* enclosingBlockFlowElement(Node&); // Deprecated, use enclosingBlock ins
tead. |
| 76 bool inSameContainingBlockFlowElement(Node*, Node*); | 77 bool inSameContainingBlockFlowElement(Node*, Node*); |
| 77 Element* enclosingTableCell(const Position&); | 78 Element* enclosingTableCell(const Position&); |
| 78 Element* associatedElementOf(const Position&); | 79 Element* associatedElementOf(const Position&); |
| 79 Node* enclosingEmptyListItem(const VisiblePosition&); | 80 Node* enclosingEmptyListItem(const VisiblePosition&); |
| 80 Element* enclosingAnchorElement(const Position&); | 81 Element* enclosingAnchorElement(const Position&); |
| 81 Element* enclosingElementWithTag(const Position&, const QualifiedName&); | 82 Element* enclosingElementWithTag(const Position&, const QualifiedName&); |
| 82 CORE_EXPORT Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(cons
t Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); | 83 CORE_EXPORT Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(cons
t Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary); |
| 83 CORE_EXPORT Node* enclosingNodeOfType(const PositionInComposedTree&, bool (*node
IsOfType)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary
); | 84 CORE_EXPORT Node* enclosingNodeOfType(const PositionInComposedTree&, bool (*node
IsOfType)(const Node*), EditingBoundaryCrossingRule = CannotCrossEditingBoundary
); |
| 84 | 85 |
| (...skipping 224 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 309 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. | 310 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. |
| 310 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; | 311 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; |
| 311 } | 312 } |
| 312 | 313 |
| 313 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); | 314 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); |
| 314 const String& nonBreakingSpaceString(); | 315 const String& nonBreakingSpaceString(); |
| 315 | 316 |
| 316 } | 317 } |
| 317 | 318 |
| 318 #endif | 319 #endif |
| OLD | NEW |