| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2004, 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 bool isNull() const { return m_deepPosition.isNull(); } | 88 bool isNull() const { return m_deepPosition.isNull(); } |
| 89 bool isNotNull() const { return m_deepPosition.isNotNull(); } | 89 bool isNotNull() const { return m_deepPosition.isNotNull(); } |
| 90 bool isOrphan() const { return m_deepPosition.isOrphan(); } | 90 bool isOrphan() const { return m_deepPosition.isOrphan(); } |
| 91 | 91 |
| 92 Position deepEquivalent() const { return m_deepPosition; } | 92 Position deepEquivalent() const { return m_deepPosition; } |
| 93 Position toParentAnchoredPosition() const { return deepEquivalent().parentAn
choredEquivalent(); } | 93 Position toParentAnchoredPosition() const { return deepEquivalent().parentAn
choredEquivalent(); } |
| 94 PositionWithAffinity toPositionWithAffinity() const { return PositionWithAff
inity(m_deepPosition, m_affinity); } | 94 PositionWithAffinity toPositionWithAffinity() const { return PositionWithAff
inity(m_deepPosition, m_affinity); } |
| 95 TextAffinity affinity() const { return m_affinity; } | 95 TextAffinity affinity() const { return m_affinity; } |
| 96 | 96 |
| 97 // next() and previous() will increment/decrement by a character cluster. | 97 // next() and previous() will increment/decrement by a character cluster. |
| 98 VisiblePosition next(EditingBoundaryCrossingRule = CanCrossEditingBoundary)
const; | |
| 99 VisiblePosition honorEditingBoundaryAtOrBefore(const VisiblePosition&) const
; | 98 VisiblePosition honorEditingBoundaryAtOrBefore(const VisiblePosition&) const
; |
| 100 VisiblePosition honorEditingBoundaryAtOrAfter(const VisiblePosition&) const; | 99 VisiblePosition honorEditingBoundaryAtOrAfter(const VisiblePosition&) const; |
| 101 VisiblePosition skipToStartOfEditingBoundary(const VisiblePosition&) const; | 100 VisiblePosition skipToStartOfEditingBoundary(const VisiblePosition&) const; |
| 102 VisiblePosition skipToEndOfEditingBoundary(const VisiblePosition&) const; | 101 VisiblePosition skipToEndOfEditingBoundary(const VisiblePosition&) const; |
| 103 | 102 |
| 104 VisiblePosition left() const; | 103 VisiblePosition left() const; |
| 105 VisiblePosition right() const; | 104 VisiblePosition right() const; |
| 106 | 105 |
| 107 UChar32 characterAfter() const; | 106 UChar32 characterAfter() const; |
| 108 UChar32 characterBefore() const; | 107 UChar32 characterBefore() const; |
| (...skipping 28 matching lines...) Expand all Loading... |
| 137 TextAffinity m_affinity; | 136 TextAffinity m_affinity; |
| 138 }; | 137 }; |
| 139 | 138 |
| 140 EphemeralRange makeRange(const VisiblePosition&, const VisiblePosition&); | 139 EphemeralRange makeRange(const VisiblePosition&, const VisiblePosition&); |
| 141 | 140 |
| 142 CORE_EXPORT Position canonicalPositionOf(const Position&); | 141 CORE_EXPORT Position canonicalPositionOf(const Position&); |
| 143 CORE_EXPORT PositionInComposedTree canonicalPositionOf(const PositionInComposedT
ree&); | 142 CORE_EXPORT PositionInComposedTree canonicalPositionOf(const PositionInComposedT
ree&); |
| 144 PositionWithAffinity honorEditingBoundaryAtOrBeforeOf(const PositionWithAffinity
&, const Position& anchor); | 143 PositionWithAffinity honorEditingBoundaryAtOrBeforeOf(const PositionWithAffinity
&, const Position& anchor); |
| 145 PositionInComposedTreeWithAffinity honorEditingBoundaryAtOrBeforeOf(const Positi
onInComposedTreeWithAffinity&, const PositionInComposedTree& anchor); | 144 PositionInComposedTreeWithAffinity honorEditingBoundaryAtOrBeforeOf(const Positi
onInComposedTreeWithAffinity&, const PositionInComposedTree& anchor); |
| 146 | 145 |
| 146 // TODO(yosin) We should move |nextPositionOf()| to "VisibleUnits.cpp". |
| 147 VisiblePosition nextPositionOf(const VisiblePosition&, EditingBoundaryCrossingRu
le = CanCrossEditingBoundary); |
| 147 // TODO(yosin) We should move |previousPositionOf()| to "VisibleUnits.cpp" | 148 // TODO(yosin) We should move |previousPositionOf()| to "VisibleUnits.cpp" |
| 148 VisiblePosition previousPositionOf(const VisiblePosition&, EditingBoundaryCrossi
ngRule = CanCrossEditingBoundary); | 149 VisiblePosition previousPositionOf(const VisiblePosition&, EditingBoundaryCrossi
ngRule = CanCrossEditingBoundary); |
| 149 | 150 |
| 150 } // namespace blink | 151 } // namespace blink |
| 151 | 152 |
| 152 #ifndef NDEBUG | 153 #ifndef NDEBUG |
| 153 // Outside the WebCore namespace for ease of invocation from gdb. | 154 // Outside the WebCore namespace for ease of invocation from gdb. |
| 154 void showTree(const blink::VisiblePosition*); | 155 void showTree(const blink::VisiblePosition*); |
| 155 void showTree(const blink::VisiblePosition&); | 156 void showTree(const blink::VisiblePosition&); |
| 156 #endif | 157 #endif |
| 157 | 158 |
| 158 #endif // VisiblePosition_h | 159 #endif // VisiblePosition_h |
| OLD | NEW |