1use super::wrap_map::{self, WrapEdit, WrapPoint, WrapSnapshot};
2use crate::{Anchor, ToPoint as _};
3use collections::{HashMap, HashSet};
4use gpui::{AppContext, ElementBox};
5use language::Chunk;
6use parking_lot::Mutex;
7use std::{
8 cmp::{self, Ordering, Reverse},
9 fmt::Debug,
10 ops::{Deref, Range},
11 sync::{
12 atomic::{AtomicUsize, Ordering::SeqCst},
13 Arc,
14 },
15};
16use sum_tree::{Bias, SumTree};
17use text::{Edit, Point};
18
19const NEWLINES: &'static [u8] = &[b'\n'; u8::MAX as usize];
20
21pub struct BlockMap {
22 next_block_id: AtomicUsize,
23 wrap_snapshot: Mutex<WrapSnapshot>,
24 blocks: Vec<Arc<Block>>,
25 transforms: Mutex<SumTree<Transform>>,
26}
27
28pub struct BlockMapWriter<'a>(&'a mut BlockMap);
29
30pub struct BlockSnapshot {
31 wrap_snapshot: WrapSnapshot,
32 transforms: SumTree<Transform>,
33}
34
35#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
36pub struct BlockId(usize);
37
38#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
39pub struct BlockPoint(pub super::Point);
40
41#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
42struct BlockRow(u32);
43
44#[derive(Copy, Clone, Debug, Default, Eq, Ord, PartialOrd, PartialEq)]
45struct WrapRow(u32);
46
47pub type RenderBlock = Arc<dyn Fn(&BlockContext) -> ElementBox>;
48
49pub struct Block {
50 id: BlockId,
51 position: Anchor,
52 height: u8,
53 render: Mutex<RenderBlock>,
54 disposition: BlockDisposition,
55}
56
57#[derive(Clone)]
58pub struct BlockProperties<P>
59where
60 P: Clone,
61{
62 pub position: P,
63 pub height: u8,
64 pub render: Arc<dyn Fn(&BlockContext) -> ElementBox>,
65 pub disposition: BlockDisposition,
66}
67
68pub struct BlockContext<'a> {
69 pub cx: &'a AppContext,
70 pub anchor_x: f32,
71 pub scroll_x: f32,
72 pub gutter_width: f32,
73 pub gutter_padding: f32,
74 pub em_width: f32,
75 pub line_height: f32,
76}
77
78#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]
79pub enum BlockDisposition {
80 Above,
81 Below,
82}
83
84#[derive(Clone, Debug)]
85struct Transform {
86 summary: TransformSummary,
87 block: Option<AlignedBlock>,
88}
89
90#[derive(Clone, Debug)]
91pub struct AlignedBlock {
92 block: Arc<Block>,
93 column: u32,
94}
95
96#[derive(Clone, Debug, Default)]
97struct TransformSummary {
98 input_rows: u32,
99 output_rows: u32,
100}
101
102pub struct BlockChunks<'a> {
103 transforms: sum_tree::Cursor<'a, Transform, (BlockRow, WrapRow)>,
104 input_chunks: wrap_map::WrapChunks<'a>,
105 input_chunk: Chunk<'a>,
106 output_row: u32,
107 max_output_row: u32,
108}
109
110pub struct BlockBufferRows<'a> {
111 transforms: sum_tree::Cursor<'a, Transform, (BlockRow, WrapRow)>,
112 input_buffer_rows: wrap_map::WrapBufferRows<'a>,
113 output_row: u32,
114 started: bool,
115}
116
117impl BlockMap {
118 pub fn new(wrap_snapshot: WrapSnapshot) -> Self {
119 Self {
120 next_block_id: AtomicUsize::new(0),
121 blocks: Vec::new(),
122 transforms: Mutex::new(SumTree::from_item(
123 Transform::isomorphic(wrap_snapshot.text_summary().lines.row + 1),
124 &(),
125 )),
126 wrap_snapshot: Mutex::new(wrap_snapshot),
127 }
128 }
129
130 pub fn read(&self, wrap_snapshot: WrapSnapshot, edits: Vec<WrapEdit>) -> BlockSnapshot {
131 self.sync(&wrap_snapshot, edits);
132 *self.wrap_snapshot.lock() = wrap_snapshot.clone();
133 BlockSnapshot {
134 wrap_snapshot,
135 transforms: self.transforms.lock().clone(),
136 }
137 }
138
139 pub fn write(&mut self, wrap_snapshot: WrapSnapshot, edits: Vec<WrapEdit>) -> BlockMapWriter {
140 self.sync(&wrap_snapshot, edits);
141 *self.wrap_snapshot.lock() = wrap_snapshot;
142 BlockMapWriter(self)
143 }
144
145 fn sync(&self, wrap_snapshot: &WrapSnapshot, edits: Vec<WrapEdit>) {
146 if edits.is_empty() {
147 return;
148 }
149
150 let buffer = wrap_snapshot.buffer_snapshot();
151 let mut transforms = self.transforms.lock();
152 let mut new_transforms = SumTree::new();
153 let old_row_count = transforms.summary().input_rows;
154 let new_row_count = wrap_snapshot.max_point().row() + 1;
155 let mut cursor = transforms.cursor::<WrapRow>();
156 let mut last_block_ix = 0;
157 let mut blocks_in_edit = Vec::new();
158 let mut edits = edits.into_iter().peekable();
159
160 while let Some(edit) = edits.next() {
161 // Preserve any old transforms that precede this edit.
162 let old_start = WrapRow(edit.old.start);
163 let new_start = WrapRow(edit.new.start);
164 new_transforms.push_tree(cursor.slice(&old_start, Bias::Left, &()), &());
165 if let Some(transform) = cursor.item() {
166 if transform.is_isomorphic() && old_start == cursor.end(&()) {
167 new_transforms.push(transform.clone(), &());
168 cursor.next(&());
169 while let Some(transform) = cursor.item() {
170 if transform
171 .block
172 .as_ref()
173 .map_or(false, |b| b.disposition.is_below())
174 {
175 new_transforms.push(transform.clone(), &());
176 cursor.next(&());
177 } else {
178 break;
179 }
180 }
181 }
182 }
183
184 // Preserve any portion of an old transform that precedes this edit.
185 let extent_before_edit = old_start.0 - cursor.start().0;
186 push_isomorphic(&mut new_transforms, extent_before_edit);
187
188 // Skip over any old transforms that intersect this edit.
189 let mut old_end = WrapRow(edit.old.end);
190 let mut new_end = WrapRow(edit.new.end);
191 cursor.seek(&old_end, Bias::Left, &());
192 cursor.next(&());
193 if old_end == *cursor.start() {
194 while let Some(transform) = cursor.item() {
195 if transform
196 .block
197 .as_ref()
198 .map_or(false, |b| b.disposition.is_below())
199 {
200 cursor.next(&());
201 } else {
202 break;
203 }
204 }
205 }
206
207 // Combine this edit with any subsequent edits that intersect the same transform.
208 while let Some(next_edit) = edits.peek() {
209 if next_edit.old.start <= cursor.start().0 {
210 old_end = WrapRow(next_edit.old.end);
211 new_end = WrapRow(next_edit.new.end);
212 cursor.seek(&old_end, Bias::Left, &());
213 cursor.next(&());
214 if old_end == *cursor.start() {
215 while let Some(transform) = cursor.item() {
216 if transform
217 .block
218 .as_ref()
219 .map_or(false, |b| b.disposition.is_below())
220 {
221 cursor.next(&());
222 } else {
223 break;
224 }
225 }
226 }
227 edits.next();
228 } else {
229 break;
230 }
231 }
232
233 // Find the blocks within this edited region.
234 let new_buffer_start =
235 wrap_snapshot.to_point(WrapPoint::new(new_start.0, 0), Bias::Left);
236 let start_anchor = buffer.anchor_before(new_buffer_start);
237 let start_block_ix = match self.blocks[last_block_ix..].binary_search_by(|probe| {
238 probe
239 .position
240 .cmp(&start_anchor, &buffer)
241 .unwrap()
242 .then(Ordering::Greater)
243 }) {
244 Ok(ix) | Err(ix) => last_block_ix + ix,
245 };
246
247 let end_block_ix = if new_end.0 > wrap_snapshot.max_point().row() {
248 self.blocks.len()
249 } else {
250 let new_buffer_end =
251 wrap_snapshot.to_point(WrapPoint::new(new_end.0, 0), Bias::Left);
252 let end_anchor = buffer.anchor_before(new_buffer_end);
253 match self.blocks[start_block_ix..].binary_search_by(|probe| {
254 probe
255 .position
256 .cmp(&end_anchor, &buffer)
257 .unwrap()
258 .then(Ordering::Greater)
259 }) {
260 Ok(ix) | Err(ix) => start_block_ix + ix,
261 }
262 };
263 last_block_ix = end_block_ix;
264
265 debug_assert!(blocks_in_edit.is_empty());
266 blocks_in_edit.extend(
267 self.blocks[start_block_ix..end_block_ix]
268 .iter()
269 .map(|block| {
270 let mut position = block.position.to_point(&buffer);
271 let column = wrap_snapshot.from_point(position, Bias::Left).column();
272 match block.disposition {
273 BlockDisposition::Above => position.column = 0,
274 BlockDisposition::Below => {
275 position.column = buffer.line_len(position.row)
276 }
277 }
278 let position = wrap_snapshot.from_point(position, Bias::Left);
279 (position.row(), column, block.clone())
280 }),
281 );
282
283 // When multiple blocks are on the same row, newer blocks appear above older
284 // blocks. This is arbitrary, but we currently rely on it in ProjectDiagnosticsEditor.
285 blocks_in_edit
286 .sort_by_key(|(row, _, block)| (*row, block.disposition, Reverse(block.id)));
287
288 // For each of these blocks, insert a new isomorphic transform preceding the block,
289 // and then insert the block itself.
290 for (block_row, column, block) in blocks_in_edit.drain(..) {
291 let insertion_row = match block.disposition {
292 BlockDisposition::Above => block_row,
293 BlockDisposition::Below => block_row + 1,
294 };
295 let extent_before_block = insertion_row - new_transforms.summary().input_rows;
296 push_isomorphic(&mut new_transforms, extent_before_block);
297 new_transforms.push(Transform::block(block, column), &());
298 }
299
300 old_end = WrapRow(old_end.0.min(old_row_count));
301 new_end = WrapRow(new_end.0.min(new_row_count));
302
303 // Insert an isomorphic transform after the final block.
304 let extent_after_last_block = new_end.0 - new_transforms.summary().input_rows;
305 push_isomorphic(&mut new_transforms, extent_after_last_block);
306
307 // Preserve any portion of the old transform after this edit.
308 let extent_after_edit = cursor.start().0 - old_end.0;
309 push_isomorphic(&mut new_transforms, extent_after_edit);
310 }
311
312 new_transforms.push_tree(cursor.suffix(&()), &());
313 debug_assert_eq!(
314 new_transforms.summary().input_rows,
315 wrap_snapshot.max_point().row() + 1
316 );
317
318 drop(cursor);
319 *transforms = new_transforms;
320 }
321
322 pub fn replace(&mut self, mut renderers: HashMap<BlockId, RenderBlock>) {
323 for block in &self.blocks {
324 if let Some(render) = renderers.remove(&block.id) {
325 *block.render.lock() = render;
326 }
327 }
328 }
329}
330
331fn push_isomorphic(tree: &mut SumTree<Transform>, rows: u32) {
332 if rows == 0 {
333 return;
334 }
335
336 let mut extent = Some(rows);
337 tree.update_last(
338 |last_transform| {
339 if last_transform.is_isomorphic() {
340 let extent = extent.take().unwrap();
341 last_transform.summary.input_rows += extent;
342 last_transform.summary.output_rows += extent;
343 }
344 },
345 &(),
346 );
347 if let Some(extent) = extent {
348 tree.push(Transform::isomorphic(extent), &());
349 }
350}
351
352impl BlockPoint {
353 pub fn new(row: u32, column: u32) -> Self {
354 Self(Point::new(row, column))
355 }
356}
357
358impl Deref for BlockPoint {
359 type Target = Point;
360
361 fn deref(&self) -> &Self::Target {
362 &self.0
363 }
364}
365
366impl std::ops::DerefMut for BlockPoint {
367 fn deref_mut(&mut self) -> &mut Self::Target {
368 &mut self.0
369 }
370}
371
372impl<'a> BlockMapWriter<'a> {
373 pub fn insert(
374 &mut self,
375 blocks: impl IntoIterator<Item = BlockProperties<Anchor>>,
376 ) -> Vec<BlockId> {
377 let mut ids = Vec::new();
378 let mut edits = Vec::<Edit<u32>>::new();
379 let wrap_snapshot = &*self.0.wrap_snapshot.lock();
380 let buffer = wrap_snapshot.buffer_snapshot();
381
382 for block in blocks {
383 let id = BlockId(self.0.next_block_id.fetch_add(1, SeqCst));
384 ids.push(id);
385
386 let position = block.position;
387 let point = position.to_point(&buffer);
388 let wrap_row = wrap_snapshot
389 .from_point(Point::new(point.row, 0), Bias::Left)
390 .row();
391 let start_row = wrap_snapshot.prev_row_boundary(WrapPoint::new(wrap_row, 0));
392 let end_row = wrap_snapshot
393 .next_row_boundary(WrapPoint::new(wrap_row, 0))
394 .unwrap_or(wrap_snapshot.max_point().row() + 1);
395
396 let block_ix = match self
397 .0
398 .blocks
399 .binary_search_by(|probe| probe.position.cmp(&position, &buffer).unwrap())
400 {
401 Ok(ix) | Err(ix) => ix,
402 };
403 self.0.blocks.insert(
404 block_ix,
405 Arc::new(Block {
406 id,
407 position,
408 height: block.height,
409 render: Mutex::new(block.render),
410 disposition: block.disposition,
411 }),
412 );
413
414 if let Err(edit_ix) = edits.binary_search_by_key(&start_row, |edit| edit.old.start) {
415 edits.insert(
416 edit_ix,
417 Edit {
418 old: start_row..end_row,
419 new: start_row..end_row,
420 },
421 );
422 }
423 }
424
425 self.0.sync(wrap_snapshot, edits);
426 ids
427 }
428
429 pub fn remove(&mut self, block_ids: HashSet<BlockId>) {
430 let wrap_snapshot = &*self.0.wrap_snapshot.lock();
431 let buffer = wrap_snapshot.buffer_snapshot();
432 let mut edits = Vec::new();
433 let mut last_block_buffer_row = None;
434 self.0.blocks.retain(|block| {
435 if block_ids.contains(&block.id) {
436 let buffer_row = block.position.to_point(&buffer).row;
437 if last_block_buffer_row != Some(buffer_row) {
438 last_block_buffer_row = Some(buffer_row);
439 let wrap_row = wrap_snapshot
440 .from_point(Point::new(buffer_row, 0), Bias::Left)
441 .row();
442 let start_row = wrap_snapshot.prev_row_boundary(WrapPoint::new(wrap_row, 0));
443 let end_row = wrap_snapshot
444 .next_row_boundary(WrapPoint::new(wrap_row, 0))
445 .unwrap_or(wrap_snapshot.max_point().row() + 1);
446 edits.push(Edit {
447 old: start_row..end_row,
448 new: start_row..end_row,
449 })
450 }
451 false
452 } else {
453 true
454 }
455 });
456 self.0.sync(wrap_snapshot, edits);
457 }
458}
459
460impl BlockSnapshot {
461 #[cfg(test)]
462 pub fn text(&self) -> String {
463 self.chunks(0..self.transforms.summary().output_rows)
464 .map(|chunk| chunk.text)
465 .collect()
466 }
467
468 pub fn chunks<'a>(&'a self, rows: Range<u32>) -> BlockChunks<'a> {
469 let max_output_row = cmp::min(rows.end, self.transforms.summary().output_rows);
470 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
471 let input_end = {
472 cursor.seek(&BlockRow(rows.end), Bias::Right, &());
473 let overshoot = if cursor
474 .item()
475 .map_or(false, |transform| transform.is_isomorphic())
476 {
477 rows.end - cursor.start().0 .0
478 } else {
479 0
480 };
481 cursor.start().1 .0 + overshoot
482 };
483 let input_start = {
484 cursor.seek(&BlockRow(rows.start), Bias::Right, &());
485 let overshoot = if cursor
486 .item()
487 .map_or(false, |transform| transform.is_isomorphic())
488 {
489 rows.start - cursor.start().0 .0
490 } else {
491 0
492 };
493 cursor.start().1 .0 + overshoot
494 };
495 BlockChunks {
496 input_chunks: self.wrap_snapshot.chunks(input_start..input_end),
497 input_chunk: Default::default(),
498 transforms: cursor,
499 output_row: rows.start,
500 max_output_row,
501 }
502 }
503
504 pub fn buffer_rows<'a>(&'a self, start_row: u32) -> BlockBufferRows<'a> {
505 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
506 cursor.seek(&BlockRow(start_row), Bias::Right, &());
507 let (output_start, input_start) = cursor.start();
508 let overshoot = if cursor.item().map_or(false, |t| t.is_isomorphic()) {
509 start_row - output_start.0
510 } else {
511 0
512 };
513 let input_start_row = input_start.0 + overshoot;
514 BlockBufferRows {
515 transforms: cursor,
516 input_buffer_rows: self.wrap_snapshot.buffer_rows(input_start_row),
517 output_row: start_row,
518 started: false,
519 }
520 }
521
522 pub fn blocks_in_range<'a>(
523 &'a self,
524 rows: Range<u32>,
525 ) -> impl Iterator<Item = (u32, &'a AlignedBlock)> {
526 let mut cursor = self.transforms.cursor::<BlockRow>();
527 cursor.seek(&BlockRow(rows.start), Bias::Right, &());
528 std::iter::from_fn(move || {
529 while let Some(transform) = cursor.item() {
530 let start_row = cursor.start().0;
531 if start_row >= rows.end {
532 break;
533 }
534 if let Some(block) = &transform.block {
535 cursor.next(&());
536 return Some((start_row, block));
537 } else {
538 cursor.next(&());
539 }
540 }
541 None
542 })
543 }
544
545 pub fn max_point(&self) -> BlockPoint {
546 let row = self.transforms.summary().output_rows - 1;
547 BlockPoint::new(row, self.line_len(row))
548 }
549
550 pub fn longest_row(&self) -> u32 {
551 let input_row = self.wrap_snapshot.longest_row();
552 self.to_block_point(WrapPoint::new(input_row, 0)).row
553 }
554
555 pub fn line_len(&self, row: u32) -> u32 {
556 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
557 cursor.seek(&BlockRow(row), Bias::Right, &());
558 if let Some(transform) = cursor.item() {
559 let (output_start, input_start) = cursor.start();
560 let overshoot = row - output_start.0;
561 if transform.block.is_some() {
562 0
563 } else {
564 self.wrap_snapshot.line_len(input_start.0 + overshoot)
565 }
566 } else {
567 panic!("row out of range");
568 }
569 }
570
571 pub fn is_block_line(&self, row: u32) -> bool {
572 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
573 cursor.seek(&BlockRow(row), Bias::Right, &());
574 cursor.item().map_or(false, |t| t.block.is_some())
575 }
576
577 pub fn clip_point(&self, point: BlockPoint, bias: Bias) -> BlockPoint {
578 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
579 cursor.seek(&BlockRow(point.row), Bias::Right, &());
580
581 let max_input_row = WrapRow(self.transforms.summary().input_rows);
582 let mut search_left =
583 (bias == Bias::Left && cursor.start().1 .0 > 0) || cursor.end(&()).1 == max_input_row;
584 let mut reversed = false;
585
586 loop {
587 if let Some(transform) = cursor.item() {
588 if transform.is_isomorphic() {
589 let (output_start_row, input_start_row) = cursor.start();
590 let (output_end_row, input_end_row) = cursor.end(&());
591 let output_start = Point::new(output_start_row.0, 0);
592 let input_start = Point::new(input_start_row.0, 0);
593 let input_end = Point::new(input_end_row.0, 0);
594 let input_point = if point.row >= output_end_row.0 {
595 let line_len = self.wrap_snapshot.line_len(input_end_row.0 - 1);
596 self.wrap_snapshot
597 .clip_point(WrapPoint::new(input_end_row.0 - 1, line_len), bias)
598 } else {
599 let output_overshoot = point.0.saturating_sub(output_start);
600 self.wrap_snapshot
601 .clip_point(WrapPoint(input_start + output_overshoot), bias)
602 };
603
604 if (input_start..input_end).contains(&input_point.0) {
605 let input_overshoot = input_point.0.saturating_sub(input_start);
606 return BlockPoint(output_start + input_overshoot);
607 }
608 }
609
610 if search_left {
611 cursor.prev(&());
612 } else {
613 cursor.next(&());
614 }
615 } else if reversed {
616 return self.max_point();
617 } else {
618 reversed = true;
619 search_left = !search_left;
620 cursor.seek(&BlockRow(point.row), Bias::Right, &());
621 }
622 }
623 }
624
625 pub fn to_block_point(&self, wrap_point: WrapPoint) -> BlockPoint {
626 let mut cursor = self.transforms.cursor::<(WrapRow, BlockRow)>();
627 cursor.seek(&WrapRow(wrap_point.row()), Bias::Right, &());
628 if let Some(transform) = cursor.item() {
629 debug_assert!(transform.is_isomorphic());
630 } else {
631 return self.max_point();
632 }
633
634 let (input_start_row, output_start_row) = cursor.start();
635 let input_start = Point::new(input_start_row.0, 0);
636 let output_start = Point::new(output_start_row.0, 0);
637 let input_overshoot = wrap_point.0 - input_start;
638 BlockPoint(output_start + input_overshoot)
639 }
640
641 pub fn to_wrap_point(&self, block_point: BlockPoint) -> WrapPoint {
642 let mut cursor = self.transforms.cursor::<(BlockRow, WrapRow)>();
643 cursor.seek(&BlockRow(block_point.row), Bias::Right, &());
644 if let Some(transform) = cursor.item() {
645 match transform.block.as_ref().map(|b| b.disposition) {
646 Some(BlockDisposition::Above) => WrapPoint::new(cursor.start().1 .0, 0),
647 Some(BlockDisposition::Below) => {
648 let wrap_row = cursor.start().1 .0 - 1;
649 WrapPoint::new(wrap_row, self.wrap_snapshot.line_len(wrap_row))
650 }
651 None => {
652 let overshoot = block_point.row - cursor.start().0 .0;
653 let wrap_row = cursor.start().1 .0 + overshoot;
654 WrapPoint::new(wrap_row, block_point.column)
655 }
656 }
657 } else {
658 self.wrap_snapshot.max_point()
659 }
660 }
661}
662
663impl Transform {
664 fn isomorphic(rows: u32) -> Self {
665 Self {
666 summary: TransformSummary {
667 input_rows: rows,
668 output_rows: rows,
669 },
670 block: None,
671 }
672 }
673
674 fn block(block: Arc<Block>, column: u32) -> Self {
675 Self {
676 summary: TransformSummary {
677 input_rows: 0,
678 output_rows: block.height as u32,
679 },
680 block: Some(AlignedBlock { block, column }),
681 }
682 }
683
684 fn is_isomorphic(&self) -> bool {
685 self.block.is_none()
686 }
687}
688
689impl<'a> Iterator for BlockChunks<'a> {
690 type Item = Chunk<'a>;
691
692 fn next(&mut self) -> Option<Self::Item> {
693 if self.output_row >= self.max_output_row {
694 return None;
695 }
696
697 let transform = self.transforms.item()?;
698 if transform.block.is_some() {
699 let block_start = self.transforms.start().0 .0;
700 let mut block_end = self.transforms.end(&()).0 .0;
701 self.transforms.next(&());
702 if self.transforms.item().is_none() {
703 block_end -= 1;
704 }
705
706 let start_in_block = self.output_row - block_start;
707 let end_in_block = cmp::min(self.max_output_row, block_end) - block_start;
708 let line_count = end_in_block - start_in_block;
709 self.output_row += line_count;
710
711 return Some(Chunk {
712 text: unsafe { std::str::from_utf8_unchecked(&NEWLINES[..line_count as usize]) },
713 highlight_id: None,
714 diagnostic: None,
715 });
716 }
717
718 if self.input_chunk.text.is_empty() {
719 if let Some(input_chunk) = self.input_chunks.next() {
720 self.input_chunk = input_chunk;
721 } else {
722 self.output_row += 1;
723 if self.output_row < self.max_output_row {
724 self.transforms.next(&());
725 return Some(Chunk {
726 text: "\n",
727 ..Default::default()
728 });
729 } else {
730 return None;
731 }
732 }
733 }
734
735 let transform_end = self.transforms.end(&()).0 .0;
736 let (prefix_rows, prefix_bytes) =
737 offset_for_row(self.input_chunk.text, transform_end - self.output_row);
738 self.output_row += prefix_rows;
739 let (prefix, suffix) = self.input_chunk.text.split_at(prefix_bytes);
740 self.input_chunk.text = suffix;
741 if self.output_row == transform_end {
742 self.transforms.next(&());
743 }
744
745 Some(Chunk {
746 text: prefix,
747 ..self.input_chunk
748 })
749 }
750}
751
752impl<'a> Iterator for BlockBufferRows<'a> {
753 type Item = Option<u32>;
754
755 fn next(&mut self) -> Option<Self::Item> {
756 if self.started {
757 self.output_row += 1;
758 } else {
759 self.started = true;
760 }
761
762 if self.output_row >= self.transforms.end(&()).0 .0 {
763 self.transforms.next(&());
764 }
765
766 let transform = self.transforms.item()?;
767 if transform.block.is_some() {
768 Some(None)
769 } else {
770 Some(self.input_buffer_rows.next().unwrap())
771 }
772 }
773}
774
775impl sum_tree::Item for Transform {
776 type Summary = TransformSummary;
777
778 fn summary(&self) -> Self::Summary {
779 self.summary.clone()
780 }
781}
782
783impl sum_tree::Summary for TransformSummary {
784 type Context = ();
785
786 fn add_summary(&mut self, summary: &Self, _: &()) {
787 self.input_rows += summary.input_rows;
788 self.output_rows += summary.output_rows;
789 }
790}
791
792impl<'a> sum_tree::Dimension<'a, TransformSummary> for WrapRow {
793 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
794 self.0 += summary.input_rows;
795 }
796}
797
798impl<'a> sum_tree::Dimension<'a, TransformSummary> for BlockRow {
799 fn add_summary(&mut self, summary: &'a TransformSummary, _: &()) {
800 self.0 += summary.output_rows;
801 }
802}
803
804impl BlockDisposition {
805 fn is_below(&self) -> bool {
806 matches!(self, BlockDisposition::Below)
807 }
808}
809
810impl AlignedBlock {
811 pub fn height(&self) -> u32 {
812 self.height as u32
813 }
814
815 pub fn column(&self) -> u32 {
816 self.column
817 }
818
819 pub fn render(&self, cx: &BlockContext) -> ElementBox {
820 self.render.lock()(cx)
821 }
822
823 pub fn position(&self) -> &Anchor {
824 &self.block.position
825 }
826}
827
828impl Deref for AlignedBlock {
829 type Target = Block;
830
831 fn deref(&self) -> &Self::Target {
832 self.block.as_ref()
833 }
834}
835
836impl<'a> Deref for BlockContext<'a> {
837 type Target = AppContext;
838
839 fn deref(&self) -> &Self::Target {
840 &self.cx
841 }
842}
843
844impl Debug for Block {
845 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
846 f.debug_struct("Block")
847 .field("id", &self.id)
848 .field("position", &self.position)
849 .field("disposition", &self.disposition)
850 .finish()
851 }
852}
853
854// Count the number of bytes prior to a target point. If the string doesn't contain the target
855// point, return its total extent. Otherwise return the target point itself.
856fn offset_for_row(s: &str, target: u32) -> (u32, usize) {
857 let mut row = 0;
858 let mut offset = 0;
859 for (ix, line) in s.split('\n').enumerate() {
860 if ix > 0 {
861 row += 1;
862 offset += 1;
863 }
864 if row >= target {
865 break;
866 }
867 offset += line.len() as usize;
868 }
869 (row, offset)
870}
871
872#[cfg(test)]
873mod tests {
874 use super::*;
875 use crate::display_map::{fold_map::FoldMap, tab_map::TabMap, wrap_map::WrapMap};
876 use crate::multi_buffer::MultiBuffer;
877 use gpui::{elements::Empty, Element};
878 use rand::prelude::*;
879 use std::env;
880 use text::RandomCharIter;
881
882 #[gpui::test]
883 fn test_offset_for_row() {
884 assert_eq!(offset_for_row("", 0), (0, 0));
885 assert_eq!(offset_for_row("", 1), (0, 0));
886 assert_eq!(offset_for_row("abcd", 0), (0, 0));
887 assert_eq!(offset_for_row("abcd", 1), (0, 4));
888 assert_eq!(offset_for_row("\n", 0), (0, 0));
889 assert_eq!(offset_for_row("\n", 1), (1, 1));
890 assert_eq!(offset_for_row("abc\ndef\nghi", 0), (0, 0));
891 assert_eq!(offset_for_row("abc\ndef\nghi", 1), (1, 4));
892 assert_eq!(offset_for_row("abc\ndef\nghi", 2), (2, 8));
893 assert_eq!(offset_for_row("abc\ndef\nghi", 3), (2, 11));
894 }
895
896 #[gpui::test]
897 fn test_basic_blocks(cx: &mut gpui::MutableAppContext) {
898 let family_id = cx.font_cache().load_family(&["Helvetica"]).unwrap();
899 let font_id = cx
900 .font_cache()
901 .select_font(family_id, &Default::default())
902 .unwrap();
903
904 let text = "aaa\nbbb\nccc\nddd";
905
906 let buffer = MultiBuffer::build_simple(text, cx);
907 let buffer_snapshot = buffer.read(cx).snapshot(cx);
908 let subscription = buffer.update(cx, |buffer, _| buffer.subscribe());
909 let (fold_map, folds_snapshot) = FoldMap::new(buffer_snapshot.clone());
910 let (tab_map, tabs_snapshot) = TabMap::new(folds_snapshot.clone(), 1);
911 let (wrap_map, wraps_snapshot) = WrapMap::new(tabs_snapshot, font_id, 14.0, None, cx);
912 let mut block_map = BlockMap::new(wraps_snapshot.clone());
913
914 let mut writer = block_map.write(wraps_snapshot.clone(), vec![]);
915 writer.insert(vec![
916 BlockProperties {
917 position: buffer_snapshot.anchor_after(Point::new(1, 0)),
918 height: 1,
919 disposition: BlockDisposition::Above,
920 render: Arc::new(|_| Empty::new().named("block 1")),
921 },
922 BlockProperties {
923 position: buffer_snapshot.anchor_after(Point::new(1, 2)),
924 height: 2,
925 disposition: BlockDisposition::Above,
926 render: Arc::new(|_| Empty::new().named("block 2")),
927 },
928 BlockProperties {
929 position: buffer_snapshot.anchor_after(Point::new(3, 3)),
930 height: 3,
931 disposition: BlockDisposition::Below,
932 render: Arc::new(|_| Empty::new().named("block 3")),
933 },
934 ]);
935
936 let snapshot = block_map.read(wraps_snapshot, vec![]);
937 assert_eq!(snapshot.text(), "aaa\n\n\n\nbbb\nccc\nddd\n\n\n");
938
939 let blocks = snapshot
940 .blocks_in_range(0..8)
941 .map(|(start_row, block)| {
942 (
943 start_row..start_row + block.height(),
944 block.column(),
945 block
946 .render(&BlockContext {
947 cx,
948 anchor_x: 0.,
949 gutter_padding: 0.,
950 scroll_x: 0.,
951 gutter_width: 0.,
952 line_height: 0.,
953 em_width: 0.,
954 })
955 .name()
956 .unwrap()
957 .to_string(),
958 )
959 })
960 .collect::<Vec<_>>();
961
962 // When multiple blocks are on the same line, the newer blocks appear first.
963 assert_eq!(
964 blocks,
965 &[
966 (1..3, 2, "block 2".to_string()),
967 (3..4, 0, "block 1".to_string()),
968 (7..10, 3, "block 3".to_string()),
969 ]
970 );
971
972 assert_eq!(
973 snapshot.to_block_point(WrapPoint::new(0, 3)),
974 BlockPoint::new(0, 3)
975 );
976 assert_eq!(
977 snapshot.to_block_point(WrapPoint::new(1, 0)),
978 BlockPoint::new(4, 0)
979 );
980 assert_eq!(
981 snapshot.to_block_point(WrapPoint::new(3, 3)),
982 BlockPoint::new(6, 3)
983 );
984
985 assert_eq!(
986 snapshot.to_wrap_point(BlockPoint::new(0, 3)),
987 WrapPoint::new(0, 3)
988 );
989 assert_eq!(
990 snapshot.to_wrap_point(BlockPoint::new(1, 0)),
991 WrapPoint::new(1, 0)
992 );
993 assert_eq!(
994 snapshot.to_wrap_point(BlockPoint::new(3, 0)),
995 WrapPoint::new(1, 0)
996 );
997 assert_eq!(
998 snapshot.to_wrap_point(BlockPoint::new(7, 0)),
999 WrapPoint::new(3, 3)
1000 );
1001
1002 assert_eq!(
1003 snapshot.clip_point(BlockPoint::new(1, 0), Bias::Left),
1004 BlockPoint::new(0, 3)
1005 );
1006 assert_eq!(
1007 snapshot.clip_point(BlockPoint::new(1, 0), Bias::Right),
1008 BlockPoint::new(4, 0)
1009 );
1010 assert_eq!(
1011 snapshot.clip_point(BlockPoint::new(1, 1), Bias::Left),
1012 BlockPoint::new(0, 3)
1013 );
1014 assert_eq!(
1015 snapshot.clip_point(BlockPoint::new(1, 1), Bias::Right),
1016 BlockPoint::new(4, 0)
1017 );
1018 assert_eq!(
1019 snapshot.clip_point(BlockPoint::new(4, 0), Bias::Left),
1020 BlockPoint::new(4, 0)
1021 );
1022 assert_eq!(
1023 snapshot.clip_point(BlockPoint::new(4, 0), Bias::Right),
1024 BlockPoint::new(4, 0)
1025 );
1026 assert_eq!(
1027 snapshot.clip_point(BlockPoint::new(6, 3), Bias::Left),
1028 BlockPoint::new(6, 3)
1029 );
1030 assert_eq!(
1031 snapshot.clip_point(BlockPoint::new(6, 3), Bias::Right),
1032 BlockPoint::new(6, 3)
1033 );
1034 assert_eq!(
1035 snapshot.clip_point(BlockPoint::new(7, 0), Bias::Left),
1036 BlockPoint::new(6, 3)
1037 );
1038 assert_eq!(
1039 snapshot.clip_point(BlockPoint::new(7, 0), Bias::Right),
1040 BlockPoint::new(6, 3)
1041 );
1042
1043 assert_eq!(
1044 snapshot.buffer_rows(0).collect::<Vec<_>>(),
1045 &[
1046 Some(0),
1047 None,
1048 None,
1049 None,
1050 Some(1),
1051 Some(2),
1052 Some(3),
1053 None,
1054 None,
1055 None
1056 ]
1057 );
1058
1059 // Insert a line break, separating two block decorations into separate lines.
1060 let buffer_snapshot = buffer.update(cx, |buffer, cx| {
1061 buffer.edit([Point::new(1, 1)..Point::new(1, 1)], "!!!\n", cx);
1062 buffer.snapshot(cx)
1063 });
1064
1065 let (folds_snapshot, fold_edits) =
1066 fold_map.read(buffer_snapshot, subscription.consume().into_inner());
1067 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
1068 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
1069 wrap_map.sync(tabs_snapshot, tab_edits, cx)
1070 });
1071 let snapshot = block_map.read(wraps_snapshot, wrap_edits);
1072 assert_eq!(snapshot.text(), "aaa\n\nb!!!\n\n\nbb\nccc\nddd\n\n\n");
1073 }
1074
1075 #[gpui::test]
1076 fn test_blocks_on_wrapped_lines(cx: &mut gpui::MutableAppContext) {
1077 let family_id = cx.font_cache().load_family(&["Helvetica"]).unwrap();
1078 let font_id = cx
1079 .font_cache()
1080 .select_font(family_id, &Default::default())
1081 .unwrap();
1082
1083 let text = "one two three\nfour five six\nseven eight";
1084
1085 let buffer = MultiBuffer::build_simple(text, cx);
1086 let buffer_snapshot = buffer.read(cx).snapshot(cx);
1087 let (_, folds_snapshot) = FoldMap::new(buffer_snapshot.clone());
1088 let (_, tabs_snapshot) = TabMap::new(folds_snapshot.clone(), 1);
1089 let (_, wraps_snapshot) = WrapMap::new(tabs_snapshot, font_id, 14.0, Some(60.), cx);
1090 let mut block_map = BlockMap::new(wraps_snapshot.clone());
1091
1092 let mut writer = block_map.write(wraps_snapshot.clone(), vec![]);
1093 writer.insert(vec![
1094 BlockProperties {
1095 position: buffer_snapshot.anchor_after(Point::new(1, 12)),
1096 disposition: BlockDisposition::Above,
1097 render: Arc::new(|_| Empty::new().named("block 1")),
1098 height: 1,
1099 },
1100 BlockProperties {
1101 position: buffer_snapshot.anchor_after(Point::new(1, 1)),
1102 disposition: BlockDisposition::Below,
1103 render: Arc::new(|_| Empty::new().named("block 2")),
1104 height: 1,
1105 },
1106 ]);
1107
1108 // Blocks with an 'above' disposition go above their corresponding buffer line.
1109 // Blocks with a 'below' disposition go below their corresponding buffer line.
1110 let snapshot = block_map.read(wraps_snapshot, vec![]);
1111 assert_eq!(
1112 snapshot.text(),
1113 "one two \nthree\n\nfour five \nsix\n\nseven \neight"
1114 );
1115 }
1116
1117 #[gpui::test(iterations = 100)]
1118 fn test_random_blocks(cx: &mut gpui::MutableAppContext, mut rng: StdRng) {
1119 let operations = env::var("OPERATIONS")
1120 .map(|i| i.parse().expect("invalid `OPERATIONS` variable"))
1121 .unwrap_or(10);
1122
1123 let wrap_width = if rng.gen_bool(0.2) {
1124 None
1125 } else {
1126 Some(rng.gen_range(0.0..=100.0))
1127 };
1128 let tab_size = 1;
1129 let family_id = cx.font_cache().load_family(&["Helvetica"]).unwrap();
1130 let font_id = cx
1131 .font_cache()
1132 .select_font(family_id, &Default::default())
1133 .unwrap();
1134 let font_size = 14.0;
1135
1136 log::info!("Wrap width: {:?}", wrap_width);
1137
1138 let buffer = if rng.gen() {
1139 let len = rng.gen_range(0..10);
1140 let text = RandomCharIter::new(&mut rng).take(len).collect::<String>();
1141 log::info!("initial buffer text: {:?}", text);
1142 MultiBuffer::build_simple(&text, cx)
1143 } else {
1144 MultiBuffer::build_random(&mut rng, cx)
1145 };
1146
1147 let mut buffer_snapshot = buffer.read(cx).snapshot(cx);
1148 let (fold_map, folds_snapshot) = FoldMap::new(buffer_snapshot.clone());
1149 let (tab_map, tabs_snapshot) = TabMap::new(folds_snapshot.clone(), tab_size);
1150 let (wrap_map, wraps_snapshot) =
1151 WrapMap::new(tabs_snapshot, font_id, font_size, wrap_width, cx);
1152 let mut block_map = BlockMap::new(wraps_snapshot);
1153 let mut expected_blocks = Vec::new();
1154
1155 for _ in 0..operations {
1156 let mut buffer_edits = Vec::new();
1157 match rng.gen_range(0..=100) {
1158 0..=19 => {
1159 let wrap_width = if rng.gen_bool(0.2) {
1160 None
1161 } else {
1162 Some(rng.gen_range(0.0..=100.0))
1163 };
1164 log::info!("Setting wrap width to {:?}", wrap_width);
1165 wrap_map.update(cx, |map, cx| map.set_wrap_width(wrap_width, cx));
1166 }
1167 20..=39 => {
1168 let block_count = rng.gen_range(1..=5);
1169 let block_properties = (0..block_count)
1170 .map(|_| {
1171 let buffer = buffer.read(cx).read(cx);
1172 let position = buffer.anchor_after(
1173 buffer.clip_offset(rng.gen_range(0..=buffer.len()), Bias::Left),
1174 );
1175
1176 let disposition = if rng.gen() {
1177 BlockDisposition::Above
1178 } else {
1179 BlockDisposition::Below
1180 };
1181 let height = rng.gen_range(1..5);
1182 log::info!(
1183 "inserting block {:?} {:?} with height {}",
1184 disposition,
1185 position.to_point(&buffer),
1186 height
1187 );
1188 BlockProperties {
1189 position,
1190 height,
1191 disposition,
1192 render: Arc::new(|_| Empty::new().boxed()),
1193 }
1194 })
1195 .collect::<Vec<_>>();
1196
1197 let (folds_snapshot, fold_edits) =
1198 fold_map.read(buffer_snapshot.clone(), vec![]);
1199 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
1200 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
1201 wrap_map.sync(tabs_snapshot, tab_edits, cx)
1202 });
1203 let mut block_map = block_map.write(wraps_snapshot, wrap_edits);
1204 let block_ids = block_map.insert(block_properties.clone());
1205 for (block_id, props) in block_ids.into_iter().zip(block_properties) {
1206 expected_blocks.push((block_id, props));
1207 }
1208 }
1209 40..=59 if !expected_blocks.is_empty() => {
1210 let block_count = rng.gen_range(1..=4.min(expected_blocks.len()));
1211 let block_ids_to_remove = (0..block_count)
1212 .map(|_| {
1213 expected_blocks
1214 .remove(rng.gen_range(0..expected_blocks.len()))
1215 .0
1216 })
1217 .collect();
1218
1219 let (folds_snapshot, fold_edits) =
1220 fold_map.read(buffer_snapshot.clone(), vec![]);
1221 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
1222 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
1223 wrap_map.sync(tabs_snapshot, tab_edits, cx)
1224 });
1225 let mut block_map = block_map.write(wraps_snapshot, wrap_edits);
1226 block_map.remove(block_ids_to_remove);
1227 }
1228 _ => {
1229 buffer.update(cx, |buffer, cx| {
1230 let edit_count = rng.gen_range(1..=5);
1231 let subscription = buffer.subscribe();
1232 buffer.randomly_edit(&mut rng, edit_count, cx);
1233 buffer_snapshot = buffer.snapshot(cx);
1234 buffer_edits.extend(subscription.consume());
1235 log::info!("buffer text: {:?}", buffer_snapshot.text());
1236 });
1237 }
1238 }
1239
1240 let (folds_snapshot, fold_edits) = fold_map.read(buffer_snapshot.clone(), buffer_edits);
1241 let (tabs_snapshot, tab_edits) = tab_map.sync(folds_snapshot, fold_edits);
1242 let (wraps_snapshot, wrap_edits) = wrap_map.update(cx, |wrap_map, cx| {
1243 wrap_map.sync(tabs_snapshot, tab_edits, cx)
1244 });
1245 let blocks_snapshot = block_map.read(wraps_snapshot.clone(), wrap_edits);
1246 assert_eq!(
1247 blocks_snapshot.transforms.summary().input_rows,
1248 wraps_snapshot.max_point().row() + 1
1249 );
1250 log::info!("blocks text: {:?}", blocks_snapshot.text());
1251
1252 let mut sorted_blocks = expected_blocks
1253 .iter()
1254 .cloned()
1255 .map(|(id, block)| {
1256 let mut position = block.position.to_point(&buffer_snapshot);
1257 let column = wraps_snapshot.from_point(position, Bias::Left).column();
1258 match block.disposition {
1259 BlockDisposition::Above => {
1260 position.column = 0;
1261 }
1262 BlockDisposition::Below => {
1263 position.column = buffer_snapshot.line_len(position.row);
1264 }
1265 };
1266 let row = wraps_snapshot.from_point(position, Bias::Left).row();
1267 (
1268 id,
1269 BlockProperties {
1270 position: BlockPoint::new(row, column),
1271 height: block.height,
1272 disposition: block.disposition,
1273 render: block.render.clone(),
1274 },
1275 )
1276 })
1277 .collect::<Vec<_>>();
1278 sorted_blocks.sort_unstable_by_key(|(id, block)| {
1279 (block.position.row, block.disposition, Reverse(*id))
1280 });
1281 let mut sorted_blocks_iter = sorted_blocks.iter().peekable();
1282
1283 let input_buffer_rows = buffer_snapshot.buffer_rows(0).collect::<Vec<_>>();
1284 let mut expected_buffer_rows = Vec::new();
1285 let mut expected_text = String::new();
1286 let mut expected_block_positions = Vec::new();
1287 let input_text = wraps_snapshot.text();
1288 for (row, input_line) in input_text.split('\n').enumerate() {
1289 let row = row as u32;
1290 if row > 0 {
1291 expected_text.push('\n');
1292 }
1293
1294 let buffer_row = input_buffer_rows[wraps_snapshot
1295 .to_point(WrapPoint::new(row, 0), Bias::Left)
1296 .row as usize];
1297
1298 while let Some((block_id, block)) = sorted_blocks_iter.peek() {
1299 if block.position.row == row && block.disposition == BlockDisposition::Above {
1300 expected_block_positions
1301 .push((expected_text.matches('\n').count() as u32, *block_id));
1302 let text = "\n".repeat(block.height as usize);
1303 expected_text.push_str(&text);
1304 for _ in 0..block.height {
1305 expected_buffer_rows.push(None);
1306 }
1307 sorted_blocks_iter.next();
1308 } else {
1309 break;
1310 }
1311 }
1312
1313 let soft_wrapped = wraps_snapshot.to_tab_point(WrapPoint::new(row, 0)).column() > 0;
1314 expected_buffer_rows.push(if soft_wrapped { None } else { buffer_row });
1315 expected_text.push_str(input_line);
1316
1317 while let Some((block_id, block)) = sorted_blocks_iter.peek() {
1318 if block.position.row == row && block.disposition == BlockDisposition::Below {
1319 expected_block_positions
1320 .push((expected_text.matches('\n').count() as u32 + 1, *block_id));
1321 let text = "\n".repeat(block.height as usize);
1322 expected_text.push_str(&text);
1323 for _ in 0..block.height {
1324 expected_buffer_rows.push(None);
1325 }
1326 sorted_blocks_iter.next();
1327 } else {
1328 break;
1329 }
1330 }
1331 }
1332
1333 let expected_lines = expected_text.split('\n').collect::<Vec<_>>();
1334 let expected_row_count = expected_lines.len();
1335 for start_row in 0..expected_row_count {
1336 let expected_text = expected_lines[start_row..].join("\n");
1337 let actual_text = blocks_snapshot
1338 .chunks(start_row as u32..expected_row_count as u32)
1339 .map(|chunk| chunk.text)
1340 .collect::<String>();
1341 assert_eq!(
1342 actual_text, expected_text,
1343 "incorrect text starting from row {}",
1344 start_row
1345 );
1346 assert_eq!(
1347 blocks_snapshot
1348 .buffer_rows(start_row as u32)
1349 .collect::<Vec<_>>(),
1350 &expected_buffer_rows[start_row..]
1351 );
1352 }
1353
1354 assert_eq!(
1355 blocks_snapshot
1356 .blocks_in_range(0..(expected_row_count as u32))
1357 .map(|(row, block)| (row, block.id))
1358 .collect::<Vec<_>>(),
1359 expected_block_positions
1360 );
1361
1362 let mut expected_longest_rows = Vec::new();
1363 let mut longest_line_len = -1_isize;
1364 for (row, line) in expected_lines.iter().enumerate() {
1365 let row = row as u32;
1366
1367 assert_eq!(
1368 blocks_snapshot.line_len(row),
1369 line.len() as u32,
1370 "invalid line len for row {}",
1371 row
1372 );
1373
1374 let line_char_count = line.chars().count() as isize;
1375 match line_char_count.cmp(&longest_line_len) {
1376 Ordering::Less => {}
1377 Ordering::Equal => expected_longest_rows.push(row),
1378 Ordering::Greater => {
1379 longest_line_len = line_char_count;
1380 expected_longest_rows.clear();
1381 expected_longest_rows.push(row);
1382 }
1383 }
1384 }
1385
1386 let longest_row = blocks_snapshot.longest_row();
1387 assert!(
1388 expected_longest_rows.contains(&longest_row),
1389 "incorrect longest row {}. expected {:?} with length {}",
1390 longest_row,
1391 expected_longest_rows,
1392 longest_line_len,
1393 );
1394
1395 for row in 0..=blocks_snapshot.wrap_snapshot.max_point().row() {
1396 let wrap_point = WrapPoint::new(row, 0);
1397 let block_point = blocks_snapshot.to_block_point(wrap_point);
1398 assert_eq!(blocks_snapshot.to_wrap_point(block_point), wrap_point);
1399 }
1400
1401 let mut block_point = BlockPoint::new(0, 0);
1402 for c in expected_text.chars() {
1403 let left_point = blocks_snapshot.clip_point(block_point, Bias::Left);
1404 let left_buffer_point = blocks_snapshot.to_point(left_point, Bias::Left);
1405 assert_eq!(
1406 blocks_snapshot.to_block_point(blocks_snapshot.to_wrap_point(left_point)),
1407 left_point
1408 );
1409 assert_eq!(
1410 left_buffer_point,
1411 buffer_snapshot.clip_point(left_buffer_point, Bias::Right),
1412 "{:?} is not valid in buffer coordinates",
1413 left_point
1414 );
1415
1416 let right_point = blocks_snapshot.clip_point(block_point, Bias::Right);
1417 let right_buffer_point = blocks_snapshot.to_point(right_point, Bias::Right);
1418 assert_eq!(
1419 blocks_snapshot.to_block_point(blocks_snapshot.to_wrap_point(right_point)),
1420 right_point
1421 );
1422 assert_eq!(
1423 right_buffer_point,
1424 buffer_snapshot.clip_point(right_buffer_point, Bias::Left),
1425 "{:?} is not valid in buffer coordinates",
1426 right_point
1427 );
1428
1429 if c == '\n' {
1430 block_point.0 += Point::new(1, 0);
1431 } else {
1432 block_point.column += c.len_utf8() as u32;
1433 }
1434 }
1435 }
1436 }
1437
1438 impl BlockSnapshot {
1439 fn to_point(&self, point: BlockPoint, bias: Bias) -> Point {
1440 self.wrap_snapshot.to_point(self.to_wrap_point(point), bias)
1441 }
1442 }
1443}