Apply suggestions from code review

Co-authored-by: A-Walrus <58790821+A-Walrus@users.noreply.github.com>

helix-core/src/selection.rs

@@ -164,7 +164,7 @@ impl Range {
     /// Map a range through a set of changes. Returns a new range representing
     /// the same position after the changes are applied. Note that this
     /// function runs in O(N) (N is number of changes) and can therefore
-    /// cause performance problems if run for a large number of rangs as the
+    /// cause performance problems if run for a large number of ranges as the
     /// complexity is then O(MN) (for multicuror M=N usually). Instead use
     /// [Selection::map] or [ChangeSet::update_positions] instead
     pub fn map(mut self, changes: &ChangeSet) -> Self {

helix-core/src/transaction.rs

@@ -326,7 +326,7 @@ impl ChangeSet {
         self.changes.is_empty() || self.changes == [Operation::Retain(self.len)]
     }
 
-    /// Map a *sorted* list of position through the changes.
+    /// Map a *sorted* list of positions through the changes.
     ///
     /// This is equivalent to updating each position with `map_pos`:
     ///
@@ -415,7 +415,7 @@ impl ChangeSet {
 
     /// Map a position through the changes.
     ///
-    /// `assoc` indicates which size to associate the position with. `Before` will keep the
+    /// `assoc` indicates which side to associate the position with. `Before` will keep the
     /// position close to the character before, and will place it before insertions over that
     /// range, or at that point. `After` will move it forward, placing it at the end of such
     /// insertions.