OLD | NEW |
(Empty) | |
| 1 // Copyright 2017 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #include "core/editing/markers/TextMatchMarkerList.h" |
| 6 |
| 7 #include "core/editing/markers/DocumentMarkerController.h" |
| 8 #include "core/editing/markers/RenderedTextMatchMarker.h" |
| 9 |
| 10 namespace blink { |
| 11 |
| 12 TextMatchMarkerList::TextMatchMarkerList( |
| 13 DocumentMarkerController* documentMarkerController) |
| 14 : DocumentMarkerList(documentMarkerController) {} |
| 15 |
| 16 DocumentMarker::MarkerType TextMatchMarkerList::allowedMarkerType() const { |
| 17 return DocumentMarker::TextMatch; |
| 18 } |
| 19 |
| 20 static bool doesNotInclude(const Member<DocumentMarker>& marker, |
| 21 size_t startOffset) { |
| 22 return marker->endOffset() < startOffset; |
| 23 } |
| 24 |
| 25 size_t TextMatchMarkerList::size() const { |
| 26 return m_markers.size(); |
| 27 } |
| 28 |
| 29 bool TextMatchMarkerList::empty() const { |
| 30 return m_markers.isEmpty(); |
| 31 } |
| 32 |
| 33 RenderedTextMatchMarker* TextMatchMarkerList::at(size_t index) { |
| 34 return m_markers[index].get()->asRenderedTextMatchMarker(); |
| 35 } |
| 36 |
| 37 void TextMatchMarkerList::clear() { |
| 38 m_markers.clear(); |
| 39 } |
| 40 |
| 41 DocumentMarkerList::iterator TextMatchMarkerList::begin() { |
| 42 return m_markers.begin(); |
| 43 } |
| 44 |
| 45 DocumentMarkerList::iterator TextMatchMarkerList::end() { |
| 46 return m_markers.end(); |
| 47 } |
| 48 |
| 49 DocumentMarkerList::const_iterator TextMatchMarkerList::begin() const { |
| 50 return m_markers.begin(); |
| 51 } |
| 52 |
| 53 DocumentMarkerList::const_iterator TextMatchMarkerList::end() const { |
| 54 return m_markers.end(); |
| 55 } |
| 56 |
| 57 void TextMatchMarkerList::appendMarkersToInputList( |
| 58 DocumentMarkerVector* list) const { |
| 59 for (Member<DocumentMarker> marker : m_markers) { |
| 60 list->push_back(marker); |
| 61 } |
| 62 } |
| 63 |
| 64 bool TextMatchMarkerList::copyMarkers(unsigned startOffset, |
| 65 int length, |
| 66 Node* dstNode, |
| 67 int delta) const { |
| 68 bool docDirty = false; |
| 69 unsigned endOffset = startOffset + length - 1; |
| 70 auto startPos = std::lower_bound(m_markers.begin(), m_markers.end(), |
| 71 startOffset, doesNotInclude); |
| 72 for (auto i = startPos; i != m_markers.end(); ++i) { |
| 73 DocumentMarker* marker = i->get(); |
| 74 |
| 75 // stop if we are now past the specified range |
| 76 if (marker->startOffset() > endOffset) |
| 77 break; |
| 78 |
| 79 // pin the marker to the specified range and apply the shift delta |
| 80 docDirty = true; |
| 81 if (marker->startOffset() < startOffset) |
| 82 marker->setStartOffset(startOffset); |
| 83 if (marker->endOffset() > endOffset) |
| 84 marker->setEndOffset(endOffset); |
| 85 marker->shiftOffsets(delta); |
| 86 |
| 87 m_documentMarkerController->addMarker(dstNode, marker); |
| 88 } |
| 89 |
| 90 return docDirty; |
| 91 } |
| 92 |
| 93 void TextMatchMarkerList::removeMarkers( |
| 94 unsigned startOffset, |
| 95 int length, |
| 96 bool shouldRemovePartiallyOverlappingMarkers, |
| 97 bool* didRemoveMarker) { |
| 98 unsigned endOffset = startOffset + length; |
| 99 |
| 100 HeapVector<Member<DocumentMarker>>::iterator startPos = |
| 101 std::upper_bound(m_markers.begin(), m_markers.end(), startOffset, |
| 102 DocumentMarkerList::endsBefore); |
| 103 for (auto it = startPos; it < m_markers.end(); ++it) { |
| 104 RenderedTextMatchMarker& marker = *(*it)->asRenderedTextMatchMarker(); |
| 105 |
| 106 if (marker.startOffset() >= endOffset) |
| 107 break; |
| 108 |
| 109 // pitch the old marker |
| 110 m_markers.remove(it - m_markers.begin()); |
| 111 *didRemoveMarker = true; |
| 112 |
| 113 if (shouldRemovePartiallyOverlappingMarkers) { |
| 114 // Stop here. Don't add resulting slices back. |
| 115 continue; |
| 116 } |
| 117 |
| 118 // add either of the resulting slices that are left after removing target |
| 119 if (startOffset > marker.startOffset()) { |
| 120 RenderedTextMatchMarker newLeft = marker; |
| 121 newLeft.setEndOffset(startOffset); |
| 122 size_t insertIndex = it - m_markers.begin(); |
| 123 m_markers.insert(insertIndex, RenderedTextMatchMarker::create(newLeft)); |
| 124 // Move to the marker after the inserted one. |
| 125 it = m_markers.begin() + insertIndex + 1; |
| 126 } |
| 127 if (marker.endOffset() > endOffset) { |
| 128 RenderedTextMatchMarker newRight = marker; |
| 129 newRight.setStartOffset(endOffset); |
| 130 size_t insertIndex = it - m_markers.begin(); |
| 131 m_markers.insert(insertIndex, RenderedTextMatchMarker::create(newRight)); |
| 132 // Move to the marker after the inserted one. |
| 133 it = m_markers.begin() + insertIndex + 1; |
| 134 } |
| 135 } |
| 136 } |
| 137 |
| 138 bool TextMatchMarkerList::shiftMarkers(unsigned offset, |
| 139 unsigned oldLength, |
| 140 unsigned newLength) { |
| 141 bool didShift = false; |
| 142 for (auto it = m_markers.begin(); it != m_markers.end(); ++it) { |
| 143 DocumentMarker& marker = **it; |
| 144 |
| 145 ShiftMarkerResult result = |
| 146 getShiftedMarkerPosition(marker, offset, oldLength, newLength); |
| 147 if (result.shouldRemoveMarker) { |
| 148 m_markers.remove(it - m_markers.begin()); |
| 149 --it; |
| 150 |
| 151 didShift = true; |
| 152 } else if (result.newStartOffset != marker.startOffset() || |
| 153 result.newEndOffset != marker.endOffset()) { |
| 154 marker.setStartOffset(result.newStartOffset); |
| 155 marker.setEndOffset(result.newEndOffset); |
| 156 |
| 157 didShift = true; |
| 158 } |
| 159 } |
| 160 |
| 161 return didShift; |
| 162 } |
| 163 |
| 164 void TextMatchMarkerList::push_back(TextMatchMarker* marker) { |
| 165 // TextMatch markers must be added in order |
| 166 DCHECK(marker->type() == DocumentMarker::TextMatch); |
| 167 DCHECK(m_markers.isEmpty() || |
| 168 marker->startOffset() >= m_markers.back()->endOffset()); |
| 169 m_markers.push_back(RenderedTextMatchMarker::create(*marker)); |
| 170 } |
| 171 |
| 172 bool TextMatchMarkerList::setTextMatchMarkersActive(unsigned startOffset, |
| 173 unsigned endOffset, |
| 174 bool active) { |
| 175 bool docDirty = false; |
| 176 |
| 177 HeapVector<Member<DocumentMarker>>::iterator startPos = std::upper_bound( |
| 178 m_markers.begin(), m_markers.end(), startOffset, endsBefore); |
| 179 for (auto it = startPos; it != m_markers.end(); ++it) { |
| 180 DocumentMarker& marker = **it; |
| 181 // Markers are stored in order, so stop if we are now past the specified |
| 182 // range. |
| 183 if (marker.startOffset() >= endOffset) |
| 184 break; |
| 185 |
| 186 marker.setActiveMatch(active); |
| 187 docDirty = true; |
| 188 } |
| 189 |
| 190 return docDirty; |
| 191 } |
| 192 |
| 193 DEFINE_TRACE(TextMatchMarkerList) { |
| 194 visitor->trace(m_markers); |
| 195 DocumentMarkerList::trace(visitor); |
| 196 } |
| 197 |
| 198 } // namespace blink |
OLD | NEW |