1use gpui::{AppContext, ModelHandle};
2use language::{Anchor, AnchorRangeExt, Buffer, HighlightId, Point, TextSummary, ToOffset};
3use parking_lot::Mutex;
4use std::{
5 cmp::{self, Ordering},
6 iter, mem,
7 ops::Range,
8 sync::atomic::{AtomicUsize, Ordering::SeqCst},
9};
10use sum_tree::{Bias, Cursor, FilterCursor, SumTree};
11
12pub trait ToFoldPoint {
13 fn to_fold_point(&self, snapshot: &Snapshot, bias: Bias) -> FoldPoint;
14}
15
16#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
17pub struct FoldPoint(pub super::Point);
18
19impl FoldPoint {
20 pub fn new(row: u32, column: u32) -> Self {
21 Self(super::Point::new(row, column))
22 }
23
24 pub fn row(self) -> u32 {
25 self.0.row
26 }
27
28 pub fn column(self) -> u32 {
29 self.0.column
30 }
31
32 pub fn row_mut(&mut self) -> &mut u32 {
33 &mut self.0.row
34 }
35
36 #[cfg(test)]
37 pub fn column_mut(&mut self) -> &mut u32 {
38 &mut self.0.column
39 }
40
41 pub fn to_buffer_point(&self, snapshot: &Snapshot) -> Point {
42 let mut cursor = snapshot.transforms.cursor::<(FoldPoint, Point)>();
43 cursor.seek(self, Bias::Right, &());
44 let overshoot = self.0 - cursor.start().0 .0;
45 cursor.start().1 + overshoot
46 }
47
48 pub fn to_buffer_offset(&self, snapshot: &Snapshot) -> usize {
49 let mut cursor = snapshot.transforms.cursor::<(FoldPoint, Point)>();
50 cursor.seek(self, Bias::Right, &());
51 let overshoot = self.0 - cursor.start().0 .0;
52 snapshot
53 .buffer_snapshot
54 .to_offset(cursor.start().1 + overshoot)
55 }
56
57 pub fn to_offset(&self, snapshot: &Snapshot) -> FoldOffset {
58 let mut cursor = snapshot
59 .transforms
60 .cursor::<(FoldPoint, TransformSummary)>();
61 cursor.seek(self, Bias::Right, &());
62 let overshoot = self.0 - cursor.start().1.output.lines;
63 let mut offset = cursor.start().1.output.bytes;
64 if !overshoot.is_zero() {
65 let transform = cursor.item().expect("display point out of range");
66 assert!(transform.output_text.is_none());
67 let end_buffer_offset = snapshot
68 .buffer_snapshot
69 .to_offset(cursor.start().1.input.lines + overshoot);
70 offset += end_buffer_offset - cursor.start().1.input.bytes;
71 }
72 FoldOffset(offset)
73 }
74}
75
76impl ToFoldPoint for Point {
77 fn to_fold_point(&self, snapshot: &Snapshot, bias: Bias) -> FoldPoint {
78 let mut cursor = snapshot.transforms.cursor::<(Point, FoldPoint)>();
79 cursor.seek(self, Bias::Right, &());
80 if cursor.item().map_or(false, |t| t.is_fold()) {
81 if bias == Bias::Left || *self == cursor.start().0 {
82 cursor.start().1
83 } else {
84 cursor.end(&()).1
85 }
86 } else {
87 let overshoot = *self - cursor.start().0;
88 FoldPoint(cmp::min(
89 cursor.start().1 .0 + overshoot,
90 cursor.end(&()).1 .0,
91 ))
92 }
93 }
94}
95
96pub struct FoldMapWriter<'a>(&'a mut FoldMap);
97
98impl<'a> FoldMapWriter<'a> {
99 pub fn fold<T: ToOffset>(
100 &mut self,
101 ranges: impl IntoIterator<Item = Range<T>>,
102 cx: &AppContext,
103 ) -> (Snapshot, Vec<FoldEdit>) {
104 let mut edits = Vec::new();
105 let mut folds = Vec::new();
106 let buffer = self.0.buffer.read(cx).snapshot();
107 for range in ranges.into_iter() {
108 let range = range.start.to_offset(&buffer)..range.end.to_offset(&buffer);
109 if range.start != range.end {
110 let fold = Fold(buffer.anchor_after(range.start)..buffer.anchor_before(range.end));
111 folds.push(fold);
112 edits.push(buffer::Edit {
113 old_bytes: range.clone(),
114 new_bytes: range.clone(),
115 ..Default::default()
116 });
117 }
118 }
119
120 folds.sort_unstable_by(|a, b| sum_tree::SeekTarget::cmp(a, b, &buffer));
121
122 self.0.folds = {
123 let mut new_tree = SumTree::new();
124 let mut cursor = self.0.folds.cursor::<Fold>();
125 for fold in folds {
126 new_tree.push_tree(cursor.slice(&fold, Bias::Right, &buffer), &buffer);
127 new_tree.push(fold, &buffer);
128 }
129 new_tree.push_tree(cursor.suffix(&buffer), &buffer);
130 new_tree
131 };
132
133 consolidate_buffer_edits(&mut edits);
134 let edits = self.0.apply_edits(edits, cx);
135 let snapshot = Snapshot {
136 transforms: self.0.transforms.lock().clone(),
137 folds: self.0.folds.clone(),
138 buffer_snapshot: self.0.buffer.read(cx).snapshot(),
139 version: self.0.version.load(SeqCst),
140 };
141 (snapshot, edits)
142 }
143
144 pub fn unfold<T: ToOffset>(
145 &mut self,
146 ranges: impl IntoIterator<Item = Range<T>>,
147 cx: &AppContext,
148 ) -> (Snapshot, Vec<FoldEdit>) {
149 let mut edits = Vec::new();
150 let mut fold_ixs_to_delete = Vec::new();
151 let buffer = self.0.buffer.read(cx).snapshot();
152 for range in ranges.into_iter() {
153 // Remove intersecting folds and add their ranges to edits that are passed to apply_edits.
154 let mut folds_cursor = intersecting_folds(&buffer, &self.0.folds, range, true);
155 while let Some(fold) = folds_cursor.item() {
156 let offset_range = fold.0.start.to_offset(&buffer)..fold.0.end.to_offset(&buffer);
157 edits.push(buffer::Edit {
158 old_bytes: offset_range.clone(),
159 new_bytes: offset_range,
160 ..Default::default()
161 });
162 fold_ixs_to_delete.push(*folds_cursor.start());
163 folds_cursor.next(&buffer);
164 }
165 }
166
167 fold_ixs_to_delete.sort_unstable();
168 fold_ixs_to_delete.dedup();
169
170 self.0.folds = {
171 let mut cursor = self.0.folds.cursor::<usize>();
172 let mut folds = SumTree::new();
173 for fold_ix in fold_ixs_to_delete {
174 folds.push_tree(cursor.slice(&fold_ix, Bias::Right, &buffer), &buffer);
175 cursor.next(&buffer);
176 }
177 folds.push_tree(cursor.suffix(&buffer), &buffer);
178 folds
179 };
180
181 consolidate_buffer_edits(&mut edits);
182 let edits = self.0.apply_edits(edits, cx);
183 let snapshot = Snapshot {
184 transforms: self.0.transforms.lock().clone(),
185 folds: self.0.folds.clone(),
186 buffer_snapshot: self.0.buffer.read(cx).snapshot(),
187 version: self.0.version.load(SeqCst),
188 };
189 (snapshot, edits)
190 }
191}
192
193pub struct FoldMap {
194 buffer: ModelHandle<Buffer>,
195 transforms: Mutex<SumTree<Transform>>,
196 folds: SumTree<Fold>,
197 last_sync: Mutex<SyncState>,
198 version: AtomicUsize,
199}
200
201#[derive(Clone)]
202struct SyncState {
203 version: clock::Global,
204 parse_count: usize,
205}
206
207impl FoldMap {
208 pub fn new(buffer_handle: ModelHandle<Buffer>, cx: &AppContext) -> (Self, Snapshot) {
209 let buffer = buffer_handle.read(cx);
210 let this = Self {
211 buffer: buffer_handle,
212 folds: Default::default(),
213 transforms: Mutex::new(SumTree::from_item(
214 Transform {
215 summary: TransformSummary {
216 input: buffer.text_summary(),
217 output: buffer.text_summary(),
218 },
219 output_text: None,
220 },
221 &(),
222 )),
223 last_sync: Mutex::new(SyncState {
224 version: buffer.version(),
225 parse_count: buffer.parse_count(),
226 }),
227 version: AtomicUsize::new(0),
228 };
229 let (snapshot, _) = this.read(cx);
230 (this, snapshot)
231 }
232
233 pub fn read(&self, cx: &AppContext) -> (Snapshot, Vec<FoldEdit>) {
234 let edits = self.sync(cx);
235 self.check_invariants(cx);
236 let snapshot = Snapshot {
237 transforms: self.transforms.lock().clone(),
238 folds: self.folds.clone(),
239 buffer_snapshot: self.buffer.read(cx).snapshot(),
240 version: self.version.load(SeqCst),
241 };
242 (snapshot, edits)
243 }
244
245 pub fn write(&mut self, cx: &AppContext) -> (FoldMapWriter, Snapshot, Vec<FoldEdit>) {
246 let (snapshot, edits) = self.read(cx);
247 (FoldMapWriter(self), snapshot, edits)
248 }
249
250 fn sync(&self, cx: &AppContext) -> Vec<FoldEdit> {
251 let buffer = self.buffer.read(cx);
252 let last_sync = mem::replace(
253 &mut *self.last_sync.lock(),
254 SyncState {
255 version: buffer.version(),
256 parse_count: buffer.parse_count(),
257 },
258 );
259 let edits = buffer
260 .edits_since(last_sync.version)
261 .map(Into::into)
262 .collect::<Vec<_>>();
263 if edits.is_empty() {
264 if last_sync.parse_count != buffer.parse_count() {
265 self.version.fetch_add(1, SeqCst);
266 }
267 Vec::new()
268 } else {
269 self.apply_edits(edits, cx)
270 }
271 }
272
273 fn check_invariants(&self, cx: &AppContext) {
274 if cfg!(test) {
275 let buffer = self.buffer.read(cx);
276 assert_eq!(
277 self.transforms.lock().summary().input.bytes,
278 buffer.len(),
279 "transform tree does not match buffer's length"
280 );
281 }
282 }
283
284 fn apply_edits(&self, buffer_edits: Vec<buffer::Edit>, cx: &AppContext) -> Vec<FoldEdit> {
285 let buffer = self.buffer.read(cx).snapshot();
286 let mut buffer_edits_iter = buffer_edits.iter().cloned().peekable();
287
288 let mut new_transforms = SumTree::new();
289 let mut transforms = self.transforms.lock();
290 let mut cursor = transforms.cursor::<usize>();
291 cursor.seek(&0, Bias::Right, &());
292
293 while let Some(mut edit) = buffer_edits_iter.next() {
294 new_transforms.push_tree(cursor.slice(&edit.old_bytes.start, Bias::Left, &()), &());
295 edit.new_bytes.start -= edit.old_bytes.start - cursor.start();
296 edit.old_bytes.start = *cursor.start();
297
298 cursor.seek(&edit.old_bytes.end, Bias::Right, &());
299 cursor.next(&());
300
301 let mut delta = edit.delta();
302 loop {
303 edit.old_bytes.end = *cursor.start();
304
305 if let Some(next_edit) = buffer_edits_iter.peek() {
306 if next_edit.old_bytes.start > edit.old_bytes.end {
307 break;
308 }
309
310 let next_edit = buffer_edits_iter.next().unwrap();
311 delta += next_edit.delta();
312
313 if next_edit.old_bytes.end >= edit.old_bytes.end {
314 edit.old_bytes.end = next_edit.old_bytes.end;
315 cursor.seek(&edit.old_bytes.end, Bias::Right, &());
316 cursor.next(&());
317 }
318 } else {
319 break;
320 }
321 }
322
323 edit.new_bytes.end =
324 ((edit.new_bytes.start + edit.deleted_bytes()) as isize + delta) as usize;
325
326 let anchor = buffer.anchor_before(edit.new_bytes.start);
327 let mut folds_cursor = self.folds.cursor::<Fold>();
328 folds_cursor.seek(&Fold(anchor..Anchor::max()), Bias::Left, &buffer);
329
330 let mut folds = iter::from_fn({
331 let buffer = &buffer;
332 move || {
333 let item = folds_cursor
334 .item()
335 .map(|f| f.0.start.to_offset(buffer)..f.0.end.to_offset(buffer));
336 folds_cursor.next(buffer);
337 item
338 }
339 })
340 .peekable();
341
342 while folds
343 .peek()
344 .map_or(false, |fold| fold.start < edit.new_bytes.end)
345 {
346 let mut fold = folds.next().unwrap();
347 let sum = new_transforms.summary();
348
349 assert!(fold.start >= sum.input.bytes);
350
351 while folds
352 .peek()
353 .map_or(false, |next_fold| next_fold.start <= fold.end)
354 {
355 let next_fold = folds.next().unwrap();
356 if next_fold.end > fold.end {
357 fold.end = next_fold.end;
358 }
359 }
360
361 if fold.start > sum.input.bytes {
362 let text_summary = buffer.text_summary_for_range(sum.input.bytes..fold.start);
363 new_transforms.push(
364 Transform {
365 summary: TransformSummary {
366 output: text_summary.clone(),
367 input: text_summary,
368 },
369 output_text: None,
370 },
371 &(),
372 );
373 }
374
375 if fold.end > fold.start {
376 let output_text = "…";
377 let chars = output_text.chars().count() as u32;
378 let lines = super::Point::new(0, output_text.len() as u32);
379 new_transforms.push(
380 Transform {
381 summary: TransformSummary {
382 output: TextSummary {
383 bytes: output_text.len(),
384 lines,
385 first_line_chars: chars,
386 last_line_chars: chars,
387 longest_row: 0,
388 longest_row_chars: chars,
389 },
390 input: buffer.text_summary_for_range(fold.start..fold.end),
391 },
392 output_text: Some(output_text),
393 },
394 &(),
395 );
396 }
397 }
398
399 let sum = new_transforms.summary();
400 if sum.input.bytes < edit.new_bytes.end {
401 let text_summary =
402 buffer.text_summary_for_range(sum.input.bytes..edit.new_bytes.end);
403 new_transforms.push(
404 Transform {
405 summary: TransformSummary {
406 output: text_summary.clone(),
407 input: text_summary,
408 },
409 output_text: None,
410 },
411 &(),
412 );
413 }
414 }
415
416 new_transforms.push_tree(cursor.suffix(&()), &());
417 if new_transforms.is_empty() {
418 let text_summary = buffer.text_summary();
419 new_transforms.push(
420 Transform {
421 summary: TransformSummary {
422 output: text_summary.clone(),
423 input: text_summary,
424 },
425 output_text: None,
426 },
427 &(),
428 );
429 }
430
431 drop(cursor);
432
433 let mut fold_edits = Vec::with_capacity(buffer_edits.len());
434 {
435 let mut old_transforms = transforms.cursor::<(usize, FoldOffset)>();
436 let mut new_transforms = new_transforms.cursor::<(usize, FoldOffset)>();
437
438 for mut edit in buffer_edits {
439 old_transforms.seek(&edit.old_bytes.start, Bias::Left, &());
440 if old_transforms.item().map_or(false, |t| t.is_fold()) {
441 edit.old_bytes.start = old_transforms.start().0;
442 }
443 let old_start =
444 old_transforms.start().1 .0 + (edit.old_bytes.start - old_transforms.start().0);
445
446 old_transforms.seek_forward(&edit.old_bytes.end, Bias::Right, &());
447 if old_transforms.item().map_or(false, |t| t.is_fold()) {
448 old_transforms.next(&());
449 edit.old_bytes.end = old_transforms.start().0;
450 }
451 let old_end =
452 old_transforms.start().1 .0 + (edit.old_bytes.end - old_transforms.start().0);
453
454 new_transforms.seek(&edit.new_bytes.start, Bias::Left, &());
455 if new_transforms.item().map_or(false, |t| t.is_fold()) {
456 edit.new_bytes.start = new_transforms.start().0;
457 }
458 let new_start =
459 new_transforms.start().1 .0 + (edit.new_bytes.start - new_transforms.start().0);
460
461 new_transforms.seek_forward(&edit.new_bytes.end, Bias::Right, &());
462 if new_transforms.item().map_or(false, |t| t.is_fold()) {
463 new_transforms.next(&());
464 edit.new_bytes.end = new_transforms.start().0;
465 }
466 let new_end =
467 new_transforms.start().1 .0 + (edit.new_bytes.end - new_transforms.start().0);
468
469 fold_edits.push(FoldEdit {
470 old_bytes: FoldOffset(old_start)..FoldOffset(old_end),
471 new_bytes: FoldOffset(new_start)..FoldOffset(new_end),
472 });
473 }
474
475 consolidate_fold_edits(&mut fold_edits);
476 }
477
478 *transforms = new_transforms;
479 self.version.fetch_add(1, SeqCst);
480 fold_edits
481 }
482}
483
484#[derive(Clone)]
485pub struct Snapshot {
486 transforms: SumTree<Transform>,
487 folds: SumTree<Fold>,
488 buffer_snapshot: language::Snapshot,
489 pub version: usize,
490}
491
492impl Snapshot {
493 #[cfg(test)]
494 pub fn text(&self) -> String {
495 self.chunks_at(FoldOffset(0)).collect()
496 }
497
498 #[cfg(test)]
499 pub fn fold_count(&self) -> usize {
500 self.folds.items(&self.buffer_snapshot).len()
501 }
502
503 pub fn text_summary_for_range(&self, range: Range<FoldPoint>) -> TextSummary {
504 let mut summary = TextSummary::default();
505
506 let mut cursor = self.transforms.cursor::<(FoldPoint, Point)>();
507 cursor.seek(&range.start, Bias::Right, &());
508 if let Some(transform) = cursor.item() {
509 let start_in_transform = range.start.0 - cursor.start().0 .0;
510 let end_in_transform = cmp::min(range.end, cursor.end(&()).0).0 - cursor.start().0 .0;
511 if let Some(output_text) = transform.output_text {
512 summary = TextSummary::from(
513 &output_text
514 [start_in_transform.column as usize..end_in_transform.column as usize],
515 );
516 } else {
517 let buffer_start = cursor.start().1 + start_in_transform;
518 let buffer_end = cursor.start().1 + end_in_transform;
519 summary = self
520 .buffer_snapshot
521 .text_summary_for_range(buffer_start..buffer_end);
522 }
523 }
524
525 if range.end > cursor.end(&()).0 {
526 cursor.next(&());
527 summary += &cursor
528 .summary::<_, TransformSummary>(&range.end, Bias::Right, &())
529 .output;
530 if let Some(transform) = cursor.item() {
531 let end_in_transform = range.end.0 - cursor.start().0 .0;
532 if let Some(output_text) = transform.output_text {
533 summary += TextSummary::from(&output_text[..end_in_transform.column as usize]);
534 } else {
535 let buffer_start = cursor.start().1;
536 let buffer_end = cursor.start().1 + end_in_transform;
537 summary += self
538 .buffer_snapshot
539 .text_summary_for_range(buffer_start..buffer_end);
540 }
541 }
542 }
543
544 summary
545 }
546
547 #[cfg(test)]
548 pub fn len(&self) -> FoldOffset {
549 FoldOffset(self.transforms.summary().output.bytes)
550 }
551
552 #[cfg(test)]
553 pub fn line_len(&self, row: u32) -> u32 {
554 let line_start = FoldPoint::new(row, 0).to_offset(self).0;
555 let line_end = if row >= self.max_point().row() {
556 self.len().0
557 } else {
558 FoldPoint::new(row + 1, 0).to_offset(self).0 - 1
559 };
560 (line_end - line_start) as u32
561 }
562
563 pub fn buffer_rows(&self, start_row: u32) -> BufferRows {
564 if start_row > self.transforms.summary().output.lines.row {
565 panic!("invalid display row {}", start_row);
566 }
567
568 let fold_point = FoldPoint::new(start_row, 0);
569 let mut cursor = self.transforms.cursor();
570 cursor.seek(&fold_point, Bias::Left, &());
571 BufferRows { fold_point, cursor }
572 }
573
574 pub fn max_point(&self) -> FoldPoint {
575 FoldPoint(self.transforms.summary().output.lines)
576 }
577
578 #[cfg(test)]
579 pub fn longest_row(&self) -> u32 {
580 self.transforms.summary().output.longest_row
581 }
582
583 pub fn folds_in_range<'a, T>(
584 &'a self,
585 range: Range<T>,
586 ) -> impl Iterator<Item = &'a Range<Anchor>>
587 where
588 T: ToOffset,
589 {
590 let mut folds = intersecting_folds(&self.buffer_snapshot, &self.folds, range, false);
591 iter::from_fn(move || {
592 let item = folds.item().map(|f| &f.0);
593 folds.next(&self.buffer_snapshot);
594 item
595 })
596 }
597
598 pub fn intersects_fold<T>(&self, offset: T) -> bool
599 where
600 T: ToOffset,
601 {
602 let offset = offset.to_offset(&self.buffer_snapshot);
603 let mut cursor = self.transforms.cursor::<usize>();
604 cursor.seek(&offset, Bias::Right, &());
605 cursor.item().map_or(false, |t| t.output_text.is_some())
606 }
607
608 pub fn is_line_folded(&self, output_row: u32) -> bool {
609 let mut cursor = self.transforms.cursor::<FoldPoint>();
610 cursor.seek(&FoldPoint::new(output_row, 0), Bias::Right, &());
611 while let Some(transform) = cursor.item() {
612 if transform.output_text.is_some() {
613 return true;
614 }
615 if cursor.end(&()).row() == output_row {
616 cursor.next(&())
617 } else {
618 break;
619 }
620 }
621 false
622 }
623
624 pub fn chunks_at(&self, offset: FoldOffset) -> Chunks {
625 let mut transform_cursor = self.transforms.cursor::<(FoldOffset, usize)>();
626 transform_cursor.seek(&offset, Bias::Right, &());
627 let overshoot = offset.0 - transform_cursor.start().0 .0;
628 let buffer_offset = transform_cursor.start().1 + overshoot;
629 Chunks {
630 transform_cursor,
631 buffer_offset,
632 buffer_chunks: self
633 .buffer_snapshot
634 .text_for_range(buffer_offset..self.buffer_snapshot.len()),
635 }
636 }
637
638 pub fn highlighted_chunks(&mut self, range: Range<FoldOffset>) -> HighlightedChunks {
639 let mut transform_cursor = self.transforms.cursor::<(FoldOffset, usize)>();
640
641 transform_cursor.seek(&range.end, Bias::Right, &());
642 let overshoot = range.end.0 - transform_cursor.start().0 .0;
643 let buffer_end = transform_cursor.start().1 + overshoot;
644
645 transform_cursor.seek(&range.start, Bias::Right, &());
646 let overshoot = range.start.0 - transform_cursor.start().0 .0;
647 let buffer_start = transform_cursor.start().1 + overshoot;
648
649 HighlightedChunks {
650 transform_cursor,
651 buffer_offset: buffer_start,
652 buffer_chunks: self
653 .buffer_snapshot
654 .highlighted_text_for_range(buffer_start..buffer_end),
655 buffer_chunk: None,
656 }
657 }
658
659 pub fn chars_at<'a>(&'a self, point: FoldPoint) -> impl Iterator<Item = char> + 'a {
660 let offset = point.to_offset(self);
661 self.chunks_at(offset).flat_map(str::chars)
662 }
663
664 #[cfg(test)]
665 pub fn clip_offset(&self, offset: FoldOffset, bias: Bias) -> FoldOffset {
666 let mut cursor = self.transforms.cursor::<(FoldOffset, usize)>();
667 cursor.seek(&offset, Bias::Right, &());
668 if let Some(transform) = cursor.item() {
669 let transform_start = cursor.start().0 .0;
670 if transform.output_text.is_some() {
671 if offset.0 == transform_start || matches!(bias, Bias::Left) {
672 FoldOffset(transform_start)
673 } else {
674 FoldOffset(cursor.end(&()).0 .0)
675 }
676 } else {
677 let overshoot = offset.0 - transform_start;
678 let buffer_offset = cursor.start().1 + overshoot;
679 let clipped_buffer_offset = self.buffer_snapshot.clip_offset(buffer_offset, bias);
680 FoldOffset(
681 (offset.0 as isize + (clipped_buffer_offset as isize - buffer_offset as isize))
682 as usize,
683 )
684 }
685 } else {
686 FoldOffset(self.transforms.summary().output.bytes)
687 }
688 }
689
690 pub fn clip_point(&self, point: FoldPoint, bias: Bias) -> FoldPoint {
691 let mut cursor = self.transforms.cursor::<(FoldPoint, Point)>();
692 cursor.seek(&point, Bias::Right, &());
693 if let Some(transform) = cursor.item() {
694 let transform_start = cursor.start().0 .0;
695 if transform.output_text.is_some() {
696 if point.0 == transform_start || matches!(bias, Bias::Left) {
697 FoldPoint(transform_start)
698 } else {
699 FoldPoint(cursor.end(&()).0 .0)
700 }
701 } else {
702 let overshoot = point.0 - transform_start;
703 let buffer_position = cursor.start().1 + overshoot;
704 let clipped_buffer_position =
705 self.buffer_snapshot.clip_point(buffer_position, bias);
706 FoldPoint::new(
707 point.row(),
708 ((point.column() as i32) + clipped_buffer_position.column as i32
709 - buffer_position.column as i32) as u32,
710 )
711 }
712 } else {
713 FoldPoint(self.transforms.summary().output.lines)
714 }
715 }
716}
717
718fn intersecting_folds<'a, T>(
719 buffer: &'a buffer::Snapshot,
720 folds: &'a SumTree<Fold>,
721 range: Range<T>,
722 inclusive: bool,
723) -> FilterCursor<'a, impl 'a + Fn(&FoldSummary) -> bool, Fold, usize>
724where
725 T: ToOffset,
726{
727 let start = buffer.anchor_before(range.start.to_offset(buffer));
728 let end = buffer.anchor_after(range.end.to_offset(buffer));
729 folds.filter::<_, usize>(
730 move |summary| {
731 let start_cmp = start.cmp(&summary.max_end, buffer).unwrap();
732 let end_cmp = end.cmp(&summary.min_start, buffer).unwrap();
733
734 if inclusive {
735 start_cmp <= Ordering::Equal && end_cmp >= Ordering::Equal
736 } else {
737 start_cmp == Ordering::Less && end_cmp == Ordering::Greater
738 }
739 },
740 buffer,
741 )
742}
743
744fn consolidate_buffer_edits(edits: &mut Vec<buffer::Edit>) {
745 edits.sort_unstable_by(|a, b| {
746 a.old_bytes
747 .start
748 .cmp(&b.old_bytes.start)
749 .then_with(|| b.old_bytes.end.cmp(&a.old_bytes.end))
750 });
751
752 let mut i = 1;
753 while i < edits.len() {
754 let edit = edits[i].clone();
755 let prev_edit = &mut edits[i - 1];
756 if prev_edit.old_bytes.end >= edit.old_bytes.start {
757 prev_edit.old_bytes.end = prev_edit.old_bytes.end.max(edit.old_bytes.end);
758 prev_edit.new_bytes.start = prev_edit.new_bytes.start.min(edit.new_bytes.start);
759 prev_edit.new_bytes.end = prev_edit.new_bytes.end.max(edit.new_bytes.end);
760 edits.remove(i);
761 continue;
762 }
763 i += 1;
764 }
765}
766
767fn consolidate_fold_edits(edits: &mut Vec<FoldEdit>) {
768 edits.sort_unstable_by(|a, b| {
769 a.old_bytes
770 .start
771 .cmp(&b.old_bytes.start)
772 .then_with(|| b.old_bytes.end.cmp(&a.old_bytes.end))
773 });
774
775 let mut i = 1;
776 while i < edits.len() {
777 let edit = edits[i].clone();
778 let prev_edit = &mut edits[i - 1];
779 if prev_edit.old_bytes.end >= edit.old_bytes.start {
780 prev_edit.old_bytes.end = prev_edit.old_bytes.end.max(edit.old_bytes.end);
781 prev_edit.new_bytes.start = prev_edit.new_bytes.start.min(edit.new_bytes.start);
782 prev_edit.new_bytes.end = prev_edit.new_bytes.end.max(edit.new_bytes.end);
783 edits.remove(i);
784 continue;
785 }
786 i += 1;
787 }
788}
789
790#[derive(Clone, Debug, Default, Eq, PartialEq)]
791struct Transform {
792 summary: TransformSummary,
793 output_text: Option<&'static str>,
794}
795
796impl Transform {
797 fn is_fold(&self) -> bool {
798 self.output_text.is_some()
799 }
800}
801
802#[derive(Clone, Debug, Default, Eq, PartialEq)]
803struct TransformSummary {
804 output: TextSummary,
805 input: TextSummary,
806}
807
808impl sum_tree::Item for Transform {
809 type Summary = TransformSummary;
810
811 fn summary(&self) -> Self::Summary {
812 self.summary.clone()
813 }
814}
815
816impl sum_tree::Summary for TransformSummary {
817 type Context = ();
818
819 fn add_summary(&mut self, other: &Self, _: &()) {
820 self.input += &other.input;
821 self.output += &other.output;
822 }
823}
824
825#[derive(Clone, Debug)]
826struct Fold(Range<Anchor>);
827
828impl Default for Fold {
829 fn default() -> Self {
830 Self(Anchor::min()..Anchor::max())
831 }
832}
833
834impl sum_tree::Item for Fold {
835 type Summary = FoldSummary;
836
837 fn summary(&self) -> Self::Summary {
838 FoldSummary {
839 start: self.0.start.clone(),
840 end: self.0.end.clone(),
841 min_start: self.0.start.clone(),
842 max_end: self.0.end.clone(),
843 count: 1,
844 }
845 }
846}
847
848#[derive(Clone, Debug)]
849struct FoldSummary {
850 start: Anchor,
851 end: Anchor,
852 min_start: Anchor,
853 max_end: Anchor,
854 count: usize,
855}
856
857impl Default for FoldSummary {
858 fn default() -> Self {
859 Self {
860 start: Anchor::min(),
861 end: Anchor::max(),
862 min_start: Anchor::max(),
863 max_end: Anchor::min(),
864 count: 0,
865 }
866 }
867}
868
869impl sum_tree::Summary for FoldSummary {
870 type Context = buffer::Snapshot;
871
872 fn add_summary(&mut self, other: &Self, buffer: &buffer::Snapshot) {
873 if other.min_start.cmp(&self.min_start, buffer).unwrap() == Ordering::Less {
874 self.min_start = other.min_start.clone();
875 }
876 if other.max_end.cmp(&self.max_end, buffer).unwrap() == Ordering::Greater {
877 self.max_end = other.max_end.clone();
878 }
879
880 #[cfg(debug_assertions)]
881 {
882 let start_comparison = self.start.cmp(&other.start, buffer).unwrap();
883 assert!(start_comparison <= Ordering::Equal);
884 if start_comparison == Ordering::Equal {
885 assert!(self.end.cmp(&other.end, buffer).unwrap() >= Ordering::Equal);
886 }
887 }
888
889 self.start = other.start.clone();
890 self.end = other.end.clone();
891 self.count += other.count;
892 }
893}
894
895impl<'a> sum_tree::Dimension<'a, FoldSummary> for Fold {
896 fn add_summary(&mut self, summary: &'a FoldSummary, _: &buffer::Snapshot) {
897 self.0.start = summary.start.clone();
898 self.0.end = summary.end.clone();
899 }
900}
901
902impl<'a> sum_tree::SeekTarget<'a, FoldSummary, Fold> for Fold {
903 fn cmp(&self, other: &Self, buffer: &buffer::Snapshot) -> Ordering {
904 self.0.cmp(&other.0, buffer).unwrap()
905 }
906}
907
908impl<'a> sum_tree::Dimension<'a, FoldSummary> for usize {
909 fn add_summary(&mut self, summary: &'a FoldSummary, _: &buffer::Snapshot) {
910 *self += summary.count;
911 }
912}
913
914pub struct BufferRows<'a> {
915 cursor: Cursor<'a, Transform, (FoldPoint, Point)>,
916 fold_point: FoldPoint,
917}
918
919impl<'a> Iterator for BufferRows<'a> {
920 type Item = u32;
921
922 fn next(&mut self) -> Option<Self::Item> {
923 while self.fold_point > self.cursor.end(&()).0 {
924 self.cursor.next(&());
925 if self.cursor.item().is_none() {
926 // TODO: Return a bool from next?
927 break;
928 }
929 }
930
931 if self.cursor.item().is_some() {
932 let overshoot = self.fold_point.0 - self.cursor.start().0 .0;
933 let buffer_point = self.cursor.start().1 + overshoot;
934 *self.fold_point.row_mut() += 1;
935 Some(buffer_point.row)
936 } else {
937 None
938 }
939 }
940}
941
942pub struct Chunks<'a> {
943 transform_cursor: Cursor<'a, Transform, (FoldOffset, usize)>,
944 buffer_chunks: buffer::Chunks<'a>,
945 buffer_offset: usize,
946}
947
948impl<'a> Iterator for Chunks<'a> {
949 type Item = &'a str;
950
951 fn next(&mut self) -> Option<Self::Item> {
952 let transform = if let Some(item) = self.transform_cursor.item() {
953 item
954 } else {
955 return None;
956 };
957
958 // If we're in a fold, then return the fold's display text and
959 // advance the transform and buffer cursors to the end of the fold.
960 if let Some(output_text) = transform.output_text {
961 self.buffer_offset += transform.summary.input.bytes;
962 self.buffer_chunks.seek(self.buffer_offset);
963
964 while self.buffer_offset >= self.transform_cursor.end(&()).1
965 && self.transform_cursor.item().is_some()
966 {
967 self.transform_cursor.next(&());
968 }
969
970 return Some(output_text);
971 }
972
973 // Otherwise, take a chunk from the buffer's text.
974 if let Some(mut chunk) = self.buffer_chunks.peek() {
975 let offset_in_chunk = self.buffer_offset - self.buffer_chunks.offset();
976 chunk = &chunk[offset_in_chunk..];
977
978 // Truncate the chunk so that it ends at the next fold.
979 let region_end = self.transform_cursor.end(&()).1 - self.buffer_offset;
980 if chunk.len() >= region_end {
981 chunk = &chunk[0..region_end];
982 self.transform_cursor.next(&());
983 } else {
984 self.buffer_chunks.next();
985 }
986
987 self.buffer_offset += chunk.len();
988 return Some(chunk);
989 }
990
991 None
992 }
993}
994
995pub struct HighlightedChunks<'a> {
996 transform_cursor: Cursor<'a, Transform, (FoldOffset, usize)>,
997 buffer_chunks: language::HighlightedChunks<'a>,
998 buffer_chunk: Option<(usize, &'a str, HighlightId)>,
999 buffer_offset: usize,
1000}
1001
1002impl<'a> Iterator for HighlightedChunks<'a> {
1003 type Item = (&'a str, HighlightId);
1004
1005 fn next(&mut self) -> Option<Self::Item> {
1006 let transform = if let Some(item) = self.transform_cursor.item() {
1007 item
1008 } else {
1009 return None;
1010 };
1011
1012 // If we're in a fold, then return the fold's display text and
1013 // advance the transform and buffer cursors to the end of the fold.
1014 if let Some(output_text) = transform.output_text {
1015 self.buffer_chunk.take();
1016 self.buffer_offset += transform.summary.input.bytes;
1017 self.buffer_chunks.seek(self.buffer_offset);
1018
1019 while self.buffer_offset >= self.transform_cursor.end(&()).1
1020 && self.transform_cursor.item().is_some()
1021 {
1022 self.transform_cursor.next(&());
1023 }
1024
1025 return Some((output_text, HighlightId::default()));
1026 }
1027
1028 // Retrieve a chunk from the current location in the buffer.
1029 if self.buffer_chunk.is_none() {
1030 let chunk_offset = self.buffer_chunks.offset();
1031 self.buffer_chunk = self
1032 .buffer_chunks
1033 .next()
1034 .map(|(chunk, capture_ix)| (chunk_offset, chunk, capture_ix));
1035 }
1036
1037 // Otherwise, take a chunk from the buffer's text.
1038 if let Some((chunk_offset, mut chunk, capture_ix)) = self.buffer_chunk {
1039 let offset_in_chunk = self.buffer_offset - chunk_offset;
1040 chunk = &chunk[offset_in_chunk..];
1041
1042 // Truncate the chunk so that it ends at the next fold.
1043 let region_end = self.transform_cursor.end(&()).1 - self.buffer_offset;
1044 if chunk.len() >= region_end {
1045 chunk = &chunk[0..region_end];
1046 self.transform_cursor.next(&());
1047 } else {
1048 self.buffer_chunk.take();
1049 }
1050
1051 self.buffer_offset += chunk.len();
1052 return Some((chunk, capture_ix));
1053 }
1054
1055 None
1056 }
1057}
1058
1059impl<'a> sum_tree::Dimension<'a, TransformSummary> for FoldPoint {
1060 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
1061 self.0 += &summary.output.lines;
1062 }
1063}
1064
1065#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
1066pub struct FoldOffset(pub usize);
1067
1068impl FoldOffset {
1069 pub fn to_point(&self, snapshot: &Snapshot) -> FoldPoint {
1070 let mut cursor = snapshot
1071 .transforms
1072 .cursor::<(FoldOffset, TransformSummary)>();
1073 cursor.seek(self, Bias::Right, &());
1074 let overshoot = if cursor.item().map_or(true, |t| t.is_fold()) {
1075 Point::new(0, (self.0 - cursor.start().0 .0) as u32)
1076 } else {
1077 let buffer_offset = cursor.start().1.input.bytes + self.0 - cursor.start().0 .0;
1078 let buffer_point = snapshot.buffer_snapshot.to_point(buffer_offset);
1079 buffer_point - cursor.start().1.input.lines
1080 };
1081 FoldPoint(cursor.start().1.output.lines + overshoot)
1082 }
1083}
1084
1085impl<'a> sum_tree::Dimension<'a, TransformSummary> for FoldOffset {
1086 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
1087 self.0 += &summary.output.bytes;
1088 }
1089}
1090
1091impl<'a> sum_tree::Dimension<'a, TransformSummary> for Point {
1092 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
1093 *self += &summary.input.lines;
1094 }
1095}
1096
1097impl<'a> sum_tree::Dimension<'a, TransformSummary> for usize {
1098 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
1099 *self += &summary.input.bytes;
1100 }
1101}
1102
1103#[derive(Clone, Debug, PartialEq, Eq)]
1104pub struct FoldEdit {
1105 pub old_bytes: Range<FoldOffset>,
1106 pub new_bytes: Range<FoldOffset>,
1107}
1108
1109#[cfg(test)]
1110impl FoldEdit {
1111 pub fn delta(&self) -> isize {
1112 self.inserted_bytes() as isize - self.deleted_bytes() as isize
1113 }
1114
1115 pub fn deleted_bytes(&self) -> usize {
1116 self.old_bytes.end.0 - self.old_bytes.start.0
1117 }
1118
1119 pub fn inserted_bytes(&self) -> usize {
1120 self.new_bytes.end.0 - self.new_bytes.start.0
1121 }
1122}
1123
1124#[cfg(test)]
1125mod tests {
1126 use super::*;
1127 use crate::{test::sample_text, ToPoint};
1128 use buffer::RandomCharIter;
1129 use rand::prelude::*;
1130 use std::{env, mem};
1131 use Bias::{Left, Right};
1132
1133 #[gpui::test]
1134 fn test_basic_folds(cx: &mut gpui::MutableAppContext) {
1135 let buffer = cx.add_model(|cx| Buffer::new(0, sample_text(5, 6), cx));
1136 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1137
1138 let (mut writer, _, _) = map.write(cx.as_ref());
1139 let (snapshot2, edits) = writer.fold(
1140 vec![
1141 Point::new(0, 2)..Point::new(2, 2),
1142 Point::new(2, 4)..Point::new(4, 1),
1143 ],
1144 cx.as_ref(),
1145 );
1146 assert_eq!(snapshot2.text(), "aa…cc…eeeee");
1147 assert_eq!(
1148 edits,
1149 &[
1150 FoldEdit {
1151 old_bytes: FoldOffset(2)..FoldOffset(16),
1152 new_bytes: FoldOffset(2)..FoldOffset(5),
1153 },
1154 FoldEdit {
1155 old_bytes: FoldOffset(18)..FoldOffset(29),
1156 new_bytes: FoldOffset(7)..FoldOffset(10)
1157 },
1158 ]
1159 );
1160
1161 buffer.update(cx, |buffer, cx| {
1162 buffer.edit(
1163 vec![
1164 Point::new(0, 0)..Point::new(0, 1),
1165 Point::new(2, 3)..Point::new(2, 3),
1166 ],
1167 "123",
1168 cx,
1169 );
1170 });
1171 let (snapshot3, edits) = map.read(cx.as_ref());
1172 assert_eq!(snapshot3.text(), "123a…c123c…eeeee");
1173 assert_eq!(
1174 edits,
1175 &[
1176 FoldEdit {
1177 old_bytes: FoldOffset(0)..FoldOffset(1),
1178 new_bytes: FoldOffset(0)..FoldOffset(3),
1179 },
1180 FoldEdit {
1181 old_bytes: FoldOffset(6)..FoldOffset(6),
1182 new_bytes: FoldOffset(8)..FoldOffset(11),
1183 },
1184 ]
1185 );
1186
1187 buffer.update(cx, |buffer, cx| {
1188 buffer.edit(vec![Point::new(2, 6)..Point::new(4, 3)], "456", cx)
1189 });
1190 let (snapshot4, _) = map.read(cx.as_ref());
1191 assert_eq!(snapshot4.text(), "123a…c123456eee");
1192
1193 let (mut writer, _, _) = map.write(cx.as_ref());
1194 writer.unfold(Some(Point::new(0, 4)..Point::new(0, 5)), cx.as_ref());
1195 let (snapshot5, _) = map.read(cx.as_ref());
1196 assert_eq!(snapshot5.text(), "123aaaaa\nbbbbbb\nccc123456eee");
1197 }
1198
1199 #[gpui::test]
1200 fn test_adjacent_folds(cx: &mut gpui::MutableAppContext) {
1201 let buffer = cx.add_model(|cx| Buffer::new(0, "abcdefghijkl", cx));
1202
1203 {
1204 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1205
1206 let (mut writer, _, _) = map.write(cx.as_ref());
1207 writer.fold(vec![5..8], cx.as_ref());
1208 let (snapshot, _) = map.read(cx.as_ref());
1209 assert_eq!(snapshot.text(), "abcde…ijkl");
1210
1211 // Create an fold adjacent to the start of the first fold.
1212 let (mut writer, _, _) = map.write(cx.as_ref());
1213 writer.fold(vec![0..1, 2..5], cx.as_ref());
1214 let (snapshot, _) = map.read(cx.as_ref());
1215 assert_eq!(snapshot.text(), "…b…ijkl");
1216
1217 // Create an fold adjacent to the end of the first fold.
1218 let (mut writer, _, _) = map.write(cx.as_ref());
1219 writer.fold(vec![11..11, 8..10], cx.as_ref());
1220 let (snapshot, _) = map.read(cx.as_ref());
1221 assert_eq!(snapshot.text(), "…b…kl");
1222 }
1223
1224 {
1225 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1226
1227 // Create two adjacent folds.
1228 let (mut writer, _, _) = map.write(cx.as_ref());
1229 writer.fold(vec![0..2, 2..5], cx.as_ref());
1230 let (snapshot, _) = map.read(cx.as_ref());
1231 assert_eq!(snapshot.text(), "…fghijkl");
1232
1233 // Edit within one of the folds.
1234 buffer.update(cx, |buffer, cx| buffer.edit(vec![0..1], "12345", cx));
1235 let (snapshot, _) = map.read(cx.as_ref());
1236 assert_eq!(snapshot.text(), "12345…fghijkl");
1237 }
1238 }
1239
1240 #[gpui::test]
1241 fn test_overlapping_folds(cx: &mut gpui::MutableAppContext) {
1242 let buffer = cx.add_model(|cx| Buffer::new(0, sample_text(5, 6), cx));
1243 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1244 let (mut writer, _, _) = map.write(cx.as_ref());
1245 writer.fold(
1246 vec![
1247 Point::new(0, 2)..Point::new(2, 2),
1248 Point::new(0, 4)..Point::new(1, 0),
1249 Point::new(1, 2)..Point::new(3, 2),
1250 Point::new(3, 1)..Point::new(4, 1),
1251 ],
1252 cx.as_ref(),
1253 );
1254 let (snapshot, _) = map.read(cx.as_ref());
1255 assert_eq!(snapshot.text(), "aa…eeeee");
1256 }
1257
1258 #[gpui::test]
1259 fn test_merging_folds_via_edit(cx: &mut gpui::MutableAppContext) {
1260 let buffer = cx.add_model(|cx| Buffer::new(0, sample_text(5, 6), cx));
1261 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1262
1263 let (mut writer, _, _) = map.write(cx.as_ref());
1264 writer.fold(
1265 vec![
1266 Point::new(0, 2)..Point::new(2, 2),
1267 Point::new(3, 1)..Point::new(4, 1),
1268 ],
1269 cx.as_ref(),
1270 );
1271 let (snapshot, _) = map.read(cx.as_ref());
1272 assert_eq!(snapshot.text(), "aa…cccc\nd…eeeee");
1273
1274 buffer.update(cx, |buffer, cx| {
1275 buffer.edit(Some(Point::new(2, 2)..Point::new(3, 1)), "", cx)
1276 });
1277 let (snapshot, _) = map.read(cx.as_ref());
1278 assert_eq!(snapshot.text(), "aa…eeeee");
1279 }
1280
1281 #[gpui::test]
1282 fn test_folds_in_range(cx: &mut gpui::MutableAppContext) {
1283 let buffer = cx.add_model(|cx| Buffer::new(0, sample_text(5, 6), cx));
1284 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1285 let buffer = buffer.read(cx);
1286
1287 let (mut writer, _, _) = map.write(cx.as_ref());
1288 writer.fold(
1289 vec![
1290 Point::new(0, 2)..Point::new(2, 2),
1291 Point::new(0, 4)..Point::new(1, 0),
1292 Point::new(1, 2)..Point::new(3, 2),
1293 Point::new(3, 1)..Point::new(4, 1),
1294 ],
1295 cx.as_ref(),
1296 );
1297 let (snapshot, _) = map.read(cx.as_ref());
1298 let fold_ranges = snapshot
1299 .folds_in_range(Point::new(1, 0)..Point::new(1, 3))
1300 .map(|fold| fold.start.to_point(buffer)..fold.end.to_point(buffer))
1301 .collect::<Vec<_>>();
1302 assert_eq!(
1303 fold_ranges,
1304 vec![
1305 Point::new(0, 2)..Point::new(2, 2),
1306 Point::new(1, 2)..Point::new(3, 2)
1307 ]
1308 );
1309 }
1310
1311 #[gpui::test(iterations = 100)]
1312 fn test_random_folds(cx: &mut gpui::MutableAppContext, mut rng: StdRng) {
1313 let operations = env::var("OPERATIONS")
1314 .map(|i| i.parse().expect("invalid `OPERATIONS` variable"))
1315 .unwrap_or(10);
1316
1317 let buffer = cx.add_model(|cx| {
1318 let len = rng.gen_range(0..10);
1319 let text = RandomCharIter::new(&mut rng).take(len).collect::<String>();
1320 Buffer::new(0, text, cx)
1321 });
1322 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1323
1324 let (mut initial_snapshot, _) = map.read(cx.as_ref());
1325 let mut snapshot_edits = Vec::new();
1326
1327 for _ in 0..operations {
1328 log::info!("text: {:?}", buffer.read(cx).text());
1329 match rng.gen_range(0..=100) {
1330 0..=59 => {
1331 snapshot_edits.extend(map.randomly_mutate(&mut rng, cx.as_ref()));
1332 }
1333 _ => {
1334 let edits = buffer.update(cx, |buffer, _| {
1335 let start_version = buffer.version.clone();
1336 let edit_count = rng.gen_range(1..=5);
1337 buffer.randomly_edit(&mut rng, edit_count);
1338 buffer.edits_since(start_version).collect::<Vec<_>>()
1339 });
1340 log::info!("editing {:?}", edits);
1341 }
1342 }
1343
1344 let buffer = map.buffer.read(cx).snapshot();
1345 let mut expected_text: String = buffer.text().into();
1346 let mut expected_buffer_rows = Vec::new();
1347 let mut next_row = buffer.max_point().row;
1348 for fold_range in map.merged_fold_ranges(cx.as_ref()).into_iter().rev() {
1349 let fold_start = buffer.point_for_offset(fold_range.start).unwrap();
1350 let fold_end = buffer.point_for_offset(fold_range.end).unwrap();
1351 expected_buffer_rows.extend((fold_end.row + 1..=next_row).rev());
1352 next_row = fold_start.row;
1353
1354 expected_text.replace_range(fold_range.start..fold_range.end, "…");
1355 }
1356 expected_buffer_rows.extend((0..=next_row).rev());
1357 expected_buffer_rows.reverse();
1358
1359 let (snapshot, edits) = map.read(cx.as_ref());
1360 assert_eq!(snapshot.text(), expected_text);
1361 snapshot_edits.push((snapshot.clone(), edits));
1362
1363 for (output_row, line) in expected_text.lines().enumerate() {
1364 let line_len = snapshot.line_len(output_row as u32);
1365 assert_eq!(line_len, line.len() as u32);
1366 }
1367
1368 let longest_row = snapshot.longest_row();
1369 let longest_char_column = expected_text
1370 .split('\n')
1371 .nth(longest_row as usize)
1372 .unwrap()
1373 .chars()
1374 .count();
1375 let mut fold_point = FoldPoint::new(0, 0);
1376 let mut fold_offset = FoldOffset(0);
1377 let mut char_column = 0;
1378 for c in expected_text.chars() {
1379 let buffer_point = fold_point.to_buffer_point(&snapshot);
1380 let buffer_offset = buffer_point.to_offset(&buffer);
1381 assert_eq!(
1382 buffer_point.to_fold_point(&snapshot, Right),
1383 fold_point,
1384 "{:?} -> fold point",
1385 buffer_point,
1386 );
1387 assert_eq!(
1388 fold_point.to_buffer_offset(&snapshot),
1389 buffer_offset,
1390 "fold_point.to_buffer_offset({:?})",
1391 fold_point,
1392 );
1393 assert_eq!(
1394 fold_point.to_offset(&snapshot),
1395 fold_offset,
1396 "fold_point.to_offset({:?})",
1397 fold_point,
1398 );
1399
1400 if c == '\n' {
1401 *fold_point.row_mut() += 1;
1402 *fold_point.column_mut() = 0;
1403 char_column = 0;
1404 } else {
1405 *fold_point.column_mut() += c.len_utf8() as u32;
1406 char_column += 1;
1407 }
1408 fold_offset.0 += c.len_utf8();
1409 if char_column > longest_char_column {
1410 panic!(
1411 "invalid longest row {:?} (chars {}), found row {:?} (chars: {})",
1412 longest_row,
1413 longest_char_column,
1414 fold_point.row(),
1415 char_column
1416 );
1417 }
1418 }
1419
1420 for _ in 0..5 {
1421 let offset = snapshot
1422 .clip_offset(FoldOffset(rng.gen_range(0..=snapshot.len().0)), Bias::Right);
1423 assert_eq!(
1424 snapshot.chunks_at(offset).collect::<String>(),
1425 &expected_text[offset.0..],
1426 );
1427 }
1428
1429 for (idx, buffer_row) in expected_buffer_rows.iter().enumerate() {
1430 let fold_row = Point::new(*buffer_row, 0)
1431 .to_fold_point(&snapshot, Right)
1432 .row();
1433 assert_eq!(
1434 snapshot.buffer_rows(fold_row).collect::<Vec<_>>(),
1435 expected_buffer_rows[idx..],
1436 );
1437 }
1438
1439 for fold_range in map.merged_fold_ranges(cx.as_ref()) {
1440 let fold_point = fold_range
1441 .start
1442 .to_point(&buffer)
1443 .to_fold_point(&snapshot, Right);
1444 assert!(snapshot.is_line_folded(fold_point.row()));
1445 }
1446
1447 for _ in 0..5 {
1448 let end = buffer.clip_offset(rng.gen_range(0..=buffer.len()), Right);
1449 let start = buffer.clip_offset(rng.gen_range(0..=end), Left);
1450 let expected_folds = map
1451 .folds
1452 .items(&buffer)
1453 .into_iter()
1454 .filter(|fold| {
1455 let start = buffer.anchor_before(start);
1456 let end = buffer.anchor_after(end);
1457 start.cmp(&fold.0.end, &buffer).unwrap() == Ordering::Less
1458 && end.cmp(&fold.0.start, &buffer).unwrap() == Ordering::Greater
1459 })
1460 .map(|fold| fold.0)
1461 .collect::<Vec<_>>();
1462
1463 assert_eq!(
1464 snapshot
1465 .folds_in_range(start..end)
1466 .cloned()
1467 .collect::<Vec<_>>(),
1468 expected_folds
1469 );
1470 }
1471
1472 let text = snapshot.text();
1473 for _ in 0..5 {
1474 let start_row = rng.gen_range(0..=snapshot.max_point().row());
1475 let start_column = rng.gen_range(0..=snapshot.line_len(start_row));
1476 let end_row = rng.gen_range(0..=snapshot.max_point().row());
1477 let end_column = rng.gen_range(0..=snapshot.line_len(end_row));
1478 let mut start =
1479 snapshot.clip_point(FoldPoint::new(start_row, start_column), Bias::Left);
1480 let mut end = snapshot.clip_point(FoldPoint::new(end_row, end_column), Bias::Right);
1481 if start > end {
1482 mem::swap(&mut start, &mut end);
1483 }
1484
1485 let lines = start..end;
1486 let bytes = start.to_offset(&snapshot)..end.to_offset(&snapshot);
1487 assert_eq!(
1488 snapshot.text_summary_for_range(lines),
1489 TextSummary::from(&text[bytes.start.0..bytes.end.0])
1490 )
1491 }
1492
1493 let mut text = initial_snapshot.text();
1494 for (snapshot, edits) in snapshot_edits.drain(..) {
1495 let new_text = snapshot.text();
1496 let mut delta = 0isize;
1497 for edit in edits {
1498 let old_bytes = ((edit.old_bytes.start.0 as isize) + delta) as usize
1499 ..((edit.old_bytes.end.0 as isize) + delta) as usize;
1500 let new_bytes = edit.new_bytes.start.0..edit.new_bytes.end.0;
1501 delta += edit.delta();
1502 text.replace_range(old_bytes, &new_text[new_bytes]);
1503 }
1504
1505 assert_eq!(text, new_text);
1506 initial_snapshot = snapshot;
1507 }
1508 }
1509 }
1510
1511 #[gpui::test]
1512 fn test_buffer_rows(cx: &mut gpui::MutableAppContext) {
1513 let text = sample_text(6, 6) + "\n";
1514 let buffer = cx.add_model(|cx| Buffer::new(0, text, cx));
1515
1516 let mut map = FoldMap::new(buffer.clone(), cx.as_ref()).0;
1517
1518 let (mut writer, _, _) = map.write(cx.as_ref());
1519 writer.fold(
1520 vec![
1521 Point::new(0, 2)..Point::new(2, 2),
1522 Point::new(3, 1)..Point::new(4, 1),
1523 ],
1524 cx.as_ref(),
1525 );
1526
1527 let (snapshot, _) = map.read(cx.as_ref());
1528 assert_eq!(snapshot.text(), "aa…cccc\nd…eeeee\nffffff\n");
1529 assert_eq!(snapshot.buffer_rows(0).collect::<Vec<_>>(), [0, 3, 5, 6]);
1530 assert_eq!(snapshot.buffer_rows(3).collect::<Vec<_>>(), [6]);
1531 }
1532
1533 impl FoldMap {
1534 fn merged_fold_ranges(&self, cx: &AppContext) -> Vec<Range<usize>> {
1535 let buffer = self.buffer.read(cx).snapshot();
1536 let mut folds = self.folds.items(&buffer);
1537 // Ensure sorting doesn't change how folds get merged and displayed.
1538 folds.sort_by(|a, b| a.0.cmp(&b.0, &buffer).unwrap());
1539 let mut fold_ranges = folds
1540 .iter()
1541 .map(|fold| fold.0.start.to_offset(&buffer)..fold.0.end.to_offset(&buffer))
1542 .peekable();
1543
1544 let mut merged_ranges = Vec::new();
1545 while let Some(mut fold_range) = fold_ranges.next() {
1546 while let Some(next_range) = fold_ranges.peek() {
1547 if fold_range.end >= next_range.start {
1548 if next_range.end > fold_range.end {
1549 fold_range.end = next_range.end;
1550 }
1551 fold_ranges.next();
1552 } else {
1553 break;
1554 }
1555 }
1556 if fold_range.end > fold_range.start {
1557 merged_ranges.push(fold_range);
1558 }
1559 }
1560 merged_ranges
1561 }
1562
1563 pub fn randomly_mutate(
1564 &mut self,
1565 rng: &mut impl Rng,
1566 cx: &AppContext,
1567 ) -> Vec<(Snapshot, Vec<FoldEdit>)> {
1568 let mut snapshot_edits = Vec::new();
1569 match rng.gen_range(0..=100) {
1570 0..=39 if !self.folds.is_empty() => {
1571 let buffer = self.buffer.read(cx);
1572 let mut to_unfold = Vec::new();
1573 for _ in 0..rng.gen_range(1..=3) {
1574 let end = buffer.clip_offset(rng.gen_range(0..=buffer.len()), Right);
1575 let start = buffer.clip_offset(rng.gen_range(0..=end), Left);
1576 to_unfold.push(start..end);
1577 }
1578 log::info!("unfolding {:?}", to_unfold);
1579 let (mut writer, snapshot, edits) = self.write(cx.as_ref());
1580 snapshot_edits.push((snapshot, edits));
1581 let (snapshot, edits) = writer.fold(to_unfold, cx.as_ref());
1582 snapshot_edits.push((snapshot, edits));
1583 }
1584 _ => {
1585 let buffer = self.buffer.read(cx);
1586 let mut to_fold = Vec::new();
1587 for _ in 0..rng.gen_range(1..=2) {
1588 let end = buffer.clip_offset(rng.gen_range(0..=buffer.len()), Right);
1589 let start = buffer.clip_offset(rng.gen_range(0..=end), Left);
1590 to_fold.push(start..end);
1591 }
1592 log::info!("folding {:?}", to_fold);
1593 let (mut writer, snapshot, edits) = self.write(cx.as_ref());
1594 snapshot_edits.push((snapshot, edits));
1595 let (snapshot, edits) = writer.fold(to_fold, cx.as_ref());
1596 snapshot_edits.push((snapshot, edits));
1597 }
1598 }
1599 snapshot_edits
1600 }
1601 }
1602}