| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights |
| 3 * reserved. | 3 * reserved. |
| 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 1072 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1083 endOfFirstWordBoundaryContext(characters + offset, length - offset) == | 1083 endOfFirstWordBoundaryContext(characters + offset, length - offset) == |
| 1084 static_cast<int>(length - offset)) { | 1084 static_cast<int>(length - offset)) { |
| 1085 needMoreContext = true; | 1085 needMoreContext = true; |
| 1086 return length; | 1086 return length; |
| 1087 } | 1087 } |
| 1088 needMoreContext = false; | 1088 needMoreContext = false; |
| 1089 return findWordEndBoundary(characters, length, offset); | 1089 return findWordEndBoundary(characters, length, offset); |
| 1090 } | 1090 } |
| 1091 | 1091 |
| 1092 template <typename Strategy> | 1092 template <typename Strategy> |
| 1093 static VisiblePositionTemplate<Strategy> endOfWordAlgorithm( | 1093 static PositionTemplate<Strategy> endOfWordAlgorithm( |
| 1094 const VisiblePositionTemplate<Strategy>& c, | 1094 const VisiblePositionTemplate<Strategy>& c, |
| 1095 EWordSide side) { | 1095 EWordSide side) { |
| 1096 DCHECK(c.isValid()) << c; | 1096 DCHECK(c.isValid()) << c; |
| 1097 VisiblePositionTemplate<Strategy> p = c; | 1097 VisiblePositionTemplate<Strategy> p = c; |
| 1098 if (side == LeftWordIfOnBoundary) { | 1098 if (side == LeftWordIfOnBoundary) { |
| 1099 if (isStartOfParagraph(c)) | 1099 if (isStartOfParagraph(c)) |
| 1100 return c; | 1100 return c.deepEquivalent(); |
| 1101 | 1101 |
| 1102 p = previousPositionOf(c); | 1102 p = previousPositionOf(c); |
| 1103 if (p.isNull()) | 1103 if (p.isNull()) |
| 1104 return c; | 1104 return c.deepEquivalent(); |
| 1105 } else if (isEndOfParagraph(c)) { | 1105 } else if (isEndOfParagraph(c)) { |
| 1106 return c; | 1106 return c.deepEquivalent(); |
| 1107 } | 1107 } |
| 1108 | 1108 |
| 1109 return createVisiblePosition(nextBoundary(p, endWordBoundary), | 1109 return nextBoundary(p, endWordBoundary); |
| 1110 } |
| 1111 |
| 1112 Position endOfWordPosition(const VisiblePosition& position, EWordSide side) { |
| 1113 return endOfWordAlgorithm<EditingStrategy>(position, side); |
| 1114 } |
| 1115 |
| 1116 VisiblePosition endOfWord(const VisiblePosition& position, EWordSide side) { |
| 1117 return createVisiblePosition(endOfWordPosition(position, side), |
| 1110 VP_UPSTREAM_IF_POSSIBLE); | 1118 VP_UPSTREAM_IF_POSSIBLE); |
| 1111 } | 1119 } |
| 1112 | 1120 |
| 1113 VisiblePosition endOfWord(const VisiblePosition& c, EWordSide side) { | 1121 PositionInFlatTree endOfWordPosition(const VisiblePositionInFlatTree& position, |
| 1114 return endOfWordAlgorithm<EditingStrategy>(c, side); | 1122 EWordSide side) { |
| 1123 return endOfWordAlgorithm<EditingInFlatTreeStrategy>(position, side); |
| 1115 } | 1124 } |
| 1116 | 1125 |
| 1117 VisiblePositionInFlatTree endOfWord(const VisiblePositionInFlatTree& c, | 1126 VisiblePositionInFlatTree endOfWord(const VisiblePositionInFlatTree& position, |
| 1118 EWordSide side) { | 1127 EWordSide side) { |
| 1119 return endOfWordAlgorithm<EditingInFlatTreeStrategy>(c, side); | 1128 return createVisiblePosition(endOfWordPosition(position, side), |
| 1129 VP_UPSTREAM_IF_POSSIBLE); |
| 1120 } | 1130 } |
| 1121 | 1131 |
| 1122 static unsigned previousWordPositionBoundary( | 1132 static unsigned previousWordPositionBoundary( |
| 1123 const UChar* characters, | 1133 const UChar* characters, |
| 1124 unsigned length, | 1134 unsigned length, |
| 1125 unsigned offset, | 1135 unsigned offset, |
| 1126 BoundarySearchContextAvailability mayHaveMoreContext, | 1136 BoundarySearchContextAvailability mayHaveMoreContext, |
| 1127 bool& needMoreContext) { | 1137 bool& needMoreContext) { |
| 1128 if (mayHaveMoreContext && | 1138 if (mayHaveMoreContext && |
| 1129 !startOfLastWordBoundaryContext(characters, offset)) { | 1139 !startOfLastWordBoundaryContext(characters, offset)) { |
| (...skipping 2846 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3976 | 3986 |
| 3977 VisiblePositionInFlatTree previousPositionOf( | 3987 VisiblePositionInFlatTree previousPositionOf( |
| 3978 const VisiblePositionInFlatTree& visiblePosition, | 3988 const VisiblePositionInFlatTree& visiblePosition, |
| 3979 EditingBoundaryCrossingRule rule) { | 3989 EditingBoundaryCrossingRule rule) { |
| 3980 DCHECK(visiblePosition.isValid()) << visiblePosition; | 3990 DCHECK(visiblePosition.isValid()) << visiblePosition; |
| 3981 return previousPositionOfAlgorithm<EditingInFlatTreeStrategy>( | 3991 return previousPositionOfAlgorithm<EditingInFlatTreeStrategy>( |
| 3982 visiblePosition.deepEquivalent(), rule); | 3992 visiblePosition.deepEquivalent(), rule); |
| 3983 } | 3993 } |
| 3984 | 3994 |
| 3985 } // namespace blink | 3995 } // namespace blink |
| OLD | NEW |