fold_map.rs

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