Restructure workflow step resolution and fix inserting newlines (#15720)

Release Notes:

- N/A

---------

Co-authored-by: Nathan <nathan@zed.dev>

crates/language/src/outline.rs

@@ -1,3 +1,4 @@
+use crate::{BufferSnapshot, Point, ToPoint};
 use fuzzy::{StringMatch, StringMatchCandidate};
 use gpui::{relative, AppContext, BackgroundExecutor, HighlightStyle, StyledText, TextStyle};
 use settings::Settings;
@@ -24,6 +25,27 @@ pub struct OutlineItem<T> {
     pub annotation_range: Option<Range<T>>,
 }
 
+impl<T: ToPoint> OutlineItem<T> {
+    /// Converts to an equivalent outline item, but with parameterized over Points.
+    pub fn to_point(&self, buffer: &BufferSnapshot) -> OutlineItem<Point> {
+        OutlineItem {
+            depth: self.depth,
+            range: self.range.start.to_point(buffer)..self.range.end.to_point(buffer),
+            text: self.text.clone(),
+            highlight_ranges: self.highlight_ranges.clone(),
+            name_ranges: self.name_ranges.clone(),
+            body_range: self
+                .body_range
+                .as_ref()
+                .map(|r| r.start.to_point(buffer)..r.end.to_point(buffer)),
+            annotation_range: self
+                .annotation_range
+                .as_ref()
+                .map(|r| r.start.to_point(buffer)..r.end.to_point(buffer)),
+        }
+    }
+}
+
 impl<T> Outline<T> {
     pub fn new(items: Vec<OutlineItem<T>>) -> Self {
         let mut candidates = Vec::new();
@@ -62,6 +84,16 @@ impl<T> Outline<T> {
         }
     }
 
+    /// Find the most similar symbol to the provided query according to the Jaro-Winkler distance measure.
+    pub fn find_most_similar(&self, query: &str) -> Option<&OutlineItem<T>> {
+        let candidate = self.path_candidates.iter().max_by(|a, b| {
+            strsim::jaro_winkler(&a.string, query)
+                .total_cmp(&strsim::jaro_winkler(&b.string, query))
+        })?;
+        Some(&self.items[candidate.id])
+    }
+
+    /// Find all outline symbols according to a longest subsequence match with the query, ordered descending by match score.
     pub async fn search(&self, query: &str, executor: BackgroundExecutor) -> Vec<StringMatch> {
         let query = query.trim_start();
         let is_path_query = query.contains(' ');