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 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
177 { | 177 { |
178 return Position::firstPositionInOrBeforeNode(node); | 178 return Position::firstPositionInOrBeforeNode(node); |
179 } | 179 } |
180 | 180 |
181 inline Position lastPositionInOrAfterNode(Node* node) | 181 inline Position lastPositionInOrAfterNode(Node* node) |
182 { | 182 { |
183 return Position::lastPositionInOrAfterNode(node); | 183 return Position::lastPositionInOrAfterNode(node); |
184 } | 184 } |
185 | 185 |
186 CORE_EXPORT Position firstEditablePositionAfterPositionInRoot(const Position&, N
ode*); | 186 CORE_EXPORT Position firstEditablePositionAfterPositionInRoot(const Position&, N
ode*); |
187 Position lastEditablePositionBeforePositionInRoot(const Position&, Node*); | 187 CORE_EXPORT Position lastEditablePositionBeforePositionInRoot(const Position&, N
ode*); |
188 CORE_EXPORT PositionInComposedTree firstEditablePositionAfterPositionInRoot(cons
t PositionInComposedTree&, Node*); | 188 CORE_EXPORT PositionInComposedTree firstEditablePositionAfterPositionInRoot(cons
t PositionInComposedTree&, Node*); |
189 PositionInComposedTree lastEditablePositionBeforePositionInRoot(const PositionIn
ComposedTree&, Node*); | 189 CORE_EXPORT PositionInComposedTree lastEditablePositionBeforePositionInRoot(cons
t PositionInComposedTree&, Node*); |
190 | 190 |
191 // Move up or down the DOM by one position. | 191 // Move up or down the DOM by one position. |
192 // Offsets are computed using layout text for nodes that have layoutObjects - | 192 // Offsets are computed using layout text for nodes that have layoutObjects - |
193 // but note that even when using composed characters, the result may be inside | 193 // but note that even when using composed characters, the result may be inside |
194 // a single user-visible character if a ligature is formed. | 194 // a single user-visible character if a ligature is formed. |
195 CORE_EXPORT Position previousPositionOf(const Position&, PositionMoveType); | 195 CORE_EXPORT Position previousPositionOf(const Position&, PositionMoveType); |
196 CORE_EXPORT Position nextPositionOf(const Position&, PositionMoveType); | 196 CORE_EXPORT Position nextPositionOf(const Position&, PositionMoveType); |
197 CORE_EXPORT PositionInComposedTree previousPositionOf(const PositionInComposedTr
ee&, PositionMoveType); | 197 CORE_EXPORT PositionInComposedTree previousPositionOf(const PositionInComposedTr
ee&, PositionMoveType); |
198 CORE_EXPORT PositionInComposedTree nextPositionOf(const PositionInComposedTree&,
PositionMoveType); | 198 CORE_EXPORT PositionInComposedTree nextPositionOf(const PositionInComposedTree&,
PositionMoveType); |
199 | 199 |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
235 // ------------------------------------------------------------------------- | 235 // ------------------------------------------------------------------------- |
236 | 236 |
237 // Functions returning VisiblePosition | 237 // Functions returning VisiblePosition |
238 | 238 |
239 // TODO(yosin) We should rename | 239 // TODO(yosin) We should rename |
240 // |firstEditableVisiblePositionAfterPositionInRoot()| to a better name which | 240 // |firstEditableVisiblePositionAfterPositionInRoot()| to a better name which |
241 // describes what this function returns, since it returns a position before | 241 // describes what this function returns, since it returns a position before |
242 // specified position due by canonicalization. | 242 // specified position due by canonicalization. |
243 CORE_EXPORT VisiblePosition firstEditableVisiblePositionAfterPositionInRoot(cons
t Position&, ContainerNode*); | 243 CORE_EXPORT VisiblePosition firstEditableVisiblePositionAfterPositionInRoot(cons
t Position&, ContainerNode*); |
244 CORE_EXPORT VisiblePositionInComposedTree firstEditableVisiblePositionAfterPosit
ionInRoot(const PositionInComposedTree&, ContainerNode*); | 244 CORE_EXPORT VisiblePositionInComposedTree firstEditableVisiblePositionAfterPosit
ionInRoot(const PositionInComposedTree&, ContainerNode*); |
245 VisiblePosition lastEditableVisiblePositionBeforePositionInRoot(const Position&,
ContainerNode*); | 245 CORE_EXPORT VisiblePosition lastEditableVisiblePositionBeforePositionInRoot(cons
t Position&, ContainerNode*); |
| 246 CORE_EXPORT VisiblePositionInComposedTree lastEditableVisiblePositionBeforePosit
ionInRoot(const PositionInComposedTree&, ContainerNode*); |
246 VisiblePosition visiblePositionBeforeNode(Node&); | 247 VisiblePosition visiblePositionBeforeNode(Node&); |
247 VisiblePosition visiblePositionAfterNode(Node&); | 248 VisiblePosition visiblePositionAfterNode(Node&); |
248 | 249 |
249 bool lineBreakExistsAtVisiblePosition(const VisiblePosition&); | 250 bool lineBreakExistsAtVisiblePosition(const VisiblePosition&); |
250 | 251 |
251 int comparePositions(const VisiblePosition&, const VisiblePosition&); | 252 int comparePositions(const VisiblePosition&, const VisiblePosition&); |
252 | 253 |
253 int indexForVisiblePosition(const VisiblePosition&, RefPtrWillBeRawPtr<Container
Node>& scope); | 254 int indexForVisiblePosition(const VisiblePosition&, RefPtrWillBeRawPtr<Container
Node>& scope); |
254 EphemeralRange makeRange(const VisiblePosition&, const VisiblePosition&); | 255 EphemeralRange makeRange(const VisiblePosition&, const VisiblePosition&); |
255 EphemeralRange normalizeRange(const EphemeralRange&); | 256 EphemeralRange normalizeRange(const EphemeralRange&); |
(...skipping 64 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 |