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 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
78 Element* enclosingTableCell(const Position&); | 78 Element* enclosingTableCell(const Position&); |
79 Element* associatedElementOf(const Position&); | 79 Element* associatedElementOf(const Position&); |
80 Node* enclosingEmptyListItem(const VisiblePosition&); | 80 Node* enclosingEmptyListItem(const VisiblePosition&); |
81 Element* enclosingAnchorElement(const Position&); | 81 Element* enclosingAnchorElement(const Position&); |
82 Element* enclosingElementWithTag(const Position&, const QualifiedName&); | 82 Element* enclosingElementWithTag(const Position&, const QualifiedName&); |
83 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); |
84 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
); |
85 | 85 |
86 HTMLSpanElement* tabSpanElement(const Node*); | 86 HTMLSpanElement* tabSpanElement(const Node*); |
87 Element* isLastPositionBeforeTable(const VisiblePosition&); | 87 Element* isLastPositionBeforeTable(const VisiblePosition&); |
88 Element* isFirstPositionAfterTable(const VisiblePosition&); | 88 CORE_EXPORT Element* isFirstPositionAfterTable(const VisiblePosition&); |
| 89 CORE_EXPORT Element* isFirstPositionAfterTable(const VisiblePositionInComposedTr
ee&); |
89 | 90 |
90 // Returns the next leaf node or nullptr if there are no more. | 91 // Returns the next leaf node or nullptr if there are no more. |
91 // Delivers leaf nodes as if the whole DOM tree were a linear chain of its leaf
nodes. | 92 // Delivers leaf nodes as if the whole DOM tree were a linear chain of its leaf
nodes. |
92 Node* nextAtomicLeafNode(const Node& start); | 93 Node* nextAtomicLeafNode(const Node& start); |
93 | 94 |
94 // Returns the previous leaf node or nullptr if there are no more. | 95 // Returns the previous leaf node or nullptr if there are no more. |
95 // Delivers leaf nodes as if the whole DOM tree were a linear chain of its leaf
nodes. | 96 // Delivers leaf nodes as if the whole DOM tree were a linear chain of its leaf
nodes. |
96 Node* previousAtomicLeafNode(const Node& start); | 97 Node* previousAtomicLeafNode(const Node& start); |
97 | 98 |
98 template <typename Strategy> | 99 template <typename Strategy> |
(...skipping 221 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
320 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. | 321 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. |
321 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; | 322 return character == '\'' || character == rightSingleQuotationMarkCharacter |
| character == hebrewPunctuationGershayimCharacter; |
322 } | 323 } |
323 | 324 |
324 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); | 325 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); |
325 const String& nonBreakingSpaceString(); | 326 const String& nonBreakingSpaceString(); |
326 | 327 |
327 } | 328 } |
328 | 329 |
329 #endif | 330 #endif |
OLD | NEW |