| 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 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 94 { | 94 { |
| 95 return !node->isTextNode() && node->canContainRangeEndPoint(); | 95 return !node->isTextNode() && node->canContainRangeEndPoint(); |
| 96 } | 96 } |
| 97 | 97 |
| 98 bool isAtomicNode(const Node*); | 98 bool isAtomicNode(const Node*); |
| 99 bool isBlock(const Node*); | 99 bool isBlock(const Node*); |
| 100 bool isInline(const Node*); | 100 bool isInline(const Node*); |
| 101 bool isSpecialElement(const Node*); | 101 bool isSpecialElement(const Node*); |
| 102 bool isTabSpanNode(const Node*); | 102 bool isTabSpanNode(const Node*); |
| 103 bool isTabSpanTextNode(const Node*); | 103 bool isTabSpanTextNode(const Node*); |
| 104 bool isMailBlockquote(const Node*); | |
| 105 bool isTableElement(Node*); | 104 bool isTableElement(Node*); |
| 106 bool isTableCell(const Node*); | 105 bool isTableCell(const Node*); |
| 107 bool isEmptyTableCell(const Node*); | 106 bool isEmptyTableCell(const Node*); |
| 108 bool isTableStructureNode(const Node*); | 107 bool isTableStructureNode(const Node*); |
| 109 bool isListElement(Node*); | 108 bool isListElement(Node*); |
| 110 bool isListItem(const Node*); | 109 bool isListItem(const Node*); |
| 111 bool isNodeRendered(const Node*); | 110 bool isNodeRendered(const Node*); |
| 112 bool isNodeVisiblyContainedWithin(Node*, const Range*); | 111 bool isNodeVisiblyContainedWithin(Node*, const Range*); |
| 113 bool isRenderedAsNonInlineTableImageOrHR(const Node*); | 112 bool isRenderedAsNonInlineTableImageOrHR(const Node*); |
| 114 bool areIdenticalElements(const Node*, const Node*); | 113 bool areIdenticalElements(const Node*, const Node*); |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 156 bool isEditablePosition(const Position&, EditableType = ContentIsEditable, EUpda
teStyle = UpdateStyle); | 155 bool isEditablePosition(const Position&, EditableType = ContentIsEditable, EUpda
teStyle = UpdateStyle); |
| 157 bool isRichlyEditablePosition(const Position&, EditableType = ContentIsEditable)
; | 156 bool isRichlyEditablePosition(const Position&, EditableType = ContentIsEditable)
; |
| 158 bool isFirstVisiblePositionInSpecialElement(const Position&); | 157 bool isFirstVisiblePositionInSpecialElement(const Position&); |
| 159 bool isLastVisiblePositionInSpecialElement(const Position&); | 158 bool isLastVisiblePositionInSpecialElement(const Position&); |
| 160 bool lineBreakExistsAtPosition(const Position&); | 159 bool lineBreakExistsAtPosition(const Position&); |
| 161 bool isVisiblyAdjacent(const Position& first, const Position& second); | 160 bool isVisiblyAdjacent(const Position& first, const Position& second); |
| 162 bool isAtUnsplittableElement(const Position&); | 161 bool isAtUnsplittableElement(const Position&); |
| 163 | 162 |
| 164 // miscellaneous functions on Position | 163 // miscellaneous functions on Position |
| 165 | 164 |
| 166 unsigned numEnclosingMailBlockquotes(const Position&); | |
| 167 void updatePositionForNodeRemoval(Position&, Node*); | 165 void updatePositionForNodeRemoval(Position&, Node*); |
| 168 | 166 |
| 169 // ------------------------------------------------------------------------- | 167 // ------------------------------------------------------------------------- |
| 170 // VisiblePosition | 168 // VisiblePosition |
| 171 // ------------------------------------------------------------------------- | 169 // ------------------------------------------------------------------------- |
| 172 | 170 |
| 173 // Functions returning VisiblePosition | 171 // Functions returning VisiblePosition |
| 174 | 172 |
| 175 VisiblePosition firstEditablePositionAfterPositionInRoot(const Position&, Node*)
; | 173 VisiblePosition firstEditablePositionAfterPositionInRoot(const Position&, Node*)
; |
| 176 VisiblePosition lastEditablePositionBeforePositionInRoot(const Position&, Node*)
; | 174 VisiblePosition lastEditablePositionBeforePositionInRoot(const Position&, Node*)
; |
| (...skipping 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 252 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. | 250 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. |
| 253 return character == '\'' || character == rightSingleQuotationMark || charact
er == hebrewPunctuationGershayim; | 251 return character == '\'' || character == rightSingleQuotationMark || charact
er == hebrewPunctuationGershayim; |
| 254 } | 252 } |
| 255 | 253 |
| 256 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); | 254 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); |
| 257 const String& nonBreakingSpaceString(); | 255 const String& nonBreakingSpaceString(); |
| 258 | 256 |
| 259 } | 257 } |
| 260 | 258 |
| 261 #endif | 259 #endif |
| OLD | NEW |