Lines Matching refs:markers
85 // Markers are stored in order sorted by their start offset.
86 // Markers of the same type do not overlap each other.
104 Vector<DocumentMarker>& markers = vectorPair->first;
106 size_t numMarkers = markers.size();
109 // Iterate over all markers whose start offset is less than or equal to the new marker's.
113 DocumentMarker marker = markers[i];
118 markers.remove(i);
125 // Iterate over all markers whose end offset is less than or equal to the new marker's,
126 // removing markers of the same type as the new marker which touch it or intersect with it,
129 DocumentMarker marker = markers[j];
133 markers.remove(j);
144 markers.insert(i, newMarker);
153 // copies markers from srcNode to dstNode, applying the specified shift delta to the copies. The shift is
172 Vector<DocumentMarker>& markers = vectorPair->first;
173 for (size_t i = 0; i != markers.size(); ++i) {
174 DocumentMarker marker = markers[i];
214 Vector<DocumentMarker>& markers = vectorPair->first;
216 ASSERT(markers.size() == rects.size());
219 for (size_t i = 0; i < markers.size();) {
220 DocumentMarker marker = markers[i];
222 // markers are returned in order, so stop if we are now past the specified range
236 markers.remove(i);
247 markers.insert(i, newLeft);
255 markers.insert(i, newRight);
262 if (markers.isEmpty()) {
282 // outer loop: process each node that contains any markers
287 Vector<DocumentMarker>& markers = vectorPair->first;
289 ASSERT(markers.size() == rects.size());
290 unsigned markerCount = markers.size();
292 DocumentMarker& marker = markers[markerIndex];
334 Vector<DocumentMarker> markers = markersForNode(node);
335 Vector<DocumentMarker>::const_iterator end = markers.end();
336 for (Vector<DocumentMarker>::const_iterator it = markers.begin(); it != end; ++it) {
362 Vector<DocumentMarker>& markers = vectorPair->first;
364 ASSERT(markers.size() == rects.size());
365 unsigned markerCount = markers.size();
367 DocumentMarker marker = markers[markerIndex];
424 Vector<DocumentMarker>& markers = vectorPair->first;
426 ASSERT(markers.size() == rects.size());
427 for (size_t i = 0; i != markers.size();) {
428 DocumentMarker marker = markers[i];
437 markers.remove(i);
452 if (markers.isEmpty()) {
475 Vector<DocumentMarker>& markers = vectorPair->first;
477 for (size_t i = 0; i != markers.size(); ++i) {
478 DocumentMarker marker = markers[i];
504 Vector<DocumentMarker>& markers = vectorPair->first;
505 ASSERT(markers.size() == vectorPair->second.size());
506 unsigned markerCount = markers.size();
508 DocumentMarker m = markers[markerIndex];
545 Vector<DocumentMarker>& markers = vectorPair->first;
547 ASSERT(markers.size() == rects.size());
550 for (size_t i = 0; i != markers.size(); ++i) {
551 DocumentMarker& marker = markers[i];
592 Vector<DocumentMarker>& markers = vectorPair->first;
593 ASSERT(markers.size() == vectorPair->second.size());
596 for (size_t i = 0; i != markers.size(); ++i) {
597 DocumentMarker& marker = markers[i];
599 // Markers are returned in order, so stop if we are now past the specified range.
629 Vector<DocumentMarker> markers = markersForNode(node);
630 Vector<DocumentMarker>::const_iterator end = markers.end();
631 for (Vector<DocumentMarker>::const_iterator it = markers.begin(); it != end; ++it) {
661 Vector<DocumentMarker>& markers = vectorPair->first;
662 for (size_t i = 0; i < markers.size(); ++i) {
663 DocumentMarker& marker = markers[i];
665 // markers are returned in order, so stop if we are now past the specified range
683 fprintf(stderr, "%d nodes have markers:\n", m_markers.size());
689 Vector<DocumentMarker>& markers = vectorPair->first;
690 unsigned markerCount = markers.size();
692 fprintf(stderr, " %d:[%d:%d](%d)", markers[markerIndex].type, markers[markerIndex].startOffset, markers[markerIndex].endOffset, markers[markerIndex].activeMatch);
