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 169 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
180 static int uncheckedNextOffset(const Node*, int current); | 180 static int uncheckedNextOffset(const Node*, int current); |
181 | 181 |
182 int compareTo(const PositionAlgorithm<Strategy>&) const; | 182 int compareTo(const PositionAlgorithm<Strategy>&) const; |
183 | 183 |
184 // These can be either inside or just before/after the node, depending on | 184 // These can be either inside or just before/after the node, depending on |
185 // if the node is ignored by editing or not. | 185 // if the node is ignored by editing or not. |
186 // FIXME: These should go away. They only make sense for legacy positions. | 186 // FIXME: These should go away. They only make sense for legacy positions. |
187 bool atFirstEditingPositionForNode() const; | 187 bool atFirstEditingPositionForNode() const; |
188 bool atLastEditingPositionForNode() const; | 188 bool atLastEditingPositionForNode() const; |
189 | 189 |
190 // Returns true if the visually equivalent positions around have different e
ditability | |
191 bool atEditingBoundary() const; | |
192 Node* parentEditingBoundary() const; | 190 Node* parentEditingBoundary() const; |
193 | 191 |
194 bool atStartOfTree() const; | 192 bool atStartOfTree() const; |
195 bool atEndOfTree() const; | 193 bool atEndOfTree() const; |
196 | 194 |
197 // These return useful visually equivalent positions. | 195 // These return useful visually equivalent positions. |
198 PositionAlgorithm<Strategy> upstream(EditingBoundaryCrossingRule = CannotCro
ssEditingBoundary) const; | 196 PositionAlgorithm<Strategy> upstream(EditingBoundaryCrossingRule = CannotCro
ssEditingBoundary) const; |
199 PositionAlgorithm<Strategy> downstream(EditingBoundaryCrossingRule = CannotC
rossEditingBoundary) const; | 197 PositionAlgorithm<Strategy> downstream(EditingBoundaryCrossingRule = CannotC
rossEditingBoundary) const; |
200 | 198 |
201 bool isCandidate() const; | 199 bool isCandidate() const; |
(...skipping 245 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
447 | 445 |
448 } // namespace blink | 446 } // namespace blink |
449 | 447 |
450 #ifndef NDEBUG | 448 #ifndef NDEBUG |
451 // Outside the WebCore namespace for ease of invocation from gdb. | 449 // Outside the WebCore namespace for ease of invocation from gdb. |
452 void showTree(const blink::Position&); | 450 void showTree(const blink::Position&); |
453 void showTree(const blink::Position*); | 451 void showTree(const blink::Position*); |
454 #endif | 452 #endif |
455 | 453 |
456 #endif // Position_h | 454 #endif // Position_h |
OLD | NEW |