OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. |
3 * Copyright (C) 2005 Alexey Proskuryakov. | 3 * Copyright (C) 2005 Alexey Proskuryakov. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 350 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
361 { | 361 { |
362 if (m_positionNode) | 362 if (m_positionNode) |
363 return m_positionEndOffset; | 363 return m_positionEndOffset; |
364 return m_startOffset; | 364 return m_startOffset; |
365 } | 365 } |
366 | 366 |
367 template <typename Strategy> | 367 template <typename Strategy> |
368 PositionAlgorithm<Strategy> SimplifiedBackwardsTextIteratorAlgorithm<Strategy>::
startPosition() const | 368 PositionAlgorithm<Strategy> SimplifiedBackwardsTextIteratorAlgorithm<Strategy>::
startPosition() const |
369 { | 369 { |
370 if (m_positionNode) | 370 if (m_positionNode) |
371 return PositionAlgorithm<Strategy>::createLegacyEditingPosition(m_positi
onNode, m_positionStartOffset); | 371 return PositionAlgorithm<Strategy>::editingPositionOf(m_positionNode, m_
positionStartOffset); |
372 return PositionAlgorithm<Strategy>::createLegacyEditingPosition(m_startNode,
m_startOffset); | 372 return PositionAlgorithm<Strategy>::editingPositionOf(m_startNode, m_startOf
fset); |
373 } | 373 } |
374 | 374 |
375 template <typename Strategy> | 375 template <typename Strategy> |
376 PositionAlgorithm<Strategy>SimplifiedBackwardsTextIteratorAlgorithm<Strategy>::e
ndPosition() const | 376 PositionAlgorithm<Strategy>SimplifiedBackwardsTextIteratorAlgorithm<Strategy>::e
ndPosition() const |
377 { | 377 { |
378 if (m_positionNode) | 378 if (m_positionNode) |
379 return PositionAlgorithm<Strategy>::createLegacyEditingPosition(m_positi
onNode, m_positionEndOffset); | 379 return PositionAlgorithm<Strategy>::editingPositionOf(m_positionNode, m_
positionEndOffset); |
380 return PositionAlgorithm<Strategy>::createLegacyEditingPosition(m_startNode,
m_startOffset); | 380 return PositionAlgorithm<Strategy>::editingPositionOf(m_startNode, m_startOf
fset); |
381 } | 381 } |
382 | 382 |
383 template class CORE_TEMPLATE_EXPORT SimplifiedBackwardsTextIteratorAlgorithm<Edi
tingStrategy>; | 383 template class CORE_TEMPLATE_EXPORT SimplifiedBackwardsTextIteratorAlgorithm<Edi
tingStrategy>; |
384 template class CORE_TEMPLATE_EXPORT SimplifiedBackwardsTextIteratorAlgorithm<Edi
tingInComposedTreeStrategy>; | 384 template class CORE_TEMPLATE_EXPORT SimplifiedBackwardsTextIteratorAlgorithm<Edi
tingInComposedTreeStrategy>; |
385 | 385 |
386 | 386 |
387 } // namespace blink | 387 } // namespace blink |
OLD | NEW |