Lines Matching refs:markers
119 // Rendered rects for markers in WebKit are not populated until each time
120 // the markers are painted. However, we need it to happen sooner, because
124 WillBeHeapVector<DocumentMarker*> markers = markersFor(node);
125 toRenderedDocumentMarker(markers[markers.size() - 1])->setRenderedRect(range->boundingBox());
179 // Markers are stored in order sorted by their start offset.
180 // Markers of the same type do not overlap each other.
190 OwnPtrWillBeMember<MarkerLists>& markers = m_markers.add(node, nullptr).storedValue->value;
191 if (!markers) {
192 markers = adoptPtrWillBeNoop(new MarkerLists);
193 markers->grow(DocumentMarker::MarkerTypeIndexesCount);
197 if (!markers->at(markerListIndex)) {
198 markers->insert(markerListIndex, adoptPtrWillBeNoop(new MarkerList));
201 OwnPtrWillBeMember<MarkerList>& list = markers->at(markerListIndex);
233 // copies markers from srcNode to dstNode, applying the specified shift delta to the copies. The shift is
244 MarkerLists* markers = m_markers.get(srcNode);
245 if (!markers)
250 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
289 MarkerLists* markers = m_markers.get(node);
290 if (!markers)
296 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
310 // markers are returned in order, so stop if we are now past the specified range
367 // outer loop: process each node that contains any markers
371 MarkerLists* markers = nodeIterator->value.get();
372 OwnPtrWillBeMember<MarkerList>& list = (*markers)[MarkerTypeToMarkerIndex(markerType)];
389 MarkerLists* markers = m_markers.get(node);
390 if (!markers)
394 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
406 WillBeHeapVector<DocumentMarker*> DocumentMarkerController::markers()
410 MarkerLists* markers = i->value.get();
412 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
435 WillBeHeapVector<DocumentMarker*> markers = markersFor(node);
436 WillBeHeapVector<DocumentMarker*>::const_iterator end = markers.end();
437 for (WillBeHeapVector<DocumentMarker*>::const_iterator it = markers.begin(); it != end; ++it) {
463 MarkerLists* markers = nodeIterator->value.get();
465 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
526 MarkerLists* markers = iterator->value.get();
529 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
571 MarkerLists* markers = i->value.get();
573 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
593 MarkerLists* markers = i->value.get();
595 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
608 MarkerLists* markers = m_markers.get(node);
609 if (!markers)
614 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
653 MarkerLists* markers = m_markers.get(node);
654 if (!markers)
658 OwnPtrWillBeMember<MarkerList>& list = (*markers)[MarkerTypeToMarkerIndex(DocumentMarker::TextMatch)];
664 // Markers are returned in order, so stop if we are now past the specified range.
690 WillBeHeapVector<DocumentMarker*> markers = markersFor(node);
691 WillBeHeapVector<DocumentMarker*>::const_iterator end = markers.end();
692 for (WillBeHeapVector<DocumentMarker*>::const_iterator it = markers.begin(); it != end; ++it) {
709 fprintf(stderr, "%d nodes have markers:\n", m_markers.size());
714 MarkerLists* markers = m_markers.get(node);
716 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex];
