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/SpellCheckMarkerList.h" |
| 6 |
| 7 #include <algorithm> |
| 8 |
| 9 namespace blink { |
| 10 |
| 11 SpellCheckMarkerList::SpellCheckMarkerList(DocumentMarker::MarkerType type) |
| 12 : m_type(type) {} |
| 13 |
| 14 DocumentMarker::MarkerType SpellCheckMarkerList::allowedMarkerType() const { |
| 15 return m_type; |
| 16 } |
| 17 |
| 18 bool SpellCheckMarkerList::isSpellCheckMarkerList() const { |
| 19 return true; |
| 20 } |
| 21 |
| 22 void SpellCheckMarkerList::add(DocumentMarker* marker) { |
| 23 DCHECK_EQ(marker->type(), allowedMarkerType()) |
| 24 << "Marker of type " << marker->type() << " added; should be of type " |
| 25 << allowedMarkerType(); |
| 26 // Optimize case where (non-merging) markers are being added in order so we |
| 27 // can add n markers in O(n) time instead of O(n log n) |
| 28 if (m_markers.isEmpty() || |
| 29 m_markers.back()->endOffset() < marker->startOffset()) { |
| 30 m_markers.push_back(marker); |
| 31 return; |
| 32 } |
| 33 |
| 34 const auto& firstOverlappingIt = std::lower_bound( |
| 35 m_markers.begin(), m_markers.end(), marker, |
| 36 [](const Member<DocumentMarker>& lhv, const DocumentMarker* rhv) { |
| 37 return lhv->endOffset() < rhv->startOffset(); |
| 38 }); |
| 39 |
| 40 size_t index = firstOverlappingIt - m_markers.begin(); |
| 41 m_markers.insert(index, marker); |
| 42 const auto& insertedIt = m_markers.begin() + index; |
| 43 |
| 44 unsigned newStart = marker->startOffset(); |
| 45 unsigned newEnd = marker->endOffset(); |
| 46 |
| 47 iterator it; |
| 48 for (it = insertedIt + 1; |
| 49 it != m_markers.end() && (*it)->startOffset() <= newEnd; ++it) { |
| 50 newStart = std::min(newStart, (*it)->startOffset()); |
| 51 newEnd = std::max(newEnd, (*it)->endOffset()); |
| 52 } |
| 53 m_markers.erase(index + 1, it - (insertedIt + 1)); |
| 54 |
| 55 (*insertedIt)->setStartOffset(newStart); |
| 56 (*insertedIt)->setEndOffset(newEnd); |
| 57 } |
| 58 |
| 59 void SpellCheckMarkerList::removeMarkersForWords(const String& nodeText, |
| 60 const Vector<String>& words) { |
| 61 // Build a second vector and swap with m_markers to avoid O(n^2) performance |
| 62 HeapVector<Member<DocumentMarker>> newMarkerList; |
| 63 |
| 64 std::copy_if(m_markers.begin(), m_markers.end(), |
| 65 std::back_inserter(newMarkerList), |
| 66 [&nodeText, &words](Member<DocumentMarker> marker) { |
| 67 unsigned start = marker->startOffset(); |
| 68 unsigned length = marker->endOffset() - marker->startOffset(); |
| 69 const String& markerText = nodeText.substring(start, length); |
| 70 |
| 71 return !words.contains(markerText); |
| 72 }); |
| 73 |
| 74 std::swap(m_markers, newMarkerList); |
| 75 } |
| 76 |
| 77 } // namespace blink |
OLD | NEW |