1use super::wrap_map::{self, Edit as WrapEdit, Snapshot as WrapSnapshot, WrapPoint};
2use buffer::{rope, Anchor, Bias, Edit, Point, Rope, ToOffset, ToPoint as _};
3use gpui::{fonts::HighlightStyle, AppContext, ModelHandle};
4use language::{Buffer, HighlightedChunk};
5use parking_lot::Mutex;
6use std::{
7 cmp,
8 collections::HashSet,
9 iter,
10 ops::Range,
11 slice,
12 sync::{
13 atomic::{AtomicUsize, Ordering::SeqCst},
14 Arc,
15 },
16};
17use sum_tree::SumTree;
18
19pub struct BlockMap {
20 buffer: ModelHandle<Buffer>,
21 next_block_id: AtomicUsize,
22 wrap_snapshot: Mutex<WrapSnapshot>,
23 blocks: Vec<Arc<Block>>,
24 transforms: Mutex<SumTree<Transform>>,
25}
26
27pub struct BlockMapWriter<'a>(&'a mut BlockMap);
28
29pub struct BlockSnapshot {
30 wrap_snapshot: WrapSnapshot,
31 transforms: SumTree<Transform>,
32}
33
34#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, Hash)]
35pub struct BlockId(usize);
36
37#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
38pub struct BlockPoint(pub super::Point);
39
40#[derive(Debug)]
41struct Block {
42 id: BlockId,
43 position: Anchor,
44 text: Rope,
45 runs: Vec<(usize, HighlightStyle)>,
46 disposition: BlockDisposition,
47}
48
49#[derive(Clone)]
50pub struct BlockProperties<P, T>
51where
52 P: Clone,
53 T: Clone,
54{
55 position: P,
56 text: T,
57 runs: Vec<(usize, HighlightStyle)>,
58 disposition: BlockDisposition,
59}
60
61#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]
62enum BlockDisposition {
63 Above,
64 Below,
65}
66
67#[derive(Clone, Debug)]
68struct Transform {
69 summary: TransformSummary,
70 block: Option<Arc<Block>>,
71}
72
73#[derive(Copy, Clone, Debug, Default)]
74struct TransformSummary {
75 input_rows: u32,
76 output_rows: u32,
77}
78
79pub struct HighlightedChunks<'a> {
80 transforms: sum_tree::Cursor<'a, Transform, (OutputRow, InputRow)>,
81 input_chunks: wrap_map::HighlightedChunks<'a>,
82 input_chunk: HighlightedChunk<'a>,
83 block_chunks: Option<BlockChunks<'a>>,
84 output_row: u32,
85 max_output_row: u32,
86}
87
88struct BlockChunks<'a> {
89 chunks: rope::Chunks<'a>,
90 runs: iter::Peekable<slice::Iter<'a, (usize, HighlightStyle)>>,
91 chunk: Option<&'a str>,
92 run_start: usize,
93 offset: usize,
94}
95
96#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord)]
97struct InputRow(u32);
98
99#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord)]
100struct OutputRow(u32);
101
102impl BlockMap {
103 pub fn new(buffer: ModelHandle<Buffer>, wrap_snapshot: WrapSnapshot) -> Self {
104 Self {
105 buffer,
106 next_block_id: AtomicUsize::new(0),
107 blocks: Vec::new(),
108 transforms: Mutex::new(SumTree::from_item(
109 Transform::isomorphic(wrap_snapshot.max_point().row() + 1),
110 &(),
111 )),
112 wrap_snapshot: Mutex::new(wrap_snapshot),
113 }
114 }
115
116 pub fn read(
117 &self,
118 wrap_snapshot: WrapSnapshot,
119 edits: Vec<WrapEdit>,
120 cx: &AppContext,
121 ) -> BlockSnapshot {
122 self.apply_edits(&wrap_snapshot, edits, cx);
123 *self.wrap_snapshot.lock() = wrap_snapshot.clone();
124 BlockSnapshot {
125 wrap_snapshot,
126 transforms: self.transforms.lock().clone(),
127 }
128 }
129
130 pub fn write(
131 &mut self,
132 wrap_snapshot: WrapSnapshot,
133 edits: Vec<WrapEdit>,
134 cx: &AppContext,
135 ) -> BlockMapWriter {
136 self.apply_edits(&wrap_snapshot, edits, cx);
137 *self.wrap_snapshot.lock() = wrap_snapshot;
138 BlockMapWriter(self)
139 }
140
141 fn apply_edits(&self, wrap_snapshot: &WrapSnapshot, edits: Vec<WrapEdit>, cx: &AppContext) {
142 let buffer = self.buffer.read(cx);
143 let mut transforms = self.transforms.lock();
144 let mut new_transforms = SumTree::new();
145 let mut cursor = transforms.cursor::<InputRow>();
146 let mut edits = edits.into_iter().peekable();
147 let mut last_block_ix = 0;
148 let mut blocks_in_edit = Vec::new();
149
150 while let Some(mut edit) = edits.next() {
151 new_transforms.push_tree(
152 cursor.slice(&InputRow(edit.old.start), Bias::Left, &()),
153 &(),
154 );
155
156 let transform_start = cursor.start().0;
157 edit.new.start -= edit.old.start - transform_start;
158 edit.old.start = transform_start;
159
160 loop {
161 if edit.old.end > cursor.start().0 {
162 cursor.seek(&InputRow(edit.old.end), Bias::Left, &());
163 cursor.next(&());
164 let transform_end = cursor.start().0;
165 edit.new.end += transform_end - edit.old.end;
166 edit.old.end = transform_end;
167 }
168
169 if let Some(next_edit) = edits.peek() {
170 if edit.old.end >= next_edit.old.start {
171 let delta = next_edit.new.len() as i32 - next_edit.old.len() as i32;
172 edit.old.end = cmp::max(next_edit.old.end, edit.old.end);
173 edit.new.end = (edit.new.end as i32 + delta) as u32;
174 edits.next();
175 } else {
176 break;
177 }
178 } else {
179 break;
180 }
181 }
182
183 let start_anchor = buffer.anchor_before(Point::new(edit.new.start, 0));
184 let end_anchor = buffer.anchor_after(Point::new(edit.new.end, 0));
185 let start_block_ix = match self.blocks[last_block_ix..]
186 .binary_search_by(|probe| probe.position.cmp(&start_anchor, buffer).unwrap())
187 {
188 Ok(ix) | Err(ix) => last_block_ix + ix,
189 };
190 let end_block_ix = match self.blocks[start_block_ix..]
191 .binary_search_by(|probe| probe.position.cmp(&end_anchor, buffer).unwrap())
192 {
193 Ok(ix) | Err(ix) => start_block_ix + ix,
194 };
195 last_block_ix = end_block_ix;
196
197 blocks_in_edit.clear();
198 blocks_in_edit.extend(
199 self.blocks[start_block_ix..end_block_ix]
200 .iter()
201 .map(|block| (block.position.to_point(buffer).row, block)),
202 );
203 blocks_in_edit.sort_unstable_by_key(|(row, block)| (*row, block.disposition));
204
205 for (row, block) in blocks_in_edit.iter().copied() {
206 let insertion_row = if block.disposition.is_above() {
207 row
208 } else {
209 row + 1
210 };
211
212 let new_transforms_end = new_transforms.summary().input_rows;
213 if new_transforms_end < insertion_row {
214 new_transforms.push(
215 Transform::isomorphic(insertion_row - new_transforms_end),
216 &(),
217 );
218 }
219
220 new_transforms.push(Transform::block(block.clone()), &());
221 }
222
223 let new_transforms_end = new_transforms.summary().input_rows;
224 if new_transforms_end < edit.new.end {
225 new_transforms.push(
226 Transform::isomorphic(edit.new.end - new_transforms_end),
227 &(),
228 );
229 }
230 }
231 new_transforms.push_tree(cursor.suffix(&()), &());
232 drop(cursor);
233 *transforms = new_transforms;
234 }
235}
236
237impl BlockPoint {
238 fn new(row: u32, column: u32) -> Self {
239 Self(Point::new(row, column))
240 }
241}
242
243impl std::ops::Deref for BlockPoint {
244 type Target = Point;
245
246 fn deref(&self) -> &Self::Target {
247 &self.0
248 }
249}
250
251impl std::ops::DerefMut for BlockPoint {
252 fn deref_mut(&mut self) -> &mut Self::Target {
253 &mut self.0
254 }
255}
256
257impl<'a> BlockMapWriter<'a> {
258 pub fn insert<P, T>(
259 &mut self,
260 blocks: impl IntoIterator<Item = BlockProperties<P, T>>,
261 cx: &AppContext,
262 ) -> Vec<BlockId>
263 where
264 P: ToOffset + Clone,
265 T: Into<Rope> + Clone,
266 {
267 let buffer = self.0.buffer.read(cx);
268 let mut ids = Vec::new();
269 let mut edits = Vec::<Edit<u32>>::new();
270
271 for block in blocks {
272 let id = BlockId(self.0.next_block_id.fetch_add(1, SeqCst));
273 ids.push(id);
274
275 let position = buffer.anchor_before(block.position);
276 let row = position.to_point(buffer).row;
277
278 let block_ix = match self
279 .0
280 .blocks
281 .binary_search_by(|probe| probe.position.cmp(&position, buffer).unwrap())
282 {
283 Ok(ix) | Err(ix) => ix,
284 };
285 let mut text = block.text.into();
286 text.push("\n");
287 self.0.blocks.insert(
288 block_ix,
289 Arc::new(Block {
290 id,
291 position,
292 text,
293 runs: block.runs,
294 disposition: block.disposition,
295 }),
296 );
297
298 if let Err(edit_ix) = edits.binary_search_by_key(&row, |edit| edit.old.start) {
299 edits.insert(
300 edit_ix,
301 Edit {
302 old: row..(row + 1),
303 new: row..(row + 1),
304 },
305 );
306 }
307 }
308
309 self.0.apply_edits(&*self.0.wrap_snapshot.lock(), edits, cx);
310 ids
311 }
312
313 pub fn remove(&mut self, _: HashSet<BlockId>, _: &AppContext) {
314 todo!()
315 }
316}
317
318impl BlockSnapshot {
319 #[cfg(test)]
320 fn text(&mut self) -> String {
321 self.highlighted_chunks_for_rows(0..(self.max_point().0.row + 1))
322 .map(|chunk| chunk.text)
323 .collect()
324 }
325
326 pub fn highlighted_chunks_for_rows(&mut self, rows: Range<u32>) -> HighlightedChunks {
327 let mut cursor = self.transforms.cursor::<(OutputRow, InputRow)>();
328 cursor.seek(&OutputRow(rows.start), Bias::Right, &());
329 let (input_start, output_start) = cursor.start();
330 let row_overshoot = rows.start - output_start.0;
331 let input_start_row = input_start.0 + row_overshoot;
332 let input_end_row = self.to_wrap_point(BlockPoint::new(rows.end, 0)).row();
333 let input_chunks = self
334 .wrap_snapshot
335 .highlighted_chunks_for_rows(input_start_row..input_end_row);
336 HighlightedChunks {
337 input_chunks,
338 input_chunk: Default::default(),
339 block_chunks: None,
340 transforms: cursor,
341 output_row: rows.start,
342 max_output_row: rows.end,
343 }
344 }
345
346 pub fn max_point(&self) -> BlockPoint {
347 self.to_block_point(self.wrap_snapshot.max_point())
348 }
349
350 pub fn clip_point(&self, point: BlockPoint, bias: Bias) -> BlockPoint {
351 let mut cursor = self.transforms.cursor::<(OutputRow, InputRow)>();
352 cursor.seek(&OutputRow(point.row), Bias::Right, &());
353 if let Some(transform) = cursor.item() {
354 if transform.is_isomorphic() {
355 let (output_start_row, input_start_row) = cursor.start();
356 let output_overshoot = point.row - output_start_row.0;
357 let input_point = self.wrap_snapshot.clip_point(
358 WrapPoint::new(input_start_row.0 + output_overshoot, point.column),
359 bias,
360 );
361 let input_overshoot = input_point.row() - input_start_row.0;
362 BlockPoint::new(output_start_row.0 + input_overshoot, input_point.column())
363 } else {
364 if bias == Bias::Left && cursor.start().1 .0 > 0
365 || cursor.end(&()).1 .0 == self.wrap_snapshot.max_point().row()
366 {
367 loop {
368 cursor.prev(&());
369 let transform = cursor.item().unwrap();
370 if transform.is_isomorphic() {
371 return BlockPoint::new(cursor.end(&()).0 .0 - 1, 0);
372 }
373 }
374 } else {
375 loop {
376 cursor.next(&());
377 let transform = cursor.item().unwrap();
378 if transform.is_isomorphic() {
379 return BlockPoint::new(cursor.start().0 .0, 0);
380 }
381 }
382 }
383 }
384 } else {
385 self.max_point()
386 }
387 }
388
389 pub fn to_block_point(&self, wrap_point: WrapPoint) -> BlockPoint {
390 let mut cursor = self.transforms.cursor::<(InputRow, OutputRow)>();
391 cursor.seek(&InputRow(wrap_point.row()), Bias::Right, &());
392 while let Some(item) = cursor.item() {
393 if item.is_isomorphic() {
394 break;
395 }
396 cursor.next(&());
397 }
398 let (input_start, output_start) = cursor.start();
399 let row_overshoot = wrap_point.row() - input_start.0;
400 BlockPoint::new(output_start.0 + row_overshoot, wrap_point.column())
401 }
402
403 pub fn to_wrap_point(&self, block_point: BlockPoint) -> WrapPoint {
404 let mut cursor = self.transforms.cursor::<(OutputRow, InputRow)>();
405 cursor.seek(&OutputRow(block_point.0.row), Bias::Right, &());
406 let (output_start, input_start) = cursor.start();
407 let row_overshoot = block_point.0.row - output_start.0;
408 WrapPoint::new(input_start.0 + row_overshoot, block_point.0.column)
409 }
410}
411
412impl Transform {
413 fn isomorphic(rows: u32) -> Self {
414 Self {
415 summary: TransformSummary {
416 input_rows: rows,
417 output_rows: rows,
418 },
419 block: None,
420 }
421 }
422
423 fn block(block: Arc<Block>) -> Self {
424 Self {
425 summary: TransformSummary {
426 input_rows: 0,
427 output_rows: block.text.summary().lines.row,
428 },
429 block: Some(block),
430 }
431 }
432
433 fn is_isomorphic(&self) -> bool {
434 self.block.is_none()
435 }
436}
437
438impl<'a> Iterator for HighlightedChunks<'a> {
439 type Item = HighlightedChunk<'a>;
440
441 fn next(&mut self) -> Option<Self::Item> {
442 if self.output_row >= self.max_output_row {
443 return None;
444 }
445
446 if let Some(block_chunks) = self.block_chunks.as_mut() {
447 if let Some(block_chunk) = block_chunks.next() {
448 self.output_row += block_chunk.text.matches('\n').count() as u32;
449 return Some(block_chunk);
450 } else {
451 self.block_chunks.take();
452 }
453 }
454
455 let transform = self.transforms.item()?;
456 if let Some(block) = transform.block.as_ref() {
457 let block_start = self.transforms.start().0 .0;
458 let block_end = self.transforms.end(&()).0 .0;
459 let start_row_in_block = self.output_row - block_start;
460 let end_row_in_block = cmp::min(self.max_output_row, block_end) - block_start;
461 self.transforms.next(&());
462 let mut block_chunks = BlockChunks::new(block, start_row_in_block..end_row_in_block);
463 if let Some(block_chunk) = block_chunks.next() {
464 self.output_row += block_chunk.text.matches('\n').count() as u32;
465 return Some(block_chunk);
466 }
467 }
468
469 if self.input_chunk.text.is_empty() {
470 self.input_chunk = self.input_chunks.next()?;
471 }
472
473 let transform_end = self.transforms.end(&()).0 .0;
474 let (prefix_rows, prefix_bytes) =
475 offset_for_row(self.input_chunk.text, transform_end - self.output_row);
476 self.output_row += prefix_rows;
477 let (prefix, suffix) = self.input_chunk.text.split_at(prefix_bytes);
478 self.input_chunk.text = suffix;
479 if self.output_row == transform_end {
480 self.transforms.next(&());
481 }
482
483 Some(HighlightedChunk {
484 text: prefix,
485 ..self.input_chunk
486 })
487 }
488}
489
490impl<'a> BlockChunks<'a> {
491 fn new(block: &'a Block, row_range: Range<u32>) -> Self {
492 let point_range = Point::new(row_range.start, 0)..Point::new(row_range.end, 0);
493 let offset_range = block.text.point_to_offset(point_range.start)
494 ..block.text.point_to_offset(point_range.end);
495
496 let mut runs = block.runs.iter().peekable();
497 let mut run_start = 0;
498 while let Some((run_len, _)) = runs.peek() {
499 let run_end = run_start + run_len;
500 if run_end <= offset_range.start {
501 run_start = run_end;
502 runs.next();
503 } else {
504 break;
505 }
506 }
507
508 Self {
509 chunk: None,
510 run_start,
511 chunks: block.text.chunks_in_range(offset_range.clone()),
512 runs,
513 offset: offset_range.start,
514 }
515 }
516}
517
518impl<'a> Iterator for BlockChunks<'a> {
519 type Item = HighlightedChunk<'a>;
520
521 fn next(&mut self) -> Option<Self::Item> {
522 if self.chunk.is_none() {
523 self.chunk = self.chunks.next();
524 }
525
526 let chunk = self.chunk?;
527 let mut chunk_len = chunk.len();
528 let mut highlight_style = None;
529 if let Some((run_len, style)) = self.runs.peek() {
530 highlight_style = Some(style.clone());
531 let run_end_in_chunk = self.run_start + run_len - self.offset;
532 if run_end_in_chunk <= chunk_len {
533 chunk_len = run_end_in_chunk;
534 self.run_start += run_len;
535 self.runs.next();
536 }
537 }
538
539 self.offset += chunk_len;
540 let (chunk, suffix) = chunk.split_at(chunk_len);
541 self.chunk = if suffix.is_empty() {
542 None
543 } else {
544 Some(suffix)
545 };
546
547 Some(HighlightedChunk {
548 text: chunk,
549 highlight_id: Default::default(),
550 diagnostic: None,
551 })
552 }
553}
554
555impl sum_tree::Item for Transform {
556 type Summary = TransformSummary;
557
558 fn summary(&self) -> Self::Summary {
559 self.summary
560 }
561}
562
563impl sum_tree::Summary for TransformSummary {
564 type Context = ();
565
566 fn add_summary(&mut self, summary: &Self, _: &()) {
567 self.input_rows += summary.input_rows;
568 self.output_rows += summary.output_rows;
569 }
570}
571
572impl<'a> sum_tree::Dimension<'a, TransformSummary> for InputRow {
573 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
574 self.0 += summary.input_rows;
575 }
576}
577
578impl<'a> sum_tree::Dimension<'a, TransformSummary> for OutputRow {
579 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
580 self.0 += summary.output_rows;
581 }
582}
583
584impl BlockDisposition {
585 fn is_above(&self) -> bool {
586 matches!(self, BlockDisposition::Above)
587 }
588}
589
590// Count the number of bytes prior to a target row.
591// If the string doesn't contain the target row, return the total number of rows it does contain.
592// Otherwise return the target row itself.
593fn offset_for_row(s: &str, target_row: u32) -> (u32, usize) {
594 let mut row = 0;
595 let mut offset = 0;
596 for (ix, line) in s.split('\n').enumerate() {
597 if ix > 0 {
598 row += 1;
599 offset += 1;
600 }
601 if row as u32 >= target_row {
602 break;
603 }
604 offset += line.len();
605 }
606 (row, offset)
607}
608
609#[cfg(test)]
610mod tests {
611 use super::*;
612 use crate::display_map::{fold_map::FoldMap, tab_map::TabMap, wrap_map::WrapMap};
613 use buffer::RandomCharIter;
614 use language::Buffer;
615 use rand::prelude::*;
616 use std::env;
617
618 #[gpui::test]
619 fn test_basic_blocks(cx: &mut gpui::MutableAppContext) {
620 let family_id = cx.font_cache().load_family(&["Helvetica"]).unwrap();
621 let font_id = cx
622 .font_cache()
623 .select_font(family_id, &Default::default())
624 .unwrap();
625
626 let text = "aaa\nbbb\nccc\nddd\n";
627
628 let buffer = cx.add_model(|cx| Buffer::new(0, text, cx));
629 let (fold_map, folds_snapshot) = FoldMap::new(buffer.clone(), cx);
630 let (tab_map, tabs_snapshot) = TabMap::new(folds_snapshot.clone(), 1);
631 let (wrap_map, wraps_snapshot) = WrapMap::new(tabs_snapshot, font_id, 14.0, None, cx);
632 let mut block_map = BlockMap::new(buffer.clone(), wraps_snapshot.clone());
633
634 let mut writer = block_map.write(wraps_snapshot.clone(), vec![], cx);
635 writer.insert(
636 vec![
637 BlockProperties {
638 position: Point::new(1, 0),
639 text: "BLOCK 1",
640 disposition: BlockDisposition::Above,
641 runs: vec![],
642 },
643 BlockProperties {
644 position: Point::new(1, 2),
645 text: "BLOCK 2",
646 disposition: BlockDisposition::Above,
647 runs: vec![],
648 },
649 BlockProperties {
650 position: Point::new(3, 2),
651 text: "BLOCK 3",
652 disposition: BlockDisposition::Below,
653 runs: vec![],
654 },
655 ],
656 cx,
657 );
658
659 let mut snapshot = block_map.read(wraps_snapshot, vec![], cx);
660 assert_eq!(
661 snapshot.text(),
662 "aaa\nBLOCK 1\nBLOCK 2\nbbb\nccc\nddd\nBLOCK 3\n"
663 );
664 assert_eq!(
665 snapshot.to_block_point(WrapPoint::new(1, 0)),
666 BlockPoint::new(3, 0)
667 );
668
669 // Insert a line break, separating two block decorations into separate
670 // lines.
671 buffer.update(cx, |buffer, cx| {
672 buffer.edit([Point::new(1, 1)..Point::new(1, 1)], "!!!\n", cx)
673 });
674
675 let (folds_snapshot, fold_edits) = fold_map.read(cx);
676 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
677 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
678 wrap_map.sync(tabs_snapshot, tab_edits, cx)
679 });
680 let mut snapshot = block_map.read(wraps_snapshot, wrap_edits, cx);
681 assert_eq!(
682 snapshot.text(),
683 "aaa\nBLOCK 1\nb!!!\nBLOCK 2\nbb\nccc\nddd\nBLOCK 3\n"
684 );
685 }
686
687 #[gpui::test(iterations = 100)]
688 fn test_random_blocks(cx: &mut gpui::MutableAppContext, mut rng: StdRng) {
689 let operations = env::var("OPERATIONS")
690 .map(|i| i.parse().expect("invalid `OPERATIONS` variable"))
691 .unwrap_or(10);
692
693 let wrap_width = Some(rng.gen_range(0.0..=1000.0));
694 let tab_size = 1;
695 let family_id = cx.font_cache().load_family(&["Helvetica"]).unwrap();
696 let font_id = cx
697 .font_cache()
698 .select_font(family_id, &Default::default())
699 .unwrap();
700 let font_size = 14.0;
701
702 log::info!("Wrap width: {:?}", wrap_width);
703
704 let buffer = cx.add_model(|cx| {
705 let len = rng.gen_range(0..10);
706 let text = RandomCharIter::new(&mut rng).take(len).collect::<String>();
707 Buffer::new(0, text, cx)
708 });
709 let (fold_map, folds_snapshot) = FoldMap::new(buffer.clone(), cx);
710 let (tab_map, tabs_snapshot) = TabMap::new(folds_snapshot.clone(), tab_size);
711 let (wrap_map, wraps_snapshot) =
712 WrapMap::new(tabs_snapshot, font_id, font_size, wrap_width, cx);
713 let mut block_map = BlockMap::new(buffer.clone(), wraps_snapshot);
714 let mut expected_blocks = Vec::new();
715
716 for _ in 0..operations {
717 match rng.gen_range(0..=100) {
718 0..=19 => {
719 let wrap_width = if rng.gen_bool(0.2) {
720 None
721 } else {
722 Some(rng.gen_range(0.0..=1000.0))
723 };
724 log::info!("Setting wrap width to {:?}", wrap_width);
725 wrap_map.update(cx, |map, cx| map.set_wrap_width(wrap_width, cx));
726 }
727 20..=39 => {
728 let block_count = rng.gen_range(1..=4);
729 let block_properties = (0..block_count)
730 .map(|_| {
731 let buffer = buffer.read(cx);
732 let position = buffer.anchor_before(rng.gen_range(0..=buffer.len()));
733
734 let len = rng.gen_range(0..10);
735 let text = Rope::from(
736 RandomCharIter::new(&mut rng)
737 .take(len)
738 .collect::<String>()
739 .as_str(),
740 );
741 BlockProperties {
742 position,
743 text,
744 runs: Vec::<(usize, HighlightStyle)>::new(),
745 disposition: if rng.gen() {
746 BlockDisposition::Above
747 } else {
748 BlockDisposition::Below
749 },
750 }
751 })
752 .collect::<Vec<_>>();
753
754 let (folds_snapshot, fold_edits) = fold_map.read(cx);
755 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
756 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
757 wrap_map.sync(tabs_snapshot, tab_edits, cx)
758 });
759 let mut block_map = block_map.write(wraps_snapshot, wrap_edits, cx);
760 let block_ids = block_map.insert(block_properties.clone(), cx);
761 expected_blocks.extend(block_ids.into_iter().zip(block_properties));
762 }
763 40..=59 => {
764 let block_count = rng.gen_range(1..=4.min(expected_blocks.len()));
765 let block_ids_to_remove = (0..block_count)
766 .map(|_| {
767 expected_blocks
768 .remove(rng.gen_range(0..expected_blocks.len()))
769 .0
770 })
771 .collect();
772
773 let (folds_snapshot, fold_edits) = fold_map.read(cx);
774 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
775 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
776 wrap_map.sync(tabs_snapshot, tab_edits, cx)
777 });
778 let mut block_map = block_map.write(wraps_snapshot, wrap_edits, cx);
779 block_map.remove(block_ids_to_remove, cx);
780 }
781 _ => {
782 buffer.update(cx, |buffer, _| buffer.randomly_edit(&mut rng, 5));
783 }
784 }
785
786 let (folds_snapshot, fold_edits) = fold_map.read(cx);
787 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
788 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
789 wrap_map.sync(tabs_snapshot, tab_edits, cx)
790 });
791 let mut blocks_snapshot = block_map.read(wraps_snapshot.clone(), wrap_edits, cx);
792 assert_eq!(
793 blocks_snapshot.transforms.summary().input_rows,
794 wraps_snapshot.max_point().row() + 1
795 );
796
797 let buffer = buffer.read(cx);
798 let mut sorted_blocks = expected_blocks
799 .iter()
800 .cloned()
801 .map(|(_, block)| BlockProperties {
802 position: block.position.to_point(buffer),
803 text: block.text,
804 runs: block.runs,
805 disposition: block.disposition,
806 })
807 .collect::<Vec<_>>();
808 sorted_blocks.sort_unstable_by_key(|block| (block.position.row, block.disposition));
809 let mut sorted_blocks = sorted_blocks.into_iter().peekable();
810
811 let mut expected_text = String::new();
812 let input_text = wraps_snapshot.text();
813 for (row, input_line) in input_text.split('\n').enumerate() {
814 let row = row as u32;
815 if row > 0 {
816 expected_text.push('\n');
817 }
818
819 while let Some(block) = sorted_blocks.peek() {
820 if block.position.row == row && block.disposition == BlockDisposition::Above {
821 expected_text.extend(block.text.chunks());
822 expected_text.push('\n');
823 sorted_blocks.next();
824 } else {
825 break;
826 }
827 }
828
829 expected_text.push_str(input_line);
830
831 while let Some(block) = sorted_blocks.peek() {
832 if block.position.row == row && block.disposition == BlockDisposition::Below {
833 expected_text.push('\n');
834 expected_text.extend(block.text.chunks());
835 sorted_blocks.next();
836 } else {
837 break;
838 }
839 }
840 }
841
842 assert_eq!(blocks_snapshot.text(), expected_text);
843 }
844 }
845}