1pub use crate::{
2 diagnostic_set::DiagnosticSet,
3 highlight_map::{HighlightId, HighlightMap},
4 proto, BracketPair, Grammar, Language, LanguageConfig, LanguageRegistry, PLAIN_TEXT,
5};
6use crate::{
7 diagnostic_set::{DiagnosticEntry, DiagnosticGroup},
8 outline::OutlineItem,
9 syntax_map::{
10 SyntaxMap, SyntaxMapCapture, SyntaxMapCaptures, SyntaxSnapshot, ToTreeSitterPoint,
11 },
12 CodeLabel, LanguageScope, Outline,
13};
14use anyhow::{anyhow, Result};
15use clock::ReplicaId;
16use fs::LineEnding;
17use futures::FutureExt as _;
18use gpui::{fonts::HighlightStyle, AppContext, Entity, ModelContext, MutableAppContext, Task};
19use parking_lot::Mutex;
20use settings::Settings;
21use similar::{ChangeTag, TextDiff};
22use smol::future::yield_now;
23use std::{
24 any::Any,
25 cmp::{self, Ordering},
26 collections::BTreeMap,
27 ffi::OsStr,
28 future::Future,
29 iter::{self, Iterator, Peekable},
30 mem,
31 ops::{Deref, Range},
32 path::{Path, PathBuf},
33 str,
34 sync::Arc,
35 time::{Duration, Instant, SystemTime, UNIX_EPOCH},
36 vec,
37};
38use sum_tree::TreeMap;
39use text::operation_queue::OperationQueue;
40pub use text::{Buffer as TextBuffer, BufferSnapshot as TextBufferSnapshot, Operation as _, *};
41use theme::SyntaxTheme;
42#[cfg(any(test, feature = "test-support"))]
43use util::RandomCharIter;
44use util::{RangeExt, TryFutureExt as _};
45
46#[cfg(any(test, feature = "test-support"))]
47pub use {tree_sitter_rust, tree_sitter_typescript};
48
49pub use lsp::DiagnosticSeverity;
50
51struct GitDiffStatus {
52 diff: git::diff::BufferDiff,
53 update_in_progress: bool,
54 update_requested: bool,
55}
56
57pub struct Buffer {
58 text: TextBuffer,
59 diff_base: Option<String>,
60 git_diff_status: GitDiffStatus,
61 file: Option<Arc<dyn File>>,
62 saved_version: clock::Global,
63 saved_version_fingerprint: RopeFingerprint,
64 saved_mtime: SystemTime,
65 transaction_depth: usize,
66 was_dirty_before_starting_transaction: Option<bool>,
67 language: Option<Arc<Language>>,
68 autoindent_requests: Vec<Arc<AutoindentRequest>>,
69 pending_autoindent: Option<Task<()>>,
70 sync_parse_timeout: Duration,
71 syntax_map: Mutex<SyntaxMap>,
72 parsing_in_background: bool,
73 parse_count: usize,
74 diagnostics: DiagnosticSet,
75 remote_selections: TreeMap<ReplicaId, SelectionSet>,
76 selections_update_count: usize,
77 diagnostics_update_count: usize,
78 diagnostics_timestamp: clock::Lamport,
79 file_update_count: usize,
80 git_diff_update_count: usize,
81 completion_triggers: Vec<String>,
82 completion_triggers_timestamp: clock::Lamport,
83 deferred_ops: OperationQueue<Operation>,
84}
85
86pub struct BufferSnapshot {
87 text: text::BufferSnapshot,
88 pub git_diff: git::diff::BufferDiff,
89 pub(crate) syntax: SyntaxSnapshot,
90 file: Option<Arc<dyn File>>,
91 diagnostics: DiagnosticSet,
92 diagnostics_update_count: usize,
93 file_update_count: usize,
94 git_diff_update_count: usize,
95 remote_selections: TreeMap<ReplicaId, SelectionSet>,
96 selections_update_count: usize,
97 language: Option<Arc<Language>>,
98 parse_count: usize,
99}
100
101#[derive(Clone, Copy, Debug, PartialEq, Eq, Default)]
102pub struct IndentSize {
103 pub len: u32,
104 pub kind: IndentKind,
105}
106
107#[derive(Clone, Copy, Debug, PartialEq, Eq, Default)]
108pub enum IndentKind {
109 #[default]
110 Space,
111 Tab,
112}
113
114#[derive(Copy, Clone, PartialEq, Eq, Debug, Default)]
115pub enum CursorShape {
116 #[default]
117 Bar,
118 Block,
119 Underscore,
120 Hollow,
121}
122
123#[derive(Clone, Debug)]
124struct SelectionSet {
125 line_mode: bool,
126 cursor_shape: CursorShape,
127 selections: Arc<[Selection<Anchor>]>,
128 lamport_timestamp: clock::Lamport,
129}
130
131#[derive(Clone, Debug, PartialEq, Eq)]
132pub struct GroupId {
133 source: Arc<str>,
134 id: usize,
135}
136
137#[derive(Clone, Debug, PartialEq, Eq)]
138pub struct Diagnostic {
139 pub code: Option<String>,
140 pub severity: DiagnosticSeverity,
141 pub message: String,
142 pub group_id: usize,
143 pub is_valid: bool,
144 pub is_primary: bool,
145 pub is_disk_based: bool,
146 pub is_unnecessary: bool,
147}
148
149#[derive(Clone, Debug)]
150pub struct Completion {
151 pub old_range: Range<Anchor>,
152 pub new_text: String,
153 pub label: CodeLabel,
154 pub lsp_completion: lsp::CompletionItem,
155}
156
157#[derive(Clone, Debug)]
158pub struct CodeAction {
159 pub range: Range<Anchor>,
160 pub lsp_action: lsp::CodeAction,
161}
162
163#[derive(Clone, Debug, PartialEq, Eq)]
164pub enum Operation {
165 Buffer(text::Operation),
166 UpdateDiagnostics {
167 diagnostics: Arc<[DiagnosticEntry<Anchor>]>,
168 lamport_timestamp: clock::Lamport,
169 },
170 UpdateSelections {
171 selections: Arc<[Selection<Anchor>]>,
172 lamport_timestamp: clock::Lamport,
173 line_mode: bool,
174 cursor_shape: CursorShape,
175 },
176 UpdateCompletionTriggers {
177 triggers: Vec<String>,
178 lamport_timestamp: clock::Lamport,
179 },
180}
181
182#[derive(Clone, Debug, PartialEq, Eq)]
183pub enum Event {
184 Operation(Operation),
185 Edited,
186 DirtyChanged,
187 Saved,
188 FileHandleChanged,
189 Reloaded,
190 Reparsed,
191 DiagnosticsUpdated,
192 Closed,
193}
194
195pub trait File: Send + Sync {
196 fn as_local(&self) -> Option<&dyn LocalFile>;
197
198 fn is_local(&self) -> bool {
199 self.as_local().is_some()
200 }
201
202 fn mtime(&self) -> SystemTime;
203
204 /// Returns the path of this file relative to the worktree's root directory.
205 fn path(&self) -> &Arc<Path>;
206
207 /// Returns the path of this file relative to the worktree's parent directory (this means it
208 /// includes the name of the worktree's root folder).
209 fn full_path(&self, cx: &AppContext) -> PathBuf;
210
211 /// Returns the last component of this handle's absolute path. If this handle refers to the root
212 /// of its worktree, then this method will return the name of the worktree itself.
213 fn file_name<'a>(&'a self, cx: &'a AppContext) -> &'a OsStr;
214
215 fn is_deleted(&self) -> bool;
216
217 fn as_any(&self) -> &dyn Any;
218
219 fn to_proto(&self) -> rpc::proto::File;
220}
221
222pub trait LocalFile: File {
223 /// Returns the absolute path of this file.
224 fn abs_path(&self, cx: &AppContext) -> PathBuf;
225
226 fn load(&self, cx: &AppContext) -> Task<Result<String>>;
227
228 fn buffer_reloaded(
229 &self,
230 buffer_id: u64,
231 version: &clock::Global,
232 fingerprint: RopeFingerprint,
233 line_ending: LineEnding,
234 mtime: SystemTime,
235 cx: &mut MutableAppContext,
236 );
237}
238
239#[derive(Clone, Debug)]
240pub enum AutoindentMode {
241 /// Indent each line of inserted text.
242 EachLine,
243 /// Apply the same indentation adjustment to all of the lines
244 /// in a given insertion.
245 Block {
246 /// The original indentation level of the first line of each
247 /// insertion, if it has been copied.
248 original_indent_columns: Vec<u32>,
249 },
250}
251
252#[derive(Clone)]
253struct AutoindentRequest {
254 before_edit: BufferSnapshot,
255 entries: Vec<AutoindentRequestEntry>,
256 is_block_mode: bool,
257}
258
259#[derive(Clone)]
260struct AutoindentRequestEntry {
261 /// A range of the buffer whose indentation should be adjusted.
262 range: Range<Anchor>,
263 /// Whether or not these lines should be considered brand new, for the
264 /// purpose of auto-indent. When text is not new, its indentation will
265 /// only be adjusted if the suggested indentation level has *changed*
266 /// since the edit was made.
267 first_line_is_new: bool,
268 indent_size: IndentSize,
269 original_indent_column: Option<u32>,
270}
271
272#[derive(Debug)]
273struct IndentSuggestion {
274 basis_row: u32,
275 delta: Ordering,
276 within_error: bool,
277}
278
279struct BufferChunkHighlights<'a> {
280 captures: SyntaxMapCaptures<'a>,
281 next_capture: Option<SyntaxMapCapture<'a>>,
282 stack: Vec<(usize, HighlightId)>,
283 highlight_maps: Vec<HighlightMap>,
284}
285
286pub struct BufferChunks<'a> {
287 range: Range<usize>,
288 chunks: text::Chunks<'a>,
289 diagnostic_endpoints: Peekable<vec::IntoIter<DiagnosticEndpoint>>,
290 error_depth: usize,
291 warning_depth: usize,
292 information_depth: usize,
293 hint_depth: usize,
294 unnecessary_depth: usize,
295 highlights: Option<BufferChunkHighlights<'a>>,
296}
297
298#[derive(Clone, Copy, Debug, Default)]
299pub struct Chunk<'a> {
300 pub text: &'a str,
301 pub syntax_highlight_id: Option<HighlightId>,
302 pub highlight_style: Option<HighlightStyle>,
303 pub diagnostic_severity: Option<DiagnosticSeverity>,
304 pub is_unnecessary: bool,
305}
306
307pub struct Diff {
308 pub(crate) base_version: clock::Global,
309 line_ending: LineEnding,
310 edits: Vec<(Range<usize>, Arc<str>)>,
311}
312
313#[derive(Clone, Copy)]
314pub(crate) struct DiagnosticEndpoint {
315 offset: usize,
316 is_start: bool,
317 severity: DiagnosticSeverity,
318 is_unnecessary: bool,
319}
320
321#[derive(Copy, Clone, Eq, PartialEq, PartialOrd, Ord, Debug)]
322pub enum CharKind {
323 Punctuation,
324 Whitespace,
325 Word,
326}
327
328impl CharKind {
329 pub fn coerce_punctuation(self, treat_punctuation_as_word: bool) -> Self {
330 if treat_punctuation_as_word && self == CharKind::Punctuation {
331 CharKind::Word
332 } else {
333 self
334 }
335 }
336}
337
338impl Buffer {
339 pub fn new<T: Into<String>>(
340 replica_id: ReplicaId,
341 base_text: T,
342 cx: &mut ModelContext<Self>,
343 ) -> Self {
344 Self::build(
345 TextBuffer::new(replica_id, cx.model_id() as u64, base_text.into()),
346 None,
347 None,
348 )
349 }
350
351 pub fn from_file<T: Into<String>>(
352 replica_id: ReplicaId,
353 base_text: T,
354 diff_base: Option<T>,
355 file: Arc<dyn File>,
356 cx: &mut ModelContext<Self>,
357 ) -> Self {
358 Self::build(
359 TextBuffer::new(replica_id, cx.model_id() as u64, base_text.into()),
360 diff_base.map(|h| h.into().into_boxed_str().into()),
361 Some(file),
362 )
363 }
364
365 pub fn from_proto(
366 replica_id: ReplicaId,
367 message: proto::BufferState,
368 file: Option<Arc<dyn File>>,
369 ) -> Result<Self> {
370 let buffer = TextBuffer::new(replica_id, message.id, message.base_text);
371 let mut this = Self::build(
372 buffer,
373 message.diff_base.map(|text| text.into_boxed_str().into()),
374 file,
375 );
376 this.text.set_line_ending(proto::deserialize_line_ending(
377 rpc::proto::LineEnding::from_i32(message.line_ending)
378 .ok_or_else(|| anyhow!("missing line_ending"))?,
379 ));
380 this.saved_version = proto::deserialize_version(message.saved_version);
381 this.saved_version_fingerprint =
382 proto::deserialize_fingerprint(&message.saved_version_fingerprint)?;
383 this.saved_mtime = message
384 .saved_mtime
385 .ok_or_else(|| anyhow!("invalid saved_mtime"))?
386 .into();
387 Ok(this)
388 }
389
390 pub fn to_proto(&self) -> proto::BufferState {
391 proto::BufferState {
392 id: self.remote_id(),
393 file: self.file.as_ref().map(|f| f.to_proto()),
394 base_text: self.base_text().to_string(),
395 diff_base: self.diff_base.as_ref().map(|h| h.to_string()),
396 line_ending: proto::serialize_line_ending(self.line_ending()) as i32,
397 saved_version: proto::serialize_version(&self.saved_version),
398 saved_version_fingerprint: proto::serialize_fingerprint(self.saved_version_fingerprint),
399 saved_mtime: Some(self.saved_mtime.into()),
400 }
401 }
402
403 pub fn serialize_ops(
404 &self,
405 since: Option<clock::Global>,
406 cx: &AppContext,
407 ) -> Task<Vec<proto::Operation>> {
408 let mut operations = Vec::new();
409 operations.extend(self.deferred_ops.iter().map(proto::serialize_operation));
410 operations.extend(self.remote_selections.iter().map(|(_, set)| {
411 proto::serialize_operation(&Operation::UpdateSelections {
412 selections: set.selections.clone(),
413 lamport_timestamp: set.lamport_timestamp,
414 line_mode: set.line_mode,
415 cursor_shape: set.cursor_shape,
416 })
417 }));
418 operations.push(proto::serialize_operation(&Operation::UpdateDiagnostics {
419 diagnostics: self.diagnostics.iter().cloned().collect(),
420 lamport_timestamp: self.diagnostics_timestamp,
421 }));
422 operations.push(proto::serialize_operation(
423 &Operation::UpdateCompletionTriggers {
424 triggers: self.completion_triggers.clone(),
425 lamport_timestamp: self.completion_triggers_timestamp,
426 },
427 ));
428
429 let text_operations = self.text.operations().clone();
430 cx.background().spawn(async move {
431 let since = since.unwrap_or_default();
432 operations.extend(
433 text_operations
434 .iter()
435 .filter(|(_, op)| !since.observed(op.local_timestamp()))
436 .map(|(_, op)| proto::serialize_operation(&Operation::Buffer(op.clone()))),
437 );
438 operations.sort_unstable_by_key(proto::lamport_timestamp_for_operation);
439 operations
440 })
441 }
442
443 pub fn with_language(mut self, language: Arc<Language>, cx: &mut ModelContext<Self>) -> Self {
444 self.set_language(Some(language), cx);
445 self
446 }
447
448 fn build(buffer: TextBuffer, diff_base: Option<String>, file: Option<Arc<dyn File>>) -> Self {
449 let saved_mtime = if let Some(file) = file.as_ref() {
450 file.mtime()
451 } else {
452 UNIX_EPOCH
453 };
454
455 Self {
456 saved_mtime,
457 saved_version: buffer.version(),
458 saved_version_fingerprint: buffer.as_rope().fingerprint(),
459 transaction_depth: 0,
460 was_dirty_before_starting_transaction: None,
461 text: buffer,
462 diff_base,
463 git_diff_status: GitDiffStatus {
464 diff: git::diff::BufferDiff::new(),
465 update_in_progress: false,
466 update_requested: false,
467 },
468 file,
469 syntax_map: Mutex::new(SyntaxMap::new()),
470 parsing_in_background: false,
471 parse_count: 0,
472 sync_parse_timeout: Duration::from_millis(1),
473 autoindent_requests: Default::default(),
474 pending_autoindent: Default::default(),
475 language: None,
476 remote_selections: Default::default(),
477 selections_update_count: 0,
478 diagnostics: Default::default(),
479 diagnostics_update_count: 0,
480 diagnostics_timestamp: Default::default(),
481 file_update_count: 0,
482 git_diff_update_count: 0,
483 completion_triggers: Default::default(),
484 completion_triggers_timestamp: Default::default(),
485 deferred_ops: OperationQueue::new(),
486 }
487 }
488
489 pub fn snapshot(&self) -> BufferSnapshot {
490 let text = self.text.snapshot();
491 let mut syntax_map = self.syntax_map.lock();
492 syntax_map.interpolate(&text);
493 let syntax = syntax_map.snapshot();
494
495 BufferSnapshot {
496 text,
497 syntax,
498 git_diff: self.git_diff_status.diff.clone(),
499 file: self.file.clone(),
500 remote_selections: self.remote_selections.clone(),
501 diagnostics: self.diagnostics.clone(),
502 diagnostics_update_count: self.diagnostics_update_count,
503 file_update_count: self.file_update_count,
504 git_diff_update_count: self.git_diff_update_count,
505 language: self.language.clone(),
506 parse_count: self.parse_count,
507 selections_update_count: self.selections_update_count,
508 }
509 }
510
511 pub fn as_text_snapshot(&self) -> &text::BufferSnapshot {
512 &self.text
513 }
514
515 pub fn text_snapshot(&self) -> text::BufferSnapshot {
516 self.text.snapshot()
517 }
518
519 pub fn file(&self) -> Option<&Arc<dyn File>> {
520 self.file.as_ref()
521 }
522
523 pub fn saved_version(&self) -> &clock::Global {
524 &self.saved_version
525 }
526
527 pub fn saved_version_fingerprint(&self) -> RopeFingerprint {
528 self.saved_version_fingerprint
529 }
530
531 pub fn saved_mtime(&self) -> SystemTime {
532 self.saved_mtime
533 }
534
535 pub fn set_language(&mut self, language: Option<Arc<Language>>, cx: &mut ModelContext<Self>) {
536 self.syntax_map.lock().clear();
537 self.language = language;
538 self.reparse(cx);
539 }
540
541 pub fn set_language_registry(&mut self, language_registry: Arc<LanguageRegistry>) {
542 self.syntax_map
543 .lock()
544 .set_language_registry(language_registry);
545 }
546
547 pub fn did_save(
548 &mut self,
549 version: clock::Global,
550 fingerprint: RopeFingerprint,
551 mtime: SystemTime,
552 cx: &mut ModelContext<Self>,
553 ) {
554 self.saved_version = version;
555 self.saved_version_fingerprint = fingerprint;
556 self.saved_mtime = mtime;
557 cx.emit(Event::Saved);
558 cx.notify();
559 }
560
561 pub fn reload(&mut self, cx: &mut ModelContext<Self>) -> Task<Result<Option<Transaction>>> {
562 cx.spawn(|this, mut cx| async move {
563 if let Some((new_mtime, new_text)) = this.read_with(&cx, |this, cx| {
564 let file = this.file.as_ref()?.as_local()?;
565 Some((file.mtime(), file.load(cx)))
566 }) {
567 let new_text = new_text.await?;
568 let diff = this
569 .read_with(&cx, |this, cx| this.diff(new_text, cx))
570 .await;
571 this.update(&mut cx, |this, cx| {
572 if this.version() == diff.base_version {
573 this.finalize_last_transaction();
574 this.apply_diff(diff, cx);
575 if let Some(transaction) = this.finalize_last_transaction().cloned() {
576 this.did_reload(
577 this.version(),
578 this.as_rope().fingerprint(),
579 this.line_ending(),
580 new_mtime,
581 cx,
582 );
583 return Ok(Some(transaction));
584 }
585 }
586 Ok(None)
587 })
588 } else {
589 Ok(None)
590 }
591 })
592 }
593
594 pub fn did_reload(
595 &mut self,
596 version: clock::Global,
597 fingerprint: RopeFingerprint,
598 line_ending: LineEnding,
599 mtime: SystemTime,
600 cx: &mut ModelContext<Self>,
601 ) {
602 self.saved_version = version;
603 self.saved_version_fingerprint = fingerprint;
604 self.text.set_line_ending(line_ending);
605 self.saved_mtime = mtime;
606 if let Some(file) = self.file.as_ref().and_then(|f| f.as_local()) {
607 file.buffer_reloaded(
608 self.remote_id(),
609 &self.saved_version,
610 self.saved_version_fingerprint,
611 self.line_ending(),
612 self.saved_mtime,
613 cx,
614 );
615 }
616 self.git_diff_recalc(cx);
617 cx.emit(Event::Reloaded);
618 cx.notify();
619 }
620
621 pub fn file_updated(
622 &mut self,
623 new_file: Arc<dyn File>,
624 cx: &mut ModelContext<Self>,
625 ) -> Task<()> {
626 let mut file_changed = false;
627 let mut task = Task::ready(());
628
629 if let Some(old_file) = self.file.as_ref() {
630 if new_file.path() != old_file.path() {
631 file_changed = true;
632 }
633
634 if new_file.is_deleted() {
635 if !old_file.is_deleted() {
636 file_changed = true;
637 if !self.is_dirty() {
638 cx.emit(Event::DirtyChanged);
639 }
640 }
641 } else {
642 let new_mtime = new_file.mtime();
643 if new_mtime != old_file.mtime() {
644 file_changed = true;
645
646 if !self.is_dirty() {
647 let reload = self.reload(cx).log_err().map(drop);
648 task = cx.foreground().spawn(reload);
649 }
650 }
651 }
652 } else {
653 file_changed = true;
654 };
655
656 if file_changed {
657 self.file_update_count += 1;
658 cx.emit(Event::FileHandleChanged);
659 cx.notify();
660 }
661 self.file = Some(new_file);
662 task
663 }
664
665 pub fn diff_base(&self) -> Option<&str> {
666 self.diff_base.as_deref()
667 }
668
669 pub fn set_diff_base(&mut self, diff_base: Option<String>, cx: &mut ModelContext<Self>) {
670 self.diff_base = diff_base;
671 self.git_diff_recalc(cx);
672 }
673
674 pub fn needs_git_diff_recalc(&self) -> bool {
675 self.git_diff_status.diff.needs_update(self)
676 }
677
678 pub fn git_diff_recalc(&mut self, cx: &mut ModelContext<Self>) {
679 if self.git_diff_status.update_in_progress {
680 self.git_diff_status.update_requested = true;
681 return;
682 }
683
684 if let Some(diff_base) = &self.diff_base {
685 let snapshot = self.snapshot();
686 let diff_base = diff_base.clone();
687
688 let mut diff = self.git_diff_status.diff.clone();
689 let diff = cx.background().spawn(async move {
690 diff.update(&diff_base, &snapshot).await;
691 diff
692 });
693
694 cx.spawn_weak(|this, mut cx| async move {
695 let buffer_diff = diff.await;
696 if let Some(this) = this.upgrade(&cx) {
697 this.update(&mut cx, |this, cx| {
698 this.git_diff_status.diff = buffer_diff;
699 this.git_diff_update_count += 1;
700 cx.notify();
701
702 this.git_diff_status.update_in_progress = false;
703 if this.git_diff_status.update_requested {
704 this.git_diff_recalc(cx);
705 }
706 })
707 }
708 })
709 .detach()
710 } else {
711 let snapshot = self.snapshot();
712 self.git_diff_status.diff.clear(&snapshot);
713 self.git_diff_update_count += 1;
714 cx.notify();
715 }
716 }
717
718 pub fn close(&mut self, cx: &mut ModelContext<Self>) {
719 cx.emit(Event::Closed);
720 }
721
722 pub fn language(&self) -> Option<&Arc<Language>> {
723 self.language.as_ref()
724 }
725
726 pub fn language_at<D: ToOffset>(&self, position: D) -> Option<Arc<Language>> {
727 let offset = position.to_offset(self);
728 self.syntax_map
729 .lock()
730 .layers_for_range(offset..offset, &self.text)
731 .last()
732 .map(|info| info.language.clone())
733 .or_else(|| self.language.clone())
734 }
735
736 pub fn parse_count(&self) -> usize {
737 self.parse_count
738 }
739
740 pub fn selections_update_count(&self) -> usize {
741 self.selections_update_count
742 }
743
744 pub fn diagnostics_update_count(&self) -> usize {
745 self.diagnostics_update_count
746 }
747
748 pub fn file_update_count(&self) -> usize {
749 self.file_update_count
750 }
751
752 pub fn git_diff_update_count(&self) -> usize {
753 self.git_diff_update_count
754 }
755
756 #[cfg(any(test, feature = "test-support"))]
757 pub fn is_parsing(&self) -> bool {
758 self.parsing_in_background
759 }
760
761 pub fn contains_unknown_injections(&self) -> bool {
762 self.syntax_map.lock().contains_unknown_injections()
763 }
764
765 #[cfg(test)]
766 pub fn set_sync_parse_timeout(&mut self, timeout: Duration) {
767 self.sync_parse_timeout = timeout;
768 }
769
770 /// Called after an edit to synchronize the buffer's main parse tree with
771 /// the buffer's new underlying state.
772 ///
773 /// Locks the syntax map and interpolates the edits since the last reparse
774 /// into the foreground syntax tree.
775 ///
776 /// Then takes a stable snapshot of the syntax map before unlocking it.
777 /// The snapshot with the interpolated edits is sent to a background thread,
778 /// where we ask Tree-sitter to perform an incremental parse.
779 ///
780 /// Meanwhile, in the foreground, we block the main thread for up to 1ms
781 /// waiting on the parse to complete. As soon as it completes, we proceed
782 /// synchronously, unless a 1ms timeout elapses.
783 ///
784 /// If we time out waiting on the parse, we spawn a second task waiting
785 /// until the parse does complete and return with the interpolated tree still
786 /// in the foreground. When the background parse completes, call back into
787 /// the main thread and assign the foreground parse state.
788 ///
789 /// If the buffer or grammar changed since the start of the background parse,
790 /// initiate an additional reparse recursively. To avoid concurrent parses
791 /// for the same buffer, we only initiate a new parse if we are not already
792 /// parsing in the background.
793 pub fn reparse(&mut self, cx: &mut ModelContext<Self>) {
794 if self.parsing_in_background {
795 return;
796 }
797 let language = if let Some(language) = self.language.clone() {
798 language
799 } else {
800 return;
801 };
802
803 let text = self.text_snapshot();
804 let parsed_version = self.version();
805
806 let mut syntax_map = self.syntax_map.lock();
807 syntax_map.interpolate(&text);
808 let language_registry = syntax_map.language_registry();
809 let mut syntax_snapshot = syntax_map.snapshot();
810 drop(syntax_map);
811
812 let parse_task = cx.background().spawn({
813 let language = language.clone();
814 let language_registry = language_registry.clone();
815 async move {
816 syntax_snapshot.reparse(&text, language_registry, language);
817 syntax_snapshot
818 }
819 });
820
821 match cx
822 .background()
823 .block_with_timeout(self.sync_parse_timeout, parse_task)
824 {
825 Ok(new_syntax_snapshot) => {
826 self.did_finish_parsing(new_syntax_snapshot, cx);
827 return;
828 }
829 Err(parse_task) => {
830 self.parsing_in_background = true;
831 cx.spawn(move |this, mut cx| async move {
832 let new_syntax_map = parse_task.await;
833 this.update(&mut cx, move |this, cx| {
834 let grammar_changed =
835 this.language.as_ref().map_or(true, |current_language| {
836 !Arc::ptr_eq(&language, current_language)
837 });
838 let language_registry_changed = new_syntax_map
839 .contains_unknown_injections()
840 && language_registry.map_or(false, |registry| {
841 registry.version() != new_syntax_map.language_registry_version()
842 });
843 let parse_again = language_registry_changed
844 || grammar_changed
845 || this.version.changed_since(&parsed_version);
846 this.did_finish_parsing(new_syntax_map, cx);
847 this.parsing_in_background = false;
848 if parse_again {
849 this.reparse(cx);
850 }
851 });
852 })
853 .detach();
854 }
855 }
856 }
857
858 fn did_finish_parsing(&mut self, syntax_snapshot: SyntaxSnapshot, cx: &mut ModelContext<Self>) {
859 self.parse_count += 1;
860 self.syntax_map.lock().did_parse(syntax_snapshot);
861 self.request_autoindent(cx);
862 cx.emit(Event::Reparsed);
863 cx.notify();
864 }
865
866 pub fn update_diagnostics(&mut self, diagnostics: DiagnosticSet, cx: &mut ModelContext<Self>) {
867 let lamport_timestamp = self.text.lamport_clock.tick();
868 let op = Operation::UpdateDiagnostics {
869 diagnostics: diagnostics.iter().cloned().collect(),
870 lamport_timestamp,
871 };
872 self.apply_diagnostic_update(diagnostics, lamport_timestamp, cx);
873 self.send_operation(op, cx);
874 }
875
876 fn request_autoindent(&mut self, cx: &mut ModelContext<Self>) {
877 if let Some(indent_sizes) = self.compute_autoindents() {
878 let indent_sizes = cx.background().spawn(indent_sizes);
879 match cx
880 .background()
881 .block_with_timeout(Duration::from_micros(500), indent_sizes)
882 {
883 Ok(indent_sizes) => self.apply_autoindents(indent_sizes, cx),
884 Err(indent_sizes) => {
885 self.pending_autoindent = Some(cx.spawn(|this, mut cx| async move {
886 let indent_sizes = indent_sizes.await;
887 this.update(&mut cx, |this, cx| {
888 this.apply_autoindents(indent_sizes, cx);
889 });
890 }));
891 }
892 }
893 } else {
894 self.autoindent_requests.clear();
895 }
896 }
897
898 fn compute_autoindents(&self) -> Option<impl Future<Output = BTreeMap<u32, IndentSize>>> {
899 let max_rows_between_yields = 100;
900 let snapshot = self.snapshot();
901 if snapshot.syntax.is_empty() || self.autoindent_requests.is_empty() {
902 return None;
903 }
904
905 let autoindent_requests = self.autoindent_requests.clone();
906 Some(async move {
907 let mut indent_sizes = BTreeMap::new();
908 for request in autoindent_requests {
909 // Resolve each edited range to its row in the current buffer and in the
910 // buffer before this batch of edits.
911 let mut row_ranges = Vec::new();
912 let mut old_to_new_rows = BTreeMap::new();
913 let mut language_indent_sizes_by_new_row = Vec::new();
914 for entry in &request.entries {
915 let position = entry.range.start;
916 let new_row = position.to_point(&snapshot).row;
917 let new_end_row = entry.range.end.to_point(&snapshot).row + 1;
918 language_indent_sizes_by_new_row.push((new_row, entry.indent_size));
919
920 if !entry.first_line_is_new {
921 let old_row = position.to_point(&request.before_edit).row;
922 old_to_new_rows.insert(old_row, new_row);
923 }
924 row_ranges.push((new_row..new_end_row, entry.original_indent_column));
925 }
926
927 // Build a map containing the suggested indentation for each of the edited lines
928 // with respect to the state of the buffer before these edits. This map is keyed
929 // by the rows for these lines in the current state of the buffer.
930 let mut old_suggestions = BTreeMap::<u32, (IndentSize, bool)>::default();
931 let old_edited_ranges =
932 contiguous_ranges(old_to_new_rows.keys().copied(), max_rows_between_yields);
933 let mut language_indent_sizes = language_indent_sizes_by_new_row.iter().peekable();
934 let mut language_indent_size = IndentSize::default();
935 for old_edited_range in old_edited_ranges {
936 let suggestions = request
937 .before_edit
938 .suggest_autoindents(old_edited_range.clone())
939 .into_iter()
940 .flatten();
941 for (old_row, suggestion) in old_edited_range.zip(suggestions) {
942 if let Some(suggestion) = suggestion {
943 let new_row = *old_to_new_rows.get(&old_row).unwrap();
944
945 // Find the indent size based on the language for this row.
946 while let Some((row, size)) = language_indent_sizes.peek() {
947 if *row > new_row {
948 break;
949 }
950 language_indent_size = *size;
951 language_indent_sizes.next();
952 }
953
954 let suggested_indent = old_to_new_rows
955 .get(&suggestion.basis_row)
956 .and_then(|from_row| {
957 Some(old_suggestions.get(from_row).copied()?.0)
958 })
959 .unwrap_or_else(|| {
960 request
961 .before_edit
962 .indent_size_for_line(suggestion.basis_row)
963 })
964 .with_delta(suggestion.delta, language_indent_size);
965 old_suggestions
966 .insert(new_row, (suggested_indent, suggestion.within_error));
967 }
968 }
969 yield_now().await;
970 }
971
972 // In block mode, only compute indentation suggestions for the first line
973 // of each insertion. Otherwise, compute suggestions for every inserted line.
974 let new_edited_row_ranges = contiguous_ranges(
975 row_ranges.iter().flat_map(|(range, _)| {
976 if request.is_block_mode {
977 range.start..range.start + 1
978 } else {
979 range.clone()
980 }
981 }),
982 max_rows_between_yields,
983 );
984
985 // Compute new suggestions for each line, but only include them in the result
986 // if they differ from the old suggestion for that line.
987 let mut language_indent_sizes = language_indent_sizes_by_new_row.iter().peekable();
988 let mut language_indent_size = IndentSize::default();
989 for new_edited_row_range in new_edited_row_ranges {
990 let suggestions = snapshot
991 .suggest_autoindents(new_edited_row_range.clone())
992 .into_iter()
993 .flatten();
994 for (new_row, suggestion) in new_edited_row_range.zip(suggestions) {
995 if let Some(suggestion) = suggestion {
996 // Find the indent size based on the language for this row.
997 while let Some((row, size)) = language_indent_sizes.peek() {
998 if *row > new_row {
999 break;
1000 }
1001 language_indent_size = *size;
1002 language_indent_sizes.next();
1003 }
1004
1005 let suggested_indent = indent_sizes
1006 .get(&suggestion.basis_row)
1007 .copied()
1008 .unwrap_or_else(|| {
1009 snapshot.indent_size_for_line(suggestion.basis_row)
1010 })
1011 .with_delta(suggestion.delta, language_indent_size);
1012 if old_suggestions.get(&new_row).map_or(
1013 true,
1014 |(old_indentation, was_within_error)| {
1015 suggested_indent != *old_indentation
1016 && (!suggestion.within_error || *was_within_error)
1017 },
1018 ) {
1019 indent_sizes.insert(new_row, suggested_indent);
1020 }
1021 }
1022 }
1023 yield_now().await;
1024 }
1025
1026 // For each block of inserted text, adjust the indentation of the remaining
1027 // lines of the block by the same amount as the first line was adjusted.
1028 if request.is_block_mode {
1029 for (row_range, original_indent_column) in
1030 row_ranges
1031 .into_iter()
1032 .filter_map(|(range, original_indent_column)| {
1033 if range.len() > 1 {
1034 Some((range, original_indent_column?))
1035 } else {
1036 None
1037 }
1038 })
1039 {
1040 let new_indent = indent_sizes
1041 .get(&row_range.start)
1042 .copied()
1043 .unwrap_or_else(|| snapshot.indent_size_for_line(row_range.start));
1044 let delta = new_indent.len as i64 - original_indent_column as i64;
1045 if delta != 0 {
1046 for row in row_range.skip(1) {
1047 indent_sizes.entry(row).or_insert_with(|| {
1048 let mut size = snapshot.indent_size_for_line(row);
1049 if size.kind == new_indent.kind {
1050 match delta.cmp(&0) {
1051 Ordering::Greater => size.len += delta as u32,
1052 Ordering::Less => {
1053 size.len = size.len.saturating_sub(-delta as u32)
1054 }
1055 Ordering::Equal => {}
1056 }
1057 }
1058 size
1059 });
1060 }
1061 }
1062 }
1063 }
1064 }
1065
1066 indent_sizes
1067 })
1068 }
1069
1070 fn apply_autoindents(
1071 &mut self,
1072 indent_sizes: BTreeMap<u32, IndentSize>,
1073 cx: &mut ModelContext<Self>,
1074 ) {
1075 self.autoindent_requests.clear();
1076
1077 let edits: Vec<_> = indent_sizes
1078 .into_iter()
1079 .filter_map(|(row, indent_size)| {
1080 let current_size = indent_size_for_line(self, row);
1081 Self::edit_for_indent_size_adjustment(row, current_size, indent_size)
1082 })
1083 .collect();
1084
1085 self.edit(edits, None, cx);
1086 }
1087
1088 // Create a minimal edit that will cause the the given row to be indented
1089 // with the given size. After applying this edit, the length of the line
1090 // will always be at least `new_size.len`.
1091 pub fn edit_for_indent_size_adjustment(
1092 row: u32,
1093 current_size: IndentSize,
1094 new_size: IndentSize,
1095 ) -> Option<(Range<Point>, String)> {
1096 if new_size.kind != current_size.kind {
1097 Some((
1098 Point::new(row, 0)..Point::new(row, current_size.len),
1099 iter::repeat(new_size.char())
1100 .take(new_size.len as usize)
1101 .collect::<String>(),
1102 ))
1103 } else {
1104 match new_size.len.cmp(¤t_size.len) {
1105 Ordering::Greater => {
1106 let point = Point::new(row, 0);
1107 Some((
1108 point..point,
1109 iter::repeat(new_size.char())
1110 .take((new_size.len - current_size.len) as usize)
1111 .collect::<String>(),
1112 ))
1113 }
1114
1115 Ordering::Less => Some((
1116 Point::new(row, 0)..Point::new(row, current_size.len - new_size.len),
1117 String::new(),
1118 )),
1119
1120 Ordering::Equal => None,
1121 }
1122 }
1123 }
1124
1125 pub fn diff(&self, mut new_text: String, cx: &AppContext) -> Task<Diff> {
1126 let old_text = self.as_rope().clone();
1127 let base_version = self.version();
1128 cx.background().spawn(async move {
1129 let old_text = old_text.to_string();
1130 let line_ending = LineEnding::detect(&new_text);
1131 LineEnding::normalize(&mut new_text);
1132 let diff = TextDiff::from_chars(old_text.as_str(), new_text.as_str());
1133 let mut edits = Vec::new();
1134 let mut offset = 0;
1135 let empty: Arc<str> = "".into();
1136 for change in diff.iter_all_changes() {
1137 let value = change.value();
1138 let end_offset = offset + value.len();
1139 match change.tag() {
1140 ChangeTag::Equal => {
1141 offset = end_offset;
1142 }
1143 ChangeTag::Delete => {
1144 edits.push((offset..end_offset, empty.clone()));
1145 offset = end_offset;
1146 }
1147 ChangeTag::Insert => {
1148 edits.push((offset..offset, value.into()));
1149 }
1150 }
1151 }
1152 Diff {
1153 base_version,
1154 line_ending,
1155 edits,
1156 }
1157 })
1158 }
1159
1160 /// Spawn a background task that searches the buffer for any whitespace
1161 /// at the ends of a lines, and returns a `Diff` that removes that whitespace.
1162 pub fn remove_trailing_whitespace(&self, cx: &AppContext) -> Task<Diff> {
1163 let old_text = self.as_rope().clone();
1164 let line_ending = self.line_ending();
1165 let base_version = self.version();
1166 cx.background().spawn(async move {
1167 let ranges = trailing_whitespace_ranges(&old_text);
1168 let empty = Arc::<str>::from("");
1169 Diff {
1170 base_version,
1171 line_ending,
1172 edits: ranges
1173 .into_iter()
1174 .map(|range| (range, empty.clone()))
1175 .collect(),
1176 }
1177 })
1178 }
1179
1180 /// Ensure that the buffer ends with a single newline character, and
1181 /// no other whitespace.
1182 pub fn ensure_final_newline(&mut self, cx: &mut ModelContext<Self>) {
1183 let len = self.len();
1184 let mut offset = len;
1185 for chunk in self.as_rope().reversed_chunks_in_range(0..len) {
1186 let non_whitespace_len = chunk
1187 .trim_end_matches(|c: char| c.is_ascii_whitespace())
1188 .len();
1189 offset -= chunk.len();
1190 offset += non_whitespace_len;
1191 if non_whitespace_len != 0 {
1192 if offset == len - 1 && chunk.get(non_whitespace_len..) == Some("\n") {
1193 return;
1194 }
1195 break;
1196 }
1197 }
1198 self.edit([(offset..len, "\n")], None, cx);
1199 }
1200
1201 /// Apply a diff to the buffer. If the buffer has changed since the given diff was
1202 /// calculated, then adjust the diff to account for those changes, and discard any
1203 /// parts of the diff that conflict with those changes.
1204 pub fn apply_diff(&mut self, diff: Diff, cx: &mut ModelContext<Self>) -> Option<TransactionId> {
1205 // Check for any edits to the buffer that have occurred since this diff
1206 // was computed.
1207 let snapshot = self.snapshot();
1208 let mut edits_since = snapshot.edits_since::<usize>(&diff.base_version).peekable();
1209 let mut delta = 0;
1210 let adjusted_edits = diff.edits.into_iter().filter_map(|(range, new_text)| {
1211 while let Some(edit_since) = edits_since.peek() {
1212 // If the edit occurs after a diff hunk, then it does not
1213 // affect that hunk.
1214 if edit_since.old.start > range.end {
1215 break;
1216 }
1217 // If the edit precedes the diff hunk, then adjust the hunk
1218 // to reflect the edit.
1219 else if edit_since.old.end < range.start {
1220 delta += edit_since.new_len() as i64 - edit_since.old_len() as i64;
1221 edits_since.next();
1222 }
1223 // If the edit intersects a diff hunk, then discard that hunk.
1224 else {
1225 return None;
1226 }
1227 }
1228
1229 let start = (range.start as i64 + delta) as usize;
1230 let end = (range.end as i64 + delta) as usize;
1231 Some((start..end, new_text))
1232 });
1233
1234 self.start_transaction();
1235 self.text.set_line_ending(diff.line_ending);
1236 self.edit(adjusted_edits, None, cx);
1237 self.end_transaction(cx)
1238 }
1239
1240 pub fn is_dirty(&self) -> bool {
1241 self.saved_version_fingerprint != self.as_rope().fingerprint()
1242 || self.file.as_ref().map_or(false, |file| file.is_deleted())
1243 }
1244
1245 pub fn has_conflict(&self) -> bool {
1246 self.saved_version_fingerprint != self.as_rope().fingerprint()
1247 && self
1248 .file
1249 .as_ref()
1250 .map_or(false, |file| file.mtime() > self.saved_mtime)
1251 }
1252
1253 pub fn subscribe(&mut self) -> Subscription {
1254 self.text.subscribe()
1255 }
1256
1257 pub fn start_transaction(&mut self) -> Option<TransactionId> {
1258 self.start_transaction_at(Instant::now())
1259 }
1260
1261 pub fn start_transaction_at(&mut self, now: Instant) -> Option<TransactionId> {
1262 self.transaction_depth += 1;
1263 if self.was_dirty_before_starting_transaction.is_none() {
1264 self.was_dirty_before_starting_transaction = Some(self.is_dirty());
1265 }
1266 self.text.start_transaction_at(now)
1267 }
1268
1269 pub fn end_transaction(&mut self, cx: &mut ModelContext<Self>) -> Option<TransactionId> {
1270 self.end_transaction_at(Instant::now(), cx)
1271 }
1272
1273 pub fn end_transaction_at(
1274 &mut self,
1275 now: Instant,
1276 cx: &mut ModelContext<Self>,
1277 ) -> Option<TransactionId> {
1278 assert!(self.transaction_depth > 0);
1279 self.transaction_depth -= 1;
1280 let was_dirty = if self.transaction_depth == 0 {
1281 self.was_dirty_before_starting_transaction.take().unwrap()
1282 } else {
1283 false
1284 };
1285 if let Some((transaction_id, start_version)) = self.text.end_transaction_at(now) {
1286 self.did_edit(&start_version, was_dirty, cx);
1287 Some(transaction_id)
1288 } else {
1289 None
1290 }
1291 }
1292
1293 pub fn push_transaction(&mut self, transaction: Transaction, now: Instant) {
1294 self.text.push_transaction(transaction, now);
1295 }
1296
1297 pub fn finalize_last_transaction(&mut self) -> Option<&Transaction> {
1298 self.text.finalize_last_transaction()
1299 }
1300
1301 pub fn group_until_transaction(&mut self, transaction_id: TransactionId) {
1302 self.text.group_until_transaction(transaction_id);
1303 }
1304
1305 pub fn forget_transaction(&mut self, transaction_id: TransactionId) {
1306 self.text.forget_transaction(transaction_id);
1307 }
1308
1309 pub fn wait_for_edits(
1310 &mut self,
1311 edit_ids: impl IntoIterator<Item = clock::Local>,
1312 ) -> impl Future<Output = ()> {
1313 self.text.wait_for_edits(edit_ids)
1314 }
1315
1316 pub fn wait_for_anchors<'a>(
1317 &mut self,
1318 anchors: impl IntoIterator<Item = &'a Anchor>,
1319 ) -> impl Future<Output = ()> {
1320 self.text.wait_for_anchors(anchors)
1321 }
1322
1323 pub fn wait_for_version(&mut self, version: clock::Global) -> impl Future<Output = ()> {
1324 self.text.wait_for_version(version)
1325 }
1326
1327 pub fn set_active_selections(
1328 &mut self,
1329 selections: Arc<[Selection<Anchor>]>,
1330 line_mode: bool,
1331 cursor_shape: CursorShape,
1332 cx: &mut ModelContext<Self>,
1333 ) {
1334 let lamport_timestamp = self.text.lamport_clock.tick();
1335 self.remote_selections.insert(
1336 self.text.replica_id(),
1337 SelectionSet {
1338 selections: selections.clone(),
1339 lamport_timestamp,
1340 line_mode,
1341 cursor_shape,
1342 },
1343 );
1344 self.send_operation(
1345 Operation::UpdateSelections {
1346 selections,
1347 line_mode,
1348 lamport_timestamp,
1349 cursor_shape,
1350 },
1351 cx,
1352 );
1353 }
1354
1355 pub fn remove_active_selections(&mut self, cx: &mut ModelContext<Self>) {
1356 self.set_active_selections(Arc::from([]), false, Default::default(), cx);
1357 }
1358
1359 pub fn set_text<T>(&mut self, text: T, cx: &mut ModelContext<Self>) -> Option<clock::Local>
1360 where
1361 T: Into<Arc<str>>,
1362 {
1363 self.edit([(0..self.len(), text)], None, cx)
1364 }
1365
1366 pub fn edit<I, S, T>(
1367 &mut self,
1368 edits_iter: I,
1369 autoindent_mode: Option<AutoindentMode>,
1370 cx: &mut ModelContext<Self>,
1371 ) -> Option<clock::Local>
1372 where
1373 I: IntoIterator<Item = (Range<S>, T)>,
1374 S: ToOffset,
1375 T: Into<Arc<str>>,
1376 {
1377 // Skip invalid edits and coalesce contiguous ones.
1378 let mut edits: Vec<(Range<usize>, Arc<str>)> = Vec::new();
1379 for (range, new_text) in edits_iter {
1380 let mut range = range.start.to_offset(self)..range.end.to_offset(self);
1381 if range.start > range.end {
1382 mem::swap(&mut range.start, &mut range.end);
1383 }
1384 let new_text = new_text.into();
1385 if !new_text.is_empty() || !range.is_empty() {
1386 if let Some((prev_range, prev_text)) = edits.last_mut() {
1387 if prev_range.end >= range.start {
1388 prev_range.end = cmp::max(prev_range.end, range.end);
1389 *prev_text = format!("{prev_text}{new_text}").into();
1390 } else {
1391 edits.push((range, new_text));
1392 }
1393 } else {
1394 edits.push((range, new_text));
1395 }
1396 }
1397 }
1398 if edits.is_empty() {
1399 return None;
1400 }
1401
1402 self.start_transaction();
1403 self.pending_autoindent.take();
1404 let autoindent_request = autoindent_mode
1405 .and_then(|mode| self.language.as_ref().map(|_| (self.snapshot(), mode)));
1406
1407 let edit_operation = self.text.edit(edits.iter().cloned());
1408 let edit_id = edit_operation.local_timestamp();
1409
1410 if let Some((before_edit, mode)) = autoindent_request {
1411 let mut delta = 0isize;
1412 let entries = edits
1413 .into_iter()
1414 .enumerate()
1415 .zip(&edit_operation.as_edit().unwrap().new_text)
1416 .map(|((ix, (range, _)), new_text)| {
1417 let new_text_length = new_text.len();
1418 let old_start = range.start.to_point(&before_edit);
1419 let new_start = (delta + range.start as isize) as usize;
1420 delta += new_text_length as isize - (range.end as isize - range.start as isize);
1421
1422 let mut range_of_insertion_to_indent = 0..new_text_length;
1423 let mut first_line_is_new = false;
1424 let mut original_indent_column = None;
1425
1426 // When inserting an entire line at the beginning of an existing line,
1427 // treat the insertion as new.
1428 if new_text.contains('\n')
1429 && old_start.column <= before_edit.indent_size_for_line(old_start.row).len
1430 {
1431 first_line_is_new = true;
1432 }
1433
1434 // When inserting text starting with a newline, avoid auto-indenting the
1435 // previous line.
1436 if new_text.starts_with('\n') {
1437 range_of_insertion_to_indent.start += 1;
1438 first_line_is_new = true;
1439 }
1440
1441 // Avoid auto-indenting after the insertion.
1442 if let AutoindentMode::Block {
1443 original_indent_columns,
1444 } = &mode
1445 {
1446 original_indent_column =
1447 Some(original_indent_columns.get(ix).copied().unwrap_or_else(|| {
1448 indent_size_for_text(
1449 new_text[range_of_insertion_to_indent.clone()].chars(),
1450 )
1451 .len
1452 }));
1453 if new_text[range_of_insertion_to_indent.clone()].ends_with('\n') {
1454 range_of_insertion_to_indent.end -= 1;
1455 }
1456 }
1457
1458 AutoindentRequestEntry {
1459 first_line_is_new,
1460 original_indent_column,
1461 indent_size: before_edit.language_indent_size_at(range.start, cx),
1462 range: self.anchor_before(new_start + range_of_insertion_to_indent.start)
1463 ..self.anchor_after(new_start + range_of_insertion_to_indent.end),
1464 }
1465 })
1466 .collect();
1467
1468 self.autoindent_requests.push(Arc::new(AutoindentRequest {
1469 before_edit,
1470 entries,
1471 is_block_mode: matches!(mode, AutoindentMode::Block { .. }),
1472 }));
1473 }
1474
1475 self.end_transaction(cx);
1476 self.send_operation(Operation::Buffer(edit_operation), cx);
1477 Some(edit_id)
1478 }
1479
1480 fn did_edit(
1481 &mut self,
1482 old_version: &clock::Global,
1483 was_dirty: bool,
1484 cx: &mut ModelContext<Self>,
1485 ) {
1486 if self.edits_since::<usize>(old_version).next().is_none() {
1487 return;
1488 }
1489
1490 self.reparse(cx);
1491
1492 cx.emit(Event::Edited);
1493 if was_dirty != self.is_dirty() {
1494 cx.emit(Event::DirtyChanged);
1495 }
1496 cx.notify();
1497 }
1498
1499 pub fn apply_ops<I: IntoIterator<Item = Operation>>(
1500 &mut self,
1501 ops: I,
1502 cx: &mut ModelContext<Self>,
1503 ) -> Result<()> {
1504 self.pending_autoindent.take();
1505 let was_dirty = self.is_dirty();
1506 let old_version = self.version.clone();
1507 let mut deferred_ops = Vec::new();
1508 let buffer_ops = ops
1509 .into_iter()
1510 .filter_map(|op| match op {
1511 Operation::Buffer(op) => Some(op),
1512 _ => {
1513 if self.can_apply_op(&op) {
1514 self.apply_op(op, cx);
1515 } else {
1516 deferred_ops.push(op);
1517 }
1518 None
1519 }
1520 })
1521 .collect::<Vec<_>>();
1522 self.text.apply_ops(buffer_ops)?;
1523 self.deferred_ops.insert(deferred_ops);
1524 self.flush_deferred_ops(cx);
1525 self.did_edit(&old_version, was_dirty, cx);
1526 // Notify independently of whether the buffer was edited as the operations could include a
1527 // selection update.
1528 cx.notify();
1529 Ok(())
1530 }
1531
1532 fn flush_deferred_ops(&mut self, cx: &mut ModelContext<Self>) {
1533 let mut deferred_ops = Vec::new();
1534 for op in self.deferred_ops.drain().iter().cloned() {
1535 if self.can_apply_op(&op) {
1536 self.apply_op(op, cx);
1537 } else {
1538 deferred_ops.push(op);
1539 }
1540 }
1541 self.deferred_ops.insert(deferred_ops);
1542 }
1543
1544 fn can_apply_op(&self, operation: &Operation) -> bool {
1545 match operation {
1546 Operation::Buffer(_) => {
1547 unreachable!("buffer operations should never be applied at this layer")
1548 }
1549 Operation::UpdateDiagnostics {
1550 diagnostics: diagnostic_set,
1551 ..
1552 } => diagnostic_set.iter().all(|diagnostic| {
1553 self.text.can_resolve(&diagnostic.range.start)
1554 && self.text.can_resolve(&diagnostic.range.end)
1555 }),
1556 Operation::UpdateSelections { selections, .. } => selections
1557 .iter()
1558 .all(|s| self.can_resolve(&s.start) && self.can_resolve(&s.end)),
1559 Operation::UpdateCompletionTriggers { .. } => true,
1560 }
1561 }
1562
1563 fn apply_op(&mut self, operation: Operation, cx: &mut ModelContext<Self>) {
1564 match operation {
1565 Operation::Buffer(_) => {
1566 unreachable!("buffer operations should never be applied at this layer")
1567 }
1568 Operation::UpdateDiagnostics {
1569 diagnostics: diagnostic_set,
1570 lamport_timestamp,
1571 } => {
1572 let snapshot = self.snapshot();
1573 self.apply_diagnostic_update(
1574 DiagnosticSet::from_sorted_entries(diagnostic_set.iter().cloned(), &snapshot),
1575 lamport_timestamp,
1576 cx,
1577 );
1578 }
1579 Operation::UpdateSelections {
1580 selections,
1581 lamport_timestamp,
1582 line_mode,
1583 cursor_shape,
1584 } => {
1585 if let Some(set) = self.remote_selections.get(&lamport_timestamp.replica_id) {
1586 if set.lamport_timestamp > lamport_timestamp {
1587 return;
1588 }
1589 }
1590
1591 self.remote_selections.insert(
1592 lamport_timestamp.replica_id,
1593 SelectionSet {
1594 selections,
1595 lamport_timestamp,
1596 line_mode,
1597 cursor_shape,
1598 },
1599 );
1600 self.text.lamport_clock.observe(lamport_timestamp);
1601 self.selections_update_count += 1;
1602 }
1603 Operation::UpdateCompletionTriggers {
1604 triggers,
1605 lamport_timestamp,
1606 } => {
1607 self.completion_triggers = triggers;
1608 self.text.lamport_clock.observe(lamport_timestamp);
1609 }
1610 }
1611 }
1612
1613 fn apply_diagnostic_update(
1614 &mut self,
1615 diagnostics: DiagnosticSet,
1616 lamport_timestamp: clock::Lamport,
1617 cx: &mut ModelContext<Self>,
1618 ) {
1619 if lamport_timestamp > self.diagnostics_timestamp {
1620 self.diagnostics = diagnostics;
1621 self.diagnostics_timestamp = lamport_timestamp;
1622 self.diagnostics_update_count += 1;
1623 self.text.lamport_clock.observe(lamport_timestamp);
1624 cx.notify();
1625 cx.emit(Event::DiagnosticsUpdated);
1626 }
1627 }
1628
1629 fn send_operation(&mut self, operation: Operation, cx: &mut ModelContext<Self>) {
1630 cx.emit(Event::Operation(operation));
1631 }
1632
1633 pub fn remove_peer(&mut self, replica_id: ReplicaId, cx: &mut ModelContext<Self>) {
1634 self.remote_selections.remove(&replica_id);
1635 cx.notify();
1636 }
1637
1638 pub fn undo(&mut self, cx: &mut ModelContext<Self>) -> Option<TransactionId> {
1639 let was_dirty = self.is_dirty();
1640 let old_version = self.version.clone();
1641
1642 if let Some((transaction_id, operation)) = self.text.undo() {
1643 self.send_operation(Operation::Buffer(operation), cx);
1644 self.did_edit(&old_version, was_dirty, cx);
1645 Some(transaction_id)
1646 } else {
1647 None
1648 }
1649 }
1650
1651 pub fn undo_to_transaction(
1652 &mut self,
1653 transaction_id: TransactionId,
1654 cx: &mut ModelContext<Self>,
1655 ) -> bool {
1656 let was_dirty = self.is_dirty();
1657 let old_version = self.version.clone();
1658
1659 let operations = self.text.undo_to_transaction(transaction_id);
1660 let undone = !operations.is_empty();
1661 for operation in operations {
1662 self.send_operation(Operation::Buffer(operation), cx);
1663 }
1664 if undone {
1665 self.did_edit(&old_version, was_dirty, cx)
1666 }
1667 undone
1668 }
1669
1670 pub fn redo(&mut self, cx: &mut ModelContext<Self>) -> Option<TransactionId> {
1671 let was_dirty = self.is_dirty();
1672 let old_version = self.version.clone();
1673
1674 if let Some((transaction_id, operation)) = self.text.redo() {
1675 self.send_operation(Operation::Buffer(operation), cx);
1676 self.did_edit(&old_version, was_dirty, cx);
1677 Some(transaction_id)
1678 } else {
1679 None
1680 }
1681 }
1682
1683 pub fn redo_to_transaction(
1684 &mut self,
1685 transaction_id: TransactionId,
1686 cx: &mut ModelContext<Self>,
1687 ) -> bool {
1688 let was_dirty = self.is_dirty();
1689 let old_version = self.version.clone();
1690
1691 let operations = self.text.redo_to_transaction(transaction_id);
1692 let redone = !operations.is_empty();
1693 for operation in operations {
1694 self.send_operation(Operation::Buffer(operation), cx);
1695 }
1696 if redone {
1697 self.did_edit(&old_version, was_dirty, cx)
1698 }
1699 redone
1700 }
1701
1702 pub fn set_completion_triggers(&mut self, triggers: Vec<String>, cx: &mut ModelContext<Self>) {
1703 self.completion_triggers = triggers.clone();
1704 self.completion_triggers_timestamp = self.text.lamport_clock.tick();
1705 self.send_operation(
1706 Operation::UpdateCompletionTriggers {
1707 triggers,
1708 lamport_timestamp: self.completion_triggers_timestamp,
1709 },
1710 cx,
1711 );
1712 cx.notify();
1713 }
1714
1715 pub fn completion_triggers(&self) -> &[String] {
1716 &self.completion_triggers
1717 }
1718}
1719
1720#[cfg(any(test, feature = "test-support"))]
1721impl Buffer {
1722 pub fn edit_via_marked_text(
1723 &mut self,
1724 marked_string: &str,
1725 autoindent_mode: Option<AutoindentMode>,
1726 cx: &mut ModelContext<Self>,
1727 ) {
1728 let edits = self.edits_for_marked_text(marked_string);
1729 self.edit(edits, autoindent_mode, cx);
1730 }
1731
1732 pub fn set_group_interval(&mut self, group_interval: Duration) {
1733 self.text.set_group_interval(group_interval);
1734 }
1735
1736 pub fn randomly_edit<T>(
1737 &mut self,
1738 rng: &mut T,
1739 old_range_count: usize,
1740 cx: &mut ModelContext<Self>,
1741 ) where
1742 T: rand::Rng,
1743 {
1744 let mut edits: Vec<(Range<usize>, String)> = Vec::new();
1745 let mut last_end = None;
1746 for _ in 0..old_range_count {
1747 if last_end.map_or(false, |last_end| last_end >= self.len()) {
1748 break;
1749 }
1750
1751 let new_start = last_end.map_or(0, |last_end| last_end + 1);
1752 let mut range = self.random_byte_range(new_start, rng);
1753 if rng.gen_bool(0.2) {
1754 mem::swap(&mut range.start, &mut range.end);
1755 }
1756 last_end = Some(range.end);
1757
1758 let new_text_len = rng.gen_range(0..10);
1759 let new_text: String = RandomCharIter::new(&mut *rng).take(new_text_len).collect();
1760
1761 edits.push((range, new_text));
1762 }
1763 log::info!("mutating buffer {} with {:?}", self.replica_id(), edits);
1764 self.edit(edits, None, cx);
1765 }
1766
1767 pub fn randomly_undo_redo(&mut self, rng: &mut impl rand::Rng, cx: &mut ModelContext<Self>) {
1768 let was_dirty = self.is_dirty();
1769 let old_version = self.version.clone();
1770
1771 let ops = self.text.randomly_undo_redo(rng);
1772 if !ops.is_empty() {
1773 for op in ops {
1774 self.send_operation(Operation::Buffer(op), cx);
1775 self.did_edit(&old_version, was_dirty, cx);
1776 }
1777 }
1778 }
1779}
1780
1781impl Entity for Buffer {
1782 type Event = Event;
1783}
1784
1785impl Deref for Buffer {
1786 type Target = TextBuffer;
1787
1788 fn deref(&self) -> &Self::Target {
1789 &self.text
1790 }
1791}
1792
1793impl BufferSnapshot {
1794 pub fn indent_size_for_line(&self, row: u32) -> IndentSize {
1795 indent_size_for_line(self, row)
1796 }
1797
1798 pub fn language_indent_size_at<T: ToOffset>(&self, position: T, cx: &AppContext) -> IndentSize {
1799 let language_name = self.language_at(position).map(|language| language.name());
1800 let settings = cx.global::<Settings>();
1801 if settings.hard_tabs(language_name.as_deref()) {
1802 IndentSize::tab()
1803 } else {
1804 IndentSize::spaces(settings.tab_size(language_name.as_deref()).get())
1805 }
1806 }
1807
1808 pub fn suggested_indents(
1809 &self,
1810 rows: impl Iterator<Item = u32>,
1811 single_indent_size: IndentSize,
1812 ) -> BTreeMap<u32, IndentSize> {
1813 let mut result = BTreeMap::new();
1814
1815 for row_range in contiguous_ranges(rows, 10) {
1816 let suggestions = match self.suggest_autoindents(row_range.clone()) {
1817 Some(suggestions) => suggestions,
1818 _ => break,
1819 };
1820
1821 for (row, suggestion) in row_range.zip(suggestions) {
1822 let indent_size = if let Some(suggestion) = suggestion {
1823 result
1824 .get(&suggestion.basis_row)
1825 .copied()
1826 .unwrap_or_else(|| self.indent_size_for_line(suggestion.basis_row))
1827 .with_delta(suggestion.delta, single_indent_size)
1828 } else {
1829 self.indent_size_for_line(row)
1830 };
1831
1832 result.insert(row, indent_size);
1833 }
1834 }
1835
1836 result
1837 }
1838
1839 fn suggest_autoindents(
1840 &self,
1841 row_range: Range<u32>,
1842 ) -> Option<impl Iterator<Item = Option<IndentSuggestion>> + '_> {
1843 let config = &self.language.as_ref()?.config;
1844 let prev_non_blank_row = self.prev_non_blank_row(row_range.start);
1845
1846 // Find the suggested indentation ranges based on the syntax tree.
1847 let start = Point::new(prev_non_blank_row.unwrap_or(row_range.start), 0);
1848 let end = Point::new(row_range.end, 0);
1849 let range = (start..end).to_offset(&self.text);
1850 let mut matches = self.syntax.matches(range.clone(), &self.text, |grammar| {
1851 Some(&grammar.indents_config.as_ref()?.query)
1852 });
1853 let indent_configs = matches
1854 .grammars()
1855 .iter()
1856 .map(|grammar| grammar.indents_config.as_ref().unwrap())
1857 .collect::<Vec<_>>();
1858
1859 let mut indent_ranges = Vec::<Range<Point>>::new();
1860 let mut outdent_positions = Vec::<Point>::new();
1861 while let Some(mat) = matches.peek() {
1862 let mut start: Option<Point> = None;
1863 let mut end: Option<Point> = None;
1864
1865 let config = &indent_configs[mat.grammar_index];
1866 for capture in mat.captures {
1867 if capture.index == config.indent_capture_ix {
1868 start.get_or_insert(Point::from_ts_point(capture.node.start_position()));
1869 end.get_or_insert(Point::from_ts_point(capture.node.end_position()));
1870 } else if Some(capture.index) == config.start_capture_ix {
1871 start = Some(Point::from_ts_point(capture.node.end_position()));
1872 } else if Some(capture.index) == config.end_capture_ix {
1873 end = Some(Point::from_ts_point(capture.node.start_position()));
1874 } else if Some(capture.index) == config.outdent_capture_ix {
1875 outdent_positions.push(Point::from_ts_point(capture.node.start_position()));
1876 }
1877 }
1878
1879 matches.advance();
1880 if let Some((start, end)) = start.zip(end) {
1881 if start.row == end.row {
1882 continue;
1883 }
1884
1885 let range = start..end;
1886 match indent_ranges.binary_search_by_key(&range.start, |r| r.start) {
1887 Err(ix) => indent_ranges.insert(ix, range),
1888 Ok(ix) => {
1889 let prev_range = &mut indent_ranges[ix];
1890 prev_range.end = prev_range.end.max(range.end);
1891 }
1892 }
1893 }
1894 }
1895
1896 let mut error_ranges = Vec::<Range<Point>>::new();
1897 let mut matches = self.syntax.matches(range.clone(), &self.text, |grammar| {
1898 Some(&grammar.error_query)
1899 });
1900 while let Some(mat) = matches.peek() {
1901 let node = mat.captures[0].node;
1902 let start = Point::from_ts_point(node.start_position());
1903 let end = Point::from_ts_point(node.end_position());
1904 let range = start..end;
1905 let ix = match error_ranges.binary_search_by_key(&range.start, |r| r.start) {
1906 Ok(ix) | Err(ix) => ix,
1907 };
1908 let mut end_ix = ix;
1909 while let Some(existing_range) = error_ranges.get(end_ix) {
1910 if existing_range.end < end {
1911 end_ix += 1;
1912 } else {
1913 break;
1914 }
1915 }
1916 error_ranges.splice(ix..end_ix, [range]);
1917 matches.advance();
1918 }
1919
1920 outdent_positions.sort();
1921 for outdent_position in outdent_positions {
1922 // find the innermost indent range containing this outdent_position
1923 // set its end to the outdent position
1924 if let Some(range_to_truncate) = indent_ranges
1925 .iter_mut()
1926 .filter(|indent_range| indent_range.contains(&outdent_position))
1927 .last()
1928 {
1929 range_to_truncate.end = outdent_position;
1930 }
1931 }
1932
1933 // Find the suggested indentation increases and decreased based on regexes.
1934 let mut indent_change_rows = Vec::<(u32, Ordering)>::new();
1935 self.for_each_line(
1936 Point::new(prev_non_blank_row.unwrap_or(row_range.start), 0)
1937 ..Point::new(row_range.end, 0),
1938 |row, line| {
1939 if config
1940 .decrease_indent_pattern
1941 .as_ref()
1942 .map_or(false, |regex| regex.is_match(line))
1943 {
1944 indent_change_rows.push((row, Ordering::Less));
1945 }
1946 if config
1947 .increase_indent_pattern
1948 .as_ref()
1949 .map_or(false, |regex| regex.is_match(line))
1950 {
1951 indent_change_rows.push((row + 1, Ordering::Greater));
1952 }
1953 },
1954 );
1955
1956 let mut indent_changes = indent_change_rows.into_iter().peekable();
1957 let mut prev_row = if config.auto_indent_using_last_non_empty_line {
1958 prev_non_blank_row.unwrap_or(0)
1959 } else {
1960 row_range.start.saturating_sub(1)
1961 };
1962 let mut prev_row_start = Point::new(prev_row, self.indent_size_for_line(prev_row).len);
1963 Some(row_range.map(move |row| {
1964 let row_start = Point::new(row, self.indent_size_for_line(row).len);
1965
1966 let mut indent_from_prev_row = false;
1967 let mut outdent_from_prev_row = false;
1968 let mut outdent_to_row = u32::MAX;
1969
1970 while let Some((indent_row, delta)) = indent_changes.peek() {
1971 match indent_row.cmp(&row) {
1972 Ordering::Equal => match delta {
1973 Ordering::Less => outdent_from_prev_row = true,
1974 Ordering::Greater => indent_from_prev_row = true,
1975 _ => {}
1976 },
1977
1978 Ordering::Greater => break,
1979 Ordering::Less => {}
1980 }
1981
1982 indent_changes.next();
1983 }
1984
1985 for range in &indent_ranges {
1986 if range.start.row >= row {
1987 break;
1988 }
1989 if range.start.row == prev_row && range.end > row_start {
1990 indent_from_prev_row = true;
1991 }
1992 if range.end > prev_row_start && range.end <= row_start {
1993 outdent_to_row = outdent_to_row.min(range.start.row);
1994 }
1995 }
1996
1997 let within_error = error_ranges
1998 .iter()
1999 .any(|e| e.start.row < row && e.end > row_start);
2000
2001 let suggestion = if outdent_to_row == prev_row
2002 || (outdent_from_prev_row && indent_from_prev_row)
2003 {
2004 Some(IndentSuggestion {
2005 basis_row: prev_row,
2006 delta: Ordering::Equal,
2007 within_error,
2008 })
2009 } else if indent_from_prev_row {
2010 Some(IndentSuggestion {
2011 basis_row: prev_row,
2012 delta: Ordering::Greater,
2013 within_error,
2014 })
2015 } else if outdent_to_row < prev_row {
2016 Some(IndentSuggestion {
2017 basis_row: outdent_to_row,
2018 delta: Ordering::Equal,
2019 within_error,
2020 })
2021 } else if outdent_from_prev_row {
2022 Some(IndentSuggestion {
2023 basis_row: prev_row,
2024 delta: Ordering::Less,
2025 within_error,
2026 })
2027 } else if config.auto_indent_using_last_non_empty_line || !self.is_line_blank(prev_row)
2028 {
2029 Some(IndentSuggestion {
2030 basis_row: prev_row,
2031 delta: Ordering::Equal,
2032 within_error,
2033 })
2034 } else {
2035 None
2036 };
2037
2038 prev_row = row;
2039 prev_row_start = row_start;
2040 suggestion
2041 }))
2042 }
2043
2044 fn prev_non_blank_row(&self, mut row: u32) -> Option<u32> {
2045 while row > 0 {
2046 row -= 1;
2047 if !self.is_line_blank(row) {
2048 return Some(row);
2049 }
2050 }
2051 None
2052 }
2053
2054 pub fn chunks<T: ToOffset>(&self, range: Range<T>, language_aware: bool) -> BufferChunks {
2055 let range = range.start.to_offset(self)..range.end.to_offset(self);
2056
2057 let mut syntax = None;
2058 let mut diagnostic_endpoints = Vec::new();
2059 if language_aware {
2060 let captures = self.syntax.captures(range.clone(), &self.text, |grammar| {
2061 grammar.highlights_query.as_ref()
2062 });
2063 let highlight_maps = captures
2064 .grammars()
2065 .into_iter()
2066 .map(|grammar| grammar.highlight_map())
2067 .collect();
2068 syntax = Some((captures, highlight_maps));
2069 for entry in self.diagnostics_in_range::<_, usize>(range.clone(), false) {
2070 diagnostic_endpoints.push(DiagnosticEndpoint {
2071 offset: entry.range.start,
2072 is_start: true,
2073 severity: entry.diagnostic.severity,
2074 is_unnecessary: entry.diagnostic.is_unnecessary,
2075 });
2076 diagnostic_endpoints.push(DiagnosticEndpoint {
2077 offset: entry.range.end,
2078 is_start: false,
2079 severity: entry.diagnostic.severity,
2080 is_unnecessary: entry.diagnostic.is_unnecessary,
2081 });
2082 }
2083 diagnostic_endpoints
2084 .sort_unstable_by_key(|endpoint| (endpoint.offset, !endpoint.is_start));
2085 }
2086
2087 BufferChunks::new(self.text.as_rope(), range, syntax, diagnostic_endpoints)
2088 }
2089
2090 pub fn for_each_line(&self, range: Range<Point>, mut callback: impl FnMut(u32, &str)) {
2091 let mut line = String::new();
2092 let mut row = range.start.row;
2093 for chunk in self
2094 .as_rope()
2095 .chunks_in_range(range.to_offset(self))
2096 .chain(["\n"])
2097 {
2098 for (newline_ix, text) in chunk.split('\n').enumerate() {
2099 if newline_ix > 0 {
2100 callback(row, &line);
2101 row += 1;
2102 line.clear();
2103 }
2104 line.push_str(text);
2105 }
2106 }
2107 }
2108
2109 pub fn language_at<D: ToOffset>(&self, position: D) -> Option<&Arc<Language>> {
2110 let offset = position.to_offset(self);
2111 self.syntax
2112 .layers_for_range(offset..offset, &self.text)
2113 .filter(|l| l.node.end_byte() > offset)
2114 .last()
2115 .map(|info| info.language)
2116 .or(self.language.as_ref())
2117 }
2118
2119 pub fn language_scope_at<D: ToOffset>(&self, position: D) -> Option<LanguageScope> {
2120 let offset = position.to_offset(self);
2121
2122 if let Some(layer_info) = self
2123 .syntax
2124 .layers_for_range(offset..offset, &self.text)
2125 .filter(|l| l.node.end_byte() > offset)
2126 .last()
2127 {
2128 Some(LanguageScope {
2129 language: layer_info.language.clone(),
2130 override_id: layer_info.override_id(offset, &self.text),
2131 })
2132 } else {
2133 self.language.clone().map(|language| LanguageScope {
2134 language,
2135 override_id: None,
2136 })
2137 }
2138 }
2139
2140 pub fn surrounding_word<T: ToOffset>(&self, start: T) -> (Range<usize>, Option<CharKind>) {
2141 let mut start = start.to_offset(self);
2142 let mut end = start;
2143 let mut next_chars = self.chars_at(start).peekable();
2144 let mut prev_chars = self.reversed_chars_at(start).peekable();
2145 let word_kind = cmp::max(
2146 prev_chars.peek().copied().map(char_kind),
2147 next_chars.peek().copied().map(char_kind),
2148 );
2149
2150 for ch in prev_chars {
2151 if Some(char_kind(ch)) == word_kind && ch != '\n' {
2152 start -= ch.len_utf8();
2153 } else {
2154 break;
2155 }
2156 }
2157
2158 for ch in next_chars {
2159 if Some(char_kind(ch)) == word_kind && ch != '\n' {
2160 end += ch.len_utf8();
2161 } else {
2162 break;
2163 }
2164 }
2165
2166 (start..end, word_kind)
2167 }
2168
2169 pub fn range_for_syntax_ancestor<T: ToOffset>(&self, range: Range<T>) -> Option<Range<usize>> {
2170 let range = range.start.to_offset(self)..range.end.to_offset(self);
2171 let mut result: Option<Range<usize>> = None;
2172 'outer: for layer in self.syntax.layers_for_range(range.clone(), &self.text) {
2173 let mut cursor = layer.node.walk();
2174
2175 // Descend to the first leaf that touches the start of the range,
2176 // and if the range is non-empty, extends beyond the start.
2177 while cursor.goto_first_child_for_byte(range.start).is_some() {
2178 if !range.is_empty() && cursor.node().end_byte() == range.start {
2179 cursor.goto_next_sibling();
2180 }
2181 }
2182
2183 // Ascend to the smallest ancestor that strictly contains the range.
2184 loop {
2185 let node_range = cursor.node().byte_range();
2186 if node_range.start <= range.start
2187 && node_range.end >= range.end
2188 && node_range.len() > range.len()
2189 {
2190 break;
2191 }
2192 if !cursor.goto_parent() {
2193 continue 'outer;
2194 }
2195 }
2196
2197 let left_node = cursor.node();
2198 let mut layer_result = left_node.byte_range();
2199
2200 // For an empty range, try to find another node immediately to the right of the range.
2201 if left_node.end_byte() == range.start {
2202 let mut right_node = None;
2203 while !cursor.goto_next_sibling() {
2204 if !cursor.goto_parent() {
2205 break;
2206 }
2207 }
2208
2209 while cursor.node().start_byte() == range.start {
2210 right_node = Some(cursor.node());
2211 if !cursor.goto_first_child() {
2212 break;
2213 }
2214 }
2215
2216 // If there is a candidate node on both sides of the (empty) range, then
2217 // decide between the two by favoring a named node over an anonymous token.
2218 // If both nodes are the same in that regard, favor the right one.
2219 if let Some(right_node) = right_node {
2220 if right_node.is_named() || !left_node.is_named() {
2221 layer_result = right_node.byte_range();
2222 }
2223 }
2224 }
2225
2226 if let Some(previous_result) = &result {
2227 if previous_result.len() < layer_result.len() {
2228 continue;
2229 }
2230 }
2231 result = Some(layer_result);
2232 }
2233
2234 result
2235 }
2236
2237 pub fn outline(&self, theme: Option<&SyntaxTheme>) -> Option<Outline<Anchor>> {
2238 self.outline_items_containing(0..self.len(), theme)
2239 .map(Outline::new)
2240 }
2241
2242 pub fn symbols_containing<T: ToOffset>(
2243 &self,
2244 position: T,
2245 theme: Option<&SyntaxTheme>,
2246 ) -> Option<Vec<OutlineItem<Anchor>>> {
2247 let position = position.to_offset(self);
2248 let mut items = self.outline_items_containing(
2249 position.saturating_sub(1)..self.len().min(position + 1),
2250 theme,
2251 )?;
2252 let mut prev_depth = None;
2253 items.retain(|item| {
2254 let result = prev_depth.map_or(true, |prev_depth| item.depth > prev_depth);
2255 prev_depth = Some(item.depth);
2256 result
2257 });
2258 Some(items)
2259 }
2260
2261 fn outline_items_containing(
2262 &self,
2263 range: Range<usize>,
2264 theme: Option<&SyntaxTheme>,
2265 ) -> Option<Vec<OutlineItem<Anchor>>> {
2266 let mut matches = self.syntax.matches(range.clone(), &self.text, |grammar| {
2267 grammar.outline_config.as_ref().map(|c| &c.query)
2268 });
2269 let configs = matches
2270 .grammars()
2271 .iter()
2272 .map(|g| g.outline_config.as_ref().unwrap())
2273 .collect::<Vec<_>>();
2274
2275 let mut stack = Vec::<Range<usize>>::new();
2276 let mut items = Vec::new();
2277 while let Some(mat) = matches.peek() {
2278 let config = &configs[mat.grammar_index];
2279 let item_node = mat.captures.iter().find_map(|cap| {
2280 if cap.index == config.item_capture_ix {
2281 Some(cap.node)
2282 } else {
2283 None
2284 }
2285 })?;
2286
2287 let item_range = item_node.byte_range();
2288 if item_range.end < range.start || item_range.start > range.end {
2289 matches.advance();
2290 continue;
2291 }
2292
2293 let mut buffer_ranges = Vec::new();
2294 for capture in mat.captures {
2295 let node_is_name;
2296 if capture.index == config.name_capture_ix {
2297 node_is_name = true;
2298 } else if Some(capture.index) == config.context_capture_ix {
2299 node_is_name = false;
2300 } else {
2301 continue;
2302 }
2303
2304 let mut range = capture.node.start_byte()..capture.node.end_byte();
2305 let start = capture.node.start_position();
2306 if capture.node.end_position().row > start.row {
2307 range.end =
2308 range.start + self.line_len(start.row as u32) as usize - start.column;
2309 }
2310
2311 buffer_ranges.push((range, node_is_name));
2312 }
2313
2314 if buffer_ranges.is_empty() {
2315 continue;
2316 }
2317
2318 let mut text = String::new();
2319 let mut highlight_ranges = Vec::new();
2320 let mut name_ranges = Vec::new();
2321 let mut chunks = self.chunks(
2322 buffer_ranges.first().unwrap().0.start..buffer_ranges.last().unwrap().0.end,
2323 true,
2324 );
2325 for (buffer_range, is_name) in buffer_ranges {
2326 if !text.is_empty() {
2327 text.push(' ');
2328 }
2329 if is_name {
2330 let mut start = text.len();
2331 let end = start + buffer_range.len();
2332
2333 // When multiple names are captured, then the matcheable text
2334 // includes the whitespace in between the names.
2335 if !name_ranges.is_empty() {
2336 start -= 1;
2337 }
2338
2339 name_ranges.push(start..end);
2340 }
2341
2342 let mut offset = buffer_range.start;
2343 chunks.seek(offset);
2344 for mut chunk in chunks.by_ref() {
2345 if chunk.text.len() > buffer_range.end - offset {
2346 chunk.text = &chunk.text[0..(buffer_range.end - offset)];
2347 offset = buffer_range.end;
2348 } else {
2349 offset += chunk.text.len();
2350 }
2351 let style = chunk
2352 .syntax_highlight_id
2353 .zip(theme)
2354 .and_then(|(highlight, theme)| highlight.style(theme));
2355 if let Some(style) = style {
2356 let start = text.len();
2357 let end = start + chunk.text.len();
2358 highlight_ranges.push((start..end, style));
2359 }
2360 text.push_str(chunk.text);
2361 if offset >= buffer_range.end {
2362 break;
2363 }
2364 }
2365 }
2366
2367 matches.advance();
2368 while stack.last().map_or(false, |prev_range| {
2369 prev_range.start > item_range.start || prev_range.end < item_range.end
2370 }) {
2371 stack.pop();
2372 }
2373 stack.push(item_range.clone());
2374
2375 items.push(OutlineItem {
2376 depth: stack.len() - 1,
2377 range: self.anchor_after(item_range.start)..self.anchor_before(item_range.end),
2378 text,
2379 highlight_ranges,
2380 name_ranges,
2381 })
2382 }
2383 Some(items)
2384 }
2385
2386 /// Returns bracket range pairs overlapping or adjacent to `range`
2387 pub fn bracket_ranges<'a, T: ToOffset>(
2388 &'a self,
2389 range: Range<T>,
2390 ) -> impl Iterator<Item = (Range<usize>, Range<usize>)> + 'a {
2391 // Find bracket pairs that *inclusively* contain the given range.
2392 let range = range.start.to_offset(self).saturating_sub(1)
2393 ..self.len().min(range.end.to_offset(self) + 1);
2394
2395 let mut matches = self.syntax.matches(range.clone(), &self.text, |grammar| {
2396 grammar.brackets_config.as_ref().map(|c| &c.query)
2397 });
2398 let configs = matches
2399 .grammars()
2400 .iter()
2401 .map(|grammar| grammar.brackets_config.as_ref().unwrap())
2402 .collect::<Vec<_>>();
2403
2404 iter::from_fn(move || {
2405 while let Some(mat) = matches.peek() {
2406 let mut open = None;
2407 let mut close = None;
2408 let config = &configs[mat.grammar_index];
2409 for capture in mat.captures {
2410 if capture.index == config.open_capture_ix {
2411 open = Some(capture.node.byte_range());
2412 } else if capture.index == config.close_capture_ix {
2413 close = Some(capture.node.byte_range());
2414 }
2415 }
2416
2417 matches.advance();
2418
2419 let Some((open, close)) = open.zip(close) else { continue };
2420
2421 let bracket_range = open.start..=close.end;
2422 if !bracket_range.overlaps(&range) {
2423 continue;
2424 }
2425
2426 return Some((open, close));
2427 }
2428 None
2429 })
2430 }
2431
2432 #[allow(clippy::type_complexity)]
2433 pub fn remote_selections_in_range(
2434 &self,
2435 range: Range<Anchor>,
2436 ) -> impl Iterator<
2437 Item = (
2438 ReplicaId,
2439 bool,
2440 CursorShape,
2441 impl Iterator<Item = &Selection<Anchor>> + '_,
2442 ),
2443 > + '_ {
2444 self.remote_selections
2445 .iter()
2446 .filter(|(replica_id, set)| {
2447 **replica_id != self.text.replica_id() && !set.selections.is_empty()
2448 })
2449 .map(move |(replica_id, set)| {
2450 let start_ix = match set.selections.binary_search_by(|probe| {
2451 probe.end.cmp(&range.start, self).then(Ordering::Greater)
2452 }) {
2453 Ok(ix) | Err(ix) => ix,
2454 };
2455 let end_ix = match set.selections.binary_search_by(|probe| {
2456 probe.start.cmp(&range.end, self).then(Ordering::Less)
2457 }) {
2458 Ok(ix) | Err(ix) => ix,
2459 };
2460
2461 (
2462 *replica_id,
2463 set.line_mode,
2464 set.cursor_shape,
2465 set.selections[start_ix..end_ix].iter(),
2466 )
2467 })
2468 }
2469
2470 pub fn git_diff_hunks_in_row_range<'a>(
2471 &'a self,
2472 range: Range<u32>,
2473 reversed: bool,
2474 ) -> impl 'a + Iterator<Item = git::diff::DiffHunk<u32>> {
2475 self.git_diff.hunks_in_row_range(range, self, reversed)
2476 }
2477
2478 pub fn git_diff_hunks_intersecting_range<'a>(
2479 &'a self,
2480 range: Range<Anchor>,
2481 reversed: bool,
2482 ) -> impl 'a + Iterator<Item = git::diff::DiffHunk<u32>> {
2483 self.git_diff
2484 .hunks_intersecting_range(range, self, reversed)
2485 }
2486
2487 pub fn diagnostics_in_range<'a, T, O>(
2488 &'a self,
2489 search_range: Range<T>,
2490 reversed: bool,
2491 ) -> impl 'a + Iterator<Item = DiagnosticEntry<O>>
2492 where
2493 T: 'a + Clone + ToOffset,
2494 O: 'a + FromAnchor,
2495 {
2496 self.diagnostics.range(search_range, self, true, reversed)
2497 }
2498
2499 pub fn diagnostic_groups(&self) -> Vec<DiagnosticGroup<Anchor>> {
2500 let mut groups = Vec::new();
2501 self.diagnostics.groups(&mut groups, self);
2502 groups
2503 }
2504
2505 pub fn diagnostic_group<'a, O>(
2506 &'a self,
2507 group_id: usize,
2508 ) -> impl 'a + Iterator<Item = DiagnosticEntry<O>>
2509 where
2510 O: 'a + FromAnchor,
2511 {
2512 self.diagnostics.group(group_id, self)
2513 }
2514
2515 pub fn diagnostics_update_count(&self) -> usize {
2516 self.diagnostics_update_count
2517 }
2518
2519 pub fn parse_count(&self) -> usize {
2520 self.parse_count
2521 }
2522
2523 pub fn selections_update_count(&self) -> usize {
2524 self.selections_update_count
2525 }
2526
2527 pub fn file(&self) -> Option<&Arc<dyn File>> {
2528 self.file.as_ref()
2529 }
2530
2531 pub fn resolve_file_path(&self, cx: &AppContext, include_root: bool) -> Option<PathBuf> {
2532 if let Some(file) = self.file() {
2533 if file.path().file_name().is_none() || include_root {
2534 Some(file.full_path(cx))
2535 } else {
2536 Some(file.path().to_path_buf())
2537 }
2538 } else {
2539 None
2540 }
2541 }
2542
2543 pub fn file_update_count(&self) -> usize {
2544 self.file_update_count
2545 }
2546
2547 pub fn git_diff_update_count(&self) -> usize {
2548 self.git_diff_update_count
2549 }
2550}
2551
2552fn indent_size_for_line(text: &text::BufferSnapshot, row: u32) -> IndentSize {
2553 indent_size_for_text(text.chars_at(Point::new(row, 0)))
2554}
2555
2556pub fn indent_size_for_text(text: impl Iterator<Item = char>) -> IndentSize {
2557 let mut result = IndentSize::spaces(0);
2558 for c in text {
2559 let kind = match c {
2560 ' ' => IndentKind::Space,
2561 '\t' => IndentKind::Tab,
2562 _ => break,
2563 };
2564 if result.len == 0 {
2565 result.kind = kind;
2566 }
2567 result.len += 1;
2568 }
2569 result
2570}
2571
2572impl Clone for BufferSnapshot {
2573 fn clone(&self) -> Self {
2574 Self {
2575 text: self.text.clone(),
2576 git_diff: self.git_diff.clone(),
2577 syntax: self.syntax.clone(),
2578 file: self.file.clone(),
2579 remote_selections: self.remote_selections.clone(),
2580 diagnostics: self.diagnostics.clone(),
2581 selections_update_count: self.selections_update_count,
2582 diagnostics_update_count: self.diagnostics_update_count,
2583 file_update_count: self.file_update_count,
2584 git_diff_update_count: self.git_diff_update_count,
2585 language: self.language.clone(),
2586 parse_count: self.parse_count,
2587 }
2588 }
2589}
2590
2591impl Deref for BufferSnapshot {
2592 type Target = text::BufferSnapshot;
2593
2594 fn deref(&self) -> &Self::Target {
2595 &self.text
2596 }
2597}
2598
2599unsafe impl<'a> Send for BufferChunks<'a> {}
2600
2601impl<'a> BufferChunks<'a> {
2602 pub(crate) fn new(
2603 text: &'a Rope,
2604 range: Range<usize>,
2605 syntax: Option<(SyntaxMapCaptures<'a>, Vec<HighlightMap>)>,
2606 diagnostic_endpoints: Vec<DiagnosticEndpoint>,
2607 ) -> Self {
2608 let mut highlights = None;
2609 if let Some((captures, highlight_maps)) = syntax {
2610 highlights = Some(BufferChunkHighlights {
2611 captures,
2612 next_capture: None,
2613 stack: Default::default(),
2614 highlight_maps,
2615 })
2616 }
2617
2618 let diagnostic_endpoints = diagnostic_endpoints.into_iter().peekable();
2619 let chunks = text.chunks_in_range(range.clone());
2620
2621 BufferChunks {
2622 range,
2623 chunks,
2624 diagnostic_endpoints,
2625 error_depth: 0,
2626 warning_depth: 0,
2627 information_depth: 0,
2628 hint_depth: 0,
2629 unnecessary_depth: 0,
2630 highlights,
2631 }
2632 }
2633
2634 pub fn seek(&mut self, offset: usize) {
2635 self.range.start = offset;
2636 self.chunks.seek(self.range.start);
2637 if let Some(highlights) = self.highlights.as_mut() {
2638 highlights
2639 .stack
2640 .retain(|(end_offset, _)| *end_offset > offset);
2641 if let Some(capture) = &highlights.next_capture {
2642 if offset >= capture.node.start_byte() {
2643 let next_capture_end = capture.node.end_byte();
2644 if offset < next_capture_end {
2645 highlights.stack.push((
2646 next_capture_end,
2647 highlights.highlight_maps[capture.grammar_index].get(capture.index),
2648 ));
2649 }
2650 highlights.next_capture.take();
2651 }
2652 }
2653 highlights.captures.set_byte_range(self.range.clone());
2654 }
2655 }
2656
2657 pub fn offset(&self) -> usize {
2658 self.range.start
2659 }
2660
2661 fn update_diagnostic_depths(&mut self, endpoint: DiagnosticEndpoint) {
2662 let depth = match endpoint.severity {
2663 DiagnosticSeverity::ERROR => &mut self.error_depth,
2664 DiagnosticSeverity::WARNING => &mut self.warning_depth,
2665 DiagnosticSeverity::INFORMATION => &mut self.information_depth,
2666 DiagnosticSeverity::HINT => &mut self.hint_depth,
2667 _ => return,
2668 };
2669 if endpoint.is_start {
2670 *depth += 1;
2671 } else {
2672 *depth -= 1;
2673 }
2674
2675 if endpoint.is_unnecessary {
2676 if endpoint.is_start {
2677 self.unnecessary_depth += 1;
2678 } else {
2679 self.unnecessary_depth -= 1;
2680 }
2681 }
2682 }
2683
2684 fn current_diagnostic_severity(&self) -> Option<DiagnosticSeverity> {
2685 if self.error_depth > 0 {
2686 Some(DiagnosticSeverity::ERROR)
2687 } else if self.warning_depth > 0 {
2688 Some(DiagnosticSeverity::WARNING)
2689 } else if self.information_depth > 0 {
2690 Some(DiagnosticSeverity::INFORMATION)
2691 } else if self.hint_depth > 0 {
2692 Some(DiagnosticSeverity::HINT)
2693 } else {
2694 None
2695 }
2696 }
2697
2698 fn current_code_is_unnecessary(&self) -> bool {
2699 self.unnecessary_depth > 0
2700 }
2701}
2702
2703impl<'a> Iterator for BufferChunks<'a> {
2704 type Item = Chunk<'a>;
2705
2706 fn next(&mut self) -> Option<Self::Item> {
2707 let mut next_capture_start = usize::MAX;
2708 let mut next_diagnostic_endpoint = usize::MAX;
2709
2710 if let Some(highlights) = self.highlights.as_mut() {
2711 while let Some((parent_capture_end, _)) = highlights.stack.last() {
2712 if *parent_capture_end <= self.range.start {
2713 highlights.stack.pop();
2714 } else {
2715 break;
2716 }
2717 }
2718
2719 if highlights.next_capture.is_none() {
2720 highlights.next_capture = highlights.captures.next();
2721 }
2722
2723 while let Some(capture) = highlights.next_capture.as_ref() {
2724 if self.range.start < capture.node.start_byte() {
2725 next_capture_start = capture.node.start_byte();
2726 break;
2727 } else {
2728 let highlight_id =
2729 highlights.highlight_maps[capture.grammar_index].get(capture.index);
2730 highlights
2731 .stack
2732 .push((capture.node.end_byte(), highlight_id));
2733 highlights.next_capture = highlights.captures.next();
2734 }
2735 }
2736 }
2737
2738 while let Some(endpoint) = self.diagnostic_endpoints.peek().copied() {
2739 if endpoint.offset <= self.range.start {
2740 self.update_diagnostic_depths(endpoint);
2741 self.diagnostic_endpoints.next();
2742 } else {
2743 next_diagnostic_endpoint = endpoint.offset;
2744 break;
2745 }
2746 }
2747
2748 if let Some(chunk) = self.chunks.peek() {
2749 let chunk_start = self.range.start;
2750 let mut chunk_end = (self.chunks.offset() + chunk.len())
2751 .min(next_capture_start)
2752 .min(next_diagnostic_endpoint);
2753 let mut highlight_id = None;
2754 if let Some(highlights) = self.highlights.as_ref() {
2755 if let Some((parent_capture_end, parent_highlight_id)) = highlights.stack.last() {
2756 chunk_end = chunk_end.min(*parent_capture_end);
2757 highlight_id = Some(*parent_highlight_id);
2758 }
2759 }
2760
2761 let slice =
2762 &chunk[chunk_start - self.chunks.offset()..chunk_end - self.chunks.offset()];
2763 self.range.start = chunk_end;
2764 if self.range.start == self.chunks.offset() + chunk.len() {
2765 self.chunks.next().unwrap();
2766 }
2767
2768 Some(Chunk {
2769 text: slice,
2770 syntax_highlight_id: highlight_id,
2771 highlight_style: None,
2772 diagnostic_severity: self.current_diagnostic_severity(),
2773 is_unnecessary: self.current_code_is_unnecessary(),
2774 })
2775 } else {
2776 None
2777 }
2778 }
2779}
2780
2781impl operation_queue::Operation for Operation {
2782 fn lamport_timestamp(&self) -> clock::Lamport {
2783 match self {
2784 Operation::Buffer(_) => {
2785 unreachable!("buffer operations should never be deferred at this layer")
2786 }
2787 Operation::UpdateDiagnostics {
2788 lamport_timestamp, ..
2789 }
2790 | Operation::UpdateSelections {
2791 lamport_timestamp, ..
2792 }
2793 | Operation::UpdateCompletionTriggers {
2794 lamport_timestamp, ..
2795 } => *lamport_timestamp,
2796 }
2797 }
2798}
2799
2800impl Default for Diagnostic {
2801 fn default() -> Self {
2802 Self {
2803 code: None,
2804 severity: DiagnosticSeverity::ERROR,
2805 message: Default::default(),
2806 group_id: 0,
2807 is_primary: false,
2808 is_valid: true,
2809 is_disk_based: false,
2810 is_unnecessary: false,
2811 }
2812 }
2813}
2814
2815impl IndentSize {
2816 pub fn spaces(len: u32) -> Self {
2817 Self {
2818 len,
2819 kind: IndentKind::Space,
2820 }
2821 }
2822
2823 pub fn tab() -> Self {
2824 Self {
2825 len: 1,
2826 kind: IndentKind::Tab,
2827 }
2828 }
2829
2830 pub fn chars(&self) -> impl Iterator<Item = char> {
2831 iter::repeat(self.char()).take(self.len as usize)
2832 }
2833
2834 pub fn char(&self) -> char {
2835 match self.kind {
2836 IndentKind::Space => ' ',
2837 IndentKind::Tab => '\t',
2838 }
2839 }
2840
2841 pub fn with_delta(mut self, direction: Ordering, size: IndentSize) -> Self {
2842 match direction {
2843 Ordering::Less => {
2844 if self.kind == size.kind && self.len >= size.len {
2845 self.len -= size.len;
2846 }
2847 }
2848 Ordering::Equal => {}
2849 Ordering::Greater => {
2850 if self.len == 0 {
2851 self = size;
2852 } else if self.kind == size.kind {
2853 self.len += size.len;
2854 }
2855 }
2856 }
2857 self
2858 }
2859}
2860
2861impl Completion {
2862 pub fn sort_key(&self) -> (usize, &str) {
2863 let kind_key = match self.lsp_completion.kind {
2864 Some(lsp::CompletionItemKind::VARIABLE) => 0,
2865 _ => 1,
2866 };
2867 (kind_key, &self.label.text[self.label.filter_range.clone()])
2868 }
2869
2870 pub fn is_snippet(&self) -> bool {
2871 self.lsp_completion.insert_text_format == Some(lsp::InsertTextFormat::SNIPPET)
2872 }
2873}
2874
2875pub fn contiguous_ranges(
2876 values: impl Iterator<Item = u32>,
2877 max_len: usize,
2878) -> impl Iterator<Item = Range<u32>> {
2879 let mut values = values;
2880 let mut current_range: Option<Range<u32>> = None;
2881 std::iter::from_fn(move || loop {
2882 if let Some(value) = values.next() {
2883 if let Some(range) = &mut current_range {
2884 if value == range.end && range.len() < max_len {
2885 range.end += 1;
2886 continue;
2887 }
2888 }
2889
2890 let prev_range = current_range.clone();
2891 current_range = Some(value..(value + 1));
2892 if prev_range.is_some() {
2893 return prev_range;
2894 }
2895 } else {
2896 return current_range.take();
2897 }
2898 })
2899}
2900
2901pub fn char_kind(c: char) -> CharKind {
2902 if c.is_whitespace() {
2903 CharKind::Whitespace
2904 } else if c.is_alphanumeric() || c == '_' {
2905 CharKind::Word
2906 } else {
2907 CharKind::Punctuation
2908 }
2909}
2910
2911/// Find all of the ranges of whitespace that occur at the ends of lines
2912/// in the given rope.
2913///
2914/// This could also be done with a regex search, but this implementation
2915/// avoids copying text.
2916pub fn trailing_whitespace_ranges(rope: &Rope) -> Vec<Range<usize>> {
2917 let mut ranges = Vec::new();
2918
2919 let mut offset = 0;
2920 let mut prev_chunk_trailing_whitespace_range = 0..0;
2921 for chunk in rope.chunks() {
2922 let mut prev_line_trailing_whitespace_range = 0..0;
2923 for (i, line) in chunk.split('\n').enumerate() {
2924 let line_end_offset = offset + line.len();
2925 let trimmed_line_len = line.trim_end_matches(|c| matches!(c, ' ' | '\t')).len();
2926 let mut trailing_whitespace_range = (offset + trimmed_line_len)..line_end_offset;
2927
2928 if i == 0 && trimmed_line_len == 0 {
2929 trailing_whitespace_range.start = prev_chunk_trailing_whitespace_range.start;
2930 }
2931 if !prev_line_trailing_whitespace_range.is_empty() {
2932 ranges.push(prev_line_trailing_whitespace_range);
2933 }
2934
2935 offset = line_end_offset + 1;
2936 prev_line_trailing_whitespace_range = trailing_whitespace_range;
2937 }
2938
2939 offset -= 1;
2940 prev_chunk_trailing_whitespace_range = prev_line_trailing_whitespace_range;
2941 }
2942
2943 if !prev_chunk_trailing_whitespace_range.is_empty() {
2944 ranges.push(prev_chunk_trailing_whitespace_range);
2945 }
2946
2947 ranges
2948}